jermp / essentials
Essential C++ utilities.
☆15Updated 3 months ago
Related projects: ⓘ
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆14Updated last week
- Compact Tree Representation☆16Updated 7 years ago
- Bit packed vector of integral values☆25Updated last year
- Efficient Prefix-Sum data structures in C++.☆24Updated 11 months ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆83Updated 2 weeks ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- C++17 Implementation of Dynamic Filter Trie☆9Updated 2 years ago
- LZ Double factor Factorization.☆11Updated 7 years ago
- An exploratory implementation of bit overloads of the C++ standard algorithms☆18Updated 3 years ago
- ☆14Updated 3 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 7 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Five implementations of double linked lists to demonstrate generic data structures in C☆15Updated 4 years ago
- ☆20Updated 2 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆42Updated 10 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- For details, see the blog post:☆31Updated 9 months ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆40Updated 2 weeks ago
- Universe-sliced indexes in C++.☆17Updated last year
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆25Updated 3 weeks ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- Bicriteria Data Compressor☆14Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆25Updated 2 weeks ago
- Wavelet tree based on a fixed block boosting technique☆14Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 3 years ago
- C++ Implementation of Zip Trees☆13Updated last year
- A comparative, extendible benchmarking suite for C and C++ hash-table libraries.☆21Updated 3 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆44Updated 4 years ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆25Updated 5 years ago