]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/23_containers/unordered_multimap/operations/count.cc
52efe78d1772e13f6ad3f39d3d580942372673b7
1 // { dg-options "-std=gnu++0x" }
3 // 2011-10-28 Paolo Carlini <paolo.carlini@oracle.com>
5 // Copyright (C) 2011-2014 Free Software Foundation, Inc.
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)
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.
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/>.
23 #include <unordered_map>
24 #include <testsuite_hooks.h>
28 bool test
__attribute__((unused
)) = true;
31 typedef unordered_multimap
<int, int>::value_type value_type
;
33 unordered_multimap
<int, int> umm0
;
34 VERIFY( umm0
.count(0) == 0 );
35 VERIFY( umm0
.count(1) == 0 );
37 umm0
.insert(value_type(1, 1));
38 VERIFY( umm0
.count(0) == 0 );
39 VERIFY( umm0
.count(1) == 1 );
41 umm0
.insert(value_type(1, 2));
42 VERIFY( umm0
.count(0) == 0 );
43 VERIFY( umm0
.count(1) == 2 );
45 umm0
.insert(value_type(2, 1));
46 VERIFY( umm0
.count(2) == 1 );
48 umm0
.insert(value_type(3, 1));
49 umm0
.insert(value_type(3, 2));
50 umm0
.insert(value_type(3, 3));
51 VERIFY( umm0
.count(3) == 3 );
54 VERIFY( umm0
.count(2) == 0 );
57 VERIFY( umm0
.count(0) == 0 );
59 unordered_multimap
<int, int> umm1(umm0
);
60 VERIFY( umm1
.count(0) == 0 );
61 VERIFY( umm1
.count(1) == 2 );
62 VERIFY( umm1
.count(2) == 0 );
63 VERIFY( umm1
.count(3) == 3 );
66 VERIFY( umm0
.count(0) == 0 );
67 VERIFY( umm0
.count(1) == 0 );
68 VERIFY( umm0
.count(2) == 0 );
69 VERIFY( umm0
.count(3) == 0 );
71 umm1
.insert(value_type(4, 1));
72 umm1
.insert(value_type(5, 1));
73 umm1
.insert(value_type(5, 2));
74 umm1
.insert(value_type(5, 3));
75 umm1
.insert(value_type(5, 4));
76 VERIFY( umm1
.count(4) == 1 );
77 VERIFY( umm1
.count(5) == 4 );
80 VERIFY( umm1
.count(1) == 0 );
82 umm1
.erase(umm1
.find(5));
83 VERIFY( umm1
.count(5) == 3 );
85 umm1
.insert(value_type(1, 1));
86 umm1
.insert(value_type(1, 2));
87 VERIFY( umm1
.count(1) == 2 );
90 VERIFY( umm1
.count(5) == 0 );
92 umm1
.erase(umm1
.find(4));
93 VERIFY( umm1
.count(4) == 0 );
96 VERIFY( umm1
.count(0) == 0 );
97 VERIFY( umm1
.count(1) == 0 );
98 VERIFY( umm1
.count(2) == 0 );
99 VERIFY( umm1
.count(3) == 0 );
100 VERIFY( umm1
.count(4) == 0 );
101 VERIFY( umm1
.count(5) == 0 );