43 |
|
* Deque<Integer> stack = new ArrayDeque<Integer>();}</pre> |
44 |
|
* |
45 |
|
* @author Jonathan Payne |
46 |
– |
* @version %I%, %G% |
46 |
|
* @since JDK1.0 |
47 |
|
*/ |
48 |
|
public |
64 |
|
* @see java.util.Vector#addElement |
65 |
|
*/ |
66 |
|
public E push(E item) { |
67 |
< |
addElement(item); |
67 |
> |
addElement(item); |
68 |
|
|
69 |
< |
return item; |
69 |
> |
return item; |
70 |
|
} |
71 |
|
|
72 |
|
/** |
78 |
|
* @exception EmptyStackException if this stack is empty. |
79 |
|
*/ |
80 |
|
public synchronized E pop() { |
81 |
< |
E obj; |
82 |
< |
int len = size(); |
81 |
> |
E obj; |
82 |
> |
int len = size(); |
83 |
|
|
84 |
< |
obj = peek(); |
85 |
< |
removeElementAt(len - 1); |
84 |
> |
obj = peek(); |
85 |
> |
removeElementAt(len - 1); |
86 |
|
|
87 |
< |
return obj; |
87 |
> |
return obj; |
88 |
|
} |
89 |
|
|
90 |
|
/** |
96 |
|
* @exception EmptyStackException if this stack is empty. |
97 |
|
*/ |
98 |
|
public synchronized E peek() { |
99 |
< |
int len = size(); |
99 |
> |
int len = size(); |
100 |
|
|
101 |
< |
if (len == 0) |
102 |
< |
throw new EmptyStackException(); |
103 |
< |
return elementAt(len - 1); |
101 |
> |
if (len == 0) |
102 |
> |
throw new EmptyStackException(); |
103 |
> |
return elementAt(len - 1); |
104 |
|
} |
105 |
|
|
106 |
|
/** |
110 |
|
* no items; <code>false</code> otherwise. |
111 |
|
*/ |
112 |
|
public boolean empty() { |
113 |
< |
return size() == 0; |
113 |
> |
return size() == 0; |
114 |
|
} |
115 |
|
|
116 |
|
/** |
128 |
|
* indicates that the object is not on the stack. |
129 |
|
*/ |
130 |
|
public synchronized int search(Object o) { |
131 |
< |
int i = lastIndexOf(o); |
131 |
> |
int i = lastIndexOf(o); |
132 |
|
|
133 |
< |
if (i >= 0) { |
134 |
< |
return size() - i; |
135 |
< |
} |
136 |
< |
return -1; |
133 |
> |
if (i >= 0) { |
134 |
> |
return size() - i; |
135 |
> |
} |
136 |
> |
return -1; |
137 |
|
} |
138 |
|
|
139 |
|
/** use serialVersionUID from JDK 1.0.2 for interoperability */ |