-
Notifications
You must be signed in to change notification settings - Fork 197
/
Copy pathFileIndex.java
65 lines (56 loc) · 1.88 KB
/
FileIndex.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*************************************************************************
* Compilation: javac FileIndex.java
* Execution: java FileIndex file1.txt file2.txt file3.txt ...
* Dependencies: ST.java SET.java In.java StdIn.java StdOut.java
* Data files: http://algs4.cs.princeton.edu/35applications/ex1.txt
* http://algs4.cs.princeton.edu/35applications/ex2.txt
* http://algs4.cs.princeton.edu/35applications/ex3.txt
* http://algs4.cs.princeton.edu/35applications/ex4.txt
*
* % java FileIndex ex*.txt
* age
* ex3.txt
* ex4.txt
* best
* ex1.txt
* was
* ex1.txt
* ex2.txt
* ex3.txt
* ex4.txt
*
* % java FileIndex *.txt
*
* % java FileIndex *.java
*
*************************************************************************/
import java.io.File;
public class FileIndex {
public static void main(String[] args) {
// key = word, value = set of files containing that word
ST<String, SET<File>> st = new ST<String, SET<File>>();
// create inverted index of all files
StdOut.println("Indexing files");
for (String filename : args) {
StdOut.println(" " + filename);
File file = new File(filename);
In in = new In(file);
while (!in.isEmpty()) {
String word = in.readString();
if (!st.contains(word)) st.put(word, new SET<File>());
SET<File> set = st.get(word);
set.add(file);
}
}
// read queries from standard input, one per line
while (!StdIn.isEmpty()) {
String query = StdIn.readString();
if (st.contains(query)) {
SET<File> set = st.get(query);
for (File file : set) {
StdOut.println(" " + file.getName());
}
}
}
}
}