41 lines
1.1 KiB
Java
41 lines
1.1 KiB
Java
package com.ibm.text.utility;
|
|
|
|
// =============================================================
|
|
// Simple stack mechanism, with push, pop and access
|
|
// =============================================================
|
|
|
|
public final class IntStack {
|
|
private int[] values;
|
|
private int top = 0;
|
|
|
|
public IntStack(int initialSize) {
|
|
values = new int[initialSize];
|
|
}
|
|
|
|
public void push(int value) {
|
|
if (top >= values.length) { // must grow?
|
|
int[] temp = new int[values.length*2];
|
|
System.arraycopy(values,0,temp,0,values.length);
|
|
values = temp;
|
|
}
|
|
values[top++] = value;
|
|
}
|
|
|
|
public int pop() {
|
|
if (top > 0) return values[--top];
|
|
throw new IllegalArgumentException("Stack underflow");
|
|
}
|
|
|
|
public int get(int index) {
|
|
if (0 <= index && index < top) return values[index];
|
|
throw new IllegalArgumentException("Stack index out of bounds");
|
|
}
|
|
|
|
public int getTop() {
|
|
return top;
|
|
}
|
|
|
|
public boolean isEmpty() {
|
|
return top == 0;
|
|
}
|
|
} |