// A program for comparing the performance of DateImpl's hashCode method.
// Barry Cornelius, 19 June 2000
import java.util. HashSet;
import java.util. Iterator;
import java.util. Random;
import java.util. Set;
public class HashCodeTimes
{
   public static void main(final String[] pArgs)
   {
      final Random tRandom = new Random();
      final Set tSet = new HashSet();
      for (int tCount = 1; tCount<=10000; tCount++)
      {
         final int tYear = 1990 + tRandom.nextInt(10); 
         final int tMonth = 1 + tRandom.nextInt(12); 
         final int tDay = 1 + tRandom.nextInt(28); 
         final Date tAddDate = new DateImpl(tYear, tMonth, tDay);
         boolean tResult = tSet.add(tAddDate);
      }
      final Iterator tIterator = tSet.iterator();
      final long tStartTime = System.currentTimeMillis();
      while (tIterator.hasNext())
      {
         final Date tNextDate = (Date) tIterator.next();
         final boolean tResult = tSet.contains(tNextDate);
      }
      final long tFinishTime = System.currentTimeMillis();
      System.out.println(tFinishTime - tStartTime);
   }
}