diff --git a/dune/istl/paamg/graph.hh b/dune/istl/paamg/graph.hh index 583428d71957cd2f50fbb63abb3d0d2b467c4c26..27baa294b44e9588a6221dc1f842a886f666019d 100644 --- a/dune/istl/paamg/graph.hh +++ b/dune/istl/paamg/graph.hh @@ -671,7 +671,7 @@ namespace Dune * @param target The target vertex of the edge we search for. * @return The edge we found or numeric_limits<EdgeIterator>::max() if it does not exist. */ - const EdgeDescriptor findEdge(const VertexDescriptor& source, + EdgeDescriptor findEdge(const VertexDescriptor& source, const VertexDescriptor& target) const; /** * @brief Constructor. @@ -1959,7 +1959,7 @@ namespace Dune } template<class G, class T> - inline const typename SubGraph<G,T>::EdgeDescriptor SubGraph<G,T>::findEdge(const VertexDescriptor& source, + inline typename SubGraph<G,T>::EdgeDescriptor SubGraph<G,T>::findEdge(const VertexDescriptor& source, const VertexDescriptor& target) const { const EdgeDescriptor edge = std::lower_bound(edges_+start_[source], edges_+end_[source], target); diff --git a/dune/istl/paamg/pinfo.hh b/dune/istl/paamg/pinfo.hh index 369910277a27e8e1889258e237b42fc4f3a181d0..f12616dc71d83e231a8696d2c9b5199b789eb01c 100644 --- a/dune/istl/paamg/pinfo.hh +++ b/dune/istl/paamg/pinfo.hh @@ -33,7 +33,7 @@ namespace Dune category = SolverCategory::sequential }; - const SolverCategory::Category getSolverCategory () const { + SolverCategory::Category getSolverCategory () const { return SolverCategory::sequential; } diff --git a/dune/istl/paamg/test/graphtest.cc b/dune/istl/paamg/test/graphtest.cc index 3d45daa5205d63d26bdbad60c5cc7518abc44d1c..051c3ed186c62b86a829fc1a3ed9ce26f1c1b006 100644 --- a/dune/istl/paamg/test/graphtest.cc +++ b/dune/istl/paamg/test/graphtest.cc @@ -498,7 +498,7 @@ void testGraph () } -void testAggregate() +void testAggregate(double eps) { typedef Dune::FieldMatrix<double,1,1> ScalarDouble;