From ddb966326f8ec9c9b19167807008d5255ef9ba7f Mon Sep 17 00:00:00 2001 From: lrita Date: Tue, 21 Jul 2020 04:55:02 +0800 Subject: [PATCH] add cmap in datastructure (#3171) --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 401c2f79..f5d27518 100644 --- a/README.md +++ b/README.md @@ -351,6 +351,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/yourbasic/bloom) - Golang Bloom filter implementation. * [boomfilters](https://github.com/tylertreat/BoomFilters) - Probabilistic data structures for processing continuous, unbounded streams. +* [cmap](https://github.com/lrita/cmap) - a thread-safe concurrent map for go, support using `interface{}` as key and auto scale up shards. * [concurrent-writer](https://github.com/free/concurrent-writer) - Highly concurrent drop-in replacement for `bufio.Writer`. * [conjungo](https://github.com/InVisionApp/conjungo) - A small, powerful and flexible merge library. * [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).