| /external/libcxx/test/containers/sequences/deque/deque.capacity/ |
| access.pass.cpp | 10 // <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<int, min_allocator<int>> >(10)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| access.pass.cpp | 10 // <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<int, min_allocator<int>> >(10)
[all...] |
| /external/chromium_org/base/test/ |
| test_simple_task_runner.h | 8 #include <deque>
60 const std::deque<TestPendingTask>& GetPendingTasks() const;
77 std::deque<TestPendingTask> pending_tasks_;
|
| /external/chromium_org/cc/test/ |
| ordered_simple_task_runner.cc | 8 #include <deque>
30 std::deque<base::TestPendingTask> tasks_to_run;
35 for (std::deque<base::TestPendingTask>::iterator it = tasks_to_run.begin();
|
| /external/chromium_org/chrome/browser/ui/app_modal_dialogs/ |
| app_modal_dialog_queue.h | 8 #include <deque>
21 typedef std::deque<AppModalDialog*>::iterator iterator;
76 std::deque<AppModalDialog*> app_modal_dialog_queue_;
|
| /external/libcxx/test/containers/sequences/deque/deque.cons/ |
| initializer_list_alloc.pass.cpp | 10 // <deque>
12 // deque(initializer_list<value_type> il, const Allocator& a = allocator_type());
14 #include <deque>
24 std::deque<int, test_allocator<int>> d({3, 4, 5, 6}, test_allocator<int>(3));
34 std::deque<int, min_allocator<int>> d({3, 4, 5, 6}, min_allocator<int>());
|
| copy_alloc.pass.cpp | 10 // <deque>
12 // deque(const deque& c, const allocator_type& a);
14 #include <deque>
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)),
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()),
|
| alloc.pass.cpp | 10 // <deque>
12 // explicit deque(const allocator_type& a);
14 #include <deque>
25 std::deque<T, Allocator> d(a);
|
| 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| initializer_list_alloc.pass.cpp | 10 // <deque>
12 // deque(initializer_list<value_type> il, const Allocator& a = allocator_type());
14 #include <deque>
24 std::deque<int, test_allocator<int>> d({3, 4, 5, 6}, test_allocator<int>(3));
34 std::deque<int, min_allocator<int>> d({3, 4, 5, 6}, min_allocator<int>());
|
| copy_alloc.pass.cpp | 10 // <deque>
12 // deque(const deque& c, const allocator_type& a);
14 #include <deque>
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)),
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()),
|
| alloc.pass.cpp | 10 // <deque>
12 // explicit deque(const allocator_type& a);
14 #include <deque>
25 std::deque<T, Allocator> d(a);
|
| 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...] |
| /external/libcxx/test/containers/sequences/deque/ |
| Android.mk | 17 test_makefile := external/libcxx/test/containers/sequences/deque/Android.mk
19 test_name := containers/sequences/deque/version
23 test_name := containers/sequences/deque/iterators
27 test_name := containers/sequences/deque/types
|
| iterators.pass.cpp | 10 // <deque>
15 // class deque;
19 #include <deque>
28 typedef std::deque<int> C;
38 typedef std::deque<int, min_allocator<int>> C;
49 std::deque<int>::iterator ii1{}, ii2{};
50 std::deque<int>::iterator ii4 = ii1;
51 std::deque<int>::const_iterator cii{};
72 // std::deque<int> c;
|
| /external/chromium_org/cc/base/ |
| rolling_time_delta_history.h | 8 #include <deque>
36 std::deque<TimeDeltaMultiset::iterator> chronological_sample_deque_;
|
| /external/chromium_org/media/base/ |
| decoder_buffer_queue.h | 8 #include <deque>
58 typedef std::deque<scoped_refptr<DecoderBuffer> > Queue;
|
| /external/chromium_org/media/cast/transport/rtp_sender/packet_storage/ |
| packet_storage.h | 8 #include <deque>
27 typedef std::deque<SendPacketVector> FrameQueue;
|
| /external/chromium_org/media/midi/ |
| midi_message_queue.h | 8 #include <deque>
64 std::deque<uint8> queue_;
|
| /external/chromium_org/chrome/browser/chromeos/power/ |
| power_data_collector.h | 8 #include <deque>
59 const std::deque<PowerSupplySample>& power_supply_data() const {
63 const std::deque<SystemResumedSample>& system_resumed_data() const {
98 std::deque<PowerSupplySample> power_supply_data_;
99 std::deque<SystemResumedSample> system_resumed_data_;
109 void AddSample(std::deque<SampleType>* sample_queue, const SampleType& sample) {
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/ |
| iterators.pass.cpp | 10 // <deque>
15 // class deque;
19 #include <deque>
28 typedef std::deque<int> C;
38 typedef std::deque<int, min_allocator<int>> C;
49 std::deque<int>::iterator ii1{}, ii2{};
50 std::deque<int>::iterator ii4 = ii1;
51 std::deque<int>::const_iterator cii{};
72 // std::deque<int> c;
|
| /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();
57 EXPECT_EQ(increment ? deque.end() : deque.begin(), it);
60 void checkNumberSequenceReverse(Deque<int>& deque, int from, int to, bool increment
[all...] |
| /external/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...] |
| /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...] |
