1.1 --- a/test/map_test.h	Fri Mar 02 17:56:22 2007 +0000
     1.2 +++ b/test/map_test.h	Fri Mar 02 18:04:28 2007 +0000
     1.3 @@ -45,7 +45,7 @@
     1.4      }
     1.5      typedef typename Graph::template NodeMap<int> IntNodeMap;
     1.6      IntNodeMap map(graph, 42);
     1.7 -    for (int i = 0; i < (int)nodes.size(); ++i) {
     1.8 +    for (int i = 0; i < int(nodes.size()); ++i) {
     1.9        check(map[nodes[i]] == 42, "Wrong map constructor.");      
    1.10      }
    1.11      for (int i = 0; i < num; ++i) {
    1.12 @@ -53,7 +53,7 @@
    1.13        map[nodes.back()] = 23;
    1.14      }
    1.15      map = constMap<Node>(12);
    1.16 -    for (int i = 0; i < (int)nodes.size(); ++i) {
    1.17 +    for (int i = 0; i < int(nodes.size()); ++i) {
    1.18        check(map[nodes[i]] == 12, "Wrong map constructor.");      
    1.19      }    
    1.20      graph.clear();
    1.21 @@ -83,7 +83,7 @@
    1.22      typedef typename Graph::template EdgeMap<int> IntEdgeMap;
    1.23      IntEdgeMap map(graph, 42);
    1.24      
    1.25 -    for (int i = 0; i < (int)edges.size(); ++i) {
    1.26 +    for (int i = 0; i < int(edges.size()); ++i) {
    1.27        check(map[edges[i]] == 42, "Wrong map constructor.");      
    1.28      }
    1.29      
    1.30 @@ -94,7 +94,7 @@
    1.31        }
    1.32      }
    1.33      map = constMap<Edge>(12);
    1.34 -    for (int i = 0; i < (int)edges.size(); ++i) {
    1.35 +    for (int i = 0; i < int(edges.size()); ++i) {
    1.36        check(map[edges[i]] == 12, "Wrong map constructor.");      
    1.37      }    
    1.38      graph.clear();