TheNumbat / hashtables
Code for https://thenumb.at/Hashtables
☆24Updated 2 years ago
Alternatives and similar repositories for hashtables
Users that are interested in hashtables are comparing it to the libraries listed below
Sorting:
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆73Updated 2 years ago
- Batched random number generation☆17Updated 2 weeks ago
- ☆39Updated 4 years ago
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆45Updated 4 months ago
- xxHash Cleaner C Reference Implementation☆44Updated 4 years ago
- An educational implementation of a modern compressor in Rust☆47Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Testing memory-level parallelism☆68Updated last year
- ☆29Updated last week
- A vectorized single header hash function.☆19Updated 5 months ago
- A very fast 64-bit PRNG with a 2^128 period, proven injectivity, passing BigCrush & PractRand (32TB).☆68Updated this week
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Work Stealing Threadpool in a C Header☆23Updated 9 months ago
- SIMD sorting network generator and very basic tester☆16Updated 3 years ago
- Poireau: a sampling allocation debugger☆87Updated 3 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆31Updated last year
- A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.☆79Updated last week
- c++ library for binary fuse filters, including a sharded filter☆88Updated 3 months ago
- The fiber sourcebook☆22Updated 4 years ago
- Branchless-Lomuto in Pattern-Defeating Quicksort☆48Updated 10 months ago
- C++20 Coroutines and io_uring☆51Updated 2 years ago
- Different algorithms for converting binary to decimal floating-point numbers☆119Updated 2 years ago
- Fast comparison-based sort algorithm☆57Updated 2 years ago
- A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.☆36Updated 10 months ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- A benchmark for sorting algorithms☆60Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- Dynamic runtime inlining with LLVM☆66Updated 3 years ago
- Benchmarks for our memory allocator☆64Updated last year