Lines Matching defs:node
145 // We defer actually building the TextTrieMap node structure until the first time a
180 fNodes[0].clear(); // Init root node.
197 CharacterNode *node = fNodes;
200 node = addChildNode(node, keyBuffer[index], status);
202 node->addValue(value, fValueDeleter, status);
208 return FALSE; // We use 16-bit node indexes.
255 // Insert a new child node with c in sorted order.
256 CharacterNode *node = fNodes + fNodesCount;
257 node->clear();
258 node->fCharacter = c;
259 node->fNextSibling = nodeIndex;
266 return node;
286 // Mutex for protecting the lazy creation of the Trie node structure on the first call to search().
289 // buildTrie() - The Trie node structure is needed. Create it from the data that was
328 TextTrieMap::search(CharacterNode *node, const UnicodeString &text, int32_t start,
333 if (node->hasValues()) {
334 if (!handler->handleMatch(index - start, node, status)) {
349 node = getChildNode(node, c);
350 if (node == NULL) {
356 node = getChildNode(node, c);
358 if (node != NULL) {
359 search(node, text, start, index+1, handler, status);
773 UBool handleMatch(int32_t matchLength, const CharacterNode *node, UErrorCode &status);
793 ZNameSearchHandler::handleMatch(int32_t matchLength, const CharacterNode *node, UErrorCode &status) {
797 if (node->hasValues()) {
798 int32_t valuesCount = node->countValues();
800 ZNameInfo *nameinfo = (ZNameInfo *)node->getValue(i);
