package org.encodefuture.hellojava.example;
import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.Future;
import java.util.concurrent.FutureTask;
public class FutureTest {
public static void main(String[] args) {
String directory = "E:\\BookLib";
String keyword = "hello";
MatchCounter counter = new MatchCounter(new File(directory), keyword);
FutureTask<Integer> task = new FutureTask<Integer>(counter);
Thread t = new Thread(task);
t.start();
try {
System.out.println("keyword count="+task.get());
} catch (InterruptedException e) {
e.printStackTrace();
} catch (ExecutionException e) {
e.printStackTrace();
}
}
}
class MatchCounter implements Callable {
private File directory;
private String keyword;
private int count;
public MatchCounter(File directory, String keyword) {
this.directory = directory;
this.keyword = keyword;
}
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);
FutureTask task = new FutureTask<>(counter);
results.add(task);
Thread t = new Thread(task);
t.start();
}
else {
int a = search(file);
count += a;
}
}
for (Future<Integer> result : results) {
try {
count += result.get();
} catch (ExecutionException e) {
e.printStackTrace();
}
}
} catch (InterruptedException e) {
e.printStackTrace();
}
return count;
}
//方法判断每个文件中关键字出现次数
public int search(File file) {
try {
try (Scanner in = new Scanner(file)) {
int keywordInFileCount = 0;
while (in.hasNextLine()) {
String line = in.nextLine();
for(int i = 0;i<line.length();i++) {
if(line.indexOf(keyword,i)== i) {
keywordInFileCount++;
}
}
}
//System.out.println(file.getName()+",keywordInFileCount="+keywordInFileCount);打印文件名字和每个文件中关键字出现的次数
return keywordInFileCount;
}
} catch (IOException e) {
return 0;
}
}
}