go-datastructures
golang-set
| go-datastructures | golang-set | |
|---|---|---|
| 2 | 6 | |
| 7,693 | 4,242 | |
| 0.4% | - | |
| 7.3 | 3.7 | |
| 7 months ago | 2 days ago | |
| Go | Go | |
| Apache License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
go-datastructures
-
Golang & Data Structures
https://github.com/TheAlgorithms/Go https://github.com/Workiva/go-datastructures https://github.com/ua-nick/Data-Structures-and-Algorithms
- Experimental generic implementations of various data structures (map, b-tree, AVL tree, rope, and more)
golang-set
-
Is there something similar to blessed.rs ?
If it were true, there wouldn't be any 3rd-party libs for Go and everybody used just the stdlib. For instance, if you need a set, you can use https://github.com/deckarep/golang-set . Of course, you can do it with the stdlib with map, but if you don't want to do that, use golang-set . I think Python has a much larger stdlib and yet, Python has tons of 3rd-party packages.
-
Any major projects using generics?
golang-set is a set implementation used by docker, ethereum and others. 2.8k stars on GitHub. Pretty popular project. Not sure if it counts as major. https://github.com/deckarep/golang-set
- When will Go get sets?
-
Does anyone else get tired of the "that's trivial to implement" excuse for leaving things out of the standard library?
Why not look at something like https://github.com/deckarep/golang-set ?
-
Go 1.18 Released
It depends on the level of abstraction you're addressing. One level may be "i need to store things with a quick search function", another may be "i need a storage of ordered names and expiry date for things", etc until you get to "I need a binary tree which orders by comparable types".
Where you split that process as a separate library you either decide to write or reuse - that becomes the problem to solve. A set implementation may be a problem to solve: https://github.com/deckarep/golang-set A btree may be a problem to solve: https://gitlab.com/cznic/b/-/tree/master/v2
-
Major update to the golang-set repo now supporting generics syntax for Go 1.18beta1 release
This pre-release only exists on the generics branch at: https://github.com/deckarep/golang-set/tree/generics. Eventually this release would be tagged with a 2.0 release tag name.
What are some alternatives?
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
gota - Gota: DataFrames and data wrangling in Go (Golang)
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
mafsa
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
algorithms - CLRS study. Codes are written with golang.
bitset - Go package implementing bitsets