#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 ()

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
std::vector< std::shared_ptr< const RelAlgNode > >	inputs_

const unsigned	id_

Detailed Description

Definition at line 1140 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 1142 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 1155 of file RelAlgDagBuilder.h.

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

1155 { return collation_.size(); }

RelSort::collation_

std::vector< SortField > collation_

Definition: RelAlgDagBuilder.h:1193

Here is the caller graph for this function:

◆ deepCopy()

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

overridevirtual

Implements RelAlgNode.

Definition at line 357 of file RelAlgDagBuilder.cpp.

References RelAlgNode::inputs_.

                                                   {
   auto ret = std::make_shared<RelSort>(collation_, limit_, offset_, inputs_[0]);
   ret->setEmptyResult(isEmptyResult());
   return ret;
 }

◆ getCollation()

SortField RelSort::getCollation ( const size_t i ) const

inline

Definition at line 1157 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 1170 of file RelAlgDagBuilder.h.

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

1170 { return limit_; }

RelSort::limit_

const size_t limit_

Definition: RelAlgDagBuilder.h:1194

Here is the caller graph for this function:

◆ getOffset()

size_t RelSort::getOffset ( ) const

inline

Definition at line 1172 of file RelAlgDagBuilder.h.

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

1172 { return offset_; }

RelSort::offset_

const size_t offset_

Definition: RelAlgDagBuilder.h:1195

Here is the caller graph for this function:

◆ hasEquivCollationOf()

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

private

Definition at line 459 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 1168 of file RelAlgDagBuilder.h.

Referenced by RelAlgExecutor::executeSort().

1168 { return empty_result_; }

RelSort::empty_result_

bool empty_result_

Definition: RelAlgDagBuilder.h:1196

Here is the caller graph for this function:

◆ operator==()

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

inline

Definition at line 1150 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 1162 of file RelAlgDagBuilder.h.

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

◆ setEmptyResult()

void RelSort::setEmptyResult ( bool emptyResult )

inline

Definition at line 1166 of file RelAlgDagBuilder.h.

1166 { empty_result_ = emptyResult; }

RelSort::empty_result_

bool empty_result_

Definition: RelAlgDagBuilder.h:1196

◆ size()

size_t RelSort::size ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1188 of file RelAlgDagBuilder.h.

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

RelAlgNode::inputs_

std::vector< std::shared_ptr< const RelAlgNode > > inputs_

Definition: RelAlgDagBuilder.h:686

◆ toString()

std::string RelSort::toString ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1174 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 1193 of file RelAlgDagBuilder.h.

Referenced by hasEquivCollationOf().

◆ empty_result_

bool RelSort::empty_result_

private

Definition at line 1196 of file RelAlgDagBuilder.h.

Referenced by operator==().

◆ limit_

const size_t RelSort::limit_

private

Definition at line 1194 of file RelAlgDagBuilder.h.

Referenced by operator==().

◆ offset_

const size_t RelSort::offset_

private

Definition at line 1195 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

Public Member Functions

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ RelSort()

Member Function Documentation

◆ collationCount()

◆ deepCopy()

◆ getCollation()

◆ getLimit()

◆ getOffset()

◆ hasEquivCollationOf()

◆ isEmptyResult()

◆ operator==()

◆ setCollation()

◆ setEmptyResult()

◆ size()

◆ toString()

Member Data Documentation

◆ collation_

◆ empty_result_

◆ limit_

◆ offset_