Lines Matching refs:fNodes
116 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0),
123 fNodes[index].deleteValues(fValueDeleter);
125 uprv_free(fNodes);
138 // Trie is built, while fNodes and fLazyContents change with the lazy init
177 if (fNodes == NULL) {
179 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode));
180 fNodes[0].clear(); // Init root node.
197 CharacterNode *node = fNodes;
218 uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode));
219 uprv_free(fNodes);
220 fNodes = newNodes;
234 CharacterNode *current = fNodes + nodeIndex;
245 // Ensure capacity. Grow fNodes[] if needed.
247 int32_t parentIndex = (int32_t)(parent - fNodes);
252 parent = fNodes + parentIndex;
256 CharacterNode *node = fNodes + fNodesCount;
263 fNodes[prevIndex].fNextSibling = (uint16_t)fNodesCount;
274 CharacterNode *current = fNodes + nodeIndex;
321 if (fNodes == NULL) {
324 search(fNodes, text, start, start, handler, status);