/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | BitSet.java | 158 int min = Math.min(bits.length, a.bits.length); 159 for (int i = min - 1; i >= 0; i--) { 163 for (int i = min; i < bits.length; i++) { 222 int n = Math.min(this.bits.length, otherSet.bits.length); 388 int min = Math.min(bits.length, a.bits.length); 389 for (int i = min - 1; i >= 0; i--) { 409 int n = Math.min(nwords, bits.length);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | Ordering.java | 670 public <E extends T> E min(Iterator<E> iterator) { method in class:Ordering 675 minSoFar = min(minSoFar, iterator.next()); 690 public <E extends T> E min(Iterable<E> iterable) { method in class:Ordering 691 return min(iterable.iterator()); 705 public <E extends T> E min( method in class:Ordering 707 E minSoFar = min(min(a, b), c); 710 minSoFar = min(minSoFar, r); 721 * implementations of the other {@code min} overloads, so overriding it will 729 public <E extends T> E min( method in class:Ordering [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/ |
H A D | BIHTree.java | 144 Vector3f min = vars.vect1.set(new Vector3f(Float.POSITIVE_INFINITY, Float.POSITIVE_INFINITY, Float.POSITIVE_INFINITY)); 153 BoundingBox.checkMinMax(min, max, v1); 154 BoundingBox.checkMinMax(min, max, v2); 155 BoundingBox.checkMinMax(min, max, v3); 158 BoundingBox bbox = new BoundingBox(min, max); 194 Vector3f min = bbox.getMin(null); 198 min.set(axis, value); 203 bbox.setMinMax(min, max); 418 tMax = Math.min(tMax, r.getLimit());
|
/external/llvm/lib/Support/ |
H A D | StringRef.cpp | 43 for (size_t I = 0, E = min(Length, RHS.Length); I != E; ++I) { 57 for (size_t I = 0, E = min(Length, RHS.Length); I != E; ++I) { 132 for (size_t e = Length - N + 1, i = min(From, e); i != e; ++i) 187 for (size_type i = min(From, Length), e = Length; i != e; ++i) 196 for (size_type i = min(From, Length), e = Length; i != e; ++i) 212 for (size_type i = min(From, Length), e = Length; i != e; ++i) 228 for (size_type i = min(From, Length) - 1, e = -1; i != e; --i) 237 for (size_type i = min(From, Length) - 1, e = -1; i != e; --i) 253 for (size_type i = min(From, Length) - 1, e = -1; i != e; --i)
|
/external/tcpdump/ |
H A D | print-aodv.c | 67 i = min(length, (u_int)(snapend - (u_char *)ep)); 93 i = min(length, (u_int)(snapend - dat)); 125 i = min(length, (u_int)(snapend - dat)); 156 i = min(length, (u_int)(snapend - dat)); 191 i = min(length, (u_int)(snapend - dat)); 231 i = min(length, (u_int)(snapend - dat)); 299 i = min(length, (u_int)(snapend - dat)); 340 i = min(length, (u_int)(snapend - dat)); 403 if (min(length, (u_int)(snapend - dat)) < sizeof(ap->rrep_ack)) {
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/ |
H A D | shell.js | 479 var min = Math.floor( t / msPerMinute ) % MinutesPerHour; 480 return( ( min < 0 ) ? MinutesPerHour + min : min ); 583 function MakeTime( hour, min, sec, ms ) { 584 if ( isNaN( hour ) || isNaN( min ) || isNaN( sec ) || isNaN( ms ) ) { 589 min = ToInteger( min); 593 return( (hour*msPerHour) + (min*msPerMinute) +
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/Date/ |
H A D | shell.js | 412 var min = Math.floor( t / msPerMinute )%MinutesPerHour; 413 return( (min < 0 ) ? MinutesPerHour + min : min ); 531 function MakeTime( hour, min, sec, ms ) 533 if ( isNaN(hour) || isNaN(min) || isNaN(sec) || isNaN(ms) ){return Number.NaN;} 536 min = ToInteger( min); 540 return( (hour*msPerHour) + (min*msPerMinute) + (sec*msPerSecond) + ms );
|
/external/webp/src/enc/ |
H A D | analysis.c | 125 int min = centers[0], max = centers[0]; local 130 if (min > centers[n]) min = centers[n]; 134 if (max == min) max = min + 1; 135 assert(mid <= max && mid >= min); 137 const int alpha = 255 * (centers[n] - mid) / (max - min); 138 const int beta = 255 * (centers[n] - min) / (max - min);
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | BitSet.java | 144 int min = Math.min(bits.length, a.bits.length); 145 for (int i = min - 1; i >= 0; i--) { 156 int n = Math.min(nwords, bits.length); 201 int n = Math.min(this.bits.length, otherSet.bits.length);
|
/external/iptables/extensions/ |
H A D | libip6t_rt.c | 150 print_nums(const char *name, uint32_t min, uint32_t max, argument 155 if (min != 0 || max != 0xFFFFFFFF || invert) { 157 if (min == max) { 159 printf("%u", min); 162 printf("%u",min);
|
H A D | libxt_u32.c | 78 if (ct->value[i].min == ct->value[i].max) 79 printf("0x%x", ct->value[i].min); 81 printf("0x%x:0x%x", ct->value[i].min, 225 ct->value[valind].min = 237 ct->value[valind].min;
|
H A D | libipt_ECN.c | 41 .min = 0, .max = 1, .excl = F_ECN_TCP_REMOVE}, 43 .min = 0, .max = 1, .excl = F_ECN_TCP_REMOVE}, 45 .min = 0, .max = 3},
|
/external/valgrind/tsan/ |
H A D | ts_replace.h | 148 REPORT_READ_RANGE(s1, min(i + 1, len)); 149 REPORT_READ_RANGE(s2, min(i + 1, len)); 184 REPORT_READ_RANGE(src, min(i + 1, n)); 223 REPORT_READ_RANGE(s1, min(i + 1, n)); 224 REPORT_READ_RANGE(s2, min(i + 1, n));
|
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | MathExtras.h | 212 const double minIntAsDouble = std::numeric_limits<int>::min(); 214 return static_cast<int>(std::max(std::min(d, maxIntAsDouble), minIntAsDouble)); 220 return static_cast<int>(std::max<double>(std::min(d, maxIntAsDouble), 0)); 226 static const int s_intMin = std::numeric_limits<int>::min(); 248 return static_cast<int>(std::min(value, static_cast<unsigned>(std::numeric_limits<int>::max())));
|
/external/webkit/Source/WebCore/platform/graphics/filters/ |
H A D | FEMorphology.cpp | 36 using std::min; 130 radiusX = min(effectDrawingRect.width() - 1, radiusX); 131 radiusY = min(effectDrawingRect.height() - 1, radiusY); 136 int endY = min(effectDrawingRect.height() - 1, y + radiusY); 153 unsigned endX = min(x + radiusX, effectDrawingRect.width() - 1);
|
/external/bluetooth/bluedroid/stack/btm/ |
H A D | btm_pm.c | 225 ((p_mode->mode & BTM_PM_MD_FORCE) && (p_mode->max >= p_cb->interval) && (p_mode->min <= p_cb->interval)) || 228 BTM_TRACE_DEBUG4( "BTM_SetPowerMode: mode:0x%x interval %d max:%d, min:%d", p_mode->mode, p_cb->interval, p_mode->max, p_mode->min); 486 /* min of the two */ 489 p_res->min = (p_md1->min > p_md2->min)? (p_md1->min) : (p_md2->min); 492 if( p_res->max < p_res->min) [all...] |
/external/chromium/sdch/open-vcdiff/src/ |
H A D | adler32.c | 89 void ZEXPORT adler32_range(min, max) 90 uLong *min; 93 *min = 0L;
|
/external/guava/guava-tests/test/com/google/common/io/ |
H A D | LineBufferTest.java | 74 chunk = Math.max(1, Math.min(chunk, input.length())); 93 int len = Math.min(chars.length, off + chunk) - off; 142 return super.read(cbuf, off, Math.min(chunk, len));
|
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
H A D | FluidSimHeightMap.java | 56 private float minInitialHeight = -500; // min initial height
224 private float randomRange(Random random, float min, float max) {
argument 225 return (random.nextFloat() * (max - min)) + min;
|
/external/libpcap/ |
H A D | pcap-dos.h | 78 #define min(a,b) _min(a,b) macro 82 #ifndef min 83 #define min(a,b) ((a) < (b) ? (a) : (b)) macro
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | HeuristicSolver.h | 252 PBQPNum min = eCosts[0][j] + xCosts[0]; local 255 if (c < min) 256 min = c; 258 yCosts[j] += min; 265 PBQPNum min = eCosts[i][0] + xCosts[0]; local 268 if (c < min) 269 min = c; 271 yCosts[i] += min; 319 PBQPNum min = (*yxeCosts)[i][0] + (*zxeCosts)[j][0] + xCosts[0]; local 322 if (c < min) { [all...] |
/external/qemu/ |
H A D | osdep.h | 85 # define QEMU_GNUC_PREREQ(maj, min) \ 86 ((__GNUC__ << 16) + __GNUC_MINOR__ >= ((maj) << 16) + (min)) 88 # define QEMU_GNUC_PREREQ(maj, min) 0
|
/external/skia/samplecode/ |
H A D | SampleCull.cpp | 99 static SkScalar nextScalarRange(SkRandom& rand, SkScalar min, SkScalar max) { argument 100 return min + SkScalarMul(rand.nextUScalar1(), max - min);
|
/external/tinyalsa/ |
H A D | tinymix.c | 125 int min, max; local 163 min = mixer_ctl_get_range_min(ctl); 165 printf(" (range %d->%d)", min, max);
|
/external/webkit/Source/WebCore/rendering/ |
H A D | RenderSlider.cpp | 45 using std::min; 92 m_maxPreferredLogicalWidth = min(m_maxPreferredLogicalWidth, computeContentBoxLogicalWidth(style()->maxWidth().value())); 93 m_minPreferredLogicalWidth = min(m_minPreferredLogicalWidth, computeContentBoxLogicalWidth(style()->maxWidth().value()));
|