/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
SecantSolver.java | 70 public double solve(final double min, final double max) 72 return solve(f, min, max); 77 public double solve(final double min, final double max, final double initial) 79 return solve(f, min, max, initial); 86 * @param min the lower bound for the interval 93 * @throws IllegalArgumentException if min is not less than max or the 98 final double min, final double max, final double initial) 101 return solve(f, min, max, initial); 108 * @param min the lower bound for the interval 114 * @throws IllegalArgumentException if min is not less than max or th [all...] |
MullerSolver.java | 66 public double solve(final double min, final double max) 68 return solve(f, min, max); 73 public double solve(final double min, final double max, final double initial) 75 return solve(f, min, max, initial); 84 * @param min the lower bound for the interval 96 final double min, final double max, final double initial) 99 return solve(f, min, max, initial); 108 * @param min the lower bound for the interval 120 final double min, final double max, final double initial) 124 if (f.value(min) == 0.0) { return min; [all...] |
LaguerreSolver.java | 92 public double solve(final double min, final double max) 94 return solve(p, min, max); 99 public double solve(final double min, final double max, final double initial) 101 return solve(p, min, max, initial); 110 * @param min the lower bound for the interval 122 final double min, final double max, final double initial) 125 return solve(f, min, max, initial); 134 * @param min the lower bound for the interval 146 final double min, final double max, final double initial) 150 if (f.value(min) == 0.0) [all...] |
/packages/apps/Camera2/src/com/android/camera/ui/motion/ |
UnitBezier.java | 93 float min = 0.0f; local 97 if (input < min) { 98 return min; 104 while (min < max) { 111 min = input; 116 input = (max - min) * .5f + min;
|
/external/libcxx/test/libcxx/type_traits/ |
convert_to_integral.pass.cpp | 21 const From min = Limits::min(); 25 ret = std::__convert_to_integral((From)min); 26 assert(ret == min); 33 f.value = min; 35 assert(ret == min); 43 e = static_cast<Enum>(min); 44 ret = std::__convert_to_integral(min); 45 assert(ret == min);
|
/external/freetype/src/psnames/ |
pstables.h | 4080 int count, min, max; local [all...] |
/external/libcxx/test/std/utilities/time/time.duration/time.duration.literals/ |
literals2.pass.cpp | 26 std::chrono::minutes min = 36min; local 27 assert ( min == std::chrono::minutes(36)); 28 auto min2 = 36.0min; 29 assert ( min == min2 );
|
literals.pass.cpp | 23 static_assert ( std::is_same<decltype( 3min ), std::chrono::minutes>::value, "" ); 34 std::chrono::minutes min = 36min; local 35 assert ( min == std::chrono::minutes(36)); 36 auto min2 = 36.0min; 37 assert ( min == min2 );
|
/external/pdfium/third_party/freetype/src/psnames/ |
pstables.h | 4080 int count, min, max; local [all...] |
/external/skia/src/animator/ |
SkDisplayRandom.cpp | 23 SK_MEMBER(min, Float), 32 SkDisplayRandom::SkDisplayRandom() : blend(0), min(0), max(SK_Scalar1) { 38 SkDebugf("min=\"%g\" ", SkScalarToFloat(min)); 50 value->fOperand.fScalar = min + SkScalarMul(max - min, relativeT);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/time/time.duration/time.duration.literals/ |
literals2.pass.cpp | 26 std::chrono::minutes min = 36min; local 27 assert ( min == std::chrono::minutes(36)); 28 auto min2 = 36.0min; 29 assert ( min == min2 );
|
literals.pass.cpp | 23 static_assert ( std::is_same<decltype( 3min ), std::chrono::minutes>::value, "" ); 34 std::chrono::minutes min = 36min; local 35 assert ( min == std::chrono::minutes(36)); 36 auto min2 = 36.0min; 37 assert ( min == min2 );
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
min.pass.cpp | 14 // min(const T& a, const T& b); 23 assert(&std::min(a, b) == &x); 50 static_assert(std::min(x, y) == y, "" ); 51 static_assert(std::min(y, x) == y, "" );
|
/external/skia/include/effects/ |
SkTableMaskFilter.h | 27 /** Utility that creates a clipping table: clamps values below min to 0 30 static void MakeClipTable(uint8_t table[256], uint8_t min, uint8_t max); 42 static SkTableMaskFilter* CreateClip(uint8_t min, uint8_t max) { 44 MakeClipTable(table, min, max);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
min.pass.cpp | 14 // min(const T& a, const T& b); 23 assert(&std::min(a, b) == &x); 50 static_assert(std::min(x, y) == y, "" ); 51 static_assert(std::min(y, x) == y, "" );
|
/ndk/tests/device/test-gnustl-full/unit/ |
min_test.cpp | 38 int r = min(42, 100); 41 r = min(--r, r); 46 const char* r = min((const char*)"shoe", (const char*)"shine", str_compare);
|
/ndk/tests/device/test-stlport/unit/ |
min_test.cpp | 38 int r = min(42, 100); 41 r = min(--r, r); 46 const char* r = min((const char*)"shoe", (const char*)"shine", str_compare);
|
/packages/inputmethods/OpenWnn/libs/libwnnDictionary/include/ |
njd.h | 63 #define NORMALIZE_HINDO(freq, max, min) \ 64 (((freq) < (min)) ? (min) : (((freq) > (max)) ? (max) : (freq)))
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/integration/ |
RombergIntegrator.java | 62 public double integrate(final double min, final double max) 64 return integrate(f, min, max); 68 public double integrate(final UnivariateRealFunction f, final double min, final double max) 76 verifyInterval(min, max); 80 currentRow[0] = qtrap.stage(f, min, max, 0); 89 currentRow[0] = qtrap.stage(f, min, max, i);
|
UnivariateRealIntegrator.java | 65 * @param min the lower bound for the interval 72 * @throws IllegalArgumentException if min > max or the endpoints do not 78 double integrate(double min, double max) 85 * @param min the lower bound for the interval 91 * @throws IllegalArgumentException if min > max or the endpoints do not 94 double integrate(UnivariateRealFunction f, double min, double max)
|
/external/guava/guava/src/com/google/common/primitives/ |
SignedBytes.java | 113 public static byte min(byte... array) { method in class:SignedBytes 115 byte min = array[0]; 117 if (array[i] < min) { 118 min = array[i]; 121 return min; 192 int minLength = Math.min(left.length, right.length);
|
/hardware/libhardware/modules/consumerir/ |
consumerir.c | 28 {.min = 30000, .max = 30000}, 29 {.min = 33000, .max = 33000}, 30 {.min = 36000, .max = 36000}, 31 {.min = 38000, .max = 38000}, 32 {.min = 40000, .max = 40000}, 33 {.min = 56000, .max = 56000},
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
UnivariateRealOptimizer.java | 61 * @param min the lower bound for the interval. 67 * @throws IllegalArgumentException if min > max or the endpoints do not 71 double min, double max) 82 * @param min the lower bound for the interval. 89 * @throws IllegalArgumentException if min > max or the arguments do not 94 double min, double max, double startValue)
|
/external/clang/test/SemaCXX/ |
function-overload-typo-crash.cpp | 4 void min(); //expected-note {{'min' declared here}} 5 void min(int); 10 fin(); //expected-error {{use of undeclared identifier 'fin'; did you mean 'min'}}
|
/external/eigen/blas/f2c/ |
datatypes.h | 19 #define min(a,b) ((a) <= (b) ? (a) : (b)) macro 21 #define dmin(a,b) (doublereal)min(a,b)
|