Home
last modified time | relevance | path

Searched refs:deque (Results 1 – 25 of 131) sorted by relevance

123456

/external/eigen/Eigen/src/StlSupport/
DStdDeque.h18 …#define EIGEN_EXPLICIT_STL_DEQUE_INSTANTIATION(...) template class std::deque<__VA_ARGS__, EIGEN_A…
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…
45 deque(const deque& c) : deque_base(c) {} \
46 explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
47 deque(iterator start, iterator end) : deque_base(start, end) {} \
48 deque& operator=(const deque& x) { \
[all …]
/external/stlport/test/unit/
Ddeque_test.cpp52 deque<int> d; in deque1()
71 deque<int>::iterator dit = d.begin(); in deque1()
72 deque<int>::const_iterator cdit(d.begin()); in deque1()
82 deque<int> d; in insert()
88 deque<int>::iterator dit; in insert()
158 deque<int> d; in at()
159 deque<int> const& cd = d; in at()
185 deque<int> ref; in auto_ref()
190 deque<deque<int> > d_d_int(1, ref); in auto_ref()
211 typedef deque<int, StackAllocator<int> > DequeInt; in allocator_with_state()
[all …]
Dinsert_test.cpp36 deque<char const*> names(array1, array1 + 3); in insert1()
37 deque<char const*>::iterator i = names.begin() + 2; in insert1()
39 insert_iterator<deque <char const*> > itd(names, i); in insert1()
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i)); in insert1()
60 deque<char const*> names(array1, array1 + 3); in insert2()
61 deque<char const*>::iterator i = names.begin() + 2; in insert2()
Dfinsert_test.cpp34 deque<char const*> names; in finsert1()
35 front_insert_iterator<deque<char const*> > fit(names); in finsert1()
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names)); in finsert1()
52 deque<char const*> names; in finsert2()
Dmvctor_test.cpp178 deque<vector<int> > vect_deque; in deque_test()
208 deque<vector<int> > vect_deque; in deque_test()
237 deque<vector<int> > vect_deque; in deque_test()
239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end()); in deque_test()
247 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
267 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
278 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
287 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
298 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
[all …]
Dmvctor_declaration_test.cpp127 struct __move_traits<deque<specially_allocated_struct> > {
223 CPPUNIT_ASSERT( is_movable(deque<char>()) ); in movable_declaration()
224 CPPUNIT_ASSERT( is_movable(deque<specially_allocated_struct>()) ); in movable_declaration()
226 CPPUNIT_ASSERT( is_move_complete(deque<char>()) ); in movable_declaration()
227 CPPUNIT_ASSERT( !is_move_complete(deque<specially_allocated_struct>()) ); in movable_declaration()
229 CPPUNIT_ASSERT( !is_move_complete(deque<char>()) ); in movable_declaration()
Dptrspec_test.cpp60 TEST_INSTANCIATE_CONTAINER(deque);
84 deque<void*> void_deque; in ptr_specialization_test()
116 deque<int*> pint_deque; in ptr_specialization_test()
117 deque<int*> pint_deque2; in ptr_specialization_test()
118 deque<int const*> pcint_deque; in ptr_specialization_test()
212 deque<int*> pint_deque_from_vect(pint_vect.begin(), pint_vect.end()); in ptr_specialization_test()
Dalg_test.cpp106 deque<int> years; in sort_test()
149 deque<int> dint(ints, ints + ARRAY_SIZE(ints)); in search_n_test()
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4); in search_n_test()
182 deque<int> dint(ints, ints + ARRAY_SIZE(ints)); in search_n_test()
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>()); in search_n_test()
/external/eigen/test/
Dstddeque.cpp23 …std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y… in check_stddeque_matrix()
29 typename std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator vi = v.begin(); in check_stddeque_matrix()
30 typename std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator wi = w.begin(); in check_stddeque_matrix()
52 std::deque<TransformType,Eigen::aligned_allocator<TransformType> > v(10), w(20, y); in check_stddeque_transform()
58 …typename std::deque<TransformType,Eigen::aligned_allocator<TransformType> >::iterator vi = v.begin… in check_stddeque_transform()
59 …typename std::deque<TransformType,Eigen::aligned_allocator<TransformType> >::iterator wi = w.begin… in check_stddeque_transform()
81 std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> > v(10), w(20, y); in check_stddeque_quaternion()
87 …typename std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator vi = v.beg… in check_stddeque_quaternion()
88 …typename std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator wi = w.beg… in check_stddeque_quaternion()
/external/stlport/stlport/stl/pointers/
D_deque.h77 #define DEQUE_IMPL _STLP_PTR_IMPL_NAME(deque)
91 # define deque _STLP_NON_DBG_NAME(deque)
97 class deque
98 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
99 : public __stlport_class<deque<_Tp, _Alloc> >
105 typedef deque<_Tp, _Alloc> _Self;
159 explicit deque(const allocator_type& __a = allocator_type())
162 deque(const _Self& __x) : _M_impl(__x._M_impl) {}
165 explicit deque(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
167 deque(size_type __n, const value_type& __val,
[all …]
/external/stlport/stlport/stl/debug/
D_deque.h37 #define _STLP_NON_DBG_DEQUE _STLP_PRIV _STLP_NON_DBG_NAME(deque) <_Tp,_Alloc>
51 class deque :
57 , public __stlport_class<deque<_Tp, _Alloc> >
60 typedef deque<_Tp,_Alloc> _Self;
129 explicit deque(const allocator_type& __a = allocator_type()) :
131 deque(const _Self& __x) : in deque() function
136 explicit deque(size_type __n, const value_type& __x = _Tp(),
138 deque(size_type __n, const value_type& __x,
143 explicit deque(size_type __n) : in deque() function
148 deque(__move_source<_Self> src) in deque() function
[all …]
/external/stlport/stlport/stl/
D_deque.c87 # define deque _STLP_PTR_IMPL_NAME(deque) macro
89 # define deque _STLP_NON_DBG_NAME(deque) macro
102 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE deque<_Tp, _Alloc>::iterator
106 deque<_Tp, _Alloc >&
107 deque<_Tp, _Alloc >::operator= (const deque<_Tp, _Alloc >& __x) {
122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos, in _M_fill_insert()
150 void deque<_Tp, _Alloc>::insert(iterator __pos, in insert()
178 void deque<_Tp,_Alloc>::insert(iterator __pos, in insert()
208 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __pos, in _M_erase()
243 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __pos, in _M_erase()
[all …]
D_deque.h392 # define deque _STLP_PTR_IMPL_NAME(deque)
394 # define deque _STLP_NON_DBG_NAME(deque)
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc>
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc> >
406 typedef deque<_Tp, _Alloc> _Self;
478 explicit deque(const allocator_type& __a = allocator_type())
480 deque()
482 deque(const allocator_type& __a)
486 deque(const _Self& __x)
[all …]
/external/llvm/test/CodeGen/Thumb/
Dstack-coloring-without-frame-ptr.ll4 %insert_iterator = type { %deque*, %iterator }
5 %deque = type { %iterator, %iterator, i8***, i32 }
11 %var3 = alloca %deque, align 4
13 %0 = bitcast %deque* %var3 to i8*
/external/chromium/chrome/browser/notifications/
Ddesktop_notifications_unittest.cc52 std::deque<Balloon*>::iterator it; in OnBalloonClosed()
68 std::deque<Balloon*>::iterator iter; in UppermostVerticalPosition()
234 std::deque<Balloon*>& balloons = balloon_collection_->balloons(); in TEST_F()
235 std::deque<Balloon*>::iterator iter; in TEST_F()
357 std::deque<Balloon*>& balloons = balloon_collection_->balloons(); in TEST_F()
358 std::deque<Balloon*>::iterator iter; in TEST_F()
386 std::deque<Balloon*>& balloons = balloon_collection_->balloons(); in TEST_F()
387 std::deque<Balloon*>::iterator iter; in TEST_F()
Ddesktop_notifications_unittest.h51 std::deque<Balloon*>& balloons() { return balloons_; } in balloons()
67 std::deque<Balloon*> balloons_;
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dqueue.h129 class FifoQueue : public QueueBase<S>, public deque<S> {
131 using deque<S>::back;
132 using deque<S>::push_front;
133 using deque<S>::pop_back;
134 using deque<S>::empty;
135 using deque<S>::clear;
159 class LifoQueue : public QueueBase<S>, public deque<S> {
161 using deque<S>::front;
162 using deque<S>::push_front;
163 using deque<S>::pop_front;
[all …]
/external/chromium/base/
Dtask_queue.cc39 std::deque<Task*> ready; in Run()
43 std::deque<Task*>::const_iterator task; in Run()
/external/chromium/chrome/browser/prerender/
Dprerender_browsertest.cc94 const std::deque<FinalStatus>& expected_final_status_queue) in WaitForLoadPrerenderContentsFactory()
123 std::deque<FinalStatus> expected_final_status_queue_;
154 std::deque<FinalStatus> expected_final_status_queue(1, in PrerenderTestURL()
163 const std::deque<FinalStatus>& expected_final_status_queue, in PrerenderTestURL()
212 const std::deque<FinalStatus>& expected_final_status_queue, in PrerenderTestURLImpl()
559 std::deque<FinalStatus> expected_final_status_queue; in IN_PROC_BROWSER_TEST_F()
591 std::deque<FinalStatus> expected_final_status_queue; in IN_PROC_BROWSER_TEST_F()
/external/openfst/src/include/fst/
Dqueue.h26 using std::deque;
142 class FifoQueue : public QueueBase<S>, public deque<S> {
144 using deque<S>::back;
145 using deque<S>::push_front;
146 using deque<S>::pop_back;
147 using deque<S>::empty;
148 using deque<S>::clear;
175 class LifoQueue : public QueueBase<S>, public deque<S> {
177 using deque<S>::front;
178 using deque<S>::push_front;
[all …]
/external/chromium/chrome/browser/extensions/
Dextension_apitest.h59 std::deque<bool> results_;
62 std::deque<std::string> messages_;
/external/chromium/chrome/browser/safe_browsing/
Dprotocol_parser.h110 std::deque<SBChunkHost>* hosts);
115 std::deque<SBChunkHost>* hosts);
/external/oprofile/libregex/tests/
Dmangled-name.in45 deque<int, allocator<int>, 0>
46 deque<int>
48 std::deque<int, std::allocator<int>, 0>
49 deque<int>
72 queue<int, deque<int, allocator<int>, 0> >
75 prefix_queue<int, deque<int, allocator<int>, 0> >
76 prefix_queue<int, deque<int>>
78 std::queue<int, std::deque<int, allocator<int>, 0> >
148 stack<int, deque<int, allocator<int>, 0> >
151 prefix_stack<int, deque<int, allocator<int>, 0> >
[all …]
/external/webkit/Source/JavaScriptCore/wtf/
DDeque.h158 DequeIterator(Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index) { } in DequeIterator() argument
183 … DequeConstIterator(const Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index) { } in DequeConstIterator() argument
209 … DequeReverseIterator(const Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index) { } in DequeReverseIterator() argument
234 …DequeConstReverseIterator(const Deque<T, inlineCapacity>* deque, size_t index) : Base(deque, index… in DequeConstReverseIterator() argument
590 …atorBase<T, inlineCapacity>::DequeIteratorBase(const Deque<T, inlineCapacity>* deque, size_t index) in DequeIteratorBase() argument
591 : m_deque(const_cast<Deque<T, inlineCapacity>*>(deque)) in DequeIteratorBase()
/external/llvm/lib/Analysis/
DLoopPass.cpp84 for (std::deque<Loop *>::iterator I = LQ.begin(), in deleteLoopFromQueue()
116 for (std::deque<Loop *>::iterator I = LQ.begin(), in insertLoopIntoQueue()
163 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) { in addLoopIntoQueue()
198 for (std::deque<Loop *>::const_iterator I = LQ.begin(), E = LQ.end(); in runOnFunction()

123456