2
|
1 |
/*
|
715
|
2 |
* Copyright 1998-2008 Sun Microsystems, Inc. All Rights Reserved.
|
2
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
7 |
* published by the Free Software Foundation. Sun designates this
|
|
8 |
* particular file as subject to the "Classpath" exception as provided
|
|
9 |
* by Sun in the LICENSE file that accompanied this code.
|
|
10 |
*
|
|
11 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
12 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
13 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
14 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
15 |
* accompanied this code).
|
|
16 |
*
|
|
17 |
* You should have received a copy of the GNU General Public License version
|
|
18 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
19 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
20 |
*
|
|
21 |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
22 |
* CA 95054 USA or visit www.sun.com if you need additional information or
|
|
23 |
* have any questions.
|
|
24 |
*/
|
|
25 |
|
|
26 |
package com.sun.tools.example.debug.gui;
|
|
27 |
|
|
28 |
import java.io.*;
|
|
29 |
import java.util.*;
|
|
30 |
|
|
31 |
public class SearchPath {
|
|
32 |
|
|
33 |
private String pathString;
|
|
34 |
|
|
35 |
private String[] pathArray;
|
|
36 |
|
|
37 |
public SearchPath(String searchPath) {
|
|
38 |
//### Should check searchpath for well-formedness.
|
|
39 |
StringTokenizer st = new StringTokenizer(searchPath, File.pathSeparator);
|
|
40 |
List<String> dlist = new ArrayList<String>();
|
|
41 |
while (st.hasMoreTokens()) {
|
|
42 |
dlist.add(st.nextToken());
|
|
43 |
}
|
|
44 |
pathString = searchPath;
|
51
|
45 |
pathArray = dlist.toArray(new String[dlist.size()]);
|
2
|
46 |
}
|
|
47 |
|
|
48 |
public boolean isEmpty() {
|
|
49 |
return (pathArray.length == 0);
|
|
50 |
}
|
|
51 |
|
|
52 |
public String asString() {
|
|
53 |
return pathString;
|
|
54 |
}
|
|
55 |
|
|
56 |
public String[] asArray() {
|
51
|
57 |
return pathArray.clone();
|
2
|
58 |
}
|
|
59 |
|
|
60 |
public File resolve(String relativeFileName) {
|
|
61 |
for (int i = 0; i < pathArray.length; i++) {
|
|
62 |
File path = new File(pathArray[i], relativeFileName);
|
|
63 |
if (path.exists()) {
|
|
64 |
return path;
|
|
65 |
}
|
|
66 |
}
|
|
67 |
return null;
|
|
68 |
}
|
|
69 |
|
|
70 |
//### return List?
|
|
71 |
|
|
72 |
public String[] children(String relativeDirName, FilenameFilter filter) {
|
|
73 |
// If a file appears at the same relative path
|
|
74 |
// with respect to multiple entries on the classpath,
|
|
75 |
// the one corresponding to the earliest entry on the
|
|
76 |
// classpath is retained. This is the one that will be
|
|
77 |
// found if we later do a 'resolve'.
|
|
78 |
SortedSet<String> s = new TreeSet<String>(); // sorted, no duplicates
|
|
79 |
for (int i = 0; i < pathArray.length; i++) {
|
|
80 |
File path = new File(pathArray[i], relativeDirName);
|
|
81 |
if (path.exists()) {
|
|
82 |
String[] childArray = path.list(filter);
|
|
83 |
if (childArray != null) {
|
|
84 |
for (int j = 0; j < childArray.length; j++) {
|
|
85 |
if (!s.contains(childArray[j])) {
|
|
86 |
s.add(childArray[j]);
|
|
87 |
}
|
|
88 |
}
|
|
89 |
}
|
|
90 |
}
|
|
91 |
}
|
51
|
92 |
return s.toArray(new String[s.size()]);
|
2
|
93 |
}
|
|
94 |
|
|
95 |
}
|