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

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

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

probabilistic data structures for processing continuous, unbounded streams

Go package implementing Bloom filters.

Go package implementing compressed bitsets.

Trie implementation in Go

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

Go package implementing bitsets.

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

In-memory geo index.

Algorithms and data structures.CLRS study.

A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more.

A skip list implementation in Go.

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

MA-FSA implementation with Minimal Perfect Hashing

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

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

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

Bloom filters implemented in Go.

A small, powerful and flexible merge library.

Binary packer and unpacker helps user build custom binary stream.

Go implementation of a high performance, thread safe bloom filter.

Golang set data structure with bonus bit-twiddling functions.

Integer Compression Libraries for Go.

Region quadtrees with efficient point location and neighbour finding.

Skiplist implementation in Go

A Go implementation of Adaptive Radix Tree.

Simple set data structure implementation in Go using LinkedHashMap.

Concurrent FIFO queue.

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

Implmentation to calculate levenshtein distance in Go.

A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory).

Go package implementing buffers for handling various datatypes easily.

A useful Set collection implementation for Go.

An implementation of prefix tree.

An implementation of pipelines with fan-in and fan-out.

ID type with marshalling to/from hash to prevent sending IDs to clients.

Multi-String Pattern Matching Algorithm for information retrieval.

A Go implementation of the Elias-Fano encoding.

A highly optimized double-ended queue.

Nullable Go types that can be marshalled/unmarshalled to/from JSON.

Python-like dictionaries (dict) for Go.

Map with expiring key-value pairs.

Tools for parse JSON-like logs for collecting unique fields and events.

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

Create HTML forms with your structs and interfaces.