[RFC][icedtea-web]: Added support for signed JNLP file

Deepak Bhole dbhole at redhat.com
Tue Jun 28 08:31:26 PDT 2011

* Jiri Vanek <jvanek at redhat.com> [2011-06-28 10:49]:
> mOn 06/28/2011 04:10 PM, Deepak Bhole wrote:
> >* Jiri Vanek<jvanek at redhat.com>  [2011-06-28 05:19]:
> I thought that all across java platform (especially for Collections - for Arrays I can be wrong) is used Heap sort, and thats because It is keeping order of untouched sequences.

It uses a modified mergesort. From the docs:

The sorting algorithm is a modified mergesort (in which the merge is
omitted if the highest element in the low sublist is less than the
lowest element in the high sublist). This algorithm offers guaranteed
n*log(n) performance. 

> I still think Saad's  code is m much more bullet proof.

Ah! The sorting approach was just off the top of my head -- you are
right, there is no easy way to eliminate cases with duplicates.

As much as I dislike bruteforce, I guess it is the only (reasonable)
approach :/


More information about the distro-pkg-dev mailing list