1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
14 // class unordered_multimap
16 // pair<iterator, iterator> equal_range(const key_type& k);
18 #include <unordered_map>
22 #include "min_allocator.h"
27 typedef std::unordered_multimap<int, std::string> C;
28 typedef C::iterator I;
29 typedef std::pair<int, std::string> P;
43 C c(std::begin(a), std::end(a));
44 std::pair<I, I> r = c.equal_range(30);
45 assert(std::distance(r.first, r.second) == 1);
46 assert(r.first->first == 30);
47 assert(r.first->second == "thirty");
49 assert(std::distance(r.first, r.second) == 0);
50 r = c.equal_range(50);
51 assert(r.first->first == 50);
52 assert(r.first->second == "fifty");
54 assert(r.first->first == 50);
55 assert(r.first->second == "fiftyA");
57 assert(r.first->first == 50);
58 assert(r.first->second == "fiftyB");
60 #if __cplusplus >= 201103L
62 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
63 min_allocator<std::pair<const int, std::string>>> C;
64 typedef C::iterator I;
65 typedef std::pair<int, std::string> P;
79 C c(std::begin(a), std::end(a));
80 std::pair<I, I> r = c.equal_range(30);
81 assert(std::distance(r.first, r.second) == 1);
82 assert(r.first->first == 30);
83 assert(r.first->second == "thirty");
85 assert(std::distance(r.first, r.second) == 0);
86 r = c.equal_range(50);
87 assert(r.first->first == 50);
88 assert(r.first->second == "fifty");
90 assert(r.first->first == 50);
91 assert(r.first->second == "fiftyA");
93 assert(r.first->first == 50);
94 assert(r.first->second == "fiftyB");