Searched defs:testT (Results 1 - 6 of 6) sorted by relevance
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 371 static void lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT, argument 373 if (orig.used() == 1 && orig[!swap][0] == testT) { 376 if (orig.used() == 2 && orig[!swap][1] == testT) { 380 int testTIndex = testT << 1; 392 i->insert(testT, impTs[0][index], tmpLine[0]); 394 i->insert(impTs[0][index], testT, tmpLine[0]); 446 double testT = (copyI[0][midEnd] * (index + 1) local 448 SkDPoint testPt1 = q1.ptAtT(testT); 449 testT = (copyI[1][midEnd] * (index + 1) + copyI[1][midEnd - 1] * (2 - index)) / 3; 450 SkDPoint testPt2 = q2.ptAtT(testT); [all...] |
H A D | SkOpAngle.cpp | 422 double testT = i[0][idx2]; 423 if (!approximately_between_orderable(tStart, testT, tEnd)) { 426 if (approximately_equal_orderable(tStart, testT)) { 429 smallTs[index] = t = testAscends ? SkTMax(t, testT) : SkTMin(t, testT); 1042 double testT = testTs[testIndex]; local 1044 testT = (testT + testTs[testIndex + 1]) / 2; 1047 SkDPoint pt = dcubic_xy_at_t(pts, testT);
|
H A D | SkOpSegment.cpp | 729 double testT = test->fT; local 744 } while (*testPt == test->fPt || precisely_equal(testT, test->fT)); 1299 double testT = test->fT; 1341 testT = test->fT; 1344 if (endPt == *testPt || precisely_equal(endT, testT)) { 1350 if (endPt != *testPt && !precisely_equal(endT, testT)) { 1495 bool SkOpSegment::betweenTs(int lesser, double testT, int greater) const { 1499 return approximately_between(fTs[lesser].fT, testT, fTs[greater].fT);
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 371 static void lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT, argument 373 if (orig.used() == 1 && orig[!swap][0] == testT) { 376 if (orig.used() == 2 && orig[!swap][1] == testT) { 380 int testTIndex = testT << 1; 392 i->insert(testT, impTs[0][index], tmpLine[0]); 394 i->insert(impTs[0][index], testT, tmpLine[0]); 446 double testT = (copyI[0][midEnd] * (index + 1) local 448 SkDPoint testPt1 = q1.ptAtT(testT); 449 testT = (copyI[1][midEnd] * (index + 1) + copyI[1][midEnd - 1] * (2 - index)) / 3; 450 SkDPoint testPt2 = q2.ptAtT(testT); [all...] |
H A D | SkOpAngle.cpp | 425 double testT = i[0][idx2]; 426 if (!approximately_between_orderable(tStart, testT, tEnd)) { 429 if (approximately_equal_orderable(tStart, testT)) { 432 smallTs[index] = t = testAscends ? SkTMax(t, testT) : SkTMin(t, testT); 1038 double testT = testTs[testIndex]; local 1040 testT = (testT + testTs[testIndex + 1]) / 2; 1043 SkDPoint pt = dcubic_xy_at_t(pts, testT);
|
H A D | SkOpSegment.cpp | 721 double testT = test->fT; local 736 } while (*testPt == test->fPt || precisely_equal(testT, test->fT)); 1266 double testT = test->fT; 1304 testT = test->fT; 1307 if (endPt == *testPt || precisely_equal(endT, testT)) { 1313 if (endPt != *testPt && !precisely_equal(endT, testT)) { 1428 bool SkOpSegment::betweenTs(int lesser, double testT, int greater) const { 1432 return approximately_between(fTs[lesser].fT, testT, fTs[greater].fT);
|
Completed in 337 milliseconds