From 310ce5affab0b952c35798e14db652210b1bfbda Mon Sep 17 00:00:00 2001 From: Michael Hemmer Date: Mon, 3 Feb 2014 14:54:36 +0100 Subject: [PATCH] backquotes --- .../doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h index cfd0458d711..92d4e0eac10 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h @@ -7,7 +7,7 @@ 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. -In case types are RealEmbeddable this also implies that mixed compare operators are available. +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`.