hash_multiset::insert
Note
This API is obsolete. The alternative is unordered_multiset Class.
Inserts an element or a range of elements into a hash_multiset.
iterator insert(
const Type& Val
);
iterator insert(
iterator Where,
const Type& Al
);
void insert(
initializer_list<Type> IList
);
iterator insert(
const Type& Val
);
iterator insert(
Iterator Where,
const Type& Val
);
template<class InputIterator>
void insert(
InputIterator First,
InputIterator Last
);
template<class ValTy>
iterator insert(
ValTy&& Val
);
template<class ValTy>
iterator insert(
const_iterator Where,
ValTy&& Val
);
Parameters
Parameter |
Description |
Val |
The value of an element to be inserted into the hash_multiset unless the hash_multiset already contains that element or, more generally, an element whose key is equivalently ordered. |
Where |
The place to start searching for the correct point of insertion. (Insertion can occur in amortized constant time, instead of logarithmic time, if the insertion point immediately follows _Where.) |
First |
The position of the first element to be copied from a hash_multiset. |
Last |
The position just beyond the last element to be copied from a hash_multiset. |
IList |
The initializer_list that contains the elements to copy. |
Return Value
The first two insert member functions return an iterator that points to the position where the new element was inserted.
The next three member functions use an initializer_list.
The third member function inserts the sequence of element values into a hash_multiset corresponding to each element addressed by an iterator of in the range [First, Last) of a specified hash_multiset.
Remarks
Insertion can occur in amortized constant time for the hint version of insert, instead of logarithmic time, if the insertion point immediately follows Where.
Requirements
Header: <hash_set>
Namespace: stdext