| /external/libcxx/test/containers/sequences/deque/deque.cons/ |
| default.pass.cpp | 10 // <deque>
12 // deque()
14 #include <deque>
25 std::deque<T, Allocator> d;
28 std::deque<T, Allocator> d1 = {};
|
| initializer_list.pass.cpp | 10 // <deque>
12 // deque(initializer_list<value_type> il);
14 #include <deque>
23 std::deque<int> d = {3, 4, 5, 6};
32 std::deque<int, min_allocator<int>> d = {3, 4, 5, 6};
|
| op_equal_initializer_list.pass.cpp | 10 // <deque>
12 // deque& operator=(initializer_list<value_type> il);
14 #include <deque>
23 std::deque<int> d;
33 std::deque<int, min_allocator<int>> d;
|
| copy.pass.cpp | 10 // <deque>
12 // deque(const deque&);
14 #include <deque>
32 test(std::deque<int>(ab, an));
35 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5));
36 std::deque<int, test_allocator<int> > v2 = v;
42 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5));
43 std::deque<int, other_allocator<int> > v2 = v;
52 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| op_equal.pass.cpp | 10 // <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<int, min_allocator<int>>(ab, an))
[all...] |
| dtor_noexcept.pass.cpp | 10 // <deque>
12 // ~deque() // implied noexcept;
14 #include <deque>
36 typedef std::deque<MoveOnly> C;
40 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
44 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
48 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| assign_initializer_list.pass.cpp | 10 // <deque>
14 #include <deque>
23 std::deque<int> d;
33 std::deque<int, min_allocator<int>> d;
|
| default.pass.cpp | 10 // <deque>
12 // deque()
14 #include <deque>
25 std::deque<T, Allocator> d;
28 std::deque<T, Allocator> d1 = {};
|
| initializer_list.pass.cpp | 10 // <deque>
12 // deque(initializer_list<value_type> il);
14 #include <deque>
23 std::deque<int> d = {3, 4, 5, 6};
32 std::deque<int, min_allocator<int>> d = {3, 4, 5, 6};
|
| op_equal_initializer_list.pass.cpp | 10 // <deque>
12 // deque& operator=(initializer_list<value_type> il);
14 #include <deque>
23 std::deque<int> d;
33 std::deque<int, min_allocator<int>> d;
|
| copy.pass.cpp | 10 // <deque>
12 // deque(const deque&);
14 #include <deque>
32 test(std::deque<int>(ab, an));
35 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5));
36 std::deque<int, test_allocator<int> > v2 = v;
42 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5));
43 std::deque<int, other_allocator<int> > v2 = v;
52 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| op_equal.pass.cpp | 10 // <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<int, min_allocator<int>>(ab, an))
[all...] |
| dtor_noexcept.pass.cpp | 10 // <deque>
12 // ~deque() // implied noexcept;
14 #include <deque>
36 typedef std::deque<MoveOnly> C;
40 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
44 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
48 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| /external/chromium_org/cc/resources/ |
| resource_update_queue.h | 8 #include <deque>
34 void ClearUploadsToEvictedResources(std::deque<ResourceUpdate>* entry_queue);
35 std::deque<ResourceUpdate> full_entries_;
36 std::deque<ResourceUpdate> partial_entries_;
|
| /external/eigen/Eigen/src/StlSupport/ |
| StdDeque.h | 18 #define EIGEN_EXPLICIT_STL_DEQUE_INSTANTIATION(...) template class std::deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >;
25 * std::deque such that for data types with alignment issues the correct allocator
33 class deque<__VA_ARGS__, _Ay> \
34 : public deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
36 typedef deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > deque_base; \
42 explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \
44 deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \
45 deque(const deque& c) : deque_base(c) {} \
46 explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {}
80 class deque<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std
[all...] |
| /external/chromium_org/components/history/core/browser/ |
| history_match.h | 8 #include <deque>
53 typedef std::deque<HistoryMatch> HistoryMatches;
|
| /external/chromium_org/components/pairing/ |
| message_buffer.h | 8 #include <deque>
45 std::deque<std::pair<scoped_refptr<net::IOBuffer>, int> > pending_data_;
|
| /external/chromium_org/media/cast/net/rtp/ |
| packet_storage.h | 8 #include <deque>
36 std::deque<SendPacketVector> frames_;
|
| /external/chromium_org/net/spdy/ |
| spdy_read_queue.h | 9 #include <deque>
43 std::deque<SpdyBuffer*> queue_;
|
| /external/chromium_org/remoting/base/ |
| running_average.h | 8 #include <deque>
39 std::deque<int64> data_points_;
|
| /external/libcxx/test/containers/sequences/deque/deque.special/ |
| swap_noexcept.pass.cpp | 10 // <deque>
12 // void swap(deque& c)
18 #include <deque>
40 typedef std::deque<MoveOnly> C;
45 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
50 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
55 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| /external/stlport/test/unit/ |
| finsert_test.cpp | 3 #include <deque>
34 deque<char const*> names;
35 front_insert_iterator<deque<char const*> > fit(names);
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
52 deque<char const*> names;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| swap_noexcept.pass.cpp | 10 // <deque>
12 // void swap(deque& c)
18 #include <deque>
40 typedef std::deque<MoveOnly> C;
45 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C;
50 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C;
55 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C;
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| finsert_test.cpp | 3 #include <deque>
34 deque<char const*> names;
35 front_insert_iterator<deque<char const*> > fit(names);
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
52 deque<char const*> names;
|
| /ndk/tests/device/test-stlport/unit/ |
| finsert_test.cpp | 3 #include <deque>
34 deque<char const*> names;
35 front_insert_iterator<deque<char const*> > fit(names);
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
52 deque<char const*> names;
|
