greatroar / blobloom
Extremely fast Bloom filters for Go
☆46Updated last month
Related projects ⓘ
Alternatives and complementary repositories for blobloom
- Load file-backed memory☆121Updated 2 years ago
- Expression evaluator for Go☆66Updated 8 months ago
- Efficiently box values in Go. Optimized for primitives, strings, and byte slices.☆70Updated last year
- go2 generics experiment in building generic augmented BTree data structures☆24Updated 2 years ago
- adaptive radix tree (a.k.a prefix tree or compact trie)☆29Updated 2 months ago
- Compile Go regular expressions to Go code☆95Updated 2 years ago
- Rolling window implementation in go.☆57Updated 7 months ago
- Fast integer map for uint32-to-uint32☆28Updated last week
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆44Updated 2 years ago
- A buffer pool file I/O library for Go☆54Updated 2 years ago
- A spinlock implementation for Go.☆61Updated 3 years ago
- A fast file-based priority queue☆56Updated 7 months ago
- A simple prometheus metrics and pprof profile viewer.☆46Updated last year
- MUS format serializer for Golang☆79Updated last week
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆80Updated 2 years ago
- Golang library for io_uring (without CGO)☆132Updated 3 years ago
- Off heap golang memory pool☆59Updated 3 years ago
- a unified channel package for buffered, unbuffered, and unbounded channels☆38Updated last year
- A JSON stream parser for Go☆67Updated 2 years ago
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆64Updated 3 months ago
- The `io_uring` library and runtime for GO☆125Updated 2 years ago
- Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.☆53Updated last year
- Go io uring syscall implementation without CGO, rewrite on branch v0.4☆112Updated last year
- 64-bit Roaring Bitmaps in Go☆51Updated last year
- Storing strings without GC overhead☆82Updated 4 years ago
- High throughput primitives library☆49Updated last year
- Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.☆40Updated 8 months ago
- Easy to use Raft library to make your app distributed, highly available and fault-tolerant☆69Updated 2 years ago
- An Adaptive Radix Tree (ART) implementation in Go☆78Updated last year