Algorithms and data structures.CLRS study.

algorithms alternatives and similar packages

Based on the "Data Structures" category

• gods

  9.7 3.5 algorithms VS gods

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

• go-datastructures

  9.5 1.3 algorithms VS go-datastructures

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

• golang-set

  8.3 0.0 algorithms VS golang-set

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

• gota

  8.1 3.5 algorithms VS gota

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

• boomfilters

  7.9 0.0 algorithms VS boomfilters

  probabilistic data structures for processing continuous, unbounded streams

• roaring

  7.5 6.6 algorithms VS roaring

  Go package implementing compressed bitsets.

• willf/bloom

  7.5 0.0 algorithms VS willf/bloom

  Go package implementing Bloom filters.

• hyperloglog

  7.2 2.5 algorithms VS hyperloglog

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

• cuckoofilter

  7.1 3.3 algorithms VS cuckoofilter

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

• bitset

  7.1 2.1 algorithms VS bitset

  Go package implementing bitsets.

• trie

  6.9 2.5 algorithms VS trie

  Trie implementation in Go

• go-geoindex

  6.7 0.0 algorithms VS go-geoindex

  In-memory geo index.

• gocache

  6.4 6.8 algorithms VS gocache

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

• mafsa

  6.0 0.1 algorithms VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• goskiplist

  5.9 0.0 algorithms VS goskiplist

  A skip list implementation in Go.

• hilbert

  5.8 0.0 algorithms VS hilbert

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

• merkletree

  5.7 2.0 algorithms VS merkletree

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

• ttlcache

  5.6 3.3 algorithms VS ttlcache

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

• binpacker

  5.2 0.0 algorithms VS binpacker

  Binary packer and unpacker helps user build custom binary stream.

• Bloomfilter

  5.2 1.7 algorithms VS Bloomfilter

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

• go-adaptive-radix-tree

  5.1 0.4 algorithms VS go-adaptive-radix-tree

  A Go implementation of Adaptive Radix Tree.

• bloom

  4.9 0.0 algorithms VS bloom

  Bloom filters implemented in Go.

• conjungo

  4.7 0.0 algorithms VS conjungo

  A small, powerful and flexible merge library.

• gostl

  4.6 8.1 algorithms VS gostl

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

• iter

  4.6 7.3 algorithms VS iter

  Go implementation of C++ STL iterators and algorithms.

• encoding

  4.5 0.0 algorithms VS encoding

  Integer Compression Libraries for Go.

• ring

  4.4 2.9 algorithms VS ring

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

• bit

  4.3 0.0 algorithms VS bit

  Golang set data structure with bonus bit-twiddling functions.

• skiplist

  4.3 0.0 algorithms VS skiplist

  Skiplist implementation in Go

• go-rquad

  4.2 4.1 algorithms VS go-rquad

  Region quadtrees with efficient point location and neighbour finding.

• levenshtein

  3.9 3.7 algorithms VS levenshtein

  Implmentation to calculate levenshtein distance in Go.

• goconcurrentqueue

  3.8 5.7 algorithms VS goconcurrentqueue

  Concurrent FIFO queue.

• go-mcache

  3.5 3.7 algorithms VS go-mcache

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

• set

  3.3 0.5 algorithms VS set

  Simple set data structure implementation in Go using LinkedHashMap.

• remember-go

  3.3 3.9 algorithms VS remember-go

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

• count-min-log

  3.1 0.0 algorithms VS count-min-log

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

• crunch

  2.9 6.8 algorithms VS crunch

  Go package implementing buffers for handling various datatypes easily.

• goset

  2.4 0.8 algorithms VS goset

  A useful Set collection implementation for Go.

• ptrie

  2.2 5.1 algorithms VS ptrie

  An implementation of prefix tree.

• hide

  2.0 0.0 algorithms VS hide

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

• pipeline

  2.0 0.0 algorithms VS pipeline

  An implementation of pipelines with fan-in and fan-out.

• mspm

  1.7 0.0 algorithms VS mspm

  Multi-String Pattern Matching Algorithm for information retrieval.

• timedmap

  1.7 5.6 algorithms VS timedmap

  Map with expiring key-value pairs.

• null

  1.5 1.9 algorithms VS null

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

• deque

  1.5 5.7 algorithms VS deque

  A highly optimized double-ended queue.

• go-ef

  1.3 0.0 algorithms VS go-ef

  A Go implementation of the Elias-Fano encoding.

• treap

  1.3 2.1 algorithms VS treap

  Persistent, fast ordered map using tree heaps.

• dict

  1.3 0.0 algorithms VS dict

  Python-like dictionaries (dict) for Go.

• gofal

  0.7 5.9 algorithms VS gofal

  fractional api for Go.

• parsefields

  0.5 0.0 algorithms VS parsefields

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

Do you think we are missing an alternative of algorithms or a related project?

Popular Comparisons

• gods
  vs
  go-datastructures
• golang-set
  vs
  gods
• golang-set
  vs
  bitset
• mafsa
  vs
  golang-set
• golang-set
  vs
  cuckoofilter

SaaSHub - Software Alternatives and Reviews View more from us