Namespaces
Variants
Views
Actions

std::unordered_set::equal_range

From cppreference.com
< cpp‎ | container‎ | unordered set
Revision as of 08:58, 30 August 2013 by P12 (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
std::pair<iterator,iterator> equal_range( const Key& key );
(since C++11)
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const;
(since C++11)

Returns a range containing all elements with key key in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.

Contents

[edit] Parameters

key - key value to compare the elements to

[edit] Return value

std::pair containing a pair of iterators defining the wanted range. If there are no such elements, past-the-end (see end()) iterators are returned as both elements of the pair.

[edit] Complexity

Average case constant, worst case linear in the size of the container.

[edit] See also

finds element with specific key
(public member function) [edit]