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

Fix compilation of traverser benchmark

This commit is contained in:
Mael Rouxel-Labbé 2025-01-16 11:03:06 +01:00
parent 8be09c9cc4
commit 8fe8a8c904
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
Triangulation_3/benchmark/Triangulation_3/segment_traverser_benchmark.cpp
View File

@ -44,7 +44,7 @@ void bench_segment_traverser(const int nb_queries,
typedef CGAL::Triangulation_segment_simplex_iterator_3<DT> Simplex_traverser; typedef CGAL::Triangulation_segment_simplex_iterator_3<DT> Simplex_traverser;
typedef CGAL::Triangulation_segment_cell_iterator_3<DT> Cell_traverser; typedef CGAL::Triangulation_segment_cell_iterator_3<DT> Cell_traverser;
typedef typename DT::Point_3 Point_3; typedef typename DT::Point_3 Point_3;
typedef typename DT::Cell Cell; typedef typename DT::Cell_handle Cell_handle;
std::cout << "\nBench :\t " << nb_queries << " queries," << std::endl std::cout << "\nBench :\t " << nb_queries << " queries," << std::endl
<< "\t in triangulation of size " << nbv << std::endl << "\t in triangulation of size " << nbv << std::endl
@ -83,29 +83,29 @@ void bench_segment_traverser(const int nb_queries,
{ {
//Simplex traverser //Simplex traverser
timer_st.start(); timer_st.start();
Simplex_traverser st(dt, segments[2*i], segments[2*i + 1]); Simplex_traverser st(&dt, segments[2*i], segments[2*i + 1]);
// Count the number of finite cells traversed. // Count the number of finite cells traversed.
unsigned int inf = 0, fin = 0; unsigned int inf = 0, fin = 0;
for (; st != st.end(); ++st) for (; st != st.end(); ++st)
{ {
Cell c = st.cell(); Cell_handle c = st.get_cell();
// if (dt.is_infinite(c)) ++inf; // if (dt.is_infinite(c)) ++inf;
// else ++fin; // else ++fin;
} }
timer_st.stop(); timer_st.stop();
//Cell traverser //Cell traverser
timer_ct.start(); timer_ct.start();
Cell_traverser ct(dt, segments[2*i], segments[2*i + 1]); Cell_traverser ct(&dt, segments[2*i], segments[2*i + 1]);
// Count the number of finite cells traversed. // Count the number of finite cells traversed.
inf = 0, fin = 0; inf = 0, fin = 0;
for (; ct != ct.end(); ++ct) for (; ct != ct.end(); ++ct)
{ {
Cell c = ct.cell(); Cell_handle c = ct.handle();
// if (dt.is_infinite(c)) ++inf; // if (dt.is_infinite(c)) ++inf;
// else ++fin; // else ++fin;
} }
timer_ct.stop(); timer_ct.stop();
} }