/external/python/cpython2/Modules/ |
D | _collectionsmodule.c | 129 dequeobject *deque; in deque_new() local 133 deque = (dequeobject *)type->tp_alloc(type, 0); in deque_new() 134 if (deque == NULL) in deque_new() 139 Py_DECREF(deque); in deque_new() 144 deque->leftblock = b; in deque_new() 145 deque->rightblock = b; in deque_new() 146 deque->leftindex = CENTER + 1; in deque_new() 147 deque->rightindex = CENTER; in deque_new() 148 deque->len = 0; in deque_new() 149 deque->state = 0; in deque_new() [all …]
|
/external/python/cpython3/Modules/ |
D | _collectionsmodule.c | 158 dequeobject *deque; in deque_new() local 162 deque = (dequeobject *)type->tp_alloc(type, 0); in deque_new() 163 if (deque == NULL) in deque_new() 168 Py_DECREF(deque); in deque_new() 175 Py_SET_SIZE(deque, 0); in deque_new() 176 deque->leftblock = b; in deque_new() 177 deque->rightblock = b; in deque_new() 178 deque->leftindex = CENTER + 1; in deque_new() 179 deque->rightindex = CENTER; in deque_new() 180 deque->state = 0; in deque_new() [all …]
|
/external/python/cpython3/Lib/test/ |
D | test_deque.py | 1 from collections import deque 22 def __init__(self, deque, result): argument 23 self.deque = deque 26 self.deque.clear() 32 d = deque(range(-5125, -5000)) 51 self.assertRaises(ValueError, deque, 'abc', -1) 52 self.assertRaises(ValueError, deque, 'abc', -2) 54 d = deque(it, maxlen=3) 58 self.assertEqual(d, deque(range(10), 3)) 67 d = deque(range(200), maxlen=10) [all …]
|
/external/python/cpython2/Lib/test/ |
D | test_deque.py | 1 from collections import deque 22 def __init__(self, deque, result): argument 23 self.deque = deque 26 self.deque.clear() 32 d = deque(xrange(-5125, -5000)) 51 self.assertRaises(ValueError, deque, 'abc', -1) 52 self.assertRaises(ValueError, deque, 'abc', -2) 54 d = deque(it, maxlen=3) 58 self.assertEqual(d, deque(range(10), 3)) 67 d = deque(xrange(200), maxlen=10) [all …]
|
/external/eigen/Eigen/src/StlSupport/ |
D | StdDeque.h | 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… 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(iterator start, iterator end) : deque_base(start, end) {} \ 40 deque& operator=(const deque& x) { \ 59 explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \ [all …]
|
/external/llvm-project/libcxx/test/std/containers/sequences/deque/deque.special/ |
D | swap.pass.cpp | 62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1, 1)); in main() 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(1, 2)); in main() 71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); in main() 73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); in main() 80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1)); in main() 81 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); in main() 83 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); in main() 85 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); in main() 95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main() [all …]
|
/external/libcxx/test/std/containers/sequences/deque/deque.special/ |
D | swap.pass.cpp | 62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1, 1)); in main() 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(1, 2)); in main() 71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); in main() 73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); in main() 80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1)); in main() 81 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); in main() 83 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); in main() 85 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); in main() 95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main() [all …]
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
D | move_alloc.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(1)); in main() 32 std::deque<MoveOnly, A> c2(A(1)); in main() 35 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); in main() 44 std::deque<MoveOnly, A> c1(A(1)); in main() 47 std::deque<MoveOnly, A> c2(A(1)); in main() 50 std::deque<MoveOnly, A> c3(std::move(c1), A(1)); in main() 59 std::deque<MoveOnly, A> c1(A(1)); in main() 62 std::deque<MoveOnly, A> c2(A(1)); in main() 65 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); in main() 74 std::deque<MoveOnly, A> c1(A{}); in main() [all …]
|
D | move_assign.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(5)); in main() 32 std::deque<MoveOnly, A> c2(A(5)); in main() 35 std::deque<MoveOnly, A> c3(A(5)); in main() 45 std::deque<MoveOnly, A> c1(A(5)); in main() 48 std::deque<MoveOnly, A> c2(A(5)); in main() 51 std::deque<MoveOnly, A> c3(A(6)); in main() 61 std::deque<MoveOnly, A> c1(A(5)); in main() 64 std::deque<MoveOnly, A> c2(A(5)); in main() 67 std::deque<MoveOnly, A> c3(A(6)); in main() 77 std::deque<MoveOnly, A> c1(A{}); in main() [all …]
|
D | copy.pass.cpp | 34 test(std::deque<int>(ab, an)); in main() 37 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5)); in main() 38 std::deque<int, test_allocator<int> > v2 = v; in main() 44 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5)); in main() 45 std::deque<int, other_allocator<int> > v2 = v; in main() 52 test(std::deque<int, min_allocator<int>>(ab, an)); in main() 55 std::deque<int, min_allocator<int> > v(3, 2, min_allocator<int>()); in main() 56 std::deque<int, min_allocator<int> > v2 = v; in main()
|
D | op_equal.pass.cpp | 33 test(std::deque<int>(ab, an)); in main() 36 std::deque<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); in main() 37 std::deque<int, test_allocator<int> > l2(l, test_allocator<int>(3)); in main() 43 std::deque<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); in main() 44 std::deque<int, other_allocator<int> > l2(l, other_allocator<int>(3)); in main() 53 test(std::deque<int, min_allocator<int>>(ab, an)); in main() 56 std::deque<int, min_allocator<int> > l(3, 2, min_allocator<int>()); in main() 57 std::deque<int, min_allocator<int> > l2(l, min_allocator<int>()); in main()
|
D | deduct.pass.cpp | 39 std::deque deq(std::begin(arr), std::end(arr)); in main() 41 static_assert(std::is_same_v<decltype(deq), std::deque<int>>, ""); in main() 47 std::deque deq(std::begin(arr), std::end(arr), std::allocator<long>()); in main() 63 std::deque deq(1, A{}); // deque (size_type, T) in main() 70 std::deque deq(1, A{}, test_allocator<A>()); // deque (size_type, T, allocator) in main() 77 std::deque deq{1U, 2U, 3U, 4U, 5U}; // deque(initializer-list) in main() 84 …std::deque deq({1.0, 2.0, 3.0, 4.0}, test_allocator<double>()); // deque(initializer-list, allocat… in main() 92 std::deque<long double> source; in main() 93 std::deque deq(source); // deque(deque &) in main()
|
D | move.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(1)); in main() 32 std::deque<MoveOnly, A> c2(A(2)); in main() 36 std::deque<MoveOnly, A> c3 = std::move(c1); in main() 46 std::deque<MoveOnly, A> c1(A(1)); in main() 49 std::deque<MoveOnly, A> c2(A(2)); in main() 52 std::deque<MoveOnly, A> c3 = std::move(c1); in main() 61 std::deque<MoveOnly, A> c1(A{}); in main() 64 std::deque<MoveOnly, A> c2(A{}); in main() 67 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
|
/external/llvm-project/libcxx/test/std/containers/sequences/deque/deque.cons/ |
D | move_alloc.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(1)); in main() 32 std::deque<MoveOnly, A> c2(A(1)); in main() 35 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); // unequal allocator in main() 44 std::deque<MoveOnly, A> c1(A(1)); in main() 47 std::deque<MoveOnly, A> c2(A(1)); in main() 50 std::deque<MoveOnly, A> c3(std::move(c1), A(1)); // equal allocator in main() 59 std::deque<MoveOnly, A> c1(A(1)); in main() 62 std::deque<MoveOnly, A> c2(A(1)); in main() 65 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); // unequal allocator in main() 74 std::deque<MoveOnly, A> c1(A{}); in main() [all …]
|
D | move_assign.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(5)); in main() 32 std::deque<MoveOnly, A> c2(A(5)); in main() 35 std::deque<MoveOnly, A> c3(A(5)); in main() 45 std::deque<MoveOnly, A> c1(A(5)); in main() 48 std::deque<MoveOnly, A> c2(A(5)); in main() 51 std::deque<MoveOnly, A> c3(A(6)); in main() 61 std::deque<MoveOnly, A> c1(A(5)); in main() 64 std::deque<MoveOnly, A> c2(A(5)); in main() 67 std::deque<MoveOnly, A> c3(A(6)); in main() 77 std::deque<MoveOnly, A> c1(A{}); in main() [all …]
|
D | copy.pass.cpp | 33 test(std::deque<int>(ab, an)); in main() 36 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5)); in main() 37 std::deque<int, test_allocator<int> > v2 = v; in main() 43 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5)); in main() 44 std::deque<int, other_allocator<int> > v2 = v; in main() 51 test(std::deque<int, min_allocator<int>>(ab, an)); in main() 54 std::deque<int, min_allocator<int> > v(3, 2, min_allocator<int>()); in main() 55 std::deque<int, min_allocator<int> > v2 = v; in main()
|
D | op_equal.pass.cpp | 33 test(std::deque<int>(ab, an)); in main() 36 std::deque<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); in main() 37 std::deque<int, test_allocator<int> > l2(l, test_allocator<int>(3)); in main() 43 std::deque<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); in main() 44 std::deque<int, other_allocator<int> > l2(l, other_allocator<int>(3)); in main() 53 test(std::deque<int, min_allocator<int>>(ab, an)); in main() 56 std::deque<int, min_allocator<int> > l(3, 2, min_allocator<int>()); in main() 57 std::deque<int, min_allocator<int> > l2(l, min_allocator<int>()); in main()
|
D | move.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(1)); in main() 32 std::deque<MoveOnly, A> c2(A(2)); in main() 36 std::deque<MoveOnly, A> c3 = std::move(c1); in main() 46 std::deque<MoveOnly, A> c1(A(1)); in main() 49 std::deque<MoveOnly, A> c2(A(2)); in main() 52 std::deque<MoveOnly, A> c3 = std::move(c1); in main() 61 std::deque<MoveOnly, A> c1(A{}); in main() 64 std::deque<MoveOnly, A> c2(A{}); in main() 67 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
|
D | deduct.pass.cpp | 38 std::deque deq(std::begin(arr), std::end(arr)); in main() 40 static_assert(std::is_same_v<decltype(deq), std::deque<int>>, ""); in main() 46 std::deque deq(std::begin(arr), std::end(arr), std::allocator<long>()); in main() 62 std::deque deq(1, A{}); // deque (size_type, T) in main() 69 std::deque deq(1, A{}, test_allocator<A>()); // deque (size_type, T, allocator) in main() 76 std::deque deq{1U, 2U, 3U, 4U, 5U}; // deque(initializer-list) in main() 83 …std::deque deq({1.0, 2.0, 3.0, 4.0}, test_allocator<double>()); // deque(initializer-list, allocat… in main() 91 std::deque<long double> source; in main() 92 std::deque deq(source); // deque(deque &) in main()
|
/external/libcxx/include/ |
D | deque | 2 //===---------------------------- deque -----------------------------------===// 15 deque synopsis 21 class deque 41 deque() noexcept(is_nothrow_default_constructible<allocator_type>::value); 42 explicit deque(const allocator_type& a); 43 explicit deque(size_type n); 44 explicit deque(size_type n, const allocator_type& a); // C++14 45 deque(size_type n, const value_type& v); 46 deque(size_type n, const value_type& v, const allocator_type& a); 48 deque(InputIterator f, InputIterator l); [all …]
|
/external/libcxx/include/experimental/ |
D | deque | 2 //===--------------------------- deque ------------------------------------===// 14 experimental/deque synopsis 23 using deque = std::deque<T,polymorphic_allocator<T>>; 33 #include <deque> 43 using deque = _VSTD::deque<_ValueT, polymorphic_allocator<_ValueT>>;
|
/external/llvm-project/libcxx/include/experimental/ |
D | deque | 2 //===--------------------------- deque ------------------------------------===// 13 experimental/deque synopsis 22 using deque = std::deque<T,polymorphic_allocator<T>>; 32 #include <deque> 42 using deque = _VSTD::deque<_ValueT, polymorphic_allocator<_ValueT>>;
|
/external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
D | access.pass.cpp | 54 std::deque<int> c = make<std::deque<int> >(10); in main() 63 const std::deque<int> c = make<std::deque<int> >(10); in main() 73 std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10); in main() 82 … const std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10); in main()
|
/external/llvm-project/libcxx/include/ |
D | deque | 2 //===---------------------------- deque -----------------------------------===// 14 deque synopsis 20 class deque 40 deque() noexcept(is_nothrow_default_constructible<allocator_type>::value); 41 explicit deque(const allocator_type& a); 42 explicit deque(size_type n); 43 explicit deque(size_type n, const allocator_type& a); // C++14 44 deque(size_type n, const value_type& v); 45 deque(size_type n, const value_type& v, const allocator_type& a); 47 deque(InputIterator f, InputIterator l); [all …]
|
/external/rust/crates/crossbeam-deque/ |
D | METADATA | 1 name: "crossbeam-deque" 2 description: "Concurrent work-stealing deque" 6 value: "https://crates.io/crates/crossbeam-deque" 10 value: "https://static.crates.io/crates/crossbeam-deque/crossbeam-deque-0.8.0.crate"
|