| /* |
| $Id$ |
| |
| Copyright 2003 (C) James Strachan and Bob Mcwhirter. All Rights Reserved. |
| |
| Redistribution and use of this software and associated documentation |
| ("Software"), with or without modification, are permitted provided |
| that the following conditions are met: |
| |
| 1. Redistributions of source code must retain copyright |
| statements and notices. Redistributions must also contain a |
| copy of this document. |
| |
| 2. Redistributions in binary form must reproduce the |
| above copyright notice, this list of conditions and the |
| following disclaimer in the documentation and/or other |
| materials provided with the distribution. |
| |
| 3. The name "groovy" must not be used to endorse or promote |
| products derived from this Software without prior written |
| permission of The Codehaus. For written permission, |
| please contact info@codehaus.org. |
| |
| 4. Products derived from this Software may not be called "groovy" |
| nor may "groovy" appear in their names without prior written |
| permission of The Codehaus. "groovy" is a registered |
| trademark of The Codehaus. |
| |
| 5. Due credit should be given to The Codehaus - |
| http://groovy.codehaus.org/ |
| |
| THIS SOFTWARE IS PROVIDED BY THE CODEHAUS AND CONTRIBUTORS |
| ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT |
| NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
| FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL |
| THE CODEHAUS OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, |
| INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
| SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
| STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
| OF THE POSSIBILITY OF SUCH DAMAGE. |
| |
| */ |
| package groovy.util; |
| |
| import groovy.lang.Closure; |
| |
| import java.util.ArrayList; |
| import java.util.Comparator; |
| import java.util.Iterator; |
| import java.util.List; |
| |
| /** |
| * A helper class for sorting objects via a closure to return the field |
| * or operation on which to sort. |
| * |
| * @author <a href="mailto:james@coredevelopers.net">James Strachan</a> |
| * @version $Revision$ |
| */ |
| public class OrderBy implements Comparator { |
| |
| List closures; |
| |
| public OrderBy() { |
| this.closures = new ArrayList(); |
| } |
| |
| public OrderBy(Closure closure) { |
| this(); |
| closures.add(closure); |
| } |
| |
| public OrderBy(List closures) { |
| this.closures = closures; |
| } |
| |
| public void add(Closure closure) { |
| closures.add(closure); |
| } |
| |
| public int compare(Object object1, Object object2) { |
| for (Iterator iter = closures.iterator(); iter.hasNext();) { |
| Closure closure = (Closure) iter.next(); |
| Object value1 = closure.call(object1); |
| Object value2 = closure.call(object2); |
| |
| if (value1 == value2) { |
| continue; |
| } |
| if (value1 == null) { |
| return -1; |
| } |
| if (value1 instanceof Comparable) { |
| Comparable c1 = (Comparable) value1; |
| return c1.compareTo(value2); |
| } |
| if (value1.equals(value2)) { |
| continue; |
| } |
| return value1.hashCode() - value2.hashCode(); |
| } |
| return 0; |
| } |
| } |