@flemist/test-variants 5.0.13 → 5.0.15

package/build/{createTestVariants-Bbto3Xye.mjs → createTestVariants-MkSgLExA.mjs}

@@ -1,11 +1,10 @@
-import { timeControllerDefault as F } from "@flemist/time-controller";
-import { formatAny as ge, Subject as Je, deepCloneJsonLike as Xe } from "@flemist/simple-utils";
-import { combineAbortSignals as X, isPromiseLike as O, abortSignalToPromise as Ze, waitMicrotasks as Ke } from "@flemist/async-utils";
-import { AbortError as Qe, AbortControllerFast as Z } from "@flemist/abort-controller-fast";
-import { poolWait as ae, Pool as Ye } from "@flemist/time-limits";
+import { timeControllerDefault as W } from "@flemist/time-controller";
+import { formatAny as ge, Subject as Je, combineAbortSignals as Z, isPromiseLike as O, abortSignalToPromise as Xe, deepCloneJsonLike as Ze, waitMicrotasks as Ke } from "@flemist/simple-utils";
+import { AbortError as Qe, AbortControllerFast as K } from "@flemist/abort-controller-fast";
+import { poolWait as le, Pool as Ye } from "@flemist/time-limits";
 class et extends Error {
 }
-function re() {
+function ne() {
   if (typeof process < "u" && process.memoryUsage)
     try {
       return process.memoryUsage.rss();
@@ -21,19 +20,19 @@ function re() {
   }
   return null;
 }
-const tt = 1e3, B = [];
+const tt = 1e3, k = [];
 function rt(e) {
   return ge(e, { pretty: !0, maxDepth: 5, maxItems: 50 });
 }
 function nt(...e) {
   const r = e.map((t) => typeof t == "string" ? t : rt(t)).join(" ");
-  B.push(r), B.length > tt && B.shift(), console.log(r);
+  k.push(r), k.length > tt && k.shift(), console.log(r);
 }
-function ot() {
-  return B.join(`
+function it() {
+  return k.join(`
 `);
 }
-globalThis.__getStressTestLogLast = ot;
+globalThis.__getStressTestLogLast = it;
 const pe = (e, r) => {
   nt(r);
 }, he = (e) => ge(e, {
@@ -52,7 +51,7 @@ const pe = (e, r) => {
   debug: !1,
   func: pe,
   format: he
-}, it = {
+}, ot = {
   start: !1,
   progress: !1,
   completed: !1,
@@ -63,7 +62,7 @@ const pe = (e, r) => {
   format: he
 };
 function be(e) {
-  return e === !1 ? it : e === !0 || !e ? T : {
+  return e === !1 ? ot : e === !0 || !e ? T : {
     start: e.start ?? T.start,
     progress: e.progress ?? T.progress,
     completed: e.completed ?? T.completed,
@@ -83,6 +82,7 @@ function st(e, r) {
     tests: 0,
     iterations: 0,
     iterationsAsync: 0,
+    maxTestDuration: 0,
     prevLogTime: t,
     prevLogMemory: r,
     pendingModeChange: null,
@@ -93,13 +93,13 @@ function st(e, r) {
 }
 class V extends Qe {
 }
-class lt {
+class at {
   _timeController;
   _subject;
   _interval;
   _timer;
   constructor(r, t) {
-    this._interval = r, this._timeController = t ?? F, this._subject = new Je({
+    this._interval = r, this._timeController = t ?? W, this._subject = new Je({
       startStopNotifier: () => (this.update(), () => {
         this._timeController.clearTimeout(this._timer);
       })
@@ -121,7 +121,7 @@ class lt {
     return this._subject.subscribe(r);
   }
 }
-const at = 50, ut = 5;
+const lt = 50, ut = 5;
 function ct(e, r) {
   return e == null ? null : typeof e == "number" ? e : e(r) ?? null;
 }
@@ -129,9 +129,10 @@ function ue(e, r) {
   return typeof e == "number" ? { iterationsAsync: 0, iterationsSync: e } : e != null && typeof e == "object" ? e : r ? { iterationsAsync: 1, iterationsSync: 0 } : { iterationsAsync: 0, iterationsSync: 1 };
 }
 function ft(e, r) {
-  const t = r.log, i = r.pauseDebuggerOnError ?? !0, o = r.onStart, s = r.onEnd;
-  let n = null, a = 0;
-  function c(m, h, y) {
+  const t = r.log, o = r.pauseDebuggerOnError ?? !0, i = r.onStart, s = r.onEnd;
+  r.state;
+  let n = null, l = 0;
+  function u(m, h, y) {
     n == null && (n = { error: m, args: h, tests: y }, t.error && t.func(
       "error",
       `[test-variants] error variant: ${t.format(h)}
@@ -139,31 +140,31 @@ tests: ${y}
 ${t.format(m)}`
     ));
     const d = Date.now();
-    if (i)
+    if (o)
       debugger;
-    if (Date.now() - d > at && a < ut) {
+    if (Date.now() - d > lt && l < ut) {
       t.func(
         "debug",
-        `[test-variants] debug iteration: ${a}`
-      ), a++;
+        `[test-variants] debug iteration: ${l}`
+      ), l++;
       return;
     }
     const v = n;
     throw n = null, r.onError && r.onError(v), v.error;
   }
-  const g = new lt(100);
+  const g = new at(100);
   return function(h, y, d) {
-    o && o({ args: h, tests: y });
+    i && i({ args: h, tests: y });
     const b = ct(r.timeout, h);
     let v = null, M = d, f = null;
-    b && (v = Date.now(), f = new Z(), M = {
-      abortSignal: X(
+    b && (v = Date.now(), f = new K(), M = {
+      abortSignal: Z(
         d.abortSignal,
         f.signal
       ),
       timeController: d.timeController
     });
-    function E() {
+    function x() {
       f.abort(
         new et(
           `[test-variants] test timeout ${b}ms exceeded`
@@ -173,95 +174,95 @@ ${t.format(m)}`
     try {
       let S = e(h, M);
       if (O(S)) {
-        let x = null;
-        return f && (x = g.subscribe(() => {
-          Date.now() - v >= b && (E(), x());
+        let w = null;
+        return f && (w = g.subscribe(() => {
+          Date.now() - v > b && (x(), w());
         }), S = Promise.race([
           S,
-          Ze(f.signal)
+          Xe(f.signal)
         ])), S.then(
           (A) => {
-            x?.();
-            const G = ue(A, !0);
-            return s && s({ args: h, tests: y, result: G }), G;
+            w?.();
+            const D = ue(A, !0);
+            return s && s({ args: h, tests: y, result: D }), D;
           },
-          (A) => (x?.(), s && !(A instanceof V) && s({ args: h, tests: y, error: A }), c(A, h, y))
+          (A) => (w?.(), s && !(A instanceof V) && s({ args: h, tests: y, error: A }), u(A, h, y))
         );
       }
-      v != null && Date.now() - v >= b && (E(), f.signal.throwIfAborted());
+      v != null && Date.now() - v > b && (x(), f.signal.throwIfAborted());
       const C = ue(S, !1);
       return s && s({ args: h, tests: y, result: C }), C;
     } catch (S) {
-      return S instanceof V ? void 0 : (s && s({ args: h, tests: y, error: S }), c(S, h, y));
+      return S instanceof V ? void 0 : (s && s({ args: h, tests: y, error: S }), u(S, h, y));
     }
   };
 }
-function k(e, r, t) {
-  for (let i = 0, o = e.length; i < o; i++)
-    if (t ? t(e[i], r) : e[i] === r)
-      return i;
+function R(e, r, t) {
+  for (let o = 0, i = e.length; o < i; o++)
+    if (t ? t(e[o], r) : e[o] === r)
+      return o;
   return -1;
 }
-function ce(e, r, t, i) {
-  const o = Object.keys(e.templates), s = {}, n = [], a = [], c = [], g = o.length;
+function ce(e, r, t, o) {
+  const i = Object.keys(e.templates), s = {}, n = [], l = [], u = [], g = i.length;
   for (let m = 0; m < g; m++) {
-    const h = o[m];
-    s[h] = void 0, n.push(-1), a.push(void 0), c.push(null);
+    const h = i[m];
+    s[h] = void 0, n.push(-1), l.push(void 0), u.push(null);
   }
   return {
     args: s,
-    argsNames: o,
+    argsNames: i,
     indexes: n,
-    argValues: a,
-    argLimits: c,
+    argValues: l,
+    argLimits: u,
     attempts: 0,
     templates: e,
     limitArgOnError: t,
     equals: r,
-    includeErrorVariant: i ?? !1
+    includeErrorVariant: o ?? !1
   };
 }
 function P(e, r) {
-  const t = e.templates.templates[r], i = e.templates.extra[r];
-  let o;
-  if (typeof t == "function" ? o = t(e.args) : o = t, i == null)
-    return o;
+  const t = e.templates.templates[r], o = e.templates.extra[r];
+  let i;
+  if (typeof t == "function" ? i = t(e.args) : i = t, o == null)
+    return i;
   let s = null;
-  const n = i.length;
-  for (let a = 0; a < n; a++) {
-    const c = i[a];
-    k(o, c, e.equals) < 0 && (s == null ? s = [...o, c] : s.push(c));
+  const n = o.length;
+  for (let l = 0; l < n; l++) {
+    const u = o[l];
+    R(i, u, e.equals) < 0 && (s == null ? s = [...i, u] : s.push(u));
   }
-  return s ?? o;
+  return s ?? i;
 }
 function I(e, r, t) {
-  const i = e.argValues[r].length;
-  if (i === 0)
+  const o = e.argValues[r].length;
+  if (o === 0)
     return -1;
-  const o = e.argLimits[r];
-  if (o == null)
-    return i - 1;
+  const i = e.argLimits[r];
+  if (i == null)
+    return o - 1;
   let s = e.limitArgOnError;
   if (typeof s == "function") {
     const n = e.argsNames[r];
     s = s({
       name: n,
       values: e.argValues[r],
-      maxValueIndex: o
+      maxValueIndex: i
     });
   }
-  return !t || s ? Math.min(o, i - 1) : i - 1;
+  return !t || s ? Math.min(i, o - 1) : o - 1;
 }
 function L(e) {
   const r = e.indexes.length;
   for (let t = 0; t < r; t++) {
-    const i = e.argLimits[t];
-    if (i == null)
+    const o = e.argLimits[t];
+    if (o == null)
       return !1;
-    const o = e.indexes[t];
-    if (o > i)
+    const i = e.indexes[t];
+    if (i > o)
       return !0;
-    if (o < i)
+    if (i < o)
       return !1;
   }
   return !e.includeErrorVariant;
@@ -273,24 +274,24 @@ function N(e) {
 }
 function ye(e) {
   let r = !1, t = !0;
-  const i = e.indexes.length;
-  let o = i, s = !1, n = 0;
-  for (; n < i; n++) {
-    const a = e.argValues[n] == null;
-    (a || s) && (a && (r = !0), e.argValues[n] = P(
+  const o = e.indexes.length;
+  let i = o, s = !1, n = 0;
+  for (; n < o; n++) {
+    const l = e.argValues[n] == null;
+    (l || s) && (l && (r = !0), e.argValues[n] = P(
       e,
       e.argsNames[n]
     ));
-    const c = I(
+    const u = I(
       e,
       n,
-      n > o
+      n > i
     );
-    if (c < 0) {
+    if (u < 0) {
       t = !1, e.indexes[n] = -1;
       break;
     }
-    a && (e.indexes[n] = 0, e.args[e.argsNames[n]] = e.argValues[n][0]), (s || e.indexes[n] > c) && (e.indexes[n] = c, e.args[e.argsNames[n]] = e.argValues[n][c], s = !0), o === i && e.indexes[n] < c && (o = n);
+    l && (e.indexes[n] = 0, e.args[e.argsNames[n]] = e.argValues[n][0]), (s || e.indexes[n] > u) && (e.indexes[n] = u, e.args[e.argsNames[n]] = e.argValues[n][u], s = !0), i === o && e.indexes[n] < u && (i = n);
   }
   if (L(e))
     return N(e), !1;
@@ -299,73 +300,73 @@ function ye(e) {
   for (n--; n >= 0; n--) {
     if (e.argValues[n] == null)
       continue;
-    let a = n > o;
-    const c = I(e, n, a), g = e.indexes[n] + 1;
-    if (g <= c) {
-      e.indexes[n] = g, e.args[e.argsNames[n]] = e.argValues[n][g], g < c && (a = !0);
-      for (let m = n + 1; m < i; m++)
+    let l = n > i;
+    const u = I(e, n, l), g = e.indexes[n] + 1;
+    if (g <= u) {
+      e.indexes[n] = g, e.args[e.argsNames[n]] = e.argValues[n][g], g < u && (l = !0);
+      for (let m = n + 1; m < o; m++)
         e.args[e.argsNames[m]] = void 0;
-      for (n++; n < i; n++) {
+      for (n++; n < o; n++) {
         e.argValues[n] = P(
           e,
           e.argsNames[n]
         );
-        const m = I(e, n, a);
+        const m = I(e, n, l);
         if (m < 0)
           break;
-        e.indexes[n] = 0, e.args[e.argsNames[n]] = e.argValues[n][0], m > 0 && (a = !0);
+        e.indexes[n] = 0, e.args[e.argsNames[n]] = e.argValues[n][0], m > 0 && (l = !0);
       }
-      if (n >= i)
+      if (n >= o)
         return L(e) ? (N(e), !1) : !0;
     }
   }
   return N(e), !1;
 }
-function K(e) {
+function Q(e) {
   L(e) && N(e);
   let r = !1, t = !0;
-  const i = e.indexes.length;
-  let o = i, s = !1, n = 0;
-  for (; n < i; n++) {
-    const a = e.argValues[n] == null;
-    (a || s) && (a && (r = !0), e.argValues[n] = P(
+  const o = e.indexes.length;
+  let i = o, s = !1, n = 0;
+  for (; n < o; n++) {
+    const l = e.argValues[n] == null;
+    (l || s) && (l && (r = !0), e.argValues[n] = P(
       e,
       e.argsNames[n]
     ));
-    const c = I(
+    const u = I(
       e,
       n,
-      n > o
+      n > i
     );
-    if (c < 0) {
+    if (u < 0) {
       t = !1, e.indexes[n] = -1;
       break;
     }
-    a && (e.indexes[n] = c, e.args[e.argsNames[n]] = e.argValues[n][c]), (s || e.indexes[n] > c) && (e.indexes[n] = c, e.args[e.argsNames[n]] = e.argValues[n][c], s = !0), o === i && e.indexes[n] < c && (o = n);
+    l && (e.indexes[n] = u, e.args[e.argsNames[n]] = e.argValues[n][u]), (s || e.indexes[n] > u) && (e.indexes[n] = u, e.args[e.argsNames[n]] = e.argValues[n][u], s = !0), i === o && e.indexes[n] < u && (i = n);
   }
   if ((r || s) && t && !L(e))
     return !0;
   for (n--; n >= 0; n--) {
     if (e.argValues[n] == null)
       continue;
-    let a = n > o;
-    const c = I(e, n, a);
+    let l = n > i;
+    const u = I(e, n, l);
     let g = e.indexes[n] - 1;
-    if (g > c && (g = c), g >= 0) {
-      e.indexes[n] = g, e.args[e.argsNames[n]] = e.argValues[n][g], g < c && (a = !0);
-      for (let m = n + 1; m < i; m++)
+    if (g > u && (g = u), g >= 0) {
+      e.indexes[n] = g, e.args[e.argsNames[n]] = e.argValues[n][g], g < u && (l = !0);
+      for (let m = n + 1; m < o; m++)
         e.args[e.argsNames[m]] = void 0;
-      for (n++; n < i; n++) {
+      for (n++; n < o; n++) {
         e.argValues[n] = P(
           e,
           e.argsNames[n]
         );
-        const m = I(e, n, a);
+        const m = I(e, n, l);
         if (m < 0)
           break;
-        e.indexes[n] = m, e.args[e.argsNames[n]] = e.argValues[n][m], m > 0 && (a = !0);
+        e.indexes[n] = m, e.args[e.argsNames[n]] = e.argValues[n][m], m > 0 && (l = !0);
       }
-      if (n >= i)
+      if (n >= o)
         return !0;
     }
   }
@@ -373,24 +374,24 @@ function K(e) {
 }
 function mt(e, r) {
   N(e);
-  const t = e.argsNames, i = t.length;
-  let o = !1;
-  for (let s = 0; s < i; s++) {
-    const n = t[s], a = r[n];
-    if (a === void 0)
+  const t = e.argsNames, o = t.length;
+  let i = !1;
+  for (let s = 0; s < o; s++) {
+    const n = t[s], l = r[n];
+    if (l === void 0)
       return null;
     e.argValues[s] = P(e, n);
-    const c = I(e, s, o);
-    if (c < 0)
+    const u = I(e, s, i);
+    if (u < 0)
       return null;
-    const g = k(
+    const g = R(
       e.argValues[s],
-      a,
+      l,
       e.equals
     );
-    if (g < 0 || g > c)
+    if (g < 0 || g > u)
       return null;
-    e.indexes[s] = g, e.args[e.argsNames[s]] = e.argValues[s][g], e.indexes[s] < c && (o = !0);
+    e.indexes[s] = g, e.args[e.argsNames[s]] = e.argValues[s][g], e.indexes[s] < u && (i = !0);
   }
   return L(e) ? null : e.indexes.slice();
 }
@@ -399,39 +400,39 @@ function dt(e) {
   if (r === 0)
     return !1;
   let t = !1;
-  for (let i = 0; i < r; i++) {
-    e.argValues[i] = P(e, e.argsNames[i]);
-    const o = I(e, i, t);
-    if (o < 0)
-      return Math.random() < 0.5 ? ye(e) : K(e);
-    e.indexes[i] = Math.floor(Math.random() * (o + 1)), e.args[e.argsNames[i]] = e.argValues[i][e.indexes[i]], e.indexes[i] < o && (t = !0);
+  for (let o = 0; o < r; o++) {
+    e.argValues[o] = P(e, e.argsNames[o]);
+    const i = I(e, o, t);
+    if (i < 0)
+      return Math.random() < 0.5 ? ye(e) : Q(e);
+    e.indexes[o] = Math.floor(Math.random() * (i + 1)), e.args[e.argsNames[o]] = e.argValues[o][e.indexes[o]], e.indexes[o] < i && (t = !0);
   }
-  return L(e) ? K(e) : !0;
+  return L(e) ? Q(e) : !0;
 }
-function U(e) {
+function B(e) {
   return e.mode === "forward" || e.mode === "backward";
 }
-function gt(e, r, t, i) {
-  const o = r[t], s = e.templates[t];
+function gt(e, r, t, o) {
+  const i = r[t], s = e.templates[t];
   if (typeof s != "function") {
-    if (k(s, o, i) >= 0)
+    if (R(s, i, o) >= 0)
       return;
-    s.push(o);
+    s.push(i);
     return;
   }
   const n = e.extra[t];
   if (n == null) {
-    e.extra[t] = [o];
+    e.extra[t] = [i];
     return;
   }
-  k(n, o, i) >= 0 || n.push(o);
+  R(n, i, o) >= 0 || n.push(i);
 }
 function pt(e, r, t) {
-  for (const i in r)
-    if (Object.prototype.hasOwnProperty.call(r, i)) {
-      if (i === "seed")
+  for (const o in r)
+    if (Object.prototype.hasOwnProperty.call(r, o)) {
+      if (o === "seed")
         continue;
-      gt(e, r, i, t);
+      gt(e, r, o, t);
     }
 }
 function fe(e, r) {
@@ -449,33 +450,33 @@ function bt(e) {
   const {
     argsTemplates: r,
     equals: t,
-    limitArgOnError: i,
-    includeErrorVariant: o,
+    limitArgOnError: o,
+    includeErrorVariant: i,
     getSeed: s,
     iterationModes: n,
-    onModeChange: a,
-    limitCompletionCount: c,
+    onModeChange: l,
+    limitCompletionCount: u,
     limitTests: g,
     limitTime: m
-  } = e, h = e.timeController ?? F, y = {
-    templates: Xe(r),
+  } = e, h = e.timeController ?? W, y = {
+    templates: Ze(r),
     extra: {}
   }, d = n == null || n.length === 0 ? ht : n, b = [];
-  let v = null, M = null, f = 0, E = 0, S = !1, C = 0;
-  function x() {
-    S || (S = !0, C = h.now(), A(), f = 0, ie(), xe());
+  let v = null, M = null, f = 0, x = 0, S = !1, C = 0;
+  function w() {
+    S || (S = !0, C = h.now(), A(), f = 0, oe(), we());
   }
   function A() {
-    for (let l = 0, u = d.length; l < u; l++)
-      b.push(G());
+    for (let a = 0, c = d.length; a < c; a++)
+      b.push(D());
   }
-  function G() {
+  function D() {
     return {
       navigationState: ce(
         y,
         t ?? null,
-        i ?? null,
-        o ?? null
+        o ?? null,
+        i ?? null
       ),
       cycleCount: 0,
       completedCount: 0,
@@ -484,7 +485,7 @@ function bt(e) {
       startTime: null
     };
   }
-  function xe() {
+  function we() {
     v = ce(
       y,
       t ?? null,
@@ -493,48 +494,48 @@ function bt(e) {
       !1
     );
   }
-  function ie() {
-    a?.({
+  function oe() {
+    l?.({
       mode: d[f],
       modeIndex: f,
-      tests: E
+      tests: x
     });
   }
-  function Te(l) {
-    x(), fe(y.templates, l) && pt(y, l, t);
+  function Te(a) {
+    w(), fe(y.templates, a) && pt(y, a, t);
   }
-  function se(l, u) {
-    return x(), fe(y.templates, l) ? (v.limitArgOnError = u?.limitArg ?? i ?? null, v.includeErrorVariant = u?.includeLimit ?? o ?? !1, mt(v, l)) : null;
+  function se(a, c) {
+    return w(), fe(y.templates, a) ? (v.limitArgOnError = c?.limitArg ?? o ?? null, v.includeErrorVariant = c?.includeLimit ?? i ?? !1, mt(v, a)) : null;
   }
-  function Me(l) {
-    const u = l?.args;
-    if (u == null)
+  function Me(a) {
+    const c = a?.args;
+    if (c == null)
       return;
-    x();
-    const p = se(u);
+    w();
+    const p = se(c);
     if (p != null) {
       M = {
-        args: u,
-        error: l?.error,
-        tests: l?.tests ?? E
+        args: c,
+        error: a?.error,
+        tests: a?.tests ?? x
       }, v.argLimits = p;
-      for (let w = 0, q = b.length; w < q; w++) {
-        const H = b[w].navigationState;
-        H.argLimits = p;
+      for (let E = 0, U = b.length; E < U; E++) {
+        const J = b[E].navigationState;
+        J.argLimits = p;
       }
     }
   }
   function Ie() {
-    return x(), Ve();
+    return w(), Ve();
   }
   function Ve() {
     for (; ; ) {
       if (!Ce())
         return null;
       for (; ; ) {
-        const l = qe();
-        if (l != null)
-          return b[f].testsInLastTurn++, E++, l;
+        const a = qe();
+        if (a != null)
+          return b[f].testsInLastTurn++, x++, a;
         if (Pe()) {
           if (!$e())
             return null;
@@ -545,167 +546,167 @@ function bt(e) {
     }
   }
   function Ce() {
-    return !(Ae() || Oe() || D() && (Le() || !_e()) || !Ne());
+    return !(Ae() || Oe() || q() && (Le() || !_e()) || !Ne());
   }
   function Ae() {
-    return g != null && E >= g;
+    return g != null && x >= g;
   }
   function Oe() {
     return m != null && h.now() - C >= m;
   }
   function Le() {
-    if (!D())
+    if (!q())
       throw new Error("Unexpected behavior");
-    return c != null && c <= 0;
+    return u != null && u <= 0;
   }
   function _e() {
-    if (!D())
+    if (!q())
       throw new Error("Unexpected behavior");
-    for (let l = 0, u = d.length; l < u; l++)
-      if (_(d[l]) && W(l))
+    for (let a = 0, c = d.length; a < c; a++)
+      if (_(d[a]) && z(a))
         return !0;
     return !1;
   }
   function Ne() {
-    for (let l = 0, u = d.length; l < u; l++)
-      if (W(l))
+    for (let a = 0, c = d.length; a < c; a++)
+      if (z(a))
         return !0;
     return !1;
   }
   function Pe() {
     f++;
-    const l = f >= d.length;
-    return l && (f = 0), ie(), l;
+    const a = f >= d.length;
+    return a && (f = 0), oe(), a;
   }
   function $e() {
-    if (D()) {
-      const l = Ge();
-      if (c != null && l >= c)
+    if (q()) {
+      const a = Ge();
+      if (u != null && a >= u)
         return !1;
     }
     return !0;
   }
-  function D() {
-    for (let l = 0, u = d.length; l < u; l++)
-      if (U(d[l]))
+  function q() {
+    for (let a = 0, c = d.length; a < c; a++)
+      if (B(d[a]))
         return !0;
     return !1;
   }
   function Ge() {
-    let l = !1, u = 1 / 0;
-    for (let p = 0, w = b.length; p < w; p++) {
-      const q = b[p], H = d[p];
-      U(H) && (l = !0, W(p) && q.completedCount < u && (u = q.completedCount));
+    let a = !1, c = 1 / 0;
+    for (let p = 0, E = b.length; p < E; p++) {
+      const U = b[p], J = d[p];
+      B(J) && (a = !0, z(p) && U.completedCount < c && (c = U.completedCount));
     }
-    if (!l)
+    if (!a)
       throw new Error("Unexpected behavior");
-    return u;
+    return c;
   }
-  function W(l) {
-    const u = d[l], p = b[l];
-    return u.limitTests != null && u.limitTests <= 0 || _(u) && (u.cycles != null && u.cycles <= 0 || u.attemptsPerVariant != null && u.attemptsPerVariant <= 0) ? !1 : p.tryNextVariantAttempts < 2;
+  function z(a) {
+    const c = d[a], p = b[a];
+    return c.limitTests != null && c.limitTests <= 0 || _(c) && (c.cycles != null && c.cycles <= 0 || c.attemptsPerVariant != null && c.attemptsPerVariant <= 0) ? !1 : p.tryNextVariantAttempts < 2;
   }
   function De() {
     f = 0;
-    for (let l = 0, u = b.length; l < u; l++) {
-      const p = b[l];
+    for (let a = 0, c = b.length; a < c; a++) {
+      const p = b[a];
       p.testsInLastTurn = 0, p.startTime = null;
     }
   }
   function qe() {
-    let l = 0;
-    for (; l < 2; ) {
+    let a = 0;
+    for (; a < 2; ) {
       if (!Ue())
         return null;
-      const u = Fe();
-      if (u != null)
-        return u;
+      const c = Fe();
+      if (c != null)
+        return c;
       if (_(d[f]) && je())
         return null;
-      l++;
+      a++;
     }
     return null;
   }
   function Ue() {
-    const l = d[f];
-    return !(Be() || ke() || _(l) && !Re(f));
+    const a = d[f];
+    return !(Be() || ke() || _(a) && !Re(f));
   }
   function Be() {
-    const l = d[f], u = b[f];
-    return l.limitTests != null && u.testsInLastTurn >= l.limitTests;
+    const a = d[f], c = b[f];
+    return a.limitTests != null && c.testsInLastTurn >= a.limitTests;
   }
   function ke() {
-    const l = d[f], u = b[f];
-    return l.limitTime != null && u.startTime != null && h.now() - u.startTime >= l.limitTime;
+    const a = d[f], c = b[f];
+    return a.limitTime != null && c.startTime != null && h.now() - c.startTime >= a.limitTime;
   }
-  function _(l) {
-    return U(l);
+  function _(a) {
+    return B(a);
   }
-  function Re(l) {
-    const u = d[l], p = b[l];
-    if (!_(u))
+  function Re(a) {
+    const c = d[a], p = b[a];
+    if (!_(c))
       throw new Error("Unexpected behavior");
-    return p.cycleCount < (u.cycles ?? 1);
+    return p.cycleCount < (c.cycles ?? 1);
   }
   function je() {
-    const l = d[f], u = b[f];
-    if (!_(l))
+    const a = d[f], c = b[f];
+    if (!_(a))
       throw new Error("Unexpected behavior");
-    return u.cycleCount++, u.cycleCount >= (l.cycles ?? 1) ? (u.cycleCount = 0, u.completedCount++, !0) : !1;
+    return c.cycleCount++, c.cycleCount >= (a.cycles ?? 1) ? (c.cycleCount = 0, c.completedCount++, !0) : !1;
   }
   function Fe() {
-    const l = d[f], u = b[f], p = u.navigationState;
-    if ($(l)) {
-      if (z())
+    const a = d[f], c = b[f], p = c.navigationState;
+    if ($(a)) {
+      if (H())
         return null;
-      const w = We();
-      if (w != null)
-        return u.startTime == null && (u.startTime = h.now()), w;
+      const E = We();
+      if (E != null)
+        return c.startTime == null && (c.startTime = h.now()), E;
     }
-    return He() ? (u.tryNextVariantAttempts = 0, $(l) && ze(), u.startTime == null && (u.startTime = h.now()), le(p.args)) : (u.tryNextVariantAttempts++, null);
+    return He() ? (c.tryNextVariantAttempts = 0, $(a) && ze(), c.startTime == null && (c.startTime = h.now()), ae(p.args)) : (c.tryNextVariantAttempts++, null);
   }
   function We() {
-    const l = d[f], p = b[f].navigationState;
-    if (!$(l))
+    const a = d[f], p = b[f].navigationState;
+    if (!$(a))
       throw new Error("Unexpected behavior");
-    if (z())
+    if (H())
       throw new Error("Unexpected behavior");
-    const w = l.attemptsPerVariant ?? 1;
-    return p.attempts > 0 && p.attempts < w ? L(p) ? null : (p.attempts++, le(p.args)) : null;
+    const E = a.attemptsPerVariant ?? 1;
+    return p.attempts > 0 && p.attempts < E ? L(p) ? null : (p.attempts++, ae(p.args)) : null;
   }
   function ze() {
-    const l = d[f], p = b[f].navigationState;
-    if (!$(l))
+    const a = d[f], p = b[f].navigationState;
+    if (!$(a))
       throw new Error("Unexpected behavior");
-    if (z())
+    if (H())
       throw new Error("Unexpected behavior");
     p.attempts = 1;
   }
-  function $(l) {
-    return U(l);
+  function $(a) {
+    return B(a);
   }
-  function z() {
-    const l = d[f];
-    if (!$(l))
+  function H() {
+    const a = d[f];
+    if (!$(a))
       throw new Error("Unexpected behavior");
-    return (l.attemptsPerVariant ?? 1) <= 0;
+    return (a.attemptsPerVariant ?? 1) <= 0;
   }
   function He() {
-    const l = d[f], p = b[f].navigationState;
-    switch (l.mode) {
+    const a = d[f], p = b[f].navigationState;
+    switch (a.mode) {
       case "forward":
         return ye(p);
       case "backward":
-        return K(p);
+        return Q(p);
       case "random":
         return dt(p);
       default:
-        throw new Error(`Unknown mode: ${l.mode}`);
+        throw new Error(`Unknown mode: ${a.mode}`);
     }
   }
-  function le(l) {
-    const u = { ...l };
-    return s != null && (u.seed = s({ tests: E })), u;
+  function ae(a) {
+    const c = { ...a };
+    return s != null && (c.seed = s({ tests: x })), c;
   }
   return {
     get limit() {
@@ -721,7 +722,7 @@ function bt(e) {
       return b;
     },
     get tests() {
-      return E;
+      return x;
     },
     calcIndexes: se,
     extendTemplates: Te,
@@ -729,24 +730,24 @@ function bt(e) {
     next: Ie
   };
 }
-function ne(e) {
+function ie(e) {
   if (e == null || e <= 0)
     throw new Error(`Iterations = ${e}`);
   e--;
   const r = Ke().then(() => e);
-  return e <= 0 ? r : r.then(ne);
+  return e <= 0 ? r : r.then(ie);
 }
 function yt(e, r, t) {
-  const i = r.limit ? {
+  const o = r.limit ? {
     error: r.limit.error,
     args: r.limit.args,
     tests: r.limit.tests
   } : null;
-  if (i && !t)
-    throw i.error;
+  if (o && !t)
+    throw o.error;
   return {
     iterations: e.iterations,
-    bestError: i
+    bestError: o
   };
 }
 const me = 2 ** 31;
@@ -768,7 +769,7 @@ function vt(e) {
   };
 }
 function St(e) {
-  const r = e?.saveErrorVariants, t = r && e.createSaveErrorVariantsStore ? e.createSaveErrorVariantsStore(r) : null, i = e?.findBestError, { parallel: o, sequentialOnError: s } = vt(
+  const r = e?.saveErrorVariants, t = r && e.createSaveErrorVariantsStore ? e.createSaveErrorVariantsStore(r) : null, o = e?.findBestError, { parallel: i, sequentialOnError: s } = vt(
     e?.parallel
   );
   return {
@@ -778,71 +779,71 @@ function St(e) {
     GC_Interval: e?.GC_Interval ?? 1e3,
     logOptions: be(e?.log),
     abortSignalExternal: e?.abortSignal,
-    findBestError: i,
-    dontThrowIfError: i?.dontThrowIfError,
-    timeController: e?.timeController ?? F,
-    parallel: o,
+    findBestError: o,
+    dontThrowIfError: o?.dontThrowIfError,
+    timeController: e?.timeController ?? W,
+    parallel: i,
     sequentialOnError: s
   };
 }
-function R(e, r, t) {
-  const { options: i, variantsIterator: o } = e, s = o.limit?.args ?? r;
-  if (!i.store)
+function j(e, r, t) {
+  const { options: o, variantsIterator: i } = e, s = i.limit?.args ?? r;
+  if (!o.store)
     return;
-  const n = i.store.save(s);
+  const n = o.store.save(s);
   if (t)
     return n;
 }
-function Et(e, r, t, i) {
-  const { abortControllerParallel: o, state: s, options: n } = e, { logOptions: a } = n;
+function xt(e, r, t, o) {
+  const { abortControllerParallel: i, state: s, options: n } = e, { logOptions: l } = n;
   if (e.options.findBestError)
-    e.variantsIterator.addLimit({ args: r, error: t, tests: i }), s.debugMode = !1, R(e, r, !1), n.sequentialOnError && !o.signal.aborted ? (a.debug && a.func(
+    e.variantsIterator.addLimit({ args: r, error: t, tests: o }), s.debugMode = !1, j(e, r, !1), n.sequentialOnError && !i.signal.aborted ? (l.debug && l.func(
       "debug",
       "[test-variants] sequentialOnError: aborting parallel, switching to sequential"
-    ), o.abort(new V())) : a.debug && a.func(
+    ), i.abort(new V())) : l.debug && l.func(
       "debug",
       "[test-variants] parallel error in findBestError mode, continuing with new limits"
     );
   else {
-    if (o.signal.aborted)
+    if (i.signal.aborted)
       return;
-    R(e, r, !1), o.abort(t);
+    j(e, r, !1), i.abort(t);
   }
 }
-function de(e, r, t, i) {
-  const { state: o } = e;
+function de(e, r, t, o) {
+  const { state: i } = e;
   if (e.options.findBestError) {
-    e.variantsIterator.addLimit({ args: r, error: t, tests: i });
-    const n = R(e, r, !0);
+    e.variantsIterator.addLimit({ args: r, error: t, tests: o });
+    const n = j(e, r, !0);
     if (n)
       return n.then(() => {
-        o.debugMode = !1;
+        i.debugMode = !1;
       });
-    o.debugMode = !1;
+    i.debugMode = !1;
     return;
   }
-  const s = R(e, r, !0);
+  const s = j(e, r, !0);
   if (s)
     return s.then(() => {
       throw t;
     });
   throw t;
 }
-function wt(e, r) {
-  const { GC_Iterations: t, GC_IterationsAsync: i, GC_Interval: o } = e.options;
-  return t > 0 && e.state.iterations - e.state.prevGcIterations >= t || i > 0 && e.state.iterationsAsync - e.state.prevGcIterationsAsync >= i || o > 0 && r - e.state.prevGcTime >= o;
+function Et(e, r) {
+  const { GC_Iterations: t, GC_IterationsAsync: o, GC_Interval: i } = e.options;
+  return t > 0 && e.state.iterations - e.state.prevGcIterations >= t || o > 0 && e.state.iterationsAsync - e.state.prevGcIterationsAsync >= o || i > 0 && r - e.state.prevGcTime >= i;
 }
-async function xt(e, r) {
-  e.prevGcIterations = e.iterations, e.prevGcIterationsAsync = e.iterationsAsync, e.prevGcTime = r, await ne(1);
+async function wt(e, r) {
+  e.prevGcIterations = e.iterations, e.prevGcIterationsAsync = e.iterationsAsync, e.prevGcTime = r, await ie(1);
 }
-function oe(e) {
+function G(e) {
   const r = e / 1e3;
   if (r < 60)
     return `${r.toFixed(1)}s`;
   const t = r / 60;
   return t < 60 ? `${t.toFixed(1)}m` : `${(t / 60).toFixed(1)}h`;
 }
-function Q(e) {
+function Y(e) {
   const r = e / 1073741824;
   if (r >= 1)
     return r >= 10 ? `${Math.round(r)}GB` : `${r.toFixed(1)}GB`;
@@ -853,182 +854,182 @@ function Tt(e, r) {
   if (!e)
     return `mode[${r}]: null`;
   let t = `mode[${r}]: ${e.mode}`;
-  return (e.mode === "forward" || e.mode === "backward") && (e.cycles != null && (t += `, cycles=${e.cycles}`), e.attemptsPerVariant != null && (t += `, attempts=${e.attemptsPerVariant}`)), e.limitTime != null && (t += `, limitTime=${oe(e.limitTime)}`), e.limitTests != null && (t += `, limitTests=${e.limitTests}`), t;
+  return (e.mode === "forward" || e.mode === "backward") && (e.cycles != null && (t += `, cycles=${e.cycles}`), e.attemptsPerVariant != null && (t += `, attempts=${e.attemptsPerVariant}`)), e.limitTime != null && (t += `, limitTime=${G(e.limitTime)}`), e.limitTests != null && (t += `, limitTests=${e.limitTests}`), t;
 }
 function ve(e, r) {
-  const t = e - r, i = t >= 0 ? "+" : "";
-  return `${Q(e)} (${i}${Q(t)})`;
+  const t = e - r, o = t >= 0 ? "+" : "";
+  return `${Y(e)} (${o}${Y(t)})`;
 }
 function Mt(e, r) {
   if (!e.start)
     return;
   let t = "[test-variants] start";
-  r != null && (t += `, memory: ${Q(r)}`), e.func("start", t);
+  r != null && (t += `, memory: ${Y(r)}`), e.func("start", t);
 }
 function It(e) {
-  const { options: r, state: t } = e, { logOptions: i, timeController: o } = r;
-  if (!i.completed)
+  const { options: r, state: t } = e, { logOptions: o, timeController: i } = r;
+  if (!o.completed)
     return;
-  const s = o.now() - t.startTime;
-  let n = `[test-variants] end, tests: ${t.tests} (${oe(s)}), async: ${t.iterationsAsync}`;
+  const s = i.now() - t.startTime;
+  let n = `[test-variants] end, tests: ${t.tests} (${G(s)}), maxTime: ${G(t.maxTestDuration)}, async: ${t.iterationsAsync}`;
   if (t.startMemory != null) {
-    const a = re();
-    a != null && (n += `, memory: ${ve(a, t.startMemory)}`);
+    const l = ne();
+    l != null && (n += `, memory: ${ve(l, t.startMemory)}`);
   }
-  i.func("completed", n);
+  o.func("completed", n);
 }
 function Se(e) {
-  const { options: r, state: t } = e, { logOptions: i } = r, o = t.pendingModeChange;
-  !i.modeChange || o == null || (i.func(
+  const { options: r, state: t } = e, { logOptions: o } = r, i = t.pendingModeChange;
+  !o.modeChange || i == null || (o.func(
     "modeChange",
-    `[test-variants] ${Tt(o.mode, o.modeIndex)}`
+    `[test-variants] ${Tt(i.mode, i.modeIndex)}`
   ), t.pendingModeChange = null);
 }
 function Vt(e) {
-  const { options: r, state: t } = e, { logOptions: i, timeController: o } = r, s = o.now();
-  if (!i.progress || s - t.prevLogTime < i.progress)
+  const { options: r, state: t } = e, { logOptions: o, timeController: i } = r, s = i.now();
+  if (!o.progress || s - t.prevLogTime < o.progress)
     return !1;
   Se(e);
   const n = s - t.startTime;
-  let a = `[test-variants] tests: ${t.tests} (${oe(n)}), async: ${t.iterationsAsync}`;
+  let l = `[test-variants] tests: ${t.tests} (${G(n)}), maxTime: ${G(t.maxTestDuration)}, async: ${t.iterationsAsync}`;
   if (t.prevLogMemory != null) {
-    const c = re();
-    c != null && (a += `, memory: ${ve(c, t.prevLogMemory)}`, t.prevLogMemory = c);
+    const u = ne();
+    u != null && (l += `, memory: ${ve(u, t.prevLogMemory)}`, t.prevLogMemory = u);
   }
-  return i.func("progress", a), t.prevLogTime = s, !0;
+  return o.func("progress", l), t.prevLogTime = s, !0;
 }
-function Y(e, r) {
+function ee(e, r) {
   e.debugMode = !1, r && (e.iterationsAsync += r.iterationsAsync, e.iterations += r.iterationsSync + r.iterationsAsync);
 }
-function ee(e) {
+function te(e) {
   e.state.debugMode = !0, e.abortControllerParallel.abort(new V());
 }
-function Ee(e, r) {
-  const { testRun: t, testOptions: i, state: o } = e, s = o.tests;
-  o.tests++;
+function xe(e, r) {
+  const { testRun: t, testOptions: o, state: i } = e, s = i.tests;
+  i.tests++;
   try {
-    const n = t(r, s, i);
+    const n = t(r, s, o);
     if (O(n))
       return n.then(
-        (a) => {
-          if (!a) {
-            ee(e);
+        (l) => {
+          if (!l) {
+            te(e);
             return;
           }
-          Y(o, a);
+          ee(i, l);
         },
-        (a) => de(e, r, a, s)
+        (l) => de(e, r, l, s)
       );
     if (!n) {
-      ee(e);
+      te(e);
       return;
     }
-    Y(o, n);
+    ee(i, n);
   } catch (n) {
     return n instanceof V ? void 0 : de(e, r, n, s);
   }
 }
 function Ct(e, r) {
-  const { pool: t, abortSignal: i, testRun: o, testOptionsParallel: s, state: n } = e;
+  const { pool: t, abortSignal: o, testRun: i, testOptionsParallel: s, state: n } = e;
   if (!t)
     return;
-  const a = n.tests;
+  const l = n.tests;
   n.tests++, (async () => {
     try {
-      if (i.aborted)
+      if (o.aborted)
         return;
-      let c = o(r, a, s);
-      if (O(c) && (c = await c), !c) {
-        ee(e);
+      let u = i(r, l, s);
+      if (O(u) && (u = await u), !u) {
+        te(e);
         return;
       }
-      Y(n, c);
-    } catch (c) {
-      if (c instanceof V)
+      ee(n, u);
+    } catch (u) {
+      if (u instanceof V)
         return;
-      Et(e, r, c, a);
+      xt(e, r, u, l);
     } finally {
       t.release(1);
     }
   })();
 }
-function we(e) {
-  const { options: r, state: t } = e, { logOptions: i, timeController: o, GC_Interval: s } = r;
-  if (!i.progress && !s)
+function Ee(e) {
+  const { options: r, state: t } = e, { logOptions: o, timeController: i, GC_Interval: s } = r;
+  if (!o.progress && !s)
     return;
   Vt(e);
-  const n = o.now();
-  if (wt(e, n))
-    return xt(t, n);
+  const n = i.now();
+  if (Et(e, n))
+    return wt(t, n);
 }
-function j(e) {
+function F(e) {
   return e.options.abortSignalExternal?.aborted ?? !1;
 }
-function te(e) {
+function re(e) {
   return e.abortSignal.aborted;
 }
-async function J(e, r) {
-  const { pool: t, state: i, options: o } = e, { parallel: s, logOptions: n } = o;
-  let a = null;
-  for (; !j(e); ) {
-    const c = t && !te(e);
+async function X(e, r) {
+  const { pool: t, state: o, options: i } = e, { parallel: s, logOptions: n } = i;
+  let l = null;
+  for (; !F(e); ) {
+    const u = t && !re(e);
     let g = !1;
-    c && (t.hold(1) || await ae({ pool: t, count: 1, hold: !0 }), g = !0);
+    u && (t.hold(1) || await le({ pool: t, count: 1, hold: !0 }), g = !0);
     try {
-      if (r != null ? (a = r, r = null) : e.state.debugMode || (a = e.variantsIterator.next()), a == null)
+      if (r != null ? (l = r, r = null) : e.state.debugMode || (l = e.variantsIterator.next()), l == null)
         break;
-      const m = we(e);
-      if (O(m) && await m, j(e))
+      const m = Ee(e);
+      if (O(m) && await m, F(e))
         continue;
-      if (c)
-        Ct(e, a), g = !1;
+      if (u)
+        Ct(e, l), g = !1;
       else {
-        n.debug && t && te(e) && n.func(
+        n.debug && t && re(e) && n.func(
           "debug",
-          `[test-variants] parallel aborted, running sequential: tests=${i.tests}`
+          `[test-variants] parallel aborted, running sequential: tests=${o.tests}`
         );
-        const h = Ee(e, a);
+        const h = xe(e, l);
         O(h) && await h;
       }
     } finally {
       g && t.release(1);
     }
   }
-  t && (await ae({ pool: t, count: s, hold: !0 }), t.release(s));
+  t && (await le({ pool: t, count: s, hold: !0 }), t.release(s));
 }
 function At(e) {
-  const { pool: r, state: t, options: i } = e, { logOptions: o } = i;
+  const { pool: r, state: t, options: o } = e, { logOptions: i } = o;
   if (r)
-    return J(e);
+    return X(e);
   let s = null;
-  for (; !j(e) && (e.state.debugMode || (s = e.variantsIterator.next()), s != null); ) {
-    const n = we(e);
+  for (; !F(e) && (e.state.debugMode || (s = e.variantsIterator.next()), s != null); ) {
+    const n = Ee(e);
     if (O(n))
-      return n.then(() => J(e, s));
-    if (j(e))
+      return n.then(() => X(e, s));
+    if (F(e))
       continue;
-    o.debug && te(e) && o.func(
+    i.debug && re(e) && i.func(
       "debug",
       `[test-variants] parallel aborted, running sequential: tests=${t.tests}`
     );
-    const a = Ee(e, s);
-    if (O(a))
-      return a.then(() => J(e));
+    const l = xe(e, s);
+    if (O(l))
+      return l.then(() => X(e));
   }
 }
-async function Ot(e, r, t, i) {
-  const o = St(i), {
+async function Ot(e, r, t, o) {
+  const i = St(o), {
     store: s,
     logOptions: n,
-    abortSignalExternal: a,
-    findBestError: c,
+    abortSignalExternal: l,
+    findBestError: u,
     dontThrowIfError: g,
     timeController: m,
     parallel: h
-  } = o, y = new Z(), d = new Z(), b = X(
-    a,
+  } = i, y = new K(), d = new K(), b = Z(
+    l,
     y.signal
-  ), v = X(
+  ), v = Z(
     b,
     d.signal
   ), M = {
@@ -1042,12 +1043,13 @@ async function Ot(e, r, t, i) {
     testRun: e,
     variantsIterator: r,
     testOptions: M,
-    findBestErrorEnabled: !!c
+    findBestErrorEnabled: !!u,
+    state: t
   });
-  const E = h <= 1 ? null : new Ye(h);
+  const x = h <= 1 ? null : new Ye(h);
   Mt(n, t.startMemory);
   const S = {
-    options: o,
+    options: i,
     testRun: e,
     variantsIterator: r,
     testOptions: M,
@@ -1055,7 +1057,7 @@ async function Ot(e, r, t, i) {
     abortControllerGlobal: y,
     abortControllerParallel: d,
     abortSignal: v,
-    pool: E,
+    pool: x,
     state: t
   };
   Se(S);
@@ -1064,40 +1066,41 @@ async function Ot(e, r, t, i) {
   } catch (C) {
     throw y.abort(new V()), C;
   }
-  return b.throwIfAborted(), y.abort(new V()), It(S), await ne(1), yt(t, r, g);
+  return b.throwIfAborted(), y.abort(new V()), It(S), await ie(1), yt(t, r, g);
 }
-function Dt(e) {
+function Gt(e) {
   return function(t) {
-    return async function(o) {
-      const s = be(o?.log), n = ft(e, {
-        onStart: o?.onStart,
-        onEnd: o?.onEnd,
-        onError: o?.onError,
+    return async function(i) {
+      const s = be(i?.log), n = i?.timeController ?? W, l = ne(), u = st(n, l), g = ft(e, {
+        onStart: i?.onStart,
+        onEnd: i?.onEnd,
+        onError: i?.onError,
         log: s,
-        pauseDebuggerOnError: o?.pauseDebuggerOnError,
-        timeout: o?.timeout
-      }), a = o?.timeController ?? F, c = re(), g = st(a, c), m = o?.onModeChange;
+        pauseDebuggerOnError: i?.pauseDebuggerOnError,
+        timeout: i?.timeout,
+        state: u
+      }), m = i?.onModeChange;
       function h(d) {
-        g.pendingModeChange = d, m?.(d);
+        u.pendingModeChange = d, m?.(d);
       }
       const y = bt({
         argsTemplates: t,
-        getSeed: o?.getSeed,
-        iterationModes: o?.iterationModes,
-        equals: o?.findBestError?.equals,
-        limitArgOnError: o?.findBestError?.limitArgOnError,
-        includeErrorVariant: o?.findBestError?.includeErrorVariant,
-        timeController: a,
+        getSeed: i?.getSeed,
+        iterationModes: i?.iterationModes,
+        equals: i?.findBestError?.equals,
+        limitArgOnError: i?.findBestError?.limitArgOnError,
+        includeErrorVariant: i?.findBestError?.includeErrorVariant,
+        timeController: n,
         onModeChange: h,
-        limitCompletionCount: o?.cycles ?? 1,
-        limitTests: o?.limitTests,
-        limitTime: o?.limitTime
+        limitCompletionCount: i?.cycles ?? 1,
+        limitTests: i?.limitTests,
+        limitTime: i?.limitTime
       });
-      return Ot(n, y, g, o);
+      return Ot(g, y, u, i);
     };
   };
 }
 export {
   et as T,
-  Dt as c
+  Gt as c
 };