llvm::df_ext_iterator

Depth-first iterator that stores its visited set externally.

Synopsis

Declared in <llvm/ADT/DepthFirstIterator.h>

template<
    class T,
    class SetTy = df_iterator_default_set<GraphTraits<T>::NodeRef>>
struct df_ext_iterator
    : df_iterator<T, SetTy, true>

Base Classes

NameDescription
df_iterator<T, SetTy, true>Generic depth-first search iterator over a graph.

Type Aliases

NameDescription
difference_type Distance between two depth-first iterators.
iterator_category Iterator category: input when using external storage, otherwise forward.
pointer Pointer to a node reference.
reference Const reference to the current node.
value_type Node reference type yielded by this iterator.

Member Functions

NameDescription
df_ext_iterator [constructor]Construct from an underlying external-storage depth-first iterator.
getPath Return the n'th node in the path from the entry node to the current node.
getPathLength Return the length of the path from the entry node to the current node, counting both nodes.
nodeVisited Return true if this iterator has already visited Node.
operator* Return a reference to the current node.
operator++ Increment operators
operator-> Return the current node so methods can be called through the iterator.
skipChildren Skips all children of the current node and traverses to next node
operator== Return true if both iterators have the same visit-stack state.
operator!= Return true if the iterators differ in visit-stack state.

Static Member Functions

NameDescription
begin begin overloads
end end overloads

Data Members

NameDescription
Visited Set of nodes already visited during depth-first traversal.

Non-Member Functions

NameDescription
depth_first_extReturn a range that visits G in depth-first order using visited set S.
df_ext_beginReturn an external-storage depth-first iterator at the entry of G.
df_ext_endReturn a past-the-end external-storage depth-first iterator for G.