Searched refs:pts2 (Results 1 - 9 of 9) sorted by relevance

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DSimplifyAddIntersectingTs_Test.cpp87 const SkPoint* pts2, SkPath::Verb c2Type) {
105 pts2[0].fX, pts2[0].fY,
106 pts2[c2Type].fX, pts2[c2Type].fY);
118 const SkPoint* pts1, * pts2; local
123 SkPath::Verb c2Type = setPath(firstI, path2, pts2);
124 testPath(path2, pts1, c1Type, pts2, c2Type);
131 SkPath::Verb c2Type = setPath(i, path2, pts2);
132 testPath(path2, pts1, c1Type, pts2, c2Typ
86 testPath(const SkPath& path, const SkPoint* pts1, SkPath::Verb c1Type, const SkPoint* pts2, SkPath::Verb c2Type) argument
[all...]
H A DQuadraticImplicit.cpp469 _Point pts2[4];
471 xy_at_t(q2, roots2Copy[index], pts2[index].x, pts2[index].y);
475 if (pts1[0].approximatelyEqualHalf(pts2[0])) {
477 } else if (pts1[0].moreRoughlyEqual(pts2[0])) {
497 pts1[0].x, pts1[0].y, pts1[0].approximatelyEqualHalf(pts2[0])
498 ? "==" : "!=", pts2[0].x, pts2[0].y);
521 if (!pts2[ndex2].approximatelyEqualHalf(pts1[index])) {
524 double dx = pts2[ndex
[all...]
/external/skia/experimental/Intersection/
H A DSimplifyAddIntersectingTs_Test.cpp87 const SkPoint* pts2, SkPath::Verb c2Type) {
105 pts2[0].fX, pts2[0].fY,
106 pts2[c2Type].fX, pts2[c2Type].fY);
118 const SkPoint* pts1, * pts2; local
123 SkPath::Verb c2Type = setPath(firstI, path2, pts2);
124 testPath(path2, pts1, c1Type, pts2, c2Type);
131 SkPath::Verb c2Type = setPath(i, path2, pts2);
132 testPath(path2, pts1, c1Type, pts2, c2Typ
86 testPath(const SkPath& path, const SkPoint* pts1, SkPath::Verb c1Type, const SkPoint* pts2, SkPath::Verb c2Type) argument
[all...]
H A DQuadraticImplicit.cpp469 _Point pts2[4];
471 xy_at_t(q2, roots2Copy[index], pts2[index].x, pts2[index].y);
475 if (pts1[0].approximatelyEqualHalf(pts2[0])) {
477 } else if (pts1[0].moreRoughlyEqual(pts2[0])) {
497 pts1[0].x, pts1[0].y, pts1[0].approximatelyEqualHalf(pts2[0])
498 ? "==" : "!=", pts2[0].x, pts2[0].y);
521 if (!pts2[ndex2].approximatelyEqualHalf(pts1[index])) {
524 double dx = pts2[ndex
[all...]
/external/eigen/test/
H A Dgeo_homogeneous.cpp75 Matrix<Scalar, Size+1, Dynamic> pts1, pts2; local
89 pts2 = pts1;
90 pts2.row(Size).setRandom();
91 VERIFY_IS_APPROX((aff * pts2).colwise().hnormalized(), aff * pts2.colwise().hnormalized());
92 VERIFY_IS_APPROX((caff * pts2).colwise().hnormalized(), caff * pts2.colwise().hnormalized());
93 VERIFY_IS_APPROX((proj * pts2).colwise().hnormalized(), (proj * pts2.colwise().hnormalized().colwise().homogeneous()).colwise().hnormalized());
/external/kernel-headers/original/uapi/linux/
H A Dcm4000_cs.h37 unsigned char pts2; member in struct:ptsreq
/external/skia/src/pathops/
H A DSkDQuadIntersection.cpp481 SkDPoint pts2[4]; local
483 pts2[index] = q2.ptAtT(roots2Copy[index]);
487 if (pts1[0].approximatelyEqual(pts2[0])) {
489 } else if (pts1[0].moreRoughlyEqual(pts2[0])) {
505 if (!pts2[ndex2].approximatelyEqual(pts1[index])) {
508 double dx = pts2[ndex2].fX - pts1[index].fX;
509 double dy = pts2[ndex2].fY - pts1[index].fY;
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadIntersection.cpp481 SkDPoint pts2[4]; local
483 pts2[index] = q2.ptAtT(roots2Copy[index]);
487 if (pts1[0].approximatelyEqual(pts2[0])) {
505 if (!pts2[ndex2].approximatelyEqual(pts1[index])) {
508 double dx = pts2[ndex2].fX - pts1[index].fX;
509 double dy = pts2[ndex2].fY - pts1[index].fY;
/external/opencv/cv/src/
H A Dcvcalibinit.cpp166 icvCalcAffineTranf2D32f(CvPoint2D32f* pts1, CvPoint2D32f* pts2, int count, CvMat* affine_trans)
182 CV_MAT_ELEM( *xy, float, i*2+1, 2 ) = CV_MAT_ELEM( *xy, float, i*2, 0 ) = pts2[j].x;
183 CV_MAT_ELEM( *xy, float, i*2+1, 3 ) = CV_MAT_ELEM( *xy, float, i*2, 1 ) = pts2[j].y;

Completed in 162 milliseconds