| /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/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/bijectors/ |
| softmax_centered_test.py | 29 rng = np.random.RandomState(42) variable
102 y_1 = (1e-5 * rng.rand(5)).astype(np.float32)
103 y_2 = (1e1 * rng.rand(5)).astype(np.float32)
|
| /external/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/ |
| moving_stats_test.py | 30 rng = np.random.RandomState(0) variable
|
| sinh_arcsinh_test.py | 28 rng = np.random.RandomState(123) variable
35 scale = rng.rand(b) + 0.5
36 loc = rng.randn(b)
47 x = rng.randn(5, b)
72 feed_dict={loc: rng.rand(5),
73 scale: np.float64(rng.rand()), # Scalar
74 skewness: rng.rand(5)})
79 scale = rng.rand(b) + 0.5
80 loc = rng.randn(b)
92 x = rng.randn(5, b
[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/stream_executor/ |
| rng.cc | 16 #include "tensorflow/stream_executor/rng.h"
22 namespace rng { namespace in namespace:perftools::gputools
28 LOG(INFO) << "Insufficient RNG seed data specified: " << seed_bytes
35 LOG(INFO) << "Too much RNG seed data specified: " << seed_bytes
49 } // namespace rng
|
| rng.h | 32 namespace rng { namespace in namespace:perftools::gputools
35 // executor when the underlying platform has an RNG library implementation
37 // When a seed is not specified, the backing RNG will be initialized with the
78 // Specifies the seed used to initialize the RNG.
91 } // namespace rng
|
| /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...] |
| /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...] |
| /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...] |
| emplace.pass.cpp | 93 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
94 const int N = sizeof(rng)/sizeof(rng[0]);
97 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
100 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
101 const int N = sizeof(rng)/sizeof(rng[0]);
104 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j])
[all...] |
| emplace_back.pass.cpp | 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<Emplaceable> >(rng[i], rng[j]);
88 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
89 const int N = sizeof(rng)/sizeof(rng[0]);
92 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j])
[all...] |
| emplace_front.pass.cpp | 82 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
83 const int N = sizeof(rng)/sizeof(rng[0]);
86 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
89 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
90 const int N = sizeof(rng)/sizeof(rng[0]);
93 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j])
[all...] |
| erase_iter.pass.cpp | 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> >(rng[i], rng[j]);
86 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
87 const int N = sizeof(rng)/sizeof(rng[0]);
90 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| erase_iter_iter.pass.cpp | 84 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
85 const int N = sizeof(rng)/sizeof(rng[0]);
88 testN<std::deque<int> >(rng[i], rng[j]);
92 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
93 const int N = sizeof(rng)/sizeof(rng[0]);
96 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| insert_rvalue.pass.cpp | 98 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
99 const int N = sizeof(rng)/sizeof(rng[0]);
102 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
105 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
106 const int N = sizeof(rng)/sizeof(rng[0]);
109 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j])
[all...] |
| /external/tensorflow/tensorflow/compiler/tests/ |
| categorical_op_test.py | 80 def _testRngIsNotConstant(self, rng, dtype, output_dtype):
81 # Tests that 'rng' does not always return the same value.
84 x = rng(dtype, output_dtype)
99 def rng(dtype, output_dtype): function in function:CategoricalTest.testCategoricalIsNotConstant
105 self._testRngIsNotConstant(rng, dtype, output_dtype)
|
| random_ops_test.py | 35 def _testRngIsNotConstant(self, rng, dtype):
36 # Tests that 'rng' does not always return the same value.
39 x = rng(dtype)
54 def rng(dtype): function in function:RandomOpsTest.testRandomUniformIsNotConstant
59 self._testRngIsNotConstant(rng, dtype)
62 def rng(dtype): function in function:RandomOpsTest.testRandomNormalIsNotConstant
67 self._testRngIsNotConstant(rng, dtype)
|
| /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...] |
| /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...] |
| /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...] |
