tries to locate the key that matches the given key-parameter as closely as possible . if greater is set to true , then - if the coordinate is not contained in the list - the next coordinate is given , else the previous one is returned . concode_field_sep boolean enableQuickLookup concode_elem_sep int size concode_elem_sep long[] EMPTY_KEYS concode_elem_sep long[] EMPTY_AGES concode_elem_sep long[] keys concode_elem_sep long scaleFactor concode_elem_sep int increment concode_elem_sep long[] age concode_field_sep boolean add concode_elem_sep long getPrevious concode_elem_sep long getAge concode_elem_sep int findKeyInternal concode_elem_sep long findKey concode_elem_sep boolean containsKey concode_elem_sep void clear concode_elem_sep long getNext concode_elem_sep int binarySearch concode_elem_sep long[] getKeys concode_elem_sep long[] getKeys concode_elem_sep boolean isEnableQuickLookup concode_elem_sep long getKeyAt concode_elem_sep boolean remove concode_elem_sep void setEnableQuickLookup concode_elem_sep boolean removeAll concode_elem_sep int size concode_elem_sep void ensureCapacity
int function ( final long arg0 , final boolean arg1 ) { final int loc0 = findKeyInternal ( arg0 ) ; if ( loc0 == size ) { return size - 1 ; } if ( loc0 >= 0 ) { return loc0 ; } if ( loc0 == - ( size + 1 ) ) { return size - 1 ; } if ( arg1 ) { return ( - loc0 - 1 ) ; } else { return ( - loc0 - 2 ) ; } }