OmniSciDB  72c90bc290
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
SortInfo Struct Reference

#include <RelAlgExecutionUnit.h>

Public Member Functions

 SortInfo ()
 
 algorithm (SortAlgorithm::Default)
 
 limit (std::nullopt)
 
 offset (0)
 
 SortInfo (const std::list< Analyzer::OrderEntry > &oe, const SortAlgorithm sa, std::optional< size_t > l, size_t o)
 
SortInfooperator= (const SortInfo &other)
 
size_t hashLimit () const
 

Static Public Member Functions

static SortInfo createFromSortNode (const RelSort *sort_node)
 

Public Attributes

std::list< Analyzer::OrderEntryorder_entries
 
SortAlgorithm algorithm
 
std::optional< size_t > limit
 
size_t offset
 

Detailed Description

Definition at line 116 of file RelAlgExecutionUnit.h.

Constructor & Destructor Documentation

SortInfo::SortInfo ( )
inline

Definition at line 117 of file RelAlgExecutionUnit.h.

118  : order_entries({})
std::list< Analyzer::OrderEntry > order_entries
SortInfo::SortInfo ( const std::list< Analyzer::OrderEntry > &  oe,
const SortAlgorithm  sa,
std::optional< size_t >  l,
size_t  o 
)
inline

Definition at line 123 of file RelAlgExecutionUnit.h.

127  : order_entries(oe), algorithm(sa), limit(l), offset(o) {}
SortAlgorithm algorithm
std::optional< size_t > limit
std::list< Analyzer::OrderEntry > order_entries

Member Function Documentation

SortInfo::algorithm ( SortAlgorithm::Default  )
static SortInfo SortInfo::createFromSortNode ( const RelSort sort_node)
inlinestatic

Definition at line 137 of file RelAlgExecutionUnit.h.

References RelSort::getLimit(), RelSort::getOffset(), RelSort::getOrderEntries(), and SpeculativeTopN.

Referenced by RelAlgExecutor::executeRelAlgStep(), and RaExecutionSequence::next().

137  {
138  return {sort_node->getOrderEntries(),
140  sort_node->getLimit(),
141  sort_node->getOffset()};
142  }
size_t getOffset() const
Definition: RelAlgDag.h:2228
std::list< Analyzer::OrderEntry > getOrderEntries() const
Definition: RelAlgDag.h:2264
std::optional< size_t > getLimit() const
Definition: RelAlgDag.h:2226

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

size_t SortInfo::hashLimit ( ) const
inline

Definition at line 144 of file RelAlgExecutionUnit.h.

References limit.

Referenced by QueryPlanDagExtractor::applyLimitClauseToCacheKey().

144  {
145  size_t hash{0};
146  boost::hash_combine(hash, limit.has_value());
147  boost::hash_combine(hash, limit.value_or(0));
148  return hash;
149  }
std::optional< size_t > limit

+ Here is the caller graph for this function:

SortInfo::limit ( std::nullopt  )
SortInfo::offset ( )
inline

Definition at line 121 of file RelAlgExecutionUnit.h.

121 {}
SortInfo& SortInfo::operator= ( const SortInfo other)
inline

Definition at line 129 of file RelAlgExecutionUnit.h.

References algorithm, limit, offset, and order_entries.

129  {
131  algorithm = other.algorithm;
132  limit = other.limit;
133  offset = other.offset;
134  return *this;
135  }
SortAlgorithm algorithm
std::optional< size_t > limit
std::list< Analyzer::OrderEntry > order_entries

Member Data Documentation


The documentation for this struct was generated from the following file: