Merge from mainline.

git-svn-id: https://svn.dealii.org/branches/branch_bigger_global_dof_indices_4@29683 0785d39b-7218-0410-832d-ea1e28bc413d

diff --cc deal.II/examples/step-6/step-6.cc
Simple merge

diff --cc deal.II/include/deal.II/distributed/tria.h
index ef59d652b11c0d2c696722dc1ecec79a1bb65a91,18a6eed4caad864b569ea9b3fb680d5249ea8726..5578179d9875b6313b663944eceb1d8c16847ab2
--- 1/deal.II/include/deal.II/distributed/tria.h
--- 2/deal.II/include/deal.II/distributed/tria.h
+++ b/deal.II/include/deal.II/distributed/tria.h
@@@ -730,8 -730,10 +730,10 @@@ namespace paralle
        struct NumberCache
        {
          std::vector<unsigned int> n_locally_owned_active_cells;
 -        unsigned int              n_global_active_cells;
 +        types::global_dof_index   n_global_active_cells;
          unsigned int              n_global_levels;
+ 
+         NumberCache();
        };
  
        NumberCache number_cache;

diff --cc deal.II/include/deal.II/lac/constraint_matrix.h
Simple merge

diff --cc deal.II/include/deal.II/lac/constraint_matrix.templates.h
index 35338ac6bb27e3f3d9a921306d220ae589652534,cc2f90ca4a43e0f907ff26276fe7fbf4c3efc2da..af6d9075097328b4b7fb6f42576dd869b8b756c1
--- 1/deal.II/include/deal.II/lac/constraint_matrix.templates.h
--- 2/deal.II/include/deal.II/lac/constraint_matrix.templates.h
+++ b/deal.II/include/deal.II/lac/constraint_matrix.templates.h
@@@ -730,46 -733,39 +733,41 @@@ namespace interna
    {
      namespace
      {
-       // TODO: in general we should iterate over the constraints and not over all DoFs
-       // for performance reasons
 +      typedef types::global_dof_index size_type;
 +
        template<class VEC>
-       void set_zero_parallel(const dealii::ConstraintMatrix &cm, VEC &vec, size_type shift = 0)
 -      void set_zero_parallel(const std::vector<unsigned int> &cm, VEC &vec, unsigned int shift = 0)
++      void set_zero_parallel(const std::vector<size_type> &cm, VEC &vec, size_type shift = 0)
        {
          Assert(!vec.has_ghost_elements(), ExcInternalError());//ExcGhostsPresent());
- 
-         const size_type 
-         start = vec.local_range().first,
-         end   = vec.local_range().second;
-         for (size_type i=start; i<end; ++i)
-           if (cm.is_constrained (shift + i))
-             vec(i) = 0;
+         IndexSet locally_owned = vec.locally_owned_elements();
 -        for (typename std::vector<unsigned int>::const_iterator it = cm.begin();
++        for (typename std::vector<size_type>::const_iterator it = cm.begin();
+              it != cm.end(); ++it)
+           if (locally_owned.is_element(*it))
+             vec(*it) = 0.;
        }
  
-       // TODO: in general we should iterate over the constraints and not over all DoFs
-       // for performance reasons
        template<typename Number>
-       void set_zero_parallel(const dealii::ConstraintMatrix &cm, parallel::distributed::Vector<Number> &vec, size_type shift = 0)
 -      void set_zero_parallel(const std::vector<unsigned int> &cm, parallel::distributed::Vector<Number> &vec, unsigned int shift = 0)
++      void set_zero_parallel(const std::vector<size_type> &cm, parallel::distributed::Vector<Number> &vec, size_type shift = 0)
        {
-         for (unsigned int i=0; i<vec.local_size(); ++i)
-           if (cm.is_constrained (shift + vec.local_range().first+i))
-             vec.local_element(i) = 0;
 -        for (typename std::vector<unsigned int>::const_iterator it = cm.begin();
++        for (typename std::vector<size_type>::const_iterator it = cm.begin();
+              it != cm.end(); ++it)
+           if (vec.in_local_range(*it))
+             vec(*it) = 0.;
          vec.zero_out_ghosts();
        }
  
        template<class VEC>
-       void set_zero_in_parallel(const dealii::ConstraintMatrix &cm, VEC &vec, internal::bool2type<false>)
 -      void set_zero_in_parallel(const std::vector<unsigned int> &cm, VEC &vec, internal::bool2type<false>)
++      void set_zero_in_parallel(const std::vector<size_type> &cm, VEC &vec, internal::bool2type<false>)
        {
          set_zero_parallel(cm, vec, 0);
        }
  
        // in parallel for BlockVectors
        template<class VEC>
-       void set_zero_in_parallel(const dealii::ConstraintMatrix &cm, VEC &vec, internal::bool2type<true>)
 -      void set_zero_in_parallel(const std::vector<unsigned int> &cm, VEC &vec, internal::bool2type<true>)
++      void set_zero_in_parallel(const std::vector<size_type> &cm, VEC &vec, internal::bool2type<true>)
        {
 -        unsigned int start_shift = 0;
 -        for (unsigned int j=0; j<vec.n_blocks(); ++j)
 +        size_type start_shift = 0;
 +        for (size_type j=0; j<vec.n_blocks(); ++j)
            {
              set_zero_parallel(cm, vec.block(j), start_shift);
              start_shift += vec.block(j).size();
@@@ -777,19 -773,15 +775,15 @@@
        }
  
        template<class VEC>
-       void set_zero_serial(const dealii::ConstraintMatrix &cm, VEC &vec)
 -      void set_zero_serial(const std::vector<unsigned int> &cm, VEC &vec)
++      void set_zero_serial(const std::vector<size_type> &cm, VEC &vec)
        {
-         // TODO would be faster:
-         /* std::vector<dealii::ConstraintMatrix::ConstraintLine>::const_iterator constraint_line = cm.lines.begin();
-            for (; constraint_line!=cm.lines.end(); ++constraint_line)
-            vec(constraint_line->line) = 0.;*/
-         for (size_type i=0; i<vec.size(); ++i)
-           if (cm.is_constrained (i))
-             vec(i) = 0;
 -        for (typename std::vector<unsigned int>::const_iterator it = cm.begin();
++        for (typename std::vector<size_type>::const_iterator it = cm.begin();
+              it != cm.end(); ++it)
+            vec(*it) = 0.;
        }
  
        template<class VEC>
-       void set_zero_all(const dealii::ConstraintMatrix &cm, VEC &vec)
 -      void set_zero_all(const std::vector<unsigned int> &cm, VEC &vec)
++      void set_zero_all(const std::vector<size_type> &cm, VEC &vec)
        {
          set_zero_in_parallel<VEC>(cm, vec, internal::bool2type<IsBlockVector<VEC>::value>());
          vec.compress(VectorOperation::insert);
@@@ -797,13 -789,13 +791,13 @@@
  
  
        template<class T>
-       void set_zero_all(const dealii::ConstraintMatrix &cm, dealii::Vector<T> &vec)
 -      void set_zero_all(const std::vector<unsigned int> &cm, dealii::Vector<T> &vec)
++      void set_zero_all(const std::vector<size_type> &cm, dealii::Vector<T> &vec)
        {
          set_zero_serial(cm, vec);
        }
  
        template<class T>
-       void set_zero_all(const dealii::ConstraintMatrix &cm, dealii::BlockVector<T> &vec)
 -      void set_zero_all(const std::vector<unsigned int> &cm, dealii::BlockVector<T> &vec)
++      void set_zero_all(const std::vector<size_type> &cm, dealii::BlockVector<T> &vec)
        {
          set_zero_serial(cm, vec);
        }
@@@ -816,7 -808,12 +810,12 @@@ template <class VectorType
  void
  ConstraintMatrix::set_zero (VectorType &vec) const
  {
-   internal::ConstraintMatrix::set_zero_all(*this, vec);
+   // since we lines is a private member, we cannot pass it to the functions
+   // above. therefore, copy the content which is cheap
 -  std::vector<unsigned int> constrained_lines(lines.size());
++  std::vector<size_type> constrained_lines(lines.size());
+   for (unsigned int i=0; i<lines.size(); ++i)
+     constrained_lines[i] = lines[i].line;
+   internal::ConstraintMatrix::set_zero_all(constrained_lines, vec);
  }
  
  
@@@ -939,10 -936,10 +938,10 @@@ ConstraintMatrix::distribute (const Vec
              // nothing more to do; finish rest
              // of loop
              {
 -              for (unsigned int i=row+1; i<n_rows; ++i)
 +              for (size_type i=row+1; i<n_rows; ++i)
                  old_line.push_back (i-shift);
                break;
-             };
+             }
          }
        else
          old_line.push_back (row-shift);

diff --cc deal.II/include/deal.II/lac/petsc_block_vector.h
Simple merge

diff --cc deal.II/include/deal.II/lac/petsc_parallel_block_vector.h
Simple merge

diff --cc deal.II/include/deal.II/lac/trilinos_block_vector.h
index 53e8da5de4695ea07a4df7de24044e93f0fa630f,31b2c4221530d0e0950b95ed3c8338af8e7953b3..56e206bf5ee4e6c83fd5beeeb98105fa7359c15d
--- 1/deal.II/include/deal.II/lac/trilinos_block_vector.h
--- 2/deal.II/include/deal.II/lac/trilinos_block_vector.h
+++ b/deal.II/include/deal.II/lac/trilinos_block_vector.h
@@@ -308,14 -308,12 +308,12 @@@ namespace TrilinosWrapper
       * If <tt>fast==false</tt>, the vector
       * is filled with zeros.
       */
 -    void reinit (const std::vector<unsigned int> &N,
 -                 const bool                       fast=false);
 +    void reinit (const std::vector<size_type> &N,
 +                 const bool                    fast=false);
  
      /**
-      * Reinit the function
-      * according to a distributed
-      * block vector. The elements
-      * will be copied in this
+      * Reinitialize the vector in the same way as the given to a
+      * distributed block vector. The elements will be copied in this
       * process.
       */
      void reinit (const MPI::BlockVector &V);

diff --cc deal.II/include/deal.II/lac/trilinos_vector_base.h
Simple merge

diff --cc deal.II/source/distributed/tria.cc
Simple merge

diff --cc deal.II/source/lac/constraint_matrix.cc
index d8ed22b9c3136c97e500e6379f58319613dd1205,3e7c63c3845a23acfbec934fa9aaec2a4600e48e..f3176faf722731fa3f0f928870eda0842b2464ea
--- 1/deal.II/source/lac/constraint_matrix.cc
--- 2/deal.II/source/lac/constraint_matrix.cc
+++ b/deal.II/source/lac/constraint_matrix.cc
@@@ -1522,269 -1518,7 +1522,7 @@@ void ConstraintMatrix::condense (BlockC
  
  
  
- #ifdef DEAL_II_WITH_TRILINOS
- 
- // this is a specialization for a parallel (non-block) Trilinos vector. The
- // basic idea is to just work on the local range of the vector. But we need
- // access to values that the local nodes are constrained to.
- 
- template<>
- void
- ConstraintMatrix::distribute (TrilinosWrappers::MPI::Vector &vec) const
- {
-   Assert (sorted==true, ExcMatrixIsClosed());
- 
-   //TODO: not implemented yet, we need to fix LocalRange() first to only
-   //include "owned" indices. For this we need to keep track of the owned
-   //indices, because Trilinos doesn't. Use same constructor interface as in
-   //PETSc with two IndexSets!
-   AssertThrow (vec.vector_partitioner().IsOneToOne(),
-                ExcMessage ("Distribute does not work on vectors with overlapping parallel partitioning."));
- 
-   typedef std::vector<ConstraintLine>::const_iterator constraint_iterator;
-   ConstraintLine index_comparison;
-   index_comparison.line = vec.local_range().first;
-   const constraint_iterator begin_my_constraints =
-     Utilities::lower_bound (lines.begin(),lines.end(),index_comparison);
- 
-   index_comparison.line = vec.local_range().second;
-   const constraint_iterator end_my_constraints
-     = Utilities::lower_bound(lines.begin(),lines.end(),index_comparison);
- 
-   // Here we search all the indices that we need to have read-access to -
-   // the local nodes and all the nodes that the constraints indicate.
-   IndexSet my_indices (vec.size());
-   {
-     const std::pair<unsigned int, unsigned int>
-     local_range = vec.local_range();
- 
-     my_indices.add_range (local_range.first, local_range.second);
- 
-     std::set<unsigned int> individual_indices;
-     for (constraint_iterator it = begin_my_constraints;
-          it != end_my_constraints; ++it)
-       for (unsigned int i=0; i<it->entries.size(); ++i)
-         if ((it->entries[i].first < local_range.first)
-             ||
-             (it->entries[i].first >= local_range.second))
-           individual_indices.insert (it->entries[i].first);
- 
-     my_indices.add_indices (individual_indices.begin(),
-                             individual_indices.end());
-   }
- 
- #ifdef DEAL_II_WITH_MPI
-   const Epetra_MpiComm *mpi_comm
-     = dynamic_cast<const Epetra_MpiComm *>(&vec.trilinos_vector().Comm());
- 
-   Assert (mpi_comm != 0, ExcInternalError());
- 
-   TrilinosWrappers::MPI::Vector vec_distribute
-   (my_indices.make_trilinos_map (mpi_comm->Comm(), true));
- #else
-   TrilinosWrappers::MPI::Vector vec_distribute
-   (my_indices.make_trilinos_map (MPI_COMM_WORLD, true));
- #endif
- 
-   // here we import the data
-   vec_distribute.reinit(vec,false,true);
- 
-   for (constraint_iterator it = begin_my_constraints;
-        it != end_my_constraints; ++it)
-     {
-       // fill entry in line next_constraint.line by adding the different
-       // contributions
-       double new_value = it->inhomogeneity;
-       for (unsigned int i=0; i<it->entries.size(); ++i)
-         new_value += (vec_distribute(it->entries[i].first) *
-                       it->entries[i].second);
-       vec(it->line) = new_value;
-     }
- 
-   // some processes might not apply constraints, so we need to explicitly
-   // state, that the others are doing an insert here:
-   vec.compress (::dealii::VectorOperation::insert);
- }
- 
- 
- 
- template<>
- void
- ConstraintMatrix::distribute (TrilinosWrappers::MPI::BlockVector &vec) const
- {
-   Assert (sorted==true, ExcMatrixIsClosed());
- 
-   IndexSet my_indices (vec.size());
-   for (unsigned int block=0; block<vec.n_blocks(); ++block)
-     {
-       typedef std::vector<ConstraintLine>::const_iterator constraint_iterator;
-       ConstraintLine index_comparison;
-       index_comparison.line = vec.block(block).local_range().first
-                               +vec.get_block_indices().block_start(block);
-       const constraint_iterator begin_my_constraints =
-         Utilities::lower_bound (lines.begin(),lines.end(),index_comparison);
- 
-       index_comparison.line = vec.block(block).local_range().second
-                               +vec.get_block_indices().block_start(block);
- 
-       const constraint_iterator end_my_constraints
-         = Utilities::lower_bound(lines.begin(),lines.end(),index_comparison);
- 
-       // Here we search all the indices that we need to have read-access to
-       // - the local nodes and all the nodes that the constraints indicate.
-       // No caching done yet. would need some more clever data structures
-       // for doing that.
-       const std::pair<unsigned int, unsigned int>
-       local_range = vec.block(block).local_range();
- 
-       my_indices.add_range (local_range.first, local_range.second);
- 
-       std::set<unsigned int> individual_indices;
-       for (constraint_iterator it = begin_my_constraints;
-            it != end_my_constraints; ++it)
-         for (unsigned int i=0; i<it->entries.size(); ++i)
-           if ((it->entries[i].first < local_range.first)
-               ||
-               (it->entries[i].first >= local_range.second))
-             individual_indices.insert (it->entries[i].first);
- 
-       my_indices.add_indices (individual_indices.begin(),
-                               individual_indices.end());
-     }
- 
- #ifdef DEAL_II_WITH_MPI
-   const Epetra_MpiComm *mpi_comm
-     = dynamic_cast<const Epetra_MpiComm *>(&vec.block(0).trilinos_vector().Comm());
- 
-   Assert (mpi_comm != 0, ExcInternalError());
- 
-   TrilinosWrappers::MPI::Vector vec_distribute
-   (my_indices.make_trilinos_map (mpi_comm->Comm(), true));
- #else
-   TrilinosWrappers::MPI::Vector vec_distribute
-   (my_indices.make_trilinos_map (MPI_COMM_WORLD, true));
- #endif
- 
-   // here we import the data
-   vec_distribute.reinit(vec,true);
- 
-   for (unsigned int block=0; block<vec.n_blocks(); ++block)
-     {
-       typedef std::vector<ConstraintLine>::const_iterator constraint_iterator;
-       ConstraintLine index_comparison;
-       index_comparison.line = vec.block(block).local_range().first
-                               +vec.get_block_indices().block_start(block);
-       const constraint_iterator begin_my_constraints =
-         Utilities::lower_bound (lines.begin(),lines.end(),index_comparison);
- 
-       index_comparison.line = vec.block(block).local_range().second
-                               +vec.get_block_indices().block_start(block);
- 
-       const constraint_iterator end_my_constraints
-         = Utilities::lower_bound(lines.begin(),lines.end(),index_comparison);
- 
-       for (constraint_iterator it = begin_my_constraints;
-            it != end_my_constraints; ++it)
-         {
-           // fill entry in line next_constraint.line by adding the
-           // different contributions
-           double new_value = it->inhomogeneity;
-           for (unsigned int i=0; i<it->entries.size(); ++i)
-             new_value += (vec_distribute(it->entries[i].first) *
-                           it->entries[i].second);
-           vec(it->line) = new_value;
-         }
-       vec.block(block).compress(::dealii::VectorOperation::insert);
-     }
- }
- 
- #endif
- 
- #ifdef DEAL_II_WITH_PETSC
- 
- // this is a specialization for a parallel (non-block) PETSc vector. The
- // basic idea is to just work on the local range of the vector. But we need
- // access to values that the local nodes are constrained to.
- 
- template<>
- void
- ConstraintMatrix::distribute (PETScWrappers::MPI::Vector &vec) const
- {
-   Assert (sorted==true, ExcMatrixIsClosed());
-   Assert (vec.has_ghost_elements() == false,
-           ExcMessage ("This operation can only be performed on vectors without ghost elements."));
- 
-   typedef std::vector<ConstraintLine>::const_iterator constraint_iterator;
-   ConstraintLine index_comparison;
-   index_comparison.line = vec.local_range().first;
-   const constraint_iterator begin_my_constraints =
-     Utilities::lower_bound (lines.begin(),lines.end(),index_comparison);
- 
-   index_comparison.line = vec.local_range().second;
-   const constraint_iterator end_my_constraints
-     = Utilities::lower_bound(lines.begin(),lines.end(),index_comparison);
- 
-   // all indices we need to read from
-   IndexSet my_indices (vec.size());
- 
-   const std::pair<unsigned int, unsigned int>
-   local_range = vec.local_range();
- 
-   my_indices.add_range (local_range.first, local_range.second);
- 
-   std::set<unsigned int> individual_indices;
-   for (constraint_iterator it = begin_my_constraints;
-        it != end_my_constraints; ++it)
-     for (unsigned int i=0; i<it->entries.size(); ++i)
-       if ((it->entries[i].first < local_range.first)
-           ||
-           (it->entries[i].first >= local_range.second))
-         individual_indices.insert (it->entries[i].first);
- 
-   my_indices.add_indices (individual_indices.begin(),
-                           individual_indices.end());
- 
-   IndexSet local_range_is (vec.size());
-   local_range_is.add_range(local_range.first, local_range.second);
- 
- 
-   // create a vector and import those indices
-   PETScWrappers::MPI::Vector ghost_vec (vec.get_mpi_communicator(),
-                                         local_range_is,
-                                         my_indices);
-   ghost_vec = vec;
-   ghost_vec.update_ghost_values();
- 
-   // finally do the distribution on own constraints
-   for (constraint_iterator it = begin_my_constraints;
-        it != end_my_constraints; ++it)
-     {
-       // fill entry in line next_constraint.line by adding the different
-       // contributions
-       PetscScalar new_value = it->inhomogeneity;
-       for (unsigned int i=0; i<it->entries.size(); ++i)
-         new_value += (PetscScalar(ghost_vec(it->entries[i].first)) *
-                       it->entries[i].second);
-       vec(it->line) = new_value;
-     }
- 
-   vec.compress (VectorOperation::insert);
- }
- 
- 
- template<>
- void
- ConstraintMatrix::distribute (PETScWrappers::MPI::BlockVector &/*vec*/) const
- {
-   Assert (sorted==true, ExcMatrixIsClosed());
-   AssertThrow (false, ExcNotImplemented());
- }
- 
- #endif
- 
- 
- 
 -bool ConstraintMatrix::is_identity_constrained (const unsigned int index) const
 +bool ConstraintMatrix::is_identity_constrained (const size_type index) const
  {
    if (is_constrained(index) == false)
      return false;

diff --cc deal.II/source/lac/constraint_matrix.inst.in
index 72131b5396489e3c3c9012c183dec8753edece98,1a69fff4a28f66e0dbec0f362442c3c2c35ae2c7..9880f7044a12a936dd93fd6ab0db349c3da1f7ec
--- 1/deal.II/source/lac/constraint_matrix.inst.in
--- 2/deal.II/source/lac/constraint_matrix.inst.in
+++ b/deal.II/source/lac/constraint_matrix.inst.in
@@@ -3,9 -3,8 +3,8 @@@ for (S: REAL_SCALARS; T : DEAL_II_VEC_T
      template void ConstraintMatrix::condense<T<S> >(const T<S> &, T<S> &) const;
      template void ConstraintMatrix::condense<T<S> >(T<S> &vec) const;
      template void ConstraintMatrix::distribute_local_to_global<T<S> > (
 -      const Vector<double>&, const std::vector<unsigned int> &, T<S> &, const FullMatrix<double>&) const;
 +      const Vector<double>&, const std::vector<types::global_dof_index> &, T<S> &, const FullMatrix<double>&) const;
      template void ConstraintMatrix::distribute<T<S> >(const T<S> &, T<S> &) const;
-     template void ConstraintMatrix::distribute<T<S> >(T<S> &) const;
      template void ConstraintMatrix::set_zero<T<S> >(T<S> &) const;
    }
  
@@@ -15,9 -14,8 +14,8 @@@ for (S: REAL_SCALARS; T : DEAL_II_VEC_T
      template void ConstraintMatrix::condense<parallel::distributed::T<S> >(const parallel::distributed::T<S> &, parallel::distributed::T<S> &) const;
      template void ConstraintMatrix::condense<parallel::distributed::T<S> >(parallel::distributed::T<S> &vec) const;
      template void ConstraintMatrix::distribute_local_to_global<parallel::distributed::T<S> > (
 -      const Vector<double>&, const std::vector<unsigned int> &, parallel::distributed::T<S> &, const FullMatrix<double>&) const;
 +      const Vector<double>&, const std::vector<types::global_dof_index> &, parallel::distributed::T<S> &, const FullMatrix<double>&) const;
      template void ConstraintMatrix::distribute<parallel::distributed::T<S> >(const parallel::distributed::T<S> &, parallel::distributed::T<S> &) const;
-     template void ConstraintMatrix::distribute<parallel::distributed::T<S> >(parallel::distributed::T<S> &) const;
      template void ConstraintMatrix::set_zero<parallel::distributed::T<S> >(parallel::distributed::T<S> &) const;
    }
  
@@@ -27,9 -25,8 +25,8 @@@ for (V: EXTERNAL_SEQUENTIAL_VECTORS
      template void ConstraintMatrix::condense<V >(const V&, V&) const;
      template void ConstraintMatrix::condense<V >(V&vec) const;
      template void ConstraintMatrix::distribute_local_to_global<V > (
 -      const Vector<double>&, const std::vector<unsigned int> &, V&, const FullMatrix<double>&) const;
 +      const Vector<double>&, const std::vector<types::global_dof_index> &, V&, const FullMatrix<double>&) const;
      template void ConstraintMatrix::distribute<V >(const V&, V&) const;
-     template void ConstraintMatrix::distribute<V >(V&) const;
      template void ConstraintMatrix::set_zero<V >(V&) const;
    }
  

diff --cc deal.II/source/lac/petsc_parallel_block_vector.cc
index fc11d85a10e26022c0cb0a568a315577da83abcb,49318b38400c5560da0be13af434c45210d046e1..45dbc8d1b15d8558b0b320e3f1931d59ef8553e6
--- 1/deal.II/source/lac/petsc_parallel_block_vector.cc
--- 2/deal.II/source/lac/petsc_parallel_block_vector.cc
+++ b/deal.II/source/lac/petsc_parallel_block_vector.cc
@@@ -24,6 -24,6 +24,8 @@@ namespace PETScWrapper
  {
    namespace MPI
    {
++    typedef types::global_dof_index size_type;
++
      BlockVector &
      BlockVector::operator = (const PETScWrappers::BlockVector &v)
      {
@@@ -35,6 -35,21 +37,21 @@@
  
        return *this;
      }
 -      std::vector<unsigned int> block_sizes (num_blocks, 0);
+ 
+ 
+     void
+     BlockVector::reinit (const unsigned int num_blocks)
+     {
++      std::vector<size_type> block_sizes (num_blocks, 0);
+       this->block_indices.reinit (block_sizes);
+       if (this->components.size() != this->n_blocks())
+         this->components.resize(this->n_blocks());
+ 
+       for (unsigned int i=0; i<this->n_blocks(); ++i)
+         components[i].reinit (MPI_Comm(), 0, 0);
+ 
+       collect_sizes();
+     }
    }
  
  }