From 714c0c6acd9c29f1c63d4763862b15aabe79405e Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Wed, 21 Aug 2019 16:34:25 -0600 Subject: [PATCH] Also convert tests. --- tests/base/polynomials_bdm_01.cc | 3 ++- tests/base/polynomials_bdm_02.cc | 2 +- tests/base/polynomials_br.cc | 4 ++-- tests/base/polynomials_rt.cc | 3 ++- tests/base/polynomials_rt_bubbles.cc | 3 ++- tests/base/polynomials_tensor.cc | 2 +- 6 files changed, 10 insertions(+), 7 deletions(-) diff --git a/tests/base/polynomials_bdm_01.cc b/tests/base/polynomials_bdm_01.cc index 18e3d0da21..093185cf83 100644 --- a/tests/base/polynomials_bdm_01.cc +++ b/tests/base/polynomials_bdm_01.cc @@ -46,7 +46,8 @@ plot(const PolynomialsBDM &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 6e5777250a..68834f1cdb 100644 --- a/tests/base/polynomials_bdm_02.cc +++ b/tests/base/polynomials_bdm_02.cc @@ -64,7 +64,7 @@ plot(const PolynomialsBDM &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 ad7dde0993..a448a3742a 100644 --- a/tests/base/polynomials_br.cc +++ b/tests/base/polynomials_br.cc @@ -88,7 +88,7 @@ check_poly_q(const PolynomialsBernardiRaugel &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::vertices_per_cell; @@ -148,7 +148,7 @@ check_poly_bubble(const PolynomialsBernardiRaugel &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::vertices_per_cell; diff --git a/tests/base/polynomials_rt.cc b/tests/base/polynomials_rt.cc index ac3db5d543..3f0853f393 100644 --- a/tests/base/polynomials_rt.cc +++ b/tests/base/polynomials_rt.cc @@ -46,7 +46,8 @@ plot(const PolynomialsRaviartThomas &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 484c8e87ac..63e797967a 100644 --- a/tests/base/polynomials_rt_bubbles.cc +++ b/tests/base/polynomials_rt_bubbles.cc @@ -45,7 +45,8 @@ plot(const PolynomialsRT_Bubbles &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 1bd0a7e373..c0d8bccc30 100644 --- a/tests/base/polynomials_tensor.cc +++ b/tests/base/polynomials_tensor.cc @@ -39,7 +39,7 @@ check_point(const Point &x, const PolynomialType &p) std::vector> thirds(0); std::vector> 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) -- 2.39.5