| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| D | push_back.pass.cpp | 46 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; in test() local
47 const int N = sizeof(rng)/sizeof(rng[0]); in test()
50 C c = make<C>(size, rng[j]); in test()
60 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
61 const int N = sizeof(rng)/sizeof(rng[0]); in main()
63 test<std::deque<int> >(rng[j]); in main()
67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
68 const int N = sizeof(rng)/sizeof(rng[0]); in main()
70 test<std::deque<int, min_allocator<int>> >(rng[j]); in main()
|
| D | push_back_rvalue.pass.cpp | 49 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; in test() local
50 const int N = sizeof(rng)/sizeof(rng[0]); in test()
53 C c = make<C>(size, rng[j]); in test()
66 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
67 const int N = sizeof(rng)/sizeof(rng[0]); in main()
69 test<std::deque<MoveOnly> >(rng[j]); in main()
73 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
74 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 test<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[j]); in main()
|
| D | emplace_back.pass.cpp | 71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
72 const int N = sizeof(rng)/sizeof(rng[0]); in main()
75 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
80 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| D | pop_back.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
73 testN<std::deque<int> >(rng[i], rng[j]); in main()
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
78 const int N = sizeof(rng)/sizeof(rng[0]); in main()
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | emplace_front.pass.cpp | 71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
72 const int N = sizeof(rng)/sizeof(rng[0]); in main()
75 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
80 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| D | pop_front.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
73 testN<std::deque<int> >(rng[i], rng[j]); in main()
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
78 const int N = sizeof(rng)/sizeof(rng[0]); in main()
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | push_front.pass.cpp | 68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
69 const int N = sizeof(rng)/sizeof(rng[0]); in main()
72 testN<std::deque<int> >(rng[i], rng[j]); in main()
76 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
77 const int N = sizeof(rng)/sizeof(rng[0]); in main()
80 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | push_front_rvalue.pass.cpp | 74 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
75 const int N = sizeof(rng)/sizeof(rng[0]); in main()
78 testN<std::deque<MoveOnly> >(rng[i], rng[j]); in main()
82 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
83 const int N = sizeof(rng)/sizeof(rng[0]); in main()
86 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); in main()
|
| D | erase_iter.pass.cpp | 75 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
76 const int N = sizeof(rng)/sizeof(rng[0]); in main()
79 testN<std::deque<int> >(rng[i], rng[j]); in main()
83 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
84 const int N = sizeof(rng)/sizeof(rng[0]); in main()
87 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | erase_iter_iter.pass.cpp | 79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
80 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<int> >(rng[i], rng[j]); in main()
87 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
88 const int N = sizeof(rng)/sizeof(rng[0]); in main()
91 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | emplace.pass.cpp | 96 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
97 const int N = sizeof(rng)/sizeof(rng[0]); in main()
100 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
104 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
105 const int N = sizeof(rng)/sizeof(rng[0]); in main()
108 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| D | insert_rvalue.pass.cpp | 102 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
103 const int N = sizeof(rng)/sizeof(rng[0]); in main()
106 testN<std::deque<MoveOnly> >(rng[i], rng[j]); in main()
110 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
111 const int N = sizeof(rng)/sizeof(rng[0]); in main()
114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); in main()
|
| D | insert_size_value.pass.cpp | 138 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
139 const int N = sizeof(rng)/sizeof(rng[0]); in main()
143 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
148 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
149 const int N = sizeof(rng)/sizeof(rng[0]); in main()
153 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| D | insert_value.pass.cpp | 122 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
123 const int N = sizeof(rng)/sizeof(rng[0]); in main()
126 testN<std::deque<int> >(rng[i], rng[j]); in main()
131 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
132 const int N = sizeof(rng)/sizeof(rng[0]); in main()
135 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| D | shrink_to_fit.pass.cpp | 62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
63 const int N = sizeof(rng)/sizeof(rng[0]); in main()
66 testN<std::deque<int> >(rng[i], rng[j]); in main()
70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
71 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | resize_size.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
79 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
|
| D | resize_size_value.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
79 const int N = sizeof(rng)/sizeof(rng[0]); in main()
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| D | assign_size_value.pass.cpp | 68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
69 const int N = sizeof(rng)/sizeof(rng[0]); in main()
73 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
78 const int N = sizeof(rng)/sizeof(rng[0]); in main()
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| D | assign_iter_iter.pass.cpp | 90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
91 const int N = sizeof(rng)/sizeof(rng[0]); in main()
95 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
100 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
101 const int N = sizeof(rng)/sizeof(rng[0]); in main()
105 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/ |
| D | size.hpp | 30 range_calculate_size(const SinglePassRange& rng) in range_calculate_size() argument
32 BOOST_ASSERT( (boost::end(rng) - boost::begin(rng)) >= 0 && in range_calculate_size()
34 return boost::end(rng) - boost::begin(rng); in range_calculate_size()
40 size(const SinglePassRange& rng) in size() argument
47 return range_calculate_size(rng); in size()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| D | move.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 testN<std::deque<int> >(rng[i], rng[j]); in main()
80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
81 const int N = sizeof(rng)/sizeof(rng[0]); in main()
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | move_backward.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 testN<std::deque<int> >(rng[i], rng[j]); in main()
80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
81 const int N = sizeof(rng)/sizeof(rng[0]); in main()
84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]); in main()
|
| D | copy.pass.cpp | 73 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
74 const int N = sizeof(rng)/sizeof(rng[0]); in main()
77 testN<std::deque<int> >(rng[i], rng[j]); in main()
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
82 const int N = sizeof(rng)/sizeof(rng[0]); in main()
85 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | copy_backward.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
76 testN<std::deque<int> >(rng[i], rng[j]); in main()
80 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
81 const int N = sizeof(rng)/sizeof(rng[0]); in main()
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | swap.pass.cpp | 57 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
58 const int N = sizeof(rng)/sizeof(rng[0]); in main()
62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
91 const int N = sizeof(rng)/sizeof(rng[0]); in main()
95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|