sort the elements using the given comparator . concode_field_sep int size concode_elem_sep E[] data concode_elem_sep int index concode_elem_sep int CAPACITY_SHRINK concode_elem_sep int CAPACITY_INIT concode_field_sep E next concode_elem_sep void add concode_elem_sep void add concode_elem_sep void set concode_elem_sep void trimToSize concode_elem_sep void swap concode_elem_sep void clear concode_elem_sep boolean hasNext concode_elem_sep ObjectArray<E> newInstance concode_elem_sep ObjectArray<E> newInstance concode_elem_sep ObjectArray<E> newInstance concode_elem_sep void throwException concode_elem_sep void remove concode_elem_sep E remove concode_elem_sep E[] createArray concode_elem_sep Iterator<E> iterator concode_elem_sep void setSize concode_elem_sep int size concode_elem_sep void addAll concode_elem_sep E get concode_elem_sep void removeRange concode_elem_sep void toArray concode_elem_sep String toString concode_elem_sep void ensureCapacity concode_elem_sep int indexOf
void function ( Comparator < E > arg0 ) { sort ( arg0 , 0 , size - 1 ) ; }