blob: ed9ce6d5a346e3f898d723eb0a4752bba6e64838 [file] [log] [blame]
// 2007-01-19 Paolo Carlini <pcarlini@suse.de>
// Copyright (C) 2007-2022 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/>.
// 25.2.5 [lib.alg.fill] Fill_n.
#include <algorithm>
#include <vector>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
// Non-scalar type to exercise partial specialization of fill_n implementation.
struct Value
{
Value(int n) : n(n) { }
operator int() const { return n; }
private:
int n;
};
void
test01()
{
using namespace std;
using __gnu_test::test_container;
using __gnu_test::output_iterator_wrapper;
const int A1[] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3};
const int N1 = sizeof(A1) / sizeof(int);
int i1[N1];
test_container<int, output_iterator_wrapper> c1(i1, i1 + N1);
fill_n(c1.begin(), N1, 3);
VERIFY( equal(i1, i1 + N1, A1) );
vector<int> v1(N1);
fill_n(v1.begin(), N1, Value(3));
VERIFY( equal(v1.begin(), v1.end(), A1) );
const char A2[] = {'\3', '\3', '\3', '\3', '\3',
'\3', '\3', '\3', '\3', '\3'};
const int N2 = sizeof(A2) / sizeof(char);
char i2[N2];
fill_n(i2, N2, '\3');
VERIFY( equal(i2, i2 + N2, A2) );
vector<char> v2(N2);
fill_n(v2.begin(), N2, '\3');
VERIFY( equal(v2.begin(), v2.end(), A2) );
const wchar_t A3[] = {L'\3', L'\3', L'\3', L'\3', L'\3',
L'\3', L'\3', L'\3', L'\3', L'\3'};
const int N3 = sizeof(A3) / sizeof(wchar_t);
wchar_t i3[N3];
fill_n(i3, N3, L'\3');
VERIFY( equal(i3, i3 + N3, A3) );
vector<wchar_t> v3(N3);
fill_n(v3.begin(), N3, L'\3');
VERIFY( equal(v3.begin(), v3.end(), A3) );
}
int
main()
{
test01();
return 0;
}