FourBytesStorage
bitset
FourBytesStorage | bitset | |
---|---|---|
- | 1 | |
0 | 1,263 | |
- | 0.7% | |
1.8 | 6.2 | |
about 3 years ago | 2 days ago | |
Go | Go | |
GNU General Public License v3.0 only | 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.
FourBytesStorage
We haven't tracked posts mentioning FourBytesStorage yet.
Tracking mentions began in Dec 2020.
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?
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
go-geoindex - Go native library for fast point tracking and K-Nearest queries
Bloomfilter
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
levenshtein - Go implementation to calculate Levenshtein Distance.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
bitmap - Simple dense bitmap index in Go with binary operators
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom