ordered-concurrently alternatives and similar packages

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

• gods

  9.7 0.0 ordered-concurrently VS gods

  GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON

• go-datastructures

  9.5 3.9 ordered-concurrently VS go-datastructures

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

Scout APM: A developer's best friend. Try free for 14-days

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.

Promo scoutapm.com



• golang-set

  8.5 0.1 ordered-concurrently VS golang-set

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

• gota

  8.4 5.8 ordered-concurrently VS gota

  Gota: DataFrames and data wrangling in Go (Golang)
  

• FSM for Go

  8.2 1.2 ordered-concurrently VS FSM for Go

  Finite State Machine for Go
  

• willf/bloom

  8.0 6.7 ordered-concurrently VS willf/bloom

  Go package implementing Bloom filters
  

• boomfilters

  7.9 1.2 ordered-concurrently VS boomfilters

  Probabilistic data structures for processing continuous, unbounded streams.

• roaring

  7.9 7.5 ordered-concurrently VS roaring

  Roaring bitmaps in Go (golang)
  

• gocache

  7.6 7.3 ordered-concurrently VS gocache

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

• bitset

  7.4 3.0 ordered-concurrently VS bitset

  Go package implementing bitsets
  

• cuckoofilter

  7.3 1.8 ordered-concurrently VS cuckoofilter

  Cuckoo Filter: Practically Better Than Bloom

• hyperloglog

  7.2 2.1 ordered-concurrently VS hyperloglog

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

• algorithms

  7.1 0.0 ordered-concurrently VS algorithms

  CLRS study. Codes are written with golang.

• trie

  7.0 0.0 ordered-concurrently VS trie

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

• go-geoindex

  6.6 0.0 ordered-concurrently VS go-geoindex

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

• gostl

  6.3 0.1 ordered-concurrently VS gostl

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

• conjungo

  6.2 0.0 ordered-concurrently VS conjungo

  A small flexible merge library in go
  

• merkletree

  6.1 0.0 ordered-concurrently VS merkletree

  A Merkle Tree implementation written in Go.

• ttlcache

  6.1 6.7 ordered-concurrently VS ttlcache

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

• mafsa

  6.0 0.0 ordered-concurrently VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• Bloomfilter

  6.0 0.0 ordered-concurrently VS Bloomfilter

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

• goskiplist

  6.0 0.0 ordered-concurrently VS goskiplist

  A skip list implementation in Go

• hilbert

  5.9 0.0 ordered-concurrently VS hilbert

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

• binpacker

  5.5 1.1 ordered-concurrently VS binpacker

  A binary stream packer and unpacker

• go-adaptive-radix-tree

  5.5 0.1 ordered-concurrently VS go-adaptive-radix-tree

  Adaptive Radix Trees implemented in Go

• bloom

  5.0 0.0 ordered-concurrently VS bloom

  Bloom filters implemented in Go.
  

• levenshtein

  5.0 2.9 ordered-concurrently VS levenshtein

  Go implementation to calculate Levenshtein Distance.

• cuckoo-filter

  5.0 6.0 ordered-concurrently VS cuckoo-filter

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

• iter

  4.7 0.0 ordered-concurrently VS iter

  Go implementation of C++ STL iterators and algorithms.

• goconcurrentqueue

  4.7 0.0 ordered-concurrently VS goconcurrentqueue

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

• bit

  4.6 0.0 ordered-concurrently VS bit

  Bitset data structure
  

• encoding

  4.6 0.0 ordered-concurrently VS encoding

  Integer Compression Libraries for Go
  

• ring

  4.5 0.0 ordered-concurrently VS ring

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

• skiplist

  4.4 0.0 ordered-concurrently VS skiplist

  skiplist for golang

• go-rquad

  4.4 0.0 ordered-concurrently VS go-rquad

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

• remember-go

  4.3 1.2 ordered-concurrently VS remember-go

  Cache Slow Database Queries
  

• bitmap

  4.1 7.1 ordered-concurrently VS bitmap

  Simple dense bitmap index in Go with binary operators

• go-mcache

  4.0 0.0 ordered-concurrently VS go-mcache

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

• set

  3.7 0.0 ordered-concurrently VS set

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

• crunch

  3.4 3.1 ordered-concurrently VS crunch

  take bytes out of things easily ✨🍪

• goset

  3.2 0.0 ordered-concurrently VS goset

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

• count-min-log

  3.1 0.0 ordered-concurrently VS count-min-log

  Go implementation of Count-Min-Log

• nan

  3.1 3.7 ordered-concurrently VS nan

  Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers

• hide

  2.9 0.8 ordered-concurrently VS hide

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

• ptrie

  2.7 0.0 ordered-concurrently VS ptrie

  A prefix tree implementation in go
  

• pipeline

  2.6 0.0 ordered-concurrently VS pipeline

  Pipelines using goroutines

• timedmap

  2.5 5.6 ordered-concurrently VS timedmap

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

• deque

  2.4 0.0 ordered-concurrently VS deque

  A highly optimized double-ended queue

• go-ef

  2.1 0.0 ordered-concurrently VS go-ef

  A Go implementation of the Elias-Fano encoding

• null

  2.1 0.8 ordered-concurrently VS null

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

Do you think we are missing an alternative of ordered-concurrently or a related project?

Run Linux Software Faster and Safer than Linux with Unikernels sponsored github.com/nanovms

Popular Comparisons

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

SaaSHub - Software Alternatives and Reviews sponsored www.saashub.com