I have a need for a CircularFifoDequeue class and I see that Java 1.6 will be supported now. The CircularFifoDequeue would have the same functionality as the currently implemented CircularFifoQueue, but can manipulate both sides of the queue. Of most interest are the abilities to: "descendingIterator," "peekLast," "removeLastOccurrence."
If an item is ended to the front of the queue throw "not supported" exception? Remove the item at the back of the queue?
If an item is added to the back of the queue with no space available, the item at the front of the queue is overwritten.