arriqaaq / artLinks
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:
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆67Updated 10 months ago
- Go io uring syscall implementation without CGO, rewrite on branch v0.4☆116Updated 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
- Go programming language port of liburing.☆105Updated last year
- ☆121Updated last year
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 3 years ago
- Simple and efficient WAL implementation in Go 🚀☆61Updated last year
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.☆41Updated 5 years ago
- The `io_uring` library and runtime for GO☆133Updated last month
- adaptive radix tree (a.k.a prefix tree or compact trie)☆32Updated 2 months 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
- A spinlock implementation for Go.☆61Updated 4 years ago
- Off heap golang memory pool☆60Updated 3 years ago
- Load file-backed memory☆121Updated 2 years ago
- Simply ACID* key-value database. At the medium or even low latency it tries to provide greater throughput without losing the ACID propert…☆40Updated 2 years ago
- Fastest and most efficient goroutine pool (experimental)☆141Updated 2 years ago
- Expr – a tiny stack-based virtual machine written in Go☆31Updated 3 years ago
- Code for decoding and encoding runtime/trace files as well as useful functionality implemented on top.☆90Updated 9 months ago
- Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.☆46Updated 3 months ago
- raft is a golang library that provides a simple, clean, and idiomatic implementation of the Raft consensus protocol☆134Updated last month
- In memory sharded cache implementation☆35Updated 3 years ago
- Easy to use Raft library to make your app distributed, highly available and fault-tolerant☆74Updated 3 years ago
- Expression evaluator for Go☆74Updated 2 months ago
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆80Updated 3 years ago
- a golang test framework for asserting expected escape analysis results & heap allocations☆71Updated 6 months ago
- Golang lock-free Hashmap and List☆70Updated 2 years ago
- Consistent hashing hashring implementation.☆34Updated last year
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆54Updated 2 years ago
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 2 years ago
- Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data☆35Updated last year