std::sortable(3cxx)

🦋 NAME 🦋

okay bestie, so this is std::sortable — it's the [alg.req.sortable] concept, aka the concept literally named sortable. yes that's the whole name. slay.

---

✨ SYNOPSIS ✨

first thing's first, you gotta pull in the header, no cap:

#include <iterator>

📜 Concept definition 📜

here's the whole vibe, verbatim, don't touch it:

template<typename _Iter, typename _Rel ranges::less, typename _Proj identity>
concept std::sortable =  permutable<_Iter>
      && indirect_strict_weak_order<_Rel, projected<_Iter, _Proj>>

so yeah — for an iterator _Iter to be sortable, it's gotta be permutable<_Iter>, and _Rel has to be an indirect_strict_weak_order over _Iter as seen through _Proj. both. it's giving "and", not "or". 💅

---

🌸 Detailed Description 🌸

[alg.req.sortable], concept sortable.

that's it, that's the description, the standard said "see the concept" and dipped 🙈

lowkey the real lore is up in that definition block — everything this page is allowed to tell you is right there, so don't come for me asking for more, i literally cannot make stuff up ✨

---

👑 Author 👑

Generated automatically by Doxygen for libstdc++ from the source code. 🫶

---

and that's a wrap, gorgeous 💖 this was libstdc++'s std::sortable(3cxx) page, generated by Doxygen straight from the source code, so if you're reading this at 3am trying to figure out why your iterator won't satisfy the concept — permutable AND an indirect strict weak order through your projection, both, periodt 🎀✨