Removed comparisons between unsigned and signed integers.

[[Imported from SVN: r283]]

istl/paamg/graph.hh

@@ -68,7 +68,7 @@ namespace Dune
        *
        * Each descriptor describes exactly one vertex.
        */
-      typedef std::size_t VertexDescriptor;
+      typedef typename M::size_type VertexDescriptor;
 
       /**
        * @brief The edge descriptor.

istl/paamg/indicescoarsener.hh

@@ -250,7 +250,7 @@ namespace Dune
             index != riEnd; ++index) {
           if(!E::contains(index->localIndexPair().local().attribute()))
           {
-            assert(aggregates[index->localIndexPair().local()]<attributes.size());
+            assert(aggregates[index->localIndexPair().local()]<(int)attributes.size());
             assert(attributes[aggregates[index->localIndexPair().local()]] == std::numeric_limits<char>::max()
                    || attributes[aggregates[index->localIndexPair().local()]] == index->attribute());
             attributes[aggregates[index->localIndexPair().local()]] = index->attribute();

istl/paamg/test/galerkintest.cc

@@ -188,7 +188,7 @@ public:
   {
     const T& aggregate = aggregates_[index];
     const Dune::IndexPair<TG,Dune::ParallelLocalIndex<TA> >& pair = indexset_.pair(aggregate);
-    assert(pair.local()==aggregate);
+    assert(aggregate>=0 && pair.local()==static_cast<size_t>(aggregate));
     assert(pair.local().attribute()==owner);
     return pair.global();
   }
@@ -332,7 +332,7 @@ void testCoarsenIndices()
   assert(N*N==mg.maxVertex());
 
   bool visitedIterator[N*N];
-  for(std::size_t i=0; i < mg.maxVertex(); ++i)
+  for(Vertex i=0; i < mg.maxVertex(); ++i)
     visitedIterator[i]=false;
 
   VisitedMap2 visitedMap2(visitedIterator, Dune::IdentityMap());