10

8

6

4

2


9.7
0.9

8.5
0.4

8.3

3.8

7.9

7.8

7.9
1.5

65 Data Structures packages and projects

  • gods

    9.7 0.9 Go
    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
  • go-datastructures

    9.5 4.2 Go
    A collection of useful, performant, and threadsafe Go datastructures.
  • golang-set

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

    8.3 3.8 Go
    Gota: DataFrames and data wrangling in Go (Golang)
  • roaring

    7.9 7.8 Go
    Roaring bitmaps in Go (golang)
  • boomfilters

    7.9 1.5 Go
    Probabilistic data structures for processing continuous, unbounded streams.
  • willf/bloom

    7.9 5.6 Go
    Go package implementing Bloom filters
  • gocache

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

    7.4 2.7 Go
    Go package implementing bitsets
  • cuckoofilter

    7.3 2.8 Go
    Cuckoo Filter: Practically Better Than Bloom
  • hyperloglog

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

    7.0 0.0 Go
    CLRS study. Codes are written with golang.
  • trie

    7.0 0.0 Go
    Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
  • go-geoindex

    6.7 0.0 Go
    Go native library for fast point tracking and K-Nearest queries
  • gostl

    6.2 0.6 Go
    Data structure and algorithm library for go, designed to provide functions similar to C++ STL
  • conjungo

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

    6.1 0.0 Go
    A Merkle Tree implementation written in Go.
  • goskiplist

    6.0 0.0 Go
    A skip list implementation in Go
  • ttlcache

    6.0 6.7 Go
    An in-memory string-interface{} map with various expiration options for golang
  • Bloomfilter

    6.0 0.0 Go
    Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter 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.5 0.5 Go
    Adaptive Radix Trees implemented in Go
  • binpacker

    5.4 0.0 Go
    A binary stream packer and unpacker
  • cuckoo-filter

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

    5.0 0.0 Go
    Bloom filters implemented in Go.
  • levenshtein

    4.8 3.2 Go
    Go implementation to calculate Levenshtein Distance.
  • bit

    4.7 0.0 Go
    Bitset data structure
  • iter

    4.7 0.0 Go
    Go implementation of C++ STL iterators and algorithms.
  • goconcurrentqueue

    4.6 0.0 Go
    Go concurrent-safe, goroutine-safe, thread-safe queue
  • encoding

    4.6 0.0 Go
    Integer Compression Libraries for Go
  • ring

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

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

    4.3 2.9 Go
    Cache Slow Database Queries
  • skiplist

    4.3 0.0 Go
    skiplist for golang
  • go-mcache

    3.8 0.0 Go
    Fast in-memory key:value store/cache with TTL
  • bitmap

    3.7 7.2 Go
    Simple dense bitmap index in Go with binary operators
  • set

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

    3.3 3.8 Go
    take bytes out of things easily ✨🍪
  • count-min-log

    3.1 0.0 Go
    Go implementation of Count-Min-Log
  • goset

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

    2.8 1.3 Go
    ID type with marshalling to/from hash to prevent sending IDs to clients.
  • nan

    2.8 4.6 Go
    Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
  • ptrie

    2.6 0.2 Go
    A prefix tree implementation in go
  • deque

    2.5 0.0 Go
    A highly optimized double-ended queue
  • pipeline

    2.5 0.0 Go
    Pipelines using goroutines
  • timedmap

    2.4 6.0 Go
    A thread safe map which has expiring key-value pairs.
  • go-ef

    2.2 0.0 Go
    A Go implementation of the Elias-Fano encoding
  • null

    2.0 1.3 Go
    Nullable Go types that can be marshalled/unmarshalled to/from JSON.
  • mspm

    1.9 0.0 Go
    Multi-String Pattern Matching Algorithm Using TrieHashNode
  • treap

    1.7 0.0 Go
    golang persistent immutable treap sorted sets
  • dict

    1.5 0.6 Go
    Python-like dictionaries for Go
  • cmap

    1.3 0.1 Go
    a thread-safe concurrent map for go
  • parapipe

    1.1 2.2 Go
    Paralleling pipeline
  • gofal

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

    0.7 0.0 Go
    Tools for parse JSON-like logs for collecting unique fields and events
  • goterator

    0.7 1.3 Go
    Lazy iterator implementation for Golang
  • ordered-concurrently

    0.7 7.8 Go
    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.
  • slices

    0.7 1.8 Go
    Functions that operate on slices. Similar to functions from package strings or package bytes that have been adapted to work with slices.
  • dsu

    0.6 6.6 Go
    Disjoint Set data structure implementation in Go
  • goulist

    0.5 3.0 Go
    Unrolled Linked List in pure Go
  • Go-Form

    0.5 0.0 Go
    Create HTML forms with your structs and interfaces.
  • FourBytesStorage

    0.5 2.1 Go
    No description, website, or topics provided.
  • blooming-bella

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

    0.3 0.0 Go
    Levenshtein distance for golang

Add another 'Data Structures' Package