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
|
//===----------------------------------------------------------------------===//
//
// 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>
// void pop_back();
#include <vector>
#include <cassert>
#include "test_macros.h"
#include "test_allocator.h"
#include "min_allocator.h"
int main(int, char**)
{
{
std::vector<int> c;
c.push_back(1);
assert(c.size() == 1);
c.pop_back();
assert(c.size() == 0);
}
#if TEST_STD_VER >= 11
{
std::vector<int, min_allocator<int>> c;
c.push_back(1);
assert(c.size() == 1);
c.pop_back();
assert(c.size() == 0);
}
#endif
{ // LWG 526
int arr[] = {0, 1, 2, 3, 4};
int sz = 5;
std::vector<int> c(arr, arr+sz);
while (c.size() < c.capacity())
c.push_back(sz++);
c.push_back(c.front());
assert(c.back() == 0);
for (int i = 0; i < sz; ++i)
assert(c[i] == i);
}
return 0;
}
|
