This project has retired. For details please refer to its Attic page.
ProxyConnectorOrderComparator xref
View Javadoc
1   package org.apache.archiva.proxy;
2   
3   /*
4    * Licensed to the Apache Software Foundation (ASF) under one
5    * or more contributor license agreements.  See the NOTICE file
6    * distributed with this work for additional information
7    * regarding copyright ownership.  The ASF licenses this file
8    * to you under the Apache License, Version 2.0 (the
9    * "License"); you may not use this file except in compliance
10   * with the License.  You may obtain a copy of the License at
11   *
12   *  http://www.apache.org/licenses/LICENSE-2.0
13   *
14   * Unless required by applicable law or agreed to in writing,
15   * software distributed under the License is distributed on an
16   * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
17   * KIND, either express or implied.  See the License for the
18   * specific language governing permissions and limitations
19   * under the License.
20   */
21  
22  import org.apache.archiva.proxy.model.ProxyConnector;
23  
24  import java.util.Comparator;
25  
26  /**
27   * ProxyConnectorOrderComparator 
28   *
29   *
30   */
31  public class ProxyConnectorOrderComparator
32      implements Comparator<ProxyConnector>
33  {
34      private static ProxyConnectorOrderComparatorr.html#ProxyConnectorOrderComparator">ProxyConnectorOrderComparator INSTANCE = new ProxyConnectorOrderComparator();
35  
36      public static ProxyConnectorOrderComparator getInstance()
37      {
38          return INSTANCE;
39      }
40  
41      @Override
42      public int compare( ProxyConnector o1, ProxyConnector o2 )
43      {
44          if ( o1 == null && o2 == null )
45          {
46              return 0;
47          }
48  
49          // Ensure null goes to end of list.
50          if ( o1 == null && o2 != null )
51          {
52              return 1;
53          }
54  
55          if ( o1 != null && o2 == null )
56          {
57              return -1;
58          }
59  
60          // Ensure 0 (unordered) goes to end of list.
61          if ( o1.getOrder() == 0 && o2.getOrder() != 0 )
62          {
63              return 1;
64          }
65  
66          if ( o1.getOrder() != 0 && o2.getOrder() == 0 )
67          {
68              return -1;
69          }
70  
71          return o1.getOrder() - o2.getOrder();
72      }
73  }