#include <DDCompactViewImpl.h>
Definition at line 14 of file DDCompactViewImpl.h.
◆ Graph
◆ GraphWalker
◆ DDCompactViewImpl() [1/2]
DDCompactViewImpl::DDCompactViewImpl |
( |
| ) |
|
|
explicit |
◆ DDCompactViewImpl() [2/2]
DDCompactViewImpl::DDCompactViewImpl |
( |
const DDLogicalPart & |
rootnodedata | ) |
|
◆ ~DDCompactViewImpl()
DDCompactViewImpl::~DDCompactViewImpl |
( |
| ) |
|
Definition at line 10 of file DDCompactViewImpl.cc.
References math::Graph< N, E >::edgeData(), math::Graph< N, E >::edges(), graph_, ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, LogDebug, and math::Graph< N, E >::size().
13 LogDebug(
"DDCompactViewImpl") <<
"In destructor, graph is empty." << std::endl;
15 LogDebug(
"DDCompactViewImpl") <<
"In destructor, graph is NOT empty." 16 <<
" graph_.size() = " <<
graph_.
size() << std::endl;
19 for (; erange.first != erange.second; ++(erange.first)) {
27 <<
"DDD transient representation has been destructed." << std::endl
Relative position of a child-volume inside a parent-volume.
edge_range edges(index_type nodeIndex)
auto size() const -> adj_list::size_type
std::pair< edge_iterator, edge_iterator > edge_range
Log< level::Info, false > LogInfo
const E & edgeData(index_type i) const
◆ current()
◆ graph()
const Graph& DDCompactViewImpl::graph |
( |
| ) |
const |
|
inline |
◆ position()
◆ root()
◆ setRoot()
◆ swap()
◆ walker()
◆ graph_
Graph DDCompactViewImpl::graph_ |
|
protected |
◆ root_