public class EnumerableLimitSort extends Sort implements EnumerableRel
Sort in
enumerable calling convention.
It optimizes sorts that have a limit and an optional offset.EnumerableRel.Prefer, EnumerableRel.ResultRelNode.Contextdigest, id, rowType, traitSet| Constructor and Description |
|---|
EnumerableLimitSort(RelOptCluster cluster,
RelTraitSet traitSet,
RelNode input,
RelCollation collation,
RexNode offset,
RexNode fetch)
Creates an EnumerableLimitSort.
|
| Modifier and Type | Method and Description |
|---|---|
RelOptCost |
computeSelfCost(RelOptPlanner planner,
RelMetadataQuery mq)
Returns the cost of this plan (not including children).
|
EnumerableLimitSort |
copy(RelTraitSet traitSet,
RelNode newInput,
RelCollation newCollation,
RexNode offset,
RexNode fetch) |
static EnumerableLimitSort |
create(RelNode input,
RelCollation collation,
RexNode offset,
RexNode fetch)
Creates an EnumerableLimitSort.
|
EnumerableRel.Result |
implement(EnumerableRelImplementor implementor,
EnumerableRel.Prefer pref)
Creates a plan for this expression according to a calling convention.
|
accept, copy, copy, explainTerms, getCollation, getSortExps, isEnforcerchildrenAccept, deriveRowType, estimateRowCount, getInput, getInputs, replaceInputaccept, collectVariablesSet, collectVariablesUsed, deepEquals, deepHashCode, equals, explain, getCluster, getConvention, getCorrelVariable, getDescription, getDigest, getExpectedInputRowType, getId, getInput, getRelDigest, getRelTypeName, getRowType, getTable, getTraitSet, getVariablesSet, hashCode, isValid, metadata, onRegister, recomputeDigest, register, sole, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitderiveTraits, getDeriveMode, passThroughTraitsderive, derive, passThroughaccept, accept, childrenAccept, collectVariablesSet, collectVariablesUsed, copy, deepEquals, deepHashCode, estimateRowCount, explain, explain, getConvention, getCorrelVariable, getDigest, getExpectedInputRowType, getInput, getInputs, getRelDigest, getRelTypeName, getRowType, getTable, getVariablesSet, isEnforcer, isValid, metadata, onRegister, recomputeDigest, register, replaceInputgetCluster, getDescription, getId, getTraitSetpublic EnumerableLimitSort(RelOptCluster cluster, RelTraitSet traitSet, RelNode input, RelCollation collation, RexNode offset, RexNode fetch)
Use create(org.apache.calcite.rel.RelNode, org.apache.calcite.rel.RelCollation, org.apache.calcite.rex.RexNode, org.apache.calcite.rex.RexNode) unless you know what you're doing.
public static EnumerableLimitSort create(RelNode input, RelCollation collation, RexNode offset, RexNode fetch)
public EnumerableLimitSort copy(RelTraitSet traitSet, RelNode newInput, RelCollation newCollation, RexNode offset, RexNode fetch)
public EnumerableRel.Result implement(EnumerableRelImplementor implementor, EnumerableRel.Prefer pref)
EnumerableRelimplement in interface EnumerableRelimplementor - Implementorpref - Preferred representation for rows in result expressionpublic RelOptCost computeSelfCost(RelOptPlanner planner, RelMetadataQuery mq)
RelNodeNOTE jvs 29-Mar-2006: Don't call this method directly. Instead, use
RelMetadataQuery.getNonCumulativeCost(org.apache.calcite.rel.RelNode), which gives plugins a
chance to override the rel's default ideas about cost.
computeSelfCost in interface RelNodecomputeSelfCost in class Sortplanner - Planner for cost calculationmq - Metadata queryCopyright © 2012-2020 Apache Software Foundation. All Rights Reserved.