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 2 years ago
- std::map/std::set implementation using the adaptive radix tree☆15Updated 4 years ago
- ☆54Updated last year
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆235Updated 2 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆37Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆33Updated 6 months ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 3 months ago
- Fast AVX512 (AVX-512) quicksort + bitonic sort.☆28Updated 3 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated 3 weeks ago
- An open-source BzTree implementation☆92Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Implementation of Origami: A High-Performance Mergesort Framework☆27Updated 8 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based☆8Updated 7 years ago
- Parallel Balanced Binary Tree Structures☆117Updated 4 months ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆128Updated 4 months ago
- Bit packed vector of integral values☆27Updated 6 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated last month
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- ☆12Updated 4 years 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
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago