From ff67bc9f9e8284d51dc2784d8a873c7e76e4164e Mon Sep 17 00:00:00 2001 From: Martin Kronbichler Date: Fri, 7 Aug 2015 18:28:47 +0200 Subject: [PATCH] Fix find_cell tests by avoiding ambiguity in point --- tests/bits/find_cell_1.cc | 5 +---- tests/bits/find_cell_alt_1.cc | 5 +---- 2 files changed, 2 insertions(+), 8 deletions(-) diff --git a/tests/bits/find_cell_1.cc b/tests/bits/find_cell_1.cc index 8bb800e5b5..0377abeae0 100644 --- a/tests/bits/find_cell_1.cc +++ b/tests/bits/find_cell_1.cc @@ -34,7 +34,7 @@ void check (Triangulation<2> &tria) { - Point<2> p (1./3., 1./2.); + Point<2> p (1./3., 1./2.-1e-10); // avoid ambiguity for hypercube mesh Triangulation<2>::active_cell_iterator cell = GridTools::find_active_cell_around_point (tria, p); @@ -72,6 +72,3 @@ int main () check (coarse_grid); } } - - - diff --git a/tests/bits/find_cell_alt_1.cc b/tests/bits/find_cell_alt_1.cc index a9debc2583..ec41c8eedf 100644 --- a/tests/bits/find_cell_alt_1.cc +++ b/tests/bits/find_cell_alt_1.cc @@ -39,7 +39,7 @@ void check (Triangulation<2> &tria) { MappingQ<2> map(3); // Let's take a higher order mapping - Point<2> p (1./3., 1./2.); + Point<2> p (1./3., 1./2.-1e-10); // avoid ambiguity for hypercube mesh std::pair::active_cell_iterator, Point<2> > cell = GridTools::find_active_cell_around_point (map, tria, p); @@ -78,6 +78,3 @@ int main () check (coarse_grid); } } - - - -- 2.39.5