Module: ppl/ppl Branch: master Commit: 22d7dc4353fca2fd99db605f498beddb3a649e01 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=22d7dc4353fca...
Author: Enea Zaffanella zaffanella@cs.unipr.it Date: Sat Mar 6 09:23:32 2010 +0100
Corrected a couple of typos in the documentation.
---
src/Octagonal_Shape.defs.hh | 6 +++--- 1 files changed, 3 insertions(+), 3 deletions(-)
diff --git a/src/Octagonal_Shape.defs.hh b/src/Octagonal_Shape.defs.hh index f5b6ad1..b558f31 100644 --- a/src/Octagonal_Shape.defs.hh +++ b/src/Octagonal_Shape.defs.hh @@ -523,7 +523,7 @@ public: The built OS is the most precise OS that includes the box.
\param box - The box representing the BDS to be built. + The box representing the OS to be built.
\param complexity This argument is ignored as the algorithm used has @@ -1114,8 +1114,8 @@ public: \c T is bound to an integer datatype.
\note - The integer upper bound of two rational BDS is the smallest - rational BDS containing all the integral points in the two arguments. + The integer upper bound of two rational OS is the smallest + rational OS containing all the integral points in the two arguments. In general, the result is \e not an upper bound for the two input arguments, as it may cut away non-integral portions of the two rational shapes.