void function ( long arg0 , E arg1 ) { if ( mSize != 0 && arg0 <= mKeys [ mSize - 1 ] ) { put ( arg0 , arg1 ) ; return ; } if ( mGarbage && mSize >= mKeys . length ) { gc ( ) ; } mKeys = GrowingArrayUtils . append ( mKeys , mSize , arg0 ) ; mValues = GrowingArrayUtils . append ( mValues , mSize , arg1 ) ; mSize ++ ; }
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 Object DELETED concode_elem_sep long[] mKeys concode_elem_sep boolean mGarbage concode_elem_sep int mSize concode_elem_sep Object[] mValues concode_field_sep long keyAt concode_elem_sep void clear concode_elem_sep E valueAt concode_elem_sep int indexOfValue concode_elem_sep void delete concode_elem_sep void remove concode_elem_sep void put concode_elem_sep void setValueAt concode_elem_sep int size concode_elem_sep int indexOfKey concode_elem_sep E get concode_elem_sep E get concode_elem_sep LongSparseArray<E> clone concode_elem_sep void removeAt concode_elem_sep String toString concode_elem_sep void gc