std::unordered_multimap::equal_range
Aus cppreference.com
<metanoindex/>
<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, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.Original:
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.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
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. If there are no such elements, past-the-end (see end()) iterators are returned as both elements of the pair.
Komplexität
Average case constant, worst case linear in the size of the container.