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

   1 // 2007-01-19  Paolo Carlini  <pcarlini@suse.de>
   2
   3 // Copyright (C) 2007-2022 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 even 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 #include <testsuite_iterators.h>
  26
  27 // Non-scalar type to exercise partial specialization of fill_n implementation.
  28 struct Value
  29 {
  30   Value(int n) : n(n) { }
  31
  32   operator int() const { return n; }
  33
  34 private:
  35   int n;
  36 };
  37
  38 void
  39 test01()
  40 {
  41   using namespace std;
  42   using __gnu_test::test_container;
  43   using __gnu_test::output_iterator_wrapper;
  44
  45   const int A1[] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3};
  46   const int N1 = sizeof(A1) / sizeof(int);
  47
  48   int i1[N1];
  49   test_container<int, output_iterator_wrapper> c1(i1, i1 + N1);
  50   fill_n(c1.begin(), N1, 3);
  51   VERIFY( equal(i1, i1 + N1, A1) );
  52
  53   vector<int> v1(N1);
  54   fill_n(v1.begin(), N1, Value(3));
  55   VERIFY( equal(v1.begin(), v1.end(), A1) );
  56
  57   const char A2[] = {'\3', '\3', '\3', '\3', '\3',
  58                      '\3', '\3', '\3', '\3', '\3'};
  59   const int N2 = sizeof(A2) / sizeof(char);
  60
  61   char i2[N2];
  62   fill_n(i2, N2, '\3');
  63   VERIFY( equal(i2, i2 + N2, A2) );
  64
  65   vector<char> v2(N2);
  66   fill_n(v2.begin(), N2, '\3');
  67   VERIFY( equal(v2.begin(), v2.end(), A2) );
  68
  69   const wchar_t A3[] = {L'\3', L'\3', L'\3', L'\3', L'\3',
  70                         L'\3', L'\3', L'\3', L'\3', L'\3'};
  71   const int N3 = sizeof(A3) / sizeof(wchar_t);
  72
  73   wchar_t i3[N3];
  74   fill_n(i3, N3, L'\3');
  75   VERIFY( equal(i3, i3 + N3, A3) );
  76
  77   vector<wchar_t> v3(N3);
  78   fill_n(v3.begin(), N3, L'\3');
  79   VERIFY( equal(v3.begin(), v3.end(), A3) );
  80 }
  81
  82 int
  83 main()
  84 {
  85   test01();
  86   return 0;
  87 }