Searched refs:max (Results 1 - 25 of 2224) sorted by relevance

1234567891011>>

/external/v8/test/mjsunit/compiler/
H A Dregress-max.js30 // Test Math.max with negative zero as input.
31 for (var i = 0; i < 5; i++) Math.max(0, 0);
32 %OptimizeFunctionOnNextCall(Math.max);
33 Math.max(0, 0);
35 var r = Math.max(-0, -0);
/external/fio/
H A Dio_u_queue.c21 ring->max = nr + 1;
22 if (ring->max & (ring->max - 1)) {
23 ring->max--;
24 ring->max |= ring->max >> 1;
25 ring->max |= ring->max >> 2;
26 ring->max |= ring->max >>
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dmax_init_list.pass.cpp14 // max(initializer_list<T> t);
22 int i = std::max({2, 3, 1});
24 i = std::max({2, 1, 3});
26 i = std::max({3, 1, 2});
28 i = std::max({3, 2, 1});
30 i = std::max({1, 2, 3});
32 i = std::max({1, 3, 2});
36 static_assert(std::max({1, 3, 2}) == 3, "");
37 static_assert(std::max({2, 1, 3}) == 3, "");
38 static_assert(std::max({
[all...]
H A Dmax_init_list_comp.pass.cpp14 // max(initializer_list<T> t, Compare comp);
23 int i = std::max({2, 3, 1}, std::greater<int>());
25 i = std::max({2, 1, 3}, std::greater<int>());
27 i = std::max({3, 1, 2}, std::greater<int>());
29 i = std::max({3, 2, 1}, std::greater<int>());
31 i = std::max({1, 2, 3}, std::greater<int>());
33 i = std::max({1, 3, 2}, std::greater<int>());
37 static_assert(std::max({1, 3, 2}, std::greater<int>()) == 1, "");
38 static_assert(std::max({2, 1, 3}, std::greater<int>()) == 1, "");
39 static_assert(std::max({
[all...]
/external/libcxx/test/std/utilities/time/time.traits/time.traits.duration_values/
H A Dmax.pass.cpp12 // duration_values::max
22 assert(std::chrono::duration_values<int>::max() ==
23 std::numeric_limits<int>::max());
24 assert(std::chrono::duration_values<double>::max() ==
25 std::numeric_limits<double>::max());
26 assert(std::chrono::duration_values<Rep>::max() ==
27 std::numeric_limits<Rep>::max());
29 static_assert(std::chrono::duration_values<int>::max() ==
30 std::numeric_limits<int>::max(), "");
31 static_assert(std::chrono::duration_values<double>::max()
[all...]
/external/ltrace/sysdeps/linux-gnu/
H A Darch_mksyscallent26 max=0;
36 if ($3 > max) {
37 max=$3;
41 if ($4 > max) {
42 max=$4;
49 for(i=0; i<=max; i++) {
H A Dmksyscallent28 max=0;
39 if ($3 > max) {
40 max=$3;
44 if ($4 > max) {
45 max=$4;
52 for(i=0; i<=max; i++) {
H A Dmksignalent24 max=0;
32 if ($3 > max) {
33 max=$3;
39 for(i=0; i<=max; i++) {
H A Dmksyscallent_mips27 max=0;
42 if ($4 > max) {
43 max=$4;
49 for(i=0; i<=max; i++) {
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.bern/rand.dist.bern.geo/
H A Dmax.pass.cpp15 // result_type max() const;
25 assert(d.max() == std::numeric_limits<int>::max());
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.bern/rand.dist.bern.negbin/
H A Dmax.pass.cpp15 // result_type max() const;
25 assert(d.max() == std::numeric_limits<int>::max());
/external/libcxx/test/std/utilities/template.bitset/bitset.members/
H A Dto_ullong.pass.cpp22 const unsigned long long max = M == 0 ? 0 : (unsigned long long)(-1) >> X;
24 std::min<unsigned long long>(1, max),
25 std::min<unsigned long long>(2, max),
26 std::min<unsigned long long>(3, max),
27 std::min(max, max-3),
28 std::min(max, max-2),
29 std::min(max, max
[all...]
H A Dto_ulong.pass.cpp23 const std::size_t max = M == 0 ? 0 : std::size_t(std::numeric_limits<unsigned long>::max()) >> X;
25 std::min<std::size_t>(1, max),
26 std::min<std::size_t>(2, max),
27 std::min<std::size_t>(3, max),
28 std::min(max, max-3),
29 std::min(max, max-2),
30 std::min(max, ma
[all...]
/external/dhcpcd/compat/
H A Dclosefrom.c35 long max; local
39 max = sysconf(_SC_OPEN_MAX);
41 max = getdtablesize();
44 for (i = fd; i < max; i++) {
/external/v8/test/mjsunit/regress/
H A Dregress-123919.js30 function g(max,val) {
32 for (var i = 0; i < max; i++) {
38 function f(max) {
40 var obj = new g(max,val);
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowProgressBar.java13 private int max = 100; field in class:ShadowProgressBar
20 final int max = attributeSet.getAttributeIntValue("android", "max", this.max);
22 if (max >= 0)
23 setMax(max);
27 public void setMax(int max) { argument
28 this.max = max;
29 if (progress > max) {
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/exception/
H A DNumberIsTooLargeException.java36 private final Number max; field in class:NumberIsTooLargeException
46 * @param max maximum.
50 Number max,
52 this(null, wrong, max, boundIsAllowed);
59 * @param max maximum.
64 Number max,
70 wrong, max);
72 this.max = max;
87 return max;
49 NumberIsTooLargeException(Number wrong, Number max, boolean boundIsAllowed) argument
62 NumberIsTooLargeException(Localizable specific, Number wrong, Number max, boolean boundIsAllowed) argument
[all...]
/external/eigen/doc/snippets/
H A DCwise_max.cpp2 cout << v.max(w) << endl;
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.pois/rand.dist.pois.poisson/
H A Dmax.pass.cpp15 // result_type max() const;
25 D::result_type m = d.max();
26 assert(m == std::numeric_limits<int>::max());
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
H A DBisectionSolver.java58 public double solve(double min, double max, double initial) argument
60 return solve(f, min, max);
65 public double solve(double min, double max) argument
67 return solve(f, min, max);
75 public double solve(final UnivariateRealFunction f, double min, double max, double initial) argument
77 return solve(f, min, max);
82 public double solve(int maxEval, final UnivariateRealFunction f, double min, double max, double initial) argument
84 return solve(maxEval, f, min, max);
89 public double solve(int maxEval, final UnivariateRealFunction f, double min, double max) argument
92 return solve(f, min, max);
100 solve(final UnivariateRealFunction f, double min, double max) argument
[all...]
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/
H A DProgressMonitor.java54 * The max value that when reached, the progress is at 100%.
56 public void setMonitorMax(float max); argument
59 * The max value of the progress. When incrementProgress()
/external/skia/src/core/
H A DSkBitmapProcState_utils.h23 int count, unsigned max) {
36 return (unsigned)SkFixedFloorToInt(fx) <= max &&
37 (unsigned)SkFixedFloorToInt(fx + dx * (count - 1)) < max;
21 can_truncate_to_fixed_for_decal(SkFractionalInt frX, SkFractionalInt frDx, int count, unsigned max) argument
/external/skia/src/opts/
H A DSkBitmapProcState_matrixProcs_neon.cpp21 // TILEX_PROCF(fx, max) SkClampMax((fx) >> 16, max)
22 static inline int16x8_t sbpsm_clamp_tile8(int32x4_t low, int32x4_t high, unsigned max) { argument
30 res = vminq_s16(res, vdupq_n_s16(max));
35 // TILEX_PROCF(fx, max) SkClampMax((fx) >> 16, max)
36 static inline int32x4_t sbpsm_clamp_tile4(int32x4_t f, unsigned max) { argument
44 res = vminq_s32(res, vdupq_n_s32(max));
49 // TILEY_LOW_BITS(fy, max) (((fy) >> 12) & 0xF)
63 // TILEX_PROCF(fx, max) (((f
64 sbpsm_repeat_tile8(int32x4_t low, int32x4_t high, unsigned max) argument
82 sbpsm_repeat_tile4(int32x4_t f, unsigned max) argument
99 sbpsm_repeat_tile4_low_bits(int32x4_t fx, unsigned max) argument
[all...]
/external/clang/test/Profile/
H A Dc-attributes.c37 int max = atoi(argv[1]); local
39 for (i = 0; i < max; i++)
41 for (i = 0; i < max * 4 / 10; i++)
43 for (i = 0; i < max * 2 / 10; i++)
45 for (i = 0; i < max / 200; i++)
/external/clang/test/SemaTemplate/
H A Dalignas.cpp7 constexpr T max(T t, U u) { return t > u ? t : u; } function
10 constexpr auto max(T t, Ts ...ts) -> decltype(max(t, max(ts...))) { function
11 return max(t, max(ts...));
15 alignas(T...) char buffer[max(sizeof(T)...)];

Completed in 8210 milliseconds

1234567891011>>