| Deque | bitset | |
|---|---|---|
| 2 | 1 | |
| 49 | 1,263 | |
| - | 0.7% | |
| 10.0 | 6.2 | |
| over 9 years ago | 3 days ago | |
| C# | Go | |
| MIT License | BSD 3-clause "New" or "Revised" 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.
Deque
-
Stack/Queue where you can remove items from both ends?
Be careful with that Deque implementation. It's several years old and a bug I found in 2015 hasn't been fixed: https://github.com/tejacques/Deque/issues/8
bitset
-
I have some questions about defining a series of bits in Golang
For (3), and if you’re interested in checking if specific bits are set or not, take a look at https://github.com/bits-and-blooms/bitset and https://github.com/RoaringBitmap/roaring.
What are some alternatives?
CircularBuffer-CSharp - A simple, single file, implementation of a circular buffer in C#.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
nutsdb - A simple, fast, embeddable, persistent key/value store written in pure Go. It supports fully serializable transactions and many data structures such as list, set, sorted set.
Bloomfilter
levenshtein - Go implementation to calculate Levenshtein Distance.
bitmap - Simple dense bitmap index in Go with binary operators
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
binpacker - A binary stream packer and unpacker