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

org.apache.calcite.plan.RelCompositeTrait Maven / Gradle / Ivy

There is a newer version: 1.21.0.265
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 org.apache.calcite.plan;

import com.google.common.collect.ImmutableList;
import com.google.common.collect.Ordering;

import java.util.Arrays;
import java.util.List;
import java.util.Objects;

/**
 * A trait that consists of a list of traits, all of the same type.
 *
 * 

It exists so that multiple traits of the same type * ({@link org.apache.calcite.plan.RelTraitDef}) can be stored in the same * {@link org.apache.calcite.plan.RelTraitSet}. * * @param Member trait */ class RelCompositeTrait implements RelTrait { private final RelTraitDef traitDef; private final T[] traits; /** Creates a RelCompositeTrait. */ // Must remain private. Does not copy the array. private RelCompositeTrait(RelTraitDef traitDef, T[] traits) { this.traitDef = traitDef; this.traits = Objects.requireNonNull(traits); //noinspection unchecked assert Ordering.natural() .isStrictlyOrdered(Arrays.asList((Comparable[]) traits)) : Arrays.toString(traits); for (T trait : traits) { assert trait.getTraitDef() == this.traitDef; } } /** Creates a RelCompositeTrait. The constituent traits are canonized. */ @SuppressWarnings("unchecked") static RelTrait of(RelTraitDef def, List traitList) { final RelCompositeTrait compositeTrait; if (traitList.isEmpty()) { return def.getDefault(); } else if (traitList.size() == 1) { return def.canonize(traitList.get(0)); } else { final RelMultipleTrait[] traits = traitList.toArray(new RelMultipleTrait[0]); for (int i = 0; i < traits.length; i++) { traits[i] = (T) def.canonize(traits[i]); } compositeTrait = new RelCompositeTrait<>(def, (T[]) traits); } return def.canonize(compositeTrait); } public RelTraitDef getTraitDef() { return traitDef; } @Override public int hashCode() { return Arrays.hashCode(traits); } @Override public boolean equals(Object obj) { return this == obj || obj instanceof RelCompositeTrait && Arrays.equals(traits, ((RelCompositeTrait) obj).traits); } @Override public String toString() { return Arrays.toString(traits); } public boolean satisfies(RelTrait trait) { for (T t : traits) { if (t.satisfies(trait)) { return true; } } return false; } public void register(RelOptPlanner planner) { } /** Returns an immutable list of the traits in this composite trait. */ public List traitList() { return ImmutableList.copyOf(traits); } /** Returns the {@code i}th trait. */ public T trait(int i) { return traits[i]; } /** Returns the number of traits. */ public int size() { return traits.length; } } // End RelCompositeTrait.java





© 2015 - 2024 Weber Informatics LLC | Privacy Policy