org.sonar.javascript.model.implementations.expression.BinaryExpressionTreeImpl Maven / Gradle / Ivy
The newest version!
/*
* SonarQube JavaScript Plugin
* Copyright (C) 2011 SonarSource and Eriks Nukis
* [email protected]
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or (at your option) any later version.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02
*/
package org.sonar.javascript.model.implementations.expression;
import com.google.common.base.Preconditions;
import com.google.common.collect.Iterators;
import com.sonar.sslr.api.AstNode;
import org.sonar.javascript.ast.visitors.TreeVisitor;
import org.sonar.javascript.model.implementations.JavaScriptTree;
import org.sonar.javascript.model.implementations.lexical.InternalSyntaxToken;
import org.sonar.javascript.model.interfaces.Tree;
import org.sonar.javascript.model.interfaces.expression.BinaryExpressionTree;
import org.sonar.javascript.model.interfaces.expression.ExpressionTree;
import org.sonar.javascript.model.interfaces.lexical.SyntaxToken;
import java.util.Iterator;
public class BinaryExpressionTreeImpl extends JavaScriptTree implements BinaryExpressionTree {
private final ExpressionTree leftOperand;
private final SyntaxToken operand;
private final ExpressionTree rightOperand;
private final Kind kind;
public BinaryExpressionTreeImpl(Kind kind, ExpressionTree leftOperand, InternalSyntaxToken operand, ExpressionTree rightOperand) {
super(kind);
this.leftOperand = Preconditions.checkNotNull(leftOperand);
this.operand = operand;
this.rightOperand = Preconditions.checkNotNull(rightOperand);
this.kind = Preconditions.checkNotNull(kind);
addChildren((AstNode) leftOperand, operand, (AstNode) rightOperand);
}
@Override
public ExpressionTree leftOperand() {
return leftOperand;
}
@Override
public SyntaxToken operator() {
return operand;
}
@Override
public ExpressionTree rightOperand() {
return rightOperand;
}
@Override
public Kind getKind() {
return kind;
}
@Override
public Iterator childrenIterator() {
return Iterators.forArray(leftOperand, rightOperand);
}
@Override
public void accept(TreeVisitor visitor) {
visitor.visitBinaryExpression(this);
}
}