| 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | // See https://llvm.org/LICENSE.txt for license information. |
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
| 8 | |
| 9 | // UNSUPPORTED: c++03 && !stdlib=libc++ |
| 10 | |
| 11 | // <vector> |
| 12 | |
| 13 | // void push_back(value_type&& x); |
| 14 | |
| 15 | #include <vector> |
| 16 | #include <cassert> |
| 17 | #include <cstddef> |
| 18 | #include "test_macros.h" |
| 19 | #include "MoveOnly.h" |
| 20 | #include "test_allocator.h" |
| 21 | #include "min_allocator.h" |
| 22 | #include "asan_testing.h" |
| 23 | |
| 24 | TEST_CONSTEXPR_CXX20 bool tests() { |
| 25 | { |
| 26 | std::vector<MoveOnly> c; |
| 27 | c.push_back(MoveOnly(0)); |
| 28 | assert(c.size() == 1); |
| 29 | assert(is_contiguous_container_asan_correct(c)); |
| 30 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 31 | assert(c[j] == MoveOnly(j)); |
| 32 | c.push_back(MoveOnly(1)); |
| 33 | assert(c.size() == 2); |
| 34 | assert(is_contiguous_container_asan_correct(c)); |
| 35 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 36 | assert(c[j] == MoveOnly(j)); |
| 37 | c.push_back(MoveOnly(2)); |
| 38 | assert(c.size() == 3); |
| 39 | assert(is_contiguous_container_asan_correct(c)); |
| 40 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 41 | assert(c[j] == MoveOnly(j)); |
| 42 | c.push_back(MoveOnly(3)); |
| 43 | assert(c.size() == 4); |
| 44 | assert(is_contiguous_container_asan_correct(c)); |
| 45 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 46 | assert(c[j] == MoveOnly(j)); |
| 47 | c.push_back(MoveOnly(4)); |
| 48 | assert(c.size() == 5); |
| 49 | assert(is_contiguous_container_asan_correct(c)); |
| 50 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 51 | assert(c[j] == MoveOnly(j)); |
| 52 | } |
| 53 | { |
| 54 | // libc++ needs 15 because it grows by 2x (1 + 2 + 4 + 8). |
| 55 | // Use 17 for implementations that dynamically allocate a container proxy |
| 56 | // and grow by 1.5x (1 for proxy + 1 + 2 + 3 + 4 + 6). |
| 57 | std::vector<MoveOnly, limited_allocator<MoveOnly, 17> > c; |
| 58 | c.push_back(MoveOnly(0)); |
| 59 | assert(c.size() == 1); |
| 60 | assert(is_contiguous_container_asan_correct(c)); |
| 61 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 62 | assert(c[j] == MoveOnly(j)); |
| 63 | c.push_back(MoveOnly(1)); |
| 64 | assert(c.size() == 2); |
| 65 | assert(is_contiguous_container_asan_correct(c)); |
| 66 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 67 | assert(c[j] == MoveOnly(j)); |
| 68 | c.push_back(MoveOnly(2)); |
| 69 | assert(c.size() == 3); |
| 70 | assert(is_contiguous_container_asan_correct(c)); |
| 71 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 72 | assert(c[j] == MoveOnly(j)); |
| 73 | c.push_back(MoveOnly(3)); |
| 74 | assert(c.size() == 4); |
| 75 | assert(is_contiguous_container_asan_correct(c)); |
| 76 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 77 | assert(c[j] == MoveOnly(j)); |
| 78 | c.push_back(MoveOnly(4)); |
| 79 | assert(c.size() == 5); |
| 80 | assert(is_contiguous_container_asan_correct(c)); |
| 81 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 82 | assert(c[j] == MoveOnly(j)); |
| 83 | } |
| 84 | { |
| 85 | std::vector<MoveOnly, min_allocator<MoveOnly> > c; |
| 86 | c.push_back(MoveOnly(0)); |
| 87 | assert(c.size() == 1); |
| 88 | assert(is_contiguous_container_asan_correct(c)); |
| 89 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 90 | assert(c[j] == MoveOnly(j)); |
| 91 | c.push_back(MoveOnly(1)); |
| 92 | assert(c.size() == 2); |
| 93 | assert(is_contiguous_container_asan_correct(c)); |
| 94 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 95 | assert(c[j] == MoveOnly(j)); |
| 96 | c.push_back(MoveOnly(2)); |
| 97 | assert(c.size() == 3); |
| 98 | assert(is_contiguous_container_asan_correct(c)); |
| 99 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 100 | assert(c[j] == MoveOnly(j)); |
| 101 | c.push_back(MoveOnly(3)); |
| 102 | assert(c.size() == 4); |
| 103 | assert(is_contiguous_container_asan_correct(c)); |
| 104 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 105 | assert(c[j] == MoveOnly(j)); |
| 106 | c.push_back(MoveOnly(4)); |
| 107 | assert(c.size() == 5); |
| 108 | assert(is_contiguous_container_asan_correct(c)); |
| 109 | for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) |
| 110 | assert(c[j] == MoveOnly(j)); |
| 111 | } |
| 112 | |
| 113 | return true; |
| 114 | } |
| 115 | |
| 116 | int main(int, char**) { |
| 117 | tests(); |
| 118 | #if TEST_STD_VER > 17 |
| 119 | static_assert(tests()); |
| 120 | #endif |
| 121 | return 0; |
| 122 | } |
| 123 | |