boolean function ( Word arg0 ) { int loc0 = getIndex ( arg0 ) ; Node loc1 = buckets [ loc0 ] ; while ( loc1 != null ) { if ( loc1 . data . equals ( arg0 ) ) { return true ; } loc1 = loc1 . next ; } return false ; }
checks if set contains a word . concode_field_sep Node next concode_elem_sep Node node concode_elem_sep int size concode_elem_sep Word data concode_elem_sep Node[] buckets concode_elem_sep int index concode_field_sep void add concode_elem_sep Word next concode_elem_sep Iterator<Word> iterator concode_elem_sep int getIndex concode_elem_sep int size concode_elem_sep boolean hasNext