| /external/skqp/tests/ |
| D | PathOpsQuadLineIntersectionTest.cpp | 33 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
45 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
54 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
56 intersections.intersect(quad, line); in doIntersect()
57 result = intersections.used(); in doIntersect()
92 SkIntersections intersections; in testOneOffs() local
93 int result = doIntersect(intersections, quad, line, flipped); in testOneOffs()
95 double quadT = intersections[0][inner]; in testOneOffs()
97 double lineT = intersections[1][inner]; in testOneOffs()
132 SkIntersections intersections; in DEF_TEST() local
[all …]
|
| D | PathOpsConicLineIntersectionTest.cpp | 34 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, in doIntersect() argument
46 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped); in doIntersect()
55 result = intersections.horizontal(conic, left, right, line[0].fY, flipped); in doIntersect()
57 intersections.intersect(conic, line); in doIntersect()
58 result = intersections.used(); in doIntersect()
82 SkIntersections intersections; in testOneOffs() local
83 int result = doIntersect(intersections, conic, line, flipped); in testOneOffs()
85 double conicT = intersections[0][inner]; in testOneOffs()
87 double lineT = intersections[1][inner]; in testOneOffs()
127 SkIntersections intersections; in DEF_TEST() local
[all …]
|
| D | PathOpsQuadIntersectionTest.cpp | 39 SkIntersections intersections; in standardTestCases() local
40 intersections.intersect(quad1, quad2); in standardTestCases()
41 if (intersections.used() > 0) { in standardTestCases()
42 for (int pt = 0; pt < intersections.used(); ++pt) { in standardTestCases()
43 double tt1 = intersections[0][pt]; in standardTestCases()
45 double tt2 = intersections[1][pt]; in standardTestCases()
344 SkIntersections intersections; in oneOffTest1() local
345 intersections.intersect(quad1, quad2); in oneOffTest1()
346 for (int pt = 0; pt < intersections.used(); ++pt) { in oneOffTest1()
347 double tt1 = intersections[0][pt]; in oneOffTest1()
[all …]
|
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 18 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
30 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
39 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
41 intersections.intersect(quad, line); in doIntersect()
42 result = intersections.used(); in doIntersect()
56 SkIntersections intersections; in testLineIntersect() local
58 int result = doIntersect(intersections, quad, line, flipped); in testLineIntersect()
61 double quadT = intersections[0][index]; in testLineIntersect()
63 double lineT = intersections[1][index]; in testLineIntersect()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 103 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { in doIntersect() argument
114 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); in doIntersect()
123 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); in doIntersect()
125 intersections.intersect(cubic, line); in doIntersect()
126 result = intersections.used(); in doIntersect()
|
| D | PathOpsConicIntersectionTest.cpp | 314 SkIntersections intersections; in oneOff() local
315 intersections.intersect(c1, c2); in oneOff()
316 if (coin && intersections.used() != 2) { in oneOff()
319 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2); in oneOff()
322 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { in oneOff()
323 tt1 = intersections[0][pt3]; in oneOff()
325 tt2 = intersections[1][pt3]; in oneOff()
327 const SkDPoint& iPt = intersections.pt(pt3); in oneOff()
|
| D | PathOpsCubicIntersectionTest.cpp | 404 SkIntersections intersections; in oneOff() local
405 intersections.intersect(c1, c2); in oneOff()
414 if (coin && intersections.used() < 2) { in oneOff()
417 REPORTER_ASSERT(reporter, !coin || intersections.used() >= 2); in oneOff()
420 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { in oneOff()
421 tt1 = intersections[0][pt3]; in oneOff()
423 tt2 = intersections[1][pt3]; in oneOff()
425 const SkDPoint& iPt = intersections.pt(pt3); in oneOff()
|
| /external/skia/tests/ |
| D | PathOpsQuadLineIntersectionTest.cpp | 33 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
45 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
54 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
56 intersections.intersect(quad, line); in doIntersect()
57 result = intersections.used(); in doIntersect()
92 SkIntersections intersections; in testOneOffs() local
93 int result = doIntersect(intersections, quad, line, flipped); in testOneOffs()
95 double quadT = intersections[0][inner]; in testOneOffs()
97 double lineT = intersections[1][inner]; in testOneOffs()
132 SkIntersections intersections; in DEF_TEST() local
[all …]
|
| D | PathOpsConicLineIntersectionTest.cpp | 34 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, in doIntersect() argument
46 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped); in doIntersect()
55 result = intersections.horizontal(conic, left, right, line[0].fY, flipped); in doIntersect()
57 intersections.intersect(conic, line); in doIntersect()
58 result = intersections.used(); in doIntersect()
82 SkIntersections intersections; in testOneOffs() local
83 int result = doIntersect(intersections, conic, line, flipped); in testOneOffs()
85 double conicT = intersections[0][inner]; in testOneOffs()
87 double lineT = intersections[1][inner]; in testOneOffs()
127 SkIntersections intersections; in DEF_TEST() local
[all …]
|
| D | PathOpsQuadIntersectionTest.cpp | 39 SkIntersections intersections; in standardTestCases() local
40 intersections.intersect(quad1, quad2); in standardTestCases()
41 if (intersections.used() > 0) { in standardTestCases()
42 for (int pt = 0; pt < intersections.used(); ++pt) { in standardTestCases()
43 double tt1 = intersections[0][pt]; in standardTestCases()
45 double tt2 = intersections[1][pt]; in standardTestCases()
344 SkIntersections intersections; in oneOffTest1() local
345 intersections.intersect(quad1, quad2); in oneOffTest1()
346 for (int pt = 0; pt < intersections.used(); ++pt) { in oneOffTest1()
347 double tt1 = intersections[0][pt]; in oneOffTest1()
[all …]
|
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 18 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
30 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
39 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
41 intersections.intersect(quad, line); in doIntersect()
42 result = intersections.used(); in doIntersect()
56 SkIntersections intersections; in testLineIntersect() local
58 int result = doIntersect(intersections, quad, line, flipped); in testLineIntersect()
61 double quadT = intersections[0][index]; in testLineIntersect()
63 double lineT = intersections[1][index]; in testLineIntersect()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 103 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { in doIntersect() argument
114 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); in doIntersect()
123 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); in doIntersect()
125 intersections.intersect(cubic, line); in doIntersect()
126 result = intersections.used(); in doIntersect()
|
| D | PathOpsConicIntersectionTest.cpp | 312 SkIntersections intersections; in oneOff() local
313 intersections.intersect(c1, c2); in oneOff()
314 if (coin && intersections.used() != 2) { in oneOff()
317 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2); in oneOff()
320 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { in oneOff()
321 tt1 = intersections[0][pt3]; in oneOff()
323 tt2 = intersections[1][pt3]; in oneOff()
325 const SkDPoint& iPt = intersections.pt(pt3); in oneOff()
|
| D | PathOpsCubicIntersectionTest.cpp | 404 SkIntersections intersections; in oneOff() local
405 intersections.intersect(c1, c2); in oneOff()
414 if (coin && intersections.used() < 2) { in oneOff()
417 REPORTER_ASSERT(reporter, !coin || intersections.used() >= 2); in oneOff()
420 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { in oneOff()
421 tt1 = intersections[0][pt3]; in oneOff()
423 tt2 = intersections[1][pt3]; in oneOff()
425 const SkDPoint& iPt = intersections.pt(pt3); in oneOff()
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1603 const SkTSect* sect2, SkIntersections* intersections) { in EndsEqual() argument
1607 intersections->insert(0, 0, sect1->fCurve[0]); in EndsEqual()
1611 intersections->insert(0, 1, sect1->fCurve[0]); in EndsEqual()
1615 intersections->insert(1, 0, sect1->pointLast()); in EndsEqual()
1619 intersections->insert(1, 1, sect1->pointLast()); in EndsEqual()
1625 intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]); in EndsEqual()
1630 intersections->insertNear(0, 1, sect1->fCurve[0], sect2->pointLast()); in EndsEqual()
1636 intersections->insertNear(1, 0, sect1->pointLast(), sect2->fCurve[0]); in EndsEqual()
1641 intersections->insertNear(1, 1, sect1->pointLast(), sect2->pointLast()); in EndsEqual()
1651 void addIntersection(SkIntersections* intersections) const { in addIntersection()
[all …]
|
| D | SkPathOpsTSect.h | 250 SkIntersections* intersections);
|
| /external/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1604 const SkTSect* sect2, SkIntersections* intersections) { in EndsEqual() argument
1608 intersections->insert(0, 0, sect1->fCurve[0]); in EndsEqual()
1612 intersections->insert(0, 1, sect1->fCurve[0]); in EndsEqual()
1616 intersections->insert(1, 0, sect1->pointLast()); in EndsEqual()
1620 intersections->insert(1, 1, sect1->pointLast()); in EndsEqual()
1626 intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]); in EndsEqual()
1631 intersections->insertNear(0, 1, sect1->fCurve[0], sect2->pointLast()); in EndsEqual()
1637 intersections->insertNear(1, 0, sect1->pointLast(), sect2->fCurve[0]); in EndsEqual()
1642 intersections->insertNear(1, 1, sect1->pointLast(), sect2->pointLast()); in EndsEqual()
1652 void addIntersection(SkIntersections* intersections) const { in addIntersection()
[all …]
|
| /external/skia/modules/skparagraph/src/ |
| D | Decorations.cpp | 113 SkTArray<SkScalar> intersections(count); in calculateGaps() local
114 intersections.resize(count); in calculateGaps()
115 blob->getIntercepts(bounds, intersections.data(), &fPaint); in calculateGaps()
120 for (int i = 0; i < intersections.count(); i += 2) { in calculateGaps()
121 auto end = intersections[i] - halo; in calculateGaps()
123 start = intersections[i + 1] + halo; in calculateGaps()
127 if (!intersections.empty() && (rect.fRight - start > halo)) { in calculateGaps()
|
| /external/s2-geometry-library-java/src/com/google/common/geometry/ |
| D | S2Polygon.java | 562 List<ParametrizedS2Point> intersections) { in addIntersection() argument
567 intersections.add(new ParametrizedS2Point(t, x)); in addIntersection()
582 intersections.add(new ParametrizedS2Point(t, t == 0 ? a0 : a1)); in addIntersection()
591 boolean addSharedEdges, List<ParametrizedS2Point> intersections) { in clipEdge() argument
609 addIntersection(a0, a1, from, to, addSharedEdges, crossing, intersections); in clipEdge()
633 List<ParametrizedS2Point> intersections = Lists.newArrayList(); in clipBoundary() local
641 intersections.clear(); in clipBoundary()
642 clipEdge(a0, a1, bIndex, addSharedEdges, intersections); in clipBoundary()
645 intersections.add(new ParametrizedS2Point(0.0, a0)); in clipBoundary()
647 inside = ((intersections.size() & 0x1) == 0x1); in clipBoundary()
[all …]
|
| /external/fonttools/Lib/fontTools/misc/ |
| D | bezierTools.py | 988 intersections = solveQuadratic(a[1], b[1], c[1])
991 intersections = solveCubic(a[1], b[1], c[1], d[1])
994 return sorted(i for i in intersections if 0.0 <= i <= 1)
1024 intersections = []
1027 intersections.append(Intersection(pt=pt, t1=t, t2=_line_t_of_pt(*line, pt)))
1028 return intersections
1182 intersections = curveCurveIntersections(seg1, seg2)
1184 intersections = curveLineIntersections(seg1, seg2)
1186 intersections = lineLineIntersections(*seg1, *seg2)
1190 return intersections
[all …]
|
| /external/skqp/gm/ |
| D | texteffects.cpp | 20 static SkPath create_underline(const SkTDArray<SkScalar>& intersections, in create_underline() argument
25 for (int index = 0; index < intersections.count(); index += 2) { in create_underline()
26 SkScalar start = intersections[index] - uWidth; in create_underline()
27 end = intersections[index + 1] + uWidth; in create_underline()
|
| /external/skia/gm/ |
| D | texteffects.cpp | 29 static SkPath create_underline(const SkTDArray<SkScalar>& intersections, in create_underline() argument
34 for (int index = 0; index < intersections.count(); index += 2) { in create_underline()
35 SkScalar start = intersections[index] - uWidth; in create_underline()
36 end = intersections[index + 1] + uWidth; in create_underline()
|
| /external/angle/src/libANGLE/renderer/vulkan/doc/ |
| D | OpenGLLineSegmentRasterization.md | 31 circles indicate intersections that do not exit the diamond. We detect
32 non-Bresenham fragments when both intersections are outside the diamond.
|
| /external/clang/test/Analysis/ |
| D | NewDelete-intersections.mm | 12 // Check for intersections with unix.Malloc and unix.MallocWithAnnotations
|
| /external/skia/src/core/ |
| D | SkScan_AntiPath.cpp | 628 SkScalar intersections = sk_ieee_float_divide(sqr(n) * sqr(avgLength), diagonalSqr); in compute_complexity() local
631 complexity = sk_ieee_float_divide(intersections, path.getBounds().height()); in compute_complexity()
|