Home | History | Annotate | Download | only in ADT

Lines Matching defs:Inverse

13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
67 // Inverse - This class is used as a little marker class to tell the graph
68 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
69 // Not all graphs define an inverse ordering, and if they do, it depends on
77 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
81 struct Inverse {
84 inline Inverse(const GraphType &G) : Graph(G) {}
87 // Provide a partial specialization of GraphTraits so that the inverse of an
88 // inverse falls back to the original graph.
89 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
99 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
101 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
102 GraphTraits<Inverse<GraphType>>::nodes_end(G));
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
115 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
116 GraphTraits<Inverse<GraphType>>::child_end(G));