forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathFastStack.java
More file actions
93 lines (83 loc) · 2.34 KB
/
FastStack.java
File metadata and controls
93 lines (83 loc) · 2.34 KB
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
package soot.util;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 1999 Patrice Pominville
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 2.1 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Lesser Public License for more details.
*
* You should have received a copy of the GNU General Lesser Public
* License along with this program. If not, see
* <http://www.gnu.org/licenses/lgpl-2.1.html>.
* #L%
*/
import java.util.ArrayList;
/**
* A fast, but simple stack implementation. Sadly, java's own stack implementation synchronizes and as such is a bit slower.
*
* Note that this implementation does not perform error checking, however, the original implementation would also have thrown
* an exception in case this implementation throws an exception. It's just that the exception text differs.
*
* @param <T>
* The elements of the stack
* @author Marc Miltenberger
*/
public class FastStack<T> extends ArrayList<T> {
private static final long serialVersionUID = 1L;
/**
* Creates a new stack
*/
public FastStack() {
}
/**
* Creates a new stack with the given initial size
*
* @param initialSize
* the initial size
*/
public FastStack(int initialSize) {
super(initialSize);
}
/**
* Returns the last item on the stack or throws an exception of there is none.
*
* @return the last item on the stack
*/
public T peek() {
return get(size() - 1);
}
/**
* Pushes an item onto the stack
*
* @param t
* the item
*/
public void push(T t) {
add(t);
}
/**
* Returns and removes the last item from the stack. Throws an exception of there is none.
*
* @return the last item on the stack, which got pop-ed.
*/
public T pop() {
return remove(size() - 1);
}
/**
* Returns true if and only if the stack is empty
*
* @return true if and only if the stack is empty
*/
public boolean empty() {
return size() == 0;
}
}