std::multiset::equal_range

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::multiset
Member functions multiset::multiset multiset::~multiset multiset::operator= multiset::get_allocator Iterators multiset::begin multiset::cbegin (C++11) multiset::end multiset::cend (C++11) multiset::rbegin multiset::crbegin (C++11) multiset::rend multiset::crend (C++11) Capacity multiset::empty multiset::size multiset::max_size Modifiers multiset::clear multiset::insert multiset::emplace (C++11) multiset::emplace_hint (C++11) multiset::erase multiset::swap Lookup multiset::count multiset::find multiset::equal_range multiset::lower_bound multiset::upper_bound Observers multiset::key_comp multiset::value_comp

std::pair<iterator,iterator> equal_range( const Key& key );
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const;

Returns a range containing all elements with key key in the container. The range is defined by two iterators, one pointing to the first element that is not less than key and another pointing to the first element greater than key. The first iterator may be alternatively obtained with lower_bound(), the second - with upper_bound().

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

key

-

key value to compare the elements to

[edit] Return value

std::pair containing a pair of iterators defining the wanted range, the first pointing to the first element that is not less than key and the second pointing to the first element greater than key.

If there are no elements not less than key, past-the-end (see end()) iterator is returned as the first element. Similarly if there are no elements greater than key, past-the-end iterator is returned as the second element

This section is incomplete Reason: link

[edit] Complexity

This section is incomplete

[edit] See also

find	finds element with specific key (public member function)
upper_bound	returns an iterator to the first element greater than a certain value (public member function)
lower_bound	returns an iterator to the first element not less than the given value (public member function)