1 //===----------------------------------------------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9
10 // <unordered_set>
11
12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
13 // class Alloc = allocator<Value>>
14 // class unordered_multiset
15
16 // iterator find(const key_type& k);
17
18 #include <unordered_set>
19 #include <cassert>
20
21 #include "min_allocator.h"
22
main()23 int main()
24 {
25 {
26 typedef std::unordered_multiset<int> C;
27 typedef int P;
28 P a[] =
29 {
30 P(10),
31 P(20),
32 P(30),
33 P(40),
34 P(50),
35 P(60),
36 P(70),
37 P(80)
38 };
39 C c(std::begin(a), std::end(a));
40 C::iterator i = c.find(30);
41 assert(*i == 30);
42 i = c.find(5);
43 assert(i == c.cend());
44 }
45 #if __cplusplus >= 201103L
46 {
47 typedef std::unordered_multiset<int, std::hash<int>,
48 std::equal_to<int>, min_allocator<int>> C;
49 typedef int P;
50 P a[] =
51 {
52 P(10),
53 P(20),
54 P(30),
55 P(40),
56 P(50),
57 P(60),
58 P(70),
59 P(80)
60 };
61 C c(std::begin(a), std::end(a));
62 C::iterator i = c.find(30);
63 assert(*i == 30);
64 i = c.find(5);
65 assert(i == c.cend());
66 }
67 #endif
68 }
69