/*******************************************************************************
 * Copyright (c) 2000, 2006 IBM Corporation and others.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 *     IBM Corporation - initial API and implementation
 * Port to the D programming language:
 *     Frank Benoit <benoit@tionex.de>
 *******************************************************************************/
module dwtx.text.edits.TreeIterationInfo;

import dwt.dwthelper.utils;

import dwtx.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 is 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]);
            }
        }
    }
}