1.1 --- a/test/adaptors_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/adaptors_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-2009
     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 @@ -65,7 +65,7 @@
    1.13    Digraph::Arc a1 = digraph.addArc(n1, n2);
    1.14    Digraph::Arc a2 = digraph.addArc(n1, n3);
    1.15    Digraph::Arc a3 = digraph.addArc(n2, n3);
    1.16 -  ignore_unused_variable_warning(a3);
    1.17 +  ::lemon::ignore_unused_variable_warning(a3);
    1.18  
    1.19    // Check the adaptor
    1.20    checkGraphNodeList(adaptor, 3);
    1.21 @@ -100,7 +100,7 @@
    1.22    Adaptor::Arc a6 = adaptor.addArc(n2, n4);
    1.23    Adaptor::Arc a7 = adaptor.addArc(n1, n4);
    1.24    Adaptor::Arc a8 = adaptor.addArc(n1, n2);
    1.25 -  ignore_unused_variable_warning(a6,a7,a8);
    1.26 +  ::lemon::ignore_unused_variable_warning(a6,a7,a8);
    1.27  
    1.28    adaptor.erase(a1);
    1.29    adaptor.erase(n3);
    1.30 @@ -760,7 +760,7 @@
    1.31    Digraph::Arc a1 = digraph.addArc(n1, n2);
    1.32    Digraph::Arc a2 = digraph.addArc(n1, n3);
    1.33    Digraph::Arc a3 = digraph.addArc(n2, n3);
    1.34 -  ignore_unused_variable_warning(a1,a2,a3);
    1.35 +  ::lemon::ignore_unused_variable_warning(a1,a2,a3);
    1.36  
    1.37    checkGraphNodeList(adaptor, 6);
    1.38    checkGraphArcList(adaptor, 6);