std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>::lower_bound

From cppreference.com

Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros(C++20)
Language support library
Concepts library(C++20)
Diagnostics library
Memory management library
Metaprogramming library(C++11)
General utilities library
Containers library
Iterators library
Ranges library(C++20)
Algorithms library
Strings library
Text processing library
Numerics library
Date and time library
Input/output library
Filesystem library(C++17)
Concurrency support library(C++11)
Execution control library(C++26)
Technical specifications
Symbols index
External libraries

[edit]

Containers library

node-handle (C++17)
Sequence
array (C++11)
vector
vector<bool>
inplace_vector (C++26)
hive (C++26)
deque
forward_list (C++11)
list
Associative
set
multiset
map
multimap
Unordered associative
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
Adaptors
stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)
Views
span (C++20)
mdspan (C++23)
Tables
Iterator invalidation
Member function table
Non-member function table

flat_multimap::flat_multimap
flat_multimap::operator=
Modifiers
flat_multimap::clear
flat_multimap::erase
flat_multimap::swap
flat_multimap::extract
flat_multimap::replace
flat_multimap::insert
flat_multimap::insert_range
flat_multimap::emplace
flat_multimap::emplace_hint
Lookup
flat_multimap::count
flat_multimap::find
flat_multimap::contains
flat_multimap::equal_range
flat_multimap::lower_bound
flat_multimap::upper_bound

Iterators
flat_multimap::beginflat_multimap::cbegin
flat_multimap::endflat_multimap::cend
flat_multimap::rbeginflat_multimap::crbegin
flat_multimap::rendflat_multimap::crend
Capacity
flat_multimap::size
flat_multimap::max_size
flat_multimap::empty
Observers
flat_multimap::key_comp
flat_multimap::keys
flat_multimap::value_comp
flat_multimap::values

Non-member functions

swap(std::flat_multimap)
erase_if(std::flat_multimap)

operator==operator<=>

Helper classes

uses_allocator<std::flat_multimap>

iterator lower_bound(const Key& key);	(1)	(since C++23) (constexpr since C++26)
const_iterator lower_bound(const Key& key)const;	(2)	(since C++23) (constexpr since C++26)
template<class K> iterator lower_bound(const K& x);	(3)	(since C++23) (constexpr since C++26)
template<class K> const_iterator lower_bound(const K& x)const;	(4)	(since C++23) (constexpr since C++26)

1,2) Returns an iterator pointing to the first element that isnot less thankey.

3,4) Returns an iterator pointing to the first element that comparesnot less thanx.

This overload participates in overload resolution only ifCompare istransparent. It allows calling this function without constructing an instance ofKey.

[edit]Parameters

key	-	key value to compare the elements to
x	-	alternative value that can be compared to`Key`

[edit]Return value

An iterator pointing to the first element that is not less than the given key, orend() is no such element exists.

[edit]Complexity

Logarithmic in the size of the container.

[edit]Example

This section is incomplete
Reason: no example

[edit]See also

equal_range	returns range of elements matching a specific key (public member function)[edit]
upper_bound	returns an iterator to the first elementgreater than the given key (public member function)[edit]