Home
last modified time | relevance | path

Searched refs:fRunIterators (Results 1 – 2 of 2) sorted by relevance

/external/skia/tools/shape/
DSkShaper_harfbuzz.cpp309 fRunIterators.insert(runIterator); in insert()
313 const RunIterator* leastRun = fRunIterators.peek(); in advanceRuns()
321 while ((currentRun = fRunIterators.peek())->endOfCurrentRun() <= leastEnd) { in advanceRuns()
322 fRunIterators.pop(); in advanceRuns()
326 fRunIterators.insert(currentRun); in advanceRuns()
332 return fRunIterators.peek()->endOfCurrentRun(); in endOfCurrentRun()
337 for (int i = 0; i < fRunIterators.count(); ++i) { in allRunsAreAtEnd()
338 if (!fRunIterators.at(i)->atEnd()) { in allRunsAreAtEnd()
348 SkTDPQueue<RunIterator*, CompareRunIterator> fRunIterators; member in __anon44c4ee450111::RunIteratorQueue
/external/skqp/tools/shape/
DSkShaper_harfbuzz.cpp307 fRunIterators.insert(runIterator); in insert()
311 const RunIterator* leastRun = fRunIterators.peek(); in advanceRuns()
319 while ((currentRun = fRunIterators.peek())->endOfCurrentRun() <= leastEnd) { in advanceRuns()
320 fRunIterators.pop(); in advanceRuns()
324 fRunIterators.insert(currentRun); in advanceRuns()
330 return fRunIterators.peek()->endOfCurrentRun(); in endOfCurrentRun()
335 for (int i = 0; i < fRunIterators.count(); ++i) { in allRunsAreAtEnd()
336 if (!fRunIterators.at(i)->atEnd()) { in allRunsAreAtEnd()
346 SkTDPQueue<RunIterator*, CompareRunIterator> fRunIterators; member in __anon14a72d1c0111::RunIteratorQueue