hash_map::emplace_hint

참고

이 API는 사용되지 않습니다.unordered_map 클래스를 대신 사용하는 것이 좋습니다.

Inserts an element constructed in place into a hash_map, with a placement hint.

template<class ValTy>
    iterator emplace_hint(
        const_iterator _Where,
        ValTy&& _Val
);

매개 변수

Parameter	설명
_Val	The value used to move construct an element to be inserted into the hash_map 클래스 unless the hash_map already contains that element (or, more generally, an element whose key is equivalently ordered).
_Where	정확한 지점으로 삽입에 대한 검색을 시작할 위치에 대한 힌트입니다.

반환 값

The hash_multimap::emplace member function returns an iterator that points to the position where the new element was inserted into the hash_map, or where the existing element with equivalent ordering is located.

설명

The hash_map::value_type of an element is a pair, so that the value of an element will be an ordered pair with the first component equal to the key value and the second component equal to the data value of the element.

Insertion can occur in amortized constant time, instead of logarithmic time, if the insertion point immediately follows _Where.

Beginning with Visual C++ .NET 2003, members of the <hash_map> and <hash_set> header files are no longer in the std namespace, but rather have been moved into the stdext namespace. 자세한 내용은 stdext 네임스페이스를 참조하십시오.

예제

// hash_map_emplace_hint.cpp
// compile with: /EHsc
#include<hash_map>
#include<iostream>
#include <string>

int main()
{
    using namespace std;
    using namespace stdext;
    hash_map<int, string> hm1;
    typedef pair<int, string> is1(1, "a");

    hm1.emplace(hm1.begin(), move(is1));
    cout << "After the emplace, hm1 contains:" << endl
      << " " << hm1.begin()->first
      << " => " << hm1.begin()->second
      << endl;
}

요구 사항

헤더: <hash_map>

네임스페이스: stdext

참고 항목

참조

hash_map 클래스

표준 템플릿 라이브러리