Go Data Structures

Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.

a collection of useful, performant, and thread-safe data structures

Thread-Safe and Non-Thread-Safe high-performance sets for Go.

probabilistic data structures for processing continuous, unbounded streams

An implementation of dataframes, series, and data wrangling methods for Go.

Go package implementing Bloom filters.

Go package implementing compressed bitsets.

HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction.

Go package implementing bitsets.

In-memory geo index.

Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.

Trie implementation in Go

MA-FSA implementation with Minimal Perfect Hashing

Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go

A skip list implementation in Go.

Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.

Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.

An in-memory LRU string-interface{} map with expiration for golang

Binary packer and unpacker helps user build custom binary stream.

Bloom filters implemented in Go.

A small, powerful and flexible merge library.

Integer Compression Libraries for Go.

Skiplist implementation in Go

Region quadtrees with efficient point location and neighbour finding.

A Go implementation of Adaptive Radix Tree.

Implmentation to calculate levenshtein distance in Go.

A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).

Golang set data structure with bonus bit-twiddling functions.

A useful Set collection implementation for Go.

A Go implementation of the Elias-Fano encoding.

Create HTML forms with your structs and interfaces.

A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.