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 9.0 ordered-concurrently VS gods

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

• go-datastructures

  9.5 0.0 ordered-concurrently VS go-datastructures

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

Deliver Cleaner and Safer Code - Right in Your IDE of Choice!

SonarLint is a free and open source IDE extension that identifies and catches bugs and vulnerabilities as you code, directly in the IDE. Install from your favorite IDE marketplace today.

Promo www.sonarlint.org



• golang-set

  8.6 7.3 ordered-concurrently VS golang-set

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

• gota

  8.5 3.5 ordered-concurrently VS gota

  Gota: DataFrames and data wrangling in Go (Golang)
  

• FSM for Go

  8.3 1.1 ordered-concurrently VS FSM for Go

  Finite State Machine for Go
  

• roaring

  8.1 6.8 ordered-concurrently VS roaring

  Roaring bitmaps in Go (golang)
  

• willf/bloom

  8.1 3.8 ordered-concurrently VS willf/bloom

  Go package implementing Bloom filters
  

• boomfilters

  7.9 0.0 ordered-concurrently VS boomfilters

  Probabilistic data structures for processing continuous, unbounded streams.

• gocache

  7.7 6.2 ordered-concurrently VS gocache

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

• bitset

  7.6 4.8 ordered-concurrently VS bitset

  Go package implementing bitsets
  

• cuckoofilter

  7.4 2.1 ordered-concurrently VS cuckoofilter

  Cuckoo Filter: Practically Better Than Bloom

• hyperloglog

  7.2 2.8 ordered-concurrently VS hyperloglog

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

• trie

  7.1 0.0 ordered-concurrently VS trie

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

• gostl

  7.1 3.0 ordered-concurrently VS gostl

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

• algorithms

  7.1 0.0 ordered-concurrently VS algorithms

  CLRS study. Codes are written with golang.

• go-geoindex

  6.6 0.0 ordered-concurrently VS go-geoindex

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

• ttlcache

  6.5 6.4 ordered-concurrently VS ttlcache

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

• merkletree

  6.4 0.0 ordered-concurrently VS merkletree

  A Merkle Tree implementation written in Go.

• conjungo

  6.2 0.0 ordered-concurrently VS conjungo

  A small flexible merge library in go
  

• 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

• mafsa

  6.0 0.0 ordered-concurrently VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• 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.
  

• go-adaptive-radix-tree

  5.7 0.3 ordered-concurrently VS go-adaptive-radix-tree

  Adaptive Radix Trees implemented in Go

• binpacker

  5.5 0.6 ordered-concurrently VS binpacker

  A binary stream packer and unpacker

• cuckoo-filter

  5.4 1.7 ordered-concurrently VS cuckoo-filter

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

• levenshtein

  5.2 0.0 ordered-concurrently VS levenshtein

  Go implementation to calculate Levenshtein Distance.

• goconcurrentqueue

  5.1 4.2 ordered-concurrently VS goconcurrentqueue

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

• bloom

  4.9 0.0 ordered-concurrently VS bloom

  Bloom filters implemented in Go.
  

• iter

  4.9 7.1 ordered-concurrently VS iter

  Go implementation of C++ STL iterators and algorithms.

• bit

  4.8 0.0 ordered-concurrently VS bit

  Bitset data structure
  

• bitmap

  4.8 5.0 ordered-concurrently VS bitmap

  Simple dense bitmap index in Go with binary operators

• encoding

  4.7 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.

• remember-go

  4.4 0.0 ordered-concurrently VS remember-go

  Cache Slow Database Queries
  

• 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

• skiplist

  4.3 0.0 ordered-concurrently VS skiplist

  skiplist for golang

• go-mcache

  4.1 0.0 ordered-concurrently VS go-mcache

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

• set

  3.9 1.1 ordered-concurrently VS set

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

• crunch

  3.6 5.0 ordered-concurrently VS crunch

  take bytes out of things easily ✨🍪

• nan

  3.3 5.0 ordered-concurrently VS nan

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

• goset

  3.3 0.0 ordered-concurrently VS goset

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

• hide

  3.2 0.0 ordered-concurrently VS hide

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

• count-min-log

  3.2 0.0 ordered-concurrently VS count-min-log

  Go implementation of Count-Min-Log

• pipeline

  3.0 0.0 ordered-concurrently VS pipeline

  Pipelines using goroutines

• memlog

  2.9 6.5 ordered-concurrently VS memlog

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

• timedmap

  2.9 2.2 ordered-concurrently VS timedmap

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

• ptrie

  2.7 0.0 ordered-concurrently VS ptrie

  A prefix tree implementation in go
  

• deque

  2.7 0.0 ordered-concurrently VS deque

  A highly optimized double-ended queue

• null

  2.3 0.0 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?

Less time debugging, more time building sponsored scoutapm.com

Popular Comparisons

• ordered-concurrently
  vs
  merkletree
• gods
  vs
  go-datastructures
• golang-set
  vs
  gods
• golang-set
  vs
  bitset
• mafsa
  vs
  golang-set

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