rescrv / redupeLinks
redupe implements forward error correction
☆20Updated 7 years ago
Alternatives and similar repositories for redupe
Users that are interested in redupe are comparing it to the libraries listed below
Sorting:
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆104Updated 10 months ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Backtrace.io's resilient log record framing format☆38Updated 3 years ago
- ♥ Janusz Brzozowski☆164Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- High fidelity benchmark runner☆89Updated 3 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- Binary floating-point to decimal string conversion algorithm.☆104Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 6 months ago
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- Buildsome: The awesome build system☆53Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 6 months ago
- BSD Licensed Bignum Library☆233Updated last year
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago
- qp tries and crit-bit tries☆120Updated 3 years ago
- Kodkod solver for relational logic☆77Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Blocky archive - multithreaded archiver offering bit rot protection and sector level recoverability☆95Updated 3 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Compact Data Structures Library☆126Updated 10 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 6 months ago
- An implementation of Ngo et al's GenericJoin in timely dataflow.☆89Updated 6 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- A (parametrized) Rust SAT solver originally based on MiniSat☆31Updated 6 months ago
- A qp-trie implementation in Rust☆44Updated 6 months ago
- A lightweight Datalog engine in Rust☆57Updated last month