std::list::unique

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

Contenitori libreria

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

Membri funzioni Original: Member functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

list::list

list::~list

list::operator=

list::assign

list::get_allocator

Elemento accesso Original: Element access The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

list::front

list::back

Iteratori Original: Iterators The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

list::begin list::cbegin (C++11)

list::end list::cend (C++11)

list::rbegin list::crbegin (C++11)

list::rend list::crend (C++11)

Capacità Original: Capacity The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

list::empty

list::size

list::max_size

Modificatori Original: Modifiers The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

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

Operazioni Original: Operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

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)

Rimuove tutti gli elementi duplicati consecutivi' dal contenitore. Solo il primo elemento in ciascun gruppo di elementi uguali viene lasciato. La prima versione utilizza operator== di confrontare gli elementi, la seconda versione utilizza il predicato binario dato p.

Original:

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.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parametri

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. ​

Valore di ritorno

(Nessuno)

Original:

(none)

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Complessità

Lineare nella dimensione del contenitore

Original:

Linear in the size of the container

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Esempio

#include <iostream>#include <list>   int main(){std::list<int> x ={1, 2, 2, 3, 3, 2, 1, 1, 2};   std::cout<<"contents before:";for(auto val : x)std::cout<<' '<< val;std::cout<<'\n';   x.unique();std::cout<<"contents after unique():";for(auto val : x)std::cout<<' '<< val;std::cout<<'\n';   return0;}

Output:

contents before: 1 2 2 3 3 2 1 1 2 contents after unique(): 1 2 3 2 1 2

Vedi anche

unique	removes consecutive duplicate elements in a range (funzione di modello)