concurrent_unordered_multiset::insert Method
Adds elements to the concurrent_unordered_multiset object.
iterator insert(
const value_type& _Value
);
iterator insert(
const_iterator _Where,
const value_type& _Value
);
template<
class _Iterator
>
void insert(
_Iterator_First,
_Iterator_Last
);
template<
class _Valty
>
iterator insert(
_Valty&& _Value
);
template<
class _Valty
>
typename std::tr1::enable_if<!std::tr1::is_same<const_iterator, typename std::tr1::remove_reference<_Valty>::type>::value, iterator>::type insert(
const_iterator _Where,
_Valty&& _Value
);
Parameters
_Iterator
The iterator type used for insertion._Valty
The type of the value inserted._Value
The value to be inserted._Where
The starting location to search for an insertion point._First
The beginning of the range to insert._Last
The end of the range to insert.
Return Value
An iterator pointing to the insertion location.
Remarks
The first member function inserts the element _Value in the controlled sequence, then returns the iterator that designates the inserted element.
The second member function returns insert(_Value), using _Where as a starting place within the controlled sequence to search for the insertion point.
The third member function inserts the sequence of element values from the range [_First, _Last).
The last two member functions behave the same as the first two, except that _Value is used to construct the inserted value.
Requirements
Header: concurrent_unordered_set.h
Namespace: concurrency