returns an index for which #valueat would return thespecified key , or a negative number if no keys map to the specified value . beware that this is a linear search , unlike lookups by key , and that multiple keys can map to the same value and this will find only one of them . concode_field_sep Object DELETED concode_elem_sep int[] mKeys concode_elem_sep boolean mGarbage concode_elem_sep int mSize concode_elem_sep Object[] mValues concode_field_sep int keyAt concode_elem_sep List<E> getValues concode_elem_sep void clear concode_elem_sep E valueAt 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 E get concode_elem_sep E get concode_elem_sep void ensureCapacity concode_elem_sep void gc concode_elem_sep void append
int function ( E arg0 ) { if ( mGarbage ) { gc ( ) ; } Object [ ] loc0 = this . mValues ; for ( int loc1 = 0 ; loc1 < mSize ; loc1 ++ ) if ( loc0 [ loc1 ] == arg0 ) return loc1 ; return - 1 ; }