概述
stack是栈,特点是先进后出(FILO, First In Last Out).Java工具包的Stack是通过继承Vector来实现的,因为Vector的底层数据结构是使用数组实现的,这也意味着Stack的栈结构是通过数组实现的而不是链表.也因为这样Stack是线程安全的.因为Java已经不推荐使用Stack,所以当需要使用栈时,而是推荐使用更高效的ArrayDeque;因为Queue只是一个接口,当需要使用队列时首选ArrayDeque(其次是LinkedList)
#### 构造方法
```java
public Stack() {
}
push()
将该元素添加到栈的顶部
/**
* Pushes an item onto the top of this stack. This has exactly
* the same effect as:
* <blockquote><pre>
* addElement(item)</pre></blockquote>
*
* @param item the item to be pushed onto this stack.
* @return the <code>item</code> argument.
* @see java.util.Vector#addElement
*/
public E push(E item) {
addElement(item);
return item;
}
pop()
此方法使用synchronized 同步锁修饰,说明是线程安全的;移除堆栈顶部的对象,并作为此函数的值返回该对象。
/**
* Removes the object at the top of this stack and returns that
* object as the value of this function.
*
* @return The object at the top of this stack (the last item
* of the <tt>Vector</tt> object).
* @throws EmptyStackException if this stack is empty.
*/
public synchronized E pop() {
E obj;
int len = size();
obj = peek();
removeElementAt(len - 1);
return obj;
}
peek()
查看此堆栈顶部的对象而不删除它
/**
* Looks at the object at the top of this stack without removing it
* from the stack.
*
* @return the object at the top of this stack (the last item
* of the <tt>Vector</tt> object).
* @throws EmptyStackException if this stack is empty.
*/
public synchronized E peek() {
int len = size();
if (len == 0)
throw new EmptyStackException();
return elementAt(len - 1);
}
empty()
判断此栈是否为空
/**
* Tests if this stack is empty.
*
* @return <code>true</code> if and only if this stack contains
* no items; <code>false</code> otherwise.
*/
public boolean empty() {
return size() == 0;
}
search()
返回指定元素的索引位置
/**
* Returns the 1-based position where an object is on this stack.
* If the object <tt>o</tt> occurs as an item in this stack, this
* method returns the distance from the top of the stack of the
* occurrence nearest the top of the stack; the topmost item on the
* stack is considered to be at distance <tt>1</tt>. The <tt>equals</tt>
* method is used to compare <tt>o</tt> to the
* items in this stack.
*
* @param o the desired object.
* @return the 1-based position from the top of the stack where
* the object is located; the return value <code>-1</code>
* indicates that the object is not on the stack.
*/
public synchronized int search(Object o) {
int i = lastIndexOf(o);
if (i >= 0) {
return size() - i;
}
return -1;
}
serialVersionUID
/** use serialVersionUID from JDK 1.0.2 for interoperability */
private static final long serialVersionUID = 1224463164541339165L;
Just Do It:
“你的无畏源于无知”