[ Web Proxy ]
URL:
Viewing: https://fr.cppreference.com/cpp/container/unordered_map/insert [Back]  [Original]
std::unordered_map::insert cppreference.com
cppreference.com
Espaces de noms
Variantes

    std::unordered_map::insert

    De cppreference.com
    []

    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/>

    [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++
     
    Bibliothque de conteneurs
     
    std::unordered_map
    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_map::unordered_map
    unordered_map::~unordered_map
    unordered_map::operator=
    unordered_map::get_allocator
    Les itrateurs
    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_map::begin
    unordered_map::cbegin
    unordered_map::end
    unordered_map::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_map::erase
    unordered_map::size
    unordered_map::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_map::clear
    unordered_map::insert
    unordered_map::emplace
    unordered_map::emplace_hint
    unordered_map::erase
    unordered_map::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_map::count
    unordered_map::find
    unordered_map::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_map::begin2
    unordered_map::end2
    unordered_map::bucket_count
    unordered_map::max_bucket_count
    unordered_map::bucket_size
    unordered_map::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_map::load_factor
    unordered_map::max_load_factor
    unordered_map::rehash
    unordered_map::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_map::hash_function
    unordered_map::key_eq
     
    <tbody> </tbody>
    std::pair<iterator,bool> insert( const value_type& value );
    		 (1) (depuis C++11)
    template <class P> std::pair<iterator,bool> insert( P&& value );
    		 (2) (depuis C++11)
    iterator insert( const_iterator hint, const value_type& value );
    		 (3) (depuis C++11)
    template <class P> iterator insert( const_iterator hint, P&& value );
    		 (4) (depuis C++11)
    template< class InputIt > void insert( InputIt first, InputIt last );
    		 (5) (depuis C++11)
    void insert( std::initializer_list<value_type> ilist );
    		 (6) (depuis C++11)

    Inserts element(s) to the container, if the container doesn't already contain an element with equivalent key.

    1-2)

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

    3-4) inserts value, using hint as a non-binding suggestion to where the search should start.

    5)

    lments inserts de [first, last) plage .
    Original:
    inserts elements from range [first, last).
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    6)

    lments inserts de liste d'initialisation ilist .
    Original:
    inserts elements from initializer list ilist.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    If rehashing occurs due to the insertion, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is higher than max_load_factor()*bucket_count().

    Paramtres

    hint -
    itrateur, utilis comme une suggestion quant l'endroit o insrer le contenu
    Original:
    iterator, used as a suggestion as to where to insert the content
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    value -
    lment de valeur insrer
    Original:
    element value to insert
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    first, last -
    ventail d'lments insrer
    Original:
    range of elements to insert
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    ilist -
    initialiseur liste d'insrer les valeurs
    Original:
    initializer list to insert the values from
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Type requirements
    -
    InputIt must meet the requirements of InputIterator.

    Retourne la valeur

    1-2) returns a pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.

    3-4) returns an iterator to the inserted element, or to the element that prevented the insertion.

    5-6)

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

    1-4) Average case: O(1), worst case O(size())

    5-6) Average case: O(N), where N is the number of elements to insert. Worse case: O(N*size()+N)

    Voir aussi

    		 construit des lments en mmoire
    (fonction membre publique) [edit]
    construit lments en place en utilisant un indice
    Original:
    constructs elements in-place using a hint
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    (fonction membre publique) [edit]
    Web Proxy Viewer  |  New URL  |  Original Page