bonitao / cmphLinks
☆20Updated 3 years ago
Alternatives and similar repositories for cmph
Users that are interested in cmph are comparing it to the libraries listed below
Sorting:
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- benchmarking positional population count☆15Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆39Updated 4 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- For details, see the blog post:☆32Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Vectorized version of the PCG random number generator☆80Updated 4 months ago
- A C++ library for integer array compression☆29Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ☆39Updated 4 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆67Updated 4 years ago
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆45Updated 6 months ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Updated 3 years ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆26Updated 10 months ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Efficient Prefix-Sum data structures in C++.☆26Updated last year
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 6 months ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago