|
|||||||||||||||||||
30 day Evaluation Version distributed via the Maven Jar Repository. Clover is not free. You have 30 days to evaluate it. Please visit http://www.thecortex.net/clover to obtain a licensed version of Clover | |||||||||||||||||||
Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
OrderBy.java | 0% | 0% | 0% | 0% |
|
1 |
/*
|
|
2 |
$Id: OrderBy.java,v 1.1 2003/10/09 17:24:19 jstrachan Exp $
|
|
3 |
|
|
4 |
Copyright 2003 (C) James Strachan and Bob Mcwhirter. All Rights Reserved.
|
|
5 |
|
|
6 |
Redistribution and use of this software and associated documentation
|
|
7 |
("Software"), with or without modification, are permitted provided
|
|
8 |
that the following conditions are met:
|
|
9 |
|
|
10 |
1. Redistributions of source code must retain copyright
|
|
11 |
statements and notices. Redistributions must also contain a
|
|
12 |
copy of this document.
|
|
13 |
|
|
14 |
2. Redistributions in binary form must reproduce the
|
|
15 |
above copyright notice, this list of conditions and the
|
|
16 |
following disclaimer in the documentation and/or other
|
|
17 |
materials provided with the distribution.
|
|
18 |
|
|
19 |
3. The name "groovy" must not be used to endorse or promote
|
|
20 |
products derived from this Software without prior written
|
|
21 |
permission of The Codehaus. For written permission,
|
|
22 |
please contact info@codehaus.org.
|
|
23 |
|
|
24 |
4. Products derived from this Software may not be called "groovy"
|
|
25 |
nor may "groovy" appear in their names without prior written
|
|
26 |
permission of The Codehaus. "groovy" is a registered
|
|
27 |
trademark of The Codehaus.
|
|
28 |
|
|
29 |
5. Due credit should be given to The Codehaus -
|
|
30 |
http://groovy.codehaus.org/
|
|
31 |
|
|
32 |
THIS SOFTWARE IS PROVIDED BY THE CODEHAUS AND CONTRIBUTORS
|
|
33 |
``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT
|
|
34 |
NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
35 |
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
36 |
THE CODEHAUS OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
|
37 |
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
38 |
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
39 |
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
40 |
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
41 |
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
42 |
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
|
43 |
OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
44 |
|
|
45 |
*/
|
|
46 |
package groovy.util;
|
|
47 |
|
|
48 |
import groovy.lang.Closure;
|
|
49 |
|
|
50 |
import java.util.ArrayList;
|
|
51 |
import java.util.Comparator;
|
|
52 |
import java.util.Iterator;
|
|
53 |
import java.util.List;
|
|
54 |
|
|
55 |
/**
|
|
56 |
* A helper class for sorting objects via a closure to return the field
|
|
57 |
* or operation on which to sort.
|
|
58 |
*
|
|
59 |
* @author <a href="mailto:james@coredevelopers.net">James Strachan</a>
|
|
60 |
* @version $Revision: 1.1 $
|
|
61 |
*/
|
|
62 |
public class OrderBy implements Comparator { |
|
63 |
|
|
64 |
List closures; |
|
65 |
|
|
66 | 0 |
public OrderBy() {
|
67 | 0 |
this.closures = new ArrayList(); |
68 |
} |
|
69 |
|
|
70 | 0 |
public OrderBy(Closure closure) {
|
71 | 0 |
this();
|
72 | 0 |
closures.add(closure); |
73 |
} |
|
74 |
|
|
75 | 0 |
public OrderBy(List closures) {
|
76 | 0 |
this.closures = closures;
|
77 |
} |
|
78 |
|
|
79 | 0 |
public void add(Closure closure) { |
80 | 0 |
closures.add(closure); |
81 |
} |
|
82 |
|
|
83 | 0 |
public int compare(Object object1, Object object2) { |
84 | 0 |
for (Iterator iter = closures.iterator(); iter.hasNext();) {
|
85 | 0 |
Closure closure = (Closure) iter.next(); |
86 | 0 |
Object value1 = closure.call(object1); |
87 | 0 |
Object value2 = closure.call(object2); |
88 |
|
|
89 | 0 |
if (value1 == value2) {
|
90 | 0 |
continue;
|
91 |
} |
|
92 | 0 |
if (value1 == null) { |
93 | 0 |
return -1;
|
94 |
} |
|
95 | 0 |
if (value1 instanceof Comparable) { |
96 | 0 |
Comparable c1 = (Comparable) value1; |
97 | 0 |
return c1.compareTo(value2);
|
98 |
} |
|
99 | 0 |
if (value1.equals(value2)) {
|
100 | 0 |
continue;
|
101 |
} |
|
102 | 0 |
return value1.hashCode() - value2.hashCode();
|
103 |
} |
|
104 | 0 |
return 0;
|
105 |
} |
|
106 |
} |
|
107 |
|
|