| /external/chromium_org/third_party/cython/src/Cython/Includes/libcpp/ |
| 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.modifiers/ |
| 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.modifiers/emplace_bac
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_deque.i | 2 // std::deque
6 // Deque
8 %define %std_deque_methods(deque...)
9 %std_sequence_methods(deque)
15 %define %std_deque_methods_val(deque...)
16 %std_sequence_methods_val(deque)
23 // std::deque
28 // -- f(std::deque<T>), f(const std::deque<T>&):
30 // previously wrapped std::deque<T> can be passed
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/octave/ |
| std_deque.i | 7 struct traits_asptr<std::deque<T> > {
8 static int asptr(octave_value obj, std::deque<T> **vec) {
9 return traits_asptr_stdseq<std::deque<T> >::asptr(obj, vec);
14 struct traits_from<std::deque<T> > {
15 static octave_value from(const std::deque<T> & vec) {
16 return traits_from_stdseq<std::deque<T> >::from(vec);
|
| /prebuilts/misc/common/swig/include/2.0.11/python/ |
| std_deque.i | 9 struct traits_asptr<std::deque<T> > {
10 static int asptr(PyObject *obj, std::deque<T> **vec) {
11 return traits_asptr_stdseq<std::deque<T> >::asptr(obj, vec);
16 struct traits_from<std::deque<T> > {
17 static PyObject *from(const std::deque<T> & vec) {
18 return traits_from_stdseq<std::deque<T> >::from(vec);
|
| /external/chromium_org/third_party/cython/src/Cython/Includes/Deprecated/ |
| stl.pxd | 47 cdef extern from "<deque>" namespace std:
49 cdef cppclass deque[TYPE]:
52 __init__(deque&)
59 deque __new__(deque&);
60 bool __eq__(deque&, deque&);
61 bool __ne__(deque&, deque&);
62 bool __lt__(deque&, deque&)
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/ruby/ |
| std_deque.i | 9 struct traits_asptr<std::deque<T> > {
10 static int asptr(VALUE obj, std::deque<T> **vec) {
11 return traits_asptr_stdseq<std::deque<T> >::asptr(obj, vec);
16 struct traits_from<std::deque<T> > {
17 static VALUE from(const std::deque<T> & vec) {
18 return traits_from_stdseq<std::deque<T> >::from(vec);
24 %ignore std::deque::push_back;
25 %ignore std::deque::pop_back;
|
| /external/libcxx/test/containers/sequences/deque/deque.cons/ |
| 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.cons/iter_ite
[all...] |
| 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<int, min_allocator<int>>(ab, an))
[all...] |
| 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<int, min_allocator<int>>(ab, an))
[all...] |
| /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/libcxx/test/containers/sequences/deque/deque.special/ |
| 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.special/cop
[all...] |
| /external/libcxx/test/containers/sequences/deque/deque.capacity/ |
| 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.capacity/resize_siz
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DequeTest.cpp | 28 #include "wtf/Deque.h"
39 Deque<int> intDeque;
44 void checkNumberSequence(Deque<int>& deque, int from, int to, bool increment)
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)
[all...] |
| DoubleBufferedDequeTest.cpp | 40 Deque<int>& deque = queue.swapBuffers(); local
41 EXPECT_EQ(1, deque.takeFirst());
42 EXPECT_EQ(10, deque.takeFirst());
43 EXPECT_EQ(100, deque.takeFirst());
|
| /libcore/luni/src/main/java/java/util/ |
| Deque.java | 15 * both ends. The name <i>deque</i> is short for "double ended queue"
16 * and is usually pronounced "deck". Most <tt>Deque</tt>
22 * ends of the deque. Methods are provided to insert, remove, and
28 * <tt>Deque</tt> implementations; in most implementations, insert
71 * <p>This interface extends the {@link Queue} interface. When a deque is
73 * added at the end of the deque and removed from the beginning. The methods
75 * <tt>Deque</tt> methods as indicated in the following table:
81 * <td ALIGN=CENTER> <b>Equivalent <tt>Deque</tt> Method</b></td>
111 * When a deque is used as a stack, elements are pushed and popped from the
112 * beginning of the deque. Stack methods are precisely equivalent t
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/profile/ |
| deque | 1 // Profiling deque implementation -*- C++ -*-
25 /** @file profile/deque
32 #include <deque>
38 /// Class std::deque wrapper with performance instrumentation.
40 class deque
41 : public _GLIBCXX_STD_C::deque<_Tp, _Allocator>
43 typedef _GLIBCXX_STD_C::deque<_Tp, _Allocator> _Base;
64 deque(const _Allocator& __a = _Allocator())
69 deque(size_type __n)
72 deque(size_type __n, const _Tp& __value
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/ |
| deque | 1 // Profiling deque implementation -*- C++ -*-
25 /** @file profile/deque
32 #include <deque>
38 /// Class std::deque wrapper with performance instrumentation.
40 class deque
41 : public _GLIBCXX_STD_C::deque<_Tp, _Allocator>
43 typedef _GLIBCXX_STD_C::deque<_Tp, _Allocator> _Base;
64 deque(const _Allocator& __a = _Allocator())
69 deque(size_type __n)
72 deque(size_type __n, const _Tp& __value
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/ |
| deque | 1 // Profiling deque implementation -*- C++ -*-
25 /** @file profile/deque
32 #include <deque>
38 /// Class std::deque wrapper with performance instrumentation.
40 class deque
41 : public _GLIBCXX_STD_C::deque<_Tp, _Allocator>
43 typedef _GLIBCXX_STD_C::deque<_Tp, _Allocator> _Base;
64 deque(const _Allocator& __a = _Allocator())
69 deque(size_type __n)
72 deque(size_type __n, const _Tp& __value
[all...] |
| /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...] |
| /external/stlport/test/unit/ |
| insert_test.cpp | 1 #include <deque>
36 deque<char const*> names(array1, array1 + 3);
37 deque<char const*>::iterator i = names.begin() + 2;
39 insert_iterator<deque <char const*> > itd(names, i);
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i));
60 deque<char const*> names(array1, array1 + 3);
61 deque<char const*>::iterator i = names.begin() + 2;
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| insert_test.cpp | 1 #include <deque>
36 deque<char const*> names(array1, array1 + 3);
37 deque<char const*>::iterator i = names.begin() + 2;
39 insert_iterator<deque <char const*> > itd(names, i);
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i));
60 deque<char const*> names(array1, array1 + 3);
61 deque<char const*>::iterator i = names.begin() + 2;
|
| /ndk/tests/device/test-stlport/unit/ |
| insert_test.cpp | 1 #include <deque>
36 deque<char const*> names(array1, array1 + 3);
37 deque<char const*>::iterator i = names.begin() + 2;
39 insert_iterator<deque <char const*> > itd(names, i);
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i));
60 deque<char const*> names(array1, array1 + 3);
61 deque<char const*>::iterator i = names.begin() + 2;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| 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<int, min_allocator<int>>(ab, an))
[all...] |
