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

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