std::flat_m...:lower_bound(3)

πŸ“¦ version 2024.07.05, in nixpkgs unstable, opensuse-leap 16.0

πŸ’– std::flat_m...:lower_bound(3) πŸ’–

okay so this is the std::flat_m...:lower_bound(3) page from the C++ Standard Libary manual, and we are gonna make lower_bound make sense, bestie. no cap, it's giving very specific container energy. ✨


🌸 NAME 🌸

  • std::flat_multimap::lower_bound β€” std::flat_multimap::lower_bound

πŸŽ€ Synopsis πŸŽ€

okay so here's the synopsis, and yes, every overload is since C++23 β€” periodt:

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 πŸ¦‹

  • 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.


🌈 Complexity 🌈

Logarithmic in the size of the container. iykyk, it's efficient. πŸ’…


πŸ“ Example πŸ“

This section is incomplete.

Reason: no example.

it's literally giving placeholder vibes, but that's exactly what the page says, so we're not inventing anything. πŸ™ˆ


πŸ‘‘ See also πŸ‘‘

  • 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

mwah πŸ’‹ β€” this cute little page comes from source/version cppreference.com, dated 2024.06.10. byeee 🫢

πŸ“¦ where this page comes from