#include <RelAlgDag.h>

Inheritance diagram for RelSort:

Collaboration diagram for RelSort:

Public Member Functions
	RelSort ()

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

virtual void	acceptChildren (Visitor &v) const override

virtual void	accept (Visitor &v, std::string name) const override

bool	operator== (const RelSort &that) const

size_t	collationCount () const

SortField	getCollation (const size_t i) const

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

bool	isEmptyResult () const

bool	isLimitDelivered () const

std::optional< size_t >	getLimit () const

size_t	getOffset () const

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

size_t	size () const override

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

virtual size_t	toHash () const override

std::list< Analyzer::OrderEntry >	getOrderEntries () const

Public Member Functions inherited from RelAlgNode
	RelAlgNode (RelAlgInputs inputs={})

virtual	~RelAlgNode ()

void	resetQueryExecutionState ()

void	setContextData (const RaExecutionDesc *context_data) const

void	setOutputMetainfo (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

bool	hasContextData () const

const RaExecutionDesc *	getContextData () const

const size_t	inputCount () const

const RelAlgNode *	getInput (const size_t idx) const

const std::vector< RelAlgNode const * >	getInputs () 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

Public Member Functions inherited from RelAlgDagNode
	RelAlgDagNode ()

virtual size_t	getStepNumber () const

virtual void	setStepNumber (size_t step) const

std::optional< size_t >	getIdInPlanTree () const

void	setIdInPlanTree (size_t id) const

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

Private Attributes
std::vector< SortField >	collation_

std::optional< size_t >	limit_

size_t	offset_

Friends
struct	RelAlgDagSerializer

std::size_t	hash_value (RelSort const &)

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

Protected Attributes inherited from RelAlgNode
RelAlgInputs	inputs_

unsigned	id_

std::optional< size_t >	hash_

Protected Attributes inherited from RelAlgDagNode
size_t	step_ {0}

std::optional< size_t >	id_in_plan_tree_

Detailed Description

Definition at line 2181 of file RelAlgDag.h.

Constructor & Destructor Documentation

RelSort::RelSort ( )

inline

Definition at line 2184 of file RelAlgDag.h.

2184 : limit_(std::nullopt), offset_(0) {}

RelSort::offset_

size_t offset_

Definition: RelAlgDag.h:2280

RelSort::limit_

std::optional< size_t > limit_

Definition: RelAlgDag.h:2279

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

inline

Definition at line 2186 of file RelAlgDag.h.

References RelAlgNode::inputs_.

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

Member Function Documentation

virtual void RelSort::accept	(	Visitor &	v,
		std::string	name
	)		const

inlineoverridevirtual

Implements RelAlgDagNode.

Definition at line 2201 of file RelAlgDag.h.

References acceptChildren(), and RelAlgDagNode::Visitor::visit().

Referenced by TableFunctionsFactory_node.PrintNode::__str__().

                                                                  {
     if (v.visit(this, std::move(name))) {
       acceptChildren(v);
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

virtual void RelSort::acceptChildren ( Visitor & v ) const

inlineoverridevirtual

Implements RelAlgDagNode.

Definition at line 2194 of file RelAlgDag.h.

References RelAlgNode::getInputs(), and anonymous_namespace{Utm.h}::n.

Referenced by accept().

                                                          {
     for (auto& n : getInputs()) {
       if (n) {
         n->accept(v, "input");
       }
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

size_t RelSort::collationCount ( ) const

inline

Definition at line 2211 of file RelAlgDag.h.

References collation_.

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

2211 { return collation_.size(); }

RelSort::collation_

std::vector< SortField > collation_

Definition: RelAlgDag.h:2278

Here is the caller graph for this function:

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

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 2258 of file RelAlgDag.h.

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

SortField RelSort::getCollation ( const size_t i ) const

inline

Definition at line 2213 of file RelAlgDag.h.

References CHECK_LT, and collation_.

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

std::optional<size_t> RelSort::getLimit ( ) const

inline

Definition at line 2226 of file RelAlgDag.h.

References limit_.

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

2226 { return limit_; }

RelSort::limit_

std::optional< size_t > limit_

Definition: RelAlgDag.h:2279

Here is the caller graph for this function:

size_t RelSort::getOffset ( ) const

inline

Definition at line 2228 of file RelAlgDag.h.

References offset_.

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

2228 { return offset_; }

RelSort::offset_

size_t offset_

Definition: RelAlgDag.h:2280

Here is the caller graph for this function:

std::list<Analyzer::OrderEntry> RelSort::getOrderEntries ( ) const

inline

Definition at line 2264 of file RelAlgDag.h.

References collation_, Descending, First, and run_benchmark_import::result.

Referenced by SortInfo::createFromSortNode(), and RelAlgExecutor::executeSort().

                                                       {
     std::list<Analyzer::OrderEntry> result;
     for (size_t i = 0; i < collation_.size(); ++i) {
       const auto sort_field = collation_[i];
       result.emplace_back(sort_field.getField() + 1,
                           sort_field.getSortDir() == SortDirection::Descending,
                           sort_field.getNullsPosition() == NullSortedPosition::First);
     }
     return result;
   }

Here is the caller graph for this function:

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

private

Definition at line 803 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 2222 of file RelAlgDag.h.

References limit_.

Referenced by RelAlgExecutor::executeSort().

2222 { return limit_.value_or(-1) == 0; }

RelSort::limit_

std::optional< size_t > limit_

Definition: RelAlgDag.h:2279

Here is the caller graph for this function:

bool RelSort::isLimitDelivered ( ) const

inline

Definition at line 2224 of file RelAlgDag.h.

References limit_.

2224 { return limit_.has_value(); }

RelSort::limit_

std::optional< size_t > limit_

Definition: RelAlgDag.h:2279

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

inline

Definition at line 2207 of file RelAlgDag.h.

References hasEquivCollationOf(), limit_, and offset_.

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

Here is the call graph for this function:

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

inline

Definition at line 2218 of file RelAlgDag.h.

References collation_.

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

size_t RelSort::size ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 2256 of file RelAlgDag.h.

References RelAlgNode::inputs_.

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

RelAlgNode::inputs_

RelAlgInputs inputs_

Definition: RelAlgDag.h:945

virtual size_t RelSort::toHash ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 2262 of file RelAlgDag.h.

References hash_value.

2262 { return hash_value(*this); }

RelSort::hash_value

friend std::size_t hash_value(RelSort const &)

Definition: RelAlgDag.cpp:3768

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

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 2230 of file RelAlgDag.h.

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

                                                                                    {
     const std::string limit_info = limit_ ? std::to_string(*limit_) : "N/A";
     auto ret = cat(::typeName(this),
                    "(",
                    "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, ")");
   }

Here is the call graph for this function:

Friends And Related Function Documentation

std::size_t hash_value ( RelSort const & rel_sort )

friend

Definition at line 3768 of file RelAlgDag.cpp.

Referenced by toHash().

                                               {
   if (rel_sort.hash_) {
     return *rel_sort.hash_;
   }
   rel_sort.hash_ = typeid(RelSort).hash_code();
   boost::hash_combine(*rel_sort.hash_, rel_sort.collation_);
   boost::hash_combine(*rel_sort.hash_, rel_sort.limit_.has_value());
   boost::hash_combine(*rel_sort.hash_, rel_sort.limit_.value_or(0));
   boost::hash_combine(*rel_sort.hash_, rel_sort.offset_);
   boost::hash_combine(*rel_sort.hash_, rel_sort.inputs_);
   return *rel_sort.hash_;
 }

friend struct RelAlgDagSerializer

friend

Definition at line 2284 of file RelAlgDag.h.

Member Data Documentation

std::vector<SortField> RelSort::collation_

private

Definition at line 2278 of file RelAlgDag.h.

Referenced by collationCount(), getCollation(), getOrderEntries(), hasEquivCollationOf(), hash_value(), setCollation(), and toString().

std::optional<size_t> RelSort::limit_

private

Definition at line 2279 of file RelAlgDag.h.

Referenced by getLimit(), hash_value(), isEmptyResult(), isLimitDelivered(), operator==(), and toString().

size_t RelSort::offset_

private

Definition at line 2280 of file RelAlgDag.h.

Referenced by getOffset(), hash_value(), operator==(), and toString().

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

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

Public Member Functions

Private Member Functions

Private Attributes

Friends

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Friends And Related Function Documentation

Member Data Documentation