]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Use p[index] instead of p(index) for class Point in tests/. 16504/head
authorWolfgang Bangerth <bangerth@colostate.edu>
Fri, 19 Jan 2024 17:24:48 +0000 (10:24 -0700)
committerWolfgang Bangerth <bangerth@colostate.edu>
Fri, 19 Jan 2024 17:31:14 +0000 (10:31 -0700)
251 files changed:
tests/aniso/up_and_down.cc
tests/base/auto_derivative_function.cc
tests/base/function_derivative.cc
tests/base/functions_04.cc
tests/base/functions_09.cc
tests/base/kokkos_point.cc
tests/base/point_01.cc
tests/base/point_04.cc
tests/base/point_05.cc
tests/base/point_constexpr.cc
tests/base/polynomial1d.cc
tests/base/polynomial_lagrange.cc
tests/base/polynomial_lagrange_order.cc
tests/base/polynomials_tensor.cc
tests/base/qprojector.cc
tests/base/quadrature_chebyshev.cc
tests/base/quadrature_sorted_test.cc
tests/base/quadrature_test.cc
tests/bits/anna_4.cc
tests/bits/christian_1.cc
tests/bits/cone_04.cc
tests/bits/denis_1.cc
tests/bits/error_estimator_01.cc
tests/bits/error_estimator_02.cc
tests/bits/fe_q_constraints.cc
tests/bits/find_cell_10.cc
tests/bits/find_cell_10a.cc
tests/bits/find_cell_11.cc
tests/bits/find_cell_12.cc
tests/bits/periodicity_06.cc
tests/bits/periodicity_07.cc
tests/bits/point_gradient_01.cc
tests/bits/point_gradient_02.cc
tests/bits/point_gradient_hp_01.cc
tests/bits/point_gradient_hp_02.cc
tests/bits/point_inside_1.cc
tests/bits/point_inside_2.cc
tests/bits/static_condensation.cc
tests/bits/step-12.cc
tests/bits/step-13.cc
tests/bits/step-4.cc
tests/bits/step-4_dg_periodic.cc
tests/bits/step-4_dg_periodic_coupling.cc
tests/bits/step-51.cc
tests/bits/step-51p.cc
tests/bits/step-7.cc
tests/bits/step-8.cc
tests/bits/subdomain_ids_01.cc
tests/bits/subdomain_ids_02.cc
tests/bits/subdomain_ids_03.cc
tests/bits/subdomain_ids_04.cc
tests/bits/subdomain_ids_05.cc
tests/bits/subdomain_ids_06.cc
tests/bits/subdomain_ids_07.cc
tests/codim_one/data_out_03.cc
tests/codim_one/error_estimator_01.cc
tests/codim_one/error_estimator_02.cc
tests/codim_one/extract_boundary_mesh_09.cc
tests/codim_one/mesh_bug.cc
tests/data_out/data_out_base.cc
tests/data_out/data_out_curved_cells.cc
tests/data_out/data_out_postprocessor_tensor_01.cc
tests/data_out/data_out_postprocessor_tensor_02.cc
tests/data_out/patches.h
tests/distributed_grids/3d_coarse_grid_05.cc
tests/distributed_grids/get_boundary_ids_01.cc
tests/dofs/dof_test.cc
tests/dofs/dof_tools_04a.cc
tests/dofs/dof_tools_21_b.cc
tests/dofs/dof_tools_21_b_x.cc
tests/dofs/dof_tools_21_b_x_q3.cc
tests/dofs/dof_tools_21_b_y.cc
tests/dofs/dof_tools_21_c.cc
tests/dofs/dof_tools_22a.cc
tests/dofs/dof_tools_common_parallel.h
tests/dofs/dof_tools_extract_dofs_with_support_contained_within_01.cc
tests/dofs/dof_tools_extract_dofs_with_support_contained_within_02.cc
tests/dofs/dof_tools_extract_dofs_with_support_contained_within_03.cc
tests/dofs/dof_tools_extract_dofs_with_support_contained_within_04.cc
tests/fe/2d_grid_projection_hermite.cc
tests/fe/bdm_2.cc
tests/fe/br_approximation_01.cc
tests/fe/curl_curl_01.cc
tests/fe/fe_abf_gradient_divergence_theorem.cc
tests/fe/fe_br.cc
tests/fe/fe_nedelec_sz_non_rect_face.cc
tests/fe/fe_project_2d.cc
tests/fe/fe_project_3d.cc
tests/fe/fe_q_bubbles.cc
tests/fe/fe_rt_gradient_divergence_theorem.cc
tests/fe/fe_rt_hessian_divergence_theorem.cc
tests/fe/fe_tools_test.cc
tests/fe/fe_values_no_mapping.cc
tests/fe/fe_values_view_30.cc
tests/fe/interpolate_common.h
tests/fe/jacobians.cc
tests/fe/jacobians_face.cc
tests/fe/jacobians_face_cartesian.cc
tests/fe/jacobians_face_fe_field.cc
tests/fe/nedelec.cc
tests/fe/nedelec_non_rect_face.cc
tests/fe/p1nc_02.cc
tests/fe/p1nc_03.cc
tests/fe/p1nc_04.cc
tests/fe/p1nc_06.cc
tests/fe/p1nc_07.cc
tests/fe/p1nc_08.cc
tests/fe/rt_2.cc
tests/fe/rt_approximation_01.cc
tests/fe/rt_bubbles_2.cc
tests/fe/up_and_down.cc
tests/feinterface/step-12.cc
tests/feinterface/stokes.cc
tests/fullydistributed_grids/copy_serial_tria_04.cc
tests/grid/enclosing_sphere_01.cc
tests/grid/extent_in_direction.cc
tests/grid/filtered_iterator.cc
tests/grid/filtered_iterator_02.cc
tests/grid/filtered_iterator_03.cc
tests/grid/grid_generator_09.cc
tests/grid/grid_generator_10.cc
tests/grid/grid_generator_general_cell_01.cc
tests/grid/grid_generator_general_cell_02.cc
tests/grid/grid_generator_simplex.cc
tests/grid/grid_invert.cc
tests/grid/grid_invert_02.cc
tests/grid/grid_test.cc
tests/grid/grid_tools_05.cc
tests/grid/grid_tools_06.cc
tests/grid/grid_tools_transform_01.cc
tests/grid/measure_et_al.cc
tests/grid/measure_et_al_02.cc
tests/grid/measure_of_3d_face_01.cc
tests/grid/subcelldata.cc
tests/grid/subdomain_ids.cc
tests/hp/compare_hp_vs_nonhp_01.cc
tests/hp/crash_19.cc
tests/hp/crash_22.cc
tests/hp/hp_hanging_nodes_01.cc
tests/hp/step-12.cc
tests/hp/step-13.cc
tests/hp/step-4.cc
tests/hp/step-7.cc
tests/hp/step-8.cc
tests/lac/constraints_block_01.cc
tests/lac/linear_operator_11.cc
tests/lac/linear_operator_12.cc
tests/lac/linear_operator_12a.cc
tests/manifold/flat_manifold_09.cc
tests/mappings/mapping.cc
tests/mappings/mapping_q1_eulerian.cc
tests/mappings/mapping_q_eulerian.cc
tests/mappings/mapping_q_manifold_01.cc
tests/mappings/mapping_real_to_unit_02.cc
tests/matrix_free/interpolate_rt_deformed.cc
tests/matrix_free/matrix_vector_rt_04.cc
tests/matrix_free/matrix_vector_rt_face_04.cc
tests/matrix_free/stokes_computation.cc
tests/matrix_free_kokkos/coefficient_eval_device.cc
tests/mpi/communicate_moved_vertices_03.cc
tests/mpi/distort_random_02.cc
tests/mpi/fe_tools_extrapolate_common.h
tests/mpi/hp_hanging_node_constraints_02.cc
tests/mpi/interpolate_to_different_mesh_01.cc
tests/mpi/mg_ghost_layer_periodic.cc
tests/mpi/p4est_2d_constraintmatrix_04.cc
tests/mpi/p4est_3d_constraintmatrix_03.cc
tests/mpi/periodicity_01.cc
tests/mpi/periodicity_02.cc
tests/mpi/periodicity_03.cc
tests/mpi/periodicity_04.cc
tests/multigrid-global-coarsening/stokes_computation.cc
tests/multigrid/renumbering_02.cc
tests/multigrid/transfer_02.cc
tests/multigrid/transfer_system_adaptive_01.cc
tests/multigrid/transfer_system_adaptive_02.cc
tests/multigrid/transfer_system_adaptive_03.cc
tests/multigrid/transfer_system_adaptive_04.cc
tests/multigrid/transfer_system_adaptive_05.cc
tests/multigrid/transfer_system_adaptive_06.cc
tests/multigrid/transfer_system_adaptive_07.cc
tests/multigrid/transfer_system_adaptive_08.cc
tests/multigrid/transfer_system_adaptive_09.cc
tests/non_matching/face_quadrature_generator.cc
tests/non_matching/fe_interface_values_non_standard_meshes.cc
tests/non_matching/quadrature_generator.cc
tests/non_matching/root_finder.cc
tests/non_matching/tensor_point_with_1D_quadrature.cc
tests/numerics/create_point_source.cc
tests/numerics/create_point_source_hp.cc
tests/numerics/interpolate_to_different_mesh_01.cc
tests/numerics/interpolate_to_different_mesh_02.cc
tests/numerics/no_flux_10.cc
tests/numerics/no_flux_11.cc
tests/numerics/no_flux_18.cc
tests/numerics/point_value_history_01.cc
tests/numerics/point_value_history_02.cc
tests/numerics/point_value_history_03.cc
tests/numerics/project_boundary_rt_01.cc
tests/numerics/project_complex.cc
tests/numerics/project_to_surface_01.cc
tests/numerics/project_to_surface_02.cc
tests/particles/data_out_01.cc
tests/particles/data_out_05.cc
tests/particles/exchange_ghosts_01.cc
tests/particles/generators_02.cc
tests/particles/particle_01.cc
tests/particles/particle_02.cc
tests/particles/particle_03.cc
tests/particles/particle_04.cc
tests/particles/particle_05.cc
tests/particles/particle_06.cc
tests/particles/particle_07.cc
tests/particles/particle_08.cc
tests/particles/particle_handler_01.cc
tests/particles/particle_handler_02.cc
tests/particles/particle_handler_03.cc
tests/particles/particle_handler_04.cc
tests/particles/particle_handler_06.cc
tests/particles/particle_handler_19.cc
tests/particles/particle_handler_20.cc
tests/particles/particle_handler_fully_distributed_01.cc
tests/particles/particle_handler_serial_01.cc
tests/particles/particle_handler_serial_02.cc
tests/particles/particle_handler_serial_03.cc
tests/particles/particle_handler_shared_01.cc
tests/particles/particle_iterator_01.cc
tests/particles/particle_iterator_02.cc
tests/particles/remove_particle_01.cc
tests/particles/step-68.cc
tests/simplex/poisson_02.cc
tests/simplex/simplex_grids.h
tests/simplex/simplex_project_cg.cc
tests/simplex/step-04-data_out_faces.cc
tests/simplex/step-04.cc
tests/simplex/step-07.cc
tests/simplex/step-08.cc
tests/simplex/step-12.cc
tests/simplex/step-12a.cc
tests/simplex/step-12b.cc
tests/simplex/step-12c.cc
tests/simplex/step-17.cc
tests/simplex/step-38.cc
tests/simplex/step-68.cc
tests/sparsity/flux_sparsity_pattern_visiting_once.cc
tests/test_grids.h
tests/trilinos/direct_solver.cc
tests/trilinos/direct_solver_2.cc
tests/trilinos/precondition.cc
tests/trilinos/precondition_amg_smoother.cc
tests/trilinos/precondition_q_iso_q1.cc

index 605043de33ee968e942d1ca493c0f7b6a6e6a958..5de50631cd6c2e41ae4e867d7bd7c6cc41527234 100644 (file)
@@ -55,11 +55,11 @@ transform(const Point<dim> p)
       case 1:
         return p;
       case 2:
-        return Point<dim>(p(0) * (1 + p(1)), p(1) * (1 + p(0)));
+        return Point<dim>(p[0] * (1 + p[1]), p[1] * (1 + p[0]));
       case 3:
-        return Point<dim>(p(0) * (1 + p(1)) * (1 + p(2)),
-                          p(1) * (1 + p(0)) * (1 + p(2)),
-                          p(2) * (1 + p(0)) * (1 + p(1)));
+        return Point<dim>(p[0] * (1 + p[1]) * (1 + p[2]),
+                          p[1] * (1 + p[0]) * (1 + p[2]),
+                          p[2] * (1 + p[0]) * (1 + p[1]));
       default:
         AssertThrow(false, ExcNotImplemented());
         return Point<dim>();
index 1403e4a1b336be58d36b0bfb7342d10444296487..b297f4f88a82edf9875dcd662588a322bbcefa21 100644 (file)
@@ -62,7 +62,7 @@ template <int dim>
 double
 AutoSinExp<dim>::value(const Point<dim> &p, const unsigned int) const
 {
-  return std::sin(2 * p(0)) * std::exp(3 * p(1));
+  return std::sin(2 * p[0]) * std::exp(3 * p[1]);
 }
 
 
@@ -102,8 +102,8 @@ Tensor<1, dim>
 ExactSinExp<dim>::gradient(const Point<dim> &p, const unsigned int) const
 {
   Tensor<1, dim> grad;
-  grad[0] = 2 * std::cos(2 * p(0)) * std::exp(3 * p(1));
-  grad[1] = 3 * std::sin(2 * p(0)) * std::exp(3 * p(1));
+  grad[0] = 2 * std::cos(2 * p[0]) * std::exp(3 * p[1]);
+  grad[1] = 3 * std::sin(2 * p[0]) * std::exp(3 * p[1]);
   return grad;
 }
 
index 3b2a449c725384acea3680012d40b31b4c8b4dba..fa3d8cc4297edf377d3695d2d15d56de80d80e45 100644 (file)
@@ -116,7 +116,7 @@ check_sine(unsigned int nquad)
 
   Point<dim> wave_vector;
   for (unsigned int d = 0; d < dim; ++d)
-    wave_vector(d) = d + 2.;
+    wave_vector[d] = d + 2.;
 
   Functions::FourierSineFunction<dim> f(wave_vector);
 
@@ -131,7 +131,7 @@ check_sine(unsigned int nquad)
     {
       deallog << "Direction " << d << std::endl;
       Point<dim> dir;
-      dir(d) = 1.;
+      dir[d] = 1.;
       deallog.push("Euler");
       FunctionDerivative<dim> df(f, dir, 1.e-4);
       check_derivative_order(gradients, df, quadrature, d, 2);
index df7334f5f63f96c5850b4c9fd472851bae9e821f..0f21bbd0aeeec9f1053fa3394535c1de29304933 100644 (file)
@@ -50,11 +50,11 @@ check_function(const Functions::FlowFunction<dim> &f,
       for (unsigned int ix = 0; ix < 2; ++ix)
         {
           if (dim > 0)
-            patches[0].vertices[vertex_number](0) = -1. + 2. * ix;
+            patches[0].vertices[vertex_number][0] = -1. + 2. * ix;
           if (dim > 1)
-            patches[0].vertices[vertex_number](1) = -1. + 2. * iy;
+            patches[0].vertices[vertex_number][1] = -1. + 2. * iy;
           if (dim > 2)
-            patches[0].vertices[vertex_number](2) = -1. + 2. * iz;
+            patches[0].vertices[vertex_number][2] = -1. + 2. * iz;
           ++vertex_number;
         }
   for (const unsigned int i : GeometryInfo<dim>::face_indices())
@@ -78,11 +78,11 @@ check_function(const Functions::FlowFunction<dim> &f,
       for (unsigned int ix = 0; ix <= sub; ++ix)
         {
           if (dim > 0)
-            points[vertex_number](0) = -1. + ix * h;
+            points[vertex_number][0] = -1. + ix * h;
           if (dim > 1)
-            points[vertex_number](1) = -1. + iy * h;
+            points[vertex_number][1] = -1. + iy * h;
           if (dim > 2)
-            points[vertex_number](2) = -1. + iz * h;
+            points[vertex_number][2] = -1. + iz * h;
           ++vertex_number;
         }
 
index 0fddbef18c71304bb679fb3a86e3f7a1dea67070..29fcdc2ae4529b8413481a6be73ed4b88fae0579 100644 (file)
@@ -91,7 +91,7 @@ check()
 
   Point<dim> point;
   for (int i = 0; i < dim; ++i)
-    point(i) = i;
+    point[i] = i;
 
   deallog << "->value:" << std::endl;
   PrintTensor<rank, dim>::print_tensor(foo->value(point));
@@ -106,7 +106,7 @@ check()
   points.push_back(point);
 
   for (int i = 0; i < dim; ++i)
-    point(i) = dim - i;
+    point[i] = dim - i;
   points.push_back(point);
 
   std::vector<Tensor<rank, dim>>     tensors;
index f323b7def86447df13da3d20653bbc1a59ae07e5..8cc9edf93c9012a3e71a7f30d8a826a82da25e2d 100644 (file)
@@ -55,9 +55,9 @@ test_gpu()
       auto p_3 = Point<dim, Number>::unit_vector(0);
       check[3] = p_3.norm_square();
 
-      auto entry_1 = p_1(0);
+      auto entry_1 = p_1[0];
       check[4]     = entry_1;
-      p_1(0)       = Number{1.};
+      p_1[0]       = Number{1.};
       check[5]     = p_1.norm_square();
       auto p_4     = p_1 + Tensor<1, dim, Number>{};
       check[6]     = p_4.norm_square();
index 20f895b994d0afc83b62cdacb1f44f6f6419a6f1..fc42beecd463ad7909599a482defa3a28b3b6884 100644 (file)
@@ -32,7 +32,7 @@ check()
     p[i] = i;
 
   for (unsigned int i = 0; i < dim; ++i)
-    deallog << p(i) << ' ';
+    deallog << p[i] << ' ';
   deallog << std::endl;
 }
 
index da678cdd000e91b60d2740a803fdbf7a66ad0558..ba911ccd1921c83de18e85a4a2d890ee932d8d0e 100644 (file)
@@ -34,7 +34,7 @@ check3d()
   Point<3> p(point);
 
   for (unsigned int i = 0; i < 3; ++i)
-    deallog << p(i) << ' ';
+    deallog << p[i] << ' ';
   deallog << std::endl;
 }
 
@@ -46,7 +46,7 @@ check2d()
   Point<2> p(point);
 
   for (unsigned int i = 0; i < 2; ++i)
-    deallog << p(i) << ' ';
+    deallog << p[i] << ' ';
   deallog << std::endl;
 }
 
@@ -57,7 +57,7 @@ check1d()
 
   Point<1> p(point);
 
-  deallog << p(0) << ' ';
+  deallog << p[0] << ' ';
   deallog << std::endl;
 }
 
index f25d9e06736d393459bf0f2791cd3eb8bb94137e..1d1b019139a3e4bbf11ff7b79b36c6a27c254134 100644 (file)
@@ -42,19 +42,19 @@ check()
 
 
     for (unsigned int i = 0; i < dim; ++i)
-      deallog << p_float(i) << ' ';
+      deallog << p_float[i] << ' ';
     deallog << std::endl;
 
     for (unsigned int i = 0; i < dim; ++i)
-      deallog << p_double(i) << ' ';
+      deallog << p_double[i] << ' ';
     deallog << std::endl;
 
     for (unsigned int i = 0; i < dim; ++i)
-      deallog << p_complex_float(i) << ' ';
+      deallog << p_complex_float[i] << ' ';
     deallog << std::endl;
 
     for (unsigned int i = 0; i < dim; ++i)
-      deallog << p_complex_double(i) << ' ';
+      deallog << p_complex_double[i] << ' ';
     deallog << std::endl;
   }
 
@@ -70,15 +70,15 @@ check()
     p_complex_double = p_double;
 
     for (unsigned int i = 0; i < dim; ++i)
-      deallog << p_double(i) << ' ';
+      deallog << p_double[i] << ' ';
     deallog << std::endl;
 
     for (unsigned int i = 0; i < dim; ++i)
-      deallog << p_complex_float(i) << ' ';
+      deallog << p_complex_float[i] << ' ';
     deallog << std::endl;
 
     for (unsigned int i = 0; i < dim; ++i)
-      deallog << p_complex_double(i) << ' ';
+      deallog << p_complex_double[i] << ' ';
     deallog << std::endl;
   }
 }
index 0182a9a1755c728cf61ce2472560dc0b743ba8f1..0506acb39393d9ec97b4d59bac0a6737c7a81904 100644 (file)
@@ -24,7 +24,7 @@
 template <int dim>
 constexpr bool val =
   Point<dim>((Point<dim>::unit_vector(0) + Point<dim>::unit_vector(0)) -
-             2. * Point<dim>::unit_vector(0))(0) == 0.;
+             2. * Point<dim>::unit_vector(0))[0] == 0.;
 
 
 int
index 2b87da5f52ebad7720752ec84c1e4371a7b63a18..c071893bce7d96d3c37a3f3186e612aff9152185 100644 (file)
@@ -38,7 +38,7 @@ scalar_product(const Polynomial<double> &p1, const Polynomial<double> &p2)
   double sum = 0.;
   for (unsigned int i = 0; i < gauss.size(); ++i)
     {
-      double x  = gauss.point(i)(0);
+      double x  = gauss.point(i)[0];
       double P1 = p1.value(x);
       double P2 = p2.value(x);
       sum += gauss.weight(i) * P1 * P2;
index 8c75016d1a593b9c43efff5cd284717b166d69d6..c51318c314b6945a0d7157db1da55dc74492183e 100644 (file)
@@ -33,7 +33,7 @@ check_interpolation(const std::vector<Polynomial<double>> &p,
       for (unsigned int k = 0; k < x.size(); ++k)
         {
           deallog << '.';
-          const double y = p[i].value(x[k](0));
+          const double y = p[i].value(x[k][0]);
           if (i == k)
             {
               if (std::fabs(y - 1.) > 2.e-10)
@@ -71,7 +71,7 @@ check_lge(unsigned int n)
   std::vector<Point<1>> x(n + 1);
   const double          h = 1. / n;
   for (unsigned int i = 0; i <= n; ++i)
-    x[i](0) = h * i;
+    x[i][0] = h * i;
   check_interpolation(p, x);
 }
 
index 3e0c7ef29fff5a9b3c8f5cd51f27813aabd44be1..c4ee2b996ca4e92f1818ed7dde2bc2808c94cbe6 100644 (file)
@@ -37,7 +37,7 @@ check_interpolation(const std::vector<Polynomial<double>> &p,
       for (unsigned int k = 0; k < x.size(); ++k)
         {
           deallog << '.';
-          const double y = p[i].value(x[k](0));
+          const double y = p[i].value(x[k][0]);
           if (i == k)
             {
               if (std::fabs(y - 1.) > 1e-13)
@@ -103,7 +103,7 @@ check_lge(unsigned int n)
   std::vector<Point<1>> x(n + 1);
   const double          h = 1. / n;
   for (unsigned int i = 0; i <= n; ++i)
-    x[i](0) = h * i;
+    x[i][0] = h * i;
   check_interpolation(p, x);
   check_constant(p);
   deallog << std::endl;
index ad59e57c7a1a99d00db18bec6c24b618d172d333..b256d638446db41957ca8229f8bcded28c615879 100644 (file)
@@ -65,10 +65,10 @@ check_bdm()
   PolynomialsBDM<dim> p3(3);
   PolynomialsBDM<dim> p4(4);
 
-  x(0) = 2.;
-  x(1) = 3.;
+  x[0] = 2.;
+  x[1] = 3.;
   if (dim > 2)
-    x(2) = 4;
+    x[2] = 4;
 
   check_point(x, p1);
   check_point(x, p2);
@@ -87,10 +87,10 @@ check_rt()
   PolynomialsRaviartThomas<dim> p2(2);
   PolynomialsRaviartThomas<dim> p3(3);
 
-  x(0) = 2.;
-  x(1) = 3.;
+  x[0] = 2.;
+  x[1] = 3.;
   if (dim > 2)
-    x(2) = 4;
+    x[2] = 4;
 
   check_point(x, p0);
   check_point(x, p1);
index 9d0c9e6b56ec7d144aa88eb03de29ba50d7a5984..cd109fd22b94971b89f5021a6aa557ff2ce18581 100644 (file)
@@ -30,17 +30,17 @@ check_line(Quadrature<1> &quadrature)
 {
   Point<dim> p1;
   Point<dim> p2;
-  p1(0) = 1.;
-  p2(0) = 7.;
+  p1[0] = 1.;
+  p2[0] = 7.;
   if (dim > 1)
     {
-      p1(1) = 3;
-      p2(1) = -5.;
+      p1[1] = 3;
+      p2[1] = -5.;
     }
   if (dim > 2)
     {
-      p1(2) = 0;
-      p2(2) = 10.;
+      p1[2] = 0;
+      p2[2] = 10.;
     }
   Quadrature<dim> q = QProjector<dim>::project_to_line(
     ReferenceCells::get_hypercube<dim>(), quadrature, p1, p2);
index ced9e24dd9fff3cc32e30cc29d8306c96be5b7bf..45a3cfdf5b2a102d7b33f972fcff52b3b59ebbb3 100644 (file)
@@ -113,7 +113,7 @@ check_quadrature(double *exact_monomials)
           long double f = 1.;
           for (unsigned int x = 0; x < quadrature.size(); ++x)
             {
-              f = std::pow(static_cast<long double>(points[x](0)), i * 1.0L);
+              f = std::pow(static_cast<long double>(points[x][0]), i * 1.0L);
               quadrature_int += f * static_cast<long double>(weights[x]);
             }
           err = std::fabs(quadrature_int - exact_monomials[i]);
@@ -150,7 +150,7 @@ check_GRC_right(double *exact_monomials)
           long double f = 1.;
           for (unsigned int x = 0; x < quadrature.size(); ++x)
             {
-              f = std::pow(static_cast<long double>(points[x](0)), i * 1.0L);
+              f = std::pow(static_cast<long double>(points[x][0]), i * 1.0L);
               quadrature_int += f * static_cast<long double>(weights[x]);
             }
           err = std::fabs(quadrature_int - exact_monomials[i]);
index 8a8df01281a540f19bb290060a815b63d2929a8d..1ac60a59f391886e3c67bbeec0db63e69d727e43 100644 (file)
@@ -79,11 +79,11 @@ check_cells(std::vector<Quadrature<dim> *> &quadratures)
               switch (dim)
                 {
                   case 3:
-                    f *= std::pow(static_cast<double>(points[x](2)), i * 1.0);
+                    f *= std::pow(static_cast<double>(points[x][2]), i * 1.0);
                   case 2:
-                    f *= std::pow(static_cast<double>(points[x](1)), i * 1.0);
+                    f *= std::pow(static_cast<double>(points[x][1]), i * 1.0);
                   case 1:
-                    f *= std::pow(static_cast<double>(points[x](0)), i * 1.0);
+                    f *= std::pow(static_cast<double>(points[x][0]), i * 1.0);
                 }
               quadrature_int += f * weights[x];
             }
@@ -142,11 +142,11 @@ check_faces(const std::vector<Quadrature<dim - 1> *> &quadratures,
               switch (dim)
                 {
                   case 3:
-                    f *= std::pow((long double)points[x](2), i * 1.0L);
+                    f *= std::pow((long double)points[x][2], i * 1.0L);
                   case 2:
-                    f *= std::pow((long double)points[x](1), i * 1.0L);
+                    f *= std::pow((long double)points[x][1], i * 1.0L);
                   case 1:
-                    f *= std::pow((long double)points[x](0), i * 1.0L);
+                    f *= std::pow((long double)points[x][0], i * 1.0L);
                 }
               quadrature_int += f * weights[x];
             }
index 9aa68ee810f8bed6e387db0a72fe090b984e98d0..80d3672dd79a7e87861fb28330c8c018b7c7d151 100644 (file)
@@ -85,11 +85,11 @@ check_cells(std::vector<Quadrature<dim> *> &quadratures)
               switch (dim)
                 {
                   case 3:
-                    f *= std::pow(static_cast<double>(points[x](2)), i * 1.0);
+                    f *= std::pow(static_cast<double>(points[x][2]), i * 1.0);
                   case 2:
-                    f *= std::pow(static_cast<double>(points[x](1)), i * 1.0);
+                    f *= std::pow(static_cast<double>(points[x][1]), i * 1.0);
                   case 1:
-                    f *= std::pow(static_cast<double>(points[x](0)), i * 1.0);
+                    f *= std::pow(static_cast<double>(points[x][0]), i * 1.0);
                 }
               quadrature_int += f * weights[x];
             }
@@ -110,7 +110,7 @@ check_cells(std::vector<Quadrature<dim> *> &quadratures)
           bool in_order = true;
           for (unsigned int x = 1; x < quadrature.size(); ++x)
             {
-              if (points[x](0) <= points[x - 1](0))
+              if (points[x][0] <= points[x - 1][0])
                 in_order = false;
             }
           if (!in_order)
@@ -163,11 +163,11 @@ check_faces(const std::vector<Quadrature<dim - 1> *> &quadratures,
               switch (dim)
                 {
                   case 3:
-                    f *= std::pow((long double)points[x](2), i * 1.0L);
+                    f *= std::pow((long double)points[x][2], i * 1.0L);
                   case 2:
-                    f *= std::pow((long double)points[x](1), i * 1.0L);
+                    f *= std::pow((long double)points[x][1], i * 1.0L);
                   case 1:
-                    f *= std::pow((long double)points[x](0), i * 1.0L);
+                    f *= std::pow((long double)points[x][0], i * 1.0L);
                 }
               quadrature_int += f * weights[x];
             }
index f7d12d96fab60c7ec871be19961dc58d5d5b2332..ca7973435179b0b9dbb4e31275a72fdebda2f11b 100644 (file)
@@ -72,7 +72,7 @@ VectorBoundaryValues<dim>::vector_value(const Point<dim> &p,
   Assert(values.size() == 2, ExcDimensionMismatch(values.size(), 2));
 
   for (unsigned int i = 0; i < 2; ++i)
-    values(i) = p(i) * p(i);
+    values(i) = p[i] * p[i];
 }
 
 
index df6ed73607295f6a680ed7a0e1522adabb9b69c4..742aab935b31051232ecd45737eb6cbe2d452c6f 100644 (file)
@@ -108,7 +108,7 @@ public:
   virtual double
   value(const Point<2> &p, const unsigned int) const
   {
-    return std::sin(3.14159 * p(0)) * std::sin(3.14159 * p(1));
+    return std::sin(3.14159 * p[0]) * std::sin(3.14159 * p[1]);
   }
 };
 
index 884e2be1d3dd2c1c8b7c414bac8225bcb06193f2..abddbd8c16cf5c3d4303e8e4688d73b5ca6903f7 100644 (file)
@@ -48,7 +48,7 @@ check()
                ++v)
             {
               const Point<dim>     vertex = face->vertex(v);
-              const Tensor<1, dim> tangent_1({-vertex(2), 0., vertex(0)});
+              const Tensor<1, dim> tangent_1({-vertex[2], 0., vertex[0]});
               const Tensor<1, dim> tangent_2 = vertex - Point<dim>(0, 3, 0);
 
               // get the normal vector and test it
index e69462e799914892a66bf215e6d827a9219bd5e6..e8ae1038173fd5c78f772f08fb4ecfc02120b8b7 100644 (file)
@@ -51,8 +51,8 @@ public:
   {
     double delta = 0.05;
     double x, y, r;
-    x = p(0);
-    y = p(1);
+    x = p[0];
+    y = p[1];
     r = std::sqrt(x * x + y * y);
     return 0.5 * (1 - std::tanh((r - 0.5) / (2 * M_SQRT2 * delta)));
   }
index 6e784821881f0c719e677f686977a0df3907c75a..49986feec49c39360963adf15974c4e3c8b96ae1 100644 (file)
@@ -106,7 +106,7 @@ make_mesh(Triangulation<dim> &tria)
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index 2fb42abfc5d54a37cedafa95c4aad5ccb6c3583f..613e75b5feecbc691430285641ca3e73d25f0052 100644 (file)
@@ -106,7 +106,7 @@ make_mesh(Triangulation<dim> &tria)
     {
       unsigned int material = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           material |= (1 << d);
       AssertThrow(material < (1 << dim), ExcInternalError());
 
index 6f3e5f0cee8a4568ab62c0127d540e4c6f9a58ee..be4b3d409895d5a0e0bd7b41fccdf9cb14817e0c 100644 (file)
@@ -86,9 +86,9 @@ double
 TestFunction<dim>::value(const Point<dim> &p,
                          const unsigned int /*component*/) const
 {
-  double val = base[0].value(p(0));
+  double val = base[0].value(p[0]);
   for (unsigned int i = 1; i < dim; ++i)
-    val *= base[i].value(p(i));
+    val *= base[i].value(p[i]);
   return val;
 }
 
index dc5b351d13cc5311947b473b5c3441c673c628f8..dad4104723bc097ee6a600e4f38d124df588f103 100644 (file)
@@ -96,8 +96,8 @@ test()
   grid_in1.read_msh(input_file1);
 
   Point<2> ePos;
-  ePos(0) = 0.0653630060373507487669897386695;
-  ePos(1) = 1125.59175030825804242340382189;
+  ePos[0] = 0.0653630060373507487669897386695;
+  ePos[1] = 1125.59175030825804242340382189;
 
   MappingQ<2>  mapping(1);
   MappingQ<2> &mapping2 = StaticMappingQ1<2>::mapping;
index 3548bfa98ea99a369f124c5713d57d9518646674..3bb3ce2da152fb1c92a04b93d93cd90249910901 100644 (file)
@@ -84,8 +84,8 @@ test()
   deallog.precision(16);
 
   Point<2> ePos;
-  ePos(0) = 0.0653630060373507487669897386695;
-  ePos(1) = 1125.59175030825804242340382189;
+  ePos[0] = 0.0653630060373507487669897386695;
+  ePos[1] = 1125.59175030825804242340382189;
 
   MappingQ<2>  mapping(1);
   MappingQ<2> &mapping2 = StaticMappingQ1<2>::mapping;
index 5fc2d5169dc5d4394af4c38ccd1f5245144921cd..13f4d8056e2ee48994ce847a83da08ba31b1230b 100644 (file)
@@ -51,8 +51,8 @@ test()
   GridGenerator::hyper_cube(tr);
 
   Point<2> p;
-  p(0) = -0.1;
-  p(1) = 0.5;
+  p[0] = -0.1;
+  p[1] = 0.5;
 
   MappingQ<2> mapping(1);
 
index e84d215d283afa941fe9c67651058f258e71b4ac..2ce67b3261614377cbd906e42cd6642240369884 100644 (file)
@@ -64,7 +64,7 @@ test()
   for (; cell != endc; ++cell)
     {
       Point<2> cell_center = cell->center();
-      if (std::abs(cell_center(0) - 1500) < 550)
+      if (std::abs(cell_center[0] - 1500) < 550)
         {
           cell->set_refine_flag();
         }
index 7e07f2a7dad71b5860018b83de5c9485b8126168..ca93fb1adf5e462bd2143d6ebad050e944bbc6ba 100644 (file)
@@ -128,8 +128,8 @@ public:
   value(const Point<dim> &p, const unsigned int component = 0) const override
   {
     if (dim == 3)
-      return std::sin(p(0) + 1.) * std::sin(p(1) + 2.) * std::sin(p(2) + 3.);
-    return std::sin(p(0) + 1.) * std::sin(p(1) + 2.);
+      return std::sin(p[0] + 1.) * std::sin(p[1] + 2.) * std::sin(p[2] + 3.);
+    return std::sin(p[0] + 1.) * std::sin(p[1] + 2.);
   }
 };
 
@@ -164,11 +164,11 @@ check_periodicity(const DoFHandler<2> &dof_handler,
       Vector<double> value2(1);
 
       Point<2> point1;
-      point1(0) = -numbers::PI + 2. * i / n_points + eps;
-      point1(1) = -numbers::PI;
+      point1[0] = -numbers::PI + 2. * i / n_points + eps;
+      point1[1] = -numbers::PI;
       Point<2> point2;
-      point2(0) = -numbers::PI + 2. * i / n_points + eps;
-      point2(1) = numbers::PI;
+      point2[0] = -numbers::PI + 2. * i / n_points + eps;
+      point2[1] = numbers::PI;
 
       VectorTools::point_value(dof_handler, solution, point1, value1);
       VectorTools::point_value(dof_handler, solution, point2, value2);
@@ -193,11 +193,11 @@ check_periodicity(const DoFHandler<2> &dof_handler,
       Vector<double> value2(1);
 
       Point<2> point1;
-      point1(1) = -numbers::PI + 2. * i / n_points + eps;
-      point1(0) = -numbers::PI;
+      point1[1] = -numbers::PI + 2. * i / n_points + eps;
+      point1[0] = -numbers::PI;
       Point<2> point2;
-      point2(1) = -numbers::PI + 2. * i / n_points + eps;
-      point2(0) = numbers::PI;
+      point2[1] = -numbers::PI + 2. * i / n_points + eps;
+      point2[0] = numbers::PI;
 
       VectorTools::point_value(dof_handler, solution, point1, value1);
       VectorTools::point_value(dof_handler, solution, point2, value2);
index 593873db8216ce1da2702709341c0e2e3dbaae33..1361445cd081d88dcbcad4e7d7ba162108cfa7b5 100644 (file)
@@ -117,8 +117,8 @@ public:
   value(const Point<dim> &p, const unsigned int component = 0) const override
   {
     if (dim == 3)
-      return std::sin(p(0) + 1.) * std::sin(p(1) + 2.) * std::sin(p(2) + 3.);
-    return std::sin(p(0) + 1.) * std::sin(p(1) + 2.);
+      return std::sin(p[0] + 1.) * std::sin(p[1] + 2.) * std::sin(p[2] + 3.);
+    return std::sin(p[0] + 1.) * std::sin(p[1] + 2.);
   }
 };
 
@@ -154,13 +154,13 @@ check_periodicity(const DoFHandler<3> &dof_handler,
         Vector<double> value2(1);
 
         Point<3> point1;
-        point1(0) = -numbers::PI + 2. * i / n_points + eps;
-        point1(1) = -numbers::PI;
-        point1(2) = -numbers::PI + 2. * j / n_points + eps;
+        point1[0] = -numbers::PI + 2. * i / n_points + eps;
+        point1[1] = -numbers::PI;
+        point1[2] = -numbers::PI + 2. * j / n_points + eps;
         Point<3> point2;
-        point2(0) = -numbers::PI + 2. * i / n_points + eps;
-        point2(1) = numbers::PI;
-        point2(2) = -numbers::PI + 2. * j / n_points + eps;
+        point2[0] = -numbers::PI + 2. * i / n_points + eps;
+        point2[1] = numbers::PI;
+        point2[2] = -numbers::PI + 2. * j / n_points + eps;
 
         VectorTools::point_value(dof_handler, solution, point1, value1);
         VectorTools::point_value(dof_handler, solution, point2, value2);
@@ -187,13 +187,13 @@ check_periodicity(const DoFHandler<3> &dof_handler,
         Vector<double> value2(1);
 
         Point<3> point1;
-        point1(2) = -numbers::PI + 2. * j / n_points + eps;
-        point1(1) = -numbers::PI + 2. * i / n_points + eps;
-        point1(0) = -numbers::PI;
+        point1[2] = -numbers::PI + 2. * j / n_points + eps;
+        point1[1] = -numbers::PI + 2. * i / n_points + eps;
+        point1[0] = -numbers::PI;
         Point<3> point2;
-        point2(2) = -numbers::PI + 2. * j / n_points + eps;
-        point2(1) = -numbers::PI + 2. * i / n_points + eps;
-        point2(0) = numbers::PI;
+        point2[2] = -numbers::PI + 2. * j / n_points + eps;
+        point2[1] = -numbers::PI + 2. * i / n_points + eps;
+        point2[0] = numbers::PI;
 
         VectorTools::point_value(dof_handler, solution, point1, value1);
         VectorTools::point_value(dof_handler, solution, point2, value2);
@@ -220,13 +220,13 @@ check_periodicity(const DoFHandler<3> &dof_handler,
         Vector<double> value2(1);
 
         Point<3> point1;
-        point1(0) = -numbers::PI + 2. * j / n_points + eps;
-        point1(1) = -numbers::PI + 2. * i / n_points + eps;
-        point1(2) = -numbers::PI;
+        point1[0] = -numbers::PI + 2. * j / n_points + eps;
+        point1[1] = -numbers::PI + 2. * i / n_points + eps;
+        point1[2] = -numbers::PI;
         Point<3> point2;
-        point2(0) = -numbers::PI + 2. * j / n_points + eps;
-        point2(1) = -numbers::PI + 2. * i / n_points + eps;
-        point2(2) = numbers::PI;
+        point2[0] = -numbers::PI + 2. * j / n_points + eps;
+        point2[1] = -numbers::PI + 2. * i / n_points + eps;
+        point2[2] = numbers::PI;
 
         VectorTools::point_value(dof_handler, solution, point1, value1);
         VectorTools::point_value(dof_handler, solution, point2, value2);
index b3cfbb51e8dc5cc5ffab259f264e778c7f7d3998..5a9d8004bcf15e3946d265febda020e1799d63b2 100644 (file)
@@ -64,7 +64,7 @@ public:
   {
     Tensor<1, dim> return_value;
     for (unsigned int i = 0; i < dim; ++i)
-      return_value[i] = 2 * (component + 1) * p(component);
+      return_value[i] = 2 * (component + 1) * p[component];
     return return_value;
   }
 
index 9dd6f931804fdea19e1ed96bfa42b34bdcd7087c..c22f773f3802e6ec5039a398f4e09e581bef524a 100644 (file)
@@ -65,7 +65,7 @@ public:
   {
     Tensor<1, dim> return_value;
     for (unsigned int i = 0; i < dim; ++i)
-      return_value[i] = 2 * (component + 1) * p(component);
+      return_value[i] = 2 * (component + 1) * p[component];
     return return_value;
   }
 
index 937e6a6929df066d4d2c4d2539efe5fddc52d3ae..f521c506ab2113003073e26bf2b2b0561e4b069a 100644 (file)
@@ -66,7 +66,7 @@ public:
   {
     Tensor<1, dim> return_value;
     for (unsigned int i = 0; i < dim; ++i)
-      return_value[i] = 2 * (component + 1) * p(component);
+      return_value[i] = 2 * (component + 1) * p[component];
     return return_value;
   }
 
index e2adb52516a581dde31d60aeba61de348556d5c4..a4792556b8233d699ede2f1a6b0ad666f4fd6b12 100644 (file)
@@ -67,7 +67,7 @@ public:
   {
     Tensor<1, dim> return_value;
     for (unsigned int i = 0; i < dim; ++i)
-      return_value[i] = 2 * (component + 1) * p(component);
+      return_value[i] = 2 * (component + 1) * p[component];
     return return_value;
   }
 
index be4b209d5afb15d1daefd0b8a813b1775f9ed74e..69c56ceaff8a0b0ad8c9df187985a8a9fe2d7d49 100644 (file)
@@ -58,10 +58,10 @@ check()
   for (int i = 0; i < 11; ++i)
     {
       Point<dim> testpoint;
-      testpoint(0) = testcoord[i][0];
-      testpoint(1) = testcoord[i][1];
+      testpoint[0] = testcoord[i][0];
+      testpoint[1] = testcoord[i][1];
       if (dim == 3)
-        testpoint(2) = testcoord[i][2];
+        testpoint[2] = testcoord[i][2];
 
       bool res = cell->point_inside(testpoint);
       deallog << testpoint << " inside " << res << std::endl;
index 5b4c45b41057ea75e548cb584c5770fed718c29e..e012f851fa4e64f9c676f7ffbdd920c9d873198e 100644 (file)
@@ -49,7 +49,7 @@ check()
 
   // Now get the cell
   const typename Triangulation<dim>::cell_iterator cell = triangulation.begin();
-  cell->vertex(0)(0)                                    = -1.;
+  cell->vertex(0)[0]                                    = -1.;
 
   // and test it.
   double testcoord[14][3] = {{0.5, 0.5, 0.5},
@@ -73,10 +73,10 @@ check()
   for (int i = 0; i < 14; ++i)
     {
       Point<dim> testpoint;
-      testpoint(0) = testcoord[i][0];
-      testpoint(1) = testcoord[i][1];
+      testpoint[0] = testcoord[i][0];
+      testpoint[1] = testcoord[i][1];
       if (dim == 3)
-        testpoint(2) = testcoord[i][2];
+        testpoint[2] = testcoord[i][2];
 
       bool res = cell->point_inside(testpoint);
       deallog << testpoint << "  \t inside " << res << " expected "
index baf33a3c889434d1b7ad4e2b4b82c22cb6a6c492..df2dd72f3a1c7ef711bb8e36491f04faf2be1d6e 100644 (file)
@@ -631,8 +631,8 @@ HelmholtzProblem<dim>::run()
                                                      endc = triangulation.end();
           for (; cell != endc; ++cell)
             for (const unsigned int face : GeometryInfo<dim>::face_indices())
-              if ((cell->face(face)->center()(0) == -1) ||
-                  (cell->face(face)->center()(1) == -1))
+              if ((cell->face(face)->center()[0] == -1) ||
+                  (cell->face(face)->center()[1] == -1))
                 cell->face(face)->set_boundary_id(1);
         }
       else
index 1356024ace648891feb825c5f95289b4e05a70fa..b4510809352d998ae15178fc981972512ca8b959 100644 (file)
@@ -110,8 +110,8 @@ Beta<dim>::value_list(const std::vector<Point<dim>> &points,
       const Point<dim> &p    = points[i];
       Point<dim>       &beta = values[i];
 
-      beta(0) = -p(1);
-      beta(1) = p(0);
+      beta[0] = -p[1];
+      beta[1] = p[0];
       beta /= std::sqrt(beta.square());
     }
 }
@@ -128,7 +128,7 @@ BoundaryValues<dim>::value_list(const std::vector<Point<dim>> &points,
 
   for (unsigned int i = 0; i < values.size(); ++i)
     {
-      if (points[i](0) < 0.5)
+      if (points[i][0] < 0.5)
         values[i] = 1.;
       else
         values[i] = 0.;
index 0cb32df040c9f70632f23976dc946194b9103f64..083ee883df76f3f66f6d1fd93121c68a5de3dac4 100644 (file)
@@ -663,9 +663,9 @@ double
 Solution<dim>::value(const Point<dim> &p,
                      const unsigned int /*component*/) const
 {
-  double q = p(0);
+  double q = p[0];
   for (unsigned int i = 1; i < dim; ++i)
-    q += std::sin(10 * p(i) + 5 * p(0) * p(0));
+    q += std::sin(10 * p[i] + 5 * p[0] * p[0]);
   const double exponential = std::exp(q);
   return exponential;
 }
@@ -690,19 +690,19 @@ double
 RightHandSide<dim>::value(const Point<dim> &p,
                           const unsigned int /*component*/) const
 {
-  double q = p(0);
+  double q = p[0];
   for (unsigned int i = 1; i < dim; ++i)
-    q += std::sin(10 * p(i) + 5 * p(0) * p(0));
+    q += std::sin(10 * p[i] + 5 * p[0] * p[0]);
   const double u  = std::exp(q);
   double       t1 = 1, t2 = 0, t3 = 0;
   for (unsigned int i = 1; i < dim; ++i)
     {
-      t1 += std::cos(10 * p(i) + 5 * p(0) * p(0)) * 10 * p(0);
-      t2 += 10 * std::cos(10 * p(i) + 5 * p(0) * p(0)) -
-            100 * std::sin(10 * p(i) + 5 * p(0) * p(0)) * p(0) * p(0);
-      t3 += 100 * std::cos(10 * p(i) + 5 * p(0) * p(0)) *
-              std::cos(10 * p(i) + 5 * p(0) * p(0)) -
-            100 * std::sin(10 * p(i) + 5 * p(0) * p(0));
+      t1 += std::cos(10 * p[i] + 5 * p[0] * p[0]) * 10 * p[0];
+      t2 += 10 * std::cos(10 * p[i] + 5 * p[0] * p[0]) -
+            100 * std::sin(10 * p[i] + 5 * p[0] * p[0]) * p[0] * p[0];
+      t3 += 100 * std::cos(10 * p[i] + 5 * p[0] * p[0]) *
+              std::cos(10 * p[i] + 5 * p[0] * p[0]) -
+            100 * std::sin(10 * p[i] + 5 * p[0] * p[0]);
     };
   t1 = t1 * t1;
 
index 171e3695db837cce1eabdd61955915396e1fe489..2b4b98820f217836e3df5448e29c733e4eb997a5 100644 (file)
@@ -113,7 +113,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4 * std::pow(p(i), 4);
+    return_value += 4 * std::pow(p[i], 4);
 
   return return_value;
 }
index f8134eea6c81f2e84d9976c1f8838073b4cb9c9c..5a87980e80a718fb490392d2de69c0e0d2e30318 100644 (file)
@@ -269,11 +269,11 @@ Step4<2>::check_periodicity(const unsigned int cycle) const
       Vector<double> value2(1);
 
       Point<2> point1;
-      point1(0) = 2 * (1. * i / n_points + eps) - 1;
-      point1(1) = -1.;
+      point1[0] = 2 * (1. * i / n_points + eps) - 1;
+      point1[1] = -1.;
       Point<2> point2;
-      point2(0) = 2 * (1. * i / n_points + eps) - 1;
-      point2(1) = 1.;
+      point2[0] = 2 * (1. * i / n_points + eps) - 1;
+      point2[1] = 1.;
 
       VectorTools::point_value(dof_handler, solution, point1, value1);
       VectorTools::point_value(dof_handler, solution, point2, value2);
index ae7bbd9c3602cb8209c6456557b30d4a43d5c9fc..aac750b65e50e8f7322e4df2e070d554ab79ef67 100644 (file)
@@ -276,11 +276,11 @@ Step4<2>::check_periodicity(const unsigned int cycle) const
       Vector<double> value2(1);
 
       Point<2> point1;
-      point1(0) = 2 * (1. * i / n_points + eps) - 1;
-      point1(1) = -1.;
+      point1[0] = 2 * (1. * i / n_points + eps) - 1;
+      point1[1] = -1.;
       Point<2> point2;
-      point2(0) = 2 * (1. * i / n_points + eps) - 1;
-      point2(1) = 1.;
+      point2[0] = 2 * (1. * i / n_points + eps) - 1;
+      point2[1] = 1.;
 
       VectorTools::point_value(dof_handler, solution, point1, value1);
       VectorTools::point_value(dof_handler, solution, point2, value2);
index 4af72211fb4e39b73da013b701cdfdd77719956a..235c4ff57cd8e9e6dfb61d1609219ae1e592e2fe 100644 (file)
@@ -967,7 +967,7 @@ namespace Step51
       for (const unsigned int face : GeometryInfo<dim>::face_indices())
         if (cell->face(face)->at_boundary())
           for (unsigned int d = 0; d < dim; ++d)
-            if ((std::fabs(cell->face(face)->center()(d) - (1)) < 1e-12))
+            if ((std::fabs(cell->face(face)->center()[d] - (1)) < 1e-12))
               cell->face(face)->set_boundary_id(1);
   }
 
index a67f64e0713bee6ae15556092e30225fb71deb49..998fa41af0a6adec022dc9ad854b771c4923e39a 100644 (file)
@@ -965,7 +965,7 @@ namespace Step51
       for (const unsigned int face : GeometryInfo<dim>::face_indices())
         if (cell->face(face)->at_boundary())
           for (unsigned int d = 0; d < dim; ++d)
-            if ((std::fabs(cell->face(face)->center()(d) - (1)) < 1e-12))
+            if ((std::fabs(cell->face(face)->center()[d] - (1)) < 1e-12))
               cell->face(face)->set_boundary_id(1);
   }
 
index c1354499da0dbbc36ba7cfac1512a9bb5fd4b539..7ad5b6ff599b7fdcbf8f7cfc10ec7157b026adc8 100644 (file)
@@ -497,8 +497,8 @@ HelmholtzProblem<dim>::run()
                                                      endc = triangulation.end();
           for (; cell != endc; ++cell)
             for (const unsigned int face : GeometryInfo<dim>::face_indices())
-              if ((cell->face(face)->center()(0) == -1) ||
-                  (cell->face(face)->center()(1) == -1))
+              if ((cell->face(face)->center()[0] == -1) ||
+                  (cell->face(face)->center()[1] == -1))
                 cell->face(face)->set_boundary_id(1);
         }
       else
index f15f56bf8de96f982e08d90e1a9f5b4b88e7fdbe..3520cdab2a08ef116229d5355d7ba3569c5c0884 100644 (file)
@@ -119,8 +119,8 @@ RightHandSide<dim>::vector_value(const Point<dim> &p,
   Assert(dim >= 2, ExcNotImplemented());
 
   Point<dim> point_1, point_2;
-  point_1(0) = 0.5;
-  point_2(0) = -0.5;
+  point_1[0] = 0.5;
+  point_2[0] = -0.5;
 
   if (((p - point_1).norm_square() < 0.2 * 0.2) ||
       ((p - point_2).norm_square() < 0.2 * 0.2))
index d830d850d0fab85229723b06fcfbc2ae8b6d4760..6b300ae8fb0c6ed809a4a3c9cc25b2795ee45344 100644 (file)
@@ -54,7 +54,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index fcb987920334de419c58cf1c1a389725fc61e932..4957b9c394e644a4c9f70818adf764614a64d579 100644 (file)
@@ -54,7 +54,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index 575ccf0f1b9d8f69d80c54af2e4ac80bcdde74b9..f35e80aae878a3f43b0a97a3ce144ab31edf0faa 100644 (file)
@@ -55,7 +55,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index 1d302add3f8c3f6c06296ce5421f01224101aad9..bd8bcde91a092ec36b0075f473e23977690e5647 100644 (file)
@@ -55,7 +55,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index 21de4857cfaa31871b7a020e1742b3f0ba30186e..d82c457cb126c634e6c111b441de1d3bebdde568 100644 (file)
@@ -54,7 +54,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index e6556f1cbfdbe46746010d4e98a32192b6a3fdb0..2f3ac1dc7bddb9691f5f1a8d2d02a10c3954a2ea 100644 (file)
@@ -55,7 +55,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index 8a1be02b461127f20b43dffabc4271d492a74d13..d1ca3161dd1e36b2c42abd6075988d30a359139b 100644 (file)
@@ -54,7 +54,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index 5a51c9a846f4f4f475fc6823910e5fa87fab188d..7968154783cb9efebb3fbc897e4fec8c1e5d660a 100644 (file)
@@ -51,14 +51,14 @@ public:
   virtual double
   value(const Point<dim> &p, const unsigned int component) const
   {
-    return p(component);
+    return p[component];
   }
 
   virtual void
   vector_value(const Point<dim> &p, Vector<double> &values) const
   {
     for (unsigned int i = 0; i < dim; ++i)
-      values(i) = p(i);
+      values(i) = p[i];
   }
 };
 
index 3deac34d1f365a663252ec7eaf49da2e65fd1612..611a7f3cffbd7e2109ac5f734cd60c98b2fe99db 100644 (file)
@@ -106,7 +106,7 @@ make_mesh(Triangulation<dim, spacedim> &tria)
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index deed8b001e481cf5761ce81dd74d768c444ec9d6..704b36e5e25fef6c58c74662310c961f951b6f0d 100644 (file)
@@ -55,7 +55,7 @@ public:
   virtual double
   value(const Point<dim> &p, const unsigned int component) const
   {
-    return p(0) * p(0) + 2.0 * p(0) * p(1);
+    return p[0] * p[0] + 2.0 * p[0] * p[1];
   }
 
   virtual void
@@ -79,7 +79,7 @@ public:
   value(const Point<dim> &p, const unsigned int component) const
   {
     double val = 0.0;
-    if (std::abs(p(1) - 1.0) < 1e-5)
+    if (std::abs(p[1] - 1.0) < 1e-5)
       val = 2.0;
 
     deallog << "evaluate normal derivative at " << p << " with value " << val
index a24775e83234dfcd9eadb842d2db7ce52ee3cd3b..7e64570037b71ac25a51731808c4f66dcf6126d3 100644 (file)
@@ -54,9 +54,9 @@ cylinder(Triangulation<3> &tria,
   // Turn cylinder such that y->x
   for (unsigned int i = 0; i < 16; ++i)
     {
-      const double h = vertices[i](1);
-      vertices[i](1) = -vertices[i](0);
-      vertices[i](0) = h;
+      const double h = vertices[i][1];
+      vertices[i][1] = -vertices[i][0];
+      vertices[i][0] = h;
     }
 
   int cell_vertices[5][8] = {{0, 1, 8, 9, 2, 3, 10, 11},
index 7672fe0e4b8b3e437c2132b78ec29508b7cb7ec3..c095948895a71aaf8d9f44c521820cbd6a974233 100644 (file)
@@ -45,7 +45,7 @@ main()
   const std::vector<Point<3>> &vertices = tria.get_vertices();
 
   for (unsigned int i = 0; i < vertices.size(); ++i)
-    if (vertices[i](2) > 1e-7)
+    if (vertices[i][2] > 1e-7)
       std::cout << "Error!" << std::endl;
 
 
index d6f9d4f3e3b08f14e3dcc4f0d2d801390c357717..ae7524f16e757b617ed47a9bdb7266e5e19213c1 100644 (file)
@@ -165,7 +165,7 @@ create_patches(std::vector<DataOutBase::Patch<dim, spacedim>> &patches)
 
       for (unsigned int i = 0; i < ncells; ++i)
         for (unsigned int j = 0; j < spacedim; ++j)
-          p.vertices[i](j) =
+          p.vertices[i][j] =
             PatchInfo<dim>::vertices[i][j] + PatchInfo<dim>::offsets[c][j];
 
       for (const unsigned int i : GeometryInfo<dim>::face_indices())
index fdce46183a25ac914207bb188d8e16e0f1aa5277..2b43d1dac05c341d44fb168ce68310f737ca6f2e 100644 (file)
@@ -180,7 +180,7 @@ curved_grid(std::ostream &out)
                       m[i].set_inhomogeneity(face->dof_index(0),
                                              (face->center() *
                                               (r_i / face->center().norm() -
-                                               1))(i));
+                                               1))[i]);
                     }
                 else if (std::fabs(face->vertex(1).norm() - r_a) < eps)
                   for (unsigned int i = 0; i < 2; ++i)
index 02206598480160c597c7ab9f0ee40d0a875f2228..f2741669c85d837ee62f8fcd53419cfbabb7bb15 100644 (file)
@@ -104,8 +104,8 @@ namespace Step8
     Assert(dim >= 2, ExcNotImplemented());
 
     Point<dim> point_1, point_2;
-    point_1(0) = 0.5;
-    point_2(0) = -0.5;
+    point_1[0] = 0.5;
+    point_2[0] = -0.5;
 
     for (unsigned int point_n = 0; point_n < points.size(); ++point_n)
       {
index a464952619c20bad3c613206262db0ca816ab963..8e9034bb615837382b8b657bec66b1a23a462fe3 100644 (file)
@@ -109,8 +109,8 @@ namespace Step8
     Assert(dim >= 2, ExcNotImplemented());
 
     Point<dim> point_1, point_2;
-    point_1(0) = 0.5;
-    point_2(0) = -0.5;
+    point_1[0] = 0.5;
+    point_2[0] = -0.5;
 
     for (unsigned int point_n = 0; point_n < points.size(); ++point_n)
       {
index 2f23985677a61b346b8ef1da849e24c4d3c2619d..4729f994d2fd3a76b26521479e25169e05f23c06 100644 (file)
@@ -42,7 +42,7 @@ create_patches(std::vector<DataOutBase::Patch<dim, spacedim>> &patches)
 
       for (const unsigned int v : GeometryInfo<dim>::vertex_indices())
         for (unsigned int d = 0; d < spacedim; ++d)
-          patch.vertices[v](d) =
+          patch.vertices[v][d] =
             p + cell_coordinates[d][v] + ((d >= dim) ? v : 0);
 
       unsigned int n1 = (dim > 0) ? nsubp : 1;
@@ -93,7 +93,7 @@ create_continuous_patches(std::vector<DataOutBase::Patch<dim, dim>> &patches,
 
   Point<dim> midpoint;
   for (unsigned int d = 0; d < dim; ++d)
-    midpoint(d) = n_cells / 2.;
+    midpoint[d] = n_cells / 2.;
 
   Functions::CutOffFunctionCinfty<dim> function(2., midpoint);
 
@@ -108,22 +108,22 @@ create_continuous_patches(std::vector<DataOutBase::Patch<dim, dim>> &patches,
             {
               Point<dim> p = trapez.point(k);
               if (dim >= 1)
-                p(0) += i1;
+                p[0] += i1;
               if (dim >= 2)
-                p(1) += i2;
+                p[1] += i2;
               if (dim >= 3)
-                p(2) += i3;
+                p[2] += i3;
               patch.vertices[k] = p;
             }
           std::vector<Point<dim>> points = trapezsub.get_points();
           for (unsigned int k = 0; k < points.size(); ++k)
             {
               if (dim >= 1)
-                points[k](0) += i1;
+                points[k][0] += i1;
               if (dim >= 2)
-                points[k](1) += i2;
+                points[k][1] += i2;
               if (dim >= 3)
-                points[k](2) += i3;
+                points[k][2] += i3;
             }
           std::vector<double> values(points.size());
           function.value_list(points, values);
index e5f25447a662f005fcaa5feda79ad252fa60e0c0..5d4f6928c696e9bca1d56856ac0c769b4315400f 100644 (file)
@@ -58,22 +58,22 @@ create_disconnected_mesh(Triangulation<dim> &tria)
           vertices[0] = vertices[1] = p1;
           vertices[2] = vertices[3] = p2;
 
-          vertices[1](0) = p2(0);
-          vertices[2](0) = p1(0);
+          vertices[1][0] = p2[0];
+          vertices[2][0] = p1[0];
           break;
         case 3:
           vertices[0] = vertices[1] = vertices[2] = vertices[3] = p1;
           vertices[4] = vertices[5] = vertices[6] = vertices[7] = p2;
 
-          vertices[1](0) = p2(0);
-          vertices[2](1) = p2(1);
-          vertices[3](0) = p2(0);
-          vertices[3](1) = p2(1);
+          vertices[1][0] = p2[0];
+          vertices[2][1] = p2[1];
+          vertices[3][0] = p2[0];
+          vertices[3][1] = p2[1];
 
-          vertices[4](0) = p1(0);
-          vertices[4](1) = p1(1);
-          vertices[5](1) = p1(1);
-          vertices[6](0) = p1(0);
+          vertices[4][0] = p1[0];
+          vertices[4][1] = p1[1];
+          vertices[5][1] = p1[1];
+          vertices[6][0] = p1[0];
 
           break;
         default:
@@ -104,8 +104,8 @@ create_disconnected_mesh(Triangulation<dim> &tria)
           vertices[GeometryInfo<dim>::vertices_per_cell + 2] =
             vertices[GeometryInfo<dim>::vertices_per_cell + 3] = p2;
 
-          vertices[GeometryInfo<dim>::vertices_per_cell + 1](0) = p2(0);
-          vertices[GeometryInfo<dim>::vertices_per_cell + 2](0) = p1(0);
+          vertices[GeometryInfo<dim>::vertices_per_cell + 1][0] = p2[0];
+          vertices[GeometryInfo<dim>::vertices_per_cell + 2][0] = p1[0];
           break;
         case 3:
           vertices[GeometryInfo<dim>::vertices_per_cell + 0] =
@@ -117,15 +117,15 @@ create_disconnected_mesh(Triangulation<dim> &tria)
               vertices[GeometryInfo<dim>::vertices_per_cell + 6] =
                 vertices[GeometryInfo<dim>::vertices_per_cell + 7] = p2;
 
-          vertices[GeometryInfo<dim>::vertices_per_cell + 1](0) = p2(0);
-          vertices[GeometryInfo<dim>::vertices_per_cell + 2](1) = p2(1);
-          vertices[GeometryInfo<dim>::vertices_per_cell + 3](0) = p2(0);
-          vertices[GeometryInfo<dim>::vertices_per_cell + 3](1) = p2(1);
+          vertices[GeometryInfo<dim>::vertices_per_cell + 1][0] = p2[0];
+          vertices[GeometryInfo<dim>::vertices_per_cell + 2][1] = p2[1];
+          vertices[GeometryInfo<dim>::vertices_per_cell + 3][0] = p2[0];
+          vertices[GeometryInfo<dim>::vertices_per_cell + 3][1] = p2[1];
 
-          vertices[GeometryInfo<dim>::vertices_per_cell + 4](0) = p1(0);
-          vertices[GeometryInfo<dim>::vertices_per_cell + 4](1) = p1(1);
-          vertices[GeometryInfo<dim>::vertices_per_cell + 5](1) = p1(1);
-          vertices[GeometryInfo<dim>::vertices_per_cell + 6](0) = p1(0);
+          vertices[GeometryInfo<dim>::vertices_per_cell + 4][0] = p1[0];
+          vertices[GeometryInfo<dim>::vertices_per_cell + 4][1] = p1[1];
+          vertices[GeometryInfo<dim>::vertices_per_cell + 5][1] = p1[1];
+          vertices[GeometryInfo<dim>::vertices_per_cell + 6][0] = p1[0];
 
           break;
         default:
index 4426443d1655d5735f36efd81a3e618efcbcadcc..f1b571296472232e21eb5859d35c7855228f441e 100644 (file)
@@ -33,13 +33,13 @@ test()
     if (cell->is_locally_owned())
       for (const unsigned int face : GeometryInfo<dim>::face_indices())
         {
-          if (std::fabs(cell->face(face)->center()(0) - 0.0) < 1e-12)
+          if (std::fabs(cell->face(face)->center()[0] - 0.0) < 1e-12)
             cell->face(face)->set_all_boundary_ids(1);
-          if (std::fabs(cell->face(face)->center()(0) - 1.0) < 1e-12)
+          if (std::fabs(cell->face(face)->center()[0] - 1.0) < 1e-12)
             cell->face(face)->set_all_boundary_ids(2);
-          if (std::fabs(cell->face(face)->center()(1) - 0.0) < 1e-12)
+          if (std::fabs(cell->face(face)->center()[1] - 0.0) < 1e-12)
             cell->face(face)->set_all_boundary_ids(3);
-          if (std::fabs(cell->face(face)->center()(1) - 1.0) < 1e-12)
+          if (std::fabs(cell->face(face)->center()[1] - 1.0) < 1e-12)
             cell->face(face)->set_all_boundary_ids(4);
         }
 
index 6e4eecb634c2cb6af154b7426d8176c7ef9355e7..7b7e1d9d0d2e3bec4d519800cb6e42dd9b53900c 100644 (file)
@@ -52,11 +52,11 @@ public:
     Point<dim> middle = FlatManifold<dim>::get_new_point_on_line(line);
 
     for (int i = 0; i < dim; ++i)
-      middle(i) -= .5;
+      middle[i] -= .5;
     middle *=
       std::sqrt(static_cast<double>(dim)) / (std::sqrt(middle.square()) * 2);
     for (int i = 0; i < dim; ++i)
-      middle(i) += .5;
+      middle[i] += .5;
 
     return middle;
   }
@@ -69,11 +69,11 @@ public:
     Point<dim> middle = FlatManifold<dim>::get_new_point_on_quad(quad);
 
     for (int i = 0; i < dim; ++i)
-      middle(i) -= .5;
+      middle[i] -= .5;
     middle *=
       std::sqrt(static_cast<double>(dim)) / (std::sqrt(middle.square()) * 2);
     for (int i = 0; i < dim; ++i)
-      middle(i) += .5;
+      middle[i] += .5;
 
     return middle;
   }
@@ -108,7 +108,7 @@ CurvedLine<dim>::get_new_point_on_line(
   // 0 or 1, then the z-values of all
   // vertices of the line is like that
   if (dim >= 3)
-    if (((middle(2) == 0) || (middle(2) == 1))
+    if (((middle[2] == 0) || (middle[2] == 1))
         // find out, if the line is in the
         // interior of the top or bottom face
         // of the domain, or at the edge.
@@ -125,18 +125,18 @@ CurvedLine<dim>::get_new_point_on_line(
       return middle;
 
 
-  double x = middle(0), y = middle(1);
+  double x = middle[0], y = middle[1];
 
   if (y < x)
     if (y < 1 - x)
-      middle(1) = 0.04 * std::sin(6 * numbers::PI * middle(0));
+      middle[1] = 0.04 * std::sin(6 * numbers::PI * middle[0]);
     else
-      middle(0) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(1));
+      middle[0] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[1]);
 
   else if (y < 1 - x)
-    middle(0) = 0.04 * std::sin(6 * numbers::PI * middle(1));
+    middle[0] = 0.04 * std::sin(6 * numbers::PI * middle[1]);
   else
-    middle(1) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(0));
+    middle[1] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[0]);
 
   return middle;
 }
@@ -156,21 +156,21 @@ CurvedLine<dim>::get_new_point_on_quad(
   // z-value of the midpoint is either
   // 0 or 1, then the z-values of all
   // vertices of the quad is like that
-  if (dim == 3 && ((middle(dim - 1) == 0) || (middle(dim - 1) == 1)))
+  if (dim == 3 && ((middle[dim - 1] == 0) || (middle[dim - 1] == 1)))
     return middle;
 
-  double x = middle(0), y = middle(1);
+  double x = middle[0], y = middle[1];
 
   if (y < x)
     if (y < 1 - x)
-      middle(1) = 0.04 * std::sin(6 * numbers::PI * middle(0));
+      middle[1] = 0.04 * std::sin(6 * numbers::PI * middle[0]);
     else
-      middle(0) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(1));
+      middle[0] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[1]);
 
   else if (y < 1 - x)
-    middle(0) = 0.04 * std::sin(6 * numbers::PI * middle(1));
+    middle[0] = 0.04 * std::sin(6 * numbers::PI * middle[1]);
   else
-    middle(1) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(0));
+    middle[1] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[0]);
 
   return middle;
 }
index 20ebd6ed18fe0c084163b4b25c78dc666b5b2bb7..f8b8979c52ff6d39e3aca3aa099128eb6aafb226 100644 (file)
@@ -88,8 +88,8 @@ check(const FiniteElement<dim> &fe, const std::string &name)
   for (unsigned int ref = 0; ref < 2; ++ref)
     {
       for (auto &cell : tria.active_cell_iterators())
-        if (cell->is_locally_owned() && cell->center()(0) < .5 &&
-            cell->center()(1) < .5)
+        if (cell->is_locally_owned() && cell->center()[0] < .5 &&
+            cell->center()[1] < .5)
           cell->set_refine_flag();
       tria.execute_coarsening_and_refinement();
     }
index 153b74c27ea475a05ddcbac65a65befaea4d1a6c..74ad5234569257b1dcebf98348fc0963fd7a1b99 100644 (file)
@@ -97,9 +97,9 @@ generate_grid(Triangulation<2> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -153,9 +153,9 @@ generate_grid(Triangulation<2, 3> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -223,9 +223,9 @@ generate_grid(Triangulation<3> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<3>::face_indices())
     {
-      if (cell_1->face(j)->center()(2) > 2.9)
+      if (cell_1->face(j)->center()[2] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(2) < -2.9)
+      if (cell_2->face(j)->center()[2] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -274,9 +274,9 @@ print_matching(DoFHandler<dim, spacedim> &dof_handler,
     {
       for (const unsigned int j : GeometryInfo<dim>::face_indices())
         {
-          if (cell->face(j)->center()(dim == 2 ? 1 : 2) > 2.9)
+          if (cell->face(j)->center()[dim == 2 ? 1 : 2] > 2.9)
             face_1 = cell->face(j);
-          if (cell->face(j)->center()(dim == 2 ? 1 : 2) < -2.9)
+          if (cell->face(j)->center()[dim == 2 ? 1 : 2] < -2.9)
             face_2 = cell->face(j);
         }
     }
index 19693a47790248bcdca372ec6300d4a8a0db3650..0bfc6b093f566ce86037d2a05ce135b2fbc30129 100644 (file)
@@ -95,9 +95,9 @@ generate_grid(Triangulation<2> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -146,9 +146,9 @@ generate_grid(Triangulation<2, 3> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
index 60e3c9a65dac10af585f7ea6ae4bb49dd2d22cd6..beceb9dc74a406dddd85783bd821635a29dc43f9 100644 (file)
@@ -129,9 +129,9 @@ generate_grid(Triangulation<2> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -180,9 +180,9 @@ generate_grid(Triangulation<2, 3> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
index 3bd1368a8df520411db8a7680872c4b0e2fa88dd..b20701ae5ef9ed3458b5528a62d0a1225377ea4f 100644 (file)
@@ -94,9 +94,9 @@ generate_grid(Triangulation<2> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -146,9 +146,9 @@ generate_grid(Triangulation<2, 3> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
index d155d86806bdba1ec483a1efcc709717adbec687..325d9ccd45ec36f58206fe6a46e7f2ace85a0b18 100644 (file)
@@ -100,9 +100,9 @@ generate_grid(Triangulation<2> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -157,9 +157,9 @@ generate_grid(Triangulation<2, 3> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -228,9 +228,9 @@ generate_grid(Triangulation<3> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<3>::face_indices())
     {
-      if (cell_1->face(j)->center()(2) > 2.9)
+      if (cell_1->face(j)->center()[2] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(2) < -2.9)
+      if (cell_2->face(j)->center()[2] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -280,9 +280,9 @@ print_matching(DoFHandler<dim, spacedim> &dof_handler,
     {
       for (const unsigned int j : GeometryInfo<dim>::face_indices())
         {
-          if (cell->face(j)->center()(dim == 2 ? 1 : 2) > 2.9)
+          if (cell->face(j)->center()[dim == 2 ? 1 : 2] > 2.9)
             face_1 = cell->face(j);
-          if (cell->face(j)->center()(dim == 2 ? 1 : 2) < -2.9)
+          if (cell->face(j)->center()[dim == 2 ? 1 : 2] < -2.9)
             face_2 = cell->face(j);
         }
     }
index 629e64ccdc80f076baf79af06d8b13ab5b9b787b..fa6146bae1a5cc7a287118a6732333e912f155ca 100644 (file)
@@ -64,7 +64,7 @@ test()
          triangulation.begin_active();
        cell != triangulation.end();
        ++cell)
-    if (cell->center()(0) > 0.49)
+    if (cell->center()[0] > 0.49)
       cell->set_refine_flag();
 
   triangulation.prepare_coarsening_and_refinement();
index c9d8a94eac728cbd6ef2545b0b4f31aba4ed1205..1f894f87fcac337b20c0a780cb40b50614b97a9d 100644 (file)
@@ -84,8 +84,8 @@ check(const FiniteElement<dim> &fe, const std::string &name)
   for (unsigned int ref = 0; ref < 2; ++ref)
     {
       for (auto &cell : tria.active_cell_iterators())
-        if (cell->is_locally_owned() && cell->center()(0) < .5 &&
-            cell->center()(1) < .5)
+        if (cell->is_locally_owned() && cell->center()[0] < .5 &&
+            cell->center()[1] < .5)
           cell->set_refine_flag();
       tria.execute_coarsening_and_refinement();
     }
index 67f7d8599d966966f17f2accc78665ae7a996fc8..3f59e0dedc3f7b24e73e5eac01486d3f1b8e0808 100644 (file)
@@ -40,7 +40,7 @@ template <int dim>
 bool
 pred_d(const typename DoFHandler<dim>::active_cell_iterator &cell)
 {
-  return (cell->center()(0) < 0.49 && cell->center()(1) < 0.49);
+  return (cell->center()[0] < 0.49 && cell->center()[1] < 0.49);
 }
 
 template <int dim>
index 5bbd9670087504243f775e4a2c684dc5269b19a1..7f21a43869368d5982521158637cca2751bf466e 100644 (file)
@@ -48,7 +48,7 @@ template <int dim>
 bool
 pred_d(const typename DoFHandler<dim>::active_cell_iterator &cell)
 {
-  return (cell->center()(0) < 0.5 && cell->center()(1) < 0.5);
+  return (cell->center()[0] < 0.5 && cell->center()[1] < 0.5);
 }
 
 
index bf78b33430ddb8af90df12e5d39db286e87e4b72..da51e07a4b56a15c0e4841ab77606fb99b42c6ba 100644 (file)
@@ -41,14 +41,14 @@ template <int dim>
 bool
 pred_left(const typename DoFHandler<dim>::active_cell_iterator &cell)
 {
-  return (cell->center()(0) < 0.49);
+  return (cell->center()[0] < 0.49);
 }
 
 template <int dim>
 bool
 pred_right(const typename DoFHandler<dim>::active_cell_iterator &cell)
 {
-  return (cell->center()(0) > 0.51);
+  return (cell->center()[0] > 0.51);
 }
 
 
@@ -56,8 +56,8 @@ template <int dim>
 bool
 pred_r(const typename Triangulation<dim>::active_cell_iterator &cell)
 {
-  return (cell->center()(0) < 0.49 && cell->center()(1) < 0.49) ||
-         (cell->center()(0) > 0.49 && cell->center()(1) > 0.49);
+  return (cell->center()[0] < 0.49 && cell->center()[1] < 0.49) ||
+         (cell->center()[0] > 0.49 && cell->center()[1] > 0.49);
 }
 
 
index 4ef50235e32c229cae6c301e0aefae5ec4201c5e..fff3153dee0e4679a65486d6fb9cdc9e528bd80b 100644 (file)
@@ -55,15 +55,15 @@ template <int dim>
 bool
 pred_d(const typename DoFHandler<dim>::active_cell_iterator &cell)
 {
-  return (cell->center()(0) < 0.49);
+  return (cell->center()[0] < 0.49);
 }
 
 template <int dim>
 bool
 pred_r(const typename Triangulation<dim>::active_cell_iterator &cell)
 {
-  return (cell->center()(0) < 0.49 && cell->center()(1) < 0.49) ||
-         (cell->center()(0) > 0.49 && cell->center()(1) > 0.49);
+  return (cell->center()[0] < 0.49 && cell->center()[1] < 0.49) ||
+         (cell->center()[0] > 0.49 && cell->center()[1] > 0.49);
 }
 
 
index e7efc4b1253f754db07728c87978a00d19c37b05..741036a379f9ca8162f24eda3fb1d24dcffb4030 100644 (file)
@@ -71,7 +71,7 @@ public:
   value(const Point<2> &p, unsigned int c = 0) const override
   {
     (void)c;
-    return p(0) * p(1);
+    return p[0] * p[1];
   }
 
 
@@ -98,7 +98,7 @@ test_fe_on_domain(const unsigned int regularity)
   double   left = -1.0, right = 1.0;
   Point<2> left_point, right_point;
   for (unsigned int i = 0; i < 2; ++i)
-    left_point(i) = left, right_point(i) = right;
+    left_point[i] = left, right_point[i] = right;
   GridGenerator::subdivided_hyper_cube(tr, 4, left, right);
 
   FE_Hermite<2> herm(2 * regularity + 1);
index 943b5337b4f6aa6e486ba524310976b4531d9222..2256374ddd4eadc94fec5d703e0d0295038c7852 100644 (file)
@@ -45,7 +45,7 @@
 Point<2>
 stretch_coordinates(const Point<2> p)
 {
-  return Point<2>(2 * p(0), p(1));
+  return Point<2>(2 * p[0], p[1]);
 }
 
 
@@ -53,7 +53,7 @@ stretch_coordinates(const Point<2> p)
 Point<2>
 tilt_coordinates(const Point<2> p)
 {
-  return Point<2>(p(0) + p(1), p(1));
+  return Point<2>(p[0] + p[1], p[1]);
 }
 
 
index e5b83740e703f2f98f93b40af69693431a9e8e0f..ff4c457382c4cce32c32e6ab335c4030c7cd9d24 100644 (file)
@@ -134,10 +134,10 @@ double
 TestDef1<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
   Point<2> center;
-  center(0)    = 0.5;
-  center(1)    = 0.5;
+  center[0]    = 0.5;
+  center[1]    = 0.5;
   double rad   = p.distance(center),
-         phi_p = atan2(p(0) - center(0), p(1) - center(1));
+         phi_p = atan2(p[0] - center[0], p[1] - center[1]);
 
   if (component == 0)
     return rad * (sin(phi + phi_p) - sin(phi_p));
@@ -188,7 +188,7 @@ template <int dim>
 double
 TestDef2<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
-  double x = p(0), y = p(1);
+  double x = p[0], y = p[1];
 
   if (component == 0)
     return scale * x;
@@ -240,7 +240,7 @@ template <int dim>
 double
 TestDef3<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
-  double y = p(1);
+  double y = p[1];
 
   if (component == 0)
     return scale * y;
@@ -297,7 +297,7 @@ template <int dim>
 double
 TestPoly<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
-  double x = p(0), y = p(1);
+  double x = p[0], y = p[1];
 
   if (component == 0)
     return polys[0].value(x) + polys[1].value(y);
index f98a04822f0020d1f71cffa6b415054a928503f8..b4cb4fad909a2f99eaf37e8156a4ddd19f4e92e4 100644 (file)
@@ -164,9 +164,9 @@ ExactSolution<dim>::value(const Point<dim>  &p,
   switch (component)
     {
       case 0:
-        val = cos(numbers::PI * p(0)) * sin(numbers::PI * p(1)) + bc_constant;
+        val = cos(numbers::PI * p[0]) * sin(numbers::PI * p[1]) + bc_constant;
       case 1:
-        val = -sin(numbers::PI * p(0)) * cos(numbers::PI * p(1)) + bc_constant;
+        val = -sin(numbers::PI * p[0]) * cos(numbers::PI * p[1]) + bc_constant;
     }
   return val;
 }
@@ -176,8 +176,8 @@ ExactSolution<dim>::vector_value(const Point<dim> &p,
                                  Vector<double>   &result) const
 {
   Assert(dim >= 2, ExcNotImplemented());
-  result(0) = cos(numbers::PI * p(0)) * sin(numbers::PI * p(1)) + bc_constant;
-  result(1) = -sin(numbers::PI * p(0)) * cos(numbers::PI * p(1)) + bc_constant;
+  result(0) = cos(numbers::PI * p[0]) * sin(numbers::PI * p[1]) + bc_constant;
+  result(1) = -sin(numbers::PI * p[0]) * cos(numbers::PI * p[1]) + bc_constant;
 }
 template <int dim>
 void
@@ -195,10 +195,10 @@ ExactSolution<dim>::value_list(const std::vector<Point<dim>> &points,
         {
           case 0:
             values[i] =
-              cos(numbers::PI * p(0)) * sin(numbers::PI * p(1)) + bc_constant;
+              cos(numbers::PI * p[0]) * sin(numbers::PI * p[1]) + bc_constant;
           case 1:
             values[i] =
-              -sin(numbers::PI * p(0)) * cos(numbers::PI * p(1)) + bc_constant;
+              -sin(numbers::PI * p[0]) * cos(numbers::PI * p[1]) + bc_constant;
         }
     }
 }
@@ -215,9 +215,9 @@ ExactSolution<dim>::vector_value_list(const std::vector<Point<dim>> &points,
     {
       const Point<dim> &p = points[i];
       values[i](0) =
-        cos(numbers::PI * p(0)) * sin(numbers::PI * p(1)) + bc_constant;
+        cos(numbers::PI * p[0]) * sin(numbers::PI * p[1]) + bc_constant;
       values[i](1) =
-        -sin(numbers::PI * p(0)) * cos(numbers::PI * p(1)) + bc_constant;
+        -sin(numbers::PI * p[0]) * cos(numbers::PI * p[1]) + bc_constant;
     }
 }
 // END EXACT SOLUTION MEMBERS
@@ -236,11 +236,11 @@ RightHandSide<dim>::vector_value(const Point<dim> &p,
   Assert(dim >= 2, ExcNotImplemented());
 
   // 2D solution
-  values(0) = (2 * numbers::PI * numbers::PI + 1) * cos(numbers::PI * p(0)) *
-                sin(numbers::PI * p(1)) +
+  values(0) = (2 * numbers::PI * numbers::PI + 1) * cos(numbers::PI * p[0]) *
+                sin(numbers::PI * p[1]) +
               bc_constant;
-  values(1) = -(2 * numbers::PI * numbers::PI + 1) * sin(numbers::PI * p(0)) *
-                cos(numbers::PI * p(1)) +
+  values(1) = -(2 * numbers::PI * numbers::PI + 1) * sin(numbers::PI * p[0]) *
+                cos(numbers::PI * p[1]) +
               bc_constant;
 }
 template <int dim>
index eb3160c55e63ca9a206011cfbc11b68c476b2711..07ae1795e015ff7613eb323afb50d7ca81fc09fe 100644 (file)
@@ -160,8 +160,8 @@ test_hyper_cube(const double tolerance)
   for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
     {
       Point<dim> &point = cell->vertex(i);
-      if (std::abs(point(dim - 1) - 1.0) < 1e-5)
-        point(dim - 1) += 0.15;
+      if (std::abs(point[dim - 1] - 1.0) < 1e-5)
+        point[dim - 1] += 0.15;
     }
 
   FE_ABF<dim> fe(1);
index d94b4280aa015140d3b7f747f04e11f3f3d1e815..028b707a01dc5c4b26e45210c3b2d47d054021e4 100644 (file)
@@ -118,8 +118,8 @@ test_hyper_cube(const double tolerance)
   for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
     {
       Point<dim> &point = cell->vertex(i);
-      if (std::abs(point(dim - 1) - 1.0) < 1e-5)
-        point(dim - 1) += 0.15;
+      if (std::abs(point[dim - 1] - 1.0) < 1e-5)
+        point[dim - 1] += 0.15;
     }
 
   FE_BernardiRaugel<dim> fe(1);
index 177f6f4a98056cb1bce50c36c5c4fb6fe47f0b97..4487096427429cb123c7515266dfb0a9259d2c1b 100644 (file)
@@ -113,9 +113,9 @@ namespace Maxwell
         const Point<dim> &p = points[i];
 
         /* quadratic: */
-        value_list[i](0) = p(0) * p(0);
-        value_list[i](1) = p(1) * p(1);
-        value_list[i](2) = p(2) * p(2);
+        value_list[i](0) = p[0] * p[0];
+        value_list[i](1) = p[1] * p[1];
+        value_list[i](2) = p[2] * p[2];
       }
   }
   // Additional functions to create Neumann conditions, zero in this case.
index c81c0deccf89f0549c0ff704c3f71579cafd4383..5e911541d76a3cc058edd987567737f1785f992e 100644 (file)
@@ -123,10 +123,10 @@ VectorFunction<2>::value(const Point<2> &p, const unsigned int component) const
   switch (component)
     {
       case 0:
-        val = cos(PI * p(0)) * sin(PI * p(1));
+        val = cos(PI * p[0]) * sin(PI * p[1]);
         break;
       case 1:
-        val = -sin(PI * p(0)) * cos(PI * p(1));
+        val = -sin(PI * p[0]) * cos(PI * p[1]);
         break;
     }
   return val;
index 4a4d0e7d6fd73cccb60bce69eee0816f8c908e1a..8b8c200f1c8fda4d65ace8667385f398d4963a16 100644 (file)
@@ -139,13 +139,13 @@ VectorFunction<3>::value(const Point<3> &p, const unsigned int component) const
   switch (component)
     {
       case 0:
-        val = -sin(PI * p(0)) * cos(PI * p(1)) * cos(PI * p(2));
+        val = -sin(PI * p[0]) * cos(PI * p[1]) * cos(PI * p[2]);
         break;
       case 1:
-        val = -cos(PI * p(0)) * sin(PI * p(1)) * cos(PI * p(2));
+        val = -cos(PI * p[0]) * sin(PI * p[1]) * cos(PI * p[2]);
         break;
       case 2:
-        val = 2 * cos(PI * p(0)) * cos(PI * p(1)) * sin(PI * p(2));
+        val = 2 * cos(PI * p[0]) * cos(PI * p[1]) * sin(PI * p[2]);
         break;
     }
   return val;
@@ -167,7 +167,7 @@ VectorFunction<3>::gradient(const Point<3>    &p,
 {
   const double PI = numbers::PI;
   Tensor<1, 3> val;
-  double       x = p(0), y = p(1), z = p(2);
+  double       x = p[0], y = p[1], z = p[2];
 
   switch (component)
     {
index 55c314be46f1b5d9f9512804aaf34cdd1011048e..35c7aa27536bc7da6d0a77ee86fed534b5118f4f 100644 (file)
@@ -82,8 +82,8 @@ BubbleFunction<dim>::value(const Point<dim> &p, const unsigned int) const
 {
   double return_value = 1.;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value *= (1 - p(i) * p(i));
-  return_value *= std::pow(p(m_direction), m_degree - 1);
+    return_value *= (1 - p[i] * p[i]);
+  return_value *= std::pow(p[m_direction], m_degree - 1);
 
   return return_value;
 }
@@ -99,9 +99,9 @@ BubbleFunction<dim>::gradient(const Point<dim> &p, const unsigned int) const
       grad[d] = 1.;
       // compute grad(\prod_{i=1}^d (1-x_i^2))(p)
       for (unsigned j = 0; j < dim; ++j)
-        grad[d] *= (d == j ? -2 * p(j) : (1 - p(j) * p(j)));
+        grad[d] *= (d == j ? -2 * p[j] : (1 - p[j] * p[j]));
       // and multiply with x_i^{r-1}
-      grad[d] *= std::pow(p(m_direction), m_degree - 1);
+      grad[d] *= std::pow(p[m_direction], m_degree - 1);
     }
 
   if (m_degree >= 2)
@@ -109,10 +109,10 @@ BubbleFunction<dim>::gradient(const Point<dim> &p, const unsigned int) const
       // add \prod_{i=1}^d (1-x_i^2))(p)
       double value = 1.;
       for (unsigned int j = 0; j < dim; ++j)
-        value *= (1 - p(j) * p(j));
+        value *= (1 - p[j] * p[j]);
       // and multiply with grad(x_i^{r-1})
       grad[m_direction] +=
-        value * (m_degree - 1) * std::pow(p(m_direction), m_degree - 2);
+        value * (m_degree - 1) * std::pow(p[m_direction], m_degree - 2);
     }
 
   return grad;
index 7eb7a1b194cc10e8dee0281d9afa6e467575f9eb..81a2f16034f3ba5bc32e21ed2f3051a86e03b1a6 100644 (file)
@@ -161,8 +161,8 @@ test_hyper_cube(const double tolerance)
   for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
     {
       Point<dim> &point = cell->vertex(i);
-      if (std::abs(point(dim - 1) - 1.0) < 1e-5)
-        point(dim - 1) += 0.15;
+      if (std::abs(point[dim - 1] - 1.0) < 1e-5)
+        point[dim - 1] += 0.15;
     }
 
   FE_RaviartThomas<dim> fe(2);
index 1ce48e7ac9bb91f73426af72a549fc86242527bc..bfbf035899b2e4d35aced0d0751b6a027a6168a7 100644 (file)
@@ -159,8 +159,8 @@ test_hyper_cube(const double tolerance)
   for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
     {
       Point<dim> &point = cell->vertex(i);
-      if (std::abs(point(dim - 1) - 1.0) < 1e-5)
-        point(dim - 1) += 0.15;
+      if (std::abs(point[dim - 1] - 1.0) < 1e-5)
+        point[dim - 1] += 0.15;
     }
 
   FE_RaviartThomas<dim> fe(2);
index 693990bb07ee5cb8555789cacc34485347501fe8..3c361f247b88ab1da4646ec699782963f33a6fa3 100644 (file)
@@ -64,7 +64,7 @@ double
 TestFunction::value(const Point<2> &p, const unsigned int component) const
 {
   Assert(component == 0, ExcInternalError());
-  return std::sin(pi * p(0)) * std::cos(pi * p(1));
+  return std::sin(pi * p[0]) * std::cos(pi * p[1]);
 }
 
 
index 49c806dcfe0a81182b4e17fa935312baf7669b5f..fe8560d6c72183a53e796777ef739489bad2e6f3 100644 (file)
@@ -70,12 +70,12 @@ test()
   // Jacobian contains many nonzero entries
   Point<dim> quad_p;
   for (int d = 0; d < dim; ++d)
-    quad_p(d) = 0.42 + 0.11 * d;
+    quad_p[d] = 0.42 + 0.11 * d;
   Quadrature<dim> quad(quad_p);
 
   Point<dim - 1> f_quad_p;
   for (int d = 0; d < dim - 1; ++d)
-    f_quad_p(d) = 0.42 + 0.11 * d;
+    f_quad_p[d] = 0.42 + 0.11 * d;
   Quadrature<dim - 1> f_quad(f_quad_p);
 
 
index 2fed74247a4235324f9172caad6b1479761faed5..90444bb4cef9f2a17f0b74e67f3124121c26939b 100644 (file)
@@ -66,10 +66,10 @@ VectorFunction<2>::value(const Point<2> &p, const unsigned int component) const
   switch (component)
     {
       case 0:
-        val = pow(p(0), 3);
+        val = pow(p[0], 3);
         break;
       case 1:
-        val = pow(p(1), 2) * p(0);
+        val = pow(p[1], 2) * p[0];
         break;
     }
   return val;
@@ -86,13 +86,13 @@ VectorFunction<3>::value(const Point<3> &p, const unsigned int component) const
   switch (component)
     {
       case 0:
-        val = pow(p(0), 3);
+        val = pow(p[0], 3);
         break;
       case 1:
-        val = pow(p(1), 2) * p(0);
+        val = pow(p[1], 2) * p[0];
         break;
       case 2:
-        val = p(2) * p(1) * p(0);
+        val = p[2] * p[1] * p[0];
         break;
     }
   return val;
index 260d2a38bea41dca74790137116ae5ae35a80fdd..99c8fecec5b8a08bfa20457ae1e96bcb3468d88b 100644 (file)
@@ -101,7 +101,7 @@ public:
     double result = 1.;
     for (unsigned int d = 0; d < dim; ++d)
       for (unsigned int k = 0; k < degree; ++k)
-        result *= p(d) + c;
+        result *= p[d] + c;
     return result;
   }
 
@@ -119,7 +119,7 @@ public:
         double            result = 1.;
         for (unsigned int d = 0; d < dim; ++d)
           for (unsigned int k = 0; k < degree; ++k)
-            result *= p(d) + c;
+            result *= p[d] + c;
         values[i] = result;
       }
   }
@@ -141,7 +141,7 @@ public:
             double result = 1.;
             for (unsigned int d = 0; d < dim; ++d)
               for (unsigned int k = 0; k < degree; ++k)
-                result *= p(d);
+                result *= p[d];
             values[i](c) = result;
           }
       }
index d7a0941df45917b92fdb275de0b2f933a2547972..cad89827499017eaa5c8c0a705ce3e16ff2f971b 100644 (file)
@@ -47,7 +47,7 @@ do_test(const Triangulation<dim> &tria, const Mapping<dim> &mapping)
   // contains many nonzero entries
   Point<dim> quad_p;
   for (int d = 0; d < dim; ++d)
-    quad_p(d) = 0.42 + 0.11 * d;
+    quad_p[d] = 0.42 + 0.11 * d;
   Quadrature<dim> quad(quad_p);
 
   {
index b822090ce753098549f8deae61f547ee379d4cb7..41b604ba45150b995d068836c4a2081d7696b0d8 100644 (file)
@@ -47,7 +47,7 @@ test()
   // Jacobian contains many nonzero entries
   Point<dim - 1> quad_p;
   for (int d = 0; d < dim - 1; ++d)
-    quad_p(d) = 0.42 + 0.11 * d;
+    quad_p[d] = 0.42 + 0.11 * d;
   Quadrature<dim - 1> quad(quad_p);
 
   {
index 0739db8fa9b7c0a8031aa0f7fd17d07dd9b5ef06..fc80961851ee7fff6031e9159bc59e04c2da7418 100644 (file)
@@ -45,7 +45,7 @@ test()
   // Jacobian contains many nonzero entries
   Point<dim - 1> quad_p;
   for (int d = 0; d < dim - 1; ++d)
-    quad_p(d) = 0.42 + 0.11 * d;
+    quad_p[d] = 0.42 + 0.11 * d;
   Quadrature<dim - 1> quad(quad_p);
 
   {
index 3bbeef189aa71abf43db7dfc6a77e71d8a078cb8..efb06fee7fb202d321e39657491ba2fb2c3a9fc4 100644 (file)
@@ -63,7 +63,7 @@ test()
   // Jacobian contains many nonzero entries
   Point<dim - 1> quad_p;
   for (int d = 0; d < dim - 1; ++d)
-    quad_p(d) = 0.42 + 0.11 * d;
+    quad_p[d] = 0.42 + 0.11 * d;
   Quadrature<dim - 1> quad(quad_p);
 
   {
index 5b453b258628e929195ad8808530d49e40a691c3..de550df9af76c0b2704247e172221029f2792238 100644 (file)
@@ -51,7 +51,7 @@
 Point<2>
 stretch_coordinates(const Point<2> p)
 {
-  return Point<2>(2 * p(0), p(1));
+  return Point<2>(2 * p[0], p[1]);
 }
 
 
@@ -59,7 +59,7 @@ stretch_coordinates(const Point<2> p)
 Point<2>
 tilt_coordinates(const Point<2> p)
 {
-  return Point<2>(p(0) + p(1), p(1));
+  return Point<2>(p[0] + p[1], p[1]);
 }
 
 
index 3149244b0f258e6d2c29565336f5e3bc169fc6fa..2f20e408ff99e417b788927bc0b8e549e075f068 100644 (file)
@@ -114,9 +114,9 @@ namespace Maxwell
         const Point<dim> &p = points[i];
 
         /* quadratic: */
-        value_list[i](0) = p(0) * p(0);
-        value_list[i](1) = p(1) * p(1);
-        value_list[i](2) = p(2) * p(2);
+        value_list[i](0) = p[0] * p[0];
+        value_list[i](1) = p[1] * p[1];
+        value_list[i](2) = p[2] * p[2];
       }
   }
   // Additional functions to create Neumann conditions, zero in this case.
index a48dd8856815ae2d05c1452bee2aa6e300865c32..8b89e4c236b1fb01e31d102c6f8d9329a1343204 100644 (file)
@@ -39,7 +39,7 @@ Point<dim>
 stretch(const Point<dim> &p)
 {
   Point<dim> q = p;
-  q(dim - 1) *= 2.;
+  q[dim - 1] *= 2.;
 
   return q;
 }
index 62319d531d736563b0d18af403831c1e3868bc07..cf4d0c254f66421fd967250d80687c9567bf950c 100644 (file)
@@ -41,8 +41,8 @@ affine(const Point<dim> &p)
   Point<dim> q = p;
   if (dim >= 2)
     {
-      q(0) = 2. * p(0) + p(1);
-      q(1) = p(0) + 3. * p(1);
+      q[0] = 2. * p[0] + p[1];
+      q[1] = p[0] + 3. * p[1];
     }
 
   return q;
index 4bd10c66dcafcba10d626310afd8a4c2650b743f..7d75f220afe9f61b3b4f4b68280124575f0024c6 100644 (file)
@@ -41,8 +41,8 @@ bilinear(const Point<dim> &p)
   Point<dim> q = p;
   if (dim >= 2)
     {
-      q(0) = 16. * p(0) + 4. * p(1) - 10. * p(0) * p(1);
-      q(1) = 6. * p(1) + 4. * p(0) * p(1);
+      q[0] = 16. * p[0] + 4. * p[1] - 10. * p[0] * p[1];
+      q[1] = 6. * p[1] + 4. * p[0] * p[1];
     }
 
   return q;
index 4013329384233fd6fed9c97ac84fb04c90779a0f..f5a682d9bb0fd009287411f216e1dbb967524ac8 100644 (file)
@@ -39,7 +39,7 @@ Point<dim>
 stretch(const Point<dim> &p)
 {
   Point<dim> q = p;
-  q(dim - 1) *= 2.;
+  q[dim - 1] *= 2.;
 
   return q;
 }
index 087a4156f5457340bd281f337a5dcc0f7cefa86d..a54c0ac7c0f424be885ad62f26d27b08a5d5d26b 100644 (file)
@@ -41,8 +41,8 @@ affine(const Point<dim> &p)
   Point<dim> q = p;
   if (dim >= 2)
     {
-      q(0) = 2. * p(0) + p(1);
-      q(1) = p(0) + 3. * p(1);
+      q[0] = 2. * p[0] + p[1];
+      q[1] = p[0] + 3. * p[1];
     }
 
   return q;
index d2cc99038aa85f4f01cbab04e7faa31de9caa96c..5b8c502c27bfc788a73207ff69bfa3119752f191 100644 (file)
@@ -41,8 +41,8 @@ bilinear(const Point<dim> &p)
   Point<dim> q = p;
   if (dim >= 2)
     {
-      q(0) = 16. * p(0) + 4. * p(1) - 10. * p(0) * p(1);
-      q(1) = 6. * p(1) + 4. * p(0) * p(1);
+      q[0] = 16. * p[0] + 4. * p[1] - 10. * p[0] * p[1];
+      q[1] = 6. * p[1] + 4. * p[0] * p[1];
     }
 
   return q;
index c4f14429b9c7e83837e627cdb8f6c0e7bd35608b..13cddaf85bd125b18859356f2731a4a9ae95dab3 100644 (file)
@@ -45,7 +45,7 @@
 Point<2>
 stretch_coordinates(const Point<2> p)
 {
-  return Point<2>(2 * p(0), p(1));
+  return Point<2>(2 * p[0], p[1]);
 }
 
 
@@ -53,7 +53,7 @@ stretch_coordinates(const Point<2> p)
 Point<2>
 tilt_coordinates(const Point<2> p)
 {
-  return Point<2>(p(0) + p(1), p(1));
+  return Point<2>(p[0] + p[1], p[1]);
 }
 
 
index 0c8266543a1061512cb4099bc891082677cb6868..9ad6db04e357d4c1c53b229516695a3993fab3e5 100644 (file)
@@ -143,10 +143,10 @@ double
 TestDef1<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
   Point<2> center;
-  center(0)    = 0.5;
-  center(1)    = 0.5;
+  center[0]    = 0.5;
+  center[1]    = 0.5;
   double rad   = p.distance(center),
-         phi_p = atan2(p(0) - center(0), p(1) - center(1));
+         phi_p = atan2(p[0] - center[0], p[1] - center[1]);
 
   if (component == 0)
     return rad * (sin(phi + phi_p) - sin(phi_p));
@@ -197,7 +197,7 @@ template <int dim>
 double
 TestDef2<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
-  double x = p(0), y = p(1);
+  double x = p[0], y = p[1];
 
   if (component == 0)
     return scale * x;
@@ -249,7 +249,7 @@ template <int dim>
 double
 TestDef3<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
-  double y = p(1);
+  double y = p[1];
 
   if (component == 0)
     return scale * y;
@@ -308,7 +308,7 @@ template <int dim>
 double
 TestPoly<dim>::value(const Point<dim> &p, const unsigned int component) const
 {
-  double x = p(0), y = p(1);
+  double x = p[0], y = p[1];
 
   // Ugly hack, but should do the job ...
   if (component == 0)
index a92276cc6d94248ba7c294b003fb6559c9343bb3..b5318daf6e7191549b68566fdedbb8d6578df0cc 100644 (file)
@@ -44,7 +44,7 @@
 Point<2>
 stretch_coordinates(const Point<2> p)
 {
-  return Point<2>(2 * p(0), p(1));
+  return Point<2>(2 * p[0], p[1]);
 }
 
 
@@ -52,7 +52,7 @@ stretch_coordinates(const Point<2> p)
 Point<2>
 tilt_coordinates(const Point<2> p)
 {
-  return Point<2>(p(0) + p(1), p(1));
+  return Point<2>(p[0] + p[1], p[1]);
 }
 
 
index 46449a108eb3adfec0af1a7f51d37ad846c1320b..4a22c1041b6cb20b29ffac16bbb13d65013b4ccb 100644 (file)
@@ -49,11 +49,11 @@ transform(const Point<dim> p)
       case 1:
         return p;
       case 2:
-        return Point<dim>(p(0) * (1 + p(1)), p(1) * (1 + p(0)));
+        return Point<dim>(p[0] * (1 + p[1]), p[1] * (1 + p[0]));
       case 3:
-        return Point<dim>(p(0) * (1 + p(1)) * (1 + p(2)),
-                          p(1) * (1 + p(0)) * (1 + p(2)),
-                          p(2) * (1 + p(0)) * (1 + p(1)));
+        return Point<dim>(p[0] * (1 + p[1]) * (1 + p[2]),
+                          p[1] * (1 + p[0]) * (1 + p[2]),
+                          p[2] * (1 + p[0]) * (1 + p[1]));
       default:
         Assert(false, ExcNotImplemented());
         return Point<dim>();
index ccb64174de7394335d3b359b5c711c52c5d7b529..d9ee2a1f9da6fbce6b145f0cc531b2d6ef16089c 100644 (file)
@@ -176,7 +176,7 @@ namespace Step12
 
     for (unsigned int i = 0; i < values.size(); ++i)
       {
-        if (points[i](0) < 0.5)
+        if (points[i][0] < 0.5)
           values[i] = 1.;
         else
           values[i] = 0.;
@@ -191,8 +191,8 @@ namespace Step12
     Assert(dim >= 2, ExcNotImplemented());
 
     Point<dim> wind_field;
-    wind_field(0) = -p(1);
-    wind_field(1) = p(0);
+    wind_field[0] = -p[1];
+    wind_field[1] = p[0];
     wind_field /= wind_field.norm();
 
     return wind_field;
index 1d67fc0de7b7aa33b73d1aa892e921beec4a283d..f4971201e735303bacd22f5e853c1bcda7eeb997 100644 (file)
@@ -157,8 +157,8 @@ namespace StokesTests
   Solution<2>::value(const Point<2> &p, const unsigned int component) const
   {
     using numbers::PI;
-    const double x = p(0);
-    const double y = p(1);
+    const double x = p[0];
+    const double y = p[1];
     // zero on BD's
     if (component == 0)
       return PI * sin(PI * x) * sin(PI * x) * sin(2.0 * PI * y);
@@ -177,9 +177,9 @@ namespace StokesTests
     Assert(component <= 3 + 1, ExcIndexRange(component, 0, 3 + 1));
 
     using numbers::PI;
-    const double x = p(0);
-    const double y = p(1);
-    const double z = p(2);
+    const double x = p[0];
+    const double y = p[1];
+    const double z = p[2];
 
     if (component == 0)
       return 2. * PI * sin(PI * x) * sin(PI * x) * sin(2.0 * PI * y) *
@@ -204,8 +204,8 @@ namespace StokesTests
     Assert(component <= 2, ExcIndexRange(component, 0, 2 + 1));
 
     using numbers::PI;
-    const double x = p(0);
-    const double y = p(1);
+    const double x = p[0];
+    const double y = p[1];
 
     Tensor<1, 2> return_value;
     if (component == 0)
@@ -236,9 +236,9 @@ namespace StokesTests
     Assert(component <= 3, ExcIndexRange(component, 0, 3 + 1));
 
     using numbers::PI;
-    const double x = p(0);
-    const double y = p(1);
-    const double z = p(2);
+    const double x = p[0];
+    const double y = p[1];
+    const double z = p[2];
 
     Tensor<1, 3> return_value;
     if (component == 0)
@@ -300,8 +300,8 @@ namespace StokesTests
     Assert(component <= 2, ExcIndexRange(component, 0, 2 + 1));
 
     using numbers::PI;
-    double x  = p(0);
-    double y  = p(1);
+    double x  = p[0];
+    double y  = p[1];
     double nu = 1.0;
 
     // RHS for 0 BD's
@@ -327,9 +327,9 @@ namespace StokesTests
     Assert(component <= 3, ExcIndexRange(component, 0, 3 + 1));
 
     using numbers::PI;
-    double x = p(0);
-    double y = p(1);
-    double z = p(2);
+    double x = p[0];
+    double y = p[1];
+    double z = p[2];
 
     if (component == 0)
       return 4. * PI * PI * PI *
index 4bccf5921e3ef1cb3df1e69431493f43579764c3..1152aac11eb5cdf30ee295ab5aa2a4666df71f9f 100644 (file)
@@ -49,21 +49,21 @@ test(const int n_refinements, const int n_subdivisions, MPI_Comm comm)
     auto endc = tria.end();
     for (; cell != endc; ++cell)
       for (const unsigned int face_number : GeometryInfo<dim>::face_indices())
-        if (std::fabs(cell->face(face_number)->center()(0) - left) < 1e-12)
+        if (std::fabs(cell->face(face_number)->center()[0] - left) < 1e-12)
           cell->face(face_number)->set_all_boundary_ids(1);
-        else if (std::fabs(cell->face(face_number)->center()(0) - right) <
+        else if (std::fabs(cell->face(face_number)->center()[0] - right) <
                  1e-12)
           cell->face(face_number)->set_all_boundary_ids(2);
         else if (dim >= 2 &&
-                 std::fabs(cell->face(face_number)->center()(1) - left) < 1e-12)
+                 std::fabs(cell->face(face_number)->center()[1] - left) < 1e-12)
           cell->face(face_number)->set_all_boundary_ids(3);
-        else if (dim >= 2 && std::fabs(cell->face(face_number)->center()(1) -
+        else if (dim >= 2 && std::fabs(cell->face(face_number)->center()[1] -
                                        right) < 1e-12)
           cell->face(face_number)->set_all_boundary_ids(4);
         else if (dim >= 3 &&
-                 std::fabs(cell->face(face_number)->center()(2) - left) < 1e-12)
+                 std::fabs(cell->face(face_number)->center()[2] - left) < 1e-12)
           cell->face(face_number)->set_all_boundary_ids(5);
-        else if (dim >= 3 && std::fabs(cell->face(face_number)->center()(2) -
+        else if (dim >= 3 && std::fabs(cell->face(face_number)->center()[2] -
                                        right) < 1e-12)
           cell->face(face_number)->set_all_boundary_ids(6);
 
index d40f45d9bc4a2e118d1b74bd00ed0836095eb449..57b5be45a3b92907ff19c79d2fcb8c99dcb4f7c2 100644 (file)
@@ -55,16 +55,16 @@ create_triangulation(const unsigned int case_no, Triangulation<2> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<2> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           break;
         }
       case 2:
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<2> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           Point<2> &v3 = tria.begin_active()->vertex(3);
-          v3(0)        = 4.;
+          v3[0]        = 4.;
           break;
         }
       case 3:
@@ -120,7 +120,7 @@ create_triangulation(const unsigned int case_no, Triangulation<3> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<3> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           break;
         }
       case 3:
index d9d9aba8ca233adc749dd9fb9a7e823806e0f9b9..c67fcfb7afd0c7e8e26b161ada78bb3b9cce3ce2 100644 (file)
@@ -55,10 +55,10 @@ create_triangulation(const unsigned int case_no, Triangulation<2> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<2> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           Point<2> &v2 = tria.begin_active()->vertex(3);
-          v2(0)        = 5.;
-          v2(1)        = 4.;
+          v2[0]        = 5.;
+          v2[1]        = 4.;
           break;
         }
       default:
@@ -79,7 +79,7 @@ create_triangulation(const unsigned int case_no, Triangulation<3> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<3> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           break;
         }
       default:
index 4ad344b25b295ec41eaadc06a7e87107635b944d..8c2337620ed9579c8a24c33a90dfea07190aab53 100644 (file)
@@ -76,7 +76,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < 2; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << 2), ExcInternalError());
 
index 96c67fbd41cb8f2d46f32052806894a842ce64cf..9be87521b86ce461df82ed353f3cb4754aaeb92c 100644 (file)
@@ -76,7 +76,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < 2; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << 2), ExcInternalError());
 
index e75dbd089a3515bec9942e0616c70ebb3d23e00b..c7b1360b98f4605def02c6a09e0258a91656c46f 100644 (file)
@@ -68,7 +68,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < 2; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << 2), ExcInternalError());
 
index 1aca91ada17919c033e4c1987d8d881513ad7036..4ec10371de26a2f83481f923525cc2ab00290c73 100644 (file)
@@ -35,8 +35,8 @@ check_rect1(unsigned int n, bool color, bool log)
 
   for (unsigned int d = 0; d < dim; ++d)
     {
-      left(d)         = -1.;
-      right(d)        = d + 2;
+      left[d]         = -1.;
+      right[d]        = d + 2;
       subdivisions[d] = n * (d + 3);
     }
   Triangulation<dim> tria;
index e6fa88d3e8e1d9b94547be64a2a1ebb4cb7a93bd..833a58e7fb21730e5286d9568d18be89707c1634 100644 (file)
@@ -56,9 +56,9 @@ my_cylinder(Triangulation<3> &tria,
   // Turn cylinder such that y->x
   for (unsigned int i = 0; i < 16; ++i)
     {
-      const double h = vertices[i](1);
-      vertices[i](1) = -vertices[i](0);
-      vertices[i](0) = h;
+      const double h = vertices[i][1];
+      vertices[i][1] = -vertices[i][0];
+      vertices[i][0] = h;
     }
 
   int cell_vertices[5][8] = {{0, 1, 8, 9, 2, 3, 10, 11},
index b4c54a191c806a024a124537378bea430ffa190d..51767b2c8f9b509c4ec3f0c2141a8faf30a41538 100644 (file)
@@ -25,14 +25,14 @@ void
 dim_2(std::ostream &os)
 {
   std::vector<Point<2>> vertices(4);
-  vertices[0](0) = -1.;
-  vertices[0](1) = -1.;
-  vertices[1](0) = 1.;
-  vertices[1](1) = -1.5;
-  vertices[2](0) = 1.5;
-  vertices[2](1) = 1.5;
-  vertices[3](0) = 2.;
-  vertices[3](1) = 0.5;
+  vertices[0][0] = -1.;
+  vertices[0][1] = -1.;
+  vertices[1][0] = 1.;
+  vertices[1][1] = -1.5;
+  vertices[2][0] = 1.5;
+  vertices[2][1] = 1.5;
+  vertices[3][0] = 2.;
+  vertices[3][1] = 0.5;
 
   Triangulation<2> tria;
   GridGenerator::general_cell<2>(tria, vertices);
@@ -45,30 +45,30 @@ void
 dim_3(std::ostream &os)
 {
   std::vector<Point<3>> vertices(8);
-  vertices[0](0) = -1.;
-  vertices[0](1) = -1.;
-  vertices[0](2) = -1.;
-  vertices[1](0) = 1.;
-  vertices[1](1) = -1.5;
-  vertices[1](2) = -1.5;
-  vertices[2](0) = 2.;
-  vertices[2](1) = 1.5;
-  vertices[2](2) = -2.;
-  vertices[3](0) = 2.5;
-  vertices[3](1) = 0.5;
-  vertices[3](2) = -3.;
-  vertices[4](0) = -1.;
-  vertices[4](1) = -1.;
-  vertices[4](2) = 1.;
-  vertices[5](0) = 1.;
-  vertices[5](1) = -1.5;
-  vertices[5](2) = 1.5;
-  vertices[6](0) = 2.;
-  vertices[6](1) = 1.5;
-  vertices[6](2) = 2.;
-  vertices[7](0) = 2.;
-  vertices[7](1) = 0.5;
-  vertices[7](2) = 3.;
+  vertices[0][0] = -1.;
+  vertices[0][1] = -1.;
+  vertices[0][2] = -1.;
+  vertices[1][0] = 1.;
+  vertices[1][1] = -1.5;
+  vertices[1][2] = -1.5;
+  vertices[2][0] = 2.;
+  vertices[2][1] = 1.5;
+  vertices[2][2] = -2.;
+  vertices[3][0] = 2.5;
+  vertices[3][1] = 0.5;
+  vertices[3][2] = -3.;
+  vertices[4][0] = -1.;
+  vertices[4][1] = -1.;
+  vertices[4][2] = 1.;
+  vertices[5][0] = 1.;
+  vertices[5][1] = -1.5;
+  vertices[5][2] = 1.5;
+  vertices[6][0] = 2.;
+  vertices[6][1] = 1.5;
+  vertices[6][2] = 2.;
+  vertices[7][0] = 2.;
+  vertices[7][1] = 0.5;
+  vertices[7][2] = 3.;
 
   Triangulation<3> tria;
   GridGenerator::general_cell<3>(tria, vertices);
index cd60e7aec13d8a9d85b010f16f82650482ec2c9f..d16ed0ab00a61d48928a14f399dc65fb6992fd1f 100644 (file)
@@ -25,21 +25,21 @@ void
 dim_2_3(std::ostream &os)
 {
   std::vector<Point<3>> vertices(4);
-  vertices[0](0) = -1.;
-  vertices[0](1) = -1.;
-  vertices[0](0) = 0.;
+  vertices[0][0] = -1.;
+  vertices[0][1] = -1.;
+  vertices[0][0] = 0.;
 
-  vertices[1](0) = 1.;
-  vertices[1](1) = -1.5;
-  vertices[1](2) = 0.;
+  vertices[1][0] = 1.;
+  vertices[1][1] = -1.5;
+  vertices[1][2] = 0.;
 
-  vertices[2](0) = 1.5;
-  vertices[2](1) = 1.5;
-  vertices[2](2) = 0.;
+  vertices[2][0] = 1.5;
+  vertices[2][1] = 1.5;
+  vertices[2][2] = 0.;
 
-  vertices[3](0) = 2.;
-  vertices[3](1) = 0.5;
-  vertices[3](2) = 0.;
+  vertices[3][0] = 2.;
+  vertices[3][1] = 0.5;
+  vertices[3][2] = 0.;
 
   Triangulation<2, 3> tria;
   GridGenerator::general_cell<2, 3>(tria, vertices);
@@ -52,12 +52,12 @@ void
 dim_1_3(std::ostream &os)
 {
   std::vector<Point<3>> vertices(2);
-  vertices[0](0) = -1.;
-  vertices[0](1) = -1.;
-  vertices[0](2) = -1.;
-  vertices[1](0) = 1.;
-  vertices[1](1) = -1.5;
-  vertices[1](2) = -1.5;
+  vertices[0][0] = -1.;
+  vertices[0][1] = -1.;
+  vertices[0][2] = -1.;
+  vertices[1][0] = 1.;
+  vertices[1][1] = -1.5;
+  vertices[1][2] = -1.5;
 
   Triangulation<1, 3> tria;
   GridGenerator::general_cell<1, 3>(tria, vertices);
@@ -70,11 +70,11 @@ void
 dim_1_2(std::ostream &os)
 {
   std::vector<Point<2>> vertices(2);
-  vertices[0](0) = -1.;
-  vertices[0](1) = -1.;
+  vertices[0][0] = -1.;
+  vertices[0][1] = -1.;
 
-  vertices[1](0) = 1.;
-  vertices[1](1) = -1.5;
+  vertices[1][0] = 1.;
+  vertices[1][1] = -1.5;
 
   Triangulation<1, 2> tria;
   GridGenerator::general_cell<1, 2>(tria, vertices);
index 4ecfd074e01b342e8eb0ceb0b068a4188e4d34ac..8c2fc0b528cd4d1b07857386980b819dd0d80979 100644 (file)
@@ -32,10 +32,10 @@ dim_2(std::ostream &os)
   Triangulation<d>   tr;
 
   std::vector<Point<d>> vertices(d + 1);
-  vertices[1](0) = 0.5;
-  vertices[1](1) = .85;
-  vertices[2](0) = -0.5;
-  vertices[2](1) = .85;
+  vertices[1][0] = 0.5;
+  vertices[1][1] = .85;
+  vertices[2][0] = -0.5;
+  vertices[2][1] = .85;
   GridGenerator::simplex(tr, vertices);
 
   GridOut gout;
@@ -49,18 +49,18 @@ dim_3(std::ostream &os)
   Triangulation<d>   tr;
 
   std::vector<Point<d>> vertices(d + 1);
-  vertices[0](0) = 1.;
-  vertices[0](1) = 0.;
-  vertices[0](2) = .7;
-  vertices[1](0) = -1.;
-  vertices[1](1) = 0.;
-  vertices[1](2) = .7;
-  vertices[2](0) = 0.;
-  vertices[2](1) = 1.;
-  vertices[2](2) = -.7;
-  vertices[3](0) = 0.;
-  vertices[3](1) = -1.;
-  vertices[3](2) = -.7;
+  vertices[0][0] = 1.;
+  vertices[0][1] = 0.;
+  vertices[0][2] = .7;
+  vertices[1][0] = -1.;
+  vertices[1][1] = 0.;
+  vertices[1][2] = .7;
+  vertices[2][0] = 0.;
+  vertices[2][1] = 1.;
+  vertices[2][2] = -.7;
+  vertices[3][0] = 0.;
+  vertices[3][1] = -1.;
+  vertices[3][2] = -.7;
   GridGenerator::simplex(tr, vertices);
 
   GridOut gout;
index 735b0b9375ec455c16f664c511bf5cfc6f7e5c8a..e60ccb8b9681bddf2fb85a24397f82cee91f91ac 100644 (file)
@@ -31,18 +31,18 @@ void
 test(bool second_case = false)
 {
   std::vector<Point<dim>> vertices(GeometryInfo<dim>::vertices_per_cell);
-  vertices[1](1) = 1;
-  vertices[2](0) = 1;
-  vertices[2](1) = 1;
-  vertices[3](0) = 1;
+  vertices[1][1] = 1;
+  vertices[2][0] = 1;
+  vertices[2][1] = 1;
+  vertices[3][0] = 1;
   if (dim == 3)
     {
       for (unsigned int i = 4; i < GeometryInfo<dim>::vertices_per_cell; ++i)
-        vertices[i](2) = -1;
-      vertices[5](1) = 1;
-      vertices[6](0) = 1;
-      vertices[6](1) = 1;
-      vertices[7](0) = 1;
+        vertices[i][2] = -1;
+      vertices[5][1] = 1;
+      vertices[6][0] = 1;
+      vertices[6][1] = 1;
+      vertices[7][0] = 1;
     }
   std::vector<CellData<dim>> cells(1);
   for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
@@ -53,7 +53,7 @@ test(bool second_case = false)
       std::swap(cells[0].vertices[1], cells[0].vertices[3]);
       std::swap(cells[0].vertices[5], cells[0].vertices[7]);
       for (unsigned int i = 4; i < GeometryInfo<dim>::vertices_per_cell; ++i)
-        vertices[i](2) = 1;
+        vertices[i][2] = 1;
     }
 
   SubCellData subcelldata;
index 0a3ce5743feffa6133c3d302ccce7ba7657ffcf4..bbc496707a9b98151ffe43eaf9582c9282337e05 100644 (file)
@@ -36,13 +36,13 @@ test()
 {
   const static int        dim = 2;
   std::vector<Point<dim>> vertices(6);
-  vertices[1](1) = 1;
-  vertices[2](0) = 1;
-  vertices[3](0) = 1;
-  vertices[3](1) = 1;
-  vertices[4](0) = 2;
-  vertices[5](0) = 2;
-  vertices[5](1) = 1;
+  vertices[1][1] = 1;
+  vertices[2][0] = 1;
+  vertices[3][0] = 1;
+  vertices[3][1] = 1;
+  vertices[4][0] = 2;
+  vertices[5][0] = 2;
+  vertices[5][1] = 1;
 
   std::vector<CellData<dim>> cells(2);
   for (const unsigned int i : GeometryInfo<dim>::vertex_indices())
index 3370e282da3c209f5ed4cbeca4fa74939e8434e1..acacf358f02862ec7a41b6c4329515ad2cf29c3e 100644 (file)
@@ -43,11 +43,11 @@ public:
       FlatManifold<dim>::get_new_point(surrounding_points, weights);
 
     for (int i = 0; i < dim; ++i)
-      middle(i) -= .5;
+      middle[i] -= .5;
     middle *=
       std::sqrt(static_cast<double>(dim)) / (std::sqrt(middle.square()) * 2);
     for (int i = 0; i < dim; ++i)
-      middle(i) += .5;
+      middle[i] += .5;
 
     return middle;
   }
@@ -88,7 +88,7 @@ CurvedLine<dim>::get_new_point_on_line(
   // 0 or 1, then the z-values of all
   // vertices of the line is like that
   if (dim >= 3)
-    if (((middle(2) == 0) || (middle(2) == 1))
+    if (((middle[2] == 0) || (middle[2] == 1))
         // find out, if the line is in the
         // interior of the top or bottom face
         // of the domain, or at the edge.
@@ -105,18 +105,18 @@ CurvedLine<dim>::get_new_point_on_line(
       return middle;
 
 
-  double x = middle(0), y = middle(1);
+  double x = middle[0], y = middle[1];
 
   if (y < x)
     if (y < 1 - x)
-      middle(1) = 0.04 * std::sin(6 * numbers::PI * middle(0));
+      middle[1] = 0.04 * std::sin(6 * numbers::PI * middle[0]);
     else
-      middle(0) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(1));
+      middle[0] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[1]);
 
   else if (y < 1 - x)
-    middle(0) = 0.04 * std::sin(6 * numbers::PI * middle(1));
+    middle[0] = 0.04 * std::sin(6 * numbers::PI * middle[1]);
   else
-    middle(1) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(0));
+    middle[1] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[0]);
 
   return middle;
 }
@@ -135,21 +135,21 @@ CurvedLine<dim>::get_new_point_on_quad(
   // z-value of the midpoint is either
   // 0 or 1, then the z-values of all
   // vertices of the quad is like that
-  if (dim == 3 && ((middle(dim - 1) == 0) || (middle(dim - 1) == 1)))
+  if (dim == 3 && ((middle[dim - 1] == 0) || (middle[dim - 1] == 1)))
     return middle;
 
-  double x = middle(0), y = middle(1);
+  double x = middle[0], y = middle[1];
 
   if (y < x)
     if (y < 1 - x)
-      middle(1) = 0.04 * std::sin(6 * numbers::PI * middle(0));
+      middle[1] = 0.04 * std::sin(6 * numbers::PI * middle[0]);
     else
-      middle(0) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(1));
+      middle[0] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[1]);
 
   else if (y < 1 - x)
-    middle(0) = 0.04 * std::sin(6 * numbers::PI * middle(1));
+    middle[0] = 0.04 * std::sin(6 * numbers::PI * middle[1]);
   else
-    middle(1) = 1 + 0.04 * std::sin(6 * numbers::PI * middle(0));
+    middle[1] = 1 + 0.04 * std::sin(6 * numbers::PI * middle[0]);
 
   return middle;
 }
index 925a0abe5f816962c2d5833b5f56c9b9dcd9c03a..881841f05cb14ff7b036cf626ec07f31cdca8e31 100644 (file)
@@ -74,9 +74,9 @@ generate_grid(Triangulation<2> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -137,9 +137,9 @@ generate_grid(Triangulation<3> &triangulation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<3>::face_indices())
     {
-      if (cell_1->face(j)->center()(2) > 2.9)
+      if (cell_1->face(j)->center()[2] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(2) < -2.9)
+      if (cell_2->face(j)->center()[2] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
index 4f270a951c662d40b879353b00e4fcc3ff906d88..68e600490ba476fb9a85f3e8ef27055d9df661ee 100644 (file)
@@ -79,9 +79,9 @@ generate_grid(Triangulation<2> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<2>::face_indices())
     {
-      if (cell_1->face(j)->center()(1) > 2.9)
+      if (cell_1->face(j)->center()[1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(1) < -2.9)
+      if (cell_2->face(j)->center()[1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -150,9 +150,9 @@ generate_grid(Triangulation<3> &triangulation, int orientation)
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<3>::face_indices())
     {
-      if (cell_1->face(j)->center()(2) > 2.9)
+      if (cell_1->face(j)->center()[2] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(2) < -2.9)
+      if (cell_2->face(j)->center()[2] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
index 7fbc72d1b8eb740ce4a84bbe9290c3521b8bddfe..07c2642e5dc9e7b584ee407af8fd137bb5b03d47 100644 (file)
@@ -31,14 +31,14 @@ template <>
 Point<2>
 trans_func(const Point<2> &p)
 {
-  Point<2> r(p(0) + p(1) * p(1), p(1));
+  Point<2> r(p[0] + p[1] * p[1], p[1]);
   return r;
 }
 template <>
 Point<3>
 trans_func(const Point<3> &p)
 {
-  Point<3> r(p(0) + p(1) * p(1), p(1), p(2));
+  Point<3> r(p[0] + p[1] * p[1], p[1], p[2]);
   return r;
 }
 
index 9e216729b682a5d3ade4d1effcdc5d58d8fc87ce..8352aa3c4fed5253daa863a79945ff956bb50835 100644 (file)
@@ -47,10 +47,10 @@ create_triangulation(const unsigned int case_no, Triangulation<2> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<2> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           Point<2> &v2 = tria.begin_active()->vertex(3);
-          v2(0)        = 5.;
-          v2(1)        = 4.;
+          v2[0]        = 5.;
+          v2[1]        = 4.;
           //      exact_areas.push_back(7.);
           break;
         }
@@ -73,7 +73,7 @@ create_triangulation(const unsigned int case_no, Triangulation<3> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<3> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           break;
         }
       default:
index 67c372b91cdf002432db1f06d8c278a949780ddf..953750fcf2fa978ead27cf34b66d97a32259de33 100644 (file)
@@ -48,16 +48,16 @@ create_triangulation(const unsigned int case_no, Triangulation<2> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<2> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           break;
         }
       case 2:
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<2> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           Point<2> &v3 = tria.begin_active()->vertex(3);
-          v3(0)        = 4.;
+          v3[0]        = 4.;
           break;
         }
       default:
@@ -80,7 +80,7 @@ create_triangulation(const unsigned int case_no, Triangulation<3> &tria)
         {
           GridGenerator::hyper_cube(tria, 1., 3.);
           Point<3> &v0 = tria.begin_active()->vertex(0);
-          v0(0)        = 0.;
+          v0[0]        = 0.;
           break;
         }
       default:
index c647a22d4f8c804afcc33efc6bd0d2a31665f856..293b40f88ba8bf7be14f0ba9cb91b9b468e70e43 100644 (file)
@@ -31,9 +31,9 @@
 Point<3>
 distort_planar(Point<3> p)
 {
-  if (p(1) > 0.5 && p(2) > 0.5)
+  if (p[1] > 0.5 && p[2] > 0.5)
     {
-      p(1) += 1;
+      p[1] += 1;
     }
   return p;
 }
@@ -44,9 +44,9 @@ distort_planar(Point<3> p)
 Point<3>
 distort_twisted(Point<3> p)
 {
-  if (p(2) > 0.5 && ((p(0) > 0.5) ^ (p(1) > 0.5)))
+  if (p[2] > 0.5 && ((p[0] > 0.5) ^ (p[1] > 0.5)))
     {
-      p(2) += 1;
+      p[2] += 1;
     }
   return p;
 }
index c6e82efd90a3273a2d42688f8c2a054f0a48fb30..5c2869f29e080970858e5114d4d4b79f2caa0b54 100644 (file)
@@ -41,14 +41,14 @@ test()
   Assert(dim == 2 || dim == 3, ExcNotImplemented());
 
   std::vector<Point<dim>> vertices(GeometryInfo<dim>::vertices_per_cell);
-  vertices[0](0) = 0;
-  vertices[0](1) = 0;
-  vertices[1](0) = 2;
-  vertices[1](1) = 1;
-  vertices[2](0) = 3;
-  vertices[2](1) = 3;
-  vertices[3](0) = 0;
-  vertices[3](1) = 1;
+  vertices[0][0] = 0;
+  vertices[0][1] = 0;
+  vertices[1][0] = 2;
+  vertices[1][1] = 1;
+  vertices[2][0] = 3;
+  vertices[2][1] = 3;
+  vertices[3][0] = 0;
+  vertices[3][1] = 1;
   if (dim == 3)
     {
       // for the new numbering
@@ -60,9 +60,9 @@ test()
       // for the old numbering
       for (unsigned int i = 0; i < 4; ++i)
         {
-          std::swap(vertices[i](1), vertices[i](2));
+          std::swap(vertices[i][1], vertices[i][2]);
           vertices[i + 4]    = vertices[i];
-          vertices[i + 4](1) = 1;
+          vertices[i + 4][1] = 1;
         }
     }
 
index 19c3e26e1e8a3aaa4ad77423fec116bfc3fdf2fa..ab8a57dac884d621b6bae24fa634ef2ed5dc3999 100644 (file)
@@ -59,7 +59,7 @@ test()
     {
       unsigned int subdomain = 0;
       for (unsigned int d = 0; d < dim; ++d)
-        if (cell->center()(d) > 0)
+        if (cell->center()[d] > 0)
           subdomain |= (1 << d);
       AssertThrow(subdomain < (1 << dim), ExcInternalError());
 
index 39f8fdf92411020f7640c3bf5b5fcf615f3b65b6..09c93cf2d7927a0eca0c5c5a7e83bdb4f893c4b3 100644 (file)
@@ -62,7 +62,7 @@ template <int dim>
 double
 ExactSolution<dim>::value(const Point<dim> &p, const unsigned int) const
 {
-  return p(0) * p(0);
+  return p[0] * p[0];
 }
 
 template <int dim>
index 7c3b33e1a883daa88995a58ee1fd31d69b029db2..2a3c5a691be90485bc67dcf5197fb5d373eba848 100644 (file)
@@ -66,7 +66,7 @@ public:
   virtual double
   value(const Point<dim> &p, const unsigned int) const
   {
-    return p(0);
+    return p[0];
   }
 };
 
index b3966972de3845ecd8cd4ec9a4a25f0fd48f120b..79f5a83b53ac442c7d6704d80a315db58dc6ae40 100644 (file)
@@ -39,15 +39,15 @@ test()
 
   /*Make a square*/
   Point<dim> point_1, point_2;
-  point_1(0) = 0;
-  point_1(1) = 0;
-  point_2(0) = 1;
-  point_2(1) = 1;
+  point_1[0] = 0;
+  point_1[1] = 0;
+  point_2[0] = 1;
+  point_2[1] = 1;
   GridGenerator::hyper_rectangle(triangulation, point_1, point_2);
 
   Triangulation<dim> triangulation_temp;
-  point_1(0) = 1;
-  point_2(0) = 2;
+  point_1[0] = 1;
+  point_2[0] = 2;
   GridGenerator::hyper_rectangle(triangulation_temp, point_1, point_2);
   /*glue squares together*/
   GridGenerator::merge_triangulations(triangulation_temp,
index dad119befa7d59af6d487cc0d63fe215028749c6..22229be1bf9886578d01385bc4fbe00098587e55 100644 (file)
@@ -62,8 +62,8 @@ generate_grid(Triangulation<dim, spacedim> &tria)
   // Define a rectangular shape
   for (unsigned int d = 0; d < dim; ++d)
     {
-      p1(d) = 0;
-      p2(d) = (d == 0) ? 2.0 : 1.0;
+      p1[d] = 0;
+      p2[d] = (d == 0) ? 2.0 : 1.0;
       sub_div.push_back((d == 0) ? 2 : 1);
     }
   GridGenerator::subdivided_hyper_rectangle(tria, sub_div, p1, p2, true);
index e8cbeb452b5a010057dcf3279048f6898d3970d8..9a0a0972e0b04c9e36f873ef13015a7a1b82c2dd 100644 (file)
@@ -112,8 +112,8 @@ Beta<dim>::value_list(const std::vector<Point<dim>> &points,
       const Point<dim> &p    = points[i];
       Point<dim>       &beta = values[i];
 
-      beta(0) = -p(1);
-      beta(1) = p(0);
+      beta[0] = -p[1];
+      beta[1] = p[0];
       beta /= std::sqrt(beta.square());
     }
 }
@@ -130,7 +130,7 @@ BoundaryValues<dim>::value_list(const std::vector<Point<dim>> &points,
 
   for (unsigned int i = 0; i < values.size(); ++i)
     {
-      if (points[i](0) < 0.5)
+      if (points[i][0] < 0.5)
         values[i] = 1.;
       else
         values[i] = 0.;
index 1b735537f49a7be30951c9928b1e5d2900b24aae..f140b9c7346271b1c41ce910e3385b1dbb89382c 100644 (file)
@@ -671,9 +671,9 @@ double
 Solution<dim>::value(const Point<dim> &p,
                      const unsigned int /*component*/) const
 {
-  double q = p(0);
+  double q = p[0];
   for (unsigned int i = 1; i < dim; ++i)
-    q += std::sin(10 * p(i) + 5 * p(0) * p(0));
+    q += std::sin(10 * p[i] + 5 * p[0] * p[0]);
   const double exponential = std::exp(q);
   return exponential;
 }
@@ -698,19 +698,19 @@ double
 RightHandSide<dim>::value(const Point<dim> &p,
                           const unsigned int /*component*/) const
 {
-  double q = p(0);
+  double q = p[0];
   for (unsigned int i = 1; i < dim; ++i)
-    q += std::sin(10 * p(i) + 5 * p(0) * p(0));
+    q += std::sin(10 * p[i] + 5 * p[0] * p[0]);
   const double u  = std::exp(q);
   double       t1 = 1, t2 = 0, t3 = 0;
   for (unsigned int i = 1; i < dim; ++i)
     {
-      t1 += std::cos(10 * p(i) + 5 * p(0) * p(0)) * 10 * p(0);
-      t2 += 10 * std::cos(10 * p(i) + 5 * p(0) * p(0)) -
-            100 * std::sin(10 * p(i) + 5 * p(0) * p(0)) * p(0) * p(0);
-      t3 += 100 * std::cos(10 * p(i) + 5 * p(0) * p(0)) *
-              std::cos(10 * p(i) + 5 * p(0) * p(0)) -
-            100 * std::sin(10 * p(i) + 5 * p(0) * p(0));
+      t1 += std::cos(10 * p[i] + 5 * p[0] * p[0]) * 10 * p[0];
+      t2 += 10 * std::cos(10 * p[i] + 5 * p[0] * p[0]) -
+            100 * std::sin(10 * p[i] + 5 * p[0] * p[0]) * p[0] * p[0];
+      t3 += 100 * std::cos(10 * p[i] + 5 * p[0] * p[0]) *
+              std::cos(10 * p[i] + 5 * p[0] * p[0]) -
+            100 * std::sin(10 * p[i] + 5 * p[0] * p[0]);
     };
   t1 = t1 * t1;
 
index ccc52949cc497b14bdc3bc50bb5ca372fe5c0f05..4cae73de83d999b497cfd73d601d32d96008a56e 100644 (file)
@@ -116,7 +116,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4 * std::pow(p(i), 4);
+    return_value += 4 * std::pow(p[i], 4);
 
   return return_value;
 }
index f507a4e2447a977b8f171f6b7dc3ef0bd948e03c..78f1a45b9b981d95ebb94b3b4e5639daed3bb1da 100644 (file)
@@ -500,8 +500,8 @@ HelmholtzProblem<dim>::run()
                                                      endc = triangulation.end();
           for (; cell != endc; ++cell)
             for (const unsigned int face : GeometryInfo<dim>::face_indices())
-              if ((cell->face(face)->center()(0) == -1) ||
-                  (cell->face(face)->center()(1) == -1))
+              if ((cell->face(face)->center()[0] == -1) ||
+                  (cell->face(face)->center()[1] == -1))
                 cell->face(face)->set_boundary_id(1);
         }
       else
index ee5f108fdeced0790448efc1d26b0f12b1c21f9d..c6a79d88d9ad11918d2c259dea656b00f46d474a 100644 (file)
@@ -122,8 +122,8 @@ RightHandSide<dim>::vector_value(const Point<dim> &p,
   Assert(dim >= 2, ExcNotImplemented());
 
   Point<dim> point_1, point_2;
-  point_1(0) = 0.5;
-  point_2(0) = -0.5;
+  point_1[0] = 0.5;
+  point_2[0] = -0.5;
 
   if (((p - point_1).norm_square() < 0.2 * 0.2) ||
       ((p - point_2).norm_square() < 0.2 * 0.2))
index e1a389447e06c355de1f85cee36872ab574ebce8..ee4600311233f048b861e56e8db45ed05bf5e080 100644 (file)
@@ -92,7 +92,7 @@ main()
        ++cell)
     {
       real_cell_center = cell->center();
-      if (real_cell_center(0) < 0.5 && real_cell_center(1) < 0.5)
+      if (real_cell_center[0] < 0.5 && real_cell_center[1] < 0.5)
         cell->set_material_id(0); // solid
       else
         cell->set_material_id(1); // fluid
index 405c2142ac3b0fdc7604d103da1f21bef6bed20b..c33806c9836374ed0c32ca52fc61c04318e29200 100644 (file)
@@ -109,7 +109,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4 * std::pow(p(i), 4);
+    return_value += 4 * std::pow(p[i], 4);
 
   return return_value;
 }
index 1b39b3133fdbc68c4313bcf4c37793be47d4d6d0..8069085d3f102d2bf1efdbb1dfd28e90c5e41fd5 100644 (file)
@@ -129,7 +129,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 2 * std::pow(p(i), 2);
+    return_value += 2 * std::pow(p[i], 2);
 
   return return_value;
 }
index b7415e2968d6e33001565f22fc2d2b94f355581f..4fc27bbff7eddac442da23bb7638b99283e81008 100644 (file)
@@ -130,7 +130,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 2 * std::pow(p(i), 2);
+    return_value += 2 * std::pow(p[i], 2);
 
   return return_value;
 }
index 004b449a37e17235ea74f308416a9b9361e1554f..fc8d3f60aa0a0de825459e530c3e16c46c1221bb 100644 (file)
@@ -128,8 +128,8 @@ test()
 
 
   Point<dim> p;
-  p(0) = 0.45;
-  p(1) = 0.16;
+  p[0] = 0.45;
+  p[1] = 0.16;
   for (unsigned int step = 0; step < 10; ++step)
     {
       std::cout << "step " << step << std::endl;
index 507e0b903bb9011f10a02ba8992aab9aa2a9bf87..752653b4072ac71bad8173b9692388028fce469e 100644 (file)
@@ -288,10 +288,10 @@ create_triangulations(std::vector<Triangulation<2> *> &tria_ptr,
       tria_ptr.push_back(tria);
       GridGenerator::hyper_cube(*tria, 1., 3.);
       Point<2> &v0 = tria->begin_active()->vertex(0);
-      v0(0)        = 0.;
+      v0[0]        = 0.;
       Point<2> &v3 = tria->begin_active()->vertex(3);
-      v3(0)        = 5.;
-      v3(1)        = 4.;
+      v3[0]        = 5.;
+      v3[1]        = 4.;
       exact_areas.push_back(7.);
       show[1][0] = 1;
     }
@@ -308,10 +308,10 @@ create_triangulations(std::vector<Triangulation<2> *> &tria_ptr,
       GridGenerator::hyper_cube(*tria, 1., 5.);
       Point<2> &v2 = tria->begin_active()->vertex(2);
       Point<2> &v3 = tria->begin_active()->vertex(3);
-      v2(0)        = 1.;
-      v2(1)        = 3.;
-      v3(0)        = 3.;
-      v3(1)        = 3.;
+      v2[0]        = 1.;
+      v2[1]        = 3.;
+      v3[0]        = 3.;
+      v3[1]        = 3.;
       tria->set_manifold(1, *boundary1);
       tria->set_manifold(2, *boundary2);
       tria->begin_active()->face(1)->set_manifold_id(1);
@@ -329,10 +329,10 @@ create_triangulations(std::vector<Triangulation<2> *> &tria_ptr,
       tria_ptr.push_back(tria);
       Point<2> p0;
       Point<2> p1;
-      p0(0) = 1.;
-      p0(1) = 2.5;
-      p1(0) = 2.;
-      p1(1) = 4.;
+      p0[0] = 1.;
+      p0[1] = 2.5;
+      p1[0] = 2.;
+      p1[1] = 4.;
       GridGenerator::hyper_rectangle(*tria, p0, p1);
       exact_areas.push_back(1.5);
       show[3][4] = 1;
@@ -347,10 +347,10 @@ create_triangulations(std::vector<Triangulation<2> *> &tria_ptr,
       GridGenerator::hyper_cube(*tria, 0., 1.);
       Point<2> &v2 = tria->begin_active()->vertex(2);
       Point<2> &v3 = tria->begin_active()->vertex(3);
-      v2(0)        = 2.;
-      v2(1)        = 1.;
-      v3(0)        = 0.5;
-      v3(1)        = 1.5;
+      v2[0]        = 2.;
+      v2[1]        = 1.;
+      v3[0]        = 0.5;
+      v3[1]        = 1.5;
       tria->set_manifold(1, *boundary1);
       tria->begin_active()->face(1)->set_manifold_id(1);
       exact_areas.push_back(0.);
@@ -387,9 +387,9 @@ create_triangulations(std::vector<Triangulation<3> *> &tria_ptr,
       tria_ptr.push_back(tria);
       GridGenerator::hyper_cube(*tria, 1., 3.);
       Point<3> &v = tria->begin()->vertex(7);
-      v(0)        = 5.;
-      v(1)        = 4.;
-      v(2)        = 4.5;
+      v[0]        = 5.;
+      v[1]        = 4.;
+      v[2]        = 4.5;
       exact_areas.push_back(12.5);
     }
 
@@ -417,12 +417,12 @@ create_triangulations(std::vector<Triangulation<3> *> &tria_ptr,
       tria_ptr.push_back(tria);
       Point<3> p0;
       Point<3> p1;
-      p0(0) = 1.;
-      p0(1) = 2.5;
-      p0(2) = 3.;
-      p1(0) = 2.;
-      p1(1) = 4.;
-      p1(2) = 6.;
+      p0[0] = 1.;
+      p0[1] = 2.5;
+      p0[2] = 3.;
+      p1[0] = 2.;
+      p1[1] = 4.;
+      p1[2] = 6.;
       GridGenerator::hyper_rectangle(*tria, p0, p1);
       exact_areas.push_back(4.5);
       show[3][4] = 1;
index 5973d928b69a2d0199e48937e72f40a17931fc56..eeb17d45af3864b11d342ffcc53fd561d45c086b 100644 (file)
@@ -47,7 +47,7 @@ show_values(FiniteElement<dim> &fe, const char *name)
   // shift one point of the cell
   // somehow
   if (dim > 1)
-    tr.begin_active()->vertex(dim == 2 ? 3 : 5)(dim - 1) += 1. / std::sqrt(2.);
+    tr.begin_active()->vertex(dim == 2 ? 3 : 5)[dim - 1] += 1. / std::sqrt(2.);
   DoFHandler<dim> dof(tr);
   dof.distribute_dofs(fe);
 
index 4935e211ad54fa37c26f2b07d3787ca49bfc21d1..3a1a019aaff3dcb63aaffec3d299bd97ff6b5e0e 100644 (file)
@@ -67,10 +67,10 @@ void
 ImposedDisplacement<2>::vector_value(const Point<2> &p,
                                      Vector<double> &value) const
 {
-  double radius = 1 + (sqrt(5) - 1) * p(0);
-  double angle  = 0.5 * numbers::PI * (1 - p(1));
-  value(0)      = radius * sin(angle) - p(0);
-  value(1)      = radius * cos(angle) - p(1);
+  double radius = 1 + (sqrt(5) - 1) * p[0];
+  double angle  = 0.5 * numbers::PI * (1 - p[1]);
+  value(0)      = radius * sin(angle) - p[0];
+  value(1)      = radius * cos(angle) - p[1];
 }
 
 
index d1eb06c019bf6b34962064479c913ec0922cb92b..3fcbe5e7e353fb1cee0a8c86b96c4e8f38bad555 100644 (file)
@@ -128,14 +128,14 @@ template <>
 double
 VectorFunction<3>::value(const Point<3> &p, const unsigned int component) const
 {
-  return (1 - p(0) * p(0)) * (1 - p(1) * p(1)) * (1 - p(2) * p(2));
+  return (1 - p[0] * p[0]) * (1 - p[1] * p[1]) * (1 - p[2] * p[2]);
 }
 
 template <>
 double
 VectorFunction<2>::value(const Point<2> &p, const unsigned int component) const
 {
-  return (1 - p(0) * p(0)) * (1 - p(1) * p(1));
+  return (1 - p[0] * p[0]) * (1 - p[1] * p[1]);
 }
 
 template <int dim>
index ff8ee934b19357cf43273894e3505f66c640e766..d8ff34c548c890e3c58c3bca450f539c729ea9a2 100644 (file)
@@ -66,8 +66,8 @@ test2()
       for (unsigned int j = 0; j < 19; ++j)
         {
           /// all points are inside
-          points[19 * i + j](0) = -0.7 + (i + 1) * .07;
-          points[19 * i + j](1) = -0.7 + (j + 1) * .07;
+          points[19 * i + j][0] = -0.7 + (i + 1) * .07;
+          points[19 * i + j][1] = -0.7 + (j + 1) * .07;
         }
   points[95] = p;
   fe_function.value_list(points, m); // <<<< this fails at point[95] but only if
index 21f4acca72e6e1b16772c61acfc75ad04c66b48c..595e62fd9c1ce1f9f320cbe07b1510004805e2b9 100644 (file)
@@ -384,10 +384,10 @@ public:
     double sinval = deformation;
     for (unsigned int d = 0; d < dim; ++d)
       sinval *= std::sin(frequency * dealii::numbers::PI *
-                         (chart_point(d) - left) / (right - left));
+                         (chart_point[d] - left) / (right - left));
     dealii::Point<dim> space_point;
     for (unsigned int d = 0; d < dim; ++d)
-      space_point(d) = chart_point(d) + sinval;
+      space_point[d] = chart_point[d] + sinval;
     return space_point;
   }
 
@@ -397,12 +397,12 @@ public:
     dealii::Point<dim> x = space_point;
     dealii::Point<dim> one;
     for (unsigned int d = 0; d < dim; ++d)
-      one(d) = 1.;
+      one[d] = 1.;
 
     // Newton iteration to solve the nonlinear equation given by the point
     dealii::Tensor<1, dim> sinvals;
     for (unsigned int d = 0; d < dim; ++d)
-      sinvals[d] = std::sin(frequency * dealii::numbers::PI * (x(d) - left) /
+      sinvals[d] = std::sin(frequency * dealii::numbers::PI * (x[d] - left) /
                             (right - left));
 
     double sinval = deformation;
@@ -420,7 +420,7 @@ public:
             double sinval_der = deformation * frequency / (right - left) *
                                 dealii::numbers::PI *
                                 std::cos(frequency * dealii::numbers::PI *
-                                         (x(d) - left) / (right - left));
+                                         (x[d] - left) / (right - left));
             for (unsigned int e = 0; e < dim; ++e)
               if (e != d)
                 sinval_der *= sinvals[e];
@@ -432,7 +432,7 @@ public:
 
         for (unsigned int d = 0; d < dim; ++d)
           sinvals[d] = std::sin(frequency * dealii::numbers::PI *
-                                (x(d) - left) / (right - left));
+                                (x[d] - left) / (right - left));
 
         sinval = deformation;
         for (unsigned int d = 0; d < dim; ++d)
index 74c6f0b2fdedb8829bb97c44fbd95f693db35d33..131b3d071f2a9ab474ac41c5e101c36d385b9814 100644 (file)
@@ -46,10 +46,10 @@ public:
     double sinval = deformation;
     for (unsigned int d = 0; d < dim; ++d)
       sinval *= std::sin(frequency * dealii::numbers::PI *
-                         (chart_point(d) - left) / (right - left));
+                         (chart_point[d] - left) / (right - left));
     dealii::Point<dim> space_point;
     for (unsigned int d = 0; d < dim; ++d)
-      space_point(d) = chart_point(d) + sinval;
+      space_point[d] = chart_point[d] + sinval;
     return space_point;
   }
 
@@ -59,12 +59,12 @@ public:
     dealii::Point<dim> x = space_point;
     dealii::Point<dim> one;
     for (unsigned int d = 0; d < dim; ++d)
-      one(d) = 1.;
+      one[d] = 1.;
 
     // Newton iteration to solve the nonlinear equation given by the point
     dealii::Tensor<1, dim> sinvals;
     for (unsigned int d = 0; d < dim; ++d)
-      sinvals[d] = std::sin(frequency * dealii::numbers::PI * (x(d) - left) /
+      sinvals[d] = std::sin(frequency * dealii::numbers::PI * (x[d] - left) /
                             (right - left));
 
     double sinval = deformation;
@@ -82,7 +82,7 @@ public:
             double sinval_der = deformation * frequency / (right - left) *
                                 dealii::numbers::PI *
                                 std::cos(frequency * dealii::numbers::PI *
-                                         (x(d) - left) / (right - left));
+                                         (x[d] - left) / (right - left));
             for (unsigned int e = 0; e < dim; ++e)
               if (e != d)
                 sinval_der *= sinvals[e];
@@ -94,7 +94,7 @@ public:
 
         for (unsigned int d = 0; d < dim; ++d)
           sinvals[d] = std::sin(frequency * dealii::numbers::PI *
-                                (x(d) - left) / (right - left));
+                                (x[d] - left) / (right - left));
 
         sinval = deformation;
         for (unsigned int d = 0; d < dim; ++d)
index 023495223064059d9332e2afdf6c7d3bb28ba91f..e7dd1de903a1e4addf5cb126c76fc734be192e04 100644 (file)
@@ -47,10 +47,10 @@ public:
     double sinval = deformation;
     for (unsigned int d = 0; d < dim; ++d)
       sinval *= std::sin(frequency * dealii::numbers::PI *
-                         (chart_point(d) - left) / (right - left));
+                         (chart_point[d] - left) / (right - left));
     dealii::Point<dim> space_point;
     for (unsigned int d = 0; d < dim; ++d)
-      space_point(d) = chart_point(d) + sinval;
+      space_point[d] = chart_point[d] + sinval;
     return space_point;
   }
 
@@ -60,12 +60,12 @@ public:
     dealii::Point<dim> x = space_point;
     dealii::Point<dim> one;
     for (unsigned int d = 0; d < dim; ++d)
-      one(d) = 1.;
+      one[d] = 1.;
 
     // Newton iteration to solve the nonlinear equation given by the point
     dealii::Tensor<1, dim> sinvals;
     for (unsigned int d = 0; d < dim; ++d)
-      sinvals[d] = std::sin(frequency * dealii::numbers::PI * (x(d) - left) /
+      sinvals[d] = std::sin(frequency * dealii::numbers::PI * (x[d] - left) /
                             (right - left));
 
     double sinval = deformation;
@@ -83,7 +83,7 @@ public:
             double sinval_der = deformation * frequency / (right - left) *
                                 dealii::numbers::PI *
                                 std::cos(frequency * dealii::numbers::PI *
-                                         (x(d) - left) / (right - left));
+                                         (x[d] - left) / (right - left));
             for (unsigned int e = 0; e < dim; ++e)
               if (e != d)
                 sinval_der *= sinvals[e];
@@ -95,7 +95,7 @@ public:
 
         for (unsigned int d = 0; d < dim; ++d)
           sinvals[d] = std::sin(frequency * dealii::numbers::PI *
-                                (x(d) - left) / (right - left));
+                                (x[d] - left) / (right - left));
 
         sinval = deformation;
         for (unsigned int d = 0; d < dim; ++d)
index d7a53ba9fe762bce9d14ff65e5e340461d05feb1..94ec8f27d8d38f81d6cc7a6e3e66ec735d4cce85 100644 (file)
@@ -494,7 +494,7 @@ namespace StokesClass
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
                   {
-                    p(d) = velocity.quadrature_point(q)(d)[i];
+                    p[d] = velocity.quadrature_point(q)[d][i];
                   }
                 return_value[i] = 2.0 * viscosity_function.value(p);
               }
@@ -628,7 +628,7 @@ namespace StokesClass
               {
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
-                  p(d) = pressure.quadrature_point(q)(d)[i];
+                  p[d] = pressure.quadrature_point(q)[d][i];
                 return_value[i] = 1.0 / viscosity_function.value(p);
               }
             one_over_viscosity(cell, q) = return_value;
@@ -807,7 +807,7 @@ namespace StokesClass
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
                   {
-                    p(d) = velocity.quadrature_point(q)(d)[i];
+                    p[d] = velocity.quadrature_point(q)[d][i];
                   }
                 return_value[i] = 2.0 * viscosity_function.value(p);
               }
@@ -1227,7 +1227,7 @@ namespace StokesClass
               {
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
-                  p(d) = velocity.quadrature_point(q)(d)[i];
+                  p[d] = velocity.quadrature_point(q)[d][i];
 
                 Vector<double> rhs_temp(dim + 1);
                 right_hand_side.vector_value(p, rhs_temp);
index 02ab0ef823211f2d01a0d6fa672d53662bae3866..225a1e4cf32f6025261ebc6f2a8c868ad58fa35a 100644 (file)
@@ -71,7 +71,7 @@ DummyOperator<dim, fe_degree>::operator()(
 
       auto point = gpu_data->get_quadrature_point(cell, q_point);
       dst[pos] =
-        dim == 2 ? point(0) + point(1) : point(0) + point(1) + point(2);
+        dim == 2 ? point[0] + point[1] : point[0] + point[1] + point[2];
     });
 }
 
@@ -166,7 +166,7 @@ test()
               const unsigned int pos =
                 gpu_data_host.local_q_point_id(cell_id, n_q_points_per_cell, i);
               auto         p = gpu_data_host.get_quadrature_point(cell_id, i);
-              const double p_val = dim == 2 ? p(0) + p(1) : p(0) + p(1) + p(2);
+              const double p_val = dim == 2 ? p[0] + p[1] : p[0] + p[1] + p[2];
               AssertThrow(std::abs(coef[pos] - p_val) < 1e-12,
                           ExcInternalError());
             }
index 18263be934fa359abc0d6c07f25a8b67197a5106..1ca1003151164f09209584beb3edd62022450f84 100644 (file)
@@ -64,7 +64,7 @@ test()
           if (!vertex_moved[global_vertex_no] &&
               locally_owned_vertices[global_vertex_no])
             {
-              cell->vertex(vertex_no)(0) += 1.e-1;
+              cell->vertex(vertex_no)[0] += 1.e-1;
               vertex_moved[global_vertex_no] = true;
             }
         }
@@ -77,7 +77,7 @@ test()
       for (const unsigned int vertex_no : GeometryInfo<dim>::vertex_indices())
         {
           Point<dim> point = cell->vertex(vertex_no);
-          point(0) -= 1.e-1;
+          point[0] -= 1.e-1;
           non_artificial_vertices_new[cell->vertex_index(vertex_no)] = point;
         }
 
index cb7b79f373ff7e1c77f2a8dd0eea342140207648..688127002ba5f56fc701acae825903f377d9f6a6 100644 (file)
@@ -47,7 +47,7 @@ test1(const bool keep_boundary)
         const Point<dim> &p            = cell->center();
         bool              all_positive = true;
         for (unsigned int d = 0; d < dim; ++d)
-          if (p(d) <= 0.)
+          if (p[d] <= 0.)
             all_positive = false;
         if (all_positive)
           cell->set_refine_flag();
index 1f6ddf3afe10a4d719cf752b0144b1d6fccbb83a..92e138bae499f33bc040a623f7695728415c28a1 100644 (file)
@@ -59,7 +59,7 @@ public:
   {
     double return_value = 0.;
     for (unsigned int d = 0; d < dim; ++d)
-      return_value += std::pow(std::abs(.5 - p(d)), degree);
+      return_value += std::pow(std::abs(.5 - p[d]), degree);
 
     return return_value;
   }
index 86a8718145855217dff9cc377a68459cf8d4145a..4f59d415bd554a3e1fd526b0750c2acdf0cc345d 100644 (file)
@@ -64,7 +64,7 @@ test()
   for (unsigned int n_ref = 0; n_ref < 2; ++n_ref)
     {
       for (const auto &cell : triangulation.active_cell_iterators())
-        if (cell->is_locally_owned() && cell->center()(1) < 0.5)
+        if (cell->is_locally_owned() && cell->center()[1] < 0.5)
           cell->set_refine_flag();
 
       triangulation.prepare_coarsening_and_refinement();
@@ -85,7 +85,7 @@ test()
   for (const auto &cell : dof_handler.active_cell_iterators() |
                             IteratorFilters::LocallyOwnedCell())
     {
-      if (cell->center()(0) < 0.5)
+      if (cell->center()[0] < 0.5)
         cell->set_active_fe_index(0);
       else
         cell->set_active_fe_index(1);
index 9a3eeb84f49d63d5a081cc89393b9f6fb294c468..a2cf0612e8aa632a8f6f87355f37f9e07b474297 100644 (file)
@@ -53,7 +53,7 @@ public:
   double
   value(const Point<dim> &p, const unsigned int) const
   {
-    return 1 + p(0) * p(0);
+    return 1 + p[0] * p[0];
   }
 };
 
index 442898491835c40d34b681b4c8c83a86933e4c2f..88e4b65a7dc7f2923d21e6783c4ffc8241fc1347 100644 (file)
@@ -39,9 +39,9 @@ test()
   for (const auto &cell : tria.cell_iterators())
     for (const unsigned int face_index : GeometryInfo<dim>::face_indices())
       {
-        if (std::abs(cell->face(face_index)->center()(face_index / 2)) < 1e-12)
+        if (std::abs(cell->face(face_index)->center()[face_index / 2]) < 1e-12)
           cell->face(face_index)->set_all_boundary_ids(face_index);
-        if (std::abs(cell->face(face_index)->center()(face_index / 2) - 1.) <
+        if (std::abs(cell->face(face_index)->center()[face_index / 2] - 1.) <
             1e-12)
           cell->face(face_index)->set_all_boundary_ids(face_index);
       }
index 20b922f16a13b5eb3aa1fadcc27b3811316be866..94588d036215d515abf1f45cdd646ec181dc89e9 100644 (file)
@@ -76,7 +76,7 @@ double
 TemperatureInitialValues<dim>::value(const Point<dim> &p,
                                      const unsigned int) const
 {
-  return p(0) * T1 + p(1) * (T0 - T1); // simple
+  return p[0] * T1 + p[1] * (T0 - T1); // simple
 }
 
 
index b7703fdd0a2f103df074dd3633759bb9e02cd624..5cf98229d9129d9937aa8a7ba031a6df8c017a36 100644 (file)
@@ -76,7 +76,7 @@ double
 TemperatureInitialValues<dim>::value(const Point<dim> &p,
                                      const unsigned int) const
 {
-  return p(0) * T1 + p(1) * (T0 - T1); // simple
+  return p[0] * T1 + p[1] * (T0 - T1); // simple
 }
 
 
index 9ca2b2440ae69af34421e21f1d0d22165b11d880..cfdd06b3f707a90496f11a28aa9ddd43aef3df4a 100644 (file)
@@ -375,11 +375,11 @@ namespace Step40
         Vector<PetscScalar> value2(1);
 
         Point<2> point1;
-        point1(0) = 1. * i / n_points + eps;
-        point1(1) = 0.;
+        point1[0] = 1. * i / n_points + eps;
+        point1[1] = 0.;
         Point<2> point2;
-        point2(0) = 1. * i / n_points + eps;
-        point2(1) = 1.;
+        point2[0] = 1. * i / n_points + eps;
+        point2[1] = 1.;
 
         get_point_value(point1, 0, value1);
         get_point_value(point2, 0, value2);
@@ -424,21 +424,21 @@ namespace Step40
           Vector<PetscScalar> value4(1);
 
           Point<3> point1;
-          point1(0) = 1. * i / n_points + eps;
-          point1(1) = 1. * j / n_points + eps;
-          point1(2) = 0;
+          point1[0] = 1. * i / n_points + eps;
+          point1[1] = 1. * j / n_points + eps;
+          point1[2] = 0;
           Point<3> point2;
-          point2(0) = 1. * i / n_points + eps;
-          point2(1) = 1. * j / n_points + eps;
-          point2(2) = 1.;
+          point2[0] = 1. * i / n_points + eps;
+          point2[1] = 1. * j / n_points + eps;
+          point2[2] = 1.;
           Point<3> point3;
-          point3(0) = 1. * i / n_points + eps;
-          point3(1) = 0.;
-          point3(2) = 1. * j / n_points + eps;
+          point3[0] = 1. * i / n_points + eps;
+          point3[1] = 0.;
+          point3[2] = 1. * j / n_points + eps;
           Point<3> point4;
-          point4(0) = 1. * i / n_points + eps;
-          point4(1) = 1.;
-          point4(2) = 1. * j / n_points + eps;
+          point4[0] = 1. * i / n_points + eps;
+          point4[1] = 1.;
+          point4[2] = 1. * j / n_points + eps;
 
           get_point_value(point1, 0, value1);
           get_point_value(point2, 0, value2);
@@ -528,7 +528,7 @@ namespace Step40
             Point<dim> p1;
             Point<dim> p2;
             for (unsigned int i = 0; i < dim; ++i)
-              p2(i) = 1.0;
+              p2[i] = 1.0;
 
             GridGenerator::subdivided_hyper_rectangle(
               triangulation, reps, p1, p2, true);
index f07e865ca79852a7fbdef51cc26d075dec7695d6..87c71fbdff5a3cdf916fee4d977e94bf28ea8960 100644 (file)
@@ -642,11 +642,11 @@ namespace Step22
         Vector<double> value2(3);
 
         Point<2> point1;
-        point1(0) = 0;
-        point1(1) = .5 * (1. + 1. * i / n_points + eps);
+        point1[0] = 0;
+        point1[1] = .5 * (1. + 1. * i / n_points + eps);
         Point<2> point2;
-        point2(0) = .5 * (1. + 1. * i / n_points + eps);
-        point2(1) = 0.;
+        point2[0] = .5 * (1. + 1. * i / n_points + eps);
+        point2[1] = 0.;
 
         get_point_value(point1, 0, value1);
         get_point_value(point2, 0, value2);
index 0a46d6fc7bedfb54485b404aee3a016015920031..cd28e4d59078f94584b4ca62fffe5049bd620190 100644 (file)
@@ -573,7 +573,7 @@ namespace Step22
                       fe_face_values.get_quadrature_points();
                     for (unsigned int i = 0; i < tmp_points.size(); ++i)
                       for (unsigned int c = 0; c < dim; ++c)
-                        local_quad_points_first.push_back(tmp_points[i](c));
+                        local_quad_points_first.push_back(tmp_points[i][c]);
                   }
                 else if (face->boundary_id() == 4)
                   {
@@ -582,7 +582,7 @@ namespace Step22
                       fe_face_values.get_quadrature_points();
                     for (unsigned int i = 0; i < tmp_points.size(); ++i)
                       for (unsigned int c = 0; c < dim; ++c)
-                        local_quad_points_second.push_back(tmp_points[i](c));
+                        local_quad_points_second.push_back(tmp_points[i][c]);
                   }
               }
           }
@@ -660,12 +660,12 @@ namespace Step22
           for (unsigned int c = 0; c < dim; ++c)
             {
               vector_point_1(c) = global_quad_points_first[i + c];
-              point_1(c)        = vector_point_1(c);
+              point_1[c]        = vector_point_1(c);
             }
           Vector<double> vector_point_2(dim);
           rot_matrix.Tvmult(vector_point_2, vector_point_1);
           for (unsigned int c = 0; c < dim; ++c)
-            point_2(c) = vector_point_2(c) + offset[c];
+            point_2[c] = vector_point_2(c) + offset[c];
 
           get_point_value(point_1, 0, value_1);
           get_point_value(point_2, 0, value_2);
@@ -712,14 +712,14 @@ namespace Step22
           for (unsigned int c = 0; c < dim; ++c)
             {
               vector_point_1(c) = global_quad_points_second[i + c];
-              point_1(c)        = vector_point_1(c);
+              point_1[c]        = vector_point_1(c);
             }
           Vector<double> vector_point_2(dim);
           for (unsigned int c = 0; c < dim; ++c)
             vector_point_1(c) -= offset[c];
           rot_matrix.vmult(vector_point_2, vector_point_1);
           for (unsigned int c = 0; c < dim; ++c)
-            point_2(c) = vector_point_2(c);
+            point_2[c] = vector_point_2(c);
 
           get_point_value(point_1, 0, value_1);
           get_point_value(point_2, 0, value_2);
index e8855528e878f9194a61e7475a4e5639e378e958..d1f2385d29085c273a1ef8664948046bf1629806 100644 (file)
@@ -50,9 +50,9 @@ set_periodicity(parallel::distributed::Triangulation<dim> &triangulation,
   // Look for the two outermost faces:
   for (const unsigned int j : GeometryInfo<dim>::face_indices())
     {
-      if (cell_1->face(j)->center()(dim - 1) > 2.9)
+      if (cell_1->face(j)->center()[dim - 1] > 2.9)
         face_1 = cell_1->face(j);
-      if (cell_2->face(j)->center()(dim - 1) < -2.9)
+      if (cell_2->face(j)->center()[dim - 1] < -2.9)
         face_2 = cell_2->face(j);
     }
   face_1->set_boundary_id(42);
@@ -255,7 +255,7 @@ check(const unsigned int orientation, bool reverse)
   // now refine and check if the neighboring faces are correctly found
   typename Triangulation<dim>::active_cell_iterator cell;
   for (cell = triangulation.begin_active(); cell != triangulation.end(); ++cell)
-    if (cell->is_locally_owned() && cell->center()(dim - 1) > 0)
+    if (cell->is_locally_owned() && cell->center()[dim - 1] > 0)
       cell->set_refine_flag();
 
   triangulation.execute_coarsening_and_refinement();
@@ -284,15 +284,15 @@ check(const unsigned int orientation, bool reverse)
       const unsigned int face_no_2     = it->second.first.second;
       const Point<dim>   face_center_1 = cell_1->face(face_no_1)->center();
       const Point<dim>   face_center_2 = cell_2->face(face_no_2)->center();
-      Assert(std::min(std::abs(face_center_1(dim - 1) - 3.),
-                      std::abs(face_center_1(dim - 1) + 3.)) < 1.e-8,
+      Assert(std::min(std::abs(face_center_1[dim - 1] - 3.),
+                      std::abs(face_center_1[dim - 1] + 3.)) < 1.e-8,
              ExcInternalError());
-      Assert(std::min(std::abs(face_center_2(dim - 1) - 3.),
-                      std::abs(face_center_2(dim - 1) + 3.)) < 1.e-8,
+      Assert(std::min(std::abs(face_center_2[dim - 1] - 3.),
+                      std::abs(face_center_2[dim - 1] + 3.)) < 1.e-8,
              ExcInternalError());
       if (cell_1->level() == cell_2->level())
         for (unsigned int c = 0; c < dim - 1; ++c)
-          if (std::abs(face_center_1(c) - face_center_2(c)) > 1.e-8)
+          if (std::abs(face_center_1[c] - face_center_2[c]) > 1.e-8)
             {
               std::cout << "face_center_1: " << face_center_1 << std::endl;
               std::cout << "face_center_2: " << face_center_2 << std::endl;
index 5a2ce6abdd3d6c6e335dcc0274077250eb81503f..381497b1a40b084313ccdc6535ad6612caa8741b 100644 (file)
@@ -494,7 +494,7 @@ namespace StokesClass
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
                   {
-                    p(d) = velocity.quadrature_point(q)(d)[i];
+                    p[d] = velocity.quadrature_point(q)[d][i];
                   }
                 return_value[i] = 2.0 * viscosity_function.value(p);
               }
@@ -628,7 +628,7 @@ namespace StokesClass
               {
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
-                  p(d) = pressure.quadrature_point(q)(d)[i];
+                  p[d] = pressure.quadrature_point(q)[d][i];
                 return_value[i] = 1.0 / viscosity_function.value(p);
               }
             one_over_viscosity(cell, q) = return_value;
@@ -807,7 +807,7 @@ namespace StokesClass
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
                   {
-                    p(d) = velocity.quadrature_point(q)(d)[i];
+                    p[d] = velocity.quadrature_point(q)[d][i];
                   }
                 return_value[i] = 2.0 * viscosity_function.value(p);
               }
@@ -1227,7 +1227,7 @@ namespace StokesClass
               {
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
-                  p(d) = velocity.quadrature_point(q)(d)[i];
+                  p[d] = velocity.quadrature_point(q)[d][i];
 
                 Vector<double> rhs_temp(dim + 1);
                 right_hand_side.vector_value(p, rhs_temp);
index 208678eeea207eaae7756730dcf8ff5641b60d41..1cb64af8bb93e6953576c0f5b2678edbae9184f4 100644 (file)
@@ -59,7 +59,7 @@ check()
   mg_dof_handler.distribute_dofs(fe);
   mg_dof_handler.distribute_mg_dofs();
   Point<dim> a;
-  a(0) = 1;
+  a[0] = 1;
   for (unsigned int level = 0; level < tria.n_levels(); ++level)
     DoFRenumbering::downstream(mg_dof_handler, level, a);
 }
index 2c9a925ea0f5c8323733a4e52a5c469358cbf022..720ff11ab20672eecceef0c24a2cf405fa5c5718 100644 (file)
@@ -70,7 +70,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index 8dd06ed53d7eb14da4eaae23d466fc34edb665c2..e6e679c38db1d79e82f0d950f96dfa7d4bd881ee 100644 (file)
@@ -98,7 +98,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index 3ffd7945f5e1a92f90facd6be2aa9fbd3779daca..7db14d76c71588a9f280c569ddf5c90effcc72df 100644 (file)
@@ -98,7 +98,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index a5ff175a8d97579dc0053b12278debe31f216f05..385624fb5a55ab2089bbb69ee02ab12154414b85 100644 (file)
@@ -99,7 +99,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index aebb7b5549f598fed29f01175361cb223c4dcaff..21eb98b38ae2109ffa8a8fe24959a40d770e1245 100644 (file)
@@ -98,7 +98,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index 5dd3a97f37d145602ab96fdbfaf924c860197e90..ae0b866700659a57da7264ba67e930d8dc49dae8 100644 (file)
@@ -100,7 +100,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index a87a78f9babbece6875e5624e470a70d2fca085f..1eee7f92fd765b11b76ca781911257cb3b2c765b 100644 (file)
@@ -98,7 +98,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index 6376cd73c43b3da764e7f93343c80374955c136d..ef0ff3adc67b0552b313a0b9808f82ae07b9491b 100644 (file)
@@ -100,7 +100,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index 1b4607dd724418d9fdc944d315940d9afea73aac..917f086eb2cc8fba94c3035a7ca5aab288af50f8 100644 (file)
@@ -99,7 +99,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index df0c6db9e4d28670f977abb842ae35797cf92afe..9b6f6543d2b8727d9c602b951ae60321533f362a 100644 (file)
@@ -54,7 +54,7 @@ refine_mesh(Triangulation<dim> &triangulation)
        ++cell)
     {
       const Point<dim> p        = cell->center();
-      bool             positive = p(0) > 0;
+      bool             positive = p[0] > 0;
       if (positive)
         {
           cell->set_refine_flag();
index dd1db31cdaf910cf4eb16eb90255b1e8b90ccded..2efab5229d54c017640526b44ee8cc1a2b45273f 100644 (file)
@@ -79,7 +79,7 @@ test_plane_cuts_through_center()
 
   Point<dim> center;
   for (int d = 0; d < dim; ++d)
-    center(d) = .5;
+    center[d] = .5;
 
   // For each coordinate direction set up a plane through the center.
   for (int plane_direction = 0; plane_direction < dim; ++plane_direction)
index 6c10913f507c45cc9951eb9ae8c9c719549a4987..63daa82ddab80a7fa3144e2eb2c0f6fed7c4c2c6 100644 (file)
@@ -98,7 +98,7 @@ Test<dim>::setup_discrete_level_set()
   Tensor<1, dim> plane_normal;
   for (unsigned int i = 1; i < dim; i++)
     {
-      point_on_zero_contour(i) = 0.25;
+      point_on_zero_contour[i] = 0.25;
       plane_normal[i]          = 1;
     }
 
index 63a29a2de1b45b7015fed7dceab8ee98c48eec88..98d58d5f7de4fa2e536cb5e5afb892b246a3dee5 100644 (file)
@@ -92,7 +92,7 @@ test_vertical_cuts_through_center()
   Point<dim> center;
   for (int d = 0; d < dim; ++d)
     {
-      center(d) = .5;
+      center[d] = .5;
     }
   for (int direction = 0; direction < dim; ++direction)
     {
@@ -174,7 +174,7 @@ test_epsilon_cut_at_bottom_corner()
   for (int i = 0; i < dim; ++i)
     {
       normal[i] = 1;
-      center(i) += epsilon;
+      center[i] += epsilon;
     }
   const Functions::SignedDistance::Plane<dim> level_set(center, normal);
 
@@ -229,7 +229,7 @@ public:
     : Functions::ConstantFunction<dim>(1)
   {
     for (int d = 0; d < dim; ++d)
-      unit_box_center(d) = .5;
+      unit_box_center[d] = .5;
   }
 
   SymmetricTensor<2, dim>
index 718e9b15f55a6d4e96a69e56b12e98cd7ae8b392..840e31a26786bc0d4e1b49430a38f27a7acafde7 100644 (file)
@@ -102,7 +102,7 @@ public:
   double
   value(const Point<1> &point, const unsigned int component = 0) const override
   {
-    return C * std::pow(point(0) - x_0, 2) + y_0;
+    return C * std::pow(point[0] - x_0, 2) + y_0;
   };
 
   Tensor<1, 1>
@@ -110,7 +110,7 @@ public:
            const unsigned int component = 0) const override
   {
     Tensor<1, 1> grad;
-    grad[0] = 2 * C * (point(0) - x_0);
+    grad[0] = 2 * C * (point[0] - x_0);
 
     return grad;
   };
index 3f2d3a1c4d9ada788910a8a5f679f607c94a5b6b..329ddd3efac1b2c6d15ec1834041e71cb95b9117 100644 (file)
@@ -48,7 +48,7 @@ create_and_output_quadrature_for_each_direction()
   Point<dim - 1> point;
   for (int i = 0; i < dim - 1; ++i)
     {
-      point(i) = 10 * (i + 1);
+      point[i] = 10 * (i + 1);
     }
   // Both points in the 1D-quadrature have weight 1/2 so
   // this should also be the weight of the points in the final
index 5d6ec01fe45ca73eae32a00229ed6972e0c314a0..d4550ce3650de2514e546d5ac84b20e8849cab01 100644 (file)
@@ -46,7 +46,7 @@ check()
   Point<dim> p(tria.begin_active()->center());
 
   for (unsigned int i = 0; i < dim; ++i)
-    orientation(i) = i;
+    orientation[i] = i;
 
   Vector<double> vector(dof.n_dofs());
 
index 6287062e4d385c92f4b9ab474d7e98747c7985df..fc622309a6d752ef07b54344d63227ff14ea2d87 100644 (file)
@@ -52,7 +52,7 @@ check()
   Point<dim> p(tria.begin_active()->center());
 
   for (unsigned int i = 0; i < dim; ++i)
-    orientation(i) = i;
+    orientation[i] = i;
 
   Vector<double> vector(dof.n_dofs());
 
index f0f3e956cb7722218627418351a06dfc465b706f..7d39ee9146dabbfd017318ae758e3cf3f9962257 100644 (file)
@@ -43,7 +43,7 @@ public:
   virtual double
   value(const Point<spacedim> &p, const unsigned int component = 0) const
   {
-    return p(0) * p(0);
+    return p[0] * p[0];
   }
 };
 
index 90e823d63c8f8a4b4b660756096689d17b20269e..22e979fbf30552278e611779fbed4bf9af18f252 100644 (file)
@@ -45,7 +45,7 @@ public:
   virtual double
   value(const Point<spacedim> &p, const unsigned int component = 0) const
   {
-    return p(0) * p(0);
+    return p[0] * p[0];
   }
 };
 
index 8dbac5e982c021310d93c4ca986c037c5560271f..63c9b68d7868fd4487acda92520657461fe98261 100644 (file)
@@ -72,8 +72,8 @@ colorize_sixty_deg_hyper_shell(Triangulation<3> &tria,
           continue;
 
         double radius = cell->face(f)->center().norm() - center.norm();
-        if (std::fabs(cell->face(f)->center()(2) -
-                      sqrt(3.) * cell->face(f)->center()(0)) <
+        if (std::fabs(cell->face(f)->center()[2] -
+                      sqrt(3.) * cell->face(f)->center()[0]) <
             eps) // z = sqrt(3)x set boundary 2
           {
             cell->face(f)->set_boundary_id(2);
@@ -83,8 +83,8 @@ colorize_sixty_deg_hyper_shell(Triangulation<3> &tria,
                               cell->face(f)->line(j)->vertex(1).norm()) > eps)
                   cell->face(f)->line(j)->set_boundary_id(2);
           }
-        else if (std::fabs(cell->face(f)->center()(2) +
-                           sqrt(3.) * cell->face(f)->center()(0)) <
+        else if (std::fabs(cell->face(f)->center()[2] +
+                           sqrt(3.) * cell->face(f)->center()[0]) <
                  eps) // z = -sqrt(3)x set boundary 3
           {
             cell->face(f)->set_boundary_id(3);
@@ -94,8 +94,8 @@ colorize_sixty_deg_hyper_shell(Triangulation<3> &tria,
                               cell->face(f)->line(j)->vertex(1).norm()) > eps)
                   cell->face(f)->line(j)->set_boundary_id(3);
           }
-        else if (std::fabs(cell->face(f)->center()(2) -
-                           sqrt(3.) * cell->face(f)->center()(1)) <
+        else if (std::fabs(cell->face(f)->center()[2] -
+                           sqrt(3.) * cell->face(f)->center()[1]) <
                  eps) // z = sqrt(3)y set boundary 4
           {
             cell->face(f)->set_boundary_id(4);
@@ -105,8 +105,8 @@ colorize_sixty_deg_hyper_shell(Triangulation<3> &tria,
                               cell->face(f)->line(j)->vertex(1).norm()) > eps)
                   cell->face(f)->line(j)->set_boundary_id(4);
           }
-        else if (std::fabs(cell->face(f)->center()(2) +
-                           sqrt(3.) * cell->face(f)->center()(1)) <
+        else if (std::fabs(cell->face(f)->center()[2] +
+                           sqrt(3.) * cell->face(f)->center()[1]) <
                  eps) // z = -sqrt(3)y set boundary 5
           {
             cell->face(f)->set_boundary_id(5);
index c755b20b60534e226e441227df481cf682cf12e5..72e41baf86c1fbb821d5fce6727d316bd46107f0 100644 (file)
@@ -66,30 +66,30 @@ run()
               {
                 if (cell->face(face)->at_boundary())
                   {
-                    if ((std::fabs(cell->face(face)->center()(0)) < 0.1) &&
-                        (std::fabs(cell->face(face)->center()(dim - 1)) <
+                    if ((std::fabs(cell->face(face)->center()[0]) < 0.1) &&
+                        (std::fabs(cell->face(face)->center()[dim - 1]) <
                          1e-12))
                       {
                         cell->face(face)->set_boundary_id(1);
                       }
 
-                    if ((std::fabs(cell->face(face)->center()(0)) < 1e-12) &&
-                        (std::fabs(cell->face(face)->center()(dim - 1)) < 0.1))
+                    if ((std::fabs(cell->face(face)->center()[0]) < 1e-12) &&
+                        (std::fabs(cell->face(face)->center()[dim - 1]) < 0.1))
                       {
                         cell->face(face)->set_boundary_id(1);
                       }
 
-                    if ((std::fabs(1.0 - cell->face(face)->center()(0)) <
+                    if ((std::fabs(1.0 - cell->face(face)->center()[0]) <
                          0.1) &&
-                        (std::fabs(1.0 - cell->face(face)->center()(dim - 1)) <
+                        (std::fabs(1.0 - cell->face(face)->center()[dim - 1]) <
                          1e-12))
                       {
                         cell->face(face)->set_boundary_id(2);
                       }
 
-                    if ((std::fabs(1.0 - cell->face(face)->center()(0)) <
+                    if ((std::fabs(1.0 - cell->face(face)->center()[0]) <
                          1e-12) &&
-                        (std::fabs(1.0 - cell->face(face)->center()(dim - 1)) <
+                        (std::fabs(1.0 - cell->face(face)->center()[dim - 1]) <
                          0.1))
                       {
                         cell->face(face)->set_boundary_id(2);
@@ -97,35 +97,35 @@ run()
 
                     // no normal flux boundary
 
-                    if ((std::fabs(cell->face(face)->center()(0)) >= 0.1 &&
-                         std::fabs(cell->face(face)->center()(0)) <= 1.0) &&
-                        (std::fabs(cell->face(face)->center()(dim - 1)) <
+                    if ((std::fabs(cell->face(face)->center()[0]) >= 0.1 &&
+                         std::fabs(cell->face(face)->center()[0]) <= 1.0) &&
+                        (std::fabs(cell->face(face)->center()[dim - 1]) <
                          1e-12))
                       {
                         cell->face(face)->set_boundary_id(3);
                       }
 
-                    if ((std::fabs(cell->face(face)->center()(0)) >= 0.0 &&
-                         std::fabs(cell->face(face)->center()(0)) <= 0.9) &&
-                        (std::fabs(1.0 - cell->face(face)->center()(dim - 1)) <
+                    if ((std::fabs(cell->face(face)->center()[0]) >= 0.0 &&
+                         std::fabs(cell->face(face)->center()[0]) <= 0.9) &&
+                        (std::fabs(1.0 - cell->face(face)->center()[dim - 1]) <
                          1e-12))
                       {
                         cell->face(face)->set_boundary_id(5);
                       }
 
-                    if ((std::fabs(1.0 - cell->face(face)->center()(0)) <
+                    if ((std::fabs(1.0 - cell->face(face)->center()[0]) <
                          1e-12) &&
-                        (std::fabs(cell->face(face)->center()(dim - 1)) >=
+                        (std::fabs(cell->face(face)->center()[dim - 1]) >=
                            0.0 &&
-                         std::fabs(cell->face(face)->center()(dim - 1)) <= 0.9))
+                         std::fabs(cell->face(face)->center()[dim - 1]) <= 0.9))
                       {
                         cell->face(face)->set_boundary_id(4);
                       }
 
-                    if ((std::fabs(cell->face(face)->center()(0)) < 1e-12) &&
-                        (std::fabs(cell->face(face)->center()(dim - 1)) >=
+                    if ((std::fabs(cell->face(face)->center()[0]) < 1e-12) &&
+                        (std::fabs(cell->face(face)->center()[dim - 1]) >=
                            0.1 &&
-                         std::fabs(cell->face(face)->center()(dim - 1)) <= 1.0))
+                         std::fabs(cell->face(face)->center()[dim - 1]) <= 1.0))
                       {
                         cell->face(face)->set_boundary_id(6);
                       }
index 9784b7a8fbc3af42f8b07e5d0cf3ecc2aba0a4ac..c5fdc721d0d207e83d219a446f73f411806c6a33 100644 (file)
@@ -495,7 +495,7 @@ namespace StokesClass
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
                   {
-                    p(d) = velocity.quadrature_point(q)(d)[i];
+                    p[d] = velocity.quadrature_point(q)[d][i];
                   }
                 return_value[i] = 2.0 * viscosity_function.value(p);
               }
@@ -629,7 +629,7 @@ namespace StokesClass
               {
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
-                  p(d) = pressure.quadrature_point(q)(d)[i];
+                  p[d] = pressure.quadrature_point(q)[d][i];
                 return_value[i] = 1.0 / viscosity_function.value(p);
               }
             one_over_viscosity(cell, q) = return_value;
@@ -809,7 +809,7 @@ namespace StokesClass
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
                   {
-                    p(d) = velocity.quadrature_point(q)(d)[i];
+                    p[d] = velocity.quadrature_point(q)[d][i];
                   }
                 return_value[i] = 2.0 * viscosity_function.value(p);
               }
@@ -1251,7 +1251,7 @@ namespace StokesClass
               {
                 Point<dim> p;
                 for (unsigned int d = 0; d < dim; ++d)
-                  p(d) = velocity.quadrature_point(q)(d)[i];
+                  p[d] = velocity.quadrature_point(q)[d][i];
 
                 Vector<double> rhs_temp(dim + 1);
                 right_hand_side.vector_value(p, rhs_temp);
index d507c1245a7f0e204c02bab5f61ef6eaf818d0dd..c5da66480f183a0c82a874e4ac9558996d4bd326 100644 (file)
@@ -137,7 +137,7 @@ TestPointValueHistory<dim>::run()
                  ++q_point)
               {
                 cell_pole(dof) += (fe_values.shape_value(dof, q_point) *
-                                   dof_locations[q_point](dof_component % dim));
+                                   dof_locations[q_point][dof_component % dim]);
               }
             solution(local_dof_indices[dof]) = 1; // start all solutions at 1
             poles(local_dof_indices[dof]) -= cell_pole(dof);
index 30d7e018324a91ce69fe3642bf29ce770cf41d1a..f467725a8f12e155764149bbc9f56f1c40393c96 100644 (file)
@@ -237,7 +237,7 @@ TestPointValueHistory<dim>::run()
               finite_element.system_to_component_index(dof).first;
 
             poles(local_dof_indices[dof]) =
-              -dof_locations[dof](dof_component % dim);
+              -dof_locations[dof][dof_component % dim];
 
             if (dof_component == dim) // components start numbering at 0
               poles(local_dof_indices[dof]) =
index 01ae1361f0d7a43e22ddf0d14b9b8e52e1decf62..e845f77d764d73fc60df7acee274b62bdcf15c6a 100644 (file)
@@ -203,7 +203,7 @@ TestPointValueHistory<dim>::run()
             // simplifying the remaining lines
 
             poles(local_dof_indices[dof]) =
-              -dof_locations[dof](dof_component % dim);
+              -dof_locations[dof][dof_component % dim];
 
             if (dof_component == dim) // components start numbering at 0
               poles(local_dof_indices[dof]) =
index 9772a1013d27cddbc11385f82594b86ba095d0a5..f81a68bafbf5271d586042a18f43aaf2f35057f7 100644 (file)
@@ -70,7 +70,7 @@ TestFunction<dim>::vector_value_list(const std::vector<Point<dim>> &points,
       if (degree < 2)
         {
           for (unsigned int d = 0; d < dim; ++d)
-            values[k](d) = points[k](d) - d;
+            values[k](d) = points[k][d] - d;
         }
       else
         {
@@ -82,7 +82,7 @@ TestFunction<dim>::vector_value_list(const std::vector<Point<dim>> &points,
             {
               Point<dim> p = points[k];
               for (unsigned int dd = 0; dd < dim; ++dd)
-                p(dd) -= d;
+                p[dd] -= d;
               const double r2 = p.square();
               values[k](d)    = std::pow(r2, (int)degree / 2);
             }
index c3f1c99e15fb79cf34175cfb253f4b71e64fb485..324aa3801b8de0b7f8b3198c9a35db5ce0ed230a 100644 (file)
@@ -68,7 +68,7 @@ public:
   ComplexNumber
   value(const Position &x, const unsigned int) const
   {
-    return x(0) + x(1) - ComplexNumber(0.2, 0.7) * x(2);
+    return x[0] + x[1] - ComplexNumber(0.2, 0.7) * x[2];
   }
 };
 
index a1c1d465edbd1a513bf29df8f833a7431510ab0a..77f17778c7ff4ca5b2ef9bd824c473df8fd003d9 100644 (file)
@@ -43,8 +43,8 @@ public:
   operator()(const Point<spacedim> p) const
   {
     Point<spacedim> q;
-    q[0] = std::cos(angle) * p(0) - std::sin(angle) * p(1);
-    q[1] = std::sin(angle) * p(0) + std::cos(angle) * p(1);
+    q[0] = std::cos(angle) * p[0] - std::sin(angle) * p[1];
+    q[1] = std::sin(angle) * p[0] + std::cos(angle) * p[1];
     for (unsigned d = 2; d < spacedim; ++d)
       q[d] = p[d];
     return q;
index 59f762ed889c2e08ee79fd5391fb8d0daa7e74cd..00a38c61dbdc5bfb60be8c7f993b546cd1f181d4 100644 (file)
@@ -43,8 +43,8 @@ public:
   operator()(const Point<spacedim> p) const
   {
     Point<spacedim> q;
-    q[0] = std::cos(angle) * p(0) - std::sin(angle) * p(1);
-    q[1] = std::sin(angle) * p(0) + std::cos(angle) * p(1);
+    q[0] = std::cos(angle) * p[0] - std::sin(angle) * p[1];
+    q[1] = std::sin(angle) * p[0] + std::cos(angle) * p[1];
     for (unsigned d = 2; d < spacedim; ++d)
       q[d] = p[d];
     return q;
index 0b3f85912d3e51a85a7b1c3ad54bd162995dd3bc..ee2ec2548e4eb3567edc0da40b73d9d77a82687c 100644 (file)
@@ -50,8 +50,8 @@ test()
 
     for (unsigned int i = 0; i < dim; ++i)
       {
-        position[0](i) = 0.125;
-        position[1](i) = 0.525;
+        position[0][i] = 0.125;
+        position[1][i] = 0.525;
       }
 
     Particles::Particle<dim, spacedim> particle1(position[0],
index ccd248169a82072e4a9a581944a31bbc4566cd51..4857f2d8a9cd379cab22a5199a158680b29d187e 100644 (file)
@@ -54,7 +54,7 @@ test()
 
     for (unsigned int i = 0; i < dim; ++i)
       {
-        position[0](i) = 0.125;
+        position[0][i] = 0.125;
       }
 
     for (unsigned int i = 0; i < spacedim; ++i)
index a5dbe169b70c25f84c7964504f1b187b8a5b58ce..5d1c749660a4a06f313f19e92d188be40c260f32 100644 (file)
@@ -49,10 +49,10 @@ test()
 
     if (Utilities::MPI::this_mpi_process(tr.get_communicator()) == 0)
       for (unsigned int i = 0; i < dim; ++i)
-        position(i) = 0.475;
+        position[i] = 0.475;
     else
       for (unsigned int i = 0; i < dim; ++i)
-        position(i) = 0.525;
+        position[i] = 0.525;
 
     Particles::Particle<dim, spacedim> particle(
       position,
index 263ba980ffa9e9c4e360a3cb33a8334f69689b42..4d191e595f8e078d5d1fac8936eb4017711f6754 100644 (file)
@@ -46,7 +46,7 @@ test()
     std::vector<Point<dim>> particle_reference_locations(1, Point<dim>());
 
     for (unsigned int i = 0; i < dim; ++i)
-      particle_reference_locations[0](i) = 0.5;
+      particle_reference_locations[0][i] = 0.5;
 
     Particles::Generators::regular_reference_locations(
       tr, particle_reference_locations, particle_handler);
index c0eddef0a8f4e2c90e43e0714e9173d2bf35afd9..7efb95b0219c5675e4e23262999c78922f0ab041 100644 (file)
@@ -30,7 +30,7 @@ test()
     Particles::Particle<dim> particle;
 
     Point<dim> position;
-    position(0) = 1.0;
+    position[0] = 1.0;
     particle.set_location(position);
 
     deallog << "Particle location: " << particle.get_location() << std::endl;
index 5371493586a458b81498f04b9435a97a51864cdb..6bbe59d27e5af0e27872bb1b800c944dc7c9fdcb 100644 (file)
@@ -28,12 +28,12 @@ test()
 {
   {
     Point<2> position;
-    position(0) = 0.3;
-    position(1) = 0.5;
+    position[0] = 0.3;
+    position[1] = 0.5;
 
     Point<2> reference_position;
-    reference_position(0) = 0.2;
-    reference_position(1) = 0.4;
+    reference_position[0] = 0.2;
+    reference_position[1] = 0.4;
 
     const types::particle_index index(7);
 
index 888a34ca5676515c067b381a8da573badd2eab24..0ce26f8556bc005895d956391e8a52a553d458e1 100644 (file)
@@ -33,12 +33,12 @@ test()
     Particles::PropertyPool<dim> pool(n_properties_per_particle);
 
     Point<2> position;
-    position(0) = 0.3;
-    position(1) = 0.5;
+    position[0] = 0.3;
+    position[1] = 0.5;
 
     Point<2> reference_position;
-    reference_position(0) = 0.2;
-    reference_position(1) = 0.4;
+    reference_position[0] = 0.2;
+    reference_position[1] = 0.4;
 
     const types::particle_index index(7);
 
index ff7c8d664e431f3b139e1363aa74dd2cd190e837..09cd99459821f49c5491f688b9fef2d4b3aed5ae 100644 (file)
@@ -31,18 +31,18 @@ test()
   {
     Point<spacedim> position;
 
-    position(0) = 0.3;
+    position[0] = 0.3;
     if (spacedim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
     if (spacedim > 2)
-      position(2) = 0.7;
+      position[2] = 0.7;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
     if (dim > 2)
-      reference_position(2) = 0.6;
+      reference_position[2] = 0.6;
 
     const types::particle_index index(7);
 
index 1b6e16c6bef396e19a26925f721cb02064305a27..25c469eacd9beb29b06c5f697a45718e28cdcfa6 100644 (file)
@@ -34,18 +34,18 @@ test()
   {
     Point<spacedim> position;
 
-    position(0) = 0.3;
+    position[0] = 0.3;
     if (spacedim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
     if (spacedim > 2)
-      position(2) = 0.7;
+      position[2] = 0.7;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
     if (dim > 2)
-      reference_position(2) = 0.6;
+      reference_position[2] = 0.6;
 
     const types::particle_index index(7);
 
index 4e9a2405e96545543b06400fdd246c33f3c7f5fb..b08db26d1f5cc4e08c8c66cbf98564ad6b8a3dc0 100644 (file)
@@ -34,18 +34,18 @@ test()
 
     Point<spacedim> position;
 
-    position(0) = 0.3;
+    position[0] = 0.3;
     if (spacedim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
     if (spacedim > 2)
-      position(2) = 0.7;
+      position[2] = 0.7;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
     if (dim > 2)
-      reference_position(2) = 0.6;
+      reference_position[2] = 0.6;
 
     const types::particle_index index(7);
 
index c7d9d534cf45f21bbc95aaed4d081b97cc0cf3ea..fae8a826d803b9eec24bc1fd305e7ce10a053b7a 100644 (file)
@@ -33,12 +33,12 @@ test()
     Particles::PropertyPool<dim> pool(n_properties_per_particle);
 
     Point<2> position;
-    position(0) = 0.3;
-    position(1) = 0.5;
+    position[0] = 0.3;
+    position[1] = 0.5;
 
     Point<2> reference_position;
-    reference_position(0) = 0.2;
-    reference_position(1) = 0.4;
+    reference_position[0] = 0.2;
+    reference_position[1] = 0.4;
 
     const types::particle_index index(7);
 
index 531896cd0cbf4432b36070594f9c5f8954c9abb5..1f52b66330c599fd801fa8befd6e7c27c4626cc7 100644 (file)
@@ -28,12 +28,12 @@ test()
 {
   {
     Point<2> position;
-    position(0) = 0.3;
-    position(1) = 0.5;
+    position[0] = 0.3;
+    position[1] = 0.5;
 
     Point<2> reference_position;
-    reference_position(0) = 0.2;
-    reference_position(1) = 0.4;
+    reference_position[0] = 0.2;
+    reference_position[1] = 0.4;
 
     const types::particle_index index(7);
 
index 82f3c814f22c3495d7accfa58ad93425ccc3d4b3..690d8b7f66190c2892447eb8cdb2db7f8a3d0543 100644 (file)
@@ -43,18 +43,18 @@ test()
 
 
     Point<spacedim> position;
-    position(0) = 0.3;
+    position[0] = 0.3;
     if (spacedim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
     if (spacedim > 2)
-      position(2) = 0.7;
+      position[2] = 0.7;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
     if (dim > 2)
-      reference_position(2) = 0.6;
+      reference_position[2] = 0.6;
 
     Particles::Particle<dim, spacedim> particle(position,
                                                 reference_position,
index ddd576d6b334692139859369b315fb41fc84e224..910c41387a24e5f48110ea76f3dfd50a916008af 100644 (file)
@@ -44,18 +44,18 @@ test()
 
 
     Point<spacedim> position;
-    position(0) = 0.3;
+    position[0] = 0.3;
     if (spacedim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
     if (spacedim > 2)
-      position(2) = 0.7;
+      position[2] = 0.7;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
     if (dim > 2)
-      reference_position(2) = 0.6;
+      reference_position[2] = 0.6;
 
     Particles::Particle<dim, spacedim> particle(position,
                                                 reference_position,
@@ -74,7 +74,7 @@ test()
     particle_handler.insert_particle(particle, cell_position.first);
     particle_handler.insert_particle(particle, cell_position.first);
 
-    position(0) = 0.7;
+    position[0] = 0.7;
     Particles::Particle<dim, spacedim> particle2(position,
                                                  reference_position,
                                                  9);
index 1789f71b950f11ccfd45304e1813f8e42c9a1a17..68391b5ae0beeaa1c6c80b5c0c88ef10eee10c3d 100644 (file)
@@ -46,8 +46,8 @@ test()
 
     for (unsigned int i = 0; i < dim; ++i)
       {
-        position[0](i) = 0.25;
-        position[1](i) = 0.75;
+        position[0][i] = 0.25;
+        position[1][i] = 0.75;
       }
 
     Particles::Particle<dim, spacedim> particle1(position[0],
@@ -83,7 +83,7 @@ test()
     // move particle 2 out of the domain. Note that we need to change the
     // coordinate dim-1 despite having a spacedim point.
     Point<spacedim> shift;
-    shift(dim - 1) = 0.5;
+    shift[dim - 1] = 0.5;
     for (auto &particle : particle_handler)
       particle.set_location(particle.get_location() + shift);
 
index 2cfecf1bcf047c35207890ea5883c3c2de8e3681..d6fa74b9732476afaa24dea67cb6da82d9a37cea 100644 (file)
@@ -51,8 +51,8 @@ test()
 
         for (unsigned int i = 0; i < dim; ++i)
           {
-            position[0](i) = 0.125;
-            position[1](i) = 0.525;
+            position[0][i] = 0.125;
+            position[1][i] = 0.525;
           }
 
         Particles::Particle<dim, spacedim> particle1(position[0],
@@ -95,7 +95,7 @@ test()
     // move particle 2 out of the domain. Note that we need to change the
     // coordinate dim-1 despite having a spacedim point.
     Point<spacedim> shift;
-    shift(dim - 1) = 0.5;
+    shift[dim - 1] = 0.5;
     for (auto &particle : particle_handler)
       particle.set_location(particle.get_location() + shift);
 
index 1fc15b993e75cd5477d88913707579b3aadb9894..514f9cfc4b11f21d6cf87e76813a5a5cb1e7ac1a 100644 (file)
@@ -48,10 +48,10 @@ test()
 
     if (Utilities::MPI::this_mpi_process(tr.get_communicator()) == 0)
       for (unsigned int i = 0; i < dim; ++i)
-        position(i) = 0.475;
+        position[i] = 0.475;
     else
       for (unsigned int i = 0; i < dim; ++i)
-        position(i) = 0.525;
+        position[i] = 0.525;
 
     Particles::Particle<dim, spacedim> particle(
       position,
index 8511e142b64f26ccf65fb526bcb3eb719c7a1ec2..de22cad8b2468c656e6dcb7ed59ec86db5de3417 100644 (file)
@@ -50,10 +50,10 @@ test()
 
     if (Utilities::MPI::this_mpi_process(tr.get_communicator()) == 0)
       for (unsigned int i = 0; i < dim; ++i)
-        position(i) = 0.475;
+        position[i] = 0.475;
     else
       for (unsigned int i = 0; i < dim; ++i)
-        position(i) = 0.525;
+        position[i] = 0.525;
 
     Particles::Particle<dim, spacedim> particle(
       position,
index 9199a9c064de65b35725183e8571f80dbc285f16..d6bef649c55a0da1d1b17cc86c3c83d72ea01a41 100644 (file)
@@ -54,7 +54,7 @@ test()
         if (Utilities::MPI::this_mpi_process(tr.get_communicator()) == 0)
           {
             for (unsigned int i = 0; i < dim; ++i)
-              position(i) = 0.410 + 0.01 * p;
+              position[i] = 0.410 + 0.01 * p;
 
             Particles::Particle<dim, spacedim> particle(
               position,
index e577c48ddad11734f1954ea7bb05a02a323f8cee..c64adcfd51bbea56ab42a5cb7b0d0ad3a1da83a7 100644 (file)
@@ -67,8 +67,8 @@ test()
 
         for (unsigned int i = 0; i < dim; ++i)
           {
-            position[0](i) = 0.125;
-            position[1](i) = 0.525;
+            position[0][i] = 0.125;
+            position[1][i] = 0.525;
           }
 
         Particles::Particle<dim, spacedim> particle1(position[0],
@@ -110,7 +110,7 @@ test()
     // move particle 2 out of the domain. Note that we need to change the
     // coordinate dim-1 despite having a spacedim point.
     Point<spacedim> shift;
-    shift(dim - 1) = 0.5;
+    shift[dim - 1] = 0.5;
     for (auto &particle : particle_handler)
       particle.set_location(particle.get_location() + shift);
 
index 84485f05ebc4e3a7c372a047618aa6ab8c549e5d..b6230032cebb502341cbb0012477254ff3b28835 100644 (file)
@@ -42,18 +42,18 @@ test()
 
 
   Point<spacedim> position;
-  position(0) = 0.3;
+  position[0] = 0.3;
   if (spacedim > 1)
-    position(1) = 0.5;
+    position[1] = 0.5;
   if (spacedim > 2)
-    position(2) = 0.7;
+    position[2] = 0.7;
 
   Point<dim> reference_position;
-  reference_position(0) = 0.2;
+  reference_position[0] = 0.2;
   if (dim > 1)
-    reference_position(1) = 0.4;
+    reference_position[1] = 0.4;
   if (dim > 2)
-    reference_position(2) = 0.6;
+    reference_position[2] = 0.6;
 
   Particles::Particle<dim, spacedim> particle(position, reference_position, 7);
   deallog << "Particle location: " << particle.get_location() << std::endl;
index c14e090e98fedd9019ec4593d80733b35adce24d..42ec60a5e6e1c92320f085ab877eef693f0f7ea5 100644 (file)
@@ -44,18 +44,18 @@ test()
 
 
     Point<spacedim> position;
-    position(0) = 0.3;
+    position[0] = 0.3;
     if (spacedim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
     if (spacedim > 2)
-      position(2) = 0.7;
+      position[2] = 0.7;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
     if (dim > 2)
-      reference_position(2) = 0.6;
+      reference_position[2] = 0.6;
 
     Particles::Particle<dim, spacedim> particle(position,
                                                 reference_position,
@@ -71,7 +71,7 @@ test()
     particle_handler.insert_particle(particle, cell_position.first);
     particle_handler.insert_particle(particle, cell_position.first);
 
-    position(0) = 0.7;
+    position[0] = 0.7;
     Particles::Particle<dim, spacedim> particle2(position,
                                                  reference_position,
                                                  9);
index c5f71b691d7a7538e879aefc19d0e0979673c7ab..98956b69c8ff3cfa3d599caa300ef1930eb2087a 100644 (file)
@@ -47,8 +47,8 @@ test()
 
     for (unsigned int i = 0; i < dim; ++i)
       {
-        position[0](i) = 0.25;
-        position[1](i) = 0.75;
+        position[0][i] = 0.25;
+        position[1][i] = 0.75;
       }
 
     Particles::Particle<dim, spacedim> particle1(position[0],
@@ -84,7 +84,7 @@ test()
     // move particle 2 out of the domain. Note that we need to change the
     // coordinate dim-1 despite having a spacedim point.
     Point<spacedim> shift;
-    shift(dim - 1) = 0.5;
+    shift[dim - 1] = 0.5;
     for (auto &particle : particle_handler)
       particle.set_location(particle.get_location() + shift);
 
index 0a4bcc2222f59a355615cf1eb87a3d1b24f4a251..669ab0fa45d1f8c55a4425fcf7b9d65c38537057 100644 (file)
@@ -63,8 +63,8 @@ test()
 
         for (unsigned int i = 0; i < dim; ++i)
           {
-            position[0](i) = 0.125;
-            position[1](i) = 0.525;
+            position[0][i] = 0.125;
+            position[1][i] = 0.525;
           }
 
         Particles::Particle<dim, spacedim> particle1(position[0],
@@ -108,7 +108,7 @@ test()
     // move particle 2 out of the domain. Note that we need to change the
     // coordinate dim-1 despite having a spacedim point.
     Point<spacedim> shift;
-    shift(dim - 1) = 0.5;
+    shift[dim - 1] = 0.5;
     for (auto &particle : particle_handler)
       particle.set_location(particle.get_location() + shift);
 
index 7dd6a511a2fbecc4cac9b7af8b5df14556a2a8c3..3e26ade5344191df5ca70ded7d617c8dc449afa8 100644 (file)
@@ -48,16 +48,16 @@ test()
                                                      n_properties_per_particle);
 
     Point<dim> position;
-    position(0) = 0.3;
+    position[0] = 0.3;
 
     if (dim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
 
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
 
     const types::particle_index index(7);
 
index ee75dbdc3d7deff632a76233f9b490ca1a83b4f8..f8870923622f9fda723c81c7134c848bbd2b02bf 100644 (file)
@@ -46,16 +46,16 @@ test()
     Particles::PropertyPool<dim> pool(n_properties_per_particle);
 
     Point<dim> position;
-    position(0) = 0.3;
+    position[0] = 0.3;
 
     if (dim > 1)
-      position(1) = 0.5;
+      position[1] = 0.5;
 
     Point<dim> reference_position;
-    reference_position(0) = 0.2;
+    reference_position[0] = 0.2;
 
     if (dim > 1)
-      reference_position(1) = 0.4;
+      reference_position[1] = 0.4;
 
     const types::particle_index index(7);
 
index 316fcfa35ad4517ab654ae8e4f2f55adbaf30e95..c0fd888598dc718c7c57fe2ad9ceadcc3ebf1ae0 100644 (file)
@@ -46,9 +46,9 @@ test()
 
     for (unsigned int i = 0; i < dim; ++i)
       {
-        particle_reference_locations[0](i) = 0.25;
-        particle_reference_locations[1](i) = 0.5;
-        particle_reference_locations[2](i) = 0.75;
+        particle_reference_locations[0][i] = 0.25;
+        particle_reference_locations[1][i] = 0.5;
+        particle_reference_locations[2][i] = 0.75;
       }
 
     Particles::Generators::regular_reference_locations(
index 28abc99d43ab1e31419d83851f44b1436e8a27f1..694c4770e216bd649b88c632378fd39ee0e2a79b 100644 (file)
@@ -108,8 +108,8 @@ namespace Step68
     const double T = 4;
     const double t = this->get_time();
 
-    const double px = numbers::PI * point(0);
-    const double py = numbers::PI * point(1);
+    const double px = numbers::PI * point[0];
+    const double py = numbers::PI * point[1];
     const double pt = numbers::PI / T * t;
 
     values[0] = -2 * cos(pt) * pow(sin(px), 2) * sin(py) * cos(py);
index c677276e1d0a0ab8f340cfb31b573893cd2aa685..b0b86fa848057ff3c6308768e2c983a6fcd3a1d8 100644 (file)
@@ -138,10 +138,10 @@ public:
   value(const Point<dim> &p, const unsigned int /*component*/ = 0) const
   {
     if (dim == 2)
-      return -2. * M_PI * M_PI * std::sin(M_PI * p(0)) * std::sin(M_PI * p(1));
+      return -2. * M_PI * M_PI * std::sin(M_PI * p[0]) * std::sin(M_PI * p[1]);
     else /* if(dim == 3)*/
-      return -3. * M_PI * M_PI * std::sin(M_PI * p(0)) * std::sin(M_PI * p(1)) *
-             std::sin(M_PI * p(2));
+      return -3. * M_PI * M_PI * std::sin(M_PI * p[0]) * std::sin(M_PI * p[1]) *
+             std::sin(M_PI * p[2]);
   }
 };
 
index cdf68f9611d884181f1de49616036e1b64adc4af..5f00e8afd3d21b0b4b0559badafdcb3d63c87535 100644 (file)
@@ -415,12 +415,12 @@ namespace dealii
 #ifdef DEBUG
       // all vertices should be in a plane
       for (const auto &vertex : vertices)
-        Assert(midpoint(coordinate) == vertex(coordinate), ExcInternalError());
+        Assert(midpoint[coordinate] == vertex[coordinate], ExcInternalError());
 #endif
 
       // add another vertex as tip of triangle/pyramid
       Point<spacedim> tip = midpoint;
-      tip(coordinate) += (face_no % 2 == 1) ? 1. : -1.;
+      tip[coordinate] += (face_no % 2 == 1) ? 1. : -1.;
       vertices.push_back(tip);
 
       CellData<dim> simplex(vertices.size());
index b0377afbf6f466b9c07b3b53ee204843dc31b12c..686e943a0742deeaf4ee4031bd82bd666fd67f09 100644 (file)
@@ -57,7 +57,7 @@ public:
   {
     double u = 1.0;
     for (int d = 0; d < dim; ++d)
-      u *= std::sin(numbers::PI * p(d));
+      u *= std::sin(numbers::PI * p[d]);
 
     return u;
   }
@@ -72,7 +72,7 @@ public:
   {
     double u = 1.0;
     for (int d = 0; d < dim; ++d)
-      u *= std::sin(numbers::PI * p(d));
+      u *= std::sin(numbers::PI * p[d]);
 
     return (1 + 0.0 * dim * numbers::PI * numbers::PI) * u;
   }
index 1881c70a6b20e265e7cae8ff31f9315189634e32..3caa8eddf091df76b480ba9f28e797f3d50d8633 100644 (file)
@@ -120,7 +120,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0.0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4.0 * std::pow(p(i), 4.0);
+    return_value += 4.0 * std::pow(p[i], 4.0);
 
   return return_value;
 }
index 6c1a158a140283033a8513ec62d6efe9778f4d15..a222fb284501a5f00297d6a7032062cc24a0802d 100644 (file)
@@ -126,7 +126,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0.0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4.0 * std::pow(p(i), 4.0);
+    return_value += 4.0 * std::pow(p[i], 4.0);
 
   return return_value;
 }
index 11bc20c78399cb59e905146d961492ed9271231f..58b29356bf9a54982341b9e93c12bafc15eb2df1 100644 (file)
@@ -524,8 +524,8 @@ namespace Step7
               for (const auto &face : cell->face_iterators())
                 {
                   const auto center = face->center();
-                  if ((std::fabs(center(0) - (-1.0)) < 1e-12) ||
-                      (std::fabs(center(1) - (-1.0)) < 1e-12))
+                  if ((std::fabs(center[0] - (-1.0)) < 1e-12) ||
+                      (std::fabs(center[1] - (-1.0)) < 1e-12))
                     face->set_boundary_id(1);
                 }
           }
index 65e7738ac3fb558346249bc2c297b3ed6e9c8197..5916d9712141429b39559146bfde730dece1a2a1 100644 (file)
@@ -113,8 +113,8 @@ namespace Step8
     Assert(dim >= 2, ExcNotImplemented());
 
     Point<dim> point_1, point_2;
-    point_1(0) = 0.5;
-    point_2(0) = -0.5;
+    point_1[0] = 0.5;
+    point_2[0] = -0.5;
 
     for (unsigned int point_n = 0; point_n < points.size(); ++point_n)
       {
index 31db50b2638d151379e0eaa89307c1cd4d9d16b5..e0407d2484c6873d500e5ba1b71c508f4ab8c314 100644 (file)
@@ -89,7 +89,7 @@ namespace Step12
 
     for (unsigned int i = 0; i < values.size(); ++i)
       {
-        if (points[i](0) < 0.5)
+        if (points[i][0] < 0.5)
           values[i] = 1.;
         else
           values[i] = 0.;
@@ -104,8 +104,8 @@ namespace Step12
     Assert(dim >= 2, ExcNotImplemented());
 
     Point<dim> wind_field;
-    wind_field(0) = -p(1);
-    wind_field(1) = p(0);
+    wind_field[0] = -p[1];
+    wind_field[1] = p[0];
 
     if (wind_field.norm() > 1e-10)
       wind_field /= wind_field.norm();
index e9aee209a2a9516dc6a5460493eac6fb4a78a376..9e9e0331ac5565a6b80d0feb32d43a0899491043 100644 (file)
@@ -96,7 +96,7 @@ namespace Step12
 
     for (unsigned int i = 0; i < values.size(); ++i)
       {
-        if (points[i](0) < 0.5)
+        if (points[i][0] < 0.5)
           values[i] = 1.;
         else
           values[i] = 0.;
@@ -111,8 +111,8 @@ namespace Step12
     Assert(dim >= 2, ExcNotImplemented());
 
     Point<dim> wind_field;
-    wind_field(0) = -p(1);
-    wind_field(1) = p(0);
+    wind_field[0] = -p[1];
+    wind_field[1] = p[0];
 
     if (wind_field.norm() > 1e-6)
       wind_field /= wind_field.norm();
index a9f8cb9a6c2ed9748fe28ad37cb7a1994b9ee5d7..982b7a7da621d4c55ace357676d60970f6ce2bd1 100644 (file)
@@ -130,8 +130,8 @@ Beta<dim>::value_list(const std::vector<Point<dim>> &points,
       const Point<dim> &p    = points[i];
       Point<dim>       &beta = values[i];
 
-      beta(0) = -p(1);
-      beta(1) = p(0);
+      beta[0] = -p[1];
+      beta[1] = p[0];
 
       if (beta.norm() > 1e-10)
         beta /= std::sqrt(beta.square());
@@ -150,7 +150,7 @@ BoundaryValues<dim>::value_list(const std::vector<Point<dim>> &points,
 
   for (unsigned int i = 0; i < std::min(values.size(), points.size()); ++i)
     {
-      if (points[i](0) < 0.5)
+      if (points[i][0] < 0.5)
         values[i] = 1.;
       else
         values[i] = 0.;
index e49f1278d58d637c38a856f63598b0053fdfc178..7ec7e7026f7d19ac0368f325a304bc81d7c348b3 100644 (file)
@@ -133,8 +133,8 @@ Beta<dim>::value_list(const std::vector<Point<dim>> &points,
       const Point<dim> &p    = points[i];
       Point<dim>       &beta = values[i];
 
-      beta(0) = -p(1);
-      beta(1) = p(0);
+      beta[0] = -p[1];
+      beta[1] = p[0];
 
       if (beta.norm() > 1e-10)
         beta /= std::sqrt(beta.square());
@@ -153,7 +153,7 @@ BoundaryValues<dim>::value_list(const std::vector<Point<dim>> &points,
 
   for (unsigned int i = 0; i < std::min(values.size(), points.size()); ++i)
     {
-      if (points[i](0) < 0.5)
+      if (points[i][0] < 0.5)
         values[i] = 1.;
       else
         values[i] = 0.;
index ca26d8cc4736e968e84a8fbd2e63594688f67d1f..44356d019d0d129f7dfad7dd283993f725cea8bc 100644 (file)
@@ -139,8 +139,8 @@ namespace Step17
       Assert(dim >= 2, ExcInternalError());
 
       Point<dim> point_1, point_2;
-      point_1(0) = 0.5;
-      point_2(0) = -0.5;
+      point_1[0] = 0.5;
+      point_2[0] = -0.5;
 
       if (((p - point_1).norm_square() < 0.2 * 0.2) ||
           ((p - point_2).norm_square() < 0.2 * 0.2))
index 69ff17684564faae938757902dd567adfd126258..b062ce71071a72ee2dd694353f2b7c7de3e4b0c7 100644 (file)
@@ -120,7 +120,7 @@ namespace Step38
   double
   Solution<2>::value(const Point<2> &p, const unsigned int) const
   {
-    return (-2. * p(0) * p(1));
+    return (-2. * p[0] * p[1]);
   }
 
   template <>
@@ -128,8 +128,8 @@ namespace Step38
   Solution<2>::gradient(const Point<2> &p, const unsigned int) const
   {
     Tensor<1, 2> return_value;
-    return_value[0] = -2. * p(1) * (1 - 2. * p(0) * p(0));
-    return_value[1] = -2. * p(0) * (1 - 2. * p(1) * p(1));
+    return_value[0] = -2. * p[1] * (1 - 2. * p[0] * p[0]);
+    return_value[1] = -2. * p[0] * (1 - 2. * p[1] * p[1]);
 
     return return_value;
   }
@@ -138,8 +138,8 @@ namespace Step38
   double
   Solution<3>::value(const Point<3> &p, const unsigned int) const
   {
-    return (std::sin(numbers::PI * p(0)) * std::cos(numbers::PI * p(1)) *
-            exp(p(2)));
+    return (std::sin(numbers::PI * p[0]) * std::cos(numbers::PI * p[1]) *
+            exp(p[2]));
   }
 
   template <>
@@ -150,9 +150,9 @@ namespace Step38
 
     Tensor<1, 3> return_value;
 
-    return_value[0] = PI * cos(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
-    return_value[1] = -PI * sin(PI * p(0)) * sin(PI * p(1)) * exp(p(2));
-    return_value[2] = sin(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
+    return_value[0] = PI * cos(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
+    return_value[1] = -PI * sin(PI * p[0]) * sin(PI * p[1]) * exp(p[2]);
+    return_value[2] = sin(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
 
     return return_value;
   }
@@ -170,7 +170,7 @@ namespace Step38
   RightHandSide<2>::value(const Point<2> &p,
                           const unsigned int /*component*/) const
   {
-    return (-8. * p(0) * p(1));
+    return (-8. * p[0] * p[1]);
   }
 
   template <>
@@ -182,23 +182,23 @@ namespace Step38
 
     Tensor<2, 3> hessian;
 
-    hessian[0][0] = -PI * PI * sin(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
-    hessian[1][1] = -PI * PI * sin(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
-    hessian[2][2] = sin(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
+    hessian[0][0] = -PI * PI * sin(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
+    hessian[1][1] = -PI * PI * sin(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
+    hessian[2][2] = sin(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
 
-    hessian[0][1] = -PI * PI * cos(PI * p(0)) * sin(PI * p(1)) * exp(p(2));
-    hessian[1][0] = -PI * PI * cos(PI * p(0)) * sin(PI * p(1)) * exp(p(2));
+    hessian[0][1] = -PI * PI * cos(PI * p[0]) * sin(PI * p[1]) * exp(p[2]);
+    hessian[1][0] = -PI * PI * cos(PI * p[0]) * sin(PI * p[1]) * exp(p[2]);
 
-    hessian[0][2] = PI * cos(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
-    hessian[2][0] = PI * cos(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
+    hessian[0][2] = PI * cos(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
+    hessian[2][0] = PI * cos(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
 
-    hessian[1][2] = -PI * sin(PI * p(0)) * sin(PI * p(1)) * exp(p(2));
-    hessian[2][1] = -PI * sin(PI * p(0)) * sin(PI * p(1)) * exp(p(2));
+    hessian[1][2] = -PI * sin(PI * p[0]) * sin(PI * p[1]) * exp(p[2]);
+    hessian[2][1] = -PI * sin(PI * p[0]) * sin(PI * p[1]) * exp(p[2]);
 
     Tensor<1, 3> gradient;
-    gradient[0] = PI * cos(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
-    gradient[1] = -PI * sin(PI * p(0)) * sin(PI * p(1)) * exp(p(2));
-    gradient[2] = sin(PI * p(0)) * cos(PI * p(1)) * exp(p(2));
+    gradient[0] = PI * cos(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
+    gradient[1] = -PI * sin(PI * p[0]) * sin(PI * p[1]) * exp(p[2]);
+    gradient[2] = sin(PI * p[0]) * cos(PI * p[1]) * exp(p[2]);
 
     Point<3> normal = p;
     normal /= p.norm();
index 71853c3b4bbe7be0aa035b0345f1ad81bb990a46..f3b7c6d96e99f8f65e93ef21d7213dc924d9f693 100644 (file)
@@ -100,8 +100,8 @@ namespace Step68
     const double T = 4;
     const double t = this->get_time();
 
-    const double px = numbers::PI * point(0);
-    const double py = numbers::PI * point(1);
+    const double px = numbers::PI * point[0];
+    const double py = numbers::PI * point[1];
     const double pt = numbers::PI / T * t;
 
     values[0] = -2 * cos(pt) * pow(sin(px), 2) * sin(py) * cos(py);
index 846fc600469ec7df8527f324f127e517c717cdbd..abeb673918a25db2f8865443a94aab19dfe66ada 100644 (file)
@@ -53,7 +53,7 @@ is_face_on_OY(const typename DoFHandler<dim>::active_cell_iterator &cell,
   deallog
     << "This sentence should appear once when the corresponding face is visited only once on cell "
     << cell->index() << std::endl;
-  return (std::abs(cell->face(face_index)->center()(0)) < 0.01);
+  return (std::abs(cell->face(face_index)->center()[0]) < 0.01);
 }
 
 template <int dim>
index ed560bf00cecf6256a17e34b0f7b1d2ea28a343f..182d2a0477242016917502df715524316fcd35cd 100644 (file)
@@ -81,7 +81,7 @@ namespace TestGrids
                 const Point<dim> &p        = cell->center();
                 bool              negative = true;
                 for (unsigned int d = 0; d < dim; ++d)
-                  if (p(d) >= 0.)
+                  if (p[d] >= 0.)
                     negative = false;
                 if (negative)
                   cell->set_refine_flag();
index d3876aa1a0e6a7d368359600add572f88a4e4e1c..1799e752e9880246ecc1303e72b7ccfe0c8218a4 100644 (file)
@@ -108,7 +108,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4 * std::pow(p(i), 4);
+    return_value += 4 * std::pow(p[i], 4);
 
   return return_value;
 }
index 3757e173ad5e553d48f914945ef74be3127adcaf..f1b27e5e0b640051fe7e8756a96353ffd35084b3 100644 (file)
@@ -128,7 +128,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 2 * std::pow(p(i), 2);
+    return_value += 2 * std::pow(p[i], 2);
 
   return return_value;
 }
index 1073e9007e2b0a03cc836ab1b72878eb9266f664..65930e695734c1289e9806f61007b9809b05f209 100644 (file)
@@ -109,7 +109,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4 * std::pow(p(i), 4);
+    return_value += 4 * std::pow(p[i], 4);
 
   return return_value;
 }
index 7b5223709fdd0e6e75d79c92896fc96d46b4a717..33edef6cfbfa9dce53ab4f4ba34f170ccd6fb5c5 100644 (file)
@@ -108,7 +108,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4 * std::pow(p(i), 4);
+    return_value += 4 * std::pow(p[i], 4);
 
   return return_value;
 }
index f8e561dc8da4ee2d9205ebb47bc62053bb06c2f8..1aa72f3c6d04d159c795d796f8c406e0ba0c3862 100644 (file)
@@ -115,7 +115,7 @@ RightHandSide<dim>::value(const Point<dim> &p,
 {
   double return_value = 0;
   for (unsigned int i = 0; i < dim; ++i)
-    return_value += 4 * std::pow(p(i), 4);
+    return_value += 4 * std::pow(p[i], 4);
 
   return return_value;
 }

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.