Lines Matching refs:node
38 /** The root node of the tree. */
70 Node node = m_Root;
74 Node nextNode = node.m_nextChar[Character.toUpperCase(key.charAt(i))];
78 node = nextNode;
86 node.m_nextChar[Character.toUpperCase(key.charAt(i))] = newNode;
87 node.m_nextChar[Character.toLowerCase(key.charAt(i))] = newNode;
88 node = newNode;
94 Object ret = node.m_Value;
96 node.m_Value = value;
119 Node node = m_Root;
135 node = node.m_nextChar[ch];
136 if (node != null)
137 return node.m_Value;
148 // node = node.m_nextChar[ch0];
149 // if (node != null)
154 // node = node.m_nextChar[ch1];
155 // if (node != null)
156 // return node.m_Value;
175 node = node.m_nextChar[ch];
176 if (node == null)
180 return node.m_Value;
186 * The node representation for the trie.