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.

Gota: DataFrames and data wrangling in Go (Golang)

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

Finite State Machine for Go

Go package implementing Bloom filters

Roaring bitmaps in Go (golang)

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

Probabilistic data structures for processing continuous, unbounded streams.

Go package implementing bitsets

Cuckoo Filter: Practically Better Than Bloom

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)

CLRS study. Codes are written with golang.

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

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

A Merkle Tree implementation written in Go.

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

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

A small flexible merge library 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.

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

MA-FSA implementation with Minimal Perfect Hashing

Adaptive Radix Trees implemented in Go

Go implementation to calculate Levenshtein Distance.

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

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

A binary stream packer and unpacker

Simple dense bitmap index in Go with binary operators

Go implementation of C++ STL iterators and algorithms.

Bitset data structure

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

skiplist for golang

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

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

A highly optimized double-ended queue

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

take bytes out of things easily ✨🍪

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

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

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

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

Go implementation of Count-Min-Log

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

A prefix tree implementation in go

Pipelines using goroutines

a thread-safe concurrent map for go

Go 1.18 generic tuples

Python-like dictionaries for Go

Finite State Machine package in Go

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

A Go implementation of the Elias-Fano encoding

golang persistent immutable treap sorted sets

Multi-String Pattern Matching Algorithm Using TrieHashNode

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

2Q in-memory cache implementation.

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

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.

Paralleling pipeline

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

Lazy iterator implementation for Golang

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

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

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

Merkle hash trees

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

Disjoint Set data structure implementation in Go

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

Levenshtein distance for golang

Create HTML forms with your structs and interfaces.

Unrolled Linked List in pure Go

No description, website, or topics provided.

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