@flemist/test-variants 5.0.15 → 5.0.16

package/build/createTestVariants-o9_knZSz.mjs

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