Set < E > function ( Set < E > arg0 , Set < E > arg1 ) { Set < E > loc0 = new HashSet < E > ( ) ; for ( E loc1 : arg0 ) { if ( ! arg1 . contains ( loc1 ) ) { loc0 . add ( loc1 ) ; } } for ( E loc1 : arg1 ) { if ( ! arg0 . contains ( loc1 ) ) { loc0 . add ( loc1 ) ; } } return loc0 ; }
returns the symmetric difference of sets s1 and s2 i.e. all elements that are in only one of the two sets concode_field_sep PlaceHolder placeHolder concode_field_sep Set<Set<E>> powerSet concode_elem_sep boolean intersects concode_elem_sep Set<E> intersection concode_elem_sep Set<Pair<E,F>> cross concode_elem_sep Set<E> diff concode_elem_sep void main concode_elem_sep Set<E> union