rollbear / prio_queueLinks
C++14 cache friendly B-heap priority queue
☆106Updated 3 weeks ago
Alternatives and similar repositories for prio_queue
Users that are interested in prio_queue are comparing it to the libraries listed below
Sorting:
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆183Updated last year
- An open addressing linear probing hash table, tuned for delete heavy workloads☆210Updated 2 years ago
- C++17 inplace_string implementation☆97Updated 7 years ago
- generic stack-based container☆109Updated 7 years ago
- ⏱️ Single-header C++11 RDTSCP clock and timing utilities released into the public domain.☆110Updated 6 years ago
- Lightweight approach to expressing task stealing and balanced parallelism in a C++ programs.☆73Updated 9 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆43Updated 10 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Memory alignment wrappers, useful for avoiding false sharing☆41Updated 9 years ago
- A feature complete LRU cache implementation in C++☆257Updated 5 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆34Updated 7 years ago
- Fixed Point Arithmetic C++14 Library☆112Updated 7 years ago
- Literal Logging for C++☆86Updated 7 years ago
- A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on averag…☆158Updated 3 months ago
- Heap allocation free version of C++11 std::function☆57Updated 4 years ago
- benchmark for various C++ function implementations; focus on invocation time☆95Updated 6 years ago
- Effective Memory Reclamation☆62Updated 5 years ago
- C++ framework for rapid server development☆76Updated last year
- Compile-time-efficient proof-of-concept implementation for std::tuple☆94Updated 4 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- An implementation of Seqlock in C++11☆224Updated last year
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- A prototype implementation of the executors proposal☆85Updated 6 years ago
- contiguous container library - arrays with customizable allocation, small buffer optimization and more☆257Updated 5 years ago
- High performance templated AVL tree using a fixed size array. Extensive test suite passing.☆50Updated 3 years ago
- A STL allocator that mmaps files☆252Updated 4 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆64Updated 2 years ago
- Non-intrusive, high performance C++17 lightweight JSON de/serializer☆68Updated 5 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆129Updated 2 years ago