Namensräume
Varianten

    std::unordered_map::emplace_hint

    Aus 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++
     
    Container-Bibliothek
     
    std::unordered_map
    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.
    unordered_map::unordered_map
    unordered_map::~unordered_map
    unordered_map::operator=
    unordered_map::get_allocator
    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.
    unordered_map::begin
    unordered_map::cbegin
    unordered_map::end
    unordered_map::cend
    Kapazität
    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
    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.
    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
    Eimer Schnittstelle
    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
    Hash Politik
    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
    Beobachter
    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>
    template <class... Args> iterator emplace_hint( const_iterator hint, Args&&... args );
    		 (seit C++11)
    Fügt ein neues Element in den Behälter mit hint als Anregung, wo das Element gehen sollte. Das Element in-place ist so aufgebaut, dh kein Kopieren oder Verschieben von Operationen durchgeführt werden. The constructor of the element type (value_type, that is, std::pair<const Key, T>) is called with exactly the same arguments as supplied to the function, forwarded with std::forward<Args>(args)....
    Original:
    Inserts a new element to the container, using hint as a suggestion where the element should go. The element is constructed in-place, i.e. no copy or move operations are performed. The constructor of the element type (value_type, that is, std::pair<const Key, T>) is called with exactly the same arguments as supplied to the function, forwarded with std::forward<Args>(args)....
    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().

    Parameter

    hint -
    Iterator, als Anregung, wo das neue Element eingefügt werden
    Original:
    iterator, used as a suggestion as to where to insert the new element
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    args -
    Argumente, die an den Konstruktor des Elements weiterzuleiten
    Original:
    arguments to forward to the constructor of the element
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Rückgabewert

    Gibt einen Iterator auf das neu eingefügte Element .
    Original:
    Returns an iterator to the newly inserted element.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    If the insertion failed because the element already exists, returns an iterator to the already existing element with the equivalent key.

    Komplexität

    Amortized constant on average, worst case linear in the size of the container.

    Siehe auch

    		 constructs element in-place
    (öffentliche Elementfunktion) [edit]
    Elemente einfügen
    Original:
    inserts elements
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    (öffentliche Elementfunktion) [edit]