Alternatives and similar repositories for skiplist:

Users that are interested in skiplist are comparing it to the libraries listed below

• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆409Updated 6 months ago
• golang-design / lockfree
  ⚡️ lock-free utilities in Go
  ☆155Updated 10 months ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆266Updated 3 years ago
• valyala / fastrand
  Fast and scalable pseudorandom generator for Go
  ☆206Updated 3 years ago
• nsqio / go-diskqueue
  A Go package providing a filesystem-backed FIFO queue
  ☆478Updated last year
• dgryski / go-tinylfu
  TinyLFU cache admission policy
  ☆261Updated 2 months ago
• glycerine / offheap
  an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.
  ☆373Updated last year
• gobwas / pool
  Go Pooling Helpers
  ☆113Updated 4 years ago
• smallnest / ringbuffer
  a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface
  ☆555Updated 3 weeks ago
• zhangyunhao116 / skipmap
  skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.
  ☆208Updated 7 months ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆387Updated 3 months ago
• a8m / syncmap
  A typed implementation of the Go sync.Map using code generation
  ☆256Updated 2 years ago
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆292Updated 9 months ago
• edwingeng / deque
  A highly optimized double-ended queue
  ☆193Updated last year
• neilotoole / errgroup
  errgroup with goroutine worker limits
  ☆163Updated 2 years ago
• skull-squadron / bloomfilter
  Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
  ☆352Updated 6 years ago
• marusama / semaphore
  Fast resizable golang semaphore primitive
  ☆175Updated 4 years ago
• wangjia184 / sortedset
  An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing
  ☆157Updated 2 years ago
• modern-go / concurrent
  concurrency utilities
  ☆293Updated 5 years ago
• tidwall / shardmap
  A simple and efficient thread-safe sharded hashmap for Go
  ☆226Updated 5 years ago
• cch123 / gogctuner
  auto adjust your GOGC value
  ☆227Updated 7 months ago
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆168Updated last year
• edwingeng / doublejump
  A revamped Google's jump consistent hash
  ☆105Updated 2 years ago
• zhangyunhao116 / skipset
  skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.
  ☆256Updated 2 years ago
• twmb / murmur3
  Fast, fully fledged murmur3 in Go.
  ☆325Updated last year
• RussellLuo / slidingwindow
  Golang implementation of Sliding Window Algorithm for distributed rate limiting.
  ☆395Updated 10 months ago
• acln0 / zerocopy
  Zero-copy I/O primitives and pipelines for Go. Linux-specific.
  ☆545Updated 8 months ago
• loov / hrtime
  High resolution timing and benchmarking for Go
  ☆259Updated 4 years ago
• iwanbk / bcache
  Eventually consistent distributed in-memory cache Go library
  ☆159Updated 2 years ago
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆156Updated last year