| /external/guava/guava/src/com/google/common/collect/ |
| 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/jsilver/src/com/google/clearsilver/jsilver/functions/numeric/ |
| MinFunction.java | 23 import static java.lang.Math.min;
37 return literalConstant(min(left.asNumber(), right.asNumber()), left, right);
|
| /external/libcxx/test/numerics/rand/rand.adapt/rand.adapt.disc/ |
| values.pass.cpp | 22 // static constexpr result_type min() { return Engine::min(); }
38 /*static_*/assert((E::min() == 0)/*, ""*/);
50 /*static_*/assert((E::min() == 0)/*, ""*/);
|
| /external/libcxx/test/utilities/time/time.point/time.point.special/ |
| Android.mk | 19 test_name := utilities/time/time.point/time.point.special/min
20 test_src := min.pass.cpp
|
| /external/tremolo/Tremolo/ |
| os.h | 74 #ifndef min
75 # define min(x,y) ((x)>(y)?(y):(x)) macro
|
| /hardware/ti/omap3/omx/system/src/openmax_il/perf/tests/ |
| PERF.awk | 39 min = (size != "") ? (size) : (min != "") ? (min) : 1; # min size of buffers to watch
58 else if (gsub("^size=", "",arg)) { min = max = (arg) }
59 else if (gsub("^min=", "",arg)) { min = (arg) }
97 print "min = ", min
102 min = min +
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.adapt/rand.adapt.disc/ |
| values.pass.cpp | 22 // static constexpr result_type min() { return Engine::min(); }
38 /*static_*/assert((E::min() == 0)/*, ""*/);
50 /*static_*/assert((E::min() == 0)/*, ""*/);
|
| /system/core/toolbox/upstream-netbsd/lib/libc/stdlib/ |
| strsuftoll.c | 117 long long min, long long max)
122 result = strsuftollx(desc, val, min, max, errbuf, sizeof(errbuf));
135 long long min, long long max, char *ebuf, size_t ebuflen, size_t depth)
211 num *= __strsuftollx(desc, expr + 1, min, max, ebuf, ebuflen,
227 if (num < min) {
230 desc, (long long)num, (long long)min);
245 long long min, long long max, char *ebuf, size_t ebuflen)
247 return __strsuftollx(desc, val, min, max, ebuf, ebuflen, 0);
|
| /external/blktrace/ |
| stats.h | 29 __u64 min; member in struct:minmax
38 mm->min = -1ULL;
49 if (value < mm->min)
50 mm->min = value;
60 if (src->min < dst->min)
61 dst->min = src->min;
71 mm->min = cpu_to_be64(mm->min);
[all...] |
| /external/chromium_org/base/metrics/ |
| sample_map_unittest.cc | 66 HistogramBase::Sample min; local
70 it->Get(&min, &max, &count);
71 EXPECT_EQ(1, min);
77 it->Get(&min, &max, &count);
78 EXPECT_EQ(2, min);
83 it->Get(&min, &max, &count);
84 EXPECT_EQ(4, min);
89 it->Get(&min, &max, &count);
90 EXPECT_EQ(5, min);
107 HistogramBase::Sample min; local
[all...] |
| /external/libvorbis/vq/ |
| distribution.c | 36 float min; local
79 max=min=_float32_unpack(c->q_min);
83 float val=c->quantlist[i]*delta+min;
87 printf("Minimum scalar value: %f\n",min);
145 printf("%+08f (%8ld) |",c->quantlist[ptr]*delta+min,countarray[ptr]);
169 sprintf(buf,"getting min/max (%.2f::%.2f). lines...",min,max);
174 min=max=code;
181 if(code<min)min=code
[all...] |
| /cts/tests/tests/renderscript/src/android/renderscript/cts/ |
| RSUtils.java | 45 * Fills the array with random doubles. Values will be between min (inclusive) and
48 public static void genRandomDoubles(long seed, double min, double max, double array[],
51 int minExponent = Math.min(Math.getExponent(min), 0);
59 int sign = (min >= 0) ? 1 : 1 - r.nextInt(2) * 2; // -1 or 1
61 if (rand < min || rand > max) {
70 array[i] = min + rand * (max - min);
76 if (min <= d && d <= max) {
80 array[r.nextInt(array.length)] = min;
[all...] |
| /cts/tests/tests/renderscriptlegacy/src/android/renderscriptlegacy/cts/ |
| RSUtils.java | 45 * Fills the array with random doubles. Values will be between min (inclusive) and
48 public static void genRandomDoubles(long seed, double min, double max, double array[],
51 int minExponent = Math.min(Math.getExponent(min), 0);
59 int sign = (min >= 0) ? 1 : 1 - r.nextInt(2) * 2; // -1 or 1
61 if (rand < min || rand > max) {
70 array[i] = min + rand * (max - min);
76 if (min <= d && d <= max) {
80 array[r.nextInt(array.length)] = min;
[all...] |
| /external/chromium_org/chrome/browser/resources/options/ |
| startup_overlay.css | 6 min-width: 500px;
11 min-height: 64px;
|
| /external/chromium_org/net/quic/ |
| port_suggester.h | 28 // Generate a pseudo-random int in the inclusive range from |min| to |max|.
30 int SuggestPort(int min, int max);
|
| /external/chromium_org/ppapi/cpp/private/ |
| uma_private.cc | 39 int64_t min,
46 sample, min, max, bucket_count);
51 int32_t min,
58 sample, min, max, bucket_count);
|
| /external/chromium_org/ppapi/thunk/ |
| ppb_uma_private_thunk.cc | 23 int64_t min,
33 min,
41 int32_t min,
51 min,
|
| /external/chromium_org/third_party/mesa/src/src/egl/main/ |
| eglmode.c | 159 _eglModeQualifies(const _EGLMode *c, const _EGLMode *min)
161 if (min->Handle != EGL_DONT_CARE && c->Handle != min->Handle)
163 if (min->Width != EGL_DONT_CARE && c->Width < min->Width)
165 if (min->Height != EGL_DONT_CARE && c->Height < min->Height)
167 if (min->RefreshRate != EGL_DONT_CARE && c->RefreshRate < min->RefreshRate)
169 if (min->Optimal != EGL_DONT_CARE && c->Optimal != min->Optimal
264 _EGLMode **modeList, min; local
[all...] |
| /external/chromium_org/ui/gfx/geometry/ |
| cubic_bezier.h | 21 // Sets |min| and |max| to the bezier's minimum and maximium y values in the
23 void Range(double* min, double* max) const;
|
| /external/e2fsprogs/misc/ |
| e2freefrag.h | 18 unsigned long min, max, avg; /* chunk size stats */ member in struct:chunk_info
|
| /external/fio/ |
| fifo.c | 53 len = min(len, fifo_room(fifo));
56 l = min(len, fifo->size - (fifo->in & (fifo->size - 1)));
74 len = min(len, fifo->in - fifo->out);
82 l = min(len, fifo->size - (fifo->out & (fifo->size - 1)));
|
| /external/libcxx/test/language.support/support.limits/limits/numeric.limits.members/ |
| min.pass.cpp | 12 // min()
24 assert(std::numeric_limits<T>::min() == expected);
26 assert(std::numeric_limits<const T>::min() == expected);
28 assert(std::numeric_limits<volatile T>::min() == expected);
30 assert(std::numeric_limits<const volatile T>::min() == expected);
|
| /external/libcxx/test/numerics/rand/rand.adapt/rand.adapt.shuf/ |
| values.pass.cpp | 21 // static constexpr result_type min() { return Engine::min; }
36 /*static_*/assert((E::min() == 1)/*, ""*/);
|
| /external/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| min.pass.cpp | 15 // result_type min() const;
28 assert(d.min() == 10);
|
| /external/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| min.pass.cpp | 15 // result_type min() const;
28 assert(d.min() == 10);
|
