| /external/libcxx/test/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 | 49 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local
50 const int N = sizeof(rng)/sizeof(rng[0]);
53 C c = make<C>(size, rng[j]);
66 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
67 const int N = sizeof(rng)/sizeof(rng[0]);
69 test<std::deque<MoveOnly> >(rng[j]);
73 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local
74 const int N = sizeof(rng)/sizeof(rng[0])
[all...] |
| emplace_back.pass.cpp | 71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
72 const int N = sizeof(rng)/sizeof(rng[0]);
75 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
80 const int N = sizeof(rng)/sizeof(rng[0]);
83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j])
[all...] |
| emplace_front.pass.cpp | 71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
72 const int N = sizeof(rng)/sizeof(rng[0]);
75 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
80 const int N = sizeof(rng)/sizeof(rng[0]);
83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j])
[all...] |
| pop_back.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...] |
| pop_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.pass.cpp | 68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
69 const int N = sizeof(rng)/sizeof(rng[0]);
72 testN<std::deque<int> >(rng[i], rng[j]);
76 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
77 const int N = sizeof(rng)/sizeof(rng[0]);
80 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]);
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<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j])
[all...] |
| emplace.pass.cpp | 96 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
97 const int N = sizeof(rng)/sizeof(rng[0]);
100 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
104 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
105 const int N = sizeof(rng)/sizeof(rng[0]);
108 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j])
[all...] |
| erase_iter.pass.cpp | 75 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
76 const int N = sizeof(rng)/sizeof(rng[0]);
79 testN<std::deque<int> >(rng[i], rng[j]);
83 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
84 const int N = sizeof(rng)/sizeof(rng[0]);
87 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| erase_iter_iter.pass.cpp | 79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
80 const int N = sizeof(rng)/sizeof(rng[0]);
83 testN<std::deque<int> >(rng[i], rng[j]);
87 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
88 const int N = sizeof(rng)/sizeof(rng[0]);
91 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| insert_rvalue.pass.cpp | 102 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
103 const int N = sizeof(rng)/sizeof(rng[0]);
106 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
110 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
111 const int N = sizeof(rng)/sizeof(rng[0]);
114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j])
[all...] |
| /external/chromium_org/net/quic/crypto/ |
| quic_random_test.cc | 19 QuicRandom* rng = QuicRandom::GetInstance(); local
20 rng->RandBytes(buf1, sizeof(buf1));
25 QuicRandom* rng = QuicRandom::GetInstance(); local
26 uint64 value1 = rng->RandUint64();
27 uint64 value2 = rng->RandUint64();
35 QuicRandom* rng = QuicRandom::GetInstance(); local
36 rng->Reseed(buf, sizeof(buf));
|
| /external/libcxx/test/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 | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
70 const int N = sizeof(rng)/sizeof(rng[0]);
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
79 const int N = sizeof(rng)/sizeof(rng[0]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k])
[all...] |
| resize_size_value.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]);
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
79 const int N = sizeof(rng)/sizeof(rng[0]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k])
[all...] |
| /external/chromium_org/v8/src/base/utils/ |
| random-number-generator-unittest.cc | 20 RandomNumberGenerator rng(GetParam());
22 int n = rng.NextInt(max);
30 RandomNumberGenerator rng(GetParam());
32 bool b = rng.NextBool();
39 RandomNumberGenerator rng(GetParam());
41 double d = rng.NextDouble();
|
| /external/libcxx/test/containers/sequences/deque/deque.cons/ |
| assign_size_value.pass.cpp | 68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
69 const int N = sizeof(rng)/sizeof(rng[0]);
73 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
78 const int N = sizeof(rng)/sizeof(rng[0]);
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k])
[all...] |
| assign_iter_iter.pass.cpp | 90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
91 const int N = sizeof(rng)/sizeof(rng[0]);
95 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
100 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
101 const int N = sizeof(rng)/sizeof(rng[0]);
105 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k])
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-random-number-generator.cc | 44 v8::base::RandomNumberGenerator& rng = local
46 CHECK_EQ(kRandomSeeds[n], rng.initial_seed());
|
| /external/libcxx/test/containers/sequences/deque/deque.special/ |
| 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[j])
[all...] |
| 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[j])
[all...] |
| 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[j])
[all...] |
| 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[j])
[all...] |
| swap.pass.cpp | 57 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
58 const int N = sizeof(rng)/sizeof(rng[0]);
62 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
91 const int N = sizeof(rng)/sizeof(rng[0]);
95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k])
[all...] |
