std::unordered_map::emplace_hint
来自cppreference.com
< cpp | container | unordered map
 |
该页由英文版wiki使用Google Translate机器翻译而来。
该翻译可能存在错误或用词不当。鼠标停留在文本上可以看到原版本。你可以帮助我们修正错误或改进翻译。参见说明请点击这里. |
| 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)....原文：
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)....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 | - | 迭代器，用于插入新的元素，作为一个建议
原文： iterator, used as a suggestion as to where to insert the new element |
| args | - | 元素的构造函数的参数转发
原文： arguments to forward to the constructor of the element |
[编辑] 返回值
返回一个迭代器新插入的元素.
原文：
Returns an iterator to the newly inserted element.
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.
[编辑] 另请参阅
| 就地构造元素 （公共成员函数） | |
| 插入元素 （公共成员函数） | |
