/*     * 对文章用generateCharTree()函数生成单词树，在对生成的单词树进行排序并且输出     */    public Map sortAndOutput(String filePath) throws IOException {        reader = new FileReader(filePath);        buffer = new BufferedReader(reader);        char c[] = new char[128]; // 防止读入一行太长而出现溢出的情况        int len;        String temp = ""; // 存储buffer读出的字符        String lastWord = ""; // 若读出的最后一个字符是字母，lastWord存储那个字符所在的单词，lastWord就被加到下一轮的temp中        while ((len = buffer.read(c)) > 0) {            temp = ""; // 清空上一轮temp的内容            temp += lastWord;            for (int i = 0; i < len; i++) {                temp += c[i];            }            lastWord = ""; // 清空上一轮lastword的内容            if (Character.isLetter(c[len - 1])) { // 当128个字符的最后一个字符为字母时，就得分情况讨论                int j, t;                for (j = len - 1, t = 0; Character.isLetter(c[j]); j--, t++)                    ; // t代表最后一个字符(c[len-1])为字符时，前面有几个连续的字符                temp = temp.substring(0, temp.length() - t); // 当检测到最后一个字符为字母时，直接将最后一个字符所在的单词剔除本轮的temp，而转接到下一轮的temp中                for (int k = j + 1; k < len; k++) {                    lastWord += c[k];                }            }            root = generateCharTree(temp);        }        List<Word> list = new ArrayList<Word>();        searchTree(list, root);        // 对生成的单词树按照单词的次数逆向排序排序        Collections.sort(list, new Comparator<Object>() {            @Override            public int compare(Object o1, Object o2) {                Word word1 = (Word) o1;                Word word2 = (Word) o2;                return word2.getNum() - word1.getNum();            }        });        buffer.close();        reader.close();        root=new CharTreeNode();  //但对于输入的是目录时，对每篇文章建立的树统计完后，应当初始化这棵树，便于下篇文章建树    //    System.out.println("单词\t数量");        Map<String,Integer> map=new HashMap<String,Integer>();        for (int i = 0; i < list.size(); i++) {            //System.out.println(((Word) list.get(i)).getWord() + "\t" + ((Word) list.get(i)).getNum());            map.put(((Word) list.get(i)).getWord(), ((Word) list.get(i)).getNum());        }        return map;    }

@RunWith(Parameterized.class)public class CountWordFreqTest {    private CountWordFreq ctf = new CountWordFreq();    private String filePath;    private static Map map = new HashMap<String, Integer>();    public CountWordFreqTest(String filePath, Map map) {        this.filePath = filePath;        this.map = map;    }    @Parameters    public static Collection data() { // 下面是一些测试样例        map.put("very", 2);        map.put("english", 1);        map.put("exteremely", 1);        map.put("is", 1);        map.put("my", 1);        map.put("poor", 1);        return Arrays.asList(new Object[][] {  // 这儿的Map是填充数据后的Map            { "f:/document/cs.txt", map },             { "f:/document/hello.txt", map },             { null, map },         });    }    @Test    public void testInputFilePathtest() throws IOException {        Map rsmap = ctf.sortAndOutput(filePath);        Assert.assertEquals("map should match rsmap", map, rsmap);       //Assert.assertNull("空指针异常", rsmap);    }}