com.hazelcast.org.apache.calcite.interpreter.Bindables Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to you under the Apache License, Version 2.0
* (the "License"); you may not use this file except in com.hazelcast.com.liance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.com.hazelcast.org.licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.hazelcast.org.apache.calcite.interpreter;
import com.hazelcast.org.apache.calcite.DataContext;
import com.hazelcast.org.apache.calcite.adapter.enumerable.AggImplementor;
import com.hazelcast.org.apache.calcite.adapter.enumerable.RexImpTable;
import com.hazelcast.org.apache.calcite.linq4j.Enumerable;
import com.hazelcast.org.apache.calcite.plan.Convention;
import com.hazelcast.org.apache.calcite.plan.RelOptCluster;
import com.hazelcast.org.apache.calcite.plan.RelOptCost;
import com.hazelcast.org.apache.calcite.plan.RelOptPlanner;
import com.hazelcast.org.apache.calcite.plan.RelOptRule;
import com.hazelcast.org.apache.calcite.plan.RelOptRuleCall;
import com.hazelcast.org.apache.calcite.plan.RelOptTable;
import com.hazelcast.org.apache.calcite.plan.RelOptUtil;
import com.hazelcast.org.apache.calcite.plan.RelTraitSet;
import com.hazelcast.org.apache.calcite.rel.InvalidRelException;
import com.hazelcast.org.apache.calcite.rel.RelCollation;
import com.hazelcast.org.apache.calcite.rel.RelCollationTraitDef;
import com.hazelcast.org.apache.calcite.rel.RelNode;
import com.hazelcast.org.apache.calcite.rel.RelWriter;
import com.hazelcast.org.apache.calcite.rel.convert.ConverterRule;
import com.hazelcast.org.apache.calcite.rel.core.Aggregate;
import com.hazelcast.org.apache.calcite.rel.core.AggregateCall;
import com.hazelcast.org.apache.calcite.rel.core.CorrelationId;
import com.hazelcast.org.apache.calcite.rel.core.Filter;
import com.hazelcast.org.apache.calcite.rel.core.Intersect;
import com.hazelcast.org.apache.calcite.rel.core.Join;
import com.hazelcast.org.apache.calcite.rel.core.JoinRelType;
import com.hazelcast.org.apache.calcite.rel.core.Match;
import com.hazelcast.org.apache.calcite.rel.core.Minus;
import com.hazelcast.org.apache.calcite.rel.core.Project;
import com.hazelcast.org.apache.calcite.rel.core.RelFactories;
import com.hazelcast.org.apache.calcite.rel.core.SetOp;
import com.hazelcast.org.apache.calcite.rel.core.Sort;
import com.hazelcast.org.apache.calcite.rel.core.TableScan;
import com.hazelcast.org.apache.calcite.rel.core.Union;
import com.hazelcast.org.apache.calcite.rel.core.Values;
import com.hazelcast.org.apache.calcite.rel.core.Window;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalAggregate;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalFilter;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalIntersect;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalJoin;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalMatch;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalProject;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalTableScan;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalUnion;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalValues;
import com.hazelcast.org.apache.calcite.rel.logical.LogicalWindow;
import com.hazelcast.org.apache.calcite.rel.metadata.RelMdCollation;
import com.hazelcast.org.apache.calcite.rel.metadata.RelMetadataQuery;
import com.hazelcast.org.apache.calcite.rel.type.RelDataType;
import com.hazelcast.org.apache.calcite.rel.type.RelDataTypeFactory;
import com.hazelcast.org.apache.calcite.rel.type.RelDataTypeField;
import com.hazelcast.org.apache.calcite.rex.RexLiteral;
import com.hazelcast.org.apache.calcite.rex.RexNode;
import com.hazelcast.org.apache.calcite.schema.FilterableTable;
import com.hazelcast.org.apache.calcite.schema.ProjectableFilterableTable;
import com.hazelcast.org.apache.calcite.schema.ScannableTable;
import com.hazelcast.org.apache.calcite.schema.Table;
import com.hazelcast.org.apache.calcite.tools.RelBuilderFactory;
import com.hazelcast.org.apache.calcite.util.ImmutableBitSet;
import com.hazelcast.org.apache.calcite.util.ImmutableIntList;
import com.hazelcast.com.google.com.hazelcast.com.on.base.Preconditions;
import com.hazelcast.com.google.com.hazelcast.com.on.collect.ImmutableList;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.Set;
import java.util.SortedSet;
import java.util.function.Predicate;
/**
* Utilities pertaining to {@link BindableRel} and {@link BindableConvention}.
*/
public class Bindables {
private Bindables() {}
public static final RelOptRule BINDABLE_TABLE_SCAN_RULE =
new BindableTableScanRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_FILTER_RULE =
new BindableFilterRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_PROJECT_RULE =
new BindableProjectRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_SORT_RULE =
new BindableSortRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_JOIN_RULE =
new BindableJoinRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_SETOP_RULE =
new BindableSetOpRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_VALUES_RULE =
new BindableValuesRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_AGGREGATE_RULE =
new BindableAggregateRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_WINDOW_RULE =
new BindableWindowRule(RelFactories.LOGICAL_BUILDER);
public static final RelOptRule BINDABLE_MATCH_RULE =
new BindableMatchRule(RelFactories.LOGICAL_BUILDER);
/** All rules that convert logical relational expression to bindable. */
public static final ImmutableList RULES =
ImmutableList.of(
NoneToBindableConverterRule.INSTANCE,
BINDABLE_TABLE_SCAN_RULE,
BINDABLE_FILTER_RULE,
BINDABLE_PROJECT_RULE,
BINDABLE_SORT_RULE,
BINDABLE_JOIN_RULE,
BINDABLE_SETOP_RULE,
BINDABLE_VALUES_RULE,
BINDABLE_AGGREGATE_RULE,
BINDABLE_WINDOW_RULE,
BINDABLE_MATCH_RULE);
/** Helper method that converts a bindable relational expression into a
* record iterator.
*
* Any bindable can be com.hazelcast.com.iled; if its input is also bindable, it becomes
* part of the same com.hazelcast.com.ilation unit.
*/
private static Enumerable help(DataContext dataContext,
BindableRel rel) {
return new Interpreter(dataContext, rel);
}
/** Rule that converts a {@link com.hazelcast.org.apache.calcite.rel.core.TableScan}
* to bindable convention. */
public static class BindableTableScanRule extends RelOptRule {
/**
* Creates a BindableTableScanRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableTableScanRule(RelBuilderFactory relBuilderFactory) {
super(operand(LogicalTableScan.class, none()), relBuilderFactory, null);
}
@Override public void onMatch(RelOptRuleCall call) {
final LogicalTableScan scan = call.rel(0);
final RelOptTable table = scan.getTable();
if (BindableTableScan.canHandle(table)) {
call.transformTo(
BindableTableScan.create(scan.getCluster(), table));
}
}
}
/** Scan of a table that implements {@link ScannableTable} and therefore can
* be converted into an {@link Enumerable}. */
public static class BindableTableScan
extends TableScan implements BindableRel {
public final ImmutableList filters;
public final ImmutableIntList projects;
/** Creates a BindableTableScan.
*
* Use {@link #create} unless you know what you are doing. */
BindableTableScan(RelOptCluster cluster, RelTraitSet traitSet,
RelOptTable table, ImmutableList filters,
ImmutableIntList projects) {
super(cluster, traitSet, ImmutableList.of(), table);
this.filters = Objects.requireNonNull(filters);
this.projects = Objects.requireNonNull(projects);
Preconditions.checkArgument(canHandle(table));
}
/** Creates a BindableTableScan. */
public static BindableTableScan create(RelOptCluster cluster,
RelOptTable relOptTable) {
return create(cluster, relOptTable, ImmutableList.of(),
identity(relOptTable));
}
/** Creates a BindableTableScan. */
public static BindableTableScan create(RelOptCluster cluster,
RelOptTable relOptTable, List filters,
List projects) {
final Table table = relOptTable.unwrap(Table.class);
final RelTraitSet traitSet =
cluster.traitSetOf(BindableConvention.INSTANCE)
.replaceIfs(RelCollationTraitDef.INSTANCE, () -> {
if (table != null) {
return table.getStatistic().getCollations();
}
return ImmutableList.of();
});
return new BindableTableScan(cluster, traitSet, relOptTable,
ImmutableList.copyOf(filters), ImmutableIntList.copyOf(projects));
}
@Override public RelDataType deriveRowType() {
final RelDataTypeFactory.Builder builder =
getCluster().getTypeFactory().builder();
final List fieldList =
table.getRowType().getFieldList();
for (int project : projects) {
builder.add(fieldList.get(project));
}
return builder.build();
}
public Class getElementType() {
return Object[].class;
}
@Override public RelWriter explainTerms(RelWriter pw) {
return super.explainTerms(pw)
.itemIf("filters", filters, !filters.isEmpty())
.itemIf("projects", projects, !projects.equals(identity()));
}
@Override public RelOptCost com.hazelcast.com.uteSelfCost(RelOptPlanner planner,
RelMetadataQuery mq) {
boolean noPushing = filters.isEmpty()
&& projects.size() == table.getRowType().getFieldCount();
if (noPushing) {
return super.com.hazelcast.com.uteSelfCost(planner, mq);
}
// Cost factor for pushing filters
double f = filters.isEmpty() ? 1d : 0.5d;
// Cost factor for pushing fields
// The "+ 2d" on top and bottom keeps the function fairly smooth.
double p = ((double) projects.size() + 2d)
/ ((double) table.getRowType().getFieldCount() + 2d);
// Multiply the cost by a factor that makes a scan more attractive if
// filters and projects are pushed to the table scan
return super.com.hazelcast.com.uteSelfCost(planner, mq)
.multiplyBy(f * p * 0.01d);
}
public static boolean canHandle(RelOptTable table) {
return table.unwrap(ScannableTable.class) != null
|| table.unwrap(FilterableTable.class) != null
|| table.unwrap(ProjectableFilterableTable.class) != null;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
throw new UnsupportedOperationException(); // TODO:
}
}
/** Rule that converts a {@link Filter} to bindable convention. */
public static class BindableFilterRule extends ConverterRule {
/**
* Creates a BindableFilterRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableFilterRule(RelBuilderFactory relBuilderFactory) {
super(LogicalFilter.class,
(Predicate) RelOptUtil::notContainsWindowedAgg,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableFilterRule");
}
public RelNode convert(RelNode rel) {
final LogicalFilter filter = (LogicalFilter) rel;
return BindableFilter.create(
convert(filter.getInput(),
filter.getInput().getTraitSet()
.replace(BindableConvention.INSTANCE)),
filter.getCondition());
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Filter}
* in bindable convention. */
public static class BindableFilter extends Filter implements BindableRel {
public BindableFilter(RelOptCluster cluster, RelTraitSet traitSet,
RelNode input, RexNode condition) {
super(cluster, traitSet, input, condition);
assert getConvention() instanceof BindableConvention;
}
/** Creates a BindableFilter. */
public static BindableFilter create(final RelNode input,
RexNode condition) {
final RelOptCluster cluster = input.getCluster();
final RelMetadataQuery mq = cluster.getMetadataQuery();
final RelTraitSet traitSet =
cluster.traitSetOf(BindableConvention.INSTANCE)
.replaceIfs(RelCollationTraitDef.INSTANCE,
() -> RelMdCollation.filter(mq, input));
return new BindableFilter(cluster, traitSet, input, condition);
}
public BindableFilter copy(RelTraitSet traitSet, RelNode input,
RexNode condition) {
return new BindableFilter(getCluster(), traitSet, input, condition);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new FilterNode(implementor.com.hazelcast.com.iler, this);
}
}
/**
* Rule to convert a {@link com.hazelcast.org.apache.calcite.rel.logical.LogicalProject}
* to a {@link BindableProject}.
*/
public static class BindableProjectRule extends ConverterRule {
/**
* Creates a BindableProjectRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableProjectRule(RelBuilderFactory relBuilderFactory) {
super(LogicalProject.class,
(Predicate) RelOptUtil::notContainsWindowedAgg,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableProjectRule");
}
public RelNode convert(RelNode rel) {
final LogicalProject project = (LogicalProject) rel;
return new BindableProject(rel.getCluster(),
rel.getTraitSet().replace(BindableConvention.INSTANCE),
convert(project.getInput(),
project.getInput().getTraitSet()
.replace(BindableConvention.INSTANCE)),
project.getProjects(),
project.getRowType());
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Project} in
* bindable calling convention. */
public static class BindableProject extends Project implements BindableRel {
public BindableProject(RelOptCluster cluster, RelTraitSet traitSet,
RelNode input, List projects, RelDataType rowType) {
super(cluster, traitSet, ImmutableList.of(), input, projects, rowType);
assert getConvention() instanceof BindableConvention;
}
public BindableProject copy(RelTraitSet traitSet, RelNode input,
List projects, RelDataType rowType) {
return new BindableProject(getCluster(), traitSet, input,
projects, rowType);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new ProjectNode(implementor.com.hazelcast.com.iler, this);
}
}
/**
* Rule to convert an {@link com.hazelcast.org.apache.calcite.rel.core.Sort} to a
* {@link com.hazelcast.org.apache.calcite.interpreter.Bindables.BindableSort}.
*/
public static class BindableSortRule extends ConverterRule {
/**
* Creates a BindableSortRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableSortRule(RelBuilderFactory relBuilderFactory) {
super(Sort.class, (Predicate) r -> true, Convention.NONE,
BindableConvention.INSTANCE, relBuilderFactory, "BindableSortRule");
}
public RelNode convert(RelNode rel) {
final Sort sort = (Sort) rel;
final RelTraitSet traitSet =
sort.getTraitSet().replace(BindableConvention.INSTANCE);
final RelNode input = sort.getInput();
return new BindableSort(rel.getCluster(), traitSet,
convert(input,
input.getTraitSet().replace(BindableConvention.INSTANCE)),
sort.getCollation(), sort.offset, sort.fetch);
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Sort}
* bindable calling convention. */
public static class BindableSort extends Sort implements BindableRel {
public BindableSort(RelOptCluster cluster, RelTraitSet traitSet,
RelNode input, RelCollation collation, RexNode offset, RexNode fetch) {
super(cluster, traitSet, input, collation, offset, fetch);
assert getConvention() instanceof BindableConvention;
}
@Override public BindableSort copy(RelTraitSet traitSet, RelNode newInput,
RelCollation newCollation, RexNode offset, RexNode fetch) {
return new BindableSort(getCluster(), traitSet, newInput, newCollation,
offset, fetch);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new SortNode(implementor.com.hazelcast.com.iler, this);
}
}
/**
* Rule to convert a {@link com.hazelcast.org.apache.calcite.rel.logical.LogicalJoin}
* to a {@link BindableJoin}.
*/
public static class BindableJoinRule extends ConverterRule {
/**
* Creates a BindableJoinRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableJoinRule(RelBuilderFactory relBuilderFactory) {
super(LogicalJoin.class, (Predicate) r -> true,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableJoinRule");
}
public RelNode convert(RelNode rel) {
final LogicalJoin join = (LogicalJoin) rel;
final BindableConvention out = BindableConvention.INSTANCE;
final RelTraitSet traitSet = join.getTraitSet().replace(out);
return new BindableJoin(rel.getCluster(), traitSet,
convert(join.getLeft(),
join.getLeft().getTraitSet()
.replace(BindableConvention.INSTANCE)),
convert(join.getRight(),
join.getRight().getTraitSet()
.replace(BindableConvention.INSTANCE)),
join.getCondition(), join.getVariablesSet(), join.getJoinType());
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Join} in
* bindable calling convention. */
public static class BindableJoin extends Join implements BindableRel {
/** Creates a BindableJoin. */
protected BindableJoin(RelOptCluster cluster, RelTraitSet traitSet,
RelNode left, RelNode right, RexNode condition,
Set variablesSet, JoinRelType joinType) {
super(cluster, traitSet, ImmutableList.of(), left, right,
condition, variablesSet, joinType);
}
@Deprecated // to be removed before 2.0
protected BindableJoin(RelOptCluster cluster, RelTraitSet traitSet,
RelNode left, RelNode right, RexNode condition, JoinRelType joinType,
Set variablesStopped) {
this(cluster, traitSet, left, right, condition,
CorrelationId.setOf(variablesStopped), joinType);
}
public BindableJoin copy(RelTraitSet traitSet, RexNode conditionExpr,
RelNode left, RelNode right, JoinRelType joinType,
boolean semiJoinDone) {
return new BindableJoin(getCluster(), traitSet, left, right,
conditionExpr, variablesSet, joinType);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new JoinNode(implementor.com.hazelcast.com.iler, this);
}
}
@Deprecated // Use BindableSetOpRule instead, to be removed before 1.24.0
public static class BindableUnionRule extends BindableSetOpRule {
/**
* Creates a BindableUnionRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableUnionRule(RelBuilderFactory relBuilderFactory) {
super(relBuilderFactory);
}
}
/**
* Rule to convert an {@link SetOp} to a {@link BindableUnion}
* or {@link BindableIntersect} or {@link BindableMinus}.
*/
public static class BindableSetOpRule extends ConverterRule {
/**
* Creates a BindableSetOpRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableSetOpRule(RelBuilderFactory relBuilderFactory) {
super(SetOp.class, (Predicate) r -> true,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableSetOpRule");
}
public RelNode convert(RelNode rel) {
final SetOp setOp = (SetOp) rel;
final BindableConvention out = BindableConvention.INSTANCE;
final RelTraitSet traitSet = setOp.getTraitSet().replace(out);
if (setOp instanceof LogicalUnion) {
return new BindableUnion(rel.getCluster(), traitSet,
convertList(setOp.getInputs(), out), setOp.all);
} else if (setOp instanceof LogicalIntersect) {
return new BindableIntersect(rel.getCluster(), traitSet,
convertList(setOp.getInputs(), out), setOp.all);
} else {
return new BindableMinus(rel.getCluster(), traitSet,
convertList(setOp.getInputs(), out), setOp.all);
}
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Union} in
* bindable calling convention. */
public static class BindableUnion extends Union implements BindableRel {
public BindableUnion(RelOptCluster cluster, RelTraitSet traitSet,
List inputs, boolean all) {
super(cluster, traitSet, inputs, all);
}
public BindableUnion copy(RelTraitSet traitSet, List inputs,
boolean all) {
return new BindableUnion(getCluster(), traitSet, inputs, all);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new SetOpNode(implementor.com.hazelcast.com.iler, this);
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Intersect} in
* bindable calling convention. */
public static class BindableIntersect extends Intersect implements BindableRel {
public BindableIntersect(RelOptCluster cluster, RelTraitSet traitSet,
List inputs, boolean all) {
super(cluster, traitSet, inputs, all);
}
public BindableIntersect copy(RelTraitSet traitSet, List inputs, boolean all) {
return new BindableIntersect(getCluster(), traitSet, inputs, all);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new SetOpNode(implementor.com.hazelcast.com.iler, this);
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Minus} in
* bindable calling convention. */
public static class BindableMinus extends Minus implements BindableRel {
public BindableMinus(RelOptCluster cluster, RelTraitSet traitSet,
List inputs, boolean all) {
super(cluster, traitSet, inputs, all);
}
public BindableMinus copy(RelTraitSet traitSet, List inputs, boolean all) {
return new BindableMinus(getCluster(), traitSet, inputs, all);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new SetOpNode(implementor.com.hazelcast.com.iler, this);
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Values}
* in bindable calling convention. */
public static class BindableValues extends Values implements BindableRel {
BindableValues(RelOptCluster cluster, RelDataType rowType,
ImmutableList> tuples, RelTraitSet traitSet) {
super(cluster, rowType, tuples, traitSet);
}
@Override public RelNode copy(RelTraitSet traitSet, List inputs) {
assert inputs.isEmpty();
return new BindableValues(getCluster(), rowType, tuples, traitSet);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new ValuesNode(implementor.com.hazelcast.com.iler, this);
}
}
/** Rule that converts a {@link Values} to bindable convention. */
public static class BindableValuesRule extends ConverterRule {
/**
* Creates a BindableValuesRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableValuesRule(RelBuilderFactory relBuilderFactory) {
super(LogicalValues.class, (Predicate) r -> true,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableValuesRule");
}
@Override public RelNode convert(RelNode rel) {
LogicalValues values = (LogicalValues) rel;
return new BindableValues(values.getCluster(), values.getRowType(),
values.getTuples(),
values.getTraitSet().replace(BindableConvention.INSTANCE));
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Aggregate}
* in bindable calling convention. */
public static class BindableAggregate extends Aggregate
implements BindableRel {
public BindableAggregate(
RelOptCluster cluster,
RelTraitSet traitSet,
RelNode input,
ImmutableBitSet groupSet,
List groupSets,
List aggCalls)
throws InvalidRelException {
super(cluster, traitSet, ImmutableList.of(), input, groupSet, groupSets, aggCalls);
assert getConvention() instanceof BindableConvention;
for (AggregateCall aggCall : aggCalls) {
if (aggCall.isDistinct()) {
throw new InvalidRelException(
"distinct aggregation not supported");
}
AggImplementor implementor2 =
RexImpTable.INSTANCE.get(aggCall.getAggregation(), false);
if (implementor2 == null) {
throw new InvalidRelException(
"aggregation " + aggCall.getAggregation() + " not supported");
}
}
}
@Deprecated // to be removed before 2.0
public BindableAggregate(RelOptCluster cluster, RelTraitSet traitSet,
RelNode input, boolean indicator, ImmutableBitSet groupSet,
List groupSets, List aggCalls)
throws InvalidRelException {
this(cluster, traitSet, input, groupSet, groupSets, aggCalls);
checkIndicator(indicator);
}
@Override public BindableAggregate copy(RelTraitSet traitSet, RelNode input,
ImmutableBitSet groupSet,
List groupSets, List aggCalls) {
try {
return new BindableAggregate(getCluster(), traitSet, input,
groupSet, groupSets, aggCalls);
} catch (InvalidRelException e) {
// Semantic error not possible. Must be a bug. Convert to
// internal error.
throw new AssertionError(e);
}
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new AggregateNode(implementor.com.hazelcast.com.iler, this);
}
}
/** Rule that converts an {@link Aggregate} to bindable convention. */
public static class BindableAggregateRule extends ConverterRule {
/**
* Creates a BindableAggregateRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableAggregateRule(RelBuilderFactory relBuilderFactory) {
super(LogicalAggregate.class, (Predicate) r -> true,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableAggregateRule");
}
public RelNode convert(RelNode rel) {
final LogicalAggregate agg = (LogicalAggregate) rel;
final RelTraitSet traitSet =
agg.getTraitSet().replace(BindableConvention.INSTANCE);
try {
return new BindableAggregate(rel.getCluster(), traitSet,
convert(agg.getInput(), traitSet), false, agg.getGroupSet(),
agg.getGroupSets(), agg.getAggCallList());
} catch (InvalidRelException e) {
RelOptPlanner.LOGGER.debug(e.toString());
return null;
}
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Window}
* in bindable convention. */
public static class BindableWindow extends Window implements BindableRel {
/** Creates a BindableWindow. */
BindableWindow(RelOptCluster cluster, RelTraitSet traitSet, RelNode input,
List constants, RelDataType rowType, List groups) {
super(cluster, traitSet, input, constants, rowType, groups);
}
@Override public RelNode copy(RelTraitSet traitSet, List inputs) {
return new BindableWindow(getCluster(), traitSet, sole(inputs),
constants, rowType, groups);
}
@Override public RelOptCost com.hazelcast.com.uteSelfCost(RelOptPlanner planner,
RelMetadataQuery mq) {
return super.com.hazelcast.com.uteSelfCost(planner, mq)
.multiplyBy(BindableConvention.COST_MULTIPLIER);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new WindowNode(implementor.com.hazelcast.com.iler, this);
}
}
/**
* Rule to convert a {@link com.hazelcast.org.apache.calcite.rel.logical.LogicalWindow}
* to a {@link BindableWindow}.
*/
public static class BindableWindowRule extends ConverterRule {
/**
* Creates a BindableWindowRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableWindowRule(RelBuilderFactory relBuilderFactory) {
super(LogicalWindow.class, (Predicate) r -> true,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableWindowRule");
}
public RelNode convert(RelNode rel) {
final LogicalWindow winAgg = (LogicalWindow) rel;
final RelTraitSet traitSet =
winAgg.getTraitSet().replace(BindableConvention.INSTANCE);
final RelNode input = winAgg.getInput();
final RelNode convertedInput =
convert(input,
input.getTraitSet().replace(BindableConvention.INSTANCE));
return new BindableWindow(rel.getCluster(), traitSet, convertedInput,
winAgg.getConstants(), winAgg.getRowType(), winAgg.groups);
}
}
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Match}
* in bindable convention. */
public static class BindableMatch extends Match implements BindableRel {
/** Creates a BindableMatch. */
BindableMatch(RelOptCluster cluster, RelTraitSet traitSet, RelNode input,
RelDataType rowType, RexNode pattern, boolean strictStart,
boolean strictEnd, Map patternDefinitions,
Map measures, RexNode after,
Map> subsets, boolean allRows,
ImmutableBitSet partitionKeys, RelCollation orderKeys,
RexNode interval) {
super(cluster, traitSet, input, rowType, pattern, strictStart, strictEnd,
patternDefinitions, measures, after, subsets, allRows, partitionKeys,
orderKeys, interval);
}
@Override public RelNode copy(RelTraitSet traitSet, List inputs) {
return new BindableMatch(getCluster(), traitSet, inputs.get(0), rowType,
pattern, strictStart, strictEnd, patternDefinitions, measures, after,
subsets, allRows, partitionKeys, orderKeys, interval);
}
public Class getElementType() {
return Object[].class;
}
public Enumerable bind(DataContext dataContext) {
return help(dataContext, this);
}
public Node implement(InterpreterImplementor implementor) {
return new MatchNode(implementor.com.hazelcast.com.iler, this);
}
}
/**
* Rule to convert a {@link com.hazelcast.org.apache.calcite.rel.logical.LogicalMatch}
* to a {@link BindableMatch}.
*/
public static class BindableMatchRule extends ConverterRule {
/**
* Creates a BindableMatchRule.
*
* @param relBuilderFactory Builder for relational expressions
*/
public BindableMatchRule(RelBuilderFactory relBuilderFactory) {
super(LogicalMatch.class, (Predicate) r -> true,
Convention.NONE, BindableConvention.INSTANCE, relBuilderFactory,
"BindableMatchRule");
}
public RelNode convert(RelNode rel) {
final LogicalMatch match = (LogicalMatch) rel;
final RelTraitSet traitSet =
match.getTraitSet().replace(BindableConvention.INSTANCE);
final RelNode input = match.getInput();
final RelNode convertedInput =
convert(input,
input.getTraitSet().replace(BindableConvention.INSTANCE));
return new BindableMatch(rel.getCluster(), traitSet, convertedInput,
match.getRowType(), match.getPattern(), match.isStrictStart(),
match.isStrictEnd(), match.getPatternDefinitions(),
match.getMeasures(), match.getAfter(), match.getSubsets(),
match.isAllRows(), match.getPartitionKeys(), match.getOrderKeys(),
match.getInterval());
}
}
}