It's surely faster to add all the elements and then sort, which is why

the class is SortableArrayList rather than SortedArrayList (which would
just always insert sorted in add()).


git-svn-id: https://samskivert.googlecode.com/svn/trunk@1698 6335cc39-0255-0410-8fd6-9bcaacd3b74c

projects/samskivert/src/java/com/samskivert/util/Collections.java

@@ -63,9 +63,8 @@ public class Collections
                                               Comparator comparator)
     {
         SortableArrayList list = new SortableArrayList();
-        while (itr.hasNext()) {
-            list.insertSorted(itr.next(), comparator);
-        }
+        CollectionUtil.addAll(list, itr);
+        list.sort(comparator);
         return getUnmodifiableIterator(list);
     }