///////    TestSequence.java    ///////
//Terry Pietrondi, JOOP HW5, Part [b], Assignments 6 on page 171
// javac -Xlint:unchecked TestSequence.java
import java.util.Comparator;

public class TestSequence
{   public static void main(String[] args)
    { SimpleDate[] d = 
       {  new SimpleDate(2,12,1949), new SimpleDate(11,7,1998), 

	  // please put in several (say 6) more dates here
		  new SimpleDate(7,20,1999), new SimpleDate(4,12,2005),
          new SimpleDate(4,20,1949), new SimpleDate(7, 23,1997)
       };
	  
	  //Pass in comparator to use for reverse ording in sort
      ArraySequence<SimpleDate> myseq = 
		  new ArraySequence<SimpleDate>(new Comparator<SimpleDate>(){
				  public int compare(SimpleDate d1, SimpleDate d2)
				  { return d2.compareTo(d1);	}
		  }, 256); 

      int i;

      for ( i=0; i < d.length; i++) myseq.add(d[i]);

      for ( i=0; i<myseq.size(); i++) // display the sequence
      { System.out.println( i+" "+myseq.get(i)); }

      i = myseq.index(d[2]);  // find an entry

      if(i != -1)
	  {	myseq.remove(i);        // remove an entry
		System.out.println("\nEntry " + i + " removed");
	  }
	  else
	  { System.out.println(d[2] + " entry not found"); }

      i = myseq.index(d[2]);  // access should fail

      if ( i == -1 ) System.out.println(d[2] + " entry not found");
    }
}