std::set::equal_range – cppreference.com

std::set::equal_range

Aus cppreference.com

[edit template]

<metanoindex/>

 
C++
 
Container-Bibliothek
 
std::set
Member-Funktionen
Original:
Member functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
set::set
set::~set
set::operator=
set::get_allocator
Iteratoren
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
set::begin
set::cbegin
(C++11)
set::end
set::cend
(C++11)
set::rbegin
set::crbegin
(C++11)
set::rend
set::crend
(C++11)
Kapazität
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
set::empty
set::size
set::max_size
Modifiers
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
set::clear
set::insert
set::emplace(C++11)
set::emplace_hint(C++11)
set::erase
set::swap
Lookup
Original:
Lookup
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
set::count
set::find
set::equal_range
set::lower_bound
set::upper_bound
Beobachter
Original:
Observers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
set::key_comp
set::value_comp
 
<tbody> </tbody>
std::pair<iterator,iterator> equal_range( const Key& key );
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const;
Gibt einen Bereich mit allen Elementen mit Schlüssel key in den Behälter. 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().
Original:
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().
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parameter

key -
Schlüssel-Wert, um die Elemente zu vergleichen
Original:
key value to compare the elements to
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Rückgabewert

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.

Komplexität

Logarithmic in the size of the container.

Siehe auch