@flemist/test-variants 5.0.3 → 5.0.5

package/build/{createTestVariants-BaW2oQ-k.mjs → createTestVariants-BXmWQaT8.mjs}

@@ -1,8 +1,8 @@
 import { timeControllerDefault as Q } from "@flemist/time-controller";
-import { formatAny as z, deepCloneJsonLike as Je } from "@flemist/simple-utils";
-import { isPromiseLike as M, waitMicrotasks as Xe, combineAbortSignals as ie } from "@flemist/async-utils";
-import { AbortError as Ze, AbortControllerFast as se } from "@flemist/abort-controller-fast";
-import { poolWait as le, Pool as Ke } from "@flemist/time-limits";
+import { formatAny as z, deepCloneJsonLike as He } from "@flemist/simple-utils";
+import { isPromiseLike as M, waitMicrotasks as Je, combineAbortSignals as ie } from "@flemist/async-utils";
+import { AbortError as Xe, AbortControllerFast as se } from "@flemist/abort-controller-fast";
+import { poolWait as ae, Pool as Ze } from "@flemist/time-limits";
 function Y() {
   if (typeof process < "u" && process.memoryUsage)
     try {
@@ -19,21 +19,21 @@ function Y() {
   }
   return null;
 }
-const Qe = 1e3, U = [];
-function Ye(e) {
+const Ke = 1e3, q = [];
+function Qe(e) {
   return z(e, { pretty: !0, maxDepth: 5, maxItems: 50 });
 }
-function et(...e) {
-  const n = e.map((t) => typeof t == "string" ? t : Ye(t)).join(" ");
-  U.push(n), U.length > Qe && U.shift(), console.log(n);
+function Ye(...e) {
+  const n = e.map((t) => typeof t == "string" ? t : Qe(t)).join(" ");
+  q.push(n), q.length > Ke && q.shift(), console.log(n);
 }
-function tt() {
-  return U.join(`
+function et() {
+  return q.join(`
 `);
 }
-globalThis.__getStressTestLogLast = tt;
+globalThis.__getStressTestLogLast = et;
 const me = (e, n) => {
-  et(n);
+  Ye(n);
 }, w = {
   start: !0,
   progress: 5e3,
@@ -42,7 +42,7 @@ const me = (e, n) => {
   modeChange: !0,
   debug: !1,
   func: me
-}, rt = {
+}, tt = {
   start: !1,
   progress: !1,
   completed: !1,
@@ -52,7 +52,7 @@ const me = (e, n) => {
   func: me
 };
 function ge(e) {
-  return e === !1 ? rt : e === !0 || !e ? w : {
+  return e === !1 ? tt : e === !0 || !e ? w : {
     start: e.start ?? w.start,
     progress: e.progress ?? w.progress,
     completed: e.completed ?? w.completed,
@@ -62,7 +62,7 @@ function ge(e) {
     func: e.func ?? w.func
   };
 }
-function nt(e, n) {
+function rt(e, n) {
   const t = e.now();
   return {
     startTime: t,
@@ -79,111 +79,111 @@ function nt(e, n) {
     prevGcIterationsAsync: 0
   };
 }
-class T extends Ze {
+class T extends Xe {
 }
-const ot = 50, it = 5;
-function ae(e, n) {
+const nt = 50, ot = 5;
+function le(e, n) {
   return typeof e == "number" ? { iterationsAsync: 0, iterationsSync: e } : e != null && typeof e == "object" ? e : n ? { iterationsAsync: 1, iterationsSync: 0 } : { iterationsAsync: 0, iterationsSync: 1 };
 }
-function st(e, n) {
-  const t = n.log;
-  let o = null, i = 0;
-  function l(r, a, u) {
-    o == null && (o = { error: r, args: a, tests: u }, t.error && t.func(
+function it(e, n) {
+  const t = n.log, i = n.pauseDebuggerOnError ?? !0;
+  let o = null, a = 0;
+  function r(l, u, f) {
+    o == null && (o = { error: l, args: u, tests: f }, t.error && t.func(
       "error",
-      `[test-variants] error variant: ${z(a, { pretty: !0 })}
-tests: ${u}
-${z(r)}`
+      `[test-variants] error variant: ${z(u, { pretty: !0 })}
+tests: ${f}
+${z(l)}`
     ));
     const d = Date.now();
-    if (Date.now() - d > ot && i < it) {
+    if (i && Function("debugger")(), Date.now() - d > nt && a < ot) {
       t.func(
         "debug",
-        `[test-variants] debug iteration: ${i}`
-      ), i++;
+        `[test-variants] debug iteration: ${a}`
+      ), a++;
       return;
     }
-    const h = o;
-    throw o = null, n.onError && n.onError(h), h.error;
+    const y = o;
+    throw o = null, n.onError && n.onError(y), y.error;
   }
-  return function(a, u, d) {
+  return function(u, f, d) {
     try {
-      const f = e(a, d);
-      return M(f) ? f.then(
-        (h) => ae(h, !0),
-        (h) => l(h, a, u)
-      ) : ae(f, !1);
-    } catch (f) {
-      return f instanceof T ? void 0 : l(f, a, u);
+      const h = e(u, d);
+      return M(h) ? h.then(
+        (y) => le(y, !0),
+        (y) => r(y, u, f)
+      ) : le(h, !1);
+    } catch (h) {
+      return h instanceof T ? void 0 : r(h, u, f);
     }
   };
 }
-function D(e, n, t) {
-  for (let o = 0, i = e.length; o < i; o++)
-    if (t ? t(e[o], n) : e[o] === n)
-      return o;
+function U(e, n, t) {
+  for (let i = 0, o = e.length; i < o; i++)
+    if (t ? t(e[i], n) : e[i] === n)
+      return i;
   return -1;
 }
-function ue(e, n, t, o) {
-  const i = Object.keys(e.templates), l = {}, r = [], a = [], u = [], d = i.length;
-  for (let f = 0; f < d; f++) {
-    const h = i[f];
-    l[h] = void 0, r.push(-1), a.push(void 0), u.push(null);
+function ue(e, n, t, i) {
+  const o = Object.keys(e.templates), a = {}, r = [], l = [], u = [], f = o.length;
+  for (let d = 0; d < f; d++) {
+    const h = o[d];
+    a[h] = void 0, r.push(-1), l.push(void 0), u.push(null);
   }
   return {
-    args: l,
-    argsNames: i,
+    args: a,
+    argsNames: o,
     indexes: r,
-    argValues: a,
+    argValues: l,
     argLimits: u,
     attempts: 0,
     templates: e,
     limitArgOnError: t,
     equals: n,
-    includeErrorVariant: o ?? !1
+    includeErrorVariant: i ?? !1
   };
 }
 function O(e, n) {
-  const t = e.templates.templates[n], o = e.templates.extra[n];
-  let i;
-  if (typeof t == "function" ? i = t(e.args) : i = t, o == null)
-    return i;
-  let l = null;
-  const r = o.length;
-  for (let a = 0; a < r; a++) {
-    const u = o[a];
-    D(i, u, e.equals) < 0 && (l == null ? l = [...i, u] : l.push(u));
-  }
-  return l ?? i;
-}
-function E(e, n, t) {
-  const o = e.argValues[n].length;
-  if (o === 0)
+  const t = e.templates.templates[n], i = e.templates.extra[n];
+  let o;
+  if (typeof t == "function" ? o = t(e.args) : o = t, i == null)
+    return o;
+  let a = null;
+  const r = i.length;
+  for (let l = 0; l < r; l++) {
+    const u = i[l];
+    U(o, u, e.equals) < 0 && (a == null ? a = [...o, u] : a.push(u));
+  }
+  return a ?? o;
+}
+function x(e, n, t) {
+  const i = e.argValues[n].length;
+  if (i === 0)
     return -1;
-  const i = e.argLimits[n];
-  if (i == null)
-    return o - 1;
-  let l = e.limitArgOnError;
-  if (typeof l == "function") {
+  const o = e.argLimits[n];
+  if (o == null)
+    return i - 1;
+  let a = e.limitArgOnError;
+  if (typeof a == "function") {
     const r = e.argsNames[n];
-    l = l({
+    a = a({
       name: r,
       values: e.argValues[n],
-      maxValueIndex: i
+      maxValueIndex: o
     });
   }
-  return !t || l ? Math.min(i, o - 1) : o - 1;
+  return !t || a ? Math.min(o, i - 1) : i - 1;
 }
 function V(e) {
   const n = e.indexes.length;
   for (let t = 0; t < n; t++) {
-    const o = e.argLimits[t];
-    if (o == null)
+    const i = e.argLimits[t];
+    if (i == null)
       return !1;
-    const i = e.indexes[t];
-    if (i > o)
+    const o = e.indexes[t];
+    if (o > i)
       return !0;
-    if (i < o)
+    if (o < i)
       return !1;
   }
   return !e.includeErrorVariant;
@@ -195,24 +195,24 @@ function C(e) {
 }
 function pe(e) {
   let n = !1, t = !0;
-  const o = e.indexes.length;
-  let i = o, l = !1, r = 0;
-  for (; r < o; r++) {
-    const a = e.argValues[r] == null;
-    (a || l) && (a && (n = !0), e.argValues[r] = O(
+  const i = e.indexes.length;
+  let o = i, a = !1, r = 0;
+  for (; r < i; r++) {
+    const l = e.argValues[r] == null;
+    (l || a) && (l && (n = !0), e.argValues[r] = O(
       e,
       e.argsNames[r]
     ));
-    const u = E(
+    const u = x(
       e,
       r,
-      r > i
+      r > o
     );
     if (u < 0) {
       t = !1, e.indexes[r] = -1;
       break;
     }
-    a && (e.indexes[r] = 0, e.args[e.argsNames[r]] = e.argValues[r][0]), (l || e.indexes[r] > u) && (e.indexes[r] = u, e.args[e.argsNames[r]] = e.argValues[r][u], l = !0), i === o && e.indexes[r] < u && (i = r);
+    l && (e.indexes[r] = 0, e.args[e.argsNames[r]] = e.argValues[r][0]), (a || e.indexes[r] > u) && (e.indexes[r] = u, e.args[e.argsNames[r]] = e.argValues[r][u], a = !0), o === i && e.indexes[r] < u && (o = r);
   }
   if (V(e))
     return C(e), !1;
@@ -221,23 +221,23 @@ function pe(e) {
   for (r--; r >= 0; r--) {
     if (e.argValues[r] == null)
       continue;
-    let a = r > i;
-    const u = E(e, r, a), d = e.indexes[r] + 1;
-    if (d <= u) {
-      e.indexes[r] = d, e.args[e.argsNames[r]] = e.argValues[r][d], d < u && (a = !0);
-      for (let f = r + 1; f < o; f++)
-        e.args[e.argsNames[f]] = void 0;
-      for (r++; r < o; r++) {
+    let l = r > o;
+    const u = x(e, r, l), f = e.indexes[r] + 1;
+    if (f <= u) {
+      e.indexes[r] = f, e.args[e.argsNames[r]] = e.argValues[r][f], f < u && (l = !0);
+      for (let d = r + 1; d < i; d++)
+        e.args[e.argsNames[d]] = void 0;
+      for (r++; r < i; r++) {
         e.argValues[r] = O(
           e,
           e.argsNames[r]
         );
-        const f = E(e, r, a);
-        if (f < 0)
+        const d = x(e, r, l);
+        if (d < 0)
           break;
-        e.indexes[r] = 0, e.args[e.argsNames[r]] = e.argValues[r][0], f > 0 && (a = !0);
+        e.indexes[r] = 0, e.args[e.argsNames[r]] = e.argValues[r][0], d > 0 && (l = !0);
       }
-      if (r >= o)
+      if (r >= i)
         return V(e) ? (C(e), !1) : !0;
     }
   }
@@ -246,73 +246,73 @@ function pe(e) {
 function H(e) {
   V(e) && C(e);
   let n = !1, t = !0;
-  const o = e.indexes.length;
-  let i = o, l = !1, r = 0;
-  for (; r < o; r++) {
-    const a = e.argValues[r] == null;
-    (a || l) && (a && (n = !0), e.argValues[r] = O(
+  const i = e.indexes.length;
+  let o = i, a = !1, r = 0;
+  for (; r < i; r++) {
+    const l = e.argValues[r] == null;
+    (l || a) && (l && (n = !0), e.argValues[r] = O(
       e,
       e.argsNames[r]
     ));
-    const u = E(
+    const u = x(
       e,
       r,
-      r > i
+      r > o
     );
     if (u < 0) {
       t = !1, e.indexes[r] = -1;
       break;
     }
-    a && (e.indexes[r] = u, e.args[e.argsNames[r]] = e.argValues[r][u]), (l || e.indexes[r] > u) && (e.indexes[r] = u, e.args[e.argsNames[r]] = e.argValues[r][u], l = !0), i === o && e.indexes[r] < u && (i = r);
+    l && (e.indexes[r] = u, e.args[e.argsNames[r]] = e.argValues[r][u]), (a || e.indexes[r] > u) && (e.indexes[r] = u, e.args[e.argsNames[r]] = e.argValues[r][u], a = !0), o === i && e.indexes[r] < u && (o = r);
   }
-  if ((n || l) && t && !V(e))
+  if ((n || a) && t && !V(e))
     return !0;
   for (r--; r >= 0; r--) {
     if (e.argValues[r] == null)
       continue;
-    let a = r > i;
-    const u = E(e, r, a);
-    let d = e.indexes[r] - 1;
-    if (d > u && (d = u), d >= 0) {
-      e.indexes[r] = d, e.args[e.argsNames[r]] = e.argValues[r][d], d < u && (a = !0);
-      for (let f = r + 1; f < o; f++)
-        e.args[e.argsNames[f]] = void 0;
-      for (r++; r < o; r++) {
+    let l = r > o;
+    const u = x(e, r, l);
+    let f = e.indexes[r] - 1;
+    if (f > u && (f = u), f >= 0) {
+      e.indexes[r] = f, e.args[e.argsNames[r]] = e.argValues[r][f], f < u && (l = !0);
+      for (let d = r + 1; d < i; d++)
+        e.args[e.argsNames[d]] = void 0;
+      for (r++; r < i; r++) {
         e.argValues[r] = O(
           e,
           e.argsNames[r]
         );
-        const f = E(e, r, a);
-        if (f < 0)
+        const d = x(e, r, l);
+        if (d < 0)
           break;
-        e.indexes[r] = f, e.args[e.argsNames[r]] = e.argValues[r][f], f > 0 && (a = !0);
+        e.indexes[r] = d, e.args[e.argsNames[r]] = e.argValues[r][d], d > 0 && (l = !0);
       }
-      if (r >= o)
+      if (r >= i)
         return !0;
     }
   }
   return C(e), !1;
 }
-function lt(e, n) {
+function st(e, n) {
   C(e);
-  const t = e.argsNames, o = t.length;
-  let i = !1;
-  for (let l = 0; l < o; l++) {
-    const r = t[l], a = n[r];
-    if (a === void 0)
+  const t = e.argsNames, i = t.length;
+  let o = !1;
+  for (let a = 0; a < i; a++) {
+    const r = t[a], l = n[r];
+    if (l === void 0)
       return null;
-    e.argValues[l] = O(e, r);
-    const u = E(e, l, i);
+    e.argValues[a] = O(e, r);
+    const u = x(e, a, o);
     if (u < 0)
       return null;
-    const d = D(
-      e.argValues[l],
-      a,
+    const f = U(
+      e.argValues[a],
+      l,
       e.equals
     );
-    if (d < 0 || d > u)
+    if (f < 0 || f > u)
       return null;
-    e.indexes[l] = d, e.args[e.argsNames[l]] = e.argValues[l][d], e.indexes[l] < u && (i = !0);
+    e.indexes[a] = f, e.args[e.argsNames[a]] = e.argValues[a][f], e.indexes[a] < u && (o = !0);
   }
   return V(e) ? null : e.indexes.slice();
 }
@@ -321,39 +321,39 @@ function at(e) {
   if (n === 0)
     return !1;
   let t = !1;
-  for (let o = 0; o < n; o++) {
-    e.argValues[o] = O(e, e.argsNames[o]);
-    const i = E(e, o, t);
-    if (i < 0)
+  for (let i = 0; i < n; i++) {
+    e.argValues[i] = O(e, e.argsNames[i]);
+    const o = x(e, i, t);
+    if (o < 0)
       return Math.random() < 0.5 ? pe(e) : H(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);
+    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);
   }
   return V(e) ? H(e) : !0;
 }
-function q(e) {
+function _(e) {
   return e.mode === "forward" || e.mode === "backward";
 }
-function ut(e, n, t, o) {
-  const i = n[t], l = e.templates[t];
-  if (typeof l != "function") {
-    if (D(l, i, o) >= 0)
+function lt(e, n, t, i) {
+  const o = n[t], a = e.templates[t];
+  if (typeof a != "function") {
+    if (U(a, o, i) >= 0)
       return;
-    l.push(i);
+    a.push(o);
     return;
   }
   const r = e.extra[t];
   if (r == null) {
-    e.extra[t] = [i];
+    e.extra[t] = [o];
     return;
   }
-  D(r, i, o) >= 0 || r.push(i);
+  U(r, o, i) >= 0 || r.push(o);
 }
-function ct(e, n, t) {
-  for (const o in n)
-    if (Object.prototype.hasOwnProperty.call(n, o)) {
-      if (o === "seed")
+function ut(e, n, t) {
+  for (const i in n)
+    if (Object.prototype.hasOwnProperty.call(n, i)) {
+      if (i === "seed")
         continue;
-      ut(e, n, o, t);
+      lt(e, n, i, t);
     }
 }
 function ce(e, n) {
@@ -366,38 +366,38 @@ function ce(e, n) {
     }
   return !0;
 }
-const ft = [{ mode: "forward" }];
-function dt(e) {
+const ct = [{ mode: "forward" }];
+function ft(e) {
   const {
     argsTemplates: n,
     equals: t,
-    limitArgOnError: o,
-    includeErrorVariant: i,
-    getSeed: l,
+    limitArgOnError: i,
+    includeErrorVariant: o,
+    getSeed: a,
     iterationModes: r,
-    onModeChange: a,
+    onModeChange: l,
     limitCompletionCount: u,
-    limitTests: d,
-    limitTime: f
+    limitTests: f,
+    limitTime: d
   } = e, h = e.timeController ?? Q, y = {
-    templates: Je(n),
+    templates: He(n),
     extra: {}
-  }, p = r == null || r.length === 0 ? ft : r, b = [];
-  let S = null, L = null, g = 0, x = 0, I = !1, P = 0;
+  }, p = r == null || r.length === 0 ? ct : r, b = [];
+  let E = null, L = null, g = 0, S = 0, I = !1, P = 0;
   function $() {
-    I || (I = !0, P = h.now(), xe(), g = 0, re(), Ee());
+    I || (I = !0, P = h.now(), Ee(), g = 0, re(), we());
   }
-  function xe() {
+  function Ee() {
     for (let s = 0, c = p.length; s < c; s++)
-      b.push(we());
+      b.push(Se());
   }
-  function we() {
+  function Se() {
     return {
       navigationState: ue(
         y,
         t ?? null,
-        o ?? null,
-        i ?? null
+        i ?? null,
+        o ?? null
       ),
       cycleCount: 0,
       completedCount: 0,
@@ -406,8 +406,8 @@ function dt(e) {
       startTime: null
     };
   }
-  function Ee() {
-    S = ue(
+  function we() {
+    E = ue(
       y,
       t ?? null,
       // Initial values; overwritten in calcIndexes before each use
@@ -416,19 +416,19 @@ function dt(e) {
     );
   }
   function re() {
-    a?.({
+    l?.({
       mode: p[g],
       modeIndex: g,
-      tests: x
+      tests: S
     });
   }
-  function Me(s) {
-    $(), ce(y.templates, s) && ct(y, s, t);
+  function xe(s) {
+    $(), ce(y.templates, s) && ut(y, s, t);
   }
   function ne(s, c) {
-    return $(), ce(y.templates, s) ? (S.limitArgOnError = c?.limitArg ?? o ?? null, S.includeErrorVariant = c?.includeLimit ?? i ?? !1, lt(S, s)) : null;
+    return $(), ce(y.templates, s) ? (E.limitArgOnError = c?.limitArg ?? i ?? null, E.includeErrorVariant = c?.includeLimit ?? o ?? !1, st(E, s)) : null;
   }
-  function Te(s) {
+  function Me(s) {
     const c = s?.args;
     if (c == null)
       return;
@@ -438,49 +438,49 @@ function dt(e) {
       L = {
         args: c,
         error: s?.error,
-        tests: s?.tests ?? x
-      }, S.argLimits = m;
-      for (let v = 0, _ = b.length; v < _; v++) {
+        tests: s?.tests ?? S
+      }, E.argLimits = m;
+      for (let v = 0, D = b.length; v < D; v++) {
         const j = b[v].navigationState;
         j.argLimits = m;
       }
     }
   }
-  function Ve() {
-    return $(), Ie();
+  function Te() {
+    return $(), Ve();
   }
-  function Ie() {
+  function Ve() {
     for (; ; ) {
-      if (!Ae())
+      if (!Ie())
         return null;
       for (; ; ) {
-        const s = Ue();
+        const s = _e();
         if (s != null)
-          return b[g].testsInLastTurn++, x++, s;
-        if ($e()) {
-          if (!Ge())
+          return b[g].testsInLastTurn++, S++, s;
+        if (Pe()) {
+          if (!$e())
             return null;
-          qe();
+          De();
           break;
         }
       }
     }
   }
+  function Ie() {
+    return !(Ae() || Ce() || G() && (Oe() || !Le()) || !Ne());
+  }
   function Ae() {
-    return !(Ce() || Oe() || G() && (Le() || !Ne()) || !Pe());
+    return f != null && S >= f;
   }
   function Ce() {
-    return d != null && x >= d;
+    return d != null && h.now() - P >= d;
   }
   function Oe() {
-    return f != null && h.now() - P >= f;
-  }
-  function Le() {
     if (!G())
       throw new Error("Unexpected behavior");
     return u != null && u <= 0;
   }
-  function Ne() {
+  function Le() {
     if (!G())
       throw new Error("Unexpected behavior");
     for (let s = 0, c = p.length; s < c; s++)
@@ -488,20 +488,20 @@ function dt(e) {
         return !0;
     return !1;
   }
-  function Pe() {
+  function Ne() {
     for (let s = 0, c = p.length; s < c; s++)
       if (k(s))
         return !0;
     return !1;
   }
-  function $e() {
+  function Pe() {
     g++;
     const s = g >= p.length;
     return s && (g = 0), re(), s;
   }
-  function Ge() {
+  function $e() {
     if (G()) {
-      const s = _e();
+      const s = Ge();
       if (u != null && s >= u)
         return !1;
     }
@@ -509,15 +509,15 @@ function dt(e) {
   }
   function G() {
     for (let s = 0, c = p.length; s < c; s++)
-      if (q(p[s]))
+      if (_(p[s]))
         return !0;
     return !1;
   }
-  function _e() {
+  function Ge() {
     let s = !1, c = 1 / 0;
     for (let m = 0, v = b.length; m < v; m++) {
-      const _ = b[m], j = p[m];
-      q(j) && (s = !0, k(m) && _.completedCount < c && (c = _.completedCount));
+      const D = b[m], j = p[m];
+      _(j) && (s = !0, k(m) && D.completedCount < c && (c = D.completedCount));
     }
     if (!s)
       throw new Error("Unexpected behavior");
@@ -527,66 +527,66 @@ function dt(e) {
     const c = p[s], m = b[s];
     return c.limitTests != null && c.limitTests <= 0 || A(c) && (c.cycles != null && c.cycles <= 0 || c.attemptsPerVariant != null && c.attemptsPerVariant <= 0) ? !1 : m.tryNextVariantAttempts < 2;
   }
-  function qe() {
+  function De() {
     g = 0;
     for (let s = 0, c = b.length; s < c; s++) {
       const m = b[s];
       m.testsInLastTurn = 0, m.startTime = null;
     }
   }
-  function Ue() {
+  function _e() {
     let s = 0;
     for (; s < 2; ) {
-      if (!De())
+      if (!qe())
         return null;
-      const c = je();
+      const c = Fe();
       if (c != null)
         return c;
-      if (A(p[g]) && Fe())
+      if (A(p[g]) && ke())
         return null;
       s++;
     }
     return null;
   }
-  function De() {
+  function qe() {
     const s = p[g];
-    return !(Be() || Re() || A(s) && !ke(g));
+    return !(Ue() || Be() || A(s) && !Re(g));
   }
-  function Be() {
+  function Ue() {
     const s = p[g], c = b[g];
     return s.limitTests != null && c.testsInLastTurn >= s.limitTests;
   }
-  function Re() {
+  function Be() {
     const s = p[g], c = b[g];
     return s.limitTime != null && c.startTime != null && h.now() - c.startTime >= s.limitTime;
   }
   function A(s) {
-    return q(s);
+    return _(s);
   }
-  function ke(s) {
+  function Re(s) {
     const c = p[s], m = b[s];
     if (!A(c))
       throw new Error("Unexpected behavior");
     return m.cycleCount < (c.cycles ?? 1);
   }
-  function Fe() {
+  function ke() {
     const s = p[g], c = b[g];
     if (!A(s))
       throw new Error("Unexpected behavior");
     return c.cycleCount++, c.cycleCount >= (s.cycles ?? 1) ? (c.cycleCount = 0, c.completedCount++, !0) : !1;
   }
-  function je() {
+  function Fe() {
     const s = p[g], c = b[g], m = c.navigationState;
     if (N(s)) {
       if (F())
         return null;
-      const v = We();
+      const v = je();
       if (v != null)
         return c.startTime == null && (c.startTime = h.now()), v;
     }
-    return He() ? (c.tryNextVariantAttempts = 0, N(s) && ze(), c.startTime == null && (c.startTime = h.now()), oe(m.args)) : (c.tryNextVariantAttempts++, null);
+    return ze() ? (c.tryNextVariantAttempts = 0, N(s) && We(), c.startTime == null && (c.startTime = h.now()), oe(m.args)) : (c.tryNextVariantAttempts++, null);
   }
-  function We() {
+  function je() {
     const s = p[g], m = b[g].navigationState;
     if (!N(s))
       throw new Error("Unexpected behavior");
@@ -595,7 +595,7 @@ function dt(e) {
     const v = s.attemptsPerVariant ?? 1;
     return m.attempts > 0 && m.attempts < v ? V(m) ? null : (m.attempts++, oe(m.args)) : null;
   }
-  function ze() {
+  function We() {
     const s = p[g], m = b[g].navigationState;
     if (!N(s))
       throw new Error("Unexpected behavior");
@@ -604,7 +604,7 @@ function dt(e) {
     m.attempts = 1;
   }
   function N(s) {
-    return q(s);
+    return _(s);
   }
   function F() {
     const s = p[g];
@@ -612,7 +612,7 @@ function dt(e) {
       throw new Error("Unexpected behavior");
     return (s.attemptsPerVariant ?? 1) <= 0;
   }
-  function He() {
+  function ze() {
     const s = p[g], m = b[g].navigationState;
     switch (s.mode) {
       case "forward":
@@ -627,7 +627,7 @@ function dt(e) {
   }
   function oe(s) {
     const c = { ...s };
-    return l != null && (c.seed = l({ tests: x })), c;
+    return a != null && (c.seed = a({ tests: S })), c;
   }
   return {
     get limit() {
@@ -643,36 +643,36 @@ function dt(e) {
       return b;
     },
     get tests() {
-      return x;
+      return S;
     },
     calcIndexes: ne,
-    extendTemplates: Me,
-    addLimit: Te,
-    next: Ve
+    extendTemplates: xe,
+    addLimit: Me,
+    next: Te
   };
 }
 function ee(e) {
   if (e == null || e <= 0)
     throw new Error(`Iterations = ${e}`);
   e--;
-  const n = Xe().then(() => e);
+  const n = Je().then(() => e);
   return e <= 0 ? n : n.then(ee);
 }
-function mt(e, n, t) {
-  const o = n.limit ? {
+function dt(e, n, t) {
+  const i = n.limit ? {
     error: n.limit.error,
     args: n.limit.args,
     tests: n.limit.tests
   } : null;
-  if (o && !t)
-    throw o.error;
+  if (i && !t)
+    throw i.error;
   return {
     iterations: e.iterations,
-    bestError: o
+    bestError: i
   };
 }
 const fe = 2 ** 31;
-function gt(e) {
+function mt(e) {
   if (e == null)
     return { parallel: 1, sequentialOnError: !1 };
   if (typeof e == "boolean")
@@ -689,8 +689,8 @@ function gt(e) {
     sequentialOnError: e.sequentialOnError ?? !1
   };
 }
-function pt(e) {
-  const n = e?.saveErrorVariants, t = n && e.createSaveErrorVariantsStore ? e.createSaveErrorVariantsStore(n) : null, o = e?.findBestError, { parallel: i, sequentialOnError: l } = gt(
+function gt(e) {
+  const n = e?.saveErrorVariants, t = n && e.createSaveErrorVariantsStore ? e.createSaveErrorVariantsStore(n) : null, i = e?.findBestError, { parallel: o, sequentialOnError: a } = mt(
     e?.parallel
   );
   return {
@@ -700,61 +700,61 @@ function pt(e) {
     GC_Interval: e?.GC_Interval ?? 1e3,
     logOptions: ge(e?.log),
     abortSignalExternal: e?.abortSignal,
-    findBestError: o,
-    dontThrowIfError: o?.dontThrowIfError,
+    findBestError: i,
+    dontThrowIfError: i?.dontThrowIfError,
     timeController: e?.timeController ?? Q,
-    parallel: i,
-    sequentialOnError: l
+    parallel: o,
+    sequentialOnError: a
   };
 }
 function B(e, n, t) {
-  const { options: o, variantsIterator: i } = e, l = i.limit?.args ?? n;
-  if (!o.store)
+  const { options: i, variantsIterator: o } = e, a = o.limit?.args ?? n;
+  if (!i.store)
     return;
-  const r = o.store.save(l);
+  const r = i.store.save(a);
   if (t)
     return r;
 }
-function ht(e, n, t, o) {
-  const { abortControllerParallel: i, state: l, options: r } = e, { logOptions: a } = r;
+function pt(e, n, t, i) {
+  const { abortControllerParallel: o, state: a, options: r } = e, { logOptions: l } = r;
   if (e.options.findBestError)
-    e.variantsIterator.addLimit({ args: n, error: t, tests: o }), l.debugMode = !1, B(e, n, !1), r.sequentialOnError && !i.signal.aborted ? (a.debug && a.func(
+    e.variantsIterator.addLimit({ args: n, error: t, tests: i }), a.debugMode = !1, B(e, n, !1), r.sequentialOnError && !o.signal.aborted ? (l.debug && l.func(
       "debug",
       "[test-variants] sequentialOnError: aborting parallel, switching to sequential"
-    ), i.abort(new T())) : a.debug && a.func(
+    ), o.abort(new T())) : l.debug && l.func(
       "debug",
       "[test-variants] parallel error in findBestError mode, continuing with new limits"
     );
   else {
-    if (i.signal.aborted)
+    if (o.signal.aborted)
       return;
-    B(e, n, !1), i.abort(t);
+    B(e, n, !1), o.abort(t);
   }
 }
-function de(e, n, t, o) {
-  const { state: i } = e;
+function de(e, n, t, i) {
+  const { state: o } = e;
   if (e.options.findBestError) {
-    e.variantsIterator.addLimit({ args: n, error: t, tests: o });
+    e.variantsIterator.addLimit({ args: n, error: t, tests: i });
     const r = B(e, n, !0);
     if (r)
       return r.then(() => {
-        i.debugMode = !1;
+        o.debugMode = !1;
       });
-    i.debugMode = !1;
+    o.debugMode = !1;
     return;
   }
-  const l = B(e, n, !0);
-  if (l)
-    return l.then(() => {
+  const a = B(e, n, !0);
+  if (a)
+    return a.then(() => {
       throw t;
     });
   throw t;
 }
-function bt(e, n) {
-  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 && n - e.state.prevGcTime >= i;
+function ht(e, n) {
+  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 && n - e.state.prevGcTime >= o;
 }
-async function yt(e, n) {
+async function bt(e, n) {
   e.prevGcIterations = e.iterations, e.prevGcIterationsAsync = e.iterationsAsync, e.prevGcTime = n, await ee(1);
 }
 function te(e) {
@@ -771,53 +771,53 @@ function J(e) {
   const t = e / (1024 * 1024);
   return t >= 10 ? `${Math.round(t)}MB` : `${t.toFixed(1)}MB`;
 }
-function vt(e, n) {
+function yt(e, n) {
   if (!e)
     return `mode[${n}]: null`;
   let t = `mode[${n}]: ${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=${te(e.limitTime)}`), e.limitTests != null && (t += `, limitTests=${e.limitTests}`), t;
 }
 function he(e, n) {
-  const t = e - n, o = t >= 0 ? "+" : "";
-  return `${J(e)} (${o}${J(t)})`;
+  const t = e - n, i = t >= 0 ? "+" : "";
+  return `${J(e)} (${i}${J(t)})`;
 }
-function St(e, n) {
+function vt(e, n) {
   if (!e.start)
     return;
   let t = "[test-variants] start";
   n != null && (t += `, memory: ${J(n)}`), e.func("start", t);
 }
-function xt(e) {
-  const { options: n, state: t } = e, { logOptions: o, timeController: i } = n;
-  if (!o.completed)
+function Et(e) {
+  const { options: n, state: t } = e, { logOptions: i, timeController: o } = n;
+  if (!i.completed)
     return;
-  const l = i.now() - t.startTime;
-  let r = `[test-variants] end, tests: ${t.tests} (${te(l)}), async: ${t.iterationsAsync}`;
+  const a = o.now() - t.startTime;
+  let r = `[test-variants] end, tests: ${t.tests} (${te(a)}), async: ${t.iterationsAsync}`;
   if (t.startMemory != null) {
-    const a = Y();
-    a != null && (r += `, memory: ${he(a, t.startMemory)}`);
+    const l = Y();
+    l != null && (r += `, memory: ${he(l, t.startMemory)}`);
   }
-  o.func("completed", r);
+  i.func("completed", r);
 }
 function be(e) {
-  const { options: n, state: t } = e, { logOptions: o } = n, i = t.pendingModeChange;
-  !o.modeChange || i == null || (o.func(
+  const { options: n, state: t } = e, { logOptions: i } = n, o = t.pendingModeChange;
+  !i.modeChange || o == null || (i.func(
     "modeChange",
-    `[test-variants] ${vt(i.mode, i.modeIndex)}`
+    `[test-variants] ${yt(o.mode, o.modeIndex)}`
   ), t.pendingModeChange = null);
 }
-function wt(e) {
-  const { options: n, state: t } = e, { logOptions: o, timeController: i } = n, l = i.now();
-  if (!o.progress || l - t.prevLogTime < o.progress)
+function St(e) {
+  const { options: n, state: t } = e, { logOptions: i, timeController: o } = n, a = o.now();
+  if (!i.progress || a - t.prevLogTime < i.progress)
     return !1;
   be(e);
-  const r = l - t.startTime;
-  let a = `[test-variants] tests: ${t.tests} (${te(r)}), async: ${t.iterationsAsync}`;
+  const r = a - t.startTime;
+  let l = `[test-variants] tests: ${t.tests} (${te(r)}), async: ${t.iterationsAsync}`;
   if (t.prevLogMemory != null) {
     const u = Y();
-    u != null && (a += `, memory: ${he(u, t.prevLogMemory)}`, t.prevLogMemory = u);
+    u != null && (l += `, memory: ${he(u, t.prevLogMemory)}`, t.prevLogMemory = u);
   }
-  return o.func("progress", a), t.prevLogTime = l, !0;
+  return i.func("progress", l), t.prevLogTime = a, !0;
 }
 function X(e, n) {
   e.debugMode = !1, n && (e.iterationsAsync += n.iterationsAsync, e.iterations += n.iterationsSync + n.iterationsAsync);
@@ -826,40 +826,40 @@ function Z(e) {
   e.state.debugMode = !0, e.abortControllerParallel.abort(new T());
 }
 function ye(e, n) {
-  const { testRun: t, testOptions: o, state: i } = e, l = i.tests;
-  i.tests++;
+  const { testRun: t, testOptions: i, state: o } = e, a = o.tests;
+  o.tests++;
   try {
-    const r = t(n, l, o);
+    const r = t(n, a, i);
     if (M(r))
       return r.then(
-        (a) => {
-          if (!a) {
+        (l) => {
+          if (!l) {
             Z(e);
             return;
           }
-          X(i, a);
+          X(o, l);
         },
-        (a) => de(e, n, a, l)
+        (l) => de(e, n, l, a)
       );
     if (!r) {
       Z(e);
       return;
     }
-    X(i, r);
+    X(o, r);
   } catch (r) {
-    return r instanceof T ? void 0 : de(e, n, r, l);
+    return r instanceof T ? void 0 : de(e, n, r, a);
   }
 }
-function Et(e, n) {
-  const { pool: t, abortSignal: o, testRun: i, testOptionsParallel: l, state: r } = e;
+function wt(e, n) {
+  const { pool: t, abortSignal: i, testRun: o, testOptionsParallel: a, state: r } = e;
   if (!t)
     return;
-  const a = r.tests;
+  const l = r.tests;
   r.tests++, (async () => {
     try {
-      if (o.aborted)
+      if (i.aborted)
         return;
-      let u = i(n, a, l);
+      let u = o(n, l, a);
       if (M(u) && (u = await u), !u) {
         Z(e);
         return;
@@ -868,20 +868,20 @@ function Et(e, n) {
     } catch (u) {
       if (u instanceof T)
         return;
-      ht(e, n, u, a);
+      pt(e, n, u, l);
     } finally {
       t.release(1);
     }
   })();
 }
 function ve(e) {
-  const { options: n, state: t } = e, { logOptions: o, timeController: i, GC_Interval: l } = n;
-  if (!o.progress && !l)
+  const { options: n, state: t } = e, { logOptions: i, timeController: o, GC_Interval: a } = n;
+  if (!i.progress && !a)
     return;
-  wt(e);
-  const r = i.now();
-  if (bt(e, r))
-    return yt(t, r);
+  St(e);
+  const r = o.now();
+  if (ht(e, r))
+    return bt(t, r);
 }
 function R(e) {
   return e.options.abortSignalExternal?.aborted ?? !1;
@@ -889,140 +889,133 @@ function R(e) {
 function K(e) {
   return e.abortSignal.aborted;
 }
-function Se(e, n) {
-  return e.state.debugMode ? n : e.variantsIterator.next();
-}
 async function W(e, n) {
-  const { pool: t, state: o, options: i } = e, { parallel: l, logOptions: r } = i;
-  let a = n ?? null;
+  const { pool: t, state: i, options: o } = e, { parallel: a, logOptions: r } = o;
+  let l = null;
   for (; !R(e); ) {
     const u = t && !K(e);
-    let d = !1;
-    u && (t.hold(1) || await le({ pool: t, count: 1, hold: !0 }), d = !0);
+    let f = !1;
+    u && (t.hold(1) || await ae({ pool: t, count: 1, hold: !0 }), f = !0);
     try {
-      if (a == null && (a = Se(e, a), a == null))
+      if (n != null ? (l = n, n = null) : e.state.debugMode || (l = e.variantsIterator.next()), l == null)
         break;
-      const f = ve(e);
-      if (M(f) && await f, R(e)) {
-        a = null;
+      const d = ve(e);
+      if (M(d) && await d, R(e))
         continue;
-      }
       if (u)
-        Et(e, a), d = !1;
+        wt(e, l), f = !1;
       else {
         r.debug && t && K(e) && r.func(
           "debug",
-          `[test-variants] parallel aborted, running sequential: tests=${o.tests}`
+          `[test-variants] parallel aborted, running sequential: tests=${i.tests}`
         );
-        const h = ye(e, a);
+        const h = ye(e, l);
         M(h) && await h;
       }
-      a = null;
     } finally {
-      d && t.release(1);
+      f && t.release(1);
     }
   }
-  t && (await le({ pool: t, count: l, hold: !0 }), t.release(l));
+  t && (await ae({ pool: t, count: a, hold: !0 }), t.release(a));
 }
-function Mt(e) {
-  const { pool: n, state: t, options: o } = e, { logOptions: i } = o;
+function xt(e) {
+  const { pool: n, state: t, options: i } = e, { logOptions: o } = i;
   if (n)
     return W(e);
-  let l = null;
-  for (; !R(e) && (l = Se(e, l), l != null); ) {
+  let a = null;
+  for (; !R(e) && (e.state.debugMode || (a = e.variantsIterator.next()), a != null); ) {
     const r = ve(e);
-    if (M(r)) {
-      const u = l;
-      return r.then(() => W(e, u));
-    }
+    if (M(r))
+      return r.then(() => W(e, a));
     if (R(e))
       continue;
-    i.debug && K(e) && i.func(
+    o.debug && K(e) && o.func(
       "debug",
       `[test-variants] parallel aborted, running sequential: tests=${t.tests}`
     );
-    const a = ye(e, l);
-    if (M(a))
-      return a.then(() => W(e));
+    const l = ye(e, a);
+    if (M(l))
+      return l.then(() => W(e));
   }
 }
-async function Tt(e, n, t, o) {
-  const i = pt(o), {
-    store: l,
+async function Mt(e, n, t, i) {
+  const o = gt(i), {
+    store: a,
     logOptions: r,
-    abortSignalExternal: a,
+    abortSignalExternal: l,
     findBestError: u,
-    dontThrowIfError: d,
-    timeController: f,
+    dontThrowIfError: f,
+    timeController: d,
     parallel: h
-  } = i, y = new se(), p = new se(), b = ie(
-    a,
+  } = o, y = new se(), p = new se(), b = ie(
+    l,
     y.signal
-  ), S = ie(
+  ), E = ie(
     b,
     p.signal
   ), L = {
     abortSignal: b,
-    timeController: f
+    timeController: d
   }, g = {
-    abortSignal: S,
-    timeController: f
+    abortSignal: E,
+    timeController: d
   };
-  l && await l.replay({
+  a && await a.replay({
     testRun: e,
     variantsIterator: n,
     testOptions: L,
     findBestErrorEnabled: !!u
   });
-  const x = h <= 1 ? null : new Ke(h);
-  St(r, t.startMemory);
+  const S = h <= 1 ? null : new Ze(h);
+  vt(r, t.startMemory);
   const I = {
-    options: i,
+    options: o,
     testRun: e,
     variantsIterator: n,
     testOptions: L,
     testOptionsParallel: g,
     abortControllerGlobal: y,
     abortControllerParallel: p,
-    abortSignal: S,
-    pool: x,
+    abortSignal: E,
+    pool: S,
     state: t
   };
   be(I);
   try {
-    await Mt(I), S.throwIfAborted();
+    await xt(I), E.throwIfAborted();
   } catch (P) {
     throw y.abort(new T()), P;
   }
-  return b.throwIfAborted(), y.abort(new T()), xt(I), await ee(1), mt(t, n, d);
+  return b.throwIfAborted(), y.abort(new T()), Et(I), await ee(1), dt(t, n, f);
 }
-function Nt(e) {
+function Lt(e) {
   return function(t) {
-    return async function(i) {
-      const l = ge(i?.log), r = st(e, {
-        onError: i?.onError,
-        log: l
-      }), a = i?.timeController ?? Q, u = Y(), d = nt(a, u), f = i?.onModeChange;
+    return async function(o) {
+      const a = ge(o?.log), r = it(e, {
+        onError: o?.onError,
+        log: a,
+        pauseDebuggerOnError: o?.pauseDebuggerOnError
+      }), l = o?.timeController ?? Q, u = Y(), f = rt(l, u), d = o?.onModeChange;
       function h(p) {
-        d.pendingModeChange = p, f?.(p);
+        f.pendingModeChange = p, d?.(p);
       }
-      const y = dt({
+      const y = ft({
         argsTemplates: t,
-        getSeed: i?.getSeed,
-        iterationModes: i?.iterationModes,
-        equals: i?.findBestError?.equals,
-        limitArgOnError: i?.findBestError?.limitArgOnError,
-        includeErrorVariant: i?.findBestError?.includeErrorVariant,
-        timeController: a,
+        getSeed: o?.getSeed,
+        iterationModes: o?.iterationModes,
+        equals: o?.findBestError?.equals,
+        limitArgOnError: o?.findBestError?.limitArgOnError,
+        includeErrorVariant: o?.findBestError?.includeErrorVariant,
+        timeController: l,
         onModeChange: h,
-        limitCompletionCount: i?.cycles ?? 1,
-        limitTests: i?.limitTests,
-        limitTime: i?.limitTime
+        limitCompletionCount: o?.cycles ?? 1,
+        limitTests: o?.limitTests,
+        limitTime: o?.limitTime
       });
-      return Tt(r, y, d, i);
+      return Mt(r, y, f, o);
     };
   };
 }
 export {
-  Nt as c
+  Lt as c
 };