[#bsl-map-0af-lower_bound-026]
= xref:bsl.adoc[bsl]::xref:bsl/map-0af.adoc[map<TimeInterval, Node*>]::lower_bound
:relfileprefix: ../../
:mrdocs:

Return an iterator providing modifiable access to the first (i.e., ordered least) `value_type` object in this map whose key is greater‐than or equal‐to the specified `key`, and the past‐the‐end iterator if this map does not contain a `value_type` object whose key is greater‐than or equal‐to `key`. Note that this function returns the _first_ 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.

== Synopsis

Declared in `<bslstl_map.h>`

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


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