OmniSciDB  cde582ebc3
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
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 ElementTypeoperator* ()
 
const ElementTypeoperator-> ()
 

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 Containerowner_
 
const size_t nodeCount_
 
std::unordered_set< size_t > visited_
 

Detailed Description

Definition at line 1723 of file RelAlgDag.cpp.

Member Typedef Documentation

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

Definition at line 1726 of file RelAlgDag.cpp.

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

Definition at line 1724 of file RelAlgDag.cpp.

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

Definition at line 1725 of file RelAlgDag.cpp.

Member Enumeration Documentation

enum anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::AdvancingMode
strong
Enumerator
DUChain 
InOrder 

Definition at line 1729 of file RelAlgDag.cpp.

1729 { DUChain, InOrder };

Member Function Documentation

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

Definition at line 1748 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().

1748  {
1749  Super& super = *this;
1750  switch (mode) {
1751  case AdvancingMode::DUChain: {
1752  size_t use_count = 0;
1753  Super only_use = owner_.end();
1754  for (Super nodeIt = std::next(super); nodeIt != owner_.end(); ++nodeIt) {
1755  if (!*nodeIt) {
1756  continue;
1757  }
1758  for (size_t i = 0; i < (*nodeIt)->inputCount(); ++i) {
1759  if ((*super) == (*nodeIt)->getAndOwnInput(i)) {
1760  ++use_count;
1761  if (1 == use_count) {
1762  only_use = nodeIt;
1763  } else {
1764  super = owner_.end();
1765  return;
1766  }
1767  }
1768  }
1769  }
1770  super = only_use;
1771  break;
1772  }
1774  for (size_t i = 0; i != owner_.size(); ++i) {
1775  if (!visited_.count(i)) {
1776  super = owner_.begin();
1777  std::advance(super, i);
1778  return;
1779  }
1780  }
1781  super = owner_.end();
1782  break;
1783  default:
1784  CHECK(false);
1785  }
1786  }
std::vector< ElementType >::const_iterator Super
Definition: RelAlgDag.cpp:1725
#define CHECK(condition)
Definition: Logger.h:222

+ Here is the caller graph for this function:

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

Definition at line 1788 of file RelAlgDag.cpp.

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

+ Here is the caller graph for this function:

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

Definition at line 1790 of file RelAlgDag.cpp.

1790  {
1791  visited_.insert(size_t(*this));
1792  Super& super = *this;
1793  return *super;
1794  }
std::vector< ElementType >::const_iterator Super
Definition: RelAlgDag.cpp:1725
const ElementType* anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::operator-> ( )
inline

Definition at line 1796 of file RelAlgDag.cpp.

1796 { return &(operator*()); }

Member Data Documentation

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

Definition at line 1734 of file RelAlgDag.cpp.

1734  : nodes) {
1735  if (node) {
1736  ++non_zero_count;
1737  }
1738  }
const size_t anonymous_namespace{RelAlgDag.cpp}::RANodeIterator::nodeCount_
private

Definition at line 1800 of file RelAlgDag.cpp.

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

Definition at line 1739 of file RelAlgDag.cpp.

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

Definition at line 1799 of file RelAlgDag.cpp.

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

Definition at line 1801 of file RelAlgDag.cpp.


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