RelSort Class Reference

#include <RelAlgDagBuilder.h>

Inheritance diagram for RelSort:

Collaboration diagram for RelSort:

Public Member Functions
	RelSort (const std::vector< SortField > &collation, const size_t limit, const size_t offset, std::shared_ptr< const RelAlgNode > input)
bool	operator== (const RelSort &that) const
size_t	collationCount () const
SortField	getCollation (const size_t i) const
void	setCollation (std::vector< SortField > &&collation)
void	setEmptyResult (bool emptyResult)
bool	isEmptyResult () const
size_t	getLimit () const
size_t	getOffset () const
std::string	toString () const override
size_t	size () const override
std::shared_ptr< RelAlgNode >	deepCopy () const override
Public Member Functions inherited from RelAlgNode
	RelAlgNode (RelAlgInputs inputs={})
virtual	~RelAlgNode ()
void	resetQueryExecutionState ()
void	setContextData (const void *context_data) const
void	setOutputMetainfo (const std::vector< TargetMetaInfo > &targets_metainfo) const
const std::vector< TargetMetaInfo > &	getOutputMetainfo () const
unsigned	getId () const
bool	hasContextData () const
const void *	getContextData () const
const size_t	inputCount () const
const RelAlgNode *	getInput (const size_t idx) const
std::shared_ptr< const RelAlgNode >	getAndOwnInput (const size_t idx) const
void	addManagedInput (std::shared_ptr< const RelAlgNode > input)
bool	hasInput (const RelAlgNode *needle) const
virtual void	replaceInput (std::shared_ptr< const RelAlgNode > old_input, std::shared_ptr< const RelAlgNode > input)
bool	isNop () const
void	markAsNop ()

Private Member Functions
bool	hasEquivCollationOf (const RelSort &that) const

Private Attributes
std::vector< SortField >	collation_
const size_t	limit_
const size_t	offset_
bool	empty_result_

Additional Inherited Members
Static Public Member Functions inherited from RelAlgNode
static void	resetRelAlgFirstId () noexcept
Protected Attributes inherited from RelAlgNode
RelAlgInputs	inputs_
const unsigned	id_

Detailed Description

Definition at line 1390 of file RelAlgDagBuilder.h.

Constructor & Destructor Documentation

RelSort()

RelSort::RelSort ( const std::vector< SortField > &  collation, const size_t  limit, const size_t  offset, std::shared_ptr< const RelAlgNode >  input  )

inline

Definition at line 1392 of file RelAlgDagBuilder.h.

      : collation_(collation), limit_(limit), offset_(offset) {
    inputs_.push_back(input);
  }

Member Function Documentation

collationCount()

size_t RelSort::collationCount ( ) const

inline

Definition at line 1405 of file RelAlgDagBuilder.h.

Referenced by RelAlgExecutor::createSortInputWorkUnit(), RelAlgExecutor::executeSort(), and anonymous_namespace{RelAlgExecutor.cpp}::get_order_entries().

{ return collation_.size(); }

Here is the caller graph for this function:

deepCopy()

std::shared_ptr<RelAlgNode> RelSort::deepCopy ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1440 of file RelAlgDagBuilder.h.

                                                      {
    return std::make_shared<RelSort>(*this);
  }

getCollation()

SortField RelSort::getCollation ( const size_t  i ) const

inline

Definition at line 1407 of file RelAlgDagBuilder.h.

References CHECK_LT.

Referenced by anonymous_namespace{RelAlgExecutor.cpp}::get_order_entries().

                                               {
    CHECK_LT(i, collation_.size());
    return collation_[i];
  }

Here is the caller graph for this function:

getLimit()

size_t RelSort::getLimit ( ) const

inline

Definition at line 1420 of file RelAlgDagBuilder.h.

Referenced by RelAlgExecutor::createSortInputWorkUnit(), and RelAlgExecutor::executeSort().

{ return limit_; }

Here is the caller graph for this function:

getOffset()

size_t RelSort::getOffset ( ) const

inline

Definition at line 1422 of file RelAlgDagBuilder.h.

Referenced by RelAlgExecutor::createSortInputWorkUnit(), and RelAlgExecutor::executeSort().

{ return offset_; }

Here is the caller graph for this function:

hasEquivCollationOf()

bool RelSort::hasEquivCollationOf ( const RelSort &  that ) const

private

Definition at line 548 of file RelAlgDagBuilder.cpp.

References collation_, and anonymous_namespace{RelAlgDagBuilder.cpp}::get_equiv_cols().

                                                           {
  if (collation_.size() != that.collation_.size()) {
    return false;
  }

  for (size_t i = 0, e = collation_.size(); i < e; ++i) {
    auto this_sort_key = collation_[i];
    auto that_sort_key = that.collation_[i];
    if (this_sort_key.getSortDir() != that_sort_key.getSortDir()) {
      return false;
    }
    if (this_sort_key.getNullsPosition() != that_sort_key.getNullsPosition()) {
      return false;
    }
    auto this_equiv_keys = get_equiv_cols(this, this_sort_key.getField());
    auto that_equiv_keys = get_equiv_cols(&that, that_sort_key.getField());
    std::vector<std::pair<const RelAlgNode*, int>> intersect;
    std::set_intersection(this_equiv_keys.begin(),
                          this_equiv_keys.end(),
                          that_equiv_keys.begin(),
                          that_equiv_keys.end(),
                          std::back_inserter(intersect));
    if (intersect.empty()) {
      return false;
    }
  }
  return true;
}

Here is the call graph for this function:

isEmptyResult()

bool RelSort::isEmptyResult ( ) const

inline

Definition at line 1418 of file RelAlgDagBuilder.h.

Referenced by RelAlgExecutor::executeSort().

{ return empty_result_; }

Here is the caller graph for this function:

operator==()

bool RelSort::operator== ( const RelSort &  that ) const

inline

Definition at line 1400 of file RelAlgDagBuilder.h.

References empty_result_, limit_, and offset_.

                                             {
    return limit_ == that.limit_ && offset_ == that.offset_ &&
           empty_result_ == that.empty_result_ && hasEquivCollationOf(that);
  }

setCollation()

void RelSort::setCollation ( std::vector< SortField > &&  collation )

inline

Definition at line 1412 of file RelAlgDagBuilder.h.

                                                      {
    collation_ = std::move(collation);
  }

setEmptyResult()

void RelSort::setEmptyResult ( bool  emptyResult )

inline

Definition at line 1416 of file RelAlgDagBuilder.h.

{ empty_result_ = emptyResult; }

size()

size_t RelSort::size ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1438 of file RelAlgDagBuilder.h.

{ return inputs_[0]->size(); }

toString()

std::string RelSort::toString ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1424 of file RelAlgDagBuilder.h.

References run_benchmark_import::result, and to_string().

                                      {
    std::string result =
        "(RelSort<" + std::to_string(reinterpret_cast<uint64_t>(this)) + ">(";
    result += "limit: " + std::to_string(limit_) + " ";
    result += "offset: " + std::to_string(offset_) + " ";
    result += "empty_result: " + std::to_string(empty_result_) + " ";
    result += "collation: [ ";
    for (const auto& sort_field : collation_) {
      result += sort_field.toString() + " ";
    }
    result += "]";
    return result + "))";
  }

Here is the call graph for this function:

Member Data Documentation

collation_

std::vector<SortField> RelSort::collation_

private

Definition at line 1445 of file RelAlgDagBuilder.h.

Referenced by hasEquivCollationOf().

empty_result_

bool RelSort::empty_result_

private

Definition at line 1448 of file RelAlgDagBuilder.h.

Referenced by operator==().

limit_

const size_t RelSort::limit_

private

Definition at line 1446 of file RelAlgDagBuilder.h.

Referenced by operator==().

offset_

const size_t RelSort::offset_

private

Definition at line 1447 of file RelAlgDagBuilder.h.

Referenced by operator==().

---

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

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