Lines Matching refs:node
1622 // Use a fairly nasty hack to tell if the next node is supposed to be
2023 /** The root node of the tree. */
2070 Node node = m_Root;
2075 node.m_nextChar[Character.toLowerCase(key.charAt(i))];
2079 node = nextNode;
2089 node.m_nextChar[Character.toLowerCase(
2096 node.m_nextChar[Character.toUpperCase(
2099 node.m_nextChar[Character.toLowerCase(
2103 node = newNode;
2109 Object ret = node.m_Value;
2111 node.m_Value = value;
2134 Node node = m_Root;
2150 node = node.m_nextChar[ch];
2151 if (node != null)
2152 return node.m_Value;
2163 // node = node.m_nextChar[ch0];
2164 // if (node != null)
2169 // node = node.m_nextChar[ch1];
2170 // if (node != null)
2171 // return node.m_Value;
2189 node = node.m_nextChar[ch];
2190 if (node == null)
2194 return node.m_Value;
2200 * The node representation for the trie.
2259 Node node = m_Root;
2275 node = node.m_nextChar[ch];
2276 if (node != null)
2277 return node.m_Value;
2302 node = node.m_nextChar[ch];
2303 if (node == null)
2307 return node.m_Value;