blob: 117136d83204a3971ee055eeb5acd40e661d8ba7 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
/*******************************************************************************
* Copyright (c) 2001, 2004 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
* Jens Lukowski/Innoopract - initial renaming/restructuring
*
*******************************************************************************/
package org.eclipse.wst.css.core.internal.contenttype;
/*
*
* A non-resizable class implementing the behavior of java.util.Stack, but
* directly for the <code> integer </code> primitive.
*/
import java.util.EmptyStackException;
public class IntStack {
private int[] list = null;
private int size = 0;
public IntStack() {
this(100);
}
public IntStack(int maxdepth) {
super();
list = new int[maxdepth];
initialize();
}
public void clear() {
initialize();
}
public boolean empty() {
return size == 0;
}
public int get(int slot) {
return list[slot];
}
private void initialize() {
for (int i = 0; i < list.length; i++)
list[i] = -1;
}
/**
* Returns the int at the top of the stack without removing it
*
* @return int at the top of this stack.
* @exception EmptyStackException
* when empty.
*/
public int peek() {
if (size == 0)
throw new EmptyStackException();
return list[size - 1];
}
/**
* Removes and returns the int at the top of the stack
*
* @return int at the top of this stack.
* @exception EmptyStackException
* when empty.
*/
public int pop() {
int value = peek();
list[size - 1] = -1;
size--;
return value;
}
/**
* Pushes an item onto the top of this stack.
*
* @param newValue -
* the int to be pushed onto this stack.
* @return the <code>newValue</code> argument.
*/
public int push(int newValue) {
if (size == list.length) {
throw new StackOverflowError();
}
list[size++] = newValue;
return newValue;
}
public int size() {
return list.length;
}
}
|
