![JAR search and dependency download from the Maven repository](/logo.png)
io.trino.sql.tree.LogicalExpression Maven / Gradle / Ivy
/*
* 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 io.trino.sql.tree;
import com.google.common.collect.ImmutableList;
import java.util.List;
import java.util.Objects;
import java.util.Optional;
import static com.google.common.base.Preconditions.checkArgument;
import static java.util.Objects.requireNonNull;
public class LogicalExpression
extends Expression
{
public enum Operator
{
AND, OR;
public Operator flip()
{
return switch (this) {
case AND -> OR;
case OR -> AND;
};
}
}
private final Operator operator;
private final List terms;
public LogicalExpression(Operator operator, List terms)
{
this(Optional.empty(), operator, terms);
}
public LogicalExpression(NodeLocation location, Operator operator, List terms)
{
this(Optional.of(location), operator, terms);
}
private LogicalExpression(Optional location, Operator operator, List terms)
{
super(location);
requireNonNull(operator, "operator is null");
checkArgument(terms.size() >= 2, "Expected at least 2 terms");
this.operator = operator;
this.terms = ImmutableList.copyOf(terms);
}
public Operator getOperator()
{
return operator;
}
public List getTerms()
{
return terms;
}
@Override
public R accept(AstVisitor visitor, C context)
{
return visitor.visitLogicalExpression(this, context);
}
@Override
public List extends Node> getChildren()
{
return terms;
}
public static LogicalExpression and(Expression left, Expression right)
{
return new LogicalExpression(Optional.empty(), Operator.AND, ImmutableList.of(left, right));
}
public static LogicalExpression or(Expression left, Expression right)
{
return new LogicalExpression(Optional.empty(), Operator.OR, ImmutableList.of(left, right));
}
@Override
public boolean equals(Object o)
{
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
LogicalExpression that = (LogicalExpression) o;
return operator == that.operator && Objects.equals(terms, that.terms);
}
@Override
public int hashCode()
{
return Objects.hash(operator, terms);
}
@Override
public boolean shallowEquals(Node other)
{
if (!sameClass(this, other)) {
return false;
}
return operator == ((LogicalExpression) other).operator;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy