google / redgrepLinks
♥ Janusz Brzozowski
☆163Updated last year
Alternatives and similar repositories for redgrep
Users that are interested in redgrep are comparing it to the libraries listed below
Sorting:
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 7 months ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago
- Critbit trees in C☆335Updated 3 years ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆105Updated 11 months ago
- Binary floating-point to decimal string conversion algorithm.☆104Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- BSD Licensed Bignum Library☆232Updated last year
- An-source C library developed and used at AppNexus.☆110Updated 5 years ago
- Parser combinators for binary formats, in C. Yes, in C. What? Don't look at me like that.☆287Updated 4 years ago
- Compact Data Structures Library☆128Updated 10 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Python bindings for libgccjit.so☆48Updated 9 years ago
- A collection of succinct data structures☆207Updated last year
- bit & sketches data structures☆60Updated 6 years ago
- Parse any language you can describe in BNF☆160Updated last year
- No sane compiler would optimize atomics: the presentation☆107Updated 8 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Updated 12 years ago
- C library implementing the ridiculously fast CLHash hashing function☆280Updated last year
- STM (Software Transactional Memory) implementation in C, based on memory-mapping.☆60Updated 15 years ago
- High fidelity benchmark runner☆89Updated 4 years ago
- A system for creating fast, reusable parsers☆171Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Compiler intermediate language for static analysis.☆107Updated 6 years ago