rurban / perl-hash-stats
Counting the collisions with perl hash tables per function
☆12Updated 5 years ago
Alternatives and similar repositories for perl-hash-stats:
Users that are interested in perl-hash-stats are comparing it to the libraries listed below
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated last week
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A textual language for binary data.☆37Updated 2 years ago
- A vectorized single header hash function.☆19Updated 2 months ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Crit-bit tree (trie) library☆32Updated 10 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆56Updated 5 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆16Updated 6 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- A word-aligned integer compression algorithm.☆12Updated 6 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆17Updated 8 months ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- ☆13Updated last year
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- Production Performance Telemetry☆21Updated 4 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- Compact tries for fixed-width keys☆25Updated 6 years ago
- Backtrace.io's resilient log record framing format☆36Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A sparse and compressed bitmap library.☆11Updated 10 years ago
- Quick experiment to see how expensive safety is in C, for research☆12Updated 5 years ago