class DGNode

Declaration

template <class NodeType, class EdgeType>
class DGNode { /* full declaration omitted */ };

Description

Represent a node in the directed graph. The node has a (possibly empty) list of outgoing edges.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:73

Templates

NodeType
EdgeType

Member Variables

protected llvm::DGNode::EdgeListTy Edges

Method Overview

Methods

DGNode<NodeType, EdgeType>()

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:81

DGNode<NodeType, EdgeType>(
    const DGNode<NodeType, EdgeType>& N)

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:83

Parameters

const DGNode<NodeType, EdgeType>& N

DGNode<NodeType, EdgeType>(
    DGNode<NodeType, EdgeType>&& N)

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:84

Parameters

DGNode<NodeType, EdgeType>&& N

DGNode<NodeType, EdgeType>(EdgeType& E)

Description

Create a node with a single outgoing edge \p E.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:80

Parameters

EdgeType& E

bool addEdge(EdgeType& E)

Description

Add the given edge \p E to this node, if it doesn't exist already. Returns true if the edge is added and false otherwise.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:127

Parameters

EdgeType& E

EdgeType& back()

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:111

const EdgeType& back() const

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:110

llvm::DGNode::iterator begin()

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:106

llvm::DGNode::const_iterator begin() const

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:104

void clear()

Description

Clear the outgoing edges.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:145

llvm::DGNode::iterator end()

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:107

llvm::DGNode::const_iterator end() const

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:105

llvm::DGNode::const_iterator findEdgeTo(
    const NodeType& N) const

Description

Find an edge to \p N. If more than one edge exists, this will return the first one in the list of edges.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:159

Parameters

const NodeType& N

bool findEdgesTo(
    const NodeType& N,
    SmallVectorImpl<EdgeType*>& EL) const

Description

Collect in \p EL, all the edges from this node to \p N. Return true if at least one edge was found, and false otherwise. Note that this implementation allows more than one edge to connect a given pair of nodes.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:117

Parameters

const NodeType& N
SmallVectorImpl<EdgeType*>& EL

const EdgeType& front() const

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:108

EdgeType& front()

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:109

NodeType& getDerived()

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:152

const NodeType& getDerived() const

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:153

const llvm::DGNode::EdgeListTy& getEdges() const

Description

Retrieve the outgoing edges for the node.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:138

llvm::DGNode::EdgeListTy& getEdges()

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:139

bool hasEdgeTo(const NodeType& N) const

Description

Test whether there is an edge that goes from this node to \p N.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:133

Parameters

const NodeType& N

bool isEqualTo(const NodeType& N) const

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:149

Parameters

const NodeType& N

void removeEdge(EdgeType& E)

Description

Remove the given edge \p E from this node, if it exists.

Declared at: llvm/include/llvm/ADT/DirectedGraph.h:130

Parameters

EdgeType& E