libstdc++-v3/testsuite/25_algorithms/fill_n/1.cc

   1 // 2007-01-19  Paolo Carlini  <pcarlini@suse.de>
   2
   3 // Copyright (C) 2007, 2009 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 3, or (at your option)
   9 // any later version.
  10
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without Pred the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING3.  If not see
  18 // <http://www.gnu.org/licenses/>.
  19
  20 // 25.2.5 [lib.alg.fill] Fill_n.
  21
  22 #include <algorithm>
  23 #include <vector>
  24 #include <testsuite_hooks.h>
  25
  26 void
  27 test01()
  28 {
  29   using namespace std;
  30   bool test __attribute__((unused)) = true;
  31
  32   const int A1[] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3};
  33   const int N1 = sizeof(A1) / sizeof(int);
  34
  35   int i1[N1];
  36   fill_n(i1, N1, 3);
  37   VERIFY( equal(i1, i1 + N1, A1) );
  38
  39   vector<int> v1(N1);
  40   fill_n(v1.begin(), N1, 3);
  41   VERIFY( equal(v1.begin(), v1.end(), A1) );
  42
  43   const char A2[] = {'\3', '\3', '\3', '\3', '\3',
  44                      '\3', '\3', '\3', '\3', '\3'};
  45   const int N2 = sizeof(A2) / sizeof(char);
  46
  47   char i2[N2];
  48   fill_n(i2, N2, '\3');
  49   VERIFY( equal(i2, i2 + N2, A2) );
  50
  51   vector<char> v2(N2);
  52   fill_n(v2.begin(), N2, '\3');
  53   VERIFY( equal(v2.begin(), v2.end(), A2) );
  54
  55 #ifdef _GLIBCXX_USE_WCHAR_T
  56   const wchar_t A3[] = {L'\3', L'\3', L'\3', L'\3', L'\3',
  57                         L'\3', L'\3', L'\3', L'\3', L'\3'};
  58   const int N3 = sizeof(A3) / sizeof(wchar_t);
  59
  60   wchar_t i3[N3];
  61   fill_n(i3, N3, L'\3');
  62   VERIFY( equal(i3, i3 + N3, A3) );
  63
  64   vector<wchar_t> v3(N3);
  65   fill_n(v3.begin(), N3, L'\3');
  66   VERIFY( equal(v3.begin(), v3.end(), A3) );
  67 #endif
  68 }
  69
  70 int
  71 main()
  72 {
  73   test01();
  74   return 0;
  75 }