From a09f04846077ae04ea08a271765a082c54fd03be Mon Sep 17 00:00:00 2001
From: Susan Hert <hert@mpi-sb.mpg.de>
Date: Fri, 6 Jul 2001 16:36:56 +0000
Subject: [PATCH] corrected end iterator name

---
 .../doc_tex/Partition_2/Partition_2_ref/Is_convex_2.tex   | 8 ++++++--
 .../basic/Partition_2/Partition_2_ref/Is_convex_2.tex     | 8 ++++++--
 2 files changed, 12 insertions(+), 4 deletions(-)

diff --git a/Packages/Partition_2/doc_tex/Partition_2/Partition_2_ref/Is_convex_2.tex b/Packages/Partition_2/doc_tex/Partition_2/Partition_2_ref/Is_convex_2.tex
index 82bb65a4381..cea8e79fca4 100644
--- a/Packages/Partition_2/doc_tex/Partition_2/Partition_2_ref/Is_convex_2.tex
+++ b/Packages/Partition_2/doc_tex/Partition_2/Partition_2_ref/Is_convex_2.tex
@@ -32,10 +32,10 @@ requriements of the function \ccc{is_convex_2}}
 
 \ccMethod{
 template<class InputIterator>
-bool operator()(InputIterator first, InputIterator last);}
+bool operator()(InputIterator first, InputIterator beyond);}
 {
   returns \ccc{true} iff the points of type \ccc{Triats::Point_2}
-  in the range [\ccc{first},\ccc{last}) define a convex polygon. 
+  in the range [\ccc{first},\ccc{beyond}) define a convex polygon. 
 }
 
 \ccSeeAlso
@@ -43,6 +43,10 @@ bool operator()(InputIterator first, InputIterator last);}
 \ccRefIdfierPage{CGAL::convex_partition_is_valid_2} \\
 \ccRefIdfierPage{CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>}
 
+\ccImplementation
+
+This test requires $O(n)$ time for a polygon with $n$ vertices.
+
 \end{ccRefFunctionObjectClass}
 
 % +------------------------------------------------------------------------+
diff --git a/Packages/Partition_2/doc_tex/basic/Partition_2/Partition_2_ref/Is_convex_2.tex b/Packages/Partition_2/doc_tex/basic/Partition_2/Partition_2_ref/Is_convex_2.tex
index 82bb65a4381..cea8e79fca4 100644
--- a/Packages/Partition_2/doc_tex/basic/Partition_2/Partition_2_ref/Is_convex_2.tex
+++ b/Packages/Partition_2/doc_tex/basic/Partition_2/Partition_2_ref/Is_convex_2.tex
@@ -32,10 +32,10 @@ requriements of the function \ccc{is_convex_2}}
 
 \ccMethod{
 template<class InputIterator>
-bool operator()(InputIterator first, InputIterator last);}
+bool operator()(InputIterator first, InputIterator beyond);}
 {
   returns \ccc{true} iff the points of type \ccc{Triats::Point_2}
-  in the range [\ccc{first},\ccc{last}) define a convex polygon. 
+  in the range [\ccc{first},\ccc{beyond}) define a convex polygon. 
 }
 
 \ccSeeAlso
@@ -43,6 +43,10 @@ bool operator()(InputIterator first, InputIterator last);}
 \ccRefIdfierPage{CGAL::convex_partition_is_valid_2} \\
 \ccRefIdfierPage{CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>}
 
+\ccImplementation
+
+This test requires $O(n)$ time for a polygon with $n$ vertices.
+
 \end{ccRefFunctionObjectClass}
 
 % +------------------------------------------------------------------------+