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

org.apache.phoenix.expression.AndOrExpression Maven / Gradle / Ivy

The 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.phoenix.expression;

import java.util.BitSet;
import java.util.List;

import org.apache.hadoop.hbase.io.ImmutableBytesWritable;
import org.apache.phoenix.schema.types.PBoolean;
import org.apache.phoenix.schema.types.PDataType;
import org.apache.phoenix.schema.tuple.Tuple;
import org.apache.phoenix.util.ByteUtil;

/**
 * 
 * Abstract expression implementation for compound AND and OR expressions
 *
 * 
 * @since 0.1
 */
public abstract class AndOrExpression extends BaseCompoundExpression {
    // Remember evaluation of child expression for partial evaluation
    private BitSet partialEvalState;
    // true if we have seen NULL as the value of some child expression
    private boolean seenNull = false;
   
    public AndOrExpression() {
    }
    
    public AndOrExpression(List children) {
        super(children);
    }
    
    @Override
    public PDataType getDataType() {
        return PBoolean.INSTANCE;
    }

    @Override
    public void reset() {
        if (partialEvalState == null) {
            partialEvalState = new BitSet(children.size());
        } else {
            partialEvalState.clear();
        }
        seenNull = false;
        super.reset();
    }
    
    @Override
    public boolean evaluate(Tuple tuple, ImmutableBytesWritable ptr) {
        boolean childFailed = false;
        for (int i = 0; i < children.size(); i++) {
            // If partial state is available, then use that to know we've already evaluated this
            // child expression and do not need to do so again.
            if (partialEvalState == null || !partialEvalState.get(i)) {
                Expression child = children.get(i);
                // Call through to child evaluate method matching parent call to allow child to optimize
                // evaluate versus getValue code path.
                if (child.evaluate(tuple, ptr)) {
                    // Short circuit if we see our stop value
                    if (isStopValue((Boolean) PBoolean.INSTANCE.toObject(ptr, child.getDataType()))) {
                        return true;
                    }
                    if (ptr.getLength() == 0) {
                        seenNull = true;
                    }
                    if (partialEvalState != null) {
                        partialEvalState.set(i);
                    }
                } else {
                    childFailed = true;
                }
            }
        }
        if (childFailed) {
            return false;
        }

        if (seenNull) {
            // Some child evaluated to NULL and we never saw a stop value.
            // The expression evaluates as NULL even if the last child evaluated was non-NULL.
            ptr.set(ByteUtil.EMPTY_BYTE_ARRAY);
        }
        return true;
    }

    protected abstract boolean isStopValue(Boolean value);
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy