org.eclipse.text.edits.TreeIterationInfo Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of aspectjtools Show documentation
Show all versions of aspectjtools Show documentation
AspectJ tools most notably contains the AspectJ compiler (AJC). AJC applies aspects to Java classes during
compilation, fully replacing Javac for plain Java classes and also compiling native AspectJ or annotation-based
@AspectJ syntax. Furthermore, AJC can weave aspects into existing class files in a post-compile binary weaving step.
This library is a superset of AspectJ weaver and hence also of AspectJ runtime.
/*******************************************************************************
* Copyright (c) 2000, 2006 IBM Corporation and others.
*
* This program and the accompanying materials
* are made available under the terms of the Eclipse Public License 2.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-2.0/
*
* SPDX-License-Identifier: EPL-2.0
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.text.edits;
import org.eclipse.core.runtime.Assert;
class TreeIterationInfo {
interface Visitor {
void visit(TextEdit edit);
}
private int fMark= -1;
private TextEdit[][] fEditStack= new TextEdit[10][];
private int[] fIndexStack= new int[10];
public int getSize() {
return fMark + 1;
}
public void push(TextEdit[] edits) {
if (++fMark == fEditStack.length) {
TextEdit[][] t1= new TextEdit[fEditStack.length * 2][];
System.arraycopy(fEditStack, 0, t1, 0, fEditStack.length);
fEditStack= t1;
int[] t2= new int[fEditStack.length];
System.arraycopy(fIndexStack, 0, t2, 0, fIndexStack.length);
fIndexStack= t2;
}
fEditStack[fMark]= edits;
fIndexStack[fMark]= -1;
}
public void setIndex(int index) {
fIndexStack[fMark]= index;
}
public void pop() {
fEditStack[fMark]= null;
fIndexStack[fMark]= -1;
fMark--;
}
public void accept(Visitor visitor) {
for (int i= fMark; i >= 0; i--) {
Assert.isTrue(fIndexStack[i] >= 0);
int start= fIndexStack[i] + 1;
TextEdit[] edits= fEditStack[i];
for (int s= start; s < edits.length; s++) {
visitor.visit(edits[s]);
}
}
}
}