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 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)

Go package implementing Bloom filters

Probabilistic data structures for processing continuous, unbounded streams.

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

Go package implementing bitsets

Cuckoo Filter: Practically Better Than Bloom

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

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

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

CLRS study. Codes are written with golang.

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 Merkle Tree implementation written in Go.

A small flexible merge library in go

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

A skip list implementation in Go

MA-FSA implementation with Minimal Perfect Hashing

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

Adaptive Radix Trees implemented in Go

A binary stream packer and unpacker

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

Go implementation to calculate Levenshtein Distance.

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

Bloom filters implemented in Go.

Go implementation of C++ STL iterators and algorithms.

Bitset data structure

Simple dense bitmap index in Go with binary operators

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

skiplist for golang

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

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

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

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

Go implementation of Count-Min-Log

Pipelines using goroutines

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

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

A prefix tree implementation in go

A highly optimized double-ended queue

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

A Go implementation of the Elias-Fano encoding

Python-like dictionaries for Go

a thread-safe concurrent map for go

golang persistent immutable treap sorted sets

Multi-String Pattern Matching Algorithm Using TrieHashNode

Go 1.18 generic tuples

Finite State Machine package in Go

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

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

Paralleling pipeline

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.

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

Lazy iterator implementation for Golang

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

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

2Q in-memory cache implementation.

Disjoint Set data structure implementation in Go

Merkle hash trees

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

Create HTML forms with your structs and interfaces.

Levenshtein distance for golang

No description, website, or topics provided.

Unrolled Linked List in pure Go

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

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