4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
48 lines
1.2 KiB
C++
48 lines
1.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <vector>
|
|
// vector<bool>
|
|
|
|
// void push_back(const value_type& x);
|
|
|
|
#include <vector>
|
|
#include <cassert>
|
|
|
|
#include "../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
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 (int j = 0; j < c.size(); ++j)
|
|
assert(c[j] == a[j]);
|
|
}
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
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 (int j = 0; j < c.size(); ++j)
|
|
assert(c[j] == a[j]);
|
|
}
|
|
}
|
|
#endif
|
|
}
|