| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 47 typename C::size_type c1_osize = c1.size(); local
52 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
54 for (int j = c1_osize; j < c1.size(); ++j, ++i)
|
| resize_size_value.pass.cpp | 47 typename C::size_type c1_osize = c1.size(); local
52 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
54 for (int j = c1_osize; j < c1.size(); ++j, ++i)
|
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| push_front.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
48 assert(c1.size() == c1_osize + 1);
53 for (int j = 0; j < c1_osize; ++j, ++i)
|
| push_front_rvalue.pass.cpp | 49 std::size_t c1_osize = c1.size(); local
51 assert(c1.size() == c1_osize + 1);
56 for (int j = 0; j < c1_osize; ++j, ++i)
|
| erase_iter.pass.cpp | 47 std::size_t c1_osize = c1.size();
50 assert(c1.size() == c1_osize - 1);
56 for (++j; j < c1_osize; ++j, ++i)
|
| erase_iter_iter.pass.cpp | 49 std::size_t c1_osize = c1.size(); local
52 assert(c1.size() == c1_osize - size);
58 for (j += size; j < c1_osize; ++j, ++i)
|
| insert_iter_iter.pass.cpp | 56 std::size_t c1_osize = c1.size(); local
59 assert(c1.size() == c1_osize + c2.size());
66 for (int j = P; j < c1_osize; ++j, ++i)
73 std::size_t c1_osize = c1.size(); local
76 assert(c1.size() == c1_osize + c2.size());
83 for (int j = P; j < c1_osize; ++j, ++i)
90 std::size_t c1_osize = c1.size(); local
93 assert(c1.size() == c1_osize + c2.size());
100 for (int j = P; j < c1_osize; ++j, ++i)
171 std::size_t c1_osize = c1.size() local
[all...] |
| insert_rvalue.pass.cpp | 50 std::size_t c1_osize = c1.size(); local
53 assert(c1.size() == c1_osize + 1);
60 for (int j = P; j < c1_osize; ++j, ++i)
|
| emplace_back.pass.cpp | 49 std::size_t c1_osize = c1.size(); local
51 assert(c1.size() == c1_osize + 1);
|
| emplace_front.pass.cpp | 49 std::size_t c1_osize = c1.size(); local
51 assert(c1.size() == c1_osize + 1);
|
| pop_back.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
48 assert(c1.size() == c1_osize - 1);
|
| pop_front.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
48 assert(c1.size() == c1_osize - 1);
|
| insert_value.pass.cpp | 47 std::size_t c1_osize = c1.size(); local
50 assert(c1.size() == c1_osize + 1);
57 for (int j = P; j < c1_osize; ++j, ++i)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| push_front.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
48 assert(c1.size() == c1_osize + 1);
53 for (int j = 0; j < c1_osize; ++j, ++i)
|
| push_front_rvalue.pass.cpp | 49 std::size_t c1_osize = c1.size(); local
51 assert(c1.size() == c1_osize + 1);
56 for (int j = 0; j < c1_osize; ++j, ++i)
|
| erase_iter.pass.cpp | 47 std::size_t c1_osize = c1.size();
50 assert(c1.size() == c1_osize - 1);
56 for (++j; j < c1_osize; ++j, ++i)
|
| erase_iter_iter.pass.cpp | 47 std::size_t c1_osize = c1.size(); local
50 assert(c1.size() == c1_osize - size);
56 for (j += size; j < c1_osize; ++j, ++i)
|
| insert_rvalue.pass.cpp | 50 std::size_t c1_osize = c1.size(); local
53 assert(c1.size() == c1_osize + 1);
60 for (int j = P; j < c1_osize; ++j, ++i)
|
| emplace_back.pass.cpp | 49 std::size_t c1_osize = c1.size(); local
51 assert(c1.size() == c1_osize + 1);
|
| emplace_front.pass.cpp | 49 std::size_t c1_osize = c1.size(); local
51 assert(c1.size() == c1_osize + 1);
|
| pop_back.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
48 assert(c1.size() == c1_osize - 1);
|
| pop_front.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
48 assert(c1.size() == c1_osize - 1);
|
| insert_value.pass.cpp | 47 std::size_t c1_osize = c1.size(); local
50 assert(c1.size() == c1_osize + 1);
57 for (int j = P; j < c1_osize; ++j, ++i)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i)
|
| resize_size_value.pass.cpp | 46 std::size_t c1_osize = c1.size(); local
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i)
|
