while ((tree = reader.next()) != null)
countDEP(tree, count, map);
reader.close();
System.out.printf("%5.2f (%d/%d)\n", 100d*count[0]/count[1], count[0], count[1]);
for (StringIntPair p : map.toSortedList())
System.out.println(p.s+" "+p.i);
}
public void countDEP(DEPTree tree, int[] count, Prob1DMap map)
{