Java读取文件中单词进行排序并写到另一个文件中

支持 http://ifeve.com/tao-code-match-1/ ，用fork-join来实现

读取一个文件中的单词(使用BufferedReader按行读取)，排序(使用fork-join框架快速排序)，写到另一个文件中(使用BufferedWriter進行寫入)

代码在github上：https://github.com/chenzehe/wordsorter-java

SortMain.java

package com.chenzehe.wordsorter;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Date;
import java.util.concurrent.ForkJoinPool;

/**
 * 
 * @description 读取一个文件中的字符(使用BufferedReader按行读取)，排序(使用fork-join框架快速排序)，写到另一个文件中(
 *              使用BufferedWriter進行寫入)
 * @author chenzehe
 * @email hljuczh@163.com
 * @create 2013年12月3日 下午2:56:49
 */
public class SortMain {
	private static SortMain instance = null;
	private String[] words;
	private final int THREADS = 12;

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Date start = new Date();
		SortMain sortMain = SortMain.getInstance();
		if (args == null || args.length < 1) {
			args = new String[2];
			args[0] = sortMain.getClass().getClassLoader().getResource("")
					.getPath()
					+ "com/chenzehe/wordsorter/sowpods.txt";
			args[1] = sortMain.getClass().getClassLoader().getResource("")
					.getPath()
					+ "com/chenzehe/wordsorter/out.txt";
		}
		sortMain.getWordsFromInput(args[0]);
		sortMain.sort();
		sortMain.writeWordsToOutput(args[1]);
		Date end = new Date();
		long timeDiff = end.getTime() - start.getTime();
		System.out.println("total:" + timeDiff + "ms");
	}

	/**
	 * 调用fork-join框架快速排序
	 */
	public void sort() {
		Date start = new Date();
		ForkJoinSortTask wordsSortTask = new ForkJoinSortTask(words);
		ForkJoinPool forkJoinPool = new ForkJoinPool(THREADS);
		forkJoinPool.invoke(wordsSortTask);
		Date end = new Date();
		long timeDiff = end.getTime() - start.getTime();
		System.out.println("sort:" + timeDiff + "ms");
	}

	/**
	 * 按行读取文件保存到集合中 使用BufferedReader按行读取
	 * 
	 * @param inputFile
	 * @return
	 */
	public void getWordsFromInput(String inputFile) {
		Date start = new Date();
		FileReader fileReader = null;
		BufferedReader bufferedReader = null;
		try {
			fileReader = new FileReader(inputFile);
			bufferedReader = new BufferedReader(fileReader);
			String linevalue;
			int i = 0;
			while ((linevalue = bufferedReader.readLine()) != null) {
				// 文件第一行保存行数
				if (words == null) {
					words = new String[Integer.parseInt(linevalue) + 1];
				}
				words[i] = linevalue;
				i += 1;
			}
		} catch (Exception e) {
			e.printStackTrace();
		} finally {
			try {
				bufferedReader.close();
				fileReader.close();
			} catch (IOException e) {
				e.printStackTrace();
			}

		}
		Date end = new Date();
		long timeDiff = end.getTime() - start.getTime();
		System.out.println("read file:" + timeDiff + "ms");
	}

	/**
	 * 把经过排序的集合中的字符写到文件中 使用BufferedWriter進行寫入
	 * 
	 * @param outputFile
	 */
	public void writeWordsToOutput(String outputFile) {
		Date start = new Date();
		FileWriter fileWriter = null;
		BufferedWriter bufferedWriter = null;
		try {
			fileWriter = new FileWriter(outputFile);
			bufferedWriter = new BufferedWriter(fileWriter);
			for (int i = 0; i < words.length; i++) {
				String outputWord = (i == words.length - 1) ? words[i]
						: words[i] + "\n";
				bufferedWriter.write(outputWord);
			}
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				bufferedWriter.close();
				fileWriter.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		Date end = new Date();
		long timeDiff = end.getTime() - start.getTime();
		System.out.println("write file:" + timeDiff + "ms");
	}

	private static SortMain getInstance() {
		if (instance == null) {
			instance = new SortMain();
		}
		return instance;
	}
}

 

ForkJoinSortTask.java

package com.chenzehe.wordsorter;

import java.util.concurrent.RecursiveAction;

/**
 * 
 * @description 使用fork-join框架，快速排序算法对数组进行排序
 * @author chenzehe
 * @email hljuczh@163.com
 * @create 2013年12月3日 下午2:56:49
 * 
 */
public class ForkJoinSortTask extends RecursiveAction {
	private static final long serialVersionUID = -1738015707066879398L;
	public final String[] words;
	final int lo;
	final int hi;

	public ForkJoinSortTask(String[] array) {
		this.words = array;
		this.lo = 0;
		this.hi = array.length - 1;
	}

	public ForkJoinSortTask(String[] array, int lo, int hi) {
		this.words = array;
		this.lo = lo;
		this.hi = hi;
	}

	@Override
	protected void compute() {
		if (hi - lo > 0) {
			int pivot = partition(words, lo, hi);
			ForkJoinSortTask left = new ForkJoinSortTask(words, lo, pivot - 1);
			ForkJoinSortTask right = new ForkJoinSortTask(words, pivot + 1, hi);
			invokeAll(left, right);
		}
	}

	/**
	 * 对数组进行分区操作，并返回中间元素位置
	 */
	private int partition(String[] array, int lo, int hi) {
		String x = array[hi];
		int i = lo - 1;
		for (int j = lo; j < hi; j++) {
			if (array[j].compareTo(x) <= 0) {
				i++;
				swap(array, i, j);
			}
		}
		swap(array, i + 1, hi);
		return i + 1;
	}

	private void swap(String[] array, int i, int j) {
		if (i != j) {
			String temp = array[i];
			array[i] = array[j];
			array[j] = temp;
		}
	}
}