Trailing whitespace in Spatial searching

This commit is contained in:
Mael Rouxel-Labbé 2017-01-09 17:46:47 +01:00
parent e64f271451
commit fe8f36bcac
9 changed files with 114 additions and 116 deletions

View File

@ -26,7 +26,6 @@ typedef Point_with_info_helper<Point>::type
typedef Point_property_map<Point> Ppmap;
typedef CGAL::Search_traits_adapter<Point_with_info,Ppmap,Traits> Traits_with_info;
template <class Traits>
void run(std::list<Point> all_points){
typedef CGAL::Fuzzy_sphere<Traits> Fuzzy_circle;
@ -96,15 +95,14 @@ int main() {
const int N=1000;
// generator for random data points in the square ( (-1,-1), (1,1) )
Random_points_iterator rpit( 1.0);
Random_points_iterator rpit(1.0);
// construct list containing N random points
std::list<Point> all_points(N_Random_points_iterator(rpit,0),
N_Random_points_iterator(N));
N_Random_points_iterator(N));
run<Traits>(all_points);
run<Traits_with_info>(all_points);
return 0;
}

View File

@ -92,7 +92,7 @@ int main() {
// construct list containing N random points
std::list<Point> all_points(N_Random_points_iterator(rpit,0),
N_Random_points_iterator(N));
N_Random_points_iterator(N));
run<Traits>(all_points);
run<Traits_with_info>(all_points);

View File

@ -88,7 +88,7 @@ int main() {
// construct list containing N random points
std::list<Point> all_points(N_Random_points_iterator(rpit,0),
N_Random_points_iterator(N));
N_Random_points_iterator(N));
run<Traits>(all_points);
run<Traits_with_info>(all_points);

View File

@ -63,7 +63,7 @@ main() {
Fuzzy_iso_box approximate_range(p, q, 0.1);
tree.search(std::back_inserter( result ), approximate_range);
std::cout << "The points in the fuzzy box [<0.1-0.3>,<0.6-0.9>]x[<0.1-0.3>,<0.6-0.9>] are: "
<< std::endl;
<< std::endl;
std::copy (result.begin(), result.end(), std::ostream_iterator<Point_d>(std::cout,"\n") );
std::cout << std::endl;
return 0;