| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| D | insert_iter_iter.pass.cpp | 57 std::size_t c1_osize = c1.size(); in test() local
60 assert(c1.size() == c1_osize + c2.size()); in test()
67 for (int j = P; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
74 std::size_t c1_osize = c1.size(); in test() local
77 assert(c1.size() == c1_osize + c2.size()); in test()
84 for (int j = P; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
91 std::size_t c1_osize = c1.size(); in test() local
94 assert(c1.size() == c1_osize + c2.size()); in test()
101 for (int j = P; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
172 std::size_t c1_osize = c1.size(); in testI() local
[all …]
|
| D | push_front.pass.cpp | 47 std::size_t c1_osize = c1.size(); in test() local
49 assert(c1.size() == c1_osize + 1); in test()
54 for (int j = 0; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
|
| D | push_front_rvalue.pass.cpp | 50 std::size_t c1_osize = c1.size(); in test() local
52 assert(c1.size() == c1_osize + 1); in test()
57 for (int j = 0; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
|
| D | erase_iter.pass.cpp | 50 std::size_t c1_osize = c1.size(); in test() local
53 assert(c1.size() == c1_osize - 1); in test()
59 for (++j; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
|
| D | erase_iter_iter.pass.cpp | 52 std::size_t c1_osize = c1.size(); in test() local
55 assert(c1.size() == c1_osize - size); in test()
61 for (j += size; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
|
| D | insert_rvalue.pass.cpp | 51 std::size_t c1_osize = c1.size(); in test() local
54 assert(c1.size() == c1_osize + 1); in test()
61 for (int j = P; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
|
| D | insert_value.pass.cpp | 48 std::size_t c1_osize = c1.size(); in test() local
51 assert(c1.size() == c1_osize + 1); in test()
58 for (int j = P; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
|
| D | insert_size_value.pass.cpp | 50 std::size_t c1_osize = c1.size(); in test() local
53 assert(c1.size() == c1_osize + size); in test()
60 for (int j = P; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) in test()
|
| D | pop_back.pass.cpp | 47 std::size_t c1_osize = c1.size(); in test() local
49 assert(c1.size() == c1_osize - 1); in test()
|
| D | pop_front.pass.cpp | 47 std::size_t c1_osize = c1.size(); in test() local
49 assert(c1.size() == c1_osize - 1); in test()
|
| D | emplace_front.pass.cpp | 53 std::size_t c1_osize = c1.size(); in test() local
60 assert(c1.size() == c1_osize + 1); in test()
|
| D | emplace.pass.cpp | 51 std::size_t c1_osize = c1.size(); in test() local
54 assert(c1.size() == c1_osize + 1); in test()
|
| D | emplace_back.pass.cpp | 53 std::size_t c1_osize = c1.size(); in test() local
60 assert(c1.size() == c1_osize + 1); in test()
|
| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| D | resize_size.pass.cpp | 50 typename C::size_type c1_osize = c1.size(); in test() local
55 for (int j = 0; static_cast<std::size_t>(j) < std::min(c1_osize, c1.size()); ++j, ++i) in test()
57 for (std::size_t j = c1_osize; j < c1.size(); ++j, ++i) in test()
|
| D | resize_size_value.pass.cpp | 50 typename C::size_type c1_osize = c1.size(); in test() local
55 for (int j = 0; static_cast<std::size_t>(j) < std::min(c1_osize, c1.size()); ++j, ++i) in test()
57 for (std::size_t j = c1_osize; j < c1.size(); ++j, ++i) in test()
|