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

com.hazelcast.org.apache.calcite.rex.RexNode 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 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.rex;

import com.hazelcast.org.apache.calcite.config.CalciteSystemProperty;
import com.hazelcast.org.apache.calcite.rel.type.RelDataType;
import com.hazelcast.org.apache.calcite.sql.SqlKind;

import org.apiguardian.api.API;

import java.util.Collection;
import java.util.concurrent.atomic.AtomicInteger;

/**
 * Row expression.
 *
 * 

Every row-expression has a type. * (Compare with {@link com.hazelcast.org.apache.calcite.sql.SqlNode}, which is created before * validation, and therefore types may not be available.) * *

Some common row-expressions are: {@link RexLiteral} (constant value), * {@link RexVariable} (variable), {@link RexCall} (call to operator with * operands). Expressions are generally created using a {@link RexBuilder} * factory.

* *

All sub-classes of RexNode are immutable.

*/ public abstract class RexNode { /** * Sometimes RexCall nodes are located deep (e.g. inside Lists), * If the value is non-zero, then a non-normalized representation is printed. * int is used to allow for re-entrancy. */ private static final ThreadLocal DESCRIBE_WITHOUT_NORMALIZE = ThreadLocal.withInitial(AtomicInteger::new); /** Removes a Hook after use. */ @API(since = "1.22", status = API.Status.EXPERIMENTAL) public interface Closeable extends AutoCloseable { // override, removing "throws" @Override void close(); } private static final Closeable DECREMENT_ON_CLOSE = () -> { DESCRIBE_WITHOUT_NORMALIZE.get().decrementAndGet(); }; private static final Closeable EMPTY = () -> { }; /** * The digest of {@code RexNode} is normalized by default, however, sometimes a non-normalized * representation is required. * This API enables to skip normalization. * Note: the returned value must be closed, and the API is designed to be used with a * try-with-resources. * @param needNormalize true if normalization should be enabled or false if it should be skipped * @return a handle that should be closed to revert normalization state */ @API(since = "1.22", status = API.Status.EXPERIMENTAL) public static Closeable withNormalize(boolean needNormalize) { return needNormalize ? EMPTY : skipNormalize(); } /** * The digest of {@code RexNode} is normalized by default, however, sometimes a non-normalized * representation is required. * This API enables to skip normalization. * Note: the returned value must be closed, and the API is designed to be used with a * try-with-resources. * @return a handle that should be closed to revert normalization state */ @API(since = "1.22", status = API.Status.EXPERIMENTAL) public static Closeable skipNormalize() { DESCRIBE_WITHOUT_NORMALIZE.get().incrementAndGet(); return DECREMENT_ON_CLOSE; } /** * The digest of {@code RexNode} is normalized by default, however, sometimes a non-normalized * representation is required. * This method enables subclasses to identify if normalization is required. * @return true if the digest needs to be normalized */ @API(since = "1.22", status = API.Status.EXPERIMENTAL) protected static boolean needNormalize() { return DESCRIBE_WITHOUT_NORMALIZE.get().get() == 0 && CalciteSystemProperty.ENABLE_REX_DIGEST_NORMALIZE.value(); } //~ Instance fields -------------------------------------------------------- // Effectively final. Set in each sub-class constructor, and never re-set. protected String digest; //~ Methods ---------------------------------------------------------------- public abstract RelDataType getType(); /** * Returns whether this expression always returns true. (Such as if this * expression is equal to the literal TRUE.) */ public boolean isAlwaysTrue() { return false; } /** * Returns whether this expression always returns false. (Such as if this * expression is equal to the literal FALSE.) */ public boolean isAlwaysFalse() { return false; } public boolean isA(SqlKind kind) { return getKind() == kind; } public boolean isA(Collection kinds) { return getKind().belongsTo(kinds); } /** * Returns the kind of node this is. * * @return Node kind, never null */ public SqlKind getKind() { return SqlKind.OTHER; } public String toString() { return digest; } /** * Returns string representation of this node. * @return the same as {@link #toString()}, but without normalizing the output */ @API(since = "1.22", status = API.Status.EXPERIMENTAL) public String toStringRaw() { try (Closeable ignored = skipNormalize()) { return toString(); } } /** Returns the number of nodes in this expression. * *

Leaf nodes, such as {@link RexInputRef} or {@link RexLiteral}, have * a count of 1. Calls have a count of 1 plus the sum of their operands. * *

Node count is a measure of expression complexity that is used by some * planner rules to prevent deeply nested expressions. */ public int nodeCount() { return 1; } /** * Accepts a visitor, dispatching to the right overloaded * {@link RexVisitor#visitInputRef visitXxx} method. * *

Also see {@link RexUtil#apply(RexVisitor, java.util.List, RexNode)}, * which applies a visitor to several expressions simultaneously. */ public abstract R accept(RexVisitor visitor); /** * Accepts a visitor with a payload, dispatching to the right overloaded * {@link RexBiVisitor#visitInputRef(RexInputRef, Object)} visitXxx} method. */ public abstract R accept(RexBiVisitor visitor, P arg); /** {@inheritDoc} * *

Every node must implement {@link #equals} based on its content */ @Override public abstract boolean equals(Object obj); /** {@inheritDoc} * *

Every node must implement {@link #hashCode} consistent with * {@link #equals} */ @Override public abstract int hashCode(); }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy