Go-lang Data Structures
Back
Algorithms and data structures.CLRS study.Binary packer and unpacker helps user build custom binary stream.Golang set data structure with bonus bit-twiddling functions.Dense, zero-allocation, SIMD-enabled bitmap/bitset in Go.Go package implementing bitsets.Golang Bloom filter implementation.Yet another Bloomfilter implementation in Go, compatible with Java's Guava library.Probabilistic data structures for processing continuous, unbounded streams.a thread-safe concurrent map for go, support using `interface{}` as key and auto scale up shards.Highly concurrent drop-in replacement for `bufio.Writer`.A small, powerful and flexible merge library.Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).Go package implementing buffers for handling various datatypes easily.Cuckoo filter: a comprehensive cuckoo filter, which is configurable and space optimized compared with other implements, and all features mentioned in original paper is available.Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.Fast ring-buffer deque (double-ended queue).Python-like dictionaries (dict) for Go.Disjoint Set data structure implementation in Go.Integer Compression Libraries for Go.Finite-State Machine package.A pure non-intrusive cache library implemented by golang, you can use it to implement your own distributed cache.Go implementation of Adaptive Radix Tree.Collection of useful, performant, and thread-safe data structures.Go string comparison and edit distance algorithms library (Levenshtein, LCS, Hamming, Damerau levenshtein, Jaro-Winkler, etc.) compatible with Unicode.A Go implementation of the Elias-Fano encoding.In-memory geo index.Fast in-memory key:value store/cache library. Pointer caches.Region quadtrees with efficient point location and neighbour finding.A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more.Concurrent FIFO queue.Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.fractional api for Go.Thread-Safe and Non-Thread-Safe high-performance sets for Go.A useful Set collection implementation for Go.Skip list implementation in Go.Data structure and algorithm library for go, designed to provide functions similar to C++ STL.Implementation of dataframes, series, and data wrangling methods for Go.Iterator implementation to provide map and reduce functionalities.Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.ID type with marshalling to/from hash to prevent sending IDs to clients.Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction.Go implementation of C++ STL iterators and algorithms.Implementation to calculate levenshtein distance in Go.Space-efficient computation of Merkle root hashes and inclusion proofs.Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.Multi-String Pattern Matching Algorithm for information retrieval.Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers.Nullable Go types that can be marshalled/unmarshalled to/from JSON.Go module that processes work concurrently and returns output in a channel in the order of input.FIFO Pipeline which parallels execution on each stage while maintaining the order of messages and results.Tools for parse JSON-like logs for collecting unique fields and events.An implementation of pipelines with fan-in and fan-out.An implementation of prefix tree.A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory).Go implementation of a high performance, thread safe bloom filter.Go package implementing compressed bitsets.Simple set data structure implementation in Go using LinkedHashMap.Skiplist implementation in Go.Functions that operate on slices; like `package strings` but adapted to work with slices.Map with expiring key-value pairs.Persistent, fast ordered map using tree heaps.Trie implementation in Go.In-memory string-interface{} cache with various time-based expiration options and callbacks.Null Types, Safe primitive type conversion and fetching value from complex structures.Go package implementing Bloom filters.