LLVM: llvm::df_iterator< GraphT, SetType, ExtStorage, GT (original) (raw)
#include "[llvm/ADT/DepthFirstIterator.h](DepthFirstIterator%5F8h%5Fsource.html)"
| Public Types | |
|---|---|
| using | iterator_category |
| using | value_type = typename GT::NodeRef |
| using | difference_type = std::ptrdiff_t |
| using | pointer = value_type * |
| using | reference = const value_type & |
| Public Member Functions | |
|---|---|
| bool | operator== (const df_iterator &x) const |
| bool | operator!= (const df_iterator &x) const |
| reference | operator* () const |
| NodeRef | operator-> () const |
| df_iterator & | operator++ () |
| df_iterator & | skipChildren () |
| Skips all children of the current node and traverses to next node. | |
| 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. | |
| NodeRef | getPath (unsigned n) const |
| getPath - Return the n'th node in the path from the entry node to the current node. |
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
class llvm::df_iterator< GraphT, SetType, ExtStorage, GT >
Definition at line 86 of file DepthFirstIterator.h.
◆ difference_type
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::difference_type = std::ptrdiff_t
◆ iterator_category
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
Initial value:
std::conditional_t<ExtStorage, std::input_iterator_tag,
std::forward_iterator_tag>
Definition at line 89 of file DepthFirstIterator.h.
◆ pointer
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ reference
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ value_type
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
using llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::value_type = typename GT::NodeRef
◆ begin() [1/2]
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ begin() [2/2]
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ end() [1/2]
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ end() [2/2]
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ getPath()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
getPath - Return the n'th node in the path from the entry node to the current node.
Definition at line 216 of file DepthFirstIterator.h.
◆ getPathLength()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
getPathLength - Return the length of the path from the entry node to the current node, counting both nodes.
Definition at line 212 of file DepthFirstIterator.h.
◆ nodeVisited()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ operator!=()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ operator*()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ operator++() [1/2]
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ operator++() [2/2]
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ operator->()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
| NodeRef llvm::df_iterator< GraphT, SetType, ExtStorage, GT >::operator-> ( ) const | inline |
|---|
◆ operator==()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
◆ skipChildren()
template<class GraphT, class SetType = df_iterator_default_set<typename GraphTraits::NodeRef>, bool ExtStorage = false, class GT = GraphTraits>
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 189 of file DepthFirstIterator.h.
The documentation for this class was generated from the following file:
- include/llvm/ADT/DepthFirstIterator.h