# HG changeset patch
# User Balazs Dezso <deba@google.com>
# Date 1375449241 -7200
# Node ID 9029c764a07c4fbc7cf8b0dbcb74c378b456fde7
# Parent 73c892335e748075d51db6f31641dfed996188cd
Add namespace ignore_unused_variable_warning calls
diff -r 73c892335e74 -r 9029c764a07c lemon/concept_check.h
a
|
b
|
|
34 | 34 | overtarget with g++. |
35 | 35 | */ |
36 | 36 | |
37 | | template <class T> inline void ignore_unused_variable_warning(const T&) { } |
| 37 | template <class T> |
| 38 | inline void ignore_unused_variable_warning(const T&) { } |
38 | 39 | template <class T1, class T2> |
39 | 40 | inline void ignore_unused_variable_warning(const T1&, const T2&) { } |
40 | 41 | template <class T1, class T2, class T3> |
diff -r 73c892335e74 -r 9029c764a07c lemon/concepts/bpgraph.h
a
|
b
|
|
523 | 523 | |
524 | 524 | /// Sets the iterator to the first arc of the given graph. |
525 | 525 | /// |
526 | | explicit ArcIt(const BpGraph &g) { ignore_unused_variable_warning(g); } |
| 526 | explicit ArcIt(const BpGraph &g) { |
| 527 | ::lemon::ignore_unused_variable_warning(g); |
| 528 | } |
527 | 529 | /// Sets the iterator to the given arc. |
528 | 530 | |
529 | 531 | /// Sets the iterator to the given arc of the given graph. |
… |
… |
|
569 | 571 | /// Sets the iterator to the first outgoing arc of the given node. |
570 | 572 | /// |
571 | 573 | OutArcIt(const BpGraph& n, const Node& g) { |
572 | | ignore_unused_variable_warning(n); |
573 | | ignore_unused_variable_warning(g); |
| 574 | ::lemon::ignore_unused_variable_warning(n, g); |
574 | 575 | } |
575 | 576 | /// Sets the iterator to the given arc. |
576 | 577 | |
… |
… |
|
617 | 618 | /// Sets the iterator to the first incoming arc of the given node. |
618 | 619 | /// |
619 | 620 | InArcIt(const BpGraph& g, const Node& n) { |
620 | | ignore_unused_variable_warning(n); |
621 | | ignore_unused_variable_warning(g); |
| 621 | ::lemon::ignore_unused_variable_warning(n, g); |
622 | 622 | } |
623 | 623 | /// Sets the iterator to the given arc. |
624 | 624 | |
diff -r 73c892335e74 -r 9029c764a07c lemon/concepts/digraph.h
a
|
b
|
|
312 | 312 | |
313 | 313 | /// Sets the iterator to the first arc of the given digraph. |
314 | 314 | /// |
315 | | explicit ArcIt(const Digraph& g) { ignore_unused_variable_warning(g); } |
| 315 | explicit ArcIt(const Digraph& g) { |
| 316 | ::lemon::ignore_unused_variable_warning(g); |
| 317 | } |
316 | 318 | /// Sets the iterator to the given arc. |
317 | 319 | |
318 | 320 | /// Sets the iterator to the given arc of the given digraph. |
diff -r 73c892335e74 -r 9029c764a07c lemon/concepts/graph.h
a
|
b
|
|
396 | 396 | |
397 | 397 | /// Sets the iterator to the first arc of the given graph. |
398 | 398 | /// |
399 | | explicit ArcIt(const Graph &g) { ignore_unused_variable_warning(g); } |
| 399 | explicit ArcIt(const Graph &g) { |
| 400 | ::lemon::ignore_unused_variable_warning(g); |
| 401 | } |
400 | 402 | /// Sets the iterator to the given arc. |
401 | 403 | |
402 | 404 | /// Sets the iterator to the given arc of the given graph. |
… |
… |
|
442 | 444 | /// Sets the iterator to the first outgoing arc of the given node. |
443 | 445 | /// |
444 | 446 | OutArcIt(const Graph& n, const Node& g) { |
445 | | ignore_unused_variable_warning(n); |
446 | | ignore_unused_variable_warning(g); |
| 447 | ::lemon::ignore_unused_variable_warning(n, g); |
447 | 448 | } |
448 | 449 | /// Sets the iterator to the given arc. |
449 | 450 | |
… |
… |
|
490 | 491 | /// Sets the iterator to the first incoming arc of the given node. |
491 | 492 | /// |
492 | 493 | InArcIt(const Graph& g, const Node& n) { |
493 | | ignore_unused_variable_warning(n); |
494 | | ignore_unused_variable_warning(g); |
| 494 | ::lemon::ignore_unused_variable_warning(n, g); |
495 | 495 | } |
496 | 496 | /// Sets the iterator to the given arc. |
497 | 497 | |
diff -r 73c892335e74 -r 9029c764a07c lemon/concepts/graph_components.h
a
|
b
|
|
108 | 108 | i1 = i2 = i3; |
109 | 109 | |
110 | 110 | bool b; |
111 | | ignore_unused_variable_warning(b); |
| 111 | ::lemon::ignore_unused_variable_warning(b); |
112 | 112 | |
113 | 113 | b = (ia == ib) && (ia != ib); |
114 | 114 | b = (ia == INVALID) && (ib != INVALID); |
… |
… |
|
289 | 289 | e = graph.oppositeArc(e); |
290 | 290 | ue = e; |
291 | 291 | bool d = graph.direction(e); |
292 | | ignore_unused_variable_warning(d); |
| 292 | ::lemon::ignore_unused_variable_warning(d); |
293 | 293 | } |
294 | 294 | } |
295 | 295 | |
… |
… |
|
456 | 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); |
457 | 457 | rn = bpgraph.asRedNode(rnan); |
458 | 458 | bn = bpgraph.asBlueNode(bnan); |
459 | | ignore_unused_variable_warning(b); |
| 459 | ::lemon::ignore_unused_variable_warning(b); |
460 | 460 | } |
461 | 461 | } |
462 | 462 | |
… |
… |
|
534 | 534 | arc = digraph.arcFromId(eid); |
535 | 535 | |
536 | 536 | nid = digraph.maxNodeId(); |
537 | | ignore_unused_variable_warning(nid); |
| 537 | ::lemon::ignore_unused_variable_warning(nid); |
538 | 538 | eid = digraph.maxArcId(); |
539 | | ignore_unused_variable_warning(eid); |
| 539 | ::lemon::ignore_unused_variable_warning(eid); |
540 | 540 | } |
541 | 541 | |
542 | 542 | const _Digraph& digraph; |
… |
… |
|
589 | 589 | ueid = graph.id(edge); |
590 | 590 | edge = graph.edgeFromId(ueid); |
591 | 591 | ueid = graph.maxEdgeId(); |
592 | | ignore_unused_variable_warning(ueid); |
| 592 | ::lemon::ignore_unused_variable_warning(ueid); |
593 | 593 | } |
594 | 594 | |
595 | 595 | const _Graph& graph; |
… |
… |
|
653 | 653 | int bid = bpgraph.id(blue); |
654 | 654 | rid = bpgraph.maxRedId(); |
655 | 655 | bid = bpgraph.maxBlueId(); |
656 | | ignore_unused_variable_warning(rid); |
657 | | ignore_unused_variable_warning(bid); |
| 656 | ::lemon::ignore_unused_variable_warning(rid); |
| 657 | ::lemon::ignore_unused_variable_warning(bid); |
658 | 658 | } |
659 | 659 | |
660 | 660 | const _BpGraph& bpgraph; |
… |
… |
|
726 | 726 | _GraphItemIt it2; |
727 | 727 | _GraphItemIt it3 = it1; |
728 | 728 | _GraphItemIt it4 = INVALID; |
729 | | ignore_unused_variable_warning(it3); |
730 | | ignore_unused_variable_warning(it4); |
| 729 | ::lemon::ignore_unused_variable_warning(it3); |
| 730 | ::lemon::ignore_unused_variable_warning(it4); |
731 | 731 | |
732 | 732 | it2 = ++it1; |
733 | 733 | ++it2 = it1; |
… |
… |
|
817 | 817 | _GraphIncIt it2; |
818 | 818 | _GraphIncIt it3 = it1; |
819 | 819 | _GraphIncIt it4 = INVALID; |
820 | | ignore_unused_variable_warning(it3); |
821 | | ignore_unused_variable_warning(it4); |
| 820 | ::lemon::ignore_unused_variable_warning(it3); |
| 821 | ::lemon::ignore_unused_variable_warning(it4); |
822 | 822 | |
823 | 823 | it2 = ++it1; |
824 | 824 | ++it2 = it1; |
… |
… |
|
1000 | 1000 | n = digraph.runningNode(iait); |
1001 | 1001 | n = digraph.baseNode(oait); |
1002 | 1002 | n = digraph.runningNode(oait); |
1003 | | ignore_unused_variable_warning(n); |
| 1003 | ::lemon::ignore_unused_variable_warning(n); |
1004 | 1004 | } |
1005 | 1005 | } |
1006 | 1006 | |
… |
… |
|
1277 | 1277 | typename _Digraph::ArcNotifier& en |
1278 | 1278 | = digraph.notifier(typename _Digraph::Arc()); |
1279 | 1279 | |
1280 | | ignore_unused_variable_warning(nn); |
1281 | | ignore_unused_variable_warning(en); |
| 1280 | ::lemon::ignore_unused_variable_warning(nn); |
| 1281 | ::lemon::ignore_unused_variable_warning(en); |
1282 | 1282 | } |
1283 | 1283 | |
1284 | 1284 | const _Digraph& digraph; |
… |
… |
|
1325 | 1325 | checkConcept<AlterableDigraphComponent<Base>, _Graph>(); |
1326 | 1326 | typename _Graph::EdgeNotifier& uen |
1327 | 1327 | = graph.notifier(typename _Graph::Edge()); |
1328 | | ignore_unused_variable_warning(uen); |
| 1328 | ::lemon::ignore_unused_variable_warning(uen); |
1329 | 1329 | } |
1330 | 1330 | |
1331 | 1331 | const _Graph& graph; |
… |
… |
|
1387 | 1387 | = bpgraph.notifier(typename _BpGraph::RedNode()); |
1388 | 1388 | typename _BpGraph::BlueNodeNotifier& bnn |
1389 | 1389 | = bpgraph.notifier(typename _BpGraph::BlueNode()); |
1390 | | ignore_unused_variable_warning(rnn); |
1391 | | ignore_unused_variable_warning(bnn); |
| 1390 | ::lemon::ignore_unused_variable_warning(rnn); |
| 1391 | ::lemon::ignore_unused_variable_warning(bnn); |
1392 | 1392 | } |
1393 | 1393 | |
1394 | 1394 | const _BpGraph& bpgraph; |
… |
… |
|
1461 | 1461 | // ReadMap<Key, Value> cmap; |
1462 | 1462 | // m3 = cmap; |
1463 | 1463 | |
1464 | | ignore_unused_variable_warning(m1); |
1465 | | ignore_unused_variable_warning(m2); |
1466 | | // ignore_unused_variable_warning(m3); |
| 1464 | ::lemon::ignore_unused_variable_warning(m1); |
| 1465 | ::lemon::ignore_unused_variable_warning(m2); |
| 1466 | // ::lemon::ignore_unused_variable_warning(m3); |
1467 | 1467 | } |
1468 | 1468 | |
1469 | 1469 | const _Map &m; |
diff -r 73c892335e74 -r 9029c764a07c lemon/concepts/heap.h
a
|
b
|
|
260 | 260 | Prio prio; |
261 | 261 | item=Item(); |
262 | 262 | prio=Prio(); |
263 | | ignore_unused_variable_warning(item); |
264 | | ignore_unused_variable_warning(prio); |
| 263 | ::lemon::ignore_unused_variable_warning(item); |
| 264 | ::lemon::ignore_unused_variable_warning(prio); |
265 | 265 | |
266 | 266 | OwnItem own_item; |
267 | 267 | OwnPrio own_prio; |
268 | 268 | OwnState own_state; |
269 | 269 | own_item=Item(); |
270 | 270 | own_prio=Prio(); |
271 | | ignore_unused_variable_warning(own_item); |
272 | | ignore_unused_variable_warning(own_prio); |
273 | | ignore_unused_variable_warning(own_state); |
| 271 | ::lemon::ignore_unused_variable_warning(own_item); |
| 272 | ::lemon::ignore_unused_variable_warning(own_prio); |
| 273 | ::lemon::ignore_unused_variable_warning(own_state); |
274 | 274 | |
275 | 275 | _Heap heap1(map); |
276 | 276 | _Heap heap2 = heap1; |
277 | | ignore_unused_variable_warning(heap1); |
278 | | ignore_unused_variable_warning(heap2); |
| 277 | ::lemon::ignore_unused_variable_warning(heap1); |
| 278 | ::lemon::ignore_unused_variable_warning(heap2); |
279 | 279 | |
280 | 280 | int s = heap.size(); |
281 | | ignore_unused_variable_warning(s); |
| 281 | ::lemon::ignore_unused_variable_warning(s); |
282 | 282 | bool e = heap.empty(); |
283 | | ignore_unused_variable_warning(e); |
| 283 | ::lemon::ignore_unused_variable_warning(e); |
284 | 284 | |
285 | 285 | prio = heap.prio(); |
286 | 286 | item = heap.top(); |
diff -r 73c892335e74 -r 9029c764a07c lemon/concepts/maps.h
a
|
b
|
|
60 | 60 | typename _ReadMap::Value own_val = m[own_key]; |
61 | 61 | own_val = m[own_key]; |
62 | 62 | |
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); |
| 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); |
67 | 67 | } |
68 | 68 | const Key& key; |
69 | 69 | const typename _ReadMap::Key& own_key; |
… |
… |
|
100 | 100 | m.set(key, val); |
101 | 101 | m.set(own_key, own_val); |
102 | 102 | |
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); |
| 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); |
107 | 107 | } |
108 | 108 | const Key& key; |
109 | 109 | const Value& val; |
diff -r 73c892335e74 -r 9029c764a07c lemon/concepts/path.h
a
|
b
|
|
75 | 75 | /// \brief Template assigment operator |
76 | 76 | template <typename CPath> |
77 | 77 | Path& operator=(const CPath& cpath) { |
78 | | ignore_unused_variable_warning(cpath); |
| 78 | ::lemon::ignore_unused_variable_warning(cpath); |
79 | 79 | return *this; |
80 | 80 | } |
81 | 81 | |
… |
… |
|
135 | 135 | e = (i != ii); |
136 | 136 | e = (i < ii); |
137 | 137 | |
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); |
| 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); |
144 | 144 | } |
145 | 145 | }; |
146 | 146 | |
… |
… |
|
162 | 162 | e = (i == INVALID); |
163 | 163 | e = (i != INVALID); |
164 | 164 | |
165 | | ignore_unused_variable_warning(l); |
166 | | ignore_unused_variable_warning(e); |
167 | | ignore_unused_variable_warning(id); |
168 | | ignore_unused_variable_warning(ed); |
| 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); |
169 | 169 | } |
170 | 170 | _Path& p; |
171 | 171 | PathDumperConstraints() {} |
… |
… |
|
188 | 188 | e = (i == INVALID); |
189 | 189 | e = (i != INVALID); |
190 | 190 | |
191 | | ignore_unused_variable_warning(l); |
192 | | ignore_unused_variable_warning(e); |
193 | | ignore_unused_variable_warning(id); |
194 | | ignore_unused_variable_warning(ed); |
| 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); |
195 | 195 | } |
196 | 196 | _Path& p; |
197 | 197 | PathDumperConstraints() {} |