Lines Matching defs:score
360 // If text could fit, it has substantially larger score compared to nicer wrap with overflow
509 int64_t score = 0;
510 int64_t overallScore = score;
514 // re-break this line, if a result is different, calculate score
539 overallScore = ite->second.score;
545 score = int64_t((1.f - scoref) * UNDERFLOW_SCORE);
546 score *= score;
549 overallScore = score;
552 if (!HandleLastLine(param, overallScore, currentWidth, score)) {
561 // We always hold the best possible score of children at this point
567 } while (score > MINIMUM_FILL_RATIO_SQUARED &&
573 bool HandleLastLine(RecursiveParam& param, int64_t& overallScore, SkScalar& currentWidth, int64_t&score)
577 // this is last line, with high-quality wrapping, relax the score a bit
585 // score.
587 score = MINIMUM_FILL_RATIO_SQUARED - 1;
592 // recursively calculate best score for children
636 int64_t score { 0 };
757 // if the line breaking strategy returns a negative score, the algorithm could not fit or break the text