Namespaces
Variants

Standard library header <set>

From cppreference.net
C++
Standard library headers

Cet en-tête fait partie de la bibliothèque de conteneurs .

Table des matières

Inclusions

(C++20)
Opérateur de comparaison à trois voies support
(C++11)
std::initializer_list modèle de classe

Classes

collection de clés uniques, triées par clés
(modèle de classe)
collection de clés, triées par clés
(modèle de classe)

Fonctions

(supprimé en C++20) (supprimé en C++20) (supprimé en C++20) (supprimé en C++20) (supprimé en C++20) (C++20)
compare lexicographiquement les valeurs de deux set s
(modèle de fonction)
spécialise l'algorithme std::swap
(modèle de fonction)
(C++20)
efface tous les éléments satisfaisant des critères spécifiques
(modèle de fonction)
(supprimé en C++20) (supprimé en C++20) (supprimé en C++20) (supprimé en C++20) (supprimé en C++20) (C++20)
compare lexicographiquement les valeurs de deux multiset s
(modèle de fonction)
spécialise l'algorithme std::swap
(modèle de fonction)
(C++20)
efface tous les éléments satisfaisant des critères spécifiques
(modèle de fonction)
Accès aux plages
(C++11) (C++14)
retourne un itérateur vers le début d'un conteneur ou d'un tableau
(fonction template)
(C++11) (C++14)
retourne un itérateur vers la fin d'un conteneur ou d'un tableau
(modèle de fonction)
(C++14)
retourne un itérateur inverse vers le début d'un conteneur ou d'un tableau
(modèle de fonction)
(C++14)
retourne un itérateur de fin inverse pour un conteneur ou un tableau
(modèle de fonction)
(C++17) (C++20)
renvoie la taille d'un conteneur ou d'un tableau
(modèle de fonction)
(C++17)
vérifie si le conteneur est vide
(modèle de fonction)
(C++17)
obtient le pointeur vers le tableau sous-jacent
(fonction template)

Synopsis 

#include <compare>
#include <initializer_list>
namespace std {
  // modèle de classe set
  template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
  class set;
  template<class Key, class Compare, class Allocator>
  bool operator==(const set<Key, Compare, Allocator>& x,
                  const set<Key, Compare, Allocator>& y);
  template<class Key, class Compare, class Allocator>
  /*synth-three-way-result*/<Key> operator<=>(const set<Key, Compare, Allocator>& x,
                                              const set<Key, Compare, Allocator>& y);
  template<class Key, class Compare, class Allocator>
  void swap(set<Key, Compare, Allocator>& x,
            set<Key, Compare, Allocator>& y) noexcept(noexcept(x.swap(y)));
  // effacement pour set
  template<class Key, class Compare, class Allocator, class Predicate>
  typename set<Key, Compare, Allocator>::size_type erase_if(
    set<Key, Compare, Allocator>& c,
    Predicate pred);
  // modèle de classe multiset
  template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
  class multiset;
  template<class Key, class Compare, class Allocator>
  bool operator==(const multiset<Key, Compare, Allocator>& x,
                  const multiset<Key, Compare, Allocator>& y);
  template<class Key, class Compare, class Allocator>
  /*synth-three-way-result*/<Key> operator<=>(const multiset<Key, Compare, Allocator>& x,
                                              const multiset<Key, Compare, Allocator>& y);
  template<class Key, class Compare, class Allocator>
  void swap(multiset<Key, Compare, Allocator>& x,
            multiset<Key, Compare, Allocator>& y) noexcept(noexcept(x.swap(y)));
  // effacement pour multiset
  template<class Key, class Compare, class Allocator, class Predicate>
  typename multiset<Key, Compare, Allocator>::size_type erase_if(
    multiset<Key, Compare, Allocator>& c,
    Predicate pred);
  namespace pmr {
    template<class Key, class Compare = less<Key>>
    using set = std::set<Key, Compare, polymorphic_allocator<Key>>;
    template<class Key, class Compare = less<Key>>
    using multiset = std::multiset<Key, Compare, polymorphic_allocator<Key>>;
  }
}

Modèle de classe std::set 

namespace std {
  template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
  class set
  {
  public:
    // types
    using key_type               = Key;
    using key_compare            = Compare;
    using value_type             = Key;
    using value_compare          = Compare;
    using allocator_type         = Allocator;
    using pointer                = typename allocator_traits<Allocator>::pointeur;
    using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
    using reference              = value_type&;
    using const_reference        = const value_type&;
    using size_type              = /* défini par l'implémentation */;
    using difference_type        = /* défini par l'implémentation */;
    using iterator               = /* défini par l'implémentation */;
    using const_iterator         = /* défini par l'implémentation */;
    using reverse_iterator       = std::reverse_iterator<iterator>;
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
    using node_type              = /* non spécifié */;
    using insert_return_type     = /*insert-return-type*/<iterator, node_type>;
    // construction/copie/destruction
    set()
      : set(Compare())
    {
    }
    explicit set(const Compare& comp, const Allocator& = Allocator());
    template<class InputIter>
    set(InputIter first,
        InputIter last,
        const Compare& comp = Compare(),
        const Allocator&    = Allocator());
    template<container-compatible-range<value_type> R>
    set(from_range_t,
        R&& rg,
        const Compare& comp = Compare(),
        const Allocator&    = Allocator());
    set(const set& x);
    set(set&& x);
    explicit set(const Allocator&);
    set(const set&, const type_identity_t<Allocator>&);
    set(set&&, const type_identity_t<Allocator>&);
    set(initializer_list<value_type>,
        const Compare&   = Compare(),
        const Allocator& = Allocator());
    template<class InputIter>
    set(InputIter first, InputIter last, const Allocator& a)
      : set(first, last, Compare(), a)
    {
    }
    template<container-compatible-range<value_type> R>
      set(from_range_t, R&& rg, const Allocator& a))
        : set(from_range, std::forward<R>(rg), Compare(), a)
    {
    }
    set(initializer_list<value_type> il, const Allocator& a)
      : set(il, Compare(), a)
    {
    }
    ~set();
    set& operator=(const set& x);
    set& operator=(set&& x) noexcept(allocator_traits<Allocator>::is_always_equal::value&&
                                       is_nothrow_move_assignable_v<Compare>);
    set& operator=(initializer_list<value_type>);
    allocator_type get_allocator() const noexcept;
    // itérateurs
    iterator begin() noexcept;
    const_iterator begin() const noexcept;
    iterator end() noexcept;
    const_iterator end() const noexcept;
    reverse_iterator rbegin() noexcept;
    const_reverse_iterator rbegin() const noexcept;
    reverse_iterator rend() noexcept;
    const_reverse_iterator rend() const noexcept;
    const_iterator cbegin() const noexcept;
    const_iterator cend() const noexcept;
    const_reverse_iterator crbegin() const noexcept;
    const_reverse_iterator crend() const noexcept;
    // capacité
    bool empty() const noexcept;
    size_type size() const noexcept;
    size_type max_size() const noexcept;
    // modificateurs
    template<class... Args>
    pair<iterator, bool> emplace(Args&&... args);
    template<class... Args>
    iterator emplace_hint(const_iterator position, Args&&... args);
    pair<iterator, bool> insert(const value_type& x);
    pair<iterator, bool> insert(value_type&& x);
    template<class K>
    pair<iterator, bool> insert(K&& x);
    iterator insert(const_iterator position, const value_type& x);
    iterator insert(const_iterator position, value_type&& x);
    template<class K>
    iterator insert(const_iterator position, K&& x);
    template<class InputIter>
    void insert(InputIter first, InputIter last);
    template<container-compatible-range<value_type> R>
    void insert_range(R&& rg);
    void insert(initializer_list<value_type>);
    node_type extract(const_iterator position);
    node_type extract(const key_type& x);
    template<class K>
    node_type extract(K&& x);
    insert_return_type insert(node_type&& nh);
    iterator insert(const_iterator hint, node_type&& nh);
    iterator erase(iterator position)
      requires(!same_as<iterator, const_iterator>);
    iterator erase(const_iterator position);
    size_type erase(const key_type& x);
    template<class K>
    size_type erase(K&& x);
    iterator erase(const_iterator first, const_iterator last);
    void swap(set&) noexcept(allocator_traits<Allocator>::is_always_equal::value&&
                               is_nothrow_swappable_v<Compare>);
    void clear() noexcept;
    template<class C2>
    void merge(set<Key, C2, Allocator>& source);
    template<class C2>
    void merge(set<Key, C2, Allocator>&& source);
    template<class C2>
    void merge(multiset<Key, C2, Allocator>& source);
    template<class C2>
    void merge(multiset<Key, C2, Allocator>&& source);
    // observateurs
    key_compare key_comp() const;
    value_compare value_comp() const;
    // opérations sur les ensembles
    iterator find(const key_type& x);
    const_iterator find(const key_type& x) const;
    template<class K>
    iterator find(const K& x);
    template<class K>
    const_iterator find(const K& x) const;
    size_type count(const key_type& x) const;
    template<class K>
    size_type count(const K& x) const;
    bool contains(const key_type& x) const;
    template<class K>
    bool contains(const K& x) const;
    iterator lower_bound(const key_type& x);
    const_iterator lower_bound(const key_type& x) const;
    template<class K>
    iterator lower_bound(const K& x);
    template<class K>
    const_iterator lower_bound(const K& x) const;
    iterator upper_bound(const key_type& x);
    const_iterator upper_bound(const key_type& x) const;
    template<class K>
    iterator upper_bound(const K& x);
    template<class K>
    const_iterator upper_bound(const K& x) const;
    pair<iterator, iterator> equal_range(const key_type& x);
    pair<const_iterator, const_iterator> equal_range(const key_type& x) const;
    template<class K>
    pair<iterator, iterator> equal_range(const K& x);
    template<class K>
    pair<const_iterator, const_iterator> equal_range(const K& x) const;
  };
  template<class InputIter,
           class Compare   = less</*iter-value-type*/<InputIter>>,
           class Allocator = allocator</*iter-value-type*/<InputIter>>>
  set(InputIter, InputIter, Compare = Compare(), Allocator = Allocator())
    -> set</*iter-value-type*/<InputIter>, Compare, Allocator>;
  template<ranges::input_range R,
           class Compare   = less<ranges::range_value_t<R>>,
           class Allocator = allocator<ranges::range_value_t<R>>>
  set(from_range_t, R&&, Compare = Compare(), Allocator = Allocator())
    -> set<ranges::range_value_t<R>, Compare, Allocator>;
  template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
  set(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
    -> set<Key, Compare, Allocator>;
  template<class InputIter, class Allocator>
  set(InputIter, InputIter, Allocator) -> set</*iter-value-type*/<InputIter>,
                                              less</*iter-value-type*/<InputIter>>,
                                              Allocator>;
  template<ranges::input_range R, class Allocator>
  set(from_range_t, R&&, Allocator)
    -> set<ranges::range_value_t<R>, less<ranges::range_value_t<R>>, Allocator>;
  template<class Key, class Allocator>
  set(initializer_list<Key>, Allocator) -> set<Key, less<Key>, Allocator>;
}

Modèle de classe std::multiset 

namespace std {
  template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
  class multiset
  {
  public:
    // types
    using key_type               = Key;
    using key_compare            = Compare;
    using value_type             = Key;
    using value_compare          = Compare;
    using allocator_type         = Allocator;
    using pointer                = typename allocator_traits<Allocator>::pointeur;
    using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
    using reference              = value_type&;
    using const_reference        = const value_type&;
    using size_type              = /* défini par l'implémentation */;
    using difference_type        = /* défini par l'implémentation */;
    using iterator               = /* défini par l'implémentation */;
    using const_iterator         = /* défini par l'implémentation */;
    using reverse_iterator       = std::reverse_iterator<iterator>;
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
    using node_type              = /* non spécifié */;
    // construction/copie/destruction
    multiset()
      : multiset(Compare())
    {
    }
    explicit multiset(const Compare& comp, const Allocator& = Allocator());
    template<class InputIter>
    multiset(InputIter first,
             InputIter last,
             const Compare& comp = Compare(),
             const Allocator&    = Allocator());
    template<container-compatible-range<value_type> R>
    multiset(from_range_t,
             R&& rg,
             const Compare& comp = Compare(),
             const Allocator&    = Allocator());
    multiset(const multiset& x);
    multiset(multiset&& x);
    explicit multiset(const Allocator&);
    multiset(const multiset&, const type_identity_t<Allocator>&);
    multiset(multiset&&, const type_identity_t<Allocator>&);
    multiset(initializer_list<value_type>,
             const Compare&   = Compare(),
             const Allocator& = Allocator());
    template<class InputIter>
    multiset(InputIter first, InputIter last, const Allocator& a)
      : multiset(first, last, Compare(), a)
    {
    }
    template<container-compatible-range<value_type> R>
      multiset(from_range_t, R&& rg, const Allocator& a))
        : multiset(from_range, std::forward<R>(rg), Compare(), a)
    {
    }
    multiset(initializer_list<value_type> il, const Allocator& a)
      : multiset(il, Compare(), a)
    {
    }
    ~multiset();
    multiset& operator=(const multiset& x);
    multiset& operator=(multiset&& x) noexcept(
      allocator_traits<Allocator>::is_always_equal::value&&
        is_nothrow_move_assignable_v<Compare>);
    multiset& operator=(initializer_list<value_type>);
    allocator_type get_allocator() const noexcept;
    // itérateurs
    iterator begin() noexcept;
    const_iterator begin() const noexcept;
    iterator end() noexcept;
    const_iterator end() const noexcept;
    reverse_iterator rbegin() noexcept;
    const_reverse_iterator rbegin() const noexcept;
    reverse_iterator rend() noexcept;
    const_reverse_iterator rend() const noexcept;
    const_iterator cbegin() const noexcept;
    const_iterator cend() const noexcept;
    const_reverse_iterator crbegin() const noexcept;
    const_reverse_iterator crend() const noexcept;
    // capacité
    bool empty() const noexcept;
    size_type size() const noexcept;
    size_type max_size() const noexcept;
    // modificateurs
    template<class... Args>
    iterator emplace(Args&&... args);
    template<class... Args>
    iterator emplace_hint(const_iterator position, Args&&... args);
    iterator insert(const value_type& x);
    iterator insert(value_type&& x);
    iterator insert(const_iterator position, const value_type& x);
    iterator insert(const_iterator position, value_type&& x);
    template<class InputIter>
    void insert(InputIter first, InputIter last);
    template<container-compatible-range<value_type> R>
    void insert_range(R&& rg);
    void insert(initializer_list<value_type>);
    node_type extract(const_iterator position);
    node_type extract(const key_type& x);
    template<class K>
    node_type extract(K&& x);
    iterator insert(node_type&& nh);
    iterator insert(const_iterator hint, node_type&& nh);
    iterator erase(iterator position)
      requires(!same_as<iterator, const_iterator>);
    iterator erase(const_iterator position);
    size_type erase(const key_type& x);
    template<class K>
    size_type erase(K&& x);
    iterator erase(const_iterator first, const_iterator last);
    void swap(multiset&) noexcept(allocator_traits<Allocator>::is_always_equal::value&&
                                    is_nothrow_swappable_v<Compare>);
    void clear() noexcept;
    template<class C2>
    void merge(multiset<Key, C2, Allocator>& source);
    template<class C2>
    void merge(multiset<Key, C2, Allocator>&& source);
    template<class C2>
    void merge(set<Key, C2, Allocator>& source);
    template<class C2>
    void merge(set<Key, C2, Allocator>&& source);
    // observateurs
    key_compare key_comp() const;
    value_compare value_comp() const;
    // opérations sur les ensembles
    iterator find(const key_type& x);
    const_iterator find(const key_type& x) const;
    template<class K>
    iterator find(const K& x);
    template<class K>
    const_iterator find(const K& x) const;
    size_type count(const key_type& x) const;
    template<class K>
    size_type count(const K& x) const;
    bool contains(const key_type& x) const;
    template<class K>
    bool contains(const K& x) const;
    iterator lower_bound(const key_type& x);
    const_iterator lower_bound(const key_type& x) const;
    template<class K>
    iterator lower_bound(const K& x);
    template<class K>
    const_iterator lower_bound(const K& x) const;
    iterator upper_bound(const key_type& x);
    const_iterator upper_bound(const key_type& x) const;
    template<class K>
    iterator upper_bound(const K& x);
    template<class K>
    const_iterator upper_bound(const K& x) const;
    pair<iterator, iterator> equal_range(const key_type& x);
    pair<const_iterator, const_iterator> equal_range(const key_type& x) const;
    template<class K>
    pair<iterator, iterator> equal_range(const K& x);
    template<class K>
    pair<const_iterator, const_iterator> equal_range(const K& x) const;
  };
  template<class InputIter,
           class Compare   = less</*iter-value-type*/<InputIter>>,
           class Allocator = allocator</*iter-value-type*/<InputIter>>>
  multiset(InputIter, InputIter, Compare = Compare(), Allocator = Allocator())
    -> multiset</*iter-value-type*/<InputIter>, Compare, Allocator>;
  template<ranges::input_range R,
           class Compare   = less<ranges::range_value_t<R>>,
           class Allocator = allocator<ranges::range_value_t<R>>>
  multiset(from_range_t, R&&, Compare = Compare(), Allocator = Allocator())
    -> multiset<ranges::range_value_t<R>, Compare, Allocator>;
  template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
  multiset(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
    -> multiset<Key, Compare, Allocator>;
  template<class InputIter, class Allocator>
  multiset(InputIter, InputIter, Allocator)
    -> multiset</*iter-value-type*/<InputIter>,
                less</*iter-value-type*/<InputIter>>,
                Allocator>;
  template<ranges::input_range R, class Allocator>
  multiset(from_range_t, R&&, Allocator)
    -> multiset<ranges::range_value_t<R>, less<ranges::range_value_t<R>>, Allocator>;
  template<class Key, class Allocator>
  multiset(initializer_list<Key>, Allocator) -> multiset<Key, less<Key>, Allocator>;
}

Rapports de défauts

Les rapports de défauts modifiant le comportement suivants ont été appliqués rétroactivement aux normes C++ précédemment publiées.

DR S'applique à Comportement publié Comportement corrigé
LWG 214 C++98 les déclarations des membres find , lower_bound , upper_bound
et equal_range de std::set et std::multiset dans le synopsis
ne correspondaient pas aux exigences sur les conteneurs associatifs 		corrigé