Fix find_cell tests by avoiding ambiguity in point

diff --git a/tests/bits/find_cell_1.cc b/tests/bits/find_cell_1.cc
index 8bb800e5b5df487fcad7114df62eb9a9ea921813..0377abeae00e8354e683ad636f14ebe6b5ea4064 100644 (file)
--- 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 a9debc2583e5e11122522f4552c4c0b6c215fc4e..ec41c8eedf57446491539a2aa441d6de9f0d2050 100644 (file)
--- 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<Triangulation<2>::active_cell_iterator, Point<2> >
   cell = GridTools::find_active_cell_around_point (map, tria, p);
@@ -78,6 +78,3 @@ int main ()
     check (coarse_grid);
   }
 }
-
-
-