fsaintjacques / libtwiddle
bit & sketches data structures
☆60Updated 6 years ago
Alternatives and similar repositories for libtwiddle:
Users that are interested in libtwiddle are comparing it to the libraries listed below
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆136Updated 2 months ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆108Updated 9 years ago
- A dependency-based coroutine scheduler☆45Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆82Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- fast SIMD-able JIT regular expression compiler☆193Updated 9 years ago
- No sane compiler would optimize atomics: the presentation☆106Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- Some code in C that allows one thread to pass items to another thread without locking☆39Updated 8 years ago
- Wannabe Main Memory Database and More☆53Updated 4 years ago
- Many functions in C for sorting the nibbles in an 8-byte word☆33Updated 10 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- Fast decoder for VByte-compressed integers☆122Updated 10 months ago
- Mirror of libslz☆34Updated 5 years ago
- An arrow-based parser combinator library for C☆40Updated 14 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Iterator library.☆79Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Container data structure for representing sequences by many fixed-capacity heap-allocated buffers (i.e., chunks).☆23Updated 6 years ago
- Tweaked version of "Aha" - "A Hacker's Assistant" superoptimiser by Henry S. Warren☆58Updated 2 years ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- Demonstrating the importance of laying out data in memory.☆47Updated 7 years ago