mirror of
https://github.com/avelino/awesome-go.git
synced 2024-11-07 16:33:40 +00:00
Add concurrent-writer to Data Structures. (#1591)
This commit is contained in:
parent
914c1cad22
commit
2389c4f1b0
@ -232,6 +232,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a
|
|||||||
* [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.
|
* [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.
|
||||||
|
* [concurrent-writer](https://github.com/alin-sinpalean/concurrent-writer) - Highly concurrent drop-in replacement for `bufio.Writer`.
|
||||||
* [count-min-log](https://github.com/seiflotfy/count-min-log) - 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) - 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.
|
||||||
* [encoding](https://github.com/zhenjl/encoding) - Integer Compression Libraries for Go.
|
* [encoding](https://github.com/zhenjl/encoding) - Integer Compression Libraries for Go.
|
||||||
|
Loading…
Reference in New Issue
Block a user