std::permutable(3)

💖 std::permutable — C++ Standard Libary, section (3) 💖

okay bestie, buckle up: this is the manual page for std::permutable, and it is literally the concept girlie of the C++ standard library. 🎀

✨ NAME ✨

std::permutable — std::permutable (yes, the name is the name, we’re serving minimalism 💅)

🌸 Synopsis 🌸

Defined in header <iterator> ✨

template< class I >

concept permutable =
    std::forward_iterator<I> &&                (since C++20)
    std::indirectly_movable_storable<I, I> &&

    std::indirectly_swappable<I, I>;

The concept permutable refines std::forward_iterator by adding requirements for reordering through moves and swaps. it’s giving iterator glow-up, not replacement 🦋

🧠 Semantic requirements 🧠

I models permutable only if all concepts it subsumes are modeled. no skipping the prerequisites, bestie — that’s the vibe check 💀

💅 See also 💅

• sortable (C++20) — specifies the common requirements of algorithms that permute sequences into ordered sequences (concept) 👑
• ranges::remove (C++20) — removes elements satisfying specific criteria (niebloid) 🌸
• ranges::remove_if (C++20) — removes elements satisfying specific criteria (niebloid) 🌈
• ranges::unique (C++20) — removes consecutive duplicate elements in a range (niebloid) 🦋
• ranges::reverse (C++20) — reverses the order of elements in a range (niebloid) 🔥
• ranges::rotate (C++20) — rotates the order of elements in a range (niebloid) ⭐
• ranges::shuffle (C++20) — randomly re-orders elements in a range (niebloid) 🎀
• ranges::partition (C++20) — divides a range of elements into two groups (niebloid) 💜
• ranges::stable_partition (C++20) — divides elements into two groups while preserving their relative order (niebloid) 🧚

---

mwah 💋 this page came from source cppreference.com, version/date 2024.06.10, and it’s the std::permutable(3) manual page — periodt. 🫶