dedekind::category::ProductLeq< LeqA, LeqB > Struct Template Reference

Componentwise product order on std::pair ≤×: (a,c)≤(b,d) :⟺ a≤b ∧ c≤d. The order-theoretic product of two posets, not the lexicographic std::less_equal on the pair. More...

Public Member Functions
template<typename A, typename B> requires std::predicate<LeqA, const A&, const A&> && std::predicate<LeqB, const B&, const B&>
constexpr bool	operator() (const std::pair< A, B > &x, const std::pair< A, B > &y) const
	AND the two component comparisons.

Detailed Description

template<typename LeqA, typename LeqB>
struct dedekind::category::ProductLeq< LeqA, LeqB >

Componentwise product order on std::pair ≤×: (a,c)≤(b,d) :⟺ a≤b ∧ c≤d. The order-theoretic product of two posets, not the lexicographic std::less_equal on the pair.

Template Parameters

LeqA	the order on the first component.
LeqB	the order on the second component.

Member Function Documentation

operator()()

template<typename LeqA, typename LeqB>

template<typename A, typename B>
requires std::predicate<LeqA, const A&, const A&> && std::predicate<LeqB, const B&, const B&>

bool dedekind::category::ProductLeq< LeqA, LeqB >::operator() ( const std::pair< A, B > & x, const std::pair< A, B > & y ) const

inlineconstexpr

AND the two component comparisons.

Parameters

x	the left pair (a,c).
y	the right pair (b,d).

Returns

a≤b && c≤d, the componentwise product-order verdict.

---

The documentation for this struct was generated from the following file:

• src/main/modules/dedekind/category/posetal.cppm