libstdc++-v3/testsuite/23_containers/unordered_multiset/operators/1.cc

   1 // { dg-do run { target c++11 } }
   2
   3 // 2010-03-25  Paolo Carlini  <paolo.carlini@oracle.com>
   4
   5 // Copyright (C) 2010-2019 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 3, 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 COPYING3.  If not see
  20 // <http://www.gnu.org/licenses/>.
  21
  22 #include <unordered_set>
  23 #include <testsuite_hooks.h>
  24
  25 void test01()
  26 {
  27   std::unordered_multiset<int> ums1, ums2;
  28   VERIFY( ums1 == ums2 );
  29   VERIFY( !(ums1 != ums2) );
  30
  31   ums1.insert(1);
  32   ums2.insert(1);
  33   VERIFY( ums1 == ums2 );
  34   VERIFY( !(ums1 != ums2) );
  35
  36   ums1.insert(2);
  37   ums2.insert(2);
  38   VERIFY( ums1 == ums2 );
  39   VERIFY( !(ums1 != ums2) );
  40
  41   ums1.insert(1);
  42   ums2.insert(1);
  43   VERIFY( ums1 == ums2 );
  44   VERIFY( !(ums1 != ums2) );
  45
  46   ums1.insert(3);
  47   VERIFY( ums1 != ums2 );
  48   VERIFY( !(ums1 == ums2) );
  49
  50   ums2.insert(3);
  51   VERIFY( (ums1 == ums2) );
  52   VERIFY( !(ums1 != ums2) );
  53
  54   ums2.clear();
  55   VERIFY( ums1 != ums2 );
  56   VERIFY( !(ums1 == ums2) );
  57
  58   ums1.clear();
  59   VERIFY( ums1 == ums2 );
  60   VERIFY( !(ums1 != ums2) );
  61
  62   ums1.insert(1);
  63   ums2.insert(2);
  64   VERIFY( ums1 != ums2 );
  65   VERIFY( !(ums1 == ums2) );
  66
  67   ums1.insert(2);
  68   ums2.insert(1);
  69   VERIFY( ums1 == ums2 );
  70   VERIFY( !(ums1 != ums2) );
  71
  72   ums1.insert(3);
  73   ums2.insert(4);
  74   VERIFY( ums1 != ums2 );
  75   VERIFY( !(ums1 == ums2) );
  76
  77   ums1.insert(4);
  78   VERIFY( ums1 != ums2 );
  79   VERIFY( !(ums1 == ums2) );
  80
  81   ums2.insert(3);
  82   VERIFY( ums1 == ums2 );
  83   VERIFY( !(ums1 != ums2) );
  84
  85   ums1.insert(1);
  86   ums2.insert(1);
  87   VERIFY( ums1 == ums2 );
  88   VERIFY( !(ums1 != ums2) );
  89
  90   ums1.insert(4);
  91   ums2.insert(4);
  92   VERIFY( ums1 == ums2 );
  93   VERIFY( !(ums1 != ums2) );
  94
  95   const std::unordered_multiset<int> cums1(ums1), cums2(ums2);
  96   VERIFY( cums1 == cums2 );
  97   VERIFY( !(cums1 != cums2) );
  98   VERIFY( cums1 == ums2 );
  99   VERIFY( !(ums1 != cums2) );
 100 }
 101
 102 int main()
 103 {
 104   test01();
 105   return 0;
 106 }