| /third_party/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()
131 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()
126 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 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2); in oneOff()
317 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { in oneOff()
318 tt1 = intersections[0][pt3]; in oneOff()
320 tt2 = intersections[1][pt3]; in oneOff()
322 const SkDPoint& iPt = intersections.pt(pt3); in oneOff()
|
| D | PathOpsCubicIntersectionTest.cpp | 406 SkIntersections intersections; in oneOff() local
407 intersections.intersect(c1, c2); in oneOff()
416 REPORTER_ASSERT(reporter, !coin || intersections.used() >= 2); in oneOff()
419 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { in oneOff()
420 tt1 = intersections[0][pt3]; in oneOff()
422 tt2 = intersections[1][pt3]; in oneOff()
424 const SkDPoint& iPt = intersections.pt(pt3); in oneOff()
|
| /third_party/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 …]
|
| D | SkPathOpsTSect.h | 249 SkIntersections* intersections);
|
| /third_party/skia/modules/skparagraph/src/ |
| D | Decorations.cpp | 125 SkTArray<SkScalar> intersections(count); in calculateGaps() local
126 intersections.resize(count); in calculateGaps()
127 blob->getIntercepts(bounds, intersections.data(), &decorPaint); in calculateGaps()
132 for (int i = 0; i < intersections.size(); i += 2) { in calculateGaps()
133 auto end = intersections[i] - halo; in calculateGaps()
135 start = intersections[i + 1] + halo; in calculateGaps()
139 if (!intersections.empty() && (rect.fRight - start > halo)) { in calculateGaps()
|
| /third_party/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()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | objectLiteralExcessProperties.types | 113 // No excess property checks on intersections involving generics
152 // The 'object' type has no effect on intersections
|
| D | objectLiteralExcessProperties.symbols | 106 // No excess property checks on intersections involving generics
137 // The 'object' type has no effect on intersections
|
| D | objectLiteralExcessProperties.errors.txt | 111 // No excess property checks on intersections involving generics
129 // The 'object' type has no effect on intersections
|
| D | noUncheckedIndexedAccessDestructuring.errors.txt | 53 // Test intersections with declared properties
|
| D | intersectionTypeMembers.types | 3 // with types that are intersections of the respective members in the constituent types
|
| D | intersectionsAndEmptyObjects.types | 2 // Empty object type literals are removed from intersections types
|
| D | noUncheckedIndexedAccessDestructuring.types | 75 // Test intersections with declared properties
|
| D | intersectionTypeMembers.symbols | 3 // with types that are intersections of the respective members in the constituent types
|
| D | noUncheckedIndexedAccessDestructuring.symbols | 66 // Test intersections with declared properties
|
| /third_party/skia/third_party/externals/angle2/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.
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/chapters/ |
| D | raytraversal.txt | 8 The ray traversal process identifies and handles intersections between a ray
187 This may: result in false positive intersections being reported to the
240 Candidate intersections go through several phases of culling before
430 triangle or an AABB, candidate intersections are further processed to
432 Candidates generated from AABB intersections run through the same
444 To avoid propagating false intersections the application should: verify the
|
| D | raytraversal.adoc | 8 The ray traversal process identifies and handles intersections between a ray
201 This may: result in false positive intersections being reported to the
254 Candidate intersections go through several phases of culling before
531 triangle or an AABB, candidate intersections are further processed to
533 Candidates generated from AABB intersections run through the same
545 To avoid propagating false intersections the application should: verify the
|
| /third_party/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()
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/appendices/ |
| D | VK_KHR_ray_query.adoc | 90 by tracing a ray towards the light, and checking for any intersections with
|