/external/webkit/WebKitTools/DumpRenderTree/ |
H A D | DumpRenderTreePrefix.h | 36 // We want to use std::min and std::max 38 #define min min macro
|
H A D | config.h | 60 // We want to use std::min and std::max 63 #undef min macro 64 #define min min macro
|
/external/webkit/WebKit/win/ |
H A D | WebKitPrefix.h | 38 // We want to use std::min and std::max. 42 #ifndef min 43 #define min min macro
|
/external/iptables/include/linux/netfilter_ipv4/ |
H A D | ipt_length.h | 5 u_int16_t min, max; member in struct:ipt_length_info
|
/external/iptables/include/linux/netfilter_ipv6/ |
H A D | ip6t_length.h | 5 u_int16_t min, max; member in struct:ip6t_length_info
|
/external/kernel-headers/original/linux/netfilter/ |
H A D | xt_length.h | 5 u_int16_t min, max; member in struct:xt_length_info
|
/external/webkit/WebCore/page/chromium/ |
H A D | FrameChromium.cpp | 34 using std::min;
|
/external/v8/test/mjsunit/ |
H A D | math-min-max.js | 30 // Test Math.min(). 32 assertEquals(Infinity, Math.min()); 33 assertEquals(1, Math.min(1)); 34 assertEquals(1, Math.min(1, 2)); 35 assertEquals(1, Math.min(2, 1)); 36 assertEquals(1, Math.min(1, 2, 3)); 37 assertEquals(1, Math.min(3, 2, 1)); 38 assertEquals(1, Math.min(2, 3, 1)); 39 assertEquals(1.1, Math.min(1.1, 2.2, 3.3)); 40 assertEquals(1.1, Math.min(3. [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | sparse.c | 54 unsigned int *min = three; local 60 ret = *min; 61 *min += 1; 65 if (*five < *min) { 66 min = five; 69 if (*seven < *min) { 70 min = seven; 74 ret = *min; 75 *min *= mult;
|
/external/clearsilver/cs/ |
H A D | test_abs_max_min.cs | 11 min(5,10) = <?cs var:min(5, 10) ?> 12 min(-5,10) = <?cs var:min(-5, 10) ?> 13 min(-5,-10) = <?cs var:min(-5, -10) ?> 14 min(5,-10) = <?cs var:min(5, -10) ?> 25 min(<?cs var:x ?>, <?cs var:y ?>) = <?cs var:min( [all...] |
/external/webkit/JavaScriptCore/tests/mozilla/ecma/Math/ |
H A D | 15.8.2.12.js | 24 ECMA Section: 15.8.2.12 Math.min(x, y) 42 var TITLE = "Math.min(x, y)"; 54 array[item++] = new TestCase( SECTION, "Math.min.length", 2, Math.min.length ); 56 array[item++] = new TestCase( SECTION, "Math.min()", Infinity, Math.min() ); 57 array[item++] = new TestCase( SECTION, "Math.min(void 0, 1)", Number.NaN, Math.min( void 0, 1 ) ); 58 array[item++] = new TestCase( SECTION, "Math.min(void 0, void 0)", Number.NaN, Math.min( voi [all...] |
/external/chromium/base/ |
H A D | rand_util.h | 15 // Returns a random number between min and max (inclusive). Thread-safe. 16 int RandInt(int min, int max);
|
H A D | rand_util.cc | 16 int RandInt(int min, int max) { argument 17 DCHECK(min <= max); 19 uint64 range = static_cast<int64>(max) - min + 1; 21 int result = min + static_cast<int>(number % range); 22 DCHECK(result >= min && result <= max);
|
/external/webkit/JavaScriptCore/bytecode/ |
H A D | JumpTable.cpp | 37 if (value >= min && static_cast<uint32_t>(value - min) < branchOffsets.size()) { 38 int32_t offset = branchOffsets[value - min];
|
/external/webkit/JavaScriptCore/wrec/ |
H A D | Quantifier.h | 46 Quantifier(Type type = None, unsigned min = 0, unsigned max = Infinity) 48 , min(min) 51 ASSERT(min <= max); 56 unsigned min; member in struct:JSC::WREC::Quantifier
|
/external/skia/src/animator/ |
H A D | SkDisplayRandom.h | 25 #ifdef min 26 #undef min macro 43 SkScalar min; member in class:SkDisplayRandom
|
H A D | SkDisplayRandom.cpp | 31 SK_MEMBER(min, Float), 40 SkDisplayRandom::SkDisplayRandom() : blend(0), min(0), max(SK_Scalar1) { 47 SkDebugf("min=\"%g\" ", SkScalarToFloat(min)); 51 SkDebugf("min=\"%x\" ", min); 64 value->fOperand.fScalar = min + SkScalarMul(max - min, relativeT);
|
/external/webkit/WebCore/page/win/ |
H A D | FrameCairoWin.cpp | 33 using std::min;
|
/external/bouncycastle/src/main/java/org/bouncycastle/util/ |
H A D | BigIntegers.java | 38 * Return a random BigInteger not less than 'min' and not greater than 'max' 40 * @param min the least value that may be generated 43 * @return a random BigInteger value in the range [min,max] 46 BigInteger min, 50 int cmp = min.compareTo(max); 55 throw new IllegalArgumentException("'min' may not be greater than 'max'"); 58 return min; 61 if (min.bitLength() > max.bitLength() / 2) 63 return createRandomInRange(ZERO, max.subtract(min), random).add(min); 45 createRandomInRange( BigInteger min, BigInteger max, SecureRandom random) argument [all...] |
/external/quake/quake/src/QW/client/ |
H A D | buildnum.c | 41 int hr, min;
local 68 min = (buildTime[3] - '0') * 10 + (buildTime[4] - '0');
72 b += hr * 60 + min;
|
/external/skia/src/effects/ |
H A D | SkTableMaskFilter.cpp | 94 void SkTableMaskFilter::MakeClipTable(uint8_t table[256], uint8_t min, argument 99 if (min >= max) { 100 min = max - 1; 102 SkASSERT(min < max); 104 SkFixed scale = (1 << 16) * 255 / (max - min); 105 memset(table, 0, min + 1); 106 for (int i = min + 1; i < max; i++) { 107 int value = SkFixedRound(scale * (i - min)); 120 SkDebugf("%d %d start [%d]", min, max, j);
|
/external/dropbear/libtommath/ |
H A D | bn_s_mp_add.c | 23 int olduse, res, min, max; local 29 min = b->used; 33 min = a->used; 66 for (i = 0; i < min; i++) { 80 if (min != max) {
|
/external/freetype/src/psnames/ |
H A D | pstables.h | 4005 int count, min, max; local 4016 min = 0; 4019 while ( min < max ) 4021 int mid = ( min + max ) >> 1; 4035 min = mid + 1;
|
/external/stlport/test/unit/ |
H A D | min_test.cpp | 38 int r = min(42, 100); 41 r = min(--r, r); 46 const char* r = min((const char*)"shoe", (const char*)"shine", str_compare);
|
/external/guava/src/com/google/common/collect/ |
H A D | ReverseNaturalOrdering.java | 46 // Override the six 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(Iterable<E> iterable) { method in class:ReverseNaturalOrdering 61 return NaturalOrdering.INSTANCE.min(a, b); 65 return NaturalOrdering.INSTANCE.min(a, b, c, rest); 69 return NaturalOrdering.INSTANCE.min(iterable);
|