Note
Access to this page requires authorization. You can try signing in or changing directories.
Access to this page requires authorization. You can try changing directories.
Arranges the elements in ascending order or with an order specified by a predicate.
void sort();
template<class Predicate>
void sort(Predicate _Pred);
Parameters
Parameter |
Description |
---|---|
_Pred |
The ordering predicate. |
Remarks
Both member functions order the elements in the controlled sequence by a predicate, described below.
For the iterators Pi and Pj designating elements at positions i and j, the first member function imposes the order !(*Pj < *Pi) whenever i < j. (The elements are sorted in ascending order.) The member template function imposes the order !_Pred(*Pj, *Pi) whenever i < j. No ordered pairs of elements in the original controlled sequence are reversed in the resulting controlled sequence. (The sort is stable.)
An exception occurs only if _Pred throws an exception. In that case, the controlled sequence is left in unspecified order and the exception is rethrown.
Requirements
Header: <forward_list>
Namespace: std