-
Notifications
You must be signed in to change notification settings - Fork 0
/
unorder_test1.cpp
57 lines (47 loc) · 1.06 KB
/
unorder_test1.cpp
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
47
48
49
50
51
52
53
54
55
56
57
#include <inttypes.h>
#include <iostream>
#include <string>
#include <vector>
#include <bitset>
#include <unordered_map>
using namespace std;
struct Key
{
string first;
string second;
};
struct KeyHash
{
size_t operator()(const Key& k) const
{
return hash<string>()(k.first) ^ hash<string>()(k.second) << 1;
}
};
struct KeyEqual
{
bool operator()(const Key& k1, const Key& k2) const
{
return k1.first == k2.first && k1.second == k2.second;
}
};
int main()
{
unordered_map<string, string> m1;
unordered_map<uint32_t, string> m2 =
{
{1, "a"}, {2, "b"}, {3, "c"}
};
//copy construct
unordered_map<uint32_t, string> m3 = m2;
//move construct
unordered_map<uint32_t, string> m4 = move(m2);
//rang construct
vector<pair<bitset<8>, uint32_t>> v = {{0x12, 33}, {0x33, 44}, {0x44, 44}};
unordered_map<bitset<8>, uint32_t> m5(v.begin(), v.end());
//construct for a custom type
unordered_map<Key, string, KeyHash, KeyEqual> m6 =
{
{{"a", "b"}, "aaa"}, {{"c", "d"}, "bbb"}
};
return 0;
}