Home
last modified time | relevance | path

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

12

/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()
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 …]
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_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()
Dmvctor_traits_test.cpp288 deque<MovableStruct> deq; in move_traits_deq()
311 deque<MovableStruct> d2 = deq; in move_traits_deq()
381 deque<CompleteMovableStruct> deq; in move_traits_deq_complete()
405 deque<CompleteMovableStruct> d2 = deq; in move_traits_deq_complete()
Dstack_test.cpp35 stack<int, deque<int> > s; in stack1()
Dqueue_test.cpp35 priority_queue<int, deque<int>, less<int> > q; in pqueue1()
/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/
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 …]
D_stack.h40 template <class _Tp, class _Sequence = deque<_Tp> >
57 typedef deque<_Tp> _Sequence;
/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/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/webkit/JavaScriptCore/wtf/
DDeque.h156 DequeIterator(Deque<T>* deque, size_t index) : Base(deque, index) { } in DequeIterator() argument
181 DequeConstIterator(const Deque<T>* deque, size_t index) : Base(deque, index) { } in DequeConstIterator() argument
207 DequeReverseIterator(const Deque<T>* deque, size_t index) : Base(deque, index) { } in DequeReverseIterator() argument
232 DequeConstReverseIterator(const Deque<T>* deque, size_t index) : Base(deque, index) { } in DequeConstReverseIterator() argument
574 inline DequeIteratorBase<T>::DequeIteratorBase(const Deque<T>* deque, size_t index) in DequeIteratorBase() argument
575 : m_deque(const_cast<Deque<T>*>(deque)) in DequeIteratorBase()
/external/stlport/stlport/
Ddeque42 # include_next <deque>
44 # include _STLP_NATIVE_HEADER(deque)
/external/stlport/etc/
Dautoexp.dat202 ; stlport::deque
204 stlp_std::deque<*,*>|stlpx_std::deque<*,*>|stlpmtx_std::deque<*,*>|stlpxmtx_std::deque<*,*>|stlpd_s…
290 stlpd_std::deque<*>|stlpdx_std::deque<*>|stlpdmtx_std::deque<*>|stlpdxmtx_std::deque<*>{
299 deque : $c._M_non_dbg_impl
Dstd_headers.txt4 deque
DReleaseNote.txt27 * Delay instanciation of type traits type in vector and deque implementation to
105 * Move semantic: vector or deque of any other STL containers are using
117 * STL containers vector, deque, list and slist pointer specialization to
/external/protobuf/python/
Dmox.py62 from collections import deque
353 self._expected_calls_queue = deque()
535 if not isinstance(call_queue, deque):
536 self._call_queue = deque(self._call_queue)
/external/chromium/net/ftp/
Dftp_directory_listing_buffer.h71 std::deque<string16> lines_;
/external/chromium/net/websockets/
Dwebsocket_throttle.h36 typedef std::deque<WebSocketState*> ConnectingQueue;
/external/chromium/net/proxy/
Dsingle_threaded_proxy_resolver.h55 typedef std::deque<scoped_refptr<Job> > PendingJobsQueue;

12