// Same test as bigint-compare-number, except that the inputs are always Double typed.
// Test various combinations of (BigInt R Double) and ensures the result is consistent with // (Double R⁻¹ BigInt). This test doesn't aim to cover the overall correctness of (BigInt R Double), // but merely ensures the possible combinations are properly handled in CacheIR.
// Compute the Double approximation of the BigInt values. var ys = xs.map(x => Double(Number(x)));
// Compute if the Double approximation of the BigInt values is exact. // (The larger test values are all powers of two, so we can keep this function simple.) var zs = xs.map(x => { var isNegative = x < 0n; if (isNegative) {
x = -x;
} var s = x.toString(2); if (s.length <= 53 || (s.length <= 1024 && /^1+0+$/.test(s))) { return 0;
} if (s.length <= 1024 && /^1+$/.test(s)) { return isNegative ? -1 : 1;
} if (s.length <= 1024 && /^1+0+1$/.test(s)) { return isNegative ? 1 : -1;
} return NaN;
});
function testLooseEqual() { for (var i = 0; i < 100; ++i) { var j = i % xs.length; var x = xs[j]; var y = ys[j]; var z = zs[j];
assertEq(x == y, z === 0);
assertEq(y == x, z === 0);
}
}
testLooseEqual();
function testLooseNotEqual() { for (var i = 0; i < 100; ++i) { var j = i % xs.length; var x = xs[j]; var y = ys[j]; var z = zs[j];
assertEq(x != y, z !== 0);
assertEq(y != x, z !== 0);
}
}
testLooseNotEqual();
function testLessThan() { for (var i = 0; i < 100; ++i) { var j = i % xs.length; var x = xs[j]; var y = ys[j]; var z = zs[j];
if (z === 0) {
assertEq(x < y, false);
assertEq(y < x, false);
} elseif (z > 0) {
assertEq(x < y, true);
assertEq(y < x, false);
} elseif (z < 0) {
assertEq(x < y, false);
assertEq(y < x, true);
} else {
assertEq(x < y, y > 0);
assertEq(y < x, y < 0);
}
}
}
testLessThan();
function testLessThanEquals() { for (var i = 0; i < 100; ++i) { var j = i % xs.length; var x = xs[j]; var y = ys[j]; var z = zs[j];
if (z === 0) {
assertEq(x <= y, true);
assertEq(y <= x, true);
} elseif (z > 0) {
assertEq(x <= y, true);
assertEq(y <= x, false);
} elseif (z < 0) {
assertEq(x <= y, false);
assertEq(y <= x, true);
} else {
assertEq(x <= y, y > 0);
assertEq(y <= x, y < 0);
}
}
}
testLessThanEquals();
function testGreaterThan() { for (var i = 0; i < 100; ++i) { var j = i % xs.length; var x = xs[j]; var y = ys[j]; var z = zs[j];
if (z === 0) {
assertEq(x > y, false);
assertEq(y > x, false);
} elseif (z > 0) {
assertEq(x > y, false);
assertEq(y > x, true);
} elseif (z < 0) {
assertEq(x > y, true);
assertEq(y > x, false);
} else {
assertEq(x > y, y < 0);
assertEq(y > x, y > 0);
}
}
}
testGreaterThan();
function testGreaterThanEquals() { for (var i = 0; i < 100; ++i) { var j = i % xs.length; var x = xs[j]; var y = ys[j]; var z = zs[j];
if (z === 0) {
assertEq(x >= y, true);
assertEq(y >= x, true);
} elseif (z > 0) {
assertEq(x >= y, false);
assertEq(y >= x, true);
} elseif (z < 0) {
assertEq(x >= y, true);
assertEq(y >= x, false);
} else {
assertEq(x >= y, y < 0);
assertEq(y >= x, y > 0);
}
}
}
testGreaterThanEquals();
Messung V0.5
¤ Dauer der Verarbeitung: 0.23 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.