equal_range overloads

Synopses

Declared in <bslstl_set.h>

Return a pair of iterators providing modifiable access to the sequence of value_type objects in this set 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 set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. Note that since a set maintains unique keys, the range will contain at most one element.

pair<iterator, iterator>
equal_range(key_type const& key);

» more...

Return a pair of iterators providing non‐modifiable access to the sequence of value_type objects in this set 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 set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. Note that since a set maintains unique keys, the range will contain at most one element.

pair<const_iterator, const_iterator>
equal_range(key_type const& key) const;

» more...

Return a pair of iterators providing modifiable access to the sequence of value_type objects in this set 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 set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. Note that although a set maintains unique keys, the range may contain more than one element, because a transparent comparator may have been supplied that provides a different (but compatible) partitioning of keys for LOOKUP_KEY as the comparisons used to order the keys in the set.

template<class LOOKUP_KEY>
pair<iterator, iterator>
equal_range(LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   LOOKUP_KEY>::value;

» more...

Return a pair of iterators providing non‐modifiable access to the sequence of value_type objects in this set 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 set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. Note that although a set maintains unique keys, the range may contain more than one element, because a transparent comparator may have been supplied that provides a different (but compatible) partitioning of keys for LOOKUP_KEY as the comparisons used to order the keys in the set.

template<class LOOKUP_KEY>
pair<const_iterator, const_iterator>
equal_range(LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   LOOKUP_KEY>::value;

» more...

Created with MrDocs