algorithms alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view algorithms alternatives based on common mentions on social networks and blogs.

gods

9.8 8.2 algorithms VS gods

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-datastructures

9.5 0.0 algorithms VS go-datastructures

A collection of useful, performant, and threadsafe Go datastructures.

Build time-series-based applications quickly and at scale.

InfluxDB is the Time Series Platform where developers build real-time applications for analytics, IoT and cloud-native services. Easy to start, it is available in the cloud or on-premises.

Promo www.influxdata.com

gota

8.6 0.0 algorithms VS gota

Gota: DataFrames and data wrangling in Go (Golang)
golang-set

8.6 5.4 algorithms VS golang-set

A simple generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
FSM for Go

8.4 4.1 algorithms VS FSM for Go

Finite State Machine for Go
roaring

8.2 5.2 algorithms VS roaring

Roaring bitmaps in Go (golang)
willf/bloom

8.2 7.0 algorithms VS willf/bloom

Go package implementing Bloom filters
gocache

8.0 7.4 algorithms VS gocache

☔️ A complete Go cache library that brings you multiple ways of managing your caches
boomfilters

7.9 0.0 algorithms VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.6 4.4 algorithms VS bitset

Go package implementing bitsets
cuckoofilter

7.4 1.4 algorithms VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.2 1.7 algorithms VS gostl

Data structure and algorithm library for go, designed to provide functions similar to C++ STL
hyperloglog

7.2 0.0 algorithms VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)
trie

7.1 0.0 algorithms VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree

6.7 0.0 algorithms VS merkletree

A Merkle Tree implementation written in Go.
go-geoindex

6.6 0.0 algorithms VS go-geoindex

Go native library for fast point tracking and K-Nearest queries
ttlcache

6.5 6.4 algorithms VS ttlcache

An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
conjungo

6.2 0.0 algorithms VS conjungo

A small flexible merge library in go
hilbert

6.0 0.0 algorithms VS hilbert

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

6.0 0.0 algorithms VS Bloomfilter

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

6.0 0.0 algorithms VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
goskiplist

6.0 0.0 algorithms VS goskiplist

A skip list implementation in Go
go-adaptive-radix-tree

5.8 0.6 algorithms VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
levenshtein

5.6 1.7 algorithms VS levenshtein

Go implementation to calculate Levenshtein Distance.
goconcurrentqueue

5.5 2.3 algorithms VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
cuckoo-filter

5.5 0.0 algorithms VS cuckoo-filter

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

5.5 0.0 algorithms VS binpacker

A binary stream packer and unpacker
bitmap

5.2 4.6 algorithms VS bitmap

Simple dense bitmap index in Go with binary operators
bit

5.0 0.0 algorithms VS bit

Bitset data structure
iter

5.0 5.9 algorithms VS iter

Go implementation of C++ STL iterators and algorithms.
bloom

4.9 0.0 algorithms VS bloom

Bloom filters implemented in Go.
encoding

4.8 0.0 algorithms VS encoding

Integer Compression Libraries for Go
ring

4.6 0.0 algorithms VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
remember-go

4.4 0.0 algorithms VS remember-go

Cache Slow Database Queries
skiplist

4.4 0.0 algorithms VS skiplist

skiplist for golang
go-rquad

4.3 0.0 algorithms VS go-rquad

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

4.2 0.0 algorithms VS go-mcache

Fast in-memory key:value store/cache with TTL
deque

4.0 6.7 algorithms VS deque

A highly optimized double-ended queue
set

3.8 0.0 algorithms VS set

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

3.6 2.3 algorithms VS crunch

take bytes out of things easily ✨🍪
memlog

3.5 3.1 algorithms VS memlog

A Kafka log inspired in-memory and append-only data structure
goset

3.5 0.0 algorithms VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
nan

3.5 2.3 algorithms VS nan

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
count-min-log

3.2 0.0 algorithms VS count-min-log

Go implementation of Count-Min-Log
timedmap

3.2 0.0 algorithms VS timedmap

A thread safe map which has expiring key-value pairs.
hide

3.2 0.0 algorithms VS hide

ID type with marshalling to/from hash to prevent sending IDs to clients.
ptrie

3.1 2.1 algorithms VS ptrie

A prefix tree implementation in go
pipeline

3.0 0.0 algorithms VS pipeline

Pipelines using goroutines
cmap

2.9 2.3 algorithms VS cmap

a thread-safe concurrent map for go
go-tuple

2.6 3.6 algorithms VS go-tuple

Go 1.18 generic tuples