std::flat_map::lower_bound(3)

💖 std::flat_map::lower_bound(3) — C++ Standard Libary 💖

okay so bestie, welcome to the C++ Standard Libary page for std::flat_map::lower_bound(3) — yes, that spelling is staying exactly as-is, periodt. 💅 This is the member that finds you the first element that isn’t less than your key, and it’s giving “finding-the-first-not-less-element” energy.

🎀 NAME 🎀

std::flat_map::lower_bound — literally std::flat_map::lower_bound. That’s the name, bestie, no cap. 🫶

🌸 Synopsis 🌸

Four overloads, all since C++23, all iconic: ✨

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

• 1,2) Returns an iterator pointing to the first element that is not less than (i.e. greater or equal to) key.
• 3,4) Returns an iterator pointing to the first element that compares not less (i.e. greater or equal) to the value x. This overload participates in overload resolution only if the qualified-id Compare::is_transparent is valid and denotes a type. It allows calling this function without constructing an instance of Key.

🍓 Parameters 🍓

Here’s the tea on the args, bestie:

• key — key value to compare the elements to.
• x — 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. That’s the whole mood. 💀

⭐ Complexity ⭐

Logarithmic in the size of the container. Lowkey efficient, highkey iconic. 🌈

🧚 Example 🧚

This section is incomplete Reason: no example

👑 See also 👑

Don’t forget the sibling functions, bestie:

• equal_range — returns range of elements matching a specific key (public member function).
• upper_bound — returns an iterator to the first element greater than the given key (public member function).

🦋 Category 🦋

• * Todo no example

k bye bestie 💖 — source/version: http://cppreference.com · date: 2024.06.10 · page: std::flat_map::lower_bound(3) 🫶✨