|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
This interface describes the requirements for work list implementations used the
the DataFlowSolver
. A work list is just a collection data structure,
capable of storing elements. The strategy in which elements are retrieved is
implementation dependent. Despite its name, it does not need to be a list: The
same element does not have to be stored more than once.
Method Summary | |
boolean |
add(java.lang.Object o)
This methods adds an element to the work list. |
java.lang.Object |
get()
Chooses a previously added element from the work list and returns it. |
boolean |
isEmpty()
Checks if there are elements in the work list. |
void |
moveToFront(java.lang.Object o)
Maybe makes a previously added element the next to be retrieved by get() . |
int |
size()
Returns the number of elements stored in this work list. |
Method Detail |
public boolean add(java.lang.Object o)
get()
in
between. An implementation is free to choose if at any time, such element are
contained more than once.o
- an Object
valueboolean
value: whether the element was added or not.public boolean isEmpty()
boolean
valuepublic java.lang.Object get() throws java.util.NoSuchElementException
Object
valuejava.util.NoSuchElementException
- if there are no elements in this work listpublic void moveToFront(java.lang.Object o) throws java.util.NoSuchElementException
get()
. An implementation is free to ignore calls.o
- an Object
valuejava.util.NoSuchElementException
- if o
is not in the listpublic int size()
int
value
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |