int [ ] function ( int [ ] arg0 , int [ ] arg1 ) { int [ ] loc0 = new int [ arg0 . length - arg1 . length ] ; int loc1 = 0 ; for ( int loc2 = 0 ; loc2 < arg0 . length ; loc2 ++ ) { if ( Arrays . binarySearch ( arg1 , arg0 [ loc2 ] ) < 0 ) { loc0 [ loc1 ++ ] = arg0 [ loc2 ] ; } } return loc0 ; }
make a copy of this itemset but exclude a set of items concode_field_sep Comparator<int[]> comparatorItemsetSameSize concode_field_sep boolean allTheSameExceptLastItem concode_elem_sep int[] intersectTwoSortedArrays concode_elem_sep boolean containsOrEquals concode_elem_sep boolean contains concode_elem_sep int compare concode_elem_sep int[] concatenate concode_elem_sep boolean includedIn concode_elem_sep boolean containsLEX concode_elem_sep boolean containsLEX concode_elem_sep boolean containsLEXPlus concode_elem_sep int[] cloneItemSetMinusOneItem concode_elem_sep int sameAs