Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix compilation of T3 traverser benchmark #8694

Merged
merged 1 commit into from
Jan 17, 2025
Merged

Fix compilation of T3 traverser benchmark #8694

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 9 additions & 9 deletions Triangulation_3/benchmark/Triangulation_3/segment_traverser_benchmark.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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_cell_iterator_3<DT> Cell_traverser;
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
<< "\t in triangulation of size " << nbv << std::endl
Expand Down Expand Up @@ -83,29 +83,29 @@ void bench_segment_traverser(const int nb_queries,
{
//Simplex traverser
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.
unsigned int inf = 0, fin = 0;
for (; st != st.end(); ++st)
{
Cell c = st.cell();
// if (dt.is_infinite(c)) ++inf;
// else ++fin;
Cell_handle c = st.get_cell();
// if (dt.is_infinite(c)) ++inf;
// else ++fin;
}
timer_st.stop();

//Cell traverser
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.
inf = 0, fin = 0;
for (; ct != ct.end(); ++ct)
{
Cell c = ct.cell();
// if (dt.is_infinite(c)) ++inf;
// else ++fin;
Cell_handle c = ct.handle();
// if (dt.is_infinite(c)) ++inf;
// else ++fin;
}
timer_ct.stop();
}
Expand Down
Loading