16
16
#include < gtest/gtest.h>
17
17
18
18
#include < CGAL/AABB_face_graph_triangle_primitive.h>
19
- #include < CGAL/AABB_traits .h>
19
+ #include < CGAL/AABB_traits_3 .h>
20
20
#include < CGAL/AABB_tree.h>
21
21
#include < CGAL/Constrained_Delaunay_triangulation_2.h>
22
22
#include < CGAL/Constrained_triangulation_2.h>
@@ -137,11 +137,11 @@ TEST(CGAL, SurfaceMesh) {
137
137
typedef K::Segment_3 Segment;
138
138
typedef CGAL::Surface_mesh<Point3> Mesh;
139
139
typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
140
- typedef CGAL::AABB_traits <K, Primitive> Traits;
140
+ typedef CGAL::<K, Primitive> Traits;
141
141
typedef CGAL::AABB_tree<Traits> Tree;
142
- typedef boost ::optional<Tree::Intersection_and_primitive_id<Segment>::Type>
142
+ typedef std ::optional<Tree::Intersection_and_primitive_id<Segment>::Type>
143
143
Segment_intersection;
144
- typedef boost ::optional<Tree::Intersection_and_primitive_id<Plane>::Type>
144
+ typedef std ::optional<Tree::Intersection_and_primitive_id<Plane>::Type>
145
145
Plane_intersection;
146
146
typedef Tree::Primitive_id Primitive_id;
147
147
@@ -177,8 +177,8 @@ TEST(CGAL, SurfaceMesh) {
177
177
tree.any_intersection (segment_query);
178
178
if (intersection) {
179
179
// gets intersection object
180
- if (boost::get <Point3>(&(intersection->first ))) {
181
- // Point3* p = boost::get <Point3>(&(intersection->first));
180
+ if (std::get_if <Point3>(&(intersection->first ))) {
181
+ // Point3* p = std::get_if <Point3>(&(intersection->first));
182
182
// std::cout << "intersection object is a point " << *p << "\n";
183
183
// std::cout << "with face "<< intersection->second << "\n";
184
184
}
@@ -203,8 +203,8 @@ TEST(CGAL, SurfaceMesh) {
203
203
// (generally a segment)
204
204
Plane_intersection plane_intersection = tree.any_intersection (plane_query);
205
205
if (plane_intersection) {
206
- if (boost::get <Segment>(&(plane_intersection->first ))) {
207
- // Segment* s = boost::get <Segment>(&(plane_intersection->first));
206
+ if (std::get_if <Segment>(&(plane_intersection->first ))) {
207
+ // Segment* s = std::get_if <Segment>(&(plane_intersection->first));
208
208
// std::cout << "one intersection object is the segment " << s << "\n";
209
209
// std::cout << "with face "<< intersection->second << "\n";
210
210
}
@@ -223,7 +223,7 @@ TEST(CGAL, AABBPolyhedronFacetIntersection) {
223
223
// typedef K::Segment_3 Segment;
224
224
typedef CGAL::Polyhedron_3<K> Polyhedron;
225
225
typedef CGAL::AABB_face_graph_triangle_primitive<Polyhedron> Primitive;
226
- typedef CGAL::AABB_traits <K, Primitive> Traits;
226
+ typedef CGAL::AABB_traits_3 <K, Primitive> Traits;
227
227
typedef CGAL::AABB_tree<Traits> Tree;
228
228
// typedef Tree::Point_and_primitive_id Point_and_primitive_id;
229
229
@@ -276,15 +276,15 @@ TEST(CGAL, SurfaceMeshGridCell) {
276
276
// typedef Mesh::Face_index face_descriptor;
277
277
278
278
typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
279
- typedef CGAL::AABB_traits <K, Primitive> Traits;
279
+ typedef CGAL::AABB_traits_3 <K, Primitive> Traits;
280
280
typedef CGAL::AABB_tree<Traits> Tree;
281
281
// typedef boost::optional<Tree::Intersection_and_primitive_id<Segment>::Type>
282
282
// Segment_intersection;
283
283
// typedef boost::optional<Tree::Intersection_and_primitive_id<Plane>::Type>
284
284
// Plane_intersection;
285
285
// typedef Tree::Primitive_id Primitive_id;
286
286
287
- typedef boost ::optional<Tree::Intersection_and_primitive_id<Ray>::Type>
287
+ typedef std ::optional<Tree::Intersection_and_primitive_id<Ray>::Type>
288
288
Ray_intersection;
289
289
290
290
typedef CGAL::Timer Timer;
@@ -344,8 +344,8 @@ TEST(CGAL, SurfaceMeshGridCell) {
344
344
// std::cout << "Intersect (x1000): " << t.time() << " sec" << "\n";
345
345
346
346
// if(intersection) {
347
- // if(boost::get <Point3>(&(intersection->first))) {
348
- // const Point3* p = boost::get <Point3>(&(intersection->first));
347
+ // if(std::get_if <Point3>(&(intersection->first))) {
348
+ // const Point3* p = std::get_if <Point3>(&(intersection->first));
349
349
// std::cout << *p << "\n";
350
350
// }
351
351
// }
@@ -366,7 +366,7 @@ TEST(CGAL, SurfaceMeshGrid) {
366
366
// typedef Mesh::Face_index face_descriptor;
367
367
368
368
typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
369
- typedef CGAL::AABB_traits <K, Primitive> Traits;
369
+ typedef CGAL::AABB_traits_3 <K, Primitive> Traits;
370
370
typedef CGAL::AABB_tree<Traits> Tree;
371
371
// typedef boost::optional<Tree::Intersection_and_primitive_id<Segment>::Type>
372
372
// Segment_intersection;
@@ -432,8 +432,8 @@ TEST(CGAL, SurfaceMeshGrid) {
432
432
// << "): " << t.time() << " sec" << "\n";
433
433
434
434
// if(intersection) {
435
- // if(boost::get <Point3>(&(intersection->first))) {
436
- // const Point3* p = boost::get <Point3>(&(intersection->first));
435
+ // if(std::get_if <Point3>(&(intersection->first))) {
436
+ // const Point3* p = std::get_if <Point3>(&(intersection->first));
437
437
// std::cout << *p << "\n";
438
438
// }
439
439
// }
@@ -454,7 +454,7 @@ TEST(CGAL, SurfaceMeshModifyGrid) {
454
454
// typedef Mesh::Face_index face_descriptor;
455
455
456
456
// typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
457
- // typedef CGAL::AABB_traits <K, Primitive> Traits;
457
+ // typedef CGAL::AABB_traits_3 <K, Primitive> Traits;
458
458
// typedef CGAL::AABB_tree<Traits> Tree;
459
459
// typedef boost::optional<Tree::Intersection_and_primitive_id<Segment>::Type>
460
460
// Segment_intersection;
@@ -507,7 +507,7 @@ TEST(CGAL, SurfaceMeshWavefield) {
507
507
// typedef Mesh::Face_index face_descriptor;
508
508
509
509
// typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
510
- // typedef CGAL::AABB_traits <K, Primitive> Traits;
510
+ // typedef CGAL::AABB_traits_3 <K, Primitive> Traits;
511
511
// typedef CGAL::AABB_tree<Traits> Tree;
512
512
// typedef boost::optional<Tree::Intersection_and_primitive_id<Segment>::Type>
513
513
// Segment_intersection;
0 commit comments