| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/libs/arm64-v8a/include/bits/ |
| stdc++.h | 67 #include <deque>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/libs/armeabi/include/bits/ |
| stdc++.h | 67 #include <deque>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/libs/armeabi-v7a/include/bits/ |
| stdc++.h | 67 #include <deque>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/libs/mips/include/bits/ |
| stdc++.h | 67 #include <deque>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/libs/mips64/include/bits/ |
| stdc++.h | 67 #include <deque>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/libs/x86/include/bits/ |
| stdc++.h | 67 #include <deque>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/libs/x86_64/include/bits/ |
| stdc++.h | 67 #include <deque>
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph.cc | 8 #include <deque>
66 std::deque<DependencyNode*> queue;
69 std::deque<DependencyNode*>::iterator queue_end = queue.end();
121 std::deque<DependencyNode*> nodes;
126 std::deque<DependencyNode*>::iterator nodes_end(nodes.end());
142 for (std::deque<DependencyNode*>::const_iterator it = nodes.begin();
|
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_container.i | 105 %feature("ignore") std::deque<Type >::deque(size_type size);
106 %feature("ignore") std::deque<Type >::resize(size_type size);
|
| /external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_iter_iter.pass.cpp | 10 // <deque>
15 #include <deque>
236 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
237 testNI<std::deque<int> >(1500, 2000, 1000);
239 test_move<std::deque<MoveOnly, stack_allocator<MoveOnly, 2000> > >();
249 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]);
250 testNI<std::deque<int> >(1500, 2000, 1000);
251 test_move<std::deque<MoveOnly, min_allocator<MoveOnly> > >();
|
| insert_size_value.pass.cpp | 10 // <deque>
14 #include <deque>
143 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
144 self_reference_test<std::deque<int> >();
153 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]);
154 self_reference_test<std::deque<int, min_allocator<int>> >();
|
| /external/stlport/test/unit/ |
| ptrspec_test.cpp | 6 #include <deque>
60 TEST_INSTANCIATE_CONTAINER(deque); variable
84 deque<void*> void_deque;
116 deque<int*> pint_deque;
117 deque<int*> pint_deque2;
118 deque<int const*> pcint_deque;
212 deque<int*> pint_deque_from_vect(pint_vect.begin(), pint_vect.end());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_iter_iter.pass.cpp | 10 // <deque>
15 #include <deque>
236 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
237 testNI<std::deque<int> >(1500, 2000, 1000);
239 test_move<std::deque<MoveOnly, stack_allocator<MoveOnly, 2000> > >();
249 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]);
250 testNI<std::deque<int> >(1500, 2000, 1000);
251 test_move<std::deque<MoveOnly, min_allocator<MoveOnly> > >();
|
| insert_size_value.pass.cpp | 10 // <deque>
14 #include <deque>
143 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
144 self_reference_test<std::deque<int> >();
153 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]);
154 self_reference_test<std::deque<int, min_allocator<int>> >();
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| ptrspec_test.cpp | 6 #include <deque>
60 TEST_INSTANCIATE_CONTAINER(deque); variable
84 deque<void*> void_deque;
116 deque<int*> pint_deque;
117 deque<int*> pint_deque2;
118 deque<int const*> pcint_deque;
212 deque<int*> pint_deque_from_vect(pint_vect.begin(), pint_vect.end());
|
| /ndk/tests/device/test-stlport/unit/ |
| ptrspec_test.cpp | 6 #include <deque>
60 TEST_INSTANCIATE_CONTAINER(deque); variable
84 deque<void*> void_deque;
116 deque<int*> pint_deque;
117 deque<int*> pint_deque2;
118 deque<int const*> pcint_deque;
212 deque<int*> pint_deque_from_vect(pint_vect.begin(), pint_vect.end());
|
| /external/stlport/stlport/stl/ |
| _deque.h | 63 * that an empty deque must have one node, and that a deque
332 /* Deque base class. It has two purposes. First, its constructor
392 # define deque _STLP_PTR_IMPL_NAME(deque) macro
394 # define deque _STLP_NON_DBG_NAME(deque) macro
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_Deque_base,__stlport_class
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc>
478 explicit deque(const allocator_type& __a = allocator_type()) function in class:deque
486 deque(const _Self& __x) function in class:deque
497 explicit deque(size_type __n) function in class:deque
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) function in class:deque
532 deque(_InputIterator __first, _InputIterator __last, function in class:deque
541 deque(_InputIterator __first, _InputIterator __last) function in class:deque
549 deque(const value_type* __first, const value_type* __last, function in class:deque
554 deque(const_iterator __first, const_iterator __last, function in class:deque
561 deque(__move_source<_Self> src) function in class:deque
1074 # undef deque macro
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.h | 63 * that an empty deque must have one node, and that a deque
332 /* Deque base class. It has two purposes. First, its constructor
392 # define deque _STLP_PTR_IMPL_NAME(deque) macro
394 # define deque _STLP_NON_DBG_NAME(deque) macro
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_Deque_base,__stlport_class
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc>
478 explicit deque(const allocator_type& __a = allocator_type()) function in class:deque
486 deque(const _Self& __x) function in class:deque
497 explicit deque(size_type __n) function in class:deque
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) function in class:deque
532 deque(_InputIterator __first, _InputIterator __last, function in class:deque
541 deque(_InputIterator __first, _InputIterator __last) function in class:deque
549 deque(const value_type* __first, const value_type* __last, function in class:deque
554 deque(const_iterator __first, const_iterator __last, function in class:deque
561 deque(__move_source<_Self> src) function in class:deque
1074 # undef deque macro
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.h | 63 * that an empty deque must have one node, and that a deque
332 /* Deque base class. It has two purposes. First, its constructor
392 # define deque _STLP_PTR_IMPL_NAME(deque) macro
394 # define deque _STLP_NON_DBG_NAME(deque) macro
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_Deque_base,__stlport_class
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc>
478 explicit deque(const allocator_type& __a = allocator_type()) function in class:deque
486 deque(const _Self& __x) function in class:deque
497 explicit deque(size_type __n) function in class:deque
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) function in class:deque
532 deque(_InputIterator __first, _InputIterator __last, function in class:deque
541 deque(_InputIterator __first, _InputIterator __last) function in class:deque
549 deque(const value_type* __first, const value_type* __last, function in class:deque
554 deque(const_iterator __first, const_iterator __last, function in class:deque
561 deque(__move_source<_Self> src) function in class:deque
1074 # undef deque macro
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.h | 63 * that an empty deque must have one node, and that a deque
332 /* Deque base class. It has two purposes. First, its constructor
392 # define deque _STLP_PTR_IMPL_NAME(deque) macro
394 # define deque _STLP_NON_DBG_NAME(deque) macro
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_Deque_base,__stlport_class
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc>
478 explicit deque(const allocator_type& __a = allocator_type()) function in class:deque
486 deque(const _Self& __x) function in class:deque
497 explicit deque(size_type __n) function in class:deque
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) function in class:deque
532 deque(_InputIterator __first, _InputIterator __last, function in class:deque
541 deque(_InputIterator __first, _InputIterator __last) function in class:deque
549 deque(const value_type* __first, const value_type* __last, function in class:deque
554 deque(const_iterator __first, const_iterator __last, function in class:deque
561 deque(__move_source<_Self> src) function in class:deque
1074 # undef deque macro
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.h | 63 * that an empty deque must have one node, and that a deque
332 /* Deque base class. It has two purposes. First, its constructor
392 # define deque _STLP_PTR_IMPL_NAME(deque) macro
394 # define deque _STLP_NON_DBG_NAME(deque) macro
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_Deque_base,__stlport_class
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc>
478 explicit deque(const allocator_type& __a = allocator_type()) function in class:deque
486 deque(const _Self& __x) function in class:deque
497 explicit deque(size_type __n) function in class:deque
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) function in class:deque
532 deque(_InputIterator __first, _InputIterator __last, function in class:deque
541 deque(_InputIterator __first, _InputIterator __last) function in class:deque
549 deque(const value_type* __first, const value_type* __last, function in class:deque
554 deque(const_iterator __first, const_iterator __last, function in class:deque
561 deque(__move_source<_Self> src) function in class:deque
1074 # undef deque macro
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.h | 63 * that an empty deque must have one node, and that a deque
332 /* Deque base class. It has two purposes. First, its constructor
392 # define deque _STLP_PTR_IMPL_NAME(deque) macro
394 # define deque _STLP_NON_DBG_NAME(deque) macro
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_Deque_base,__stlport_class
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc>
478 explicit deque(const allocator_type& __a = allocator_type()) function in class:deque
486 deque(const _Self& __x) function in class:deque
497 explicit deque(size_type __n) function in class:deque
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) function in class:deque
532 deque(_InputIterator __first, _InputIterator __last, function in class:deque
541 deque(_InputIterator __first, _InputIterator __last) function in class:deque
549 deque(const value_type* __first, const value_type* __last, function in class:deque
554 deque(const_iterator __first, const_iterator __last, function in class:deque
561 deque(__move_source<_Self> src) function in class:deque
1074 # undef deque macro
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _deque.h | 63 * that an empty deque must have one node, and that a deque
332 /* Deque base class. It has two purposes. First, its constructor
392 # define deque _STLP_PTR_IMPL_NAME(deque) macro
394 # define deque _STLP_NON_DBG_NAME(deque) macro
400 class deque : protected _STLP_PRIV _Deque_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_Deque_base,__stlport_class
401 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (deque)
402 , public __stlport_class<deque<_Tp, _Alloc>
478 explicit deque(const allocator_type& __a = allocator_type()) function in class:deque
486 deque(const _Self& __x) function in class:deque
497 explicit deque(size_type __n) function in class:deque
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) function in class:deque
532 deque(_InputIterator __first, _InputIterator __last, function in class:deque
541 deque(_InputIterator __first, _InputIterator __last) function in class:deque
549 deque(const value_type* __first, const value_type* __last, function in class:deque
554 deque(const_iterator __first, const_iterator __last, function in class:deque
561 deque(__move_source<_Self> src) function in class:deque
1074 # undef deque macro
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| queue.h | 24 #include <deque>
129 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
[all...] |
| /external/chromium_org/cc/scheduler/ |
| scheduler.h | 8 #include <deque>
151 std::deque<BeginFrameArgs>* begin_retro_frame_args);
185 std::deque<BeginFrameArgs> begin_retro_frame_args_;
|
