[concurrency-interest] Proposal WeightedLinkedBoundedQueue
dcholmes at optusnet.com.au
Wed Nov 22 19:26:06 EST 2006
How do you define and measure the "weight" of an object?
From: concurrency-interest-bounces at cs.oswego.edu
[mailto:concurrency-interest-bounces at cs.oswego.edu]On Behalf Of Thierry
Sent: Wednesday, 22 November 2006 10:18 PM
To: concurrency-interest at cs.oswego.edu
Subject: [concurrency-interest] Proposal WeightedLinkedBoundedQueue
A small proposal for adding a new class in the concurrent package.
All bounded collection are bounded to avoid to use to much memory.(At
least in my case J).
But the element put in those collections are often with different size.
In my case BoundedQueue is used as an event queue and we can have
composite events which contains itself many events.
What do you think about adding some bounded collection no more based on
the count but on the sum of the weight of the object inside?
After a quick look on the code of the LinkedBoundedQueue it seems pretty
easy to do.
Does somebody else can see the advantage of this kind of object and is
there enough people interested to make it a part of the concurrent package?
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Concurrency-interest