| /external/chromium_org/google_apis/gcm/engine/ |
| mcs_client.h | 8 #include <deque>
238 std::deque<MCSPacketInternal> to_send_;
239 std::deque<MCSPacketInternal> to_resend_;
|
| /external/chromium_org/gpu/command_buffer/client/ |
| query_tracker.h | 10 #include <deque>
70 std::deque<Bucket*> buckets_;
71 std::deque<QueryInfo> free_queries_;
|
| /external/chromium_org/net/websockets/ |
| websocket_deflater.cc | 9 #include <deque>
100 std::deque<char>::iterator begin = buffer_.begin();
101 std::deque<char>::iterator end = begin + std::min(size, buffer_.size());
|
| /external/libcxx/test/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 10 // <deque>
14 #include <deque>
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
|
| resize_size_value.pass.cpp | 10 // <deque>
14 #include <deque>
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
|
| /external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 10 // <deque>
14 #include <deque>
100 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
108 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]);
|
| erase_iter.pass.cpp | 10 // <deque>
14 #include <deque>
79 testN<std::deque<int> >(rng[i], rng[j]);
87 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| erase_iter_iter.pass.cpp | 10 // <deque>
14 #include <deque>
83 testN<std::deque<int> >(rng[i], rng[j]);
91 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| insert_rvalue.pass.cpp | 10 // <deque>
14 #include <deque>
106 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]);
|
| /external/libcxx/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
77 testN<std::deque<int> >(rng[i], rng[j]);
85 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| copy_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]);
|
| /external/stlport/test/eh/ |
| test_deque.cpp | 24 # include <deque>
27 # include <deque.h>
39 typedef EH_STD::deque<DQTestClass, eh_allocator(DQTestClass) > TestDeque;
|
| /external/stlport/test/unit/ |
| mvctor_test.cpp | 8 #include <deque>
150 standard_test1(deque<int>(10));
166 CheckFullMoveSupport(deque<int>());
178 deque<vector<int> > vect_deque;
208 deque<vector<int> > vect_deque;
237 deque<vector<int> > vect_deque;
239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end());
246 // This check, repeated after each operation, check the deque consistency:
247 deque<vector<int> >::iterator it = vect_deque.end() - 5;
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 10 // <deque>
14 #include <deque>
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
|
| resize_size_value.pass.cpp | 10 // <deque>
14 #include <deque>
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 10 // <deque>
14 #include <deque>
100 testN<std::deque<Emplaceable> >(rng[i], rng[j]);
108 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]);
|
| erase_iter.pass.cpp | 10 // <deque>
14 #include <deque>
79 testN<std::deque<int> >(rng[i], rng[j]);
87 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| erase_iter_iter.pass.cpp | 10 // <deque>
14 #include <deque>
83 testN<std::deque<int> >(rng[i], rng[j]);
91 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| insert_rvalue.pass.cpp | 10 // <deque>
14 #include <deque>
106 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
77 testN<std::deque<int> >(rng[i], rng[j]);
85 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| copy_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
| move_backward.pass.cpp | 10 // <deque>
12 // Optimization for deque::iterators
18 #include <deque>
76 testN<std::deque<int> >(rng[i], rng[j]);
84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]);
|
