| /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.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/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| assign_size_value.pass.cpp | 66 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
67 const int N = sizeof(rng)/sizeof(rng[0]);
71 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
75 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
76 const int N = sizeof(rng)/sizeof(rng[0]);
80 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k])
[all...] |
| assign_iter_iter.pass.cpp | 85 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
86 const int N = sizeof(rng)/sizeof(rng[0]);
90 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
95 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
96 const int N = sizeof(rng)/sizeof(rng[0]);
100 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 | 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.pass.cpp | 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<Emplaceable> >(rng[i], rng[j]);
99 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
100 const int N = sizeof(rng)/sizeof(rng[0]);
103 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j])
[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...] |
| erase_iter_iter.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<int> >(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<int, min_allocator<int>> >(rng[i], rng[j])
[all...] |
| insert_rvalue.pass.cpp | 97 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
98 const int N = sizeof(rng)/sizeof(rng[0]);
101 testN<std::deque<MoveOnly> >(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<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j])
[all...] |
| insert_size_value.pass.cpp | 138 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
139 const int N = sizeof(rng)/sizeof(rng[0]);
143 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
148 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
149 const int N = sizeof(rng)/sizeof(rng[0]);
153 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k])
[all...] |
| insert_value.pass.cpp | 120 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
121 const int N = sizeof(rng)/sizeof(rng[0]);
124 testN<std::deque<int> >(rng[i], rng[j]);
129 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local
130 const int N = sizeof(rng)/sizeof(rng[0]);
133 testN<std::deque<int, min_allocator<int>> >(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...] |
| /external/opencv3/modules/imgproc/perf/ |
| perf_remap.cpp | 40 RNG rng; local
41 rng.fill(src, RNG::UNIFORM, 0, 256);
|
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| /external/libcxx/test/std/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...] |
