IntHashSet function ( IntHashSet arg0 ) { IntHashSet loc0 = new IntHashSet ( ( int ) size ( ) ) ; IntIterator loc1 = iterator ( ) ; while ( loc1 . hasNext ( ) ) { int loc2 = loc1 . next ( ) ; if ( ! arg0 . contains ( loc2 ) ) { loc0 . add ( loc2 ) ; } } return loc0 ; }
form a new set that is the difference of this set with another set . concode_field_sep int MAX_SIZE concode_elem_sep int _size concode_elem_sep int ndv concode_elem_sep int _shift concode_elem_sep int[] _values concode_elem_sep int _mask concode_elem_sep int NBIT concode_elem_sep int _nmax concode_elem_sep int _nhi concode_elem_sep int i concode_elem_sep int _nlo concode_field_sep boolean add concode_elem_sep int next concode_elem_sep int[] getValues concode_elem_sep IntHashSet intersect concode_elem_sep boolean containsAll concode_elem_sep void clear concode_elem_sep boolean isEmpty concode_elem_sep boolean hasNext concode_elem_sep IntHashSet union concode_elem_sep boolean containsSome concode_elem_sep boolean remove concode_elem_sep boolean contains concode_elem_sep IntIterator iterator concode_elem_sep void diagnosticDump concode_elem_sep int size concode_elem_sep int getFirst concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep void setCapacity concode_elem_sep IntHashSet copy concode_elem_sep int indexOf concode_elem_sep int hash