anacrolix / stmLinks
Software Transactional Memory in Go
☆83Updated 2 years ago
Alternatives and similar repositories for stm
Users that are interested in stm are comparing it to the libraries listed below
Sorting:
- A performant, highly concurrent and simple sharded hashmap implementation using generics☆33Updated last year
- a golang test framework for asserting expected escape analysis results & heap allocations☆72Updated 10 months ago
- Golang lock-free Hashmap and List☆71Updated 2 years ago
- Go implementation of a Hash Array Map Trie☆28Updated 5 years ago
- WebSocket for fasthttp☆65Updated 7 months ago
- simple data streams for go☆31Updated 3 years ago
- Efficiently box values in Go. Optimized for primitives, strings, and byte slices.☆75Updated 2 months ago
- An Adaptive Radix Tree (ART) implementation in Go☆83Updated last year
- The fastest way to xor bytes in Go☆74Updated 4 years ago
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 3 years ago
- 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
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆69Updated last year
- Generic sorted map for Go with red-black tree under the hood☆65Updated 3 years ago
- Promise to the Go compiler that your Reads and Writes are well-behaved☆58Updated 6 years ago
- ☆193Updated 8 years ago
- Go io uring syscall implementation without CGO, rewrite on branch v0.4☆117Updated 2 years ago
- Golang wrapper for WASM3 (https://github.com/wasm3/wasm3)☆79Updated 3 years ago
- Simple, specialised, and efficient binary marshaling☆37Updated 4 years ago
- Simple managed reload mechanism for Go☆48Updated last year
- Core go datastructure of a cid index☆15Updated 3 weeks ago
- a fast counting quotient filter implementation in golang☆95Updated last month
- Pure Go SQL parser☆164Updated 4 months ago
- ☆123Updated 2 years ago
- Storing strings without GC overhead☆84Updated last month
- Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)☆65Updated 3 years ago
- Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci☆101Updated 3 years ago
- Raft backend implementation using BadgerDB☆119Updated 2 years ago
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆56Updated 3 months ago
- Fastest and most efficient goroutine pool (experimental)☆139Updated 3 years ago
- Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data☆37Updated last year