Displaying 1 result from an estimated 1 matches for "last_sort".
Did you mean:
fast_sort
2016 Aug 17
5
code to sort otherwise-unsortable "ilist"s, e.g. symbol tables
...template <class Compare>
void sort_without_temporary_list(Compare comp) {
// The list is empty, vacuously sorted.
if (empty())
return;
// The list has a single element, vacuously sorted.
if (std::next(begin()) == end())
return;
iterator last_sorted{begin()};
iterator just_after_last_sorted{std::next(last_sorted)};
while (end() != just_after_last_sorted) {
while ( (end() != just_after_last_sorted) && ! comp(*just_after_last_sorted,
*last_sorted) ) {
// advance the frontier by one element
++just_af...