boolean function ( int [ ] arg0 , int arg1 ) { for ( int loc0 = 0 ; loc0 < arg0 . length ; loc0 ++ ) { if ( arg0 [ loc0 ] == arg1 ) { return true ; } else if ( arg0 [ loc0 ] > arg1 ) { return false ; } } return false ; }
this method checks if the item `` item '' is in the itemset . it assumes that items in the itemset are sorted in lexical order 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 containsLEXPlus concode_elem_sep int[] cloneItemSetMinusAnItemset concode_elem_sep int[] cloneItemSetMinusOneItem concode_elem_sep int sameAs