Namespaces
Variants
Actions

std::forward_list<T,Allocator>::sort

From cppreference.com

[edit template]
 
C++
 
Containers library
 
std::forward_list
Member functions
Non-member functions
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides (C++17)
 
void sort();
 (1) (since C++11)
(constexpr since C++26)
template< class Compare >
void sort( Compare comp );
 (2) (since C++11)
(constexpr since C++26)

Sorts the elements and preserves the order of equivalent elements. If an exception is thrown, the order of elements in *this is unspecified.

1) Elements are compared using operator<.
2) Elements are compared using comp.

No references or iterators become invalidated.

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) Type1 and Type2 regardless of value category (thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)).
The types Type1 and Type2 must be such that an object of type forward_list<T,Allocator>::const_iterator can be dereferenced and then implicitly converted to both of them. ​

Type requirements
-
Compare must meet the requirements of Compare.

[edit] Complexity

Given N as std::distance(begin(), end()):

1) Approximately N·log(N) comparisons using operator<.
2) Approximately N·log(N) applications of the comparison function comp.

[