LLVM: llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut (original) (raw)

A class for ranging over the incoming edges incident to a vertex. More...

#include "[llvm/XRay/Graph.h](XRay%5F2Graph%5F8h%5Fsource.html)"

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)

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>
template<bool isConst, bool isOut>
class llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut >

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.

Definition at line 197 of file Graph.h.

const_iterator

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

GraphT

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

InternalEdgeMapT

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

using llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut >::InternalEdgeMapT

Initial value:

std::conditional_t<isConst, const EdgeMapT, EdgeMapT>

Definition at line 202 of file Graph.h.

iterator

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

using llvm::xray::Graph< VertexAttribute, EdgeAttribute, VI >::InOutEdgeView< isConst, isOut >::iterator = NeighborEdgeIteratorT<isConst, isOut>

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

begin() [1/2]

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

begin() [2/2]

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

cbegin()

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

cend()

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

empty()

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

end() [1/2]

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

end() [2/2]

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>

size()

template<typename VertexAttribute, typename EdgeAttribute, typename VI = int32_t>

template<bool isConst, bool isOut>


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