blob: 2761bf17764a5795f00079ced7a2a85cc8db9282 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <unordered_map>
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
// class Alloc = allocator<pair<const Key, T>>>
// class unordered_map
// https://bugs.llvm.org/show_bug.cgi?id=16538
// https://bugs.llvm.org/show_bug.cgi?id=16549
#include <unordered_map>
#include <cassert>
struct Key {
template <typename T> Key(const T&) {}
bool operator== (const Key&) const { return true; }
};
namespace std
{
template <>
struct hash<Key>
{
size_t operator()(Key const &) const {return 0;}
};
}
int main()
{
typedef std::unordered_map<Key, int> MapT;
typedef MapT::iterator Iter;
MapT map;
Iter it = map.find(Key(0));
assert(it == map.end());
std::pair<Iter, bool> result = map.insert(std::make_pair(Key(0), 42));
assert(result.second);
assert(result.first->second == 42);
}
|
