songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Include <CGAL/algorithm.h> instead of <CGAL/copy_n.h>.

This commit is contained in:
Sylvain Pion 2008-08-12 12:58:18 +00:00
parent 25051d8809
commit c24c588aa5
38 changed files with 38 additions and 38 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Box_intersection_d/examples/Box_intersection_d/proximity_custom_box_traits.cpp
View File

@ -1,7 +1,7 @@
#include <CGAL/Simple_cartesian.h>
#include <CGAL/box_intersection_d.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <vector>
#include <algorithm>
#include <iterator>

2
Box_intersection_d/examples/Box_intersection_d/triangle_self_intersect.cpp
View File

@ -5,7 +5,7 @@
#include <CGAL/box_intersection_d.h>
#include <CGAL/function_objects.h>
#include <CGAL/Join_input_iterator.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;

2
Box_intersection_d/examples/Box_intersection_d/triangle_self_intersect_pointers.cpp
View File

@ -5,7 +5,7 @@
#include <CGAL/box_intersection_d.h>
#include <CGAL/function_objects.h>
#include <CGAL/Join_input_iterator.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;

2
Convex_hull_3/demo/Convex_hull_3/incremental_hull_3_demo.cpp
View File

@ -25,7 +25,7 @@
#include <CGAL/Convex_hull_d_traits_3.h>
#include <CGAL/Convex_hull_d_to_polyhedron_3.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/IO/Geomview_stream.h>
#include <CGAL/IO/Polyhedron_geomview_ostream.h>
#include <vector>

2
Convex_hull_3/demo/Convex_hull_3/quickhull_3_demo.cpp
View File

@ -21,7 +21,7 @@
#include <CGAL/Homogeneous.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Convex_hull_traits_3.h>
#include <CGAL/convex_hull_3.h>
#include <CGAL/predicates_on_points_3.h>

2
Convex_hull_3/examples/Convex_hull_3/dynamic_hull_3.cpp
View File

@ -1,7 +1,7 @@
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/Delaunay_triangulation_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <list>

2
Convex_hull_3/examples/Convex_hull_3/incremental_hull_3.cpp
View File

@ -1,6 +1,6 @@
#include <CGAL/Homogeneous.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/convex_hull_incremental_3.h>
#include <vector>

2
Convex_hull_3/examples/Convex_hull_3/quickhull_3.cpp
View File

@ -1,6 +1,6 @@
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Convex_hull_traits_3.h>
#include <CGAL/convex_hull_3.h>
#include <vector>

2
Generator/demo/Generator/generator.cpp
View File

@ -34,7 +34,7 @@ int main(int, char*){
#include <CGAL/function_objects.h>
#include <CGAL/Join_input_iterator.h>
#include <CGAL/Counting_iterator.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/IO/Qt_widget.h>
#include <CGAL/IO/Qt_widget_standard_toolbar.h>

2
Generator/examples/Generator/random_degenerate_point_set.cpp
View File

@ -3,7 +3,7 @@
#include <vector>
#include <algorithm>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/random_selection.h>
using namespace CGAL;

2
Generator/examples/Generator/random_grid.cpp
View File

@ -3,7 +3,7 @@
#include <vector>
#include <algorithm>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
using namespace CGAL;

2
Generator/examples/Generator/random_polygon.cpp
View File

@ -3,7 +3,7 @@
#include <CGAL/point_generators_2.h>
#include <CGAL/random_polygon_2.h>
#include <CGAL/Random.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#ifdef CGAL_USE_GMP
#include <CGAL/Gmpz.h>

2
Generator/examples/Generator/random_segments1.cpp
View File

@ -7,7 +7,7 @@
#include <CGAL/point_generators_2.h>
#include <CGAL/function_objects.h>
#include <CGAL/Join_input_iterator.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
using namespace CGAL;

2
Generator/include/CGAL/random_convex_set_2.h
View File

@ -25,7 +25,7 @@
#define CGAL_RANDOM_CONVEX_SET_2_H 1
#include <CGAL/basic.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <vector>
#include <algorithm>
#include <numeric>

2
Generator/test/Generator/test_generators.cpp
View File

@ -34,7 +34,7 @@
#include <CGAL/Point_3.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/random_selection.h>
using namespace CGAL;

2
Interpolation/demo/Interpolation/interpolation_2.cpp
View File

@ -53,7 +53,7 @@ int main()
#include <CGAL/interpolation_functions.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/IO/Geomview_stream.h>

2
Interpolation/demo/Interpolation/surface_voronoi.cpp
View File

@ -40,7 +40,7 @@ int main()
#include <CGAL/point_generators_3.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/squared_distance_2.h>
#include <CGAL/Origin.h>

2
Interpolation/examples/Interpolation/interpolation_2.cpp
View File

@ -11,7 +11,7 @@
#include <CGAL/interpolation_functions.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Origin.h>
#include <cassert>

2
Interpolation/examples/Interpolation/surface_neighbor_coordinates_3.cpp
View File

@ -3,7 +3,7 @@
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Origin.h>
#include <CGAL/surface_neighbor_coordinates_3.h>

2
Interpolation/test/Interpolation/include/CGAL/_test_interpolation_functions_2.cpp
View File

@ -25,7 +25,7 @@
#include <CGAL/Random.h>
#include <CGAL/Origin.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/natural_neighbor_coordinates_2.h>

2
Interpolation/test/Interpolation/include/CGAL/_test_natural_neighbors_2.cpp
View File

@ -21,7 +21,7 @@
#include <cassert>
#include <utility>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Random.h>
#include <CGAL/barycenter.h>

2
Interpolation/test/Interpolation/include/CGAL/_test_regular_neighbors_2.cpp
View File

@ -22,7 +22,7 @@
#include <utility>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Random.h>
#include <CGAL/Origin.h>

2
Interpolation/test/Interpolation/include/CGAL/_test_surface_neighbors_3.cpp
View File

@ -28,7 +28,7 @@
#include <CGAL/point_generators_3.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/function_objects.h>
#include <CGAL/Origin.h>

2
Min_annulus_d/web/Min_annulus_d.aw
View File

@ -1604,7 +1604,7 @@ or sphere, respectively.
@macro <Min_annulus_d test: includes and typedefs (2/3D)>(1) many = @begin
#include <CGAL/point_generators_@1.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <iterator>
@end

2
Min_sphere_d_new/test/Min_sphere_d_new/test_Min_sphere_d_2.cpp
View File

@ -44,7 +44,7 @@
#include <CGAL/Min_circle_2_traits_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <iterator>
// typedefs

2
Min_sphere_d_new/test/Min_sphere_d_new/test_Min_sphere_d_3.cpp
View File

@ -44,7 +44,7 @@
#include <CGAL/Optimisation_d_traits_3.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <iterator>
// typedefs

2
Min_sphere_d_new/web/Min_sphere_d.aw
View File

@ -1387,7 +1387,7 @@ or sphere, respectively.
@macro <Min_sphere_d test: includes (2/3D)>(1) many = @begin
#include <CGAL/point_generators_@1.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <iterator>
@end

2
Nef_2/noweb/Nef_polyhedron_2.lw
View File

@ -3041,7 +3041,7 @@ SUN Ultra-Enterprise-10000 with an 333 MHz UltraSPARC processors.
#include <CGAL/basic_constructions_2.h>
#include <CGAL/Point_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/random_selection.h>
#include <CGAL/IO/Window_stream.h>

2
Nef_2/noweb/Segment_overlay.lw
View File

@ -2187,7 +2187,7 @@ CGAL_END_NAMESPACE
#include <CGAL/point_generators_2.h>
#include <CGAL/function_objects.h>
#include <CGAL/Join_input_iterator.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/Halfedge_data_structure_default.h>
#include "Segment_overlay_traits.h"
#include "HDS_decorator.h"

2
Nef_S2/demo/Nef_S2/SM_overlayer-demo.cpp
View File

@ -20,7 +20,7 @@
#include <CGAL/Homogeneous.h>
#include <CGAL/Gmpz.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/random_selection.h>
#include <CGAL/point_generators_3.h>
#if CGAL_LEDA_VERSION < 500

2
Nef_S2/demo/Nef_S2/Sphere_geometry-demo.cpp
View File

@ -23,7 +23,7 @@
#include <CGAL/leda_integer.h>
#include <CGAL/Homogeneous.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/random_selection.h>
#include <CGAL/point_generators_3.h>
#if CGAL_LEDA_VERSION < 500

2
Nef_S2/noweb/SM_overlayer.lw
View File

@ -2254,7 +2254,7 @@ int main(int argc, char **argv)
<<SM_overlayer-demo.C>>=
#include <LOCAL/CGALH3.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/random_selection.h>
#include <CGAL/point_generators_3.h>
#if CGAL_LEDA_VERSION < 500

2
Principal_component_analysis/test/Principal_component_analysis/linear_least_squares_fitting_points_2.cpp
View File

@ -1,6 +1,6 @@
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>

2
Principal_component_analysis/test/Principal_component_analysis/linear_least_squares_fitting_rectangles_2.cpp
View File

@ -2,7 +2,7 @@
#include <CGAL/Cartesian.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>

2
Principal_component_analysis/test/Principal_component_analysis/linear_least_squares_fitting_segments_2.cpp
View File

@ -2,7 +2,7 @@
#include <CGAL/Cartesian.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>

2
Principal_component_analysis/test/Principal_component_analysis/linear_least_squares_fitting_segments_3.cpp
View File

@ -2,7 +2,7 @@
#include <CGAL/Cartesian.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_3.h>
#include <CGAL/point_generators_3.h>

2
Principal_component_analysis/test/Principal_component_analysis/linear_least_squares_fitting_triangles_2.cpp
View File

@ -1,6 +1,6 @@
// test for the linear_least_square_fitting() functions.
#include <CGAL/Cartesian.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/linear_least_squares_fitting_2.h>
#include <CGAL/point_generators_2.h>

2
Robustness/demo/Robustness/cgal_types.h
View File

@ -32,7 +32,7 @@
#include <CGAL/segment_intersection_points_2.h>
#include <CGAL/Join_input_iterator.h>
#include <CGAL/copy_n.h>
#include <CGAL/algorithm.h>
#include <CGAL/convex_hull_2.h>
#include <CGAL/squared_distance_2.h>
#include <CGAL/Cartesian_converter.h>