10

8

6

4

2


9.1

8.2

7.4

3.6

6.9

2.8

6.3
0.0

6.3

3.0

23 Data Structures packages and projects

  • go-datastructures

    9.3 6.2 Go
    a collection of useful, performant, and thread-safe data structures
  • gods

    9.1 8.2 Go
    Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.
  • boomfilters

    7.4 3.6 Go
    probabilistic data structures for processing continuous, unbounded streams
  • golang-set

    6.9 2.8 Go
    Thread-Safe and Non-Thread-Safe high-performance sets for Go.
  • go-geoindex

    6.3 0.0 Go
    In-memory geo index.
  • willf/bloom

    6.3 3.0 Go
    Go package implementing Bloom filters.
  • bitset

    5.9 4.9 Go
    Go package implementing bitsets.
  • gota

    5.7 8.5 Go
    An implementation of dataframes, series, and data wrangling methods for Go.
  • roaring

    5.6 8.3 Go
    Go package implementing compressed bitsets.
  • mafsa

    5.5 0.0 Go
    MA-FSA implementation with Minimal Perfect Hashing
  • cuckoofilter

    5.2 0.3 Go
    Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.
  • trie

    5.0 0.4 Go
    Trie implementation in Go
  • goskiplist

    4.7 0.0 Go
    A skip list implementation in Go.
  • bloom

    4.0 0.0 Go
    Bloom filters implemented in Go.
  • hilbert

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

    3.5 0.0 Go
    Integer Compression Libraries for Go.
  • ttlcache

    3.2 0.5 Go
    An in-memory LRU string-interface{} map with expiration for golang
  • binpacker

    2.8 1.8 Go
    Binary packer and unpacker helps user build custom binary stream.
  • skiplist

    2.7 0.0 Go
    Skiplist implementation in Go
  • count-min-log

    2.3 1.1 Go
    A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).
  • go-adaptive-radix-tree

    1.6 3.0 Go
    A Go implementation of Adaptive Radix Tree.
  • levenshtein

    0.9 2.3 Go
    Implmentation to calculate levenshtein distance in Go.
  • blooming-bella

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

Add another 'Data Structures' Package