How to use

toString

method

in

org.eclipse.jdt.core.dom.InfixExpression$Operator

public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.fBuffer.append(' '); // for cases like x= i - -1; or x= i++ + ++i;
  this.fBuffer.append(node.getOperator().toString());
  this.fBuffer.append(' ');
  node.getRightOperand().accept(this);
  final List extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.fBuffer.append(' ');
    for (Iterator it = extendedOperands.iterator(); it.hasNext(); ) {
      this.fBuffer.append(node.getOperator().toString()).append(' ');
      Expression e = (Expression) it.next();
      e.accept(this);
    }
  }
  return false;
}

public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.buffer.append(' ');  // for cases like x= i - -1; or x= i++ + ++i;
  this.buffer.append(node.getOperator().toString());
  this.buffer.append(' ');
  node.getRightOperand().accept(this);
  final List extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.buffer.append(' ');
    for (Iterator it = extendedOperands.iterator(); it.hasNext(); ) {
      this.buffer.append(node.getOperator().toString()).append(' ');
      Expression e = (Expression) it.next();
      e.accept(this);
    }
  }
  return false;
}

@Override
public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.buffer.append(' ');  // for cases like x= i - -1; or x= i++ + ++i;
  this.buffer.append(node.getOperator().toString());
  this.buffer.append(' ');
  node.getRightOperand().accept(this);
  final List extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.buffer.append(' ');
    for (Iterator it = extendedOperands.iterator(); it.hasNext(); ) {
      this.buffer.append(node.getOperator().toString()).append(' ');
      Expression e = (Expression) it.next();
      e.accept(this);
    }
  }
  return false;
}

} else if (node instanceof InfixExpression) {
  InfixExpression infixExpression= (InfixExpression)node;
  label= Messages.format(CorrectionMessages.LocalCorrectionsSubProcessor_setparenteses_description, infixExpression.getOperator().toString());
} else if (node instanceof ConditionalExpression) {
  label= CorrectionMessages.AdvancedQuickAssistProcessor_putConditionalExpressionInParentheses;

while (this.tm.get(indexBefore).isComment())
  indexBefore--;
assert node.getOperator().toString().equals(this.tm.toString(indexBefore));
int indexAfter = this.tm.firstIndexIn(operand, -1);
this.wrapIndexes.add(this.options.wrap_before_binary_operator ? indexBefore : indexAfter);

public boolean visit(InfixExpression node) {
  CSExpression left = mapExpression(node.getLeftOperand());
  CSExpression right = mapExpression(node.getRightOperand());
  String type = node.getLeftOperand().resolveTypeBinding().getQualifiedName();
  if (node.getOperator() == InfixExpression.Operator.RIGHT_SHIFT_UNSIGNED) {
    if (type.equals ("byte")) {
      pushExpression(new CSInfixExpression(">>", left, right));
    } else {
      CSExpression cast = new CSCastExpression (new CSTypeReference ("u" + type), left);
      cast = new CSParenthesizedExpression (cast);
      CSExpression shiftResult = new CSInfixExpression(">>", cast, right);
      shiftResult = new CSParenthesizedExpression (shiftResult);
      pushExpression(new CSCastExpression (new CSTypeReference (type), shiftResult));
    }
    return false;
  }
  if (type.equals("byte") && (node.getOperator() == InfixExpression.Operator.LESS || node.getOperator() == InfixExpression.Operator.LESS_EQUALS)) {
    left = new CSCastExpression (new CSTypeReference ("sbyte"), left);
    left = new CSParenthesizedExpression (left);
  }
  String operator = node.getOperator().toString();
  pushExpression(new CSInfixExpression(operator, left, right));
  pushExtendedOperands(operator, node);
  return false;
}

@Override
public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.fBuffer.append(' '); // for cases like x= i - -1; or x= i++ + ++i;
  this.fBuffer.append(node.getOperator().toString());
  this.fBuffer.append(' ');
  node.getRightOperand().accept(this);
  final List<Expression>extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.fBuffer.append(' ');
    for (Iterator<Expression> it = extendedOperands.iterator(); it.hasNext(); ) {
      this.fBuffer.append(node.getOperator().toString()).append(' ');
      Expression e = it.next();
      e.accept(this);
    }
  }
  return false;
}

public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.buffer.append(' ');  // for cases like x= i - -1; or x= i++ + ++i;
  this.buffer.append(node.getOperator().toString());
  this.buffer.append(' ');
  node.getRightOperand().accept(this);
  final List extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.buffer.append(' ');
    for (Iterator it = extendedOperands.iterator(); it.hasNext(); ) {
      this.buffer.append(node.getOperator().toString()).append(' ');
      Expression e = (Expression) it.next();
      e.accept(this);
    }
  }
  return false;
}

public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.buffer.append(' ');  // for cases like x= i - -1; or x= i++ + ++i;
  this.buffer.append(node.getOperator().toString());
  this.buffer.append(' ');
  node.getRightOperand().accept(this);
  final List extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.buffer.append(' ');
    for (Iterator it = extendedOperands.iterator(); it.hasNext(); ) {
      this.buffer.append(node.getOperator().toString()).append(' ');
      Expression e = (Expression) it.next();
      e.accept(this);
    }
  }
  return false;
}

public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.buffer.append(' ');  // for cases like x= i - -1; or x= i++ + ++i;
  this.buffer.append(node.getOperator().toString());
  this.buffer.append(' ');
  node.getRightOperand().accept(this);
  final List extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.buffer.append(' ');
    for (Iterator it = extendedOperands.iterator(); it.hasNext(); ) {
      this.buffer.append(node.getOperator().toString()).append(' ');
      Expression e = (Expression) it.next();
      e.accept(this);
    }
  }
  return false;
}

public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.buffer.append(' ');  // for cases like x= i - -1; or x= i++ + ++i;
  this.buffer.append(node.getOperator().toString());
  this.buffer.append(' ');
  node.getRightOperand().accept(this);
  final List extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.buffer.append(' ');
    for (Iterator it = extendedOperands.iterator(); it.hasNext(); ) {
      this.buffer.append(node.getOperator().toString()).append(' ');
      Expression e = (Expression) it.next();
      e.accept(this);
    }
  }
  return false;
}

@Override
public boolean visit(InfixExpression node) {
  node.getLeftOperand().accept(this);
  this.fBuffer.append(' '); // for cases like x= i - -1; or x= i++ + ++i;
  this.fBuffer.append(node.getOperator().toString());
  this.fBuffer.append(' ');
  node.getRightOperand().accept(this);
  final List<Expression>extendedOperands = node.extendedOperands();
  if (extendedOperands.size() != 0) {
    this.fBuffer.append(' ');
    for (Iterator<Expression> it = extendedOperands.iterator(); it.hasNext(); ) {
      this.fBuffer.append(node.getOperator().toString()).append(' ');
      Expression e = it.next();
      e.accept(this);
    }
  }
  return false;
}

protected String getLabel(ASTNode n) {
  if (n instanceof Name) return ((Name) n).getFullyQualifiedName();
  if (n instanceof Type) return n.toString();
  if (n instanceof Modifier) return n.toString();
  if (n instanceof StringLiteral) return ((StringLiteral) n).getEscapedValue();
  if (n instanceof NumberLiteral) return ((NumberLiteral) n).getToken();
  if (n instanceof CharacterLiteral) return ((CharacterLiteral) n).getEscapedValue();
  if (n instanceof BooleanLiteral) return ((BooleanLiteral) n).toString();
  if (n instanceof InfixExpression) return ((InfixExpression) n).getOperator().toString();
  if (n instanceof PrefixExpression) return ((PrefixExpression) n).getOperator().toString();
  if (n instanceof PostfixExpression) return ((PostfixExpression) n).getOperator().toString();
  if (n instanceof Assignment) return ((Assignment) n).getOperator().toString();
  if (n instanceof TextElement) return n.toString();
  if (n instanceof TagElement) return ((TagElement) n).getTagName();
  if (n instanceof TypeDeclaration) return ((TypeDeclaration) n).isInterface() ? "interface" : "class";
  return "";
}

protected String getLabel(ASTNode n) {
  if (n instanceof Name) return ((Name) n).getFullyQualifiedName();
  if (n instanceof Type) return n.toString();
  if (n instanceof Modifier) return n.toString();
  if (n instanceof StringLiteral) return ((StringLiteral) n).getEscapedValue();
  if (n instanceof NumberLiteral) return ((NumberLiteral) n).getToken();
  if (n instanceof CharacterLiteral) return ((CharacterLiteral) n).getEscapedValue();
  if (n instanceof BooleanLiteral) return ((BooleanLiteral) n).toString();
  if (n instanceof InfixExpression) return ((InfixExpression) n).getOperator().toString();
  if (n instanceof PrefixExpression) return ((PrefixExpression) n).getOperator().toString();
  if (n instanceof PostfixExpression) return ((PostfixExpression) n).getOperator().toString();
  if (n instanceof Assignment) return ((Assignment) n).getOperator().toString();
  if (n instanceof TextElement) return n.toString();
  if (n instanceof TagElement) return ((TagElement) n).getTagName();
  return "";
}

public boolean visit(InfixExpression node) {
  infixOperators.add(node.getOperator().toString());
  return super.visit(node);
}

@Override
public boolean visit(InfixExpression node) {
  String operator = node.getOperator().toString();
  handleOperator(operator, node.getRightOperand(), this.options.insert_space_before_binary_operator,
      this.options.insert_space_after_binary_operator);
  List<Expression> extendedOperands = node.extendedOperands();
  for (Expression operand : extendedOperands) {
    handleOperator(operator, operand, this.options.insert_space_before_binary_operator,
        this.options.insert_space_after_binary_operator);
  }
  return true;
}

@Override
public boolean visit(InfixExpression node) {
  String operator = node.getOperator().toString();
  handleOperator(operator, node.getRightOperand(), this.options.insert_space_before_binary_operator,
      this.options.insert_space_after_binary_operator);
  List<Expression> extendedOperands = node.extendedOperands();
  for (Expression operand : extendedOperands) {
    handleOperator(operator, operand, this.options.insert_space_before_binary_operator,
        this.options.insert_space_after_binary_operator);
  }
  return true;
}

@Override
public boolean visit(InfixExpression node) {
  String operator = node.getOperator().toString();
  handleOperator(operator, node.getRightOperand(), this.options.insert_space_before_binary_operator,
      this.options.insert_space_after_binary_operator);
  List<Expression> extendedOperands = node.extendedOperands();
  for (Expression operand : extendedOperands) {
    handleOperator(operator, operand, this.options.insert_space_before_binary_operator,
        this.options.insert_space_after_binary_operator);
  }
  return true;
}

public boolean visit(InfixExpression node) {
  
  IValue operator = values.string(node.getOperator().toString());
  IValue leftSide = visitChild(node.getLeftOperand());
  IValue rightSide = visitChild(node.getRightOperand());
  
  IValue intermediateExpression = constructExpressionNode("infix", leftSide, operator, rightSide);
  for (Iterator it = node.extendedOperands().iterator(); it.hasNext();) {
    Expression e = (Expression) it.next();
    intermediateExpression = constructExpressionNode("infix", intermediateExpression, operator, visitChild(e));
  }
  
  ownValue = intermediateExpression;
  
  return false;
}

@Override
public boolean visit(InfixExpression node) {
  String operator = node.getOperator().toString();
  handleOperator(operator, node.getRightOperand(), this.options.insert_space_before_binary_operator,
      this.options.insert_space_after_binary_operator);
  List<Expression> extendedOperands = node.extendedOperands();
  for (Expression operand : extendedOperands) {
    handleOperator(operator, operand, this.options.insert_space_before_binary_operator,
        this.options.insert_space_after_binary_operator);
  }
  return true;
}