int function ( ) { if ( nodes == null ) { return 0 ; } return nodes . size ( ) ; }
it returns the number of children that a trie has concode_field_sep BitSet appearingIn concode_elem_sep List<TrieNode> nodes concode_elem_sep int intId concode_elem_sep int sumSequencesIDs concode_elem_sep int support concode_elem_sep int id concode_field_sep void setNodes concode_elem_sep void setSumIdSequences concode_elem_sep List<TrieNode> getNodes concode_elem_sep void addNode concode_elem_sep int getSupport concode_elem_sep Trie getChild concode_elem_sep void display concode_elem_sep void setNode concode_elem_sep void sort concode_elem_sep int compareTo concode_elem_sep boolean remove concode_elem_sep void removeAll concode_elem_sep ItemAbstractionPair getPair concode_elem_sep int getSumIdSequences concode_elem_sep void setChild concode_elem_sep List<Pattern> preorderTraversal concode_elem_sep BitSet getAppearingIn concode_elem_sep String toString concode_elem_sep TrieNode getNode concode_elem_sep void setAppearingIn concode_elem_sep void setSupport concode_elem_sep int calculateSumIdSequences