/**
 * ========================================================================
 * TestTreeSet.javat: Read a stream of words from standard input. Store in
 * order in a tree set. 
 * 
 * Author: Mark Austin
 * ========================================================================
 */

import java.util.*;

public class TestTreeSet {
   public static void main(String[] args) {
      TreeSet<String> words = new TreeSet<String>(); 
      long totalTime = 0;

      // Use a Scanner to read words from standard input.
      // Keep track of the time, measured in milliseconds.

      Scanner in = new Scanner(System.in);
      while (in.hasNext()) {
         String word   = in.next();
         long callTime = System.currentTimeMillis();
         words.add(word);
         callTime = System.currentTimeMillis() - callTime;
         totalTime += callTime;
      }

      // Print up to the first 20 words ....

      System.out.println("Print up to the first 20 distinct words ");
      System.out.println("======================================= ");

      Iterator<String> iter = words.iterator();
      for (int i = 1; i <= 20 && iter.hasNext(); i++)
         System.out.println(iter.next());

      // Print number of distinct words ...

      System.out.println("======================================= ");
      System.out.println(words.size() + " distinct words. " + totalTime + " milliseconds.");
      System.out.println("======================================= ");
   }
}