equal
deleted
inserted
replaced
106 _GraphItem i3 = INVALID; |
106 _GraphItem i3 = INVALID; |
107 |
107 |
108 i1 = i2 = i3; |
108 i1 = i2 = i3; |
109 |
109 |
110 bool b; |
110 bool b; |
111 ignore_unused_variable_warning(b); |
111 ::lemon::ignore_unused_variable_warning(b); |
112 |
112 |
113 b = (ia == ib) && (ia != ib); |
113 b = (ia == ib) && (ia != ib); |
114 b = (ia == INVALID) && (ib != INVALID); |
114 b = (ia == INVALID) && (ib != INVALID); |
115 b = (ia < ib); |
115 b = (ia < ib); |
116 } |
116 } |
287 e = graph.direct(ue, false); |
287 e = graph.direct(ue, false); |
288 e = graph.direct(ue, n); |
288 e = graph.direct(ue, n); |
289 e = graph.oppositeArc(e); |
289 e = graph.oppositeArc(e); |
290 ue = e; |
290 ue = e; |
291 bool d = graph.direction(e); |
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 |
296 const _Graph& graph; |
296 const _Graph& graph; |
297 Constraints() {} |
297 Constraints() {} |
532 int eid = digraph.id(arc); |
532 int eid = digraph.id(arc); |
533 eid = digraph.id(arc); |
533 eid = digraph.id(arc); |
534 arc = digraph.arcFromId(eid); |
534 arc = digraph.arcFromId(eid); |
535 |
535 |
536 nid = digraph.maxNodeId(); |
536 nid = digraph.maxNodeId(); |
537 ignore_unused_variable_warning(nid); |
537 ::lemon::ignore_unused_variable_warning(nid); |
538 eid = digraph.maxArcId(); |
538 eid = digraph.maxArcId(); |
539 ignore_unused_variable_warning(eid); |
539 ::lemon::ignore_unused_variable_warning(eid); |
540 } |
540 } |
541 |
541 |
542 const _Digraph& digraph; |
542 const _Digraph& digraph; |
543 Constraints() {} |
543 Constraints() {} |
544 }; |
544 }; |
587 typename _Graph::Edge edge; |
587 typename _Graph::Edge edge; |
588 int ueid = graph.id(edge); |
588 int ueid = graph.id(edge); |
589 ueid = graph.id(edge); |
589 ueid = graph.id(edge); |
590 edge = graph.edgeFromId(ueid); |
590 edge = graph.edgeFromId(ueid); |
591 ueid = graph.maxEdgeId(); |
591 ueid = graph.maxEdgeId(); |
592 ignore_unused_variable_warning(ueid); |
592 ::lemon::ignore_unused_variable_warning(ueid); |
593 } |
593 } |
594 |
594 |
595 const _Graph& graph; |
595 const _Graph& graph; |
596 Constraints() {} |
596 Constraints() {} |
597 }; |
597 }; |
724 checkConcept<GraphItem<>, _GraphItemIt>(); |
724 checkConcept<GraphItem<>, _GraphItemIt>(); |
725 _GraphItemIt it1(g); |
725 _GraphItemIt it1(g); |
726 _GraphItemIt it2; |
726 _GraphItemIt it2; |
727 _GraphItemIt it3 = it1; |
727 _GraphItemIt it3 = it1; |
728 _GraphItemIt it4 = INVALID; |
728 _GraphItemIt it4 = INVALID; |
729 ignore_unused_variable_warning(it3); |
729 ::lemon::ignore_unused_variable_warning(it3); |
730 ignore_unused_variable_warning(it4); |
730 ::lemon::ignore_unused_variable_warning(it4); |
731 |
731 |
732 it2 = ++it1; |
732 it2 = ++it1; |
733 ++it2 = it1; |
733 ++it2 = it1; |
734 ++(++it1); |
734 ++(++it1); |
735 |
735 |
815 checkConcept<GraphItem<sel>, _GraphIncIt>(); |
815 checkConcept<GraphItem<sel>, _GraphIncIt>(); |
816 _GraphIncIt it1(graph, node); |
816 _GraphIncIt it1(graph, node); |
817 _GraphIncIt it2; |
817 _GraphIncIt it2; |
818 _GraphIncIt it3 = it1; |
818 _GraphIncIt it3 = it1; |
819 _GraphIncIt it4 = INVALID; |
819 _GraphIncIt it4 = INVALID; |
820 ignore_unused_variable_warning(it3); |
820 ::lemon::ignore_unused_variable_warning(it3); |
821 ignore_unused_variable_warning(it4); |
821 ::lemon::ignore_unused_variable_warning(it4); |
822 |
822 |
823 it2 = ++it1; |
823 it2 = ++it1; |
824 ++it2 = it1; |
824 ++it2 = it1; |
825 ++(++it1); |
825 ++(++it1); |
826 Item e = it1; |
826 Item e = it1; |
998 const typename _Digraph::OutArcIt oait(INVALID); |
998 const typename _Digraph::OutArcIt oait(INVALID); |
999 n = digraph.baseNode(iait); |
999 n = digraph.baseNode(iait); |
1000 n = digraph.runningNode(iait); |
1000 n = digraph.runningNode(iait); |
1001 n = digraph.baseNode(oait); |
1001 n = digraph.baseNode(oait); |
1002 n = digraph.runningNode(oait); |
1002 n = digraph.runningNode(oait); |
1003 ignore_unused_variable_warning(n); |
1003 ::lemon::ignore_unused_variable_warning(n); |
1004 } |
1004 } |
1005 } |
1005 } |
1006 |
1006 |
1007 const _Digraph& digraph; |
1007 const _Digraph& digraph; |
1008 Constraints() {} |
1008 Constraints() {} |
1275 = digraph.notifier(typename _Digraph::Node()); |
1275 = digraph.notifier(typename _Digraph::Node()); |
1276 |
1276 |
1277 typename _Digraph::ArcNotifier& en |
1277 typename _Digraph::ArcNotifier& en |
1278 = digraph.notifier(typename _Digraph::Arc()); |
1278 = digraph.notifier(typename _Digraph::Arc()); |
1279 |
1279 |
1280 ignore_unused_variable_warning(nn); |
1280 ::lemon::ignore_unused_variable_warning(nn); |
1281 ignore_unused_variable_warning(en); |
1281 ::lemon::ignore_unused_variable_warning(en); |
1282 } |
1282 } |
1283 |
1283 |
1284 const _Digraph& digraph; |
1284 const _Digraph& digraph; |
1285 Constraints() {} |
1285 Constraints() {} |
1286 }; |
1286 }; |
1323 struct Constraints { |
1323 struct Constraints { |
1324 void constraints() { |
1324 void constraints() { |
1325 checkConcept<AlterableDigraphComponent<Base>, _Graph>(); |
1325 checkConcept<AlterableDigraphComponent<Base>, _Graph>(); |
1326 typename _Graph::EdgeNotifier& uen |
1326 typename _Graph::EdgeNotifier& uen |
1327 = graph.notifier(typename _Graph::Edge()); |
1327 = graph.notifier(typename _Graph::Edge()); |
1328 ignore_unused_variable_warning(uen); |
1328 ::lemon::ignore_unused_variable_warning(uen); |
1329 } |
1329 } |
1330 |
1330 |
1331 const _Graph& graph; |
1331 const _Graph& graph; |
1332 Constraints() {} |
1332 Constraints() {} |
1333 }; |
1333 }; |
1459 |
1459 |
1460 // Assignment operator |
1460 // Assignment operator |
1461 // ReadMap<Key, Value> cmap; |
1461 // ReadMap<Key, Value> cmap; |
1462 // m3 = cmap; |
1462 // m3 = cmap; |
1463 |
1463 |
1464 ignore_unused_variable_warning(m1); |
1464 ::lemon::ignore_unused_variable_warning(m1); |
1465 ignore_unused_variable_warning(m2); |
1465 ::lemon::ignore_unused_variable_warning(m2); |
1466 // ignore_unused_variable_warning(m3); |
1466 // ::lemon::ignore_unused_variable_warning(m3); |
1467 } |
1467 } |
1468 |
1468 |
1469 const _Map &m; |
1469 const _Map &m; |
1470 const GR &g; |
1470 const GR &g; |
1471 const typename GraphMap::Value &t; |
1471 const typename GraphMap::Value &t; |