anacrolix / stmLinks
Software Transactional Memory in Go
☆87Updated 3 years ago
Alternatives and similar repositories for stm
Users that are interested in stm are comparing it to the libraries listed below
Sorting:
- a golang test framework for asserting expected escape analysis results & heap allocations☆73Updated last year
- Golang lock-free Hashmap and List☆73Updated 3 years ago
- ☆36Updated 5 months ago
- Go implementation of a Hash Array Map Trie☆28Updated 5 years ago
- simple data streams for go☆31Updated 3 years ago
- ☆80Updated 5 months ago
- Raft backend implementation using BadgerDB☆120Updated 2 years ago
- Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data☆37Updated last month
- A spinlock implementation for Go.☆63Updated 4 years ago
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 3 years ago
- Fastest and most efficient goroutine pool (experimental)☆140Updated 3 years ago
- Generic sorted map for Go with red-black tree under the hood☆67Updated 3 years ago
- Storing strings without GC overhead☆85Updated last month
- Allotment Routing Table☆56Updated 3 years ago
- Expression evaluator for Go☆80Updated this week
- go2 generics experiment in building generic augmented BTree data structures☆25Updated 3 weeks ago
- adaptive radix tree (a.k.a prefix tree or compact trie)☆35Updated 10 months ago
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆56Updated 6 months ago
- WebSocket for fasthttp☆68Updated 10 months ago
- Efficiently box values in Go. Optimized for primitives, strings, and byte slices.☆77Updated 5 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…☆163Updated 2 years ago
- Simple, specialised, and efficient binary marshaling☆37Updated 4 years ago
- Fast and Scalable RPC Framework☆43Updated 2 years ago
- Go io uring syscall implementation without CGO, rewrite on branch v0.4☆119Updated 2 years ago
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆70Updated last year
- Promise to the Go compiler that your Reads and Writes are well-behaved☆60Updated 6 years ago
- The fastest way to xor bytes in Go☆75Updated 4 years ago
- A Go implementation of the Ryu algorithm for converting floating-point numbers to strings☆93Updated 6 years ago
- cheap Go type to hold & operate on either a read-only []byte or string☆115Updated last year
- A performant, highly concurrent and simple sharded hashmap implementation using generics☆34Updated last year