Home
last modified time | relevance | path

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

/external/skia/tests/
DPathOpsQuadLineIntersectionThreadedTest.cpp92 for (int tIndex = 0; tIndex <= 4; ++tIndex) { in testQuadLineIntersectMain() local
93 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/skia/src/pathops/
DSkIntersections.h198 void set(bool swap, int tIndex, double t) { in set() argument
199 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.h1434 for (int tIndex = 0; tIndex < thisRayI.used(); ++tIndex) { in linesIntersect() local
1436 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
/external/skia/samplecode/
DSampleAAGeometry.cpp1157 for (int tIndex = 0; tIndex < tMaxCount; ++tIndex) { in draw_bisects() local
1158 if (0 >= tMax[tIndex] || tMax[tIndex] >= 1) { in draw_bisects()
1163 SkEvalCubicAt(pts, tMax[tIndex], &maxPt, &tangent, NULL); in draw_bisects()
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF ...