/**
* Copyright 2011-2013 Akiban Technologies, Inc.
*
* Licensed 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.
*/
/* The original from which this derives bore the following: */
/*
Derby - Class org.apache.derby.impl.sql.compile.InListOperatorNode
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 com.akiban.sql.parser;
import com.akiban.sql.StandardException;
/**
* An InListOperatorNode represents an IN list.
*
*/
public final class InListOperatorNode extends ValueNode
{
protected RowConstructorNode leftOperand;
protected RowConstructorNode rightOperandList;
protected boolean negated;
/**
* Initializer for a InListOperatorNode
*
* @param leftOperand The left operand of the node
* @param rightOperandList The right operand list of the node
*/
@Override
public void init(Object leftOperand, Object rightOperandList) throws StandardException
{
if (leftOperand instanceof RowConstructorNode)
this.leftOperand = (RowConstructorNode) leftOperand;
else
{
// if left operand is not a RowConstructorNode
// but soemthing else, wrap it in a one-element RowConstructorNode (1 column)
ValueNodeList list = (ValueNodeList)getNodeFactory().getNode(NodeTypes.VALUE_NODE_LIST,
getParserContext());
list.addValueNode((ValueNode)leftOperand);
this.leftOperand = (RowConstructorNode)
getNodeFactory().getNode(NodeTypes.ROW_CTOR_NODE,
list,
new int[]{0},
getParserContext());
}
this.rightOperandList = (RowConstructorNode) rightOperandList;
}
/**
* Fill this node with a deep copy of the given node.
*/
@Override
public void copyFrom(QueryTreeNode node) throws StandardException
{
super.copyFrom(node);
InListOperatorNode other = (InListOperatorNode) node;
this.leftOperand = (RowConstructorNode) getNodeFactory().copyNode(other.leftOperand, getParserContext());
this.rightOperandList = (RowConstructorNode) getNodeFactory().copyNode(other.rightOperandList, getParserContext());
}
/**
* Convert this object to a String. See comments in QueryTreeNode.java
* for how this should be done for tree printing.
*
* @return This object as a String
*/
@Override
public String toString()
{
return "operator: " + (negated ? "NOT " : "") + "IN\n"
+ "methodName: in\n"
+ super.toString();
}
/**
* Prints the sub-nodes of this object. See QueryTreeNode.java for
* how tree printing is supposed to work.
*
* @param depth The depth of this node in the tree
*/
public void printSubNodes(int depth)
{
super.printSubNodes(depth);
if (leftOperand != null)
{
printLabel(depth, "leftOperand: ");
leftOperand.treePrint(depth + 1);
}
if (rightOperandList != null)
{
printLabel(depth, "rightOperandList: ");
rightOperandList.treePrint(depth + 1);
}
}
/**
* Set the leftOperand to the specified ValueNode
*
* @param newLeftOperand The new leftOperand
*/
public void setLeftOperand(RowConstructorNode newLeftOperand)
{
leftOperand = newLeftOperand;
}
/**
* Get the leftOperand
*
* @return The current leftOperand.
*/
public RowConstructorNode getLeftOperand()
{
return leftOperand;
}
/**
* Set the rightOperandList to the specified ValueNodeList
*
* @param newRightOperandList The new rightOperandList
*
*/
public void setRightOperandList(RowConstructorNode newRightOperandList)
{
rightOperandList = newRightOperandList;
}
/**
* Get the rightOperandList
*
* @return The current rightOperandList.
*/
public RowConstructorNode getRightOperandList()
{
return rightOperandList;
}
/**
* Return whether or not this expression tree represents a constant expression.
*
* @return Whether or not this expression tree represents a constant expression.
*/
@Override
public boolean isConstantExpression()
{
return (leftOperand.isConstantExpression()
&& rightOperandList.isConstantExpression());
}
/**
* Accept the visitor for all visitable children of this node.
*
* @param v the visitor
*
* @exception StandardException on error
*/
void acceptChildren(Visitor v) throws StandardException
{
super.acceptChildren(v);
if (leftOperand != null)
{
leftOperand = (RowConstructorNode) leftOperand.accept(v);
}
if (rightOperandList != null)
{
rightOperandList = (RowConstructorNode) rightOperandList.accept(v);
}
}
/**
* @inheritDoc
*/
protected boolean isEquivalent(ValueNode o) throws StandardException
{
if (!isSameNodeType(o))
{
return false;
}
InListOperatorNode other = (InListOperatorNode) o;
if (!leftOperand.isEquivalent(other.getLeftOperand())
|| !rightOperandList.isEquivalent(other.rightOperandList))
return false;
return true;
}
public boolean isNegated() {
return negated;
}
public void setNegated(boolean negated) {
this.negated = negated;
}
}