com.bigdata.rdf.sparql.ast.HavingNode Maven / Gradle / Ivy

Go to download
/**

Copyright (C) SYSTAP, LLC DBA Blazegraph 2006-2016.  All rights reserved.

Contact:
     SYSTAP, LLC DBA Blazegraph
     2501 Calvert ST NW #106
     Washington, DC 20008
     [email protected]

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; version 2 of the License.

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, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/
/*
 * Created on Aug 17, 2011
 */

package com.bigdata.rdf.sparql.ast;

import java.util.Map;

import com.bigdata.bop.BOp;
import com.bigdata.bop.IConstraint;
import com.bigdata.rdf.internal.constraints.SPARQLConstraint;
import com.bigdata.rdf.internal.impl.literal.XSDBooleanIV;
import com.bigdata.rdf.model.BigdataLiteral;

/**
 * AST node for a HAVING clause.
 * 
 * @author Bryan Thompson
 * @version $Id$
 * 
 *          TODO Implement {@link IValueExpressionMetadata} so we can report the
 *          aggregated variables across the filters which need to be
 *          materialized?
 */
public class HavingNode extends
        ValueExpressionListBaseNode {

    /**
     * 
     */
    private static final long serialVersionUID = 1L;

    /**
     * 
     */
    public HavingNode() {
    }

    /**
     * Deep copy constructor.
     */
    public HavingNode(final HavingNode op) {

        super(op);

    }

    /**
     * Shallow copy constructor.
     */
    public HavingNode(final BOp[] args, final Map anns) {

        super(args, anns);

    }
    
    /**
     * Return the {@link IConstraint}s for this {@link HavingNode}.
     */
    public IConstraint[] getConstraints() {

        final IConstraint[] exprs = new IConstraint[size()];

        int i = 0;

        for (IValueExpressionNode node : this) {

            exprs[i++] = new SPARQLConstraint>(
                    node.getRequiredValueExpression());

        }

        return exprs;

    }

    public String toString(final int indent) {

        final StringBuilder sb = new StringBuilder();

        sb.append("\n").append(indent(indent)).append("having");

        for (IValueExpressionNode v : this) {

            sb.append(" ");
            
            sb.append(v);
            
        }

        return sb.toString();

    }

}