View Javadoc

1   /*
2    *  Licensed to the Apache Software Foundation (ASF) under one
3    *  or more contributor license agreements.  See the NOTICE file
4    *  distributed with this work for additional information
5    *  regarding copyright ownership.  The ASF licenses this file
6    *  to you under the Apache License, Version 2.0 (the
7    *  "License"); you may not use this file except in compliance
8    *  with the License.  You may obtain a copy of the License at
9    * 
10   *    http://www.apache.org/licenses/LICENSE-2.0
11   * 
12   *  Unless required by applicable law or agreed to in writing,
13   *  software distributed under the License is distributed on an
14   *  "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15   *  KIND, either express or implied.  See the License for the
16   *  specific language governing permissions and limitations
17   *  under the License.
18   * 
19   */
20  package org.apache.directory.mavibot.btree.comparator;
21  
22  
23  import java.util.Comparator;
24  
25  
26  /**
27   * Compares int arrays
28   * 
29   * @author <a href="mailto:dev@directory.apache.org">Apache Directory Project</a>
30   */
31  public class IntArrayComparator implements Comparator<int[]>
32  {
33      /**
34       * Compare two long arrays.
35       * 
36       * @param intArray1 First int array
37       * @param intArray2 Second int array
38       * @return 1 if intArray1 > intArray2, 0 if intArray1 == intArray2, -1 if intArray1 < intArray2
39       */
40      public int compare( int[] intArray1, int[] intArray2 )
41      {
42          if ( intArray1 == intArray2 )
43          {
44              return 0;
45          }
46  
47          if ( intArray1 == null )
48          {
49              if ( intArray2 == null )
50              {
51                  return 0;
52              }
53              else
54              {
55                  return -1;
56              }
57          }
58          else
59          {
60              if ( intArray2 == null )
61              {
62                  return 1;
63              }
64              else
65              {
66                  if ( intArray1.length < intArray2.length )
67                  {
68                      int pos = 0;
69  
70                      for ( int int1 : intArray1 )
71                      {
72                          int int2 = intArray2[pos];
73  
74                          if ( int1 == int2 )
75                          {
76                              pos++;
77                          }
78                          else if ( int1 < int2 )
79                          {
80                              return -1;
81                          }
82                          else
83                          {
84                              return 1;
85                          }
86                      }
87  
88                      return -1;
89                  }
90                  else
91                  {
92                      int pos = 0;
93  
94                      for ( int int2 : intArray2 )
95                      {
96                          int int1 = intArray1[pos];
97  
98                          if ( int1 == int2 )
99                          {
100                             pos++;
101                         }
102                         else if ( int1 < int2 )
103                         {
104                             return -1;
105                         }
106                         else
107                         {
108                             return 1;
109                         }
110                     }
111 
112                     if ( pos < intArray1.length )
113                     {
114                         return 1;
115                     }
116                     else
117                     {
118                         return 0;
119                     }
120                 }
121             }
122         }
123     }
124 }