LLVM: llvm::LazyCallGraph::EdgeSequence::iterator Class Reference (original) (raw)
An iterator used for the edges to both entry nodes and child nodes. More...
#include "[llvm/Analysis/LazyCallGraph.h](LazyCallGraph%5F8h%5Fsource.html)"
Inheritance diagram for llvm::LazyCallGraph::EdgeSequence::iterator:
| Public Member Functions | |
|---|---|
| iterator ()=default | |
| iterator & | operator++ () |
| Public Member Functions inherited from llvm::iterator_adaptor_base< iterator, VectorImplT::iterator, std::forward_iterator_tag > | |
| iterator & | operator+= (difference_type n) |
| iterator & | operator-= (difference_type n) |
| difference_type | operator- (const iterator &RHS) const |
| iterator & | operator++ () |
| iterator & | operator-- () |
| std::conditional_t< std::is_same< typename std::iterator_traits< VectorImplT::iterator >::value_type, typename std::iterator_traits< VectorImplT::iterator >::value_type >::value, typename std::iterator_traits< VectorImplT::iterator >::reference, typename std::iterator_traits< VectorImplT::iterator >::value_type & > | operator* () const |
| Public Member Functions inherited from llvm::iterator_facade_base< DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT > | |
| DerivedT | operator+ (DifferenceTypeT n) const |
| DerivedT | operator- (DifferenceTypeT n) const |
| DerivedT & | operator++ () |
| DerivedT | operator++ (int) |
| DerivedT & | operator-- () |
| DerivedT | operator-- (int) |
| bool | operator!= (const DerivedT &RHS) const |
| bool | operator> (const DerivedT &RHS) const |
| bool | operator<= (const DerivedT &RHS) const |
| bool | operator>= (const DerivedT &RHS) const |
| PointerProxy | operator-> () const |
| ReferenceProxy | operator[] (DifferenceTypeT n) const |
| Friends | |
|---|---|
| class | LazyCallGraph |
| class | LazyCallGraph::Node |
| Additional Inherited Members | |
|---|---|
| Public Types inherited from llvm::iterator_adaptor_base< iterator, VectorImplT::iterator, std::forward_iterator_tag > | |
| using | difference_type |
| Public Types inherited from llvm::iterator_facade_base< DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT > | |
| using | iterator_category = IteratorCategoryT |
| using | value_type = T |
| using | difference_type = DifferenceTypeT |
| using | pointer = PointerT |
| using | reference = ReferenceT |
| Protected Types inherited from llvm::iterator_facade_base< DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT > | |
| enum | { IsRandomAccess, IsBidirectional } |
| Protected Member Functions inherited from llvm::iterator_adaptor_base< iterator, VectorImplT::iterator, std::forward_iterator_tag > | |
| iterator_adaptor_base ()=default | |
| const VectorImplT::iterator & | wrapped () const |
| Protected Attributes inherited from llvm::iterator_adaptor_base< iterator, VectorImplT::iterator, std::forward_iterator_tag > | |
| VectorImplT::iterator | I |
Detailed Description
An iterator used for the edges to both entry nodes and child nodes.
Definition at line 190 of file LazyCallGraph.h.
Constructor & Destructor Documentation
| llvm::LazyCallGraph::EdgeSequence::iterator::iterator ( ) | default |
|---|
Member Function Documentation
◆ operator++()
| iterator & llvm::LazyCallGraph::EdgeSequence::iterator::operator++ ( ) | inline |
|---|
◆ LazyCallGraph
◆ LazyCallGraph::Node
The documentation for this class was generated from the following file:
- include/llvm/Analysis/LazyCallGraph.h