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
- A buffer pool file I/O library for Go☆54Updated 3 years ago
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 2 years ago
- Efficiently box values in Go. Optimized for primitives, strings, and byte slices.☆70Updated 2 years ago
- Package for getting the runtime ID of a goroutine☆44Updated 8 months ago
- Fast and Scalable RPC Framework☆43Updated last year
- Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data☆35Updated last year
- Raft backend implementation using BadgerDB☆115Updated last year
- An Adaptive Radix Tree (ART) implementation in Go☆79Updated last year
- simple data streams for go☆31Updated 2 years ago
- Off heap golang memory pool☆59Updated 3 years ago
- Golang lock-free Hashmap and List☆68Updated 2 years ago
- A spinlock implementation for Go.☆61Updated 4 years ago
- WebSocket for fasthttp☆61Updated last year
- adaptive radix tree (a.k.a prefix tree or compact trie)☆31Updated this week
- go2 generics experiment in building generic augmented BTree data structures☆24Updated 3 years 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.☆87Updated 5 months ago
- A Go implementation of the Ryu algorithm for converting floating-point numbers to strings☆92Updated 5 years ago
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆66Updated 6 months 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 …☆158Updated last year
- ☆117Updated last year
- Secure your dev servers, insecurely!☆47Updated 10 months ago
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆54Updated last year
- A performant, highly concurrent and simple sharded hashmap implementation using generics☆33Updated 8 months ago
- A diff3 text merge implementation in Go☆23Updated last year
- Generic sorted map for Go with red-black tree under the hood☆61Updated 2 years ago
- a fast counting quotient filter implementation in golang☆91Updated 3 years ago
- Go allocation trace utilities☆14Updated 4 years ago
- Promise to the Go compiler that your Reads and Writes are well-behaved☆56Updated 5 years ago
- Simple managed reload mechanism for Go☆45Updated 5 months ago