int function ( int arg0 , MyType arg1 , int arg2 ) { int loc0 = arg0 ; do { if ( table [ arg0 ] . occupied && table [ arg0 ] . data . equals ( arg1 ) ) return arg0 ; arg0 = ( arg0 + arg2 ) % capacity ; } while ( loc0 != arg0 ) ; return - 1 ; }
find val by double probing of the table - look at hashkey , hashkey + stepsz , hahskey +2 stepsz , hashkey +3 stepsz ... until the value is found or we 've circled around concode_field_sep MyType data concode_elem_sep int numEntries concode_elem_sep boolean occupied concode_elem_sep Cell[] table concode_elem_sep int capacity concode_elem_sep PROBING_TYPE probingType concode_field_sep int insert concode_elem_sep double getLoadFactor concode_elem_sep boolean delete concode_elem_sep int findLinear concode_elem_sep int probeDouble concode_elem_sep void resizeTable concode_elem_sep int findQuadratic concode_elem_sep int hashFunc2 concode_elem_sep int find concode_elem_sep int probeLinear concode_elem_sep String toString concode_elem_sep int probeQuadratic concode_elem_sep int hashFunc concode_elem_sep Object getCapacity