2010-05-11 19:42:16 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 21:36:01 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 19:42:16 +00:00
|
|
|
//
|
2010-11-16 22:09:02 +00:00
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
2010-05-11 19:42:16 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <list>
|
|
|
|
|
|
|
|
// void push_back(const value_type& x);
|
|
|
|
|
|
|
|
#include <list>
|
|
|
|
#include <cassert>
|
|
|
|
|
2013-06-25 16:08:47 +00:00
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
|
2010-05-11 19:42:16 +00:00
|
|
|
int main()
|
|
|
|
{
|
2013-06-25 16:08:47 +00:00
|
|
|
{
|
2010-05-11 19:42:16 +00:00
|
|
|
std::list<int> c;
|
|
|
|
for (int i = 0; i < 5; ++i)
|
|
|
|
c.push_back(i);
|
|
|
|
int a[] = {0, 1, 2, 3, 4};
|
|
|
|
assert(c == std::list<int>(a, a+5));
|
2013-06-25 16:08:47 +00:00
|
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
|
|
{
|
|
|
|
std::list<int, min_allocator<int>> c;
|
|
|
|
for (int i = 0; i < 5; ++i)
|
|
|
|
c.push_back(i);
|
|
|
|
int a[] = {0, 1, 2, 3, 4};
|
|
|
|
assert((c == std::list<int, min_allocator<int>>(a, a+5)));
|
|
|
|
}
|
|
|
|
#endif
|
2010-05-11 19:42:16 +00:00
|
|
|
}
|