int function ( int arg0 ) { int loc0 = binarySearch ( mKeys , 0 , mSize , arg0 ) ; if ( loc0 < 0 ) { loc0 = ~ loc0 ; if ( loc0 > 0 ) { loc0 -- ; } return mValues [ loc0 ] ; } else { return mValues [ loc0 ] ; } }
gets the int mapped from the specified key , or if not present , the closest key that is less than the specified key . concode_field_sep int[] mKeys concode_elem_sep int mSize concode_elem_sep int[] mValues concode_field_sep int keyAt concode_elem_sep int size concode_elem_sep int indexOfKey concode_elem_sep int get concode_elem_sep int get concode_elem_sep void clear concode_elem_sep void removeAt concode_elem_sep int valueAt concode_elem_sep int indexOfValue concode_elem_sep int binarySearch concode_elem_sep void delete concode_elem_sep void put concode_elem_sep void append