Lines Matching defs:nodeCount
408 uint32_t nodeCount; // Number of entries in offsets[]
417 uint16_t nodeCount; // Number of entries in offsets[]
426 uint32_t nodeCount; // Number of entries in offsets[]
443 nodeCount = headerV1->nodeCount;
448 nodeCount = header->nodeCount;
595 * @param nodeCount The length of hnode->entries[]
611 * @param nodeCount The length of hnode->entries[]
613 static inline uint32_t calcEqualLink(const CompactTrieHorizontalNode *hnode, uint16_t index, uint16_t nodeCount){
616 uint16_t *overflow = (uint16_t *) &hnode->entries[nodeCount];
656 UChar uc, uint16_t nodeCount){
658 int high = nodeCount-1;
723 int nodeCount = getCount(node);
724 if (nodeCount == 0) {
731 for (int j = 0; j < nodeCount && i < maxLength; ++j) {
751 int index = searchHorizontalEntries(entries, uc, nodeCount);
754 node = getCompactNode(fInfo, calcEqualLink(hnode, index, nodeCount));
826 int nodeCount;
830 nodeCount = node->flagscount & kRootCountMask;
832 nodeCount = getCount(node);
836 if (nodeCount == 0) {
848 unistr.append((const UChar *)vnode->chars, nodeCount);
856 unistr.truncate(unistr.length()-nodeCount);
870 if (where < nodeCount) {
874 node = getCompactNode(fInfo, fNodeStack.push(calcEqualLink(hnode, where, nodeCount), status));
1507 int32_t nodeCount = 1; // The sentinel node we already have
1526 nodeCount = valueCount + valuePos;
1540 translate.setElementAt(nodeCount++, i);
1547 if (nodeCount > 0x100000) {
1553 totalSize += nodeCount*sizeof(uint32_t);
1560 fprintf(stderr, "%d nodes, %d unique, %d bytes\n", nodes.size(), nodeCount, totalSize);
1575 header->nodeCount = nodeCount;
1583 uint32_t offset = offsetof(CompactTrieHeader,offsets)+(nodeCount*sizeof(uint32_t));
1584 nodeCount = valueCount + 1;
1599 header->offsets[nodeCount++] = offset;
1628 for (uint32_t nodeIdx = nodeCount-1; nodeIdx >= 2; --nodeIdx) {
1677 int low, int high, int nodeCount, UErrorCode &status) {
1687 const CompactTrieNode *equal = getCompactNode(info, calcEqualLink(hnode, middle, nodeCount));
1695 result->low = unpackHorizontalArray(info, hnode, low, middle-1, nodeCount, status);
1696 result->high = unpackHorizontalArray(info, hnode, middle+1, high, nodeCount, status);
1704 int nodeCount = getCount(node);
1705 if (nodeCount == 0 || U_FAILURE(status)) {
1714 for (int i = 0; i < nodeCount; ++i) {
1744 return unpackHorizontalArray(info, hnode, 0, nodeCount-1, nodeCount, status);
1760 uint16_t nodeCount = hnode->flagscount & kRootCountMask;
1761 TernaryNode *root = unpackHorizontalArray(fInfo, hnode, 0, nodeCount-1,
1762 nodeCount, status);
1864 uint32_t nodeCount, rootId;
1866 nodeCount = ds->readUInt16(((CompactTrieHeaderV1 *)header)->nodeCount);
1869 nodeCount = ds->readUInt32(header->nodeCount);
1874 for (uint32_t i = 1; i < nodeCount; ++i) {
1937 uint32_t nodeCount;
1943 nodeCount = ds->readUInt16(headerV1->nodeCount);
1944 ds->writeUInt16(&outputHeaderV1->nodeCount, nodeCount);
1949 nodeCount = ds->readUInt32(header->nodeCount);
1950 ds->writeUInt32(&outputHeader->nodeCount, nodeCount);
1957 uint32_t nodesOff = offsetPos+((uint32_t)nodeCount*sizeof(uint32_t));
1962 sizeof(uint32_t)*(uint32_t)nodeCount,
