Trie function ( ) { Trie loc0 = new Trie ( ) ; List < TrieNode > loc1 = new ArrayList < TrieNode > ( frequentItems . values ( ) ) ; loc0 . setNodes ( loc1 ) ; loc0 . sort ( ) ; return loc0 ; }
get the equivalence classes associated with the frequent items that we have found . concode_field_sep Map<Integer,Integer> sequencesLengths concode_elem_sep List<Sequence> sequences concode_elem_sep AbstractionCreator abstractionCreator concode_elem_sep IdListCreator idListCreator concode_elem_sep int nSequences concode_elem_sep ItemFactory<Integer> itemFactory concode_elem_sep Map<Item,TrieNode> frequentItems concode_elem_sep Map<Integer,List<Integer>> sequenceItemsetSize concode_elem_sep Map<Item,Map<Integer,List<Integer>>> projectingDistance concode_field_sep Map<Item,TrieNode> getFrequentItems concode_elem_sep int size concode_elem_sep List<Sequence> getSequences concode_elem_sep void reduceDatabase concode_elem_sep void clear concode_elem_sep double loadFile concode_elem_sep String toString concode_elem_sep void addSequence concode_elem_sep void addSequence