LLVM
8.0.1
|
A class for ranging over all the edges in the graph. More...
#include "llvm/XRay/Graph.h"
Public Types | |
using | iterator = typename std::conditional< isConst, ConstEdgeIterator, EdgeIterator >::type |
using | const_iterator = ConstEdgeIterator |
using | GraphT = typename std::conditional< isConst, const Graph, Graph >::type |
Public Member Functions | |
iterator | begin () |
iterator | end () |
const_iterator | cbegin () const |
const_iterator | cend () const |
const_iterator | begin () const |
const_iterator | end () const |
size_type | size () const |
bool | empty () const |
EdgeView (GraphT &_G) | |
A class for ranging over all the edges in the graph.
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 >::EdgeView< isConst >::const_iterator = ConstEdgeIterator |
using llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::EdgeView< isConst >::iterator = typename std::conditional<isConst, ConstEdgeIterator, EdgeIterator>::type |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |