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
|
// PERMUTE_ARGS:
import std.algorithm : map;
import std.random : Random, uniform, unpredictableSeed;
import std.range : repeat;
import std.stdio : writeln;
// Quick, dirty and inefficient AA using linear search, useful for testing.
struct LinearAA(K, V) {
K[] keys;
V[] values;
V opIndex(K key) {
foreach(i, k; keys) {
if(k == key) {
return values[i];
}
}
assert(0, "Key not present.");
}
V opIndexAssign(V val, K key) {
foreach(i, k; keys) {
if(k == key) {
return values[i] = val;
}
}
keys ~= key;
values ~= val;
return val;
}
V* opIn_r(K key) {
foreach(i, k; keys) {
if(key == k) {
return values.ptr + i;
}
}
return null;
}
void remove(K key) {
size_t i = 0;
for(; i < keys.length; i++) {
if(keys[i] == key) {
break;
}
}
assert(i < keys.length);
for(; i < keys.length - 1; i++) {
keys[i] = keys[i + 1];
values[i] = values[i + 1];
}
keys = keys[0..$ - 1];
values = values[0..$ - 1];
}
size_t length() {
return values.length;
}
}
void main() {
Random gen;
uint[] seed;
gen.seed(map!((a) {
seed ~= unpredictableSeed;
return seed[$-1]; })(repeat(0)));
writeln(seed);
foreach(iter; 0..10) { // Bug only happens after a few iterations.
writeln(iter);
uint[size_t] builtin;
LinearAA!(size_t, uint) linAA;
uint[] nums = new uint[100_000];
foreach(ref num; nums) {
num = uniform(0U, uint.max, gen);
}
foreach(i; 0..10_000) {
auto index = uniform(0, nums.length, gen);
if(index in builtin) {
assert(index in linAA);
assert(builtin[index] == nums[index]);
assert(linAA[index] == nums[index]);
builtin.remove(index);
linAA.remove(index);
} else {
assert(!(index in linAA));
builtin[index] = nums[index];
linAA[index] = nums[index];
}
}
assert(builtin.length == linAA.length);
foreach(k, v; builtin) {
assert(k in linAA);
assert(*(k in builtin) == *(k in linAA));
assert(linAA[k] == v);
}
}
}
|
