Go Data Structures

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

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

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

Gota: DataFrames and data wrangling in Go (Golang)

Finite State Machine for Go

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

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

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

Probabilistic data structures for processing continuous, unbounded streams.

Go package implementing bitsets

Cuckoo Filter: Practically Better Than Bloom

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

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

CLRS study. Codes are written with golang.

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

A Merkle Tree implementation written in Go.

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

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

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

Adaptive Radix Trees implemented in Go

DISCONTINUED. A small flexible merge library in go

DISCONTINUED. MA-FSA implementation with Minimal Perfect Hashing

Go implementation to calculate Levenshtein Distance.

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

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

A skip list implementation in Go

Simple dense bitmap index in Go with binary operators

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

A binary stream packer and unpacker

Bitset data structure

A highly optimized double-ended queue

Go implementation of C++ STL iterators and algorithms.

Bloom filters implemented in Go.

Integer Compression Libraries for Go

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

Cache Slow Database Queries

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

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

skiplist for golang

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

take bytes out of things easily ✨🍪

a thread-safe concurrent map for go

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

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

Go 1.18+ generic tuple

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

A Go type to prevent internal numeric IDs from being exposed to clients using HashIDs and JSON.

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

A prefix tree implementation in go

Finite State Machine package in Go

Pipelines using goroutines

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

Go implementation of Count-Min-Log

A Go implementation of the Elias-Fano encoding

2Q in-memory cache implementation.

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.

Python-like dictionaries for Go

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

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

Paralleling pipeline

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

golang persistent immutable treap sorted sets

Multi-String Pattern Matching Algorithm Using TrieNode

Merkle hash trees

Lazy iterator implementation for Golang

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

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

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

Disjoint Set data structure implementation in Go

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

Create HTML forms with your structs and interfaces.

Generic 2D array

Unrolled Linked List in pure Go

Levenshtein distance for golang

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

No description, website, or topics provided.

No description, website, or topics provided.

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