OmniSciDB  c1a53651b2
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor Class Reference
+ Inheritance diagram for anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor:
+ Collaboration diagram for anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor:

Public Member Functions

bool visitInput (const RexInput *input) const final
 
bool visitLiteral (const RexLiteral *) const final
 
bool visitSubQuery (const RexSubQuery *) const final
 
bool visitRef (const RexRef *) const final
 

Protected Member Functions

bool aggregateResult (const bool &aggregate, const bool &next_result) const final
 
bool defaultResult () const final
 

Detailed Description

CoalesceSecondaryProjectVisitor visits each relational algebra expression node in a given input and determines whether or not the input is a candidate for coalescing into the parent RA node. Intended for use only on the inputs of a RelProject node.

Definition at line 1912 of file RelAlgDag.cpp.

Member Function Documentation

bool anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor::aggregateResult ( const bool &  aggregate,
const bool &  next_result 
) const
inlinefinalprotected

Definition at line 1928 of file RelAlgDag.cpp.

1928  {
1929  return aggregate && next_result;
1930  }
bool anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor::defaultResult ( ) const
inlinefinalprotected

Definition at line 1932 of file RelAlgDag.cpp.

1932 { return true; }
bool anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor::visitInput ( const RexInput input) const
inlinefinal

Definition at line 1914 of file RelAlgDag.cpp.

References anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::input_can_be_coalesced().

1914  {
1915  // The top level expression node is checked before we apply the visitor. If we get
1916  // here, this input rex is a child of another rex node, and we handle the can be
1917  // coalesced check slightly differently
1918  return input_can_be_coalesced(input->getSourceNode(), input->getIndex(), false);
1919  }
bool input_can_be_coalesced(const RelAlgNode *parent_node, const size_t index, const bool first_rex_is_input)
Definition: RelAlgDag.cpp:1891
unsigned getIndex() const
Definition: RelAlgDag.h:77
const RelAlgNode * getSourceNode() const
Definition: RelAlgDag.h:389

+ Here is the call graph for this function:

bool anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor::visitLiteral ( const RexLiteral ) const
inlinefinal

Definition at line 1921 of file RelAlgDag.cpp.

1921 { return false; }
bool anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor::visitRef ( const RexRef ) const
inlinefinal

Definition at line 1925 of file RelAlgDag.cpp.

1925 { return false; }
bool anonymous_namespace{RelAlgDag.cpp}::anonymous_namespace{RelAlgDag.cpp}::CoalesceSecondaryProjectVisitor::visitSubQuery ( const RexSubQuery ) const
inlinefinal

Definition at line 1923 of file RelAlgDag.cpp.

1923 { return false; }

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