| /libcore/benchmarks/src/benchmarks/regression/ |
| RandomBenchmark.java | 27 Random rng = new Random(); local
28 rng.nextInt();
33 Random rng = new Random(); local
35 rng.nextInt();
40 SecureRandom rng = new SecureRandom(); local
42 rng.nextInt();
48 SecureRandom rng = new SecureRandom(); local
49 rng.nextInt();
|
| /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...] |
| /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...] |
| 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...] |
| /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));
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/ |
| size.hpp | 30 range_calculate_size(const SinglePassRange& rng)
32 BOOST_ASSERT( (boost::end(rng) - boost::begin(rng)) >= 0 &&
34 return boost::end(rng) - boost::begin(rng);
40 size(const SinglePassRange& rng)
47 return range_calculate_size(rng);
|
| /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...] |
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| /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...] |
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
