/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
H A D | BrentSolver.java | 97 public double solve(double min, double max) argument 99 return solve(f, min, max); 104 public double solve(double min, double max, double initial) argument 106 return solve(f, min, max, initial); 117 * @param min the lower bound for the interval. 119 * @param initial the start value to use (must be set to min if no 124 * @throws IllegalArgumentException if initial is not between min and max 130 final double min, final double max, final double initial) 134 if ((initial < min) || (initial > max)) { 137 min, initia 129 solve(final UnivariateRealFunction f, final double min, final double max, final double initial) argument 196 solve(int maxEval, final UnivariateRealFunction f, final double min, final double max, final double initial) argument 221 solve(final UnivariateRealFunction f, final double min, final double max) argument 281 solve(int maxEval, final UnivariateRealFunction f, final double min, final double max) argument [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
H A D | StatisticalSummaryValues.java | 48 private final double min; field in class:StatisticalSummaryValues 60 * @param min the minimum value 64 double max, double min, double sum) { 70 this.min = min; 89 * @return Returns the min. 92 return min; 176 outBuffer.append("min: ").append(getMin()).append(endl); 63 StatisticalSummaryValues(double mean, double variance, long n, double max, double min, double sum) argument
|
/external/avahi/avahi-core/ |
H A D | prioq.c | 269 AvahiPrioQueueNode *min; local 271 if (!(min = n->left)) { 277 if (n->right && q->compare(n->right->data, min->data) < 0) 278 min = n->right; 280 /* min now contains the smaller one of our two children */ 282 if (q->compare(n->data, min->data) <= 0) 286 exchange_nodes(q, n, min);
|
/external/boringssl/src/crypto/asn1/ |
H A D | a_gentm.c | 69 static const int min[9]={ 0, 0, 1, 1, 0, 0, 0, 0, 0}; local 101 if ((n < min[i]) || (n > max[i])) goto err; 157 if ((n < min[i]) || (n > max[i])) goto err;
|
/external/boringssl/src/crypto/bn/ |
H A D | add.c | 105 int max, min, dif; local 115 min = b->top; 116 dif = max - min; 128 carry = bn_add_words(rp, ap, bp, min); 129 rp += min; 130 ap += min; 131 bp += min; 262 int max, min, dif; local 267 min = b->top; 268 dif = max - min; [all...] |
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_test_utils.h | 21 // MSVS headers define max/min as macros, so std::max/min gets crazy. 23 # undef min macro
|
/external/deqp/framework/delibs/decpp/ |
H A D | deDefs.hpp | 39 template<typename T> inline T min (T x, T y) { return x <= y ? x : y; } function in namespace:de
|
/external/easymock/src/org/easymock/ |
H A D | IExpectationSetters.java | 120 * Expect the last invocation between <code>min</code> and
123 * @param min
129 IExpectationSetters<T> times(int min, int max);
argument
|
/external/eigen/test/eigen2/ |
H A D | eigen2_packetmath.cpp | 35 template<> const complex<float>& min(const complex<float>& a, const complex<float>& b) function in namespace:std 98 CHECK_CWISE(std::min, ei_pmin);
|
/external/eigen/unsupported/test/ |
H A D | polynomialutils.cpp | 79 _Scalar min = roots.array().abs().minCoeff(); local 80 bool eval = (M >= Max) && (m <= min); 85 cerr << "Min,Max: (" << min << ", " << Max << ")" << endl;
|
/external/fio/ |
H A D | tickmarks.c | 90 int calc_tickmarks(double min, double max, int nticks, struct tickmark **tm, argument 96 double graphmin, graphmax; /* graph range min and max */ 100 /* we expect min != max */ 101 range = nicenum(max - min, 0); 103 graphmin = floor(min / d) * d;
|
/external/gmock/src/ |
H A D | gmock-cardinalities.cc | 52 BetweenCardinalityImpl(int min, int max) argument 53 : min_(min >= 0 ? min : 0), 56 if (min < 0) { 58 << "but is actually " << min << "."; local 64 } else if (min > max) { 66 << ") must be >= the invocation lower bound (" << min local 148 // Creates a cardinality that allows between min and max calls. 149 GTEST_API_ Cardinality Between(int min, int max) { argument 150 return Cardinality(new BetweenCardinalityImpl(min, ma [all...] |
/external/google-breakpad/src/testing/src/ |
H A D | gmock-cardinalities.cc | 52 BetweenCardinalityImpl(int min, int max) argument 53 : min_(min >= 0 ? min : 0), 56 if (min < 0) { 58 << "but is actually " << min << "."; local 64 } else if (min > max) { 66 << ") must be >= the invocation lower bound (" << min local 148 // Creates a cardinality that allows between min and max calls. 149 GTEST_API_ Cardinality Between(int min, int max) { argument 150 return Cardinality(new BetweenCardinalityImpl(min, ma [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ReverseNaturalOrdering.java | 46 // Override the min/max methods to "hoist" delegation outside loops 48 @Override public <E extends Comparable> E min(E a, E b) { method in class:ReverseNaturalOrdering 52 @Override public <E extends Comparable> E min(E a, E b, E c, E... rest) { method in class:ReverseNaturalOrdering 56 @Override public <E extends Comparable> E min(Iterator<E> iterator) { method in class:ReverseNaturalOrdering 60 @Override public <E extends Comparable> E min(Iterable<E> iterable) { method in class:ReverseNaturalOrdering 65 return NaturalOrdering.INSTANCE.min(a, b); 69 return NaturalOrdering.INSTANCE.min(a, b, c, rest); 73 return NaturalOrdering.INSTANCE.min(iterator); 77 return NaturalOrdering.INSTANCE.min(iterable);
|
H A D | ReverseOrdering.java | 46 // Override the min/max methods to "hoist" delegation outside loops 48 @Override public <E extends T> E min(E a, E b) { method in class:ReverseOrdering 52 @Override public <E extends T> E min(E a, E b, E c, E... rest) { method in class:ReverseOrdering 56 @Override public <E extends T> E min(Iterator<E> iterator) { method in class:ReverseOrdering 60 @Override public <E extends T> E min(Iterable<E> iterable) { method in class:ReverseOrdering 65 return forwardOrder.min(a, b); 69 return forwardOrder.min(a, b, c, rest); 73 return forwardOrder.min(iterator); 77 return forwardOrder.min(iterable);
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | 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);
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | SimplePatternFormatter.java | 93 * @param min The pattern must have at least this many placeholders. 97 public static SimplePatternFormatter compileMinMaxPlaceholders(CharSequence pattern, int min, int max) { argument 99 String compiledPattern = compileToStringMinMaxPlaceholders(pattern, sb, min, max); 107 * @param min The pattern must have at least this many placeholders. 112 CharSequence pattern, StringBuilder sb, int min, int max) { 193 if (argCount < min) { 195 "Fewer than minimum " + min + " placeholders in pattern \"" + pattern + "\""); 111 compileToStringMinMaxPlaceholders( CharSequence pattern, StringBuilder sb, int min, int max) argument
|
/external/iproute2/lib/ |
H A D | names.c | 25 int min, maj; local 36 if (sscanf(p, "%x:%x %s\n", &maj, &min, name) == 3) { 37 *id = (maj << 16) | min; 38 } else if (sscanf(p, "%x:%x %s #", &maj, &min, name) == 3) { 39 *id = (maj << 16) | min;
|
/external/iptables/extensions/ |
H A D | libip6t_ah.c | 54 print_spis(const char *name, uint32_t min, uint32_t max, argument 59 if (min != 0 || max != 0xFFFFFFFF || invert) { 60 if (min == max) 61 printf("%s:%s%u", name, inv, min); 63 printf("%ss:%s%u:%u", name, inv, min, max);
|
H A D | libxt_udp.c | 86 print_ports(const char *name, uint16_t min, uint16_t max, argument 91 if (min != 0 || max != 0xFFFF || invert) { 93 if (min == max) { 95 print_port(min, numeric); 98 print_port(min, numeric);
|
/external/iptables/include/linux/netfilter/ |
H A D | xt_u32.h | 19 __u32 min; member in struct:xt_u32_value_element
|
/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
H A D | MethodProbesVisitor.java | 103 * @param min 112 * <code>min + i</code> key. 120 public void visitTableSwitchInsnWithProbes(final int min, final int max, argument
|
/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/instr/ |
H A D | MethodInstrumenter.java | 111 public void visitTableSwitchInsnWithProbes(final int min, final int max, argument 118 mv.visitTableSwitchInsn(min, max, newDflt, newLabels);
|
/external/kernel-headers/original/uapi/linux/netfilter/ |
H A D | nf_nat.h | 25 union nf_conntrack_man_proto min; member in struct:nf_nat_ipv4_range
|
H A D | xt_u32.h | 19 __u32 min; member in struct:xt_u32_value_element
|