Searched refs:quad2 (Results 1 - 25 of 34) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DQuadraticBezierClip_Test.cpp30 const Quadratic& quad2 = testSet[3]; local
33 bezier_clip(quad1, quad2, minT, maxT);
39 const Quadratic& quad2 = testSet[1]; local
42 bezier_clip(quad1, quad2, minT, maxT);
48 const Quadratic& quad2 = quadraticTests[index][1]; local
51 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill);
56 SkDebugf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2);
H A DQuadraticIntersection_Test.cpp21 const Quadratic& quad2 = quadraticTests[index][1]; local
24 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill);
29 printf("[%d] quad2 order=%d\n", (int) index, order2);
41 xy_at_t(quad2, tt2, tx2, ty2);
204 const Quadratic& quad2 = testSet[inner]; local
206 intersect2(quad1, quad2, intersections2);
218 xy_at_t(quad2, tt2, tx2, ty2);
261 const Quadratic& quad2 = coincidentTestSet[testIndex + 1]; local
263 intersect2(quad1, quad2, intersections2);
342 const Quadratic& quad2 local
[all...]
H A DQuadraticIntersection.cpp23 , quad2(q2)
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) {
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) {
39 quad2Divisions = 1 / subDivisions(quad2);
65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger);
73 xy_at_t(quad2, largeT, q2pt.x, q2pt.y);
85 xy_at_t(quad2, minT2, q2pt.x, q2pt.y);
89 xy_at_t(quad2, maxT2, q2pt.x, q2pt.y); // FIXME: debug code
154 xy_at_t(quad2, minT2, line2[0].x, line2[0].y);
155 xy_at_t(quad2, maxT
249 const Quadratic& quad2; member in class:QuadraticIntersections
[all...]
H A DQuadraticParameterization.cpp115 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2) { argument
117 QuadImplicitForm i2(quad2);
H A DCurveIntersection.h23 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2);
H A DQuadraticImplicit.cpp336 static bool binarySearch(const Quadratic& quad1, const Quadratic& quad2, double& t1Seed,
343 if (calcMask & (1 << 4)) t2[1] = xy_at_t(quad2, t2Seed);
354 if (calcMask & (1 << 3)) t2[0] = xy_at_t(quad2, t2Seed - tStep);
355 if (calcMask & (1 << 5)) t2[2] = xy_at_t(quad2, t2Seed + tStep);
/external/skia/experimental/Intersection/
H A DQuadraticBezierClip_Test.cpp30 const Quadratic& quad2 = testSet[3]; local
33 bezier_clip(quad1, quad2, minT, maxT);
39 const Quadratic& quad2 = testSet[1]; local
42 bezier_clip(quad1, quad2, minT, maxT);
48 const Quadratic& quad2 = quadraticTests[index][1]; local
51 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill);
56 SkDebugf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2);
H A DQuadraticIntersection_Test.cpp21 const Quadratic& quad2 = quadraticTests[index][1]; local
24 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill);
29 printf("[%d] quad2 order=%d\n", (int) index, order2);
41 xy_at_t(quad2, tt2, tx2, ty2);
204 const Quadratic& quad2 = testSet[inner]; local
206 intersect2(quad1, quad2, intersections2);
218 xy_at_t(quad2, tt2, tx2, ty2);
261 const Quadratic& quad2 = coincidentTestSet[testIndex + 1]; local
263 intersect2(quad1, quad2, intersections2);
342 const Quadratic& quad2 local
[all...]
H A DQuadraticIntersection.cpp23 , quad2(q2)
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) {
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) {
39 quad2Divisions = 1 / subDivisions(quad2);
65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger);
73 xy_at_t(quad2, largeT, q2pt.x, q2pt.y);
85 xy_at_t(quad2, minT2, q2pt.x, q2pt.y);
89 xy_at_t(quad2, maxT2, q2pt.x, q2pt.y); // FIXME: debug code
154 xy_at_t(quad2, minT2, line2[0].x, line2[0].y);
155 xy_at_t(quad2, maxT
249 const Quadratic& quad2; member in class:QuadraticIntersections
[all...]
H A DQuadraticParameterization.cpp115 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2) { argument
117 QuadImplicitForm i2(quad2);
H A DCurveIntersection.h23 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2);
/external/chromium_org/third_party/skia/tests/
H A DPathOpsAngleIdeas.cpp127 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2) { argument
130 setQuadHullSweep(quad2, tweep);
147 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2));
152 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0];
162 const SkDQuad& quad2) {
165 setQuadHullSweep(quad2, tweep);
196 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0];
205 return checkParallel(reporter, quad1, quad2);
226 orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, double r, TRange* result) argument
283 bruteMinT(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, TRange* lowerRange, TRange* upperRange) argument
389 bruteForce(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, bool ccw) argument
401 bruteForceCheck(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, bool ccw) argument
423 testQuadAngles(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, int testNo) argument
[all...]
H A DPathOpsQuadIntersectionTest.cpp19 const SkDQuad& quad2 = quadraticTests[index][1]; local
20 SkASSERT(ValidQuad(quad2));
23 int order2 = reduce2.reduce(quad2);
31 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
36 intersections.intersect(quad1, quad2);
42 SkDPoint xy2 = quad2.ptAtT(tt2);
270 const SkDQuad& quad2 = testSet[inner]; local
271 SkASSERT(ValidQuad(quad2));
273 intersections2.intersect(quad1, quad2);
278 SkDPoint xy2 = quad2
320 const SkDQuad& quad2 = coincidentTestSet[test2]; local
412 const SkDQuad& quad2 = testSet[test2]; local
[all...]
/external/skia/tests/
H A DPathOpsAngleIdeas.cpp127 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2) { argument
130 setQuadHullSweep(quad2, tweep);
147 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2));
152 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0];
162 const SkDQuad& quad2) {
165 setQuadHullSweep(quad2, tweep);
196 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0];
205 return checkParallel(reporter, quad1, quad2);
226 orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, double r, TRange* result) argument
283 bruteMinT(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, TRange* lowerRange, TRange* upperRange) argument
389 bruteForce(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, bool ccw) argument
401 bruteForceCheck(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, bool ccw) argument
423 testQuadAngles(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, int testNo) argument
[all...]
H A DPathOpsQuadIntersectionTest.cpp19 const SkDQuad& quad2 = quadraticTests[index][1]; local
20 SkASSERT(ValidQuad(quad2));
23 int order2 = reduce2.reduce(quad2);
31 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
36 intersections.intersect(quad1, quad2);
42 SkDPoint xy2 = quad2.ptAtT(tt2);
267 const SkDQuad& quad2 = testSet[inner]; local
268 SkASSERT(ValidQuad(quad2));
270 intersections2.intersect(quad1, quad2);
275 SkDPoint xy2 = quad2
317 const SkDQuad& quad2 = coincidentTestSet[test2]; local
409 const SkDQuad& quad2 = testSet[test2]; local
[all...]
H A DPathOpsDebug.cpp712 static void dumpTestCase(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { argument
715 quad2.dump();
732 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { argument
734 dumpTestCase(quad1, quad2, testNo);
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadImplicit.h17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
H A DSkDQuadImplicit.cpp113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) { argument
115 SkDQuadImplicit i2(quad2);
H A DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, argument
301 if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed);
312 if (calcMask & (1 << 3)) t2[0] = quad2.ptAtT(SkTMax(0., *t2Seed - tStep));
313 if (calcMask & (1 << 5)) t2[2] = quad2.ptAtT(SkTMin(1., *t2Seed + tStep));
H A DSkPathOpsDebug.h232 void DumpQ(const struct SkDQuad& quad1, const struct SkDQuad& quad2, int testNo);
/external/skia/src/pathops/
H A DSkDQuadImplicit.h17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
H A DSkDQuadImplicit.cpp113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) { argument
115 SkDQuadImplicit i2(quad2);
H A DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, argument
301 if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed);
312 if (calcMask & (1 << 3)) t2[0] = quad2.ptAtT(SkTMax(0., *t2Seed - tStep));
313 if (calcMask & (1 << 5)) t2[2] = quad2.ptAtT(SkTMin(1., *t2Seed + tStep));
/external/opencv/cvaux/src/
H A Dcvepilines.cpp196 double quad2[4][2],
228 point3.x = (1.0 - alpha) * quad2[0][0] + alpha * quad2[3][0];
229 point3.y = (1.0 - alpha) * quad2[0][1] + alpha * quad2[3][1];
231 point4.x = (1.0 - alpha) * quad2[1][0] + alpha * quad2[2][0];
232 point4.y = (1.0 - alpha) * quad2[1][1] + alpha * quad2[2][1];
252 double quad2[
195 icvComputeCoeffForStereoV3( double quad1[4][2], double quad2[4][2], int numScanlines, CvMatr64d camMatr1, CvMatr64d rotMatr1, CvMatr64d transVect1, CvMatr64d camMatr2, CvMatr64d rotMatr2, CvMatr64d transVect2, CvStereoLineCoeff* startCoeffs, int* needSwapCamera) argument
251 icvComputeCoeffForStereoNew( double quad1[4][2], double quad2[4][2], int numScanlines, CvMatr32f camMatr1, CvMatr32f rotMatr1, CvMatr32f transVect1, CvMatr32f camMatr2, CvStereoLineCoeff* startCoeffs, int* needSwapCamera) argument
312 double quad2[4][2]; local
1294 icvGetQuadsTransform( CvSize imageSize, CvMatr64d camMatr1, CvMatr64d rotMatr1, CvVect64d transVect1, CvMatr64d camMatr2, CvMatr64d rotMatr2, CvVect64d transVect2, CvSize* warpSize, double quad1[4][2], double quad2[4][2], CvMatr64d fundMatr, CvPoint3D64d* epipole1, CvPoint3D64d* epipole2 ) argument
1672 icvGetQuadsTransformNew( CvSize imageSize, CvMatr32f camMatr1, CvMatr32f camMatr2, CvMatr32f rotMatr1, CvVect32f transVect1, CvSize* warpSize, double quad1[4][2], double quad2[4][2], CvMatr32f fundMatr, CvPoint3D32f* epipole1, CvPoint3D32f* epipole2 ) argument
1755 double quad2[4][2]; local
1764 quad2, local
[all...]
/external/chromium_org/cc/trees/
H A Dlayer_tree_host_unittest_delegated.cc773 const TextureDrawQuad* quad2 = TextureDrawQuad::MaterialCast( variable
775 EXPECT_EQ(parent_resource_id2, quad2->resource_id);
1141 const TextureDrawQuad* quad2 = variable
1143 EXPECT_EQ(map.find(555)->second, quad2->resource_id);
1264 const TextureDrawQuad* quad2 = variable
1266 EXPECT_EQ(map.find(555)->second, quad2->resource_id);
1286 const TextureDrawQuad* quad2 = variable
1288 EXPECT_EQ(map.find(555)->second, quad2->resource_id);

Completed in 7988 milliseconds

12