treap
merkletree
Our great sponsors
| treap | merkletree | |
|---|---|---|
| - | 1 | |
| 26 | 474 | |
| - | - | |
| 0.0 | 0.0 | |
| over 4 years ago | 8 months ago | |
| Go | Go | |
| MIT License | MIT License |
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.
treap
We haven't tracked posts mentioning treap yet.
Tracking mentions began in Dec 2020.
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.
What are some alternatives?
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
go-geoindex - Go native library for fast point tracking and K-Nearest queries
bit - Bitset data structure
fsm - Finite State Machine for Go
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
algorithms - CLRS study. Codes are written with golang.
bloom - Bloom filters implemented in Go.
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
go-mcache - Fast in-memory key:value store/cache with TTL
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom