MergeNotMatchedClause.java

// 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.doris.nereids.trees.plans.commands.merge;

import org.apache.doris.nereids.trees.expressions.Expression;
import org.apache.doris.nereids.trees.expressions.NamedExpression;
import org.apache.doris.nereids.util.Utils;

import java.util.List;
import java.util.Objects;
import java.util.Optional;

/**
 * not matched clause for merge into.
 */
public class MergeNotMatchedClause {

    private final Optional<Expression> casePredicate;
    private final List<String> colNames;
    private final List<NamedExpression> row;

    public MergeNotMatchedClause(Optional<Expression> casePredicate,
            List<String> colNames, List<NamedExpression> row) {
        this.casePredicate = Objects.requireNonNull(casePredicate, "casePredicate should not be null");
        this.colNames = Utils.fastToImmutableList(Objects.requireNonNull(colNames, "colNames should not be null"));
        this.row = Utils.fastToImmutableList(Objects.requireNonNull(row, "row should not be null"));
    }

    public Optional<Expression> getCasePredicate() {
        return casePredicate;
    }

    public List<String> getColNames() {
        return colNames;
    }

    public List<NamedExpression> getRow() {
        return row;
    }
}