Java中的STL-LinkedList

Java中的STL-LinkedList

LinkedList的继承关系

如下图所示

• Queue接口继承了Collection接口，另外提供了offer(E e)、remove()、poll()等方法完成一个队列的FIFO的基本操作。
• Deque接口继承了Queue接口，Deque是一个双端队列的接口，可以从前往后，也可以从后往前。
• LinkedList实际上就是一个双端队列的具体实现，因此它继承了AbstractSequentialList也实现了Deque接口。
• JDK1.7开始，LinkedList中的双向链表不提供头节点header了，代替的第一个数据节点引用first和最后一个数据节点引用last。

LinkedList的源代码

import java.util.*;

import java.util.function.Consumer;

public class LinkedList<E> extends AbstractSequentialList<E> implements List<E>, Deque<E>, Cloneable, java.io.Serializable {
   
    transient int size = 0;


    transient Node<E> first;


    transient Node<E> last;


    public LinkedList() {
   
    }


    public LinkedList(Collection<? extends E> c) {
   
        this();
        addAll(c);
    }


    private void linkFirst(E e) {
   
        final Node<E> f = first;
        final Node<E> newNode = new Node<>(null, e, f);
        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;
    }


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


    public E getFirst() {
   
        final Node<E> f = first;
        if (f == null)
            throw new NoSuchElementException();
        return f.item;
    }


    public E getLast() {
   
        final Node<E> l = last;
        if (l == null)
            throw new NoSuchElementException();
        return l.item;
    }


    public E removeFirst() {
   
        final Node<E> f = first;
        if (f == null)
            throw new NoSuchElementException();
        return unlinkFirst(f);
    }


    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