| /external/skqp/tests/ |
| D | PathOpsQuadLineIntersectionTest.cpp | 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
52 intersections.intersect(quad, line); in doIntersect()
53 result = intersections.used(); in doIntersect()
88 SkIntersections intersections; in testOneOffs() local
89 int result = doIntersect(intersections, quad, line, flipped); in testOneOffs()
91 double quadT = intersections[0][inner]; in testOneOffs()
93 double lineT = intersections[1][inner]; in testOneOffs()
128 SkIntersections intersections; in DEF_TEST() local
[all …]
|
| D | PathOpsConicLineIntersectionTest.cpp | 32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, in doIntersect() argument
43 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped); in doIntersect()
51 result = intersections.horizontal(conic, left, right, line[0].fY, flipped); in doIntersect()
53 intersections.intersect(conic, line); in doIntersect()
54 result = intersections.used(); in doIntersect()
78 SkIntersections intersections; in testOneOffs() local
79 int result = doIntersect(intersections, conic, line, flipped); in testOneOffs()
81 double conicT = intersections[0][inner]; in testOneOffs()
83 double lineT = intersections[1][inner]; in testOneOffs()
123 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 | 16 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
27 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
35 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
37 intersections.intersect(quad, line); in doIntersect()
38 result = intersections.used(); in doIntersect()
52 SkIntersections intersections; in testLineIntersect() local
54 int result = doIntersect(intersections, quad, line, flipped); in testLineIntersect()
57 double quadT = intersections[0][index]; in testLineIntersect()
59 double lineT = intersections[1][index]; in testLineIntersect()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 101 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { in doIntersect() argument
111 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); in doIntersect()
119 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); in doIntersect()
121 intersections.intersect(cubic, line); in doIntersect()
122 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 | 403 SkIntersections intersections; in oneOff() local
404 intersections.intersect(c1, c2); in oneOff()
413 if (coin && intersections.used() < 2) { 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()
|
| /external/skia/tests/ |
| D | PathOpsQuadLineIntersectionTest.cpp | 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
52 intersections.intersect(quad, line); in doIntersect()
53 result = intersections.used(); in doIntersect()
88 SkIntersections intersections; in testOneOffs() local
89 int result = doIntersect(intersections, quad, line, flipped); in testOneOffs()
91 double quadT = intersections[0][inner]; in testOneOffs()
93 double lineT = intersections[1][inner]; in testOneOffs()
128 SkIntersections intersections; in DEF_TEST() local
[all …]
|
| D | PathOpsConicLineIntersectionTest.cpp | 32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, in doIntersect() argument
43 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped); in doIntersect()
51 result = intersections.horizontal(conic, left, right, line[0].fY, flipped); in doIntersect()
53 intersections.intersect(conic, line); in doIntersect()
54 result = intersections.used(); in doIntersect()
78 SkIntersections intersections; in testOneOffs() local
79 int result = doIntersect(intersections, conic, line, flipped); in testOneOffs()
81 double conicT = intersections[0][inner]; in testOneOffs()
83 double lineT = intersections[1][inner]; in testOneOffs()
123 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 | 16 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect() argument
27 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); in doIntersect()
35 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); in doIntersect()
37 intersections.intersect(quad, line); in doIntersect()
38 result = intersections.used(); in doIntersect()
52 SkIntersections intersections; in testLineIntersect() local
54 int result = doIntersect(intersections, quad, line, flipped); in testLineIntersect()
57 double quadT = intersections[0][index]; in testLineIntersect()
59 double lineT = intersections[1][index]; in testLineIntersect()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 101 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { in doIntersect() argument
111 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); in doIntersect()
119 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); in doIntersect()
121 intersections.intersect(cubic, line); in doIntersect()
122 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/skqp/gm/ |
| D | texteffects.cpp | 18 static SkPath create_underline(const SkTDArray<SkScalar>& intersections, in create_underline() argument
23 for (int index = 0; index < intersections.count(); index += 2) { in create_underline()
24 SkScalar start = intersections[index] - uWidth;; in create_underline()
25 end = intersections[index + 1] + uWidth; in create_underline()
40 const SkPaint& paint, SkScalar uWidth, SkTDArray<SkScalar>* intersections) { in find_intercepts() argument
46 intersections->setCount(count); in find_intercepts()
47 paint.getTextIntercepts(test, len, x, y, bounds, intersections->begin()); in find_intercepts()
66 SkTDArray<SkScalar> intersections; variable
68 &intersections);
73 SkPath underline = create_underline(intersections, start, end, uPos, uWidth, textSize);
[all …]
|
| /external/skia/gm/ |
| D | texteffects.cpp | 18 static SkPath create_underline(const SkTDArray<SkScalar>& intersections, in create_underline() argument
23 for (int index = 0; index < intersections.count(); index += 2) { in create_underline()
24 SkScalar start = intersections[index] - uWidth;; in create_underline()
25 end = intersections[index + 1] + uWidth; in create_underline()
40 const SkPaint& paint, SkScalar uWidth, SkTDArray<SkScalar>* intersections) { in find_intercepts() argument
46 intersections->setCount(count); in find_intercepts()
47 paint.getTextIntercepts(test, len, x, y, bounds, intersections->begin()); in find_intercepts()
66 SkTDArray<SkScalar> intersections; variable
68 &intersections);
73 SkPath underline = create_underline(intersections, start, end, uPos, uWidth, textSize);
[all …]
|
| /external/skia/src/pathops/ |
| D | SkPathOpsTSect.h | 233 SkIntersections* intersections);
1965 const SkTSect<OppCurve, TCurve>* sect2, SkIntersections* intersections) { in EndsEqual() argument
1969 intersections->insert(0, 0, sect1->fCurve[0]); in EndsEqual()
1973 intersections->insert(0, 1, sect1->fCurve[0]); in EndsEqual()
1977 intersections->insert(1, 0, sect1->fCurve[TCurve::kPointLast]); in EndsEqual()
1981 intersections->insert(1, 1, sect1->fCurve[TCurve::kPointLast]); in EndsEqual()
1987 intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]); in EndsEqual()
1992 intersections->insertNear(0, 1, sect1->fCurve[0], sect2->fCurve[OppCurve::kPointLast]); in EndsEqual()
1998 intersections->insertNear(1, 0, sect1->fCurve[TCurve::kPointLast], sect2->fCurve[0]); in EndsEqual()
2004 intersections->insertNear(1, 1, sect1->fCurve[TCurve::kPointLast], in EndsEqual()
[all …]
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsTSect.h | 233 SkIntersections* intersections);
1965 const SkTSect<OppCurve, TCurve>* sect2, SkIntersections* intersections) { in EndsEqual() argument
1969 intersections->insert(0, 0, sect1->fCurve[0]); in EndsEqual()
1973 intersections->insert(0, 1, sect1->fCurve[0]); in EndsEqual()
1977 intersections->insert(1, 0, sect1->fCurve[TCurve::kPointLast]); in EndsEqual()
1981 intersections->insert(1, 1, sect1->fCurve[TCurve::kPointLast]); in EndsEqual()
1987 intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]); in EndsEqual()
1992 intersections->insertNear(0, 1, sect1->fCurve[0], sect2->fCurve[OppCurve::kPointLast]); in EndsEqual()
1998 intersections->insertNear(1, 0, sect1->fCurve[TCurve::kPointLast], sect2->fCurve[0]); in EndsEqual()
2004 intersections->insertNear(1, 1, sect1->fCurve[TCurve::kPointLast], in EndsEqual()
[all …]
|
| /external/clang/test/Analysis/ |
| D | NewDelete-intersections.mm | 12 // Check for intersections with unix.Malloc and unix.MallocWithAnnotations
|
| /external/vixl/doc/ |
| D | changelog.md | 48 + Provide helpers to create CPURegList from list unions or intersections.
|
| /external/freetype/docs/ |
| D | raster.txt | 538 have to compute the intersections of arcs with the profile's
545 compute its intersections with the
|
| /external/skqp/docs/ |
| D | SkPaint_Reference.bmh | 4861 #Param intervals returned intersections; may be nullptr ##
4863 #Return number of intersections; may be zero ##
4915 #Param intervals returned intersections; may be nullptr ##
4917 #Return number of intersections; may be zero ##
4971 #Param intervals returned intersections; may be nullptr ##
4973 #Return number of intersections; may be zero ##
5030 #Param intervals returned intersections; may be nullptr ##
5032 #Return number of intersections; may be zero ##
|
| /external/skia/docs/ |
| D | SkPaint_Reference.bmh | 4842 #Param intervals returned intersections; may be nullptr ##
4844 #Return number of intersections; may be zero ##
4896 #Param intervals returned intersections; may be nullptr ##
4898 #Return number of intersections; may be zero ##
4952 #Param intervals returned intersections; may be nullptr ##
4954 #Return number of intersections; may be zero ##
5011 #Param intervals returned intersections; may be nullptr ##
5013 #Return number of intersections; may be zero ##
|
| /external/skqp/site/dev/design/conical/ |
| D | index.md | 189 number of intersections between ray $C_f P$ and circle $C_1, r_1$. Therefore
|
| /external/skia/site/dev/design/conical/ |
| D | index.md | 189 number of intersections between ray $C_f P$ and circle $C_1, r_1$. Therefore
|