Alternatives and similar repositories for iter

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

• tidwall / shardmap
  A simple and efficient thread-safe sharded hashmap for Go
  ☆237Updated 5 years ago
• MauriceGit / skiplist
  A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
  ☆287Updated 2 years ago
• tidwall / tinylru
  A fast little LRU cache for Go
  ☆173Updated 2 years ago
• sean-public / fast-skiplist
  A fast, threadsafe skip list in Go
  ☆267Updated 3 years ago
• smallnest / kvbench
  Server for benchmarking pure Go key/value databases
  ☆161Updated 2 years ago
• yourbasic / radix
  A fast string sorting algorithm (MSD radix sort)
  ☆193Updated 7 years ago
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆219Updated 2 years ago
• aclements / go-misc
  Miscellaneous Go hacks
  ☆243Updated 2 months ago
• golang-design / lockfree
  ⚡️ lock-free utilities in Go
  ☆162Updated last year
• tidwall / mmap
  Load file-backed memory
  ☆121Updated 2 years ago
• GavinClarke0 / lockless-generic-ring-buffer
  Single producer and multi-reader lockless ring buffer in go using generics from the go 1.18.x release. It is significantly faster than ch…
  ☆163Updated last year
• BWbwchen / MapReduce
  An easy-to-use Map Reduce Go parallel-computing framework inspired by 2021 6.824 lab1. It supports multiple workers threads on a single m…
  ☆225Updated last year
• 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.
  ☆217Updated last year
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆87Updated 2 years ago
• theodesp / go-heaps
  Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
  ☆102Updated 3 years ago
• plar / go-adaptive-radix-tree
  Adaptive Radix Trees implemented in Go
  ☆397Updated 8 months ago
• golang-design / go2generics
  🧪 A chunk of experiments and demos about Go 2 generics design (type parameter & type set)
  ☆152Updated 3 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.
  ☆261Updated 2 years ago
• a8m / syncmap
  A typed implementation of the Go sync.Map using code generation
  ☆256Updated 2 years ago
• dshulyak / uring
  Golang library for io_uring (without CGO)
  ☆133Updated 4 years ago
• samonzeweb / profilinggo
  A quick tour (or reminder) of Go performance tools
  ☆271Updated 3 years ago
• wangjia184 / sortedset
  An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing
  ☆160Updated 2 years ago
• philpearl / stringbank
  Storing strings without GC overhead
  ☆84Updated 5 years ago
• dolthub / maphash
  ☆122Updated 2 years ago
• edwingeng / deque
  A highly optimized double-ended queue
  ☆201Updated last year
• huandu / skiplist
  Fast and easy-to-use skip list for Go.
  ☆419Updated 11 months ago
• edwingeng / doublejump
  A revamped Google's jump consistent hash
  ☆107Updated 2 years ago
• Link512 / stealthpool
  Off heap golang memory pool
  ☆60Updated 4 years ago
• loov / hrtime
  High resolution timing and benchmarking for Go
  ☆261Updated 4 years ago
• amit-davidson / btree
  B-tree implementation for Go
  ☆239Updated 3 years ago