// Similar test as "cacheir/map-has-bigint.js", except that we now perform // duplicate lookups to ensure GVN works properly. // 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_same_map(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++; if (map.has(z)) c++; } assertEq(c, N); } runTest(testInlineDigitsSameSign_same_map); function testInlineDigitsDifferentSign_same_map(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++; if (map.has(z)) c++; } assertEq(c, N); } runTest(testInlineDigitsDifferentSign_same_map); function testHeapDigitsSameSign_same_map(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++; if (map.has(z)) c++; } assertEq(c, N); } runTest(testHeapDigitsSameSign_same_map); function testHeapDigitsDifferentSign_same_map(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++; if (map.has(z)) c++; } assertEq(c, N); } runTest(testHeapDigitsDifferentSign_same_map); // Duplicate the above tests, but this time use a different map. function testInlineDigitsSameSign_different_map(n) { var xs = [1n, 2n]; var ys = [3n, 4n]; var zs = [...xs, ...ys]; var map1 = createMap(xs, n); var map2 = createMap(xs, n); var N = 100; var c = 0; for (var i = 0; i < N; ++i) { var z = zs[i & 3]; if (map1.has(z)) c++; if (map2.has(z)) c++; } assertEq(c, N); } runTest(testInlineDigitsSameSign_different_map); function testInlineDigitsDifferentSign_different_map(n) { var xs = [-1n, 2n]; var ys = [1n, -2n]; var zs = [...xs, ...ys]; var map1 = createMap(xs, n); var map2 = createMap(xs, n); var N = 100; var c = 0; for (var i = 0; i < N; ++i) { var z = zs[i & 3]; if (map1.has(z)) c++; if (map2.has(z)) c++; } assertEq(c, N); } runTest(testInlineDigitsDifferentSign_different_map); function testHeapDigitsSameSign_different_map(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 map1 = createMap(xs, n); var map2 = createMap(xs, n); var N = 100; var c = 0; for (var i = 0; i < N; ++i) { var z = zs[i & 3]; if (map1.has(z)) c++; if (map2.has(z)) c++; } assertEq(c, N); } runTest(testHeapDigitsSameSign_different_map); function testHeapDigitsDifferentSign_different_map(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 map1 = createMap(xs, n); var map2 = createMap(xs, n); var N = 100; var c = 0; for (var i = 0; i < N; ++i) { var z = zs[i & 3]; if (map1.has(z)) c++; if (map2.has(z)) c++; } assertEq(c, N); } runTest(testHeapDigitsDifferentSign_different_map); // Test the alias information is correct. function test_alias(n) { var xs = [1n, 2n]; var map = createMap([], n); var N = 100; var c = 0; for (var i = 0; i < N; ++i) { var x = xs[i & 1]; map.set(x, x); if (map.has(x)) c++; map.delete(x); if (map.has(x)) c++; } assertEq(c, N); } runTest(test_alias);