llvm::LazyCallGraph::EdgeSequence::iterator Class Reference

An iterator used for the edges to both entry nodes and child nodes. More...

#include "llvm/Analysis/LazyCallGraph.h"

Inheritance diagram for llvm::LazyCallGraph::EdgeSequence::iterator:

Public Member Functions
	iterator ()=default
iterator &	operator++ ()
DerivedT &	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 = typename std::iterator_traits< VectorImplT::iterator >::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
	iterator_adaptor_base (VectorImplT::iterator u)
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 192 of file LazyCallGraph.h.

Constructor & Destructor Documentation

iterator()

llvm::LazyCallGraph::EdgeSequence::iterator::iterator ( )

default

Member Function Documentation

operator++() [1/2]

DerivedT & llvm::iterator_adaptor_base< DerivedT, WrappedIteratorT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT >::operator++ ( )

inline

Definition at line 280 of file iterator.h.

operator++() [2/2]

iterator & llvm::LazyCallGraph::EdgeSequence::iterator::operator++ ( )

inline

Definition at line 211 of file LazyCallGraph.h.

References E, and llvm::iterator_adaptor_base< iterator, VectorImplT::iterator, std::forward_iterator_tag >::I.

Friends And Related Function Documentation

LazyCallGraph

friend class LazyCallGraph

friend

Definition at line 195 of file LazyCallGraph.h.

LazyCallGraph::Node

friend class LazyCallGraph::Node

friend

Definition at line 196 of file LazyCallGraph.h.

---

The documentation for this class was generated from the following file:

• include/llvm/Analysis/LazyCallGraph.h