dgryski / go-tinylfuLinks
TinyLFU cache admission policy
☆266Updated 9 months ago
Alternatives and similar repositories for go-tinylfu
Users that are interested in go-tinylfu are comparing it to the libraries listed below
Sorting:
- A fast, threadsafe skip list in Go☆269Updated 4 years ago
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆288Updated 2 years ago
- slab allocator in go☆385Updated 10 months ago
- an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.☆379Updated 4 months ago
- io_uring support for go☆203Updated 5 years ago
- Golang library for io_uring (without CGO)☆132Updated 4 years ago
- A revamped Google's jump consistent hash☆107Updated 3 years ago
- Fast, minimal memory, consistent hash algorithm☆230Updated 3 weeks ago
- Adaptive Radix Trees implemented in Go☆401Updated 10 months ago
- Fast and easy-to-use skip list for Go.☆424Updated last year
- An implementation of Ted Dunning's t-digest in Go.☆146Updated 2 years ago
- Distributed RWMutex in Go☆359Updated 6 years ago
- Server for benchmarking pure Go key/value databases☆162Updated 2 years ago
- go/golang: fast bit set Bloom filter☆136Updated 6 years ago
- Examples for Dragonboat☆189Updated last year
- go-jump: Jump consistent hashing☆387Updated 4 years ago
- B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go☆408Updated 6 years ago
- Benchmark all the top in-memory Go caching libraries☆61Updated 2 years ago
- A simple and efficient thread-safe sharded hashmap for Go☆244Updated 6 years ago
- A Go package providing a filesystem-backed FIFO queue☆495Updated last month
- Fast and scalable pseudorandom generator for Go☆208Updated 4 years ago
- ⚡️ lock-free utilities in Go☆162Updated last year
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 3 years ago
- LMDB backend for Raft☆137Updated 2 years ago
- go-farm: a pure-Go farmhash implementation☆256Updated last year
- Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go☆354Updated 7 years 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.☆220Updated last year
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆262Updated 2 years ago
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.☆42Updated 5 years ago
- Go package porting the standard hashing algorithms to a more efficient implementation.☆292Updated last year