fsaintjacques / libtwiddle
bit & sketches data structures
☆60Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for libtwiddle
- Benchmark showing the we can randomly hash strings very quickly with good universality☆133Updated 4 years ago
- finding set bits in large bitmaps☆15Updated 8 years ago
- A dependency-based coroutine scheduler☆46Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆80Updated 10 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆108Updated 9 years ago
- Wannabe Main Memory Database and More☆53Updated 3 years ago
- No sane compiler would optimize atomics: the presentation☆106Updated 8 years ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 7 years ago
- Lock-free multithreaded memory allocation☆104Updated 7 years ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- nkvdb - is a numeric time-series database.☆35Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆53Updated 10 months ago
- A simple re-implementation of Google's sparsehash as a learning excercise.☆40Updated 8 months ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Linear vs binary search benchmark☆41Updated 4 years ago
- Exotic Shitty Hash Maybe☆45Updated 9 years ago
- Propositional Encodings in C++11☆18Updated 6 years ago
- Iterator library.☆79Updated 4 years ago
- exokernel style operating system based on lightweight virtual machines☆25Updated 8 years ago
- ☆13Updated 6 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Some code in C that allows one thread to pass items to another thread without locking☆39Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Very late bitcode and data binder☆19Updated 2 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- Container data structure for representing sequences by many fixed-capacity heap-allocated buffers (i.e., chunks).☆23Updated 6 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- Fast 64 bit evolved hash.☆32Updated 7 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago