1 /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
\r
3 * The contents of this file are subject to the Netscape Public
\r
4 * License Version 1.1 (the "License"); you may not use this file
\r
5 * except in compliance with the License. You may obtain a copy of
\r
6 * the License at http://www.mozilla.org/NPL/
\r
8 * Software distributed under the License is distributed on an "AS
\r
9 * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express oqr
\r
10 * implied. See the License for the specific language governing
\r
11 * rights and limitations under the License.
\r
13 * The Original Code is Rhino code, released
\r
16 * The Initial Developer of the Original Code is Netscape
\r
17 * Communications Corporation. Portions created by Netscape are
\r
18 * Copyright (C) 1997-1999 Netscape Communications Corporation. All
\r
25 * Alternatively, the contents of this file may be used under the
\r
26 * terms of the GNU Public License (the "GPL"), in which case the
\r
27 * provisions of the GPL are applicable instead of those above.
\r
28 * If you wish to allow use of your version of this file only
\r
29 * under the terms of the GPL and not to allow others to use your
\r
30 * version of this file under the NPL, indicate your decision by
\r
31 * deleting the provisions above and replace them with the notice
\r
32 * and other provisions required by the GPL. If you do not delete
\r
33 * the provisions above, a recipient may use your version of this
\r
34 * file under either the NPL or the GPL.
\r
37 package org.mozilla.javascript;
\r
39 import java.util.Stack;
\r
42 * This class implements a preorder tree iterator for the Node class.
\r
45 * @author Norris Boyd
\r
47 public class PreorderNodeIterator {
\r
48 public PreorderNodeIterator(Node n) {
\r
50 stack = new Stack();
\r
53 public Node currentNode() {
\r
57 public Node getCurrentParent() {
\r
58 return currentParent;
\r
61 public Node nextNode() {
\r
62 if (current == null)
\r
63 return current = start;
\r
64 if (current.first != null) {
\r
65 stack.push(current);
\r
66 currentParent = current;
\r
67 current = current.first;
\r
69 current = current.next;
\r
72 isEmpty = stack.isEmpty();
\r
73 if (isEmpty || current != null)
\r
75 current = (Node) stack.pop();
\r
76 current = current.next;
\r
78 currentParent = isEmpty ? null : (Node) stack.peek();
\r
83 public void replaceCurrent(Node newNode) {
\r
84 currentParent.replaceChild(current, newNode);
\r
89 private Node current;
\r
90 private Node currentParent;
\r
91 private Stack stack;
\r