public class CommonLinkedList<E extends LinkedListNode> extends Object implements LinkedList<E>
| 构造器和说明 |
|---|
CommonLinkedList() |
| 限定符和类型 | 方法和说明 |
|---|---|
boolean |
add(E e) |
boolean |
addAfter(E desc,
E addNode)
Add element after a special node
|
boolean |
addBefore(E desc,
E addNode)
Add element before a special node
|
void |
clear() |
boolean |
contains(Object o) |
E |
getHead() |
E |
getLast() |
boolean |
isEmpty() |
Iterator<E> |
iterator() |
boolean |
move(E src,
E desc)
move src node to after desc node
|
boolean |
moveToLast(E src)
move src node to last
|
boolean |
remove(Object o) |
boolean |
removeFrom(E start) |
boolean |
replace(E old,
E newly) |
boolean |
setHead(E head) |
boolean |
setLast(E last) |
int |
size() |
public int size()
size 在接口中 LinkedList<E extends LinkedListNode>public boolean isEmpty()
isEmpty 在接口中 LinkedList<E extends LinkedListNode>public boolean contains(Object o)
contains 在接口中 LinkedList<E extends LinkedListNode>public boolean add(E e)
add 在接口中 LinkedList<E extends LinkedListNode>public boolean remove(Object o)
remove 在接口中 LinkedList<E extends LinkedListNode>public boolean removeFrom(E start)
removeFrom 在接口中 LinkedList<E extends LinkedListNode>public void clear()
clear 在接口中 LinkedList<E extends LinkedListNode>public boolean addAfter(E desc, E addNode)
LinkedListaddAfter 在接口中 LinkedList<E extends LinkedListNode>public boolean addBefore(E desc, E addNode)
LinkedListaddBefore 在接口中 LinkedList<E extends LinkedListNode>public boolean setHead(E head)
setHead 在接口中 LinkedList<E extends LinkedListNode>public boolean setLast(E last)
setLast 在接口中 LinkedList<E extends LinkedListNode>public E getHead()
getHead 在接口中 LinkedList<E extends LinkedListNode>public E getLast()
getLast 在接口中 LinkedList<E extends LinkedListNode>public boolean replace(E old, E newly)
replace 在接口中 LinkedList<E extends LinkedListNode>public boolean move(E src, E desc)
LinkedListmove 在接口中 LinkedList<E extends LinkedListNode>public boolean moveToLast(E src)
LinkedListmoveToLast 在接口中 LinkedList<E extends LinkedListNode>Copyright © 2015. All rights reserved.