Lines Matching refs:root
81 // Start the trie off with something. Having the root node already present
233 TernaryNode *fRoot; // Root node
245 MutableTrieEnumeration(TernaryNode *root, UErrorCode &status)
247 fRoot = root;
248 fNodeStack.push(root, status);
361 uint16_t root; // Node number of the root node
471 const CompactTrieNode *node = getCompactNode(fData, fData->root);
557 fNodeStack.push(header->root, status);
585 fNodeStack.push(fHeader->root, status);
1045 // This call does all the work of building the new trie structure. The root
1047 BuildCompactTrieNode *root = compactOneNode(dict.fTrie, FALSE, nodes, status);
1119 header->root = translate.elementAti(root->fNodeID);
1121 if (header->root == 0) {
1122 fprintf(stderr, "ERROR: root node %d translate to physical zero\n", root->fNodeID);
1259 TernaryNode *root = unpackOneNode(fData, getCompactNode(fData, fData->root), status);
1261 delete root; // Clean up
1265 result->fTrie = root;
1399 root = ds->readUInt16(header->root);
1400 ds->writeUInt16(&outputHeader->root, root);
