#include <RelAlgDag.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 limit_delivered)

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

bool	isLimitDelivered () const

size_t	getLimit () const

size_t	getOffset () const

std::string	toString (RelRexToStringConfig config=RelRexToStringConfig::defaults()) const override

size_t	toHash () 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 RaExecutionDesc *context_data) const

void	setOutputMetainfo (const std::vector< TargetMetaInfo > &targets_metainfo) const

void	setQueryPlanDag (const std::string &extracted_query_plan_dag) const

std::string	getQueryPlanDag () const

size_t	getQueryPlanDagHash () const

const std::vector < TargetMetaInfo > &	getOutputMetainfo () const

unsigned	getId () const

void	setIdInPlanTree (size_t id) const

std::optional< size_t >	getIdInPlanTree () const

bool	hasContextData () const

const RaExecutionDesc *	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)

void	setRelNodeDagId (const size_t id) const

size_t	getRelNodeDagId () const

bool	isNop () const

void	markAsNop ()

void	clearContextData () const

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_

bool	limit_delivered_

Additional Inherited Members
Static Public Member Functions inherited from RelAlgNode
static void	resetRelAlgFirstId () noexcept

Protected Attributes inherited from RelAlgNode
RelAlgInputs	inputs_

const unsigned	id_

std::optional< size_t >	id_in_plan_tree_

std::optional< size_t >	hash_

Detailed Description

Definition at line 1796 of file RelAlgDag.h.

Constructor & Destructor Documentation

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

inline

Definition at line 1798 of file RelAlgDag.h.

References RelAlgNode::inputs_.

Referenced by toHash().

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

Here is the caller graph for this function:

Member Function Documentation

size_t RelSort::collationCount ( ) const

inline

Definition at line 1816 of file RelAlgDag.h.

References collation_.

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

1816 { return collation_.size(); }

RelSort::collation_

std::vector< SortField > collation_

Definition: RelAlgDag.h:1891

Here is the caller graph for this function:

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

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1886 of file RelAlgDag.h.

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

SortField RelSort::getCollation ( const size_t i ) const

inline

Definition at line 1818 of file RelAlgDag.h.

References CHECK_LT, and collation_.

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:

size_t RelSort::getLimit ( ) const

inline

Definition at line 1833 of file RelAlgDag.h.

References limit_.

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

1833 { return limit_; }

RelSort::limit_

const size_t limit_

Definition: RelAlgDag.h:1892

Here is the caller graph for this function:

size_t RelSort::getOffset ( ) const

inline

Definition at line 1835 of file RelAlgDag.h.

References offset_.

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

1835 { return offset_; }

RelSort::offset_

const size_t offset_

Definition: RelAlgDag.h:1893

Here is the caller graph for this function:

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

private

Definition at line 779 of file RelAlgDag.cpp.

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

Referenced by operator==().

                                                            {
   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:

Here is the caller graph for this function:

bool RelSort::isEmptyResult ( ) const

inline

Definition at line 1829 of file RelAlgDag.h.

References empty_result_.

Referenced by RelAlgExecutor::executeSort().

1829 { return empty_result_; }

RelSort::empty_result_

bool empty_result_

Definition: RelAlgDag.h:1894

Here is the caller graph for this function:

bool RelSort::isLimitDelivered ( ) const

inline

Definition at line 1831 of file RelAlgDag.h.

References limit_delivered_.

Referenced by RelAlgExecutor::createSortInputWorkUnit().

1831 { return limit_delivered_; }

RelSort::limit_delivered_

bool limit_delivered_

Definition: RelAlgDag.h:1895

Here is the caller graph for this function:

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

inline

Definition at line 1810 of file RelAlgDag.h.

References empty_result_, hasEquivCollationOf(), limit_, limit_delivered_, and offset_.

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

Here is the call graph for this function:

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

inline

Definition at line 1823 of file RelAlgDag.h.

References collation_.

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

void RelSort::setEmptyResult ( bool emptyResult )

inline

Definition at line 1827 of file RelAlgDag.h.

References empty_result_.

1827 { empty_result_ = emptyResult; }

RelSort::empty_result_

bool empty_result_

Definition: RelAlgDag.h:1894

size_t RelSort::size ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1884 of file RelAlgDag.h.

References RelAlgNode::inputs_.

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

RelAlgNode::inputs_

RelAlgInputs inputs_

Definition: RelAlgDag.h:886

size_t RelSort::toHash ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1865 of file RelAlgDag.h.

References collation_, empty_result_, RelAlgNode::hash_, RelAlgNode::inputs_, limit_, limit_delivered_, offset_, and RelSort().

                                  {
     if (!hash_) {
       hash_ = typeid(RelSort).hash_code();
       for (auto& collation : collation_) {
         boost::hash_combine(*hash_, collation.toHash());
       }
       boost::hash_combine(*hash_, empty_result_);
       boost::hash_combine(*hash_, limit_delivered_);
       if (limit_delivered_) {
         boost::hash_combine(*hash_, limit_);
       }
       boost::hash_combine(*hash_, offset_);
       for (auto& node : inputs_) {
         boost::hash_combine(*hash_, node->toHash());
       }
     }
     return *hash_;
   }

Here is the call graph for this function:

std::string RelSort::toString ( RelRexToStringConfig config = RelRexToStringConfig::defaults() ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1837 of file RelAlgDag.h.

References cat(), collation_, empty_result_, RelAlgNode::inputs_, limit_, limit_delivered_, offset_, to_string(), and typeName().

                                                                                    {
     const std::string limit_info = limit_delivered_ ? std::to_string(limit_) : "N/A";
     auto ret = cat(::typeName(this),
                    "(",
                    "empty_result: ",
                    ::toString(empty_result_),
                    ", collation=",
                    ::toString(collation_),
                    ", limit=",
                    limit_info,
                    ", offset",
                    std::to_string(offset_));
     if (!config.skip_input_nodes) {
       ret += ", inputs=", ::toString(inputs_);
     } else {
       ret += ", input node id={";
       for (auto& input : inputs_) {
         auto node_id_in_plan = input->getIdInPlanTree();
         auto node_id_str = node_id_in_plan ? std::to_string(*node_id_in_plan)
                                            : std::to_string(input->getId());
         ret += node_id_str + " ";
       }
       ret += "}";
     }
     return cat(ret, ")");
   }