Difference between revisions of "cpp/container/forward list/sort"
m (Shorten template names. Use {{lc}} where appropriate.) |
Andreas Krug (Talk | contribs) m (langlinks) |
||
| Line 1: | Line 1: | ||
{{include page|cpp/container/sort|forward_list}} | {{include page|cpp/container/sort|forward_list}} | ||
| − | + | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
Latest revision as of 02:49, 2 November 2023
| void sort(); |
(1) | (since C++11) |
| template< class Compare > void sort( Compare comp ); |
(2) | (since C++11) |
Sorts the elements and preserves the order of equivalent elements. No references or iterators become invalidated.
If an exception is thrown, the order of elements in *this is unspecified.
Contents |
[edit] Parameters
| comp | - | comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than (i.e. is ordered before) the second. The signature of the comparison function should be equivalent to the following: bool cmp(const Type1& a, const Type2& b); While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) |
| Type requirements | ||
-Compare must meet the requirements of Compare.
| ||
[edit] Return value
(none)
[edit] Complexity
Given N as std::distance(begin(), end()):
[edit] Notes
std::sort requires random access iterators and so cannot be used with forward_list. This function also differs from std::sort in that it does not require the element type of the forward_list to be swappable, preserves the values of all iterators, and performs a stable sort.
[edit] Example
#include <functional> #include <iostream> #include <forward_list> std::ostream& operator<<(std::ostream& ostr, const std::forward_list<int>& list) { for (const int i : list) ostr << ' ' << i; return ostr; } int main() { std::forward_list<int> list{8, 7, 5, 9, 0, 1, 3, 2, 6, 4}; std::cout << "initially: " << list << '\n'; list.sort(); std::cout << "ascending: " << list << '\n'; list.sort(std::greater<int>()); std::cout << "descending:" << list << '\n'; }
Output:
initially: 8 7 5 9 0 1 3 2 6 4 ascending: 0 1 2 3 4 5 6 7 8 9 descending: 9 8 7 6 5 4 3 2 1 0
[edit] See also
| reverses the order of the elements (public member function) |
