Delen via


concurrent_unordered_set::equal_range Method

Finds a range that matches a specified key. This function is concurrency safe.

std::pair<iterator, iterator> equal_range(
   const key_type& _Keyval
);

std::pair<const_iterator, const_iterator> equal_range(
   const key_type& _Keyval
) const;

Parameters

  • _Keyval
    The key value to search for.

Return Value

A pair where the first element is an iterator to the beginning and the second element is an iterator to the end of the range.

Remarks

It is possible for concurrent inserts to cause additional keys to be inserted after the begin iterator and before the end iterator.

Requirements

Header: internal_concurrent_hash.h

Namespace: concurrency

See Also

Reference

concurrent_unordered_set Class