Note
Access to this page requires authorization. You can try signing in or changing directories.
Access to this page requires authorization. You can try changing directories.
Removes elements from the concurrent_unordered_multiset at specified positions. This method is not concurrency-safe.
iterator unsafe_erase(
const_iterator _Where
);
iterator unsafe_erase(
const_iterator _First,
const_iterator _Last
);
size_type unsafe_erase(
const key_type& _Keyval
);
Parameters
_Where
The iterator position to erase from._First
_Last
_Keyval
The key value to erase.
Return Value
The first two member functions return an iterator that designates the first element remaining beyond any elements removed, or concurrent_unordered_multiset::end Method() if no such element exists. The third member function returns the number of elements it removes.
Remarks
The first member function removes the element 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_multiset::equal_range Method(_Keyval).
Requirements
Header: concurrent_unordered_set.h
Namespace: concurrency