| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | SimplifyAddIntersectingTs_Test.cpp | 58 static SkPath::Verb setPath(size_t outer, SkPath& path, const SkPoint*& pts1) { in setPath() argument
64 pts1 = lines[outer]; in setPath()
72 pts1 = quads[outer]; in setPath()
80 pts1 = cubics[outer]; in setPath()
86 static void testPath(const SkPath& path, const SkPoint* pts1, SkPath::Verb c1Type, in testPath() argument
101 pts1[0].fX, pts1[0].fY, in testPath()
102 pts1[c1Type].fX, pts1[c1Type].fY, in testPath()
118 const SkPoint* pts1, * pts2; in SimplifyAddIntersectingTs_Test() local
121 SkPath::Verb c1Type = setPath(firstO, path, pts1); in SimplifyAddIntersectingTs_Test()
124 testPath(path2, pts1, c1Type, pts2, c2Type); in SimplifyAddIntersectingTs_Test()
[all …]
|
| D | QuadraticImplicit.cpp | 461 _Point pts1[4]; in intersect2() local
463 xy_at_t(q1, roots1Copy[index], pts1[index].x, pts1[index].y); in intersect2()
475 if (pts1[0].approximatelyEqualHalf(pts2[0])) { in intersect2()
476 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect2()
477 } else if (pts1[0].moreRoughlyEqual(pts2[0])) { in intersect2()
497 pts1[0].x, pts1[0].y, pts1[0].approximatelyEqualHalf(pts2[0]) in intersect2()
507 if (binarySearch(q1, q2, roots1Copy[0], roots2Copy[0], pts1[0])) { in intersect2()
508 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect2()
521 if (!pts2[ndex2].approximatelyEqualHalf(pts1[index])) { in intersect2()
524 double dx = pts2[ndex2].x - pts1[index].x; in intersect2()
[all …]
|
| /external/skia/experimental/Intersection/ |
| D | SimplifyAddIntersectingTs_Test.cpp | 58 static SkPath::Verb setPath(size_t outer, SkPath& path, const SkPoint*& pts1) { in setPath() argument
64 pts1 = lines[outer]; in setPath()
72 pts1 = quads[outer]; in setPath()
80 pts1 = cubics[outer]; in setPath()
86 static void testPath(const SkPath& path, const SkPoint* pts1, SkPath::Verb c1Type, in testPath() argument
101 pts1[0].fX, pts1[0].fY, in testPath()
102 pts1[c1Type].fX, pts1[c1Type].fY, in testPath()
118 const SkPoint* pts1, * pts2; in SimplifyAddIntersectingTs_Test() local
121 SkPath::Verb c1Type = setPath(firstO, path, pts1); in SimplifyAddIntersectingTs_Test()
124 testPath(path2, pts1, c1Type, pts2, c2Type); in SimplifyAddIntersectingTs_Test()
[all …]
|
| D | QuadraticImplicit.cpp | 461 _Point pts1[4]; in intersect2() local
463 xy_at_t(q1, roots1Copy[index], pts1[index].x, pts1[index].y); in intersect2()
475 if (pts1[0].approximatelyEqualHalf(pts2[0])) { in intersect2()
476 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect2()
477 } else if (pts1[0].moreRoughlyEqual(pts2[0])) { in intersect2()
497 pts1[0].x, pts1[0].y, pts1[0].approximatelyEqualHalf(pts2[0]) in intersect2()
507 if (binarySearch(q1, q2, roots1Copy[0], roots2Copy[0], pts1[0])) { in intersect2()
508 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect2()
521 if (!pts2[ndex2].approximatelyEqualHalf(pts1[index])) { in intersect2()
524 double dx = pts2[ndex2].x - pts1[index].x; in intersect2()
[all …]
|
| /external/eigen/test/ |
| D | geo_homogeneous.cpp | 75 Matrix<Scalar, Size+1, Dynamic> pts1, pts2; in homogeneous() local
81 pts1 = pts.colwise().homogeneous(); in homogeneous()
82 VERIFY_IS_APPROX(aff * pts.colwise().homogeneous(), (aff * pts1).colwise().hnormalized()); in homogeneous()
83 VERIFY_IS_APPROX(caff * pts.colwise().homogeneous(), (caff * pts1).colwise().hnormalized()); in homogeneous()
84 VERIFY_IS_APPROX(proj * pts.colwise().homogeneous(), (proj * pts1)); in homogeneous()
86 VERIFY_IS_APPROX((aff * pts1).colwise().hnormalized(), aff * pts); in homogeneous()
87 VERIFY_IS_APPROX((caff * pts1).colwise().hnormalized(), caff * pts); in homogeneous()
89 pts2 = pts1; in homogeneous()
|
| /external/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 473 SkDPoint pts1[4]; in intersect() local
475 pts1[index] = q1.ptAtT(roots1Copy[index]); in intersect()
487 if (pts1[0].approximatelyEqual(pts2[0])) { in intersect()
488 insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect()
489 } else if (pts1[0].moreRoughlyEqual(pts2[0])) { in intersect()
491 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) { in intersect()
492 insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect()
505 if (!pts2[ndex2].approximatelyEqual(pts1[index])) { in intersect()
508 double dx = pts2[ndex2].fX - pts1[index].fX; in intersect()
509 double dy = pts2[ndex2].fY - pts1[index].fY; in intersect()
[all …]
|
| /external/skia/experimental/ |
| D | SkSetPoly3To3_D.cpp | 28 const SkPoint pts1[3], const SkPoint& ave1) { in computeOuterProduct()
35 SkScalar x1 = pts1[i].fX - ave1.fX; in computeOuterProduct()
36 SkScalar y1 = pts1[i].fY - ave1.fY; in computeOuterProduct()
|
| D | SkSetPoly3To3.cpp | 15 const SkPoint pts1[3], const SkPoint& ave1) { in computeOuterProduct()
20 SkScalar x1 = pts1[i].fX - ave1.fX; in computeOuterProduct()
21 SkScalar y1 = pts1[i].fY - ave1.fY; in computeOuterProduct()
|
| D | SkSetPoly3To3_A.cpp | 28 const SkPoint pts1[3], const SkPoint& ave1) { in computeOuterProduct()
33 SkScalar x1 = pts1[i].fX - ave1.fX; in computeOuterProduct()
34 SkScalar y1 = pts1[i].fY - ave1.fY; in computeOuterProduct()
|
| /external/chromium_org/third_party/skia/experimental/ |
| D | SkSetPoly3To3_D.cpp | 28 const SkPoint pts1[3], const SkPoint& ave1) { in computeOuterProduct()
35 SkScalar x1 = pts1[i].fX - ave1.fX; in computeOuterProduct()
36 SkScalar y1 = pts1[i].fY - ave1.fY; in computeOuterProduct()
|
| D | SkSetPoly3To3.cpp | 15 const SkPoint pts1[3], const SkPoint& ave1) { in computeOuterProduct()
20 SkScalar x1 = pts1[i].fX - ave1.fX; in computeOuterProduct()
21 SkScalar y1 = pts1[i].fY - ave1.fY; in computeOuterProduct()
|
| D | SkSetPoly3To3_A.cpp | 28 const SkPoint pts1[3], const SkPoint& ave1) { in computeOuterProduct()
33 SkScalar x1 = pts1[i].fX - ave1.fX; in computeOuterProduct()
34 SkScalar y1 = pts1[i].fY - ave1.fY; in computeOuterProduct()
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 473 SkDPoint pts1[4]; in intersect() local
475 pts1[index] = q1.ptAtT(roots1Copy[index]); in intersect()
487 if (pts1[0].approximatelyEqual(pts2[0])) { in intersect()
488 insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect()
491 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) { in intersect()
492 insert(roots1Copy[0], roots2Copy[0], pts1[0]); in intersect()
505 if (!pts2[ndex2].approximatelyEqual(pts1[index])) { in intersect()
508 double dx = pts2[ndex2].fX - pts1[index].fX; in intersect()
509 double dy = pts2[ndex2].fY - pts1[index].fY; in intersect()
551 pts1[lowestIndex]); in intersect()
|
| /external/chromium_org/third_party/skia/gm/ |
| D | techtalk1.cpp | 93 SkPoint pts0[256*2], pts1[256]; in show_mesh_between() local
95 int count1 = d1.getPoints(pts1, SK_ARRAY_COUNT(pts1)); in show_mesh_between()
97 memcpy(&pts0[count], pts1, count * sizeof(SkPoint)); in show_mesh_between()
|
| /external/skia/gm/ |
| D | techtalk1.cpp | 93 SkPoint pts0[256*2], pts1[256]; in show_mesh_between() local
95 int count1 = d1.getPoints(pts1, SK_ARRAY_COUNT(pts1)); in show_mesh_between()
97 memcpy(&pts0[count], pts1, count * sizeof(SkPoint)); in show_mesh_between()
|
| /external/kernel-headers/original/uapi/linux/ |
| D | cm4000_cs.h | 36 unsigned char pts1; member
|
| /external/opencv/cv/src/ |
| D | cvcalibinit.cpp | 166 icvCalcAffineTranf2D32f(CvPoint2D32f* pts1, CvPoint2D32f* pts2, int count, CvMat* affine_trans)
172 if( pts1[j].x >= 0 ) real_count++;
180 if( pts1[j].x >= 0 )
187 CV_MAT_ELEM( *uv, float, i*2, 0 ) = pts1[j].x;
188 CV_MAT_ELEM( *uv, float, i*2+1, 0 ) = pts1[j].y;
|
| /external/skia/tests/ |
| D | PathTest.cpp | 2030 SkPoint pts1[kPtCount]; in test_transform() local
2031 int count = p1.getPoints(pts1, kPtCount); in test_transform()
2035 REPORTER_ASSERT(reporter, newPt == pts1[i]); in test_transform()
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathTest.cpp | 2095 SkPoint pts1[kPtCount]; in test_transform() local
2096 int count = p1.getPoints(pts1, kPtCount); in test_transform()
2100 REPORTER_ASSERT(reporter, newPt == pts1[i]); in test_transform()
|