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

probabilistic data structures for processing continuous, unbounded streams

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

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

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

Go package implementing Bloom filters.

Go package implementing compressed bitsets.

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

A skip list implementation in Go.

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

Bloom filters implemented in Go.

Integer Compression Libraries for Go.

Binary packer and unpacker helps user build custom binary stream.

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

Region quadtrees with efficient point location and neighbour finding.

Skiplist implementation in Go

A small, powerful and flexible merge library.

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

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

A Go implementation of Adaptive Radix Tree.

Golang set data structure with bonus bit-twiddling functions.

Implmentation to calculate levenshtein distance in Go.

A useful Set collection implementation for Go.

A Go implementation of the Elias-Fano encoding.

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

Create HTML forms with your structs and interfaces.