From: Wolfgang Bangerth <bangerth@math.tamu.edu>
Date: Wed, 30 Apr 2003 22:51:19 +0000 (+0000)
Subject: Add some missing std::
X-Git-Tag: v8.0.0~16618
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=ec7b270d67bf0c13a96a3ad9108337d8ac9aefa1;p=dealii.git

Add some missing std::


git-svn-id: https://svn.dealii.org/trunk@7520 0785d39b-7218-0410-832d-ea1e28bc413d
---

diff --git a/tests/base/anisotropic_1.cc b/tests/base/anisotropic_1.cc
index 9c3f727f2f..5887304356 100644
--- a/tests/base/anisotropic_1.cc
+++ b/tests/base/anisotropic_1.cc
@@ -45,14 +45,14 @@ void check_poly(const Point<dim> &x,
     {
 				       // Check if compute_value is ok
       double val1 = p.compute_value(k,x);
-      if (fabs(val1 - values1[k]) > 5.0E-16)
+      if (std::fabs(val1 - values1[k]) > 5.0E-16)
 	deallog << 'P' << k << ": values differ " << val1 << " != "
 		<< values1[k] << std::endl;
       double val2 = q.compute_value(k,x);
-      if (fabs(val2 - values2[k]) > 5.0E-16)
+      if (std::fabs(val2 - values2[k]) > 5.0E-16)
 	deallog << 'Q' << k << ": values differ " << val2 << " != "
 		<< values2[k] << std::endl;
-      if (fabs(val2 - val1) > 5.0E-16)
+      if (std::fabs(val2 - val1) > 5.0E-16)
 	deallog << "PQ" << k << ": values differ " << val1 << " != "
 		<< val2 << std::endl;
 
@@ -91,8 +91,8 @@ void check_poly(const Point<dim> &x,
                                        // somewhat to make them
                                        // significant despite our
                                        // two-post-dot-digits limit
-      values1[k] *= pow(10, dim);
-      gradients1[k] *= pow(10, dim);
+      values1[k] *= std::pow(10, dim);
+      gradients1[k] *= std::pow(10, dim);
       
       deallog << 'P' << k << "\t= " << values1[k]
 	      << "\tgradient\t";
diff --git a/tests/base/polynomial1d.cc b/tests/base/polynomial1d.cc
index c3c3c3a772..492884b379 100644
--- a/tests/base/polynomial1d.cc
+++ b/tests/base/polynomial1d.cc
@@ -90,7 +90,7 @@ int main ()
       for (unsigned int j=0;j<p.size();++j)
 	{
 	  double x = (double) j/p.size();
-	  if (fabs(q[i].value(2.*x)-p[i].value(x)) > 1.e-15)
+	  if (std::fabs(q[i].value(2.*x)-p[i].value(x)) > 1.e-15)
 	    deallog << "Polynomial " << i
 		    << ": Values q(" << 2.*x
 		    << ") and p(" << x
@@ -102,12 +102,12 @@ int main ()
       for (unsigned int j=0;j<p.size();++j)
 	{
 	  double x = (double) j/p.size();
-	  double diff = fabs(q[i].value(2.*x-1.)-p[i].value(x));
+	  double diff = std::fabs(q[i].value(2.*x-1.)-p[i].value(x));
 	  if (diff > 1.e-13)
 	    deallog << "Polynomial " << i
 		    << ": Values q(" << 2.*x-1.
 		    << ") and p(" << x
-		    << ") differ by 10^" << log(diff)/log(10)
+		    << ") differ by 10^" << std::log(diff)/log(10)
 		    << " after shift: " << q[i].value(2.*x-1.)
 		    << " != " << p[i].value(x)
 		    << std::endl;
diff --git a/tests/base/polynomial_test.cc b/tests/base/polynomial_test.cc
index c9a16ef9ed..dcbfbd6fb1 100644
--- a/tests/base/polynomial_test.cc
+++ b/tests/base/polynomial_test.cc
@@ -48,7 +48,7 @@ void check_poly(const Point<dim>& x,
       
 				       // Check if compute_value is ok
       double val = p.compute_value(k,x);
-      if (fabs(val - values[k]) > 5.0E-15)
+      if (std::fabs(val - values[k]) > 5.0E-15)
 	deallog << 'P' << k << ": values differ " << val << " != "
 		<< values[k] << std::endl;
 
@@ -78,8 +78,8 @@ void check_poly(const Point<dim>& x,
                                        // somewhat to make them
                                        // significant despite our
                                        // two-post-dot-digits limit
-      values[k] *= pow(10, dim);
-      gradients[k] *= pow(10, dim);
+      values[k] *= std::pow(10, dim);
+      gradients[k] *= std::pow(10, dim);
       
       deallog << 'P' << k << "\t= " << values[k]
 	      << "\tgradient\t";