Searched refs:quad1 (Results 1 - 25 of 33) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DQuadraticBezierClip_Test.cpp29 const Quadratic& quad1 = testSet[2]; local
33 bezier_clip(quad1, quad2, minT, maxT);
38 const Quadratic& quad1 = testSet[0]; local
42 bezier_clip(quad1, quad2, minT, maxT);
47 const Quadratic& quad1 = quadraticTests[index][0]; local
50 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill);
53 SkDebugf("%s [%d] quad1 order=%d\n", __FUNCTION__, (int)index, order1);
H A DQuadraticIntersection_Test.cpp20 const Quadratic& quad1 = quadraticTests[index][0]; local
23 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill);
26 printf("[%d] quad1 order=%d\n", (int) index, order1);
38 xy_at_t(quad1, tt1, tx1, ty1);
203 const Quadratic& quad1 = testSet[outer]; local
206 intersect2(quad1, quad2, intersections2);
214 xy_at_t(quad1, tt1, tx1, ty1);
260 const Quadratic& quad1 = coincidentTestSet[testIndex]; local
263 intersect2(quad1, quad2, intersections2);
341 const Quadratic& quad1 local
[all...]
H A DQuadraticIntersection.cpp22 : quad1(q1)
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) {
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) {
38 quad1Divisions = 1 / subDivisions(quad1);
64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller);
74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y);
78 xy_at_t(quad1, maxT1, q1pt.x, q1pt.y); // FIXME: debug code
84 xy_at_t(quad1, smallT, q1pt.x, q1pt.y);
150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y);
151 xy_at_t(quad1, maxT
248 const Quadratic& quad1; member in class:QuadraticIntersections
[all...]
H A DQuadraticParameterization.cpp115 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2) { argument
116 QuadImplicitForm i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f
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,
342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed);
352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep);
353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad1, t1Seed + tStep);
/external/skia/experimental/Intersection/
H A DQuadraticBezierClip_Test.cpp29 const Quadratic& quad1 = testSet[2]; local
33 bezier_clip(quad1, quad2, minT, maxT);
38 const Quadratic& quad1 = testSet[0]; local
42 bezier_clip(quad1, quad2, minT, maxT);
47 const Quadratic& quad1 = quadraticTests[index][0]; local
50 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill);
53 SkDebugf("%s [%d] quad1 order=%d\n", __FUNCTION__, (int)index, order1);
H A DQuadraticIntersection_Test.cpp20 const Quadratic& quad1 = quadraticTests[index][0]; local
23 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill);
26 printf("[%d] quad1 order=%d\n", (int) index, order1);
38 xy_at_t(quad1, tt1, tx1, ty1);
203 const Quadratic& quad1 = testSet[outer]; local
206 intersect2(quad1, quad2, intersections2);
214 xy_at_t(quad1, tt1, tx1, ty1);
260 const Quadratic& quad1 = coincidentTestSet[testIndex]; local
263 intersect2(quad1, quad2, intersections2);
341 const Quadratic& quad1 local
[all...]
H A DQuadraticIntersection.cpp22 : quad1(q1)
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) {
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) {
38 quad1Divisions = 1 / subDivisions(quad1);
64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller);
74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y);
78 xy_at_t(quad1, maxT1, q1pt.x, q1pt.y); // FIXME: debug code
84 xy_at_t(quad1, smallT, q1pt.x, q1pt.y);
150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y);
151 xy_at_t(quad1, maxT
248 const Quadratic& quad1; member in class:QuadraticIntersections
[all...]
H A DQuadraticParameterization.cpp115 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2) { argument
116 QuadImplicitForm i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f
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
129 setQuadHullSweep(quad1, sweep);
147 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2));
151 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0];
161 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1,
164 setQuadHullSweep(quad1, sweep);
195 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0];
205 return checkParallel(reporter, quad1, quad
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.cpp17 const SkDQuad& quad1 = quadraticTests[index][0]; local
18 SkASSERT(ValidQuad(quad1));
22 int order1 = reduce1.reduce(quad1);
26 SkDebugf("[%d] quad1 order=%d\n", static_cast<int>(index), order1);
36 intersections.intersect(quad1, quad2);
40 SkDPoint xy1 = quad1.ptAtT(tt1);
268 const SkDQuad& quad1 = testSet[outer]; local
269 SkASSERT(ValidQuad(quad1));
273 intersections2.intersect(quad1, quad2);
276 SkDPoint xy1 = quad1
318 const SkDQuad& quad1 = coincidentTestSet[test1]; local
411 const SkDQuad& quad1 = testSet[test1]; local
[all...]
/external/skia/tests/
H A DPathOpsAngleIdeas.cpp127 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2) { argument
129 setQuadHullSweep(quad1, sweep);
147 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2));
151 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0];
161 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1,
164 setQuadHullSweep(quad1, sweep);
195 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0];
205 return checkParallel(reporter, quad1, quad
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.cpp17 const SkDQuad& quad1 = quadraticTests[index][0]; local
18 SkASSERT(ValidQuad(quad1));
22 int order1 = reduce1.reduce(quad1);
26 SkDebugf("[%d] quad1 order=%d\n", static_cast<int>(index), order1);
36 intersections.intersect(quad1, quad2);
40 SkDPoint xy1 = quad1.ptAtT(tt1);
265 const SkDQuad& quad1 = testSet[outer]; local
266 SkASSERT(ValidQuad(quad1));
270 intersections2.intersect(quad1, quad2);
273 SkDPoint xy1 = quad1
315 const SkDQuad& quad1 = coincidentTestSet[test1]; local
408 const SkDQuad& quad1 = testSet[test1]; local
[all...]
H A DPathOpsDebug.cpp712 static void dumpTestCase(const SkDQuad& quad1, const SkDQuad& quad2, int testNo) { argument
714 quad1.dumpComma(",");
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
114 SkDQuadImplicit i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f
H A DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, argument
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep));
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep));
/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
114 SkDQuadImplicit i1(quad1); // a'xx , b'xy , c'yy , d'x , e'y , f
H A DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, argument
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep));
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep));
/external/opencv/cvaux/src/
H A Dcvepilines.cpp195 int icvComputeCoeffForStereoV3( double quad1[4][2], argument
222 point1.x = (1.0 - alpha) * quad1[0][0] + alpha * quad1[3][0];
223 point1.y = (1.0 - alpha) * quad1[0][1] + alpha * quad1[3][1];
225 point2.x = (1.0 - alpha) * quad1[1][0] + alpha * quad1[2][0];
226 point2.y = (1.0 - alpha) * quad1[1][1] + alpha * quad1[2][1];
251 int icvComputeCoeffForStereoNew( double quad1[ argument
311 double quad1[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
1754 double quad1[4][2]; local
1763 quad1, local
[all...]
/external/deqp/framework/common/
H A DtcuTexLookupVerifier.cpp225 static bool isInColorBounds (const LookupPrecision& prec, const ColorQuad& quad0, const ColorQuad& quad1, const Vec4& result) argument
227 const tcu::Vec4 minVal = min(min(quad0), min(quad1)) - prec.colorThreshold;
228 const tcu::Vec4 maxVal = max(max(quad0), max(quad1)) + prec.colorThreshold;
320 const ColorQuad& quad1,
331 if (!isInColorBounds(prec, quad0, quad1, result))
341 const Vec4 c1 = quad1.p00*(1.0f-a)*(1.0f-b) + quad1.p10*a*(1.0f-b) + quad1.p01*(1.0f-a)*b + quad1.p11*a*b;
386 const ColorQuad& quad1,
318 isTrilinearRangeValid(const LookupPrecision& prec, const ColorQuad& quad0, const ColorQuad& quad1, const Vec2& xBounds, const Vec2& yBounds, const Vec2& zBounds, const float searchStep, const Vec4& result) argument
384 is2DTrilinearFilterResultValid(const LookupPrecision& prec, const ColorQuad& quad0, const ColorQuad& quad1, const Vec2& xBounds0, const Vec2& yBounds0, const Vec2& xBounds1, const Vec2& yBounds1, const Vec2& zBounds, const float searchStep, const Vec4& result) argument
738 ColorQuad quad0, quad1; local
1044 ColorQuad quad1; local
1520 ColorQuad quad1; variable
[all...]
/external/chromium_org/cc/trees/
H A Dlayer_tree_host_unittest_delegated.cc770 const TextureDrawQuad* quad1 = TextureDrawQuad::MaterialCast( variable
772 EXPECT_EQ(parent_resource_id1, quad1->resource_id);
1138 const TextureDrawQuad* quad1 = variable
1140 EXPECT_EQ(map.find(999)->second, quad1->resource_id);
1261 const TextureDrawQuad* quad1 = variable
1263 EXPECT_EQ(map.find(999)->second, quad1->resource_id);
1283 const TextureDrawQuad* quad1 = variable
1285 EXPECT_EQ(map.find(999)->second, quad1->resource_id);
1301 const TextureDrawQuad* quad1 = variable
1303 EXPECT_EQ(map.find(999)->second, quad1
[all...]

Completed in 7790 milliseconds

12