Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <list> |
| 11 | |
| 12 | // explicit list(size_type n); |
| 13 | |
| 14 | #include <list> |
| 15 | #include <cassert> |
| 16 | #include "../../../DefaultOnly.h" |
| 17 | #include "../../../stack_allocator.h" |
| 18 | |
| 19 | int main() |
| 20 | { |
| 21 | { |
| 22 | std::list<int> l(3); |
| 23 | assert(l.size() == 3); |
| 24 | assert(std::distance(l.begin(), l.end()) == 3); |
| 25 | std::list<int>::const_iterator i = l.begin(); |
| 26 | assert(*i == 0); |
| 27 | ++i; |
| 28 | assert(*i == 0); |
| 29 | ++i; |
| 30 | assert(*i == 0); |
| 31 | } |
| 32 | { |
| 33 | std::list<int, stack_allocator<int, 3> > l(3); |
| 34 | assert(l.size() == 3); |
| 35 | assert(std::distance(l.begin(), l.end()) == 3); |
| 36 | std::list<int>::const_iterator i = l.begin(); |
| 37 | assert(*i == 0); |
| 38 | ++i; |
| 39 | assert(*i == 0); |
| 40 | ++i; |
| 41 | assert(*i == 0); |
| 42 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 43 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 44 | { |
| 45 | std::list<DefaultOnly> l(3); |
| 46 | assert(l.size() == 3); |
| 47 | assert(std::distance(l.begin(), l.end()) == 3); |
| 48 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame^] | 49 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 50 | } |