pure golang btree
Generate datastructures for your types.
Bloom filters implemented in Go.
A go library providing clojure-like immutable data-structures and functional ways to interact with them
Persistent data structures for Go
d-left Counting Bloom Filter
A Lazy Concurrent List-Based Set Algorithm in Go
BitSet data structure in golang
an adaptive radix tree implementation in go
A data structure that allows fast search within an ordered sequence of elements
An implementation of the radix tree data structure (http://en.wikipedia.org/wiki/Radix_tree).
Go implemetation of cuckoo filters
A statically typed binary tree in Go without casts or reflection
Go package implementing an indexable ordered multimap
A simple Bloom Filter implementation in Go
A scalable bloom filter written in Go
RingBuffer for Go
last updated on 2016-11-26
Featuring the Go gopher created by Renée French