mirror of
https://github.com/avelino/awesome-go.git
synced 2024-11-07 16:33:40 +00:00
commit
651b4c7fc7
@ -227,6 +227,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a
|
|||||||
* [binpacker](https://github.com/zhuangsirui/binpacker) - Binary packer and unpacker helps user build custom binary stream.
|
* [binpacker](https://github.com/zhuangsirui/binpacker) - Binary packer and unpacker helps user build custom binary stream.
|
||||||
* [bitset](https://github.com/willf/bitset) - Go package implementing bitsets.
|
* [bitset](https://github.com/willf/bitset) - Go package implementing bitsets.
|
||||||
* [bloom](https://github.com/zhenjl/bloom) - Bloom filters implemented in Go.
|
* [bloom](https://github.com/zhenjl/bloom) - Bloom filters implemented in Go.
|
||||||
|
* [bloom](https://github.com/yourbasic/bloom) - Golang Bloom filter implementation.
|
||||||
* [boomfilters](https://github.com/tylertreat/BoomFilters) - Probabilistic data structures for processing continuous, unbounded streams
|
* [boomfilters](https://github.com/tylertreat/BoomFilters) - Probabilistic data structures for processing continuous, unbounded streams
|
||||||
* [count-min-log](https://github.com/seiflotfy/count-min-log) - A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).
|
* [count-min-log](https://github.com/seiflotfy/count-min-log) - A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).
|
||||||
* [cuckoofilter](https://github.com/seiflotfy/cuckoofilter) - Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.
|
* [cuckoofilter](https://github.com/seiflotfy/cuckoofilter) - Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.
|
||||||
|
Loading…
Reference in New Issue
Block a user