libstdc++-v3/testsuite/21_strings/basic_string/init-list.cc

   1 // Copyright (C) 2008-2018 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 3, or (at your option)
   7 // any later version.
   8 //
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13 //
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING3.  If not see
  16 // <http://www.gnu.org/licenses/>.
  17 //
  18
  19 // { dg-do run { target c++11 } }
  20
  21 #include <string>
  22 #include <testsuite_hooks.h>
  23
  24 using namespace std;
  25
  26 void test01(void)
  27 {
  28   string s1 = { 'a', 'b', 'c' };
  29   VERIFY(s1 == "abc");
  30
  31   s1 = { 'd', 'e', 'f' };
  32   VERIFY(s1 == "def");
  33
  34   s1 += { 'g', 'h', 'i' };
  35   VERIFY(s1 == "defghi");
  36
  37   s1.append({ 'j', 'k', 'l' });
  38   VERIFY(s1 == "defghijkl");
  39
  40   s1.assign({ 'm', 'n', 'o' });
  41   VERIFY(s1 == "mno");
  42
  43   // There aren't actually overloads of insert and replace taking size_type
  44   // and initializer_list, but test the usage anyway.
  45   s1.insert(2, { 'p', 'q', 'r' });
  46   VERIFY(s1 == "mnpqro");
  47
  48   s1.replace(2, 3, { 's', 't', 'u' });
  49   VERIFY(s1 == "mnstuo");
  50
  51   string::iterator i1, i2;
  52
  53   i1 = s1.begin()+2;
  54   s1.insert(i1, { 'v', 'w', 'x' });
  55   VERIFY(s1 == "mnvwxstuo");
  56
  57   i1 = s1.begin()+2;
  58   i2 = i1+6;
  59   s1.replace(i1, i2, { 'y', 'z' });
  60   VERIFY(s1 == "mnyzo");
  61 }
  62
  63 int main()
  64 {
  65   __gnu_test::set_memory_limits();
  66   test01();
  67   return 0;
  68 }