1   /**
2    * Copyright (c) 2000-2009 Liferay, Inc. All rights reserved.
3    *
4    * Permission is hereby granted, free of charge, to any person obtaining a copy
5    * of this software and associated documentation files (the "Software"), to deal
6    * in the Software without restriction, including without limitation the rights
7    * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8    * copies of the Software, and to permit persons to whom the Software is
9    * furnished to do so, subject to the following conditions:
10   *
11   * The above copyright notice and this permission notice shall be included in
12   * all copies or substantial portions of the Software.
13   *
14   * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15   * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16   * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17   * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18   * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19   * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
20   * SOFTWARE.
21   */
22  
23  package com.liferay.portlet.wiki.util.comparator;
24  
25  import com.liferay.portlet.wiki.model.WikiNode;
26  
27  import java.util.Arrays;
28  import java.util.Comparator;
29  
30  /**
31   * <a href="VisibleNodesComparator.java.html"><b><i>View Source</i></b></a>
32   *
33   * @author Jorge Ferrer
34   *
35   */
36  public class VisibleNodesComparator implements Comparator<WikiNode> {
37  
38      public VisibleNodesComparator(String[] visibleNodes) {
39          _visibleNodes = visibleNodes;
40      }
41  
42      public int compare(WikiNode node1, WikiNode node2) {
43          int pos1 = Arrays.binarySearch(_visibleNodes, node1.getName());
44          int pos2 = Arrays.binarySearch(_visibleNodes, node2.getName());
45  
46          if (pos1 < 0) {
47              return 1;
48          }
49  
50          if (pos2 < 0) {
51              return -1;
52          }
53  
54          return pos1 - pos2;
55      }
56  
57      private String[] _visibleNodes;
58  
59  }