private static class Node
E item;
Node
Node
Node(Node<E> prev, E element, Node<E> next) {
this.item = element;
this.next = next;
this.prev = prev;
}
}
Node
// 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
}
}
void linkBefore(E e, Node
// assert succ != null;
final Node
final Node
succ.prev = newNode;
if (pred == null)
first = newNode;
else
pred.next = newNode;
size++;
modCount++;
}
public boolean remove(Object o) {
if (o == null) {
for (Node
if (x.item == null) {
unlink(x);
return true;
}
}
} else {
for (Node
if (o.equals(x.item)) {
unlink(x);
return true;
}
}
}
return false;
}
近期评论