Go package that provides an implementation of a Bloom filter
-
Updated
Feb 21, 2024 - Go
Go package that provides an implementation of a Bloom filter
Generic and iterable bit flags in Go
Go Bitset: benchmarks, examples, analysis
Bitset implementation in Go
Package bitset provides Set, a compact and fast representation for a dense set of positive integer values.
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
Bitset library provides implementation for all int/uint types and arrays and maps
Build your own Game-Engine based on the Entity Component System concept in Golang.
Add a description, image, and links to the bitset topic page so that developers can more easily learn about it.
To associate your repository with the bitset topic, visit your repo's landing page and select "manage topics."