Searched refs:breakPoints (Results 1 – 7 of 7) sorted by relevance
97 std::vector<int> breakPoints; member108 std::reverse(breakPoints.begin(), breakPoints.end()); in reverse()
129 if (expected.size() != actual.breakPoints.size()) { in sameLineBreak()153 if (breakOffset != static_cast<uint32_t>(actual.breakPoints[i])) { in sameLineBreak()195 for (uint32_t i = 0; i < lines.breakPoints.size(); ++i) { in toString()196 const Range textRange(i == 0 ? 0 : lines.breakPoints[i - 1], lines.breakPoints[i]); in toString()
261 EXPECT_EQ(1u, r.breakPoints.size()); in TEST_F()
1971 EXPECT_EQ(1u, r.breakPoints.size()); in TEST_F()
98 return reinterpret_cast<minikin::LineBreakResult*>(ptr)->breakPoints.size(); in nGetLineCount()102 return reinterpret_cast<minikin::LineBreakResult*>(ptr)->breakPoints[i]; in nGetLineBreakOffset()
540 out.breakPoints.push_back(breakPoint.offset); in getResult()574 if (res.breakPoints.size() >= LBW_AUTO_HEURISTICS_LINE_COUNT) { in breakLineGreedy()583 if (res2.breakPoints.size() < LBW_AUTO_HEURISTICS_LINE_COUNT) { in breakLineGreedy()
380 result.breakPoints.push_back(cand.offset); in finishBreaksOptimal()550 if (res.breakPoints.size() >= LBW_AUTO_HEURISTICS_LINE_COUNT) { in breakLineOptimal()559 if (res2.breakPoints.size() < LBW_AUTO_HEURISTICS_LINE_COUNT) { in breakLineOptimal()