/external/stlport/test/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;
|
/external/libcxx/test/containers/sequences/deque/ |
H A D | version.pass.cpp | 10 // <deque> 12 #include <deque>
|
/external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/containers/sequences/deque/deque.modifiers/Android.mk 19 test_name := containers/sequences/deque/deque.modifiers/push_front_rvalue 23 test_name := containers/sequences/deque/deque.modifiers/push_back_exception_safety 27 test_name := containers/sequences/deque/deque.modifiers/pop_back 31 test_name := containers/sequences/deque/deque [all...] |
/external/libcxx/test/containers/sequences/deque/deque.special/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/containers/sequences/deque/deque.special/Android.mk 19 test_name := containers/sequences/deque/deque.special/copy_backward 23 test_name := containers/sequences/deque/deque.special/move_backward 27 test_name := containers/sequences/deque/deque.special/swap 31 test_name := containers/sequences/deque/deque [all...] |
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;
|
/external/libcxx/test/containers/sequences/deque/deque.cons/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/containers/sequences/deque/deque.cons/Android.mk 19 test_name := containers/sequences/deque/deque.cons/default 23 test_name := containers/sequences/deque/deque.cons/assign_size_value 27 test_name := containers/sequences/deque/deque.cons/alloc 31 test_name := containers/sequences/deque/deque [all...] |
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;
|
/external/chromium_org/third_party/cython/src/Cython/Includes/libcpp/ |
H A D | deque.pxd | 3 cdef extern from "<deque>" namespace "std": 4 cdef cppclass deque[T]: 21 deque() nogil except + 22 deque(deque&) nogil except + 23 deque(size_t) nogil except + 24 deque(size_t, T&) nogil except + 25 #deque[input_iterator](input_iterator, input_iterator) 27 #deque& operator=(deque [all...] |
/external/libcxx/test/containers/sequences/deque/deque.capacity/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/containers/sequences/deque/deque.capacity/Android.mk 19 test_name := containers/sequences/deque/deque.capacity/access 23 test_name := containers/sequences/deque/deque.capacity/shrink_to_fit 27 test_name := containers/sequences/deque/deque.capacity/resize_size_value 31 test_name := containers/sequences/deque/deque [all...] |
/external/chromium_org/sync/internal_api/ |
H A D | protocol_event_buffer.h | 8 #include <deque> 34 std::deque<ProtocolEvent*> buffer_; 35 STLElementDeleter<std::deque<ProtocolEvent*> > buffer_deleter_;
|
/external/chromium_org/cc/resources/ |
H A D | resource_update_queue.h | 8 #include <deque> 34 void ClearUploadsToEvictedResources(std::deque<ResourceUpdate>* entry_queue); 35 std::deque<ResourceUpdate> full_entries_; 36 std::deque<ResourceUpdate> partial_entries_;
|
/external/eigen/Eigen/src/StlSupport/ |
H A D | 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_typ 80 class deque<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std [all...] |
/external/chromium_org/components/history/core/browser/ |
H A D | history_match.h | 8 #include <deque> 53 typedef std::deque<HistoryMatch> HistoryMatches;
|
/external/chromium_org/remoting/base/ |
H A D | running_average.h | 8 #include <deque> 39 std::deque<int64> data_points_;
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | DequeTest.cpp | 44 void checkNumberSequence(Deque<int>& deque, int from, int to, bool increment) argument 46 Deque<int>::iterator it = increment ? deque.begin() : deque.end(); 47 size_t index = increment ? 0 : deque.size(); 56 EXPECT_EQ(i, deque[index]); 63 EXPECT_EQ(increment ? deque.end() : deque.begin(), it); 64 EXPECT_EQ(increment ? deque.size() : 0, index); 67 void checkNumberSequenceReverse(Deque<int>& deque, int from, int to, bool increment) 69 Deque<int>::reverse_iterator it = increment ? deque [all...] |