Add remember-go (#2732)

* Added remember-go

* Add dot
This commit is contained in:
pj 2019-09-29 21:47:04 +10:00 committed by Avelino
parent ab9f870b4b
commit fd5e17d043

View File

@ -360,6 +360,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a
* [parsefields](https://github.com/MonaxGT/parsefields) - Tools for parse JSON-like logs for collecting unique fields and events. * [parsefields](https://github.com/MonaxGT/parsefields) - Tools for parse JSON-like logs for collecting unique fields and events.
* [pipeline](https://github.com/hyfather/pipeline) - An implementation of pipelines with fan-in and fan-out. * [pipeline](https://github.com/hyfather/pipeline) - An implementation of pipelines with fan-in and fan-out.
* [ptrie](https://github.com/viant/ptrie) - An implementation of prefix tree. * [ptrie](https://github.com/viant/ptrie) - An implementation of prefix tree.
* [remember-go](https://github.com/rocketlaunchr/remember-go) - A universal interface for caching data (redis, memory, memcached etc).
* [ring](https://github.com/TheTannerRyan/ring) - Go implementation of a high performance, thread safe bloom filter. * [ring](https://github.com/TheTannerRyan/ring) - Go implementation of a high performance, thread safe bloom filter.
* [roaring](https://github.com/RoaringBitmap/roaring) - Go package implementing compressed bitsets. * [roaring](https://github.com/RoaringBitmap/roaring) - Go package implementing compressed bitsets.
* [set](https://github.com/StudioSol/set) - Simple set data structure implementation in Go using LinkedHashMap. * [set](https://github.com/StudioSol/set) - Simple set data structure implementation in Go using LinkedHashMap.