Popularity
6.4
Stable
Activity
6.1
Stable
406
26
77
Programming language: Go
Tags:
Data Structures
bitset alternatives and similar packages
Based on the "Data Structures" category
-
hyperloglog
HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction. -
gocache
A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more. -
merkletree
Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
count-min-log
A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory). -
remember-go
A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory). -
blooming-bella
A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
Do you think we are missing an alternative of bitset or a related project?