libstdc++-v3/testsuite/backward/hash_set/check_construct_destroy.cc

   1 // { dg-options "-Wno-deprecated" }
   2
   3 // 2004-07-26  Matt Austern  <austern@apple.com>
   4 //
   5 // Copyright (C) 2003, 2007 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 // As a special exception, you may use this file as part of a free software
  24 // library without restriction.  Specifically, if other files instantiate
  25 // templates or use macros or inline functions from this file, or you compile
  26 // this file and link it with other files to produce an executable, this
  27 // file does not by itself cause the resulting executable to be covered by
  28 // the GNU General Public License.  This exception does not however
  29 // invalidate any other reasons why the executable file might be covered by
  30 // the GNU General Public License.
  31
  32 #include <hash_set>
  33 #include <functional>
  34 #include <iterator>
  35 #include <testsuite_allocator.h>
  36
  37 using namespace __gnu_test;
  38
  39 int main()
  40 {
  41   typedef __gnu_cxx::hash_set<int, __gnu_cxx::hash<int>, std::equal_to<int>,
  42                               tracker_allocator<int> >
  43     Container;
  44
  45   const int arr10[10]  = { 2, 4, 1, 7, 3, 8, 10, 5, 9, 6 };
  46   const int arr10a[10] = { 31, 23, 82, 46, 13, 17, 30, 71, 22, 51 };
  47   bool ok = true;
  48
  49   int buckets;
  50
  51   tracker_allocator_counter::reset();
  52   {
  53     Container c;
  54     buckets = c.bucket_count();
  55     ok = check_construct_destroy("empty container", buckets, 0) && ok;
  56   }
  57   ok = check_construct_destroy("empty container", buckets, buckets) && ok;
  58
  59
  60   tracker_allocator_counter::reset();
  61   {
  62     Container c(arr10, arr10 + 10);
  63     ok = check_construct_destroy("Construct from range", buckets+10, 0) && ok;
  64   }
  65   ok = check_construct_destroy("Construct from range", buckets+10, buckets+10) && ok;
  66
  67   tracker_allocator_counter::reset();
  68   {
  69     Container c(arr10, arr10 + 10);
  70     c.insert(arr10a[0]);
  71     ok = check_construct_destroy("Insert element", buckets+11, 0) && ok;
  72   }
  73   ok = check_construct_destroy("Insert element", buckets+11, buckets+11) && ok;
  74
  75   tracker_allocator_counter::reset();
  76   {
  77     Container c(arr10, arr10 + 10);
  78     c.insert(arr10a, arr10a+3);
  79     ok = check_construct_destroy("Insert short range", buckets+13, 0) && ok;
  80   }
  81   ok = check_construct_destroy("Insert short range", buckets+13, buckets+13) && ok;
  82
  83   tracker_allocator_counter::reset();
  84   {
  85     Container c(arr10, arr10 + 10);
  86     c.insert(arr10a, arr10a+10);
  87     ok = check_construct_destroy("Insert long range", buckets+20, 0) && ok;
  88   }
  89   ok = check_construct_destroy("Insert long range", buckets+20, buckets+20) && ok;
  90
  91   return ok ? 0 : 1;
  92 }
  93