Searched defs:max (Results 326 - 350 of 1064) sorted by relevance

<<11121314151617181920>>

/external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/
H A Dxcorr_coef.c37 int16_t max; local
58 max=WebRtcSpl_MaxAbsValueW16(regressor, subl + searchLen - 1);
62 max = WebRtcSpl_MaxAbsValueW16(regressor - searchLen, subl + searchLen - 1);
71 if (max>5000) {
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/
H A Dtransform_mips.c31 int32_t inre1, inre2, tmpre, tmpim, factor, max, max1; local
46 "mul %[max], $zero, $zero \n\t"
104 "slt %[r0], %[max], %[r4] \n\t"
105 "movn %[max], %[r4], %[r0] \n\t"
106 "slt %[r1], %[max], %[r6] \n\t"
107 "movn %[max], %[r6], %[r1] \n\t"
177 "slt %[r2], %[max], %[r1] \n\t"
178 "movn %[max], %[r1], %[r2] \n\t"
179 "slt %[r2], %[max], %[r0] \n\t"
180 "movn %[max],
609 int32_t r0, r1, r2, r3, r4, r5, r6, r7, r8, r9, max, max1; local
[all...]
/external/webrtc/webrtc/modules/audio_processing/test/
H A Daudio_file_processor.h35 TickIntervalStats() : min(std::numeric_limits<int64_t>::max()) {}
37 TickInterval max; member in struct:webrtc::TickIntervalStats
68 proc_time_->max = std::max(proc_time_->max, interval);
/external/webrtc/webrtc/system_wrappers/test/TestSort/
H A DTestSort.cc20 #undef max macro
115 // Uniform [-max()/2, max()/2] for signed
116 // [0, max()] for unsigned
117 return static_cast<Type>(floatRand * std::numeric_limits<Type>::max());
/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/aac/libPCMutils/src/
H A Dlimiter.cpp101 FIXP_DBL cor, max; member in struct:TDLimiter
135 /* alloc max and delay buffers */
180 limiter->max = (FIXP_DBL)0;
241 FIXP_DBL max = limiter->max; local
295 if (tmp >= max) {
297 max = tmp;
299 else if (old < max) {
305 buffer for the new max */
306 max
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DNFAToDFAConverter.java93 // we've hit max lookahead, make this a stop state
654 // if this context has hit the max recursions for p.stateNumber,
1388 if ( nakedAlt == max(nondeterministicAlts) ) {
1720 public static int max(Set s) { method in class:NFAToDFAConverter
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
H A DUnivariateRealSolverImpl.java147 * @param max the upper bound for the interval.
153 * @throws IllegalArgumentException if min > max or the endpoints do not
157 public double solve(int maxEval, UnivariateRealFunction function, double min, double max) argument
170 * @param max the upper bound for the interval.
177 * @throws IllegalArgumentException if min > max or the arguments do not
181 public double solve(int maxEval, UnivariateRealFunction function, double min, double max, double startValue) argument
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/
H A DMultiStartUnivariateRealOptimizer.java228 final double min, final double max)
242 final double bound1 = (i == 0) ? min : min + generator.nextDouble() * (max - min);
243 final double bound2 = (i == 0) ? max : min + generator.nextDouble() * (max - min);
246 FastMath.max(bound1, bound2));
314 final double min, final double max, final double startValue)
316 return optimize(f, goalType, min, max);
227 optimize(final UnivariateRealFunction f, final GoalType goalType, final double min, final double max) argument
313 optimize(final UnivariateRealFunction f, final GoalType goalType, final double min, final double max, final double startValue) argument
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/univariate/
H A DAbstractUnivariateRealOptimizer.java219 double min, double max, double startValue)
223 this.searchMax = max;
251 double min, double max)
253 return optimize(f, goal, min, max, min + 0.5 * (max - min));
218 optimize(UnivariateRealFunction f, GoalType goal, double min, double max, double startValue) argument
250 optimize(UnivariateRealFunction f, GoalType goal, double min, double max) argument
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/
H A DFastFourierTransformer.java86 * @param max the upper bound for the interval
94 double min, double max, int n)
96 double data[] = sample(f, min, max, n);
141 * @param max the upper bound for the interval
149 double min, double max, int n)
152 double data[] = sample(f, min, max, n);
200 * @param max the upper bound for the interval
208 double min, double max, int n)
211 double data[] = sample(f, min, max, n);
259 * @param max th
93 transform(UnivariateRealFunction f, double min, double max, int n) argument
148 transform2(UnivariateRealFunction f, double min, double max, int n) argument
207 inversetransform(UnivariateRealFunction f, double min, double max, int n) argument
266 inversetransform2(UnivariateRealFunction f, double min, double max, int n) argument
430 sample(UnivariateRealFunction f, double min, double max, int n) argument
[all...]
/external/apache-xml/src/main/java/org/apache/xml/serializer/
H A DCharInfo.java538 int max = charInfo.array_of_bits.length;
539 System.arraycopy(charInfo.array_of_bits,0,copy.array_of_bits,0,max);
543 max = charInfo.shouldMapAttrChar_ASCII.length;
544 System.arraycopy(charInfo.shouldMapAttrChar_ASCII,0,copy.shouldMapAttrChar_ASCII,0,max);
546 max = charInfo.shouldMapTextChar_ASCII.length;
547 System.arraycopy(charInfo.shouldMapTextChar_ASCII,0,copy.shouldMapTextChar_ASCII,0,max);
589 * @param max the maximum integer to be in the set.
591 private int[] createEmptySetOfIntegers(int max) { argument
594 int[] arr = new int[arrayIndex(max - 1) + 1];
H A DNamespaceMappings.java376 private int max = 20; field in class:NamespaceMappings.Stack
377 Object[] m_stack = new Object[max];
381 clone.max = this.max;
383 clone.m_stack = new Object[clone.max];
398 if (max <= top) {
399 int newMax = 2*max + 1;
401 System.arraycopy(m_stack,0, newArray, 0, max);
402 max = newMax;
/external/bison/src/
H A Dgram.c159 int max = 0; local
165 if (length > max)
166 max = length;
169 return max;
/external/boringssl/src/crypto/asn1/
H A Dasn1_lib.c96 static int asn1_get_length(const unsigned char **pp,int *inf,long *rl,int max);
131 long max=omax; local
133 if (!max) goto err;
140 if (--max == 0) goto err;
146 if (--max == 0) goto err;
152 if (--max == 0) goto err;
158 if (--max == 0) goto err;
162 if (!asn1_get_length(&p,&inf,plength,(int)max)) goto err;
187 static int asn1_get_length(const unsigned char **pp, int *inf, long *rl, int max) argument
193 if (max
[all...]
/external/boringssl/src/crypto/bn/
H A Dbn.c232 const int max = bn->top - 1; local
238 return max*BN_BITS2 + BN_num_bits_word(bn->d[max]);
H A Dmontgomery.c334 int nl, max, i;
343 max = (2 * nl); /* carry is stored separately */
344 if (bn_wexpand(r, max) == NULL) {
353 if (max > r->top) {
354 memset(&rp[r->top], 0, (max - r->top) * sizeof(BN_ULONG));
357 r->top = max;
422 int nl,max,i; local
428 max=(2*nl); /* carry is stored separately */
429 if (bn_wexpand(r,max) == NULL) return(0);
437 for (i=r->top; i<max;
[all...]
H A Dmul.c681 int i, j, max; local
685 max = n * 2;
688 rp[0] = rp[max - 1] = 0;
705 bn_add_words(r, r, r, max);
711 bn_add_words(r, r, tmp, max);
820 int max, al; local
838 max = 2 * al; /* Non-zero (from above) */
839 if (bn_wexpand(rr, max) == NULL) {
863 if (bn_wexpand(tmp, max) == NULL) {
873 * the square of 'a' will max
[all...]
/external/boringssl/src/ssl/
H A Ds3_pkt.c226 /* max contains the maximum number of bytes that we can put into a
228 unsigned max = ssl->max_send_fragment; local
229 if (n > max) {
230 nw = max;
/external/chromium-trace/catapult/firefighter/default/tracing/third_party/gl-matrix/src/gl-matrix/
H A Dvec2.js191 vec2.max = function(out, a, b) {
192 out[0] = Math.max(a[0], b[0]);
193 out[1] = Math.max(a[1], b[1]);
H A Dvec4.js215 vec4.max = function(out, a, b) {
216 out[0] = Math.max(a[0], b[0]);
217 out[1] = Math.max(a[1], b[1]);
218 out[2] = Math.max(a[2], b[2]);
219 out[3] = Math.max(a[3], b[3]);
/external/chromium-trace/catapult/tracing/third_party/gl-matrix/src/gl-matrix/
H A Dvec2.js191 vec2.max = function(out, a, b) {
192 out[0] = Math.max(a[0], b[0]);
193 out[1] = Math.max(a[1], b[1]);
H A Dvec4.js215 vec4.max = function(out, a, b) {
216 out[0] = Math.max(a[0], b[0]);
217 out[1] = Math.max(a[1], b[1]);
218 out[2] = Math.max(a[2], b[2]);
219 out[3] = Math.max(a[3], b[3]);
/external/clang/test/Analysis/
H A Dadditive-folding-range-constraints.c165 int max = INT_MAX; local
167 clang_analyzer_eval((a + 2) <= (max - 5LL)); // expected-warning{{TRUE}}
176 unsigned max = UINT_MAX; local
177 clang_analyzer_eval(a < max); // expected-warning{{UNKNOWN}}
178 clang_analyzer_eval((a + 2) < max); // expected-warning{{UNKNOWN}}
179 clang_analyzer_eval((a + 2U) < max); // expected-warning{{UNKNOWN}}
183 unsigned max = UINT_MAX; local
184 clang_analyzer_eval(a <= max); // expected-warning{{TRUE}}
185 clang_analyzer_eval((a + 2) <= max); // expected-warning{{TRUE}}
186 clang_analyzer_eval((a + 2U) <= max); // expecte
190 int max = INT_MAX; local
197 int max = INT_MAX; local
260 unsigned max = INT_MAX; local
267 unsigned max = INT_MAX; local
288 unsigned max = INT_MAX; local
[all...]
/external/clang/test/SemaCXX/
H A Dcompare.cpp230 // A is max short plus 1. All zero and positive shorts are smaller than it.
231 // All negative shorts are cast towards the max unsigned range. Relation
242 // When negative one is converted to an unsigned value, it becomes the max
243 // unsigned. Likewise, a negative one short can also be converted to max
360 template<class T> T max();
362 template<> constexpr int max<int>() { return 2147483647; }; function in namespace:templates
366 const T vmax = max<T>();
374 return num < max<int>(); // expected-warning{{comparison of constant 2147483647 with expression of type 'short' is always true}}

Completed in 740 milliseconds

<<11121314151617181920>>