Alternatives and similar repositories for stm

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

• akutz / lem
  a golang test framework for asserting expected escape analysis results & heap allocations
  ☆72Updated 9 months ago
• lleo / go-hamt
  Go implementation of a Hash Array Map Trie
  ☆28Updated 4 years ago
• chainbound / shardmap
  A performant, highly concurrent and simple sharded hashmap implementation using generics
  ☆33Updated last year
• lukechampine / noescape
  Promise to the Go compiler that your Reads and Writes are well-behaved
  ☆58Updated 5 years ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆81Updated last year
• dgrr / websocket
  WebSocket for fasthttp
  ☆65Updated 6 months ago
• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆61Updated last year
• 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
• ajwerner / btree
  go2 generics experiment in building generic augmented BTree data structures
  ☆24Updated 3 years ago
• tidwall / sds
  simple data streams for go
  ☆31Updated 3 years ago
• rocketlaunchr / igo
  Improved Go Syntax (transpiler)
  ☆69Updated 5 years ago
• aneshas / gocask
  Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data
  ☆37Updated last year
• slok / reload
  Simple managed reload mechanism for Go
  ☆48Updated last year
• dustinxie / lockfree
  Golang lock-free Hashmap and List
  ☆71Updated 2 years ago
• Michal-Leszczynski / btree
  BTree provides a simple, ordered, in-memory data structure for Go programs.
  ☆45Updated 3 years ago
• tidwall / lotsa
  Simple Go library for executing lots of operations spread over any number of threads
  ☆75Updated 2 years ago
• theodesp / go-heaps
  Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
  ☆101Updated 3 years ago
• lukechampine / fastxor
  The fastest way to xor bytes in Go
  ☆74Updated 4 years ago
• tidwall / box
  Efficiently box values in Go. Optimized for primitives, strings, and byte slices.
  ☆74Updated last month
• cespare / ryu
  A Go implementation of the Ryu algorithm for converting floating-point numbers to strings
  ☆92Updated 5 years ago
• renproject / surge
  Simple, specialised, and efficient binary marshaling
  ☆37Updated 3 years ago
• matiasinsaurralde / go-wasm3
  Golang wrapper for WASM3 (https://github.com/wasm3/wasm3)
  ☆77Updated 3 years ago
• cantabular / faststringmap
  A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.
  ☆69Updated last year
• tidwall / spinlock
  A spinlock implementation for Go.
  ☆62Updated 4 years ago
• nkcmr / async
  experimental promises in go1.18 with generics
  ☆62Updated 3 years ago
• kpango / fastime
  Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.
  ☆55Updated 2 months ago
• ipni / go-indexer-core
  Core go datastructure of a cid index
  ☆15Updated last week
• facebookincubator / go-qfext
  a fast counting quotient filter implementation in golang
  ☆95Updated 3 years ago
• dolthub / maphash
  ☆122Updated 2 years ago
• tejzpr / ordered-concurrently
  Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a cha…
  ☆42Updated 2 years ago