Also convert tests.

diff --git a/tests/base/polynomials_bdm_01.cc b/tests/base/polynomials_bdm_01.cc
index 18e3d0da21cf455dc6aa638e25edcf03eb117019..093185cf833246aaa464582dc9b0549a420acff9 100644 (file)
--- a/tests/base/polynomials_bdm_01.cc
+++ b/tests/base/polynomials_bdm_01.cc
@@ -46,7 +46,8 @@ plot(const PolynomialsBDM<dim> &poly)
 
       deallog << "BDM" << poly.degree() << '<' << dim << '>' << '\t'
               << quadrature.point(k);
-      poly.compute(quadrature.point(k), values, grads, grads2, thirds, fourths);
+      poly.evaluate(
+        quadrature.point(k), values, grads, grads2, thirds, fourths);
 
       for (unsigned int i = 0; i < poly.n(); ++i)
         for (unsigned int d = 0; d < dim; ++d)

diff --git a/tests/base/polynomials_bdm_02.cc b/tests/base/polynomials_bdm_02.cc
index 6e5777250a3abd1904ad142c6201b8d2c1822986..68834f1cdb7139dcd9c2283e63414cc998aa8f8a 100644 (file)
--- a/tests/base/polynomials_bdm_02.cc
+++ b/tests/base/polynomials_bdm_02.cc
@@ -64,7 +64,7 @@ plot(const PolynomialsBDM<dim> &poly)
 
       deallog << "BDM" << poly.degree() << '<' << dim << '>' << points[k]
               << std::endl;
-      poly.compute(points[k], values, grads, grads2, thirds, fourths);
+      poly.evaluate(points[k], values, grads, grads2, thirds, fourths);
 
       for (unsigned int i = 0; i < poly.degree() + 1; ++i, start += dim)
         for (unsigned int j = 0; j < dim; ++j)

diff --git a/tests/base/polynomials_br.cc b/tests/base/polynomials_br.cc
index ad7dde099349da56f7b18870430f2810a907810d..a448a3742ad32a047024412b0caacaa5076be2cb 100644 (file)
--- a/tests/base/polynomials_br.cc
+++ b/tests/base/polynomials_br.cc
@@ -88,7 +88,7 @@ check_poly_q(const PolynomialsBernardiRaugel<dim> &poly)
         deallog << ", " << points[i][d];
       deallog << ")" << std::endl;
 
-      poly.compute(points[i], values, grads, grads2, thirds, fourths);
+      poly.evaluate(points[i], values, grads, grads2, thirds, fourths);
 
       // loop through the Q_1^d shape functions
       for (unsigned int j = 0; j < dim * GeometryInfo<dim>::vertices_per_cell;
@@ -148,7 +148,7 @@ check_poly_bubble(const PolynomialsBernardiRaugel<dim> &poly)
         deallog << ", " << points[i][d];
       deallog << ")" << std::endl;
 
-      poly.compute(points[i], values, grads, grads2, thirds, fourths);
+      poly.evaluate(points[i], values, grads, grads2, thirds, fourths);
 
       // loop through the bubble shape functions
       for (unsigned int j = dim * GeometryInfo<dim>::vertices_per_cell;

diff --git a/tests/base/polynomials_rt.cc b/tests/base/polynomials_rt.cc
index ac3db5d543e791ba7e6247cb9efcbbe74fdc8fd8..3f0853f3932fa7e5678a232347a74cc3432c4c91 100644 (file)
--- a/tests/base/polynomials_rt.cc
+++ b/tests/base/polynomials_rt.cc
@@ -46,7 +46,8 @@ plot(const PolynomialsRaviartThomas<dim> &poly)
 
       deallog << "RT" << poly.degree() << '<' << dim << '>' << '\t'
               << quadrature.point(k);
-      poly.compute(quadrature.point(k), values, grads, grads2, thirds, fourths);
+      poly.evaluate(
+        quadrature.point(k), values, grads, grads2, thirds, fourths);
 
       for (unsigned int i = 0; i < poly.n(); ++i)
         for (unsigned int d = 0; d < dim; ++d)

diff --git a/tests/base/polynomials_rt_bubbles.cc b/tests/base/polynomials_rt_bubbles.cc
index 484c8e87ac2ca2a534041c4015909f2622b4669d..63e797967ad2ca71472827fc6afc81cfceeb16b2 100644 (file)
--- a/tests/base/polynomials_rt_bubbles.cc
+++ b/tests/base/polynomials_rt_bubbles.cc
@@ -45,7 +45,8 @@ plot(const PolynomialsRT_Bubbles<dim> &poly)
 
       deallog << "RT_Bubbles" << poly.degree() << '<' << dim << '>' << '\t'
               << quadrature.point(k);
-      poly.compute(quadrature.point(k), values, grads, grads2, thirds, fourths);
+      poly.evaluate(
+        quadrature.point(k), values, grads, grads2, thirds, fourths);
 
       for (unsigned int i = 0; i < poly.n(); ++i)
         for (unsigned int d = 0; d < dim; ++d)

diff --git a/tests/base/polynomials_tensor.cc b/tests/base/polynomials_tensor.cc
index 1bd0a7e37381bb6d0cd193d58d59b5601b8f4a82..c0d8bccc3042210e60d7b4a720c28843d67cd9a5 100644 (file)
--- a/tests/base/polynomials_tensor.cc
+++ b/tests/base/polynomials_tensor.cc
@@ -39,7 +39,7 @@ check_point(const Point<dim> &x, const PolynomialType &p)
   std::vector<Tensor<4, dim>> thirds(0);
   std::vector<Tensor<5, dim>> fourths(0);
 
-  p.compute(x, values, gradients, seconds, thirds, fourths);
+  p.evaluate(x, values, gradients, seconds, thirds, fourths);
 
   deallog << "Point " << x << std::endl;
   for (unsigned int i = 0; i < n; ++i)