1.1 --- a/test/graph_test.cc	Wed Nov 28 11:58:00 2012 +0100
     1.2 +++ b/test/graph_test.cc	Wed Aug 07 06:55:05 2013 +0200
     1.3 @@ -66,7 +66,7 @@
     1.4  
     1.5    Edge e2 = G.addEdge(n2, n1),
     1.6         e3 = G.addEdge(n2, n3);
     1.7 -  ignore_unused_variable_warning(e2,e3);
     1.8 +  ::lemon::ignore_unused_variable_warning(e2,e3);
     1.9  
    1.10    checkGraphNodeList(G, 3);
    1.11    checkGraphEdgeList(G, 3);
    1.12 @@ -99,7 +99,7 @@
    1.13    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.14         e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
    1.15         e5 = G.addEdge(n4, n3);
    1.16 -  ignore_unused_variable_warning(e1,e3,e4,e5);
    1.17 +  ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);
    1.18  
    1.19    checkGraphNodeList(G, 4);
    1.20    checkGraphEdgeList(G, 5);
    1.21 @@ -179,7 +179,7 @@
    1.22    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.23         e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
    1.24         e5 = G.addEdge(n4, n3);
    1.25 -  ignore_unused_variable_warning(e1,e3,e4,e5);
    1.26 +  ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);
    1.27  
    1.28    // Check edge deletion
    1.29    G.erase(e2);
    1.30 @@ -220,7 +220,7 @@
    1.31    Node n1 = G.addNode(), n2 = G.addNode(), n3 = G.addNode();
    1.32    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.33         e3 = G.addEdge(n2, n3);
    1.34 -  ignore_unused_variable_warning(e1,e2,e3);
    1.35 +  ::lemon::ignore_unused_variable_warning(e1,e2,e3);
    1.36  
    1.37    checkGraphNodeList(G, 3);
    1.38    checkGraphEdgeList(G, 3);
    1.39 @@ -385,7 +385,7 @@
    1.40    Edge
    1.41      e1 = g.addEdge(n1, n2),
    1.42      e2 = g.addEdge(n2, n3);
    1.43 -  ignore_unused_variable_warning(e2);
    1.44 +  ::lemon::ignore_unused_variable_warning(e2);
    1.45  
    1.46    check(g.valid(n1), "Wrong validity check");
    1.47    check(g.valid(e1), "Wrong validity check");
    1.48 @@ -524,7 +524,7 @@
    1.49    checkGraphArcList(G, dim * (1 << dim));
    1.50  
    1.51    Node n = G.nodeFromId(dim);
    1.52 -  ignore_unused_variable_warning(n);
    1.53 +  ::lemon::ignore_unused_variable_warning(n);
    1.54  
    1.55    for (NodeIt n(G); n != INVALID; ++n) {
    1.56      checkGraphIncEdgeList(G, n, dim);