| /external/wpa_supplicant_8/src/common/ |
| sae.c | 213 * whether it is a quadratic residue modulo p to avoid leaking
233 * LGR(num, p) = 1 ==> quadratic residue
241 * LGR(num, p) = -1 ==> quadratic residue
448 * Create a random quadratic residue (qr) and quadratic non-residue
[all...] |
| /device/google/dragon/audio/hal/dsp/ |
| biquad.c | 105 * gives a quadratic divided by the same quadratic, with poles
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| BrentSolver.java | 354 // Inverse quadratic interpolation.
367 // Inverse quadratic interpolation gives a value
|
| MullerSolver.java | 223 // Muller's method employs quadratic interpolation through
362 // quadratic interpolation through x0, x1, x2
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| ContinuousOutputModel.java | 306 // estimate the index using a reverse quadratic polynom
308 // compute index = P(time) rather than solving a quadratic equation)
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZLongBranch.cpp | 17 // quadratic in the number of blocks; relaxing branch N can make branch N-1
27 // shortening is also quadratic in the worst case; shortening branch N
|
| /external/skia/src/pathops/ |
| SkDCubicLineIntersection.cpp | 14 Analogous to line-quadratic intersection, solve line-cubic intersection by
119 // see parallel routine in line quadratic intersections
|
| /external/ceres-solver/internal/ceres/ |
| solver_test.cc | 134 // A 4-dimension axis-aligned quadratic.
|
| dogleg_strategy.cc | 179 // The Cauchy point is the global minimizer of the quadratic model
451 // This function evaluates the quadratic model at a point x in the
665 // major axes of the quadratic problem. In this case, we simply move
|
| linear_solver.h | 240 // be the cost of the quadratic function defined by A and b. Then,
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/shapes/ |
| CircleShape.java | 152 // Solve quadratic equation.
|
| /external/libopus/celt/ |
| mathops.c | 99 The optimal minimax quadratic approximation (using relative error) is
|
| /external/llvm/docs/CommandGuide/ |
| llc.rst | 162 Register allocator based on 'Partitioned Boolean Quadratic Programming'.
|
| /external/skia/src/animator/ |
| SkParseSVGPath.cpp | 191 case 'Q': // Quadratic Bezier Curve
|
| /external/skia/src/utils/ |
| SkParsePath.cpp | 151 case 'Q': // Quadratic Bezier Curve
|
| /external/webrtc/webrtc/modules/audio_processing/ns/ |
| nsx_core_c.c | 230 // Quadratic approximation of 2^frac
|
| /frameworks/base/tools/layoutlib/bridge/src/android/util/ |
| PathParser_Delegate.java | 607 case 'q': // Draws a quadratic Bézier (relative)
614 case 'Q': // Draws a quadratic Bézier
621 case 't': // Draws a quadratic Bézier curve(reflective control point)(relative)
636 case 'T': // Draws a quadratic Bézier curve (reflective control point)
[all...] |
| /prebuilts/go/darwin-x86/src/go/types/ |
| typestring.go | 78 // Theoretically, this is a quadratic lookup algorithm, but in
|
| /prebuilts/go/linux-x86/src/go/types/ |
| typestring.go | 78 // Theoretically, this is a quadratic lookup algorithm, but in
|
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmssamp.c | 280 // Least Squares Fit of a Quadratic Curve to Data
523 // find the black point using the least squares error quadratic curve fitting
558 // fit and get the vertex of quadratic curve
|
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 243 Finds real roots of cubic, quadratic or linear equation.
338 // quadratic equation
441 * linear and quadratic iterated synthetic division. The coefficients of
450 * and protects against loss of significance in the quadratic synthetic
631 for (j = n; j >= 0; j--) { // Polynomial deflation by quadratic
[all...] |
| /external/skia/src/gpu/ |
| GrPathUtils.cpp | 362 // p is the candidate quadratic control point.
429 // control points are very close to the baseline vector. If so then we just pick quadratic
691 // For the case when a cubic is actually a quadratic
|
| /external/skia/src/gpu/batches/ |
| GrAAHairLinePathRenderer.cpp | 44 // Each quadratic is rendered as a five sided polygon. This poly bounds
45 // the quadratic's bounding triangle but has been expanded so that the
521 // Equations based off of Loop-Blinn Quadratic GPU Rendering
[all...] |
| /frameworks/av/media/libstagefright/codecs/avc/enc/src/ |
| rate_control.cpp | 404 /* Mad based variable bit allocation + QP calculation with a new quadratic method */
474 // quadratic approximation
488 Qstep = (int)(prev_QP * (sqrt(prev_RD / curr_RD) + prev_RD / curr_RD) / 2.0 + 0.9); /* Quadratic and linear approximation */
[all...] |
| /external/opencv3/doc/tutorials/ml/introduction_to_svm/ |
| introduction_to_svm.markdown | 142 constrained quadratic optimization problem in an **iterative** fashion. Here we specify a
|
