Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* 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.adapter.enumerable;
import com.hazelcast.org.apache.calcite.linq4j.tree.BlockBuilder;
import com.hazelcast.org.apache.calcite.linq4j.tree.Expression;
import com.hazelcast.org.apache.calcite.linq4j.tree.Expressions;
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.RelTraitSet;
import com.hazelcast.org.apache.calcite.rel.RelCollationTraitDef;
import com.hazelcast.org.apache.calcite.rel.RelNode;
import com.hazelcast.org.apache.calcite.rel.RelNodes;
import com.hazelcast.org.apache.calcite.rel.core.CorrelationId;
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.metadata.RelMdCollation;
import com.hazelcast.org.apache.calcite.rel.metadata.RelMdUtil;
import com.hazelcast.org.apache.calcite.rel.metadata.RelMetadataQuery;
import com.hazelcast.org.apache.calcite.rex.RexNode;
import com.hazelcast.org.apache.calcite.util.BuiltInMethod;
import com.hazelcast.com.google.com.hazelcast.com.on.collect.ImmutableList;
import java.util.Set;
/** Implementation of {@link com.hazelcast.org.apache.calcite.rel.core.Join} in
* {@link com.hazelcast.org.apache.calcite.adapter.enumerable.EnumerableConvention enumerable calling convention}
* that allows conditions that are not just {@code =} (equals). */
public class EnumerableNestedLoopJoin extends Join implements EnumerableRel {
/** Creates an EnumerableNestedLoopJoin. */
protected EnumerableNestedLoopJoin(RelOptCluster cluster, RelTraitSet traits,
RelNode left, RelNode right, RexNode condition,
Set variablesSet, JoinRelType joinType) {
super(cluster, traits, ImmutableList.of(), left, right, condition, variablesSet, joinType);
}
@Deprecated // to be removed before 2.0
protected EnumerableNestedLoopJoin(RelOptCluster cluster, RelTraitSet traits,
RelNode left, RelNode right, RexNode condition, JoinRelType joinType,
Set variablesStopped) {
this(cluster, traits, left, right, condition,
CorrelationId.setOf(variablesStopped), joinType);
}
@Override public EnumerableNestedLoopJoin copy(RelTraitSet traitSet,
RexNode condition, RelNode left, RelNode right, JoinRelType joinType,
boolean semiJoinDone) {
return new EnumerableNestedLoopJoin(getCluster(), traitSet, left, right,
condition, variablesSet, joinType);
}
/** Creates an EnumerableNestedLoopJoin. */
public static EnumerableNestedLoopJoin create(
RelNode left,
RelNode right,
RexNode condition,
Set variablesSet,
JoinRelType joinType) {
final RelOptCluster cluster = left.getCluster();
final RelMetadataQuery mq = cluster.getMetadataQuery();
final RelTraitSet traitSet =
cluster.traitSetOf(EnumerableConvention.INSTANCE)
.replaceIfs(RelCollationTraitDef.INSTANCE,
() -> RelMdCollation.enumerableNestedLoopJoin(mq, left, right, joinType));
return new EnumerableNestedLoopJoin(cluster, traitSet, left, right, condition,
variablesSet, joinType);
}
@Override public RelOptCost com.hazelcast.com.uteSelfCost(RelOptPlanner planner,
RelMetadataQuery mq) {
double rowCount = mq.getRowCount(this);
// Joins can be flipped, and for many algorithms, both versions are viable
// and have the same cost. To make the results stable between versions of
// the planner, make one of the versions slightly more expensive.
switch (joinType) {
case SEMI:
case ANTI:
// SEMI and ANTI join cannot be flipped
break;
case RIGHT:
rowCount = RelMdUtil.addEpsilon(rowCount);
break;
default:
if (RelNodes.COMPARATOR.com.hazelcast.com.are(left, right) > 0) {
rowCount = RelMdUtil.addEpsilon(rowCount);
}
}
final double rightRowCount = right.estimateRowCount(mq);
final double leftRowCount = left.estimateRowCount(mq);
if (Double.isInfinite(leftRowCount)) {
rowCount = leftRowCount;
}
if (Double.isInfinite(rightRowCount)) {
rowCount = rightRowCount;
}
RelOptCost cost = planner.getCostFactory().makeCost(rowCount, 0, 0);
// Give it some penalty
cost = cost.multiplyBy(10);
return cost;
}
public Result implement(EnumerableRelImplementor implementor, Prefer pref) {
final BlockBuilder builder = new BlockBuilder();
final Result leftResult =
implementor.visitChild(this, 0, (EnumerableRel) left, pref);
Expression leftExpression =
builder.append("left", leftResult.block);
final Result rightResult =
implementor.visitChild(this, 1, (EnumerableRel) right, pref);
Expression rightExpression =
builder.append("right", rightResult.block);
final PhysType physType =
PhysTypeImpl.of(implementor.getTypeFactory(),
getRowType(),
pref.preferArray());
final Expression predicate =
EnumUtils.generatePredicate(implementor, getCluster().getRexBuilder(), left, right,
leftResult.physType, rightResult.physType, condition);
return implementor.result(
physType,
builder.append(
Expressions.call(BuiltInMethod.NESTED_LOOP_JOIN.method,
leftExpression,
rightExpression,
predicate,
EnumUtils.joinSelector(joinType,
physType,
ImmutableList.of(leftResult.physType,
rightResult.physType)),
Expressions.constant(EnumUtils.toLinq4jJoinType(joinType))))
.toBlock());
}
}
