[
https://issues.apache.org/jira/browse/COLLECTIONS-563?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14586658#comment-14586658
]
Thomas Neidhart commented on COLLECTIONS-563:
---------------------------------------------
Did you have something like this BoundedDeque implementation in mind?
https://github.com/LearnLib/learnlib/blob/develop/filters/reuse/src/main/java/de/learnlib/filters/reuse/tree/BoundedDeque.java
> CircularFifoDequeue
> -------------------
>
> Key: COLLECTIONS-563
> URL: https://issues.apache.org/jira/browse/COLLECTIONS-563
> Project: Commons Collections
> Issue Type: Wish
> Components: Collection
> Reporter: BELUGA BEHR
> Fix For: 4.1
>
>
> 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.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
