/external/skia/src/utils/win/ |
SkDWriteGeometrySink.cpp | 89 } Cubic[4], Quadratic[3]; 91 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { 123 Quadratic quadratic; local 124 if (check_quadratic(cubic, quadratic)) { 125 fPath->quadTo(quadratic[1].x, quadratic[1].y, 126 quadratic[2].x, quadratic[2].y);
|
/external/skqp/src/utils/win/ |
SkDWriteGeometrySink.cpp | 89 } Cubic[4], Quadratic[3]; 91 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { 123 Quadratic quadratic; local 124 if (check_quadratic(cubic, quadratic)) { 125 fPath->quadTo(quadratic[1].x, quadratic[1].y, 126 quadratic[2].x, quadratic[2].y);
|
/external/tensorflow/tensorflow/core/api_def/base_api/ |
api_def_ApplyFtrl.pbtxt | 69 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 70 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
api_def_ApplyFtrlV2.pbtxt | 71 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 72 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
api_def_ResourceApplyFtrl.pbtxt | 63 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 64 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
api_def_ResourceApplyFtrlV2.pbtxt | 65 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 66 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
api_def_ResourceSparseApplyFtrl.pbtxt | 70 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 71 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
api_def_ResourceSparseApplyFtrlV2.pbtxt | 72 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 73 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
api_def_SparseApplyFtrl.pbtxt | 76 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 77 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
api_def_SparseApplyFtrlV2.pbtxt | 78 quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 79 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0
|
/external/skia/src/gpu/ccpr/ |
GrCCQuadraticShader.h | 14 * This class renders the coverage of closed quadratic curves using the techniques outlined in 43 * This pass draws a conservative raster hull around the quadratic bezier curve, computes the 58 * This pass fixes the corners of a closed quadratic segment with soft MSAA.
|
/external/skqp/src/gpu/ccpr/ |
GrCCQuadraticShader.h | 14 * This class renders the coverage of closed quadratic curves using the techniques outlined in 43 * This pass draws a conservative raster hull around the quadratic bezier curve, computes the 58 * This pass fixes the corners of a closed quadratic segment with soft MSAA.
|
/external/python/cpython3/Include/ |
accu.h | 11 * of keeping a huge number of small separate objects, and the quadratic
|
/frameworks/support/compat/src/main/java/androidx/core/view/animation/ |
PathInterpolatorCompat.java | 55 * Create an {@link Interpolator} for a quadratic Bezier curve. The end points 58 * @param controlX the x coordinate of the quadratic Bezier control point 59 * @param controlY the y coordinate of the quadratic Bezier control point 60 * @return the {@link Interpolator} representing the quadratic Bezier curve
|
/external/skia/src/core/ |
SkGeometry.h | 28 /** Given a quadratic equation Ax^2 + Bx + C = 0, return 0, 1, 2 roots for the 38 /** Set pt to the point on the src quadratic specified by t. t must be 43 /** Given a src quadratic bezier, chop it at the specified t value, 49 /** Given a src quadratic bezier, chop it at the specified t == 1/2, 54 /** Given the 3 coefficients for a quadratic bezier (either X or Y values), look 56 these extrema. If the quadratic has no extrema betwee (0..1) exclusive, the 64 /** Given 3 points on a quadratic bezier, chop it into 1, 2 beziers such that 73 /** Given 3 points on a quadratic bezier, if the point of maximum 79 /** Given 3 points on a quadratic bezier, divide it into 2 quadratics 88 /** Given 3 points on a quadratic bezier, use degree elevation t [all...] |
/external/skqp/src/core/ |
SkGeometry.h | 28 /** Given a quadratic equation Ax^2 + Bx + C = 0, return 0, 1, 2 roots for the 38 /** Set pt to the point on the src quadratic specified by t. t must be 43 /** Given a src quadratic bezier, chop it at the specified t value, 49 /** Given a src quadratic bezier, chop it at the specified t == 1/2, 54 /** Given the 3 coefficients for a quadratic bezier (either X or Y values), look 56 these extrema. If the quadratic has no extrema betwee (0..1) exclusive, the 64 /** Given 3 points on a quadratic bezier, chop it into 1, 2 beziers such that 73 /** Given 3 points on a quadratic bezier, if the point of maximum 79 /** Given 3 points on a quadratic bezier, divide it into 2 quadratics 88 /** Given 3 points on a quadratic bezier, use degree elevation t [all...] |
/external/ImageMagick/Magick++/demo/ |
demos.tap | 25 for filter in bessel blackman box catrom cubic gaussian hamming hanning hermite lanczos mitchell point quadratic sample scale sinc triangle
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_utilities_poly.cpp | 105 /*nr additional roots from second quadratic*/ 109 [16mult 11add 2sqrt 1cubic 2quadratic=74flops 8funcs]*/ 177 /*nr additional roots from second quadratic*/ 181 [16mult 11add 2sqrt 1cubic 2quadratic=74flops 8funcs]*/
|
/external/skia/src/pathops/ |
SkReduceOrder.cpp | 49 // reduce to a quadratic or smaller 53 // look for approximation with single quadratic 124 // check to see if it is a quadratic or a line 163 http://objectmix.com/graphics/132906-fast-precision-driven-cubic-quadratic-piecewise-degree-reduction-algos-2-a.html 166 corresponding quadratic Bezier are (given in convex combinations of 182 // reduce to a quadratic or smaller 186 // look for approximation with single quadratic
|
SkDCubicToQuads.cpp | 13 Let's call the control points of the cubic Q0..Q3 and the control points of the quadratic P0..P2.
|
/external/skqp/src/pathops/ |
SkReduceOrder.cpp | 49 // reduce to a quadratic or smaller 53 // look for approximation with single quadratic 124 // check to see if it is a quadratic or a line 163 http://objectmix.com/graphics/132906-fast-precision-driven-cubic-quadratic-piecewise-degree-reduction-algos-2-a.html 166 corresponding quadratic Bezier are (given in convex combinations of 182 // reduce to a quadratic or smaller 186 // look for approximation with single quadratic
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
dogleg.h | 71 /* at which the quadratic is minimized. */ 92 /* at which the quadratic is minimized. */
|
/external/skia/src/shaders/gradients/ |
SkTwoPointConicalGradient.h | 31 // point). If we were to solve for t bruteforcely using a quadratic equation, this case 32 // implies that the quadratic equation degenerates to a linear equation.
|
/external/skqp/src/shaders/gradients/ |
SkTwoPointConicalGradient.h | 31 // point). If we were to solve for t bruteforcely using a quadratic equation, this case 32 // implies that the quadratic equation degenerates to a linear equation.
|
/external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/ |
PathTest.java | 25 assertEquals(shadowPath.getQuadDescription(), "Add a quadratic bezier from last point, approaching (0.0,5.0), ending at (10.0,15.0)");
|