java查询指定文件夹下所有文件中指定关键字出现的次数

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;
}
}
}

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值