std::experimental::ranges::Relation - cppreference.com (original) (raw)

template< class R, class T, class U > concept bool Relation = Predicate<R, T, T> && Predicate<R, U, U> && CommonReference< const std::remove_reference_t<T>&, const std::remove_reference_t<U>&> && Predicate<R, ranges::common_reference_t< const std::remove_reference_t<T>&, const std::remove_reference_t<U>&>, ranges::common_reference_t< const std::remove_reference_t<T>&, const std::remove_reference_t<U>&>> && Predicate<R, T, U> && Predicate<R, U, T>; (1) (ranges TS)

The concept Relation<R, T, U> specifies that R defines a binary relation over the set of expressions whose type and value category are those encoded by either T or U.

Given

and let C be ranges::common_reference_t<const std::remove_reference_t<T>&, const std::remove_reference_t<U>&>,

then Relation<R, T, U> is satisfied only if