Home
last modified time | relevance | path

Searched refs:tIndex (Results 1 – 8 of 8) sorted by relevance

/external/skia/src/animator/
DSkHitTest.cpp40 for (int tIndex = 0; tIndex < targetCount; tIndex++) { in draw() local
41 SkDisplayable* target = targets[tIndex]; in draw()
45 hits[bIndex] = tIndex; in draw()
59 for (int tIndex = 0; tIndex < targets.count(); tIndex++) { in enable() local
60 SkDisplayable* target = targets[tIndex]; in enable()
DSkHitClear.cpp23 for (int tIndex = 0; tIndex < targets.count(); tIndex++) { in enable() local
24 SkDisplayable* target = targets[tIndex]; in enable()
/external/skia/tests/
DPathOpsQuadLineIntersectionThreadedTest.cpp90 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
91 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
DPathOpsConicIntersectionTest.cpp145 for (int tIndex = 0; tIndex < chops; ++tIndex) { in writeDPng() local
146 SkDConic chopped = dConic.subDivide(tIndex / (double) chops, in writeDPng()
147 (tIndex + 1) / (double) chops); in writeDPng()
/external/icu/icu4c/source/layout/
DHangulLayoutEngine.cpp115 le_int32 tIndex = trail - TJMO_FIRST; in compose() local
122 if (tIndex <= 0 || tIndex >= TJMO_COUNT) { in compose()
123 tIndex = 0; in compose()
127 syllable = (LEUnicode) ((lIndex * VJMO_COUNT + vIndex) * TJMO_COUNT + tIndex + HSYL_FIRST); in compose()
/external/skia/src/pathops/
DSkIntersections.h189 void set(bool swap, int tIndex, double t) { in set() argument
190 fT[(int) swap][tIndex] = t; in set()
DSkPathOpsWinding.cpp229 int tIndex = (tBase - 1) & ((1 << tBits) - 1); in get_t_guess() local
230 t += t * 2 * tIndex; in get_t_guess()
DSkPathOpsTSect.h1351 for (int tIndex = 0; tIndex < thisRayI.used(); ++tIndex) { in linesIntersect() local
1353 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()