Searched refs:m_runs (Results 1 – 4 of 4) sorted by relevance
198 for (int itemIndex = 0; itemIndex < static_cast<int>(m_runs.size()); itemIndex++) in width()208 for (size_t run = 0; run < m_runs.size(); run++) { in justify()227 for (size_t run = 0; run < m_runs.size(); run++) { in justify()254 for (size_t run = 0; run < m_runs.size(); run++) { in justify()273 for (size_t screenIndex = 0; screenIndex < m_runs.size(); screenIndex++) { in characterToX()276 const SCRIPT_ITEM& item = m_runs[itemIndex]; in characterToX()310 for (size_t screenIndex = 0; screenIndex < m_runs.size(); screenIndex++) { in xToCharacter()320 const SCRIPT_ITEM& item = m_runs[itemIndex]; in xToCharacter()355 for (size_t screenIndex = 0; screenIndex < m_runs.size(); screenIndex++) { in draw()357 const SCRIPT_ITEM& item = m_runs[itemIndex]; in draw()[all …]
427 Vector<SCRIPT_ITEM, cUniscribeHelperStackRuns> m_runs; variable
222 BidiRunList<Run>& runs() { return m_runs; } in runs()262 BidiRunList<Run> m_runs; variable303 m_runs.addRun(new Run(startOffset, endOffset + 1, context(), m_direction)); in appendRun()511 for (Run* run = m_runs.firstRun(); run; run = run->next()) { in reorderRunsFromLevels()525 unsigned count = m_runs.runCount() - 1; in reorderRunsFromLevels()529 Run* run = m_runs.firstRun(); in reorderRunsFromLevels()537 m_runs.reverseRuns(start, end); in reorderRunsFromLevels()605 m_runs.setLogicallyLastRun(m_runs.lastRun()); in createBidiRunsForLine()606 if (override == VisualRightToLeftOverride && m_runs.runCount()) in createBidiRunsForLine()607 m_runs.reverseRuns(0, m_runs.runCount() - 1); in createBidiRunsForLine()[all …]
136 EXPECT_EQ(1, uniscribe.m_runs.size()); in TEST_F()159 EXPECT_EQ(0, uniscribe.m_runs.size()); in TEST_F()