use this-> to access base class methods. Makes gcc 4.7 happy

[[Imported from SVN: r6403]]

dune/solvers/iterationsteps/linegsstep.cc

@@ -38,7 +38,7 @@ void LineGSStep<OperatorType, DiscFuncType, BitVectorType >::iterate()
            if ( (*this->ignoreNodes_)[blockStructure_[b_num][k]][0])
                permuted_r_i[k] = 0.0;
            else
-               residual( blockStructure_[b_num][k], permuted_r_i[k]); // get r[p(i+k)]
+               this->residual( blockStructure_[b_num][k], permuted_r_i[k]); // get r[p(i+k)]
           }
         // permuted_r_i[k] is the residual for r[p(i+k)], which means the residual \tilde{r}[i+k]
         // note: calling the method 'residual' with the permuted index implies that there is no additional permutation required within 'residual'

dune/solvers/iterationsteps/projectedlinegsstep.cc

@@ -191,7 +191,7 @@ void ProjectedLineGSStep<MatrixType, VectorType, BitVectorType>::iterate()
            if ( (*this->ignoreNodes_)[this->blockStructure_[b_num][k]][0])
                permuted_r_i[k] = 0.0;
            else
-               residual( this->blockStructure_[b_num][k], permuted_r_i[k]); // get r[p(i+k)]
+               this->residual( this->blockStructure_[b_num][k], permuted_r_i[k]); // get r[p(i+k)]
           }
         // permuted_r_i[k] is the residual for r[p(i+k)], which means the residual \tilde{r}[i+k]
         // note: calling the method 'residual' with the permuted index implies that there is no additional permutation required within 'residual'