skarupke / two_bit_mutex
Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
☆25Updated last year
Related projects ⓘ
Alternatives and complementary repositories for two_bit_mutex
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆36Updated 4 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆79Updated 5 years ago
- Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox☆23Updated 10 years ago
- Optimized for systems that read and write large blobs.☆12Updated 9 years ago
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆42Updated 3 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆63Updated 3 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆30Updated 7 years ago
- For details, see the blog post:☆31Updated 10 months ago
- ☆28Updated last week
- A collection of formatting benchmarks☆44Updated 3 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- Code for benchmarking of mutexes to accompany a blog post of mine.☆24Updated 4 years ago
- A fast implementation of log() and exp()☆49Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- ☆43Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆29Updated 6 years ago
- C++17 sports two low-level character conversion functions, std::from_chars and std::to_chars, but they have a usage model that can be ea…☆8Updated 5 years ago
- EDSL for C++ to make just-in-time code generation easier☆82Updated last year
- Benchmarks for our memory allocator☆61Updated last year
- C++20 Static Branch library☆44Updated 2 months ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆28Updated 5 months ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Effective Memory Reclamation☆50Updated 4 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆44Updated 3 years ago
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆41Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆54Updated 11 months ago