Expand Minimize

concurrent_unordered_map::insert Method

Adds elements to the concurrent_unordered_map object.

std::pair<iterator, bool> 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
>
std::pair<iterator, bool> 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
);

_Iterator

The iterator type used for insertion.

_Valty

The type of the value inserted into the map.

_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.

A pair that contains an iterator and a boolean value. See the Remarks section for more details.

The first member function determines whether an element X exists in the sequence whose key has equivalent ordering to that of _Value. If not, it creates such an element X and initializes it with _Value. The function then determines the iterator where that designates X. If an insertion occurred, the function returns std::pair(where, true). Otherwise, it returns std::pair(where, false).

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.

Header: concurrent_unordered_map.h

Namespace: concurrency

Was this page helpful?
(1500 characters remaining)
Thank you for your feedback
Show:
© 2014 Microsoft