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
|
// Return a new map, possibly filling some dummy entries to enforce creating
// multiple hash buckets.
function createMap(values, n) {
var xs = [...values];
for (var i = 0; i < n; ++i) {
xs.push({});
}
return new Map(xs.map((x, i) => [x, i]));
}
function runTest(fn) {
fn(0);
fn(100);
}
function testInlineDigitsSameSign(n) {
var xs = [1n, 2n];
var ys = [3n, 4n];
var zs = [...xs, ...ys];
var map = createMap(xs, n);
var N = 100;
var c = 0;
for (var i = 0; i < N; ++i) {
var z = zs[i & 3];
if (map.has(z)) c++;
}
assertEq(c, N / 2);
}
runTest(testInlineDigitsSameSign);
function testInlineDigitsDifferentSign(n) {
var xs = [-1n, 2n];
var ys = [1n, -2n];
var zs = [...xs, ...ys];
var map = createMap(xs, n);
var N = 100;
var c = 0;
for (var i = 0; i < N; ++i) {
var z = zs[i & 3];
if (map.has(z)) c++;
}
assertEq(c, N / 2);
}
runTest(testInlineDigitsDifferentSign);
function testHeapDigitsSameSign(n) {
// Definitely uses heap digits.
var heap = 2n ** 1000n;
var xs = [heap + 1n, heap + 2n];
var ys = [heap + 3n, heap + 4n];
var zs = [...xs, ...ys];
var map = createMap(xs, n);
var N = 100;
var c = 0;
for (var i = 0; i < N; ++i) {
var z = zs[i & 3];
if (map.has(z)) c++;
}
assertEq(c, N / 2);
}
runTest(testHeapDigitsSameSign);
function testHeapDigitsDifferentSign(n) {
// Definitely uses heap digits.
var heap = 2n ** 1000n;
var xs = [-(heap + 1n), heap + 2n];
var ys = [heap + 1n, -(heap + 2n)];
var zs = [...xs, ...ys];
var map = createMap(xs, n);
var N = 100;
var c = 0;
for (var i = 0; i < N; ++i) {
var z = zs[i & 3];
if (map.has(z)) c++;
}
assertEq(c, N / 2);
}
runTest(testHeapDigitsDifferentSign);
|
