std::multimap::lower_bound(3)

💖 std::multimap::lower_bound 💖

okay so this is the std::multimap::lower_bound(3) page from the C++ Standard Libary — yes, that's the manual name exactly as the header spells it, bestie. iykyk. Welcome to the lower_bound group chat. 🫶✨ This function has main character energy, fr fr.

✨ NAME ✨

std::multimap::lower_bound — literally std::multimap::lower_bound. That's the name. Periodt. 💅 Obsessed.

🦋 SYNOPSIS 🦋

Here's the exact overload lineup, no edits, no cap:

iterator lower_bound( const Key& key );             (1)
const_iterator lower_bound( const Key& key ) const; (2)
template< class K >                                 (3) (since C++14)
iterator lower_bound( const K& x );
template< class K >                                 (4) (since C++14)
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. it's giving efficient, bestie. ⭐

👑 NOTES 👑

Feature-test macro tea ☕ — highkey the table vibes are:

• Feature-test macro: __cpp_lib_generic_associative_lookup
• Value: 201304L
• Std: (C++14)
• Feature: Heterogeneous comparison lookup in associative containers; overloads (3,4)

💀 EXAMPLE 💀

This section is incomplete. Reason: no example.

lowkey no example energy. 🙈

🌈 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

---

💌 source: http://cppreference.com • version/date: 2024.06.10 • page: std::multimap::lower_bound(3) — love u bestie, bye 💋✨