Searched refs:deque (Results 1 - 25 of 422) sorted by relevance

1234567891011>>

/external/libcxx/test/std/containers/sequences/deque/
H A Dallocator_mismatch.fail.cpp10 // <deque>
13 #include <deque>
17 std::deque<int, std::allocator<long> > d;
/external/libcxx/test/std/containers/sequences/deque/deque.capacity/
H A Dempty.fail.cpp11 // <deque>
13 // class deque
20 #include <deque>
26 std::deque<int> c;
H A Daccess.pass.cpp10 // <deque>
24 #include <deque>
54 std::deque<int> c = make<std::deque<int> >(10);
63 const std::deque<int> c = make<std::deque<int> >(10);
73 std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
82 const std::deque<int, min_allocator<int>> c = make<std::deque<in
[all...]
H A Dempty.pass.cpp10 // <deque>
12 // class deque
16 #include <deque>
25 typedef std::deque<int> C;
36 typedef std::deque<int, min_allocator<int>> C;
/external/libcxx/test/libcxx/containers/sequences/deque/
H A Dversion.pass.cpp10 // <deque>
12 #include <deque>
H A Dincomplete.pass.cpp10 // <deque>
12 // deque()
13 // deque::iterator()
17 #include <deque>
21 std::deque<A> d;
22 std::deque<A>::iterator it;
23 std::deque<A>::reverse_iterator it2;
/external/pdfium/core/fpdfapi/page/
H A Dcpdf_pageobjectlist.h10 #include <deque>
16 : public std::deque<std::unique_ptr<CPDF_PageObject>> {
/external/libcxx/test/libcxx/experimental/memory/memory.resource.aliases/
H A Dheader_deque_libcpp_version.pass.cpp12 // <experimental/deque>
14 #include <experimental/deque>
/external/libcxx/test/std/containers/container.adaptors/priority.queue/
H A Dtypes.fail.cpp34 std::priority_queue<double, std::deque<int>> t;
/external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/
H A Dtypes.fail.cpp19 std::queue<double, std::deque<int>> t;
/external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/
H A Dtypes.fail.cpp34 std::stack<double, std::deque<int>> t;
/external/libcxx/test/std/containers/sequences/deque/deque.cons/
H A Dinitializer_list.pass.cpp12 // <deque>
14 // deque(initializer_list<value_type> il);
16 #include <deque>
24 std::deque<int> d = {3, 4, 5, 6};
32 std::deque<int, min_allocator<int>> d = {3, 4, 5, 6};
H A Ddefault_noexcept.pass.cpp10 // <deque>
12 // deque()
19 #include <deque>
37 typedef std::deque<MoveOnly> C;
41 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
46 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
50 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
H A Ddtor_noexcept.pass.cpp10 // <deque>
12 // ~deque() // implied noexcept;
16 #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;
47 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
H A Dmove_assign_noexcept.pass.cpp10 // <deque>
12 // deque& operator=(deque&& c)
21 #include <deque>
38 typedef std::deque<MoveOnly> C;
42 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
47 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
51 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
H A Dmove_noexcept.pass.cpp10 // <deque>
12 // deque(deque&&)
19 #include <deque>
37 typedef std::deque<MoveOnly> C;
41 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
45 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
49 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
H A Dassign_initializer_list.pass.cpp12 // <deque>
16 #include <deque>
24 std::deque<int> d;
33 std::deque<int, min_allocator<int>> d;
H A Ddefault.pass.cpp10 // <deque>
12 // deque()
14 #include <deque>
25 std::deque<T, Allocator> d;
28 std::deque<T, Allocator> d1 = {};
H A Dop_equal_initializer_list.pass.cpp12 // <deque>
14 // deque& operator=(initializer_list<value_type> il);
16 #include <deque>
24 std::deque<int> d;
33 std::deque<int, min_allocator<int>> d;
H A Dcopy.pass.cpp10 // <deque>
12 // deque(const deque&);
14 #include <deque>
34 test(std::deque<int>(ab, an));
37 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5));
38 std::deque<int, test_allocator<int> > v2 = v;
44 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5));
45 std::deque<int, other_allocator<int> > v2 = v;
52 test(std::deque<in
[all...]
H A Dop_equal.pass.cpp10 // <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...]
/external/python/cpython2/Modules/
H A D_collectionsmodule.c4 /* collections module implementation of a deque() datatype
23 * and the rightmost block has rightlink==NULL). A deque d's first
67 "cannot add more blocks to the deque");
108 /* The deque's size limit is d.maxlen. The limit can be zero or positive.
111 * After an item is added to a deque, we check to see if the size has grown past
129 dequeobject *deque; local
133 deque = (dequeobject *)type->tp_alloc(type, 0);
134 if (deque == NULL)
139 Py_DECREF(deque);
144 deque
157 deque_pop(dequeobject *deque, PyObject *unused) argument
193 deque_popleft(dequeobject *deque, PyObject *unused) argument
231 deque_append(dequeobject *deque, PyObject *item) argument
254 deque_appendleft(dequeobject *deque, PyObject *item) argument
294 deque_extend(dequeobject *deque, PyObject *iterable) argument
346 deque_extendleft(dequeobject *deque, PyObject *iterable) argument
398 deque_inplace_concat(dequeobject *deque, PyObject *other) argument
411 _deque_rotate(dequeobject *deque, Py_ssize_t n) argument
502 deque_rotate(dequeobject *deque, PyObject *args) argument
517 deque_reverse(dequeobject *deque, PyObject *unused) argument
561 deque_count(dequeobject *deque, PyObject *v) argument
602 deque_len(dequeobject *deque) argument
608 deque_remove(dequeobject *deque, PyObject *value) argument
643 deque_clear(dequeobject *deque) argument
715 deque_item(dequeobject *deque, Py_ssize_t i) argument
761 deque_del_item(dequeobject *deque, Py_ssize_t i) argument
777 deque_ass_item(dequeobject *deque, Py_ssize_t i, PyObject *v) argument
812 deque_clearmethod(dequeobject *deque) argument
821 deque_dealloc(dequeobject *deque) argument
837 deque_traverse(dequeobject *deque, visitproc visit, void *arg) argument
859 deque_copy(PyObject *deque) argument
871 deque_reduce(dequeobject *deque) argument
902 deque_repr(PyObject *deque) argument
937 deque_tp_print(PyObject *deque, FILE *fp, int flags) argument
1068 deque_init(dequeobject *deque, PyObject *args, PyObject *kwdargs) argument
1099 deque_sizeof(dequeobject *deque, void *unused) argument
1116 deque_get_maxlen(dequeobject *deque) argument
1239 dequeobject *deque; member in struct:__anon19289
1247 deque_iter(dequeobject *deque) argument
1357 deque_reviter(dequeobject *deque) argument
[all...]
/external/python/cpython3/Modules/
H A D_collectionsmodule.c10 /* collections module implementation of a deque() datatype
24 /* Data for deque objects is stored in a doubly-linked list of fixed
42 * A deque d's first element is at d.leftblock[leftindex]
149 dequeobject *deque; local
153 deque = (dequeobject *)type->tp_alloc(type, 0);
154 if (deque == NULL)
159 Py_DECREF(deque);
166 Py_SIZE(deque) = 0;
167 deque->leftblock = b;
168 deque
179 deque_pop(dequeobject *deque, PyObject *unused) argument
216 deque_popleft(dequeobject *deque, PyObject *unused) argument
268 deque_append_internal(dequeobject *deque, PyObject *item, Py_ssize_t maxlen) argument
294 deque_append(dequeobject *deque, PyObject *item) argument
305 deque_appendleft_internal(dequeobject *deque, PyObject *item, Py_ssize_t maxlen) argument
331 deque_appendleft(dequeobject *deque, PyObject *item) argument
372 deque_extend(dequeobject *deque, PyObject *iterable) argument
437 deque_extendleft(dequeobject *deque, PyObject *iterable) argument
502 deque_inplace_concat(dequeobject *deque, PyObject *other) argument
515 deque_copy(PyObject *deque) argument
550 deque_concat(dequeobject *deque, PyObject *other) argument
578 deque_clear(dequeobject *deque) argument
661 deque_clearmethod(dequeobject *deque) argument
670 deque_inplace_repeat(dequeobject *deque, Py_ssize_t n) argument
747 deque_repeat(dequeobject *deque, Py_ssize_t n) argument
786 _deque_rotate(dequeobject *deque, Py_ssize_t n) argument
910 deque_rotate(dequeobject *deque, PyObject *args) argument
925 deque_reverse(dequeobject *deque, PyObject *unused) argument
967 deque_count(dequeobject *deque, PyObject *v) argument
1006 deque_contains(dequeobject *deque, PyObject *v) argument
1038 deque_len(dequeobject *deque) argument
1044 deque_index(dequeobject *deque, PyObject *args) argument
1119 deque_insert(dequeobject *deque, PyObject *args) argument
1154 deque_remove(dequeobject *deque, PyObject *value) argument
1197 deque_item(dequeobject *deque, Py_ssize_t i) argument
1239 deque_del_item(dequeobject *deque, Py_ssize_t i) argument
1255 deque_ass_item(dequeobject *deque, Py_ssize_t i, PyObject *v) argument
1293 deque_dealloc(dequeobject *deque) argument
1309 deque_traverse(dequeobject *deque, visitproc visit, void *arg) argument
1333 deque_reduce(dequeobject *deque) argument
1365 deque_repr(PyObject *deque) argument
1471 deque_init(dequeobject *deque, PyObject *args, PyObject *kwdargs) argument
1508 deque_sizeof(dequeobject *deque, void *unused) argument
1525 deque_bool(dequeobject *deque) argument
1531 deque_get_maxlen(dequeobject *deque) argument
1674 dequeobject *deque; member in struct:__anon19882
1682 deque_iter(dequeobject *deque) argument
1745 PyObject *deque; local
1838 deque_reviter(dequeobject *deque) argument
1887 PyObject *deque; local
[all...]
/external/libcxx/test/std/experimental/memory/memory.resource.aliases/
H A Dheader_deque_synop.pass.cpp14 // <experimental/deque>
18 // using deque =
19 // ::std::deque<T, polymorphic_allocator<T>>
23 #include <experimental/deque>
32 using StdDeque = std::deque<int, pmr::polymorphic_allocator<int>>;
33 using PmrDeque = pmr::deque<int>;
/external/eigen/Eigen/src/StlSupport/
H A DStdDeque.h18 * std::deque such that for data types with alignment issues the correct allocator
25 class deque<__VA_ARGS__, std::allocator<__VA_ARGS__> > \
26 : public deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
28 typedef deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > deque_base; \
34 explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \
36 deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \
37 deque(const deque& c) : deque_base(c) {} \
38 explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
39 deque(iterato
72 class deque<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std
[all...]

Completed in 1255 milliseconds

1234567891011>>