|
Lightweight Bartering Grid | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Deque<T>
Double-ended queue that supports element insertion and removal at both ends.
Original, unlicensed version written by Geoff Knagge (9806135), last modified 14/8/1999.
This version patched by Cyril Briquet, last modified 04/02/2007.
Note: the sole purpose of this class is to provide a J2SE 5.0 implementation of a Deque.
Method Summary | |
---|---|
java.util.Iterator<T> |
descendingIterator()
|
T |
firstElement()
|
void |
insertFirst(T O)
|
void |
insertLast(T O)
|
boolean |
isEmpty()
|
java.util.Iterator<T> |
iterator()
|
T |
lastElement()
|
T |
removeFirst()
|
T |
removeLast()
|
int |
size()
|
Method Detail |
---|
int size()
boolean isEmpty()
void insertFirst(T O) throws GridException
GridException
void insertLast(T O) throws GridException
GridException
T removeFirst() throws GridException
GridException
T removeLast() throws GridException
GridException
T firstElement() throws GridException
GridException
T lastElement() throws GridException
GridException
java.util.Iterator<T> iterator()
java.util.Iterator<T> descendingIterator()
|
Lightweight Bartering Grid | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Copyright (c) 2005-2008, Cyril Briquet, parts Xavier Dalem.