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 11 months ago
• dgrr / websocket
  WebSocket for fasthttp
  ☆67Updated 8 months ago
• arriqaaq / art
  An Adaptive Radix Tree (ART) implementation in Go
  ☆83Updated 2 years ago
• chainbound / shardmap
  A performant, highly concurrent and simple sharded hashmap implementation using generics
  ☆34Updated 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 / sds
  simple data streams for go
  ☆31Updated 3 years ago
• lleo / go-hamt
  Go implementation of a Hash Array Map Trie
  ☆28Updated 5 years ago
• matiasinsaurralde / go-wasm3
  Golang wrapper for WASM3 (https://github.com/wasm3/wasm3)
  ☆79Updated 3 years ago
• tidwall / box
  Efficiently box values in Go. Optimized for primitives, strings, and byte slices.
  ☆75Updated 3 months ago
• Arceliar / phony
  A ponylang-inspired actor model library for Go
  ☆63Updated 3 years ago
• BBVA / raft-badger
  Raft backend implementation using BadgerDB
  ☆120Updated 2 years ago
• lukechampine / fastxor
  The fastest way to xor bytes in Go
  ☆74Updated 4 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 2 years ago
• theodesp / go-heaps
  Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
  ☆101Updated 3 years ago
• philpearl / stringbank
  Storing strings without GC overhead
  ☆84Updated 2 months ago
• tidwall / spinlock
  A spinlock implementation for Go.
  ☆62Updated 4 years ago
• kpango / fastime
  Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.
  ☆56Updated 4 months 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
• lukechampine / noescape
  Promise to the Go compiler that your Reads and Writes are well-behaved
  ☆59Updated 6 years ago
• cespare / ryu
  A Go implementation of the Ryu algorithm for converting floating-point numbers to strings
  ☆92Updated 5 years ago
• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆62Updated last year
• dolthub / maphash
  ☆123Updated 2 years ago
• igrmk / treemap
  Generic sorted map for Go with red-black tree under the hood
  ☆65Updated 3 years ago
• ipni / go-indexer-core
  Core go datastructure of a cid index
  ☆15Updated this week
• libp2p / go-yamux
  ☆35Updated 3 months ago
• tidwall / bfile
  A buffer pool file I/O library for Go
  ☆55Updated 3 years ago
• jfcg / sorty
  Fast Concurrent / Parallel Sorting in Go
  ☆142Updated 3 months 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