std::experi...es::Sortable(3)

✨ NAME ✨

okay bestie, welcome to the std::experimental::ranges::Sortable page from the C++ Standard Libary — and yes, the manual name is literally std::experimental::ranges::Sortable again, because the original NAME block said it twice and we're not erasing that iconique repetition. 💅 This whole page is about the concept called std::experimental::ranges::Sortable. Periodt.

🌈 SYNOPSIS 🌈

Here's the signature, copied exactly so nobody comes for us:

          template< class I, class R = ranges::less<>, class P =
       ranges::identity
          >

          concept bool Sortable =
       (ranges TS)
              Permutable<I> &&

              IndirectStrictWeakOrder<R, ranges::projected<I, P>>;

Lowkey the important bits: it's a concept bool named Sortable, it's marked (ranges TS), and it requires both Permutable<I> and IndirectStrictWeakOrder<R, ranges::projected<I, P>>. The template parameters are class I, class R = ranges::less<>, and class P = ranges::identity — defaults included, no cap. 🫶

So what is Sortable for? It spells out the common requirements of algorithms that permute sequences into ordered sequences — the original gives ranges::sort as the example. That's the whole vibe check: ordered sequences, permuted, sort-coded. ✨

Sign-off time, bestie: this was served fresh from cppreference.com, version/date 2024.06.10, and that's the whole page — mwah. 💖🎀