java8集合--LinkedList純源碼

package Queue;

import java.util.*;
import java.util.function.Consumer;

/**
 * 雙端隊列主要實現list接口和Deque接口，實現了全部list操做，元素容許爲null
 * 該實現是不一樣步的,not synchronized.
 * 可使用 Collections.synchronizedList封裝防止不一樣不的狀況出現
 * 即：List list = Collections.synchronizedList(new LinkedList(...))
 * 該類中的迭代器使用快速失敗模式：fail-fast，若是list在迭代器被建立以後的任意時間內被其餘方法修改告終構，
 * （除了迭代器本身的remove()或add()方法），都是馬上報錯
 */

public class LinkedList<E>
    extends AbstractSequentialList<E>
    implements List<E>, Deque<E>, Cloneable, java.io.Serializable
{
    //定義了三個成員變量，鏈表元素個數的size，指向第一個元素的first，指向最後一個元素的last
    //隊列中元素的個數
    transient int size = 0;


    //永遠指向鏈表中的第一個節點
    transient Node<E> first;


    //永遠指向鏈表中的最後一個節點
    transient Node<E> last;

    //構造方法有兩個，一個是構造一個空的鏈表，一個是根據已有的集合構造新的鏈表
    //初始化空隊列
    public LinkedList() {
    }

    //根據已有的集合對象構造一個隊列
    public LinkedList(Collection<? extends E> c) {
        this();//調用空的初始化隊列
        addAll(c);//向空隊列中添加全部初始化的元素
    }

    //內部類，定義鏈表上的一個節點對象
    //每一個節點有三部分組成，中間的是節點自身的值，和指向鏈表前一個節點的指針prev,以及指向鏈表後一個節點的指針next
    private static class Node<E> {
        E item;
        Node<E> next;
        Node<E> prev;
        //初始化一個節點對象時，接收三個參數。指向前一個節點的指針，本身自己，和指向後一個節點的指針
        Node(Node<E> prev, E element, Node<E> next) {
            this.item = element;
            this.next = next;
            this.prev = prev;
        }
    }



    //移除指定元素，遍歷鏈表，碰到第一個相等的就移除這個元素
    public boolean remove(Object o) {
        //要移除元素爲null的狀況
        if (o == null) {
            //遍歷鏈表
            for (Node<E> x = first; x != null; x = x.next) {
                if (x.item == null) {
                    unlink(x);//移除某個元素的具體實現
                    return true;
                }
            }
            //要移除元素不爲null的狀況
        } else {
            for (Node<E> x = first; x != null; x = x.next) {
                if (o.equals(x.item)) {
                    unlink(x);
                    return true;
                }
            }
        }
        return false;
    }

    //移除一個節點的具體實現方法
    E unlink(Node<E> x) {
        // assert x != null;
        //拿到本節點上的三個元素
        final E element = x.item;
        final Node<E> next = x.next;
        final Node<E> prev = x.prev;
        //處理前一個節點對下一個節點的指向
        if (prev == null) {
            first = next;
        } else {
            prev.next = next;
            x.prev = null;
        }
        //處理後一個節點對前一個節點的指向
        if (next == null) {
            last = prev;
        } else {
            next.prev = prev;
            x.next = null;
        }

        x.item = null;
        size--;
        modCount++;
        return element;
    }


    //向鏈表頭部第一個位置添加一個元素
    private void linkFirst(E e) {
        //保存first的引用
        final Node<E> f = first;
        //根據傳進來的元素e，構建一個新的節點，由於節點是放在頭部第一個位置，全部prev=null
        //構建一個新的節點時，就直接指定了前一個，本身，後一個。
        final Node<E> newNode = new Node<>(null, e, f);
        //把first指向新加入的一個元素
        first = newNode;
        //處理原先第一個節點（如今已經時第二個了）對新節點的引用
        if (f == null)
            last = newNode;
        else
            f.prev = newNode;
        size++;
        modCount++;
    }

    //向鏈表尾部最後一個位置添加一個元素
    void linkLast(E e) {
        final Node<E> l = last;
        //構建一個新的節點
        final Node<E> newNode = new Node<>(l, e, null);
        last = newNode;
        if (l == null)
            first = newNode;
        else
            l.next = newNode;
        size++;
        modCount++;
    }

    //在某個節點以前添加一個元素
    void linkBefore(E e, Node<E> succ) {
        // assert succ != null;
        final Node<E> pred = succ.prev;
        final Node<E> newNode = new Node<>(pred, e, succ);
        succ.prev = newNode;
        if (pred == null)
            first = newNode;
        else
            pred.next = newNode;
        size++;
        modCount++;
    }

    //移除鏈表的第一個元素
    private E unlinkFirst(Node<E> f) {
        // assert f == first && f != null;
        final E element = f.item;
        final Node<E> next = f.next;
        f.item = null;
        f.next = null; // help GC
        first = next;
        if (next == null)
            last = null;
        else
            next.prev = null;
        size--;
        modCount++;
        return element;
    }

    //移除鏈表的最後一個元素
    private E unlinkLast(Node<E> l) {
        // assert l == last && l != null;
        final E element = l.item;
        final Node<E> prev = l.prev;
        l.item = null;
        l.prev = null; // help GC
        last = prev;
        if (prev == null)
            first = null;
        else
            prev.next = null;
        size--;
        modCount++;
        return element;
    }



    //僅僅查看鏈表中第一個節點的值，鏈表爲null時，拋出異常
    public E getFirst() {
        final Node<E> f = first;
        if (f == null)
            throw new NoSuchElementException();
        return f.item;
    }

    ////返回鏈表中最後一個節點的值，鏈表爲null時，拋出異常
    public E getLast() {
        final Node<E> l = last;
        if (l == null)
            throw new NoSuchElementException();
        return l.item;
    }

    //從鏈表中刪除並返回頭部的第一個元素，若是鏈表爲null，則拋出異常
    public E removeFirst() {
        final Node<E> f = first;
        if (f == null)
            throw new NoSuchElementException();
        return unlinkFirst(f);
    }

    //從鏈表中刪除並返回頭部的第一個元素，若是鏈表爲null，則拋出異常
    public E removeLast() {
        final Node<E> l = last;
        if (l == null)
            throw new NoSuchElementException();
        return unlinkLast(l);
    }

    //在鏈表頭部第一個位置上插入元素，沒有返回值
    public void addFirst(E e) {
        linkFirst(e);
    }

    //在鏈表尾部最後一個位置上插入元素，沒有返回值
    public void addLast(E e) {
        linkLast(e);
    }

    //檢查鏈表是否包含某個值，返回布爾值
    public boolean contains(Object o) {
        return indexOf(o) != -1;
    }

    //返回鏈表元素的個數
    public int size() {
        return size;
    }

    //在鏈表尾部最後一個位置上插入元素，返回布爾值
    public boolean add(E e) {
        linkLast(e);
        return true;
    }



    //向鏈表中追加指定集合中的全部元素
    public boolean addAll(Collection<? extends E> c) {
        return addAll(size, c);
    }

    //在指定位置開始追加指定集合內的全部元素
    public boolean addAll(int index, Collection<? extends E> c) {
        //先檢查指定位置的是否合法
        checkPositionIndex(index);
        //把集合內的元素換成數組結構
        Object[] a = c.toArray();
        //檢查數組的大小是否合法
        int numNew = a.length;
        if (numNew == 0)
            return false;
        //定義兩個節點變量
        Node<E> pred, succ;
        //若是是從鏈表的最後開始添加
        if (index == size) {
            succ = null;
            pred = last;
        //若是是從鏈表的中間開始添加
        } else {
            //要是index開始添加，全部，index對應的節點須要後移
            succ = node(index);//拿處處於index位置的節點
            pred = succ.prev;//拿到index前一個節點
        }
        //遍歷數組的元素
        for (Object o : a) {
            @SuppressWarnings("unchecked") E e = (E) o;
            //根據數組的元素拿到構建新的節點，並指定前一個節點，由於後一個節點還不知道
            Node<E> newNode = new Node<>(pred, e, null);
            if (pred == null)
                first = newNode;
            else
                //更新新加節點的下一個節點的指向
                pred.next = newNode;
            //更改前一個節點，方便下一個循環的添加
            pred = newNode;
        }

        //添加完數組內的元素，把其和原來的部分進行拼接
        if (succ == null) {
            last = pred;
        } else {
            pred.next = succ;
            succ.prev = pred;
        }

        size += numNew;
        modCount++;
        return true;
    }

    //移除鏈表的全部元素
    public void clear() {
        // Clearing all of the links between nodes is "unnecessary", but:
        // - helps a generational GC if the discarded nodes inhabit
        //   more than one generation
        // - is sure to free memory even if there is a reachable Iterator
        //遍歷，使全部的引用都指向null
        for (Node<E> x = first; x != null; ) {
            Node<E> next = x.next;
            x.item = null;
            x.next = null;
            x.prev = null;
            x = next;
        }
        first = last = null;
        size = 0;
        modCount++;
    }


    // Positional Access Operations

    //返回指定索引號上的元素值
    public E get(int index) {
        checkElementIndex(index);
        return node(index).item;
    }

    //對索引號上對應的節點的值進行修改
    public E set(int index, E element) {
        checkElementIndex(index);
        Node<E> x = node(index);
        E oldVal = x.item;
        x.item = element;
        return oldVal;
    }

    //在指定位置添加一個節點
    public void add(int index, E element) {
        checkPositionIndex(index);

        if (index == size)
            linkLast(element);
        else
            linkBefore(element, node(index));
    }

    //刪除並返回指定位置上的元素
    public E remove(int index) {
        checkElementIndex(index);
        return unlink(node(index));
    }

    /**
     * Tells if the argument is the index of an existing element.
     */
    private boolean isElementIndex(int index) {
        return index >= 0 && index < size;
    }

    /**
     * Tells if the argument is the index of a valid position for an
     * iterator or an add operation.
     */
    private boolean isPositionIndex(int index) {
        return index >= 0 && index <= size;
    }

    /**
     * Constructs an IndexOutOfBoundsException detail message.
     * Of the many possible refactorings of the error handling code,
     * this "outlining" performs best with both server and client VMs.
     */
    private String outOfBoundsMsg(int index) {
        return "Index: "+index+", Size: "+size;
    }

    private void checkElementIndex(int index) {
        if (!isElementIndex(index))
            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
    }

    private void checkPositionIndex(int index) {
        if (!isPositionIndex(index))
            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
    }

    //按索引號返回節點
    Node<E> node(int index) {
        // assert isElementIndex(index);
        //若是索引值小於總數量的1/2，從頭部開始遍歷
        if (index < (size >> 1)) {
            Node<E> x = first;
            for (int i = 0; i < index; i++)
                x = x.next;
            return x;
        //若是索引值大於或等於總數量的1/2，從尾部開始遍歷
        } else {
            Node<E> x = last;
            for (int i = size - 1; i > index; i--)
                x = x.prev;
            return x;
        }
    }

    // Search Operations


    //返回指定元素在鏈表中第一次出現的索引號，若無則返回-1
    public int indexOf(Object o) {
        int index = 0;
        //處理o爲null和不爲null的狀況
        if (o == null) {
            for (Node<E> x = first; x != null; x = x.next) {
                if (x.item == null)
                    return index;
                index++;
            }
        } else {
            for (Node<E> x = first; x != null; x = x.next) {
                if (o.equals(x.item))
                    return index;
                index++;
            }
        }
        return -1;
    }

    //返回指定元素在鏈表中最後一次出現的索引號，若無則返回-1
    public int lastIndexOf(Object o) {
        int index = size;
        if (o == null) {
            //遍歷查找的時候只須要倒序就能夠，問題不大
            for (Node<E> x = last; x != null; x = x.prev) {
                index--;
                if (x.item == null)
                    return index;
            }
        } else {
            for (Node<E> x = last; x != null; x = x.prev) {
                index--;
                if (o.equals(x.item))
                    return index;
            }
        }
        return -1;
    }

    // Queue operations.

    //僅僅查看隊列的第一個元素
    public E peek() {
        final Node<E> f = first;
        return (f == null) ? null : f.item;
    }

    //僅僅查看鏈表中第一個節點的值，鏈表爲null時，拋出異常
    public E element() {
        return getFirst();
    }

    //移除並返回鏈表頭部的第一個元素
    public E poll() {
        final Node<E> f = first;
        return (f == null) ? null : unlinkFirst(f);
    }

    //從鏈表中刪除並返回頭部的第一個元素，若是鏈表爲null，則拋出異常
    public E remove() {
        return removeFirst();
    }

    //在鏈表尾部最後一個位置上插入元素，返回布爾值
    public boolean offer(E e) {
        return add(e);
    }

    // Deque operations
    //在鏈表頭部第一個位置上插入元素，返回布爾值
    public boolean offerFirst(E e) {
        addFirst(e);
        return true;
    }

    //在鏈表尾部最後一個位置上插入元素，返回布爾值
    public boolean offerLast(E e) {
        addLast(e);
        return true;
    }

    //僅僅查看鏈表中第一個節點的值。不刪除
    public E peekFirst() {
        final Node<E> f = first;
        return (f == null) ? null : f.item;
     }

    //僅僅查看鏈表中最後一個節點的值。不刪除
    public E peekLast() {
        final Node<E> l = last;
        return (l == null) ? null : l.item;
    }

    //移除鏈表的第一個元素
    public E pollFirst() {
        final Node<E> f = first;
        return (f == null) ? null : unlinkFirst(f);
    }

    //移除鏈表的最後一個元素
    public E pollLast() {
        final Node<E> l = last;
        return (l == null) ? null : unlinkLast(l);
    }

    //棧操做，壓入元素
    public void push(E e) {
        addFirst(e);
    }

    //棧操做，彈出元素
    public E pop() {
        return removeFirst();
    }

    //移除指定元素，遍歷鏈表，碰到第一個相等的就移除這個元素
    public boolean removeFirstOccurrence(Object o) {
        return remove(o);
    }

    //移除鏈表中最後一個跟指定元素相同的元素
    public boolean removeLastOccurrence(Object o) {
        if (o == null) {
            for (Node<E> x = last; x != null; x = x.prev) {
                if (x.item == null) {
                    unlink(x);
                    return true;
                }
            }
        } else {
            for (Node<E> x = last; x != null; x = x.prev) {
                if (o.equals(x.item)) {
                    unlink(x);
                    return true;
                }
            }
        }
        return false;
    }

    //返回一個從index開始到最後的ListIterator迭代器
    public ListIterator<E> listIterator(int index) {
        checkPositionIndex(index);
        return new ListItr(index);
    }

    //內部類，迭代器的實現
    private class ListItr implements ListIterator<E> {
        private Node<E> lastReturned;
        private Node<E> next;
        private int nextIndex;
        private int expectedModCount = modCount;

        ListItr(int index) {
            // assert isPositionIndex(index);
            next = (index == size) ? null : node(index);
            nextIndex = index;
        }

        public boolean hasNext() {
            return nextIndex < size;
        }

        public E next() {
            checkForComodification();
            if (!hasNext())
                throw new NoSuchElementException();

            lastReturned = next;
            next = next.next;
            nextIndex++;
            return lastReturned.item;
        }

        public boolean hasPrevious() {
            return nextIndex > 0;
        }

        public E previous() {
            checkForComodification();
            if (!hasPrevious())
                throw new NoSuchElementException();

            lastReturned = next = (next == null) ? last : next.prev;
            nextIndex--;
            return lastReturned.item;
        }

        public int nextIndex() {
            return nextIndex;
        }

        public int previousIndex() {
            return nextIndex - 1;
        }

        public void remove() {
            checkForComodification();
            if (lastReturned == null)
                throw new IllegalStateException();

            Node<E> lastNext = lastReturned.next;
            unlink(lastReturned);
            if (next == lastReturned)
                next = lastNext;
            else
                nextIndex--;
            lastReturned = null;
            expectedModCount++;
        }

        public void set(E e) {
            if (lastReturned == null)
                throw new IllegalStateException();
            checkForComodification();
            lastReturned.item = e;
        }

        public void add(E e) {
            checkForComodification();
            lastReturned = null;
            if (next == null)
                linkLast(e);
            else
                linkBefore(e, next);
            nextIndex++;
            expectedModCount++;
        }

        public void forEachRemaining(Consumer<? super E> action) {
            Objects.requireNonNull(action);
            while (modCount == expectedModCount && nextIndex < size) {
                action.accept(next.item);
                lastReturned = next;
                next = next.next;
                nextIndex++;
            }
            checkForComodification();
        }

        final void checkForComodification() {
            if (modCount != expectedModCount)
                throw new ConcurrentModificationException();
        }
    }



    public Iterator<E> descendingIterator() {
        return new DescendingIterator();
    }

    //內部類，反序的迭代器
    private class DescendingIterator implements Iterator<E> {
        private final ListItr itr = new ListItr(size());
        public boolean hasNext() {
            return itr.hasPrevious();
        }
        public E next() {
            return itr.previous();
        }
        public void remove() {
            itr.remove();
        }
    }

    @SuppressWarnings("unchecked")
    private LinkedList<E> superClone() {
        try {
            return (LinkedList<E>) super.clone();
        } catch (CloneNotSupportedException e) {
            throw new InternalError(e);
        }
    }

    //返回一個淺克隆對象
    public Object clone() {
        LinkedList<E> clone = superClone();

        // Put clone into "virgin" state
        clone.first = clone.last = null;
        clone.size = 0;
        clone.modCount = 0;

        // Initialize clone with our elements
        for (Node<E> x = first; x != null; x = x.next)
            clone.add(x.item);

        return clone;
    }

    //返回一個包含此列表中全部元素的數組
    //返回的數組是Object[]數組
    public Object[] toArray() {
        Object[] result = new Object[size];
        int i = 0;
        for (Node<E> x = first; x != null; x = x.next)
            result[i++] = x.item;
        return result;
    }

    //以正確的順序返回一個包含此列表中全部元素的數組（從第一個到最後一個元素）;
    // 返回的數組的運行時類型是指定數組的運行時類型
    public <T> T[] toArray(T[] a) {
        if (a.length < size)
            a = (T[])java.lang.reflect.Array.newInstance(
                                a.getClass().getComponentType(), size);
        int i = 0;
        Object[] result = a;
        for (Node<E> x = first; x != null; x = x.next)
            result[i++] = x.item;

        if (a.length > size)
            a[size] = null;

        return a;
    }

    private static final long serialVersionUID = 876323262645176354L;

    /**
     * Saves the state of this {@code LinkedList} instance to a stream
     * (that is, serializes it).
     *
     * @serialData The size of the list (the number of elements it
     *             contains) is emitted (int), followed by all of its
     *             elements (each an Object) in the proper order.
     */
    private void writeObject(java.io.ObjectOutputStream s)
        throws java.io.IOException {
        // Write out any hidden serialization magic
        s.defaultWriteObject();

        // Write out size
        s.writeInt(size);

        // Write out all elements in the proper order.
        for (Node<E> x = first; x != null; x = x.next)
            s.writeObject(x.item);
    }

    /**
     * Reconstitutes this {@code LinkedList} instance from a stream
     * (that is, deserializes it).
     */
    @SuppressWarnings("unchecked")
    private void readObject(java.io.ObjectInputStream s)
        throws java.io.IOException, ClassNotFoundException {
        // Read in any hidden serialization magic
        s.defaultReadObject();

        // Read in size
        int size = s.readInt();

        // Read in all elements in the proper order.
        for (int i = 0; i < size; i++)
            linkLast((E)s.readObject());
    }


    //並行迭代器
    @Override
    public Spliterator<E> spliterator() {
        return new LLSpliterator<E>(this, -1, 0);
    }

    /** A customized variant of Spliterators.IteratorSpliterator */
    static final class LLSpliterator<E> implements Spliterator<E> {
        static final int BATCH_UNIT = 1 << 10;  // batch array size increment
        static final int MAX_BATCH = 1 << 25;  // max batch array size;
        final LinkedList<E> list; // null OK unless traversed
        Node<E> current;      // current node; null until initialized
        int est;              // size estimate; -1 until first needed
        int expectedModCount; // initialized when est set
        int batch;            // batch size for splits

        LLSpliterator(LinkedList<E> list, int est, int expectedModCount) {
            this.list = list;
            this.est = est;
            this.expectedModCount = expectedModCount;
        }

        final int getEst() {
            int s; // force initialization
            final LinkedList<E> lst;
            if ((s = est) < 0) {
                if ((lst = list) == null)
                    s = est = 0;
                else {
                    expectedModCount = lst.modCount;
                    current = lst.first;
                    s = est = lst.size;
                }
            }
            return s;
        }

        public long estimateSize() { return (long) getEst(); }

        public Spliterator<E> trySplit() {
            Node<E> p;
            int s = getEst();
            if (s > 1 && (p = current) != null) {
                int n = batch + BATCH_UNIT;
                if (n > s)
                    n = s;
                if (n > MAX_BATCH)
                    n = MAX_BATCH;
                Object[] a = new Object[n];
                int j = 0;
                do { a[j++] = p.item; } while ((p = p.next) != null && j < n);
                current = p;
                batch = j;
                est = s - j;
                return Spliterators.spliterator(a, 0, j, Spliterator.ORDERED);
            }
            return null;
        }

        public void forEachRemaining(Consumer<? super E> action) {
            Node<E> p; int n;
            if (action == null) throw new NullPointerException();
            if ((n = getEst()) > 0 && (p = current) != null) {
                current = null;
                est = 0;
                do {
                    E e = p.item;
                    p = p.next;
                    action.accept(e);
                } while (p != null && --n > 0);
            }
            if (list.modCount != expectedModCount)
                throw new ConcurrentModificationException();
        }

        public boolean tryAdvance(Consumer<? super E> action) {
            Node<E> p;
            if (action == null) throw new NullPointerException();
            if (getEst() > 0 && (p = current) != null) {
                --est;
                E e = p.item;
                current = p.next;
                action.accept(e);
                if (list.modCount != expectedModCount)
                    throw new ConcurrentModificationException();
                return true;
            }
            return false;
        }

        public int characteristics() {
            return Spliterator.ORDERED | Spliterator.SIZED | Spliterator.SUBSIZED;
        }
    }

}