| /external/python/cpython2/Lib/test/ |
| test_random.py | 161 self.assertEqual(r.randrange(1000), value)
200 # Verify warnings are raised when randrange is too large for random()
203 self.assertRaises(UserWarning, self.gen.randrange, 2**60)
242 # The randrange routine should build-up the required number of bits
247 r = self.gen.randrange(span)
254 start = self.gen.randrange(2 ** (i-2))
255 stop = self.gen.randrange(2 ** i)
258 self.assertTrue(start <= self.gen.randrange(start, stop) < stop)
263 set([self.gen.randrange(start,stop) for i in xrange(100)]))
399 # The randrange routine should build-up the required number of bit
[all...] |
| test_strtod.py | 120 n, e = random.randrange(lower, upper, 2), k
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random.randrange(-400, 400)
226 intpart_len = random.randrange(5)
230 fracpart_len = random.randrange(5)
238 exponent_len = random.randrange(1, 4)
|
| test_long_future.py | 198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
207 a_bits = random.randrange(1000)
208 b_bits = random.randrange(1, 1000)
209 x = random.randrange(2**a_bits)
210 y = random.randrange(1, 2**b_bits)
|
| /external/python/cpython3/Lib/test/ |
| sortperf.py | 47 i = random.randrange(n)
100 i1 = random.randrange(n)
101 i2 = random.randrange(n)
112 L[random.randrange(n)] = random.random()
|
| test_strtod.py | 119 n, e = random.randrange(lower, upper, 2), k
153 bits = random.randrange(2047*2**52)
187 digits = n + random.randrange(-3*u, 3*u)
202 digits = base + random.randrange(-1000, 1000)
210 digits = random.randrange(dig10)
211 exponent = random.randrange(-400, 400)
225 intpart_len = random.randrange(5)
229 fracpart_len = random.randrange(5)
237 exponent_len = random.randrange(1, 4)
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| sortperf.py | 47 i = random.randrange(n)
100 i1 = random.randrange(n)
101 i2 = random.randrange(n)
112 L[random.randrange(n)] = random.random()
|
| test_random.py | 162 self.assertEqual(r.randrange(1000), value)
201 # Verify warnings are raised when randrange is too large for random()
204 self.assertRaises(UserWarning, self.gen.randrange, 2**60)
242 # The randrange routine should build-up the required number of bits
247 r = self.gen.randrange(span)
254 start = self.gen.randrange(2 ** i)
255 stop = self.gen.randrange(2 ** (i-2))
258 self.assertTrue(start <= self.gen.randrange(start, stop) < stop)
263 set([self.gen.randrange(start,stop) for i in xrange(100)]))
394 # The randrange routine should build-up the required number of bit
[all...] |
| test_strtod.py | 120 n, e = random.randrange(lower, upper, 2), k
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random.randrange(-400, 400)
226 intpart_len = random.randrange(5)
230 fracpart_len = random.randrange(5)
238 exponent_len = random.randrange(1, 4)
|
| test_long_future.py | 198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
207 a_bits = random.randrange(1000)
208 b_bits = random.randrange(1, 1000)
209 x = random.randrange(2**a_bits)
210 y = random.randrange(1, 2**b_bits)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| sortperf.py | 47 i = random.randrange(n)
100 i1 = random.randrange(n)
101 i2 = random.randrange(n)
112 L[random.randrange(n)] = random.random()
|
| test_random.py | 162 self.assertEqual(r.randrange(1000), value)
201 # Verify warnings are raised when randrange is too large for random()
204 self.assertRaises(UserWarning, self.gen.randrange, 2**60)
242 # The randrange routine should build-up the required number of bits
247 r = self.gen.randrange(span)
254 start = self.gen.randrange(2 ** i)
255 stop = self.gen.randrange(2 ** (i-2))
258 self.assertTrue(start <= self.gen.randrange(start, stop) < stop)
263 set([self.gen.randrange(start,stop) for i in xrange(100)]))
394 # The randrange routine should build-up the required number of bit
[all...] |
| test_strtod.py | 120 n, e = random.randrange(lower, upper, 2), k
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random.randrange(-400, 400)
226 intpart_len = random.randrange(5)
230 fracpart_len = random.randrange(5)
238 exponent_len = random.randrange(1, 4)
|
| test_long_future.py | 198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
207 a_bits = random.randrange(1000)
208 b_bits = random.randrange(1, 1000)
209 x = random.randrange(2**a_bits)
210 y = random.randrange(1, 2**b_bits)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| sortperf.py | 47 i = random.randrange(n)
100 i1 = random.randrange(n)
101 i2 = random.randrange(n)
112 L[random.randrange(n)] = random.random()
|
| test_random.py | 162 self.assertEqual(r.randrange(1000), value)
201 # Verify warnings are raised when randrange is too large for random()
204 self.assertRaises(UserWarning, self.gen.randrange, 2**60)
242 # The randrange routine should build-up the required number of bits
247 r = self.gen.randrange(span)
254 start = self.gen.randrange(2 ** i)
255 stop = self.gen.randrange(2 ** (i-2))
258 self.assertTrue(start <= self.gen.randrange(start, stop) < stop)
263 set([self.gen.randrange(start,stop) for i in xrange(100)]))
394 # The randrange routine should build-up the required number of bit
[all...] |
| test_strtod.py | 120 n, e = random.randrange(lower, upper, 2), k
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random.randrange(-400, 400)
226 intpart_len = random.randrange(5)
230 fracpart_len = random.randrange(5)
238 exponent_len = random.randrange(1, 4)
|
| test_long_future.py | 198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
207 a_bits = random.randrange(1000)
208 b_bits = random.randrange(1, 1000)
209 x = random.randrange(2**a_bits)
210 y = random.randrange(1, 2**b_bits)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| sortperf.py | 47 i = random.randrange(n)
100 i1 = random.randrange(n)
101 i2 = random.randrange(n)
112 L[random.randrange(n)] = random.random()
|
| test_random.py | 162 self.assertEqual(r.randrange(1000), value)
201 # Verify warnings are raised when randrange is too large for random()
204 self.assertRaises(UserWarning, self.gen.randrange, 2**60)
242 # The randrange routine should build-up the required number of bits
247 r = self.gen.randrange(span)
254 start = self.gen.randrange(2 ** i)
255 stop = self.gen.randrange(2 ** (i-2))
258 self.assertTrue(start <= self.gen.randrange(start, stop) < stop)
263 set([self.gen.randrange(start,stop) for i in xrange(100)]))
394 # The randrange routine should build-up the required number of bit
[all...] |
| test_strtod.py | 120 n, e = random.randrange(lower, upper, 2), k
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random.randrange(-400, 400)
226 intpart_len = random.randrange(5)
230 fracpart_len = random.randrange(5)
238 exponent_len = random.randrange(1, 4)
|
| test_long_future.py | 198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
207 a_bits = random.randrange(1000)
208 b_bits = random.randrange(1, 1000)
209 x = random.randrange(2**a_bits)
210 y = random.randrange(1, 2**b_bits)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_strtod.py | 120 n, e = random.randrange(lower, upper, 2), k
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random.randrange(-400, 400)
226 intpart_len = random.randrange(5)
230 fracpart_len = random.randrange(5)
238 exponent_len = random.randrange(1, 4)
|
| test_long_future.py | 198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
207 a_bits = random.randrange(1000)
208 b_bits = random.randrange(1, 1000)
209 x = random.randrange(2**a_bits)
210 y = random.randrange(1, 2**b_bits)
|
| /external/libvpx/libvpx/test/ |
| vp9_quantize_test.cc | 207 const int qlookup = rnd->RandRange(1825) + 4;
215 zbin[j] = rnd->RandRange(1200);
218 round[j] = rnd->RandRange(914);
220 quant[j] = static_cast<int>(rnd->RandRange(32704)) - 32703;
222 quant_shift[j] = rnd->RandRange(16384);
224 dequant[j] = rnd->RandRange(1828);
326 static_cast<int>(rnd.RandRange(max_value_ * 2)) - max_value_;
328 static_cast<int>(rnd.RandRange(max_value_ * 2)) - max_value_;
|
| /external/python/cpython3/Lib/turtledemo/ |
| forest.py | 15 from random import randrange
19 return randrange(-n,n+1)
|
