Use DefaultBitVector_t

... instead of explicitly hard-wiring BitSetVector.  With this change, vectors
of arbitrary nesting depth can be used.

dune/solvers/iterationsteps/lineariterationstep.hh

@@ -10,11 +10,12 @@
 #include <dune/common/shared_ptr.hh>
 
 #include <dune/solvers/common/preconditioner.hh>
+#include <dune/solvers/common/defaultbitvector.hh>
 
 #include "iterationstep.hh"
 
 //! Base class for iteration steps being called by an iterative linear solver
-template<class MatrixType, class VectorType, class BitVectorType = Dune::BitSetVector<VectorType::block_type::dimension> >
+template<class MatrixType, class VectorType, class BitVectorType = Dune::Solvers::DefaultBitVector_t<VectorType> >
 class LinearIterationStep : public IterationStep<VectorType, BitVectorType>,
                             public Dune::Solvers::Preconditioner<MatrixType,
                                                                  VectorType,

dune/solvers/solvers/loopsolver.hh

@@ -7,7 +7,7 @@
 #include <dune/solvers/iterationsteps/iterationstep.hh>
 #include <dune/solvers/norms/norm.hh>
 #include <dune/solvers/solvers/criterion.hh>
-
+#include <dune/solvers/common/defaultbitvector.hh>
 
 
 /** \brief A solver which consists of a single loop
@@ -15,7 +15,7 @@
   *  This class basically implements a loop that calls an iteration procedure
   *  (which is to be supplied by the user).  It also monitors convergence.
   */
-template <class VectorType, class BitVectorType = Dune::BitSetVector<VectorType::block_type::dimension> >
+template <class VectorType, class BitVectorType = Dune::Solvers::DefaultBitVector_t<VectorType> >
 class LoopSolver : public IterativeSolver<VectorType, BitVectorType>
 {
     typedef typename VectorType::field_type field_type;