libstdc++-v3/testsuite/ext/slist/check_construct_destroy.cc

   1 // 2004-07-26  Matt Austern  <austern@apple.com>
   2 //
   3 // Copyright (C) 2003-2019 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
  21 #include <ext/slist>
  22 #include <iterator>
  23 #include <testsuite_allocator.h>
  24
  25 using namespace __gnu_test;
  26
  27 int main()
  28 {
  29   typedef __gnu_cxx::slist<int, tracker_allocator<int> > Container;
  30   const int arr10[10] = { 2, 4, 1, 7, 3, 8, 10, 5, 9, 6 };
  31   bool ok = true;
  32
  33   tracker_allocator_counter::reset();
  34   {
  35     Container c;
  36     ok = check_construct_destroy("empty container", 0, 0) && ok;
  37   }
  38   ok = check_construct_destroy("empty container", 0, 0) && ok;
  39
  40
  41   tracker_allocator_counter::reset();
  42   {
  43     Container c(arr10, arr10 + 10);
  44     ok = check_construct_destroy("Construct from range", 10, 0) && ok;
  45   }
  46   ok = check_construct_destroy("Construct from range", 10, 10) && ok;
  47
  48   {
  49     Container c(arr10, arr10 + 10);
  50     tracker_allocator_counter::reset();
  51     c.insert(c.begin(), arr10[0]);
  52     ok = check_construct_destroy("Insert element", 1, 0) && ok;
  53   }
  54   ok = check_construct_destroy("Insert element", 1, 11) && ok;
  55
  56   {
  57     Container c(arr10, arr10 + 10);
  58     tracker_allocator_counter::reset();
  59     Container::iterator i5 = c.begin();
  60     std::advance(i5, 5);
  61     c.insert(i5, arr10, arr10+3);
  62     ok = check_construct_destroy("Insert short range", 3, 0) && ok;
  63   }
  64   ok = check_construct_destroy("Insert short range", 3, 13) && ok;
  65
  66   {
  67     Container c(arr10, arr10 + 10);
  68     tracker_allocator_counter::reset();
  69     Container::iterator i7 = c.begin();
  70     std::advance(i7, 5);
  71     c.insert(i7, arr10, arr10+10);
  72     ok = check_construct_destroy("Insert long range", 10, 0) && ok;
  73   }
  74   ok = check_construct_destroy("Insert long range", 10, 20) && ok;
  75
  76   return ok ? 0 : 1;
  77 }
  78