This is a wrapper around the Binary Heap, Quad Heap and Min-Max Heap written by Malte Skarupke and the Heap implementation provided by the stl. See also this blog post. I only stripped out some includes and tried to make the header as leight weight as possible : the file Heap.h expands to roughly 4k loc after preprocessing while <queue> expands to roughly 23k loc after preprocessing. Measuring compile times of a single instantiation of the Heap template vs the std::priority_queue template I got 80ms vs 240ms.
For the make heap operations
For emplace
and last but not least for just extract (this benchmark stops and resumes the clock which induces a relatively big performance hit)
If you want to run the benchmark yourself, comment out the correct benchmarks in the main.cpp file and run
git submodule update --recursive
mkdir build && cd build && cmake .. -DCMAKE_BUILD_TYPE=Release
make -j
./bench --benchmark_format=csv | python ../plot.py
*my system Running ./bench Run on (28 X 4300 MHz CPU s) CPU Caches: L1 Data 32 KiB (x14) L1 Instruction 32 KiB (x14) L2 Unified 1024 KiB (x14) L3 Unified 19712 KiB (x1) Load Average: 0.33, 0.49, 0.63