gomp-20050608-branch/libstdc++-v3/testsuite/tr1/6_containers/unordered/hashtable/23465.cc

   1 // Copyright (C) 2005 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 2, or (at your option)
   7 // any later version.
   8 //
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13 //
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING.  If not, write to the Free
  16 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  17 // USA.
  18
  19 // 6.3 Unordered associative containers
  20
  21 #include <tr1/unordered_set>
  22 #include <testsuite_hooks.h>
  23
  24 // libstdc++/23465
  25 void test01()
  26 {
  27   bool test __attribute__((unused)) = true;
  28
  29   for (float lf = 0.1; lf < 101.0; lf *= 10.0)
  30     for (int size = 1; size <= 6561; size *= 3)
  31       {
  32         std::tr1::unordered_set<int> us1, us2;
  33         typedef std::tr1::unordered_set<int>::local_iterator local_iterator;
  34         typedef std::tr1::unordered_set<int>::size_type      size_type;
  35
  36         us1.max_load_factor(lf);
  37
  38         for (int i = 0; i < size; ++i)
  39           us1.insert(i);
  40
  41         us2 = us1;
  42
  43         VERIFY( us2.size() == us1.size() );
  44         VERIFY( us2.bucket_count() == us1.bucket_count() );
  45
  46         for (size_type b = 0; b < us1.bucket_count(); ++b)
  47           {
  48             size_type cnt = 0;
  49             for (local_iterator it1 = us1.begin(b), it2 = us2.begin(b);
  50                  it1 != us1.end(b) && it2 != us2.end(b); ++it1, ++it2)
  51               {
  52                 VERIFY( *it1 == *it2 );
  53                 ++cnt;
  54               }
  55             VERIFY( cnt == us1.bucket_size(b) );
  56           }
  57       }
  58 }
  59
  60 int main()
  61 {
  62   test01();
  63   return 0;
  64 }