arriqaaq / art
An Adaptive Radix Tree (ART) implementation in Go
☆81Updated last year
Alternatives and similar repositories for art
Users that are interested in art are comparing it to the libraries listed below
Sorting:
- ☆121Updated last year
- adaptive radix tree (a.k.a prefix tree or compact trie)☆32Updated 2 months ago
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 3 years ago
- Benchmark utility for the tidwall/btree Go package☆23Updated last year
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.☆41Updated 4 years ago
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆80Updated 3 years ago
- Simple and efficient WAL implementation in Go 🚀☆60Updated last year
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆54Updated 2 years ago
- Fastest and most efficient goroutine pool (experimental)☆140Updated 2 years ago
- Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.☆46Updated 3 months ago
- When storing a value in a Go interface allocates memory on the heap.☆72Updated 3 years ago
- Golang lock-free Hashmap and List☆71Updated 2 years ago
- Easy to use Raft library to make your app distributed, highly available and fault-tolerant☆73Updated 3 years ago
- Expr – a tiny stack-based virtual machine written in Go☆31Updated 3 years ago
- Ordered codes for database keys☆41Updated 10 months ago
- Extremely fast Bloom filters for Go☆49Updated 8 months ago
- The `io_uring` library and runtime for GO☆131Updated 3 weeks ago
- Load file-backed memory☆122Updated 2 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…☆162Updated last year
- A spinlock implementation for Go.☆61Updated 4 years ago
- Go io uring syscall implementation without CGO, rewrite on branch v0.4☆115Updated 2 years ago
- A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.☆28Updated 3 years ago
- An offheap memory allocator for manual memory management in Golang☆26Updated 3 weeks ago
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆218Updated 2 years ago
- A simple In-Memory Data Grid in Go☆73Updated 3 years ago
- Go programming language port of liburing.☆105Updated last year
- Off heap golang memory pool☆60Updated 3 years ago
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆67Updated 9 months ago
- Consistent hashing hashring implementation.☆34Updated last year
- In memory sharded cache implementation☆35Updated 3 years ago