/** * returns the number of stored strings, i.e., leaves * * @return the number of stored strings */ public int size() { int result; TrieNode leaf; result = 0; leaf = (TrieNode) getFirstLeaf(); while (leaf != null) { if (leaf != getRoot()) { result++; } leaf = (TrieNode) leaf.getNextLeaf(); } return result; }
/** * returns the number of stored strings, i.e., leaves * * @return the number of stored strings */ public int size() { int result; TrieNode leaf; result = 0; leaf = (TrieNode) getFirstLeaf(); while (leaf != null) { if (leaf != getRoot()) { result++; } leaf = (TrieNode) leaf.getNextLeaf(); } return result; }
/** * initializes the iterator * * @param node the node to use as root */ public TrieIterator(TrieNode node) { super(); m_Root = node; m_CurrentLeaf = (TrieNode) m_Root.getFirstLeaf(); m_LastLeaf = (TrieNode) m_Root.getLastLeaf(); }
/** * initializes the iterator * * @param node the node to use as root */ public TrieIterator(TrieNode node) { super(); m_Root = node; m_CurrentLeaf = (TrieNode) m_Root.getFirstLeaf(); m_LastLeaf = (TrieNode) m_Root.getLastLeaf(); }