/******************************************************************************* * Copyright (c) 2000, 2004 IBM Corporation and others. * All rights reserved. This program and the accompanying materials * are made available under the terms of the Common Public License v1.0 * which accompanies this distribution, and is available at * http://www.eclipse.org/legal/cpl-v10.html * * Contributors: * IBM Corporation - initial API and implementation *******************************************************************************/ package org.eclipse.jdt.internal.compiler.ast; import org.eclipse.jdt.internal.compiler.ASTVisitor; import org.eclipse.jdt.internal.compiler.lookup.*; public class PrefixExpression extends CompoundAssignment { /** * PrefixExpression constructor comment. * @param l org.eclipse.jdt.internal.compiler.ast.Expression * @param e org.eclipse.jdt.internal.compiler.ast.Expression * @param op int */ public PrefixExpression(Expression l, Expression e, int op, int pos) { super(l, e, op, l.sourceEnd); this.sourceStart = pos; this.sourceEnd = l.sourceEnd; } public String operatorToString() { switch (operator) { case PLUS : return "++"; //$NON-NLS-1$ case MINUS : return "--"; //$NON-NLS-1$ } return "unknown operator"; //$NON-NLS-1$ } public StringBuffer printExpressionNoParenthesis(int indent, StringBuffer output) { output.append(operatorToString()).append(' '); return lhs.printExpression(0, output); } public boolean restrainUsageToNumericTypes() { return true; } public void traverse(ASTVisitor visitor, BlockScope scope) { if (visitor.visit(this, scope)) { lhs.traverse(visitor, scope); } visitor.endVisit(this, scope); } }