Help with generics...

Question

Hi, I'm writing a program, and as specified by my instructor I'm implementing generics.
I get most of generics, but some of it is still blurry to me.
Here is my code:
public class ListSortedArrayBased<ListType extends Comparable<ListType>>
implements ListSortedInterface<ListType>, Iterable<ListType>
     private int size;
     private ListType[] list;
     private int arraySize;
    public ListSortedArrayBased()
         size = 0;
         arraySize = 2;
         list = (ListType[]) new Comparable[arraySize];
     public boolean isEmpty()
          return size == 0;
     public int size()
          return size;
     public void add(ListType item) throws ListException
          int index = locateIndex(item, true);
          if(index == -1)
               throw new ListException("Item already exists in the list.  Add failed.");
          else
               add(item, index);
               if(size == arraySize)     //check for resize after adding (more efficient than checking before so that
                    arrayResize(size*2);  //locateIndex will never go out of bounds of the array in case of a full array.
     private void add(ListType item, int index)
          shift(size - 1, index, true); //shift the items to the right to make room for the new item
          list[index] = item;
          size++;
     public void remove(ListType item) throws ListException
          int index = locateIndex(item, false);
          if(index == -1)
               throw new ListException("Item does not exist in the list.  Remove failed.");
          else
               shift(index, size - 1, false); //shifts the items to the left, writing over the item we removed.
               size--;
               if(size < (arraySize/2))
                    if(size != 0)                //list of size 0 has an array of size 2.
                         arrayResize(arraySize/2);
     public void removeAll()
          size = 0;
          list = (ListType[]) new Comparable[2];
          arraySize = 2;
     public Iterator<ListType> iterator()
          return new ListArrayIterator<ListType>(list);
I'm getting the following compile-time error:
ListSortedArrayBased.java:89: incompaitlbe types
found : ListArrayIterator<ListType>
required: java.util.Iterator<ListType>
return new ListArrayIterator<ListType>(list);
^
Any help would be greatly appreciated...
Thanks in advance!
Andrew

Answer 1

Sorry for not posting it already...here's ListArrayIterator:
import java.util.Iterator;
class ListArrayIterator<ListType extends Comparable<ListType>> implements Iterator<Comparable<ListType>>
    *  Keeps track of current iteration index.
    *  The next object returned will be at this index.
   private int index;
   /** The list to be iterated through. */
   private ListType[] items;
   public ListArrayIterator(ListType[] items)
       index = 0;
       this.items = items;
   public void remove()
      throw new UnsupportedOperationException ("Remove not implemented.");
   public boolean hasNext()
      return (index < items.length) && (items[index] != null);
   public ListType next()
      if (hasNext())  //should be used in conjunction with hasNext(), but just in case...
         return(items[index++]);
      else
         throw new ListException("End of list.");
}