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

CBP_ncopy changed to CBP_copy_n. 

More general template argument list for copy_n and for random_selection.
This commit is contained in:
Lutz Kettner 1997-06-19 15:29:48 +00:00
parent 8a4b76bb6b
commit bf4f2bb647
8 changed files with 16 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Packages/Generator/doc_tex/Generator/Segment_generator_prog1.C
View File

@ -11,7 +11,7 @@
#include <CGAL/Segment_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/Segment_generator.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
typedef CGAL_Cartesian<double> R;
@ -34,7 +34,7 @@ int main()
/* Create 200 segments. */
CGAL_Segment_generator<Segment, P1, P2> g( p1, p2);
CGAL_ncopy( g, 200, back_inserter( segs));
CGAL_copy_n( g, 200, back_inserter( segs));
/* Visualize segments. Can be omitted, see example programs */
/* in the CGAL source code distribution. */

4
Packages/Generator/doc_tex/Generator/Segment_generator_prog2.C
View File

@ -12,7 +12,7 @@
#include <CGAL/Segment_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/Segment_generator.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
typedef CGAL_Cartesian<double> R;
@ -47,7 +47,7 @@ int main()
I i1 = p1.begin();
I i2 = p2.begin();
CGAL_Segment_generator<Segment,I,I> g( i1, i2);
CGAL_ncopy( g, 100, back_inserter( segs));
CGAL_copy_n( g, 100, back_inserter( segs));
/* Visualize segments. Can be omitted, see example programs */
/* in the CGAL source code distribution. */

4
Packages/Generator/doc_tex/Generator/generators_prog1.C
View File

@ -9,7 +9,7 @@
#include <CGAL/Cartesian.h>
#include <CGAL/Point_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/random_selection.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
@ -24,7 +24,7 @@ int main()
/* Create 600 points within a disc of radius 150. */
CGAL_Random_points_in_disc_2<Point> g( 150.0);
CGAL_ncopy( g, 600, back_inserter( points));
CGAL_copy_n( g, 600, back_inserter( points));
/* Create 200 points from a 15 x 15 grid. */
CGAL_points_on_square_grid_2( 500.0, 200, back_inserter(points),(Point*)0);

4
Packages/Generator/doc_tex/Generator/generators_prog2.C
View File

@ -20,7 +20,7 @@ Point& CGAL_build_point( double x, double y, Point& p) {
}
#include <CGAL/point_generators_2.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
@ -45,7 +45,7 @@ int main()
/* Create 250 points within a disc of radius 150. */
CGAL_Random_points_in_disc_2<Point> g( 150.0);
CGAL_ncopy( g, 250, back_inserter( points));
CGAL_copy_n( g, 250, back_inserter( points));
/* Check that we have really created 500 points. */
assert( points.size() == 500);

4
Packages/Generator/doc_tex/support/Generator/Segment_generator_prog1.C
View File

@ -11,7 +11,7 @@
#include <CGAL/Segment_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/Segment_generator.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
typedef CGAL_Cartesian<double> R;
@ -34,7 +34,7 @@ int main()
/* Create 200 segments. */
CGAL_Segment_generator<Segment, P1, P2> g( p1, p2);
CGAL_ncopy( g, 200, back_inserter( segs));
CGAL_copy_n( g, 200, back_inserter( segs));
/* Visualize segments. Can be omitted, see example programs */
/* in the CGAL source code distribution. */

4
Packages/Generator/doc_tex/support/Generator/Segment_generator_prog2.C
View File

@ -12,7 +12,7 @@
#include <CGAL/Segment_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/Segment_generator.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
typedef CGAL_Cartesian<double> R;
@ -47,7 +47,7 @@ int main()
I i1 = p1.begin();
I i2 = p2.begin();
CGAL_Segment_generator<Segment,I,I> g( i1, i2);
CGAL_ncopy( g, 100, back_inserter( segs));
CGAL_copy_n( g, 100, back_inserter( segs));
/* Visualize segments. Can be omitted, see example programs */
/* in the CGAL source code distribution. */

4
Packages/Generator/doc_tex/support/Generator/generators_prog1.C
View File

@ -9,7 +9,7 @@
#include <CGAL/Cartesian.h>
#include <CGAL/Point_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/random_selection.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
@ -24,7 +24,7 @@ int main()
/* Create 600 points within a disc of radius 150. */
CGAL_Random_points_in_disc_2<Point> g( 150.0);
CGAL_ncopy( g, 600, back_inserter( points));
CGAL_copy_n( g, 600, back_inserter( points));
/* Create 200 points from a 15 x 15 grid. */
CGAL_points_on_square_grid_2( 500.0, 200, back_inserter(points),(Point*)0);

4
Packages/Generator/doc_tex/support/Generator/generators_prog2.C
View File

@ -20,7 +20,7 @@ Point& CGAL_build_point( double x, double y, Point& p) {
}
#include <CGAL/point_generators_2.h>
#include <CGAL/ncopy.h>
#include <CGAL/copy_n.h>
#include <CGAL/IO/Window_stream.h> /* only for visualization used */
@ -45,7 +45,7 @@ int main()
/* Create 250 points within a disc of radius 150. */
CGAL_Random_points_in_disc_2<Point> g( 150.0);
CGAL_ncopy( g, 250, back_inserter( points));
CGAL_copy_n( g, 250, back_inserter( points));
/* Check that we have really created 500 points. */
assert( points.size() == 500);