Expand Minimize

concurrent_unordered_map::unsafe_erase Method

Removes elements from the concurrent_unordered_map at specified positions. This method is not concurrency-safe.

iterator unsafe_erase(
   const_iterator _Where
);

iterator unsafe_erase(
   const_iterator _Begin,
   const_iterator _End
);

size_type unsafe_erase(
   const key_type& _Keyval
);

_Where

The iterator position to erase from.

_Begin

The position of the first element in the range of elements to be erased.

_End

The position of the first element beyond the range of elements to be erased.

_Keyval

The key value to erase.

The first two member functions return an iterator that designates the first element remaining beyond any elements removed, or concurrent_unordered_map::end() if no such element exists. The third member function returns the number of elements it removes.

The first member function removes the element of the controlled sequence pointed to by _Where. The second member function removes the elements in the range [_Begin, _End).

The third member function removes the elements in the range delimited by concurrent_unordered_map::equal_range(_Keyval).

Header: concurrent_unordered_map.h

Namespace: concurrency

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