anonymous_namespace{RelAlgDag.cpp}::RANodeIterator Class Reference

Inheritance diagram for anonymous_namespace{RelAlgDag.cpp}::RANodeIterator:

Collaboration diagram for anonymous_namespace{RelAlgDag.cpp}::RANodeIterator:

Public Types
enum	AdvancingMode { AdvancingMode::DUChain, AdvancingMode::InOrder }

Public Member Functions
void	advance (AdvancingMode mode)
bool	allVisited ()
const ElementType &	operator* ()
const ElementType *	operator-> ()

Public Attributes
RANodeIterator(const Container &nodes)	for (const auto &node:nodes)
return	non_zero_count

Private Types
using	ElementType = std::shared_ptr< RelAlgNode >
using	Super = std::vector< ElementType >::const_iterator
using	Container = std::vector< ElementType >

Private Attributes
const Container &	owner_
const size_t	nodeCount_
std::unordered_set< size_t >	visited_

Detailed Description

Definition at line 1808 of file RelAlgDag.cpp.

Member Typedef Documentation

using anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::Container = std::vector<ElementType>

private

Definition at line 1811 of file RelAlgDag.cpp.

using anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::ElementType = std::shared_ptr<RelAlgNode>

private

Definition at line 1809 of file RelAlgDag.cpp.

using anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::Super = std::vector<ElementType>::const_iterator

private

Definition at line 1810 of file RelAlgDag.cpp.

Member Enumeration Documentation

enum anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::AdvancingMode

strong

Enumerator
DUChain
InOrder

Definition at line 1814 of file RelAlgDag.cpp.

{ DUChain, InOrder };

Member Function Documentation

void anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::advance ( AdvancingMode  mode )

inline

Definition at line 1833 of file RelAlgDag.cpp.

References CHECK.

Referenced by generate_TableFunctionsFactory_init.Parser::consume(), generate_TableFunctionsFactory_init.Tokenize::consume_double_char(), generate_TableFunctionsFactory_init.Tokenize::consume_identifier(), generate_TableFunctionsFactory_init.Tokenize::consume_number(), generate_TableFunctionsFactory_init.Tokenize::consume_single_char(), generate_TableFunctionsFactory_init.Tokenize::consume_string(), generate_TableFunctionsFactory_init.Tokenize::consume_whitespace(), and generate_TableFunctionsFactory_init.Parser::expect().

                                   {
    Super& super = *this;
    switch (mode) {
      case AdvancingMode::DUChain: {
        size_t use_count = 0;
        Super only_use = owner_.end();
        for (Super nodeIt = std::next(super); nodeIt != owner_.end(); ++nodeIt) {
          if (!*nodeIt) {
            continue;
          }
          for (size_t i = 0; i < (*nodeIt)->inputCount(); ++i) {
            if ((*super) == (*nodeIt)->getAndOwnInput(i)) {
              ++use_count;
              if (1 == use_count) {
                only_use = nodeIt;
              } else {
                super = owner_.end();
                return;
              }
            }
          }
        }
        super = only_use;
        break;
      }
      case AdvancingMode::InOrder:
        for (size_t i = 0; i != owner_.size(); ++i) {
          if (!visited_.count(i)) {
            super = owner_.begin();
            std::advance(super, i);
            return;
          }
        }
        super = owner_.end();
        break;
      default:
        CHECK(false);
    }
  }

Here is the caller graph for this function:

bool anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::allVisited ( )

inline

Definition at line 1873 of file RelAlgDag.cpp.

Referenced by anonymous_namespace{RelAlgDag.cpp}::coalesce_nodes().

{ return visited_.size() == nodeCount_; }

Here is the caller graph for this function:

const ElementType& anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::operator* ( )

inline

Definition at line 1875 of file RelAlgDag.cpp.

                                 {
    visited_.insert(size_t(*this));
    Super& super = *this;
    return *super;
  }

const ElementType* anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::operator-> ( )

inline

Definition at line 1881 of file RelAlgDag.cpp.

{ return &(operator*()); }

Member Data Documentation

RANodeIterator (const Container& nodes) anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::for(const auto &node:nodes)

inlineexplicit

Definition at line 1819 of file RelAlgDag.cpp.

                              : nodes) {
          if (node) {
            ++non_zero_count;
          }
        }

const size_t anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::nodeCount_

private

Definition at line 1885 of file RelAlgDag.cpp.

return anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::non_zero_count

Definition at line 1824 of file RelAlgDag.cpp.

const Container& anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::owner_

private

Definition at line 1884 of file RelAlgDag.cpp.

std::unordered_set<size_t> anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::visited_

private

Definition at line 1886 of file RelAlgDag.cpp.

---

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

• /home/jenkins-slave/workspace/core-os-doxygen/QueryEngine/RelAlgDag.cpp