Changes in / [1084:8b2d4e5d96e4:1009:a26b90a17c81] in lemon-main
- Files:
-
- 29 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept_check.h
r1083 r997 59 59 #if !defined(NDEBUG) 60 60 void (Concept::*x)() = & Concept::constraints; 61 ::lemon::ignore_unused_variable_warning(x);61 ignore_unused_variable_warning(x); 62 62 #endif 63 63 } … … 69 69 typedef typename Concept::template Constraints<Type> ConceptCheck; 70 70 void (ConceptCheck::*x)() = & ConceptCheck::constraints; 71 ::lemon::ignore_unused_variable_warning(x);71 ignore_unused_variable_warning(x); 72 72 #endif 73 73 } -
lemon/concepts/digraph.h
r1084 r877 313 313 /// Sets the iterator to the first arc of the given digraph. 314 314 /// 315 explicit ArcIt(const Digraph& g) { ::lemon::ignore_unused_variable_warning(g); }315 explicit ArcIt(const Digraph& g) { ignore_unused_variable_warning(g); } 316 316 /// Sets the iterator to the given arc. 317 317 -
lemon/concepts/graph.h
r1084 r877 397 397 /// Sets the iterator to the first arc of the given graph. 398 398 /// 399 explicit ArcIt(const Graph &g) { ::lemon::ignore_unused_variable_warning(g); }399 explicit ArcIt(const Graph &g) { ignore_unused_variable_warning(g); } 400 400 /// Sets the iterator to the given arc. 401 401 … … 443 443 /// 444 444 OutArcIt(const Graph& n, const Node& g) { 445 ::lemon::ignore_unused_variable_warning(n);446 ::lemon::ignore_unused_variable_warning(g);445 ignore_unused_variable_warning(n); 446 ignore_unused_variable_warning(g); 447 447 } 448 448 /// Sets the iterator to the given arc. … … 491 491 /// 492 492 InArcIt(const Graph& g, const Node& n) { 493 ::lemon::ignore_unused_variable_warning(n);494 ::lemon::ignore_unused_variable_warning(g);493 ignore_unused_variable_warning(n); 494 ignore_unused_variable_warning(g); 495 495 } 496 496 /// Sets the iterator to the given arc. -
lemon/concepts/graph_components.h
r1084 r1008 109 109 110 110 bool b; 111 ::lemon::ignore_unused_variable_warning(b);111 ignore_unused_variable_warning(b); 112 112 113 113 b = (ia == ib) && (ia != ib); … … 290 290 ue = e; 291 291 bool d = graph.direction(e); 292 ::lemon::ignore_unused_variable_warning(d);292 ignore_unused_variable_warning(d); 293 293 } 294 294 } … … 369 369 370 370 nid = digraph.maxNodeId(); 371 ::lemon::ignore_unused_variable_warning(nid);371 ignore_unused_variable_warning(nid); 372 372 eid = digraph.maxArcId(); 373 ::lemon::ignore_unused_variable_warning(eid);373 ignore_unused_variable_warning(eid); 374 374 } 375 375 … … 424 424 edge = graph.edgeFromId(ueid); 425 425 ueid = graph.maxEdgeId(); 426 ::lemon::ignore_unused_variable_warning(ueid);426 ignore_unused_variable_warning(ueid); 427 427 } 428 428 … … 497 497 _GraphItemIt it3 = it1; 498 498 _GraphItemIt it4 = INVALID; 499 ::lemon::ignore_unused_variable_warning(it3);500 ::lemon::ignore_unused_variable_warning(it4);499 ignore_unused_variable_warning(it3); 500 ignore_unused_variable_warning(it4); 501 501 502 502 it2 = ++it1; … … 588 588 _GraphIncIt it3 = it1; 589 589 _GraphIncIt it4 = INVALID; 590 ::lemon::ignore_unused_variable_warning(it3);591 ::lemon::ignore_unused_variable_warning(it4);590 ignore_unused_variable_warning(it3); 591 ignore_unused_variable_warning(it4); 592 592 593 593 it2 = ++it1; … … 771 771 n = digraph.baseNode(oait); 772 772 n = digraph.runningNode(oait); 773 ::lemon::ignore_unused_variable_warning(n);773 ignore_unused_variable_warning(n); 774 774 } 775 775 } … … 954 954 = digraph.notifier(typename _Digraph::Arc()); 955 955 956 ::lemon::ignore_unused_variable_warning(nn);957 ::lemon::ignore_unused_variable_warning(en);956 ignore_unused_variable_warning(nn); 957 ignore_unused_variable_warning(en); 958 958 } 959 959 … … 997 997 typename _Graph::EdgeNotifier& uen 998 998 = graph.notifier(typename _Graph::Edge()); 999 ::lemon::ignore_unused_variable_warning(uen);999 ignore_unused_variable_warning(uen); 1000 1000 } 1001 1001 … … 1071 1071 // m3 = cmap; 1072 1072 1073 ::lemon::ignore_unused_variable_warning(m1);1074 ::lemon::ignore_unused_variable_warning(m2);1075 // ::lemon::ignore_unused_variable_warning(m3);1073 ignore_unused_variable_warning(m1); 1074 ignore_unused_variable_warning(m2); 1075 // ignore_unused_variable_warning(m3); 1076 1076 } 1077 1077 -
lemon/concepts/heap.h
r1084 r976 261 261 item=Item(); 262 262 prio=Prio(); 263 ::lemon::ignore_unused_variable_warning(item);264 ::lemon::ignore_unused_variable_warning(prio);263 ignore_unused_variable_warning(item); 264 ignore_unused_variable_warning(prio); 265 265 266 266 OwnItem own_item; … … 269 269 own_item=Item(); 270 270 own_prio=Prio(); 271 ::lemon::ignore_unused_variable_warning(own_item);272 ::lemon::ignore_unused_variable_warning(own_prio);273 ::lemon::ignore_unused_variable_warning(own_state);271 ignore_unused_variable_warning(own_item); 272 ignore_unused_variable_warning(own_prio); 273 ignore_unused_variable_warning(own_state); 274 274 275 275 _Heap heap1(map); 276 276 _Heap heap2 = heap1; 277 ::lemon::ignore_unused_variable_warning(heap1);278 ::lemon::ignore_unused_variable_warning(heap2);277 ignore_unused_variable_warning(heap1); 278 ignore_unused_variable_warning(heap2); 279 279 280 280 int s = heap.size(); 281 ::lemon::ignore_unused_variable_warning(s);281 ignore_unused_variable_warning(s); 282 282 bool e = heap.empty(); 283 ::lemon::ignore_unused_variable_warning(e);283 ignore_unused_variable_warning(e); 284 284 285 285 prio = heap.prio(); -
lemon/concepts/maps.h
r1083 r997 61 61 own_val = m[own_key]; 62 62 63 ::lemon::ignore_unused_variable_warning(key);64 ::lemon::ignore_unused_variable_warning(val);65 ::lemon::ignore_unused_variable_warning(own_key);66 ::lemon::ignore_unused_variable_warning(own_val);63 ignore_unused_variable_warning(key); 64 ignore_unused_variable_warning(val); 65 ignore_unused_variable_warning(own_key); 66 ignore_unused_variable_warning(own_val); 67 67 } 68 68 const Key& key; … … 101 101 m.set(own_key, own_val); 102 102 103 ::lemon::ignore_unused_variable_warning(key);104 ::lemon::ignore_unused_variable_warning(val);105 ::lemon::ignore_unused_variable_warning(own_key);106 ::lemon::ignore_unused_variable_warning(own_val);103 ignore_unused_variable_warning(key); 104 ignore_unused_variable_warning(val); 105 ignore_unused_variable_warning(own_key); 106 ignore_unused_variable_warning(own_val); 107 107 } 108 108 const Key& key; -
lemon/concepts/path.h
r1084 r976 76 76 template <typename CPath> 77 77 Path& operator=(const CPath& cpath) { 78 ::lemon::ignore_unused_variable_warning(cpath);78 ignore_unused_variable_warning(cpath); 79 79 return *this; 80 80 } … … 136 136 e = (i < ii); 137 137 138 ::lemon::ignore_unused_variable_warning(l);139 ::lemon::ignore_unused_variable_warning(pp);140 ::lemon::ignore_unused_variable_warning(e);141 ::lemon::ignore_unused_variable_warning(id);142 ::lemon::ignore_unused_variable_warning(ii);143 ::lemon::ignore_unused_variable_warning(ed);138 ignore_unused_variable_warning(l); 139 ignore_unused_variable_warning(pp); 140 ignore_unused_variable_warning(e); 141 ignore_unused_variable_warning(id); 142 ignore_unused_variable_warning(ii); 143 ignore_unused_variable_warning(ed); 144 144 } 145 145 }; … … 163 163 e = (i != INVALID); 164 164 165 ::lemon::ignore_unused_variable_warning(l);166 ::lemon::ignore_unused_variable_warning(e);167 ::lemon::ignore_unused_variable_warning(id);168 ::lemon::ignore_unused_variable_warning(ed);165 ignore_unused_variable_warning(l); 166 ignore_unused_variable_warning(e); 167 ignore_unused_variable_warning(id); 168 ignore_unused_variable_warning(ed); 169 169 } 170 170 _Path& p; … … 189 189 e = (i != INVALID); 190 190 191 ::lemon::ignore_unused_variable_warning(l);192 ::lemon::ignore_unused_variable_warning(e);193 ::lemon::ignore_unused_variable_warning(id);194 ::lemon::ignore_unused_variable_warning(ed);191 ignore_unused_variable_warning(l); 192 ignore_unused_variable_warning(e); 193 ignore_unused_variable_warning(id); 194 ignore_unused_variable_warning(ed); 195 195 } 196 196 _Path& p; -
lemon/core.h
r1084 r998 36 36 #ifdef _MSC_VER 37 37 #pragma warning( disable : 4250 4355 4503 4800 4996 ) 38 #endif39 40 #ifdef __GNUC__41 #define GCC_VERSION (__GNUC__ * 10000 \42 + __GNUC_MINOR__ * 100 \43 + __GNUC_PATCHLEVEL__)44 #endif45 46 #if GCC_VERSION >= 4080047 // Needed by the [DI]GRAPH_TYPEDEFS marcos for gcc 4.848 #pragma GCC diagnostic ignored "-Wunused-local-typedefs"49 38 #endif 50 39 -
lemon/cplex.cc
r1016 r989 41 41 int status; 42 42 _cnt = new int; 43 (*_cnt) = 1;44 43 _env = CPXopenCPLEX(&status); 45 44 if (_env == 0) { -
lemon/graph_to_eps.h
r1079 r998 223 223 using T::_copyright; 224 224 225 using T::NodeTextColorType;225 using typename T::NodeTextColorType; 226 226 using T::CUST_COL; 227 227 using T::DIST_COL; -
test/adaptors_test.cc
r1084 r998 66 66 Digraph::Arc a2 = digraph.addArc(n1, n3); 67 67 Digraph::Arc a3 = digraph.addArc(n2, n3); 68 ::lemon::ignore_unused_variable_warning(a3);68 ignore_unused_variable_warning(a3); 69 69 70 70 // Check the adaptor … … 101 101 Adaptor::Arc a7 = adaptor.addArc(n1, n4); 102 102 Adaptor::Arc a8 = adaptor.addArc(n1, n2); 103 ::lemon::ignore_unused_variable_warning(a6,a7,a8);103 ignore_unused_variable_warning(a6,a7,a8); 104 104 105 105 adaptor.erase(a1); … … 761 761 Digraph::Arc a2 = digraph.addArc(n1, n3); 762 762 Digraph::Arc a3 = digraph.addArc(n2, n3); 763 ::lemon::ignore_unused_variable_warning(a1,a2,a3);763 ignore_unused_variable_warning(a1,a2,a3); 764 764 765 765 checkGraphNodeList(adaptor, 6); -
test/bfs_test.cc
r1084 r1008 62 62 Arc e; 63 63 int l, i; 64 ::lemon::ignore_unused_variable_warning(l,i);64 ignore_unused_variable_warning(l,i); 65 65 bool b; 66 66 BType::DistMap d(G); … … 152 152 Digraph g; 153 153 bool b; 154 ::lemon::ignore_unused_variable_warning(b);154 ignore_unused_variable_warning(b); 155 155 156 156 bfs(g).run(Node()); -
test/circulation_test.cc
r1084 r1008 74 74 VType v; 75 75 bool b; 76 ::lemon::ignore_unused_variable_warning(v,b);76 ignore_unused_variable_warning(v,b); 77 77 78 78 typedef Circulation<Digraph, CapMap, CapMap, SupplyMap> … … 105 105 const_circ_test.barrierMap(bar); 106 106 107 ::lemon::ignore_unused_variable_warning(fm);107 ignore_unused_variable_warning(fm); 108 108 } 109 109 -
test/connectivity_test.cc
r1084 r998 69 69 Graph g(d); 70 70 Digraph::Node n = d.addNode(); 71 ::lemon::ignore_unused_variable_warning(n);71 ignore_unused_variable_warning(n); 72 72 73 73 check(stronglyConnected(d), "This digraph is strongly connected"); … … 247 247 Digraph::Node watch = d.addNode(); 248 248 Digraph::Node pants = d.addNode(); 249 ::lemon::ignore_unused_variable_warning(watch);249 ignore_unused_variable_warning(watch); 250 250 251 251 d.addArc(socks, shoe); -
test/dfs_test.cc
r1084 r1008 68 68 int l, i; 69 69 bool b; 70 ::lemon::ignore_unused_variable_warning(l,i,b);70 ignore_unused_variable_warning(l,i,b); 71 71 72 72 DType::DistMap d(G); … … 154 154 Digraph g; 155 155 bool b; 156 ::lemon::ignore_unused_variable_warning(b);156 ignore_unused_variable_warning(b); 157 157 158 158 dfs(g).run(Node()); -
test/digraph_test.cc
r1084 r999 65 65 a3 = G.addArc(n2, n3), 66 66 a4 = G.addArc(n2, n3); 67 ::lemon::ignore_unused_variable_warning(a2,a3,a4);67 ignore_unused_variable_warning(a2,a3,a4); 68 68 69 69 checkGraphNodeList(G, 3); … … 94 94 Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n2, n1), 95 95 a3 = G.addArc(n2, n3), a4 = G.addArc(n2, n3); 96 ::lemon::ignore_unused_variable_warning(a1,a2,a3,a4);96 ignore_unused_variable_warning(a1,a2,a3,a4); 97 97 98 98 Node n4 = G.split(n2); … … 128 128 a3 = G.addArc(n4, n3), a4 = G.addArc(n4, n3), 129 129 a5 = G.addArc(n2, n4); 130 ::lemon::ignore_unused_variable_warning(a1,a2,a3,a5);130 ignore_unused_variable_warning(a1,a2,a3,a5); 131 131 132 132 checkGraphNodeList(G, 4); … … 208 208 a3 = G.addArc(n4, n3), a4 = G.addArc(n3, n1), 209 209 a5 = G.addArc(n2, n4); 210 ::lemon::ignore_unused_variable_warning(a2,a3,a4,a5);210 ignore_unused_variable_warning(a2,a3,a4,a5); 211 211 212 212 // Check arc deletion … … 256 256 Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n2, n1), 257 257 a3 = G.addArc(n2, n3), a4 = G.addArc(n2, n3); 258 ::lemon::ignore_unused_variable_warning(a1,a2,a3,a4);258 ignore_unused_variable_warning(a1,a2,a3,a4); 259 259 260 260 typename Digraph::Snapshot snapshot(G); … … 357 357 e1 = g.addArc(n1, n2), 358 358 e2 = g.addArc(n2, n3); 359 ::lemon::ignore_unused_variable_warning(e2);359 ignore_unused_variable_warning(e2); 360 360 361 361 check(g.valid(n1), "Wrong validity check"); -
test/dijkstra_test.cc
r1084 r1008 66 66 int i; 67 67 bool b; 68 ::lemon::ignore_unused_variable_warning(l,i,b);68 ignore_unused_variable_warning(l,i,b); 69 69 70 70 DType::DistMap d(G); … … 165 165 Digraph g; 166 166 bool b; 167 ::lemon::ignore_unused_variable_warning(b);167 ignore_unused_variable_warning(b); 168 168 169 169 dijkstra(g,LengthMap()).run(Node()); -
test/edge_set_test.cc
r1084 r998 45 45 46 46 Digraph::Arc ga1 = digraph.addArc(n1, n2); 47 ::lemon::ignore_unused_variable_warning(ga1);47 ignore_unused_variable_warning(ga1); 48 48 49 49 ArcSet arc_set(digraph); 50 50 51 51 Digraph::Arc ga2 = digraph.addArc(n2, n1); 52 ::lemon::ignore_unused_variable_warning(ga2);52 ignore_unused_variable_warning(ga2); 53 53 54 54 checkGraphNodeList(arc_set, 2); … … 78 78 a3 = arc_set.addArc(n2, n3), 79 79 a4 = arc_set.addArc(n2, n3); 80 ::lemon::ignore_unused_variable_warning(a2,a3,a4);80 ignore_unused_variable_warning(a2,a3,a4); 81 81 82 82 checkGraphNodeList(arc_set, 3); … … 115 115 116 116 Digraph::Arc ga1 = digraph.addArc(n1, n2); 117 ::lemon::ignore_unused_variable_warning(ga1);117 ignore_unused_variable_warning(ga1); 118 118 119 119 ArcSet arc_set(digraph); 120 120 121 121 Digraph::Arc ga2 = digraph.addArc(n2, n1); 122 ::lemon::ignore_unused_variable_warning(ga2);122 ignore_unused_variable_warning(ga2); 123 123 124 124 checkGraphNodeList(arc_set, 2); … … 148 148 a3 = arc_set.addArc(n2, n3), 149 149 a4 = arc_set.addArc(n2, n3); 150 ::lemon::ignore_unused_variable_warning(a2,a3,a4);150 ignore_unused_variable_warning(a2,a3,a4); 151 151 152 152 checkGraphNodeList(arc_set, 3); … … 199 199 200 200 Digraph::Arc ga1 = digraph.addArc(n1, n2); 201 ::lemon::ignore_unused_variable_warning(ga1);201 ignore_unused_variable_warning(ga1); 202 202 203 203 EdgeSet edge_set(digraph); 204 204 205 205 Digraph::Arc ga2 = digraph.addArc(n2, n1); 206 ::lemon::ignore_unused_variable_warning(ga2);206 ignore_unused_variable_warning(ga2); 207 207 208 208 checkGraphNodeList(edge_set, 2); … … 241 241 e3 = edge_set.addEdge(n2, n3), 242 242 e4 = edge_set.addEdge(n2, n3); 243 ::lemon::ignore_unused_variable_warning(e2,e3,e4);243 ignore_unused_variable_warning(e2,e3,e4); 244 244 245 245 checkGraphNodeList(edge_set, 3); … … 287 287 288 288 Digraph::Arc ga1 = digraph.addArc(n1, n2); 289 ::lemon::ignore_unused_variable_warning(ga1);289 ignore_unused_variable_warning(ga1); 290 290 291 291 EdgeSet edge_set(digraph); 292 292 293 293 Digraph::Arc ga2 = digraph.addArc(n2, n1); 294 ::lemon::ignore_unused_variable_warning(ga2);294 ignore_unused_variable_warning(ga2); 295 295 296 296 checkGraphNodeList(edge_set, 2); … … 329 329 e3 = edge_set.addEdge(n2, n3), 330 330 e4 = edge_set.addEdge(n2, n3); 331 ::lemon::ignore_unused_variable_warning(e2,e3,e4);331 ignore_unused_variable_warning(e2,e3,e4); 332 332 333 333 checkGraphNodeList(edge_set, 3); -
test/euler_test.cc
r1084 r998 102 102 Graph g(d); 103 103 Digraph::Node n = d.addNode(); 104 ::lemon::ignore_unused_variable_warning(n);104 ignore_unused_variable_warning(n); 105 105 106 106 checkDiEulerIt(d); … … 191 191 Digraph::Node n4 = d.addNode(); 192 192 Digraph::Node n5 = d.addNode(); 193 ::lemon::ignore_unused_variable_warning(n0,n4,n5);193 ignore_unused_variable_warning(n0,n4,n5); 194 194 195 195 d.addArc(n1, n2); -
test/gomory_hu_test.cc
r1084 r1008 69 69 Value v; 70 70 int d; 71 ::lemon::ignore_unused_variable_warning(v,d);71 ignore_unused_variable_warning(v,d); 72 72 73 73 GomoryHu<Graph, CapMap> gh_test(g, cap); -
test/graph_test.cc
r1084 r998 67 67 Edge e2 = G.addEdge(n2, n1), 68 68 e3 = G.addEdge(n2, n3); 69 ::lemon::ignore_unused_variable_warning(e2,e3);69 ignore_unused_variable_warning(e2,e3); 70 70 71 71 checkGraphNodeList(G, 3); … … 100 100 e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4), 101 101 e5 = G.addEdge(n4, n3); 102 ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);102 ignore_unused_variable_warning(e1,e3,e4,e5); 103 103 104 104 checkGraphNodeList(G, 4); … … 180 180 e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4), 181 181 e5 = G.addEdge(n4, n3); 182 ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);182 ignore_unused_variable_warning(e1,e3,e4,e5); 183 183 184 184 // Check edge deletion … … 221 221 Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1), 222 222 e3 = G.addEdge(n2, n3); 223 ::lemon::ignore_unused_variable_warning(e1,e2,e3);223 ignore_unused_variable_warning(e1,e2,e3); 224 224 225 225 checkGraphNodeList(G, 3); … … 386 386 e1 = g.addEdge(n1, n2), 387 387 e2 = g.addEdge(n2, n3); 388 ::lemon::ignore_unused_variable_warning(e2);388 ignore_unused_variable_warning(e2); 389 389 390 390 check(g.valid(n1), "Wrong validity check"); … … 525 525 526 526 Node n = G.nodeFromId(dim); 527 ::lemon::ignore_unused_variable_warning(n);527 ignore_unused_variable_warning(n); 528 528 529 529 for (NodeIt n(G); n != INVALID; ++n) { -
test/hao_orlin_test.cc
r1084 r1008 67 67 CutMap cut; 68 68 Value v; 69 ::lemon::ignore_unused_variable_warning(v);69 ignore_unused_variable_warning(v); 70 70 71 71 HaoOrlin<Digraph, CapMap> ho_test(g, cap); -
test/lp_test.cc
r1078 r988 199 199 c = c <= 4; 200 200 LP::Constr c2; 201 #if ( __GNUC__ == 4 ) && ( __GNUC_MINOR__ == 3 )202 c2 = ( -3 <= v ) <= 4;203 #else204 201 c2 = -3 <= v <= 4; 205 #endif206 207 202 } 208 203 … … 246 241 { 247 242 LP::DualExpr e,f,g; 248 LP::Row p1 = INVALID, p2 = INVALID; 243 LP::Row p1 = INVALID, p2 = INVALID, p3 = INVALID, 244 p4 = INVALID, p5 = INVALID; 249 245 250 246 e[p1]=2; -
test/maps_test.cc
r1084 r998 104 104 NullMap<A,B> map1; 105 105 NullMap<A,B> map2 = map1; 106 ::lemon::ignore_unused_variable_warning(map2);106 ignore_unused_variable_warning(map2); 107 107 map1 = nullMap<A,B>(); 108 108 } … … 115 115 ConstMap<A,B> map2 = B(); 116 116 ConstMap<A,B> map3 = map1; 117 ::lemon::ignore_unused_variable_warning(map2,map3);117 ignore_unused_variable_warning(map2,map3); 118 118 119 119 map1 = constMap<A>(B()); … … 122 122 ConstMap<A,C> map4(C(1)); 123 123 ConstMap<A,C> map5 = map4; 124 ::lemon::ignore_unused_variable_warning(map5);124 ignore_unused_variable_warning(map5); 125 125 126 126 map4 = constMap<A>(C(2)); … … 144 144 IdentityMap<A> map1; 145 145 IdentityMap<A> map2 = map1; 146 ::lemon::ignore_unused_variable_warning(map2);146 ignore_unused_variable_warning(map2); 147 147 148 148 map1 = identityMap<A>(); … … 205 205 checkConcept<ReadMap<B,double>, CompMap>(); 206 206 CompMap map1 = CompMap(DoubleMap(),ReadMap<B,A>()); 207 ::lemon::ignore_unused_variable_warning(map1);207 ignore_unused_variable_warning(map1); 208 208 CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>()); 209 ::lemon::ignore_unused_variable_warning(map2);209 ignore_unused_variable_warning(map2); 210 210 211 211 SparseMap<double, bool> m1(false); m1[3.14] = true; … … 220 220 checkConcept<ReadMap<A,double>, CombMap>(); 221 221 CombMap map1 = CombMap(DoubleMap(), DoubleMap()); 222 ::lemon::ignore_unused_variable_warning(map1);222 ignore_unused_variable_warning(map1); 223 223 CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>()); 224 ::lemon::ignore_unused_variable_warning(map2);224 ignore_unused_variable_warning(map2); 225 225 226 226 check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3, … … 234 234 FunctorToMap<F> map1; 235 235 FunctorToMap<F> map2 = FunctorToMap<F>(F()); 236 ::lemon::ignore_unused_variable_warning(map2);236 ignore_unused_variable_warning(map2); 237 237 238 238 B b = functorToMap(F())[A()]; 239 ::lemon::ignore_unused_variable_warning(b);239 ignore_unused_variable_warning(b); 240 240 241 241 checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >(); 242 242 MapToFunctor<ReadMap<A,B> > map = 243 243 MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>()); 244 ::lemon::ignore_unused_variable_warning(map);244 ignore_unused_variable_warning(map); 245 245 246 246 check(functorToMap(&func)[A()] == 3, … … 260 260 ConvertMap<ReadMap<double, int>, double> >(); 261 261 ConvertMap<RangeMap<bool>, int> map1(rangeMap(1, true)); 262 ::lemon::ignore_unused_variable_warning(map1);262 ignore_unused_variable_warning(map1); 263 263 ConvertMap<RangeMap<bool>, int> map2 = convertMap<int>(rangeMap(2, false)); 264 ::lemon::ignore_unused_variable_warning(map2);264 ignore_unused_variable_warning(map2); 265 265 266 266 } -
test/matching_test.cc
r1084 r1008 146 146 MaxMatching<Graph>::Status stat = 147 147 const_mat_test.status(n); 148 ::lemon::ignore_unused_variable_warning(stat);148 ignore_unused_variable_warning(stat); 149 149 const MaxMatching<Graph>::StatusMap& smap = 150 150 const_mat_test.statusMap(); -
test/min_cost_arborescence_test.cc
r1084 r1008 92 92 VType c; 93 93 bool b; 94 ::lemon::ignore_unused_variable_warning(c,b);94 ignore_unused_variable_warning(c,b); 95 95 int i; 96 96 CostMap cost; … … 128 128 c = const_mcarb_test.dualValue(i); 129 129 130 ::lemon::ignore_unused_variable_warning(am);131 ::lemon::ignore_unused_variable_warning(pm);130 ignore_unused_variable_warning(am); 131 ignore_unused_variable_warning(pm); 132 132 } 133 133 -
test/preflow_test.cc
r1084 r1008 87 87 VType v; 88 88 bool b; 89 ::lemon::ignore_unused_variable_warning(v,b);89 ignore_unused_variable_warning(v,b); 90 90 91 91 typedef Preflow<Digraph, CapMap> … … 121 121 const_preflow_test.minCutMap(cut); 122 122 123 ::lemon::ignore_unused_variable_warning(fm);123 ignore_unused_variable_warning(fm); 124 124 } 125 125 -
test/suurballe_test.cc
r1084 r1008 118 118 int f; 119 119 VType c; 120 ::lemon::ignore_unused_variable_warning(f,c);120 ignore_unused_variable_warning(f,c); 121 121 122 122 c = const_suurb_test.totalLength(); … … 130 130 Path<Digraph> p = const_suurb_test.path(k); 131 131 132 ::lemon::ignore_unused_variable_warning(fm);133 ::lemon::ignore_unused_variable_warning(pm);132 ignore_unused_variable_warning(fm); 133 ignore_unused_variable_warning(pm); 134 134 } 135 135 -
test/time_measure_test.cc
r1083 r997 36 36 { 37 37 TimeStamp x(T); 38 ::lemon::ignore_unused_variable_warning(x);38 ignore_unused_variable_warning(x); 39 39 } 40 40 }
Note: See TracChangeset
for help on using the changeset viewer.