RelSort Class Reference

#include <RelAlgDag.h>

Inheritance diagram for RelSort:

Collaboration diagram for RelSort:

Public Member Functions
	RelSort ()
	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 (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_
size_t	limit_
size_t	offset_
bool	empty_result_
bool	limit_delivered_

Friends
struct	RelAlgDagSerializer

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 >	id_in_plan_tree_
std::optional< size_t >	hash_

Detailed Description

Definition at line 1909 of file RelAlgDag.h.

Constructor & Destructor Documentation

RelSort::RelSort ( )

inline

Definition at line 1912 of file RelAlgDag.h.

Referenced by toHash().

: limit_{0}, offset_{0}, empty_result_{false}, limit_delivered_{false} {}

Here is the caller graph for this function:

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 1914 of file RelAlgDag.h.

References RelAlgNode::inputs_.

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

Member Function Documentation

size_t RelSort::collationCount ( ) const

inline

Definition at line 1932 of file RelAlgDag.h.

References collation_.

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:

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

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 2002 of file RelAlgDag.h.

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

SortField RelSort::getCollation ( const size_t  i ) const

inline

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

References limit_.

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

{ return limit_; }

Here is the caller graph for this function:

size_t RelSort::getOffset ( ) const

inline

Definition at line 1951 of file RelAlgDag.h.

References offset_.

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

{ return offset_; }

Here is the caller graph for this function:

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

private

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

References empty_result_.

Referenced by RelAlgExecutor::executeSort().

{ return empty_result_; }

Here is the caller graph for this function:

bool RelSort::isLimitDelivered ( ) const

inline

Definition at line 1947 of file RelAlgDag.h.

References limit_delivered_.

Referenced by RelAlgExecutor::createSortInputWorkUnit().

{ return limit_delivered_; }

Here is the caller graph for this function:

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

inline

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

References collation_.

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

void RelSort::setEmptyResult ( bool  emptyResult )

inline

Definition at line 1943 of file RelAlgDag.h.

References empty_result_.

{ empty_result_ = emptyResult; }

size_t RelSort::size ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 2000 of file RelAlgDag.h.

References RelAlgNode::inputs_.

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

size_t RelSort::toHash ( ) const

inlineoverridevirtual

Implements RelAlgNode.

Definition at line 1981 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 1953 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, ")");
  }

Here is the call graph for this function:

Friends And Related Function Documentation

friend struct RelAlgDagSerializer

friend

Definition at line 2015 of file RelAlgDag.h.

Member Data Documentation

std::vector<SortField> RelSort::collation_

private

Definition at line 2007 of file RelAlgDag.h.

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

bool RelSort::empty_result_

private

Definition at line 2010 of file RelAlgDag.h.

Referenced by isEmptyResult(), operator==(), setEmptyResult(), toHash(), and toString().

size_t RelSort::limit_

private

Definition at line 2008 of file RelAlgDag.h.

Referenced by getLimit(), operator==(), toHash(), and toString().

bool RelSort::limit_delivered_

private

Definition at line 2011 of file RelAlgDag.h.

Referenced by isLimitDelivered(), operator==(), toHash(), and toString().

size_t RelSort::offset_

private

Definition at line 2009 of file RelAlgDag.h.

Referenced by getOffset(), operator==(), toHash(), 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