Espaces de noms
Variantes

    std::forward_list::unique

    De cppreference.com
    See More

    [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++
     
    Bibliothèque de conteneurs
     
    std::forward_list
    Les fonctions membres
    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
    Elément d'accès
    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
    Les itérateurs
    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
    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.
    forward_list::empty
    forward_list::max_size
    Modificateurs
    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
    Opérations
    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
     
    <tbody> </tbody>
    void unique();
    		 (1) (depuis C++11)
    template< class BinaryPredicate > void unique( BinaryPredicate p );
    		 (2) (depuis C++11)
    Supprime tous' consécutive en double les éléments du conteneur. Seul le premier élément de chaque groupe d'éléments égal reste. La première version utilise operator== de comparer les éléments, la deuxième version utilise le prédicat binaire donné 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.

    Paramètres

    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.

    ​

    Retourne la valeur

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

    Complexité

    Linéaire à la taille du récipient
    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.

    Exemple

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

    Résultat : 

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

    Voir aussi
    supprime les doublons successifs dans une plage
    Original:
    removes consecutive duplicate elements in a range
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    (fonction générique) [edit]