int [ ] function ( Item arg0 , int arg1 , int arg2 ) { if ( arg1 < size ( ) ) { Itemset loc0 = itemsets . get ( arg1 ) ; int loc1 = loc0 . binarySearch ( arg0 ) ; if ( loc1 >= arg2 ) { return new int [ ] { arg1 , loc1 } ; } } return null ; }
it returns a pair indicanting the appearance of an item in the itemset given as parameter . the starting point where the method takes the search up is given as parameter concode_field_sep int numberOfItems concode_elem_sep List<Itemset> itemsets concode_elem_sep int id concode_field_sep int numberOfItemsAfterPositionIth concode_elem_sep int getId concode_elem_sep long getTimeLength concode_elem_sep List<Itemset> getItemsets concode_elem_sep void addItemset concode_elem_sep Itemset remove concode_elem_sep Item remove concode_elem_sep void remove concode_elem_sep void addItem concode_elem_sep void addItem concode_elem_sep void addItem concode_elem_sep int size concode_elem_sep Itemset get concode_elem_sep int[] searchForTheFirstAppearance concode_elem_sep void setId concode_elem_sep int getLength concode_elem_sep String toString concode_elem_sep int[] searchForItemInAConcreteTemporalDistance concode_elem_sep Sequence cloneSequence