//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // list(size_type n, const T& value, const Allocator& = Allocator()); #include #include #include "DefaultOnly.h" #include "../../../stack_allocator.h" #include "min_allocator.h" int main() { { std::list l(3, 2); assert(l.size() == 3); assert(std::distance(l.begin(), l.end()) == 3); std::list::const_iterator i = l.begin(); assert(*i == 2); ++i; assert(*i == 2); ++i; assert(*i == 2); } { std::list l(3, 2, std::allocator()); assert(l.size() == 3); assert(std::distance(l.begin(), l.end()) == 3); std::list::const_iterator i = l.begin(); assert(*i == 2); ++i; assert(*i == 2); ++i; assert(*i == 2); } { std::list > l(3, 2); assert(l.size() == 3); assert(std::distance(l.begin(), l.end()) == 3); std::list::const_iterator i = l.begin(); assert(*i == 2); ++i; assert(*i == 2); ++i; assert(*i == 2); } #if __cplusplus >= 201103L { std::list> l(3, 2); assert(l.size() == 3); assert(std::distance(l.begin(), l.end()) == 3); std::list>::const_iterator i = l.begin(); assert(*i == 2); ++i; assert(*i == 2); ++i; assert(*i == 2); } { std::list> l(3, 2, min_allocator()); assert(l.size() == 3); assert(std::distance(l.begin(), l.end()) == 3); std::list>::const_iterator i = l.begin(); assert(*i == 2); ++i; assert(*i == 2); ++i; assert(*i == 2); } #endif }