std::list::unique

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::list
Member functions list::list list::~list list::operator= list::assign list::get_allocator Element access list::front list::back Iterators list::begin list::cbegin (C++11) list::end list::cend (C++11) list::rbegin list::crbegin (C++11) list::rend list::crend (C++11) Capacity list::empty list::size list::max_size Modifiers list::clear list::insert list::emplace (C++11) list::erase list::push_front list::emplace_front (C++11) list::pop_front list::push_back list::emplace_back (C++11) list::pop_back list::resize list::swap Operations list::merge list::splice list::remove list::remove_if list::reverse list::unique list::sort

void unique();	(1)
template< class BinaryPredicate > void unique( BinaryPredicate p );	(2)

Removes all consecutive duplicate elements from the container. Only the first element in each group of equal elements is left. The first version uses operator== to compare the elements, the second version uses the given binary predicate p.

Contents 1 Parameters 2 Return value 3 Example 4 Complexity

[edit] Parameters

p

-

binary predicate which returns ​true if the elements should be treated as equal. The signature of the predicate function should be equivalent to the following: bool pred(const Type1 &a, const Type2 &b); The signature does not need to have const &, but the function must not modify the objects passed to it. The types Type1 and Type2 must be such that an object of type list<T,Allocator>::const_iterator can be dereferenced and then implicitly converted to both of them. ​

[edit] Return value

(none)

[edit] Example

This section is incomplete

[edit] Complexity

linear in the size of the container