SaschaWitt / ips4o
In-place Parallel Super Scalar Samplesort (IPS⁴o)
☆162Updated 3 months ago
Alternatives and similar repositories for ips4o
Users that are interested in ips4o are comparing it to the libraries listed below
Sorting:
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆119Updated 3 months ago
- A fast alternative to the modulo reduction☆308Updated 4 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆109Updated 4 months ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆31Updated 3 months ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- ☆106Updated last year
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆340Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆278Updated 4 months ago
- A collection of succinct data structures☆201Updated last year
- The Berkeley Container Library☆124Updated last year
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆204Updated 5 years ago
- A fast SIMD parser for CSV files☆151Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated last month
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Fast in-place radix sort with STL-like API☆46Updated 8 years ago
- Bloom-filter based minimal perfect hash function library☆260Updated 2 years ago
- C library implementing the ridiculously fast CLHash hashing function☆277Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- High Performance Streams Based on Coroutine TS ⚡☆150Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆409Updated 4 months ago