std::ranges..._view::begin(3)

🎀 std::ranges..._view::begin(3) 🎀

okay bestie, welcome to the std::ranges::chunk_by_view::begin page from the C++ Standard Libary manual 💖 this is literally the std::ranges..._view::begin(3) one, and yes, we're gonna get through it together 🫶

---

💖 NAME 💖

• std::ranges::chunk_by_view::begin - std::ranges::chunk_by_view::begin

like… the name is the name twice, and honestly? iconic 💅

---

✨ Synopsis ✨

constexpr /*iterator*/ begin();  (since C++23)

This returns an iterator to the first element of the chunk_by_view 👑 no cap.

It's equivalent to:

ranges::iterator_t<V> iter;

if (begin_.has_value())
    iter = begin_.value();
else
{
    iter = /*find_next*/(ranges::begin(base()));
    begin_ = iter; // caching
}

return /*iterator*/(*this, ranges::begin(base()), iter);

⚠️ okay so this part is serious: the behavior is undefined if the underlying predicate pred_ does not contain a value. like, undefined is not a vibe, bestie 😭

---

🫶 Parameters 🫶

• (none) — literally none, bestie. nothing. zero. the void 🌸

---

🌸 Return value 🌸

Iterator to the first element. periodt ✨

---

🧚 Notes 🧚

In order to provide the amortized constant-time complexity required by the range concept, this function caches the result within the data member begin_ (the name is for exposition only) for use on subsequent calls 💫

so yeah, it's giving “remember it so future calls can slay” 🎀

---

🍓 Example 🍓

• This section is incomplete
• Reason: no example

not me showing up with no example 😭🙈

---

🦋 See also 🦋

• end — returns an iterator or a sentinel to the end (C++23) (public member function)
• ranges::begin — returns an iterator to the beginning of a range (C++20) (customization point object)

---

👑 Category 👑

• Todo no example

---

source: http://cppreference.com · version/date: 2024.06.10 · page: std::ranges..._view::begin(3) — mwah, that's the whole manual page, bestie 💜✨