com.googlecode.paradox.planner.nodes.join.ANDNode Maven / Gradle / Ivy

Go to download
/*
 * Copyright (c) 2009 Leonardo Alves da Costa
 *
 * This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
 * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any
 * later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without
 * even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
 * License for more details. You should have received a copy of the GNU General Public License along with this
 * program. If not, see .
 */
package com.googlecode.paradox.planner.nodes.join;

import com.googlecode.paradox.parser.ScannerPosition;
import com.googlecode.paradox.parser.nodes.AbstractConditionalNode;
import com.googlecode.paradox.parser.nodes.SQLNode;
import com.googlecode.paradox.planner.context.Context;
import com.googlecode.paradox.results.Column;

import java.sql.SQLException;
import java.util.List;

/**
 * Stores the AND node.
 *
 * @version 1.4
 * @since 1.1
 */
public class ANDNode extends AbstractJoinNode {

    /**
     * Create a new instance.
     *
     * @param child    the child node.
     * @param position the current Scanner position.
     */
    public ANDNode(final SQLNode child, final ScannerPosition position) {
        super("AND", child, position);
    }

    @Override
    public boolean evaluate(final Context context, final Object[] row, final List columnsLoaded)
            throws SQLException {

        for (final SQLNode node : children) {
            final AbstractConditionalNode conditionalNode = (AbstractConditionalNode) node;
            if (!conditionalNode.evaluate(context, row, columnsLoaded)) {
                return false;
            }
        }
        return true;
    }
}