arriqaaq / art
An Adaptive Radix Tree (ART) implementation in Go
β79Updated last year
Alternatives and similar repositories for art:
Users that are interested in art are comparing it to the libraries listed below
- 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
- β117Updated last year
- Simple and efficient WAL implementation in Go πβ58Updated 9 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
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.β54Updated last year
- BTree provides a simple, ordered, in-memory data structure for Go programs.β45Updated 2 years ago
- A spinlock implementation for Go.β61Updated 4 years ago
- Expr β a tiny stack-based virtual machine written in Goβ31Updated 3 years ago
- Fastest and most efficient goroutine pool (experimental)β137Updated 2 years ago
- Ordered codes for database keysβ41Updated 7 months ago
- Easy to use Raft library to make your app distributed, highly available and fault-tolerantβ69Updated 3 years ago
- Off heap golang memory poolβ59Updated 3 years ago
- When storing a value in a Go interface allocates memory on the heap.β72Updated 2 years ago
- Best-effort CPU-local sharded values for Goβ199Updated 3 years ago
- Efficiently box values in Go. Optimized for primitives, strings, and byte slices.β70Updated 2 years ago
- A simple In-Memory Data Grid in Goβ72Updated 2 years ago
- Generic, zero-alloc, 100%-test covered Quadtree for golangβ37Updated last year
- Go programming language port of liburing.β100Updated last year
- Go io uring syscall implementation without CGO, rewrite on branch v0.4β112Updated last year
- Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Dataβ35Updated last year
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.β40Updated 4 years ago
- A service for managing locks in multiprocess/distributed systemsβ13Updated 2 years ago
- Fast, zero-allocation, lexicographic-order-preserving packing/unpacking of native Go types to bytes.β41Updated 2 months ago
- adaptive radix tree (a.k.a prefix tree or compact trie)β31Updated this week
- Many queue implementations with a test-suiteβ11Updated 2 years ago
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.β217Updated last year
- Expression evaluator for Goβ67Updated 11 months ago
- ππ» generalist, fast and tiny binary parser and compiler generator, powered by Go 1.18+ Genericsβ58Updated 2 years ago
- High throughput primitives libraryβ50Updated last year
- A simple thread-safe and fixed size LRU. Based on the Hashlru Algorithmβ71Updated last year