/**
 * CSE 373, Spring 2011, Jessica Miller
 * An client program to test our StringHashSet (it is the same as the client
 * we used to test our StringTreeSet).
 */
public class StringSetTest {
    public static void main(String[] args) {
        StringSet set = new StringHashSet();
        String[] values = {"Kona", "Daisy", "Michele", "Alan", "Toni", "Martin", "Meghan", "Saptarshi"};
        
        for (String s : values) {
        	set.add(s);
        	set.print();
        	System.out.println("Set has " + set.size() + " element(s)");
        	System.out.println();
        }
        
        
        System.out.println("Alan? " + set.contains("Alan"));
        System.out.println("Michele? " + set.contains("Michele"));
        System.out.println("Toni? " + set.contains("Toni"));
        System.out.println("Jessica? " + set.contains("Jessica"));
        System.out.println("Milda? " + set.contains("Milda"));
        System.out.println("Tyler? " + set.contains("Tyler"));
        System.out.println();
        
        /*
        System.out.println("Alan removed? " + set.remove("Alan"));
        set.print();
        System.out.println();
        System.out.println("Martin removed? " + set.remove("Martin"));
        set.print();   
        System.out.println();
        System.out.println("Kona removed? " + set.remove("Kona"));
        set.print();
        System.out.println();
        System.out.println("Tyler removed? " + set.remove("Tyler"));
        set.print();   
        System.out.println();
        */
        
    }
}