package second_term.sixth_chapter;

public class OrderedArrayList<T> extends ArrayList<T> implements OrderedListADT<T> {

    public OrderedArrayList(){
        super();
    }

    public OrderedArrayList(int initialCapacity){
        super(initialCapacity);
    }
    @Override
    public void add(T element) {
        if (!(element instanceof Comparable))
            throw new NonComparableElementException("OrderedList");

        Comparable<T> comparableElement = (Comparable<T>)element;

        if (size() == list.length)
            expandCapacity();

        int scan = 0;

        // find the insertion location
        while (scan < rear && comparableElement.compareTo(list[scan]) > 0)
            scan++;

        // shift existing elements up one
        for (int shift=rear; shift > scan; shift--)
            list[shift] = list[shift-1];

        // insert element
        list[scan] = element;
        rear++;
        modCount++;

    }
    public static void main(String []args){
        OrderedListADT list = new OrderedArrayList();
//        list.add("Hello");
//        list.add("Java");
        list.add(5);//子类有序ArrayList的测试
        list.add(6);
        list.add(2);
        list.add(10);
        System.out.println("自动排序后的顺序");
        System.out.println(list);

        System.out.println(list.removefirst());//父类ArrayList的方法测试
        System.out.println(list.removeLast());
        System.out.println(list.first());
        System.out.println(list);

    }
}