libstdc++-v3/testsuite/23_containers/multiset/operations/count.cc

   1 // 2011-10-28  Paolo Carlini  <paolo.carlini@oracle.com>
   2
   3 // Copyright (C) 2011-2025 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
  21 #include <set>
  22 #include <testsuite_hooks.h>
  23
  24 void test01()
  25 {
  26   using namespace std;
  27
  28   multiset<int> ms0;
  29   VERIFY( ms0.count(0) == 0 );
  30   VERIFY( ms0.count(1) == 0 );
  31
  32   ms0.insert(1);
  33   VERIFY( ms0.count(0) == 0 );
  34   VERIFY( ms0.count(1) == 1 );
  35
  36   ms0.insert(1);
  37   VERIFY( ms0.count(0) == 0 );
  38   VERIFY( ms0.count(1) == 2 );
  39
  40   ms0.insert(2);
  41   VERIFY( ms0.count(2) == 1 );
  42
  43   ms0.insert(3);
  44   ms0.insert(3);
  45   ms0.insert(3);
  46   VERIFY( ms0.count(3) == 3 );
  47
  48   ms0.erase(2);
  49   VERIFY( ms0.count(2) == 0 );
  50
  51   ms0.erase(0);
  52   VERIFY( ms0.count(0) == 0 );
  53
  54   multiset<int> ms1(ms0);
  55   VERIFY( ms1.count(0) == 0 );
  56   VERIFY( ms1.count(1) == 2 );
  57   VERIFY( ms1.count(2) == 0 );
  58   VERIFY( ms1.count(3) == 3 );
  59
  60   ms0.clear();
  61   VERIFY( ms0.count(0) == 0 );
  62   VERIFY( ms0.count(1) == 0 );
  63   VERIFY( ms0.count(2) == 0 );
  64   VERIFY( ms0.count(3) == 0 );
  65
  66   ms1.insert(4);
  67   ms1.insert(5);
  68   ms1.insert(5);
  69   ms1.insert(5);
  70   ms1.insert(5);
  71   VERIFY( ms1.count(4) == 1 );
  72   VERIFY( ms1.count(5) == 4 );
  73
  74   ms1.erase(1);
  75   VERIFY( ms1.count(1) == 0 );
  76
  77   ms1.erase(ms1.find(5));
  78   VERIFY( ms1.count(5) == 3 );
  79
  80   ms1.insert(1);
  81   ms1.insert(1);
  82   VERIFY( ms1.count(1) == 2 );
  83
  84   ms1.erase(5);
  85   VERIFY( ms1.count(5) == 0 );
  86
  87   ms1.erase(ms1.find(4));
  88   VERIFY( ms1.count(4) == 0 );
  89
  90   ms1.clear();
  91   VERIFY( ms1.count(0) == 0 );
  92   VERIFY( ms1.count(1) == 0 );
  93   VERIFY( ms1.count(2) == 0 );
  94   VERIFY( ms1.count(3) == 0 );
  95   VERIFY( ms1.count(4) == 0 );
  96   VERIFY( ms1.count(5) == 0 );
  97 }
  98
  99 int main()
 100 {
 101   test01();
 102   return 0;
 103 }