plar / go-adaptive-radix-tree
Adaptive Radix Trees implemented in Go
☆386Updated 3 months ago
Alternatives and similar repositories for go-adaptive-radix-tree:
Users that are interested in go-adaptive-radix-tree are comparing it to the libraries listed below
- TinyLFU cache admission policy☆259Updated 2 months ago
- A fast, threadsafe skip list in Go☆266Updated 3 years ago
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆284Updated 2 years ago
- an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.☆372Updated last year
- Fast and easy-to-use skip list for Go.☆405Updated 6 months ago
- Server for benchmarking pure Go key/value databases☆156Updated last year
- Write ahead log for Go.☆645Updated 4 months ago
- An immutable radix tree implementation in Golang☆1,033Updated last month
- Fast, zero heap allocation Go Trie for runes or paths☆487Updated 6 months ago
- Raft backend implementation using BoltDB☆675Updated 3 weeks ago
- Golang implementation of Radix trees☆903Updated 8 months ago
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆218Updated last year
- XXH3 algorithm in Go☆441Updated 2 weeks ago
- ⚡️ lock-free utilities in Go☆155Updated 10 months ago
- Go package porting the standard hashing algorithms to a more efficient implementation.☆292Updated 8 months ago
- Fast and scalable pseudorandom generator for Go☆203Updated 3 years ago
- B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go☆408Updated 5 years ago
- slab allocator in go☆376Updated 3 months ago
- A Go library implementing a FST (finite state transducer)☆196Updated 3 months ago
- Optimized functions for Go using SIMD☆194Updated 4 years ago
- Diodes are ring buffers manipulated via atomics.☆471Updated last week
- A Go package providing a filesystem-backed FIFO queue☆477Updated last year
- io_uring support for go☆204Updated 4 years ago
- Examples for Dragonboat☆184Updated 7 months ago
- skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.☆206Updated 6 months ago
- a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface☆550Updated last week
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆255Updated last year
- A portable mmap package for Go☆993Updated 3 months ago
- Serialized Roaring Bitmaps☆276Updated last year
- Fast, fully fledged murmur3 in Go.☆322Updated last year