源码看JAVA【四十二】Stack

最新推荐文章于 2021-11-29 23:42:08 发布

eulers

最新推荐文章于 2021-11-29 23:42:08 发布

阅读量249

点赞数

分类专栏：源码看JAVA 文章标签： Stack

本文链接：https://blog.csdn.net/jiangxuexuanshuang/article/details/90031460

版权

源码看JAVA 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

本文深入解析Java中Stack类的实现原理，Stack继承自Vector，提供了线程安全的push、pop和peek等操作。文章详细介绍了如何通过synchronized关键字确保堆栈操作的线程安全性，以及search方法的使用。

摘要由CSDN通过智能技术生成

Stack继承Vector，堆栈添加了pop与push操作，并添加synchronized修饰，保证其安全性

1、push/pop；插入与取出

/**
     * 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;
    }

    /**
     * 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;
    }

2、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);
    }

3、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;
    }