I’m having trouble with TreeSet because there is no method to manually sort it. An object in the treeset has changed a critical Comparator value, without being re-inserted. Thats why I’m thinking of creating my own SortedArrayList that uses Collection.sort(ArrayList, Comparator)…
That way I can SortedArrayList.sort();
Any suggestions or input?
What Collections are the Comparable interface useful in?
why not simply remove and re-insert the item into the tree-set so that it is put in the proper place?
I find it very hard selecting the right collection. Has someone written a small list of rules/guidelines? Then maybe I can stop pestering you all with my questions. 
[quote]I find it very hard selecting the right collection. Has someone written a small list of rules/guidelines?
[/quote]
Bruce Eckel has a rather good Java book IMO freely available online. Check out Thinking in Java. Here is a quote from appendix B that’s most relavant to your question:
[quote]Use the containers in the standard Java library. Become proficient with their use and you’ll greatly increase your productivity. Prefer ArrayList for sequences, HashSet for sets, HashMap for associative arrays, and LinkedList for stacks (rather than Stack, although you may want to create an adapter to give a stack interface) and queues (which may also warrant an adapter, as shown in this book). When you use the first three, you should upcast to List, Set, and Map, respectively, so that you can easily change to a different implementation if necessary.
[/quote]