/** * creates a deep copy of itself * * @return a deep copy of itself */ @Override public Object clone() { TrieNode result; Enumeration<Character> keys; Character key; TrieNode child; result = new TrieNode(getChar()); keys = m_Children.keys(); while (keys.hasMoreElements()) { key = keys.nextElement(); child = (TrieNode) m_Children.get(key).clone(); result.add(child); result.m_Children.put(key, child); } return result; }
/** * creates a deep copy of itself * * @return a deep copy of itself */ @Override public Object clone() { TrieNode result; Enumeration<Character> keys; Character key; TrieNode child; result = new TrieNode(getChar()); keys = m_Children.keys(); while (keys.hasMoreElements()) { key = keys.nextElement(); child = (TrieNode) m_Children.get(key).clone(); result.add(child); result.m_Children.put(key, child); } return result; }
/** * returns a deep copy of itself * * @return a copy of itself */ @Override public Object clone() { Trie result; result = new Trie(); result.m_Root = (TrieNode) m_Root.clone(); return result; }
/** * returns a deep copy of itself * * @return a copy of itself */ @Override public Object clone() { Trie result; result = new Trie(); result.m_Root = (TrieNode) m_Root.clone(); return result; }