badd64ad92
2004-06-30 Gabriel Dos Reis <gdr@integrable-solutions.net>
Paolo Carlini <pcarlini@suse.de>
* include/bits/cpp_type_traits.h: Add __is_pointer and
__is_trivially_copyable.
* include/bits/stl_algobase.h (fill, fill_n): Slightly
tweak to use the latter.
(__copy_backward_dispatch): Remove.
(__copy_backward_aux): Rewrite to use __is_pointer and
__is_trivially_copyable and __copy_backward::copy_b.
(__copy_backward): Rewrite as a class template and two
specializations.
2004-06-30 Paolo Carlini <pcarlini@suse.de>
* testsuite/25_algorithms/copy.cc: Move to...
* testsuite/25_algorithms/copy/1.cc: ... here, extend.
* testsuite/25_algorithms/copy/2.cc: New.
* testsuite/25_algorithms/copy/3.cc: New.
* testsuite/25_algorithms/copy/4.cc: New.
From-SVN: r83897
58 lines
1.6 KiB
C++
58 lines
1.6 KiB
C++
// Copyright (C) 2004 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 2, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without Pred 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 COPYING. If not, write to the Free
|
|
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
|
|
// USA.
|
|
|
|
// 25.2.1 [lib.alg.copy] Copy.
|
|
|
|
#include <algorithm>
|
|
#include <vector>
|
|
#include <testsuite_hooks.h>
|
|
|
|
void
|
|
test01()
|
|
{
|
|
using namespace std;
|
|
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 int N = sizeof(A) / sizeof(int);
|
|
const vector<int> a(A, A + N);
|
|
|
|
int s1[N];
|
|
copy(a.begin(), a.end(), s1);
|
|
VERIFY( equal(s1, s1 + N, a.begin()) );
|
|
|
|
vector<int> v1(N);
|
|
copy(a.begin(), a.end(), v1.begin());
|
|
VERIFY( equal(v1.begin(), v1.end(), a.begin()) );
|
|
|
|
int s2[N];
|
|
copy_backward(a.begin(), a.end(), s2 + N);
|
|
VERIFY( equal(s2, s2 + N, a.begin()) );
|
|
|
|
vector<int> v2(N);
|
|
copy_backward(a.begin(), a.end(), v2.end());
|
|
VERIFY( equal(v2.begin(), v2.end(), a.begin()) );
|
|
}
|
|
|
|
int
|
|
main()
|
|
{
|
|
test01();
|
|
return 0;
|
|
}
|