libstdc++-v3/testsuite/23_containers/unordered_multiset/insert/hash_policy.cc

   1 // { dg-do run { target c++11 } }
   2
   3 // Copyright (C) 2011-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 #include <unordered_set>
  21 #include <limits>
  22 #include <ext/throw_allocator.h>
  23 #include <testsuite_hooks.h>
  24
  25 void test01()
  26 {
  27   typedef std::numeric_limits<size_t> nl_size_t;
  28   std::unordered_multiset<int, std::hash<int>, std::equal_to<int>,
  29                           __gnu_cxx::throw_allocator_limit<int> > us;
  30   const int nb = 100;
  31   int scheduled_throw_counter = 0;
  32   std::size_t thrown_exceptions = 0;
  33   for (int i = 0; i != nb; ++i)
  34     {
  35       if ((float)(us.size() + 1)
  36           / (float)us.bucket_count() >= us.max_load_factor())
  37         {
  38           // We are going to need a rehash, lets introduce allocation issues:
  39           __gnu_cxx::limit_condition::set_limit(scheduled_throw_counter++);
  40         }
  41       try
  42         {
  43           us.insert(i / 2);
  44           scheduled_throw_counter = 0;
  45         }
  46       catch (const __gnu_cxx::forced_error&)
  47         {
  48           ++thrown_exceptions;
  49           --i;
  50         }
  51       VERIFY( us.load_factor() <= us.max_load_factor() );
  52       __gnu_cxx::limit_condition::set_limit(nl_size_t::max());
  53     }
  54
  55   VERIFY( thrown_exceptions != 0 );
  56   // Check that all values have been inserted:
  57   for (int i = 0; i != nb / 2; ++i)
  58     {
  59       VERIFY( us.count(i) == 2 );
  60     }
  61 }
  62
  63 int main()
  64 {
  65   test01();
  66   return 0;
  67 }