merkletree
gods
| merkletree | gods | |
|---|---|---|
| 1 | 9 | |
| 475 | 15,454 | |
| - | - | |
| 0.0 | 2.8 | |
| 9 months ago | 21 days ago | |
| Go | Go | |
| MIT License | 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.
merkletree
-
High-Performance Merkle Tree Implementation in Go
So unlike some other implementations, when building a new Merkle Tree, my program only constructs the leaf node proofs and finally generates the Merkle root rather than caching the tree itself. With this optimization, my program can run much faster than the most started similar library on GitHub: cbergoon/merkletree. I improve the performance better by parallelization with goroutines.
gods
-
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
What are some alternatives?
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
bit - Bitset data structure
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
bloom - Bloom filters implemented in Go.
gomarkdoc - Generate markdown documentation for Go (golang) code
go-mcache - Fast in-memory key:value store/cache with TTL
gota - Gota: DataFrames and data wrangling in Go (Golang)
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
levenshtein - Go implementation to calculate Levenshtein Distance.
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
encoding - Integer Compression Libraries for Go