std::unordered_set::insert
 |
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. |
| std::pair<iterator,bool> insert( const value_type& value ); |
(1) | （C++11 起） |
| std::pair<iterator, bool> insert( value_type&& value ); |
(2) | （C++11 起） |
| iterator insert( const_iterator hint, const value_type& value ); |
(3) | （C++11 起） |
| iterator insert( const_iterator hint, value_type&& value ); |
(4) | （C++11 起） |
| template< class InputIt > void insert( InputIt first, InputIt last ); |
(5) | （C++11 起） |
| void insert( std::initializer_list<value_type> ilist ); |
(6) | （C++11 起） |
Inserts element(s) to the container, if the container doesn't already contain an element with equivalent key.
1-2)value。 value. 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.
[first, last).[first, last).You can help to correct and verify the translation. Click here for instructions.
ilist.ilist.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 content The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| value | - | 元素的值插入
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 | - | 范围插入的元素
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 | - | 初始化列表中插入的值
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.
| ||
[编辑] 返回值
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)You can help to correct and verify the translation. Click here for instructions.
[编辑] 复杂性
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)
[编辑] 另请参阅
| constructs element in-place （公共成员函数） | |
| 构建了一丝元素的地方使用 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. （公共成员函数） | |
