std::indire...t_weak_order(3)

💅 std::indirect_strict_weak_order ✨

okay bestie, so this page is literally about std::indirect_strict_weak_order — that's the NAME, that's the whole vibe, we're doing this 🫶 (manual fam: C++ Standard Library, if you were wondering 👑).

Defined in header <iterator> — don't forget to #include it, no cap 🙈

🌸 Synopsis 🌸

template< class F, class I1, class I2 = I1 >

concept indirect_strict_weak_order =
    std::indirectly_readable<I1> &&
    std::indirectly_readable<I2> &&
    std::copy_constructible<F> &&
    std::strict_weak_order<F&, std::iter_value_t<I1>&,
std::iter_value_t<I2>&> &&
    std::strict_weak_order<F&, std::iter_value_t<I1>&,
std::iter_reference_t<I2>> &&
    std::strict_weak_order<F&, std::iter_reference_t<I1>,
std::iter_value_t<I2>&> &&
    std::strict_weak_order<F&, std::iter_reference_t<I1>,
std::iter_reference_t<I2>> &&
    std::strict_weak_order<F&, std::iter_common_reference_t<I1>,

                           std::iter_common_reference_t<I2>>;

✨ since C++20 ✨ — she's a modern queen, we stan 💜

🦋 Description 🦋

So like… the concept std::indirect_strict_weak_order specifies the requirements for algorithms that call strict weak orders as their arguments. That's it, that's the job 💅

The key difference between this concept and std::strict_weak_order is that it's applied to the types that I1 and I2 reference, rather than to I1 and I2 themselves. it's giving "look past the iterator, see the soul" 🧚 lowkey iconic honestly ✨

🎀 Semantic requirements 🎀

F, I1, and I2 model indirect_strict_weak_order only if all concepts it subsumes are modeled. that's the whole rule, bestie — no extra credit, no shortcuts, fr fr 🔥

okay that's the page!! sourced from cppreference.com, dated 2024.06.10, and yes the manpage title/footer said std::indire...t_weak_order(3) because even the filename got truncated mid-sl*y — relatable 😭💀 go forth and order things indirectly, mwah 🍓💖