Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:randrange (Results 1 - 25 of 64) sorted by null

1 2 3

/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/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)
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_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)
test_mutants.py	63 newkey = Horrid(random.randrange(100)) 66 target[newkey] = Horrid(random.randrange(100)) 73 i = random.randrange(len(keys)) 91 self.hashcode = random.randrange(1000000000) 157 test_one(random.randrange(1, 100))
test_heapq.py	75 data = [random.randrange(2000) for i in range(1000)] 98 data = [random.randrange(2000) for i in range(1000)] 111 data = [random.randrange(2000) for i in range(1000)] 141 size = random.randrange(50) 142 data = [random.randrange(25) for i in range(size)] 155 for i in xrange(random.randrange(5)): 156 row = sorted(random.randrange(1000) for j in range(random.randrange(10))) 166 stream = random.randrange(4) 167 x = random.randrange(500     [all...]
test_threaded_import.py	6 # randrange, and then Python hangs. 18 x = random.randrange(1, 3)
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_sort.py	119 s = [Stable(random.randrange(10), i) for i in xrange(n)] 186 data = [(random.randrange(100), i) for i in xrange(200)] 259 data = [(random.randrange(100), i) for i in xrange(200)]
test_bisect.py	177 from random import randrange namespace 179 data = [randrange(0, n, 2) for j in xrange(i)] 181 elem = randrange(-1, n+1)
test_struct.py	251 from random import randrange namespace 262 val = (val << 8) | randrange(256) 318 randrange)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/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)
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_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)
test_mutants.py	63 newkey = Horrid(random.randrange(100)) 66 target[newkey] = Horrid(random.randrange(100)) 73 i = random.randrange(len(keys)) 91 self.hashcode = random.randrange(1000000000) 157 test_one(random.randrange(1, 100))
test_heapq.py	75 data = [random.randrange(2000) for i in range(1000)] 98 data = [random.randrange(2000) for i in range(1000)] 111 data = [random.randrange(2000) for i in range(1000)] 141 size = random.randrange(50) 142 data = [random.randrange(25) for i in range(size)] 155 for i in xrange(random.randrange(5)): 156 row = sorted(random.randrange(1000) for j in range(random.randrange(10))) 166 stream = random.randrange(4) 167 x = random.randrange(500     [all...]
test_threaded_import.py	6 # randrange, and then Python hangs. 18 x = random.randrange(1, 3)
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_sort.py	119 s = [Stable(random.randrange(10), i) for i in xrange(n)] 186 data = [(random.randrange(100), i) for i in xrange(200)] 259 data = [(random.randrange(100), i) for i in xrange(200)]
test_bisect.py	177 from random import randrange namespace 179 data = [randrange(0, n, 2) for j in xrange(i)] 181 elem = randrange(-1, n+1)
test_struct.py	251 from random import randrange namespace 262 val = (val << 8) | randrange(256) 318 randrange)
/external/chromium_org/third_party/jinja2/
utils.py	233 from random import choice, randrange namespace 245 for idx, _ in enumerate(range(randrange(min, max))): 255 if idx - randrange(3, 8) > last_comma: 260 if idx - randrange(10, 20) > last_fullstop:
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
uuid.py	457 return random.randrange(0, 1<<48L) | 0x010000000000L 514 clock_seq = random.randrange(1<<14L) # instead of stable storage 546 bytes = [chr(random.randrange(256)) for i in range(16)]
random.py	52 "randrange","shuffle","normalvariate","lognormvariate", 84 Optionally, implement a getrandbits() method so that randrange() can cover 173 def randrange(self, start, stop=None, step=1, int=int, default=None, member in class:Random 186 raise ValueError, "non-integer arg 1 for randrange()" 192 raise ValueError, "empty range for randrange()" 197 raise ValueError, "non-integer stop for randrange()" 209 # can return a long, and then randrange() would also return 217 raise ValueError, "empty range for randrange() (%d,%d, %d)" % (istart, istop, width) 222 raise ValueError, "non-integer step for randrange()" 228 raise ValueError, "zero step for randrange()" 886 randrange = _inst.randrange variable     [all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/
uuid.py	457 return random.randrange(0, 1<<48L) | 0x010000000000L 514 clock_seq = random.randrange(1<<14L) # instead of stable storage 546 bytes = [chr(random.randrange(256)) for i in range(16)]
random.py	52 "randrange","shuffle","normalvariate","lognormvariate", 84 Optionally, implement a getrandbits() method so that randrange() can cover 173 def randrange(self, start, stop=None, step=1, int=int, default=None, member in class:Random 186 raise ValueError, "non-integer arg 1 for randrange()" 192 raise ValueError, "empty range for randrange()" 197 raise ValueError, "non-integer stop for randrange()" 209 # can return a long, and then randrange() would also return 217 raise ValueError, "empty range for randrange() (%d,%d, %d)" % (istart, istop, width) 222 raise ValueError, "non-integer step for randrange()" 228 raise ValueError, "zero step for randrange()" 886 randrange = _inst.randrange variable     [all...]

Completed in 963 milliseconds

1 2 3