From ba76f57f4c657d555edbd0f804563e51fdcd31a2 Mon Sep 17 00:00:00 2001 From: Sylvain Pion Date: Tue, 14 Jan 2003 13:19:14 +0000 Subject: [PATCH] - Use new template ctor. --- .../examples/Triangulation_3/example_simple.C | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/Packages/Triangulation_3/examples/Triangulation_3/example_simple.C b/Packages/Triangulation_3/examples/Triangulation_3/example_simple.C index ffb0ad80be0..2945f3d982c 100644 --- a/Packages/Triangulation_3/examples/Triangulation_3/example_simple.C +++ b/Packages/Triangulation_3/examples/Triangulation_3/example_simple.C @@ -15,25 +15,25 @@ typedef CGAL::Filtered_kernel > my_K; // This is just to shorten some symbol names for VC++ struct K : public my_K {}; -typedef CGAL::Triangulation_3 Triangulation; +typedef CGAL::Triangulation_3 Triangulation; -typedef Triangulation::Cell_handle Cell_handle; -typedef Triangulation::Vertex_handle Vertex_handle; -typedef Triangulation::Locate_type Locate_type; +typedef Triangulation::Cell_handle Cell_handle; +typedef Triangulation::Vertex_handle Vertex_handle; +typedef Triangulation::Locate_type Locate_type; -typedef K::Point_3 Point; +typedef K::Point_3 Point; int main() { - Triangulation T; - - // insertion from a list : + // construction from a list of points : std::list L; L.push_front(Point(0,0,0)); L.push_front(Point(1,0,0)); L.push_front(Point(0,1,0)); - int n = T.insert(L.begin(), L.end()); + Triangulation T(L.begin(), L.end()); + + int n = T.number_of_vertices(); // insertion from a vector : std::vector V(3);