@flemist/test-variants 5.0.2 → 5.0.3

package/build/createTestVariants-BaW2oQ-k.mjs

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