Cross Reference: /frameworks/minikin/libs/minikin/OptimalLineBreaker.cpp

Lines Matching refs:candidates
64                               // between two candidates. The line width between two line break
65                               // candidates i and j is calculated as postBreak(j) - preBreak(i).
88     // The break candidates.
89     std::vector<Candidate> candidates;
99     // Append desperate break point to the candidates.
102         candidates.emplace_back(offset, sumOfCharWidths, sumOfCharWidths, SCORE_DESPERATE,
107     // Append hyphenation break point to the candidates.
111         candidates.emplace_back(offset, preBreak, postBreak, penalty, spaceCount, spaceCount, type,
115     // Append word break point to the candidates.
119         candidates.emplace_back(offset, preBreak, postBreak, penalty, preSpaceCount, postSpaceCount,
124         candidates.emplace_back(0, 0.0f, 0.0f, 0.0f, 0, 0, HyphenationType::DONT_BREAK, false);
206 // Enumerate all line break candidates.
286                                         const std::vector<Candidate>& candidates);
306 // Follow "prev" links in candidates array, and copy to result arrays.
310         const std::vector<Candidate>& candidates) {
312     const uint32_t nCand = candidates.size();
316         const Candidate& cand = candidates[i];
317         const Candidate& prev = candidates[prevIndex];
338     const std::vector<Candidate>& candidates = context.candidates;
340     const uint32_t nCand = candidates.size();
347     // "i" iterates through candidates for the end of the line.
356         ParaWidth leftEdge = candidates[i].postBreak - width;
359         // "j" iterates through candidates for the beginning of the line.
365                     leftEdge = candidates[i].postBreak - width;
373             const float delta = candidates[j].preBreak - leftEdge;
386                 additionalPenalty = LAST_LINE_PENALTY_MULTIPLIER * candidates[j].penalty;
391                         maxShrink * (candidates[i].postSpaceCount - candidates[j].preSpaceCount)) {
411         breaksData.push_back({best + candidates[i].penalty + context.linePenalty,  // score
415     return finishBreaksOptimal(textBuf, measured, breaksData, candidates);