anacrolix / stm
Software Transactional Memory in Go
☆80Updated 2 years ago
Alternatives and similar repositories for stm:
Users that are interested in stm are comparing it to the libraries listed below
- Golang lock-free Hashmap and List☆71Updated 2 years ago
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 2 years ago
- Raft backend implementation using BadgerDB☆116Updated last year
- Fast and Scalable RPC Framework☆43Updated last year
- A Go implementation of the Ryu algorithm for converting floating-point numbers to strings☆92Updated 5 years ago
- Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a cha…☆40Updated 2 years ago
- Generic sorted map for Go with red-black tree under the hood☆63Updated 3 years ago
- ☆119Updated last year
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆54Updated 2 years ago
- a golang test framework for asserting expected escape analysis results & heap allocations☆70Updated 4 months ago
- A buffer pool file I/O library for Go☆55Updated 3 years ago
- Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data☆35Updated last year
- Off heap golang memory pool☆60Updated 3 years ago
- Package for getting the runtime ID of a goroutine☆45Updated 11 months ago
- a unified channel package for buffered, unbuffered, and unbounded channels☆39Updated 2 years ago
- Code for decoding and encoding runtime/trace files as well as useful functionality implemented on top.☆89Updated 7 months ago
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆67Updated 8 months ago
- Load file-backed memory☆122Updated 2 years ago
- ☆80Updated 3 weeks ago
- The fastest way to xor bytes in Go☆74Updated 4 years ago
- An Adaptive Radix Tree (ART) implementation in Go☆81Updated last year
- ☆15Updated 2 years ago
- ☆33Updated 3 weeks ago
- A purego binding for libffi.☆92Updated last month
- adaptive radix tree (a.k.a prefix tree or compact trie)☆32Updated last month
- Promise to the Go compiler that your Reads and Writes are well-behaved☆57Updated 5 years ago
- A spinlock implementation for Go.☆61Updated 4 years ago
- Simple managed reload mechanism for Go☆47Updated 7 months ago
- map library using Go generics that offers a standard interface, go routine synchronization, and sorting☆48Updated 2 months ago
- 🔑 A high performance Key/Value store written in Go with a predictable read/write performance and high throughput. Uses a Bitcask on-disk…☆33Updated last year