senderista / hashtable-benchmarksLinks
An Evaluation of Linear Probing Hashtable Algorithms
☆32Updated last year
Alternatives and similar repositories for hashtable-benchmarks
Users that are interested in hashtable-benchmarks are comparing it to the libraries listed below
Sorting:
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Integer Map Data Structure☆131Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Poireau: a sampling allocation debugger☆99Updated 3 years ago
- ☆39Updated 4 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 6 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆73Updated 2 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Two-Phase Locking with Starvation-Freedom☆23Updated 2 years ago
- An-source C library developed and used at AppNexus.☆110Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- c++ library for binary fuse filters, including a sharded filter☆90Updated 6 months ago
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆196Updated last year
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆104Updated 10 months ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 6 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- C library to remove white space from strings as fast as possible☆154Updated 10 months ago
- Different algorithms for converting binary to decimal floating-point numbers☆121Updated 2 years ago
- a 64-bit histogram / quantile sketch☆59Updated 6 months ago
- A collection of array rotation algorithms.☆155Updated 2 years ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Query C++ codebases using SQLite☆188Updated 3 years ago