puts a key/value pair into the array , optimizing for the case where the key is greater than all existing keys in the array . concode_field_sep int[] mKeys concode_elem_sep int mSize concode_elem_sep long[] mValues concode_field_sep void growKeyAndValueArrays concode_elem_sep int keyAt concode_elem_sep void clear concode_elem_sep long valueAt concode_elem_sep int indexOfValue concode_elem_sep int binarySearch concode_elem_sep void delete concode_elem_sep void put concode_elem_sep int size concode_elem_sep int indexOfKey concode_elem_sep long get concode_elem_sep long get concode_elem_sep SparseLongArray clone concode_elem_sep void removeAt
void function ( int arg0 , long arg1 ) { if ( mSize != 0 && arg0 <= mKeys [ mSize - 1 ] ) { put ( arg0 , arg1 ) ; return ; } int loc0 = mSize ; if ( loc0 >= mKeys . length ) { growKeyAndValueArrays ( loc0 + 1 ) ; } mKeys [ loc0 ] = arg0 ; mValues [ loc0 ] = arg1 ; mSize = loc0 + 1 ; }