X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=include%2Fllvm%2FADT%2FGraphTraits.h;h=823caef7647e70572e6e7c9baab6eec75523727f;hb=40dab1059e72d3af59f2523fa8a7d05f40dafca5;hp=35da5ab2f8ecfe03f038e1ce7cb6964d2e4f3ee1;hpb=3a54b3dc87a581c203b18050b4f787b4ca28a12c;p=oota-llvm.git diff --git a/include/llvm/ADT/GraphTraits.h b/include/llvm/ADT/GraphTraits.h index 35da5ab2f8e..823caef7647 100644 --- a/include/llvm/ADT/GraphTraits.h +++ b/include/llvm/ADT/GraphTraits.h @@ -30,7 +30,7 @@ struct GraphTraits { // typedef NodeType - Type of Node in the graph // typedef ChildIteratorType - Type used to iterate over children in graph - // static NodeType *getEntryNode(GraphType *) + // static NodeType *getEntryNode(const GraphType &) // Return the entry node of the graph // static ChildIteratorType child_begin(NodeType *) @@ -43,9 +43,12 @@ struct GraphTraits { // typedef ...iterator nodes_iterator; // static nodes_iterator nodes_begin(GraphType *G) // static nodes_iterator nodes_end (GraphType *G) - // // nodes_iterator/begin/end - Allow iteration over all nodes in the graph + // static unsigned size (GraphType *G) + // Return total number of nodes in the graph + // + // If anyone tries to use this class without having an appropriate // specialization, make an error. If you get this error, it's because you @@ -78,8 +81,8 @@ struct Inverse { inline Inverse(const GraphType &G) : Graph(G) {} }; -// Provide a partial specialization of GraphTraits so that the inverse of an inverse -// falls back to the original graph. +// Provide a partial specialization of GraphTraits so that the inverse of an +// inverse falls back to the original graph. template struct GraphTraits > > { typedef typename GraphTraits::NodeType NodeType;