/external/fio/t/ |
log.c | 14 len = min(len, sizeof(buffer) - 1); 28 len = min(len, sizeof(buffer) - 1);
|
/external/guava/guava/src/com/google/common/collect/ |
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);
|
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/std/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/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/v8/src/base/ |
division-by-constant.cc | 27 const T min = (static_cast<T>(1) << (bits - 1)); 28 const bool neg = (min & d) != 0; 30 const T t = min + (d >> (bits - 1)); 33 T q1 = min / anc; // Init. q1 = 2**p/|nc|. 34 T r1 = min - q1 * anc; // Init. r1 = rem(2**p, |nc|). 35 T q2 = min / ad; // Init. q2 = 2**p/|d|. 36 T r2 = min - q2 * ad; // Init. r2 = rem(2**p, |d|). 66 const T min = static_cast<T>(1) << (bits - 1); local 71 T q1 = min / nc; // Init. q1 = 2**p/nc 72 T r1 = min - q1 * nc; // Init. r1 = rem(2**p,nc [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/clang/test/Modules/Inputs/ |
cxx-irgen-left.h | 6 return min(1, 2);
|
/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/std/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/std/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/std/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/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
min.pass.cpp | 15 // result_type min() const; 28 assert(d.min() == 10);
|
/external/libcxx/test/std/utilities/time/time.clock/time.clock.hires/ |
now.pass.cpp | 24 assert(C::time_point::min() < t1);
|
/external/libcxx/test/std/utilities/time/time.clock/time.clock.system/ |
now.pass.cpp | 24 assert(C::time_point::min() < t1);
|
/external/mesa3d/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...] |
/frameworks/ex/framesequence/jni/utils/ |
math.h | 25 #define min(a,b) \ macro
|