Searched refs:max (Results 101 - 125 of 2224) sorted by relevance

1234567891011>>

/external/jmonkeyengine/engine/src/core/com/jme3/bounding/
H A DIntersection.java38 import static java.lang.Math.max;
72 // max = p2;
75 // max = p0;
78 // if(min > rad || max < -rad)
104 // float min,max,p0,p1,p2,rad,fex,fey,fez;
120 float min, max;
132 max = max(p0, p2);
134 if (min > rad || max < -rad) {
143 max
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/
H A DBigIntegers.java65 * Return a random BigInteger not less than 'min' and not greater than 'max'
68 * @param max the greatest value that may be generated
70 * @return a random BigInteger value in the range [min,max]
74 BigInteger max,
77 int cmp = min.compareTo(max);
82 throw new IllegalArgumentException("'min' may not be greater than 'max'");
88 if (min.bitLength() > max.bitLength() / 2)
90 return createRandomInRange(ZERO, max.subtract(min), random).add(min);
95 BigInteger x = new BigInteger(max.bitLength(), random);
96 if (x.compareTo(min) >= 0 && x.compareTo(max) <
72 createRandomInRange( BigInteger min, BigInteger max, SecureRandom random) argument
[all...]
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
H A Deval.pass.cpp31 std::vector<D::result_type> u(d.max()+1);
35 assert(d.min() <= v && v <= d.max());
39 for (int i = 0; i <= d.max(); ++i)
49 std::vector<D::result_type> u(d.max()+1);
53 assert(d.min() <= v && v <= d.max());
57 for (int i = 0; i <= d.max(); ++i)
67 std::vector<D::result_type> u(d.max()+1);
71 assert(d.min() <= v && v <= d.max());
75 for (int i = 0; i <= d.max(); ++i)
85 std::vector<D::result_type> u(d.max()
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
H A DMullerSolver.java66 public double solve(final double min, final double max) argument
68 return solve(f, min, max);
73 public double solve(final double min, final double max, final double initial) argument
75 return solve(f, min, max, initial);
85 * @param max the upper bound for the interval
96 final double min, final double max, final double initial)
99 return solve(f, min, max, initial);
109 * @param max the upper bound for the interval
120 final double min, final double max, final double initial)
125 if (f.value(max)
95 solve(int maxEval, final UnivariateRealFunction f, final double min, final double max, final double initial) argument
119 solve(final UnivariateRealFunction f, final double min, final double max, final double initial) argument
163 solve(int maxEval, final UnivariateRealFunction f, final double min, final double max) argument
196 solve(final UnivariateRealFunction f, final double min, final double max) argument
308 solve2(final double min, final double max) argument
340 solve2(final UnivariateRealFunction f, final double min, final double max) argument
[all...]
H A DLaguerreSolver.java92 public double solve(final double min, final double max) argument
94 return solve(p, min, max);
99 public double solve(final double min, final double max, final double initial) argument
101 return solve(p, min, max, initial);
111 * @param max the upper bound for the interval
122 final double min, final double max, final double initial)
125 return solve(f, min, max, initial);
135 * @param max the upper bound for the interval
146 final double min, final double max, final double initial)
153 if (f.value(max)
121 solve(int maxEval, final UnivariateRealFunction f, final double min, final double max, final double initial) argument
145 solve(final UnivariateRealFunction f, final double min, final double max, final double initial) argument
190 solve(int maxEval, final UnivariateRealFunction f, final double min, final double max) argument
217 solve(final UnivariateRealFunction f, final double min, final double max) argument
265 isRootOK(double min, double max, Complex z) argument
[all...]
/external/deqp/framework/delibs/decpp/
H A DdeRandom.hpp48 float getFloat (float min, float max);
49 double getDouble (double min, double max);
50 int getInt (int min, int max);
79 inline float Random::getFloat (float min, float max) argument
81 DE_ASSERT(min <= max);
82 return min + (max-min)*getFloat();
85 inline double Random::getDouble (double min, double max) argument
87 DE_ASSERT(min <= max);
88 return min + (max-min)*getDouble();
91 inline int Random::getInt (int min, int max) argument
[all...]
/external/libcxx/test/libcxx/type_traits/
H A Dconvert_to_integral.pass.cpp20 const From max = Limits::max();
23 auto ret = std::__convert_to_integral((From)max);
24 assert(ret == max);
30 UserDefinedIntegral<From> f(max);
32 assert(ret == max);
40 Enum e(static_cast<Enum>(max));
42 assert(ret == max);
62 value = std::numeric_limits<unsigned long>::max()
/external/ppp/pppd/plugins/radius/
H A Dradrealms.c52 auths->max = 0;
54 accts->max = 0;
97 if (s->max >= SERVER_MAX)
116 s->name[s->max] = strdup(p);
124 s->port[s->max] = atoi(p);
125 info(" - Port is '%d'", s->port[s->max]);
126 s->max++;
132 if (accts->max)
135 if (auths->max)
/external/e2fsprogs/lib/ext2fs/
H A Dprogress.c32 const char *label, __u64 max)
56 progress->max = max;
57 progress->log_max = int_log10(max);
82 progress->log_max, progress->max);
30 ext2fs_numeric_progress_init(ext2_filsys fs, struct ext2fs_numeric_progress_struct * progress, const char *label, __u64 max) argument
/external/easymock/src/org/easymock/internal/
H A DResults.java72 int min = 0, max = 0;
76 if (interval.hasOpenCount() || max == Integer.MAX_VALUE) {
77 max = Integer.MAX_VALUE;
79 max += interval.getMaximum();
83 return new Range(min, max);
/external/freetype/src/psnames/
H A Dpstables.h4080 int count, min, max; local
4092 max = count;
4094 while ( min < max )
4096 int mid = ( min + max ) >> 1;
4112 max = mid;
/external/pdfium/third_party/freetype/src/psnames/
H A Dpstables.h4080 int count, min, max; local
4092 max = count;
4094 while ( min < max )
4096 int mid = ( min + max ) >> 1;
4112 max = mid;
/external/v8/test/mjsunit/compiler/
H A Dcompare.js50 function TestPrimitive(max, x, y) {
51 assertEquals(max, MaxLT(x, y), "MaxLT - primitive");
52 assertEquals(max, MaxLE(x, y), "MaxLE - primitive");
53 assertEquals(max, MaxGE(x, y), "MaxGE - primitive");
54 assertEquals(max, MaxGT(x, y), "MaxGT - primitive");
/external/zlib/src/examples/
H A Denough.c15 Fix bug for initial root table size == max - 1
127 len: 1..max - 1 (max == maximum code length in bits)
134 len is less than max, since the code completes immediately when len == max.
138 We build the array with length max-1 lists for the len index, with syms-3
170 local int max; /* maximum allowed bit length for the codes */ variable
179 #define INDEX(i,j,k) (((size_t)((i-1)>>1)*((i-2)>>1)+(j>>1)-1)*(max-1)+k-1)
199 len through max inclusive, coding syms symbols, with left bit patterns of
202 calculation. Uses the globals max an
[all...]
/external/openssh/openbsd-compat/
H A Dbsd-snprintf.c185 char *value, int flags, int min, int max);
187 intmax_t value, int base, int min, int max, int flags);
189 LDOUBLE fvalue, int min, int max, int flags);
199 int max; local
210 max = -1;
274 if (max < 0)
275 max = 0;
276 max = 10*max + char_to_int (ch);
279 max
514 fmtstr(char *buffer, size_t *currlen, size_t maxlen, char *value, int flags, int min, int max) argument
555 fmtint(char *buffer, size_t *currlen, size_t maxlen, intmax_t value, int base, int min, int max, int flags) argument
715 fmtfp(char *buffer, size_t *currlen, size_t maxlen, LDOUBLE fvalue, int min, int max, int flags) argument
[all...]
/external/guava/guava/src/com/google/common/escape/
H A DArrayBasedEscaperMap.java81 char max = Collections.max(map.keySet());
82 char[][] replacements = new char[max + 1][];
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dmax.pass.cpp14 // max(const T& a, const T& b);
23 assert(&std::max(a, b) == &x);
50 static_assert(std::max(x, y) == x, "" );
51 static_assert(std::max(y, x) == x, "" );
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Dfx_zlib_inftrees.c42 unsigned min, max; /* minimum and maximum code lengths */ local
114 for (max = MAXBITS; max >= 1; max--)
115 if (count[max] != 0) break;
116 if (root > max) root = max;
117 if (max == 0) { /* no symbols to code at all */
126 for (min = 1; min < max; min++)
137 if (left > 0 && (type == CODES || max !
[all...]
/external/strace/tests/
H A Dipc_msg.c20 int max = msgctl(0, MSG_INFO, &ds); local
21 if (max < 0)
23 printf("msgctl\\(0, (IPC_64\\|)?MSG_INFO, %p\\) += %d\n", &ds, max);
H A Dipc_shm.c20 int max = shmctl(0, SHM_INFO, &ds); local
21 if (max < 0)
23 printf("shmctl\\(0, (IPC_64\\|)?SHM_INFO, %p\\) += %d\n", &ds, max);
/external/zlib/src/
H A Dinftrees.c42 unsigned min, max; /* minimum and maximum code lengths */ local
114 for (max = MAXBITS; max >= 1; max--)
115 if (count[max] != 0) break;
116 if (root > max) root = max;
117 if (max == 0) { /* no symbols to code at all */
126 for (min = 1; min < max; min++)
137 if (left > 0 && (type == CODES || max !
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/integration/
H A DRombergIntegrator.java62 public double integrate(final double min, final double max) argument
64 return integrate(f, min, max);
68 public double integrate(final UnivariateRealFunction f, final double min, final double max) argument
76 verifyInterval(min, max);
80 currentRow[0] = qtrap.stage(f, min, max, 0);
89 currentRow[0] = qtrap.stage(f, min, max, i);
H A DUnivariateRealIntegrator.java66 * @param max the upper bound for the interval
72 * @throws IllegalArgumentException if min > max or the endpoints do not
78 double integrate(double min, double max) argument
86 * @param max the upper bound for the interval
91 * @throws IllegalArgumentException if min > max or the endpoints do not
94 double integrate(UnivariateRealFunction f, double min, double max) argument
/external/openfst/src/include/fst/
H A Dunion-find.h36 // Ctor: creates a disjoint set forest for the range [0;max).
40 UnionFind(T max, T fail) argument
41 : parent_(max, fail), rank_(max), fail_(fail) { }
66 // 'item'. The range [0;max) is reset if item >= max.
78 // Initialization of all elements starting from 0 to max - 1 to distinct sets
79 void MakeAllSet(T max) { argument
80 parent_.resize(max);
81 for (T item = 0; item < max;
[all...]
/external/v8/src/base/utils/
H A Drandom-number-generator.cc81 int RandomNumberGenerator::NextInt(int max) { argument
82 DCHECK_LE(0, max);
84 // Fast path if max is a power of 2.
85 if (IS_POWER_OF_TWO(max)) {
86 return static_cast<int>((max * static_cast<int64_t>(Next(31))) >> 31);
91 int val = rnd % max;
92 if (rnd - val + (max - 1) >= 0) {

Completed in 998 milliseconds

1234567891011>>