std::map::lower_bound(3)

🌸 NAME 🌸

okay so this page is std::map::lower_bound(3) from the C++ Standard Libary manual, and the NAME section is literally std::map::lower_bound - std::map::lower_bound (yes bestie, the circular icon behavior is real 💅). We're finding the first element that's not less than a key, and it's giving exact iterator energy ✨.

---

✨ Synopsis ✨

          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) return an iterator pointing to the first element that is not less than (i.e. greater or equal to) key.
• (3), (4) return 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 — the key value to compare the elements to.
• x — an alternative value that can be compared to Key.

---

🔥 Return value 🔥

An 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 rule, no cap.</br>

---

🌈 Complexity 🌈

Logarithmic in the size of the container. So it's fast like a group-chat reply when someone says "bestie guess what" 💅.

---

🦋 Notes 🦋

Feature-test macro vibes:

• 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

---

👑 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

---

that's the whole lower_bound vibe, bestie 💖 source: http://cppreference.com, version/date: 2024.06.10, page: std::map::lower_bound(3) 🫶