OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:asSkPoint
(Results
1 - 25
of
38
) sorted by null
1
2
/external/chromium_org/third_party/skia/tests/
PathOpsDLineTest.cpp
36
SkPoint pts[2] = {line[0].
asSkPoint
(), line[1].
asSkPoint
()};
PathOpsAngleTest.cpp
45
SkPoint pt = dPt.
asSkPoint
();
103
} while (last.
asSkPoint
() != quad[1].
asSkPoint
());
253
data.fShortPts[idx2] = data.fPts.fPts[idx2].
asSkPoint
();
414
temp[idx2] = data.fPts.fPts[idx2].
asSkPoint
();
420
data.fShortPts[0] = seg[0].
asSkPoint
();
421
data.fShortPts[1] = seg[1].
asSkPoint
();
426
data.fShortPts[0] = seg[0].
asSkPoint
();
427
data.fShortPts[1] = seg[1].
asSkPoint
();
428
data.fShortPts[2] = seg[2].
asSkPoint
();
[
all
...]
PathOpsTestCommon.cpp
56
quads[index][1].
asSkPoint
(),
57
quads[index][2].
asSkPoint
()
101
cPts[0] = part[1].
asSkPoint
();
102
cPts[1] = part[2].
asSkPoint
();
103
cPts[2] = part[3].
asSkPoint
();
PathOpsDPointTest.cpp
36
SkPoint sPt = pt.
asSkPoint
();
/external/skia/tests/
PathOpsDLineTest.cpp
36
SkPoint pts[2] = {line[0].
asSkPoint
(), line[1].
asSkPoint
()};
PathOpsAngleTest.cpp
45
SkPoint pt = dPt.
asSkPoint
();
103
} while (last.
asSkPoint
() != quad[1].
asSkPoint
());
253
data.fShortPts[idx2] = data.fPts.fPts[idx2].
asSkPoint
();
414
temp[idx2] = data.fPts.fPts[idx2].
asSkPoint
();
420
data.fShortPts[0] = seg[0].
asSkPoint
();
421
data.fShortPts[1] = seg[1].
asSkPoint
();
426
data.fShortPts[0] = seg[0].
asSkPoint
();
427
data.fShortPts[1] = seg[1].
asSkPoint
();
428
data.fShortPts[2] = seg[2].
asSkPoint
();
[
all
...]
PathOpsTestCommon.cpp
56
quads[index][1].
asSkPoint
(),
57
quads[index][2].
asSkPoint
()
101
cPts[0] = part[1].
asSkPoint
();
102
cPts[1] = part[2].
asSkPoint
();
103
cPts[2] = part[3].
asSkPoint
();
PathOpsDPointTest.cpp
36
SkPoint sPt = pt.
asSkPoint
();
/external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCurve.h
41
return dline_xy_at_t(a, t).
asSkPoint
();
45
return dquad_xy_at_t(a, t).
asSkPoint
();
49
return dcubic_xy_at_t(a, t).
asSkPoint
();
107
return topPt.
asSkPoint
();
114
return topPt.
asSkPoint
();
SkDQuadLineIntersection.cpp
326
SkPoint gridPt = pt->
asSkPoint
();
327
if (SkDPoint::ApproximatelyEqual(gridPt, fLine[0].
asSkPoint
())) {
330
} else if (SkDPoint::ApproximatelyEqual(gridPt, fLine[1].
asSkPoint
())) {
337
if (gridPt == fQuad[0].
asSkPoint
()) {
340
} else if (gridPt == fQuad[2].
asSkPoint
()) {
SkDCubicLineIntersection.cpp
355
SkPoint gridPt = pt->
asSkPoint
();
356
if (gridPt == fLine[0].
asSkPoint
()) {
358
} else if (gridPt == fLine[1].
asSkPoint
()) {
361
if (gridPt == fCubic[0].
asSkPoint
() && approximately_equal(*cubicT, 0)) {
363
} else if (gridPt == fCubic[3].
asSkPoint
() && approximately_equal(*cubicT, 1)) {
SkPathOpsDebug.h
128
#define PT_DEBUG_DATA(i, n) i.pt(n).
asSkPoint
().fX, i.pt(n).
asSkPoint
().fY
SkReduceOrder.cpp
268
*reducePts++ = reducer.fLine[index].
asSkPoint
();
281
*reducePts++ = reducer.fQuad[index].
asSkPoint
();
SkOpContour.cpp
14
SkPoint pt0 = ts.pt(0).
asSkPoint
();
15
SkPoint pt1 = ts.pt(1).
asSkPoint
();
35
coincidence.fPts[!swap][0] = nearStart ? ts.pt2(0).
asSkPoint
() : pt0;
36
coincidence.fPts[!swap][1] = nearEnd ? ts.pt2(1).
asSkPoint
() : pt1;
164
SkPoint pt0 = ts.pt(ptIndex).
asSkPoint
();
165
SkPoint pt1 = ts.pt(ptIndex + 1).
asSkPoint
();
SkAddIntersections.cpp
399
SkPoint point = ts.pt(pt).
asSkPoint
();
427
SkPoint point = ts.pt(0).
asSkPoint
();
SkDQuadIntersection.cpp
404
if (q1[i1].
asSkPoint
() == q2[i2].
asSkPoint
()) {
SkOpAngle.cpp
186
SkPoint shortPts[2] = { fCurvePart[0].
asSkPoint
(), fCurvePart[1].
asSkPoint
() };
[
all
...]
/external/skia/src/pathops/
SkPathOpsCurve.h
41
return dline_xy_at_t(a, t).
asSkPoint
();
45
return dquad_xy_at_t(a, t).
asSkPoint
();
49
return dcubic_xy_at_t(a, t).
asSkPoint
();
107
return topPt.
asSkPoint
();
114
return topPt.
asSkPoint
();
SkDQuadLineIntersection.cpp
326
SkPoint gridPt = pt->
asSkPoint
();
327
if (SkDPoint::ApproximatelyEqual(gridPt, fLine[0].
asSkPoint
())) {
330
} else if (SkDPoint::ApproximatelyEqual(gridPt, fLine[1].
asSkPoint
())) {
337
if (gridPt == fQuad[0].
asSkPoint
()) {
340
} else if (gridPt == fQuad[2].
asSkPoint
()) {
SkDCubicLineIntersection.cpp
355
SkPoint gridPt = pt->
asSkPoint
();
356
if (gridPt == fLine[0].
asSkPoint
()) {
358
} else if (gridPt == fLine[1].
asSkPoint
()) {
361
if (gridPt == fCubic[0].
asSkPoint
() && approximately_equal(*cubicT, 0)) {
363
} else if (gridPt == fCubic[3].
asSkPoint
() && approximately_equal(*cubicT, 1)) {
SkPathOpsDebug.h
128
#define PT_DEBUG_DATA(i, n) i.pt(n).
asSkPoint
().fX, i.pt(n).
asSkPoint
().fY
SkReduceOrder.cpp
268
*reducePts++ = reducer.fLine[index].
asSkPoint
();
281
*reducePts++ = reducer.fQuad[index].
asSkPoint
();
SkOpContour.cpp
14
SkPoint pt0 = ts.pt(0).
asSkPoint
();
15
SkPoint pt1 = ts.pt(1).
asSkPoint
();
35
coincidence.fPts[!swap][0] = nearStart ? ts.pt2(0).
asSkPoint
() : pt0;
36
coincidence.fPts[!swap][1] = nearEnd ? ts.pt2(1).
asSkPoint
() : pt1;
164
SkPoint pt0 = ts.pt(ptIndex).
asSkPoint
();
165
SkPoint pt1 = ts.pt(ptIndex + 1).
asSkPoint
();
SkAddIntersections.cpp
399
SkPoint point = ts.pt(pt).
asSkPoint
();
427
SkPoint point = ts.pt(0).
asSkPoint
();
SkDQuadIntersection.cpp
404
if (q1[i1].
asSkPoint
() == q2[i2].
asSkPoint
()) {
Completed in 2080 milliseconds
1
2