std::forward_list::unique

 

C++

Idioma

Conceptos

Utilidades de la biblioteca

Strings biblioteca

Contenedores biblioteca

Algoritmos biblioteca

Los iteradores biblioteca

Numéricos biblioteca

Entrada / salida de la biblioteca

Localizaciones biblioteca

Expresiones biblioteca Regular (C++11)

Operaciones de biblioteca Atómica (C++11)

Tema Biblioteca de ayuda (C++11)

 

Contenedores 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::forward_list

Las funciones miembro 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.

forward_list::forward_list

forward_list::~forward_list

forward_list::operator=

forward_list::assign

forward_list::get_allocator

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

forward_list::front

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

forward_list::before_begin forward_list::cbefore_begin

forward_list::begin forward_list::cbegin

forward_list::end forward_list::cend

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

forward_list::empty

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

forward_list::clear

forward_list::insert_after

forward_list::emplace_after

forward_list::erase_after

forward_list::push_front

forward_list::emplace_front

forward_list::pop_front

forward_list::resize

forward_list::swap

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

forward_list::merge

forward_list::splice_after

forward_list::remove forward_list::remove_if

forward_list::reverse

forward_list::unique

forward_list::sort

 

void unique();	(1)	(ya que C + +11)
template< class BinaryPredicate > void unique( BinaryPredicate p );	(2)	(ya que C + +11)

Elimina todos' consecutivo duplicados elementos del contenedor. Sólo el primer elemento de cada grupo de elementos iguales se deja. La primera versión utiliza operator== para comparar los elementos, la segunda versión utiliza el predicado binario 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 forward_list<T,Allocator>::const_iterator can be dereferenced and then implicitly converted to both of them. ​

Valor de retorno

(Ninguno)

Original:

(none)

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

Complejidad

Lineal en el tamaño del 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.

Ejemplo

#include <iostream>
#include <forward_list>
 
int main()
{
  std::forward_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;
}

Output:

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

Ver también

unique	removes consecutive duplicate elements in a range (función de plantilla)