10

8

6

4

2


9.7

3.8
gods

9.5
0.0
go-datastructures

8.4
0.0
golang-set

8.2
0.4
gota

7.9
1.0
boomfilters

7.7

7.6
roaring

58 Data Structures packages and projects

  • gods

    9.7 3.8 Go
    Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.

  • go-datastructures

    9.5 0.0 Go
    a collection of useful, performant, and thread-safe data structures

  • golang-set

    8.4 0.0 Go
    Thread-Safe and Non-Thread-Safe high-performance sets for Go.

    • Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.
    Promoted scoutapm.com

  • gota

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

  • boomfilters

    7.9 1.0 Go
    probabilistic data structures for processing continuous, unbounded streams

  • roaring

    7.7 7.6 Go
    Go package implementing compressed bitsets.

  • willf/bloom

    7.6 0.0 Go
    Go package implementing Bloom filters.

  • bitset

    7.3 6.6 Go
    Go package implementing bitsets.

  • hyperloglog

    7.2 0.0 Go
    HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction.

  • cuckoofilter

    7.2 3.3 Go
    Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.

  • trie

    7.0 0.6 Go
    Trie implementation in Go

  • gocache

    6.9 7.1 Go
    A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more.

  • algorithms

    6.9 0.0 Go
    Algorithms and data structures.CLRS study.

  • go-geoindex

    6.7 0.0 Go
    In-memory geo index.

  • Bloomfilter

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

  • conjungo

    6.1 0.0 Go
    A small, powerful and flexible merge library.

  • merkletree

    6.0 0.0 Go
    Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.

  • 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

  • ttlcache

    5.8 6.9 Go
    An in-memory LRU string-interface{} map with expiration for golang

  • hilbert

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

  • binpacker

    5.4 0.0 Go
    Binary packer and unpacker helps user build custom binary stream.

  • go-adaptive-radix-tree

    5.3 3.6 Go
    A Go implementation of Adaptive Radix Tree.

  • gostl

    5.3 5.5 Go
    Data structure and algorithm library for go, designed to provide functions similar to C++ STL.

  • bloom

    4.9 0.0 Go
    Bloom filters implemented in Go.

  • encoding

    4.6 0.0 Go
    Integer Compression Libraries for Go.

  • iter

    4.6 3.4 Go
    Go implementation of C++ STL iterators and algorithms.

  • bit

    4.5 0.0 Go
    Golang set data structure with bonus bit-twiddling functions.

  • ring

    4.5 2.9 Go
    Go implementation of a high performance, thread safe bloom filter.

  • goconcurrentqueue

    4.4 4.2 Go
    Concurrent FIFO queue.

  • go-rquad

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

  • levenshtein

    4.3 3.2 Go
    Implmentation to calculate levenshtein distance in Go.

  • skiplist

    4.3 0.0 Go
    Skiplist implementation in Go

  • remember-go

    3.8 5.3 Go
    A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory).

  • go-mcache

    3.5 1.2 Go
    Fast in-memory key:value store/cache library. Pointer caches.

  • set

    3.3 1.6 Go
    Simple set data structure implementation in Go using LinkedHashMap.

  • crunch

    3.3 5.0 Go
    Go package implementing buffers for handling various datatypes easily.

  • count-min-log

    3.1 0.0 Go
    A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).

  • nan

    2.8 8.0 Go
    Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers.

  • goset

    2.7 1.5 Go
    A useful Set collection implementation for Go.

  • hide

    2.4 2.1 Go
    ID type with marshalling to/from hash to prevent sending IDs to clients.

  • ptrie

    2.3 1.5 Go
    An implementation of prefix tree.

  • pipeline

    2.2 0.0 Go
    An implementation of pipelines with fan-in and fan-out.

  • timedmap

    2.1 4.6 Go
    Map with expiring key-value pairs.

  • go-ef

    2.0 0.0 Go
    A Go implementation of the Elias-Fano encoding.

  • deque

    2.0 2.0 Go
    A highly optimized double-ended queue.

  • mspm

    1.7 0.0 Go
    Multi-String Pattern Matching Algorithm for information retrieval.

  • null

    1.7 2.0 Go
    Nullable Go types that can be marshalled/unmarshalled to/from JSON.

  • dict

    1.5 2.5 Go
    Python-like dictionaries (dict) for Go.

  • treap

    1.4 0.3 Go
    Persistent, fast ordered map using tree heaps.

  • gofal

    0.9 0.0 Go
    fractional api for Go.

  • cmap

    0.8 2.4 Go
    a thread-safe concurrent map for go, support using interface{} as key and auto scale up shards.

  • parsefields

    0.6 0.0 Go
    Tools for parse JSON-like logs for collecting unique fields and events.

  • Go-Form

    0.6 0.0 Go
    Create HTML forms with your structs and interfaces.

  • goterator

    0.5 5.1 Go
    Iterator implementation to provide map and reduce functionalities.

  • blooming-bella

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

  • slices

    0.3 4.1 Go
    Functions that operate on slices; like package strings but adapted to work with slices.

  • golang levenshtein

    0.3 0.1 Go
    Levenshtein distance for golang

Popular Comparisons

SaaSHub - Software Alternatives and Reviews
More from our partner

Add another 'Data Structures' Package