std::indire...t_weak_order(3) C++ Standard Libary std::indire...t_weak_order(3) NAME std::indirect_strict_weak_order - std::indirect_strict_weak_order Synopsis Defined in header <iterator> 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>&, (since C++20) 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>>; The concept indirect_strict_weak_order specifies requirements for algo- rithms 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. Semantic requirements F, I1, and I2 model indirect_strict_weak_order only if all concepts it subsumes are modeled. http://cppreference.com 2024.06.10 std::indire...t_weak_order(3)
Want to link to this manual page? Use this URL:
<https://man.FreeBSD.org/cgi/man.cgi?query=std::indirect_strict_weak_order&sektion=3&manpath=FreeBSD+Ports+15.1.quarterly>