| /ndk/tests/device/test-gnustl-full/unit/ |
| H A D | deque_header_test.cpp | 8 #include <deque>
|
| H A D | finsert_test.cpp | 3 #include <deque>
34 deque<char const*> names;
35 front_insert_iterator<deque<char const*> > fit(names);
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
52 deque<char const*> names;
|
| H A D | insert_test.cpp | 1 #include <deque>
36 deque<char const*> names(array1, array1 + 3);
37 deque<char const*>::iterator i = names.begin() + 2;
39 insert_iterator<deque <char const*> > itd(names, i);
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i));
60 deque<char const*> names(array1, array1 + 3);
61 deque<char const*>::iterator i = names.begin() + 2;
|
| /ndk/tests/device/test-stlport/unit/ |
| H A D | deque_header_test.cpp | 8 #include <deque>
|
| H A D | finsert_test.cpp | 3 #include <deque>
34 deque<char const*> names;
35 front_insert_iterator<deque<char const*> > fit(names);
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
52 deque<char const*> names;
|
| H A D | insert_test.cpp | 1 #include <deque>
36 deque<char const*> names(array1, array1 + 3);
37 deque<char const*>::iterator i = names.begin() + 2;
39 insert_iterator<deque <char const*> > itd(names, i);
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i));
60 deque<char const*> names(array1, array1 + 3);
61 deque<char const*>::iterator i = names.begin() + 2;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/ |
| H A D | version.pass.cpp | 10 // <deque>
12 #include <deque>
|
| H A D | iterators.pass.cpp | 10 // <deque>
15 // class deque;
19 #include <deque>
28 typedef std::deque<int> C;
38 typedef std::deque<int, min_allocator<int>> C;
49 std::deque<int>::iterator ii1{}, ii2{};
50 std::deque<int>::iterator ii4 = ii1;
51 std::deque<int>::const_iterator cii{};
72 // std::deque<int> c;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| H A D | default_noexcept.pass.cpp | 10 // <deque>
12 // deque()
17 #include <deque>
34 typedef std::deque<MoveOnly> C;
38 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| H A D | move_assign_noexcept.pass.cpp | 10 // <deque>
12 // deque& operator=(deque&& c)
19 #include <deque>
36 typedef std::deque<MoveOnly> C;
40 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
44 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
48 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| H A D | move_noexcept.pass.cpp | 10 // <deque>
12 // deque(deque&&)
17 #include <deque>
34 typedef std::deque<MoveOnly> C;
38 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| H A D | assign_initializer_list.pass.cpp | 10 // <deque>
14 #include <deque>
23 std::deque<int> d;
33 std::deque<int, min_allocator<int>> d;
|
| H A D | default.pass.cpp | 10 // <deque>
12 // deque()
14 #include <deque>
25 std::deque<T, Allocator> d;
28 std::deque<T, Allocator> d1 = {};
|
| H A D | initializer_list.pass.cpp | 10 // <deque>
12 // deque(initializer_list<value_type> il);
14 #include <deque>
23 std::deque<int> d = {3, 4, 5, 6};
32 std::deque<int, min_allocator<int>> d = {3, 4, 5, 6};
|
| H A D | op_equal_initializer_list.pass.cpp | 10 // <deque>
12 // deque& operator=(initializer_list<value_type> il);
14 #include <deque>
23 std::deque<int> d;
33 std::deque<int, min_allocator<int>> d;
|
| H A D | copy.pass.cpp | 10 // <deque>
12 // deque(const deque&);
14 #include <deque>
32 test(std::deque<int>(ab, an));
35 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5));
36 std::deque<int, test_allocator<int> > v2 = v;
42 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5));
43 std::deque<int, other_allocator<int> > v2 = v;
52 test(std::deque<in
[all...] |
| H A D | op_equal.pass.cpp | 10 // <deque>
12 // deque& operator=(const deque& c);
14 #include <deque>
33 test(std::deque<int>(ab, an));
36 std::deque<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
37 std::deque<int, test_allocator<int> > l2(l, test_allocator<int>(3));
43 std::deque<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
44 std::deque<int, other_allocator<int> > l2(l, other_allocator<int>(3));
53 test(std::deque<in
[all...] |
| H A D | dtor_noexcept.pass.cpp | 10 // <deque>
12 // ~deque() // implied noexcept;
14 #include <deque>
36 typedef std::deque<MoveOnly> C;
40 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
44 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
48 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| H A D | initializer_list_alloc.pass.cpp | 10 // <deque>
12 // deque(initializer_list<value_type> il, const Allocator& a = allocator_type());
14 #include <deque>
24 std::deque<int, test_allocator<int>> d({3, 4, 5, 6}, test_allocator<int>(3));
34 std::deque<int, min_allocator<int>> d({3, 4, 5, 6}, min_allocator<int>());
|
| H A D | copy_alloc.pass.cpp | 10 // <deque>
12 // deque(const deque& c, const allocator_type& a);
14 #include <deque>
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)),
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()),
|
| H A D | alloc.pass.cpp | 10 // <deque>
12 // explicit deque(const allocator_type& a);
14 #include <deque>
25 std::deque<T, Allocator> d(a);
|
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| H A D | alias2.cpp | 47 class deque : protected _Deque_base class in inherits:_Deque_base
50 deque () {} function in class:deque
51 deque(const deque& __x) {} function in class:deque
52 ~deque() {
61 GeometryAddress(deque addressStack) {}
68 deque temp1;
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| H A D | alias2.cpp | 47 class deque : protected _Deque_base class in inherits:_Deque_base
50 deque () {} function in class:deque
51 deque(const deque& __x) {} function in class:deque
52 ~deque() {
61 GeometryAddress(deque addressStack) {}
68 deque temp1;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| H A D | swap_noexcept.pass.cpp | 10 // <deque>
12 // void swap(deque& c)
18 #include <deque>
40 typedef std::deque<MoveOnly> C;
45 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
50 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
55 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| H A D | access.pass.cpp | 10 // <deque>
24 #include <deque>
54 std::deque<int> c = make<std::deque<int> >(10);
63 const std::deque<int> c = make<std::deque<int> >(10);
73 std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
82 const std::deque<int, min_allocator<int>> c = make<std::deque<in
[all...] |