equal_range overloads
Synopses
Declared in <bslstl_multiset.h>
Return a pair of iterators providing modifiable access to the sequence of value_type objects in this multiset equivalent to the specified key, where the first iterator is positioned at the start of the sequence and the second is positioned one past the end of the sequence. The first returned iterator will be lower_bound(key), the second returned iterator will be upper_bound(key), and, if this multiset contains no value_type objects with an equivalent key, then the two returned iterators will have the same value.
pair<iterator, iterator>
equal_range(key_type const& key);Return a pair of iterators providing non‐modifiable access to the sequence of value_type objects in this multiset that are equivalent to the specified key, where the first iterator is positioned at the start of the sequence, and the second is positioned one past the end of the sequence. The first returned iterator will be lower_bound(key); the second returned iterator will be upper_bound(key); and, if this multiset contains no value_type objects equivalent to key, then the two returned iterators will have the same value.
pair<const_iterator, const_iterator>
equal_range(key_type const& key) const;Return a pair of iterators providing modifiable access to the sequence of value_type objects in this multiset equivalent to the specified key, where the first iterator is positioned at the start of the sequence and the second is positioned one past the end of the sequence. The first returned iterator will be lower_bound(key), the second returned iterator will be upper_bound(key), and, if this multiset contains no value_type objects with an equivalent key, then the two returned iterators will have the same value.
template<class LOOKUP_KEY>
pair<iterator, iterator>
equal_range(LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
LOOKUP_KEY>::value;Return a pair of iterators providing non‐modifiable access to the sequence of value_type objects in this multiset that are equivalent to the specified key, where the first iterator is positioned at the start of the sequence, and the second is positioned one past the end of the sequence. The first returned iterator will be lower_bound(key); the second returned iterator will be upper_bound(key); and, if this multiset contains no value_type objects equivalent to key, then the two returned iterators will have the same value.
template<class LOOKUP_KEY>
pair<const_iterator, const_iterator>
equal_range(LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
LOOKUP_KEY>::value;Created with MrDocs