From a971b5e9baf44ae683c116e378c7be805f71d25e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 28 Aug 2013 14:29:01 +0200
Subject: [PATCH] Switch to Simple_cartesian

---
 .../minimum_enclosing_parallelogram_2.cpp                   | 5 ++---
 .../Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp   | 4 ++--
 .../Min_quadrilateral_2/minimum_enclosing_strip_2.cpp       | 4 ++--
 .../Rectangular_p_center_2/rectangular_p_center_2.cpp       | 4 ++--
 .../examples/Inscribed_areas/extremal_polygon_2_area.cpp    | 4 ++--
 .../Inscribed_areas/extremal_polygon_2_perimeter.cpp        | 4 ++--
 .../examples/RangeSegmentTrees/range_tree_map_2.cpp         | 6 +++---
 .../examples/RangeSegmentTrees/range_tree_set_2.cpp         | 6 +++---
 .../examples/RangeSegmentTrees/segment_tree_map_2.cpp       | 6 +++---
 .../examples/RangeSegmentTrees/segment_tree_set_2.cpp       | 6 +++---
 .../examples/RangeSegmentTrees/segment_tree_set_3.cpp       | 6 +++---
 11 files changed, 27 insertions(+), 28 deletions(-)

diff --git a/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp b/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
index e95b462b816..f4c6d3ef568 100644
--- a/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
+++ b/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
@@ -1,12 +1,11 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>
 #include <CGAL/min_quadrilateral_2.h>
 #include <iostream>
 
-struct Kernel : public CGAL::Cartesian<double> {};
-
+typedef CGAL::Simple_cartesian<double>                   Kernel;
 typedef Kernel::Point_2                           Point_2;
 typedef Kernel::Line_2                            Line_2;
 typedef CGAL::Polygon_2<Kernel>                   Polygon_2;
diff --git a/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp b/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
index 3127cbb47ad..66db5cef267 100644
--- a/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
+++ b/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
@@ -1,11 +1,11 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>
 #include <CGAL/min_quadrilateral_2.h>
 #include <iostream>
 
-struct Kernel : public CGAL::Cartesian<double> {};
+typedef CGAL::Simple_cartesian<double>            Kernel;
 
 typedef Kernel::Point_2                           Point_2;
 typedef Kernel::Line_2                            Line_2;
diff --git a/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp b/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
index bf87a3377a8..0bbfe6f8242 100644
--- a/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
+++ b/Bounding_volumes/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
@@ -1,11 +1,11 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>
 #include <CGAL/min_quadrilateral_2.h>
 #include <iostream>
 
-struct Kernel : public CGAL::Cartesian<double> {};
+typedef CGAL::Simple_cartesian<double>            Kernel;
 
 typedef Kernel::Point_2                           Point_2;
 typedef Kernel::Line_2                            Line_2;
diff --git a/Bounding_volumes/examples/Rectangular_p_center_2/rectangular_p_center_2.cpp b/Bounding_volumes/examples/Rectangular_p_center_2/rectangular_p_center_2.cpp
index 7af6bb7b543..ed47f2667eb 100644
--- a/Bounding_volumes/examples/Rectangular_p_center_2/rectangular_p_center_2.cpp
+++ b/Bounding_volumes/examples/Rectangular_p_center_2/rectangular_p_center_2.cpp
@@ -1,4 +1,4 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/rectangular_p_center_2.h>
 #include <CGAL/IO/Ostream_iterator.h>
@@ -9,7 +9,7 @@
 
 typedef double                                      FT;
 
-typedef CGAL::Cartesian<FT>                         Kernel;
+typedef CGAL::Simple_cartesian<FT>                  Kernel;
 
 typedef Kernel::Point_2                             Point;
 typedef std::vector<Point>                          Cont;
diff --git a/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_area.cpp b/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_area.cpp
index 0e75643eb9e..df77ff62998 100644
--- a/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_area.cpp
+++ b/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_area.cpp
@@ -1,4 +1,4 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>
@@ -8,7 +8,7 @@
 
 typedef double                                    FT;
 
-typedef CGAL::Cartesian<FT>                       Kernel;
+typedef CGAL::Simple_cartesian<FT>                Kernel;
 
 typedef Kernel::Point_2                           Point;
 typedef std::vector<int>                          Index_cont;
diff --git a/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_perimeter.cpp b/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_perimeter.cpp
index b22cbf5bb06..f4a6ffedccb 100644
--- a/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_perimeter.cpp
+++ b/Inscribed_areas/examples/Inscribed_areas/extremal_polygon_2_perimeter.cpp
@@ -1,4 +1,4 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>
@@ -8,7 +8,7 @@
 
 typedef double                                    FT;
 
-typedef CGAL::Cartesian<FT>                       Kernel;
+typedef CGAL::Simple_cartesian<FT>                Kernel;
 
 typedef Kernel::Point_2                           Point;
 typedef std::vector<int>                          Index_cont;
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp
index e57cc5b79ea..6924c9d7dbb 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp
@@ -3,7 +3,7 @@
 // Ti is the type of each dimension of the tree.
 
 
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Range_segment_tree_traits.h>
 #include <CGAL/Range_tree_k.h>
 #include <iostream>
@@ -12,8 +12,8 @@
 #include <iterator>
 
 
-typedef CGAL::Cartesian<double> Representation;
-typedef CGAL::Range_tree_map_traits_2<Representation, char> Traits;
+typedef CGAL::Simple_cartesian<double> K;
+typedef CGAL::Range_tree_map_traits_2<K, char> Traits;
 typedef CGAL::Range_tree_2<Traits> Range_tree_2_type;
 
 int main()
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp
index 43f2017b711..46518a75283 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp
@@ -3,7 +3,7 @@
 // Ti is the type of each dimension of the tree.
 
 
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Range_segment_tree_traits.h>
 #include <CGAL/Range_tree_k.h>
 #include <iostream>
@@ -11,8 +11,8 @@
 #include <vector>
 #include <iterator>
 
-typedef CGAL::Cartesian<double> Representation;
-typedef CGAL::Range_segment_tree_set_traits_2<Representation> Traits;
+typedef CGAL::Simple_cartesian<double> K;
+typedef CGAL::Range_segment_tree_set_traits_2<K> Traits;
 typedef CGAL::Range_tree_2<Traits> Range_tree_2_type;
 
 int main()
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp
index 9bb5bcde3cc..809960c5bf7 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp
@@ -7,14 +7,14 @@
 #include <vector>
 #include <iterator>
 #include <list>
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Segment_tree_k.h>
 #include <CGAL/Range_segment_tree_traits.h>
 
 
 
-typedef CGAL::Cartesian<double> Representation;
-typedef CGAL::Segment_tree_map_traits_2<Representation, char> Traits;
+typedef CGAL::Simple_cartesian<double> K;
+typedef CGAL::Segment_tree_map_traits_2<K, char> Traits;
 typedef CGAL::Segment_tree_2<Traits > Segment_tree_2_type;
 
 int main()
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp
index 3d4ef8ccd48..bb49f6da73e 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp
@@ -11,12 +11,12 @@
 #include <vector>
 #include <iterator>
 #include <list>
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Segment_tree_k.h>
 #include <CGAL/Range_segment_tree_traits.h>
 
-typedef CGAL::Cartesian<double> Representation;
-typedef CGAL::Range_segment_tree_set_traits_2<Representation> Traits;
+typedef CGAL::Simple_cartesian<double> K;
+typedef CGAL::Range_segment_tree_set_traits_2<K> Traits;
 typedef CGAL::Segment_tree_2<Traits > Segment_tree_2_type;
 
 int main()
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp
index 4e674b1dbb2..ae7ec3e8973 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp
@@ -6,12 +6,12 @@
 #include <utility>
 #include <iterator>
 #include <list>
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Segment_tree_k.h>
 #include <CGAL/Range_segment_tree_traits.h>
 
-typedef CGAL::Cartesian<double> Representation;
-typedef CGAL::Range_segment_tree_set_traits_3<Representation> Traits;
+typedef CGAL::Simple_cartesian<double> K;
+typedef CGAL::Range_segment_tree_set_traits_3<K> Traits;
 typedef CGAL::Segment_tree_3<Traits > Segment_tree_3_type;
 
 int main()