Definition at line 1428 of file RelAlgDagBuilder.cpp.
void anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::advance |
( |
AdvancingMode |
mode | ) |
|
|
inline |
Definition at line 1453 of file RelAlgDagBuilder.cpp.
References CHECK, and i.
1454 Super& super = *
this;
1457 size_t use_count = 0;
1459 for (
Super nodeIt = std::next(super); nodeIt !=
owner_.end(); ++nodeIt) {
1463 for (
size_t i = 0;
i < (*nodeIt)->inputCount(); ++
i) {
1464 if ((*super) == (*nodeIt)->getAndOwnInput(
i)) {
1466 if (1 == use_count) {
1479 for (
size_t i = 0;
i !=
owner_.size(); ++
i) {
1482 std::advance(super,
i);
std::unordered_set< size_t > visited_
std::vector< ElementType >::const_iterator Super
bool anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::allVisited |
( |
| ) |
|
|
inline |
const ElementType& anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::operator* |
( |
| ) |
|
|
inline |
Definition at line 1495 of file RelAlgDagBuilder.cpp.
1497 Super& super = *
this;
std::unordered_set< size_t > visited_
std::vector< ElementType >::const_iterator Super
const ElementType* anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::operator-> |
( |
| ) |
|
|
inline |
const size_t anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::nodeCount_ |
|
private |
return anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::non_zero_count |
const Container& anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::owner_ |
|
private |
std::unordered_set<size_t> anonymous_namespace{RelAlgDagBuilder.cpp}::RANodeIterator::visited_ |
|
private |
The documentation for this class was generated from the following file: