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

   1 // { dg-options "-std=gnu++11" }
   2
   3 // 2010-03-25  Paolo Carlini  <paolo.carlini@oracle.com>
   4
   5 // Copyright (C) 2010-2016 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   bool test __attribute__((unused)) = true;
  28
  29   std::unordered_multiset<int> ums1, ums2;
  30   VERIFY( ums1 == ums2 );
  31   VERIFY( !(ums1 != ums2) );
  32
  33   ums1.insert(1);
  34   ums2.insert(1);
  35   VERIFY( ums1 == ums2 );
  36   VERIFY( !(ums1 != ums2) );
  37
  38   ums1.insert(2);
  39   ums2.insert(2);
  40   VERIFY( ums1 == ums2 );
  41   VERIFY( !(ums1 != ums2) );
  42
  43   ums1.insert(1);
  44   ums2.insert(1);
  45   VERIFY( ums1 == ums2 );
  46   VERIFY( !(ums1 != ums2) );
  47
  48   ums1.insert(3);
  49   VERIFY( ums1 != ums2 );
  50   VERIFY( !(ums1 == ums2) );
  51
  52   ums2.insert(3);
  53   VERIFY( (ums1 == ums2) );
  54   VERIFY( !(ums1 != ums2) );
  55
  56   ums2.clear();
  57   VERIFY( ums1 != ums2 );
  58   VERIFY( !(ums1 == ums2) );
  59
  60   ums1.clear();
  61   VERIFY( ums1 == ums2 );
  62   VERIFY( !(ums1 != ums2) );
  63
  64   ums1.insert(1);
  65   ums2.insert(2);
  66   VERIFY( ums1 != ums2 );
  67   VERIFY( !(ums1 == ums2) );
  68
  69   ums1.insert(2);
  70   ums2.insert(1);
  71   VERIFY( ums1 == ums2 );
  72   VERIFY( !(ums1 != ums2) );
  73
  74   ums1.insert(3);
  75   ums2.insert(4);
  76   VERIFY( ums1 != ums2 );
  77   VERIFY( !(ums1 == ums2) );
  78
  79   ums1.insert(4);
  80   VERIFY( ums1 != ums2 );
  81   VERIFY( !(ums1 == ums2) );
  82
  83   ums2.insert(3);
  84   VERIFY( ums1 == ums2 );
  85   VERIFY( !(ums1 != ums2) );
  86
  87   ums1.insert(1);
  88   ums2.insert(1);
  89   VERIFY( ums1 == ums2 );
  90   VERIFY( !(ums1 != ums2) );
  91
  92   ums1.insert(4);
  93   ums2.insert(4);
  94   VERIFY( ums1 == ums2 );
  95   VERIFY( !(ums1 != ums2) );
  96
  97   const std::unordered_multiset<int> cums1(ums1), cums2(ums2);
  98   VERIFY( cums1 == cums2 );
  99   VERIFY( !(cums1 != cums2) );
 100   VERIFY( cums1 == ums2 );
 101   VERIFY( !(ums1 != cums2) );
 102 }
 103
 104 int main()
 105 {
 106   test01();
 107   return 0;
 108 }