Changeset 938:70e2886211d5 in lemon-0.x for src/lemon/skeletons

Ignore:
Timestamp:
10/05/04 11:41:05 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1266
Message:

Many of ckeckCompileXYZ()'s are now in the corresponding skeleton headers.
(Tests for Symmetric Graphs are still to be moved)

File:
1 edited

Unmodified
Removed
• src/lemon/skeletons/graph.h

 r921 /// like @ref ListGraph or /// @ref SmartGraph will just refer to this structure. /// /// \todo A pages describing the concept of concept description would /// be nice. class StaticGraph { }; struct DummyType { int value; DummyType() {} DummyType(int p) : value(p) {} DummyType& operator=(int p) { value = p; return *this;} }; ///\brief Checks whether \c G meets the ///\ref lemon::skeleton::StaticGraph "StaticGraph" concept template void checkCompileStaticGraph(Graph &G) { typedef typename Graph::Node Node; typedef typename Graph::NodeIt NodeIt; typedef typename Graph::Edge Edge; typedef typename Graph::EdgeIt EdgeIt; typedef typename Graph::InEdgeIt InEdgeIt; typedef typename Graph::OutEdgeIt OutEdgeIt; { Node i; Node j(i); Node k(INVALID); i=j; bool b; b=true; b=(i==INVALID); b=(i!=INVALID); b=(i==j); b=(i!=j); b=(iNodeIt conversion NodeIt ni(G,n); } { Edge i; Edge j(i); Edge k(INVALID); i=j; bool b; b=true; b=(i==INVALID); b=(i!=INVALID); b=(i==j); b=(i!=j); b=(iEdgeIt conversion EdgeIt ei(G,e); } { Node n; InEdgeIt i; InEdgeIt j(i); InEdgeIt k(INVALID); InEdgeIt l(G,n); i=j; j=G.first(i,n); j=++i; bool b; b=true; b=(i==INVALID); b=(i!=INVALID); Edge e(i); e=i; b=(i==j); b=(i!=j); b=(iInEdgeIt conversion InEdgeIt ei(G,e); } { Node n; OutEdgeIt i; OutEdgeIt j(i); OutEdgeIt k(INVALID); OutEdgeIt l(G,n); i=j; j=G.first(i,n); j=++i; bool b; b=true; b=(i==INVALID); b=(i!=INVALID); Edge e(i); e=i; b=(i==j); b=(i!=j); b=(iOutEdgeIt conversion OutEdgeIt ei(G,e); } { Node n,m; n=m=INVALID; Edge e; e=INVALID; n=G.tail(e); n=G.head(e); } // id tests { Node n; int i=G.id(n); i=i; } { Edge e; int i=G.id(e); i=i; } //NodeMap tests { Node k; typename Graph::template NodeMap m(G); //Const map typename Graph::template NodeMap const &cm = m; //Inicialize with default value typename Graph::template NodeMap mdef(G,12); //Copy typename Graph::template NodeMap mm(cm); //Copy from another type typename Graph::template NodeMap dm(cm); //Copy to more complex type typename Graph::template NodeMap em(cm); int v; v=m[k]; m[k]=v; m.set(k,v); v=cm[k]; m=cm; dm=cm; //Copy from another type em=cm; //Copy to more complex type { //Check the typedef's typename Graph::template NodeMap::ValueType val; val=1; typename Graph::template NodeMap::KeyType key; key = typename Graph::NodeIt(G); } } { //bool NodeMap Node k; typename Graph::template NodeMap m(G); typename Graph::template NodeMap const &cm = m;  //Const map //Inicialize with default value typename Graph::template NodeMap mdef(G,12); typename Graph::template NodeMap mm(cm);   //Copy typename Graph::template NodeMap dm(cm); //Copy from another type bool v; v=m[k]; m[k]=v; m.set(k,v); v=cm[k]; m=cm; dm=cm; //Copy from another type m=dm; //Copy to another type { //Check the typedef's typename Graph::template NodeMap::ValueType val; val=true; typename Graph::template NodeMap::KeyType key; key= typename Graph::NodeIt(G); } } //EdgeMap tests { Edge k; typename Graph::template EdgeMap m(G); typename Graph::template EdgeMap const &cm = m;  //Const map //Inicialize with default value typename Graph::template EdgeMap mdef(G,12); typename Graph::template EdgeMap mm(cm);   //Copy typename Graph::template EdgeMap dm(cm);//Copy from another type int v; v=m[k]; m[k]=v; m.set(k,v); v=cm[k]; m=cm; dm=cm; //Copy from another type { //Check the typedef's typename Graph::template EdgeMap::ValueType val; val=1; typename Graph::template EdgeMap::KeyType key; key= typename Graph::EdgeIt(G); } } { //bool EdgeMap Edge k; typename Graph::template EdgeMap m(G); typename Graph::template EdgeMap const &cm = m;  //Const map //Inicialize with default value typename Graph::template EdgeMap mdef(G,12); typename Graph::template EdgeMap mm(cm);   //Copy typename Graph::template EdgeMap dm(cm); //Copy from another type bool v; v=m[k]; m[k]=v; m.set(k,v); v=cm[k]; m=cm; dm=cm; //Copy from another type m=dm; //Copy to another type { //Check the typedef's typename Graph::template EdgeMap::ValueType val; val=true; typename Graph::template EdgeMap::KeyType key; key= typename Graph::EdgeIt(G); } } } /// An empty non-static graph class. /// This class provides everything that \ref StaticGraph /// with additional functionality which enables to build a }; ///\brief Checks whether \c G meets the ///\ref lemon::skeleton::ExtendableGraph "ExtendableGraph" concept template void checkCompileExtendableGraph(Graph &G) { checkCompileStaticGraph(G); typedef typename Graph::Node Node; typedef typename Graph::NodeIt NodeIt; typedef typename Graph::Edge Edge; typedef typename Graph::EdgeIt EdgeIt; typedef typename Graph::InEdgeIt InEdgeIt; typedef typename Graph::OutEdgeIt OutEdgeIt; Node n,m; n=G.addNode(); m=G.addNode(); Edge e; e=G.addEdge(n,m); //  G.clear(); } /// An empty erasable graph class. void erase(Edge e) { } }; template void checkCompileGraphEraseEdge(Graph &G) { typename Graph::Edge e; G.erase(e); } template void checkCompileGraphEraseNode(Graph &G) { typename Graph::Node n; G.erase(n); } ///\brief Checks whether \c G meets the ///\ref lemon::skeleton::EresableGraph "EresableGraph" concept template void checkCompileErasableGraph(Graph &G) { checkCompileExtendableGraph(G); checkCompileGraphEraseNode(G); checkCompileGraphEraseEdge(G); } ///Checks whether a graph has findEdge() member function. ///\todo findEdge() might be a global function. /// template void checkCompileGraphFindEdge(Graph &G) { typedef typename Graph::NodeIt Node; typedef typename Graph::NodeIt NodeIt; G.findEdge(NodeIt(G),++NodeIt(G),G.findEdge(NodeIt(G),++NodeIt(G))); G.findEdge(Node(),Node(),G.findEdge(Node(),Node())); } // @} } //namespace skeleton
Note: See TracChangeset for help on using the changeset viewer.