jermp / essentials
Essential C++ utilities.
☆15Updated 6 months ago
Alternatives and similar repositories for essentials:
Users that are interested in essentials are comparing it to the libraries listed below
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years 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 …☆22Updated 2 years ago
- Bit packed vector of integral values☆26Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- For details, see the blog post:☆32Updated last year
- ☆20Updated 3 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆37Updated 4 years ago
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- A compressed, associative, exact, and weighted dictionary for k-mers.☆86Updated 3 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 11 months ago
- An exploratory implementation of bit overloads of the C++ standard algorithms☆18Updated 3 years ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆26Updated 4 months ago
- C++17 Implementation of Dynamic Filter Trie☆8Updated 3 years ago
- Bicriteria Data Compressor☆14Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 4 months ago
- LZ Double factor Factorization.☆11Updated 7 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆17Updated last month
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- String Matching Algorithms Research Tool☆99Updated 9 months ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- ☆12Updated 8 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆27Updated 2 months ago