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// const_iterator find(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 C::const_iterator i = c.find(x: 30);
43 assert(i->first == 30);
44 assert(i->second == "thirty");
45 i = c.find(x: 5);
46 assert(i == c.cend());
47 }
48#if TEST_STD_VER >= 11
49 {
50 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
51 min_allocator<std::pair<const int, std::string>>> C;
52 typedef std::pair<int, std::string> P;
53 P a[] =
54 {
55 P(10, "ten"),
56 P(20, "twenty"),
57 P(30, "thirty"),
58 P(40, "forty"),
59 P(50, "fifty"),
60 P(60, "sixty"),
61 P(70, "seventy"),
62 P(80, "eighty"),
63 };
64 const C c(std::begin(a), std::end(a));
65 C::const_iterator i = c.find(30);
66 assert(i->first == 30);
67 assert(i->second == "thirty");
68 i = c.find(5);
69 assert(i == c.cend());
70 }
71#endif
72
73 return 0;
74}
75

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