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 Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
13 // class Alloc = allocator<Value>>
14 // class unordered_multiset
16 // pair<iterator, iterator> equal_range(const key_type& k);
18 #include <unordered_set>
21 #include "min_allocator.h"
26 typedef std::unordered_multiset<int> C;
27 typedef C::iterator I;
42 C c(std::begin(a), std::end(a));
43 std::pair<I, I> r = c.equal_range(30);
44 assert(std::distance(r.first, r.second) == 1);
45 assert(*r.first == 30);
47 assert(std::distance(r.first, r.second) == 0);
48 r = c.equal_range(50);
49 assert(std::distance(r.first, r.second) == 3);
50 assert(*r.first == 50);
52 assert(*r.first == 50);
54 assert(*r.first == 50);
56 #if TEST_STD_VER >= 11
58 typedef std::unordered_multiset<int, std::hash<int>,
59 std::equal_to<int>, min_allocator<int>> C;
60 typedef C::iterator I;
75 C c(std::begin(a), std::end(a));
76 std::pair<I, I> r = c.equal_range(30);
77 assert(std::distance(r.first, r.second) == 1);
78 assert(*r.first == 30);
80 assert(std::distance(r.first, r.second) == 0);
81 r = c.equal_range(50);
82 assert(std::distance(r.first, r.second) == 3);
83 assert(*r.first == 50);
85 assert(*r.first == 50);
87 assert(*r.first == 50);