std::indirect_strict_weak_order - cppreference.com (original) (raw)

| | | | | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | | ------------- | | 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&, /*indirect-value-t*/<I1>, /*indirect-value-t*/<I2>> && std::strict_weak_order <F&, /*indirect-value-t*/<I1>, std::iter_reference_t<I2>> && std::strict_weak_order <F&, std::iter_reference_t<I1>, /*indirect-value-t*/<I2>> && std::strict_weak_order <F&, std::iter_reference_t<I1>, std::iter_reference_t<I2>>; | | (since C++20) |

The concept indirect_strict_weak_order specifies requirements for algorithms that call strict weak orders as their arguments. The key difference between this concept and std::strict_weak_order is that it is applied to the types that I1 and I2 references, rather than I1 and I2 themselves.

[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.