gods
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more (by emirpasic)
go-adaptive-radix-tree
Adaptive Radix Trees implemented in Go (by plar)
Our great sponsors
| gods | go-adaptive-radix-tree | |
|---|---|---|
| 9 | - | |
| 15,385 | 337 | |
| - | - | |
| 3.1 | 0.0 | |
| 13 days ago | 15 days ago | |
| Go | Go | |
| GNU General Public License v3.0 or later | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
gods
Posts with mentions or reviews of gods.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-01-05.
-
How do you go about the lack of built in data structure like stack, queue for LeetCode
for len(stack) > 0 { n := len(stack) - 1 // Top element fmt.Print(stack[n]) stack = stack[:n] // Pop } ``` Another solution would be to import a package like https://github.com/emirpasic/gods
-
Go Structures - Custom made generic data structures for Golang
What is the goal of this project? A learning exercise? There are many fairly matured solutions already available like https://github.com/emirpasic/gods. It also does not look implemented effectively. For example Stack uses for its push/pop operations costly List methods.
- Golang & Data Structures
-
Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)
Doesn't say why it's here instead of trying to get into GoDS or something else.
-
Are there implementations of data structures with generics? Are they needed?
I've found GoDS (https://github.com/emirpasic/gods) but it is not using generics, it's using "interface{}" as a type for everything.
- Gods Go Data Structures
- Experimental generic implementations of various data structures (map, b-tree, AVL tree, rope, and more)
-
Have you used a trie in Go?
You may want to try this implementation
go-adaptive-radix-tree
Posts with mentions or reviews of go-adaptive-radix-tree.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning go-adaptive-radix-tree yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing gods and go-adaptive-radix-tree you can also consider the following projects:
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota - Gota: DataFrames and data wrangling in Go (Golang)
gomarkdoc - Generate markdown documentation for Go (golang) code
bitmap - Simple dense bitmap index in Go with binary operators
bloom - Bloom filters implemented in Go.
levenshtein - Go implementation to calculate Levenshtein Distance.
bitset - Go package implementing bitsets
encoding - Integer Compression Libraries for Go
gods vs go-datastructures
go-adaptive-radix-tree vs golang-set
gods vs golang-set
go-adaptive-radix-tree vs gota
gods vs gomarkdoc
go-adaptive-radix-tree vs bitmap
gods vs gota
go-adaptive-radix-tree vs bloom
gods vs levenshtein
go-adaptive-radix-tree vs bitset
gods vs encoding
go-adaptive-radix-tree vs levenshtein