Lines Matching full:nodecount
360 uint16_t nodeCount; // Number of entries in offsets[]
490 int nodeCount = (node->flagscount & kCountMask);
491 if (nodeCount == 0) {
498 for (int j = 0; j < nodeCount && i < maxLength; ++j) {
516 nodeCount-1;
601 int nodeCount = (node->flagscount & kCountMask);
603 if (nodeCount == 0) {
615 unistr.append((const UChar *)vnode->chars, (int32_t) nodeCount);
623 unistr.truncate(unistr.length()-nodeCount);
637 if (where < nodeCount) {
1070 int32_t nodeCount = 1; // The sentinel node we already have
1088 translate.setElementAt(nodeCount++, i);
1094 if (nodeCount > 0x10000) {
1100 totalSize += nodeCount*sizeof(uint32_t);
1107 fprintf(stderr, "%d nodes, %d unique, %d bytes\n", nodes.size(), nodeCount, totalSize);
1117 header->nodeCount = nodeCount;
1125 uint32_t offset = offsetof(CompactTrieHeader,offsets)+(nodeCount*sizeof(uint32_t));
1126 nodeCount = 1;
1131 header->offsets[nodeCount++] = offset;
1151 for (uint16_t nodeIdx = nodeCount-1; nodeIdx >= 2; --nodeIdx) {
1212 int nodeCount = (node->flagscount & kCountMask);
1213 if (nodeCount == 0 || U_FAILURE(status)) {
1222 for (int i = 0; i < nodeCount; ++i) {
1248 return unpackHorizontalArray(header, &hnode->entries[0], 0, nodeCount-1, status);
1358 uint16_t nodeCount = ds->readUInt16(header->nodeCount);
1360 for (int i = 1; i < nodeCount; ++i) {
1390 uint16_t nodeCount = ds->readUInt16(header->nodeCount);
1391 uint32_t nodesOff = offsetof(CompactTrieHeader,offsets)+((uint32_t)nodeCount*sizeof(uint32_t));
1398 ds->writeUInt16(&outputHeader->nodeCount, nodeCount);
1402 sizeof(uint32_t)*(int32_t)nodeCount,
