1.1 --- a/test/edge_set_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/edge_set_test.cc	Wed Oct 17 19:14:07 2018 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -44,12 +44,12 @@
    1.13      n2 = digraph.addNode();
    1.14  
    1.15    Digraph::Arc ga1 = digraph.addArc(n1, n2);
    1.16 -  ignore_unused_variable_warning(ga1);
    1.17 +  ::lemon::ignore_unused_variable_warning(ga1);
    1.18  
    1.19    ArcSet arc_set(digraph);
    1.20  
    1.21    Digraph::Arc ga2 = digraph.addArc(n2, n1);
    1.22 -  ignore_unused_variable_warning(ga2);
    1.23 +  ::lemon::ignore_unused_variable_warning(ga2);
    1.24  
    1.25    checkGraphNodeList(arc_set, 2);
    1.26    checkGraphArcList(arc_set, 0);
    1.27 @@ -77,7 +77,7 @@
    1.28    ArcSet::Arc a2 = arc_set.addArc(n2, n1),
    1.29      a3 = arc_set.addArc(n2, n3),
    1.30      a4 = arc_set.addArc(n2, n3);
    1.31 -  ignore_unused_variable_warning(a2,a3,a4);
    1.32 +  ::lemon::ignore_unused_variable_warning(a2,a3,a4);
    1.33  
    1.34    checkGraphNodeList(arc_set, 3);
    1.35    checkGraphArcList(arc_set, 4);
    1.36 @@ -114,12 +114,12 @@
    1.37      n2 = digraph.addNode();
    1.38  
    1.39    Digraph::Arc ga1 = digraph.addArc(n1, n2);
    1.40 -  ignore_unused_variable_warning(ga1);
    1.41 +  ::lemon::ignore_unused_variable_warning(ga1);
    1.42  
    1.43    ArcSet arc_set(digraph);
    1.44  
    1.45    Digraph::Arc ga2 = digraph.addArc(n2, n1);
    1.46 -  ignore_unused_variable_warning(ga2);
    1.47 +  ::lemon::ignore_unused_variable_warning(ga2);
    1.48  
    1.49    checkGraphNodeList(arc_set, 2);
    1.50    checkGraphArcList(arc_set, 0);
    1.51 @@ -147,7 +147,7 @@
    1.52    ArcSet::Arc a2 = arc_set.addArc(n2, n1),
    1.53      a3 = arc_set.addArc(n2, n3),
    1.54      a4 = arc_set.addArc(n2, n3);
    1.55 -  ignore_unused_variable_warning(a2,a3,a4);
    1.56 +  ::lemon::ignore_unused_variable_warning(a2,a3,a4);
    1.57  
    1.58    checkGraphNodeList(arc_set, 3);
    1.59    checkGraphArcList(arc_set, 4);
    1.60 @@ -198,12 +198,12 @@
    1.61      n2 = digraph.addNode();
    1.62  
    1.63    Digraph::Arc ga1 = digraph.addArc(n1, n2);
    1.64 -  ignore_unused_variable_warning(ga1);
    1.65 +  ::lemon::ignore_unused_variable_warning(ga1);
    1.66  
    1.67    EdgeSet edge_set(digraph);
    1.68  
    1.69    Digraph::Arc ga2 = digraph.addArc(n2, n1);
    1.70 -  ignore_unused_variable_warning(ga2);
    1.71 +  ::lemon::ignore_unused_variable_warning(ga2);
    1.72  
    1.73    checkGraphNodeList(edge_set, 2);
    1.74    checkGraphArcList(edge_set, 0);
    1.75 @@ -240,7 +240,7 @@
    1.76    EdgeSet::Edge e2 = edge_set.addEdge(n2, n1),
    1.77      e3 = edge_set.addEdge(n2, n3),
    1.78      e4 = edge_set.addEdge(n2, n3);
    1.79 -  ignore_unused_variable_warning(e2,e3,e4);
    1.80 +  ::lemon::ignore_unused_variable_warning(e2,e3,e4);
    1.81  
    1.82    checkGraphNodeList(edge_set, 3);
    1.83    checkGraphEdgeList(edge_set, 4);
    1.84 @@ -286,12 +286,12 @@
    1.85      n2 = digraph.addNode();
    1.86  
    1.87    Digraph::Arc ga1 = digraph.addArc(n1, n2);
    1.88 -  ignore_unused_variable_warning(ga1);
    1.89 +  ::lemon::ignore_unused_variable_warning(ga1);
    1.90  
    1.91    EdgeSet edge_set(digraph);
    1.92  
    1.93    Digraph::Arc ga2 = digraph.addArc(n2, n1);
    1.94 -  ignore_unused_variable_warning(ga2);
    1.95 +  ::lemon::ignore_unused_variable_warning(ga2);
    1.96  
    1.97    checkGraphNodeList(edge_set, 2);
    1.98    checkGraphArcList(edge_set, 0);
    1.99 @@ -328,7 +328,7 @@
   1.100    EdgeSet::Edge e2 = edge_set.addEdge(n2, n1),
   1.101      e3 = edge_set.addEdge(n2, n3),
   1.102      e4 = edge_set.addEdge(n2, n3);
   1.103 -  ignore_unused_variable_warning(e2,e3,e4);
   1.104 +  ::lemon::ignore_unused_variable_warning(e2,e3,e4);
   1.105  
   1.106    checkGraphNodeList(edge_set, 3);
   1.107    checkGraphEdgeList(edge_set, 4);