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.
  ☆426Updated last year
• golang-design / lockfree
  ⚡️ lock-free utilities in Go
  ☆162Updated last year
• valyala / fastrand
  Fast and scalable pseudorandom generator for Go
  ☆208Updated 4 years ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆270Updated 4 years ago
• nsqio / go-diskqueue
  A Go package providing a filesystem-backed FIFO queue
  ☆495Updated last month
• a8m / syncmap
  A typed implementation of the Go sync.Map using code generation
  ☆257Updated 2 years ago
• tidwall / shardmap
  A simple and efficient thread-safe sharded hashmap for Go
  ☆245Updated 6 years ago
• gobwas / pool
  Go Pooling Helpers
  ☆118Updated 5 years ago
• RussellLuo / slidingwindow
  Golang implementation of Sliding Window Algorithm for distributed rate limiting.
  ☆406Updated last year
• wangjia184 / sortedset
  An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing
  ☆161Updated 2 years ago
• dgryski / go-tinylfu
  TinyLFU cache admission policy
  ☆267Updated 9 months ago
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆162Updated 2 years ago
• modern-go / concurrent
  concurrency utilities
  ☆304Updated 6 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.
  ☆263Updated 2 years ago
• glycerine / offheap
  an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.
  ☆380Updated 5 months ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆402Updated 10 months ago
• marusama / semaphore
  Fast resizable golang semaphore primitive
  ☆177Updated 4 years ago
• lni / dragonboat-example
  Examples for Dragonboat
  ☆191Updated last year
• smallnest / ringbuffer
  a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface
  ☆601Updated 7 months ago
• edwingeng / deque
  A highly optimized double-ended queue
  ☆201Updated 2 years ago
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆174Updated 2 years 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.
  ☆220Updated last year
• loov / hrtime
  High resolution timing and benchmarking for Go
  ☆263Updated 5 years ago
• timtadh / fs2
  B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go
  ☆408Updated 6 years ago
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆292Updated last year
• iwanbk / bcache
  Eventually consistent distributed in-memory cache Go library
  ☆162Updated 2 years ago
• smallnest / weighted
  high-performance common weighted algorithm library
  ☆203Updated 2 years ago
• neilotoole / errgroup
  errgroup with goroutine worker limits
  ☆166Updated 2 years ago
• dghubble / trie
  Fast, zero heap allocation Go Trie for runes or paths
  ☆496Updated last year
• twmb / murmur3
  Fast, fully fledged murmur3 in Go.
  ☆343Updated 2 years ago