upper_bound overloads
Declared in <bslstl_map.h>
Return an iterator providing modifiable access to the first (i.e., ordered least) value_type object in this map whose key is greater than the specified key, and the past-the-end iterator if this map does not contain a value_type object whose key is greater-than key. Note that this function returns the last position before which a value_type object having an equivalent key could be inserted into the ordered sequence maintained by this map, while preserving its ordering.
iterator
upper_bound(key_type const& key);Return an iterator providing non-modifiable access to the first (i.e., ordered least) value_type object in this map whose key is greater than the specified key, and the past-the-end iterator if this map does not contain a value_type object whose key is greater-than key. Note that this function returns the last position before which a value_type object having an equivalent key could be inserted into the ordered sequence maintained by this map, while preserving its ordering.
const_iterator
upper_bound(key_type const& key) const;Return an iterator providing modifiable access to the first (i.e., ordered least) value_type object in this map whose key is greater than the specified key, and the past-the-end iterator if this map does not contain a value_type object whose key is greater-than key. Note that this function returns the last position before which a value_type object having an equivalent key could be inserted into the ordered sequence maintained by this map, while preserving its ordering.
template<class LOOKUP_KEY>
iterator
upper_bound(LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
LOOKUP_KEY>::value;Return an iterator providing non-modifiable access to the first (i.e., ordered least) value_type object in this map whose key is greater than the specified key, and the past-the-end iterator if this map does not contain a value_type object whose key is greater-than key. Note that this function returns the last position before which a value_type object having an equivalent key could be inserted into the ordered sequence maintained by this map, while preserving its ordering.
template<class LOOKUP_KEY>
const_iterator
upper_bound(LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
LOOKUP_KEY>::value;