Home
last modified time | relevance | path

Searched refs:cubic (Results 1 – 25 of 171) sorted by relevance

1234567

/external/skia/tests/
DPathOpsCubicReduceOrderTest.cpp16 static bool controls_inside(const SkDCubic& cubic) {
17 return between(cubic[0].fX, cubic[1].fX, cubic[3].fX)
18 && between(cubic[0].fX, cubic[2].fX, cubic[3].fX)
19 && between(cubic[0].fY, cubic[1].fY, cubic[3].fY)
20 && between(cubic[0].fY, cubic[2].fY, cubic[3].fY);
23 static bool tiny(const SkDCubic& cubic) {
27 if (cubic[minX].fX > cubic[index].fX) {
30 if (cubic[minY].fY > cubic[index].fY) {
33 if (cubic[maxX].fX < cubic[index].fX) {
36 if (cubic[maxY].fY < cubic[index].fY) {
[all …]
DPathOpsCubicLineIntersectionTest.cpp15 SkDCubic cubic; member
28 const SkDCubic& cubic = failLineCubicTests[iIndex].cubic; in testFail() local
29 SkASSERT(ValidCubic(cubic)); in testFail()
34 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); in testFail()
46 int roots = i.intersect(cubic, line); in testFail()
99 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { in doIntersect() argument
109 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); in doIntersect()
117 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); in doIntersect()
119 intersections.intersect(cubic, line); in doIntersect()
126 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; in testOne() local
[all …]
DPathOpsTestCommon.cpp16 static double calc_t_div(const SkDCubic& cubic, double precision, double start) { in calc_t_div() argument
21 cPtr = &cubic; in calc_t_div()
24 sub = cubic.subDivide(start, 1); in calc_t_div()
39 static bool add_simple_ts(const SkDCubic& cubic, double precision, SkTArray<double, true>* ts) { in add_simple_ts() argument
40 double tDiv = calc_t_div(cubic, precision, 0); in add_simple_ts()
51 static void addTs(const SkDCubic& cubic, double precision, double start, double end, in addTs() argument
53 double tDiv = calc_t_div(cubic, precision, 0); in addTs()
63 static void toQuadraticTs(const SkDCubic* cubic, double precision, SkTArray<double, true>* ts) { in toQuadraticTs() argument
65 int order = reducer.reduce(*cubic, SkReduceOrder::kAllow_Quadratics); in toQuadraticTs()
70 int inflections = cubic->findInflections(inflectT); in toQuadraticTs()
[all …]
DPathOpsDRectTest.cpp37 static void setRawBounds(const SkDCubic& cubic, SkDRect* rect) { in setRawBounds() argument
38 rect->set(cubic[0]); in setRawBounds()
39 rect->add(cubic[1]); in setRawBounds()
40 rect->add(cubic[2]); in setRawBounds()
41 rect->add(cubic[3]); in setRawBounds()
60 const SkDCubic& cubic = cubicTests[index]; in DEF_TEST() local
61 SkASSERT(ValidCubic(cubic)); in DEF_TEST()
62 setRawBounds(cubic, &rect); in DEF_TEST()
63 rect2.setBounds(cubic); in DEF_TEST()
DStrokerTest.cpp271 SkPoint cubic[4]; in DEF_TEST() local
272 cubic[0].fX = r.nextRangeF(0, 500); in DEF_TEST()
273 cubic[0].fY = r.nextRangeF(0, 500); in DEF_TEST()
276 cubic[1].fX = r.nextRangeF(0, 500); in DEF_TEST()
277 cubic[1].fY = r.nextRangeF(0, 500); in DEF_TEST()
278 } while (cubic[0].distanceToSqd(cubic[1]) < halfSquared); in DEF_TEST()
280 cubic[2].fX = r.nextRangeF(0, 500); in DEF_TEST()
281 cubic[2].fY = r.nextRangeF(0, 500); in DEF_TEST()
282 } while ( cubic[0].distanceToSqd(cubic[2]) < halfSquared in DEF_TEST()
283 || cubic[1].distanceToSqd(cubic[2]) < halfSquared); in DEF_TEST()
[all …]
DPathOpsCubicLineIntersectionIdeas.cpp54 static double binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t, in binary_search() argument
59 SkDPoint cubicAtT = cubic.ptAtT(t); in binary_search()
68 cubic.dump(); in binary_search()
76 SkDPoint lessPt = cubic.ptAtT(t - lastStep); in binary_search()
85 SkDPoint morePt = cubic.ptAtT(t + lastStep); in binary_search()
148 SkDCubic cubic = {{origin, in DEF_TEST() local
155 SkDPoint pt = cubic.ptAtT(t); in DEF_TEST()
159 SkDCubic::Coefficients(&cubic[0].fY, &A, &B, &C, &D); in DEF_TEST()
171 SkDPoint calcPt = cubic.ptAtT(t); in DEF_TEST()
219 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST()
[all …]
DPathOpsLineParametetersTest.cpp43 const SkDCubic& cubic = tests[index]; in DEF_TEST() local
44 SkASSERT(ValidCubic(cubic)); in DEF_TEST()
45 lineParameters.cubicEndPoints(cubic, 0, 3); in DEF_TEST()
47 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); in DEF_TEST()
48 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2); in DEF_TEST()
67 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); in DEF_TEST()
68 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2); in DEF_TEST()
DPathOpsCubicConicIntersectionTest.cpp15 SkDCubic cubic; member
32 const SkDCubic& cubic = cubicConicTests[index].cubic; in cubicConicIntersection() local
33 SkASSERT(ValidCubic(cubic)); in cubicConicIntersection()
38 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); in cubicConicIntersection()
49 int roots = i.intersect(cubic, conic); in cubicConicIntersection()
52 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicConicIntersection()
DPathOpsCubicQuadIntersectionTest.cpp16 SkDCubic cubic; member
56 const SkDCubic& cubic = quadCubicTests[index].cubic; in cubicQuadIntersection() local
57 SkASSERT(ValidCubic(cubic)); in cubicQuadIntersection()
62 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); in cubicQuadIntersection()
73 int roots = i.intersect(cubic, quad); in cubicQuadIntersection()
76 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicQuadIntersection()
DPathOpsDebug.cpp383 SkDCubic cubic; in DontCallDebugSpan() local
390 SkTSect<SkDCubic, SkDQuad> c1q2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
391 SkTSect<SkDCubic, SkDConic> c1k2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
392 SkTSect<SkDCubic, SkDCubic> c1c2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
413 SkDCubic cubic; in DontCallDebugT() local
420 SkTSect<SkDCubic, SkDQuad> c1q2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugT()
421 SkTSect<SkDCubic, SkDConic> c1k2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugT()
422 SkTSect<SkDCubic, SkDCubic> c1c2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugT()
443 SkDCubic cubic; in DontCallDumpTSect() local
450 SkTSect<SkDCubic, SkDQuad> c1q2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDumpTSect()
[all …]
/external/skia/src/pathops/
DSkReduceOrder.cpp100 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) { in coincident_line() argument
101 reduction[0] = reduction[1] = cubic[0]; in coincident_line()
109 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) { in vertical_line() argument
110 reduction[0] = cubic[0]; in vertical_line()
111 reduction[1] = cubic[3]; in vertical_line()
115 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) { in horizontal_line() argument
116 reduction[0] = cubic[0]; in horizontal_line()
117 reduction[1] = cubic[3]; in horizontal_line()
122 static int check_quadratic(const SkDCubic& cubic, SkDCubic& reduction) { in check_quadratic() argument
123 double dx10 = cubic[1].fX - cubic[0].fX; in check_quadratic()
[all …]
DSkOpCubicHull.cpp9 static bool rotate(const SkDCubic& cubic, int zero, int index, SkDCubic& rotPath) { in rotate() argument
10 double dy = cubic[index].fY - cubic[zero].fY; in rotate()
11 double dx = cubic[index].fX - cubic[zero].fX; in rotate()
16 rotPath = cubic; in rotate()
18 rotPath[index].fY = cubic[zero].fY; in rotate()
22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) { in rotate()
23 rotPath[side1].fY = cubic[zero].fY; in rotate()
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) { in rotate()
26 rotPath[side2].fY = cubic[zero].fY; in rotate()
32 rotPath[index].fX = cubic[index].fX * dx + cubic[index].fY * dy; in rotate()
[all …]
DSkPathOpsCurve.h38 void set(const SkDCubic& cubic) { in set()
40 fPts[index] = cubic[index].asSkPoint(); in set()
105 SkDCubic cubic; in dcubic_xy_at_t() local
106 cubic.set(a); in dcubic_xy_at_t()
107 return cubic.ptAtT(t); in dcubic_xy_at_t()
161 SkDCubic cubic; in dcubic_dxdy_at_t() local
162 cubic.set(a); in dcubic_dxdy_at_t()
163 return cubic.dxdyAtT(t); in dcubic_dxdy_at_t()
220 SkDCubic cubic; in cubic_is_vertical() local
221 cubic.set(a); in cubic_is_vertical()
[all …]
DSkPathOpsCubic.h53 static void Coefficients(const double* cubic, double* A, double* B, double* C, double* D);
70 SkDCubic cubic; in FindInflections() local
71 return cubic.set(a).findInflections(tValues); in FindInflections()
112 SkDCubic cubic; in SubDivide() local
113 return cubic.set(a).subDivide(t1, t2); in SubDivide()
120 SkDCubic cubic; in SubDivide() local
121 cubic.set(pts).subDivide(a, d, t1, t2, p); in SubDivide()
/external/skia/src/utils/win/
DSkDWriteGeometrySink.cpp91 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { in check_quadratic() argument
92 float dx10 = cubic[1].x - cubic[0].x; in check_quadratic()
93 float dx23 = cubic[2].x - cubic[3].x; in check_quadratic()
94 float midX = cubic[0].x + dx10 * 3 / 2; in check_quadratic()
97 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) { in check_quadratic()
100 float dy10 = cubic[1].y - cubic[0].y; in check_quadratic()
101 float dy23 = cubic[2].y - cubic[3].y; in check_quadratic()
102 float midY = cubic[0].y + dy10 * 3 / 2; in check_quadratic()
103 if (!approximately_equal(midY, (dy23 * 3 / 2) + cubic[3].y)) { in check_quadratic()
106 reduction[0] = cubic[0]; in check_quadratic()
[all …]
/external/skia/src/core/
DSkStroke.cpp198 static ReductionType CheckCubicLinear(const SkPoint cubic[4], SkPoint reduction[3],
202 ResultType compareQuadCubic(const SkPoint cubic[4], SkQuadConstruct* );
208 bool cubicMidOnLine(const SkPoint cubic[4], const SkQuadConstruct* ) const;
209 bool cubicPerpRay(const SkPoint cubic[4], SkScalar t, SkPoint* tPt, SkPoint* onPt,
211 bool cubicQuadEnds(const SkPoint cubic[4], SkQuadConstruct* );
212 bool cubicQuadMid(const SkPoint cubic[4], const SkQuadConstruct* , SkPoint* mid) const;
213 bool cubicStroke(const SkPoint cubic[4], SkQuadConstruct* );
223 void setCubicEndNormal(const SkPoint cubic[4],
233 ResultType tangentsMeet(const SkPoint cubic[4], SkQuadConstruct* );
438 void SkPathStroker::setCubicEndNormal(const SkPoint cubic[4], const SkVector& normalAB, in setCubicEndNormal()
[all …]
/external/icu/icu4c/source/data/unit/
Den_001.txt120 cubic-centimeter{
121 dnam{"cubic centimetres"}
122 one{"{0} cubic centimetre"}
123 other{"{0} cubic centimetres"}
124 per{"{0} per cubic centimetre"}
126 cubic-kilometer{
127 dnam{"cubic kilometres"}
128 one{"{0} cubic kilometre"}
129 other{"{0} cubic kilometres"}
131 cubic-meter{
[all …]
Den.txt604 cubic-centimeter{
605 dnam{"cubic centimeters"}
606 one{"{0} cubic centimeter"}
607 other{"{0} cubic centimeters"}
608 per{"{0} per cubic centimeter"}
610 cubic-foot{
611 dnam{"cubic feet"}
612 one{"{0} cubic foot"}
613 other{"{0} cubic feet"}
615 cubic-inch{
[all …]
Dzh_Hant.txt513 cubic-centimeter{
518 cubic-foot{
522 cubic-inch{
526 cubic-kilometer{
530 cubic-meter{
535 cubic-mile{
539 cubic-yard{
978 cubic-centimeter{
981 cubic-foot{
984 cubic-inch{
[all …]
Dth.txt496 cubic-centimeter{
501 cubic-foot{
505 cubic-inch{
509 cubic-kilometer{
513 cubic-meter{
518 cubic-mile{
522 cubic-yard{
769 cubic-kilometer{
772 cubic-mile{
1261 cubic-centimeter{
[all …]
Dzh.txt492 cubic-centimeter{
497 cubic-foot{
501 cubic-inch{
505 cubic-kilometer{
509 cubic-meter{
514 cubic-mile{
518 cubic-yard{
764 cubic-kilometer{
767 cubic-mile{
1256 cubic-centimeter{
[all …]
Dzh_Hant_HK.txt240 cubic-centimeter{
245 cubic-foot{
249 cubic-inch{
253 cubic-meter{
343 cubic-mile{
561 cubic-centimeter{
566 cubic-foot{
570 cubic-inch{
574 cubic-meter{
Dmzn.txt357 cubic-centimeter{
362 cubic-foot{
366 cubic-inch{
370 cubic-kilometer{
374 cubic-meter{
379 cubic-mile{
383 cubic-yard{
867 cubic-centimeter{
872 cubic-foot{
876 cubic-inch{
[all …]
/external/chromium-trace/catapult/third_party/polymer/components/paper-spinner/
Dpaper-spinner.css93 …t-animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, blue-fade-in-…
94 …animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, blue-fade-in-ou…
99 …t-animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, red-fade-in-o…
100 …animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, red-fade-in-out…
105 …-animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, yellow-fade-in…
106 …animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, yellow-fade-in-…
111 …-animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, green-fade-in-…
112 …animation: fill-unfill-rotate 5332ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both, green-fade-in-o…
275 -webkit-animation: left-spin 1333ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both;
276 animation: left-spin 1333ms cubic-bezier(0.4, 0.0, 0.2, 1) infinite both;
[all …]
/external/chromium-trace/catapult/third_party/polymer/components/paper-dialog/
Dpaper-dialog-transition.css11 …transition: transform 0.2s cubic-bezier(0.4, 0, 0.2, 1), opacity 0.2s cubic-bezier(0.4, 0, 0.2, 1);
12 …-webkit-transition: -webkit-transform 0.2s cubic-bezier(0.4, 0, 0.2, 1), opacity 0.2s cubic-bezier…
27 animation: paper-dialog-transition-center-keyframes 0.2s cubic-bezier(0.4, 0, 0.2, 1);
28 -webkit-animation: paper-dialog-transition-center-keyframes 0.2s cubic-bezier(0.4, 0, 0.2, 1);

1234567