splatlab / iceberghashtableLinks
☆65Updated last year
Alternatives and similar repositories for iceberghashtable
Users that are interested in iceberghashtable are comparing it to the libraries listed below
Sorting:
- ☆30Updated last month
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- ☆39Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Benchmarks for our memory allocator☆70Updated 2 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Updated 2 years ago
- 8-bit Xor Filter in C99☆62Updated 5 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆76Updated 3 years ago
- Concurrent trie-hash map library☆93Updated 2 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.☆39Updated 3 months ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated 3 weeks ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆50Updated 5 months ago
- Testing memory-level parallelism☆82Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- ☆44Updated 4 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆39Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Library for lock-free locks☆83Updated 2 years ago
- Concurrent Hash Table☆36Updated 2 weeks ago