Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #17144
| From | "bob smith" <bob.smith@1:261/38.remove-5qr-this> |
|---|---|
| Subject | Re: verbose sort |
| Message-ID | <501D6350.56104.calajapr@time.synchro.net> (permalink) |
| Newsgroups | comp.lang.java.programmer |
| Date | 2012-08-04 18:41 +0000 |
| Organization | tds.net |
To: markspace
From: "bob smith" <bob.smith@1:261/38.remove-yy0-this>
To: markspace
From: bob smith <bob@coolfone.comze.com>
On Thursday, August 2, 2012 12:19:50 PM UTC-5, markspace wrote:
> On 8/2/2012 8:37 AM, 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?
>
> >
>
>
>
>
>
> Collections.sort( my_list, String.CASE_INSENSITIVE_ORDER );
Very nice, thanks.
-+- 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
Re: verbose sort "bob smith" <bob.smith@1:261/38.remove-5qr-this> - 2012-08-04 18:41 +0000
csiph-web