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

turn comments into assertions

This commit is contained in:
Jane Tournois 2016-12-06 11:56:17 +01:00
parent e1b715a56a
commit 0eff912763
1 changed files with 7 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
Triangulation_3/include/CGAL/Triangulation_segment_traverser_3.h
View File

@ -652,14 +652,9 @@ public:
case Locate_type::EDGE:
{
//while (ltnext == Locate_type::EDGE
// && _cell_iterator != _cell_iterator.end()
// && are_equal(get_edge(), Edge(chnext, linext, ljnext)))
//{
// ++_cell_iterator;
// chnext = Cell_handle(_cell_iterator);
// _cell_iterator.entry(ltnext, linext, ljnext);
//}
CGAL_assertion(_cell_iterator == _cell_iterator.end()
|| !are_equal(get_edge(), Edge(chnext, linext, ljnext)));
if (_cell_iterator == _cell_iterator.end())
_curr_simplex = Cell_handle(_cell_iterator);
else if (ltnext == Locate_type::EDGE)
@ -707,17 +702,10 @@ public:
{
case Locate_type::VERTEX:
{
//while (ltnext == Locate_type::VERTEX
// && _cell_iterator != _cell_iterator.end()
// && get_vertex() == chnext->vertex(linext)//another cell with same vertex has been found
// && !triangulation().is_infinite(chnext))
//{
// ch = chnext;
// ++_cell_iterator;
// chnext = Cell_handle(_cell_iterator);
// _cell_iterator.entry(ltnext, linext, ljnext);
//}
CGAL_assertion(_cell_iterator == _cell_iterator.end()
|| get_vertex() != chnext->vertex(linext)
|| triangulation().is_infinite(chnext));
if (_cell_iterator == _cell_iterator.end())
{
_curr_simplex = Cell_handle(_cell_iterator);