名前空間
変種
操作

std::unordered_set::insert

提供: cppreference.com

 
 
 
のstd :: unordered_set
メンバ関数
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_set::unordered_set
unordered_set::~unordered_set
unordered_set::operator=
unordered_set::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_set::begin
unordered_set::cbegin
unordered_set::end
unordered_set::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_set::erase
unordered_set::size
unordered_set::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_set::clear
unordered_set::insert
unordered_set::emplace
unordered_set::emplace_hint
unordered_set::erase
unordered_set::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_set::count
unordered_set::find
unordered_set::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_set::begin2
unordered_set::end2
unordered_set::bucket_count
unordered_set::max_bucket_count
unordered_set::bucket_size
unordered_set::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_set::load_factor
unordered_set::max_load_factor
unordered_set::rehash
unordered_set::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_set::hash_function
unordered_set::key_eq
 
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
Original:
inserts value.
The text has been machine-translated via Google Translate.
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.

5)
レンジ[first, last)からの挿入要素.
Original:
inserts elements from range [first, last).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
6)
初期化子リストから挿入要素ilist.
Original:
inserts elements from initializer list ilist.
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 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)
なし.
Original:
none.
The text has been machine-translated via Google Translate.
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
(パブリックメンバ関数) [edit]
ヒントを使用してその場で要素を構成します
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.

(パブリックメンバ関数) [edit]