this method checks if an item `` item '' is in the itemset `` itemset '' . it assumes that items in the itemset are sorted in lexical order and that the largest item in the itemset is known . 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
boolean function ( Integer arg0 [ ] , Integer arg1 , int arg2 ) { if ( arg1 > arg2 ) { return false ; } for ( Integer loc0 : arg0 ) { if ( loc0 . equals ( arg1 ) ) { return true ; } else if ( loc0 > arg1 ) { return false ; } } return false ; }