From 02fdc5b53e4cd39b9be4eb059d801ff016b11d66 Mon Sep 17 00:00:00 2001 From: Nico Kruithof Date: Sun, 12 May 2013 19:44:36 +0200 Subject: [PATCH] Added debug code to analyse the error on windows with the hierarchy --- .../include/CGAL/Periodic_2_triangulation_2.h | 6 ++++++ .../test/Periodic_2_triangulation_2/test_p2t2_hierarchy.cpp | 1 + 2 files changed, 7 insertions(+) diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h index 320bc76b969..8d8830bcd9e 100644 --- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h +++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h @@ -4398,6 +4398,7 @@ Periodic_2_triangulation_2::save(std::ostream& os) const size_type m = _tds.number_of_faces(); if (is_ascii(os)) os << std::endl << m << std::endl; else write(os, m); + std::cout << "save, #Faces: " << m << std::endl; for( Face_iterator ib = faces_begin(); ib != faces_end(); ++ib) @@ -4413,12 +4414,16 @@ Periodic_2_triangulation_2::save(std::ostream& os) const } if(is_ascii(os)) os << "\n"; + std::cout << "save, face check: " << inum << " == " << m << std::endl; + CGAL_assertion(inum == m); + // neighbor pointers of the faces for( Face_iterator it = faces_begin(); it != faces_end(); ++it) { for(int j = 0; j < 3; ++j) { + CGAL_assertion(F.is_defined(it->neighbor(j))); if(is_ascii(os)) os << F[it->neighbor(j)] << " "; else write(os, F[it->neighbor(j)]); } @@ -4551,6 +4556,7 @@ Periodic_2_triangulation_2::load(std::istream& is) if (is_ascii(is)) is >> m; else read(is, m); std::vector F(m); + std::cout << "load, #Faces: " << m << std::endl; { for(size_t i = 0; i < m; ++i) { diff --git a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_hierarchy.cpp b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_hierarchy.cpp index 806d6c7afc8..98bf98dfb35 100644 --- a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_hierarchy.cpp +++ b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_hierarchy.cpp @@ -68,6 +68,7 @@ template class CGAL::Periodic_2_triangulation_hierarchy_2; int main() { + std::cout << "New version" << std::endl; std::cout << __FILE__ << ", " << __LINE__ << std::endl; typedef CGAL::Periodic_2_triangulation_hierarchy_2< PDT1 > P2T2_1; test(false);