175 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0),   in TextTrieMap()
182         fNodes[index].deleteValues(fValueDeleter);  in ~TextTrieMap()
184     uprv_free(fNodes);  in ~TextTrieMap()
247     if (fNodes == NULL) {  in putImpl()
249         fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode));  in putImpl()
250         if (fNodes == NULL) {  in putImpl()
254         fNodes[0].clear();  // Init root node.  in putImpl()
271     CharacterNode *node = fNodes;  in putImpl()
292     uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode));  in growNodes()
293     uprv_free(fNodes);  in growNodes()
294     fNodes = newNodes;  in growNodes()
308         CharacterNode *current = fNodes + nodeIndex;  in addChildNode()
321         int32_t parentIndex = (int32_t)(parent - fNodes);  in addChildNode()
326         parent = fNodes + parentIndex;  in addChildNode()
330     CharacterNode *node = fNodes + fNodesCount;  in addChildNode()
337         fNodes[prevIndex].fNextSibling = (uint16_t)fNodesCount;  in addChildNode()
348         CharacterNode *current = fNodes + nodeIndex;  in getChildNode()
395     if (fNodes == NULL) {  in search()
398     search(fNodes, text, start, start, handler, status);  in search()