forward_list::unique
Eliminates all but the first element from every consecutive group of equal elements.
void unique();
template<class BinaryPredicate>
void unique(BinaryPredicate _Comp);
Parameters
Parameter |
Description |
|---|---|
_Comp |
The binary predicate used to compare successive elements. |
Remarks
Keeps the first of each unique element, and removes the rest. The elements must be sorted so that elements of equal value are adjacent in the list.
The first member function removes from the controlled sequence every element that compares equal to its preceding element. For the iterators Pi and Pj designating elements at positions i and j, the second member function removes every element for which i + 1 == j && _Comp(*Pi, *Pj).
For a controlled sequence of length N (> 0), the predicate _Comp(*Pi, *Pj) is evaluated N - 1 times.
An exception occurs only if _Comp throws an exception. In that case, the controlled sequence is left in an unspecified state and the exception is rethrown.
Requirements
Header: <forward_list>
Namespace: std