commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Chen (Jira)" <j...@apache.org>
Subject [jira] [Commented] (COLLECTIONS-563) CircularFifoDequeue
Date Tue, 05 Nov 2019 03:02:00 GMT

    [ https://issues.apache.org/jira/browse/COLLECTIONS-563?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16967179#comment-16967179
] 

Chen commented on COLLECTIONS-563:
----------------------------------

As per my understanding, array-based unbounded BlockingQueue means it will be blocked only
when you take an element from an empty queue, it will never be blocked when you put an element
into the queue. 

I don't understand why you mentioned ArrayDeque, maybe you have other functional requirements,
can you explain it in more detail?

> CircularFifoDequeue
> -------------------
>
>                 Key: COLLECTIONS-563
>                 URL: https://issues.apache.org/jira/browse/COLLECTIONS-563
>             Project: Commons Collections
>          Issue Type: Wish
>          Components: Collection
>            Reporter: David Mollitor
>            Priority: Major
>             Fix For: 4.x
>
>
> 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
(v8.3.4#803005)

Mime
View raw message