| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 371 static void lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT,
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)
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...] |
| 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);
[all...] |
| SkDCubicIntersection.cpp | 289 double testT = (double) !start;
306 cubicInsert(testT, impTs[0][index], tmpLine[0], cubic2, cubic1);
308 cubicInsert(impTs[0][index], testT, tmpLine[0], cubic1, cubic2);
343 double testT = (double) !start;
374 insert(foundT, testT, line[0]);
376 insert(testT, foundT, line[0]);
|
| SkOpSegment.h | 294 bool betweenTs(int lesser, double testT, int greater) const;
|
| SkOpSegment.cpp | 721 double testT = test->fT;
736 } while (*testPt == test->fPt || precisely_equal(testT, test->fT));
[all...] |
| /external/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 371 static void lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT,
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)
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...] |
| 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);
[all...] |
| SkDCubicIntersection.cpp | 289 double testT = (double) !start;
306 cubicInsert(testT, impTs[0][index], tmpLine[0], cubic2, cubic1);
308 cubicInsert(impTs[0][index], testT, tmpLine[0], cubic1, cubic2);
343 double testT = (double) !start;
374 insert(foundT, testT, line[0]);
376 insert(testT, foundT, line[0]);
|
| SkOpSegment.h | 294 bool betweenTs(int lesser, double testT, int greater) const;
|
| SkOpSegment.cpp | 721 double testT = test->fT;
736 } while (*testPt == test->fPt || precisely_equal(testT, test->fT));
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| Simplify.cpp | [all...] |
| /external/skia/experimental/Intersection/ |
| Simplify.cpp | [all...] |
