]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Do not use Tensor<..>(bool) contstructor in headers and testsuite
authorMatthias Maier <tamiko@43-1.org>
Mon, 7 Sep 2015 19:03:55 +0000 (14:03 -0500)
committerMatthias Maier <tamiko@43-1.org>
Mon, 7 Sep 2015 19:08:38 +0000 (14:08 -0500)
include/deal.II/matrix_free/fe_evaluation.h
tests/base/tensor_26.cc
tests/base/tensor_complex_06.cc
tests/matrix_free/integrate_functions.cc
tests/matrix_free/integrate_functions_multife.cc
tests/matrix_free/integrate_functions_multife2.cc

index 20ef63f77f8fc22bb743e293cfc0f501a49d3941..4725235c167b5c2a247dfc1c318701c106b12481 100644 (file)
@@ -3217,7 +3217,7 @@ FEEvaluationBase<dim,n_components_,Number>
 ::get_dof_value (const unsigned int dof) const
 {
   AssertIndexRange (dof, this->data->dofs_per_cell);
-  Tensor<1,n_components_,VectorizedArray<Number> > return_value (false);
+  Tensor<1,n_components_,VectorizedArray<Number> > return_value;
   for (unsigned int comp=0; comp<n_components; comp++)
     return_value[comp] = this->values_dofs[comp][dof];
   return return_value;
@@ -3234,7 +3234,7 @@ FEEvaluationBase<dim,n_components_,Number>
   Assert (this->values_quad_initialized==true,
           internal::ExcAccessToUninitializedField());
   AssertIndexRange (q_point, this->data->n_q_points);
-  Tensor<1,n_components_,VectorizedArray<Number> > return_value (false);
+  Tensor<1,n_components_,VectorizedArray<Number> > return_value;
   for (unsigned int comp=0; comp<n_components; comp++)
     return_value[comp] = this->values_quad[comp][q_point];
   return return_value;
@@ -3252,7 +3252,7 @@ FEEvaluationBase<dim,n_components_,Number>
           internal::ExcAccessToUninitializedField());
   AssertIndexRange (q_point, this->data->n_q_points);
 
-  Tensor<1,n_components_,Tensor<1,dim,VectorizedArray<Number> > > grad_out (false);
+  Tensor<1,n_components_,Tensor<1,dim,VectorizedArray<Number> > > grad_out;
 
   // Cartesian cell
   if (this->cell_type == internal::MatrixFreeFunctions::cartesian)
@@ -3477,7 +3477,7 @@ FEEvaluationBase<dim,n_components_,Number>
           internal::ExcAccessToUninitializedField());
   AssertIndexRange (q_point, this->data->n_q_points);
 
-  Tensor<1,n_components_,Tensor<1,dim,VectorizedArray<Number> > > hessian_out (false);
+  Tensor<1,n_components_,Tensor<1,dim,VectorizedArray<Number> > > hessian_out;
 
   // Cartesian cell
   if (this->cell_type == internal::MatrixFreeFunctions::cartesian)
@@ -3554,7 +3554,7 @@ FEEvaluationBase<dim,n_components_,Number>
   Assert (this->hessians_quad_initialized==true,
           internal::ExcAccessToUninitializedField());
   AssertIndexRange (q_point, this->data->n_q_points);
-  Tensor<1,n_components_,VectorizedArray<Number> > laplacian_out (false);
+  Tensor<1,n_components_,VectorizedArray<Number> > laplacian_out;
   const Tensor<1,n_components_,Tensor<1,dim,VectorizedArray<Number> > > hess_diag
     = get_hessian_diagonal(q_point);
   for (unsigned int comp=0; comp<n_components; ++comp)
@@ -3666,7 +3666,7 @@ FEEvaluationBase<dim,n_components_,Number>
   Assert (this->values_quad_submitted == true,
           internal::ExcAccessToUninitializedField());
 #endif
-  Tensor<1,n_components_,VectorizedArray<Number> > return_value (false);
+  Tensor<1,n_components_,VectorizedArray<Number> > return_value;
   for (unsigned int comp=0; comp<n_components; ++comp)
     return_value[comp] = this->values_quad[comp][0];
   const unsigned int n_q_points = this->data->n_q_points;
@@ -3808,7 +3808,7 @@ FEEvaluationAccess<dim,1,Number>
           internal::ExcAccessToUninitializedField());
   AssertIndexRange (q_point, this->data->n_q_points);
 
-  Tensor<1,dim,VectorizedArray<Number> > grad_out (false);
+  Tensor<1,dim,VectorizedArray<Number> > grad_out;
 
   // Cartesian cell
   if (this->cell_type == internal::MatrixFreeFunctions::cartesian)
@@ -4102,7 +4102,7 @@ FEEvaluationAccess<dim,dim,Number>
 {
   // copy from generic function into dim-specialization function
   const Tensor<2,dim,VectorizedArray<Number> > grad = get_gradient(q_point);
-  Tensor<1,dim==2?1:dim,VectorizedArray<Number> > curl (false);
+  Tensor<1,dim==2?1:dim,VectorizedArray<Number> > curl;
   switch (dim)
     {
     case 1:
@@ -4407,7 +4407,7 @@ FEEvaluationAccess<1,1,Number>
           internal::ExcAccessToUninitializedField());
   AssertIndexRange (q_point, this->data->n_q_points);
 
-  Tensor<1,1,VectorizedArray<Number> > grad_out (false);
+  Tensor<1,1,VectorizedArray<Number> > grad_out;
 
   // Cartesian cell
   if (this->cell_type == internal::MatrixFreeFunctions::cartesian)
@@ -6660,7 +6660,7 @@ FEEvaluation<dim,fe_degree,n_q_points_1d,n_components_,Number>
   // value from that
   if (this->cell_type == internal::MatrixFreeFunctions::cartesian)
     {
-      Point<dim,VectorizedArray<Number> > point (false);
+      Point<dim,VectorizedArray<Number> > point;
       switch (dim)
         {
         case 1:
index 8a8fbf1efcc47eefbfd64d5fd8540874be9ab0e0..7efabdde4c0b6b56c4b2141c005524bf20c78fb5 100644 (file)
@@ -32,7 +32,7 @@ template <int dim>
 void test_tensor ()
 {
   // a real tensor
-  Tensor<1,dim,double> t (false);
+  Tensor<1,dim,double> t;
 
   for (unsigned int i=0; i<dim; ++i)
     {
index 8b8eb8d87aea1ada2daeef1d94bb436467f76af3..692d6b542edfe6cc1ed074d857f93dd7030b3f78 100644 (file)
@@ -26,7 +26,7 @@
 template <int dim>
 void test_tensor_01 ()
 {
-  Tensor<1,dim,std::complex<double> > t (false);
+  Tensor<1,dim,std::complex<double> > t;
   for (unsigned int i=0; i<dim; ++i)
     {
       t[i] = std::complex<double> (i,1);
@@ -41,7 +41,7 @@ void test_tensor_01 ()
 template <int dim>
 void test_tensor_02 ()
 {
-  Tensor<1,dim,std::complex<double> > t (false);
+  Tensor<1,dim,std::complex<double> > t;
   for (unsigned int i=0; i<dim; ++i)
     {
       t[i] = std::complex<double> (1,i);
index 7e7abb7d67ea71966ee757a26f692a70d5b64a72..7fc45a2f32352dd4f9dd3ca280be4f503be47652 100644 (file)
@@ -1,6 +1,6 @@
 // ---------------------------------------------------------------------
 //
-// Copyright (C) 2013 - 2014 by the deal.II authors
+// Copyright (C) 2013 - 2015 by the deal.II authors
 //
 // This file is part of the deal.II library.
 //
@@ -129,7 +129,7 @@ operator () (const MatrixFree<dim,Number> &data,
       for (unsigned int q=0; q<n_q_points; ++q)
         {
           fe_eval.submit_value (values[q], q);
-          Tensor<1,dim,VectorizedArray<Number> > submit (false);
+          Tensor<1,dim,VectorizedArray<Number> > submit;
           for (unsigned int d=0; d<dim; ++d)
             submit[d] = gradients[q*dim+d];
           fe_eval.submit_gradient (submit, q);
index c3c2dda7adf7d4548ae6260753ea37fb1cb1eac8..355a48cb7445655dbdd1722ab6b23bd6ecc65daf 100644 (file)
@@ -1,6 +1,6 @@
 // ---------------------------------------------------------------------
 //
-// Copyright (C) 2013 - 2014 by the deal.II authors
+// Copyright (C) 2013 - 2015 by the deal.II authors
 //
 // This file is part of the deal.II library.
 //
@@ -185,7 +185,7 @@ operator () (const MatrixFree<dim,Number> &data,
       for (unsigned int q=0; q<n_q_points0; ++q)
         {
           fe_eval0.submit_value (values0[q], q);
-          Tensor<1,dim,VectorizedArray<Number> > submit (false);
+          Tensor<1,dim,VectorizedArray<Number> > submit;
           for (unsigned int d=0; d<dim; ++d)
             submit[d] = gradients0[q*dim+d];
           fe_eval0.submit_gradient (submit, q);
@@ -197,7 +197,7 @@ operator () (const MatrixFree<dim,Number> &data,
       for (unsigned int q=0; q<n_q_points1; ++q)
         {
           fe_eval1.submit_value (values1[q], q);
-          Tensor<1,dim,VectorizedArray<Number> > submit (false);
+          Tensor<1,dim,VectorizedArray<Number> > submit;
           for (unsigned int d=0; d<dim; ++d)
             submit[d] = gradients1[q*dim+d];
           fe_eval1.submit_gradient (submit, q);
@@ -209,7 +209,7 @@ operator () (const MatrixFree<dim,Number> &data,
       for (unsigned int q=0; q<n_q_points1; ++q)
         {
           fe_eval01.submit_value (values1[q], q);
-          Tensor<1,dim,VectorizedArray<Number> > submit (false);
+          Tensor<1,dim,VectorizedArray<Number> > submit;
           for (unsigned int d=0; d<dim; ++d)
             submit[d] = gradients1[q*dim+d];
           fe_eval01.submit_gradient (submit, q);
index e681ab171bef1eff3c05d597b975b1c4d54a00e9..f690b81370e6138fa7dc1a4bab70dade101d3313 100644 (file)
@@ -1,6 +1,6 @@
 // ---------------------------------------------------------------------
 //
-// Copyright (C) 2013 - 2014 by the deal.II authors
+// Copyright (C) 2013 - 2015 by the deal.II authors
 //
 // This file is part of the deal.II library.
 //
@@ -188,7 +188,7 @@ operator () (const MatrixFree<dim,Number> &data,
       for (unsigned int q=0; q<n_q_points0; ++q)
         {
           fe_eval0.submit_value (values0[q], q);
-          Tensor<1,dim,VectorizedArray<Number> > submit (false);
+          Tensor<1,dim,VectorizedArray<Number> > submit;
           for (unsigned int d=0; d<dim; ++d)
             submit[d] = gradients0[q*dim+d];
           fe_eval0.submit_gradient (submit, q);
@@ -200,7 +200,7 @@ operator () (const MatrixFree<dim,Number> &data,
       for (unsigned int q=0; q<n_q_points1; ++q)
         {
           fe_eval1.submit_value (values1[q], q);
-          Tensor<1,dim,VectorizedArray<Number> > submit (false);
+          Tensor<1,dim,VectorizedArray<Number> > submit;
           for (unsigned int d=0; d<dim; ++d)
             submit[d] = gradients1[q*dim+d];
           fe_eval1.submit_gradient (submit, q);
@@ -212,7 +212,7 @@ operator () (const MatrixFree<dim,Number> &data,
       for (unsigned int q=0; q<n_q_points1; ++q)
         {
           fe_eval01.submit_value (values1[q], q);
-          Tensor<1,dim,VectorizedArray<Number> > submit (false);
+          Tensor<1,dim,VectorizedArray<Number> > submit;
           for (unsigned int d=0; d<dim; ++d)
             submit[d] = gradients1[q*dim+d];
           fe_eval01.submit_gradient (submit, q);

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.