File: push_back.pass.cpp

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.0-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 2,235,796 kB
  • sloc: cpp: 7,617,614; ansic: 1,433,901; asm: 1,058,726; python: 252,096; f90: 94,671; objc: 70,753; lisp: 42,813; pascal: 18,401; sh: 10,032; ml: 5,111; perl: 4,720; awk: 3,523; makefile: 3,401; javascript: 2,272; xml: 892; fortran: 770
file content (56 lines) | stat: -rw-r--r-- 1,380 bytes parent folder | download | duplicates (4)
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
//===----------------------------------------------------------------------===//
//
// 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>

// void push_back(const value_type& x);

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

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

TEST_CONSTEXPR_CXX20 bool tests() {
  {
    bool a[]         = {0, 1, 1, 0, 1, 0, 0};
    const unsigned N = sizeof(a) / sizeof(a[0]);
    std::vector<bool> c;
    for (unsigned i = 0; i < N; ++i) {
      c.push_back(a[i]);
      assert(c.size() == i + 1);
      for (std::size_t j = 0; j < c.size(); ++j)
        assert(c[j] == a[j]);
    }
  }
#if TEST_STD_VER >= 11
  {
    bool a[]         = {0, 1, 1, 0, 1, 0, 0};
    const unsigned N = sizeof(a) / sizeof(a[0]);
    std::vector<bool, min_allocator<bool>> c;
    for (unsigned i = 0; i < N; ++i) {
      c.push_back(a[i]);
      assert(c.size() == i + 1);
      for (std::size_t j = 0; j < c.size(); ++j)
        assert(c[j] == a[j]);
    }
  }
#endif

  return true;
}

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