reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/DirectedGraph.h
   74   explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); }
   77   explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {}
   78   DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {}
   81     Edges = N.Edges;
   81     Edges = N.Edges;
   85     Edges = std::move(N.Edges);
   85     Edges = std::move(N.Edges);
   94   const_iterator begin() const { return Edges.begin(); }
   95   const_iterator end() const { return Edges.end(); }
   96   iterator begin() { return Edges.begin(); }
   97   iterator end() { return Edges.end(); }
   98   const EdgeType &front() const { return *Edges.front(); }
   99   EdgeType &front() { return *Edges.front(); }
  100   const EdgeType &back() const { return *Edges.back(); }
  101   EdgeType &back() { return *Edges.back(); }
  109     for (auto *E : Edges)
  117   bool addEdge(EdgeType &E) { return Edges.insert(&E); }
  120   void removeEdge(EdgeType &E) { Edges.remove(&E); }
  124     return (findEdgeTo(N) != Edges.end());
  128   const EdgeListTy &getEdges() const { return Edges; }
  131         static_cast<const DGNode<NodeType, EdgeType> &>(*this).Edges);
  135   void clear() { Edges.clear(); }
  151         Edges, [&N](const EdgeType *E) { return E->getTargetNode() == N; });