goldsborough / bloom-cppLinks
A header-only bloom filter implementation in C++14.
☆13Updated 6 years ago
Alternatives and similar repositories for bloom-cpp
Users that are interested in bloom-cpp are comparing it to the libraries listed below
Sorting:
- For details, see the blog post:☆32Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆88Updated 3 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- ☆10Updated 4 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- Concurrent Hash Table☆27Updated last month
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- How fast can we shuffle values?☆37Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆66Updated 4 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- ☆21Updated 7 months ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago