/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | 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)/sizeo [all...] |
H A D | 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)/sizeo [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
H A D | 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[ [all...] |
H A D | assign_iter_iter.pass.cpp | 89 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 90 const int N = sizeof(rng)/sizeof(rng[0]); 94 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 99 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 100 const int N = sizeof(rng)/sizeof(rng[0]); 104 testN<std::deque<int, min_allocator<int>> >(rng[ [all...] |
/external/tensorflow/tensorflow/core/lib/random/ |
H A D | 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/ |
H A D | random.h | 25 inline int32 PoissonBootstrap(random::SimplePhilox* rng) { argument 29 for (float r = 1; r > lbound; r *= rng->RandFloat()) {
|
/external/tensorflow/tensorflow/contrib/learn/python/learn/estimators/ |
H A D | regression_test.py | 31 rng = np.random.RandomState(67) 35 x = rng.uniform(-1, 1, (n, n_weights)) 36 weights = 10 * rng.randn(n_weights) 38 y += rng.randn(len(x)) * 0.05 + rng.normal(bias, 0.01)
|
/external/libcxx/test/std/containers/sequences/deque/deque.special/ |
H A D | copy.pass.cpp | 73 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 74 const int N = sizeof(rng)/sizeof(rng[0]); 77 testN<std::deque<int> >(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<int, min_allocator<int>> >(rng[i], rng[ [all...] |
H A D | copy_backward.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]); 76 testN<std::deque<int> >(rng[i], rng[j]); 80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 81 const int N = sizeof(rng)/sizeof(rng[0]); 84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[ [all...] |
H A D | move.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]); 76 testN<std::deque<int> >(rng[i], rng[j]); 80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 81 const int N = sizeof(rng)/sizeof(rng[0]); 84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[ [all...] |
H A D | move_backward.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]); 76 testN<std::deque<int> >(rng[i], rng[j]); 80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 81 const int N = sizeof(rng)/sizeof(rng[0]); 84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[ [all...] |
/external/tensorflow/tensorflow/compiler/tests/ |
H A D | matrix_triangular_solve_op_test.py | 68 rng = np.random.RandomState(0) 69 a = np.tril(rng.randn(5, 5)) 70 b = rng.randn(5, 7) 75 rng = np.random.RandomState(0) 76 a = rng.randn(5, 5) # the `a` matrix is not lower-triangular 77 b = rng.randn(5, 7) 82 rng = np.random.RandomState(0) 83 a = np.tril(rng.randn(5, 5) + rng.randn(5, 5) * 1j) 84 b = rng [all...] |