Alternatives and similar repositories for stm

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

• dustinxie / lockfree
  Golang lock-free Hashmap and List
  ☆73Updated 3 years ago
• chainbound / shardmap
  A performant, highly concurrent and simple sharded hashmap implementation using generics
  ☆34Updated last year
• akutz / lem
  a golang test framework for asserting expected escape analysis results & heap allocations
  ☆73Updated last year
• lleo / go-hamt
  Go implementation of a Hash Array Map Trie
  ☆28Updated 5 years ago
• ajwerner / btree
  go2 generics experiment in building generic augmented BTree data structures
  ☆25Updated last month
• philpearl / stringbank
  Storing strings without GC overhead
  ☆86Updated last month
• BBVA / raft-badger
  Raft backend implementation using BadgerDB
  ☆120Updated 2 years ago
• aneshas / gocask
  Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data
  ☆37Updated 2 months ago
• tidwall / sds
  simple data streams for go
  ☆31Updated 3 years ago
• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆62Updated last year
• igrmk / treemap
  Generic sorted map for Go with red-black tree under the hood
  ☆67Updated 3 years ago
• ronaksoft / rony
  Fast and Scalable RPC Framework
  ☆43Updated 2 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆83Updated 2 years ago
• tidwall / spinlock
  A spinlock implementation for Go.
  ☆63Updated 5 years ago
• ipni / go-indexer-core
  Core go datastructure of a cid index
  ☆15Updated last week
• tidwall / box
  Efficiently box values in Go. Optimized for primitives, strings, and byte slices.
  ☆77Updated 5 months ago
• lukechampine / noescape
  Promise to the Go compiler that your Reads and Writes are well-behaved
  ☆61Updated 6 years ago
• dolthub / maphash
  ☆123Updated 2 years ago
• ii64 / gouring
  Go io uring syscall implementation without CGO, rewrite on branch v0.4
  ☆119Updated 2 years ago
• theodesp / go-heaps
  Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
  ☆101Updated 3 years ago
• kpango / fastime
  Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.
  ☆56Updated 6 months ago
• Michal-Leszczynski / btree
  BTree provides a simple, ordered, in-memory data structure for Go programs.
  ☆45Updated 3 years ago
• tidwall / bfile
  A buffer pool file I/O library for Go
  ☆55Updated 4 years ago
• dgrr / websocket
  WebSocket for fasthttp
  ☆68Updated 11 months ago
• kortschak / goroutine
  Package for getting the runtime ID of a goroutine
  ☆49Updated 4 months 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 2 years ago
• alphadose / itogami
  Fastest and most efficient goroutine pool (experimental)
  ☆140Updated 3 years ago
• embano1 / memlog
  A Kafka log inspired in-memory and append-only data structure
  ☆135Updated last month
• tidwall / lotsa
  Simple Go library for executing lots of operations spread over any number of threads
  ☆77Updated last month
• felixge / traceutils
  Code for decoding and encoding runtime/trace files as well as useful functionality implemented on top.
  ☆91Updated 3 months ago