| /prebuilts/ndk/9/platforms/android-21/arch-mips/usr/include/linux/netfilter/ |
| xt_length.h | 24 __u16 min, max; member in struct:xt_length_info
|
| /prebuilts/ndk/9/platforms/android-21/arch-mips64/usr/include/linux/netfilter/ |
| xt_length.h | 24 __u16 min, max; member in struct:xt_length_info
|
| /prebuilts/ndk/9/platforms/android-21/arch-x86/usr/include/linux/netfilter/ |
| xt_length.h | 24 __u16 min, max; member in struct:xt_length_info
|
| /prebuilts/ndk/9/platforms/android-21/arch-x86_64/usr/include/linux/netfilter/ |
| xt_length.h | 24 __u16 min, max; member in struct:xt_length_info
|
| /external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.ibits/ |
| values.pass.cpp | 20 // static constexpr result_type min() { return 0; }
31 /*static_*/assert((E::min() == 0)/*, ""*/);
39 /*static_*/assert((E::min() == 0)/*, ""*/);
|
| /external/libcxx/test/std/utilities/time/time.point/time.point.special/ |
| min.pass.cpp | 14 // static constexpr time_point min();
24 assert(TP::min() == TP(Duration::min()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.adapt/rand.adapt.ibits/ |
| values.pass.cpp | 20 // static constexpr result_type min() { return 0; }
31 /*static_*/assert((E::min() == 0)/*, ""*/);
39 /*static_*/assert((E::min() == 0)/*, ""*/);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/time/time.point/time.point.special/ |
| min.pass.cpp | 14 // static constexpr time_point min();
24 assert(TP::min() == TP(Duration::min()));
|
| /packages/apps/Gallery2/jni/filters/ |
| bwfilter.c | 29 float min = MIN(sg,sb); local
30 min = MIN(sr,min);
33 float avg = (min+max)/2;
45 min = MIN(g,b);
46 min = MIN(r,min)
[all...] |
| /cts/libs/commonutil/src/com/android/cts/util/ |
| Stat.java | 28 * Collection of statistical propertirs like average, max, min, and stddev
36 public StatResult(double average, double min, double max, double stddev, int dataCount) {
38 mMin = min;
46 * Calculate statistics properties likes average, min, max, and stddev for the given array
50 double min = data[0]; local
59 if (data[i] < min) {
60 min = data[i];
67 return new StatResult(average, min, max, stddev, data.length);
71 * Calculate statistics properties likes average, min, max, and stddev for the given array
89 double min = median local
136 double min = data[0]; local
[all...] |
| /external/libcxx/test/std/utilities/time/time.duration/time.duration.literals/ |
| literals1.pass.cpp | 23 minutes min = 36min; local
24 assert ( min == minutes(36));
25 auto min2 = 36.0min;
26 assert ( min == min2 );
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/time/time.duration/time.duration.literals/ |
| literals1.pass.cpp | 23 minutes min = 36min; local
24 assert ( min == minutes(36));
25 auto min2 = 36.0min;
26 assert ( min == min2 );
|
| /cts/tests/tests/renderscript/src/android/renderscript/cts/generated/ |
| TestMin.rs | 26 return min(inA, inB);
31 return min(inA, inB);
36 return min(inA, inB);
41 return min(inA, inB);
46 return min(inA, inB);
51 return min(inA, inB);
56 return min(inA, inB);
61 return min(inA, inB);
66 return min(inA, inB);
71 return min(inA, inB)
[all...] |
| /external/bison/lib/ |
| intprops.h | 155 arguments (including the MIN and MAX arguments) must be of the same
157 must have minimum value MIN and maximum MAX. Unsigned types should
158 use a zero MIN of the proper type.
160 These macros are tuned for constant MIN and MAX. For commutative
163 /* Return 1 if A + B would overflow in [MIN,MAX] arithmetic.
165 #define INT_ADD_RANGE_OVERFLOW(a, b, min, max) \
167 ? (a) < (min) - (b) \
170 /* Return 1 if A - B would overflow in [MIN,MAX] arithmetic.
172 #define INT_SUBTRACT_RANGE_OVERFLOW(a, b, min, max) \
175 : (a) < (min) + (b)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| RiddersSolver.java | 65 public double solve(final double min, final double max)
67 return solve(f, min, max);
72 public double solve(final double min, final double max, final double initial)
74 return solve(f, min, max, initial);
83 * @param min the lower bound for the interval
94 final double min, final double max, final double initial)
97 return solve(f, min, max, initial);
106 * @param min the lower bound for the interval
117 final double min, final double max, final double initial)
121 if (f.value(min) == 0.0) { return min;
[all...] |
| NewtonSolver.java | 62 public double solve(final double min, final double max)
64 return solve(f, min, max);
69 public double solve(final double min, final double max, final double startValue)
71 return solve(f, min, max, startValue);
75 * Find a zero near the midpoint of <code>min</code> and <code>max</code>.
78 * @param min the lower bound for the interval
84 * @throws IllegalArgumentException if min is not less than max
88 final double min, final double max)
91 return solve(f, min, max);
95 * Find a zero near the midpoint of <code>min</code> and <code>max</code>
[all...] |
| BrentSolver.java | 97 public double solve(double min, double max)
99 return solve(f, min, max);
104 public double solve(double min, double max, double initial)
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, initial, max)
[all...] |
| /external/deqp/framework/randomshaders/ |
| rsgUtils.hpp | 53 inline float getQuantizedFloat (de::Random& rnd, float min, float max, float step)
55 int numSteps = (int)((max-min)/step);
56 return min + step*rnd.getInt(0, numSteps);
59 inline bool quantizeFloatRange (float& min, float& max)
63 float newMin = deFloatCeil(min*subdiv)/subdiv;
65 min = newMin; // Minimum value quantized
70 if (min <= newMax)
|
| /external/iptables/extensions/ |
| libxt_length.c | 28 info->min = cb->val.u16_range[0];
42 if (info->min == info->max)
43 printf("%u", info->min);
45 printf("%u:%u", info->min, info->max);
53 if (info->min == info->max)
54 printf("%u", info->min);
56 printf("%u:%u", info->min, info->max);
|
| /external/skia/tools/ |
| Stats.h | 15 min = samples[0];
18 if (samples[i] < min) { min = samples[i]; }
39 // Normalize samples to [min, max] in as many quanta as we have distinct bars to print.
41 if (min == max) {
48 s -= min;
49 s /= (max - min);
57 double min;
|
| /frameworks/native/services/surfaceflinger/ |
| clz.h | 28 static inline T min(T a, T b) { function in namespace:android
32 static inline T min(T a, T b, T c) { function in namespace:android
33 return min(a, min(b, c));
36 static inline T min(T a, T b, T c, T d) { function in namespace:android
37 return min(a, b, min(c, d));
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/ |
| BigIntegers.java | 65 * Return a random BigInteger not less than 'min' and not greater than 'max'
67 * @param min the least value that may be generated
70 * @return a random BigInteger value in the range [min,max]
73 BigInteger min,
77 int cmp = min.compareTo(max);
82 throw new IllegalArgumentException("'min' may not be greater than 'max'");
85 return min;
88 if (min.bitLength() > max.bitLength() / 2)
90 return createRandomInRange(ZERO, max.subtract(min), random).add(min);
[all...] |
| /external/google-breakpad/src/testing/src/ |
| gmock-cardinalities.cc | 52 BetweenCardinalityImpl(int min, int max)
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) {
150 return Cardinality(new BetweenCardinalityImpl(min, max))
[all...] |
| /external/webrtc/test/testsupport/metrics/ |
| video_metrics.h | 31 min(std::numeric_limits<double>::max()),
32 max(std::numeric_limits<double>::min()),
37 double min; member in struct:webrtc::test::QualityMetricsResult
|
| /art/runtime/interpreter/ |
| safe_math_test.cc | 27 // Adding 1 overflows 0x7ff... to 0x800... aka max and min.
29 std::numeric_limits<int32_t>::min());
31 std::numeric_limits<int64_t>::min());
39 EXPECT_EQ(SafeAdd(std::numeric_limits<int32_t>::min() + 1, -1),
40 std::numeric_limits<int32_t>::min());
41 EXPECT_EQ(SafeAdd(std::numeric_limits<int64_t>::min() + 1, -1),
42 std::numeric_limits<int64_t>::min());
62 // Subtracting 1 underflows 0x800... to 0x7ff... aka min and max.
63 EXPECT_EQ(SafeSub(std::numeric_limits<int32_t>::min(), 1),
65 EXPECT_EQ(SafeSub(std::numeric_limits<int64_t>::min(), 1)
[all...] |
