std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>:: lower_bound
From cppreference.net
<
cpp
|
container
|
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 is
not
less than
key
.
3,4)
Returns an iterator pointing to the first element that compares
not
less than
x
.
This overload participates in overload resolution only if
Compare
is
transparent
. It allows calling this function without constructing an instance of
Key
.
Contents |
Parameters
| key | - | key value to compare the elements to |
| x | - |
alternative value that can be compared to
Key
|
Return value
An iterator pointing to the first element that is not less than the given key, or end ( ) is no such element exists.
Complexity
Logarithmic in the size of the container.
Example
|
This section is incomplete
Reason: no example |
See also
|
returns range of elements matching a specific key
(public member function) |
|
|
returns an iterator to the first element
greater
than the given key
(public member function) |