10

8

6

4

2


9.3

6.1
go-datastructures

9.2

7.7
gods

7.5

3.6
boomfilters

7.0

3.8
golang-set

6.3
0.0
go-geoindex

6.3

6.6
willf/bloom

25 Data Structures packages and projects

  • go-datastructures

    9.3 6.1 Go
    a collection of useful, performant, and thread-safe data structures

  • gods

    9.2 7.7 Go
    Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.

  • boomfilters

    7.5 3.6 Go
    probabilistic data structures for processing continuous, unbounded streams

  • golang-set

    7.0 3.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 6.6 Go
    Go package implementing Bloom filters.

  • bitset

    6.0 6.4 Go
    Go package implementing bitsets.

  • gota

    5.9 8.2 Go
    An implementation of dataframes, series, and data wrangling methods for Go.

  • roaring

    5.7 8.1 Go
    Go package implementing compressed bitsets.

  • mafsa

    5.5 0.0 Go
    MA-FSA implementation with Minimal Perfect Hashing

  • cuckoofilter

    5.3 1.9 Go
    Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.

  • trie

    5.2 0.3 Go
    Trie implementation in Go

  • goskiplist

    4.6 0.0 Go
    A skip list implementation in Go.

  • bloom

    4.0 0.0 Go
    Bloom filters implemented in Go.

  • hilbert

    3.8 4.4 Go
    Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.

  • encoding

    3.6 0.0 Go
    Integer Compression Libraries for Go.

  • ttlcache

    3.5 1.4 Go
    An in-memory LRU string-interface{} map with expiration for golang

  • binpacker

    3.0 1.5 Go
    Binary packer and unpacker helps user build custom binary stream.

  • go-rquad

    2.9 8.5 Go
    Region quadtrees with efficient point location and neighbour finding.

  • skiplist

    2.8 0.0 Go
    Skiplist implementation in Go

  • count-min-log

    2.3 0.9 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.9 2.2 Go
    A Go implementation of Adaptive Radix Tree.

  • levenshtein

    0.9 1.5 Go
    Implmentation to calculate levenshtein distance in Go.

  • blooming-bella

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

  • bit

    0.1 5.3 Go
    Golang set data structure with bonus bit-twiddling functions.

Popular Comparisons

Add another 'Data Structures' Package