From: Wolfgang Bangerth Date: Thu, 30 Oct 2003 17:20:53 +0000 (+0000) Subject: New tests, finally finished. X-Git-Tag: v8.0.0~16034 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=ac20fb6d6ed6e90e253a036d9b6ec641083ad771;p=dealii.git New tests, finally finished. git-svn-id: https://svn.dealii.org/trunk@8179 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/tests/bits/find_cell_1.cc b/tests/bits/find_cell_1.cc index a838942352..4755c31144 100644 --- a/tests/bits/find_cell_1.cc +++ b/tests/bits/find_cell_1.cc @@ -30,14 +30,18 @@ void check (Triangulation<2> &tria) { + Point<2> p (1./3., 1./2.); + Triangulation<2>::active_cell_iterator cell - = GridTools::find_active_cell_around_point (tria, - Point<2>(1./3., 1./2.)); + = GridTools::find_active_cell_around_point (tria, p); deallog << cell << std::endl; for (unsigned int v=0; v::vertices_per_cell; ++v) deallog << "<" << cell->vertex(v) << "> "; deallog << std::endl; + + Assert (p.distance (cell->center()) < cell->diameter()/2, + ExcInternalError()); } diff --git a/tests/bits/find_cell_2.cc b/tests/bits/find_cell_2.cc index 5efdc8857d..be66e0547d 100644 --- a/tests/bits/find_cell_2.cc +++ b/tests/bits/find_cell_2.cc @@ -29,16 +29,18 @@ void check (Triangulation<3> &tria) { + Point<3> p(1./3.,1./2.,1./5.); + Triangulation<3>::active_cell_iterator cell - = GridTools::find_active_cell_around_point (tria, - Point<3>(1./3., - 1./2., - 2./3.)); + = GridTools::find_active_cell_around_point (tria, p); deallog << cell << std::endl; for (unsigned int v=0; v::vertices_per_cell; ++v) deallog << "<" << cell->vertex(v) << "> "; deallog << std::endl; + + Assert (p.distance (cell->center()) < cell->diameter()/2, + ExcInternalError()); } diff --git a/tests/bits/find_cell_3.cc b/tests/bits/find_cell_3.cc index e88fb72985..eb07bf7bfe 100644 --- a/tests/bits/find_cell_3.cc +++ b/tests/bits/find_cell_3.cc @@ -29,16 +29,18 @@ void check (Triangulation<3> &tria) { + Point<3> p(1./3.,1./2.,-1./5.); + Triangulation<3>::active_cell_iterator cell - = GridTools::find_active_cell_around_point (tria, - Point<3>(1./3., - 1./2., - 2./3.)); + = GridTools::find_active_cell_around_point (tria, p); deallog << cell << std::endl; for (unsigned int v=0; v::vertices_per_cell; ++v) deallog << "<" << cell->vertex(v) << "> "; deallog << std::endl; + + Assert (p.distance (cell->center()) < cell->diameter()/2, + ExcInternalError()); }