add the provided element to the list . the position of the element is determined by the ordering as defined by the associated comparator . the insertion is determined by first performing a binary search to determine the location of the insert and then , finally adding the element . concode_field_sep Comparator<E> comparator concode_elem_sep long serialVersionUID concode_elem_sep LinkedList<E> list concode_field_sep List<E> subList concode_elem_sep E set concode_elem_sep SortedList<E> getClone concode_elem_sep Comparator<E> getComparator concode_elem_sep boolean containsAll concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep boolean remove concode_elem_sep E remove concode_elem_sep int lastIndexOf concode_elem_sep boolean contains concode_elem_sep Iterator<E> iterator concode_elem_sep boolean removeAll concode_elem_sep int size concode_elem_sep void setComparator concode_elem_sep boolean addAll concode_elem_sep boolean addAll concode_elem_sep E get concode_elem_sep Object[] toArray concode_elem_sep T[] toArray concode_elem_sep ListIterator<E> listIterator concode_elem_sep ListIterator<E> listIterator concode_elem_sep int indexOf concode_elem_sep boolean retainAll
boolean function ( E arg0 ) { int loc0 = Collections . binarySearch ( this . list , arg0 , comparator ) ; if ( loc0 < 0 ) this . list . add ( - loc0 - 1 , arg0 ) ; else this . list . add ( loc0 , arg0 ) ; return true ; }