std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>::lower_bound
Min standard notice:
1,2) Returns an iterator pointing to the first element that is not less than (i.e. greater or equal to) key.
# Declarations
iterator lower_bound( const Key& key );
(since C++23)
const_iterator lower_bound( const Key& key ) const;
(since C++23)
template< class K >
iterator lower_bound( const K& x );
(since C++23)
template< class K >
const_iterator lower_bound( const K& x ) const;
(since C++23)
# Parameters
key: key value to compare the elements tox: alternative value that can be compared to Key
# Return value
Iterator pointing to the first element that is not less than key. If no such element is found, a past-the-end iterator (see end()) is returned.
# Example
This section is incompleteReason: no example