1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // template <class InputIterator>
13 // list(InputIterator first, InputIterator last, const Allocator& = Allocator());
17 #include "test_iterators.h"
18 #include "test_allocator.h"
19 #include "min_allocator.h"
24 int a[] = {0, 1, 2, 3};
25 std::list<int> l(input_iterator<const int*>(a),
26 input_iterator<const int*>(a + sizeof(a)/sizeof(a[0])));
27 assert(l.size() == sizeof(a)/sizeof(a[0]));
28 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
30 for (std::list<int>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j)
34 int a[] = {0, 1, 2, 3};
35 std::list<int> l(input_iterator<const int*>(a),
36 input_iterator<const int*>(a + sizeof(a)/sizeof(a[0])),
37 std::allocator<int>());
38 assert(l.size() == sizeof(a)/sizeof(a[0]));
39 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
41 for (std::list<int>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j)
45 int a[] = {0, 1, 2, 3};
46 // Add 2 for implementations that dynamically allocate a sentinel node and container proxy.
47 std::list<int, limited_allocator<int, sizeof(a)/sizeof(a[0]) + 2> > l(input_iterator<const int*>(a),
48 input_iterator<const int*>(a + sizeof(a)/sizeof(a[0])));
49 assert(l.size() == sizeof(a)/sizeof(a[0]));
50 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
52 for (std::list<int>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j)
55 #if TEST_STD_VER >= 11
57 int a[] = {0, 1, 2, 3};
58 std::list<int, min_allocator<int>> l(input_iterator<const int*>(a),
59 input_iterator<const int*>(a + sizeof(a)/sizeof(a[0])));
60 assert(l.size() == sizeof(a)/sizeof(a[0]));
61 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
63 for (std::list<int, min_allocator<int>>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j)
67 int a[] = {0, 1, 2, 3};
68 std::list<int, min_allocator<int>> l(input_iterator<const int*>(a),
69 input_iterator<const int*>(a + sizeof(a)/sizeof(a[0])),
70 min_allocator<int>());
71 assert(l.size() == sizeof(a)/sizeof(a[0]));
72 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
74 for (std::list<int, min_allocator<int>>::const_iterator i = l.begin(), e = l.end(); i != e; ++i, ++j)