LLVM 22.0.0git
|
A class for ranging over the incoming edges incident to a vertex. More...
#include "llvm/XRay/Graph.h"
Public Types | |
using | iterator = NeighborEdgeIteratorT<isConst, isOut> |
using | const_iterator = NeighborEdgeIteratorT<true, isOut> |
using | GraphT = std::conditional_t<isConst, const Graph, Graph> |
using | InternalEdgeMapT |
Public Member Functions | |
iterator | begin () |
const_iterator | cbegin () const |
const_iterator | begin () const |
iterator | end () |
const_iterator | cend () const |
const_iterator | end () const |
size_type | size () const |
bool | empty () const |
InOutEdgeView (GraphT &G, VertexIdentifier A) |
A class for ranging over the incoming edges incident to a vertex.
Like all views in this class it provides methods to get the beginning and past the range iterators for the range, as well as methods to determine the number of elements in the range and whether the range is empty.
using llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut >::const_iterator = NeighborEdgeIteratorT<true, isOut> |
using llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut >::GraphT = std::conditional_t<isConst, const Graph, Graph> |
using llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut >::InternalEdgeMapT |
using llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut >::iterator = NeighborEdgeIteratorT<isConst, isOut> |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |