import java.io.File;
import java.lang.reflect.Method;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeSet;
public class UnsortedSetTest {
public static void main(String[] args) throws Exception {
String[] allFileNames = { "hounds.txt", "huckfinn.txt", "oz.txt", "war.txt", "ciaFactBook2008.txt"};
String[] noCIA = { "hounds.txt", "huckfinn.txt", "oz.txt", "war.txt"};
countWords(new BinarySearchTree<String>(), allFileNames[0]);
for (String s : allFileNames) {
System.out.println(s);
countWordsOurUnsortedSet(s);
countWordsOurBinarySearchTree(s);
countWordsOurHash(s);
countWordsCollection(new TreeSet<String>(), s);
int[] result = countWordsCollection(new HashSet<String>(), s);
System.out.println(result[0] + " total words.");
System.out.println(result[1] + " distinct words.");
System.out.println();
}
}
// return total num words, and num distinct words
public static in