[ Web Proxy ]
URL:
Viewing: https://de.cppreference.com/cpp/container/list/unique [Back]  [Original]
std::list::unique cppreference.com
cppreference.com
Namensrume
Varianten

    std::list::unique

    Aus cppreference.com

    [edit template]
    []

    This page has been machine-translated from the English version of the wiki using Google Translate.

    The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here.

    Click here for the English version of this page

    <metanoindex/>

     
    C++
     
    Container-Bibliothek
     
    std::list
    Member-Funktionen
    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
    Elementzugriff zerstrt
    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
    Iteratoren
    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)
    Kapazitt
    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
    Modifiers
    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
    Operations
    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)
    Entfernt alle aufeinander doppelte Elemente aus dem Behlter. Nur das erste Element in jeder Gruppe von Elementen gleich bleibt. Die erste Version verwendet operator== um die Elemente zu vergleichen, verwendet die zweite Version des gegebenen binren Prdikats 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.

    Parameter

    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.

    Rckgabewert

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

    Komplexitt

    Linear in der Gre des Behlters
    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.

    Beispiel

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

    Output: 

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

    Siehe auch

    		 removes consecutive duplicate elements in a range
    (Funktions-Template) [edit]
    Web Proxy Viewer  |  New URL  |  Original Page