mirror of
https://github.com/denoland/deno.git
synced 2025-09-27 04:39:10 +00:00
refactor(test): grab runTests() and runBenchmarks() from __bootstrap (#15420)
This commit is contained in:
parent
5262937285
commit
4f8dea100e
5 changed files with 128 additions and 64 deletions
|
@ -16,6 +16,7 @@
|
|||
ArrayPrototypePush,
|
||||
ArrayPrototypeShift,
|
||||
ArrayPrototypeSort,
|
||||
BigInt,
|
||||
DateNow,
|
||||
Error,
|
||||
FunctionPrototype,
|
||||
|
@ -600,7 +601,8 @@
|
|||
const testStates = new Map();
|
||||
/** @type {BenchDescription[]} */
|
||||
const benchDescs = [];
|
||||
let isTestOrBenchSubcommand = false;
|
||||
let isTestSubcommand = false;
|
||||
let isBenchSubcommand = false;
|
||||
|
||||
// Main test function provided by Deno.
|
||||
function test(
|
||||
|
@ -608,7 +610,7 @@
|
|||
optionsOrFn,
|
||||
maybeFn,
|
||||
) {
|
||||
if (!isTestOrBenchSubcommand) {
|
||||
if (!isTestSubcommand) {
|
||||
return;
|
||||
}
|
||||
|
||||
|
@ -727,7 +729,7 @@
|
|||
optionsOrFn,
|
||||
maybeFn,
|
||||
) {
|
||||
if (!isTestOrBenchSubcommand) {
|
||||
if (!isBenchSubcommand) {
|
||||
return;
|
||||
}
|
||||
|
||||
|
@ -1032,11 +1034,12 @@
|
|||
return ops.op_bench_now();
|
||||
}
|
||||
|
||||
// This function is called by Rust side if we're in `deno test` or
|
||||
// `deno bench` subcommand. If this function is not called then `Deno.test()`
|
||||
// and `Deno.bench()` become noops.
|
||||
function enableTestAndBench() {
|
||||
isTestOrBenchSubcommand = true;
|
||||
function enableTest() {
|
||||
isTestSubcommand = true;
|
||||
}
|
||||
|
||||
function enableBench() {
|
||||
isBenchSubcommand = true;
|
||||
}
|
||||
|
||||
async function runTests({
|
||||
|
@ -1062,15 +1065,16 @@
|
|||
|
||||
if (shuffle !== null) {
|
||||
// http://en.wikipedia.org/wiki/Linear_congruential_generator
|
||||
// Use BigInt for everything because the random seed is u64.
|
||||
const nextInt = (function (state) {
|
||||
const m = 0x80000000;
|
||||
const a = 1103515245;
|
||||
const c = 12345;
|
||||
const m = 0x80000000n;
|
||||
const a = 1103515245n;
|
||||
const c = 12345n;
|
||||
|
||||
return function (max) {
|
||||
return state = ((a * state + c) % m) % max;
|
||||
return state = ((a * state + c) % m) % BigInt(max);
|
||||
};
|
||||
}(shuffle));
|
||||
}(BigInt(shuffle)));
|
||||
|
||||
for (let i = filtered.length - 1; i > 0; i--) {
|
||||
const j = nextInt(i);
|
||||
|
@ -1390,15 +1394,12 @@
|
|||
return testFn;
|
||||
}
|
||||
|
||||
window.__bootstrap.internals = {
|
||||
...window.__bootstrap.internals ?? {},
|
||||
enableTestAndBench,
|
||||
runTests,
|
||||
runBenchmarks,
|
||||
};
|
||||
|
||||
window.__bootstrap.testing = {
|
||||
test,
|
||||
bench,
|
||||
enableBench,
|
||||
enableTest,
|
||||
runBenchmarks,
|
||||
runTests,
|
||||
test,
|
||||
};
|
||||
})(this);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue