When the input array is partially sorted, while offering the Iterative mergesort that requires far fewer than n lg(n) comparisons Implementation note: This implementation is a stable, adaptive,

The specified list must be modifiable, but need not be resizable. Not be reordered as a result of the sort. This sort is guaranteed to be stable: equal elements will Must not throw a ClassCastException for any elements Mutually comparable (that is, e1.compareTo(e2) Furthermore, all elements in the list must be Sorts the specified list into ascending order, according to theДЄll elements in the list must implement the Comparable ForД®xample, invoking the sort method on an unmodifiable list that isДЄlready sorted may or may not throw UnsupportedOperationException. These algorithms may, but are not required to, throw thisД®xception if an invocation would have no effect on the collection. Support the appropriate mutation primitive(s), such as the set To throw UnsupportedOperationException if the collection does not The 'destructive' algorithms contained in this class, that is, theДЄlgorithms that modify the collection on which they operate, are specified (For example, the algorithm used by sort does not have to beДЄ mergesort, but it does have to be stable.) Substitute other algorithms, so long as the specification itself is adhered SuchДescriptions should be regarded as implementation notes, rather than Generally includes a brief description of the implementation. The documentation for the polymorphic algorithms contained in this class If the collections or class objects provided to them are null. The methods of this class all throw a NullPointerException Specified collection, and a few other odds and ends. It contains polymorphic algorithms that operate onД¬ollections, 'wrappers', which return a new collection backed by a This class consists exclusively of static methods that operate on or returnД¬ollections.

Delphi xe10 thread safe collection