Lines Matching refs:root
93 // Start the trie off with something. Having the root node already present
265 TernaryNode *fRoot; // Root node
277 MutableTrieEnumeration(TernaryNode *root, UErrorCode &status)
279 fRoot = root;
280 fNodeStack.push(root, status);
409 uint32_t root; // Node number of the root node
418 uint16_t root; // Node number of the root node
427 uint32_t root; // Node number of the root node
444 root = headerV1->root;
449 root = header->root;
476 kRootCountMask = 0x7FFF // The count portion of flagscount in the root node
562 if(node < info->root-1) {
572 if(node < header->root-1) {
629 * node ID < fInfo->root!
687 const CompactTrieNode *node = getCompactNode(fInfo, fInfo->root);
693 // handle root node with only kEqualOverflows flag: assume horizontal node without parent
695 const CompactTrieHorizontalNode *root = (const CompactTrieHorizontalNode *) node;
696 int index = searchHorizontalEntries(root->entries, uc, root->flagscount & kRootCountMask);
698 node = getCompactNode(fInfo, calcEqualLink(root, index, root->flagscount & kRootCountMask));
782 fNodeStack.push(info->root, status);
810 fNodeStack.push(fInfo->root, status);
828 bool isRoot = fNodeStack.peeki() == static_cast<int32_t>(fInfo->root);
889 // The root node should never end up here.
1482 // This call does all the work of building the new trie structure. The root
1484 BuildCompactTrieNode *root = compactOneNode(dict.fTrie, FALSE, nodes, status, values);
1577 header->root = translate.elementAti(root->fNodeID);
1579 if (header->root == 0) {
1580 fprintf(stderr, "ERROR: root node %d translate to physical zero\n", root->fNodeID);
1631 if(nodeIdx == header->root)
1638 if (node->flagscount & kVerticalNode && nodeIdx != header->root) {
1646 if(nodeIdx >= header->root) {
1756 // treat root node as special case: don't call unpackOneNode() or unpackHorizontalArray() directly
1757 // because only kEqualOverflows flag should be checked in root's flagscount
1759 getCompactNode(fInfo, fInfo->root);
1761 TernaryNode *root = unpackHorizontalArray(fInfo, hnode, 0, nodeCount-1,
1765 delete root; // Clean up
1769 result->fTrie = root;
1867 rootId = ds->readUInt16(((CompactTrieHeaderV1 *)header)->root);
1870 rootId = ds->readUInt32(header->root);
1945 uint16_t root = ds->readUInt16(headerV1->root);
1946 ds->writeUInt16(&outputHeaderV1->root, root);
1951 uint32_t root = ds->readUInt32(header->root);
1952 ds->writeUInt32(&outputHeader->root, root);
