//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // reference front(); // const_reference front() const; #include #include #include #include "min_allocator.h" int main() { { typedef int T; typedef std::forward_list C; const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; C c(std::begin(t), std::end(t)); assert(c.front() == 0); c.front() = 10; assert(c.front() == 10); assert(*c.begin() == 10); } { typedef int T; typedef std::forward_list C; const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; const C c(std::begin(t), std::end(t)); assert(c.front() == 0); assert(*c.begin() == 0); } #if __cplusplus >= 201103L { typedef int T; typedef std::forward_list> C; const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; C c(std::begin(t), std::end(t)); assert(c.front() == 0); c.front() = 10; assert(c.front() == 10); assert(*c.begin() == 10); } { typedef int T; typedef std::forward_list> C; const T t[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; const C c(std::begin(t), std::end(t)); assert(c.front() == 0); assert(*c.begin() == 0); } #endif }