Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.java.programmer > #17140

Re: verbose sort

Show all headers | View raw

  To: bob smith
From: "Lew" <lew@1:261/38.remove-yy0-this>

  To: bob smith
From: Lew <lewbloch@gmail.com>

 bob smith wrote:
> I have some code that sorts a list like so:
>
> Vector<String> my_list = new Vector<String>();
>
>               Comparator<String> c = new Comparator<String>() {
>                       @Override
>                       public int compare(String object1, String object2) {
>                               if (object1 == null)
>                                       return -1;
>
>                               if (object2 == null)
>                                       return 1;
>
>                               object1 = object1.toLowerCase();
>                               object2 = object2.toLowerCase();
>
>                               return object1.compareTo(object2);
>                       };
>               };
>
> Collections.sort(my_list, c);
>
> This seems like a lot of code for such a common operation.  Is there a more
succinct way of doing this?

Others have shown ways to shorten this, but I'm curious.

"Seems" - such a duck-and-cover word. You made an assessment. Based on what 
criteria?

What is "a lot"?

You could write a cover method.

Apache Commons might have a utility class for that.

--
Lew

-+- BBBS/Li6 v4.10 Dada-1
 + Origin: Prism bbs (1:261/38)
-+- Synchronet 3.16a-Win32 NewsLink 1.98
Time Warp of the Future BBS - telnet://time.synchro.net:24

--- BBBS/Li6 v4.10 Dada-1
 * Origin: Prism bbs (1:261/38)
--- Synchronet 3.16a-Win32 NewsLink 1.98
Time Warp of the Future BBS - telnet://time.synchro.net:24

Back to comp.lang.java.programmer | Previous | Next | Find similar | Unroll thread

Thread

Re: verbose sort "Lew" <lew@1:261/38.remove-5qr-this> - 2012-08-04 18:41 +0000

csiph-web