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_map>
10
11// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
12// class Alloc = allocator<pair<const Key, T>>>
13// class unordered_map
14
15// size_type count(const key_type& k) const;
16
17#include <unordered_map>
18#include <string>
19#include <cassert>
20#include <iterator>
21
22#include "test_macros.h"
23#include "min_allocator.h"
24
25int main(int, char**)
26{
27 {
28 typedef std::unordered_map<int, std::string> C;
29 typedef std::pair<int, std::string> P;
30 P a[] =
31 {
32 P(10, "ten"),
33 P(20, "twenty"),
34 P(30, "thirty"),
35 P(40, "forty"),
36 P(50, "fifty"),
37 P(60, "sixty"),
38 P(70, "seventy"),
39 P(80, "eighty"),
40 };
41 const C c(std::begin(arr&: a), std::end(arr&: a));
42 assert(c.count(30) == 1);
43 assert(c.count(5) == 0);
44 }
45#if TEST_STD_VER >= 11
46 {
47 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
48 min_allocator<std::pair<const int, std::string>>> C;
49 typedef std::pair<int, std::string> P;
50 P a[] =
51 {
52 P(10, "ten"),
53 P(20, "twenty"),
54 P(30, "thirty"),
55 P(40, "forty"),
56 P(50, "fifty"),
57 P(60, "sixty"),
58 P(70, "seventy"),
59 P(80, "eighty"),
60 };
61 const C c(std::begin(a), std::end(a));
62 assert(c.count(30) == 1);
63 assert(c.count(5) == 0);
64 }
65#endif
66
67 return 0;
68}
69

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