LinkedList源码解析
1.成员变量
①size:集合大小
②first:头结点
③last:尾节点
2.构造器
空构造
带集合的构造
public LinkedList() {
}
public LinkedList(Collection<? extends E> c) {
this();
addAll(c);
}
3.重要内部类
private static class Node<E> {
E item;//本身元素
Node<E> next;//前驱,指向该节点的上一个节点,头结点为null
Node<E> prev;//后驱,指向该节点的后一个节点,尾节点为null
Node(Node<E> prev, E element, Node<E> next) {
this.item = element;
this.next = next;
this.prev = prev;
}
}
4主要方法
①添加
//添加头结点
public void addFirst(E e) {
linkFirst(e);
}
private void linkFirst(E e) {
//获取头结点
final Node<E> f = first;
//生成一个新的头节点
final Node<E> newNode = new Node<>(null, e, f);
//跟新first数据
first = newNode;
//如果头结点为null,那么这个节点也是尾节点
if (f == null)
last = newNode;
else
//否则将原来头结点的前驱指想新的头结点
f.prev = newNode;
size++;
modCount++;
}
//添加尾节点
public void addLast(E e) {
linkLast(e);
}
public boolean add(E e) {
linkLast(e);
return true;
}
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++;
}
//在指定位置插入节点数据
public void add(int index, E element) {
//检查index
checkPositionIndex(index);
if (index == size)
//插入在末尾
linkLast(element);
else
linkBefore(element, node(index));
}
//succ,指定索引位置的节点元素,e要插入的元素数据
void linkBefore(E e, Node<E> succ) {
// assert succ != null;
//取得succ的前一个节点
final Node<E> pred = succ.prev;
//生成新的节点,前驱指向succ的前驱,后驱指向succ
final Node<E> newNode = new Node<>(pred, e, succ);
//succ的前驱指向新节点
succ.prev = newNode;
//检查succ是否为头结点
if (pred == null)
first = newNode;
else
//原来succ的前节点的后驱指向新的节点
pred.next = newNode;
size++;
modCount++;
}
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 {
//找到插入索引位置的元素,并将他的前驱赋值给pred
succ = node(index);
pred = succ.prev;
}
for (Object o : a) {
//循环遍历a数组
@SuppressWarnings("unchecked") E e = (E) o;
//生成新节点,前驱指向pred,后驱为null
Node<E> newNode = new Node<>(pred, e, null);
if (pred == null)
first = newNode;
else
//将pred的后驱指向新节点
pred.next = newNode;
//将新加入的节点作为新的pred
pred = newNode;
}
//如果索引位置为null,那么他的前驱为尾节点
if (succ == null) {
last = pred;
} else {
//否则,索引位置将succ和他的前驱pred相连
pred.next = succ;
succ.prev = pred;
}
size += numNew;
modCount++;
return true;
}
/**
* 返回指定索引下的节点
*/
Node<E> node(int index) {
// assert isElementIndex(index);
if (index < (size >> 1)) {
Node<E> x = first;
for (int i = 0; i < index; i++)
x = x.next;
return x;
} else {
Node<E> x = last;
for (int i = size - 1; i > index; i--)
x = x.prev;
return x;
}
}
②删除(操作过程和添加类似,不做解释)
public E remove() {
return removeFirst();
}
public E removeFirst() {
final Node<E> f = first;
if (f == null)
throw new NoSuchElementException();
return unlinkFirst(f);
}
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;
}
public E removeLast() {
final Node<E> l = last;
if (l == null)
throw new NoSuchElementException();
return unlinkLast(l);
}
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;
}
public boolean remove(Object o) {
if (o == null) {
for (Node<E> x = first; x != null; x = x.next) {
if (x.item == null) {
unlink(x);
return true;
}
}
} else {
for (Node<E> x = first; x != null; x = x.next) {
if (o.equals(x.item)) {
unlink(x);
return true;
}
}
}
return false;
}
public E remove(int index) {
checkElementIndex(index);
return unlink(node(index));
}
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 get(int index) {
checkElementIndex(index);
return node(index).item;
}
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 boolean contains(Object o) {
return indexOf(o) != -1;
}
//返回对象的下标,没有返回-1
public int indexOf(Object o) {
int index = 0;
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;
}
未完待续