| /libcore/benchmarks/src/benchmarks/regression/ |
| RandomBenchmark.java | 25 Random rng = new Random(); local
26 rng.nextInt();
31 Random rng = new Random(); local
33 rng.nextInt();
38 SecureRandom rng = new SecureRandom(); local
40 rng.nextInt();
46 SecureRandom rng = new SecureRandom(); local
47 rng.nextInt();
|
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| push_back.pass.cpp | 46 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local
47 const int N = sizeof(rng)/sizeof(rng[0]);
50 C c = make<C>(size, rng[j]);
60 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
61 const int N = sizeof(rng)/sizeof(rng[0]);
63 test<std::deque<int> >(rng[j]);
67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
68 const int N = sizeof(rng)/sizeof(rng[0])
[all...] |
| push_back_rvalue.pass.cpp | 50 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local
51 const int N = sizeof(rng)/sizeof(rng[0]);
54 C c = make<C>(size, rng[j]);
65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
66 const int N = sizeof(rng)/sizeof(rng[0]);
68 test<std::deque<MoveOnly> >(rng[j]);
71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
72 const int N = sizeof(rng)/sizeof(rng[0])
[all...] |
| pop_back.pass.cpp | 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
71 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN<std::deque<int> >(rng[i], rng[j]);
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
79 const int N = sizeof(rng)/sizeof(rng[0]);
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| pop_front.pass.cpp | 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
71 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN<std::deque<int> >(rng[i], rng[j]);
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
79 const int N = sizeof(rng)/sizeof(rng[0]);
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| push_front.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
70 const int N = sizeof(rng)/sizeof(rng[0]);
73 testN<std::deque<int> >(rng[i], rng[j]);
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
78 const int N = sizeof(rng)/sizeof(rng[0]);
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| push_front_rvalue.pass.cpp | 74 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
75 const int N = sizeof(rng)/sizeof(rng[0]);
78 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
82 const int N = sizeof(rng)/sizeof(rng[0]);
85 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j])
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
| push_back.pass.cpp | 46 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local
47 const int N = sizeof(rng)/sizeof(rng[0]);
50 C c = make<C>(size, rng[j]);
60 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
61 const int N = sizeof(rng)/sizeof(rng[0]);
63 test<std::deque<int> >(rng[j]);
67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
68 const int N = sizeof(rng)/sizeof(rng[0])
[all...] |
| push_back_rvalue.pass.cpp | 50 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local
51 const int N = sizeof(rng)/sizeof(rng[0]);
54 C c = make<C>(size, rng[j]);
65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
66 const int N = sizeof(rng)/sizeof(rng[0]);
68 test<std::deque<MoveOnly> >(rng[j]);
71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
72 const int N = sizeof(rng)/sizeof(rng[0])
[all...] |
| pop_back.pass.cpp | 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
71 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN<std::deque<int> >(rng[i], rng[j]);
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
79 const int N = sizeof(rng)/sizeof(rng[0]);
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| pop_front.pass.cpp | 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
71 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN<std::deque<int> >(rng[i], rng[j]);
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
79 const int N = sizeof(rng)/sizeof(rng[0]);
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| push_front.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
70 const int N = sizeof(rng)/sizeof(rng[0]);
73 testN<std::deque<int> >(rng[i], rng[j]);
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
78 const int N = sizeof(rng)/sizeof(rng[0]);
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| push_front_rvalue.pass.cpp | 74 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
75 const int N = sizeof(rng)/sizeof(rng[0]);
78 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
82 const int N = sizeof(rng)/sizeof(rng[0]);
85 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j])
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| shrink_to_fit.pass.cpp | 62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
63 const int N = sizeof(rng)/sizeof(rng[0]);
66 testN<std::deque<int> >(rng[i], rng[j]);
70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
71 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| resize_size.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
73 const int N = sizeof(rng)/sizeof(rng[0]);
77 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
82 const int N = sizeof(rng)/sizeof(rng[0]);
86 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k])
[all...] |
| resize_size_value.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
73 const int N = sizeof(rng)/sizeof(rng[0]);
77 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
82 const int N = sizeof(rng)/sizeof(rng[0]);
86 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k])
[all...] |
| /prebuilts/go/darwin-x86/src/math/rand/ |
| rng.go | 189 // seed rng x[n+1] = 48271 * x[n] mod (2**31 - 1)
201 func (rng *rngSource) Seed(seed int64) {
202 rng.tap = 0
203 rng.feed = _LEN - _TAP
224 rng.vec[i] = u
230 func (rng *rngSource) Int63() int64 {
231 return int64(rng.Uint64() & _MASK)
235 func (rng *rngSource) Uint64() uint64 {
236 rng.tap--
237 if rng.tap < 0
[all...] |
| /prebuilts/go/linux-x86/src/math/rand/ |
| rng.go | 189 // seed rng x[n+1] = 48271 * x[n] mod (2**31 - 1)
201 func (rng *rngSource) Seed(seed int64) {
202 rng.tap = 0
203 rng.feed = _LEN - _TAP
224 rng.vec[i] = u
230 func (rng *rngSource) Int63() int64 {
231 return int64(rng.Uint64() & _MASK)
235 func (rng *rngSource) Uint64() uint64 {
236 rng.tap--
237 if rng.tap < 0
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.capacity/ |
| shrink_to_fit.pass.cpp | 62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
63 const int N = sizeof(rng)/sizeof(rng[0]);
66 testN<std::deque<int> >(rng[i], rng[j]);
70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
71 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| resize_size.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
73 const int N = sizeof(rng)/sizeof(rng[0]);
77 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
82 const int N = sizeof(rng)/sizeof(rng[0]);
86 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k])
[all...] |
| resize_size_value.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
73 const int N = sizeof(rng)/sizeof(rng[0]);
77 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
82 const int N = sizeof(rng)/sizeof(rng[0]);
86 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k])
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| assign_size_value.pass.cpp | 67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
68 const int N = sizeof(rng)/sizeof(rng[0]);
72 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
76 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
77 const int N = sizeof(rng)/sizeof(rng[0]);
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k])
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
| assign_size_value.pass.cpp | 67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
68 const int N = sizeof(rng)/sizeof(rng[0]);
72 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
76 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
77 const int N = sizeof(rng)/sizeof(rng[0]);
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k])
[all...] |
| /external/tensorflow/tensorflow/core/lib/random/ |
| random.cc | 35 static std::mt19937_64* rng = InitRngWithRandomSeed(); local
38 return (*rng)();
42 static std::mt19937_64 rng = InitRngWithDefaultSeed(); local
45 return rng();
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/utils/ |
| random.h | 25 inline int32 PoissonBootstrap(random::SimplePhilox* rng) {
29 for (float r = 1; r > lbound; r *= rng->RandFloat()) {
|
