KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > caucho > db > sql > LongOrder


1 /*
2  * Copyright (c) 1998-2006 Caucho Technology -- all rights reserved
3  *
4  * This file is part of Resin(R) Open Source
5  *
6  * Each copy or derived work must preserve the copyright notice and this
7  * notice unmodified.
8  *
9  * Resin Open Source is free software; you can redistribute it and/or modify
10  * it under the terms of the GNU General Public License as published by
11  * the Free Software Foundation; either version 2 of the License, or
12  * (at your option) any later version.
13  *
14  * Resin Open Source is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE, or any warranty
17  * of NON-INFRINGEMENT. See the GNU General Public License for more
18  * details.
19  *
20  * You should have received a copy of the GNU General Public License
21  * along with Resin Open Source; if not, write to the
22  * Free SoftwareFoundation, Inc.
23  * 59 Temple Place, Suite 330
24  * Boston, MA 02111-1307 USA
25  *
26  * @author Scott Ferguson
27  */

28
29 package com.caucho.db.sql;
30
31 import java.sql.SQLException JavaDoc;
32
33 /**
34  * Ordering an long-valued field.
35  */

36 class LongOrder extends Order {
37   private int _column;
38   
39   LongOrder(int column)
40   {
41     _column = column;
42   }
43
44   public int compare(SelectResult result, int indexA, int indexB)
45     throws SQLException JavaDoc
46   {
47     result.setRow(indexA);
48
49     long valueA = result.getLong(_column);
50     if (result.wasNull())
51       valueA = Long.MIN_VALUE;
52     
53     result.setRow(indexB);
54
55     long valueB = result.getLong(_column);
56     if (result.wasNull())
57       valueB = Long.MIN_VALUE;
58
59     if (valueA < valueB)
60       return isAscending() ? -1 : 1;
61     else if (valueA == valueB)
62       return _next == null ? 0 : _next.compare(result, indexA, indexB);
63     else
64       return isAscending() ? 1 : -1;
65   }
66 }
67
Popular Tags