std::set::equal_range

 

C++

Language

Standard library headers

Concepts

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)

Technical Specifications

 

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::set

Member functions

set::set

set::~set

set::operator=

set::get_allocator

Iterators

set::beginset::cbegin (C++11)

set::endset::cend (C++11)

set::rbeginset::crbegin (C++11)

set::rendset::crend (C++11)

Capacity

set::empty

set::size

set::max_size

Modifiers

set::clear

set::insert

set::emplace (C++11)

set::emplace_hint (C++11)

set::erase

set::swap

Lookup

set::count

set::find

set::equal_range

set::lower_bound

set::upper_bound

Observers

set::key_comp

set::value_comp

 

std::pair<iterator,iterator> equal_range( const Key& key );	(1)
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const;	(2)
template< class K > std::pair<iterator,iterator> equal_range( const K& x );	(3)	(since C++14)
template< class K > std::pair<const_iterator,const_iterator> equal_range( const K& x ) const;	(4)	(since C++14)

Returns a range containing all elements with the given 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. Alternatively, the first iterator may be obtained with lower_bound(), and the second with upper_bound().

1,2) Compares the keys to key.

3,4) Compares the keys to the value x. This overload only participates in overload resolution if the qualified-id Compare::is_transparent is valid and denotes a type. They allow calling this function without constructing an instance of Key.

Parameters

key	-	key value to compare the elements to
x	-	alternative value that can be compared to Key

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.

Complexity

Logarithmic in the size of the container.

See also

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