| /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 | 149 dequeobject *deque; in deque_new() local
153 deque = (dequeobject *)type->tp_alloc(type, 0); in deque_new()
154 if (deque == NULL) in deque_new()
159 Py_DECREF(deque); in deque_new()
166 Py_SIZE(deque) = 0; in deque_new()
167 deque->leftblock = b; in deque_new()
168 deque->rightblock = b; in deque_new()
169 deque->leftindex = CENTER + 1; in deque_new()
170 deque->rightindex = CENTER; in deque_new()
171 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/perfetto/src/trace_processor/ |
| D | trace_storage.h | 175 const std::deque<ArgSetId>& set_ids() const { return set_ids_; } in set_ids()
176 const std::deque<StringId>& flat_keys() const { return flat_keys_; } in flat_keys()
177 const std::deque<StringId>& keys() const { return keys_; } in keys()
178 const std::deque<Variadic>& arg_values() const { return arg_values_; } in arg_values()
213 std::deque<ArgSetId> set_ids_;
214 std::deque<StringId> flat_keys_;
215 std::deque<StringId> keys_;
216 std::deque<Variadic> arg_values_;
252 const std::deque<uint32_t>& cpus() const { return cpus_; } in cpus()
254 const std::deque<int64_t>& start_ns() const { return start_ns_; } in start_ns()
[all …]
|
| D | storage_columns.h | 309 StringPoolAccessor(const std::deque<StringPool::Id>* deque,
322 const std::deque<StringPool::Id>* deque_;
331 StringVectorAccessor(const std::deque<Id>* deque, in StringVectorAccessor() argument
333 : deque_(deque), string_map_(string_map) {} in StringVectorAccessor()
346 const std::deque<Id>* deque_;
355 NumericDequeAccessor(const std::deque<NumericType>* deque, in NumericDequeAccessor() argument
356 const std::deque<std::vector<uint32_t>>* index, in NumericDequeAccessor()
358 : deque_(deque), index_(index), has_ordering_(has_ordering) {} in NumericDequeAccessor()
393 const std::deque<NumericType>* deque_ = nullptr;
394 const std::deque<std::vector<uint32_t>>* index_ = nullptr;
[all …]
|
| D | storage_columns.cc | 26 StringPoolAccessor::StringPoolAccessor(const std::deque<StringId>* deque, in StringPoolAccessor() argument
28 : deque_(deque), string_pool_(string_pool) {} in StringPoolAccessor()
31 TsEndAccessor::TsEndAccessor(const std::deque<int64_t>* ts, in TsEndAccessor()
32 const std::deque<int64_t>* dur) in TsEndAccessor()
|
| /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/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 …]
|
| D | swap_noexcept.pass.cpp | 59 typedef std::deque<MoveOnly> C; in main()
64 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
68 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
73 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
83 typedef std::deque<MoveOnly, some_alloc2<MoveOnly>> C; in main()
|
| /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()
|
| D | assign_iter_iter.pass.cpp | 94 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in basic_test()
95 testNI<std::deque<int> >(1500, 2000, 1000); in basic_test()
104 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in basic_test()
105 testNI<std::deque<int, min_allocator<int>> >(1500, 2000, 1000); in basic_test()
118 std::deque<T> v; in test_emplacable_concept()
123 std::deque<T> v; in test_emplacable_concept()
134 std::deque<T> v; in test_emplacable_concept()
140 std::deque<T> v; in test_emplacable_concept()
|
| /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/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/eigen/test/ |
| D | stddeque.cpp | 23 …std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y… in check_stddeque_matrix()
29 typename std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator vi = v.begin(); in check_stddeque_matrix()
30 typename std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator wi = w.begin(); in check_stddeque_matrix()
52 std::deque<TransformType,Eigen::aligned_allocator<TransformType> > v(10), w(20, y); in check_stddeque_transform()
58 …typename std::deque<TransformType,Eigen::aligned_allocator<TransformType> >::iterator vi = v.begin… in check_stddeque_transform()
59 …typename std::deque<TransformType,Eigen::aligned_allocator<TransformType> >::iterator wi = w.begin… in check_stddeque_transform()
81 std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> > v(10), w(20, y); in check_stddeque_quaternion()
87 …typename std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator vi = v.beg… in check_stddeque_quaternion()
88 …typename std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator wi = w.beg… in check_stddeque_quaternion()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | Queues.java | 75 ArrayDeque<E> deque = new ArrayDeque<E>(); in newArrayDeque() local
76 Iterables.addAll(deque, elements); in newArrayDeque()
77 return deque; in newArrayDeque()
135 LinkedBlockingDeque<E> deque = new LinkedBlockingDeque<E>(); in newLinkedBlockingDeque() local
136 Iterables.addAll(deque, elements); in newLinkedBlockingDeque()
137 return deque; in newLinkedBlockingDeque()
394 public static <E> Deque<E> synchronizedDeque(Deque<E> deque) { in synchronizedDeque() argument
395 return Synchronized.deque(deque, null); in synchronizedDeque()
|
| /external/libcxx/test/std/containers/sequences/deque/ |
| D | iterators.pass.cpp | 29 typedef std::deque<int> C; in main()
39 typedef std::deque<int, min_allocator<int>> C; in main()
50 std::deque<int>::iterator ii1{}, ii2{}; in main()
51 std::deque<int>::iterator ii4 = ii1; in main()
52 std::deque<int>::const_iterator cii{}; in main()
|
| /external/libcxx/test/std/containers/sequences/deque/deque.erasure/ |
| D | erase.pass.cpp | 72 test<std::deque<int>>(); in main()
73 test<std::deque<int, min_allocator<int>>> (); in main()
74 test<std::deque<int, test_allocator<int>>> (); in main()
76 test<std::deque<long>>(); in main()
77 test<std::deque<double>>(); in main()
|
| /external/libcxx/test/std/containers/container.adaptors/priority.queue/ |
| D | types.pass.cpp | 57 …tic_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::container_type, std::deque<i… in main()
58 …static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_type, int>::value),… in main()
63 …static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_compare, std::less<… in main()
64 …static_assert(( std::is_same<std::priority_queue<int, std::deque<int>, std::greater<int> >::value_… in main()
|