goconcurrentqueue
Go concurrent-safe, goroutine-safe, thread-safe queue (by enriquebris)
merkletree
A Merkle Tree implementation written in Go. (by cbergoon)
goconcurrentqueue | merkletree | |
---|---|---|
1 | 1 | |
365 | 476 | |
- | - | |
0.0 | 0.0 | |
about 1 year ago | 9 months ago | |
Go | Go | |
MIT License | 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.
goconcurrentqueue
Posts with mentions or reviews of goconcurrentqueue.
We have used some of these posts to build our list of alternatives
and similar projects.
-
FIFO queue: channels VS container/list
Hi u/l42st2, not exactly an answer to your question, but in case you don't want to create the queue from scratch, you are welcome to use : https://github.com/enriquebris/goconcurrentqueue
merkletree
Posts with mentions or reviews of merkletree.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-08-12.
-
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?
When comparing goconcurrentqueue and merkletree you can also consider the following projects:
go-geoindex - Go native library for fast point tracking and K-Nearest queries
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
gota - Gota: DataFrames and data wrangling in Go (Golang)
bit - Bitset data structure
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
fsm - Finite State Machine for Go
bloom - Bloom filters implemented in Go.
bitset - Go package implementing bitsets
go-mcache - Fast in-memory key:value store/cache with TTL
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
goconcurrentqueue vs go-geoindex
merkletree vs go-adaptive-radix-tree
goconcurrentqueue vs gota
merkletree vs bit
goconcurrentqueue vs gods
merkletree vs gods
goconcurrentqueue vs fsm
merkletree vs bloom
goconcurrentqueue vs bitset
merkletree vs go-mcache
goconcurrentqueue vs go-datastructures
merkletree vs cuckoofilter