import java.util.Map;	
import java.util.TreeMap;
import java.util.Scanner;	
import java.io.File;

/**
 * Class that stores words and their frequencies.
 *   @author Dave Reed
 *   @version 8/25/13
 */
public class WordFreq {
    private Map<String, Integer> words;
    
    public WordFreq() {
        words = new TreeMap<String, Integer>();
    }
    
    public WordFreq(String filename) {
        this();
        try {
            Scanner infile = new Scanner(new File(filename));
            while (infile.hasNext()) {
                String nextWord = infile.next();
                this.add(nextWord);
            }
            infile.close();
        }
        catch (java.io.FileNotFoundException e) {
            System.out.println("FILE NOT FOUND");
        }
    }
    
    public void add(String newWord) {
        String cleanWord = newWord.toLowerCase();
        if (words.containsKey(cleanWord)) {
            words.put(cleanWord, words.get(cleanWord)+1);
        }
        else {
            words.put(cleanWord, 1);
        }
    }

    public void showAll() {
        for (String str : words.keySet()) {
            System.out.println(str + ": " + words.get(str));
        }
    }
    
    ////////////////////////////////////////////////////////
    
    public static void main(String[] args) {
    	WordFreq freq = new WordFreq();
    	freq.add("foo");
    	freq.add("bar");
    	freq.add("foo");
    	
        freq.showAll();
    }
}