FW: Re: [concurrency-interest] Suitable replacement for LinkedHashSet inutil.con

Michael Vogel mvogel08 at hotmail.com
Fri May 12 14:00:20 EDT 2006

Please remove me from the list.

>From: "Joshua Bloch" <josh at bloch.us>
>To: "Tutika Chakravarthy" <chakritsus at yahoo.com>
>CC: concurrency-interest at cs.oswego.edu
>Subject: Re: [concurrency-interest] Suitable replacement for LinkedHashSet 
>inutil.concurrent package
>Date: Fri, 12 May 2006 09:23:11 -0700

Don’t just search. Find. Check out the new MSN Search! 
-------------- next part --------------
No such animal exists (yet).


On 5/12/06, Tutika Chakravarthy <chakritsus at yahoo.com> wrote:
>Is there any Suitable replacement class for
>LinkedHashSet in java.util.concurrent package.
>I have seen javadocs for ConcurrentSkipListSet and
>CopyOnWriteArraySet. But both of them don't maintain
>the order of elements the way they are inserted into.
>LinkedHashSet maintains insertion-order while
>I would like to know whether any other concurrent set
>is avaible which behaves in a similar way.
>Do You Yahoo!?
>Tired of spam?  Yahoo! Mail has the best spam protection around
>Concurrency-interest mailing list
>Concurrency-interest at altair.cs.oswego.edu

Concurrency-interest mailing list
Concurrency-interest at altair.cs.oswego.edu

More information about the Concurrency-interest mailing list