-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathThreadPoolTest.java
More file actions
104 lines (80 loc) · 2.28 KB
/
ThreadPoolTest.java
File metadata and controls
104 lines (80 loc) · 2.28 KB
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
package threadPool;
import java.io.*;
import java.util.*;
import java.util.concurrent.*;
public class ThreadPoolTest {
public static void main(String[] args) throws Exception{
// TODO Auto-generated method stub
Scanner in=new Scanner(System.in);
System.out.print("Enter base directory(e.g. /usr/local/jdk5.0/src):");
String directory=in.next();
System.out.print("Enter keyword (e.g. volatile):");
String keyword=in.next();
System.out.println("keyword:"+keyword+"directory:"+directory);
ExecutorService pool=Executors.newCachedThreadPool();
MatchCounter counter=new MatchCounter(new File(directory),keyword,pool);
Future<Integer> result=pool.submit(counter);
try{
System.out.println(result.get()+"matching files");
}catch(ExecutionException e){
e.printStackTrace();
}catch(InterruptedException e){
}
pool.shutdown();
int largestPoolSize=((ThreadPoolExecutor) pool).getLargestPoolSize();
System.out.println("largest pool size="+largestPoolSize);
}
}
class MatchCounter implements Callable<Integer>{
private File directory;
private String keyword;
private ExecutorService pool;
private int count;
public MatchCounter(File directory,String keyword,ExecutorService pool){
this.directory=directory;
this.keyword=keyword;
this.pool=pool;
}
public Integer call(){
count=0;
try {
File[] files=directory.listFiles();
List<Future<Integer>> results=new ArrayList<>();
for(File file:files)
if(file.isDirectory()){
MatchCounter counter=new MatchCounter(file,keyword,pool);
Future<Integer> result=pool.submit(counter);
results.add(result);
}
else{
if(search(file)) count++;
}
for(Future<Integer> result:results)
try {
count+=result.get();
} catch (ExecutionException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
return count;
}
public boolean search(File file){
try{
try(Scanner in=new Scanner(file)){
boolean found=false;
while(!found&&in.hasNext()){
String line=in.nextLine();
if(line.contains(keyword))
found=true;
}
return found;
}
}catch(IOException e){
return false;
}
}
}