Interface PriorityLinkedList<E>
-
- All Known Implementing Classes:
PriorityLinkedListImpl
public interface PriorityLinkedList<E>
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description voidaddHead(E e, int priority)voidaddSorted(E e, int priority)voidaddTail(E e, int priority)voidclear()booleanisEmpty()Returnstrueif empty,falseotherwise.
It is safe to be called concurrently.LinkedListIterator<E>iterator()Epeek()just look at the first element on the listEpoll()EremoveWithID(String listID, long id)voidsetNodeStore(NodeStore<E> supplier)intsize()Returns the size of this list.
It is safe to be called concurrently.
-
-
-
Method Detail
-
addHead
void addHead(E e, int priority)
-
addTail
void addTail(E e, int priority)
-
addSorted
void addSorted(E e, int priority)
-
poll
E poll()
-
peek
E peek()
just look at the first element on the list
-
clear
void clear()
-
setNodeStore
void setNodeStore(NodeStore<E> supplier)
- Parameters:
supplier-- See Also:
LinkedList.setNodeStore(NodeStore)
-
size
int size()
Returns the size of this list.
It is safe to be called concurrently.
-
iterator
LinkedListIterator<E> iterator()
-
isEmpty
boolean isEmpty()
Returnstrueif empty,falseotherwise.
It is safe to be called concurrently.
-
-