This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/69565] Heap operations could surely be faster
- From: "morwenn29 at hotmail dot fr" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Thu, 11 Aug 2016 09:58:48 +0000
- Subject: [Bug libstdc++/69565] Heap operations could surely be faster
- Auto-submitted: auto-generated
- References: <bug-69565-4@http.gcc.gnu.org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=69565
--- Comment #3 from Morwenn <morwenn29 at hotmail dot fr> ---
It was a modified version of the following benchmark for sorting algorithms:
https://github.com/Morwenn/cpp-sort/blob/master/benchmarks/bench.cpp
I benchmarked the library's heap_sort (which is basically a copy-paste of
libc++'s make_heap + sort_heap) against the standard library's std::make_heap +
std::sort_heap. I was using MinGW with GCC 5.3 at the time, so the standard
functions corresponded to those in libstdc++.