Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:testT (Results 1 - 10 of 10) sorted by null

/external/chromium_org/third_party/skia/src/pathops/
SkDQuadIntersection.cpp	369 static void lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT, 371 if (orig.used() == 1 && orig[!swap][0] == testT) { 374 if (orig.used() == 2 && orig[!swap][1] == testT) { 378 int testTIndex = testT << 1; 390 i->insert(testT, impTs[0][index], tmpLine[0]); 392 i->insert(impTs[0][index], testT, tmpLine[0]); 444 double testT = (copyI[0][midEnd] * (index + 1) 446 SkDPoint testPt1 = q1.ptAtT(testT); 447 testT = (copyI[1][midEnd] * (index + 1) + copyI[1][midEnd - 1] * (2 - index)) / 3; 448 SkDPoint testPt2 = q2.ptAtT(testT);     [all...]
SkOpAngle.cpp	351 double testT = testTs[testIndex]; 353 testT = (testT + testTs[testIndex + 1]) / 2; 356 SkDPoint pt = dcubic_xy_at_t(pts, testT);
SkDCubicIntersection.cpp	286 double testT = (double) !start; 303 insert(testT, impTs[0][index], tmpLine[0]); 305 insert(impTs[0][index], testT, tmpLine[0]); 316 double testT = (double) !start; 347 insert(foundT, testT, line[0]); 349 insert(testT, foundT, line[0]);
SkOpSegment.cpp	598 double testT = test->fT; 613 } while (testPt == test->fPt || testT == test->fT); 730 double testT = test->fT; 770 testT = test->fT; 771 if (endPt == *testPt || endT == testT) { 778 if (endPt != *testPt && endT != testT) { // in rare cases, one may have ended before the other 858 bool SkOpSegment::betweenTs(int lesser, double testT, int greater) const { 862 return approximately_between(fTs[lesser].fT, testT, fTs[greater].fT);     [all...]
SkOpSegment.h	249 bool betweenTs(int lesser, double testT, int greater) const;
/external/skia/src/pathops/
SkDQuadIntersection.cpp	369 static void lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT, 371 if (orig.used() == 1 && orig[!swap][0] == testT) { 374 if (orig.used() == 2 && orig[!swap][1] == testT) { 378 int testTIndex = testT << 1; 390 i->insert(testT, impTs[0][index], tmpLine[0]); 392 i->insert(impTs[0][index], testT, tmpLine[0]); 444 double testT = (copyI[0][midEnd] * (index + 1) 446 SkDPoint testPt1 = q1.ptAtT(testT); 447 testT = (copyI[1][midEnd] * (index + 1) + copyI[1][midEnd - 1] * (2 - index)) / 3; 448 SkDPoint testPt2 = q2.ptAtT(testT);     [all...]
SkOpAngle.cpp	351 double testT = testTs[testIndex]; 353 testT = (testT + testTs[testIndex + 1]) / 2; 356 SkDPoint pt = dcubic_xy_at_t(pts, testT);
SkDCubicIntersection.cpp	286 double testT = (double) !start; 303 insert(testT, impTs[0][index], tmpLine[0]); 305 insert(impTs[0][index], testT, tmpLine[0]); 316 double testT = (double) !start; 347 insert(foundT, testT, line[0]); 349 insert(testT, foundT, line[0]);
SkOpSegment.cpp	598 double testT = test->fT; 613 } while (testPt == test->fPt || testT == test->fT); 730 double testT = test->fT; 770 testT = test->fT; 771 if (endPt == *testPt || endT == testT) { 778 if (endPt != *testPt && endT != testT) { // in rare cases, one may have ended before the other 858 bool SkOpSegment::betweenTs(int lesser, double testT, int greater) const { 862 return approximately_between(fTs[lesser].fT, testT, fTs[greater].fT);     [all...]
SkOpSegment.h	249 bool betweenTs(int lesser, double testT, int greater) const;

Completed in 460 milliseconds