All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.hazelcast.org.apache.calcite.interpreter.BindableConvention Maven / Gradle / Ivy

There is a newer version: 5.4.0
Show newest version
/*
 * 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 compliance with
 * the License.  You may obtain a copy of the License at
 *
 * http://www.apache.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.plan.Convention;
import com.hazelcast.org.apache.calcite.plan.ConventionTraitDef;
import com.hazelcast.org.apache.calcite.plan.RelOptPlanner;
import com.hazelcast.org.apache.calcite.plan.RelTrait;
import com.hazelcast.org.apache.calcite.plan.RelTraitDef;
import com.hazelcast.org.apache.calcite.plan.RelTraitSet;
import com.hazelcast.org.apache.calcite.rel.RelNode;

import com.hazelcast.org.checkerframework.checker.nullness.qual.Nullable;

/**
 * Calling convention that returns results as an
 * {@link com.hazelcast.org.apache.calcite.linq4j.Enumerable} of object arrays.
 *
 * 

The relational expression needs to implement * {@link com.hazelcast.org.apache.calcite.runtime.ArrayBindable}. * Unlike {@link com.hazelcast.org.apache.calcite.adapter.enumerable.EnumerableConvention}, * no code generation is required. */ public enum BindableConvention implements Convention { INSTANCE; /** Cost of a bindable node versus implementing an equivalent node in a * "typical" calling convention. */ public static final double COST_MULTIPLIER = 2.0d; @Override public String toString() { return getName(); } @Override public Class getInterface() { return BindableRel.class; } @Override public String getName() { return "BINDABLE"; } @Override public @Nullable RelNode enforce(RelNode input, RelTraitSet required) { return null; } @Override public RelTraitDef getTraitDef() { return ConventionTraitDef.INSTANCE; } @Override public boolean satisfies(RelTrait trait) { return this == trait; } @Override public void register(RelOptPlanner planner) {} @Override public boolean canConvertConvention(Convention toConvention) { return false; } @Override public boolean useAbstractConvertersForConversion(RelTraitSet fromTraits, RelTraitSet toTraits) { return false; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy