lemire / programmingishard
Long-term book project
☆34Updated 3 years ago
Alternatives and similar repositories for programmingishard:
Users that are interested in programmingishard are comparing it to the libraries listed below
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Quick sort code using AVX2 instructions☆68Updated 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 10 months ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- LLVM-jitted bitmaps☆27Updated 4 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- Optimizing database queries with array programming☆18Updated 4 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Popular hash table implementation benchmarks☆27Updated 7 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- ☆25Updated 7 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Multiplying... backward?☆13Updated 4 years ago
- ☆13Updated 6 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆29Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- a 64-bit histogram / quantile sketch☆58Updated last month
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- bit & sketches data structures☆60Updated 6 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- ☆27Updated 2 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆41Updated 8 years ago
- ☆39Updated 4 years ago