libstdc++-v3/testsuite/23_containers/deque/check_construct_destroy.cc

   1 // 2004-07-26  Matt Austern  <austern@apple.com>
   2 //
   3 // Copyright (C) 2003 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 2, 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 COPYING.  If not, write to the Free
  18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  19 // USA.
  20 //
  21 // As a special exception, you may use this file as part of a free software
  22 // library without restriction.  Specifically, if other files instantiate
  23 // templates or use macros or inline functions from this file, or you compile
  24 // this file and link it with other files to produce an executable, this
  25 // file does not by itself cause the resulting executable to be covered by
  26 // the GNU General Public License.  This exception does not however
  27 // invalidate any other reasons why the executable file might be covered by
  28 // the GNU General Public License.
  29
  30 #include <deque>
  31 #include <testsuite_allocator.h>
  32
  33 using namespace __gnu_test;
  34
  35 int main()
  36 {
  37   typedef std::deque<int, tracker_alloc<int> > Container;
  38   const int arr10[10] = { 2, 4, 1, 7, 3, 8, 10, 5, 9, 6 };
  39   bool ok = true;
  40
  41   allocation_tracker::resetCounts();
  42   {
  43     Container c;
  44     ok = check_construct_destroy("empty container", 0, 0) && ok;
  45   }
  46   ok = check_construct_destroy("empty container", 0, 0) && ok;
  47
  48
  49   allocation_tracker::resetCounts();
  50   {
  51     Container c(arr10, arr10 + 10);
  52     ok = check_construct_destroy("Construct from range", 10, 0) && ok;
  53   }
  54   ok = check_construct_destroy("Construct from range", 10, 10) && ok;
  55
  56   {
  57     Container c(arr10, arr10 + 10);
  58     allocation_tracker::resetCounts();
  59     c.insert(c.begin(), arr10[0]);
  60     ok = check_construct_destroy("Insert element", 1, 0) && ok;
  61   }
  62   ok = check_construct_destroy("Insert element", 1, 11) && ok;
  63
  64   {
  65     Container c(arr10, arr10 + 10);
  66     allocation_tracker::resetCounts();
  67     c.insert(c.begin() + 5, arr10, arr10+3);
  68     ok = check_construct_destroy("Insert short range", 3, 0) && ok;
  69   }
  70   ok = check_construct_destroy("Insert short range", 3, 13) && ok;
  71
  72   {
  73     Container c(arr10, arr10 + 10);
  74     allocation_tracker::resetCounts();
  75     c.insert(c.begin() + 7, arr10, arr10+10);
  76     ok = check_construct_destroy("Insert long range", 10, 0) && ok;
  77   }
  78   ok = check_construct_destroy("Insert long range", 10, 20) && ok;
  79
  80   return ok ? 0 : 1;;
  81 }
  82