E function ( long arg0 , E arg1 ) { int loc0 = binarySearch ( mKeys , 0 , mSize , arg0 ) ; if ( loc0 < 0 || mValues [ loc0 ] == DELETED || mValues [ loc0 ] . get ( ) == null ) { return arg1 ; } else { return ( E ) mValues [ loc0 ] . get ( ) ; } }
gets the object mapped from the specified key , or the specified object if no such mapping has been made . concode_field_sep Object DELETED_REF concode_elem_sep WeakReference<?> DELETED concode_elem_sep long[] mKeys concode_elem_sep boolean mGarbage concode_elem_sep int mSize concode_elem_sep WeakReference<?>[] mValues concode_field_sep long keyAt concode_elem_sep void clear concode_elem_sep E valueAt concode_elem_sep int indexOfValue concode_elem_sep int binarySearch 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 void removeAt concode_elem_sep boolean hasReclaimedRefs concode_elem_sep void gc concode_elem_sep void append