Searched defs:random (Results 276 - 300 of 806) sorted by relevance

<<11121314151617181920>>

/prebuilts/ndk/r11/platforms/android-9/arch-x86/usr/include/linux/netfilter/
H A Dxt_statistic.h33 } random; member in union:xt_statistic_info::__anon175342
/prebuilts/ndk/r11/platforms/android-9/arch-x86_64/usr/include/linux/netfilter/
H A Dxt_statistic.h44 } random; member in union:xt_statistic_info::__anon176015
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/android/
H A Dexecutors.py2 import random namespace
22 # Just use a random number generator and hope for no collisions. Should
24 test_dir_name = 'test.{}'.format(random.randrange(2 ** 64))
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
H A Dtest_long_future.py7 import random namespace
192 # largeish random divisions: a/b where |a| <= |b| <=
198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
205 # and some (genuinely) random tests
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)
H A Dtest_poll.py3 import os, select, random, unittest namespace
53 wr = random.choice(ready_writers)
60 rd = random.choice(ready_readers)
H A Dtest_strtod.py4 import random namespace
117 # Select a random odd n in [2**53/5**k,
120 n, e = random.randrange(lower, upper, 2), k
153 # bit pattern for a random finite positive (or +0.0) float
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
198 # to boundary_tests, except that the random error doesn't scale
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random
[all...]
H A Dtest_threaded_import.py5 # complains several times about module random having no attribute
17 import random namespace
18 x = random.randrange(1, 3)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
H A Dtest_long_future.py7 import random namespace
192 # largeish random divisions: a/b where |a| <= |b| <=
198 a = random.randrange(1, M)
199 b = random.randrange(a, 2*a+1)
205 # and some (genuinely) random tests
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)
H A Dtest_poll.py3 import os, select, random, unittest namespace
53 wr = random.choice(ready_writers)
60 rd = random.choice(ready_readers)
H A Dtest_strtod.py4 import random namespace
117 # Select a random odd n in [2**53/5**k,
120 n, e = random.randrange(lower, upper, 2), k
153 # bit pattern for a random finite positive (or +0.0) float
154 bits = random.randrange(2047*2**52)
188 digits = n + random.randrange(-3*u, 3*u)
198 # to boundary_tests, except that the random error doesn't scale
203 digits = base + random.randrange(-1000, 1000)
211 digits = random.randrange(dig10)
212 exponent = random
[all...]
H A Dtest_threaded_import.py5 # complains several times about module random having no attribute
17 import random namespace
18 x = random.randrange(1, 3)
/prebuilts/gdb/darwin-x86/lib/python2.7/test/
H A Dtest_capi.py7 import random namespace
28 time.sleep(random.random()*0.02) #0.01 secs on average
H A Dtest_dumbdbm.py141 import random namespace
146 k = random.choice('abcdefghijklm')
147 if random.random() < 0.2:
152 v = random.choice('abc') * random.randrange(10000)
H A Dtest_mutants.py2 import random namespace
24 # generating dicts of various sizes at random, and performing random
25 # mutations on them at random times. This proved very effective,
35 # lists to make it easy to pick a dict key at random.
44 # dict, it picks one of {dict1, dict2} at random, and deletes a random
45 # entry from it; or, more rarely, adds a random element.
51 if random.random() < 0.
[all...]
/prebuilts/gdb/linux-x86/lib/python2.7/test/
H A Dtest_capi.py7 import random namespace
28 time.sleep(random.random()*0.02) #0.01 secs on average
H A Dtest_dumbdbm.py141 import random namespace
146 k = random.choice('abcdefghijklm')
147 if random.random() < 0.2:
152 v = random.choice('abc') * random.randrange(10000)
H A Dtest_mutants.py2 import random namespace
24 # generating dicts of various sizes at random, and performing random
25 # mutations on them at random times. This proved very effective,
35 # lists to make it easy to pick a dict key at random.
44 # dict, it picks one of {dict1, dict2} at random, and deletes a random
45 # entry from it; or, more rarely, adds a random element.
51 if random.random() < 0.
[all...]
/prebuilts/ndk/r10/platforms/android-10/arch-arm/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function
/prebuilts/ndk/r10/platforms/android-10/arch-mips/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function
/prebuilts/ndk/r10/platforms/android-10/arch-x86/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function
/prebuilts/ndk/r10/platforms/android-11/arch-arm/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function
/prebuilts/ndk/r10/platforms/android-11/arch-mips/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function
/prebuilts/ndk/r10/platforms/android-11/arch-x86/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function
/prebuilts/ndk/r10/platforms/android-12/arch-arm/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function
/prebuilts/ndk/r10/platforms/android-12/arch-mips/usr/include/
H A Dstdlib.h126 static __inline__ long random(void) function

Completed in 509 milliseconds

<<11121314151617181920>>