salviati / cuckooLinks
Cuckoo hashing for Go
☆83Updated 3 years ago
Alternatives and similar repositories for cuckoo
Users that are interested in cuckoo are comparing it to the libraries listed below
Sorting:
- Non blocking data structures for Go☆267Updated 8 years ago
- gtreap is an immutable treap implementation in the Go Language☆90Updated 3 years ago
- a small circular ring buffer library in go / golang☆188Updated 6 years ago
- go/golang: fast bit set Bloom filter☆136Updated 5 years ago
- Integer Compression Libraries for Go☆132Updated 7 years ago
- Go translation of MetroHash☆110Updated 6 months ago
- Minimal Perfect Hashing for Go☆187Updated 10 months ago
- Bloom-filter based search index☆123Updated 3 years ago
- SIMD for Go☆163Updated 7 years ago
- github.com/cznic/b has moved to modernc.org/b☆220Updated 6 years ago
- github.com/cznic/kv has moved to modernc.org/kv☆413Updated 6 years ago
- Raft in-memory backend implementation with persistence☆84Updated 4 years ago
- github.com/cznic/lldb has moved to modernc.org/lldb☆33Updated 6 years ago
- Simple, ordered, key-value persistence library for the Go Language☆267Updated 4 years ago
- Pure Go implementation of D. J. Bernstein's cdb constant database library.☆226Updated 3 years ago
- A generic lock-free implementation of the "Token-Bucket" algorithm☆145Updated 6 years ago
- Bindings for the LMDB C library☆163Updated 3 years ago
- Very fast, very unsafe serialization for Go☆147Updated 2 years ago
- Streaming TopK estimates☆87Updated 4 years ago
- A generic patricia trie (also called radix tree) implemented in Go (Golang)☆286Updated last week
- CRC32 hash with x64 optimizations☆74Updated 6 years ago
- Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of…☆296Updated 6 years ago
- An epoll(7)-based file-descriptor multiplexer.☆105Updated 8 years ago
- Go wrapper for LMDB - OpenLDAP Lightning Memory-Mapped Database☆185Updated 7 years ago
- Go implementation of SipHash-2-4, a fast short-input PRF created by Jean-Philippe Aumasson and Daniel J. Bernstein.☆286Updated 3 years ago
- Asynchronous read-ahead for Go readers☆233Updated 10 months ago
- High-performance minimalist queue implemented using a stripped-down lock-free ringbuffer, written in Go (golang.org)☆133Updated 7 years ago
- A pure Go implementation of the Pastry Distributed Hash Table☆361Updated 5 years ago
- A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.☆81Updated 8 months ago
- Consistent Hashing Partition Ring for Go (golang)☆132Updated 7 years ago