KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > openidex > search > SubnodesSearchInfo


1 /*
2  * The contents of this file are subject to the terms of the Common Development
3  * and Distribution License (the License). You may not use this file except in
4  * compliance with the License.
5  *
6  * You can obtain a copy of the License at http://www.netbeans.org/cddl.html
7  * or http://www.netbeans.org/cddl.txt.
8  *
9  * When distributing Covered Code, include this CDDL Header Notice in each file
10  * and include the License file at http://www.netbeans.org/cddl.txt.
11  * If applicable, add the following below the CDDL Header, with the fields
12  * enclosed by brackets [] replaced by your own identifying information:
13  * "Portions Copyrighted [year] [name of copyright owner]"
14  *
15  * The Original Software is NetBeans. The Initial Developer of the Original
16  * Software is Sun Microsystems, Inc. Portions Copyright 2004 Sun
17  * Microsystems, Inc. All Rights Reserved.
18  */
19
20 package org.openidex.search;
21
22 import java.util.ArrayList JavaDoc;
23 import java.util.Collections JavaDoc;
24 import java.util.Iterator JavaDoc;
25 import java.util.List JavaDoc;
26 import org.openide.nodes.Node;
27
28 /**
29  *
30  * @author Marian Petras
31  */
32 final class SubnodesSearchInfo implements SearchInfo {
33
34     /** */
35     private final Node node;
36
37     /**
38      *
39      */
40     public SubnodesSearchInfo(final Node node) {
41         this.node = node;
42     }
43
44     /**
45      */
46     public boolean canSearch() {
47         final Node[] nodes = node.getChildren().getNodes(true);
48         for (int i = 0; i < nodes.length; i++) {
49             SearchInfo searchInfo = Utils.getSearchInfo(nodes[i]);
50             if (searchInfo != null && searchInfo.canSearch()) {
51                 return true;
52             }
53         }
54         return false;
55     }
56
57     /**
58      */
59     public Iterator JavaDoc objectsToSearch() {
60         final Node[] nodes = node.getChildren().getNodes(true);
61         if (nodes.length == 0) {
62             return SimpleSearchInfo.EMPTY_SEARCH_INFO.objectsToSearch();
63         }
64         
65         List JavaDoc searchInfoElements = new ArrayList JavaDoc(nodes.length);
66         for (int i = 0; i < nodes.length; i++) {
67             SearchInfo subInfo = Utils.getSearchInfo(nodes[i]);
68             if (subInfo != null && subInfo.canSearch()) {
69                 searchInfoElements.add(subInfo);
70             }
71         }
72         
73         final int size = searchInfoElements.size();
74         switch (size) {
75             case 0:
76                 return Collections.EMPTY_LIST.iterator();
77             case 1:
78                 return ((SearchInfo) searchInfoElements.get(0))
79                        .objectsToSearch();
80             default:
81                 return new CompoundSearchIterator(
82                         (SearchInfo[])
83                         searchInfoElements.toArray(new SearchInfo[size]));
84         }
85     }
86
87 }
88
Popular Tags