[#bsl-multimap-0ae-upper_bound-00]
= xref:bsl.adoc[bsl]::xref:bsl/multimap-0ae.adoc[multimap]::upper_bound
:relfileprefix: ../../
:mrdocs:

`upper_bound` overloads

== Synopses

Declared in `<bslstl_multimap.h>`

Return an iterator providing modifiable access to the first (i.e., ordered least) `value_type` object in this multimap whose key is greater than the specified `key`, and the past‐the‐end iterator if this multimap 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 multimap, while preserving its ordering.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/multimap-0ae/iterator.adoc[iterator]
xref:bsl/multimap-0ae/upper_bound-08.adoc[upper_bound](xref:bsl/multimap-0ae/key_type.adoc[key_type] const& key);
----

[.small]#xref:bsl/multimap-0ae/upper_bound-08.adoc[_» more..._]#

Return an iterator providing non‐modifiable access to the first (i.e., ordered least) `value_type` object in this multimap whose key is greater than the specified `key`, and the past‐the‐end iterator if this multimap 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 multimap, while preserving its ordering.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/multimap-0ae/const_iterator.adoc[const_iterator]
xref:bsl/multimap-0ae/upper_bound-0c.adoc[upper_bound](xref:bsl/multimap-0ae/key_type.adoc[key_type] const& key) const;
----

[.small]#xref:bsl/multimap-0ae/upper_bound-0c.adoc[_» more..._]#

Return an iterator providing modifiable access to the first (i.e., ordered least) `value_type` object in this multimap whose key is greater than the specified `key`, and the past‐the‐end iterator if this multimap 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 multimap, while preserving its ordering.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/multimap-0ae/iterator.adoc[iterator]
xref:bsl/multimap-0ae/upper_bound-05.adoc[upper_bound](LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   LOOKUP_KEY>::value;
----

[.small]#xref:bsl/multimap-0ae/upper_bound-05.adoc[_» more..._]#

Return an iterator providing non‐modifiable access to the first (i.e., ordered least) `value_type` object in this multimap whose key is greater than the specified `key`, and the past‐the‐end iterator if this multimap 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 multimap, while preserving its ordering.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/multimap-0ae/const_iterator.adoc[const_iterator]
xref:bsl/multimap-0ae/upper_bound-0d.adoc[upper_bound](LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   LOOKUP_KEY>::value;
----

[.small]#xref:bsl/multimap-0ae/upper_bound-0d.adoc[_» more..._]#


[.small]#Created with https://www.mrdocs.com[MrDocs]#