lemon-1.3: comparison lemon/concepts/graph

equal deleted inserted replaced

-:5a8be9f58a10
+:03f2ab84ea0d
 b = (ia < ib);
 }
 const _GraphItem &ia;
 const _GraphItem &ib;
+Constraints() {}
 };
 };
 /// \brief Base skeleton class for directed graphs.
 ///
 n = digraph.oppositeNode(n, e);
 }
 }
 const _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Base skeleton class for undirected graphs.
 ///
 ignore_unused_variable_warning(d);
 }
 }
 const _Graph& graph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for \e idable directed graphs.
 eid = digraph.maxArcId();
 ignore_unused_variable_warning(eid);
 }
 const _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for \e idable undirected graphs.
 ///
 ueid = graph.maxEdgeId();
 ignore_unused_variable_warning(ueid);
 }
 const _Graph& graph;
+Constraints() {}
 };
 };
 /// \brief Concept class for \c NodeIt, \c ArcIt and \c EdgeIt types.
 ///
 Item bi = it1;
 bi = it2;
 }
 const GR& g;
+Constraints() {}
 };
 };
 /// \brief Concept class for \c InArcIt, \c OutArcIt and
 /// \c IncEdgeIt types.
 Item e = it1;
 e = it2;
 }
 const Base& node;
 const GR& graph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for iterable directed graphs.
 ///
 ignore_unused_variable_warning(n);
 }
 }
 const _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for iterable undirected graphs.
 ///
 n = graph.runningNode(ieit);
 }
 }
 const _Graph& graph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for alterable directed graphs.
 ///
 ignore_unused_variable_warning(nn);
 ignore_unused_variable_warning(en);
 }
 const _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for alterable undirected graphs.
 ///
 = graph.notifier(typename _Graph::Edge());
 ignore_unused_variable_warning(uen);
 }
 const _Graph& graph;
+Constraints() {}
 };
 };
 /// \brief Concept class for standard graph maps.
 ///
 }
 const _Map &m;
 const GR &g;
 const typename GraphMap::Value &t;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for mappable directed graphs.
 DummyArcMap >();
 }
 }
 const _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for mappable undirected graphs.
 ///
 DummyEdgeMap >();
 }
 }
 const _Graph& graph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for extendable directed graphs.
 ///
 typename _Digraph::Arc arc;
 arc = digraph.addArc(node_a, node_b);
 }
 _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for extendable undirected graphs.
 ///
 typename _Graph::Edge edge;
 edge = graph.addEdge(node_a, node_b);
 }
 _Graph& graph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for erasable directed graphs.
 ///
 const typename _Digraph::Arc arc(INVALID);
 digraph.erase(arc);
 }
 _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for erasable undirected graphs.
 ///
 const typename _Graph::Edge edge(INVALID);
 graph.erase(edge);
 }
 _Graph& graph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for clearable directed graphs.
 ///
 checkConcept<Base, _Digraph>();
 digraph.clear();
 }
 _Digraph& digraph;
+Constraints() {}
 };
 };
 /// \brief Skeleton class for clearable undirected graphs.
 ///
 checkConcept<Base, _Graph>();
 graph.clear();
 }
 _Graph& graph;
+Constraints() {}
 };
 };
 }

changeset 993	157427808b40
parent 666	1993af615e68
child 976	426a704d7483
child 997	761fe0846f49