org.sonar.java.model.expression.BinaryExpressionTreeImpl Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of java-squid Show documentation
The newest version!
/*
 * SonarQube Java
 * Copyright (C) 2012 SonarSource
 * [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.java.model.expression;

import com.google.common.base.Preconditions;
import com.google.common.collect.Iterators;
import com.sonar.sslr.api.AstNode;
import org.sonar.java.model.AbstractTypedTree;
import org.sonar.java.model.InternalSyntaxToken;
import org.sonar.plugins.java.api.tree.BinaryExpressionTree;
import org.sonar.plugins.java.api.tree.ExpressionTree;
import org.sonar.plugins.java.api.tree.SyntaxToken;
import org.sonar.plugins.java.api.tree.Tree;
import org.sonar.plugins.java.api.tree.TreeVisitor;

import java.util.Iterator;

public class BinaryExpressionTreeImpl extends AbstractTypedTree implements BinaryExpressionTree {

  private final Kind kind;

  private final ExpressionTree leftOperand;
  private final InternalSyntaxToken operator;
  private final ExpressionTree rightOperand;

  public BinaryExpressionTreeImpl(Kind kind, ExpressionTree leftOperand, InternalSyntaxToken operator, ExpressionTree rightOperand) {
    super(kind);
    this.kind = Preconditions.checkNotNull(kind);
    this.leftOperand = Preconditions.checkNotNull(leftOperand);
    this.operator = operator;
    this.rightOperand = Preconditions.checkNotNull(rightOperand);

    addChild((AstNode) leftOperand);
    addChild(operator);
    addChild((AstNode) rightOperand);
  }

  public BinaryExpressionTreeImpl(AstNode astNode, ExpressionTree leftOperand, Kind kind, ExpressionTree rightOperand) {
    super(astNode);
    this.kind = Preconditions.checkNotNull(kind);
    this.leftOperand = Preconditions.checkNotNull(leftOperand);
    this.operator = InternalSyntaxToken.createLegacy(super.getAstNode());
    this.rightOperand = Preconditions.checkNotNull(rightOperand);
  }

  @Override
  public ExpressionTree leftOperand() {
    return leftOperand;
  }

  @Override
  public SyntaxToken operatorToken() {
    return operator;
  }

  @Override
  public ExpressionTree rightOperand() {
    return rightOperand;
  }

  @Override
  public Kind getKind() {
    return kind;
  }

  @Override
  public void accept(TreeVisitor visitor) {
    visitor.visitBinaryExpression(this);
  }

  @Override
  public AstNode getAstNode() {
    // TODO Dinesh: Do not override at all

    // TODO(Godin): provides behavioral compatibility, because this method used by AnonymousClassesTooBigCheck, but should not
    if (isLegacy()) {
      return super.getAstNode().getParent();
    } else {
      return super.getAstNode();
    }
  }

  @Override
  public int getLine() {
    return getAstNode().getTokenLine();
  }

  @Override
  public Iterator childrenIterator() {
    return Iterators.forArray(
      leftOperand,
      rightOperand);
  }

}