10

8

6

4

2


9.3

6.8

7.5

3.2

7.1

4.7

6.8

7.6

6.5

5.9

28 Data Structures packages and projects

  • go-datastructures

    9.4 6.0 Go
    a collection of useful, performant, and thread-safe data structures
  • gods

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

    7.5 3.2 Go
    probabilistic data structures for processing continuous, unbounded streams
  • golang-set

    7.1 4.7 Go
    Thread-Safe and Non-Thread-Safe high-performance sets for Go.
  • hyperloglog

    6.8 7.6 Go
    HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction.
  • willf/bloom

    6.5 5.9 Go
    Go package implementing Bloom filters.
  • go-geoindex

    6.4 0.0 Go
    In-memory geo index.
  • gota

    6.2 6.5 Go
    An implementation of dataframes, series, and data wrangling methods for Go.
  • bitset

    6.2 6.6 Go
    Go package implementing bitsets.
  • roaring

    5.9 7.6 Go
    Go package implementing compressed bitsets.
  • mafsa

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

    5.4 2.8 Go
    Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.
  • trie

    5.3 0.0 Go
    Trie implementation in Go
  • goskiplist

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

    4.1 0.0 Go
    Bloom filters implemented in Go.
  • hilbert

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

    3.7 0.0 Go
    Integer Compression Libraries for Go.
  • ttlcache

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

    3.4 4.2 Go
    Binary packer and unpacker helps user build custom binary stream.
  • go-rquad

    3.3 7.5 Go
    Region quadtrees with efficient point location and neighbour finding.
  • skiplist

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

    2.5 0.5 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

    2.2 1.8 Go
    A Go implementation of Adaptive Radix Tree.
  • levenshtein

    1.0 4.4 Go
    Implmentation to calculate levenshtein distance in Go.
  • merkletree

    0.9 5.6 Go
    Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.
  • goset

    0.7 4.6 Go
    A useful Set collection implementation for Go.
  • bit

    0.7 5.8 Go
    Golang set data structure with bonus bit-twiddling functions.
  • blooming-bella

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

Add another 'Data Structures' Package