Re: Merging Linked Lists

From:

Patricia Shanahan <pats@acm.org>

Newsgroups:

comp.lang.java.programmer

Date:

Thu, 21 Dec 2006 23:19:04 GMT

Message-ID:

<IDEih.1910$pQ3.1296@newsread4.news.pas.earthlink.net>

djthomp wrote:

On Dec 21, 3:50 pm, "djthomp" <djth...@gmail.com> wrote:

On Dec 21, 3:35 pm, "Damo" <cormacdeba...@gmail.com> wrote:

hello all,
I was'nt ignoring you're advice. I was just exploring all the options,
seeing as I need some of the advantages of Linked Lists and Sets. In
particular the no duplicate feature of sets and i needed to keep the
order items were added(not necessarlly sorted)(Linked Lists), and
inserting into a particulaar point in the colection(Linked Lists).
I have been trying to work with sets but they dont seem to suit my
needs. Its too convoluted to retain the ordering of the collection
Anyway you're words of advice are appreciated.Before choosing not to use a Set because of order retention problems,

you might take at LinkedHashSet. It keeps track of item order by using
saving the insertion order with an internal linked list. Iterating
over the LinkedHashSet gives you its contents in their original order.

http://java.sun.com/j2se/1.5.0/docs/api/java/util/LinkedHashSet.html

...you might take -a look- at LinkedHashSet. Sigh.

More generally, there are java.util.Set implementations that provide
each of the common forms of ordering, so I tend to think Set as soon as
I know I want to avoid duplicates, even if it needs to be ordered.

Don't care about order: HashSet

Insertion order: LinkedHashSet

Natural order: TreeSet

Comparator-specified order: TreeSet

Patricia