Searched refs:fPt (Results 1 - 25 of 42) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DIntersections.cpp37 bool s1in = between(cs1, s1, ce1) || startPt.approximatelyEqual(fPt[i1])
38 || startPt.approximatelyEqual(fPt[iEnd1]);
39 bool e1in = between(cs1, e1, ce1) || endPt.approximatelyEqual(fPt[i1])
40 || endPt.approximatelyEqual(fPt[iEnd1]);
51 bool s2in = between(cs2, s2, ce2) || startPt.approximatelyEqual(fPt[i2])
52 || startPt.approximatelyEqual(fPt[iEnd2]);
53 bool e2in = between(cs2, e2, ce2) || endPt.approximatelyEqual(fPt[i2])
54 || endPt.approximatelyEqual(fPt[iEnd2]);
58 fPt[i1] = startPt;
61 fPt[i
[all...]
H A DIntersections.h20 bzero(fPt, sizeof(fPt));
128 _Point fPt[9]; member in class:Intersections
H A DLineIntersection.cpp30 i.fPt[0] = xy_at_t(a, i.fT[0][0]);
32 i.fPt[1] = xy_at_t(a, i.fT[0][1]);
71 i.fPt[0] = xy_at_t(a, numerA);
H A DCubicIntersection_Test.cpp244 __FUNCTION__, tt1, xy1.x, xy1.y, intersections2.fPt[pt1].x,
245 intersections2.fPt[pt1].y, xy2.x, xy2.y, tt2);
279 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt1].x,
280 intersections3.fPt[pt1].y, xy2.x, xy2.y, tt2);
335 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt3].x,
336 intersections3.fPt[pt3].y, xy2.x, xy2.y, tt2);
/external/skia/experimental/Intersection/
H A DIntersections.cpp37 bool s1in = between(cs1, s1, ce1) || startPt.approximatelyEqual(fPt[i1])
38 || startPt.approximatelyEqual(fPt[iEnd1]);
39 bool e1in = between(cs1, e1, ce1) || endPt.approximatelyEqual(fPt[i1])
40 || endPt.approximatelyEqual(fPt[iEnd1]);
51 bool s2in = between(cs2, s2, ce2) || startPt.approximatelyEqual(fPt[i2])
52 || startPt.approximatelyEqual(fPt[iEnd2]);
53 bool e2in = between(cs2, e2, ce2) || endPt.approximatelyEqual(fPt[i2])
54 || endPt.approximatelyEqual(fPt[iEnd2]);
58 fPt[i1] = startPt;
61 fPt[i
[all...]
H A DIntersections.h20 bzero(fPt, sizeof(fPt));
128 _Point fPt[9]; member in class:Intersections
H A DLineIntersection.cpp30 i.fPt[0] = xy_at_t(a, i.fT[0][0]);
32 i.fPt[1] = xy_at_t(a, i.fT[0][1]);
71 i.fPt[0] = xy_at_t(a, numerA);
H A DCubicIntersection_Test.cpp244 __FUNCTION__, tt1, xy1.x, xy1.y, intersections2.fPt[pt1].x,
245 intersections2.fPt[pt1].y, xy2.x, xy2.y, tt2);
279 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt1].x,
280 intersections3.fPt[pt1].y, xy2.x, xy2.y, tt2);
335 __FUNCTION__, tt1, xy1.x, xy1.y, intersections3.fPt[pt3].x,
336 intersections3.fPt[pt3].y, xy2.x, xy2.y, tt2);
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpSpan.h16 SkPoint fPt; // computed when the curves are intersected member in struct:SkOpSpan
H A DSkIntersections.cpp84 fPt[index] = pt;
89 if (pt.roughlyEqual(fPt[index])) {
105 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining);
113 fPt[index] = pt;
170 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining);
H A DSkOpSegment.cpp220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
224 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount);
228 nextPt = &fTs[++tIndex].fPt;
234 oNextPt = &other->fTs[++oIndex].fPt;
254 SkPoint copy = fTs[tIndexStart].fPt; // add t pair may move the point array
264 SkPoint copy = fTs[tIndex].fPt; // add t pair may move the point array
299 } while (startPt != fTs[tIndex].fPt);
304 if (startPt != span.fPt) {
307 if (span.fOther == other && span.fPt == startPt) {
314 } while (startPt != other->fTs[oIndex].fPt);
[all...]
H A DSkDLineIntersection.cpp59 fPt[0] = line.ptAtT(fT[0][0]);
61 fPt[1] = line.ptAtT(fT[0][1]);
277 fPt[0].fX = xIntercept;
278 fPt[0].fY = y;
365 fPt[0].fX = x;
366 fPt[0].fY = yIntercept;
H A DSkPathOpsDebug.cpp317 const SkPoint& basePt = fTs[tStart].fPt;
319 const SkPoint& cmpPt = fTs[tStart].fPt;
530 SK_ALWAYSBREAK(otherSpan.fPt == span.fPt);
539 bool pointsEqual = last->fPt == span.fPt;
540 bool pointsNearlyEqual = AlmostEqualUlps(last->fPt, span.fPt);
H A DSkIntersections.h23 sk_bzero(fPt, sizeof(fPt));
141 return fPt[index];
276 SkDPoint fPt[9]; // FIXME: since scans store points as SkPoint, this should also member in class:SkIntersections
H A DSkDCubicIntersection.cpp274 fPt[1] = fPt[last];
325 if (mid.approximatelyEqual(fPt[index])) {
331 if (mid.approximatelyEqual(fPt[index])) {
577 if (!pt.approximatelyEqual(fPt[exIdx])) {
583 if (!pt.approximatelyEqual(fPt[exIdx])) {
595 if (!pt.approximatelyEqual(fPt[cpIdx])) {
601 if (!pt.approximatelyEqual(fPt[cpIdx])) {
649 fPt[1] = fPt[las
[all...]
H A DSkOpContour.cpp201 SkASSERT(SkDPoint::RoughlyEqual(coincidence->fPts[0][idx2], aligned.fPt));
202 coincidence->fPts[0][idx2] = aligned.fPt;
412 missingPt1 = refSegment->span(minTIndex).fPt;
444 missingPt2 = refSegment->span(maxTIndex).fPt;
452 missingPt1 = refSegment->span(minTIndex).fPt;
459 missingPt2 = refSegment->span(maxTIndex).fPt;
H A DSkOpSegment.h40 SkPoint fPt; member in struct:SkOpSegment::AlignedSpan
258 return span->fPt;
391 SkPoint fPt; member in struct:SkOpSegment::MissingSpan
/external/skia/src/pathops/
H A DSkOpSpan.h16 SkPoint fPt; // computed when the curves are intersected member in struct:SkOpSpan
H A DSkIntersections.cpp84 fPt[index] = pt;
89 if (pt.roughlyEqual(fPt[index])) {
105 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining);
113 fPt[index] = pt;
170 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining);
H A DSkOpSegment.cpp220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
224 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount);
228 nextPt = &fTs[++tIndex].fPt;
234 oNextPt = &other->fTs[++oIndex].fPt;
255 fTs[tIndexStart].fPt);
264 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt);
298 } while (startPt != fTs[tIndex].fPt);
303 if (startPt != span.fPt) {
306 if (span.fOther == other && span.fPt == startPt) {
313 } while (startPt != other->fTs[oIndex].fPt);
[all...]
H A DSkDLineIntersection.cpp59 fPt[0] = line.ptAtT(fT[0][0]);
61 fPt[1] = line.ptAtT(fT[0][1]);
274 fPt[0].fX = xIntercept;
275 fPt[0].fY = y;
362 fPt[0].fX = x;
363 fPt[0].fY = yIntercept;
H A DSkPathOpsDebug.cpp316 const SkPoint& basePt = fTs[tStart].fPt;
318 const SkPoint& cmpPt = fTs[tStart].fPt;
529 SK_ALWAYSBREAK(otherSpan.fPt == span.fPt);
538 bool pointsEqual = last->fPt == span.fPt;
539 bool pointsNearlyEqual = AlmostEqualUlps(last->fPt, span.fPt);
H A DSkIntersections.h23 sk_bzero(fPt, sizeof(fPt));
141 return fPt[index];
276 SkDPoint fPt[9]; // FIXME: since scans store points as SkPoint, this should also member in class:SkIntersections
H A DSkDCubicIntersection.cpp274 fPt[1] = fPt[last];
325 if (mid.approximatelyEqual(fPt[index])) {
331 if (mid.approximatelyEqual(fPt[index])) {
577 if (!pt.approximatelyEqual(fPt[exIdx])) {
583 if (!pt.approximatelyEqual(fPt[exIdx])) {
595 if (!pt.approximatelyEqual(fPt[cpIdx])) {
601 if (!pt.approximatelyEqual(fPt[cpIdx])) {
649 fPt[1] = fPt[las
[all...]
H A DSkOpContour.cpp193 SkASSERT(SkDPoint::RoughlyEqual(coincidence->fPts[0][idx2], aligned.fPt));
194 coincidence->fPts[0][idx2] = aligned.fPt;
401 missingPt1 = refSegment->span(minTIndex).fPt;
433 missingPt2 = refSegment->span(maxTIndex).fPt;
441 missingPt1 = refSegment->span(minTIndex).fPt;
448 missingPt2 = refSegment->span(maxTIndex).fPt;

Completed in 4461 milliseconds

12