Go Data Structures

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers

Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog

☔️ A complete Go cache library that brings you multiple ways of managing your caches

DISCONTINUED. An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]

Go package implementing bitsets

Cache Slow Database Queries

take bytes out of things easily ✨🍪

Lazy iterator implementation for Golang

Data structure and algorithm library for go, designed to provide functions similar to C++ STL

A thread safe map which has expiring key-value pairs.

Go concurrent-safe, goroutine-safe, thread-safe queue

Functions that operate on slices. Similar to functions from package strings or package bytes that have been adapted to work with slices.

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

Adaptive Radix Trees implemented in Go

Cuckoo Filter: Practically Better Than Bloom

Go implementation to calculate Levenshtein Distance.

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go

Package ring provides a high performance and thread safe Go implementation of a bloom filter.

Python-like dictionaries for Go

a thread-safe concurrent map for go

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

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

A highly optimized double-ended queue

A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.

Set is a useful collection but there is no built-in implementation in Go lang.

A prefix tree implementation in go

Fast in-memory key:value store/cache with TTL

Probabilistic data structures for processing continuous, unbounded streams.

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

golang persistent immutable treap sorted sets

Go implementation of C++ STL iterators and algorithms.

Gota: DataFrames and data wrangling in Go (Golang)

Levenshtein distance for golang

Go native library for fast point tracking and K-Nearest queries

Bloom filters implemented in Go.

Go implementation of Count-Min-Log

Integer Compression Libraries for Go

A collection of useful, performant, and threadsafe Go datastructures.

A binary stream packer and unpacker

A skip list implementation in Go

DISCONTINUED. MA-FSA implementation with Minimal Perfect Hashing

skiplist for golang

Go package implementing Bloom filters, used by Milvus and Beego.

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

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

Bitset data structure

A Merkle Tree implementation written in Go.

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom

A Go implementation of the Elias-Fano encoding

Create HTML forms with your structs and interfaces.

A small flexible merge library in go

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

Multi-String Pattern Matching Algorithm Using TrieNode

CLRS study. Codes are written with golang.

Pipelines using goroutines

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

fractional api base on golang . golang math tools fractional molecular denominator 分数计算 分子 分母 运算

Unrolled Linked List in pure Go

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化

Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a channel in the order of input. It is useful in concurrently processing items in a queue, and get output in the order provided by the queue.

No description, website, or topics provided.

Disjoint Set data structure implementation in Go

Paralleling pipeline

Simple dense bitmap index in Go with binary operators

Merkle hash trees

Finite State Machine for Go

gdcache is a pure non-intrusive cache library implemented by golang, you can use it to implement your own cache.

Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.

Finite State Machine package in Go

A Kafka log inspired in-memory and append-only data structure

Fast, zero-allocation, lexicographic-order-preserving packing/unpacking of native Go types to bytes.

Generic sorted map for Go with red-black tree under the hood

2Q in-memory cache implementation.

Go 1.18+ generic tuple

Generic, zero-alloc, 100%-test covered Quadtree for golang

Generic 2D array