File: insert_iter_value.pass.cpp

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.7-1
  • links: PTS, VCS
  • area: main
  • in suites: forky
  • size: 2,245,064 kB
  • sloc: cpp: 7,619,731; ansic: 1,434,018; asm: 1,058,748; python: 252,740; f90: 94,671; objc: 70,685; lisp: 42,813; pascal: 18,401; sh: 8,601; ml: 5,111; perl: 4,720; makefile: 3,676; awk: 3,523; javascript: 2,409; xml: 892; fortran: 770
file content (97 lines) | stat: -rw-r--r-- 2,582 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// <vector>
// vector<bool>

// iterator insert(const_iterator position, const value_type& x);

#include <vector>
#include <cassert>
#include <cstddef>

#include "test_macros.h"
#include "min_allocator.h"

TEST_CONSTEXPR_CXX20 bool tests() {
  {
    std::vector<bool> v(100);
    std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1);
    assert(v.size() == 101);
    assert(i == v.begin() + 10);
    std::size_t j;
    for (j = 0; j < 10; ++j)
      assert(v[j] == 0);
    assert(v[j] == 1);
    for (++j; j < v.size(); ++j)
      assert(v[j] == 0);
  }
  {
    std::vector<bool> v(100);
    while (v.size() < v.capacity())
      v.push_back(false);
    std::size_t sz                = v.size();
    std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1);
    assert(v.size() == sz + 1);
    assert(i == v.begin() + 10);
    std::size_t j;
    for (j = 0; j < 10; ++j)
      assert(v[j] == 0);
    assert(v[j] == 1);
    for (++j; j < v.size(); ++j)
      assert(v[j] == 0);
  }
  {
    std::vector<bool> v(100);
    while (v.size() < v.capacity())
      v.push_back(false);
    v.pop_back();
    v.pop_back();
    std::size_t sz                = v.size();
    std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1);
    assert(v.size() == sz + 1);
    assert(i == v.begin() + 10);
    std::size_t j;
    for (j = 0; j < 10; ++j)
      assert(v[j] == 0);
    assert(v[j] == 1);
    for (++j; j < v.size(); ++j)
      assert(v[j] == 0);
  }
#if TEST_STD_VER >= 11
  {
    std::vector<bool, explicit_allocator<bool>> v(10);
    std::vector<bool, explicit_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 1);
    assert(v.size() == 11);
    assert(i == v.begin() + 10);
    assert(*i == 1);
  }
  {
    std::vector<bool, min_allocator<bool>> v(100);
    std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 1);
    assert(v.size() == 101);
    assert(i == v.begin() + 10);
    std::size_t j;
    for (j = 0; j < 10; ++j)
      assert(v[j] == 0);
    assert(v[j] == 1);
    for (++j; j < v.size(); ++j)
      assert(v[j] == 0);
  }
#endif

  return true;
}

int main(int, char**) {
  tests();
#if TEST_STD_VER > 17
  static_assert(tests());
#endif
  return 0;
}