阻塞队列

 

 

import java.io.*;
import java.util.*;
import java.util.concurrent.*;

public class BlockingQueueTest
{
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		System.out.print("Enter base directory (e.g. /usr/local/jdk1.6.0/src): \r\n");
		String directory = in.nextLine();
		System.out.print("Enter keyword (e.g. volatile): \r\n");
		String keyword = in.nextLine();
		final int FILE_QUEUE_SIZE = 10;
		final int SEARCH_THREADS = 100;
		BlockingQueue queue = new ArrayBlockingQueue(FILE_QUEUE_SIZE);
		FileEnumerationTask enumerator = new FileEnumerationTask(queue, new File(directory));
		new Thread(enumerator).start();
		for (int i = 1; i <= SEARCH_THREADS; i++)
			new Thread(new SearchTask(queue, keyword)).start();
	}
}

/**
 * This task enumerates all files in a directory and its subdirectories.
 */
class FileEnumerationTask implements Runnable
{
	/**
	 * Constructs a FileEnumerationTask.
	 * 
	 * @param queue
	 *            the blocking queue to which the enumerated files are added
	 * @param startingDirectory
	 *            the directory in which to start the enumeration
	 */
	public FileEnumerationTask(BlockingQueue queue, File startingDirectory)
	{
		this.queue = queue;
		this.startingDirectory = startingDirectory;
	}

	public void run()
	{
		try
		{
			enumerate(startingDirectory);
			queue.put(DUMMY);
		} catch (InterruptedException e)
		{
		}
	}

	/**
	 * Recursively enumerates all files in a given directory and its
	 * subdirectories
	 * 
	 * @param directory
	 *            the directory in which to start
	 */
	public void enumerate(File directory) throws InterruptedException
	{
		File[] files = directory.listFiles();
		for (File file : files)
		{
			if (file.isDirectory())
				enumerate(file);
			else
				queue.put(file);
		}
	}

	public static File DUMMY = new File("");
	private BlockingQueue queue;
	private File startingDirectory;
}

/**
 * This task searches files for a given keyword.
 */
class SearchTask implements Runnable
{
	/**
	 * Constructs a SearchTask.
	 * 
	 * @param queue
	 *            the queue from which to take files
	 * @param keyword
	 *            the keyword to look for
	 */
	public SearchTask(BlockingQueue queue, String keyword)
	{
		this.queue = queue;
		this.keyword = keyword;
	}

	public void run()
	{
		try
		{
			boolean done = false;
			while (!done)
			{
				File file = queue.take();
				if (file == FileEnumerationTask.DUMMY)
				{
					queue.put(file);
					done = true;
				}
				else
					search(file);
			}
		} catch (IOException e)
		{
			e.printStackTrace();
		} catch (InterruptedException e)
		{
		}
	}

	/**
	 * Searches a file for a given keyword and prints all matching lines.
	 * 
	 * @param file
	 *            the file to search
	 */
	public void search(File file) throws IOException
	{
		Scanner in = new Scanner(new FileInputStream(file));
		int lineNumber = 0;
		while (in.hasNextLine())
		{
			lineNumber++;
			String line = in.nextLine().trim();
			if (line.contains(keyword))
				System.out.printf("%s:%d %s%n", file.getPath(), lineNumber, line);
		}
		in.close();
	}

	private BlockingQueue<File> queue;
	private String keyword;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值