ptrie
bitset
| ptrie | bitset | |
|---|---|---|
| - | 1 | |
| 38 | 1,263 | |
| - | 0.6% | |
| 4.5 | 6.2 | |
| 27 days ago | about 13 hours ago | |
| Go | Go | |
| Apache License 2.0 | 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.
ptrie
We haven't tracked posts mentioning ptrie 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?
conjungo - A small flexible merge library in go
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
go-mcache - Fast in-memory key:value store/cache with TTL
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
Bloomfilter
go-geoindex - Go native library for fast point tracking and K-Nearest queries
levenshtein - Go implementation to calculate Levenshtein Distance.
fsm - Finite State Machine for Go
bitmap - Simple dense bitmap index in Go with binary operators
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom