| /external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| erase_iter_iter.pass.cpp | 10 // <deque>
14 #include <deque>
83 testN<std::deque<int> >(rng[i], rng[j]);
91 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| insert_rvalue.pass.cpp | 10 // <deque>
14 #include <deque>
106 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]);
|
| /external/libcxx/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
77 testN<std::deque<int> >(rng[i], rng[j]);
85 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| copy_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]);
|
| /external/stlport/test/eh/ |
| test_deque.cpp | 24 # include <deque>
27 # include <deque.h>
39 typedef EH_STD::deque<DQTestClass, eh_allocator(DQTestClass) > TestDeque;
|
| /external/stlport/test/unit/ |
| mvctor_test.cpp | 8 #include <deque>
150 standard_test1(deque<int>(10));
166 CheckFullMoveSupport(deque<int>());
178 deque<vector<int> > vect_deque;
208 deque<vector<int> > vect_deque;
237 deque<vector<int> > vect_deque;
239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end());
246 // This check, repeated after each operation, check the deque consistency:
247 deque<vector<int> >::iterator it = vect_deque.end() - 5;
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 10 // <deque>
14 #include <deque>
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
|
| resize_size_value.pass.cpp | 10 // <deque>
14 #include <deque>
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 10 // <deque>
14 #include <deque>
100 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
108 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]);
|
| erase_iter.pass.cpp | 10 // <deque>
14 #include <deque>
79 testN<std::deque<int> >(rng[i], rng[j]);
87 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| erase_iter_iter.pass.cpp | 10 // <deque>
14 #include <deque>
83 testN<std::deque<int> >(rng[i], rng[j]);
91 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| insert_rvalue.pass.cpp | 10 // <deque>
14 #include <deque>
106 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
77 testN<std::deque<int> >(rng[i], rng[j]);
85 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| copy_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| mvctor_test.cpp | 8 #include <deque>
150 standard_test1(deque<int>(10));
166 CheckFullMoveSupport(deque<int>());
178 deque<vector<int> > vect_deque;
208 deque<vector<int> > vect_deque;
237 deque<vector<int> > vect_deque;
239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end());
246 // This check, repeated after each operation, check the deque consistency:
247 deque<vector<int> >::iterator it = vect_deque.end() - 5;
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end())
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| mvctor_test.cpp | 8 #include <deque>
150 standard_test1(deque<int>(10));
166 CheckFullMoveSupport(deque<int>());
178 deque<vector<int> > vect_deque;
208 deque<vector<int> > vect_deque;
237 deque<vector<int> > vect_deque;
239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end());
246 // This check, repeated after each operation, check the deque consistency:
247 deque<vector<int> >::iterator it = vect_deque.end() - 5;
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end())
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_deque.h | 0 // Deque implementation -*- C++ -*-
83 * @brief A deque::iterator.
86 * deque is actually passed off to this class. A deque holds two
351 * Deque base class. This class provides the unified face for %deque's
357 * (Deque handles that itself.) Only/All memory management is performed
403 //This struct encapsulates the implementation of the std::deque
567 * In previous HP/SGI versions of deque, there was an extra template
572 * Here's how a deque<Tp> manages memory. Each deque has 4 members
638 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
690 deque() function in class:deque
698 deque(const allocator_type& __a) function in class:deque
710 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
722 deque(const deque& __x) function in class:deque
736 deque(deque&& __x) function in class:deque
750 deque(initializer_list<value_type> __l, function in class:deque
775 deque(_InputIterator __first, _InputIterator __last, function in class:deque
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/ |
| stl_deque.h | 0 // Deque implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{deque}
94 * @brief A deque::iterator.
97 * deque is actually passed off to this class. A deque holds two
428 * Deque base class. This class provides the unified face for %deque's
434 * (Deque handles that itself.) Only/All memory management is performed
484 //This struct encapsulates the implementation of the std::deque
648 * In previous HP/SGI versions of deque, there was an extra templat
719 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
771 deque() function in class:deque
779 deque(const allocator_type& __a) function in class:deque
791 deque(size_type __n) function in class:deque
803 deque(size_type __n, const value_type& __value, function in class:deque
817 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
830 deque(const deque& __x) function in class:deque
844 deque(deque&& __x) function in class:deque
858 deque(initializer_list<value_type> __l, function in class:deque
883 deque(_InputIterator __first, _InputIterator __last, function in class:deque
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_deque.h | 0 // Deque implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{deque}
95 * @brief A deque::iterator.
98 * deque is actually passed off to this class. A deque holds two
429 * Deque base class. This class provides the unified face for %deque's
435 * (Deque handles that itself.) Only/All memory management is performed
485 //This struct encapsulates the implementation of the std::deque
659 * In previous HP/SGI versions of deque, there was an extra templat
730 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
782 deque() function in class:deque
790 deque(const allocator_type& __a) function in class:deque
802 deque(size_type __n) function in class:deque
814 deque(size_type __n, const value_type& __value, function in class:deque
828 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
841 deque(const deque& __x) function in class:deque
855 deque(deque&& __x) function in class:deque
869 deque(initializer_list<value_type> __l, function in class:deque
896 deque(_InputIterator __first, _InputIterator __last, function in class:deque
902 deque(_InputIterator __first, _InputIterator __last, function in class:deque
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_deque.h | 0 // Deque implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{deque}
95 * @brief A deque::iterator.
98 * deque is actually passed off to this class. A deque holds two
429 * Deque base class. This class provides the unified face for %deque's
435 * (Deque handles that itself.) Only/All memory management is performed
485 //This struct encapsulates the implementation of the std::deque
659 * In previous HP/SGI versions of deque, there was an extra templat
730 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
782 deque() function in class:deque
790 deque(const allocator_type& __a) function in class:deque
802 deque(size_type __n) function in class:deque
814 deque(size_type __n, const value_type& __value, function in class:deque
828 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
841 deque(const deque& __x) function in class:deque
855 deque(deque&& __x) function in class:deque
869 deque(initializer_list<value_type> __l, function in class:deque
896 deque(_InputIterator __first, _InputIterator __last, function in class:deque
902 deque(_InputIterator __first, _InputIterator __last, function in class:deque
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_deque.h | 0 // Deque implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{deque}
94 * @brief A deque::iterator.
97 * deque is actually passed off to this class. A deque holds two
428 * Deque base class. This class provides the unified face for %deque's
434 * (Deque handles that itself.) Only/All memory management is performed
484 //This struct encapsulates the implementation of the std::deque
648 * In previous HP/SGI versions of deque, there was an extra templat
719 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
771 deque() function in class:deque
779 deque(const allocator_type& __a) function in class:deque
791 deque(size_type __n) function in class:deque
803 deque(size_type __n, const value_type& __value, function in class:deque
817 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
830 deque(const deque& __x) function in class:deque
844 deque(deque&& __x) function in class:deque
858 deque(initializer_list<value_type> __l, function in class:deque
883 deque(_InputIterator __first, _InputIterator __last, function in class:deque
[all...] |
