LLVM
15.0.0git
|
#include "llvm/ADT/DepthFirstIterator.h"
Public Types | |
using | iterator_category = std::forward_iterator_tag |
using | value_type = typename GT::NodeRef |
using | difference_type = std::ptrdiff_t |
using | pointer = value_type * |
using | reference = value_type & |
Public Member Functions | |
bool | operator== (const df_iterator &x) const |
bool | operator!= (const df_iterator &x) const |
const NodeRef & | operator* () const |
NodeRef | operator-> () const |
df_iterator & | operator++ () |
df_iterator & | skipChildren () |
Skips all children of the current node and traverses to next node. More... | |
df_iterator | operator++ (int) |
bool | nodeVisited (NodeRef Node) const |
unsigned | getPathLength () const |
getPathLength - Return the length of the path from the entry node to the current node, counting both nodes. More... | |
NodeRef | getPath (unsigned n) const |
getPath - Return the n'th node in the path from the entry node to the current node. More... | |
Static Public Member Functions | |
static df_iterator | begin (const GraphT &G) |
static df_iterator | end (const GraphT &G) |
static df_iterator | begin (const GraphT &G, SetType &S) |
static df_iterator | end (const GraphT &G, SetType &S) |
Additional Inherited Members | |
![]() | |
df_iterator_default_set< typename GraphTraits< GraphT >::NodeRef > | Visited |
Definition at line 86 of file DepthFirstIterator.h.
using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::difference_type = std::ptrdiff_t |
Definition at line 90 of file DepthFirstIterator.h.
using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::iterator_category = std::forward_iterator_tag |
Definition at line 88 of file DepthFirstIterator.h.
using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::pointer = value_type * |
Definition at line 91 of file DepthFirstIterator.h.
using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::reference = value_type & |
Definition at line 92 of file DepthFirstIterator.h.
using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::value_type = typename GT::NodeRef |
Definition at line 89 of file DepthFirstIterator.h.
|
inlinestatic |
Definition at line 153 of file DepthFirstIterator.h.
Referenced by llvm::df_begin().
|
inlinestatic |
Definition at line 159 of file DepthFirstIterator.h.
|
inlinestatic |
Definition at line 156 of file DepthFirstIterator.h.
Referenced by llvm::df_end().
|
inlinestatic |
Definition at line 162 of file DepthFirstIterator.h.
|
inline |
getPath - Return the n'th node in the path from the entry node to the current node.
Definition at line 213 of file DepthFirstIterator.h.
|
inline |
getPathLength - Return the length of the path from the entry node to the current node, counting both nodes.
Definition at line 209 of file DepthFirstIterator.h.
|
inline |
Definition at line 203 of file DepthFirstIterator.h.
|
inline |
Definition at line 167 of file DepthFirstIterator.h.
|
inline |
Definition at line 169 of file DepthFirstIterator.h.
|
inline |
Definition at line 177 of file DepthFirstIterator.h.
|
inline |
Definition at line 193 of file DepthFirstIterator.h.
|
inline |
Definition at line 175 of file DepthFirstIterator.h.
|
inline |
Definition at line 164 of file DepthFirstIterator.h.
|
inline |
Skips all children of the current node and traverses to next node.
Note: This function takes care of incrementing the iterator. If you always increment and call this function, you risk walking off the end.
Definition at line 186 of file DepthFirstIterator.h.