Go Data Structures

GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON

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

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

Gota: DataFrames and data wrangling in Go (Golang)

Probabilistic data structures for processing continuous, unbounded streams.

Roaring bitmaps in Go (golang)

Go package implementing Bloom filters

☔️ 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.

CLRS study. Codes are written with golang.

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

A small flexible merge library in go

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

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

A Merkle Tree implementation written in Go.

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

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

Adaptive Radix Trees implemented in Go

A binary stream packer and unpacker

Bloom filters implemented in Go.

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

Go implementation of C++ STL iterators and algorithms.

Go implementation to calculate Levenshtein Distance.

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

Bitset data structure

Integer Compression Libraries for Go

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

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

skiplist for golang

Cache Slow Database Queries

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 ✨🍪

Go implementation of Count-Min-Log

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.

A prefix tree implementation in go

Pipelines using goroutines

A thread safe map which has expiring key-value pairs

A highly optimized double-ended queue

A Go implementation of the Elias-Fano encoding

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

Multi-String Pattern Matching Algorithm Using TrieHashNode

Python-like dictionaries for Go

golang persistent immutable treap sorted sets

a thread-safe concurrent map for go

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

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

Create HTML forms with your structs and interfaces.

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

Lazy iterator implementation for Golang

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

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.

Disjoint Set data structure implementation in Go.

FIFO Pipeline which parallels execution on each stage while maintaining the order of messages and results.