HomeSort by relevance Sort by last modified time
    Searched defs:pts (Results 1 - 25 of 169) sorted by null

1 2 3 4 5 6 7

  /external/skia/tests/
GeometryTest.cpp 38 SkPoint pts[3], dst[5]; local
40 pts[0].set(0, 0);
41 pts[1].set(100, 50);
42 pts[2].set(0, 100);
44 int count = SkChopQuadAtMaxCurvature(pts, dst);
47 pts[0].set(0, 0);
48 pts[1].set(SkIntToScalar(3), 0);
49 pts[2].set(SkIntToScalar(3), SkIntToScalar(3));
50 SkConvertQuadToCubic(pts, dst);
PathMeasureTest.cpp 14 const SkPoint pts[] = { local
20 path.moveTo(pts[0]);
21 for (size_t i = 1; i < SK_ARRAY_COUNT(pts); i += 3) {
22 path.cubicTo(pts[i], pts[i + 1], pts[i + 2]);
33 const SkPoint pts[] = { local
39 path.moveTo(pts[0]);
40 for (size_t i = 1; i < SK_ARRAY_COUNT(pts); i += 2) {
41 path.quadTo(pts[i], pts[i + 1])
51 const SkPoint pts[] = { local
    [all...]
PathOpsDLineTest.cpp 36 SkPoint pts[2] = {line[0].asSkPoint(), line[1].asSkPoint()}; local
37 line2.set(pts);
48 line2 = SkDLine::SubDivide(pts, 1, 0);
ShaderOpacityTest.cpp 54 SkPoint pts[2]; local
55 pts[0].iset(0, 0);
56 pts[1].iset(1, 0);
65 SkShader* grad = SkGradientShader::CreateLinear(pts, colors, pos, count,
74 grad = SkGradientShader::CreateLinear(pts, colors, pos, count, mode);
82 grad = SkGradientShader::CreateLinear(pts, colors, pos, count, mode);
90 grad = SkGradientShader::CreateLinear(pts, colors, pos, count, mode);
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCubic.h 16 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]) {
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,
73 cubic.set(pts);
    [all...]
SkPathOpsQuad.h 14 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; }
15 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; }
16 SkDPoint pts[5]; member in struct:SkDQuadPair
27 void set(const SkPoint pts[3]) {
28 fPts[0] = pts[0];
29 fPts[1] = pts[1];
30 fPts[2] = pts[2];
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
59 quad.set(pts);
SkAddIntersections.cpp 12 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt,
14 SkASSERT(i.used() == pts);
15 if (!pts) {
17 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
21 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
22 if (pts == 2) {
25 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
26 if (pts == 2) {
32 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt
199 int pts = 0; local
398 int pts = ts.cubic(wt.pts()); local
    [all...]
SkOpEdgeBuilder.cpp 69 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, iter.conicWeight()
    [all...]
  /external/chromium_org/third_party/skia/src/views/
SkParsePaint.cpp 24 SkPoint pts[2]; local
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
39 return SkGradientShader::CreateLinear(pts, colors, NULL, 2, mode);
  /external/skia/bench/
PathIterBench.cpp 17 static int rand_pts(SkRandom& rand, SkPoint pts[4]) {
22 pts[i].fX = rand.nextSScalar1();
23 pts[i].fY = rand.nextSScalar1();
42 SkPoint pts[4]; local
43 int n = rand_pts(rand, pts);
46 fPath.moveTo(pts[0]);
49 fPath.lineTo(pts[1]);
52 fPath.quadTo(pts[1], pts[2]);
55 fPath.cubicTo(pts[1], pts[2], pts[3])
73 SkPoint pts[4]; variable
81 SkPoint pts[4]; variable
    [all...]
  /external/skia/gm/
alphagradients.cpp 28 SkPoint pts[] = { { r.fLeft, r.fTop }, { r.fRight, r.fBottom } }; local
31 SkShader* s = SkGradientShader::CreateLinear(pts, colors, NULL, 2,
composeshader.cpp 24 SkPoint pts[2]; local
27 pts[0].set(0, 0);
28 pts[1].set(SkIntToScalar(100), 0);
31 SkShader* shaderA = SkGradientShader::CreateLinear(pts, colors, NULL, 2,
34 pts[0].set(0, 0);
35 pts[1].set(0, SkIntToScalar(100));
38 SkShader* shaderB = SkGradientShader::CreateLinear(pts, colors, NULL, 2,
shallowgradient.cpp 14 SkPoint pts[] = { { 0, 0 }, { size.width(), size.height() } }; local
15 return SkGradientShader::CreateLinear(pts, colors, NULL, count,
gradientDirtyLaundry.cpp 38 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data,
40 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos,
44 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data,
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,
56 center.set(SkScalarAve(pts[0].fX, pts[1].fX)
82 SkPoint pts[2] = { { 0, 0 }, variable
    [all...]
points.cpp 26 static void fill_pts(SkPoint pts[], size_t n, SkRandom* rand) {
33 pts[i].set(x, y);
53 SkPoint* pts = new SkPoint[n]; local
54 fill_pts(pts, n, &rand);
56 canvas->drawPoints(SkCanvas::kPolygon_PointMode, n, pts, p0);
57 canvas->drawPoints(SkCanvas::kLines_PointMode, n, pts, p1);
58 canvas->drawPoints(SkCanvas::kPoints_PointMode, n, pts, p2);
59 canvas->drawPoints(SkCanvas::kPoints_PointMode, n, pts, p3);
61 delete[] pts;
  /external/skia/src/pathops/
SkPathOpsCubic.h 16 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]) {
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,
73 cubic.set(pts);
    [all...]
SkPathOpsQuad.h 14 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; }
15 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; }
16 SkDPoint pts[5]; member in struct:SkDQuadPair
27 void set(const SkPoint pts[3]) {
28 fPts[0] = pts[0];
29 fPts[1] = pts[1];
30 fPts[2] = pts[2];
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
59 quad.set(pts);
SkAddIntersections.cpp 12 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt,
14 SkASSERT(i.used() == pts);
15 if (!pts) {
17 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
21 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
22 if (pts == 2) {
25 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
26 if (pts == 2) {
32 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt
199 int pts = 0; local
398 int pts = ts.cubic(wt.pts()); local
    [all...]
  /external/skia/src/views/
SkParsePaint.cpp 24 SkPoint pts[2]; local
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
39 return SkGradientShader::CreateLinear(pts, colors, NULL, 2, mode);
  /external/skia/tools/
path_utils.cpp 42 SkPoint pts[kMaxPts]; local
45 path.getPoints(pts, kMaxPts);
63 pathStream->writeText("SkPoint pts");
71 temp.appendScalar(pts[i].fX);
73 temp.appendScalar(pts[i].fY);
  /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/constraints/
ConstraintShrinkWrap.java 50 List<Vector3f> pts = new ArrayList<Vector3f>(); local
57 pts.add(new Vector3f(floatBuffer.get(i), floatBuffer.get(i + 1), floatBuffer.get(i + 2)));
76 for(Vector3f p : pts) {
  /external/chromium_org/third_party/skia/include/core/
SkGeometry.h 21 /** Given a line segment from pts[0] to pts[1], and an xray, return true if
27 bool SkXRayCrossesLine(const SkXRay& pt, const SkPoint pts[2],
98 /** Convert from parametric from (pts) to polynomial coefficients
101 void SkGetCubicCoeff(const SkPoint pts[4], SkScalar cx[4], SkScalar cy[4]);
220 void set(const SkPoint pts[3], SkScalar w) {
221 memcpy(fPts, pts, 3 * sizeof(SkPoint));
246 * Chop this conic into N quads, stored continguously in pts[], where
249 int chopIntoQuadsPOW2(SkPoint pts[], int pow2) const;
276 * quad[0] == pts[0..2
284 SkPoint* pts = fStorage.reset(1 + 2 * fQuadCount); local
    [all...]
  /external/chromium_org/third_party/skia/src/effects/
SkCornerPathEffect.cpp 41 SkPoint pts[4]; local
54 switch (verb = iter.next(pts, false)) {
62 moveTo = pts[0];
65 dst->moveTo(pts[0]);
70 bool drawSegment = ComputeStep(pts[0], pts[1], fRadius, &step);
76 dst->quadTo(pts[0].fX, pts[0].fY, pts[0].fX + step.fX,
77 pts[0].fY + step.fY)
    [all...]
  /external/skia/include/core/
SkGeometry.h 21 /** Given a line segment from pts[0] to pts[1], and an xray, return true if
27 bool SkXRayCrossesLine(const SkXRay& pt, const SkPoint pts[2],
98 /** Convert from parametric from (pts) to polynomial coefficients
101 void SkGetCubicCoeff(const SkPoint pts[4], SkScalar cx[4], SkScalar cy[4]);
220 void set(const SkPoint pts[3], SkScalar w) {
221 memcpy(fPts, pts, 3 * sizeof(SkPoint));
246 * Chop this conic into N quads, stored continguously in pts[], where
249 int chopIntoQuadsPOW2(SkPoint pts[], int pow2) const;
276 * quad[0] == pts[0..2
284 SkPoint* pts = fStorage.reset(1 + 2 * fQuadCount); local
    [all...]
  /external/skia/src/effects/
SkCornerPathEffect.cpp 41 SkPoint pts[4]; local
54 switch (verb = iter.next(pts, false)) {
62 moveTo = pts[0];
65 dst->moveTo(pts[0]);
70 bool drawSegment = ComputeStep(pts[0], pts[1], fRadius, &step);
76 dst->quadTo(pts[0].fX, pts[0].fY, pts[0].fX + step.fX,
77 pts[0].fY + step.fY)
    [all...]

Completed in 671 milliseconds

1 2 3 4 5 6 7