URL
https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk
Subversion Repositories openrisc_2011-10-31
[/] [openrisc/] [tags/] [gnu-src/] [gcc-4.5.1/] [gcc-4.5.1-or32-1.0rc3/] [libstdc++-v3/] [testsuite/] [23_containers/] [list/] [cons/] [4.h] - Rev 516
Compare with Previous | Blame | View Log
// Copyright (C) 2001, 2004, 2005, 2009 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License along // with this library; see the file COPYING3. If not see // <http://www.gnu.org/licenses/>. // 23.2.2.1 list constructors, copy, and assignment #include <testsuite_hooks.h> // Range constructor // // This test verifies the following. // 23.2.2.1 template list(InputIterator f, InputIterator l, // const Allocator& a = Allocator()) // 23.2.2 const_iterator begin() const // 23.2.2 const_iterator end() const // 23.2.2 size_type size() const // template<typename _Tp> void cons04() { bool test __attribute__((unused)) = true; const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17}; const std::size_t N = sizeof(A) / sizeof(int); std::size_t count; typedef _Tp list_type; typedef typename list_type::const_iterator const_iterator; const_iterator i; // construct from a dissimilar range list_type list0301(A, A + N); for (i = list0301.begin(), count = 0; i != list0301.end(); ++i, ++count) VERIFY(*i == A[count]); VERIFY(count == N); VERIFY(list0301.size() == N); // construct from a similar range list_type list0302(list0301.begin(), list0301.end()); for (i = list0302.begin(), count = 0; i != list0302.end(); ++i, ++count) VERIFY(*i == A[count]); VERIFY(count == N); VERIFY(list0302.size() == N); }