10

8

6

4

2


9.7

9.0

8.6

7.3

8.5

3.5

8.3
1.1

8.1

6.8

75 Data Structures packages and projects

  • gods

    9.7 9.0 Go
    GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
  • go-datastructures

    9.5 0.0 Go
    A collection of useful, performant, and threadsafe Go datastructures.
  • SonarLint is a free and open source IDE extension that identifies and catches bugs and vulnerabilities as you code, directly in the IDE. Install from your favorite IDE marketplace today.
  • golang-set

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

    8.5 3.5 Go
    Gota: DataFrames and data wrangling in Go (Golang)
  • FSM for Go

    8.3 1.1 Go
    Finite State Machine for Go
  • roaring

    8.1 6.8 Go
    Roaring bitmaps in Go (golang)
  • willf/bloom

    8.1 3.8 Go
    Go package implementing Bloom filters
  • boomfilters

    7.9 0.0 Go
    Probabilistic data structures for processing continuous, unbounded streams.
  • gocache

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

    7.6 4.8 Go
    Go package implementing bitsets
  • cuckoofilter

    7.4 2.1 Go
    Cuckoo Filter: Practically Better Than Bloom
  • hyperloglog

    7.2 3.0 Go
    HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)
  • trie

    7.1 0.0 Go
    Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
  • gostl

    7.1 3.0 Go
    Data structure and algorithm library for go, designed to provide functions similar to C++ STL
  • algorithms

    7.1 0.0 Go
    CLRS study. Codes are written with golang.
  • go-geoindex

    6.6 0.0 Go
    Go native library for fast point tracking and K-Nearest queries
  • ttlcache

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

    6.4 0.0 Go
    A Merkle Tree implementation written in Go.
  • conjungo

    6.2 0.0 Go
    A small flexible merge library in go
  • Bloomfilter

    6.0 0.0 Go
    Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
  • goskiplist

    6.0 0.0 Go
    A skip list implementation in Go
  • mafsa

    6.0 0.0 Go
    MA-FSA implementation with Minimal Perfect Hashing
  • hilbert

    5.9 0.0 Go
    Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
  • go-adaptive-radix-tree

    5.7 0.3 Go
    Adaptive Radix Trees implemented in Go
  • binpacker

    5.5 0.6 Go
    A binary stream packer and unpacker
  • cuckoo-filter

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

    5.2 0.0 Go
    Go implementation to calculate Levenshtein Distance.
  • goconcurrentqueue

    5.1 4.2 Go
    Go concurrent-safe, goroutine-safe, thread-safe queue
  • bloom

    4.9 0.0 Go
    Bloom filters implemented in Go.
  • iter

    4.9 7.1 Go
    Go implementation of C++ STL iterators and algorithms.
  • bit

    4.8 0.0 Go
    Bitset data structure
  • bitmap

    4.8 5.5 Go
    Simple dense bitmap index in Go with binary operators
  • encoding

    4.7 0.0 Go
    Integer Compression Libraries for Go
  • ring

    4.5 0.0 Go
    Package ring provides a high performance and thread safe Go implementation of a bloom filter.
  • remember-go

    4.4 0.0 Go
    Cache Slow Database Queries
  • go-rquad

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

    4.3 0.0 Go
    skiplist for golang
  • go-mcache

    4.1 0.0 Go
    Fast in-memory key:value store/cache with TTL
  • set

    3.9 1.1 Go
    A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
  • crunch

    3.6 5.0 Go
    take bytes out of things easily ✨🍪
  • nan

    3.3 5.0 Go
    Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
  • goset

    3.3 0.0 Go
    Set is a useful collection but there is no built-in implementation in Go lang.
  • hide

    3.2 0.0 Go
    ID type with marshalling to/from hash to prevent sending IDs to clients.
  • count-min-log

    3.2 0.0 Go
    Go implementation of Count-Min-Log
  • pipeline

    3.0 0.0 Go
    Pipelines using goroutines
  • memlog

    2.9 6.5 Go
    A Kafka log inspired in-memory and append-only data structure
  • timedmap

    2.9 2.2 Go
    A thread safe map which has expiring key-value pairs.
  • ptrie

    2.7 0.0 Go
    A prefix tree implementation in go
  • deque

    2.7 0.0 Go
    A highly optimized double-ended queue
  • null

    2.3 0.0 Go
    Nullable Go types that can be marshalled/unmarshalled to/from JSON.
  • go-ef

    2.3 0.0 Go
    A Go implementation of the Elias-Fano encoding
  • dict

    2.2 0.6 Go
    Python-like dictionaries for Go
  • cmap

    2.1 0.0 Go
    a thread-safe concurrent map for go
  • treap

    2.1 0.0 Go
    golang persistent immutable treap sorted sets
  • mspm

    2.0 0.0 Go
    Multi-String Pattern Matching Algorithm Using TrieHashNode
  • go-tuple

    1.7 6.4 Go
    Go 1.18 generic tuples
  • fsm

    1.7 4.3 Go
    Finite State Machine package in Go
  • treemap

    1.7 4.2 Go
    Generic sorted map for Go with red-black tree under the hood
  • gofal

    1.6 0.0 Go
    fractional api base on golang . golang math tools fractional molecular denominator 分数计算 分子 分母 运算
  • parapipe

    1.5 0.0 Go
    Paralleling pipeline
  • ordered-concurrently

    1.3 2.5 Go
    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.
  • slices

    1.3 1.1 Go
    Functions that operate on slices. Similar to functions from package strings or package bytes that have been adapted to work with slices.
  • goterator

    1.1 0.0 Go
    Lazy iterator implementation for Golang
  • gdcache

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

    0.9 0.0 Go
    Tools for parse JSON-like logs for collecting unique fields and events
  • 2q

    0.9 6.3 Go
    2Q in-memory cache implementation.
  • dsu

    0.8 4.6 Go
    Disjoint Set data structure implementation in Go
  • merkle

    0.7 2.5 Go
    Merkle hash trees
  • bingo

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

    0.4 0.0 Go
    Create HTML forms with your structs and interfaces.
  • golang levenshtein

    0.4 0.0 Go
    Levenshtein distance for golang
  • FourBytesStorage

    0.4 0.3 Go
    No description, website, or topics provided.
  • goulist

    0.4 0.0 Go
    Unrolled Linked List in pure Go
  • blooming-bella

    0.3 0.0 Go
    A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
  • hashsplit

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

Add another 'Data Structures' Package