concurrent_unordered_set::unsafe_erase Method
Removes elements from the concurrent_unordered_set at specified positions. This method is not concurrency-safe.
iterator unsafe_erase(
const_iterator _Where
);
size_type unsafe_erase(
const key_type& _Keyval
);
iterator unsafe_erase(
const_iterator _First,
const_iterator _Last
);
Parameters
_Where
The iterator position to erase from._Keyval
The key value to erase._First
_Last
Return Value
The first two member functions return an iterator that designates the first element remaining beyond any elements removed, or concurrent_unordered_set::end() 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_set::equal_range(_Keyval).
Requirements
Header: concurrent_unordered_set.h
Namespace: concurrency