Lines Matching refs:result
127 vector<QrSegment> result;
128 if (*text == '\0'); // Leave result empty
130 result.push_back(makeNumeric(text));
132 result.push_back(makeAlphanumeric(text));
137 result.push_back(makeBytes(bytes));
139 return result;
180 int result = 0;
185 if (4 + ccbits > INT_MAX - result)
187 result += 4 + ccbits;
188 if (seg.data.size() > static_cast<unsigned int>(INT_MAX - result))
190 result += static_cast<int>(seg.data.size());
192 return result;
523 vector<uint8_t> result;
528 result.push_back(blocks.at(j).at(i));
531 assert(result.size() == static_cast<unsigned int>(rawCodewords));
532 return result;
588 long result = 0;
599 result += PENALTY_N1;
601 result++;
605 result += finderPenaltyCountPatterns(runHistory) * PENALTY_N3;
610 result += finderPenaltyTerminateAndCount(runColor, runX, runHistory) * PENALTY_N3;
621 result += PENALTY_N1;
623 result++;
627 result += finderPenaltyCountPatterns(runHistory) * PENALTY_N3;
632 result += finderPenaltyTerminateAndCount(runColor, runY, runHistory) * PENALTY_N3;
642 result += PENALTY_N2;
658 result += k * PENALTY_N4;
659 assert(0 <= result && result <= 2568888L); // Non-tight upper bound based on default values of PENALTY_N1, ..., N4
660 return result;
671 vector<int> result;
673 result.insert(result.begin(), pos);
674 result.insert(result.begin(), 6);
675 return result;
683 int result = (16 * ver + 128) * ver + 64;
686 result -= (25 * numAlign - 10) * numAlign - 55;
688 result -= 36;
690 assert(208 <= result && result <= 29648);
691 return result;
707 vector<uint8_t> result(static_cast<size_t>(degree));
708 result.at(result.size() - 1) = 1; // Start off with the monomial x^0
716 for (size_t j = 0; j < result.size(); j++) {
717 result.at(j) = reedSolomonMultiply(result.at(j), root);
718 if (j + 1 < result.size())
719 result.at(j) ^= result.at(j + 1);
723 return result;
728 vector<uint8_t> result(divisor.size());
730 uint8_t factor = b ^ result.at(0);
731 result.erase(result.begin());
732 result.push_back(0);
733 for (size_t i = 0; i < result.size(); i++)
734 result.at(i) ^= reedSolomonMultiply(divisor.at(i), factor);
736 return result;