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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this file,
* You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "mozilla/HashTable.h"
#include "mozilla/PairHash.h"
#include <utility>
void TestMoveConstructor() {
using namespace mozilla;
HashMap<int, int> map;
MOZ_RELEASE_ASSERT(map.putNew(3, 32));
MOZ_RELEASE_ASSERT(map.putNew(4, 42));
MOZ_RELEASE_ASSERT(map.count() == 2);
MOZ_RELEASE_ASSERT(!map.empty());
MOZ_RELEASE_ASSERT(!map.lookup(2));
MOZ_RELEASE_ASSERT(map.lookup(3)->value() == 32);
MOZ_RELEASE_ASSERT(map.lookup(4)->value() == 42);
HashMap<int, int> moved = std::move(map);
MOZ_RELEASE_ASSERT(moved.count() == 2);
MOZ_RELEASE_ASSERT(!moved.empty());
MOZ_RELEASE_ASSERT(!moved.lookup(2));
MOZ_RELEASE_ASSERT(moved.lookup(3)->value() == 32);
MOZ_RELEASE_ASSERT(moved.lookup(4)->value() == 42);
MOZ_RELEASE_ASSERT(map.empty());
MOZ_RELEASE_ASSERT(!map.count());
}
enum SimpleEnum { SIMPLE_1, SIMPLE_2 };
enum class ClassEnum : int {
CLASS_ENUM_1,
CLASS_ENUM_2,
};
void TestEnumHash() {
using namespace mozilla;
HashMap<SimpleEnum, int> map;
MOZ_RELEASE_ASSERT(map.put(SIMPLE_1, 1));
MOZ_RELEASE_ASSERT(map.put(SIMPLE_2, 2));
MOZ_RELEASE_ASSERT(map.lookup(SIMPLE_1)->value() == 1);
MOZ_RELEASE_ASSERT(map.lookup(SIMPLE_2)->value() == 2);
HashMap<ClassEnum, int> map2;
MOZ_RELEASE_ASSERT(map2.put(ClassEnum::CLASS_ENUM_1, 1));
MOZ_RELEASE_ASSERT(map2.put(ClassEnum::CLASS_ENUM_2, 2));
MOZ_RELEASE_ASSERT(map2.lookup(ClassEnum::CLASS_ENUM_1)->value() == 1);
MOZ_RELEASE_ASSERT(map2.lookup(ClassEnum::CLASS_ENUM_2)->value() == 2);
}
void TestHashPair() {
using namespace mozilla;
// Test with std::pair
{
HashMap<std::pair<int, bool>, int, PairHasher<int, bool>> map;
std::pair<int, bool> key1 = std::make_pair(1, true);
MOZ_RELEASE_ASSERT(map.putNew(key1, 1));
MOZ_RELEASE_ASSERT(map.has(key1));
std::pair<int, bool> key2 = std::make_pair(1, false);
MOZ_RELEASE_ASSERT(map.putNew(key2, 1));
std::pair<int, bool> key3 = std::make_pair(2, false);
MOZ_RELEASE_ASSERT(map.putNew(key3, 2));
MOZ_RELEASE_ASSERT(map.has(key3));
MOZ_RELEASE_ASSERT(map.lookup(key1)->value() == 1);
MOZ_RELEASE_ASSERT(map.lookup(key2)->value() == 1);
MOZ_RELEASE_ASSERT(map.lookup(key3)->value() == 2);
}
// Test wtih compact pair
{
HashMap<mozilla::CompactPair<int, bool>, int, CompactPairHasher<int, bool>>
map;
mozilla::CompactPair<int, bool> key1 = mozilla::MakeCompactPair(1, true);
MOZ_RELEASE_ASSERT(map.putNew(key1, 1));
MOZ_RELEASE_ASSERT(map.has(key1));
mozilla::CompactPair<int, bool> key2 = mozilla::MakeCompactPair(1, false);
MOZ_RELEASE_ASSERT(map.putNew(key2, 1));
mozilla::CompactPair<int, bool> key3 = mozilla::MakeCompactPair(2, false);
MOZ_RELEASE_ASSERT(map.putNew(key3, 2));
MOZ_RELEASE_ASSERT(map.has(key3));
MOZ_RELEASE_ASSERT(map.lookup(key1)->value() == 1);
MOZ_RELEASE_ASSERT(map.lookup(key2)->value() == 1);
MOZ_RELEASE_ASSERT(map.lookup(key3)->value() == 2);
}
}
int main() {
TestMoveConstructor();
TestEnumHash();
TestHashPair();
return 0;
}
|
