Searched refs:pts (Results 26 - 50 of 293) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/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 DSkPathMeasure.cpp59 static bool quad_too_curvy(const SkPoint pts[3]) { argument
62 SkScalar dx = SkScalarHalf(pts[1].fX) -
63 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX));
64 SkScalar dy = SkScalarHalf(pts[1].fY) -
65 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY));
78 static bool cubic_too_curvy(const SkPoint pts[4]) { argument
79 return cheap_dist_exceeds_limit(pts[1],
80 SkScalarInterp(pts[
88 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument
112 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument
137 SkPoint pts[4]; local
[all...]
H A DSkStroke.cpp103 void quad_to(const SkPoint pts[3],
107 void cubic_to(const SkPoint pts[4],
237 void SkPathStroker::quad_to(const SkPoint pts[3], argument
241 if (!set_normal_unitnormal(pts[1], pts[2], fRadius,
243 // pts[1] nearly equals pts[2], so just draw a line to pts[2]
244 this->line_to(pts[2], normalAB);
254 SkChopQuadAtHalf(pts, tm
273 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument
373 SkPoint pts[3], tmp[5]; local
434 SkPoint pts[4], tmp[13]; local
574 SkPoint pts[4]; local
653 SkPoint pts[8]; local
[all...]
H A DSkScan_Hairline.cpp48 SkPoint pts[2] = { pt0, pt1 };
57 if (!SkLineClipper::IntersectLine(pts, fixedBounds, pts)) {
67 if (!SkLineClipper::IntersectLine(pts, r, pts)) {
72 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX);
73 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY);
74 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX);
75 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY);
196 static int compute_int_quad_dist(const SkPoint pts[
[all...]
H A DSkPath.cpp41 SkPoint pts[4]; local
42 return SkPath::kDone_Verb == iter.next(pts);
307 SkPoint pts[4]; local
312 while ((verb = iter.next(pts)) != kDone_Verb) {
318 firstPt = prevPt = pts[0];
343 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
346 prevPt = pts[nextPt];
394 const SkPoint* pts = fPathRef->points(); local
395 line[0] = pts[0];
396 line[1] = pts[
443 const SkPoint* pts = *ptsPtr; local
539 const SkPoint* pts = fPathRef->points(); local
550 const SkPoint* pts = fPathRef->points(); local
557 const SkPoint* pts = fPathRef->points(); local
764 SkPoint* pts = ed.growForVerb(kQuad_Verb); local
796 SkPoint* pts = ed.growForConic(w); local
821 SkPoint* pts = ed.growForVerb(kCubic_Verb); local
908 addPoly(const SkPoint pts[], int count, bool close) argument
1219 build_arc_points(const SkRect& oval, SkScalar startAngle, SkScalar sweepAngle, SkPoint pts[kSkBuildQuadArcStorage]) argument
1285 SkPoint pts[kSkBuildQuadArcStorage]; local
1312 SkPoint pts[kSkBuildQuadArcStorage]; local
1375 SkPoint pts[kSkBuildQuadArcStorage]; local
1406 SkPoint pts[4]; local
1473 const SkPoint* pts = path.fPathRef->points() + 1; local
1511 const SkPoint* pts = path.fPathRef->points(); local
1551 const SkPoint* pts = src.fPathRef->pointsEnd(); local
1612 subdivide_quad_to(SkPath* path, const SkPoint pts[3], int level = 2) argument
1625 subdivide_cubic_to(SkPath* path, const SkPoint pts[4], int level = 2) argument
1649 SkPoint pts[4]; local
1819 autoClose(SkPoint pts[2]) argument
1949 SkPoint* SK_RESTRICT pts = ptsParam; local
2034 next(SkPoint pts[4]) argument
2158 append_params(SkString* str, const char label[], const SkPoint pts[], int count, SkScalar conicWeight = -1) argument
2181 SkPoint pts[4]; local
2385 SkPoint pts[4]; local
2442 const SkPoint* pts() const { return fCurrPt; } function in class:ContourIter
2533 find_max_y(const SkPoint pts[], int count) argument
2547 find_diff_pt(const SkPoint pts[], int index, int n, int inc) argument
2565 find_min_max_x_at_y(const SkPoint pts[], int index, int n, int* maxIndexPtr) argument
2615 convex_dir_test(int n, const SkPoint pts[], SkPath::Direction* dir) argument
2681 const SkPoint* pts = iter.pts(); local
[all...]
H A DSkEdge.cpp177 int SkQuadraticEdge::setQuadratic(const SkPoint pts[3], int shift) argument
184 x0 = int(pts[0].fX * scale);
185 y0 = int(pts[0].fY * scale);
186 x1 = int(pts[1].fX * scale);
187 y1 = int(pts[1].fY * scale);
188 x2 = int(pts[2].fX * scale);
189 y2 = int(pts[2].fY * scale);
192 x0 = pts[0].fX >> shift;
193 y0 = pts[0].fY >> shift;
194 x1 = pts[
337 setCubic(const SkPoint pts[4], const SkIRect* clip, int shift) argument
[all...]
/external/eigen/unsupported/test/
H A Dsplines.cpp109 MatrixXd pts(10,3);
110 pts << 0.707620811535916, 0.510258911240815, 0.417485437023409,
120 pts.transposeInPlace();
125 VERIFY( (pt - pts.col(i)).norm() < 1e-14 );
136 MatrixXd pts(11,3);
137 pts << 0.959743958516081, 0.340385726666133, 0.585267750979777,
148 pts.transposeInPlace();
153 VERIFY( (pt - pts.col(i)).norm() < 1e-14 );
175 MatrixXd pts(12,2);
176 pts <<
[all...]
/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 DSkPathMeasure.cpp59 static bool quad_too_curvy(const SkPoint pts[3]) { argument
62 SkScalar dx = SkScalarHalf(pts[1].fX) -
63 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX));
64 SkScalar dy = SkScalarHalf(pts[1].fY) -
65 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY));
78 static bool cubic_too_curvy(const SkPoint pts[4]) { argument
79 return cheap_dist_exceeds_limit(pts[1],
80 SkScalarInterp(pts[
88 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument
112 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument
137 SkPoint pts[4]; local
[all...]
H A DSkStroke.cpp103 void quad_to(const SkPoint pts[3],
107 void cubic_to(const SkPoint pts[4],
237 void SkPathStroker::quad_to(const SkPoint pts[3], argument
241 if (!set_normal_unitnormal(pts[1], pts[2], fRadius,
243 // pts[1] nearly equals pts[2], so just draw a line to pts[2]
244 this->line_to(pts[2], normalAB);
254 SkChopQuadAtHalf(pts, tm
273 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument
373 SkPoint pts[3], tmp[5]; local
434 SkPoint pts[4], tmp[13]; local
574 SkPoint pts[4]; local
653 SkPoint pts[8]; local
[all...]
H A DSkScan_Hairline.cpp48 SkPoint pts[2] = { pt0, pt1 };
57 if (!SkLineClipper::IntersectLine(pts, fixedBounds, pts)) {
67 if (!SkLineClipper::IntersectLine(pts, r, pts)) {
72 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX);
73 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY);
74 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX);
75 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY);
196 static int compute_int_quad_dist(const SkPoint pts[
[all...]
H A DSkPath.cpp41 SkPoint pts[4]; local
42 return SkPath::kDone_Verb == iter.next(pts);
307 SkPoint pts[4]; local
312 while ((verb = iter.next(pts)) != kDone_Verb) {
318 firstPt = prevPt = pts[0];
343 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
346 prevPt = pts[nextPt];
394 const SkPoint* pts = fPathRef->points(); local
395 line[0] = pts[0];
396 line[1] = pts[
443 const SkPoint* pts = *ptsPtr; local
539 const SkPoint* pts = fPathRef->points(); local
550 const SkPoint* pts = fPathRef->points(); local
557 const SkPoint* pts = fPathRef->points(); local
764 SkPoint* pts = ed.growForVerb(kQuad_Verb); local
796 SkPoint* pts = ed.growForConic(w); local
821 SkPoint* pts = ed.growForVerb(kCubic_Verb); local
908 addPoly(const SkPoint pts[], int count, bool close) argument
1219 build_arc_points(const SkRect& oval, SkScalar startAngle, SkScalar sweepAngle, SkPoint pts[kSkBuildQuadArcStorage]) argument
1285 SkPoint pts[kSkBuildQuadArcStorage]; local
1312 SkPoint pts[kSkBuildQuadArcStorage]; local
1375 SkPoint pts[kSkBuildQuadArcStorage]; local
1406 SkPoint pts[4]; local
1473 const SkPoint* pts = path.fPathRef->points() + 1; local
1511 const SkPoint* pts = path.fPathRef->points(); local
1551 const SkPoint* pts = src.fPathRef->pointsEnd(); local
1612 subdivide_quad_to(SkPath* path, const SkPoint pts[3], int level = 2) argument
1625 subdivide_cubic_to(SkPath* path, const SkPoint pts[4], int level = 2) argument
1649 SkPoint pts[4]; local
1819 autoClose(SkPoint pts[2]) argument
1949 SkPoint* SK_RESTRICT pts = ptsParam; local
2034 next(SkPoint pts[4]) argument
2158 append_params(SkString* str, const char label[], const SkPoint pts[], int count, SkScalar conicWeight = -1) argument
2181 SkPoint pts[4]; local
2385 SkPoint pts[4]; local
2442 const SkPoint* pts() const { return fCurrPt; } function in class:ContourIter
2533 find_max_y(const SkPoint pts[], int count) argument
2547 find_diff_pt(const SkPoint pts[], int index, int n, int inc) argument
2565 find_min_max_x_at_y(const SkPoint pts[], int index, int n, int* maxIndexPtr) argument
2615 convex_dir_test(int n, const SkPoint pts[], SkPath::Direction* dir) argument
2681 const SkPoint* pts = iter.pts(); local
[all...]
H A DSkEdge.cpp177 int SkQuadraticEdge::setQuadratic(const SkPoint pts[3], int shift) argument
184 x0 = int(pts[0].fX * scale);
185 y0 = int(pts[0].fY * scale);
186 x1 = int(pts[1].fX * scale);
187 y1 = int(pts[1].fY * scale);
188 x2 = int(pts[2].fX * scale);
189 y2 = int(pts[2].fY * scale);
192 x0 = pts[0].fX >> shift;
193 y0 = pts[0].fY >> shift;
194 x1 = pts[
337 setCubic(const SkPoint pts[4], const SkIRect* clip, int shift) argument
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpEdgeBuilder.cpp69 SkPoint pts[4]; local
73 verb = iter.next(pts);
80 fPathPts.push_back(pts[0]);
81 curveStart = curve[0] = pts[0];
85 if (AlmostEqualUlps(curve[0].fX, pts[1].fX)
86 && AlmostEqualUlps(curve[0].fY, pts[1].fY)) {
91 curve[1] = pts[1];
92 curve[2] = pts[2];
93 verb = SkReduceOrder::Quad(curve, pts);
99 const SkPoint* quadPts = quadder.computeQuads(pts, ite
[all...]
H A DSkReduceOrder.h30 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
31 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
24 void set(const SkPoint pts[4]) { argument
25 fPts[0] = pts[0];
26 fPts[1] = pts[1];
27 fPts[2] = pts[2];
28 fPts[3] = pts[3];
70 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1, argument
73 cubic.set(pts);
[all...]
/external/skia/src/pathops/
H A DSkOpEdgeBuilder.cpp69 SkPoint pts[4]; local
73 verb = iter.next(pts);
80 fPathPts.push_back(pts[0]);
81 curveStart = curve[0] = pts[0];
85 if (AlmostEqualUlps(curve[0].fX, pts[1].fX)
86 && AlmostEqualUlps(curve[0].fY, pts[1].fY)) {
91 curve[1] = pts[1];
92 curve[2] = pts[2];
93 verb = SkReduceOrder::Quad(curve, pts);
99 const SkPoint* quadPts = quadder.computeQuads(pts, ite
[all...]
H A DSkReduceOrder.h30 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
31 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
24 void set(const SkPoint pts[4]) { argument
25 fPts[0] = pts[0];
26 fPts[1] = pts[1];
27 fPts[2] = pts[2];
28 fPts[3] = pts[3];
70 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1, argument
73 cubic.set(pts);
[all...]
/external/skia/gm/
H A DgradientDirtyLaundry.cpp38 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, argument
40 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos,
44 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, argument
47 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
48 SkScalarAve(pts[0].fY, pts[1].fY));
53 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, argument
56 center.set(SkScalarAve(pts[0].fX, pts[
82 SkPoint pts[2] = { { 0, 0 }, variable
[all...]
H A Dgradients.cpp42 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, argument
44 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos,
48 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, argument
51 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
52 SkScalarAve(pts[0].fY, pts[1].fY));
57 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, argument
60 center.set(SkScalarAve(pts[0].fX, pts[
66 Make2Radial(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm, SkUnitMapper* mapper) argument
79 Make2Conical(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm, SkUnitMapper* mapper) argument
115 SkPoint pts[2] = { local
168 SkPoint pts[2] = { local
[all...]
/external/eigen/unsupported/Eigen/src/Splines/
H A DSplineFitting.h58 * \param[in] pts The data points to which a spline should be fit.
64 void ChordLengths(const PointArrayType& pts, KnotVectorType& chord_lengths) argument
68 const DenseIndex n = pts.cols();
71 chord_lengths.resize(pts.cols());
73 chord_lengths.rightCols(n-1) = (pts.array().leftCols(n-1) - pts.array().rightCols(n-1)).matrix().colwise().norm();
95 * \param pts The points for which an interpolating spline will be computed.
101 static SplineType Interpolate(const PointArrayType& pts, DenseIndex degree);
106 * \param pts The points for which an interpolating spline will be computed.
113 static SplineType Interpolate(const PointArrayType& pts, DenseInde
118 Interpolate(const PointArrayType& pts, DenseIndex degree, const KnotVectorType& knot_parameters) argument
151 Interpolate(const PointArrayType& pts, DenseIndex degree) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dapi_path.c438 VGfloat pts[] = {*minX, *minY,
444 matrix_map_point(matrix, pts[0], pts[1], pts + 0, pts + 1);
445 matrix_map_point(matrix, pts[2], pts[3], pts + 2, pts + 3);
446 matrix_map_point(matrix, pts[
[all...]
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dapi_path.c438 VGfloat pts[] = {*minX, *minY,
444 matrix_map_point(matrix, pts[0], pts[1], pts + 0, pts + 1);
445 matrix_map_point(matrix, pts[2], pts[3], pts + 2, pts + 3);
446 matrix_map_point(matrix, pts[
[all...]
/external/chromium_org/content/browser/android/
H A Dtouch_point.h22 jobjectArray pts,

Completed in 567 milliseconds

1234567891011>>