boolean function ( final int arg0 ) { final Entry < T > [ ] loc0 = table ; final int loc1 = ( arg0 & 0x7FFFFFFF ) % loc0 . length ; for ( Entry < T > loc2 = loc0 [ loc1 ] ; loc2 != null ; loc2 = loc2 . next ) { if ( loc2 . hash == arg0 ) { return true ; } } return false ; }
tests if the specified object is a key in this hashtable . concode_field_sep Entry<T> table[] concode_elem_sep Entry<E> next concode_elem_sep float loadFactor concode_elem_sep int count concode_elem_sep int threshold concode_elem_sep E value concode_elem_sep int hash concode_elem_sep int key concode_field_sep boolean contains concode_elem_sep int size concode_elem_sep T get concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep void rehash concode_elem_sep boolean containsValue concode_elem_sep Object put concode_elem_sep Object remove