tvanslyke / timsort-cpp
A fine-tuned, highly-optimized timsort implementation for C++17.
☆47Updated 6 years ago
Related projects: ⓘ
- Git mirror of the official (mercurial) repository of cpp-btree☆74Updated 10 years ago
- fast prime sieve and hash algorithm☆37Updated 8 months ago
- Fast Concurrent Memoization Map (fcmm) is an almost lock-free concurrent hashmap written in C++11 to be used for memoization in concurren…☆51Updated 6 years ago
- Sample implementation of C++20 atomic_wait/notify☆56Updated 5 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆176Updated 9 months ago
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 8 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 9 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆120Updated last year
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- STL-based caches for C++☆113Updated last year
- EDSL for C++ to make just-in-time code generation easier☆79Updated last year
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Boost.Coroutine☆79Updated 3 weeks ago
- C++ framework for rapid server development☆76Updated 7 months ago
- Proposed B-tree library for Boost.org☆71Updated 10 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆48Updated 7 months ago
- A benchmark of some prominent C/C++ hash table implementations☆37Updated 3 years ago
- Boost.org multi_index module☆46Updated last month
- A C++ stream using LZ4 (de)compression☆38Updated 2 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆51Updated 8 years ago
- A prototype implementation of the executors proposal☆84Updated 5 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 9 months ago
- STL compatible implementation of hash map optimized for concurrent access☆24Updated 4 years ago
- Boost.Sort☆50Updated 2 weeks ago
- A C++14-and-later expression template library☆107Updated last month
- Enjoy template metaprogramming☆112Updated 7 years ago
- Linear vs binary search benchmark☆40Updated 4 years ago
- Boost.org mpl module☆49Updated last month
- Compile-time-efficient proof-of-concept implementation for std::tuple☆91Updated 3 years ago