1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// <unordered_set>
10
11// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
12// class Alloc = allocator<Value>>
13// class unordered_multiset
14
15// size_type count(const key_type& k) const;
16
17#include <unordered_set>
18#include <cassert>
19
20#include "test_macros.h"
21#include "min_allocator.h"
22
23int main(int, char**) {
24 {
25 typedef std::unordered_multiset<int> C;
26 typedef int P;
27 P a[] = {P(10), P(20), P(30), P(40), P(50), P(50), P(50), P(60), P(70), P(80)};
28 const C c(std::begin(arr&: a), std::end(arr&: a));
29 assert(c.count(30) == 1);
30 assert(c.count(50) == 3);
31 assert(c.count(5) == 0);
32 }
33#if TEST_STD_VER >= 11
34 {
35 typedef std::unordered_multiset<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
36 typedef int P;
37 P a[] = {P(10), P(20), P(30), P(40), P(50), P(50), P(50), P(60), P(70), P(80)};
38 const C c(std::begin(a), std::end(a));
39 assert(c.count(30) == 1);
40 assert(c.count(50) == 3);
41 assert(c.count(5) == 0);
42 }
43#endif
44
45 return 0;
46}
47

source code of libcxx/test/std/containers/unord/unord.multiset/count.pass.cpp