Searched refs:pts (Results 51 - 75 of 530) sorted by relevance

1234567891011>>

/external/skia/src/core/
H A DSkEdgeBuilder.h44 void addLine(const SkPoint pts[]);
45 void addQuad(const SkPoint pts[]);
46 void addCubic(const SkPoint pts[]);
H A DSkPath.cpp34 SkPoint pts[4]; local
35 return SkPath::kDone_Verb == iter.next(pts);
246 SkPoint pts[4]; local
251 while ((verb = iter.next(pts)) != kDone_Verb) {
257 firstPt = prevPt = pts[0];
282 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
285 prevPt = pts[nextPt];
333 const SkPoint* pts = fPathRef->points(); local
334 line[0] = pts[0];
335 line[1] = pts[
396 const SkPoint* pts = *ptsPtr; local
518 const SkPoint* pts = fPathRef->points(); local
529 const SkPoint* pts = fPathRef->points(); local
536 const SkPoint* pts = fPathRef->points(); local
720 SkPoint* pts = ed.growForVerb(kQuad_Verb); local
750 SkPoint* pts = ed.growForVerb(kConic_Verb, w); local
773 SkPoint* pts = ed.growForVerb(kCubic_Verb); local
857 addPoly(const SkPoint pts[], int count, bool close) argument
884 build_arc_points(const SkRect& oval, SkScalar startAngle, SkScalar sweepAngle, SkPoint pts[kSkBuildQuadArcStorage]) argument
1329 SkPoint pts[kSkBuildQuadArcStorage]; local
1355 SkPoint pts[kSkBuildQuadArcStorage]; local
1428 SkPoint pts[kSkBuildQuadArcStorage]; local
1457 SkPoint pts[4]; local
1527 const SkPoint* pts = path.fPathRef->points(); local
1567 const SkPoint* pts = src.fPathRef->pointsEnd(); local
1626 subdivide_quad_to(SkPath* path, const SkPoint pts[3], int level = 2) argument
1639 subdivide_cubic_to(SkPath* path, const SkPoint pts[4], int level = 2) argument
1663 SkPoint pts[4]; local
1795 autoClose(SkPoint pts[2]) argument
1925 SkPoint* SK_RESTRICT pts = ptsParam; local
2010 next(SkPoint pts[4]) argument
2124 append_params(SkString* str, const char label[], const SkPoint pts[], int count, SkScalar conicWeight = -1) argument
2147 SkPoint pts[4]; local
2336 SkPoint pts[4]; local
2393 const SkPoint* pts() const { return fCurrPt; } function in class:ContourIter
2484 find_max_y(const SkPoint pts[], int count) argument
2498 find_diff_pt(const SkPoint pts[], int index, int n, int inc) argument
2516 find_min_max_x_at_y(const SkPoint pts[], int index, int n, int* maxIndexPtr) argument
2578 const SkPoint* pts = iter.pts(); local
[all...]
H A DSkPathMeasure.cpp54 static bool quad_too_curvy(const SkPoint pts[3]) { argument
57 SkScalar dx = SkScalarHalf(pts[1].fX) -
58 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX));
59 SkScalar dy = SkScalarHalf(pts[1].fY) -
60 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY));
73 static bool cubic_too_curvy(const SkPoint pts[4]) { argument
74 return cheap_dist_exceeds_limit(pts[1],
75 SkScalarInterp(pts[
83 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument
107 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument
132 SkPoint pts[4]; local
[all...]
H A DSkStroke.cpp112 void quad_to(const SkPoint pts[3],
116 void cubic_to(const SkPoint pts[4],
246 void SkPathStroker::quad_to(const SkPoint pts[3], argument
250 if (!set_normal_unitnormal(pts[1], pts[2], fRadius,
252 // pts[1] nearly equals pts[2], so just draw a line to pts[2]
253 this->line_to(pts[2], normalAB);
263 SkChopQuadAtHalf(pts, tm
282 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument
382 SkPoint pts[3], tmp[5]; local
443 SkPoint pts[4], tmp[13]; local
583 SkPoint pts[4]; local
662 SkPoint pts[8]; local
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkPath.cpp34 SkPoint pts[4]; local
35 return SkPath::kDone_Verb == iter.next(pts);
246 SkPoint pts[4]; local
251 while ((verb = iter.next(pts)) != kDone_Verb) {
257 firstPt = prevPt = pts[0];
282 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
285 prevPt = pts[nextPt];
333 const SkPoint* pts = fPathRef->points(); local
334 line[0] = pts[0];
335 line[1] = pts[
396 const SkPoint* pts = *ptsPtr; local
518 const SkPoint* pts = fPathRef->points(); local
529 const SkPoint* pts = fPathRef->points(); local
536 const SkPoint* pts = fPathRef->points(); local
722 SkPoint* pts = ed.growForVerb(kQuad_Verb); local
752 SkPoint* pts = ed.growForVerb(kConic_Verb, w); local
775 SkPoint* pts = ed.growForVerb(kCubic_Verb); local
859 addPoly(const SkPoint pts[], int count, bool close) argument
886 build_arc_points(const SkRect& oval, SkScalar startAngle, SkScalar sweepAngle, SkPoint pts[kSkBuildQuadArcStorage]) argument
1235 SkPoint pts[kSkBuildQuadArcStorage]; local
1261 SkPoint pts[kSkBuildQuadArcStorage]; local
1334 SkPoint pts[kSkBuildQuadArcStorage]; local
1363 SkPoint pts[4]; local
1433 const SkPoint* pts = path.fPathRef->points(); local
1473 const SkPoint* pts = src.fPathRef->pointsEnd(); local
1532 subdivide_quad_to(SkPath* path, const SkPoint pts[3], int level = 2) argument
1545 subdivide_cubic_to(SkPath* path, const SkPoint pts[4], int level = 2) argument
1569 SkPoint pts[4]; local
1701 autoClose(SkPoint pts[2]) argument
1831 SkPoint* SK_RESTRICT pts = ptsParam; local
1916 next(SkPoint pts[4]) argument
2035 append_params(SkString* str, const char label[], const SkPoint pts[], int count, bool dumpAsHex, SkScalar conicWeight = -1) argument
2058 SkPoint pts[4]; local
2297 SkPoint pts[4]; local
2354 const SkPoint* pts() const { return fCurrPt; } function in class:ContourIter
2445 find_max_y(const SkPoint pts[], int count) argument
2459 find_diff_pt(const SkPoint pts[], int index, int n, int inc) argument
2477 find_min_max_x_at_y(const SkPoint pts[], int index, int n, int* maxIndexPtr) argument
2539 const SkPoint* pts = iter.pts(); local
[all...]
H A DSkPathMeasure.cpp54 static bool quad_too_curvy(const SkPoint pts[3]) { argument
57 SkScalar dx = SkScalarHalf(pts[1].fX) -
58 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX));
59 SkScalar dy = SkScalarHalf(pts[1].fY) -
60 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY));
73 static bool cubic_too_curvy(const SkPoint pts[4]) { argument
74 return cheap_dist_exceeds_limit(pts[1],
75 SkScalarInterp(pts[
83 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument
107 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument
132 SkPoint pts[4]; local
[all...]
H A DSkStroke.cpp112 void quad_to(const SkPoint pts[3],
116 void cubic_to(const SkPoint pts[4],
246 void SkPathStroker::quad_to(const SkPoint pts[3], argument
250 if (!set_normal_unitnormal(pts[1], pts[2], fRadius,
252 // pts[1] nearly equals pts[2], so just draw a line to pts[2]
253 this->line_to(pts[2], normalAB);
263 SkChopQuadAtHalf(pts, tm
282 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument
382 SkPoint pts[3], tmp[5]; local
444 SkPoint pts[4], tmp[13]; local
584 SkPoint pts[4]; local
663 SkPoint pts[8]; local
[all...]
/external/chromium_org/third_party/skia/tests/
H A DPathOpsTestCommon.cpp38 SkPoint pts[4]; local
39 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
42 quadPath->moveTo(pts[0].fX, pts[0].fY);
45 quadPath->lineTo(pts[1].fX, pts[1].fY);
48 quadPath->quadTo(pts[1].fX, pts[1].fY, pts[2].fX, pts[
77 SkPoint pts[4]; local
162 ValidPoints(const SkPoint* pts, int count) argument
[all...]
/external/skia/src/pathops/
H A DSkOpEdgeBuilder.cpp60 SkPoint pts[4]; local
64 verb = iter.next(pts);
71 fPathPts.push_back(pts[0]);
72 curveStart = curve[0] = pts[0];
76 if (SkDPoint::ApproximatelyEqual(curve[0], pts[1])) {
79 fPathPts.back() = pts[1];
85 curve[1] = pts[1];
86 curve[2] = pts[2];
87 verb = SkReduceOrder::Quad(curve, pts);
93 const SkPoint* quadPts = quadder.computeQuads(pts, ite
[all...]
H A DSkReduceOrder.h26 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
27 static SkPath::Verb Quad(const SkPoint pts[3], SkPoint* reducePts);
H A DSkPathOpsCubic.h16 const SkDCubic& first() const { return (const SkDCubic&) pts[0]; }
17 const SkDCubic& second() const { return (const SkDCubic&) pts[3]; }
18 SkDPoint pts[7]; member in struct:SkDCubicPair
59 void set(const SkPoint pts[4]) { argument
60 fPts[0] = pts[0];
61 fPts[1] = pts[1];
62 fPts[2] = pts[2];
63 fPts[3] = pts[3];
76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1, argument
79 cubic.set(pts);
[all...]
/external/skia/tests/
H A DPathOpsTestCommon.cpp38 SkPoint pts[4]; local
39 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
42 quadPath->moveTo(pts[0].fX, pts[0].fY);
45 quadPath->lineTo(pts[1].fX, pts[1].fY);
48 quadPath->quadTo(pts[1].fX, pts[1].fY, pts[2].fX, pts[
77 SkPoint pts[4]; local
162 ValidPoints(const SkPoint* pts, int count) argument
[all...]
/external/chromium_org/third_party/skia/samplecode/
H A DSampleEffects.cpp42 SkPoint pts[] = { { 3, 0 }, { 7, 5 } }; local
43 paint->setShader(SkGradientShader::CreateLinear(pts, colors, NULL, SK_ARRAY_COUNT(colors),
70 const float pts[] = { local
79 fPath.moveTo(pts[0], pts[1]);
80 for (i = 2; i < SK_ARRAY_COUNT(pts); i += 2) {
81 fPath.lineTo(pts[i], pts[i+1]);
H A DSampleFontScalerTest.cpp78 SkPoint pts[4]; local
79 pts[0].set(1.61061274e+09f, 6291456);
80 pts[1].set(-7.18397061e+15f,
82 pts[2].set(-1.30077315e+16f,
84 pts[3].set(-1.30077315e+16f,
88 path.moveTo(pts[0]);
89 path.cubicTo(pts[1], pts[2], pts[3]);
/external/chromium_org/third_party/skia/src/pathops/
H A DSkReduceOrder.h26 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
27 static SkPath::Verb Quad(const SkPoint pts[3], SkPoint* reducePts);
H A DSkOpEdgeBuilder.cpp71 SkPoint pts[4]; local
75 verb = iter.next(pts);
82 force_small_to_zero(&pts[0]);
83 fPathPts.push_back(pts[0]);
84 curveStart = curve[0] = pts[0];
88 force_small_to_zero(&pts[1]);
89 if (SkDPoint::ApproximatelyEqual(curve[0], pts[1])) {
92 fPathPts.back() = pts[1];
98 force_small_to_zero(&pts[1]);
99 force_small_to_zero(&pts[
[all...]
H A DSkPathOpsCubic.h16 const SkDCubic& first() const { return (const SkDCubic&) pts[0]; }
17 const SkDCubic& second() const { return (const SkDCubic&) pts[3]; }
18 SkDPoint pts[7]; member in struct:SkDCubicPair
59 void set(const SkPoint pts[4]) { argument
60 fPts[0] = pts[0];
61 fPts[1] = pts[1];
62 fPts[2] = pts[2];
63 fPts[3] = pts[3];
76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1, argument
79 cubic.set(pts);
[all...]
/external/skia/samplecode/
H A DSampleEffects.cpp42 SkPoint pts[] = { { 3, 0 }, { 7, 5 } }; local
43 paint->setShader(SkGradientShader::CreateLinear(pts, colors, NULL, SK_ARRAY_COUNT(colors),
70 const float pts[] = { local
79 fPath.moveTo(pts[0], pts[1]);
80 for (i = 2; i < SK_ARRAY_COUNT(pts); i += 2) {
81 fPath.lineTo(pts[i], pts[i+1]);
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DLineIntersection_Test.cpp43 int pts = intersect(line1, line2, ts); local
44 if (!pts) {
47 for (int i = 0; i < pts; ++i) {
52 if (pts == 1) {
67 int pts = intersect(line1, line2, ts); local
68 if (pts) {
H A DEdgeDemo.cpp46 int pts[circles * 2 * 4]; local
54 pts[c * 8 + p * 2] = abs(90 - ((step + c * 121 + p * 13) % 190));
55 pts[c * 8 + p * 2 + 1] = abs(110 - ((step + c * 223 + p * 17) % 230));
61 SkScalar x = pts[c * 8 + p * 2];
62 SkScalar y = pts[c * 8 + p * 2 + 1];
107 int pts[stars]; local
111 pts[s] = 4 + (s % 7);
148 angles[s], pts[s], locs[s]);
159 SkPoint pts[4];
163 while ((verb = iter.next(pts)) !
[all...]
/external/skia/experimental/Intersection/
H A DLineIntersection_Test.cpp43 int pts = intersect(line1, line2, ts); local
44 if (!pts) {
47 for (int i = 0; i < pts; ++i) {
52 if (pts == 1) {
67 int pts = intersect(line1, line2, ts); local
68 if (pts) {
H A DEdgeDemo.cpp46 int pts[circles * 2 * 4]; local
54 pts[c * 8 + p * 2] = abs(90 - ((step + c * 121 + p * 13) % 190));
55 pts[c * 8 + p * 2 + 1] = abs(110 - ((step + c * 223 + p * 17) % 230));
61 SkScalar x = pts[c * 8 + p * 2];
62 SkScalar y = pts[c * 8 + p * 2 + 1];
107 int pts[stars]; local
111 pts[s] = 4 + (s % 7);
148 angles[s], pts[s], locs[s]);
159 SkPoint pts[4];
163 while ((verb = iter.next(pts)) !
[all...]
/external/chromium_org/third_party/skia/gm/
H A DgradientDirtyLaundry.cpp38 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm) { argument
39 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, data.fCount, tm);
42 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm) { argument
44 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
45 SkScalarAve(pts[0].fY, pts[1].fY));
50 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, SkShader::TileMode) { argument
52 center.set(SkScalarAve(pts[0].fX, pts[
77 SkPoint pts[2] = { { 0, 0 }, variable
[all...]
/external/skia/gm/
H A DgradientDirtyLaundry.cpp38 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm) { argument
39 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, data.fCount, tm);
42 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm) { argument
44 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
45 SkScalarAve(pts[0].fY, pts[1].fY));
50 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, SkShader::TileMode) { argument
52 center.set(SkScalarAve(pts[0].fX, pts[
81 SkPoint pts[2] = { { 0, 0 }, variable
[all...]
/external/eigen/unsupported/Eigen/src/Splines/
H A DSplineFitting.h56 * \param[in] pts The data points to which a spline should be fit.
62 void ChordLengths(const PointArrayType& pts, KnotVectorType& chord_lengths) argument
66 const DenseIndex n = pts.cols();
69 chord_lengths.resize(pts.cols());
71 chord_lengths.rightCols(n-1) = (pts.array().leftCols(n-1) - pts.array().rightCols(n-1)).matrix().colwise().norm();
93 * \param pts The points for which an interpolating spline will be computed.
99 static SplineType Interpolate(const PointArrayType& pts, DenseIndex degree);
104 * \param pts The points for which an interpolating spline will be computed.
111 static SplineType Interpolate(const PointArrayType& pts, DenseInde
116 Interpolate(const PointArrayType& pts, DenseIndex degree, const KnotVectorType& knot_parameters) argument
148 Interpolate(const PointArrayType& pts, DenseIndex degree) argument
[all...]

Completed in 2741 milliseconds

1234567891011>>