blob: 0953326017409269dd85e666c5a19ae70c3f6d6d [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00001//===----------------------------------------------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +00003// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00004//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <vector>
11
12// void push_back(value_type&& x);
13
14#include <vector>
15#include <cassert>
16#include "../../../MoveOnly.h"
17#include "../../../stack_allocator.h"
18
19int main()
20{
Howard Hinnant73d21a42010-09-04 23:28:19 +000021#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000022 {
23 std::vector<MoveOnly> c;
24 c.push_back(MoveOnly(0));
25 assert(c.size() == 1);
26 for (int j = 0; j < c.size(); ++j)
27 assert(c[j] == MoveOnly(j));
28 c.push_back(MoveOnly(1));
29 assert(c.size() == 2);
30 for (int j = 0; j < c.size(); ++j)
31 assert(c[j] == MoveOnly(j));
32 c.push_back(MoveOnly(2));
33 assert(c.size() == 3);
34 for (int j = 0; j < c.size(); ++j)
35 assert(c[j] == MoveOnly(j));
36 c.push_back(MoveOnly(3));
37 assert(c.size() == 4);
38 for (int j = 0; j < c.size(); ++j)
39 assert(c[j] == MoveOnly(j));
40 c.push_back(MoveOnly(4));
41 assert(c.size() == 5);
42 for (int j = 0; j < c.size(); ++j)
43 assert(c[j] == MoveOnly(j));
44 }
45 {
46 std::vector<MoveOnly, stack_allocator<MoveOnly, 15> > c;
47 c.push_back(MoveOnly(0));
48 assert(c.size() == 1);
49 for (int j = 0; j < c.size(); ++j)
50 assert(c[j] == MoveOnly(j));
51 c.push_back(MoveOnly(1));
52 assert(c.size() == 2);
53 for (int j = 0; j < c.size(); ++j)
54 assert(c[j] == MoveOnly(j));
55 c.push_back(MoveOnly(2));
56 assert(c.size() == 3);
57 for (int j = 0; j < c.size(); ++j)
58 assert(c[j] == MoveOnly(j));
59 c.push_back(MoveOnly(3));
60 assert(c.size() == 4);
61 for (int j = 0; j < c.size(); ++j)
62 assert(c[j] == MoveOnly(j));
63 c.push_back(MoveOnly(4));
64 assert(c.size() == 5);
65 for (int j = 0; j < c.size(); ++j)
66 assert(c[j] == MoveOnly(j));
67 }
Howard Hinnant73d21a42010-09-04 23:28:19 +000068#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000069}