Add reverse sorting for primitives

It’s not actually easy to sort an int[] in reverse in Java. The typical ways you’d sort an array in reverse don’t work on primitives:

 Arrays.sort(array, Collections.reverseOrder()); // no comparators for primitives

 Arrays.sort(array);
 Collections.reverse(Arrays.asList(array)); // view array as a List and reverse it, but Arrays.asList doesn't work for int[]

The shortest way I can think of is

 Arrays.sort(array);
 Collections.reverse(Ints.asList(array));

…which boxes every element in the array.

Perhaps we should consider e.g. Ints.reverseSort or the like.

[Maaartinus]

@lowasser Maybe there should be Ints.reverse(int[])? Then a two step solution would be fast.

[JakeWharton]

That’s what the classpath exemption is for.

On Fri, Sep 8, 2017 at 3:52 PM Jonathan Bluett-Duncan < [e-mail]> wrote:

Edit: On the other hand, that is quite a bit of baggage to add, might as well use https://github.com/mintern-java/primitive.

@thekeenant https://github.com/thekeenant On the other hand, that library looks like it’s licensed under the GPLv2 + Class Exception, which doesn’t sound great to me for projects except GPL-licensed ones.

— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/google/guava/issues/2936#issuecomment-328198178, or mute the thread https://github.com/notifications/unsubscribe-auth/AAEEEZXdAvDJj3s4jjaXEbot8YXiAtolks5sgZrjgaJpZM4PPEa8 .