| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| swap.pass.cpp | 10 // <deque>
13 // void swap(deque<T, A>& x, deque<T, A>& y);
15 #include <deque>
62 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2));
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1))
[all...] |
| /external/libcxx/test/containers/sequences/deque/deque.cons/ |
| move.pass.cpp | 10 // <deque>
12 // deque(deque&&);
14 #include <deque>
28 std::deque<MoveOnly, A> c1(A(1));
31 std::deque<MoveOnly, A> c2(A(2));
34 std::deque<MoveOnly, A> c3 = std::move(c1);
43 std::deque<MoveOnly, A> c1(A(1));
46 std::deque<MoveOnly, A> c2(A(2));
49 std::deque<MoveOnly, A> c3 = std::move(c1)
[all...] |
| move_alloc.pass.cpp | 10 // <deque>
12 // deque(deque&& c, const allocator_type& a);
14 #include <deque>
28 std::deque<MoveOnly, A> c1(A(1));
31 std::deque<MoveOnly, A> c2(A(1));
34 std::deque<MoveOnly, A> c3(std::move(c1), A(3));
43 std::deque<MoveOnly, A> c1(A(1));
46 std::deque<MoveOnly, A> c2(A(1));
49 std::deque<MoveOnly, A> c3(std::move(c1), A(1))
[all...] |
| move_assign.pass.cpp | 10 // <deque>
12 // deque& operator=(deque&& c);
14 #include <deque>
28 std::deque<MoveOnly, A> c1(A(5));
31 std::deque<MoveOnly, A> c2(A(5));
34 std::deque<MoveOnly, A> c3(A(5));
44 std::deque<MoveOnly, A> c1(A(5));
47 std::deque<MoveOnly, A> c2(A(5));
50 std::deque<MoveOnly, A> c3(A(6))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| move.pass.cpp | 10 // <deque>
12 // deque(deque&&);
14 #include <deque>
28 std::deque<MoveOnly, A> c1(A(1));
31 std::deque<MoveOnly, A> c2(A(2));
34 std::deque<MoveOnly, A> c3 = std::move(c1);
43 std::deque<MoveOnly, A> c1(A(1));
46 std::deque<MoveOnly, A> c2(A(2));
49 std::deque<MoveOnly, A> c3 = std::move(c1)
[all...] |
| move_alloc.pass.cpp | 10 // <deque>
12 // deque(deque&& c, const allocator_type& a);
14 #include <deque>
28 std::deque<MoveOnly, A> c1(A(1));
31 std::deque<MoveOnly, A> c2(A(1));
34 std::deque<MoveOnly, A> c3(std::move(c1), A(3));
43 std::deque<MoveOnly, A> c1(A(1));
46 std::deque<MoveOnly, A> c2(A(1));
49 std::deque<MoveOnly, A> c3(std::move(c1), A(1))
[all...] |
| move_assign.pass.cpp | 10 // <deque>
12 // deque& operator=(deque&& c);
14 #include <deque>
28 std::deque<MoveOnly, A> c1(A(5));
31 std::deque<MoveOnly, A> c2(A(5));
34 std::deque<MoveOnly, A> c3(A(5));
44 std::deque<MoveOnly, A> c1(A(5));
47 std::deque<MoveOnly, A> c2(A(5));
50 std::deque<MoveOnly, A> c3(A(6))
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_deque.py | 1 from collections import deque namespace
22 def __init__(self, deque, result):
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)
56 self.assertEqual(repr(d), 'deque([7, 8, 9], maxlen=3)'
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_deque.py | 1 from collections import deque namespace
22 def __init__(self, deque, result):
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)
56 self.assertEqual(repr(d), 'deque([7, 8, 9], maxlen=3)'
[all...] |
| /external/chromium_org/content/child/indexed_db/ |
| webidbcursor_impl.h | 8 #include <deque>
71 std::deque<IndexedDBKey> prefetch_keys_;
72 std::deque<IndexedDBKey> prefetch_primary_keys_;
73 std::deque<blink::WebData> prefetch_values_;
74 std::deque<blink::WebVector<blink::WebBlobInfo> > prefetch_blob_info_;
|
| /external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_iter_initializer_list.pass.cpp | 10 // <deque>
14 #include <deque>
23 std::deque<int> d(10, 1);
24 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6});
43 std::deque<int, min_allocator<int>> d(10, 1);
44 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6});
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_iter_initializer_list.pass.cpp | 10 // <deque>
14 #include <deque>
23 std::deque<int> d(10, 1);
24 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6});
43 std::deque<int, min_allocator<int>> d(10, 1);
44 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6});
|
| /external/chromium_org/cc/base/ |
| scoped_ptr_deque.h | 9 #include <deque>
18 // This type acts like a deque<scoped_ptr> based on top of std::deque. The
19 // ScopedPtrDeque has ownership of all elements in the deque.
23 typedef typename std::deque<T*>::const_iterator const_iterator;
24 typedef typename std::deque<T*>::reverse_iterator reverse_iterator;
25 typedef typename std::deque<T*>::const_reverse_iterator
30 typedef typename std::deque<T*>::iterator iterator;
33 // to methods on the ScopedPtrDeque class to appear in the deque.
34 class iterator : public std::deque<T*>::iterator
[all...] |
| /external/chromium_org/chrome/browser/sync_file_system/ |
| task_logger.h | 8 #include <deque>
33 typedef std::deque<TaskLog*> LogList;
59 std::deque<TaskLog*> log_history_;
|
| /external/chromium_org/chrome/browser/chromeos/drive/ |
| job_queue.h | 8 #include <deque>
57 std::vector<std::deque<JobID> > queue_;
|
| /external/chromium_org/chrome/browser/ui/webui/ntp/ |
| suggestions_source_top_sites.h | 8 #include <deque>
56 std::deque<base::DictionaryValue*> items_;
|
| /external/chromium_org/media/base/ |
| audio_buffer_queue.h | 8 #include <deque>
62 typedef std::deque<scoped_refptr<AudioBuffer> > BufferQueue;
|
| /external/chromium_org/mojo/system/ |
| message_in_transit_queue.h | 8 #include <deque>
51 // TODO(vtl): When C++11 is available, switch this to a deque of
53 std::deque<MessageInTransit*> queue_;
|
| /external/chromium_org/net/websockets/ |
| websocket_deflater.h | 8 #include <deque>
68 std::deque<char> buffer_;
|
| websocket_throttle.h | 8 #include <deque>
50 typedef std::deque<WebSocketJob*> ConnectingQueue;
|
| /external/libcxx/test/containers/container.adaptors/queue/queue.cons/ |
| ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
| /external/libcxx/test/containers/container.adaptors/stack/stack.cons/ |
| ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.cons/ |
| ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.cons/ |
| ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
| /external/chromium_org/components/gcm_driver/ |
| gcm_stats_recorder_impl.h | 8 #include <deque>
97 const std::deque<CheckinActivity>& checkin_activities() const {
100 const std::deque<ConnectionActivity>& connection_activities() const {
103 const std::deque<RegistrationActivity>& registration_activities() const {
106 const std::deque<ReceivingActivity>& receiving_activities() const {
109 const std::deque<SendingActivity>& sending_activities() const {
144 std::deque<CheckinActivity> checkin_activities_;
145 std::deque<ConnectionActivity> connection_activities_;
146 std::deque<RegistrationActivity> registration_activities_;
147 std::deque<ReceivingActivity> receiving_activities_
[all...] |
