名前空間
変種
操作

std::unordered_map::emplace_hint

提供: cppreference.com

 
 
 
std::unordered_map
メンバ関数
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
イテレータ
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
容量
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
修飾子
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
ルック
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
バケットインターフェイス
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
ハッシュポリシー
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
オブザーバー
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
 
template <class... Args>
iterator emplace_hint( const_iterator hint, Args&&... args );
(C++11およびそれ以降)
挿入コンテナに新しい要素、要素は行くべき提案としてhintを使用しています。要素はその場で構成され、操作が実行されないコピーや移動、すなわちません。 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().

目次

[編集] パラメータ

hint -
新しい要素を挿入する場所についての提案として使用されるイテレータ
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 -
要素のコンストラクタに転送するための引数
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.

[編集] 値を返します

新しく挿入された要素を指すイテレータを返す.
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.

[編集] 複雑

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

[編集] も参照してください

constructs element in-place
(パブリックメンバ関数) [edit]
要素を挿入します
(パブリックメンバ関数) [edit]