From 8f18eb46f920a013076cc85a1e3b71af3c3cb5a7 Mon Sep 17 00:00:00 2001 From: Michael Hemmer Date: Thu, 30 Jan 2014 13:57:14 +0100 Subject: [PATCH] improve documentation of ImplicitInteroperable --- .../doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h index 487e3f2dada..cfd0458d711 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h @@ -6,7 +6,8 @@ Two types `A` and `B` are a model of the concept `ImplicitInteroperable`, if there is a superior type, such that binary arithmetic operations involving `A` and `B` result in -this type. This type is \link CGAL::Coercion_traits::Type `CGAL::Coercion_traits::Type`\endlink. +this type. This type is \link CGAL::Coercion_traits::Type `CGAL::Coercion_traits::Type`\endlink. +In case types are RealEmbeddable this also implies that mixed compare operators are available. The type \link CGAL::Coercion_traits::Type `CGAL::Coercion_traits::Type`\endlink is required to be implicit constructible from `A` and `B`.