|
EnTT 4.0.0
|
Function object to wrap stl::sort in a class type. More...
#include <algorithm.hpp>
Public Member Functions | |
| template<typename Compare = stl::less<>, typename... Args> | |
| void | operator() (stl::random_access_iterator auto first, stl::random_access_iterator auto last, Compare compare=Compare{}, Args &&...args) const |
| Sorts the elements in a range. | |
Function object to wrap stl::sort in a class type.
Unfortunately, stl::sort cannot be passed as template argument to a class template or a function template.
This class fills the gap by wrapping some flavors of stl::sort in a function object.
Definition at line 22 of file algorithm.hpp.
|
inline |
Sorts the elements in a range.
Sorts the elements in a range using the given binary comparison function.
| Compare | Type of comparison function object. |
| Args | Types of arguments to forward to the sort function. |
| first | An iterator to the first element of the range to sort. |
| last | An iterator past the last element of the range to sort. |
| compare | A valid comparison function object. |
| args | Arguments to forward to the sort function, if any. |
Definition at line 36 of file algorithm.hpp.