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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
#include "stdafx.h"
#include "Core/Map.h"
#include "Core/Str.h"
#include "Core/Hash.h"
#include "Compiler/Debug.h"
using debug::PtrKey;
BEGIN_TEST(MapTest, Core) {
Engine &e = gEngine();
// Basic operation:
{
Map<Str *, Str *> *map = new (e) Map<Str *, Str *>();
map->put(new (e) Str(L"A"), new (e) Str(L"10"));
map->put(new (e) Str(L"B"), new (e) Str(L"11"));
map->put(new (e) Str(L"A"), new (e) Str(L"12"));
map->put(new (e) Str(L"E"), new (e) Str(L"13"));
CHECK_EQ(map->count(), 3);
CHECK_EQ(::toS(map->get(new (e) Str(L"A"))), L"12");
map->remove(new (e) Str(L"A"));
CHECK_EQ(map->count(), 2);
CHECK_EQ(::toS(map->get(new (e) Str(L"B"))), L"11");
CHECK_EQ(::toS(map->get(new (e) Str(L"E"))), L"13");
CHECK_EQ(::toS(map->get(new (e) Str(L"A"), new (e) Str(L"-"))), L"-");
CHECK_ERROR(::toS(map->get(new (e) Str(L"A"))), MapError);
CHECK_EQ(::toS(map->find(new (e) Str(L"B")).v()), L"11");
CHECK(map->find(new (e) Str(L"Z")) == map->end());
}
// Do primitives work as values?
{
Map<Str *, Int> *map = new (e) Map<Str *, Int>();
map->put(new (e) Str(L"A"), 10);
map->put(new (e) Str(L"B"), 11);
map->put(new (e) Str(L"A"), 12);
map->put(new (e) Str(L"E"), 13);
CHECK_EQ(map->count(), 3);
CHECK_EQ(map->get(new (e) Str(L"A")), 12);
map->remove(new (e) Str(L"A"));
CHECK_EQ(map->count(), 2);
CHECK_EQ(map->get(new (e) Str(L"B")), 11);
CHECK_EQ(map->get(new (e) Str(L"E")), 13);
CHECK_EQ(map->get(new (e) Str(L"A"), 99), 99);
CHECK_ERROR(map->get(new (e) Str(L"A")), MapError);
}
// TODO: More tests here!
} END_TEST
BEGIN_TEST(MapExTest, CoreEx) {
Engine &e = gEngine();
// Do primitives work as keys?
{
Map<Int, Int> *map = new (e) Map<Int, Int>();
map->put(1, 10);
map->put(2, 11);
map->put(1, 12);
map->put(4, 13);
CHECK_EQ(map->count(), 3);
CHECK_EQ(map->get(1), 12);
map->remove(1);
CHECK_EQ(map->count(), 2);
CHECK_EQ(map->get(2), 11);
CHECK_EQ(map->get(4), 13);
CHECK_EQ(map->get(1, 99), 99);
CHECK_ERROR(map->get(1), MapError);
}
} END_TEST
static bool moveObjects(Array<PtrKey *> *k) {
// Try a few times...
for (nat i = 0; i < 10; i++) {
gEngine().gc.collect();
for (nat i = 0; i < k->count(); i++)
if (k->at(i)->moved())
return true;
}
return false;
}
BEGIN_TEST(MapTestMove, Core) {
// Do we handle moving objects properly?
Engine &e = gEngine();
const nat count = 10;
// Store these in arrays so the GC can move them properly.
Array<PtrKey *> *k = new (e) Array<PtrKey *>();
Array<Str *> *v = new (e) Array<Str *>();
for (nat i = 0; i < count; i++) {
k->push(new (e) PtrKey());
v->push(new (e) Str(::toS(i).c_str()));
// Make it less likely that we pin all objects.
runtime::allocArray<Byte>(e, &byteArrayType, 1000);
}
Map<PtrKey *, Str *> *map = new (e) Map<PtrKey *, Str *>();
for (nat i = 0; i < count; i++) {
map->put(k->at(i), v->at(i));
k->at(i)->reset();
}
// Try to force objects to be moved around!
// Note: if we're using a non-moving collector, the following tests will fail.
CHECK(moveObjects(k));
// Try to find all objects in the map:
for (nat i = 0; i < count; i++) {
CHECK_OBJ_EQ(map->get(k->at(i)), v->at(i));
}
// Move the objects once more, so we can try 'remove' properly.
CHECK(moveObjects(k));
// Try to remove an object.
for (nat i = 0; i < count; i++) {
map->remove(k->at(i));
CHECK_EQ(map->count(), count - i - 1);
// Validate the others.
for (nat j = 0; j < count; j++) {
if (j <= i) {
CHECK(!map->has(k->at(j)));
} else {
CHECK_OBJ_EQ(map->get(k->at(j)), v->at(j));
}
}
}
} END_TEST
static bool verify(Array<PtrKey *> *k, Array<Str *> *v, Map<PtrKey *, Str *> *map) {
if (!moveObjects(k))
return false;
for (nat i = 0; i < k->count(); i++) {
Str *found = map->get(k->at(i), null);
if (found != v->at(i)) {
PLN(L"Failed: " << (void *)k->at(i) << L" (" << (void *)(size_t)ptrHash(k->at(i)) << L"), got " << found << L", expected " << v->at(i));
map->dbg_print();
return false;
}
}
return true;
}
BEGIN_TEST(MapTestMoveStress, Stress) {
Engine &e = gEngine();
const nat count = 500;
const nat times = 1000;
Array<PtrKey *> *k = new (e) Array<PtrKey *>();
Array<Str *> *v = new (e) Array<Str *>();
for (nat i = 0; i < count; i++) {
k->push(new (e) PtrKey());
v->push(new (e) Str(::toS(i).c_str()));
}
Map<PtrKey *, Str *> *map = new (e) Map<PtrKey *, Str *>();
for (nat i = 0; i < count; i++) {
map->put(k->at(i), v->at(i));
}
for (nat i = 0; i < times; i++) {
bool z = verify(k, v, map);
CHECK(z);
if (!z)
break;
}
} END_TEST
|
