| /external/opencv3/3rdparty/openexr/Imath/ |
| ImathRoots.h | 42 // Functions to solve linear, quadratic or cubic equations
52 // Find the real solutions of a linear, quadratic or cubic equation:
|
| /external/bison/data/m4sugar/ |
| foreach.m4 | 4 # Speeds up GNU M4 1.4.x by avoiding quadratic $@ recursion, but penalizes
41 # This file is designed to overcome the quadratic nature of $@
44 # expansions, but avoids the need to rescan a quadratic number of
55 # quadratic behavior (ie. it lacks the macro __m4_version__).
68 # reparsing any user input, and is not quadratic. For an idea of how
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_utilities_poly.h | 35 In debug mode closed form quadratic solving takes on the order of 15 microseconds
37 Speed-optimized code in release mode solves a quadratic in 0.3 microseconds on 450MHz
87 can be good if the quartic is sometimes in fact a quadratic, such as in absolute orientation
|
| /external/ceres-solver/include/ceres/ |
| loss_function.h | 57 // anything special (i.e. if we used a basic quadratic loss), the
59 // due to the quadratic nature of squared loss. This results in the
241 // origin, and reverts to linear in error (quadratic in cost) beyond this range.
|
| /external/ceres-solver/internal/ceres/ |
| polynomial.cc | 157 // Stable quadratic roots according to BKP Horn.
170 // Use the normal quadratic formula for the complex case.
214 // Quadratic
|
| dogleg_strategy_test.cc | 58 // The residual is chosen so that the minimum of the quadratic function is
96 // The residual is chosen so that the minimum of the quadratic function is
|
| dogleg_strategy.h | 151 // quadratic model is found.
|
| gradient_checker_test.cc | 47 // We pick a (non-quadratic) function whose derivative are easy:
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_poly.h | 35 In debug mode closed form quadratic solving takes on the order of 15 microseconds
37 Speed-optimized code in release mode solves a quadratic in 0.3 microseconds on 450MHz
87 can be good if the quartic is sometimes in fact a quadratic, such as in absolute orientation
|
| /external/llvm/lib/Support/ |
| StringMap.cpp | 106 // Use quadratic probing, it has fewer clumping artifacts than linear
150 // Use quadratic probing, it has fewer clumping artifacts than linear
|
| /external/skia/src/utils/ |
| SkPatchUtils.cpp | 23 * For the cubic case the first difference gives as a result a quadratic polynomial to which we can
26 * position keeps the sampled value while the next ones keep the quadratic, linear and constant
|
| /external/webrtc/webrtc/modules/audio_processing/intelligibility/ |
| intelligibility_enhancer.cc | 334 bool quadratic = (kConfigRho < 1.0f); local
348 if (quadratic) {
|
| intelligibility_enhancer.h | 130 // Analytically solves quadratic for optimal gains given |lambda|.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| SplineInterpolator.java | 100 // cubic spline coefficients -- b is linear, c quadratic, d is cubic (original y's are constants)
|
| /external/skia/src/core/ |
| SkCubicClipper.cpp | 30 #ifdef NEWTON_RAPHSON // Quadratic convergence, typically <= 3 iterations.
|
| /external/skia/src/pathops/ |
| SkDQuadLineIntersection.cpp | 12 Find the interection of a line and quadratic by solving for valid t values.
16 "A Bezier curve is a parametric function. A quadratic Bezier curve (i.e. three
28 Similar to above, the quadratic is represented as
34 Using Mathematica, solve for the values of t where the quadratic intersects the
|
| /external/skia/tests/ |
| PathCoverageTest.cpp | 27 // drawing a quadratic, we want to err on the high side.
|
| /external/v8/src/ic/ |
| stub-cache.h | 115 // in both caches. Unlike a probing strategy (quadratic or otherwise) the
|
| /external/valgrind/perf/ |
| many-loss-records.c | 2 // Nb: it must be run with --leak-resolution=high to show the quadratic
|
| /frameworks/base/libs/hwui/utils/ |
| VectorDrawableUtils.cpp | 405 case 'q': // Draws a quadratic Bézier (relative)
412 case 'Q': // Draws a quadratic Bézier
419 case 't': // Draws a quadratic Bézier curve(reflective control point)(relative)
434 case 'T': // Draws a quadratic Bézier curve (reflective control point)
|
| /frameworks/support/graphics/drawable/static/src/android/support/graphics/drawable/ |
| PathParser.java | 504 case 'q': // Draws a quadratic Bézier (relative)
511 case 'Q': // Draws a quadratic Bézier
518 case 't': // Draws a quadratic Bézier curve(reflective control point)(relative)
533 case 'T': // Draws a quadratic Bézier curve (reflective control point)
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| Paper.java | 156 /* Use linear interpolation for absorb, quadratic for others */
|
| /prebuilts/go/darwin-x86/test/ |
| maplinear.go | 8 // Test that maps don't go quadratic for NaNs and other values.
|
| /prebuilts/go/linux-x86/test/ |
| maplinear.go | 8 // Test that maps don't go quadratic for NaNs and other values.
|
| /external/ImageMagick/www/Magick++/ |
| Drawable.html | [all...] |
