libstdc++-v3/testsuite/23_containers/unordered_multimap/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-2020 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_map>
  23 #include <testsuite_hooks.h>
  24
  25 void test01()
  26 {
  27   typedef std::pair<const int, int> Pair;
  28   std::unordered_multimap<int, int> umm1, umm2;
  29   VERIFY( umm1 == umm2 );
  30   VERIFY( !(umm1 != umm2) );
  31
  32   umm1.insert(Pair(1, -1));
  33   umm2.insert(Pair(1, -1));
  34   VERIFY( umm1 == umm2 );
  35   VERIFY( !(umm1 != umm2) );
  36
  37   umm1.insert(Pair(2, -1));
  38   umm2.insert(Pair(2, -1));
  39   VERIFY( umm1 == umm2 );
  40   VERIFY( !(umm1 != umm2) );
  41
  42   umm1.insert(Pair(1, -1));
  43   umm2.insert(Pair(1, -1));
  44   VERIFY( umm1 == umm2 );
  45   VERIFY( !(umm1 != umm2) );
  46
  47   umm1.insert(Pair(3, -3));
  48   VERIFY( umm1 != umm2 );
  49   VERIFY( !(umm1 == umm2) );
  50
  51   umm2.insert(Pair(3, -3));
  52   VERIFY( (umm1 == umm2) );
  53   VERIFY( !(umm1 != umm2) );
  54
  55   umm2.clear();
  56   VERIFY( umm1 != umm2 );
  57   VERIFY( !(umm1 == umm2) );
  58
  59   umm1.clear();
  60   VERIFY( umm1 == umm2 );
  61   VERIFY( !(umm1 != umm2) );
  62
  63   umm1.insert(Pair(1, -1));
  64   umm2.insert(Pair(2, -2));
  65   VERIFY( umm1 != umm2 );
  66   VERIFY( !(umm1 == umm2) );
  67
  68   umm1.insert(Pair(2, -2));
  69   umm2.insert(Pair(1, -1));
  70   VERIFY( umm1 == umm2 );
  71   VERIFY( !(umm1 != umm2) );
  72
  73   umm1.insert(Pair(3, -3));
  74   umm2.insert(Pair(4, -4));
  75   VERIFY( umm1 != umm2 );
  76   VERIFY( !(umm1 == umm2) );
  77
  78   umm1.insert(Pair(4, -4));
  79   VERIFY( umm1 != umm2 );
  80   VERIFY( !(umm1 == umm2) );
  81
  82   umm2.insert(Pair(3, -3));
  83   VERIFY( umm1 == umm2 );
  84   VERIFY( !(umm1 != umm2) );
  85
  86   umm1.insert(Pair(1, -1));
  87   umm2.insert(Pair(1, -1));
  88   VERIFY( umm1 == umm2 );
  89   VERIFY( !(umm1 != umm2) );
  90
  91   umm1.insert(Pair(4, -4));
  92   umm2.insert(Pair(4, -4));
  93   VERIFY( umm1 == umm2 );
  94   VERIFY( !(umm1 != umm2) );
  95
  96   umm1.clear();
  97   umm2.clear();
  98   VERIFY( umm1 == umm2 );
  99   VERIFY( !(umm1 != umm2) );
 100
 101   umm1.insert(Pair(1, -1));
 102   umm2.insert(Pair(1, -2));
 103   VERIFY( umm1 != umm2 );
 104   VERIFY( !(umm1 == umm2) );
 105
 106   umm1.clear();
 107   umm2.clear();
 108   VERIFY( umm1 == umm2 );
 109   VERIFY( !(umm1 != umm2) );
 110
 111   umm1.insert(Pair(1, -1));
 112   umm2.insert(Pair(1, -1));
 113   VERIFY( umm1 == umm2 );
 114   VERIFY( !(umm1 != umm2) );
 115
 116   umm1.insert(Pair(2, -2));
 117   umm2.insert(Pair(2, -3));
 118   VERIFY( umm1 != umm2 );
 119   VERIFY( !(umm1 == umm2) );
 120
 121   umm1.insert(Pair(2, -3));
 122   umm2.insert(Pair(2, -2));
 123   VERIFY( umm1 == umm2 );
 124   VERIFY( !(umm1 != umm2) );
 125
 126   umm1.clear();
 127   umm2.clear();
 128   VERIFY( umm1 == umm2 );
 129   VERIFY( !(umm1 != umm2) );
 130
 131   umm1.insert(Pair(2, -2));
 132   umm2.insert(Pair(2, -3));
 133   VERIFY( umm1 != umm2 );
 134   VERIFY( !(umm1 == umm2) );
 135
 136   umm1.insert(Pair(1, -1));
 137   umm2.insert(Pair(1, -1));
 138   VERIFY( umm1 != umm2 );
 139   VERIFY( !(umm1 == umm2) );
 140
 141   umm1.insert(Pair(2, -3));
 142   umm2.insert(Pair(2, -2));
 143   VERIFY( umm1 == umm2 );
 144   VERIFY( !(umm1 != umm2) );
 145
 146   umm1.insert(Pair(1, -1));
 147   umm2.insert(Pair(1, -1));
 148   VERIFY( umm1 == umm2 );
 149   VERIFY( !(umm1 != umm2) );
 150
 151   umm1.insert(Pair(1, -1));
 152   umm2.insert(Pair(1, -2));
 153   VERIFY( umm1 != umm2 );
 154   VERIFY( !(umm1 == umm2) );
 155
 156   umm1.insert(Pair(3, -3));
 157   umm2.insert(Pair(3, -3));
 158   VERIFY( umm1 != umm2 );
 159   VERIFY( !(umm1 == umm2) );
 160
 161   umm1.insert(Pair(3, -4));
 162   umm2.insert(Pair(3, -3));
 163   VERIFY( umm1 != umm2 );
 164   VERIFY( !(umm1 == umm2) );
 165
 166   umm1.insert(Pair(3, -3));
 167   VERIFY( umm1 != umm2 );
 168   VERIFY( !(umm1 == umm2) );
 169
 170   umm1.insert(Pair(1, -2));
 171   umm2.insert(Pair(1, -1));
 172   VERIFY( umm1 != umm2 );
 173   VERIFY( !(umm1 == umm2) );
 174
 175   umm2.insert(Pair(3, -4));
 176   VERIFY( umm1 == umm2 );
 177   VERIFY( !(umm1 != umm2) );
 178
 179   const std::unordered_multimap<int, int> cumm1(umm1), cumm2(umm2);
 180   VERIFY( cumm1 == cumm2 );
 181   VERIFY( !(cumm1 != cumm2) );
 182   VERIFY( cumm1 == umm2 );
 183   VERIFY( !(umm1 != cumm2) );
 184 }
 185
 186 int main()
 187 {
 188   test01();
 189   return 0;
 190 }