content: /*
   * 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.rel.logical;
  
  import org.apache.calcite.linq4j.function.Experimental;
  import org.apache.calcite.plan.Convention;
  import org.apache.calcite.plan.RelOptCluster;
  import org.apache.calcite.plan.RelOptTable;
  import org.apache.calcite.plan.RelTraitSet;
  import org.apache.calcite.rel.RelNode;
  import org.apache.calcite.rel.RelShuttle;
  import org.apache.calcite.rel.core.RepeatUnion;
  
  import org.checkerframework.checker.nullness.qual.Nullable;
  
  import java.util.List;
  
  /**
   * Sub-class of {@link org.apache.calcite.rel.core.RepeatUnion}
   * not targeted at any particular engine or calling convention.
   *
   * <p>NOTE: The current API is experimental and subject to change without
   * notice.
   */
  @Experimental
  public class LogicalRepeatUnion extends RepeatUnion {
  
    //~ Constructors -----------------------------------------------------------
    private LogicalRepeatUnion(RelOptCluster cluster, RelTraitSet traitSet,
        RelNode seed, RelNode iterative, boolean all, int iterationLimit,
        @Nullable RelOptTable transientTable) {
      super(cluster, traitSet, seed, iterative, all, iterationLimit, transientTable);
    }
  
    /** Creates a LogicalRepeatUnion. */
    public static LogicalRepeatUnion create(RelNode seed, RelNode iterative,
        boolean all, @Nullable RelOptTable transientTable) {
      return create(seed, iterative, all, -1, transientTable);
    }
  
    /** Creates a LogicalRepeatUnion. */
    public static LogicalRepeatUnion create(RelNode seed, RelNode iterative,
        boolean all, int iterationLimit, @Nullable RelOptTable transientTable) {
      RelOptCluster cluster = seed.getCluster();
      RelTraitSet traitSet = cluster.traitSetOf(Convention.NONE);
      return new LogicalRepeatUnion(cluster, traitSet, seed, iterative, all, iterationLimit,
          transientTable);
    }
  
    //~ Methods ----------------------------------------------------------------
  
    @Override public LogicalRepeatUnion copy(RelTraitSet traitSet,
        List<RelNode> inputs) {
      assert traitSet.containsIfApplicable(Convention.NONE);
      assert inputs.size() == 2;
      return new LogicalRepeatUnion(getCluster(), traitSet,
          inputs.get(0), inputs.get(1), all, iterationLimit, transientTable);
    }
  
    @Override public RelNode accept(RelShuttle shuttle) {
      return shuttle.visit(this);
    }
  
  }
  