std::list::unique

<metanoindex/>

 

C++

Suporte ao Compilador

Freestanding and hosted

Linguagem

Headers da Biblioteca Standard

Requerimentos nomeados

Feature test macros (C++20)

Biblioteca de suporte de língua

Biblioteca de conceitos (C++20)

Biblioteca de diagnósticos

Biblioteca de utilitários em geral

Biblioteca de strings

Biblioteca de containers

Ranges library (C++20)

Biblioteca de iteradores

Biblioteca de algorítmos

Biblioteca numérica

Biblioteca de localizações

Biblioteca de input/output

Biblioteca de sistema de arquivo (C++17)

Biblioteca de expressões regulares (C++11)

Biblioteca de operações atômicas (C++11)

Biblioteca de suporte de thread (C++11)

Especificações Técnicas

Índice de symbolos

Bibliotecas externas

 

Recipientes biblioteca

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

Funções de membro 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

acesso. Elemento 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

Iteradores 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)

Capacidade 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

Modificadores 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

Operações 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

 

<tbody> </tbody>

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

Remove todos os' consecutivo duplicados elementos do recipiente. Apenas o primeiro elemento de cada grupo de elementos iguais é deixado. A primeira versão utiliza operator== para comparar os elementos, a segunda versão usa o predicado binário dado 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.

Parâmetros

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

Valor de retorno

(Nenhum)

Original:

(none)

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

Complexidade

Linear no tamanho do recipiente

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.

Exemplo

#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';

  return 0;
}

Saída:

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

Veja também

unique	removes consecutive duplicate elements in a range (modelo de função)