1.1 --- a/test/bellman_ford_test.cc	Wed Aug 07 06:55:05 2013 +0200
     1.2 +++ b/test/bellman_ford_test.cc	Wed Aug 07 06:57:41 2013 +0200
     1.3 @@ -65,10 +65,10 @@
     1.4    Node s, t, n;
     1.5    Arc e;
     1.6    Value l;
     1.7 -  ignore_unused_variable_warning(l);
     1.8 +  ::lemon::ignore_unused_variable_warning(l);
     1.9    int k=3;
    1.10    bool b;
    1.11 -  ignore_unused_variable_warning(b);
    1.12 +  ::lemon::ignore_unused_variable_warning(b);
    1.13    BF::DistMap d(gr);
    1.14    BF::PredMap p(gr);
    1.15    LengthMap length;
    1.16 @@ -149,7 +149,7 @@
    1.17  
    1.18    Digraph g;
    1.19    bool b;
    1.20 -  ignore_unused_variable_warning(b);
    1.21 +  ::lemon::ignore_unused_variable_warning(b);
    1.22  
    1.23    bellmanFord(g,LengthMap()).run(Node());
    1.24    b = bellmanFord(g,LengthMap()).run(Node(),Node());

     2.1 --- a/test/digraph_test.cc	Wed Aug 07 06:55:05 2013 +0200
     2.2 +++ b/test/digraph_test.cc	Wed Aug 07 06:57:41 2013 +0200
     2.3 @@ -442,7 +442,7 @@
     2.4      a2 = g.addArc(n2, n1),
     2.5      a3 = g.addArc(n2, n3),
     2.6      a4 = g.addArc(n2, n3);
     2.7 -  ignore_unused_variable_warning(a2,a3,a4);
     2.8 +  ::lemon::ignore_unused_variable_warning(a2,a3,a4);
     2.9  
    2.10    digraphCopy(g, G).nodeRef(nref).run();
    2.11  

     3.1 --- a/test/fractional_matching_test.cc	Wed Aug 07 06:55:05 2013 +0200
     3.2 +++ b/test/fractional_matching_test.cc	Wed Aug 07 06:57:41 2013 +0200
     3.3 @@ -342,7 +342,7 @@
     3.4        check(indeg == 1, "Invalid matching");
     3.5        pv += weight[mwfm.matching(n)];
     3.6        SmartGraph::Node o = graph.target(mwfm.matching(n));
     3.7 -      ignore_unused_variable_warning(o);
     3.8 +      ::lemon::ignore_unused_variable_warning(o);
     3.9      } else {
    3.10        check(mwfm.nodeValue(n) == 0, "Invalid matching");
    3.11        check(indeg == 0, "Invalid matching");
    3.12 @@ -407,7 +407,7 @@
    3.13      check(indeg == 1, "Invalid perfect matching");
    3.14      pv += weight[mwpfm.matching(n)];
    3.15      SmartGraph::Node o = graph.target(mwpfm.matching(n));
    3.16 -    ignore_unused_variable_warning(o);
    3.17 +    ::lemon::ignore_unused_variable_warning(o);
    3.18    }
    3.19  
    3.20    for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {