]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Remove deprecated Vector member functions 15534/head
authorDaniel Arndt <arndtd@ornl.gov>
Thu, 29 Jun 2023 20:13:51 +0000 (16:13 -0400)
committerDaniel Arndt <arndtd@ornl.gov>
Mon, 3 Jul 2023 01:29:01 +0000 (21:29 -0400)
147 files changed:
include/deal.II/base/partitioner.h
include/deal.II/lac/la_parallel_block_vector.h
include/deal.II/lac/la_parallel_block_vector.templates.h
include/deal.II/lac/la_parallel_vector.h
include/deal.II/lac/la_parallel_vector.templates.h
include/deal.II/lac/petsc_vector_base.h
include/deal.II/lac/read_write_vector.h
include/deal.II/lac/trilinos_vector.h
source/lac/petsc_vector_base.cc
source/lac/trilinos_solver.cc
source/lac/trilinos_vector.cc
tests/hp/field_transfer_02.cc
tests/hp/field_transfer_04.cc
tests/lac/parallel_vector_11.cc
tests/lac/parallel_vector_12.cc
tests/lac/parallel_vector_21.cc
tests/lac/readwritevector_assignment.cc
tests/lac/readwritevector_print.cc
tests/lac/utilities_02.cc
tests/mappings/mapping_q_eulerian_09.cc
tests/matrix_free/dg_pbc_01.cc
tests/matrix_free/face_setup_01.cc
tests/matrix_free/face_setup_01.with_p4est=true.mpirun=1.output
tests/matrix_free/face_setup_01.with_p4est=true.mpirun=2.output
tests/matrix_free/laplace_operator_01.cc
tests/matrix_free/laplace_operator_02.cc
tests/matrix_free/laplace_operator_03.cc
tests/matrix_free/laplace_operator_05.cc
tests/matrix_free/loop_boundary.cc
tests/matrix_free/loop_boundary_02.cc
tests/matrix_free/mass_operator_01.cc
tests/matrix_free/mass_operator_02.cc
tests/matrix_free/mass_operator_03.cc
tests/matrix_free/mass_operator_04.cc
tests/matrix_free/matrix_free_device_matrix_vector_10.cc
tests/matrix_free/matrix_free_device_matrix_vector_10a.cc
tests/matrix_free/matrix_free_device_matrix_vector_19.cc
tests/matrix_free/matrix_free_device_matrix_vector_25.cc
tests/matrix_free/matrix_free_device_matrix_vector_26.cc
tests/matrix_free/matrix_free_device_precondition_chebyshev.cc
tests/matrix_free/matrix_vector_10.cc
tests/matrix_free/matrix_vector_11.cc
tests/matrix_free/matrix_vector_12.cc
tests/matrix_free/matrix_vector_13.cc
tests/matrix_free/matrix_vector_19.cc
tests/matrix_free/matrix_vector_20.cc
tests/matrix_free/matrix_vector_21.cc
tests/matrix_free/matrix_vector_22.cc
tests/matrix_free/matrix_vector_23.cc
tests/matrix_free/matrix_vector_blocks.cc
tests/matrix_free/matrix_vector_faces_10.cc
tests/matrix_free/matrix_vector_faces_11.cc
tests/matrix_free/matrix_vector_faces_13.cc
tests/matrix_free/matrix_vector_faces_14.cc
tests/matrix_free/matrix_vector_faces_15.cc
tests/matrix_free/matrix_vector_faces_16.cc
tests/matrix_free/matrix_vector_faces_17.cc
tests/matrix_free/matrix_vector_faces_18.cc
tests/matrix_free/matrix_vector_faces_19.cc
tests/matrix_free/matrix_vector_faces_20.cc
tests/matrix_free/matrix_vector_faces_21.cc
tests/matrix_free/matrix_vector_faces_22.cc
tests/matrix_free/matrix_vector_faces_23.cc
tests/matrix_free/matrix_vector_faces_24.cc
tests/matrix_free/matrix_vector_faces_29.cc
tests/matrix_free/matrix_vector_faces_30.cc
tests/matrix_free/matrix_vector_faces_31.cc
tests/matrix_free/matrix_vector_faces_32.cc
tests/matrix_free/multigrid_dg_periodic.cc
tests/matrix_free/multigrid_dg_sip_01.cc
tests/matrix_free/multigrid_dg_sip_02.cc
tests/matrix_free/parallel_multigrid.cc
tests/matrix_free/parallel_multigrid_adaptive_01.cc
tests/matrix_free/parallel_multigrid_adaptive_02.cc
tests/matrix_free/parallel_multigrid_adaptive_03.cc
tests/matrix_free/parallel_multigrid_adaptive_04.cc
tests/matrix_free/parallel_multigrid_adaptive_05.cc
tests/matrix_free/parallel_multigrid_adaptive_06.cc
tests/matrix_free/parallel_multigrid_adaptive_06ref.cc
tests/matrix_free/parallel_multigrid_adaptive_07.cc
tests/matrix_free/parallel_multigrid_adaptive_08.cc
tests/matrix_free/parallel_multigrid_fullydistributed.cc
tests/matrix_free/parallel_multigrid_interleave.cc
tests/matrix_free/parallel_multigrid_interleave_renumber.cc
tests/matrix_free/parallel_multigrid_mf.cc
tests/matrix_free/pre_and_post_loops_01.cc
tests/matrix_free/pre_and_post_loops_02.cc
tests/matrix_free/pre_and_post_loops_03.cc
tests/matrix_free/pre_and_post_loops_04.cc
tests/matrix_free/pre_and_post_loops_05.cc
tests/matrix_free/pre_and_post_loops_06.cc
tests/matrix_free/pre_and_post_loops_07.cc
tests/matrix_free/pre_and_post_loops_08.cc
tests/matrix_free/step-37-inhomogeneous-1.cc
tests/matrix_free/step-48.cc
tests/matrix_free/step-48b.cc
tests/matrix_free/step-48c.cc
tests/matrix_free/stokes_computation.cc
tests/mpi/parallel_block_vector_05.cc
tests/mpi/parallel_block_vector_06.cc
tests/mpi/parallel_block_vector_07.cc
tests/mpi/parallel_block_vector_08.cc
tests/mpi/parallel_block_vector_09.cc
tests/mpi/parallel_block_vector_10.cc
tests/mpi/parallel_block_vector_11.cc
tests/mpi/parallel_block_vector_12.cc
tests/mpi/parallel_vector_11.cc
tests/mpi/parallel_vector_12.cc
tests/mpi/parallel_vector_21.cc
tests/mpi/parallel_vector_back_interpolate.cc
tests/mpi/parallel_vector_interpolate.cc
tests/mpi/petsc_distribute_01.cc
tests/mpi/petsc_distribute_01_block.cc
tests/mpi/petsc_distribute_01_inhomogenous.cc
tests/mpi/petsc_locally_owned_elements.cc
tests/mpi/trilinos_distribute_01.cc
tests/mpi/trilinos_distribute_01_block.cc
tests/mpi/trilinos_distribute_01_inhomogenous.cc
tests/mpi/trilinos_vector_non_negative.cc
tests/multigrid/transfer_05.cc
tests/multigrid/transfer_06.cc
tests/multigrid/transfer_matrix_free_01.cc
tests/multigrid/transfer_matrix_free_02.cc
tests/multigrid/transfer_matrix_free_02_block.cc
tests/multigrid/transfer_matrix_free_02_block_02.cc
tests/multigrid/transfer_matrix_free_03.cc
tests/multigrid/transfer_matrix_free_04.cc
tests/multigrid/transfer_matrix_free_05.cc
tests/multigrid/transfer_matrix_free_06.cc
tests/multigrid/transfer_matrix_free_07.cc
tests/multigrid/transfer_matrix_free_11.cc
tests/numerics/no_flux_18.cc
tests/particles/step-68.cc
tests/petsc/57.cc [deleted file]
tests/petsc/57.output [deleted file]
tests/remote_point_evaluation/vector_tools_evaluate_at_points_01.cc
tests/remote_point_evaluation/vector_tools_evaluate_at_points_02.cc
tests/remote_point_evaluation/vector_tools_evaluate_at_points_03.cc
tests/remote_point_evaluation/vector_tools_evaluate_at_points_04.cc
tests/remote_point_evaluation/vector_tools_evaluate_at_points_05.cc
tests/simplex/step-67.cc
tests/simplex/step-68.cc
tests/trilinos/parallel_block_vector_copy_01.mpirun=2.output
tests/trilinos/print_01.mpirun=2.output
tests/trilinos/readwritevector_02.mpirun=2.output
tests/trilinos/readwritevector_03.mpirun=2.output
tests/trilinos/readwritevector_04.mpirun=2.output

index 693415729ab78bbc8aa73b1277e7a6ce6041c1bf..73c23b1cc1bd12c294e43a77262f0083309aebde 100644 (file)
@@ -285,19 +285,6 @@ namespace Utilities
       types::global_dof_index
       size() const;
 
-      /**
-       * Return the number of locally owned indices,
-       * i.e., local_range().second minus local_range().first.
-       * The returned numbers need to add up to the total number of indices when
-       * summed over all processes
-       *
-       * @deprecated Use the more clearly named function locally_owned_size()
-       * instead.
-       */
-      DEAL_II_DEPRECATED
-      unsigned int
-      local_size() const;
-
       /**
        * Return the number of locally owned indices,
        * i.e., local_range().second minus local_range().first.
@@ -826,14 +813,6 @@ namespace Utilities
 
 
 
-    inline unsigned int
-    Partitioner::local_size() const
-    {
-      return locally_owned_size();
-    }
-
-
-
     inline unsigned int
     Partitioner::locally_owned_size() const
     {
index 73be633f89d37716b62db835c77ac5312d0cc4ce..f0946bfb0f64cae1a75bb251de41bded17deb8e1 100644 (file)
@@ -413,20 +413,6 @@ namespace LinearAlgebra
       void
       update_ghost_values() const;
 
-      /**
-       * This method zeros the entries on ghost dofs, but does not touch
-       * locally owned DoFs.
-       *
-       * After calling this method, read access to ghost elements of the
-       * vector is forbidden and an exception is thrown. Only write access to
-       * ghost elements is allowed in this state.
-       *
-       * @deprecated Use zero_out_ghost_values() instead.
-       */
-      DEAL_II_DEPRECATED void
-      zero_out_ghosts() const;
-
-
       /**
        * This method zeros the entries on ghost dofs, but does not touch
        * locally owned DoFs.
index fd417fcd05ae7d69b03e29a121bc5c44becbb8d9..923c297a886656b6a0270e1cc8ccd56892988e0a 100644 (file)
@@ -470,15 +470,6 @@ namespace LinearAlgebra
 
 
 
-    template <typename Number>
-    void
-    BlockVector<Number>::zero_out_ghosts() const
-    {
-      this->zero_out_ghost_values();
-    }
-
-
-
     template <typename Number>
     void
     BlockVector<Number>::zero_out_ghost_values() const
index 8777d0ce2822850723a4c6d80bc0a04e11fb92d4..99cee4a4f43d05d1beaf16714383f47b9df04694 100644 (file)
@@ -636,19 +636,6 @@ namespace LinearAlgebra
       void
       update_ghost_values_finish() const;
 
-      /**
-       * This method zeros the entries on ghost dofs, but does not touch
-       * locally owned DoFs.
-       *
-       * After calling this method, read access to ghost elements of the
-       * vector is forbidden and an exception is thrown. Only write access to
-       * ghost elements is allowed in this state.
-       *
-       * @deprecated Use zero_out_ghost_values() instead.
-       */
-      DEAL_II_DEPRECATED void
-      zero_out_ghosts() const;
-
       /**
        * This method zeros the entries on ghost dofs, but does not touch
        * locally owned DoFs.
@@ -981,16 +968,6 @@ namespace LinearAlgebra
        */
       /** @{ */
 
-      /**
-       * Return the local size of the vector, i.e., the number of indices
-       * owned locally.
-       *
-       * @deprecated Use locally_owned_size() instead.
-       */
-      DEAL_II_DEPRECATED
-      size_type
-      local_size() const;
-
       /**
        * Return the local size of the vector, i.e., the number of indices
        * owned locally.
@@ -1491,15 +1468,6 @@ namespace LinearAlgebra
 
 
 
-    template <typename Number, typename MemorySpace>
-    inline typename Vector<Number, MemorySpace>::size_type
-    Vector<Number, MemorySpace>::local_size() const
-    {
-      return locally_owned_size();
-    }
-
-
-
     template <typename Number, typename MemorySpace>
     inline typename Vector<Number, MemorySpace>::size_type
     Vector<Number, MemorySpace>::locally_owned_size() const
index 848aa0446a8f67e7fbee49c9691c2b4ea951e935..e1343ab797178ce7811659678936a149620b7879 100644 (file)
@@ -947,15 +947,6 @@ namespace LinearAlgebra
 
 
 
-    template <typename Number, typename MemorySpaceType>
-    void
-    Vector<Number, MemorySpaceType>::zero_out_ghosts() const
-    {
-      this->zero_out_ghost_values();
-    }
-
-
-
     template <typename Number, typename MemorySpaceType>
     void
     Vector<Number, MemorySpaceType>::zero_out_ghost_values() const
index 8dfe3ebf33715bc45b5b56e7133d2dcf6c6a04c8..66b2cc4f8be1105ca83726be2fbed72dae07e236 100644 (file)
@@ -357,20 +357,6 @@ namespace PETScWrappers
     size_type
     size() const;
 
-    /**
-     * Return the local dimension of the vector, i.e. the number of elements
-     * stored on the present MPI process. For sequential vectors, this number
-     * is the same as size(), but for parallel vectors it may be smaller.
-     *
-     * To figure out which elements exactly are stored locally, use
-     * local_range() or locally_owned_elements().
-     *
-     * @deprecated use locally_owned_size() instead.
-     */
-    DEAL_II_DEPRECATED
-    size_type
-    local_size() const;
-
     /**
      * Return the local dimension of the vector, i.e. the number of elements
      * stored on the present MPI process. For sequential vectors, this number
@@ -627,28 +613,6 @@ namespace PETScWrappers
     PetscScalar
     add_and_dot(const PetscScalar a, const VectorBase &V, const VectorBase &W);
 
-    /**
-     * Return the value of the vector element with the largest negative value.
-     *
-     * @deprecated This function has been deprecated to improve compatibility
-     * with other classes inheriting from VectorSpaceVector. If you need to
-     * use this functionality then use the PETSc function VecMin instead.
-     */
-    DEAL_II_DEPRECATED
-    real_type
-    min() const;
-
-    /**
-     * Return the value of the vector element with the largest positive value.
-     *
-     * @deprecated This function has been deprecated to improve compatibility
-     * with other classes inheriting from VectorSpaceVector. If you need to
-     * use this functionality then use the PETSc function VecMax instead.
-     */
-    DEAL_II_DEPRECATED
-    real_type
-    max() const;
-
     /**
      * Return whether the vector contains only elements with value zero. This
      * is a collective operation. This function is expensive, because
@@ -657,18 +621,6 @@ namespace PETScWrappers
     bool
     all_zero() const;
 
-    /**
-     * Return @p true if the vector has no negative entries, i.e. all entries
-     * are zero or positive. This function is used, for example, to check
-     * whether refinement indicators are really all positive (or zero).
-     *
-     * @deprecated This function has been deprecated to improve compatibility
-     * with other classes inheriting from VectorSpaceVector.
-     */
-    DEAL_II_DEPRECATED
-    bool
-    is_non_negative() const;
-
     /**
      * Multiply the entire vector by a fixed factor.
      */
index c3464594cfc719b25150d9eb95f37bf0dbdeaedd..d4746d3d464ceee543b00cb2ebd33a92a57ed8a5 100644 (file)
@@ -539,17 +539,6 @@ namespace LinearAlgebra
     size_type
     size() const;
 
-    /**
-     * This function returns the number of elements stored. It is smaller or
-     * equal to the dimension of the vector space that is modeled by an object
-     * of this kind. This dimension is return by size().
-     *
-     * @deprecated use locally_owned_size() instead.
-     */
-    DEAL_II_DEPRECATED
-    size_type
-    n_elements() const;
-
     /**
      * Return the local size of the vector, i.e., the number of indices
      * owned locally.
@@ -968,15 +957,6 @@ namespace LinearAlgebra
 
 
 
-  template <typename Number>
-  inline typename ReadWriteVector<Number>::size_type
-  ReadWriteVector<Number>::n_elements() const
-  {
-    return stored_elements.n_elements();
-  }
-
-
-
   template <typename Number>
   inline typename ReadWriteVector<Number>::size_type
   ReadWriteVector<Number>::locally_owned_size() const
index 1d77616a1eaf2db00f752b670a39d630dbf026d7..9f25d3d1750bae235aac0109b3107755bf7b508a 100644 (file)
@@ -762,23 +762,6 @@ namespace TrilinosWrappers
       size_type
       size() const;
 
-      /**
-       * Return the local dimension of the vector, i.e. the number of elements
-       * stored on the present MPI process. For sequential vectors, this number
-       * is the same as size(), but for parallel vectors it may be smaller.
-       *
-       * To figure out which elements exactly are stored locally, use
-       * local_range().
-       *
-       * If the vector contains ghost elements, they are included in this
-       * number.
-       *
-       * @deprecated This function is deprecated.
-       */
-      DEAL_II_DEPRECATED
-      size_type
-      local_size() const;
-
       /**
        * Return the local size of the vector, i.e., the number of indices
        * owned locally.
@@ -792,9 +775,10 @@ namespace TrilinosWrappers
        * stored, the second the index of the one past the last one that is
        * stored locally. If this is a sequential vector, then the result will be
        * the pair <code>(0,N)</code>, otherwise it will be a pair
-       * <code>(i,i+n)</code>, where <code>n=local_size()</code> and
-       * <code>i</code> is the first element of the vector stored on this
-       * processor, corresponding to the half open interval $[i,i+n)$
+       * <code>(i,i+n)</code>, where <code>n</code> is the number of elements
+       * stored on this processor and and <code>i</code> is the first element of
+       * the vector stored on this processor, corresponding to the half open
+       * interval $[i,i+n)$
        *
        * @note The description above is true most of the time, but not always.
        * In particular, Trilinos vectors need not store contiguous ranges of
@@ -1052,8 +1036,6 @@ namespace TrilinosWrappers
        * corresponds to the one given by the global indices in case the vector
        * is constructed from an IndexSet or other methods in deal.II (note that
        * an Epetra_Map can contain elements in arbitrary orders, though).
-       *
-       * It holds that end() - begin() == local_size().
        */
       iterator
       begin();
@@ -1775,14 +1757,6 @@ namespace TrilinosWrappers
 
 
 
-    inline Vector::size_type
-    Vector::local_size() const
-    {
-      return vector->Map().NumMyElements();
-    }
-
-
-
     inline Vector::size_type
     Vector::locally_owned_size() const
     {
index b39b919b347143df11d2b8e032601fb7940e7e81..c8e0946464db6dfa1c0b9e27702ad07c55838daf 100644 (file)
@@ -448,18 +448,6 @@ namespace PETScWrappers
 
 
 
-  VectorBase::size_type
-  VectorBase::local_size() const
-  {
-    PetscInt             sz;
-    const PetscErrorCode ierr = VecGetLocalSize(vector, &sz);
-    AssertThrow(ierr == 0, ExcPETScError(ierr));
-
-    return sz;
-  }
-
-
-
   std::pair<VectorBase::size_type, VectorBase::size_type>
   VectorBase::local_range() const
   {
@@ -749,33 +737,6 @@ namespace PETScWrappers
 
 
 
-  VectorBase::real_type
-  VectorBase::min() const
-  {
-    PetscInt  p;
-    real_type d;
-
-    const PetscErrorCode ierr = VecMin(vector, &p, &d);
-    AssertThrow(ierr == 0, ExcPETScError(ierr));
-
-    return d;
-  }
-
-
-  VectorBase::real_type
-  VectorBase::max() const
-  {
-    PetscInt  p;
-    real_type d;
-
-    const PetscErrorCode ierr = VecMax(vector, &p, &d);
-    AssertThrow(ierr == 0, ExcPETScError(ierr));
-
-    return d;
-  }
-
-
-
   bool
   VectorBase::all_zero() const
   {
@@ -830,38 +791,6 @@ namespace PETScWrappers
 
 
 
-  bool
-  VectorBase::is_non_negative() const
-  {
-    // get a representation of the vector and
-    // loop over all the elements
-    const PetscScalar *start_ptr;
-    PetscErrorCode     ierr = VecGetArrayRead(vector, &start_ptr);
-    AssertThrow(ierr == 0, ExcPETScError(ierr));
-
-    const PetscScalar *ptr  = start_ptr,
-                      *eptr = start_ptr + locally_owned_size();
-    bool flag               = true;
-    while (ptr != eptr)
-      {
-        if (!internal::is_non_negative(*ptr))
-          {
-            flag = false;
-            break;
-          }
-        ++ptr;
-      }
-
-    // restore the representation of the
-    // vector
-    ierr = VecRestoreArrayRead(vector, &start_ptr);
-    AssertThrow(ierr == 0, ExcPETScError(ierr));
-
-    return flag;
-  }
-
-
-
   VectorBase &
   VectorBase::operator*=(const PetscScalar a)
   {
index 231b55476f0bc7901a2d9d1f433487c4110cd8c9..1a73295d1a1c7fe33ab0cbd71002ce54359aaa51 100644 (file)
@@ -232,9 +232,9 @@ namespace TrilinosWrappers
   {
     // In case we call the solver with deal.II vectors, we create views of the
     // vectors in Epetra format.
-    AssertDimension(x.local_size(),
+    AssertDimension(x.locally_owned_size(),
                     A.trilinos_matrix().DomainMap().NumMyElements());
-    AssertDimension(b.local_size(),
+    AssertDimension(b.locally_owned_size(),
                     A.trilinos_matrix().RangeMap().NumMyElements());
 
     Epetra_Vector ep_x(View, A.trilinos_matrix().DomainMap(), x.begin());
@@ -258,8 +258,10 @@ namespace TrilinosWrappers
                     const dealii::LinearAlgebra::distributed::Vector<double> &b,
                     const PreconditionBase &preconditioner)
   {
-    AssertDimension(x.local_size(), A.OperatorDomainMap().NumMyElements());
-    AssertDimension(b.local_size(), A.OperatorRangeMap().NumMyElements());
+    AssertDimension(x.locally_owned_size(),
+                    A.OperatorDomainMap().NumMyElements());
+    AssertDimension(b.locally_owned_size(),
+                    A.OperatorRangeMap().NumMyElements());
 
     Epetra_Vector ep_x(View, A.OperatorDomainMap(), x.begin());
     Epetra_Vector ep_b(View,
@@ -858,9 +860,9 @@ namespace TrilinosWrappers
     dealii::LinearAlgebra::distributed::Vector<double> &      x,
     const dealii::LinearAlgebra::distributed::Vector<double> &b)
   {
-    AssertDimension(x.local_size(),
+    AssertDimension(x.locally_owned_size(),
                     A.trilinos_matrix().DomainMap().NumMyElements());
-    AssertDimension(b.local_size(),
+    AssertDimension(b.locally_owned_size(),
                     A.trilinos_matrix().RangeMap().NumMyElements());
     Epetra_Vector ep_x(View, A.trilinos_matrix().DomainMap(), x.begin());
     Epetra_Vector ep_b(View,
index b678ad6cb3e01ec3d25e30d42cd897eb0bf46a73..a862ec2c03572d939d66b6e413ebe34047e90fc0 100644 (file)
@@ -56,7 +56,7 @@ namespace TrilinosWrappers
       Assert(local_index >= 0,
              MPI::Vector::ExcAccessToNonLocalElement(
                index,
-               vector.local_size(),
+               vector.vector->Map().NumMyElements(),
                vector.vector->Map().MinMyGID(),
                vector.vector->Map().MaxMyGID()));
 
@@ -290,14 +290,15 @@ namespace TrilinosWrappers
       // vector. need to manually create an Epetra_Map.
       size_type n_elements = 0, added_elements = 0, block_offset = 0;
       for (size_type block = 0; block < v.n_blocks(); ++block)
-        n_elements += v.block(block).local_size();
+        n_elements += v.block(block).vector->Map().NumMyElements();
       std::vector<TrilinosWrappers::types::int_type> global_ids(n_elements, -1);
       for (size_type block = 0; block < v.n_blocks(); ++block)
         {
           TrilinosWrappers::types::int_type *glob_elements =
             TrilinosWrappers::my_global_elements(
               v.block(block).trilinos_partitioner());
-          for (size_type i = 0; i < v.block(block).local_size(); ++i)
+          size_type vector_size = v.block(block).vector->Map().NumMyElements();
+          for (size_type i = 0; i < vector_size; ++i)
             global_ids[added_elements++] = glob_elements[i] + block_offset;
           owned_elements.add_indices(v.block(block).owned_elements,
                                      block_offset);
@@ -317,7 +318,7 @@ namespace TrilinosWrappers
       for (size_type block = 0; block < v.n_blocks(); ++block)
         {
           v.block(block).trilinos_vector().ExtractCopy(entries, 0);
-          entries += v.block(block).local_size();
+          entries += v.block(block).vector->Map().NumMyElements();
         }
 
       if (import_data == true)
@@ -680,7 +681,7 @@ namespace TrilinosWrappers
         {
           Assert(false,
                  ExcAccessToNonLocalElement(index,
-                                            local_size(),
+                                            vector->Map().NumMyElements(),
                                             vector->Map().MinMyGID(),
                                             vector->Map().MaxMyGID()));
         }
@@ -731,11 +732,11 @@ namespace TrilinosWrappers
     Vector::operator==(const Vector &v) const
     {
       Assert(size() == v.size(), ExcDimensionMismatch(size(), v.size()));
-      if (local_size() != v.local_size())
+      if (vector->Map().NumMyElements() != v.vector->Map().NumMyElements())
         return false;
 
-      size_type i;
-      for (i = 0; i < local_size(); ++i)
+      size_type vector_size = vector->Map().NumMyElements();
+      for (size_type i = 0; i < vector_size; ++i)
         if ((*(v.vector))[0][i] != (*vector)[0][i])
           return false;
 
@@ -760,8 +761,9 @@ namespace TrilinosWrappers
       // get a representation of the vector and
       // loop over all the elements
       TrilinosScalar *      start_ptr = (*vector)[0];
-      const TrilinosScalar *ptr = start_ptr, *eptr = start_ptr + local_size();
-      unsigned int          flag = 0;
+      const TrilinosScalar *ptr       = start_ptr,
+                           *eptr = start_ptr + vector->Map().NumMyElements();
+      unsigned int flag          = 0;
       while (ptr != eptr)
         {
           if (*ptr != 0)
@@ -789,8 +791,9 @@ namespace TrilinosWrappers
       // get a representation of the vector and
       // loop over all the elements
       TrilinosScalar *      start_ptr = (*vector)[0];
-      const TrilinosScalar *ptr = start_ptr, *eptr = start_ptr + local_size();
-      unsigned int          flag = 0;
+      const TrilinosScalar *ptr       = start_ptr,
+                           *eptr = start_ptr + vector->Map().NumMyElements();
+      unsigned int flag          = 0;
       while (ptr != eptr)
         {
           if (*ptr < 0.0)
@@ -826,14 +829,16 @@ namespace TrilinosWrappers
       else
         out.setf(std::ios::fixed, std::ios::floatfield);
 
-      if (size() != local_size())
+      size_type vector_size = vector->Map().NumMyElements();
+      if (size() != vector_size)
         {
           auto global_id = [&](const size_type index) {
             return gid(vector->Map(), index);
           };
-          out << "size:" << size() << " local_size:" << local_size() << " :"
+          out << "size:" << size()
+              << " locally_owned_size:" << vector->Map().NumMyElements() << " :"
               << std::endl;
-          for (size_type i = 0; i < local_size(); ++i)
+          for (size_type i = 0; i < vector_size; ++i)
             out << "[" << global_id(i) << "]: " << (*(vector))[0][i]
                 << std::endl;
         }
@@ -880,7 +885,7 @@ namespace TrilinosWrappers
       // one index and the value per local
       // entry.
       return sizeof(*this) +
-             this->local_size() *
+             this->vector->Map().NumMyElements() *
                (sizeof(double) + sizeof(TrilinosWrappers::types::int_type));
     }
 
index 1c8a65a86115982fefcd2818d628dd160c523ba2..605d6b4d746f49ac7180a3dc804cda9d4f96b42f 100644 (file)
@@ -72,7 +72,7 @@ main(int argc, char *argv[])
   LinearAlgebra::distributed::Vector<double> solution(
     dof_handler.locally_owned_dofs(), MPI_COMM_WORLD);
   const double old_value = 10.;
-  for (unsigned int i = 0; i < solution.local_size(); ++i)
+  for (unsigned int i = 0; i < solution.locally_owned_size(); ++i)
     solution.local_element(i) = old_value;
 
   parallel::distributed::experimental::
@@ -108,13 +108,13 @@ main(int argc, char *argv[])
   unsigned int myid = Utilities::MPI::this_mpi_process(MPI_COMM_WORLD);
   if (myid == 0)
     {
-      for (unsigned int i = 0; i < new_solution.local_size(); ++i)
+      for (unsigned int i = 0; i < new_solution.locally_owned_size(); ++i)
         AssertThrow(new_solution.local_element(i) == old_value,
                     ExcInternalError());
     }
   else if (myid == 1)
     {
-      for (unsigned int i = 0; i < new_solution.local_size(); ++i)
+      for (unsigned int i = 0; i < new_solution.locally_owned_size(); ++i)
         AssertThrow(new_solution.local_element(i) == new_value,
                     ExcInternalError());
     }
index 735604a4c5a15083cdb5460a18c59cd0bde846c8..d034f6a4eef5888fc17eaefcc517a7978936d1c4 100644 (file)
@@ -75,7 +75,7 @@ main(int argc, char *argv[])
   LinearAlgebra::distributed::Vector<double> solution(
     dof_handler.locally_owned_dofs(), locally_relevant_dofs, MPI_COMM_WORLD);
   const double old_value = 1.;
-  for (unsigned int i = 0; i < solution.local_size(); ++i)
+  for (unsigned int i = 0; i < solution.locally_owned_size(); ++i)
     solution.local_element(i) = old_value;
 
   {
index 817c2463608c3167e6c8d1750d346054067f01c4..ac872a33a7b49d829dad697e4ff17b97aaa96e61 100644 (file)
@@ -57,7 +57,8 @@ test()
 
   LinearAlgebra::distributed::Vector<double, MemorySpace::Default> v(
     local_owned, local_relevant, MPI_COMM_WORLD);
-  AssertDimension(static_cast<unsigned int>(actual_local_size), v.local_size());
+  AssertDimension(static_cast<unsigned int>(actual_local_size),
+                  v.locally_owned_size());
   LinearAlgebra::distributed::Vector<double, MemorySpace::Default> w(v), x(v),
     y(v);
 
index 4a02b9c3a0f4a8f962f2bda6d0526c1f49e69854..96c73eafc04f68dbdf5b84bca295384420d87fcd 100644 (file)
@@ -93,10 +93,10 @@ test()
   v0_rw.import_elements(v0, VectorOperation::insert);
   LinearAlgebra::ReadWriteVector<double> v1_rw(local_owned1);
   v1_rw.import_elements(v1, VectorOperation::insert);
-  for (unsigned int i = 0; i < v0.local_size(); ++i)
+  for (unsigned int i = 0; i < v0.locally_owned_size(); ++i)
     AssertThrow(v0_rw.local_element(i) == 1.,
                 ExcNonEqual(v0_rw.local_element(i), 1.));
-  for (unsigned int i = 0; i < v1.local_size(); ++i)
+  for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
     AssertThrow(v1_rw.local_element(i) == 2.,
                 ExcNonEqual(v1_rw.local_element(i), 2.));
 
@@ -123,8 +123,8 @@ test()
 
   // now swap v1 and v0
   v0.swap(v1);
-  AssertDimension(v0.local_size(), local_size1);
-  AssertDimension(v1.local_size(), actual_local_size0);
+  AssertDimension(v0.locally_owned_size(), local_size1);
+  AssertDimension(v1.locally_owned_size(), actual_local_size0);
   AssertDimension(v0.size(), global_size1);
   AssertDimension(v1.size(), global_size0);
   v1_rw.import_elements(v0, VectorOperation::insert);
@@ -183,7 +183,7 @@ test()
   v2.swap(v0);
   AssertDimension(v0.size(), 0);
   AssertDimension(v2.size(), global_size1);
-  AssertDimension(v2.local_size(), local_size1);
+  AssertDimension(v2.locally_owned_size(), local_size1);
   v1_rw.import_elements(v2, VectorOperation::insert);
   for (int i = my_start1; i < my_end1; ++i)
     AssertThrow(v1_rw(i) == 7., ExcNonEqual(v1_rw(i), 7.));
index d861af1fc2344a0e3ac1719c2e366c41d8a36f92..d66900816004779466a0d04e1e72816bea58c0fc 100644 (file)
@@ -51,7 +51,7 @@ test()
 
   // set locally owned range of v2 manually
   Kokkos::View<double *, MemorySpace::Default::kokkos_space> v2_view(
-    v2.get_values(), v2.local_size());
+    v2.get_values(), v2.locally_owned_size());
   Kokkos::deep_copy(v2_view, 1.);
 
   // add entries to ghost values
index c777bbed4882f6948812aab1cc303cb75a3bbd2d..d458fbeea922fdfd40a02559dac339e3e05f3590 100644 (file)
@@ -34,13 +34,13 @@ test()
   is.add_range(10, 15);
   LinearAlgebra::ReadWriteVector<double> double_vector(is);
   LinearAlgebra::ReadWriteVector<float>  float_vector(float_size);
-  deallog << "double_size " << double_vector.n_elements() << std::endl;
-  deallog << "float_size " << float_vector.n_elements() << std::endl;
+  deallog << "double_size " << double_vector.locally_owned_size() << std::endl;
+  deallog << "float_size " << float_vector.locally_owned_size() << std::endl;
 
   double_vector = 0.;
-  for (unsigned int i = 0; i < double_vector.n_elements(); ++i)
+  for (unsigned int i = 0; i < double_vector.locally_owned_size(); ++i)
     double_vector.local_element(i) += i;
-  for (unsigned int i = 0; i < float_vector.n_elements(); ++i)
+  for (unsigned int i = 0; i < float_vector.locally_owned_size(); ++i)
     float_vector[i] = i;
 
   double_vector.print(deallog.get_file_stream());
@@ -52,7 +52,7 @@ test()
   LinearAlgebra::ReadWriteVector<double> double_vector2(double_vector);
   double_vector2.print(deallog.get_file_stream());
 
-  for (unsigned int i = 0; i < double_vector.n_elements(); ++i)
+  for (unsigned int i = 0; i < double_vector.locally_owned_size(); ++i)
     double_vector2.local_element(i) += i;
   double_vector = double_vector2;
   double_vector.print(deallog.get_file_stream());
index d3c8707da709d3462af3ae6d1b41b90496388c93..18799006eb62aa6ae8ccec5ca169e4f362501f64 100644 (file)
@@ -29,10 +29,10 @@ test()
   is.add_range(1, 3);
   is.add_index(7);
   LinearAlgebra::ReadWriteVector<double> vec(is);
-  deallog << "size: " << vec.n_elements() << std::endl;
+  deallog << "size: " << vec.locally_owned_size() << std::endl;
 
   vec = 0.;
-  for (unsigned int i = 0; i < vec.n_elements(); ++i)
+  for (unsigned int i = 0; i < vec.locally_owned_size(); ++i)
     vec.local_element(i) += i;
 
   vec.print(deallog.get_file_stream());
index 5035a6d205066851f49dc61b5e6cbd54b63df425..82ba843d5f077b5fa42933f497606d269b110176 100644 (file)
@@ -150,7 +150,7 @@ test()
         fe_eval.distribute_local_to_global(inv_mass_matrix);
       }
     inv_mass_matrix.compress(VectorOperation::add);
-    for (unsigned int k = 0; k < inv_mass_matrix.local_size(); ++k)
+    for (unsigned int k = 0; k < inv_mass_matrix.locally_owned_size(); ++k)
       if (inv_mass_matrix.local_element(k) > 1e-15)
         {
           inv_mass_matrix.local_element(k) =
index 70bf2f0630d771aed191c3bc3a3aee5f3f20da67..f0148eaf481ed187d0ac9b7b66961806722719ae 100644 (file)
@@ -160,7 +160,7 @@ test()
   matrix_free->initialize_dof_vector(dst3);
   matrix_free->initialize_dof_vector(dst4);
 
-  for (unsigned int i = 0; i < src.local_size(); ++i)
+  for (unsigned int i = 0; i < src.locally_owned_size(); ++i)
     src.local_element(i) = random_value<NumberType>();
 
   MatrixFreeOperators::MassOperator<
index 1d8950d119633f3d9aca31c624a1a17185e5b6dd..bab8f3ed06df4e043e449010eba6628ee8ef6aa9 100644 (file)
@@ -103,7 +103,7 @@ test()
     {
       Vector<double> solution_gather0(sol.size());
       double *       sol_gather_ptr = solution_gather0.begin();
-      for (unsigned int i = 0; i < sol.local_size(); ++i)
+      for (unsigned int i = 0; i < sol.locally_owned_size(); ++i)
         *sol_gather_ptr++ = sol.local_element(i);
       for (unsigned int i = 1;
            i < Utilities::MPI::n_mpi_processes(MPI_COMM_WORLD);
@@ -122,7 +122,7 @@ test()
     }
   else
     MPI_Send(sol.begin(),
-             sol.local_size(),
+             sol.locally_owned_size(),
              MPI_DOUBLE,
              0,
              Utilities::MPI::this_mpi_process(MPI_COMM_WORLD),
index 0e050390815540fe8569b7450363fabe7a71c0b7..8d7062a9cc77b451c2b7e84aa64831c3d248848d 100644 (file)
@@ -78,13 +78,13 @@ main(int argc, char **argv)
 
   deallog << "main partitioner: size="
           << matrix_free.get_dof_info().vector_partitioner->size()
-          << " local_size="
-          << matrix_free.get_dof_info().vector_partitioner->local_size()
+          << " locally_owned_size="
+          << matrix_free.get_dof_info().vector_partitioner->locally_owned_size()
           << " n_ghosts="
           << matrix_free.get_dof_info().vector_partitioner->n_ghost_indices()
           << std::endl;
   for (auto &p : matrix_free.get_dof_info().vector_exchanger_face_variants)
     deallog << "partitioner: size=" << p->size()
-            << " local_size=" << p->locally_owned_size()
+            << " locally_owned_size=" << p->locally_owned_size()
             << " n_ghosts=" << p->n_ghost_indices() << std::endl;
 }
index 86e0e01e6c53974c1dd042b782b6eb094fd1dbca..4aa4cbb0d2348d1eb271e5b0bfcaef07fc345e6d 100644 (file)
@@ -1,7 +1,7 @@
 
-DEAL:0::main partitioner: size=2506 local_size=2506 n_ghosts=0
-DEAL:0::partitioner: size=2506 local_size=2506 n_ghosts=0
-DEAL:0::partitioner: size=2506 local_size=2506 n_ghosts=0
-DEAL:0::partitioner: size=2506 local_size=2506 n_ghosts=0
-DEAL:0::partitioner: size=2506 local_size=2506 n_ghosts=0
-DEAL:0::partitioner: size=2506 local_size=2506 n_ghosts=0
+DEAL:0::main partitioner: size=2506 locally_owned_size=2506 n_ghosts=0
+DEAL:0::partitioner: size=2506 locally_owned_size=2506 n_ghosts=0
+DEAL:0::partitioner: size=2506 locally_owned_size=2506 n_ghosts=0
+DEAL:0::partitioner: size=2506 locally_owned_size=2506 n_ghosts=0
+DEAL:0::partitioner: size=2506 locally_owned_size=2506 n_ghosts=0
+DEAL:0::partitioner: size=2506 locally_owned_size=2506 n_ghosts=0
index 205ec4c86ebafc7380c7c7bc68cf3d567945c187..9a6f712ab6f177872a516d30fd5dfb6263338769 100644 (file)
@@ -1,15 +1,15 @@
 
-DEAL:0::main partitioner: size=2506 local_size=1492 n_ghosts=273
-DEAL:0::partitioner: size=2506 local_size=1492 n_ghosts=0
-DEAL:0::partitioner: size=2506 local_size=1492 n_ghosts=273
-DEAL:0::partitioner: size=2506 local_size=1492 n_ghosts=273
-DEAL:0::partitioner: size=2506 local_size=1492 n_ghosts=0
-DEAL:0::partitioner: size=2506 local_size=1492 n_ghosts=0
+DEAL:0::main partitioner: size=2506 locally_owned_size=1492 n_ghosts=273
+DEAL:0::partitioner: size=2506 locally_owned_size=1492 n_ghosts=0
+DEAL:0::partitioner: size=2506 locally_owned_size=1492 n_ghosts=273
+DEAL:0::partitioner: size=2506 locally_owned_size=1492 n_ghosts=273
+DEAL:0::partitioner: size=2506 locally_owned_size=1492 n_ghosts=0
+DEAL:0::partitioner: size=2506 locally_owned_size=1492 n_ghosts=0
 
-DEAL:1::main partitioner: size=2506 local_size=1014 n_ghosts=442
-DEAL:1::partitioner: size=2506 local_size=1014 n_ghosts=169
-DEAL:1::partitioner: size=2506 local_size=1014 n_ghosts=442
-DEAL:1::partitioner: size=2506 local_size=1014 n_ghosts=442
-DEAL:1::partitioner: size=2506 local_size=1014 n_ghosts=0
-DEAL:1::partitioner: size=2506 local_size=1014 n_ghosts=0
+DEAL:1::main partitioner: size=2506 locally_owned_size=1014 n_ghosts=442
+DEAL:1::partitioner: size=2506 locally_owned_size=1014 n_ghosts=169
+DEAL:1::partitioner: size=2506 locally_owned_size=1014 n_ghosts=442
+DEAL:1::partitioner: size=2506 locally_owned_size=1014 n_ghosts=442
+DEAL:1::partitioner: size=2506 locally_owned_size=1014 n_ghosts=0
+DEAL:1::partitioner: size=2506 locally_owned_size=1014 n_ghosts=0
 
index f7c0da4f75e8f0f89df252452ef0bf5bd52bc079..951cd611a8809a0c9d9641f47de64e16894be362 100644 (file)
@@ -130,7 +130,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 1c49149a7d651a1373d1351b193c06bcb78c7c83..cfa713ab628df55544712dfdf064bddfd47991f2 100644 (file)
@@ -191,7 +191,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 0338181cfbac38f9f4a3c1b7eff9edc4915f1434..b17b20469be8217ebbce855b9b59d94e26dd2eb2 100644 (file)
@@ -141,7 +141,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 401134a0e83aa228a2e57d7f0f65a52833aeb314..6460fc584d6962f4d270324ac88d903ae6902a56 100644 (file)
@@ -133,7 +133,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 2712dbe450babe5612c5e57be357d0d2e9ce37dd..edd49406d2e5f4c0b7e06b0aafc306bafbc34928 100644 (file)
@@ -66,7 +66,7 @@ do_test(const unsigned int n_refine, const bool overlap_communication)
 
   LinearAlgebra::distributed::Vector<double> in, ref, test;
   matrix_free.initialize_dof_vector(in);
-  for (unsigned int i = 0; i < in.get_partitioner()->local_size(); ++i)
+  for (unsigned int i = 0; i < in.get_partitioner()->locally_owned_size(); ++i)
     in.local_element(i) = in.get_partitioner()->local_to_global(i);
   matrix_free.initialize_dof_vector(ref);
   matrix_free.initialize_dof_vector(test);
index 5a4a3b27d92388928c8c10cea9fe1096f07d5b15..81301a46bf428649f6033765b85bc1bbbcd4b785 100644 (file)
@@ -68,7 +68,7 @@ do_test(const unsigned int n_refine)
 
   LinearAlgebra::distributed::Vector<double> in, test;
   matrix_free.initialize_dof_vector(in);
-  for (unsigned int i = 0; i < in.get_partitioner()->local_size(); ++i)
+  for (unsigned int i = 0; i < in.get_partitioner()->locally_owned_size(); ++i)
     in.local_element(i) = in.get_partitioner()->local_to_global(i);
   matrix_free.initialize_dof_vector(test);
 
index 637b49c0ee9fdfc56a2751deef3e45378b4e9040..4d2dcca3b6783a2b5a5f0b7fb7d4416876205553 100644 (file)
@@ -136,7 +136,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index fd0d58bb8811c724e04dbf6362b0cce7c63a2c22..259f5b9167dd9def99b6667b9770bc282e9f786f 100644 (file)
@@ -104,7 +104,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
@@ -169,7 +169,7 @@ test()
   sparse_matrix.compress(VectorOperation::add);
 
   // Check the diagonal:
-  for (unsigned int i = 0; i < ref.local_size(); ++i)
+  for (unsigned int i = 0; i < ref.locally_owned_size(); ++i)
     {
       const auto glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
@@ -190,7 +190,7 @@ test()
   mf.compute_lumped_diagonal();
   out = mf.get_matrix_lumped_diagonal_inverse()->get_vector();
   sparse_matrix.vmult(ref, in);
-  for (unsigned int i = 0; i < ref.local_size(); ++i)
+  for (unsigned int i = 0; i < ref.locally_owned_size(); ++i)
     {
       const auto glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index bbb735e4b20ee836ca0700ff617bbb57c7cdb966..af52f3bca1fb69e245d63fde727463f4e332448d 100644 (file)
@@ -101,7 +101,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
@@ -166,7 +166,7 @@ test()
   sparse_matrix.compress(VectorOperation::add);
 
   // Check the diagonal:
-  for (unsigned int i = 0; i < ref.local_size(); ++i)
+  for (unsigned int i = 0; i < ref.locally_owned_size(); ++i)
     {
       const auto glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
@@ -187,7 +187,7 @@ test()
   mf.compute_lumped_diagonal();
   out = mf.get_matrix_lumped_diagonal_inverse()->get_vector();
   sparse_matrix.vmult(ref, in);
-  for (unsigned int i = 0; i < ref.local_size(); ++i)
+  for (unsigned int i = 0; i < ref.locally_owned_size(); ++i)
     {
       const auto glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 198162da6b33b794b6a8d7d31c4cdfd1aad3b343..c6dae574018c7b5a7f38f6639cc65a4d76d7a713 100644 (file)
@@ -100,7 +100,7 @@ test()
   LinearAlgebra::distributed::Vector<number> in, out, ref;
   mf_data_0->initialize_dof_vector(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     in.local_element(i) = random_value<double>();
 
   mf_c0.initialize_dof_vector(out);
index 16146e92145529313a76b6c404eca6a8c01a5795..b3b7b040d964f702a3807ae949168d85b60da7c8 100644 (file)
@@ -129,7 +129,7 @@ test()
   mf_data.initialize_dof_vector(out_dev);
 
   LinearAlgebra::ReadWriteVector<Number> rw_in(owned_set);
-  for (unsigned int i = 0; i < in_dev.local_size(); ++i)
+  for (unsigned int i = 0; i < in_dev.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 54b6be51e98a41a1f6f4b36b9b59cf88795e1097..9b79c0aa027870c700de700c352b6e429963d4ff 100644 (file)
@@ -131,7 +131,7 @@ test()
   mf_data.initialize_dof_vector(in_dev);
   mf_data.initialize_dof_vector(out_dev);
   LinearAlgebra::ReadWriteVector<Number> rw_in(owned_set);
-  for (unsigned int i = 0; i < in_dev.local_size(); ++i)
+  for (unsigned int i = 0; i < in_dev.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index cea9e145f972aeb8c6199d037c8f364608ba0994..b96b9dc104094679b36de444ee770597511ebd3f 100644 (file)
@@ -125,7 +125,7 @@ test()
     owned_set, MPI_COMM_WORLD);
 
   LinearAlgebra::ReadWriteVector<Number> rw_in(owned_set);
-  for (unsigned int i = 0; i < in_dev.local_size(); ++i)
+  for (unsigned int i = 0; i < in_dev.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index d0742618aa8e04ed36852a2243259d65fd871573..846dfd6fb96fd2f26cceb194e37c2799ecb027cb 100644 (file)
@@ -132,7 +132,7 @@ test()
   mf_data.initialize_dof_vector(out_dev);
 
   LinearAlgebra::ReadWriteVector<Number> rw_in(owned_set);
-  for (unsigned int i = 0; i < in_dev.local_size(); ++i)
+  for (unsigned int i = 0; i < in_dev.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index a6ea74120b9ffb27ff25749f698e3a119c652714..17ce91d662805e04fdbebbd7b5607a941fcf67ff 100644 (file)
@@ -138,7 +138,7 @@ test()
   mf_data.initialize_dof_vector(out_dev);
 
   LinearAlgebra::ReadWriteVector<Number> rw_in(owned_set);
-  for (unsigned int i = 0; i < in_dev.local_size(); ++i)
+  for (unsigned int i = 0; i < in_dev.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index c1aa6bef6f82dcab5bec24c16fcc114c06ab5594..3cefe101aeeb627216e5edaebb48ae1f23e64cc2 100644 (file)
@@ -108,13 +108,13 @@ test()
 
   MappingQ<dim>                         mapping(fe_degree);
   CUDAWrappers::MatrixFree<dim, Number> mf_data;
-  const QGauss<1>                       quad(fe_degree + 1);
+  const QGauss<1>                       uad(fe_degree + 1);
   typename CUDAWrappers::MatrixFree<dim, Number>::AdditionalData
     additional_data;
   additional_data.mapping_update_flags = update_values | update_gradients |
                                          update_JxW_values |
                                          update_quadrature_points;
-  mf_data.reinit(mapping, dof, constraints, quad, additional_data);
+  mf_data.reinit(mapping, dof, constraints, uad, additional_data);
 
   const unsigned int coef_size =
     tria.n_locally_owned_active_cells() * std::pow(fe_degree + 1, dim);
@@ -131,7 +131,7 @@ test()
     owned_set, MPI_COMM_WORLD);
 
   LinearAlgebra::ReadWriteVector<Number> rw_in(owned_set);
-  for (unsigned int i = 0; i < in_dev.local_size(); ++i)
+  for (unsigned int i = 0; i < in_dev.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index fcf28f070804ba6e4c2bcaacbc7b748b4619dc9e..f60cb23fc882ea1be06774d19f29de33810ac5bb 100644 (file)
@@ -131,7 +131,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index d25b7011362da4b433ab5e3f59e9407cc90f4e05..efe6627224f3acdf326a60ea4efa8daef395de89 100644 (file)
@@ -124,7 +124,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 0d35c5e19b7f10672132d08c008cb4218a25e4cd..4d72016c9ed95d2f474a6c0d4b89124d6e3c34ac 100644 (file)
@@ -189,7 +189,7 @@ test()
     }
   mf_data.initialize_dof_vector(ref);
 
-  for (unsigned int i = 0; i < in[0].local_size(); ++i)
+  for (unsigned int i = 0; i < in[0].locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 5770be7e8705661d40b9b3da4b3e221969ee88e7..96e358118f2448ea167c2772355c822f1495d5a5 100644 (file)
@@ -190,7 +190,7 @@ test()
 
   mf_data.initialize_dof_vector(ref);
 
-  for (unsigned int i = 0; i < in.block(0).local_size(); ++i)
+  for (unsigned int i = 0; i < in.block(0).locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index ebe1085ddf7f399318e22f6fc5022fb1ac4f0007..3e97adc2484f5ca07f5977f6478657823b2a3add 100644 (file)
@@ -125,7 +125,7 @@ test()
   out.reinit(in);
   ref.reinit(in);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index 22d5b90d378a71664dad0aa0fdbb8374de7a88fe..bdfa86fba90a0cf73ccac245e55197bd7e9356dd 100644 (file)
@@ -195,7 +195,7 @@ test()
   out.collect_sizes();
   mf_data.initialize_dof_vector(ref);
 
-  for (unsigned int i = 0; i < in.block(0).local_size(); ++i)
+  for (unsigned int i = 0; i < in.block(0).locally_owned_size(); ++i)
     {
       if (constraints.is_constrained(
             dof.locally_owned_dofs().index_within_set(i)))
index 051b6da361ddf6d0b8d0aa8cefcd8dad36566124..8534a2006e175621e9e9e9a01a9fc1b0afabfaa3 100644 (file)
@@ -185,7 +185,7 @@ test()
   out.collect_sizes();
   mf_data.initialize_dof_vector(ref);
 
-  for (unsigned int i = 0; i < in.block(0).local_size(); ++i)
+  for (unsigned int i = 0; i < in.block(0).locally_owned_size(); ++i)
     {
       if (constraints.is_constrained(
             dof.locally_owned_dofs().index_within_set(i)))
index 9024633c7a7130d627cc4971268e4ab301b70ec9..5ded5f1a0c9478ff37fb3e16a53c01f0388a75fc 100644 (file)
@@ -190,7 +190,7 @@ test()
     }
   mf_data.initialize_dof_vector(ref);
 
-  for (unsigned int i = 0; i < in[0].local_size(); ++i)
+  for (unsigned int i = 0; i < in[0].locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index aff768c0592c4e9f9b97caa26b3e62d6be3fe8bb..855ba70854266b9ede09f7bca01fb35322f0aa8d 100644 (file)
@@ -201,7 +201,7 @@ test()
     }
   mf_data.initialize_dof_vector(ref);
 
-  for (unsigned int i = 0; i < in[0].local_size(); ++i)
+  for (unsigned int i = 0; i < in[0].locally_owned_size(); ++i)
     {
       const unsigned int glob_index = owned_set.nth_index_in_set(i);
       if (constraints.is_constrained(glob_index))
index fbf0251f03d7a11bf2d164d68518faf6ccdcf133..cb273177bb03730a82cfffb1571f3d42c60aa467 100644 (file)
@@ -187,7 +187,8 @@ test()
       // matrix-vector product for reference
       for (unsigned int block = 0; block < n_blocks; ++block)
         {
-          for (unsigned int i = 0; i < in.block(block).local_size(); ++i)
+          for (unsigned int i = 0; i < in.block(block).locally_owned_size();
+               ++i)
             {
               const unsigned int glob_index = owned_set.nth_index_in_set(i);
               if (constraints.is_constrained(glob_index))
index b616c68077056a9d6438173ac838c9685d105ad2..5e328a9f189fd2eaeb4a1147c1ce2151f7e1898b 100644 (file)
@@ -96,7 +96,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const double entry  = Testing::rand() / (double)RAND_MAX;
       in.local_element(i) = entry;
index 7f42390cd1748410bb01d5b9e7add651b95d9712..c99113ea9ea392c92e51e58bc6e61b358dac74c8 100644 (file)
@@ -97,7 +97,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const double entry  = Testing::rand() / (double)RAND_MAX;
       in.local_element(i) = entry;
index 525d43ae37654f43839e6509092097f2728140db..9a539428d2f03cd5bab98adac18fbb4500dee109 100644 (file)
@@ -103,7 +103,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const double entry  = Testing::rand() / (double)RAND_MAX;
       in.local_element(i) = entry;
index 4aaa2847f22669099d31a5aaec2e742c8f8e755f..6029cddd49c4c69a00ce5c30af688be74411b83c 100644 (file)
@@ -109,7 +109,7 @@ test()
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index 33632d3567d325889cb23843a0275af4d2ae6550..1d6e7a6cef362d5ada66b7743593c7d6be74a544 100644 (file)
@@ -113,7 +113,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in_orig.local_size(); ++i)
+  for (unsigned int i = 0; i < in_orig.locally_owned_size(); ++i)
     {
       const double entry       = Testing::rand() / (double)RAND_MAX;
       in_orig.local_element(i) = entry;
@@ -136,7 +136,7 @@ test()
     mf2(mf_data);
   mf2.vmult(out, in);
 
-  for (unsigned int i = 0; i < out.local_size(); ++i)
+  for (unsigned int i = 0; i < out.locally_owned_size(); ++i)
     out(renumbering[i]) -= out_orig.local_element(i);
 
   double diff_norm = out.linfty_norm() / out_orig.linfty_norm();
@@ -145,7 +145,7 @@ test()
   // test again, now doing matrix-vector product twice
   mf2.vmult(out, in);
   mf2.vmult(out, in);
-  for (unsigned int i = 0; i < out.local_size(); ++i)
+  for (unsigned int i = 0; i < out.locally_owned_size(); ++i)
     out(renumbering[i]) -= out_orig.local_element(i);
   diff_norm = out.linfty_norm() / out_orig.linfty_norm();
   deallog << diff_norm << std::endl;
index 8113b1080fdc4bfcc6f0998e6f57379de182b0dd..4c5de90f090615b60900befe5e478942d3268c4a 100644 (file)
@@ -91,7 +91,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const double entry  = Testing::rand() / (double)RAND_MAX;
       in.local_element(i) = entry;
@@ -108,14 +108,14 @@ test()
   mf_data.reinit(MappingQ1<mydim>{}, dof, constraints, quad, data);
   mf_data.initialize_dof_vector(in2);
   mf_data.initialize_dof_vector(out2);
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       in2(renumbering[i]) = in.local_element(i);
     }
 
   mf.vmult(out2, in2);
 
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     out2(renumbering[i]) -= out.local_element(i);
 
   double diff_norm = out2.linfty_norm() / out.linfty_norm();
index 9258e356bf70c35738aa2c1ee9da467dc946f02a..cdf9766f1cacfcf06b5240bec5113b3353648360 100644 (file)
@@ -108,7 +108,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in_orig.local_size(); ++i)
+  for (unsigned int i = 0; i < in_orig.locally_owned_size(); ++i)
     {
       const double entry       = Testing::rand() / (double)RAND_MAX;
       in_orig.local_element(i) = entry;
@@ -131,7 +131,7 @@ test()
     mf2(mf_data);
   mf2.vmult(out, in);
 
-  for (unsigned int i = 0; i < out.local_size(); ++i)
+  for (unsigned int i = 0; i < out.locally_owned_size(); ++i)
     out(renumbering[i]) -= out_orig.local_element(i);
 
   double diff_norm = out.linfty_norm() / out_orig.linfty_norm();
@@ -140,7 +140,7 @@ test()
   // test again, now doing matrix-vector product twice
   mf2.vmult(out, in);
   mf2.vmult(out, in);
-  for (unsigned int i = 0; i < out.local_size(); ++i)
+  for (unsigned int i = 0; i < out.locally_owned_size(); ++i)
     out(renumbering[i]) -= out_orig.local_element(i);
   diff_norm = out.linfty_norm() / out_orig.linfty_norm();
   deallog << diff_norm << std::endl;
index 07881ce4789c98b82e232ab0ae5731c12c9254a6..e2b1007359f1035b3166916013585190d719cdac 100644 (file)
@@ -200,7 +200,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in_orig.local_size(); ++i)
+  for (unsigned int i = 0; i < in_orig.locally_owned_size(); ++i)
     {
       const double entry       = Testing::rand() / (double)RAND_MAX;
       in_orig.local_element(i) = entry;
@@ -223,7 +223,7 @@ test()
     mf2(mf_data);
   mf2.vmult(out, in);
 
-  for (unsigned int i = 0; i < out.local_size(); ++i)
+  for (unsigned int i = 0; i < out.locally_owned_size(); ++i)
     out(renumbering[i]) -= out_orig.local_element(i);
 
   double diff_norm = out.linfty_norm() / out_orig.linfty_norm();
@@ -232,7 +232,7 @@ test()
   // test again, now doing matrix-vector product twice
   mf2.vmult(out, in);
   mf2.vmult(out, in);
-  for (unsigned int i = 0; i < out.local_size(); ++i)
+  for (unsigned int i = 0; i < out.locally_owned_size(); ++i)
     out(renumbering[i]) -= out_orig.local_element(i);
   diff_norm = out.linfty_norm() / out_orig.linfty_norm();
   deallog << diff_norm << std::endl;
index 9948af169033f398b6dd759fb6b0ffa18526d3af..18488c2fa44fc4f3fe0861ac95ec00ca4f0609a0 100644 (file)
@@ -103,7 +103,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const double entry  = Testing::rand() / (double)RAND_MAX;
       in.local_element(i) = entry;
index 68f0f0a88309b9c728767730ef20cb8d867eaacf..6fc35a5fad997484fb216e253373c2c9652827b0 100644 (file)
@@ -105,7 +105,7 @@ test()
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index ae66a5a425e02680eb7db72db031f441941d1dea..ea8ce159b4719039da2bb40a70123b31b35052de 100644 (file)
@@ -115,7 +115,7 @@ test()
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index 0f271f47401f4b37c31b8bca2e669c2e8d75aeee..e6cd119aac88aed41826ca3c1556ea8e1856a21d 100644 (file)
@@ -104,7 +104,7 @@ test()
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index 0371e4f319f0e51cd7f7baee7a693a3deee0f4a7..68832694e16ca1c22af0dfb1c5a8cff162d76f3d 100644 (file)
@@ -115,7 +115,7 @@ test()
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index 6bed676539c70fdaa6273fe9ed5af146fdbae45e..f65f0eeaa4ef972e9b94d4eb9b28b4e412e1f909 100644 (file)
@@ -89,7 +89,7 @@ test()
 
   // Set random seed for reproducibility
   Testing::srand(42);
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     {
       const double entry  = Testing::rand() / (double)RAND_MAX;
       in.local_element(i) = entry;
index 36cebb6dcf19f7e040d785874abd925a72710628..c5921e2a0426d5d54bc46c70c0ac15276bbc4fff 100644 (file)
@@ -111,7 +111,7 @@ test()
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.block(0).local_size(); ++i)
+      for (unsigned int i = 0; i < in.block(0).locally_owned_size(); ++i)
         {
           const double entry           = Testing::rand() / (double)RAND_MAX;
           in.block(0).local_element(i) = entry;
index 6ab6b2c7e2dcaa2875a58cd76d56302d20d04af0..8a3a2957f73c9510a086d3fc6c93ab73d1e0529e 100644 (file)
@@ -106,7 +106,7 @@ test()
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index f2295e473f9de1c12d6a25bd910a0349a8ce5325..64973066ab33766de5f4f1f28d50b9794d1e0729 100644 (file)
@@ -101,7 +101,7 @@ do_test(const unsigned int fe_degree)
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index 81765a14ad21b88ae8aaaa072489176e687a64ba..587113b8ef16bc76da9c2d3a1a965fd200ce74ee 100644 (file)
@@ -101,7 +101,7 @@ do_test(const unsigned int fe_degree)
 
       // Set random seed for reproducibility
       Testing::srand(42);
-      for (unsigned int i = 0; i < in.local_size(); ++i)
+      for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
         {
           const double entry  = Testing::rand() / (double)RAND_MAX;
           in.local_element(i) = entry;
index 7ae65e2e52d133f9a73e6b783f21e8d217752dbf..2d3e3c2e3939628c3b073bc1db7132eb2429b804 100644 (file)
@@ -281,7 +281,8 @@ private:
               inverse_diagonal_entries,
               dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index 46747662bce319a3a6a864352590b3ee7a90deea..bcb67a23429cdbafed47b8e41686e237f751e1e4 100644 (file)
@@ -290,7 +290,8 @@ private:
               inverse_diagonal_entries,
               dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index b8ef61ad9638dfd6d480aa9943e5075902926c78..fb5ac5cc66b1436b890819566ba1002321b4e6df 100644 (file)
@@ -291,7 +291,8 @@ private:
                    inverse_diagonal_entries,
                    dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index a7078d2db6e686a85c559271c2bb4e66426afb2a..f07fa4d7093fb783f4d08551f251cdefc3fcb69a 100644 (file)
@@ -228,7 +228,8 @@ private:
                    inverse_diagonal_entries,
                    dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index 6a5b765e3dd54393979a5f27f871169edd6f00d5..280bf0d9836a504084551c81022e1aee9b3dc665 100644 (file)
@@ -226,7 +226,7 @@ public:
           .local_element(edge_constrained_indices[i]) =
           edge_constrained_values[i].first;
       }
-    for (; c < dst.local_size(); ++c)
+    for (; c < dst.locally_owned_size(); ++c)
       dst.local_element(c) = 0.;
   }
 
@@ -255,7 +255,7 @@ public:
           src_cpy.local_element(c) = 0.;
         ++c;
       }
-    for (; c < src_cpy.local_size(); ++c)
+    for (; c < src_cpy.locally_owned_size(); ++c)
       src_cpy.local_element(c) = 0.;
 
     data.cell_loop(&LaplaceOperator::local_apply, this, dst, src_cpy);
@@ -347,7 +347,8 @@ private:
       }
 
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
@@ -533,7 +534,7 @@ do_test(const DoFHandler<dim> &dof)
   fine_matrix.initialize_dof_vector(sol);
 
   // set constant rhs vector
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     if (!hanging_node_constraints.is_constrained(
           in.get_partitioner()->local_to_global(i)))
       in.local_element(i) = 1.;
index bcd99ec1181199fbfcf3373a5c40d9b3ab156edf..b011872bcb3c87560555b83fe8213b8bf91fc9a6 100644 (file)
@@ -194,7 +194,7 @@ do_test(const DoFHandler<dim> &dof)
     DoFTools::make_hanging_node_constraints(dof, hanging_node_constraints);
     hanging_node_constraints.close();
 
-    for (unsigned int i = 0; i < in.local_size(); ++i)
+    for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
       if (!hanging_node_constraints.is_constrained(
             in.get_partitioner()->local_to_global(i)))
         in.local_element(i) = 1.;
index 760842f95c46f3a4161e9177fd4df6cd3de4e468..d932c4211c0989d157e8fe0da01da4cb25a5224f 100644 (file)
@@ -233,7 +233,7 @@ public:
           .local_element(edge_constrained_indices[i]) =
           edge_constrained_values[i].first;
       }
-    for (; c < dst.local_size(); ++c)
+    for (; c < dst.locally_owned_size(); ++c)
       dst.local_element(c) = 0.;
   }
 
@@ -262,7 +262,7 @@ public:
           src_cpy.local_element(c) = 0.;
         ++c;
       }
-    for (; c < src_cpy.local_size(); ++c)
+    for (; c < src_cpy.locally_owned_size(); ++c)
       src_cpy.local_element(c) = 0.;
 
     data.cell_loop(&LaplaceOperator::local_apply, this, dst, src_cpy);
@@ -354,7 +354,8 @@ private:
       }
 
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
@@ -542,7 +543,7 @@ do_test(const DoFHandler<dim> &dof, const bool threaded)
   fine_matrix.initialize_dof_vector(sol);
 
   // set constant rhs vector
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     if (!hanging_node_constraints.is_constrained(
           in.get_partitioner()->local_to_global(i)))
       in.local_element(i) = 1.;
index ebbd790bb928d8184524504bbc5dd7aaeeb6f98c..45c1106b95cab2f8773490c7d3bf082c6db75bf2 100644 (file)
@@ -194,7 +194,7 @@ do_test(const DoFHandler<dim> &dof)
     DoFTools::make_hanging_node_constraints(dof, hanging_node_constraints);
     hanging_node_constraints.close();
 
-    for (unsigned int i = 0; i < in.local_size(); ++i)
+    for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
       if (!hanging_node_constraints.is_constrained(
             in.get_partitioner()->local_to_global(i)))
         in.local_element(i) = 1.;
index d0b8c1338c2e73f14a4442a3634295c1d6dff3b3..96b5394ad996a5d2ad3b402ad121877f26d3bb83 100644 (file)
@@ -230,7 +230,7 @@ public:
           .local_element(edge_constrained_indices[i]) =
           edge_constrained_values[i].first;
       }
-    for (; c < dst.local_size(); ++c)
+    for (; c < dst.locally_owned_size(); ++c)
       dst.local_element(c) = 0.;
   }
 
@@ -259,7 +259,7 @@ public:
           src_cpy.local_element(c) = 0.;
         ++c;
       }
-    for (; c < src_cpy.local_size(); ++c)
+    for (; c < src_cpy.locally_owned_size(); ++c)
       src_cpy.local_element(c) = 0.;
 
     data.cell_loop(&LaplaceOperator::local_apply, this, dst, src_cpy);
@@ -351,7 +351,8 @@ private:
       }
 
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
@@ -539,7 +540,7 @@ do_test(const DoFHandler<dim> &dof, const bool threaded)
   fine_matrix.initialize_dof_vector(sol);
 
   // set constant rhs vector
-  for (unsigned int i = 0; i < in.local_size(); ++i)
+  for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
     if (!hanging_node_constraints.is_constrained(
           in.get_partitioner()->local_to_global(i)))
       in.local_element(i) = 1.;
index d68633eb1b06d754b4c140954d971d1ba522bb60..59bc3445a72fc28f0ec33efc65df69978e552ecd 100644 (file)
@@ -283,7 +283,7 @@ do_test(const DoFHandler<dim> &dof, const unsigned int nb)
     DoFTools::make_hanging_node_constraints(dof, hanging_node_constraints);
     hanging_node_constraints.close();
 
-    for (unsigned int i = 0; i < in.block(0).local_size(); ++i)
+    for (unsigned int i = 0; i < in.block(0).locally_owned_size(); ++i)
       if (!hanging_node_constraints.is_constrained(
             in.block(0).get_partitioner()->local_to_global(i)))
         in.block(0).local_element(i) = 1.;
index fe6aea7d38f2980521bc5472df43de627e8f6751..950889193df63fc70c0d0007776b73580962f897 100644 (file)
@@ -195,7 +195,7 @@ do_test(const DoFHandler<dim> &dof)
     DoFTools::make_hanging_node_constraints(dof, hanging_node_constraints);
     hanging_node_constraints.close();
 
-    for (unsigned int i = 0; i < in.local_size(); ++i)
+    for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
       if (!hanging_node_constraints.is_constrained(
             in.get_partitioner()->local_to_global(i)))
         in.local_element(i) = 1.;
index 87eb5faecfb0fa18984e3f79f3533629adaedaa0..d5accb855f2f07e8d8310c2f84b0d402a81e3c5c 100644 (file)
@@ -306,7 +306,7 @@ do_test(const std::vector<const DoFHandler<dim> *> &dof)
                                                 hanging_node_constraints);
         hanging_node_constraints.close();
 
-        for (unsigned int i = 0; i < in.block(b).local_size(); ++i)
+        for (unsigned int i = 0; i < in.block(b).locally_owned_size(); ++i)
           if (!hanging_node_constraints.is_constrained(
                 in.block(b).get_partitioner()->local_to_global(i)))
             in.block(b).local_element(i) = 1.;
index b57ab0b5b599cfcaa8f8f0c1cd27d2fa3e4eacb3..39d4afd56cf29e60175f6155f0425541a888f2bc 100644 (file)
@@ -160,10 +160,11 @@ private:
         this->data->get_dof_info(0).vector_partitioner.get())
       return;
 
-    Assert(vec.get_partitioner()->local_size() ==
-             this->data->get_dof_info(0).vector_partitioner->local_size(),
-           ExcMessage("The vector passed to the vmult() function does not have "
-                      "the correct size for compatibility with MatrixFree."));
+    Assert(
+      vec.get_partitioner()->locally_owned_size() ==
+        this->data->get_dof_info(0).vector_partitioner->locally_owned_size(),
+      ExcMessage("The vector passed to the vmult() function does not have "
+                 "the correct size for compatibility with MatrixFree."));
     LinearAlgebra::distributed::Vector<Number> copy_vec(vec);
     this->data->initialize_dof_vector(
       const_cast<LinearAlgebra::distributed::Vector<Number> &>(vec), 0);
@@ -270,7 +271,7 @@ do_test(const DoFHandler<dim> &dof)
     DoFTools::make_hanging_node_constraints(dof, hanging_node_constraints);
     hanging_node_constraints.close();
 
-    for (unsigned int i = 0; i < in.local_size(); ++i)
+    for (unsigned int i = 0; i < in.locally_owned_size(); ++i)
       if (!hanging_node_constraints.is_constrained(
             in.get_partitioner()->local_to_global(i)))
         in.local_element(i) = 1.;
index 4a29b0682d1e3740ee4824a7c946e4ec5d2352af..fdb129600e12f4567214a9bf442af3dc3b611ecd 100644 (file)
@@ -233,7 +233,8 @@ private:
                    inverse_diagonal_entries,
                    dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index 582bddf8f642929f93dd6880a9cd1625f3a53a59..8e85f40c4ab90538d0ca0678154540f09548c8d4 100644 (file)
@@ -252,7 +252,8 @@ private:
                    inverse_diagonal_entries,
                    dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index e3a901f8767cc8f195e7796be06cd0fb2a1731a7..96c27dcfda745a229e6473c9922d037f024498d1 100644 (file)
@@ -293,7 +293,8 @@ private:
                    inverse_diagonal_entries,
                    dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index c6181d13f9299c440fa3cc69506ff27ea80dc298..ba94935293bb2e74403eb20bc56f6cb29b91fe23 100644 (file)
@@ -228,7 +228,8 @@ private:
                    inverse_diagonal_entries,
                    dummy);
 
-    for (unsigned int i = 0; i < inverse_diagonal_entries.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal_entries.locally_owned_size();
+         ++i)
       if (std::abs(inverse_diagonal_entries.local_element(i)) > 1e-10)
         inverse_diagonal_entries.local_element(i) =
           1. / inverse_diagonal_entries.local_element(i);
index 00c7e7fc2e1d78725fdcf298cd48c297ab280941..5dedb0c4b92b5dde0facec776d94f19f69d8dced 100644 (file)
@@ -157,7 +157,7 @@ test()
   mf_data.initialize_dof_vector(vec2);
   mf_data.initialize_dof_vector(vec3);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       // Multiply by 0.01 to make float error with roundoff less than the
       // numdiff absolute tolerance
index 90994c6d11dae353da2724702d65911a26d62938..d56227566bc7a72af467a3f507ba27e0b23b64de 100644 (file)
@@ -166,7 +166,7 @@ test()
   mf_data.initialize_dof_vector(vec2);
   mf_data.initialize_dof_vector(vec3);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       if (constraints.is_constrained(
             vec1.get_partitioner()->local_to_global(i)))
index 38807a19e59eb59410737beb1f8620b44e676184..0ff08392774ff579a73c5ee9d7514f7f893ebafd 100644 (file)
@@ -159,7 +159,7 @@ test()
   mf_data.initialize_dof_vector(vec2);
   mf_data.initialize_dof_vector(vec3);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       // Multiply by 0.01 to make float error with roundoff less than the
       // numdiff absolute tolerance
index 4e052b54b4e74c66a2fe77e75047fb424637c52f..124599d3ede8a39acc67f2d83849d1933dad0826 100644 (file)
@@ -156,7 +156,7 @@ test()
   mf_data.initialize_dof_vector(vec2);
   mf_data.initialize_dof_vector(vec3);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       // Multiply by 0.01 to make float error with roundoff less than the
       // numdiff absolute tolerance
index ea8e956a1824614cebc4fb7e7e754a7539bd496d..d2a1ed0a2149f3d31569ec346ce6073be3c54d54 100644 (file)
@@ -174,7 +174,7 @@ test()
   mf_data.initialize_dof_vector(vec2, 1);
   mf_data.initialize_dof_vector(vec3, 1);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       // Multiply by 0.01 to make float error with roundoff less than the
       // numdiff absolute tolerance
index bac976e5f3685fdff3ccbcee9da9c559a5551d9a..f7b2c248d670c824a122d867c1188fb3a8bc83e2 100644 (file)
@@ -159,7 +159,7 @@ test()
   mf_data.initialize_dof_vector(vec2);
   mf_data.initialize_dof_vector(vec3);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       // Multiply by 0.01 to make float error with roundoff less than the
       // numdiff absolute tolerance
index 184a2b33bd84d1017a74f85f44191889db4c5a08..3faf76e803c81013db1ee294ef7927c9df468204 100644 (file)
@@ -173,7 +173,7 @@ test()
   mf_data.initialize_dof_vector(vec2);
   mf_data.initialize_dof_vector(vec3);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       // Multiply by 0.01 to make float error with roundoff less than the
       // numdiff absolute tolerance
index 5056007eff5a89b1d0f409404f2a2bdcf11c36ef..fb47a5668bd9431973f7aaf60acdd4ceb7eb0bc5 100644 (file)
@@ -165,7 +165,7 @@ test()
   mf_data.initialize_dof_vector(vec1);
   mf_data.initialize_dof_vector(vec2);
 
-  for (unsigned int i = 0; i < vec1.local_size(); ++i)
+  for (unsigned int i = 0; i < vec1.locally_owned_size(); ++i)
     {
       // Multiply by 0.01 to make float error with roundoff less than the
       // numdiff absolute tolerance
index 5b31b9b00b6e824db3649df677cb27ba88bc930e..d12fd0f88a93c9e6b7d27755cb49503d13902d48 100644 (file)
@@ -281,7 +281,7 @@ namespace Step37
 
     this->set_constrained_entries_to_one(inverse_diagonal);
 
-    for (unsigned int i = 0; i < inverse_diagonal.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal.locally_owned_size(); ++i)
       {
         Assert(inverse_diagonal.local_element(i) > 0.,
                ExcMessage("No diagonal entry in a positive definite operator "
index 6422705bc45df1963f015dee33384e68382a370a..acf7669b3a92cc8188aa66dda399409cf93430bd 100644 (file)
@@ -107,7 +107,7 @@ namespace Step48
       }
 
     inv_mass_matrix.compress(VectorOperation::add);
-    for (unsigned int k = 0; k < inv_mass_matrix.local_size(); ++k)
+    for (unsigned int k = 0; k < inv_mass_matrix.locally_owned_size(); ++k)
       if (inv_mass_matrix.local_element(k) > 1e-15)
         inv_mass_matrix.local_element(k) =
           1. / inv_mass_matrix.local_element(k);
index 53e40ebed00f18b44ea6d493c14ee1791897b923..8aa31a0c663d682a046b906cc17d7b78ee6e9436 100644 (file)
@@ -101,7 +101,7 @@ namespace Step48
       }
 
     inv_mass_matrix.compress(VectorOperation::add);
-    for (unsigned int k = 0; k < inv_mass_matrix.local_size(); ++k)
+    for (unsigned int k = 0; k < inv_mass_matrix.locally_owned_size(); ++k)
       if (inv_mass_matrix.local_element(k) > 1e-15)
         inv_mass_matrix.local_element(k) =
           1. / inv_mass_matrix.local_element(k);
index 8b2a2982ee7a9785c0fed08914ac188f2e8a724b..9e749cce500fb0a2842a126b1da35afcefac4e45 100644 (file)
@@ -107,7 +107,7 @@ namespace Step48
       }
 
     inv_mass_matrix.compress(VectorOperation::add);
-    for (unsigned int k = 0; k < inv_mass_matrix.local_size(); ++k)
+    for (unsigned int k = 0; k < inv_mass_matrix.locally_owned_size(); ++k)
       if (inv_mass_matrix.local_element(k) > 1e-15)
         inv_mass_matrix.local_element(k) =
           1. / inv_mass_matrix.local_element(k);
index 8ca1d2842363ce8583b5beacd084cce70ac101b5..203f8c98143cd097d908a6329f7d86e767d887b6 100644 (file)
@@ -692,7 +692,7 @@ namespace StokesClass
 
     this->set_constrained_entries_to_one(diagonal);
     inverse_diagonal              = diagonal;
-    const unsigned int local_size = inverse_diagonal.local_size();
+    const unsigned int local_size = inverse_diagonal.locally_owned_size();
     for (unsigned int i = 0; i < local_size; ++i)
       {
         Assert(inverse_diagonal.local_element(i) > 0.,
@@ -865,7 +865,7 @@ namespace StokesClass
 
     this->set_constrained_entries_to_one(inverse_diagonal);
 
-    for (unsigned int i = 0; i < inverse_diagonal.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal.locally_owned_size(); ++i)
       {
         Assert(inverse_diagonal.local_element(i) > 0.,
                ExcMessage("No diagonal entry in a positive definite operator "
index 74c89a0fce30f3f1a861e3816f9dc4287567f27b..db48647b88f44892fd544536ec68197b8edca714 100644 (file)
@@ -125,7 +125,7 @@ test(const unsigned int n_blocks = 5)
       mf_data->initialize_dof_vector(left.block(b));
       mf_data->initialize_dof_vector(right.block(b));
 
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
@@ -162,7 +162,7 @@ test(const unsigned int n_blocks = 5)
     for (unsigned int b = 0; b < left2.n_blocks(); ++b)
       {
         mf_data->initialize_dof_vector(left2.block(b));
-        for (unsigned int i = 0; i < left2.block(b).local_size(); ++i)
+        for (unsigned int i = 0; i < left2.block(b).locally_owned_size(); ++i)
           {
             const unsigned int glob_index = owned_set.nth_index_in_set(i);
             if (constraints.is_constrained(glob_index))
index 9d5190e9a06f95d7e683b7d67dc34dff57f92e92..35ca30385198b71a143ffed50b7e72162cfb6641 100644 (file)
@@ -127,7 +127,7 @@ test(const unsigned int n_blocks = 5)
       mf_data->initialize_dof_vector(left.block(b));
       mf_data->initialize_dof_vector(right.block(b));
 
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
@@ -168,7 +168,7 @@ test(const unsigned int n_blocks = 5)
     for (unsigned int b = 0; b < left2.n_blocks(); ++b)
       {
         mf_data->initialize_dof_vector(left2.block(b));
-        for (unsigned int i = 0; i < left2.block(b).local_size(); ++i)
+        for (unsigned int i = 0; i < left2.block(b).locally_owned_size(); ++i)
           {
             const unsigned int glob_index = owned_set.nth_index_in_set(i);
             if (constraints.is_constrained(glob_index))
index 578c2e68ab8d907167c0b5744da22b7017db935f..2817d2fa92a42a74485307d8174f59b83b7a4e4f 100644 (file)
@@ -126,7 +126,7 @@ test(const unsigned int n_blocks = 5)
       mf_data->initialize_dof_vector(right.block(b));
       left.block(b)  = 0.;
       right.block(b) = 0.;
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
index 53e1a838cd9b36d99f99815f9463ce9bf2a28329..fadf905759e781f1add4ce3ecd820b3623a859ce 100644 (file)
@@ -128,7 +128,7 @@ test(const unsigned int n_blocks = 5)
       left.block(b)  = 0.;
       left2.block(b) = 0.;
       right.block(b) = 0.;
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
index 494248605413ed521261e3a0a5395e12f4383a0b..45aadfb41a7144782bb709efa3ed67d7e271ce1e 100644 (file)
@@ -131,7 +131,7 @@ test(const unsigned int n_blocks = 5)
       left.block(b)  = 0.;
       left2.block(b) = 0.;
       right.block(b) = 0.;
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
index 495a34c079679f6f7f6433350371f7594c1488aa..1bb57305082ffe0325e9e0315292618365d76cdf 100644 (file)
@@ -125,7 +125,7 @@ test(const unsigned int n_blocks = 5)
       mf_data->initialize_dof_vector(right.block(b));
       left.block(b)  = 0.;
       right.block(b) = 0.;
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
index 0fd08ac8d7f9e5313312581312f4f63bf628d339..1dc45f723c60ac0e2c4ef7e7f8e09d5b8176d005 100644 (file)
@@ -127,7 +127,7 @@ test(const unsigned int n_blocks = 5)
       mf_data->initialize_dof_vector(right.block(b));
       left.block(b)  = 0.;
       right.block(b) = 0.;
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
index 7dce2e2f1fab5824ec29057fd8c01b0a65009b09..fda4e21f0c83b3a3f2c4310328024b86747bcf5c 100644 (file)
@@ -126,7 +126,7 @@ test(const unsigned int n = 5, const unsigned int m = 3)
       mf_data->initialize_dof_vector(left2.block(b));
       left.block(b)  = 0.;
       left2.block(b) = 0.;
-      for (unsigned int i = 0; i < left.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < left.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
@@ -139,7 +139,7 @@ test(const unsigned int n = 5, const unsigned int m = 3)
     {
       mf_data->initialize_dof_vector(right.block(b));
       right.block(b) = 0.;
-      for (unsigned int i = 0; i < right.block(b).local_size(); ++i)
+      for (unsigned int i = 0; i < right.block(b).locally_owned_size(); ++i)
         {
           const unsigned int glob_index = owned_set.nth_index_in_set(i);
           if (constraints.is_constrained(glob_index))
index d5ce0b59d47b65e6c89355db87d1721d539c0024..c2decd7c352e872c1e4877ffbe683a3e1d98102b 100644 (file)
@@ -56,7 +56,8 @@ test()
   LinearAlgebra::distributed::Vector<double> v(local_owned,
                                                local_relevant,
                                                MPI_COMM_WORLD);
-  AssertDimension(static_cast<unsigned int>(actual_local_size), v.local_size());
+  AssertDimension(static_cast<unsigned int>(actual_local_size),
+                  v.locally_owned_size());
   LinearAlgebra::distributed::Vector<double> w(v), x(v), y(v);
 
   // set local elements
index 2304514579c5d25fb8c5b4d98055529177818905..df533becf7cfe87c833307e8391e3abf66cc9580 100644 (file)
@@ -89,10 +89,10 @@ test()
   v0 = 1;
   v1 = 2;
   // check assignment in initial state
-  for (unsigned int i = 0; i < v0.local_size(); ++i)
+  for (unsigned int i = 0; i < v0.locally_owned_size(); ++i)
     AssertThrow(v0.local_element(i) == 1.,
                 ExcNonEqual(v0.local_element(i), 1.));
-  for (unsigned int i = 0; i < v1.local_size(); ++i)
+  for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
     AssertThrow(v1.local_element(i) == 2.,
                 ExcNonEqual(v1.local_element(i), 2.));
 
@@ -115,8 +115,8 @@ test()
 
   // now swap v1 and v0
   v0.swap(v1);
-  AssertDimension(v0.local_size(), local_size1);
-  AssertDimension(v1.local_size(), actual_local_size0);
+  AssertDimension(v0.locally_owned_size(), local_size1);
+  AssertDimension(v1.locally_owned_size(), actual_local_size0);
   AssertDimension(v0.size(), global_size1);
   AssertDimension(v1.size(), global_size0);
   for (unsigned int i = 0; i < local_size1; ++i)
@@ -166,7 +166,7 @@ test()
   v2.swap(v0);
   AssertDimension(v0.size(), 0);
   AssertDimension(v2.size(), global_size1);
-  AssertDimension(v2.local_size(), local_size1);
+  AssertDimension(v2.locally_owned_size(), local_size1);
   for (int i = my_start1; i < my_end1; ++i)
     AssertThrow(v2(i) == 7., ExcNonEqual(v2(i), 7.));
   if (myid == 0)
index 2b35bf827422d273e420d0e2436b23ee6ebfd92c..007fbd31b3067a336d1559723efef1892e73112b 100644 (file)
@@ -50,7 +50,7 @@ test()
   v2.reinit(v, true);
 
   // set locally owned range of v2 manually
-  for (unsigned int i = 0; i < v2.local_size(); ++i)
+  for (unsigned int i = 0; i < v2.locally_owned_size(); ++i)
     v2.local_element(i) = 1.;
 
   // add entries to ghost values
index 0c63680f264373556578ff5e4a1e835aafad6296..02fc5a32ddca93fba4e9d82032bd6252cb79c6fc 100644 (file)
@@ -72,12 +72,12 @@ test()
 
   // set first vector to 1
   VectorTools::interpolate(dof2, Functions::ConstantFunction<dim>(1.), v2);
-  for (unsigned int i = 0; i < v2.local_size(); ++i)
+  for (unsigned int i = 0; i < v2.locally_owned_size(); ++i)
     Assert(v2.local_element(i) == 1., ExcInternalError());
 
   v2.update_ghost_values();
   FETools::back_interpolate(dof2, c2, v2, dof1, c1, v2_interpolated);
-  for (unsigned int i = 0; i < v2_interpolated.local_size(); ++i)
+  for (unsigned int i = 0; i < v2_interpolated.locally_owned_size(); ++i)
     Assert(v2_interpolated.local_element(i) == 1., ExcInternalError());
 }
 
index 56bc3ca7f3e9d5d2267fe51e2a77ebb865cb8000..3815cd3a569653cdba5a35da072ca08fcb8a143e 100644 (file)
@@ -65,12 +65,12 @@ test()
 
   // set first vector to 1
   VectorTools::interpolate(dof1, Functions::ConstantFunction<dim>(1.), v1);
-  for (unsigned int i = 0; i < v1.local_size(); ++i)
+  for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
     Assert(v1.local_element(i) == 1., ExcInternalError());
 
   v1.update_ghost_values();
   FETools::interpolate(dof1, v1, dof2, v2);
-  for (unsigned int i = 0; i < v2.local_size(); ++i)
+  for (unsigned int i = 0; i < v2.locally_owned_size(); ++i)
     Assert(v2.local_element(i) == 1., ExcInternalError());
 
   v2.update_ghost_values();
index acc4c0776e83db9032c58c5f06d28afd71c345ab..ef345d3feb909e932430f77cacc00cc0e19b6a7c 100644 (file)
@@ -45,7 +45,7 @@ test()
 
   // create a vector that consists of elements indexed from 0 to n
   PETScWrappers::MPI::Vector vec(MPI_COMM_WORLD, 100 * n_processes, 100);
-  AssertThrow(vec.local_size() == 100, ExcInternalError());
+  AssertThrow(vec.locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.local_range().first == 100 * myid, ExcInternalError());
   AssertThrow(vec.local_range().second == 100 * myid + 100, ExcInternalError());
   for (unsigned int i = vec.local_range().first; i < vec.local_range().second;
index 0475050bd77225b75d17e0a8a58901155345fe48..85c88a3d9a82a336f696ce44e7c3424c82c3dfe9 100644 (file)
@@ -45,12 +45,12 @@ test()
   vec.block(0).reinit(MPI_COMM_WORLD, 100 * n_processes, 100);
   vec.block(1).reinit(MPI_COMM_WORLD, 100 * n_processes, 100);
   vec.collect_sizes();
-  AssertThrow(vec.block(0).local_size() == 100, ExcInternalError());
+  AssertThrow(vec.block(0).locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.block(0).local_range().first == 100 * myid,
               ExcInternalError());
   AssertThrow(vec.block(0).local_range().second == 100 * myid + 100,
               ExcInternalError());
-  AssertThrow(vec.block(1).local_size() == 100, ExcInternalError());
+  AssertThrow(vec.block(1).locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.block(1).local_range().first == 100 * myid,
               ExcInternalError());
   AssertThrow(vec.block(1).local_range().second == 100 * myid + 100,
index 37ba24c23482eb8a2db4fe8559467d9c3586ba63..802f520bdcceec0139c2ff129e44a5350897213d 100644 (file)
@@ -37,7 +37,7 @@ test()
 
   // create a vector that consists of elements indexed from 0 to n
   PETScWrappers::MPI::Vector vec(MPI_COMM_WORLD, 100 * n_processes, 100);
-  AssertThrow(vec.local_size() == 100, ExcInternalError());
+  AssertThrow(vec.locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.local_range().first == 100 * myid, ExcInternalError());
   AssertThrow(vec.local_range().second == 100 * myid + 100, ExcInternalError());
   for (unsigned int i = vec.local_range().first; i < vec.local_range().second;
index 8f418f0edaf01d1270b1459fdad5828393661889..de704e1cb1d13a8bb242077103a62de5ea37f8ce 100644 (file)
@@ -45,12 +45,12 @@ test()
   vec.block(0).reinit(MPI_COMM_WORLD, 100 * n_processes, 100);
   vec.block(1).reinit(MPI_COMM_WORLD, 100 * n_processes, 100);
   vec.collect_sizes();
-  AssertThrow(vec.block(0).local_size() == 100, ExcInternalError());
+  AssertThrow(vec.block(0).locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.block(0).local_range().first == 100 * myid,
               ExcInternalError());
   AssertThrow(vec.block(0).local_range().second == 100 * myid + 100,
               ExcInternalError());
-  AssertThrow(vec.block(1).local_size() == 100, ExcInternalError());
+  AssertThrow(vec.block(1).locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.block(1).local_range().first == 100 * myid,
               ExcInternalError());
   AssertThrow(vec.block(1).local_range().second == 100 * myid + 100,
index 20b8d173750a456c1d6bb8afb4a333a11ff4b270..2e8c2dd6b826a1e6848610ac76572b7eebc2097b 100644 (file)
@@ -50,7 +50,7 @@ test()
     is.add_range(100 * myid, 100 * myid + 100);
     vec.reinit(is, MPI_COMM_WORLD);
   }
-  AssertThrow(vec.local_size() == 100, ExcInternalError());
+  AssertThrow(vec.locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.local_range().first == 100 * myid, ExcInternalError());
   AssertThrow(vec.local_range().second == 100 * myid + 100, ExcInternalError());
   for (unsigned int i = vec.local_range().first; i < vec.local_range().second;
index 5faef9d14da1df255d6eda4c6108207ebf0dac58..b14517882af66c452052f97e63e70aedf9bc84d6 100644 (file)
@@ -46,12 +46,12 @@ test()
     vec.block(1).reinit(is, MPI_COMM_WORLD);
   }
   vec.collect_sizes();
-  AssertThrow(vec.block(0).local_size() == 100, ExcInternalError());
+  AssertThrow(vec.block(0).locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.block(0).local_range().first == 100 * myid,
               ExcInternalError());
   AssertThrow(vec.block(0).local_range().second == 100 * myid + 100,
               ExcInternalError());
-  AssertThrow(vec.block(1).local_size() == 100, ExcInternalError());
+  AssertThrow(vec.block(1).locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.block(1).local_range().first == 100 * myid,
               ExcInternalError());
   AssertThrow(vec.block(1).local_range().second == 100 * myid + 100,
index 0e5ad835effa7ff524944af13480e23b8d361a0a..919b495321a658a8ebc49e8b257ac07542e25091 100644 (file)
@@ -42,7 +42,7 @@ test()
     is.add_range(100 * myid, 100 * myid + 100);
     vec.reinit(is, MPI_COMM_WORLD);
   }
-  AssertThrow(vec.local_size() == 100, ExcInternalError());
+  AssertThrow(vec.locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.local_range().first == 100 * myid, ExcInternalError());
   AssertThrow(vec.local_range().second == 100 * myid + 100, ExcInternalError());
   for (unsigned int i = vec.local_range().first; i < vec.local_range().second;
index 8057e8de06dd6846cc201c0650513c269bdb9967..0a201d012361ef21018af4f65d25143671852f8b 100644 (file)
@@ -43,7 +43,7 @@ test()
     is.add_range(100 * myid, 100 * myid + 100);
     vec.reinit(is, MPI_COMM_WORLD);
   }
-  AssertThrow(vec.local_size() == 100, ExcInternalError());
+  AssertThrow(vec.locally_owned_size() == 100, ExcInternalError());
   AssertThrow(vec.local_range().first == 100 * myid, ExcInternalError());
   AssertThrow(vec.local_range().second == 100 * myid + 100, ExcInternalError());
   for (unsigned int i = vec.local_range().first; i < vec.local_range().second;
index ed4f9aeb70c60ad2ef619e7330af85e80dd40552..9ac08277fb2ce491faa6924201f41ae3e7d12585 100644 (file)
@@ -144,7 +144,8 @@ check(const unsigned int fe_degree)
 
           // set values:
           for (unsigned int b = 0; b < nb; ++b)
-            for (unsigned int i = 0; i < lbv[l].block(b).local_size(); ++i)
+            for (unsigned int i = 0; i < lbv[l].block(b).locally_owned_size();
+                 ++i)
               lbv[l].block(b).local_element(i) = random_value<Number>();
 
           lbv[l].compress(VectorOperation::insert);
@@ -169,7 +170,7 @@ check(const unsigned int fe_degree)
       MGLevelObject<LinearAlgebra::distributed::BlockVector<Number>> lbv2(
         0, tr.n_global_levels() - 1);
       for (unsigned int b = 0; b < nb; ++b)
-        for (unsigned int i = 0; i < bv.block(b).local_size(); ++i)
+        for (unsigned int i = 0; i < bv.block(b).locally_owned_size(); ++i)
           bv.block(b).local_element(i) = random_value<Number>();
 
       transfer.copy_to_mg(mgdof, lbv2, bv);
index e9bbebe573c0cb07f2f60db580f8823ff65afb5c..e7ab5cdc61ddafb68db944bc5484807bc99d6634 100644 (file)
@@ -160,7 +160,8 @@ check(const unsigned int fe_degree)
 
           // set values:
           for (unsigned int b = 0; b < nb; ++b)
-            for (unsigned int i = 0; i < lbv[l].block(b).local_size(); ++i)
+            for (unsigned int i = 0; i < lbv[l].block(b).locally_owned_size();
+                 ++i)
               lbv[l].block(b).local_element(i) = random_value<double>();
 
           lbv[l].compress(VectorOperation::insert);
@@ -191,7 +192,7 @@ check(const unsigned int fe_degree)
       MGLevelObject<LinearAlgebra::distributed::BlockVector<Number>> lbv2(
         0, tr.n_global_levels() - 1);
       for (unsigned int b = 0; b < nb; ++b)
-        for (unsigned int i = 0; i < bv.block(b).local_size(); ++i)
+        for (unsigned int i = 0; i < bv.block(b).locally_owned_size(); ++i)
           bv.block(b).local_element(i) = random_value<double>();
 
       transfer.copy_to_mg(mgdof_ptr, lbv2, bv);
index 2a58d38fc1de77bd421ca84a9946523108a33d94..e07a20c5f35d3391e41291c5137fb6efe0d9ef88 100644 (file)
@@ -90,7 +90,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.prolongate(level, v2, v1);
@@ -111,7 +111,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.restrict_and_add(level, v2, v1);
index 35bc581031a4f0ecb860dc51362951e735ea4355..e6f7245eda7000da7a65b10ae16bc406f39eda2a 100644 (file)
@@ -119,7 +119,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.prolongate(level, v2, v1);
@@ -140,7 +140,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.restrict_and_add(level, v2, v1);
index 3ee18bedd5d13e27f2cd665170f0467106097f19..efc82bd7c82899acc6501c85d8fc8e4cc5756574 100644 (file)
@@ -129,7 +129,8 @@ check(const unsigned int fe_degree)
               v3.block(b).reinit(mgdof.locally_owned_mg_dofs(level),
                                  MPI_COMM_WORLD);
 
-              for (unsigned int i = 0; i < v1.block(b).local_size(); ++i)
+              for (unsigned int i = 0; i < v1.block(b).locally_owned_size();
+                   ++i)
                 v1.block(b).local_element(i) = random_value<double>();
 
               transfer_ref.prolongate(level, v2.block(b), v1.block(b));
@@ -157,7 +158,8 @@ check(const unsigned int fe_degree)
               v3.block(b).reinit(mgdof.locally_owned_mg_dofs(level - 1),
                                  MPI_COMM_WORLD);
 
-              for (unsigned int i = 0; i < v1.block(b).local_size(); ++i)
+              for (unsigned int i = 0; i < v1.block(b).locally_owned_size();
+                   ++i)
                 v1.block(b).local_element(i) = random_value<double>();
 
               transfer_ref.restrict_and_add(level, v2.block(b), v1.block(b));
index b47e0f3546b23729b2b42f34566a28394f5b2601..472ba8dfa40eb48716fd33f9c61ae9a2d7ea5322 100644 (file)
@@ -148,7 +148,8 @@ check(const unsigned int fe_degree)
               v3.block(b).reinit(mgdof_ptr[b]->locally_owned_mg_dofs(level),
                                  MPI_COMM_WORLD);
 
-              for (unsigned int i = 0; i < v1.block(b).local_size(); ++i)
+              for (unsigned int i = 0; i < v1.block(b).locally_owned_size();
+                   ++i)
                 v1.block(b).local_element(i) = random_value<double>();
 
               transfer_ref[b].prolongate(level, v2.block(b), v1.block(b));
@@ -176,7 +177,8 @@ check(const unsigned int fe_degree)
               v3.block(b).reinit(mgdof_ptr[b]->locally_owned_mg_dofs(level - 1),
                                  MPI_COMM_WORLD);
 
-              for (unsigned int i = 0; i < v1.block(b).local_size(); ++i)
+              for (unsigned int i = 0; i < v1.block(b).locally_owned_size();
+                   ++i)
                 v1.block(b).local_element(i) = random_value<double>();
 
               transfer_ref[b].restrict_and_add(level, v2.block(b), v1.block(b));
index ac749fcbf066aa35b22460f9754da8d80722bd1b..5be2508b4a202db8a93a7dee98b6ac70693cf364 100644 (file)
@@ -90,7 +90,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.prolongate(level, v2, v1);
@@ -112,7 +112,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.restrict_and_add(level, v2, v1);
index 0549f531f53d7e5e117ed7b96bb68c9c7c55397a..aa26e61e892ccd59af29c14a084c6d768838693b 100644 (file)
@@ -95,7 +95,7 @@ check(const unsigned int fe_degree)
                     relevant_set,
                     MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.prolongate(level, v2, v1);
@@ -119,7 +119,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.restrict_and_add(level, v2, v1);
index 562e5a1791613591d2f198f1190a5b058b188430..835871b181b19dd748de224d47d71de9f90cdb45 100644 (file)
@@ -116,7 +116,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.prolongate(level, v2, v1);
@@ -138,7 +138,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.restrict_and_add(level, v2, v1);
index a219acebee0332bf79c03d43603c240f48934cc9..7db0bdebe18b1172ba76bf875cc355e4c1ecadaa 100644 (file)
@@ -121,7 +121,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.prolongate(level, v2, v1);
@@ -142,7 +142,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.restrict_and_add(level, v2, v1);
index 0cdeea5b7e1261083b4ea72ce3da7525a9de4f5b..c7fad39c3762f1ac2ea9988d05729db12b20b0b4 100644 (file)
@@ -114,7 +114,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.prolongate(level, v2, v1);
@@ -135,7 +135,7 @@ check(const unsigned int fe_degree)
           v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
           v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
           v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-          for (unsigned int i = 0; i < v1.local_size(); ++i)
+          for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
             v1.local_element(i) = random_value<double>();
           v1_cpy = v1;
           transfer.restrict_and_add(level, v2, v1);
index 9f56af9fd1437c4eb63fd475efc30647930da628..463fbbd01deb3483ffd848128c46241a7b448533 100644 (file)
@@ -82,7 +82,7 @@ check(const unsigned int fe_degree)
       v1.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
       v2.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
       v3.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
-      for (unsigned int i = 0; i < v1.local_size(); ++i)
+      for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
         v1.local_element(i) = random_value<double>();
       v1_cpy = v1;
       transfer.prolongate(level, v2, v1);
@@ -111,7 +111,7 @@ check(const unsigned int fe_degree)
       v1.reinit(mgdof.locally_owned_mg_dofs(level), MPI_COMM_WORLD);
       v2.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
       v3.reinit(mgdof.locally_owned_mg_dofs(level - 1), MPI_COMM_WORLD);
-      for (unsigned int i = 0; i < v1.local_size(); ++i)
+      for (unsigned int i = 0; i < v1.locally_owned_size(); ++i)
         v1.local_element(i) = random_value<double>();
       v1_cpy = v1;
       transfer.restrict_and_add(level, v2, v1);
index 7d06cc8c013f596cf66f7b641417b212a386a143..1ec3d14bc0f29a5045147f745a6f2dc9135be932 100644 (file)
@@ -692,9 +692,10 @@ namespace StokesClass
                           dummy);
 
     this->set_constrained_entries_to_one(diagonal);
-    inverse_diagonal              = diagonal;
-    const unsigned int local_size = inverse_diagonal.local_size();
-    for (unsigned int i = 0; i < local_size; ++i)
+    inverse_diagonal = diagonal;
+    const unsigned int locally_owned_size =
+      inverse_diagonal.locally_owned_size();
+    for (unsigned int i = 0; i < locally_owned_size; ++i)
       {
         Assert(inverse_diagonal.local_element(i) > 0.,
                ExcMessage("No diagonal entry in a positive definite operator "
@@ -866,7 +867,7 @@ namespace StokesClass
 
     this->set_constrained_entries_to_one(inverse_diagonal);
 
-    for (unsigned int i = 0; i < inverse_diagonal.local_size(); ++i)
+    for (unsigned int i = 0; i < inverse_diagonal.locally_owned_size(); ++i)
       {
         Assert(inverse_diagonal.local_element(i) > 0.,
                ExcMessage("No diagonal entry in a positive definite operator "
index 7f2d6037ecb100b21104260b54ed50058085abc9..654a27572c7c034e902bec3b12516e184fd1c01d 100644 (file)
@@ -418,7 +418,7 @@ namespace Step68
   void
   ParticleTracking<dim>::interpolate_function_to_field()
   {
-    velocity_field.zero_out_ghosts();
+    velocity_field.zero_out_ghost_values();
     VectorTools::interpolate(mapping, fluid_dh, velocity, velocity_field);
     velocity_field.update_ghost_values();
   }
diff --git a/tests/petsc/57.cc b/tests/petsc/57.cc
deleted file mode 100644 (file)
index 00ad7a5..0000000
+++ /dev/null
@@ -1,97 +0,0 @@
-// ---------------------------------------------------------------------
-//
-// Copyright (C) 2004 - 2018 by the deal.II authors
-//
-// This file is part of the deal.II library.
-//
-// The deal.II library is free software; you can use it, redistribute
-// it, and/or modify it under the terms of the GNU Lesser General
-// Public License as published by the Free Software Foundation; either
-// version 2.1 of the License, or (at your option) any later version.
-// The full text of the license can be found in the file LICENSE.md at
-// the top level directory of deal.II.
-//
-// ---------------------------------------------------------------------
-
-
-
-// check PETScWrappers::MPI::Vector::is_non_zero
-
-#include <deal.II/lac/petsc_vector.h>
-
-#include <iostream>
-#include <vector>
-
-#include "../tests.h"
-
-
-void
-test(PETScWrappers::MPI::Vector &v)
-{
-  // set only certain elements of the
-  // vector. they are all positive
-  std::vector<bool> pattern(v.size(), false);
-  for (unsigned int i = 0; i < v.size(); i += 1 + i)
-    {
-      v(i) += i;
-      pattern[i] = true;
-    }
-
-  v.compress(VectorOperation::add);
-
-  // check that the vector is really
-  // non-negative
-  AssertThrow(v.is_non_negative() == true, ExcInternalError());
-
-  // then set a single element to a negative
-  // value and check again
-  v(v.size() / 2) = -1;
-  AssertThrow(v.is_non_negative() == false, ExcInternalError());
-
-  deallog << "OK" << std::endl;
-}
-
-
-
-int
-main(int argc, char **argv)
-{
-  initlog();
-
-  try
-    {
-      Utilities::MPI::MPI_InitFinalize mpi_initialization(argc, argv, 1);
-      {
-        IndexSet indices(100);
-        indices.add_range(0, 100);
-        PETScWrappers::MPI::Vector v(indices, MPI_COMM_WORLD);
-        test(v);
-      }
-    }
-  catch (const std::exception &exc)
-    {
-      std::cerr << std::endl
-                << std::endl
-                << "----------------------------------------------------"
-                << std::endl;
-      std::cerr << "Exception on processing: " << std::endl
-                << exc.what() << std::endl
-                << "Aborting!" << std::endl
-                << "----------------------------------------------------"
-                << std::endl;
-
-      return 1;
-    }
-  catch (...)
-    {
-      std::cerr << std::endl
-                << std::endl
-                << "----------------------------------------------------"
-                << std::endl;
-      std::cerr << "Unknown exception!" << std::endl
-                << "Aborting!" << std::endl
-                << "----------------------------------------------------"
-                << std::endl;
-      return 1;
-    };
-}
diff --git a/tests/petsc/57.output b/tests/petsc/57.output
deleted file mode 100644 (file)
index 0fd8fc1..0000000
+++ /dev/null
@@ -1,2 +0,0 @@
-
-DEAL::OK
index 222f35a6883d25549af7451c5dc0f50bc00e7b30..2c5f9aaf051009f4d0654dbea3921e02ac9dbbe0 100644 (file)
@@ -132,7 +132,7 @@ print(const Mapping<dim> &                              mapping,
   data_out.write_vtu_with_pvtu_record(
     "./", "example-1", counter, MPI_COMM_WORLD, 1, 1);
 
-  result.zero_out_ghosts();
+  result.zero_out_ghost_values();
 }
 
 template <int dim>
@@ -214,7 +214,7 @@ test()
   Utilities::MPI::RemotePointEvaluation<dim> evaluation_cache;
   const auto evaluation_point_results = VectorTools::point_values<1>(
     mapping_1, dof_handler_1, vector_1, evaluation_points, evaluation_cache);
-  vector_1.zero_out_ghosts();
+  vector_1.zero_out_ghost_values();
 
   LinearAlgebra::distributed::Vector<double> vector_2(
     create_partitioner(dof_handler_2));
index ad8a693daba6fc28667c29b81b898089f5908777..5f5685c6f9943f825979c916d95a709653dd7e5e 100644 (file)
@@ -108,7 +108,7 @@ print(const Mapping<dim> &                              mapping,
   data_out.write_vtu_with_pvtu_record(
     "./", "example-2", counter, MPI_COMM_WORLD, 1, 1);
 
-  result.zero_out_ghosts();
+  result.zero_out_ghost_values();
 }
 
 template <int dim>
@@ -186,7 +186,7 @@ public:
                                      solution_other,
                                      evaluation_points,
                                      evaluation_cache);
-      solution_other.zero_out_ghosts();
+      solution_other.zero_out_ghost_values();
       for (unsigned int i = 0; i < evaluation_points.size(); ++i)
         {
           if (global_ids[i] == numbers::invalid_size_type)
index 73d443025e750885f4cd2203242cb7ba35e9aef6..8c45c3ba19f5a925889ba2a60b5acca81add6120 100644 (file)
@@ -101,7 +101,7 @@ print(const Mapping<dim> &                              mapping,
   data_out.write_vtu_with_pvtu_record(
     "./", "example-3", counter, MPI_COMM_WORLD, 1, 1);
 
-  result.zero_out_ghosts();
+  result.zero_out_ghost_values();
 }
 
 void
@@ -192,7 +192,7 @@ test()
   Utilities::MPI::RemotePointEvaluation<dim> evaluation_cache;
   const auto evaluation_point_results = VectorTools::point_values<1>(
     mapping_1, dof_handler_1, vector_1, evaluation_points, evaluation_cache);
-  vector_1.zero_out_ghosts();
+  vector_1.zero_out_ghost_values();
 
   LinearAlgebra::distributed::Vector<double> vector_2(
     create_partitioner(dof_handler_2));
index 7efdda90f09ab51a2f996c58e5f1253e78044e2d..76315dd3b52b3aa159cf914af4b31ce80eab7edd 100644 (file)
@@ -100,7 +100,7 @@ print(const Mapping<dim> &                              mapping,
   data_out.write_vtu_with_pvtu_record(
     "./", "example-1", counter, MPI_COMM_WORLD, 1, 1);
 
-  result.zero_out_ghosts();
+  result.zero_out_ghost_values();
 }
 
 template <int dim>
@@ -158,7 +158,7 @@ test()
   const auto evaluation_point_gradient_results =
     VectorTools::point_gradients<1>(
       mapping_1, dof_handler_1, vector_1, evaluation_points, evaluation_cache);
-  vector_1.zero_out_ghosts();
+  vector_1.zero_out_ghost_values();
 
   if (Utilities::MPI::this_mpi_process(MPI_COMM_WORLD) == 0)
     for (unsigned int i = 0; i <= n_intervals; ++i)
index a4b007ea0b66827641855afbbc70cdfd419f5f40..f80ba24aff4a409bcb8532d72b814751d688aaab 100644 (file)
@@ -101,7 +101,7 @@ print(const Mapping<dim, spacedim> &                    mapping,
   data_out.write_vtu_with_pvtu_record(
     "./", "example-1", counter, MPI_COMM_WORLD, 1, 1);
 
-  result.zero_out_ghosts();
+  result.zero_out_ghost_values();
 }
 
 template <int dim>
@@ -180,7 +180,7 @@ test()
   Utilities::MPI::RemotePointEvaluation<dim> evaluation_cache;
   const auto evaluation_point_results = VectorTools::point_values<1>(
     mapping_1, dof_handler_1, vector_1, evaluation_points, evaluation_cache);
-  vector_1.zero_out_ghosts();
+  vector_1.zero_out_ghost_values();
 
   // fill a global (slice) vector
   LinearAlgebra::distributed::Vector<double> vector_2(
index d26aaec31e884e8519b1eb9020f2c03431f515a1..f38c50742aa16ed39448870fffd60aacbc2ebcce 100644 (file)
@@ -1658,7 +1658,7 @@ namespace Euler_DG
     FEEvaluation<dim, degree, degree + 1, dim + 2, Number> phi(data, 0, 1);
     MatrixFreeOperators::CellwiseInverseMassMatrix<dim, degree, dim + 2, Number>
       inverse(phi);
-    solution.zero_out_ghosts();
+    solution.zero_out_ghost_values();
     for (unsigned int cell = 0; cell < data.n_cell_batches(); ++cell)
       {
         phi.reinit(cell);
index 897fa26657fb3d0dd1bf488e8539205b9459c6d7..0946659817319fb1b67e9ba4da25646a80c1d043 100644 (file)
@@ -316,7 +316,7 @@ namespace Step68
   void
   ParticleTracking<dim>::interpolate_function_to_field()
   {
-    velocity_field.zero_out_ghosts();
+    velocity_field.zero_out_ghost_values();
     VectorTools::interpolate(mapping, fluid_dh, velocity, velocity_field);
     velocity_field.update_ghost_values();
   }
index 9a2236bf140841d136924071be9ee81e46d53e26..599420c500fb6092aacc903270524833c904cb3d 100644 (file)
@@ -2,13 +2,13 @@
 DEAL:0::Locally owned indices
 {[0,4], [10,14]}
 DEAL:0::Parallel vector
-C0:size:10 local_size:5 :
+C0:size:10 locally_owned_size:5 :
 [0]: 0.000e+00
 [1]: 1.000e+01
 [2]: 2.000e+01
 [3]: 3.000e+01
 [4]: 4.000e+01
-C1:size:10 local_size:5 :
+C1:size:10 locally_owned_size:5 :
 [0]: 1.000e+02
 [1]: 1.100e+02
 [2]: 1.200e+02
@@ -25,13 +25,13 @@ DEAL:0::OK
 DEAL:1::Locally owned indices
 {[5,9], [15,19]}
 DEAL:1::Parallel vector
-C0:size:10 local_size:5 :
+C0:size:10 locally_owned_size:5 :
 [5]: 5.000e+01
 [6]: 6.000e+01
 [7]: 7.000e+01
 [8]: 8.000e+01
 [9]: 9.000e+01
-C1:size:10 local_size:5 :
+C1:size:10 locally_owned_size:5 :
 [5]: 1.500e+02
 [6]: 1.600e+02
 [7]: 1.700e+02
index c36302334a4733635861a9fdf9f13c4d7067b90c..9b2d1b523703fcbe0ec3b3fe6a21d1a73d6ce1c1 100644 (file)
@@ -2,13 +2,13 @@
 DEAL:0::owned IndexSet: {[0,3]}
 DEAL:0::ghosted IndexSet: {[2,5]}
 DEAL:0::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
 [3]: 3.000e+00
 DEAL:0::trilinos vec ghosted:
-size:8 local_size:6 :
+size:8 locally_owned_size:6 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
@@ -20,13 +20,13 @@ DEAL:0::OK
 DEAL:1::owned IndexSet: {[4,7]}
 DEAL:1::ghosted IndexSet: {[2,5]}
 DEAL:1::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [4]: 4.000e+00
 [5]: 5.000e+00
 [6]: 6.000e+00
 [7]: 7.000e+00
 DEAL:1::trilinos vec ghosted:
-size:8 local_size:6 :
+size:8 locally_owned_size:6 :
 [2]: 2.000e+00
 [3]: 3.000e+00
 [4]: 4.000e+00
index e5cdeb3aeabddb3ff21ff11364cb62a8dec10bf8..4e486dba867b6d6aca2653ce001d42a86f9c7a4b 100644 (file)
@@ -2,13 +2,13 @@
 DEAL:0::IS: {[0,3]}
 DEAL:0::IS_ghosted: {[2,5]}
 DEAL:0::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
 [3]: 3.000e+00
 DEAL:0::trilinos vec ghosted:
-size:8 local_size:6 :
+size:8 locally_owned_size:6 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
@@ -18,7 +18,7 @@ size:8 local_size:6 :
 DEAL:0::ghosted IS: {[0,5]}
 DEAL:0::tril_vector_ghosted.owned_elements() {[0,3]}
 DEAL:0::import of ghosted vector should fail:
-DEAL:0::ExcMessage("Import() from TrilinosWrappers::MPI::Vector with ghost entries is not supported!")
+DEAL:0::ExcMessage( "Import() from TrilinosWrappers::MPI::Vector with ghost entries is not supported!")
 DEAL:0::import of distributed vector should work:
 DEAL:0::RWVector contents:
 IndexSet: {[0,5]}
@@ -34,13 +34,13 @@ DEAL:0::OK
 DEAL:1::IS: {[4,7]}
 DEAL:1::IS_ghosted: {[2,5]}
 DEAL:1::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [4]: 4.000e+00
 [5]: 5.000e+00
 [6]: 6.000e+00
 [7]: 7.000e+00
 DEAL:1::trilinos vec ghosted:
-size:8 local_size:6 :
+size:8 locally_owned_size:6 :
 [2]: 2.000e+00
 [3]: 3.000e+00
 [4]: 4.000e+00
@@ -50,7 +50,7 @@ size:8 local_size:6 :
 DEAL:1::ghosted IS: {[2,7]}
 DEAL:1::tril_vector_ghosted.owned_elements() {[4,7]}
 DEAL:1::import of ghosted vector should fail:
-DEAL:1::ExcMessage("Import() from TrilinosWrappers::MPI::Vector with ghost entries is not supported!")
+DEAL:1::ExcMessage( "Import() from TrilinosWrappers::MPI::Vector with ghost entries is not supported!")
 DEAL:1::import of distributed vector should work:
 DEAL:1::RWVector contents:
 IndexSet: {[2,7]}
index b35304314df7364b06955dc9509a3a18aef3dadc..ed6219a52edaa5669416b1256de6579af990e944 100644 (file)
@@ -2,13 +2,13 @@
 DEAL:0::is: {[0,3]}
 DEAL:0::is_ghosted: {[2,5]}
 DEAL:0::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
 [3]: 3.000e+00
 DEAL:0::trilinos vec ghosted:
-size:8 local_size:6 :
+size:8 locally_owned_size:6 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
@@ -38,13 +38,13 @@ DEAL:0::OK
 DEAL:1::is: {[4,7]}
 DEAL:1::is_ghosted: {[2,5]}
 DEAL:1::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [4]: 4.000e+00
 [5]: 5.000e+00
 [6]: 6.000e+00
 [7]: 7.000e+00
 DEAL:1::trilinos vec ghosted:
-size:8 local_size:6 :
+size:8 locally_owned_size:6 :
 [2]: 2.000e+00
 [3]: 3.000e+00
 [4]: 4.000e+00
index 821a244c71f8bc264de8857debb590a48af8baa3..18c3dda96634317ca7419c39f70cbe22f8e45239 100644 (file)
@@ -8,19 +8,19 @@ IndexSet: {[0,3]}
 [2]: 2.000e+00
 [3]: 3.000e+00
 DEAL:0::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
 [3]: 3.000e+00
 DEAL:0::trilinos vec (2x):
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [0]: 0.000e+00
 [1]: 2.000e+00
 [2]: 4.000e+00
 [3]: 6.000e+00
 DEAL:0::trilinos vec (1x):
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [0]: 0.000e+00
 [1]: 1.000e+00
 [2]: 2.000e+00
@@ -36,19 +36,19 @@ IndexSet: {[4,7]}
 [6]: 6.000e+00
 [7]: 7.000e+00
 DEAL:1::trilinos vec:
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [4]: 4.000e+00
 [5]: 5.000e+00
 [6]: 6.000e+00
 [7]: 7.000e+00
 DEAL:1::trilinos vec (2x):
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [4]: 8.000e+00
 [5]: 1.000e+01
 [6]: 1.200e+01
 [7]: 1.400e+01
 DEAL:1::trilinos vec (1x):
-size:8 local_size:4 :
+size:8 locally_owned_size:4 :
 [4]: 4.000e+00
 [5]: 5.000e+00
 [6]: 6.000e+00

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.