SaschaWitt / ips4o
In-place Parallel Super Scalar Samplesort (IPS⁴o)
☆161Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for ips4o
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆114Updated 6 months ago
- A fast alternative to the modulo reduction☆299Updated 3 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆107Updated 8 months ago
- Bloom-filter based minimal perfect hash function library☆248Updated last year
- Experiments with array layouts for comparison-based searching☆80Updated 10 months ago
- The world's first wait-free Software Transactional Memory☆169Updated 4 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆263Updated 10 months ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆400Updated 2 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆30Updated 8 months ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 2 years ago
- Header-only binary fuse and xor filter library☆349Updated 4 months ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Fast integer compression in C using the StreamVByte codec☆376Updated 7 months ago
- A fast SIMD parser for CSV files☆146Updated 2 years ago
- BitMagic Library☆412Updated 2 months ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆111Updated 4 years ago
- Succinct Data Structure Library 3.0☆86Updated 2 months ago
- C library implementing the ridiculously fast CLHash hashing function☆266Updated 7 months ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 4 years ago
- ☆34Updated 2 years ago
- The Berkeley Container Library☆120Updated last year
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆199Updated 5 years ago
- Testing memory-level parallelism☆66Updated 8 months ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆326Updated 7 months ago
- Fast and compact minimal perfect hash functions in C++.☆199Updated last week
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- ☆39Updated 3 years ago
- ☆104Updated 9 months ago
- 🚀 Fast C/C++ bit population count library☆330Updated 4 months ago