kampersanda / xcdatLinks
Fast compressed trie dictionary library
☆70Updated last year
Alternatives and similar repositories for xcdat
Users that are interested in xcdat are comparing it to the libraries listed below
Sorting:
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- For details, see the blog post:☆33Updated last year
- Compact Data Structures Library☆101Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- C Minimal Perfect Hashing Library☆86Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆237Updated last week
- SIMD (SSE) string functions☆102Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 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 …☆26Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- String Matching Algorithms Research Tool☆104Updated last year
- ☆16Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆220Updated 2 weeks ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification☆261Updated 3 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago