Espaces de noms
Variantes

    std::unordered_set::unordered_set

    De 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++
     
    Bibliothèque de conteneurs
     
    std :: unordered_set
    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.
    unordered_set::unordered_set
    unordered_set::~unordered_set
    unordered_set::operator=
    unordered_set::get_allocator
    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.
    unordered_set::begin
    unordered_set::cbegin
    unordered_set::end
    unordered_set::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.
    unordered_set::erase
    unordered_set::size
    unordered_set::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.
    unordered_set::clear
    unordered_set::insert
    unordered_set::emplace
    unordered_set::emplace_hint
    unordered_set::erase
    unordered_set::swap
    Lookup
    Original:
    Lookup
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    unordered_set::count
    unordered_set::find
    unordered_set::equal_range
    Interface seau
    Original:
    Bucket interface
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    unordered_set::begin2
    unordered_set::end2
    unordered_set::bucket_count
    unordered_set::max_bucket_count
    unordered_set::bucket_size
    unordered_set::bucket
    Politique de hachage
    Original:
    Hash policy
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    unordered_set::load_factor
    unordered_set::max_load_factor
    unordered_set::rehash
    unordered_set::reserve
    Des observateurs
    Original:
    Observers
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    unordered_set::hash_function
    unordered_set::key_eq
     
    <tbody> </tbody>
    explicit unordered_set( size_type bucket_count = /*implementation-defined*/, {{#pad:|22}} const Hash& hash = Hash(), {{#pad:|22}} const KeyEqual& equal = KeyEqual(), {{#pad:|22}} const Allocator& alloc = Allocator() );
    		 (1) (depuis C++11)
    explicit unordered_set( const Allocator& alloc );
    		 (1) (depuis C++11)
    template< class InputIt > unordered_set( InputIt first, InputIt last, {{#pad:|13}} size_type bucket_count = /*implementation-defined*/, {{#pad:|13}} const Hash& hash = Hash(), {{#pad:|13}} const KeyEqual& equal = KeyEqual(), {{#pad:|13}} const Allocator& alloc = Allocator() );
    		 (2) (depuis C++11)
    unordered_set( const unordered_set& other );
    		 (3) (depuis C++11)
    unordered_set( const unordered_set& other, const Allocator& alloc );
    		 (3) (depuis C++11)
    unordered_set( unordered_set&& other );
    		 (4) (depuis C++11)
    unordered_set( unordered_set&& other, const Allocator& alloc );
    		 (4) (depuis C++11)
    unordered_set( std::initializer_list<value_type> init, {{#pad:|13}} size_type bucket_count = /*implementation-defined*/, {{#pad:|13}} const Hash& hash = Hash(), {{#pad:|13}} const KeyEqual& equal = KeyEqual(), {{#pad:|13}} const Allocator& alloc = Allocator() );
    		 (5) (depuis C++11)
    Construit nouveau conteneur d'une variété de sources de données. Utilise éventuellement bucket_count utilisateur fourni en un nombre minimal de segments pour créer, hash que la fonction de hachage, equal que la fonction de comparaison des clés et que le dispositif d'attribution alloc .
    Original:
    Constructs new container from a variety of data sources. Optionally uses user supplied bucket_count as a minimal number of buckets to create, hash as the hash function, equal as the function to compare keys and alloc as the allocator.
    The text has been machine-translated via Google Translate.