import java.io.File;
import java.io.FileNotFoundException;
import java.util.*;

/**
 * Compares the runtime of using various data structures to
 * read in a large dictionary with duplicates.  See the slides
 * for graphs of the results.
 *
 *  @author Adam Blank
 */
public class WordCount {
    private static long start, stop;

    public static int timeUniqueList(List<String> words, List<String> ds)
            throws FileNotFoundException {
        start = System.currentTimeMillis();

        for (int i = 0; i < words.size(); i++) {
            if (!ds.contains(words.get(i))) {
                ds.add(words.get(i));
            }
        }
        return ds.size();
    }

    public static int timeUniqueSet(List<String> words, Set<String> ds)
            throws FileNotFoundException {
        start = System.currentTimeMillis();
        ds.addAll(words);
        return words.size();
    }

    public static void main(String[] args) throws FileNotFoundException {
        List<String> allWords = readFromFile("10000.txt");

        int n = 50000;

        List<String> words = allWords.subList(0, n);
        System.out.println("Doing " + words.size() + " words.");

        timeUniqueList(words, new ArrayList<String>());
        printResult("ArrayList", words.size());

        timeUniqueList(words, new LinkedList<String>());
        printResult("LinkedList", words.size());

        timeUniqueSet(words, new HashSet<String>());
        printResult("HashSet", words.size());

        timeUniqueSet(words, new TreeSet<String>());
        printResult("TreeSet", words.size());
    }

    public static void printResult(String type, int n) {
        stop = System.currentTimeMillis();
        System.out.println(type + "(" + n + "): " + (stop - start) + "ms");
    }

    public static List<String> readFromFile(String filename)
            throws FileNotFoundException {
        List<String> words = new ArrayList<String>();
        Scanner scanner = new Scanner(new File(filename));
        while (scanner.hasNext()) {
            words.add(scanner.next());
        }
        return words;
    }
}