Lines Matching refs:fNodes
211 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0),
218 fNodes[index].deleteValues();
220 uprv_free(fNodes);
232 // Trie is built, while fNodes and fLazyContents change with the lazy init
263 if (fNodes == NULL) {
265 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode));
266 fNodes[0].clear(); // Init root node.
283 CharacterNode *node = fNodes;
304 uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode));
305 uprv_free(fNodes);
306 fNodes = newNodes;
320 CharacterNode *current = fNodes + nodeIndex;
331 // Ensure capacity. Grow fNodes[] if needed.
333 int32_t parentIndex = (int32_t)(parent - fNodes);
338 parent = fNodes + parentIndex;
342 CharacterNode *node = fNodes + fNodesCount;
349 fNodes[prevIndex].fNextSibling = (uint16_t)fNodesCount;
360 CharacterNode *current = fNodes + nodeIndex;
404 if (fNodes == NULL) {
407 search(fNodes, text, start, start, handler, status);
