| /third_party/skia/tests/ |
| H A 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...] |
| H A 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...] |
| H A 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()
|
| H A 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[ in oneOffTest1()
534 SkIntersections intersections; DEF_TEST() local
[all...] |
| H A 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()
|
| H A 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()
|
| H A 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/ |
| H A D | SkPathOpsTSect.cpp | 1065 // construct the tangent lines from the intersections
1604 const SkTSect* sect2, SkIntersections* intersections) { in EndsEqual()
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 in EndsEqual()
1603 EndsEqual(const SkTSect* sect1, const SkTSect* sect2, SkIntersections* intersections) EndsEqual() argument
1777 BinarySearch(SkTSect* sect1, SkTSect* sect2, SkIntersections* intersections) BinarySearch() argument
[all...] |
| H A D | SkPathOpsTSect.h | 249 SkIntersections* intersections);
|
| /third_party/skia/modules/skparagraph/src/ |
| H A D | Decorations.cpp | 173 SkTArray<SkScalar> intersections(count); in calculateGaps()
174 intersections.resize(count); in calculateGaps()
175 blob->GetIntercepts(bounds, intersections.data(), &paint); in calculateGaps()
180 for (int i = 0; i < intersections.size(); i += 2) { in calculateGaps()
181 auto end = intersections[i] - halo; in calculateGaps()
183 start = intersections[i + 1] + halo; in calculateGaps()
187 start = intersections[i + 1] + halo; in calculateGaps()
191 if (!intersections.empty() && (rect.fRight - start > halo)) { in calculateGaps()
195 if (intersections.empty()) { in calculateGaps()
|
| /third_party/skia/gm/ |
| H A 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/src/core/ |
| H A D | SkScan_AntiPath.cpp | 634 // If the path consists of random line segments, the number of intersections should be
636 SkScalar intersections = sk_ieee_float_divide(sqr(n) * sqr(avgLength), diagonalSqr);
638 // The number of intersections per scanline should be proportional to this number.
639 complexity = sk_ieee_float_divide(intersections, path.getBounds().height());
673 // intersections because AAA will have too many scan lines. See
|
| /third_party/typescript/lib/ |
| H A D | typingsInstaller.js | [all...] |
| H A D | tsc.js | [all...] |
| H A D | tsserverlibrary.js | [all...] |
| H A D | typescript.js | [all...] |
| H A D | typescriptServices.js | [all...] |
| H A D | tsserver.js | [all...] |
| /third_party/node/test/fixtures/snapshot/ |
| H A D | typescript.js | [all...] |