X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Ftestsuite%2F25_algorithms%2Ffill%2F5.cc;fp=libstdc%2B%2B-v3%2Ftestsuite%2F25_algorithms%2Ffill%2F5.cc;h=edabe1fcc29f42ce035c0004886f2da85963a801;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git diff --git a/libstdc++-v3/testsuite/25_algorithms/fill/5.cc b/libstdc++-v3/testsuite/25_algorithms/fill/5.cc new file mode 100644 index 00000000..edabe1fc --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/fill/5.cc @@ -0,0 +1,75 @@ +// 2007-01-19 Paolo Carlini + +// Copyright (C) 2007, 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 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 COPYING3. If not see +// . + +// 25.2.5 [lib.alg.fill] Fill_n. + +#include +#include +#include + +void +test01() +{ + using namespace std; + bool test __attribute__((unused)) = true; + + const int A1[] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3}; + const int N1 = sizeof(A1) / sizeof(int); + + int i1[N1]; + fill_n(i1, N1, 3); + VERIFY( equal(i1, i1 + N1, A1) ); + + vector v1(N1); + fill_n(v1.begin(), N1, 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 v2(N2); + fill_n(v2.begin(), N2, '\3'); + VERIFY( equal(v2.begin(), v2.end(), A2) ); + +#ifdef _GLIBCXX_USE_WCHAR_T + 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 v3(N3); + fill_n(v3.begin(), N3, L'\3'); + VERIFY( equal(v3.begin(), v3.end(), A3) ); +#endif +} + +int +main() +{ + test01(); + return 0; +}