demerphq / BeagleHashLinks
Fast 64 bit evolved hash.
☆33Updated 8 years ago
Alternatives and similar repositories for BeagleHash
Users that are interested in BeagleHash are comparing it to the libraries listed below
Sorting:
- ☆11Updated 7 years ago
- minimal perfect hash functions☆62Updated 3 years ago
- fixed-length integer trim☆34Updated 2 years ago
- Interactive object file browser with symbol, source, assembly, and analysis☆22Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- SSE string functions for x86-64 Linux☆21Updated 3 years ago
- Assembly-optimized Marvin32 hash function☆12Updated last year
- SSE-optimized group varint integer encoding☆37Updated 2 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Fast and scalable minimal perfect hashing for massive key sets☆71Updated 5 years ago
- simple consistent hashing implementation☆55Updated 7 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Hollow Heaps for Go☆20Updated 7 years ago
- ☆26Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 8 years ago
- x86-64 instruction encoder in Go☆21Updated 5 years ago
- an adaptive radix tree implementation in go☆69Updated 3 years ago
- Simple out-of-process invoker☆18Updated 3 weeks ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- github.com/cznic/ccir has moved to modernc.org/ccir☆29Updated 6 years ago
- A Variable-Length String Hashing Library in C++☆44Updated 6 years ago
- A high-performance, memory-efficient concurrent hash table☆36Updated 11 years ago
- LLVM IR generation "middle end" for LLVM-based go compiler.☆18Updated 2 years ago
- An inverted trigram index for accelerated string matching in Sqlite.☆78Updated 11 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago