| /* |
| * 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.parse; |
| |
| import java.sql.SQLException; |
| import java.util.Collections; |
| import java.util.List; |
| |
| import org.apache.phoenix.compile.ColumnResolver; |
| import org.apache.phoenix.exception.SQLExceptionCode; |
| import org.apache.phoenix.exception.SQLExceptionInfo; |
| |
| |
| |
| /** |
| * |
| * Node representing the IN literal list expression in SQL |
| * |
| * |
| * @since 0.1 |
| */ |
| public class InListParseNode extends CompoundParseNode { |
| private final boolean negate; |
| |
| InListParseNode(List<ParseNode> children, boolean negate) { |
| super(children); |
| // All values in the IN must be constant. First child is the LHS |
| for (int i = 1; i < children.size(); i++) { |
| ParseNode child = children.get(i); |
| if (!child.isStateless()) { |
| throw new ParseException(new SQLExceptionInfo.Builder(SQLExceptionCode.VALUE_IN_LIST_NOT_CONSTANT) |
| .build().buildException()); |
| } |
| } |
| this.negate = negate; |
| } |
| |
| public boolean isNegate() { |
| return negate; |
| } |
| |
| @Override |
| public <T> T accept(ParseNodeVisitor<T> visitor) throws SQLException { |
| List<T> l = Collections.emptyList(); |
| if (visitor.visitEnter(this)) { |
| l = acceptChildren(visitor); |
| } |
| return visitor.visitLeave(this, l); |
| } |
| |
| @Override |
| public int hashCode() { |
| final int prime = 31; |
| int result = super.hashCode(); |
| result = prime * result + (negate ? 1231 : 1237); |
| return result; |
| } |
| |
| @Override |
| public boolean equals(Object obj) { |
| if (this == obj) |
| return true; |
| if (!super.equals(obj)) |
| return false; |
| if (getClass() != obj.getClass()) |
| return false; |
| InListParseNode other = (InListParseNode) obj; |
| if (negate != other.negate) |
| return false; |
| return true; |
| } |
| |
| @Override |
| public void toSQL(ColumnResolver resolver, StringBuilder buf) { |
| List<ParseNode> children = getChildren(); |
| children.get(0).toSQL(resolver, buf); |
| buf.append(' '); |
| if (negate) buf.append("NOT "); |
| buf.append("IN"); |
| buf.append('('); |
| if (children.size() > 1) { |
| for (int i = 1; i < children.size(); i++) { |
| children.get(i).toSQL(resolver, buf); |
| buf.append(','); |
| } |
| buf.setLength(buf.length()-1); |
| } |
| buf.append(')'); |
| } |
| } |