ordered-concurrently
merkletree
| ordered-concurrently | merkletree | |
|---|---|---|
| 3 | 1 | |
| 37 | 474 | |
| - | - | |
| 1.3 | 0.0 | |
| about 1 year ago | 8 months ago | |
| Go | Go | |
| BSD 3-clause "New" or "Revised" 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.
ordered-concurrently
-
ordered-concurrently v2 release
V2 of https://github.com/tejzpr/ordered-concurrently has been released with big fixes and optimizations, thanks to awesome feedback from the community. Many thanks in advance for posting any issues to improve the project.
-
Ordered Concurrently v1.0-beta.1 - A GO module that processes work concurrently and returns output in a predefined order released
Why is i passed in here?
-
Concurrent processing with ordered output using goroutine pools
Released as a module tejzpr/ordered-concurrently: A go module that processes work concurrently and returns output in a predefined order (github.com)
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?
bloom - Bloom filters implemented in Go.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
bit - Bitset data structure
goset - Set is a useful collection but there is no built-in implementation in Go lang.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-geoindex - Go native library for fast point tracking and K-Nearest queries
binpacker - A binary stream packer and unpacker
go-mcache - Fast in-memory key:value store/cache with TTL
go-left-right - A faster RWLock primitive in Go, 2-3 times faster than RWMutex. A Go implementation of concurrency control algorithm in paper <Left-Right - A Concurrency Control Technique with Wait-Free Population Oblivious Reads>
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom