stxxl / foxxllLinks
FOundation of stXXl and thriLL
β14Updated last year
Alternatives and similar repositories for foxxll
Users that are interested in foxxll are comparing it to the libraries listed below
Sorting:
- An efficient external-memory algorithm for the construction of minimal perfect hash functionsβ64Updated last year
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ46Updated last year
- Ultra fast MSD radix sorterβ11Updated 5 years ago
- Dynamic succinct/compressed data structuresβ111Updated last year
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β34Updated 9 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Constructionβ51Updated 6 years ago
- Succinct Data Structure Libraryβ107Updated 12 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.β14Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).β55Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- C library to compute the Hamming weight of arraysβ49Updated 6 years ago
- Compact Data Structures Libraryβ101Updated 3 years ago
- A collection of string sorting algorithmsβ55Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set unionβ41Updated 5 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindingsβ154Updated last year
- Succinct Data Structure Library 3.0β95Updated 2 months ago
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ25Updated 2 years ago
- C++ Implementation of Zip Treesβ14Updated 2 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental rβ¦β107Updated 10 years ago
- SIMD recipes, for various platforms (collection of code snippets)β49Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ48Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequencesβ55Updated last year
- Relative data structures based on the BWTβ12Updated 7 years ago
- Compact Tree Representationβ16Updated 8 years ago
- A locality-sensitive hashing libraryβ46Updated 11 years ago
- AVX512F and AVX2 versions of quick sortβ104Updated 7 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β20Updated 3 weeks ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β31Updated 6 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating thβ¦β116Updated 9 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexesβ25Updated 3 years ago