Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
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.pig.newplan.logical.rules;
A boolean expression with multiple children vs. the usual binary boolean expression.
    enum DNFExpressionType {
        AND, OR
    }
    final DNFExpressionType type;
    DNFExpression(String nameOperatorPlan planDNFExpressionType type) {
        super(nameplan);
        this. = type;
    }
    @Override
    public void accept(PlanVisitor vthrows FrontendException {
        throw new FrontendException(
                        "DNF expression does not accept any visitor");
    }
    @Override
    public boolean isEqual(Operator other) {
        if (other != null && other instanceof DNFExpression) {
            DNFExpression otherexp = (DNFExpressionother;
            if ( != otherexp.typereturn false;
            try {
                // this equality check is too strong: it does not allow for permutations;
                // should be improved in the future
                List<OperatorthisChildren = .getSuccessors(this), thatChildren = .getSuccessors(otherexp);
                if (thisChildren == null && thatChildren == nullreturn true;
                else if (thisChildren == null || thatChildren == nullreturn false;
                else {
                    if (thisChildren.size() != thatChildren.size())
                        return false;
                    for (int i = 0; i < thisChildren.size(); i++) {
                        if (!thisChildren.get(i).isEqual(
                                        thatChildren.get(i)))
                            return false;
                    }
                }
            }
            catch (FrontendException e) {
                throw new RuntimeException(e);
            }
            return true;
        }
        else {
            return false;
        }
    }
    @Override
                    throws FrontendException {
        if ( != nullreturn ;
         = new LogicalSchema.LogicalFieldSchema(nullnull,
                        .);
        .stampFieldSchema();
        return ;
    }
    
    @Override
    public LogicalExpression deepCopy(LogicalExpressionPlan lgExpPlanthrows FrontendException {
        throw new FrontendException("Deepcopy not expected");
    }
New to GrepCode? Check out our FAQ X