llersch / cpp_random_distributionsLinks
Additional C++11 Random Distributions
☆19Updated last year
Alternatives and similar repositories for cpp_random_distributions
Users that are interested in cpp_random_distributions are comparing it to the libraries listed below
Sorting:
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆237Updated last week
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- ☆55Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆284Updated last month
- std::map/std::set implementation using the adaptive radix tree☆15Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- ☆52Updated 10 months ago
- An adaptive radix tree for efficient indexing in main memory.☆165Updated last year
- ☆38Updated 5 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated 2 months ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- Parallel Balanced Binary Tree Structures☆118Updated 6 months ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 8 months ago
- Bit packed vector of integral values☆27Updated 8 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago