/** * Copyright (C) 2014-2016 LinkedIn Corp. (pinot-core@linkedin.com) * * 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. */ package com.linkedin.pinot.pql.parsers.pql2.ast; import com.linkedin.pinot.common.request.FilterOperator; import com.linkedin.pinot.common.utils.request.FilterQueryTree; import com.linkedin.pinot.pql.parsers.Pql2CompilationException; import java.util.Collections; /** * AST for the BETWEEN PQL clause. */ public class BetweenPredicateAstNode extends PredicateAstNode { private String _identifier; @Override public void addChild(AstNode childNode) { if (childNode instanceof IdentifierAstNode) { IdentifierAstNode node = (IdentifierAstNode) childNode; _identifier = node.getName(); } else { super.addChild(childNode); } } public String getIdentifier() { return _identifier; } @Override public String toString() { return "BetweenPredicateAstNode{" + "_identifier='" + _identifier + '\'' + '}'; } @Override public FilterQueryTree buildFilterQueryTree() { if (getChildren().size() == 2) { try { LiteralAstNode left = (LiteralAstNode) getChildren().get(0); LiteralAstNode right = (LiteralAstNode) getChildren().get(1); return new FilterQueryTree(_identifier, Collections.singletonList("[" + left.getValueAsString() + "\t\t" + right.getValueAsString() + "]"), FilterOperator.RANGE, null); } catch (ClassCastException e) { throw new Pql2CompilationException("BETWEEN clause was expecting two literal AST nodes, got " + getChildren().get(0) + " and " + getChildren().get(1)); } } else { throw new Pql2CompilationException("BETWEEN clause does not have two children nodes"); } } }