/external/stlport/test/unit/ |
deque_header_test.cpp | 8 #include <deque>
|
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;
|
/ndk/tests/device/test-gnustl-full/unit/ |
deque_header_test.cpp | 8 #include <deque>
|
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;
|
/ndk/tests/device/test-stlport/unit/ |
deque_header_test.cpp | 8 #include <deque>
|
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;
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/ |
version.pass.cpp | 10 // <deque> 12 #include <deque>
|
iterators.pass.cpp | 10 // <deque> 15 // class deque; 19 #include <deque> 25 typedef std::deque<int> C;
|
/external/chromium/base/ |
task_queue.h | 9 #include <deque> 41 std::deque<Task*> queue_;
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.cons/ |
assign_initializer_list.pass.cpp | 10 // <deque> 14 #include <deque> 20 std::deque<int> d;
|
initializer_list.pass.cpp | 10 // <deque> 12 // deque(initializer_list<value_type> il); 14 #include <deque> 20 std::deque<int> d = {3, 4, 5, 6};
|
op_equal_initializer_list.pass.cpp | 10 // <deque> 12 // deque& operator=(initializer_list<value_type> il); 14 #include <deque> 20 std::deque<int> 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;
|
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;
|
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;
|
copy.pass.cpp | 10 // <deque> 12 // deque(const deque&); 14 #include <deque> 31 test(std::deque<int>(ab, an)); 34 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5)); 35 std::deque<int, test_allocator<int> > v2 = v; 41 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5)); 42 std::deque<int, other_allocator<int> > v2 = v;
|
op_equal.pass.cpp | 10 // <deque> 12 // deque& operator=(const deque& c); 14 #include <deque> 32 test(std::deque<int>(ab, an)); 35 std::deque<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); 36 std::deque<int, test_allocator<int> > l2(l, test_allocator<int>(3)); 42 std::deque<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); 43 std::deque<int, other_allocator<int> > l2(l, other_allocator<int>(3));
|
alloc.pass.cpp | 10 // <deque> 12 // explicit deque(const allocator_type& a); 14 #include <deque> 24 std::deque<T, Allocator> d(a);
|
default.pass.cpp | 10 // <deque> 12 // deque() 14 #include <deque> 24 std::deque<T, Allocator> d;
|
initializer_list_alloc.pass.cpp | 10 // <deque> 12 // deque(initializer_list<value_type> il, const Allocator& a = allocator_type()); 14 #include <deque> 22 std::deque<int, test_allocator<int>> d({3, 4, 5, 6}, test_allocator<int>(3));
|
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;
|
/ndk/tests/device/test-stlport_shared-exception/jni/ |
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/ |
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;
|
/external/eigen/Eigen/src/StlSupport/ |
StdDeque.h | 18 #define EIGEN_EXPLICIT_STL_DEQUE_INSTANTIATION(...) template class std::deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >; 25 * std::deque such that for data types with alignment issues the correct allocator 33 class deque<__VA_ARGS__, _Ay> \ 34 : public deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \ 36 typedef deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > deque_base; \ 42 explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \ 44 deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \ 45 deque(const deque& c) : deque_base(c) {} \ 46 explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} 80 class deque<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.special/ |
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;
|