| /third_party/flutter/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()
|
| /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/boost/boost/geometry/policies/relate/ |
| D | intersection_points.hpp | 55 sinfo.calculate(result.intersections[0], s1, s2); in segments_crosses()
86 detail::assign_point_from_index<0>(a, result.intersections[index]); in segments_collinear()
102 detail::assign_point_from_index<0>(b, result.intersections[index]); in segments_collinear()
115 detail::assign_point_from_index<1>(a, result.intersections[index]); in segments_collinear()
124 detail::assign_point_from_index<1>(b, result.intersections[index]); in segments_collinear()
138 std::swap(result.intersections[0], result.intersections[1]); in segments_collinear()
161 set<0>(result.intersections[0], get<0, 0>(segment)); in degenerate()
162 set<1>(result.intersections[0], get<0, 1>(segment)); in degenerate()
173 set<0>(result.intersections[0], get<0, 0>(degenerate_segment)); in one_degenerate()
174 set<1>(result.intersections[0], get<0, 1>(degenerate_segment)); in one_degenerate()
|
| /third_party/typescript_eslint/packages/eslint-plugin/docs/rules/ |
| D | no-type-alias.md | 59 or intersections can some times be redundant.
78 and simplified types (primitives, tuples, unions, intersections, etc).
101 - `"in-intersections"`, allows aliasing in intersection statements, e.g. `type Foo = string & strin…
102 - `"in-unions-and-intersections"`, allows aliasing in union and/or intersection statements.
163 Examples of **incorrect** code for the `{ "allowAliases": "in-intersections" }` option:
184 Examples of **correct** code for the `{ "allowAliases": "in-intersections" }` option:
197 Examples of **incorrect** code for the `{ "allowAliases": "in-unions-and-intersections" }` option:
212 Examples of **correct** code for the `{ "allowAliases": "in-unions-and-intersections" }` option:
285 - `"in-intersections"`, allows literals in intersection statements, e.g. `type Foo = string & strin…
286 - `"in-unions-and-intersections"`, allows literals in union and/or intersection statements.
[all …]
|
| /third_party/flutter/skia/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 …]
|
| /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 …]
|
| /third_party/boost/libs/geometry/doc/src/examples/algorithms/ |
| D | intersection_segment.cpp | 28 std::vector<P> intersections; in main() local
29 boost::geometry::intersection(segment1, segment2, intersections); in main()
31 BOOST_FOREACH(P const& p, intersections) in main()
|
| /third_party/boost/libs/random/doc/ |
| D | tutorial.qbk | 30 [section Generating quasi-random line-sphere intersections]
32 [import ../example/intersections.cpp]
33 [intersections]
|
| /third_party/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()
|
| /third_party/boost/boost/geometry/algorithms/detail/overlay/ |
| D | get_turn_info_for_endpoint.hpp | 139 pi, result.template get<0>().intersections[0], strategy); in linear_intersections()
142 qi, result.template get<0>().intersections[0], strategy); in linear_intersections()
266 linear_intersections intersections(range_p.at(0), in apply() local
275 intersections.template get<0>(), in apply()
284 if ( intersections.template get<1>().p_operation == operation_none ) in apply()
289 intersections.template get<1>(), in apply()
411 inters_pt = inters.i_info().intersections[ip_index]; in handle_internal()
462 inters_pt = inters.i_info().intersections[ip_index]; in handle_internal()
|
| /third_party/boost/libs/geometry/test/strategies/ |
| D | segment_intersection_collinear.cpp | 44 double x = bg::get<0>(is.intersections[index]); in check()
45 double y = bg::get<1>(is.intersections[index]); in check()
158 BOOST_CHECK_EQUAL(bg::get<0>(is.intersections[0]), exp_ax1); in test_segment_ratio()
159 BOOST_CHECK_EQUAL(bg::get<1>(is.intersections[0]), exp_ay1); in test_segment_ratio()
163 BOOST_CHECK_EQUAL(bg::get<0>(is.intersections[1]), exp_ax2); in test_segment_ratio()
164 BOOST_CHECK_EQUAL(bg::get<1>(is.intersections[1]), exp_ay2); in test_segment_ratio()
|
| /third_party/flutter/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/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()
|