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_multimap
14
15// iterator find(const key_type& k);
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 typedef std::unordered_multimap<int, std::string> C;
28 typedef std::pair<int, std::string> P;
29 P a[] = {
30 P(10, "ten"),
31 P(20, "twenty"),
32 P(30, "thirty"),
33 P(40, "forty"),
34 P(50, "fifty"),
35 P(60, "sixty"),
36 P(70, "seventy"),
37 P(80, "eighty"),
38 };
39 C c(std::begin(arr&: a), std::end(arr&: a));
40 C::iterator i = c.find(x: 30);
41 assert(i->first == 30);
42 assert(i->second == "thirty");
43 i = c.find(x: 5);
44 assert(i == c.end());
45 }
46#if TEST_STD_VER >= 11
47 {
48 typedef std::unordered_multimap<int,
49 std::string,
50 std::hash<int>,
51 std::equal_to<int>,
52 min_allocator<std::pair<const int, std::string>>>
53 C;
54 typedef std::pair<int, std::string> P;
55 P a[] = {
56 P(10, "ten"),
57 P(20, "twenty"),
58 P(30, "thirty"),
59 P(40, "forty"),
60 P(50, "fifty"),
61 P(60, "sixty"),
62 P(70, "seventy"),
63 P(80, "eighty"),
64 };
65 C c(std::begin(a), std::end(a));
66 C::iterator i = c.find(30);
67 assert(i->first == 30);
68 assert(i->second == "thirty");
69 i = c.find(5);
70 assert(i == c.end());
71 }
72#endif
73
74 return 0;
75}
76

source code of libcxx/test/std/containers/unord/unord.multimap/find_non_const.pass.cpp