rantala / string-sorting
A collection of string sorting algorithms
☆52Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for string-sorting
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 5 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 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 …☆21Updated 2 years ago
- Vectorized version of the PCG random number generator☆75Updated 5 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 6 months ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Fast in-place radix sort with STL-like API☆45Updated 7 years ago
- ☆13Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆60Updated 9 months ago
- For details, see the blog post:☆31Updated 10 months ago
- simd algorithms☆9Updated 9 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 3 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- Non-blocking message passing (a C++14 MPI wrapper)☆18Updated 10 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 8 months ago
- Roman Klyujkov's Practical Algorithm Template library☆23Updated 2 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆43Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months ago
- FOundation of stXXl and thriLL☆14Updated 9 months ago
- A C++ library for integer array compression☆27Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- A benchmark for sorting algorithms☆58Updated 3 years ago
- An exploratory implementation of bit overloads of the C++ standard algorithms☆18Updated 3 years ago
- Experiments with array layouts for comparison-based searching☆80Updated 10 months ago