libstdc++-v3/testsuite/27_io/basic_stringbuf/sgetn/char/1.cc

   1 // 981208 bkoz test functionality of basic_stringbuf for char_type == char
   2
   3 // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
   4 // 2006, 2007
   5 // Free Software Foundation, Inc.
   6 //
   7 // This file is part of the GNU ISO C++ Library.  This library is free
   8 // software; you can redistribute it and/or modify it under the
   9 // terms of the GNU General Public License as published by the
  10 // Free Software Foundation; either version 2, or (at your option)
  11 // any later version.
  12
  13 // This library is distributed in the hope that it will be useful,
  14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 // GNU General Public License for more details.
  17
  18 // You should have received a copy of the GNU General Public License along
  19 // with this library; see the file COPYING.  If not, write to the Free
  20 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  21 // USA.
  22
  23 #include <sstream>
  24 #include <testsuite_hooks.h>
  25
  26 std::string str_01("mykonos. . . or what?");
  27 std::string str_02("paris, or sainte-maxime?");
  28 std::string str_03;
  29 std::stringbuf strb_01(str_01);
  30 std::stringbuf strb_02(str_02, std::ios_base::in);
  31 std::stringbuf strb_03(str_03, std::ios_base::out);
  32
  33 // test overloaded virtual functions
  34 void test04()
  35 {
  36   bool test __attribute__((unused)) = true;
  37   std::streamsize               strmsz_1, strmsz_2;
  38   std::streamoff                strmof_1(-1), strmof_2;
  39   typedef std::stringbuf::int_type int_type;
  40   typedef std::stringbuf::traits_type traits_type;
  41
  42   // GET
  43   strmof_1 = strb_01.in_avail();
  44   strmof_2 = strb_02.in_avail();
  45   strmof_1 = strb_03.in_avail();
  46
  47   int_type c1 = strb_01.sbumpc();
  48   int_type c2 = strb_02.sbumpc();
  49   strb_01.sbumpc();
  50   int_type c4 = strb_02.sbumpc();
  51   int_type c5 = strb_03.sbumpc();
  52
  53   // int_type sgetc()
  54   // if read_cur not avail, return uflow(), else return *read_cur
  55   int_type c6 = strb_01.sgetc();
  56   int_type c7 = strb_02.sgetc();
  57   strb_01.sgetc();
  58   strb_02.sgetc();
  59    c5 = strb_03.sgetc();
  60
  61   // int_type snextc()
  62   // calls sbumpc and if sbumpc != eof, return sgetc
  63   c6 = strb_01.snextc();
  64   c7 = strb_02.snextc();
  65   c5 = strb_03.snextc();
  66
  67   // streamsize sgetn(char_type *s, streamsize n)
  68   // streamsize xsgetn(char_type *s, streamsize n)
  69   // assign up to n chars to s from input sequence, indexing in_cur as
  70   // approp and returning the number of chars assigned
  71   strmsz_1 = strb_01.in_avail();
  72   strmsz_2 = strb_02.in_avail();
  73   test = strmsz_1 != strmsz_2;
  74   VERIFY( strmsz_1 != static_cast<std::streamsize>(str_01.length()) );
  75   // because now we've moved into string
  76   VERIFY( strmsz_2 != static_cast<std::streamsize>(str_02.length()) );
  77   char carray1[11] = "";
  78   strmsz_1 = strb_01.sgetn(carray1, 10);
  79   char carray2[20] = "";
  80   strmsz_2 = strb_02.sgetn(carray2, 10);
  81   VERIFY( strmsz_1 == strmsz_2 );
  82   VERIFY( strmsz_1 == 10 );
  83   c1 = strb_01.sgetc();
  84   c2 = strb_02.sgetc();
  85   VERIFY( c6 == c1 ); //just by co-incidence both o's
  86   VERIFY( c7 != c2 ); // n != i
  87   VERIFY( c1 == traits_type::to_int_type(str_01[13]) );
  88   VERIFY( c2 == traits_type::to_int_type(str_02[13]) ); //should equal fourteenth letter at this point
  89   strmsz_1 = strb_03.sgetn(carray1, 10);
  90   VERIFY( !strmsz_1 ); //zero
  91   strmsz_1 = strb_02.in_avail();
  92   strmsz_2 = strb_02.sgetn(carray2, strmsz_1 + 5);
  93   VERIFY( strmsz_1 == strmsz_2 ); //write off the end
  94   c4 = strb_02.sgetc(); // should be EOF
  95   VERIFY( c4 == traits_type::eof() );
  96 }
  97
  98 int main()
  99 {
 100   test04();
 101   return 0;
 102 }
 103
 104
 105
 106 // more candy!!!