create a new entry object referencing the input key and associated value , and insert the entry into the dictionary . return a reference to the new entry . multiple entries with the same key or even the same key and value can coexist in the dictionary . this method should run in o 1 time if the number of collisions is small . concode_field_sep int smallPrime concode_elem_sep int numCollisions concode_elem_sep int a concode_elem_sep int bigPrime concode_elem_sep int b concode_elem_sep int size concode_elem_sep List[] table concode_elem_sep int numBuckets concode_field_sep int numCollisions concode_elem_sep void collisions concode_elem_sep int size concode_elem_sep Entry find concode_elem_sep void makeEmpty concode_elem_sep boolean isEmpty concode_elem_sep void main concode_elem_sep String toString concode_elem_sep int compFunction concode_elem_sep boolean isPrime concode_elem_sep Entry remove concode_elem_sep int numBuckets
Entry function ( Object arg0 , Object arg1 ) { Entry loc0 = new Entry ( ) ; loc0 . arg0 = arg0 ; loc0 . arg1 = arg1 ; int loc1 = compFunction ( arg0 . loc1 ( ) ) ; if ( table [ loc1 ] . length ( ) > 0 ) numCollisions ++ ; table [ loc1 ] . insertBack ( loc0 ) ; size ++ ; return loc0 ; }