Collection that keeps order

[Tom Henricksen]

Which collection would you use if you want to guarantee the order of how they were put in. As in:

ArrayList list = new ArrayList();
list.add("B");
list.add("C");
list.add("A");

Then iterate over coming out B,C,A. I know ArrayList is wrong but just for example.
Thanks,
Tom

[Svend Rost]

How about a class that implements the abstract class: java/util/AbstractSequentialList

http://java.sun.com/j2se/1.4.2/docs/api/java/util/AbstractSequentialList.html


Does that help?

/Svend Rost

[Tom Henricksen]

Thanks Svend that did the trick! I owe you one...
Tom

[jiju ka]

If the collection contains only unique elements, consider a set.

Treeset can be an option in that case.

[Ernest Friedman-Hill]

I don't know why you say "ArrayList is wrong", or why the interface "AbstractSequentialList" changes anything. A list, by definition, keeps its elements in a specified order. ArrayList does, LinkedList does, and so do all other Lists.

Did you have some specific problem with ArrayList that we can help you with?