From cadbc5fa42409c160d89e88bcc76e2e2d105ff86 Mon Sep 17 00:00:00 2001 From: Pavel Larkin Date: Tue, 12 Apr 2016 12:58:50 -0400 Subject: [PATCH] Add data structure: adaptive radix tree --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 06e025c1..7777e46a 100644 --- a/README.md +++ b/README.md @@ -204,6 +204,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [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. * [encoding](https://github.com/zhenjl/encoding) - Integer Compression Libraries for Go. +* [go-adaptive-radix-tree](https://github.com/plar/go-adaptive-radix-tree) - A Go implementation of Adaptive Radix Tree. * [go-datastructures](https://github.com/Workiva/go-datastructures) - a collection of useful, performant, and thread-safe data structures * [go-geoindex](https://github.com/hailocab/go-geoindex) - In-memory geo index. * [golang-set](https://github.com/deckarep/golang-set) - Thread-Safe and Non-Thread-Safe high-performance sets for Go.