@ait-co/devtools 0.1.144 → 0.2.0

package/dist/test-runner/runtime.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"runtime.js","names":["#received","#negated","#assert"],"sources":["../../src/test-runner/runtime.ts"],"sourcesContent":["/**\n * Thin test runtime for WebView execution.\n *\n * This file is bundled by `bundle.ts` together with the user's test file\n * into a single IIFE injected into the WebView via `Runtime.evaluate`.\n * It MUST stay browser-compatible — no Node.js APIs allowed.\n *\n * Design: rather than shipping @vitest/runner verbatim into a WebView (where\n * its Node-side internals cause issues), this runtime provides a minimal\n * compatible API surface — describe/it/test/expect globals — collects results\n * into a plain JSON-safe object, and exports `runTestModule` as the entry point.\n *\n * @vitest/runner and @vitest/expect are listed as dependencies so that the\n * package's type contracts are available and so the browser-compatible subsets\n * can be referenced. The Vitest custom pool that drives this runtime through\n * Vitest's `PoolRunnerInitializer` lives in `pool.ts`.\n *\n * NOTE: this file is imported by type from Node-side code (rpc.ts / relay-worker.ts)\n * for the RunReport / TestResult type shapes. The runtime ITSELF is not imported\n * at runtime on the Node side — only the types are used.\n */\n\nimport { isThrottledError } from './throttle.js';\n\n/* -------------------------------------------------------------------------- */\n/* Public result types (used by rpc.ts and relay-worker.ts)                   */\n/* -------------------------------------------------------------------------- */\n\n/**\n * Result of a single test case.\n * All fields are JSON-serialisable.\n */\nexport interface TestResult {\n  /** Full dot-joined test name including nested suite names. */\n  name: string;\n  /** `'pass'` or `'fail'`. `'skip'` for skipped tests. */\n  status: 'pass' | 'fail' | 'skip';\n  /** Duration in milliseconds. */\n  duration: number;\n  /** Error message (fail only). Does NOT include the expression/secret. */\n  error?: string;\n  /**\n   * Optional note attached to a skip — populated when the test body itself\n   * calls `ctx.skip(cond, note)` (devtools#746), mirroring the static\n   * `it.skip`/`it.skipIf` path which has no note today. `'skip'` status only.\n   */\n  note?: string;\n  /**\n   * Number of throttle-aware re-executions of the test BODY (devtools#767) —\n   * present only when at least one retry was attempted (`>= 1`); omitted\n   * (never `0`) for every test that never hit `APP_BRIDGE_THROTTLED`, so\n   * existing consumers (sdk-example's diff script) see byte-identical reports\n   * for the common case. A test that eventually PASSES after retrying still\n   * carries this field — it is provenance, not a failure flag.\n   */\n  throttleRetries?: number;\n}\n\n/** Aggregate report returned by `runTestModule`. */\nexport interface RunReport {\n  /** ISO timestamp of when `runTestModule` was called. */\n  startedAt: string;\n  /** Total elapsed milliseconds (wall-clock). */\n  duration: number;\n  passed: number;\n  failed: number;\n  skipped: number;\n  tests: TestResult[];\n}\n\n/* -------------------------------------------------------------------------- */\n/* THROTTLED-aware test retry (devtools#767)                                  */\n/* -------------------------------------------------------------------------- */\n\n/** Backoff delays (ms) between throttle-retry attempts: 1s, then 2s. */\nconst TEST_RETRY_BACKOFF_MS = [1_000, 2_000] as const;\n\n/** Max retry attempts per test after the initial run (devtools#767: \"최대 2회 재시도\"). */\nconst TEST_MAX_RETRIES = TEST_RETRY_BACKOFF_MS.length;\n\n/** Real `setTimeout`-backed sleep — the production default for {@link RunTestModuleOptions.sleep}. */\nconst DEFAULT_SLEEP = (ms: number): Promise<void> =>\n  new Promise((resolve) => setTimeout(resolve, ms));\n\n/**\n * Test-only override surface for `runTestModule`. Never populated by the\n * generated bundle — see that function's doc.\n */\nexport interface RunTestModuleOptions {\n  /**\n   * Overrides the backoff/pacing sleep implementation. Defaults to a real\n   * `setTimeout`-backed sleep. Unit tests pass a fake (e.g. an\n   * immediately-resolving spy) so retry/pacing tests don't take real\n   * wall-clock seconds.\n   */\n  sleep?: (ms: number) => Promise<void>;\n}\n\n/**\n * Renders a thrown value into a `TestResult.error` string. Handles three\n * shapes:\n *   - a real `Error` (or subclass) — its `.message`;\n *   - an error-LIKE plain object with a string `.message` (the 2.x native\n *     bridge envelope this test-runner observes, e.g.\n *     `{name, code, userInfo, moduleName, __isError}` — devtools#767's\n *     `APP_BRIDGE_THROTTLED` rejections are exactly this shape, not an\n *     `Error` instance) — its `.message` field;\n *   - anything else — `String(e)` (the pre-#767 fallback, unchanged).\n *\n * Without the middle case, a native envelope's `.message` (the only useful\n * diagnostic text) was discarded in favor of the useless `\"[object Object]\"`.\n */\nfunction stringifyThrown(e: unknown): string {\n  if (e instanceof Error) return e.message;\n  if (typeof e === 'object' && e !== null) {\n    const rec = e as { message?: unknown };\n    if (typeof rec.message === 'string') return rec.message;\n  }\n  return String(e);\n}\n\n/* -------------------------------------------------------------------------- */\n/* Asymmetric matchers (devtools#692)                                          */\n/* -------------------------------------------------------------------------- */\n\n/**\n * Brand property that tags asymmetric matcher markers (`expect.any(String)`,\n * `expect.objectContaining(...)`, etc). A reserved string key is used as the\n * brand so the guard stays a plain own-property check — markers are only ever\n * compared in-process by reference, so no cross-realm Symbol coordination is\n * needed.\n */\nconst ASYMMETRIC_BRAND = '$$asymmetricMatch' as const;\n\n/**\n * An asymmetric matcher: a placeholder that, when found on the `expected` side\n * of a deep comparison, runs its own `asymmetricMatch(actual)` predicate\n * instead of being structurally compared as a plain object. This is what makes\n * `toMatchObject({ hash: expect.any(String) })` match any string `hash`.\n */\ninterface AsymmetricMatcher {\n  /** Brand discriminator — present only on asymmetric markers. */\n  [ASYMMETRIC_BRAND]: true;\n  /** Human-readable label used in failure messages. */\n  toString(): string;\n  /** Returns true when `actual` satisfies this matcher. */\n  asymmetricMatch(actual: unknown): boolean;\n}\n\n/** Narrowing guard: is `v` an asymmetric matcher marker? */\nfunction isAsymmetric(v: unknown): v is AsymmetricMatcher {\n  return (\n    typeof v === 'object' &&\n    v !== null &&\n    (v as Record<string, unknown>)[ASYMMETRIC_BRAND] === true &&\n    typeof (v as { asymmetricMatch?: unknown }).asymmetricMatch === 'function'\n  );\n}\n\n/** The widest constructor type TypeScript allows without `any` (see toBeInstanceOf). */\ntype AnyCtor = abstract new (...args: never) => unknown;\n\n/**\n * `expect.any(Ctor)` — matches a value by its constructor. Primitive wrappers\n * (`String`/`Number`/`Boolean`) are matched by `typeof` (so the unboxed\n * primitive matches) AND by `instanceof` (so a boxed wrapper instance also\n * matches). `BigInt`/`Symbol` match by `typeof`. `Object` matches any non-null\n * object (NOT functions, matching vitest), `Array` uses `Array.isArray`,\n * `Function` uses `typeof === 'function'`, and any other constructor (user\n * classes) falls back to `instanceof`.\n */\nfunction makeAny(ctor: AnyCtor): AsymmetricMatcher {\n  const name = (ctor as { name?: string }).name ?? String(ctor);\n  const ctorAsFn = ctor as unknown as (new (...args: unknown[]) => unknown) | undefined;\n  return {\n    [ASYMMETRIC_BRAND]: true,\n    toString: () => `Any<${name}>`,\n    asymmetricMatch(actual: unknown): boolean {\n      if (actual === null || actual === undefined) return false;\n      switch (ctor as unknown) {\n        case String:\n          return typeof actual === 'string' || actual instanceof String;\n        case Number:\n          return typeof actual === 'number' || actual instanceof Number;\n        case Boolean:\n          return typeof actual === 'boolean' || actual instanceof Boolean;\n        case BigInt:\n          return typeof actual === 'bigint';\n        case Symbol:\n          return typeof actual === 'symbol';\n        case Function:\n          return typeof actual === 'function';\n        case Object:\n          // Match vitest: `expect.any(Object)` accepts objects only, NOT\n          // functions (vitest checks `typeof other === 'object'`). `null` is\n          // already excluded by the guard above.\n          return typeof actual === 'object';\n        case Array:\n          return Array.isArray(actual);\n        default:\n          return ctorAsFn ? actual instanceof ctorAsFn : false;\n      }\n    },\n  };\n}\n\n/** `expect.anything()` — matches any value except `null`/`undefined`. */\nfunction makeAnything(): AsymmetricMatcher {\n  return {\n    [ASYMMETRIC_BRAND]: true,\n    toString: () => 'Anything',\n    asymmetricMatch: (actual: unknown): boolean => actual !== null && actual !== undefined,\n  };\n}\n\n/** `expect.objectContaining(obj)` — partial-match every key of `obj` on `actual`. */\nfunction makeObjectContaining(expected: Record<string, unknown>): AsymmetricMatcher {\n  return {\n    [ASYMMETRIC_BRAND]: true,\n    toString: () => `ObjectContaining<${safeStringify(expected)}>`,\n    asymmetricMatch: (actual: unknown): boolean => deepMatchObject(actual, expected),\n  };\n}\n\n/** `expect.arrayContaining(arr)` — `actual` is an array containing each element of `arr`. */\nfunction makeArrayContaining(expected: unknown[]): AsymmetricMatcher {\n  return {\n    [ASYMMETRIC_BRAND]: true,\n    toString: () => `ArrayContaining<${safeStringify(expected)}>`,\n    asymmetricMatch(actual: unknown): boolean {\n      if (!Array.isArray(actual)) return false;\n      return expected.every((exp) =>\n        actual.some((act) => (isAsymmetric(exp) ? exp.asymmetricMatch(act) : deepEqual(act, exp))),\n      );\n    },\n  };\n}\n\n/** `expect.stringContaining(sub)` — `actual` is a string containing `sub`. */\nfunction makeStringContaining(sub: string): AsymmetricMatcher {\n  return {\n    [ASYMMETRIC_BRAND]: true,\n    toString: () => `StringContaining<${sub}>`,\n    asymmetricMatch: (actual: unknown): boolean =>\n      typeof actual === 'string' && actual.includes(sub),\n  };\n}\n\n/** `expect.stringMatching(re)` — `actual` is a string matching `re` (string or RegExp). */\nfunction makeStringMatching(re: string | RegExp): AsymmetricMatcher {\n  const pattern = typeof re === 'string' ? new RegExp(re) : re;\n  return {\n    [ASYMMETRIC_BRAND]: true,\n    toString: () => `StringMatching<${String(pattern)}>`,\n    asymmetricMatch: (actual: unknown): boolean =>\n      typeof actual === 'string' && pattern.test(actual),\n  };\n}\n\n/* -------------------------------------------------------------------------- */\n/* Deep equality helpers                                                        */\n/* -------------------------------------------------------------------------- */\n\n/** JSON.stringify that never throws (cycles/BigInt) — for failure messages. */\nfunction safeStringify(v: unknown): string {\n  try {\n    return (\n      JSON.stringify(v, (_k, val) =>\n        isAsymmetric(val) ? val.toString() : typeof val === 'bigint' ? `${val}n` : val,\n      ) ?? String(v)\n    );\n  } catch {\n    return String(v);\n  }\n}\n\n/**\n * Recursive structural equality — replaces JSON.stringify comparison to\n * handle key-order differences and undefined values correctly.\n *\n * When the `b` (expected) side is an asymmetric marker, its `asymmetricMatch`\n * predicate decides the result instead of structural comparison — markers are\n * placeholders, not plain objects, so deep-comparing them never matches.\n */\nfunction deepEqual(a: unknown, b: unknown): boolean {\n  if (isAsymmetric(b)) return b.asymmetricMatch(a);\n  if (Object.is(a, b)) return true;\n  if (a === null || b === null) return false;\n  if (typeof a !== 'object' || typeof b !== 'object') return false;\n\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (!deepEqual(a[i], b[i])) return false;\n    }\n    return true;\n  }\n  if (Array.isArray(a) || Array.isArray(b)) return false;\n\n  const aObj = a as Record<string, unknown>;\n  const bObj = b as Record<string, unknown>;\n  const aKeys = Object.keys(aObj);\n  const bKeys = Object.keys(bObj);\n  if (aKeys.length !== bKeys.length) return false;\n  for (const key of aKeys) {\n    if (!Object.hasOwn(bObj, key)) return false;\n    if (!deepEqual(aObj[key], bObj[key])) return false;\n  }\n  return true;\n}\n\n/**\n * Partial-match: every key in `expected` must exist in `received` with a\n * recursively matching value. Extra keys in `received` are ignored.\n *\n * As in `deepEqual`, an asymmetric marker on the `expected` side delegates to\n * its `asymmetricMatch` predicate rather than being compared structurally.\n */\nfunction deepMatchObject(received: unknown, expected: unknown): boolean {\n  if (isAsymmetric(expected)) return expected.asymmetricMatch(received);\n  if (Object.is(received, expected)) return true;\n  if (expected === null || received === null) return Object.is(received, expected);\n  if (typeof expected !== 'object' || typeof received !== 'object')\n    return Object.is(received, expected);\n\n  if (Array.isArray(expected) && Array.isArray(received)) {\n    if (expected.length !== received.length) return false;\n    for (let i = 0; i < expected.length; i++) {\n      if (!deepMatchObject(received[i], expected[i])) return false;\n    }\n    return true;\n  }\n  if (Array.isArray(expected) || Array.isArray(received)) return false;\n\n  const expObj = expected as Record<string, unknown>;\n  const recObj = received as Record<string, unknown>;\n  for (const key of Object.keys(expObj)) {\n    if (!Object.hasOwn(recObj, key)) return false;\n    if (!deepMatchObject(recObj[key], expObj[key])) return false;\n  }\n  return true;\n}\n\n/**\n * Resolves a dot-separated property path on an object.\n * Returns `{ found: true, value }` or `{ found: false }`.\n */\nfunction resolvePath(obj: unknown, dotPath: string): { found: boolean; value?: unknown } {\n  const parts = dotPath.split('.');\n  let cur: unknown = obj;\n  for (const part of parts) {\n    if (cur === null || cur === undefined || typeof cur !== 'object') return { found: false };\n    const record = cur as Record<string, unknown>;\n    if (!Object.hasOwn(record, part)) return { found: false };\n    cur = record[part];\n  }\n  return { found: true, value: cur };\n}\n\n/* -------------------------------------------------------------------------- */\n/* Lightweight expect implementation                                           */\n/* -------------------------------------------------------------------------- */\n\n/** Thrown by expect matchers on failure. */\nclass AssertionError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'AssertionError';\n  }\n}\n\n/** Minimal expect builder compatible with Vitest's jest-style API. */\nclass Expectation {\n  #received: unknown;\n  #negated = false;\n\n  constructor(received: unknown) {\n    this.#received = received;\n  }\n\n  get not(): this {\n    const neg = new Expectation(this.#received) as this;\n    neg.#negated = true;\n    return neg;\n  }\n\n  #assert(pass: boolean, msg: string): void {\n    const actual = this.#negated ? !pass : pass;\n    if (!actual) {\n      throw new AssertionError(this.#negated ? `Expected NOT: ${msg}` : msg);\n    }\n  }\n\n  toBe(expected: unknown): void {\n    this.#assert(\n      Object.is(this.#received, expected),\n      `Expected ${String(expected)}, received ${String(this.#received)}`,\n    );\n  }\n\n  toEqual(expected: unknown): void {\n    this.#assert(\n      deepEqual(this.#received, expected),\n      `Expected ${JSON.stringify(expected)}, received ${JSON.stringify(this.#received)}`,\n    );\n  }\n\n  toBeTruthy(): void {\n    this.#assert(Boolean(this.#received), `Expected truthy, received ${String(this.#received)}`);\n  }\n\n  toBeFalsy(): void {\n    this.#assert(!this.#received, `Expected falsy, received ${String(this.#received)}`);\n  }\n\n  toBeNull(): void {\n    this.#assert(this.#received === null, `Expected null, received ${String(this.#received)}`);\n  }\n\n  toBeUndefined(): void {\n    this.#assert(\n      this.#received === undefined,\n      `Expected undefined, received ${String(this.#received)}`,\n    );\n  }\n\n  toBeGreaterThan(n: number): void {\n    this.#assert(\n      typeof this.#received === 'number' && this.#received > n,\n      `Expected > ${n}, received ${String(this.#received)}`,\n    );\n  }\n\n  toBeLessThan(n: number): void {\n    this.#assert(\n      typeof this.#received === 'number' && this.#received < n,\n      `Expected < ${n}, received ${String(this.#received)}`,\n    );\n  }\n\n  toContain(sub: unknown): void {\n    if (Array.isArray(this.#received)) {\n      this.#assert(\n        this.#received.includes(sub),\n        `Expected array to contain ${JSON.stringify(sub)}, received ${JSON.stringify(this.#received)}`,\n      );\n      return;\n    }\n    this.#assert(\n      typeof this.#received === 'string' && typeof sub === 'string' && this.#received.includes(sub),\n      `Expected to contain \"${String(sub)}\", received \"${String(this.#received)}\"`,\n    );\n  }\n\n  toThrow(msgFragment?: string): void {\n    if (typeof this.#received !== 'function') {\n      throw new AssertionError('toThrow: expected a function');\n    }\n    let threw = false;\n    let errorMsg = '';\n    try {\n      (this.#received as () => unknown)();\n    } catch (e) {\n      threw = true;\n      errorMsg = e instanceof Error ? e.message : String(e);\n    }\n    if (msgFragment !== undefined) {\n      this.#assert(\n        threw && errorMsg.includes(msgFragment),\n        `Expected to throw containing \"${msgFragment}\", got \"${errorMsg}\"`,\n      );\n    } else {\n      this.#assert(threw, 'Expected function to throw');\n    }\n  }\n\n  // ---- New matchers (devtools#683) -----------------------------------------\n\n  toMatchObject(expected: Record<string, unknown>): void {\n    this.#assert(\n      deepMatchObject(this.#received, expected),\n      `Expected object to match ${JSON.stringify(expected)}, received ${JSON.stringify(this.#received)}`,\n    );\n  }\n\n  toHaveProperty(dotPath: string, ...rest: unknown[]): void {\n    const { found, value: actual } = resolvePath(this.#received, dotPath);\n    if (rest.length > 0) {\n      const value = rest[0];\n      this.#assert(\n        found && deepEqual(actual, value),\n        `Expected property \"${dotPath}\" to equal ${JSON.stringify(value)}, got ${JSON.stringify(actual)}`,\n      );\n    } else {\n      this.#assert(found, `Expected property \"${dotPath}\" to exist`);\n    }\n  }\n\n  // The `abstract new (...args: never) => unknown` signature is the widest\n  // constructor type that TypeScript allows without explicit `any`. Real-world\n  // constructors like `ErrorConstructor` are assignable to it because `never`\n  // in parameter position is contravariant (any arg list satisfies `never[]`).\n  toBeInstanceOf(ctor: abstract new (...args: never) => unknown): void {\n    this.#assert(\n      this.#received instanceof (ctor as new (...args: unknown[]) => unknown),\n      `Expected instance of ${(ctor as { name?: string }).name ?? String(ctor)}, received ${String(this.#received)}`,\n    );\n  }\n\n  toBeTypeOf(typeStr: string): void {\n    this.#assert(\n      typeof this.#received === typeStr,\n      `Expected typeof \"${typeStr}\", received \"${typeof this.#received}\"`,\n    );\n  }\n\n  // ---- New matcher (devtools#807) -------------------------------------------\n\n  toHaveLength(n: number): void {\n    const length = (this.#received as { length?: unknown } | null | undefined)?.length;\n    this.#assert(\n      typeof length === 'number' && length === n,\n      `Expected length ${n}, received ${typeof length === 'number' ? length : String(this.#received)}`,\n    );\n  }\n}\n\n/**\n * The `expect` callable plus its asymmetric-matcher static surface\n * (`expect.any`, `expect.objectContaining`, …). The user file accesses these as\n * `expect.any(String)`; the vitest redirect (`bundle.ts`) re-exports `expect` by\n * reading `globalThis.expect`, so attaching the statics to this function object\n * makes them reachable through the getter (a function's own properties survive\n * the getter that returns the function itself).\n */\ninterface ExpectStatic {\n  (received: unknown): Expectation;\n  any(ctor: AnyCtor): AsymmetricMatcher;\n  anything(): AsymmetricMatcher;\n  objectContaining(expected: Record<string, unknown>): AsymmetricMatcher;\n  arrayContaining(expected: unknown[]): AsymmetricMatcher;\n  stringContaining(sub: string): AsymmetricMatcher;\n  stringMatching(re: string | RegExp): AsymmetricMatcher;\n}\n\n/** The `expect` function installed as a global. */\nconst expect: ExpectStatic = ((received: unknown): Expectation =>\n  new Expectation(received)) as ExpectStatic;\n\n// Asymmetric matcher statics — vitest-compatible surface (devtools#692).\nexpect.any = makeAny;\nexpect.anything = makeAnything;\nexpect.objectContaining = makeObjectContaining;\nexpect.arrayContaining = makeArrayContaining;\nexpect.stringContaining = makeStringContaining;\nexpect.stringMatching = makeStringMatching;\n\n/* -------------------------------------------------------------------------- */\n/* Vitest-4-compatible task context (devtools#746)                             */\n/* -------------------------------------------------------------------------- */\n\n/**\n * Internal sentinel thrown by `ctx.skip()` to unwind the test body early.\n * Caught by the run loop (never surfaced as a failure) — see `runTestModule`'s\n * test-execution `catch` branch.\n */\nclass InPageSkipSentinel {\n  constructor(readonly note: string | undefined) {}\n}\n\n/**\n * Minimal vitest-4-compatible task context passed as the first argument to a\n * test function, e.g. `it('...', async (ctx) => { ctx.skip(cond, note); })`.\n *\n * Real vitest's `TestContext` is much larger (`expect`, `onTestFailed`, …) —\n * this shim only implements what sdk-example's device-fixture suites actually\n * use: `ctx.skip` (vitest 4 semantics below) and a trivial `ctx.task.name`.\n */\nexport interface TestContext {\n  /**\n   * `ctx.skip()` (no args) unconditionally skips the remainder of the test\n   * body. `ctx.skip(cond, note)` skips only when `cond` is truthy; when falsy,\n   * this is a no-op and the body continues normally. Skipping throws an\n   * internal sentinel — do not catch `InPageSkipSentinel` in user code.\n   */\n  skip(condition?: boolean, note?: string): void;\n  /** Trivial task descriptor — nice-to-have, mirrors vitest's `ctx.task.name`. */\n  task: { name: string };\n}\n\nfunction _makeTestContext(name: string): TestContext {\n  return {\n    skip(condition?: boolean, note?: string): void {\n      if (condition === undefined || condition) {\n        throw new InPageSkipSentinel(note);\n      }\n    },\n    task: { name },\n  };\n}\n\n/* -------------------------------------------------------------------------- */\n/* describe / it / test registry                                               */\n/* -------------------------------------------------------------------------- */\n\n/** A test function as the user writes it — 0-arg or 1-arg (vitest task context). */\ntype TestFn = (ctx: TestContext) => void | Promise<void>;\n\ninterface PendingTest {\n  suitePath: string[];\n  name: string;\n  fn: TestFn;\n  skip: boolean;\n}\n\nconst _pendingTests: PendingTest[] = [];\nconst _suiteStack: string[] = [];\n\n/** Registers a suite scope; calls `fn` synchronously to collect inner tests. */\nfunction describe(name: string, fn: () => void): void {\n  _suiteStack.push(name);\n  fn();\n  _suiteStack.pop();\n}\n\n/** Registers a test. */\nfunction it(name: string, fn: TestFn): void {\n  _pendingTests.push({ suitePath: [..._suiteStack], name, fn, skip: false });\n}\n\n/** Alias for `it`. */\nconst test = it;\n\n/** Skipped test — registered but not executed. */\ndescribe.skip = (name: string, _fn: () => void): void => {\n  void name;\n};\nit.skip = (name: string, _fn?: TestFn): void => {\n  _pendingTests.push({ suitePath: [..._suiteStack], name, fn: () => {}, skip: true });\n};\ntest.skip = it.skip;\n\n/**\n * `it.skipIf(cond)(name, fn)` / `it.runIf(cond)(name, fn)` — conditional test\n * registration. `skipIf` skips when `cond` is truthy; `runIf` runs only when\n * `cond` is truthy (skips otherwise). sdk-example uses\n * `it.skipIf(cell.platform === 'mock')(...)` to skip real-SDK-only cases in env1.\n */\ntype ItRegistrar = (name: string, fn: TestFn) => void;\nfunction _conditionalIt(skip: boolean): ItRegistrar {\n  return (name, fn) => {\n    _pendingTests.push({ suitePath: [..._suiteStack], name, fn, skip });\n  };\n}\nit.skipIf = (cond: unknown): ItRegistrar => _conditionalIt(Boolean(cond));\nit.runIf = (cond: unknown): ItRegistrar => _conditionalIt(!cond);\ntest.skipIf = it.skipIf;\ntest.runIf = it.runIf;\n\n/**\n * `describe.skipIf(cond)(name, fn)` / `describe.runIf(cond)(name, fn)`.\n * When skipped, the suite body still runs to register its tests but every test\n * inside is marked skipped (collected via a temporary skip flag is overkill —\n * a skipped describe simply does not invoke its body, mirroring `describe.skip`).\n */\ntype DescribeRegistrar = (name: string, fn: () => void) => void;\ndescribe.skipIf = (cond: unknown): DescribeRegistrar =>\n  cond ? (name, _fn) => void name : (name, fn) => describe(name, fn);\ndescribe.runIf = (cond: unknown): DescribeRegistrar =>\n  cond ? (name, fn) => describe(name, fn) : (name, _fn) => void name;\n\n/* -------------------------------------------------------------------------- */\n/* Lifecycle hooks (devtools#683)                                              */\n/* -------------------------------------------------------------------------- */\n\ntype HookType = 'beforeAll' | 'afterAll' | 'beforeEach' | 'afterEach';\n\ninterface HookEntry {\n  /** Suite path at the time of registration ([] = module scope). */\n  suitePath: string[];\n  type: HookType;\n  fn: () => void | Promise<void>;\n}\n\nconst _hooks: HookEntry[] = [];\n\nfunction _registerHook(type: HookType, fn: () => void | Promise<void>): void {\n  _hooks.push({ suitePath: [..._suiteStack], type, fn });\n}\n\n/**\n * Returns hooks whose suitePath is a prefix of `testSuitePath`\n * (i.e. the hook's scope contains the test).\n */\nfunction _hooksFor(type: HookType, testSuitePath: string[]): Array<() => void | Promise<void>> {\n  return _hooks\n    .filter((h) => {\n      if (h.type !== type) return false;\n      // Hook scope must be a prefix of the test's suite path\n      if (h.suitePath.length > testSuitePath.length) return false;\n      for (let i = 0; i < h.suitePath.length; i++) {\n        if (h.suitePath[i] !== testSuitePath[i]) return false;\n      }\n      return true;\n    })\n    .map((h) => h.fn);\n}\n\n/** Runs an array of hook functions in order, awaiting each. */\nasync function _runHooks(fns: Array<() => void | Promise<void>>): Promise<Error | null> {\n  for (const fn of fns) {\n    try {\n      await fn();\n    } catch (e) {\n      return e instanceof Error ? e : new Error(String(e));\n    }\n  }\n  return null;\n}\n\nfunction beforeAll(fn: () => void | Promise<void>): void {\n  _registerHook('beforeAll', fn);\n}\nfunction afterAll(fn: () => void | Promise<void>): void {\n  _registerHook('afterAll', fn);\n}\nfunction beforeEach(fn: () => void | Promise<void>): void {\n  _registerHook('beforeEach', fn);\n}\nfunction afterEach(fn: () => void | Promise<void>): void {\n  _registerHook('afterEach', fn);\n}\n\n/* -------------------------------------------------------------------------- */\n/* vi shim (devtools#683)                                                      */\n/* -------------------------------------------------------------------------- */\n\ninterface SpyCall {\n  args: unknown[];\n  returnValue: unknown;\n}\n\ninterface MockFn<T extends unknown[], R> {\n  (...args: T): R;\n  mock: { calls: SpyCall[] };\n  mockImplementation(fn: (...args: T) => R): this;\n  mockReturnValue(value: R): this;\n  mockRestore(): void;\n}\n\ninterface SpyRecord {\n  obj: Record<string, unknown>;\n  method: string;\n  original: unknown;\n}\n\nconst _spyRegistry: SpyRecord[] = [];\n\nfunction _createMockFn<T extends unknown[], R>(impl?: (...args: T) => R): MockFn<T, R> {\n  let currentImpl: ((...args: T) => R) | undefined = impl;\n  const calls: SpyCall[] = [];\n\n  const mockFn = ((...args: T): R => {\n    const returnValue = currentImpl ? currentImpl(...args) : (undefined as unknown as R);\n    calls.push({ args, returnValue });\n    return returnValue;\n  }) as MockFn<T, R>;\n\n  mockFn.mock = { calls };\n\n  mockFn.mockImplementation = function (fn: (...args: T) => R): typeof mockFn {\n    currentImpl = fn;\n    return this;\n  };\n\n  mockFn.mockReturnValue = function (value: R): typeof mockFn {\n    currentImpl = () => value;\n    return this;\n  };\n\n  // No-op restore for standalone fn (only spyOn-created fns have a real restore)\n  mockFn.mockRestore = (): void => {};\n\n  return mockFn;\n}\n\nconst vi = {\n  /** Creates a spy on `obj[method]`, replacing it with a mock function. */\n  spyOn<T extends Record<string, unknown>, K extends keyof T>(\n    obj: T,\n    method: K,\n  ): MockFn<unknown[], unknown> {\n    const original = obj[method];\n    const spy = _createMockFn<unknown[], unknown>(\n      typeof original === 'function' ? (original as (...args: unknown[]) => unknown) : undefined,\n    );\n\n    spy.mockRestore = (): void => {\n      obj[method] = original as T[K];\n    };\n\n    _spyRegistry.push({ obj: obj as Record<string, unknown>, method: method as string, original });\n    obj[method] = spy as unknown as T[K];\n    return spy;\n  },\n\n  /** Creates a standalone mock function, optionally wrapping `impl`. */\n  fn<T extends unknown[], R>(impl?: (...args: T) => R): MockFn<T, R> {\n    return _createMockFn(impl);\n  },\n\n  /** Restores all spies created via `vi.spyOn` to their original values. */\n  restoreAllMocks(): void {\n    for (const { obj, method, original } of _spyRegistry) {\n      obj[method] = original;\n    }\n    _spyRegistry.length = 0;\n  },\n};\n\n/* -------------------------------------------------------------------------- */\n/* Runtime entry point                                                         */\n/* -------------------------------------------------------------------------- */\n\n/**\n * Runtime globals object — exported for direct use in unit tests so that\n * test factories can reference runtime's own `it`/`expect`/`beforeAll`/etc.\n * without depending on `globalThis` injection.\n *\n * In a real WebView bundle these are accessed via globals installed by\n * `runTestModule`; in Node tests, import from here directly.\n */\nexport const runtimeGlobals = {\n  describe,\n  it,\n  test,\n  expect,\n  beforeAll,\n  afterAll,\n  beforeEach,\n  afterEach,\n  vi,\n} as const;\n\n/**\n * Installs describe/it/test/expect/afterAll/afterEach/beforeAll/beforeEach/vi\n * as globals, invokes `moduleFactory` to register the user's tests, then\n * executes them and returns a RunReport.\n *\n * This function is exported as `__testBundle.runTestModule` by the IIFE wrapper\n * that bundle.ts generates. The Node-side rpc.ts calls it via `Runtime.evaluate`.\n *\n * @param moduleFactory - A zero-argument function that contains the user's\n *   top-level test code (describe/it/test calls). The bundler wraps the entire\n *   test module so that its top-level statements become the body of this factory.\n * @param opts - Test-only overrides (see {@link RunTestModuleOptions}). Never\n *   passed by the generated bundle (`rpc.ts#buildRunTestsExpression` calls\n *   `runTestModule(__userFactory)` with exactly one argument) — this second\n *   parameter exists so unit tests can inject a fake sleep and assert the\n *   THROTTLED-retry timing without real delays.\n */\nexport async function runTestModule(\n  moduleFactory?: () => void | Promise<void>,\n  opts?: RunTestModuleOptions,\n): Promise<RunReport> {\n  const sleep = opts?.sleep ?? DEFAULT_SLEEP;\n  // Reset state for re-entrant calls within the same page context.\n  _pendingTests.length = 0;\n  _suiteStack.length = 0;\n  _hooks.length = 0;\n  _spyRegistry.length = 0;\n\n  // Install globals that user test code expects.\n  type G = typeof globalThis & {\n    describe: typeof describe;\n    it: typeof it;\n    test: typeof test;\n    expect: typeof expect;\n    beforeAll: typeof beforeAll;\n    afterAll: typeof afterAll;\n    beforeEach: typeof beforeEach;\n    afterEach: typeof afterEach;\n    vi: typeof vi;\n  };\n  const g = globalThis as G;\n  g.describe = describe;\n  g.it = it;\n  g.test = test;\n  g.expect = expect;\n  g.beforeAll = beforeAll;\n  g.afterAll = afterAll;\n  g.beforeEach = beforeEach;\n  g.afterEach = afterEach;\n  g.vi = vi;\n\n  // Run the factory (which registers describe/it/test blocks via globals).\n  if (moduleFactory) {\n    await moduleFactory();\n  }\n\n  const wallStart = Date.now();\n  const startedAt = new Date(wallStart).toISOString();\n  const results: TestResult[] = [];\n\n  // Determine unique suite scopes from registered tests, in discovery order.\n  // We need to fire beforeAll/afterAll once per scope (grouped by suitePath).\n  //\n  // Simplified model: we run beforeAll hooks before the first test in a scope\n  // and afterAll hooks after the last test in a scope. Scope identity is the\n  // entire suitePath string (e.g. \"Suite A > Suite B\").\n  //\n  // For module-scope hooks (suitePath=[]), they wrap the entire test run.\n\n  // Group tests by their suite key to track beforeAll/afterAll per scope.\n  // We keep a Set of scopes for which beforeAll has been fired.\n  const firedBeforeAll = new Set<string>();\n  // Map from scope key → last index in _pendingTests that belongs to that scope.\n  const lastIndexForScope = new Map<string, number>();\n  for (let i = 0; i < _pendingTests.length; i++) {\n    const key = _pendingTests[i].suitePath.join('\\0');\n    lastIndexForScope.set(key, i);\n    // Also compute for parent scopes (module scope = '')\n    const path = _pendingTests[i].suitePath;\n    for (let depth = 0; depth < path.length; depth++) {\n      const parentKey = path.slice(0, depth).join('\\0');\n      const cur = lastIndexForScope.get(parentKey) ?? -1;\n      if (i > cur) lastIndexForScope.set(parentKey, i);\n    }\n  }\n  // Module scope key\n  const MODULE_KEY = '';\n  if (!lastIndexForScope.has(MODULE_KEY) && _pendingTests.length > 0) {\n    lastIndexForScope.set(MODULE_KEY, _pendingTests.length - 1);\n  }\n\n  // Fire module-scope beforeAll before any tests\n  if (_pendingTests.length > 0) {\n    const baFns = _hooksFor('beforeAll', []);\n    const baErr = await _runHooks(baFns);\n    firedBeforeAll.add(MODULE_KEY);\n    if (baErr) {\n      // If module beforeAll fails, mark all tests as failed.\n      for (const pending of _pendingTests) {\n        const fullName = [...pending.suitePath, pending.name].join(' > ');\n        results.push({\n          name: fullName,\n          status: 'fail',\n          duration: 0,\n          error: `beforeAll failed: ${baErr.message}`,\n        });\n      }\n      const duration = Date.now() - wallStart;\n      const passed = results.filter((r) => r.status === 'pass').length;\n      const failed = results.filter((r) => r.status === 'fail').length;\n      const skipped = results.filter((r) => r.status === 'skip').length;\n      // Still run module afterAll for cleanup (e.g. flushCapture)\n      const aaFns = _hooksFor('afterAll', []);\n      await _runHooks(aaFns);\n      return { startedAt, duration, passed, failed, skipped, tests: results };\n    }\n  }\n\n  // devtools#767 --pace: read the page-global __AIT_PACE_MS__ (injected by\n  // relay-factory.ts the same way __AIT_CELL__ is, via cell.ts#injectGlobals)\n  // ONCE per run. Absent/0 (the default) means zero behavior change — the\n  // wait below becomes a no-op sleep(0) that resolves on the next microtask\n  // tick, same as today's unpaced loop for every existing caller.\n  const paceMs = (() => {\n    const raw = (globalThis as { __AIT_PACE_MS__?: unknown }).__AIT_PACE_MS__;\n    return typeof raw === 'number' && raw > 0 ? raw : 0;\n  })();\n  let ranFirstTest = false;\n\n  for (let i = 0; i < _pendingTests.length; i++) {\n    const pending = _pendingTests[i];\n    const fullName = [...pending.suitePath, pending.name].join(' > ');\n\n    if (pending.skip) {\n      results.push({ name: fullName, status: 'skip', duration: 0 });\n      continue;\n    }\n\n    // --pace inter-test spacing: wait BEFORE every test after the first one\n    // that actually runs (skipped tests above never reach here). Mirrors the\n    // permission preflight's \"no wait before the first probe\" pacing model\n    // (cell.ts#buildPermissionPreflightExpression).\n    if (paceMs > 0 && ranFirstTest) {\n      await sleep(paceMs);\n    }\n    ranFirstTest = true;\n\n    // Fire suite-scoped beforeAll for any new scopes entered by this test\n    for (let depth = 1; depth <= pending.suitePath.length; depth++) {\n      const scopePath = pending.suitePath.slice(0, depth);\n      const scopeKey = scopePath.join('\\0');\n      if (!firedBeforeAll.has(scopeKey)) {\n        // Only hooks registered exactly at this scope (not broader/narrower)\n        const scopedFns = _hooks\n          .filter((h) => h.type === 'beforeAll' && h.suitePath.join('\\0') === scopeKey)\n          .map((h) => h.fn);\n        const baErr = await _runHooks(scopedFns);\n        firedBeforeAll.add(scopeKey);\n        if (baErr) {\n          // Mark remaining tests in this scope as failed\n          results.push({\n            name: fullName,\n            status: 'fail',\n            duration: 0,\n            error: `beforeAll failed: ${baErr.message}`,\n          });\n        }\n      }\n    }\n\n    // beforeEach\n    const beFns = _hooksFor('beforeEach', pending.suitePath);\n    const beErr = await _runHooks(beFns);\n\n    const tStart = Date.now();\n    let testErr: string | undefined;\n    let inPageSkip: InPageSkipSentinel | undefined;\n    let throttleRetries = 0;\n\n    if (beErr) {\n      testErr = `beforeEach failed: ${beErr.message}`;\n    } else {\n      // THROTTLED-aware retry (devtools#767): only the test BODY is retried —\n      // beforeEach (above) and afterEach (below) each run exactly once\n      // regardless of how many times the body is attempted. This keeps any\n      // capture-emitting hook (e.g. sdk-example's flushCapture) firing exactly\n      // once per test, so a retried body can never duplicate a capture record\n      // (see relay-worker.ts's harvesting model — it's a passive listener over\n      // the whole run, not a per-attempt flush/drain, so this invariant is what\n      // keeps a retry from polluting the capture stream).\n      for (let attempt = 0; ; attempt++) {\n        try {\n          await pending.fn(_makeTestContext(fullName));\n          testErr = undefined;\n          break;\n        } catch (e) {\n          if (e instanceof InPageSkipSentinel) {\n            inPageSkip = e;\n            break;\n          }\n          testErr = stringifyThrown(e);\n          if (isThrottledError(e) && attempt < TEST_MAX_RETRIES) {\n            throttleRetries += 1;\n            await sleep(TEST_RETRY_BACKOFF_MS[attempt]);\n            continue;\n          }\n          break;\n        }\n      }\n    }\n\n    // afterEach — always run even if test failed or was skipped mid-body.\n    const aeFns = _hooksFor('afterEach', pending.suitePath);\n    const aeErr = await _runHooks(aeFns);\n    if (aeErr && !testErr && !inPageSkip) testErr = `afterEach failed: ${aeErr.message}`;\n\n    if (inPageSkip) {\n      // ctx.skip() unwound the body — record as skipped (not pass/fail), same\n      // as the static it.skip path. The note (if any) rides on TestResult.note.\n      results.push({\n        name: fullName,\n        status: 'skip',\n        duration: Date.now() - tStart,\n        ...(inPageSkip.note !== undefined ? { note: inPageSkip.note } : {}),\n      });\n    } else if (testErr !== undefined) {\n      results.push({\n        name: fullName,\n        status: 'fail',\n        duration: Date.now() - tStart,\n        error: testErr,\n        ...(throttleRetries > 0 ? { throttleRetries } : {}),\n      });\n    } else {\n      results.push({\n        name: fullName,\n        status: 'pass',\n        duration: Date.now() - tStart,\n        ...(throttleRetries > 0 ? { throttleRetries } : {}),\n      });\n    }\n\n    // Fire suite-scoped afterAll when this is the last test in each scope\n    for (let depth = pending.suitePath.length; depth >= 1; depth--) {\n      const scopePath = pending.suitePath.slice(0, depth);\n      const scopeKey = scopePath.join('\\0');\n      const lastIdx = lastIndexForScope.get(scopeKey) ?? -1;\n      if (lastIdx === i) {\n        const scopedFns = _hooks\n          .filter((h) => h.type === 'afterAll' && h.suitePath.join('\\0') === scopeKey)\n          .map((h) => h.fn);\n        await _runHooks(scopedFns);\n      }\n    }\n  }\n\n  // Fire module-scope afterAll after all tests — critical for flushCapture\n  const moduleAfterAllFns = _hooks\n    .filter((h) => h.type === 'afterAll' && h.suitePath.length === 0)\n    .map((h) => h.fn);\n  await _runHooks(moduleAfterAllFns);\n\n  const duration = Date.now() - wallStart;\n  const passed = results.filter((r) => r.status === 'pass').length;\n  const failed = results.filter((r) => r.status === 'fail').length;\n  const skipped = results.filter((r) => r.status === 'skip').length;\n\n  return { startedAt, duration, passed, failed, skipped, tests: results };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA2EA,MAAM,wBAAwB,CAAC,KAAO,IAAM;;AAG5C,MAAM,mBAAmB,sBAAsB;;AAG/C,MAAM,iBAAiB,OACrB,IAAI,SAAS,YAAY,WAAW,SAAS,GAAG,CAAC;;;;;;;;;;;;;;;AA8BnD,SAAS,gBAAgB,GAAoB;AAC3C,KAAI,aAAa,MAAO,QAAO,EAAE;AACjC,KAAI,OAAO,MAAM,YAAY,MAAM,MAAM;EACvC,MAAM,MAAM;AACZ,MAAI,OAAO,IAAI,YAAY,SAAU,QAAO,IAAI;;AAElD,QAAO,OAAO,EAAE;;;;;;;;;AAclB,MAAM,mBAAmB;;AAkBzB,SAAS,aAAa,GAAoC;AACxD,QACE,OAAO,MAAM,YACb,MAAM,QACL,EAA8B,sBAAsB,QACrD,OAAQ,EAAoC,oBAAoB;;;;;;;;;;;AAgBpE,SAAS,QAAQ,MAAkC;CACjD,MAAM,OAAQ,KAA2B,QAAQ,OAAO,KAAK;CAC7D,MAAM,WAAW;AACjB,QAAO;GACJ,mBAAmB;EACpB,gBAAgB,OAAO,KAAK;EAC5B,gBAAgB,QAA0B;AACxC,OAAI,WAAW,QAAQ,WAAW,KAAA,EAAW,QAAO;AACpD,WAAQ,MAAR;IACE,KAAK,OACH,QAAO,OAAO,WAAW,YAAY,kBAAkB;IACzD,KAAK,OACH,QAAO,OAAO,WAAW,YAAY,kBAAkB;IACzD,KAAK,QACH,QAAO,OAAO,WAAW,aAAa,kBAAkB;IAC1D,KAAK,OACH,QAAO,OAAO,WAAW;IAC3B,KAAK,OACH,QAAO,OAAO,WAAW;IAC3B,KAAK,SACH,QAAO,OAAO,WAAW;IAC3B,KAAK,OAIH,QAAO,OAAO,WAAW;IAC3B,KAAK,MACH,QAAO,MAAM,QAAQ,OAAO;IAC9B,QACE,QAAO,WAAW,kBAAkB,WAAW;;;EAGtD;;;AAIH,SAAS,eAAkC;AACzC,QAAO;GACJ,mBAAmB;EACpB,gBAAgB;EAChB,kBAAkB,WAA6B,WAAW,QAAQ,WAAW,KAAA;EAC9E;;;AAIH,SAAS,qBAAqB,UAAsD;AAClF,QAAO;GACJ,mBAAmB;EACpB,gBAAgB,oBAAoB,cAAc,SAAS,CAAC;EAC5D,kBAAkB,WAA6B,gBAAgB,QAAQ,SAAS;EACjF;;;AAIH,SAAS,oBAAoB,UAAwC;AACnE,QAAO;GACJ,mBAAmB;EACpB,gBAAgB,mBAAmB,cAAc,SAAS,CAAC;EAC3D,gBAAgB,QAA0B;AACxC,OAAI,CAAC,MAAM,QAAQ,OAAO,CAAE,QAAO;AACnC,UAAO,SAAS,OAAO,QACrB,OAAO,MAAM,QAAS,aAAa,IAAI,GAAG,IAAI,gBAAgB,IAAI,GAAG,UAAU,KAAK,IAAI,CAAE,CAC3F;;EAEJ;;;AAIH,SAAS,qBAAqB,KAAgC;AAC5D,QAAO;GACJ,mBAAmB;EACpB,gBAAgB,oBAAoB,IAAI;EACxC,kBAAkB,WAChB,OAAO,WAAW,YAAY,OAAO,SAAS,IAAI;EACrD;;;AAIH,SAAS,mBAAmB,IAAwC;CAClE,MAAM,UAAU,OAAO,OAAO,WAAW,IAAI,OAAO,GAAG,GAAG;AAC1D,QAAO;GACJ,mBAAmB;EACpB,gBAAgB,kBAAkB,OAAO,QAAQ,CAAC;EAClD,kBAAkB,WAChB,OAAO,WAAW,YAAY,QAAQ,KAAK,OAAO;EACrD;;;AAQH,SAAS,cAAc,GAAoB;AACzC,KAAI;AACF,SACE,KAAK,UAAU,IAAI,IAAI,QACrB,aAAa,IAAI,GAAG,IAAI,UAAU,GAAG,OAAO,QAAQ,WAAW,GAAG,IAAI,KAAK,IAC5E,IAAI,OAAO,EAAE;SAEV;AACN,SAAO,OAAO,EAAE;;;;;;;;;;;AAYpB,SAAS,UAAU,GAAY,GAAqB;AAClD,KAAI,aAAa,EAAE,CAAE,QAAO,EAAE,gBAAgB,EAAE;AAChD,KAAI,OAAO,GAAG,GAAG,EAAE,CAAE,QAAO;AAC5B,KAAI,MAAM,QAAQ,MAAM,KAAM,QAAO;AACrC,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO;AAE3D,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,EAAE;AACxC,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,KAAI,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,CAAE,QAAO;AAErC,SAAO;;AAET,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,CAAE,QAAO;CAEjD,MAAM,OAAO;CACb,MAAM,OAAO;CACb,MAAM,QAAQ,OAAO,KAAK,KAAK;CAC/B,MAAM,QAAQ,OAAO,KAAK,KAAK;AAC/B,KAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAC1C,MAAK,MAAM,OAAO,OAAO;AACvB,MAAI,CAAC,OAAO,OAAO,MAAM,IAAI,CAAE,QAAO;AACtC,MAAI,CAAC,UAAU,KAAK,MAAM,KAAK,KAAK,CAAE,QAAO;;AAE/C,QAAO;;;;;;;;;AAUT,SAAS,gBAAgB,UAAmB,UAA4B;AACtE,KAAI,aAAa,SAAS,CAAE,QAAO,SAAS,gBAAgB,SAAS;AACrE,KAAI,OAAO,GAAG,UAAU,SAAS,CAAE,QAAO;AAC1C,KAAI,aAAa,QAAQ,aAAa,KAAM,QAAO,OAAO,GAAG,UAAU,SAAS;AAChF,KAAI,OAAO,aAAa,YAAY,OAAO,aAAa,SACtD,QAAO,OAAO,GAAG,UAAU,SAAS;AAEtC,KAAI,MAAM,QAAQ,SAAS,IAAI,MAAM,QAAQ,SAAS,EAAE;AACtD,MAAI,SAAS,WAAW,SAAS,OAAQ,QAAO;AAChD,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI,CAAC,gBAAgB,SAAS,IAAI,SAAS,GAAG,CAAE,QAAO;AAEzD,SAAO;;AAET,KAAI,MAAM,QAAQ,SAAS,IAAI,MAAM,QAAQ,SAAS,CAAE,QAAO;CAE/D,MAAM,SAAS;CACf,MAAM,SAAS;AACf,MAAK,MAAM,OAAO,OAAO,KAAK,OAAO,EAAE;AACrC,MAAI,CAAC,OAAO,OAAO,QAAQ,IAAI,CAAE,QAAO;AACxC,MAAI,CAAC,gBAAgB,OAAO,MAAM,OAAO,KAAK,CAAE,QAAO;;AAEzD,QAAO;;;;;;AAOT,SAAS,YAAY,KAAc,SAAsD;CACvF,MAAM,QAAQ,QAAQ,MAAM,IAAI;CAChC,IAAI,MAAe;AACnB,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,QAAQ,QAAQ,QAAQ,KAAA,KAAa,OAAO,QAAQ,SAAU,QAAO,EAAE,OAAO,OAAO;EACzF,MAAM,SAAS;AACf,MAAI,CAAC,OAAO,OAAO,QAAQ,KAAK,CAAE,QAAO,EAAE,OAAO,OAAO;AACzD,QAAM,OAAO;;AAEf,QAAO;EAAE,OAAO;EAAM,OAAO;EAAK;;;AAQpC,IAAM,iBAAN,cAA6B,MAAM;CACjC,YAAY,SAAiB;AAC3B,QAAM,QAAQ;AACd,OAAK,OAAO;;;;AAKhB,IAAM,cAAN,MAAM,YAAY;CAChB;CACA,WAAW;CAEX,YAAY,UAAmB;AAC7B,QAAA,WAAiB;;CAGnB,IAAI,MAAY;EACd,MAAM,MAAM,IAAI,YAAY,MAAA,SAAe;AAC3C,OAAA,UAAe;AACf,SAAO;;CAGT,QAAQ,MAAe,KAAmB;AAExC,MAAI,EADW,MAAA,UAAgB,CAAC,OAAO,MAErC,OAAM,IAAI,eAAe,MAAA,UAAgB,iBAAiB,QAAQ,IAAI;;CAI1E,KAAK,UAAyB;AAC5B,QAAA,OACE,OAAO,GAAG,MAAA,UAAgB,SAAS,EACnC,YAAY,OAAO,SAAS,CAAC,aAAa,OAAO,MAAA,SAAe,GACjE;;CAGH,QAAQ,UAAyB;AAC/B,QAAA,OACE,UAAU,MAAA,UAAgB,SAAS,EACnC,YAAY,KAAK,UAAU,SAAS,CAAC,aAAa,KAAK,UAAU,MAAA,SAAe,GACjF;;CAGH,aAAmB;AACjB,QAAA,OAAa,QAAQ,MAAA,SAAe,EAAE,6BAA6B,OAAO,MAAA,SAAe,GAAG;;CAG9F,YAAkB;AAChB,QAAA,OAAa,CAAC,MAAA,UAAgB,4BAA4B,OAAO,MAAA,SAAe,GAAG;;CAGrF,WAAiB;AACf,QAAA,OAAa,MAAA,aAAmB,MAAM,2BAA2B,OAAO,MAAA,SAAe,GAAG;;CAG5F,gBAAsB;AACpB,QAAA,OACE,MAAA,aAAmB,KAAA,GACnB,gCAAgC,OAAO,MAAA,SAAe,GACvD;;CAGH,gBAAgB,GAAiB;AAC/B,QAAA,OACE,OAAO,MAAA,aAAmB,YAAY,MAAA,WAAiB,GACvD,cAAc,EAAE,aAAa,OAAO,MAAA,SAAe,GACpD;;CAGH,aAAa,GAAiB;AAC5B,QAAA,OACE,OAAO,MAAA,aAAmB,YAAY,MAAA,WAAiB,GACvD,cAAc,EAAE,aAAa,OAAO,MAAA,SAAe,GACpD;;CAGH,UAAU,KAAoB;AAC5B,MAAI,MAAM,QAAQ,MAAA,SAAe,EAAE;AACjC,SAAA,OACE,MAAA,SAAe,SAAS,IAAI,EAC5B,6BAA6B,KAAK,UAAU,IAAI,CAAC,aAAa,KAAK,UAAU,MAAA,SAAe,GAC7F;AACD;;AAEF,QAAA,OACE,OAAO,MAAA,aAAmB,YAAY,OAAO,QAAQ,YAAY,MAAA,SAAe,SAAS,IAAI,EAC7F,wBAAwB,OAAO,IAAI,CAAC,eAAe,OAAO,MAAA,SAAe,CAAC,GAC3E;;CAGH,QAAQ,aAA4B;AAClC,MAAI,OAAO,MAAA,aAAmB,WAC5B,OAAM,IAAI,eAAe,+BAA+B;EAE1D,IAAI,QAAQ;EACZ,IAAI,WAAW;AACf,MAAI;AACD,SAAA,UAAkC;WAC5B,GAAG;AACV,WAAQ;AACR,cAAW,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE;;AAEvD,MAAI,gBAAgB,KAAA,EAClB,OAAA,OACE,SAAS,SAAS,SAAS,YAAY,EACvC,iCAAiC,YAAY,UAAU,SAAS,GACjE;MAED,OAAA,OAAa,OAAO,6BAA6B;;CAMrD,cAAc,UAAyC;AACrD,QAAA,OACE,gBAAgB,MAAA,UAAgB,SAAS,EACzC,4BAA4B,KAAK,UAAU,SAAS,CAAC,aAAa,KAAK,UAAU,MAAA,SAAe,GACjG;;CAGH,eAAe,SAAiB,GAAG,MAAuB;EACxD,MAAM,EAAE,OAAO,OAAO,WAAW,YAAY,MAAA,UAAgB,QAAQ;AACrE,MAAI,KAAK,SAAS,GAAG;GACnB,MAAM,QAAQ,KAAK;AACnB,SAAA,OACE,SAAS,UAAU,QAAQ,MAAM,EACjC,sBAAsB,QAAQ,aAAa,KAAK,UAAU,MAAM,CAAC,QAAQ,KAAK,UAAU,OAAO,GAChG;QAED,OAAA,OAAa,OAAO,sBAAsB,QAAQ,YAAY;;CAQlE,eAAe,MAAsD;AACnE,QAAA,OACE,MAAA,oBAA2B,MAC3B,wBAAyB,KAA2B,QAAQ,OAAO,KAAK,CAAC,aAAa,OAAO,MAAA,SAAe,GAC7G;;CAGH,WAAW,SAAuB;AAChC,QAAA,OACE,OAAO,MAAA,aAAmB,SAC1B,oBAAoB,QAAQ,eAAe,OAAO,MAAA,SAAe,GAClE;;CAKH,aAAa,GAAiB;EAC5B,MAAM,SAAU,MAAA,UAA4D;AAC5E,QAAA,OACE,OAAO,WAAW,YAAY,WAAW,GACzC,mBAAmB,EAAE,aAAa,OAAO,WAAW,WAAW,SAAS,OAAO,MAAA,SAAe,GAC/F;;;;AAuBL,MAAM,WAAyB,aAC7B,IAAI,YAAY,SAAS;AAG3B,OAAO,MAAM;AACb,OAAO,WAAW;AAClB,OAAO,mBAAmB;AAC1B,OAAO,kBAAkB;AACzB,OAAO,mBAAmB;AAC1B,OAAO,iBAAiB;;;;;;AAWxB,IAAM,qBAAN,MAAyB;CACvB,YAAY,MAAmC;AAA1B,OAAA,OAAA;;;AAuBvB,SAAS,iBAAiB,MAA2B;AACnD,QAAO;EACL,KAAK,WAAqB,MAAqB;AAC7C,OAAI,cAAc,KAAA,KAAa,UAC7B,OAAM,IAAI,mBAAmB,KAAK;;EAGtC,MAAM,EAAE,MAAM;EACf;;AAiBH,MAAM,gBAA+B,EAAE;AACvC,MAAM,cAAwB,EAAE;;AAGhC,SAAS,SAAS,MAAc,IAAsB;AACpD,aAAY,KAAK,KAAK;AACtB,KAAI;AACJ,aAAY,KAAK;;;AAInB,SAAS,GAAG,MAAc,IAAkB;AAC1C,eAAc,KAAK;EAAE,WAAW,CAAC,GAAG,YAAY;EAAE;EAAM;EAAI,MAAM;EAAO,CAAC;;;AAI5E,MAAM,OAAO;;AAGb,SAAS,QAAQ,MAAc,QAA0B;AAGzD,GAAG,QAAQ,MAAc,QAAuB;AAC9C,eAAc,KAAK;EAAE,WAAW,CAAC,GAAG,YAAY;EAAE;EAAM,UAAU;EAAI,MAAM;EAAM,CAAC;;AAErF,KAAK,OAAO,GAAG;AASf,SAAS,eAAe,MAA4B;AAClD,SAAQ,MAAM,OAAO;AACnB,gBAAc,KAAK;GAAE,WAAW,CAAC,GAAG,YAAY;GAAE;GAAM;GAAI;GAAM,CAAC;;;AAGvE,GAAG,UAAU,SAA+B,eAAe,QAAQ,KAAK,CAAC;AACzE,GAAG,SAAS,SAA+B,eAAe,CAAC,KAAK;AAChE,KAAK,SAAS,GAAG;AACjB,KAAK,QAAQ,GAAG;AAShB,SAAS,UAAU,SACjB,QAAQ,MAAM,QAAQ,KAAK,KAAQ,MAAM,OAAO,SAAS,MAAM,GAAG;AACpE,SAAS,SAAS,SAChB,QAAQ,MAAM,OAAO,SAAS,MAAM,GAAG,IAAI,MAAM,QAAQ,KAAK;AAehE,MAAM,SAAsB,EAAE;AAE9B,SAAS,cAAc,MAAgB,IAAsC;AAC3E,QAAO,KAAK;EAAE,WAAW,CAAC,GAAG,YAAY;EAAE;EAAM;EAAI,CAAC;;;;;;AAOxD,SAAS,UAAU,MAAgB,eAA4D;AAC7F,QAAO,OACJ,QAAQ,MAAM;AACb,MAAI,EAAE,SAAS,KAAM,QAAO;AAE5B,MAAI,EAAE,UAAU,SAAS,cAAc,OAAQ,QAAO;AACtD,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,UAAU,QAAQ,IACtC,KAAI,EAAE,UAAU,OAAO,cAAc,GAAI,QAAO;AAElD,SAAO;GACP,CACD,KAAK,MAAM,EAAE,GAAG;;;AAIrB,eAAe,UAAU,KAA+D;AACtF,MAAK,MAAM,MAAM,IACf,KAAI;AACF,QAAM,IAAI;UACH,GAAG;AACV,SAAO,aAAa,QAAQ,IAAI,IAAI,MAAM,OAAO,EAAE,CAAC;;AAGxD,QAAO;;AAGT,SAAS,UAAU,IAAsC;AACvD,eAAc,aAAa,GAAG;;AAEhC,SAAS,SAAS,IAAsC;AACtD,eAAc,YAAY,GAAG;;AAE/B,SAAS,WAAW,IAAsC;AACxD,eAAc,cAAc,GAAG;;AAEjC,SAAS,UAAU,IAAsC;AACvD,eAAc,aAAa,GAAG;;AA0BhC,MAAM,eAA4B,EAAE;AAEpC,SAAS,cAAsC,MAAwC;CACrF,IAAI,cAA+C;CACnD,MAAM,QAAmB,EAAE;CAE3B,MAAM,WAAW,GAAG,SAAe;EACjC,MAAM,cAAc,cAAc,YAAY,GAAG,KAAK,GAAI,KAAA;AAC1D,QAAM,KAAK;GAAE;GAAM;GAAa,CAAC;AACjC,SAAO;;AAGT,QAAO,OAAO,EAAE,OAAO;AAEvB,QAAO,qBAAqB,SAAU,IAAsC;AAC1E,gBAAc;AACd,SAAO;;AAGT,QAAO,kBAAkB,SAAU,OAAyB;AAC1D,sBAAoB;AACpB,SAAO;;AAIT,QAAO,oBAA0B;AAEjC,QAAO;;AAGT,MAAM,KAAK;CAET,MACE,KACA,QAC4B;EAC5B,MAAM,WAAW,IAAI;EACrB,MAAM,MAAM,cACV,OAAO,aAAa,aAAc,WAA+C,KAAA,EAClF;AAED,MAAI,oBAA0B;AAC5B,OAAI,UAAU;;AAGhB,eAAa,KAAK;GAAO;GAAwC;GAAkB;GAAU,CAAC;AAC9F,MAAI,UAAU;AACd,SAAO;;CAIT,GAA2B,MAAwC;AACjE,SAAO,cAAc,KAAK;;CAI5B,kBAAwB;AACtB,OAAK,MAAM,EAAE,KAAK,QAAQ,cAAc,aACtC,KAAI,UAAU;AAEhB,eAAa,SAAS;;CAEzB;;;;;;;;;AAcD,MAAa,iBAAiB;CAC5B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD;;;;;;;;;;;;;;;;;;AAmBD,eAAsB,cACpB,eACA,MACoB;CACpB,MAAM,QAAQ,MAAM,SAAS;AAE7B,eAAc,SAAS;AACvB,aAAY,SAAS;AACrB,QAAO,SAAS;AAChB,cAAa,SAAS;CActB,MAAM,IAAI;AACV,GAAE,WAAW;AACb,GAAE,KAAK;AACP,GAAE,OAAO;AACT,GAAE,SAAS;AACX,GAAE,YAAY;AACd,GAAE,WAAW;AACb,GAAE,aAAa;AACf,GAAE,YAAY;AACd,GAAE,KAAK;AAGP,KAAI,cACF,OAAM,eAAe;CAGvB,MAAM,YAAY,KAAK,KAAK;CAC5B,MAAM,YAAY,IAAI,KAAK,UAAU,CAAC,aAAa;CACnD,MAAM,UAAwB,EAAE;CAahC,MAAM,iCAAiB,IAAI,KAAa;CAExC,MAAM,oCAAoB,IAAI,KAAqB;AACnD,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;EAC7C,MAAM,MAAM,cAAc,GAAG,UAAU,KAAK,KAAK;AACjD,oBAAkB,IAAI,KAAK,EAAE;EAE7B,MAAM,OAAO,cAAc,GAAG;AAC9B,OAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;GAChD,MAAM,YAAY,KAAK,MAAM,GAAG,MAAM,CAAC,KAAK,KAAK;GACjD,MAAM,MAAM,kBAAkB,IAAI,UAAU,IAAI;AAChD,OAAI,IAAI,IAAK,mBAAkB,IAAI,WAAW,EAAE;;;CAIpD,MAAM,aAAa;AACnB,KAAI,CAAC,kBAAkB,IAAI,WAAW,IAAI,cAAc,SAAS,EAC/D,mBAAkB,IAAI,YAAY,cAAc,SAAS,EAAE;AAI7D,KAAI,cAAc,SAAS,GAAG;EAE5B,MAAM,QAAQ,MAAM,UADN,UAAU,aAAa,EAAE,CAAC,CACJ;AACpC,iBAAe,IAAI,WAAW;AAC9B,MAAI,OAAO;AAET,QAAK,MAAM,WAAW,eAAe;IACnC,MAAM,WAAW,CAAC,GAAG,QAAQ,WAAW,QAAQ,KAAK,CAAC,KAAK,MAAM;AACjE,YAAQ,KAAK;KACX,MAAM;KACN,QAAQ;KACR,UAAU;KACV,OAAO,qBAAqB,MAAM;KACnC,CAAC;;GAEJ,MAAM,WAAW,KAAK,KAAK,GAAG;GAC9B,MAAM,SAAS,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC;GAC1D,MAAM,SAAS,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC;GAC1D,MAAM,UAAU,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC;AAG3D,SAAM,UADQ,UAAU,YAAY,EAAE,CAAC,CACjB;AACtB,UAAO;IAAE;IAAW;IAAU;IAAQ;IAAQ;IAAS,OAAO;IAAS;;;CAS3E,MAAM,gBAAgB;EACpB,MAAM,MAAO,WAA6C;AAC1D,SAAO,OAAO,QAAQ,YAAY,MAAM,IAAI,MAAM;KAChD;CACJ,IAAI,eAAe;AAEnB,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;EAC7C,MAAM,UAAU,cAAc;EAC9B,MAAM,WAAW,CAAC,GAAG,QAAQ,WAAW,QAAQ,KAAK,CAAC,KAAK,MAAM;AAEjE,MAAI,QAAQ,MAAM;AAChB,WAAQ,KAAK;IAAE,MAAM;IAAU,QAAQ;IAAQ,UAAU;IAAG,CAAC;AAC7D;;AAOF,MAAI,SAAS,KAAK,aAChB,OAAM,MAAM,OAAO;AAErB,iBAAe;AAGf,OAAK,IAAI,QAAQ,GAAG,SAAS,QAAQ,UAAU,QAAQ,SAAS;GAE9D,MAAM,WADY,QAAQ,UAAU,MAAM,GAAG,MAAM,CACxB,KAAK,KAAK;AACrC,OAAI,CAAC,eAAe,IAAI,SAAS,EAAE;IAKjC,MAAM,QAAQ,MAAM,UAHF,OACf,QAAQ,MAAM,EAAE,SAAS,eAAe,EAAE,UAAU,KAAK,KAAK,KAAK,SAAS,CAC5E,KAAK,MAAM,EAAE,GAAG,CACqB;AACxC,mBAAe,IAAI,SAAS;AAC5B,QAAI,MAEF,SAAQ,KAAK;KACX,MAAM;KACN,QAAQ;KACR,UAAU;KACV,OAAO,qBAAqB,MAAM;KACnC,CAAC;;;EAOR,MAAM,QAAQ,MAAM,UADN,UAAU,cAAc,QAAQ,UAAU,CACpB;EAEpC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI;EACJ,IAAI;EACJ,IAAI,kBAAkB;AAEtB,MAAI,MACF,WAAU,sBAAsB,MAAM;MAUtC,MAAK,IAAI,UAAU,IAAK,UACtB,KAAI;AACF,SAAM,QAAQ,GAAG,iBAAiB,SAAS,CAAC;AAC5C,aAAU,KAAA;AACV;WACO,GAAG;AACV,OAAI,aAAa,oBAAoB;AACnC,iBAAa;AACb;;AAEF,aAAU,gBAAgB,EAAE;AAC5B,OAAI,iBAAiB,EAAE,IAAI,UAAU,kBAAkB;AACrD,uBAAmB;AACnB,UAAM,MAAM,sBAAsB,SAAS;AAC3C;;AAEF;;EAON,MAAM,QAAQ,MAAM,UADN,UAAU,aAAa,QAAQ,UAAU,CACnB;AACpC,MAAI,SAAS,CAAC,WAAW,CAAC,WAAY,WAAU,qBAAqB,MAAM;AAE3E,MAAI,WAGF,SAAQ,KAAK;GACX,MAAM;GACN,QAAQ;GACR,UAAU,KAAK,KAAK,GAAG;GACvB,GAAI,WAAW,SAAS,KAAA,IAAY,EAAE,MAAM,WAAW,MAAM,GAAG,EAAE;GACnE,CAAC;WACO,YAAY,KAAA,EACrB,SAAQ,KAAK;GACX,MAAM;GACN,QAAQ;GACR,UAAU,KAAK,KAAK,GAAG;GACvB,OAAO;GACP,GAAI,kBAAkB,IAAI,EAAE,iBAAiB,GAAG,EAAE;GACnD,CAAC;MAEF,SAAQ,KAAK;GACX,MAAM;GACN,QAAQ;GACR,UAAU,KAAK,KAAK,GAAG;GACvB,GAAI,kBAAkB,IAAI,EAAE,iBAAiB,GAAG,EAAE;GACnD,CAAC;AAIJ,OAAK,IAAI,QAAQ,QAAQ,UAAU,QAAQ,SAAS,GAAG,SAAS;GAE9D,MAAM,WADY,QAAQ,UAAU,MAAM,GAAG,MAAM,CACxB,KAAK,KAAK;AAErC,QADgB,kBAAkB,IAAI,SAAS,IAAI,QACnC,EAId,OAAM,UAHY,OACf,QAAQ,MAAM,EAAE,SAAS,cAAc,EAAE,UAAU,KAAK,KAAK,KAAK,SAAS,CAC3E,KAAK,MAAM,EAAE,GAAG,CACO;;;AAShC,OAAM,UAHoB,OACvB,QAAQ,MAAM,EAAE,SAAS,cAAc,EAAE,UAAU,WAAW,EAAE,CAChE,KAAK,MAAM,EAAE,GAAG,CACe;AAOlC,QAAO;EAAE;EAAW,UALH,KAAK,KAAK,GAAG;EAKA,QAJf,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC;EAIpB,QAHvB,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC;EAGZ,SAF9B,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC;EAEJ,OAAO;EAAS"}

package/dist/test-runner/task-graph.d.ts

@@ -1,38 +0,0 @@
-import { t as RunReport } from "../runtime-kn9DxOeg.js";
-import { File, TaskEventPack, TaskResultPack } from "@vitest/runner";
-
-//#region src/test-runner/task-graph.d.ts
-/**
- * Rebuilds a single `File` task graph from one file's flat `RunReport`.
- *
- * @param filepath    Absolute path to the test file.
- * @param root        Project root (used for the file id hash).
- * @param projectName Vitest project name (or undefined for the default project).
- * @param pool        Pool name to stamp on the file task (our relay pool name).
- * @param report      The page-runtime report for this file.
- */
-declare function synthesizeFileTask(filepath: string, root: string, projectName: string | undefined, pool: string, report: RunReport): File;
-/**
- * Flattens a File task subtree into the {@link TaskResultPack} tuples Vitest's
- * `state.updateTasks` consumes: `[id, result, meta]`.
- *
- * Includes every task (file, suites, tests). Suites/files without a result
- * report `undefined` in the result slot — Vitest tolerates that.
- */
-declare function toTaskResultPacks(file: File): TaskResultPack[];
-/**
- * Builds the {@link TaskEventPack} sequence reporters expect: a `suite-prepare`
- * before a suite's children, `test-prepare`/`test-finished` per test, and a
- * `suite-finished` after. This drives reporter progress output.
- */
-declare function toTaskEventPacks(file: File): TaskEventPack[];
-/**
- * Deterministic synthetic id for a file that failed before any task graph could
- * be built (bundle/inject error). Uses the same `generateHash` Vitest uses, on
- * the root-relative path + projectName, matching `generateFileHash` semantics so
- * the id is stable across runs and won't collide with real file ids.
- */
-declare function syntheticFileId(relativePath: string, projectName: string | undefined): string;
-//#endregion
-export { synthesizeFileTask, syntheticFileId, toTaskEventPacks, toTaskResultPacks };
-//# sourceMappingURL=task-graph.d.ts.map

package/dist/test-runner/task-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"task-graph.d.ts","names":[],"sources":["../../src/test-runner/task-graph.ts"],"mappings":";;;;AA6MA;;;;;;;;;AAAA,iBA5DgB,kBAAA,CACd,QAAA,UACA,IAAA,UACA,WAAA,sBACA,IAAA,UACA,MAAA,EAAQ,SAAA,GACP,IAAA;;;;;;;;iBAmCa,iBAAA,CAAkB,IAAA,EAAM,IAAA,GAAO,cAAA;;;;;;iBAmB/B,gBAAA,CAAiB,IAAA,EAAM,IAAA,GAAO,aAAA;;;;;;;iBAgC9B,eAAA,CAAgB,YAAA,UAAsB,WAAA"}

package/dist/test-runner/task-graph.js

@@ -1,182 +0,0 @@
-import { calculateSuiteHash, createFileTask, generateHash } from "@vitest/runner/utils";
-//#region src/test-runner/task-graph.ts
-/** Separator the page runtime uses to join suite path + test name. */
-const NAME_SEPARATOR = " > ";
-/**
-* Maps a page-runtime status to a Vitest {@link TaskState}.
-* `skip` collapses to Vitest's `skip` run-mode; `pass`/`fail` are terminal.
-*/
-function toTaskState(status) {
-	switch (status) {
-		case "pass": return "pass";
-		case "fail": return "fail";
-		case "skip": return "skip";
-	}
-}
-/**
-* Builds a {@link TaskResult} for a finished test. Suites and files only carry
-* a result on collection/hook error (we leave those undefined — the page never
-* reports suite-level errors separately).
-*/
-function toTaskResult(t) {
-	const result = {
-		state: toTaskState(t.status),
-		duration: t.duration
-	};
-	if (t.status === "fail") result.errors = [{
-		message: t.error ?? "Test failed",
-		name: "AssertionError"
-	}];
-	return result;
-}
-/**
-* Creates a structural suite task under `parent`. Mirrors the partial-object
-* pattern Vitest uses in `createFileTask`; ids are assigned by
-* `calculateSuiteHash` afterwards.
-*/
-function makeSuite(parent, file, name) {
-	return {
-		id: "",
-		type: "suite",
-		name,
-		fullName: "",
-		mode: "run",
-		meta: {},
-		file,
-		suite: parent,
-		tasks: []
-	};
-}
-/**
-* Finds-or-creates a child suite named `name` under `parent`.
-* The caller recomputes ids once the whole file tree is built.
-*/
-function ensureSuite(parent, file, name) {
-	const existing = parent.tasks.find((t) => t.type === "suite" && t.name === name);
-	if (existing) return existing;
-	const suite = makeSuite(parent, file, name);
-	parent.tasks.push(suite);
-	return suite;
-}
-/**
-* Creates a structural test task and appends it to `parent`.
-*
-* `Test` carries runtime-only required fields (context/timeout/annotations/
-* artifacts) that are never read off a *reported* task — reporters consume
-* id/name/type/mode/result/suite/file. We satisfy the type at this one cast
-* boundary instead of fabricating fake runtime values.
-*/
-function appendTest(parent, file, t, name) {
-	const test = {
-		id: "",
-		type: "test",
-		name,
-		fullName: "",
-		mode: t.status === "skip" ? "skip" : "run",
-		meta: {},
-		file,
-		suite: parent,
-		result: toTaskResult(t),
-		annotations: []
-	};
-	parent.tasks.push(test);
-}
-/**
-* Rebuilds a single `File` task graph from one file's flat `RunReport`.
-*
-* @param filepath    Absolute path to the test file.
-* @param root        Project root (used for the file id hash).
-* @param projectName Vitest project name (or undefined for the default project).
-* @param pool        Pool name to stamp on the file task (our relay pool name).
-* @param report      The page-runtime report for this file.
-*/
-function synthesizeFileTask(filepath, root, projectName, pool, report) {
-	const file = createFileTask(filepath, root, projectName, pool);
-	for (const t of report.tests) {
-		const segments = t.name.split(NAME_SEPARATOR);
-		const testName = segments.pop() ?? t.name;
-		let parent = file;
-		for (const suiteName of segments) parent = ensureSuite(parent, file, suiteName);
-		appendTest(parent, file, t, testName);
-	}
-	calculateSuiteHash(file);
-	if (report.tests.length === 0 && report.failed > 0) file.result = {
-		state: "fail",
-		errors: [{
-			message: "File failed to run",
-			name: "Error"
-		}]
-	};
-	return file;
-}
-/**
-* Flattens a File task subtree into the {@link TaskResultPack} tuples Vitest's
-* `state.updateTasks` consumes: `[id, result, meta]`.
-*
-* Includes every task (file, suites, tests). Suites/files without a result
-* report `undefined` in the result slot — Vitest tolerates that.
-*/
-function toTaskResultPacks(file) {
-	const packs = [];
-	const walk = (task) => {
-		packs.push([
-			task.id,
-			task.result,
-			task.meta
-		]);
-		if (task.type === "suite") for (const child of task.tasks) walk(child);
-	};
-	walk(file);
-	return packs;
-}
-/**
-* Builds the {@link TaskEventPack} sequence reporters expect: a `suite-prepare`
-* before a suite's children, `test-prepare`/`test-finished` per test, and a
-* `suite-finished` after. This drives reporter progress output.
-*/
-function toTaskEventPacks(file) {
-	const events = [];
-	const isFile = (task) => task.type === "suite" && task.file === task;
-	const walk = (task) => {
-		if (task.type === "test") {
-			events.push([
-				task.id,
-				"test-prepare",
-				void 0
-			]);
-			events.push([
-				task.id,
-				"test-finished",
-				void 0
-			]);
-			return;
-		}
-		const emitSuiteEvents = task.type === "suite" && !isFile(task);
-		if (emitSuiteEvents) events.push([
-			task.id,
-			"suite-prepare",
-			void 0
-		]);
-		for (const child of task.tasks) walk(child);
-		if (emitSuiteEvents) events.push([
-			task.id,
-			"suite-finished",
-			void 0
-		]);
-	};
-	walk(file);
-	return events;
-}
-/**
-* Deterministic synthetic id for a file that failed before any task graph could
-* be built (bundle/inject error). Uses the same `generateHash` Vitest uses, on
-* the root-relative path + projectName, matching `generateFileHash` semantics so
-* the id is stable across runs and won't collide with real file ids.
-*/
-function syntheticFileId(relativePath, projectName) {
-	return generateHash(`${relativePath}${projectName ?? ""}`);
-}
-//#endregion
-export { synthesizeFileTask, syntheticFileId, toTaskEventPacks, toTaskResultPacks };
-
-//# sourceMappingURL=task-graph.js.map

package/dist/test-runner/task-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"task-graph.js","names":[],"sources":["../../src/test-runner/task-graph.ts"],"sourcesContent":["/**\n * Synthesises a Vitest task graph from a relay `RunReport`.\n *\n * The page-side runtime (`runtime.ts`) only knows how to collect a flat list\n * of `TestResult { name: 'suite > sub > test', status, duration, error }`.\n * Vitest's reporters/watch/UI ecosystem, however, expect a populated task\n * graph (`File` → `Suite` → `Test`) plus `TaskResultPack`/`TaskEventPack`\n * tuples reported through `vitest.state`.\n *\n * This module bridges the two: it rebuilds the nested suite/test tree from the\n * ` > `-joined names, assigns Vitest-compatible stable ids via the official\n * `@vitest/runner/utils` helpers (NEVER hand-rolled — ids must match Vitest's\n * own scheme so reruns and reporter lookups line up), and emits the result\n * packs Vitest consumes.\n *\n * Pure functions only — no CDP, no Node IO. This keeps the synthesis unit\n * testable with a plain `RunReport` input (no phone/relay needed).\n *\n * Implementation note: like Vitest's own `createFileTask`, we build structural\n * task objects and fill only the fields reporters read (id/name/type/mode/meta/\n * result/tasks/suite/file). Runtime-only fields on `Test` (context/timeout/\n * annotations/artifacts) are never read off a reported task, so we satisfy the\n * type at a single explicit boundary rather than fabricating fake values.\n */\n\nimport type {\n  File,\n  Suite,\n  Task,\n  TaskEventPack,\n  TaskResult,\n  TaskResultPack,\n  TaskState,\n  Test,\n} from '@vitest/runner';\nimport { calculateSuiteHash, createFileTask, generateHash } from '@vitest/runner/utils';\nimport type { RunReport, TestResult } from './runtime.js';\n\n/** Separator the page runtime uses to join suite path + test name. */\nconst NAME_SEPARATOR = ' > ';\n\n/**\n * Maps a page-runtime status to a Vitest {@link TaskState}.\n * `skip` collapses to Vitest's `skip` run-mode; `pass`/`fail` are terminal.\n */\nfunction toTaskState(status: TestResult['status']): TaskState {\n  switch (status) {\n    case 'pass':\n      return 'pass';\n    case 'fail':\n      return 'fail';\n    case 'skip':\n      return 'skip';\n  }\n}\n\n/**\n * Builds a {@link TaskResult} for a finished test. Suites and files only carry\n * a result on collection/hook error (we leave those undefined — the page never\n * reports suite-level errors separately).\n */\nfunction toTaskResult(t: TestResult): TaskResult {\n  const result: TaskResult = {\n    state: toTaskState(t.status),\n    duration: t.duration,\n  };\n  if (t.status === 'fail') {\n    // SECRET-HANDLING: `error` is the matcher message only — rpc.ts already\n    // strips the expression/value before it reaches us. Pass it through as the\n    // single error object Vitest reporters render.\n    result.errors = [{ message: t.error ?? 'Test failed', name: 'AssertionError' }];\n  }\n  return result;\n}\n\n/**\n * Creates a structural suite task under `parent`. Mirrors the partial-object\n * pattern Vitest uses in `createFileTask`; ids are assigned by\n * `calculateSuiteHash` afterwards.\n */\nfunction makeSuite(parent: Suite, file: File, name: string): Suite {\n  const suite: Suite = {\n    id: '',\n    type: 'suite',\n    name,\n    fullName: '',\n    mode: 'run',\n    meta: {},\n    file,\n    suite: parent,\n    tasks: [],\n  };\n  return suite;\n}\n\n/**\n * Finds-or-creates a child suite named `name` under `parent`.\n * The caller recomputes ids once the whole file tree is built.\n */\nfunction ensureSuite(parent: Suite, file: File, name: string): Suite {\n  const existing = parent.tasks.find((t): t is Suite => t.type === 'suite' && t.name === name);\n  if (existing) return existing;\n  const suite = makeSuite(parent, file, name);\n  parent.tasks.push(suite);\n  return suite;\n}\n\n/**\n * Creates a structural test task and appends it to `parent`.\n *\n * `Test` carries runtime-only required fields (context/timeout/annotations/\n * artifacts) that are never read off a *reported* task — reporters consume\n * id/name/type/mode/result/suite/file. We satisfy the type at this one cast\n * boundary instead of fabricating fake runtime values.\n */\nfunction appendTest(parent: Suite, file: File, t: TestResult, name: string): void {\n  const test = {\n    id: '',\n    type: 'test',\n    name,\n    fullName: '',\n    mode: t.status === 'skip' ? 'skip' : 'run',\n    meta: {},\n    file,\n    suite: parent,\n    result: toTaskResult(t),\n    annotations: [],\n    // `Test` has runtime-only required fields (context/timeout/artifacts)\n    // populated by Vitest at execution time and never read off a *reported*\n    // task. We satisfy the type via `unknown` (not `any`) at this single\n    // boundary, mirroring how Vitest's own createFileTask builds a partial\n    // structural task object.\n  } as unknown as Test;\n  parent.tasks.push(test);\n}\n\n/**\n * Rebuilds a single `File` task graph from one file's flat `RunReport`.\n *\n * @param filepath    Absolute path to the test file.\n * @param root        Project root (used for the file id hash).\n * @param projectName Vitest project name (or undefined for the default project).\n * @param pool        Pool name to stamp on the file task (our relay pool name).\n * @param report      The page-runtime report for this file.\n */\nexport function synthesizeFileTask(\n  filepath: string,\n  root: string,\n  projectName: string | undefined,\n  pool: string,\n  report: RunReport,\n): File {\n  // createFileTask assigns the canonical stable file id (generateFileHash on the\n  // root-relative path + projectName) and self-references file.file = file.\n  const file = createFileTask(filepath, root, projectName, pool);\n\n  for (const t of report.tests) {\n    const segments = t.name.split(NAME_SEPARATOR);\n    const testName = segments.pop() ?? t.name;\n    let parent: Suite = file;\n    for (const suiteName of segments) {\n      parent = ensureSuite(parent, file, suiteName);\n    }\n    appendTest(parent, file, t, testName);\n  }\n\n  // Assign Vitest-stable position-based ids to every suite/test under the file\n  // (file id stays as createFileTask set it).\n  calculateSuiteHash(file);\n\n  // Surface a file-level error result when the whole file failed to run with no\n  // collected tests (bundle/inject error path surfaces as a synthetic file).\n  if (report.tests.length === 0 && report.failed > 0) {\n    file.result = { state: 'fail', errors: [{ message: 'File failed to run', name: 'Error' }] };\n  }\n\n  return file;\n}\n\n/**\n * Flattens a File task subtree into the {@link TaskResultPack} tuples Vitest's\n * `state.updateTasks` consumes: `[id, result, meta]`.\n *\n * Includes every task (file, suites, tests). Suites/files without a result\n * report `undefined` in the result slot — Vitest tolerates that.\n */\nexport function toTaskResultPacks(file: File): TaskResultPack[] {\n  const packs: TaskResultPack[] = [];\n  // Note: a File task also has `type: 'suite'` (File extends Suite) — the suite\n  // branch covers both, so we never need a separate 'file' check.\n  const walk = (task: Task): void => {\n    packs.push([task.id, task.result, task.meta]);\n    if (task.type === 'suite') {\n      for (const child of task.tasks) walk(child);\n    }\n  };\n  walk(file);\n  return packs;\n}\n\n/**\n * Builds the {@link TaskEventPack} sequence reporters expect: a `suite-prepare`\n * before a suite's children, `test-prepare`/`test-finished` per test, and a\n * `suite-finished` after. This drives reporter progress output.\n */\nexport function toTaskEventPacks(file: File): TaskEventPack[] {\n  const events: TaskEventPack[] = [];\n  // A File task also has `type: 'suite'`. Emit suite-prepare/finished for the\n  // file and every nested suite; test-prepare/finished for each test.\n  const isFile = (task: Task): boolean => task.type === 'suite' && task.file === task;\n  const walk = (task: Task): void => {\n    if (task.type === 'test') {\n      events.push([task.id, 'test-prepare', undefined]);\n      events.push([task.id, 'test-finished', undefined]);\n      return;\n    }\n    // Don't emit suite events for the file root itself — reporters track the\n    // module separately; only inner suites get suite-prepare/finished.\n    const emitSuiteEvents = task.type === 'suite' && !isFile(task);\n    if (emitSuiteEvents) {\n      events.push([task.id, 'suite-prepare', undefined]);\n    }\n    for (const child of task.tasks) walk(child);\n    if (emitSuiteEvents) {\n      events.push([task.id, 'suite-finished', undefined]);\n    }\n  };\n  walk(file);\n  return events;\n}\n\n/**\n * Deterministic synthetic id for a file that failed before any task graph could\n * be built (bundle/inject error). Uses the same `generateHash` Vitest uses, on\n * the root-relative path + projectName, matching `generateFileHash` semantics so\n * the id is stable across runs and won't collide with real file ids.\n */\nexport function syntheticFileId(relativePath: string, projectName: string | undefined): string {\n  return generateHash(`${relativePath}${projectName ?? ''}`);\n}\n"],"mappings":";;;AAuCA,MAAM,iBAAiB;;;;;AAMvB,SAAS,YAAY,QAAyC;AAC5D,SAAQ,QAAR;EACE,KAAK,OACH,QAAO;EACT,KAAK,OACH,QAAO;EACT,KAAK,OACH,QAAO;;;;;;;;AASb,SAAS,aAAa,GAA2B;CAC/C,MAAM,SAAqB;EACzB,OAAO,YAAY,EAAE,OAAO;EAC5B,UAAU,EAAE;EACb;AACD,KAAI,EAAE,WAAW,OAIf,QAAO,SAAS,CAAC;EAAE,SAAS,EAAE,SAAS;EAAe,MAAM;EAAkB,CAAC;AAEjF,QAAO;;;;;;;AAQT,SAAS,UAAU,QAAe,MAAY,MAAqB;AAYjE,QAXqB;EACnB,IAAI;EACJ,MAAM;EACN;EACA,UAAU;EACV,MAAM;EACN,MAAM,EAAE;EACR;EACA,OAAO;EACP,OAAO,EAAE;EACV;;;;;;AAQH,SAAS,YAAY,QAAe,MAAY,MAAqB;CACnE,MAAM,WAAW,OAAO,MAAM,MAAM,MAAkB,EAAE,SAAS,WAAW,EAAE,SAAS,KAAK;AAC5F,KAAI,SAAU,QAAO;CACrB,MAAM,QAAQ,UAAU,QAAQ,MAAM,KAAK;AAC3C,QAAO,MAAM,KAAK,MAAM;AACxB,QAAO;;;;;;;;;;AAWT,SAAS,WAAW,QAAe,MAAY,GAAe,MAAoB;CAChF,MAAM,OAAO;EACX,IAAI;EACJ,MAAM;EACN;EACA,UAAU;EACV,MAAM,EAAE,WAAW,SAAS,SAAS;EACrC,MAAM,EAAE;EACR;EACA,OAAO;EACP,QAAQ,aAAa,EAAE;EACvB,aAAa,EAAE;EAMhB;AACD,QAAO,MAAM,KAAK,KAAK;;;;;;;;;;;AAYzB,SAAgB,mBACd,UACA,MACA,aACA,MACA,QACM;CAGN,MAAM,OAAO,eAAe,UAAU,MAAM,aAAa,KAAK;AAE9D,MAAK,MAAM,KAAK,OAAO,OAAO;EAC5B,MAAM,WAAW,EAAE,KAAK,MAAM,eAAe;EAC7C,MAAM,WAAW,SAAS,KAAK,IAAI,EAAE;EACrC,IAAI,SAAgB;AACpB,OAAK,MAAM,aAAa,SACtB,UAAS,YAAY,QAAQ,MAAM,UAAU;AAE/C,aAAW,QAAQ,MAAM,GAAG,SAAS;;AAKvC,oBAAmB,KAAK;AAIxB,KAAI,OAAO,MAAM,WAAW,KAAK,OAAO,SAAS,EAC/C,MAAK,SAAS;EAAE,OAAO;EAAQ,QAAQ,CAAC;GAAE,SAAS;GAAsB,MAAM;GAAS,CAAC;EAAE;AAG7F,QAAO;;;;;;;;;AAUT,SAAgB,kBAAkB,MAA8B;CAC9D,MAAM,QAA0B,EAAE;CAGlC,MAAM,QAAQ,SAAqB;AACjC,QAAM,KAAK;GAAC,KAAK;GAAI,KAAK;GAAQ,KAAK;GAAK,CAAC;AAC7C,MAAI,KAAK,SAAS,QAChB,MAAK,MAAM,SAAS,KAAK,MAAO,MAAK,MAAM;;AAG/C,MAAK,KAAK;AACV,QAAO;;;;;;;AAQT,SAAgB,iBAAiB,MAA6B;CAC5D,MAAM,SAA0B,EAAE;CAGlC,MAAM,UAAU,SAAwB,KAAK,SAAS,WAAW,KAAK,SAAS;CAC/E,MAAM,QAAQ,SAAqB;AACjC,MAAI,KAAK,SAAS,QAAQ;AACxB,UAAO,KAAK;IAAC,KAAK;IAAI;IAAgB,KAAA;IAAU,CAAC;AACjD,UAAO,KAAK;IAAC,KAAK;IAAI;IAAiB,KAAA;IAAU,CAAC;AAClD;;EAIF,MAAM,kBAAkB,KAAK,SAAS,WAAW,CAAC,OAAO,KAAK;AAC9D,MAAI,gBACF,QAAO,KAAK;GAAC,KAAK;GAAI;GAAiB,KAAA;GAAU,CAAC;AAEpD,OAAK,MAAM,SAAS,KAAK,MAAO,MAAK,MAAM;AAC3C,MAAI,gBACF,QAAO,KAAK;GAAC,KAAK;GAAI;GAAkB,KAAA;GAAU,CAAC;;AAGvD,MAAK,KAAK;AACV,QAAO;;;;;;;;AAST,SAAgB,gBAAgB,cAAsB,aAAyC;AAC7F,QAAO,aAAa,GAAG,eAAe,eAAe,KAAK"}

package/dist/throttle-DKKzX1qC.js

@@ -1,59 +0,0 @@
-//#region src/test-runner/throttle.ts
-/**
-* Shared `APP_BRIDGE_THROTTLED` detection (devtools#767).
-*
-* 2026-07-10 real-device observation: the Toss app native side added a
-* per-method rate limit to the 2.x bridge — calling the SAME bridge method
-* twice within a short window rejects the second call immediately with a
-* 2.x native envelope (`{name, code, userInfo, moduleName, __isError}`) whose
-* `code` is `'APP_BRIDGE_THROTTLED'` and whose `message` reads
-* `"Too many app bridge calls from <method>."`. The 3.x bridge path is
-* unaffected (devtools#767 issue body, sdk-example#284 2026-07-10 comment).
-*
-* This module is the SINGLE source of the detection predicate. Today's only
-* consumer is `runtime.ts` (in-page, per-test retry loop) — a plain static
-* import; esbuild inlines this file into the same IIFE bundle (same
-* mechanism as `bridge-stub.ts`, see `bundle.ts#getPageSideModulePath`). It
-* is exported from this standalone, dependency-free module (rather than
-* defined inline in `runtime.ts`) so a Node-side consumer could import the
-* exact same predicate in future if whole-FILE throttle-aware retry is ever
-* added on top of the per-test retry `runtime.ts` already performs — no such
-* Node-side caller exists yet (whole-file retry today only triggers on an
-* `injectAndRunBundle`-level timeout/exception, a distinct failure mode from
-* a `RunReport` that completed normally but contains a THROTTLED-failed
-* test — see `relay-worker.ts`'s `EVALUATE_TIMEOUT_MARKER` gate).
-*
-* Browser-compatible, dependency-free (no Node APIs) — safe to import from
-* either side of the CDP boundary, mirroring `runtime.ts`'s own constraint.
-*/
-/** The native error code the Toss app bridge returns when rate-limited. */
-const THROTTLED_ERROR_CODE = "APP_BRIDGE_THROTTLED";
-/** The message substring the native envelope carries when rate-limited. */
-const THROTTLED_MESSAGE_SUBSTRING = "Too many app bridge calls";
-/**
-* True when `err` looks like a native `APP_BRIDGE_THROTTLED` rejection —
-* either the 2.x native envelope's `code` field equals
-* {@link THROTTLED_ERROR_CODE}, or the error's message contains
-* {@link THROTTLED_MESSAGE_SUBSTRING}. Either signal alone is sufficient: the
-* `code` field is the precise native signal, but a caller may only have a
-* stringified message (e.g. `Error#message` after the native envelope was
-* flattened) — checking both keeps detection robust across both shapes.
-*
-* Accepts `unknown` because callers may pass a caught page-side exception
-* (whose shape is not statically known), a `TestResult.error` string, or a
-* `FileResult` error string — never throws.
-*/
-function isThrottledError(err) {
-	if (err === null || err === void 0) return false;
-	if (typeof err === "string") return err.includes(THROTTLED_MESSAGE_SUBSTRING);
-	if (typeof err === "object") {
-		const rec = err;
-		if (rec.code === "APP_BRIDGE_THROTTLED") return true;
-		if (typeof rec.message === "string" && rec.message.includes("Too many app bridge calls")) return true;
-	}
-	return false;
-}
-//#endregion
-export { THROTTLED_MESSAGE_SUBSTRING as n, isThrottledError as r, THROTTLED_ERROR_CODE as t };
-
-//# sourceMappingURL=throttle-DKKzX1qC.js.map

package/dist/throttle-DKKzX1qC.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"throttle-DKKzX1qC.js","names":[],"sources":["../src/test-runner/throttle.ts"],"sourcesContent":["/**\n * Shared `APP_BRIDGE_THROTTLED` detection (devtools#767).\n *\n * 2026-07-10 real-device observation: the Toss app native side added a\n * per-method rate limit to the 2.x bridge — calling the SAME bridge method\n * twice within a short window rejects the second call immediately with a\n * 2.x native envelope (`{name, code, userInfo, moduleName, __isError}`) whose\n * `code` is `'APP_BRIDGE_THROTTLED'` and whose `message` reads\n * `\"Too many app bridge calls from <method>.\"`. The 3.x bridge path is\n * unaffected (devtools#767 issue body, sdk-example#284 2026-07-10 comment).\n *\n * This module is the SINGLE source of the detection predicate. Today's only\n * consumer is `runtime.ts` (in-page, per-test retry loop) — a plain static\n * import; esbuild inlines this file into the same IIFE bundle (same\n * mechanism as `bridge-stub.ts`, see `bundle.ts#getPageSideModulePath`). It\n * is exported from this standalone, dependency-free module (rather than\n * defined inline in `runtime.ts`) so a Node-side consumer could import the\n * exact same predicate in future if whole-FILE throttle-aware retry is ever\n * added on top of the per-test retry `runtime.ts` already performs — no such\n * Node-side caller exists yet (whole-file retry today only triggers on an\n * `injectAndRunBundle`-level timeout/exception, a distinct failure mode from\n * a `RunReport` that completed normally but contains a THROTTLED-failed\n * test — see `relay-worker.ts`'s `EVALUATE_TIMEOUT_MARKER` gate).\n *\n * Browser-compatible, dependency-free (no Node APIs) — safe to import from\n * either side of the CDP boundary, mirroring `runtime.ts`'s own constraint.\n */\n\n/** The native error code the Toss app bridge returns when rate-limited. */\nexport const THROTTLED_ERROR_CODE = 'APP_BRIDGE_THROTTLED';\n\n/** The message substring the native envelope carries when rate-limited. */\nexport const THROTTLED_MESSAGE_SUBSTRING = 'Too many app bridge calls';\n\n/**\n * True when `err` looks like a native `APP_BRIDGE_THROTTLED` rejection —\n * either the 2.x native envelope's `code` field equals\n * {@link THROTTLED_ERROR_CODE}, or the error's message contains\n * {@link THROTTLED_MESSAGE_SUBSTRING}. Either signal alone is sufficient: the\n * `code` field is the precise native signal, but a caller may only have a\n * stringified message (e.g. `Error#message` after the native envelope was\n * flattened) — checking both keeps detection robust across both shapes.\n *\n * Accepts `unknown` because callers may pass a caught page-side exception\n * (whose shape is not statically known), a `TestResult.error` string, or a\n * `FileResult` error string — never throws.\n */\nexport function isThrottledError(err: unknown): boolean {\n  if (err === null || err === undefined) return false;\n\n  if (typeof err === 'string') {\n    return err.includes(THROTTLED_MESSAGE_SUBSTRING);\n  }\n\n  if (typeof err === 'object') {\n    const rec = err as { code?: unknown; message?: unknown };\n    if (rec.code === THROTTLED_ERROR_CODE) return true;\n    if (typeof rec.message === 'string' && rec.message.includes(THROTTLED_MESSAGE_SUBSTRING)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,MAAa,uBAAuB;;AAGpC,MAAa,8BAA8B;;;;;;;;;;;;;;AAe3C,SAAgB,iBAAiB,KAAuB;AACtD,KAAI,QAAQ,QAAQ,QAAQ,KAAA,EAAW,QAAO;AAE9C,KAAI,OAAO,QAAQ,SACjB,QAAO,IAAI,SAAS,4BAA4B;AAGlD,KAAI,OAAO,QAAQ,UAAU;EAC3B,MAAM,MAAM;AACZ,MAAI,IAAI,SAAA,uBAA+B,QAAO;AAC9C,MAAI,OAAO,IAAI,YAAY,YAAY,IAAI,QAAQ,SAAA,4BAAqC,CACtF,QAAO;;AAIX,QAAO"}

package/dist/totp-BqmCLSNA.js

@@ -1,189 +0,0 @@
-import { createHmac, timingSafeEqual } from "node:crypto";
-//#region src/mcp/totp.ts
-/**
-* RFC 6238 TOTP implementation (Node.js, node:crypto only).
-*
-* External TOTP libraries (otplib, speakeasy, …) are intentionally NOT used
-* to keep the dependency surface minimal. This hand-roll is ~30 lines and
-* covers exactly what relay-side auth needs.
-*
-* Algorithm summary (RFC 6238 + RFC 4226):
-*   T  = floor(now / 30)          — 30-second time step counter
-*   K  = Buffer.from(secret, 'hex') — shared secret (raw bytes, hex-encoded)
-*   MAC = HMAC-SHA1(K, T as 8-byte big-endian uint64)
-*   offset = MAC[19] & 0x0f
-*   code = (MAC[offset..offset+4] & 0x7fffffff) % 10^6  — 6 digits
-*
-* Security note (keep this comment accurate):
-*   The baked-in secret in a dog-food build is extractable from the bundle by a
-*   determined reverse engineer. This mechanism raises the bar from
-*   "anyone with the URL" to "URL + bundle extraction + live TOTP calculation".
-*   Casual URL leaks (Slack paste, QR screenshot, shoulder-surfing) are
-*   blocked; deliberate reverse engineering is not. See threat model in
-*   src/mcp/chii-relay.ts and umbrella CLAUDE.md §4.
-*
-* SECRET-HANDLING: secret values and computed codes MUST NOT appear in any
-* log, error message, or string visible outside this module. Only boolean
-* pass/fail and reason enum values are safe to surface.
-*/
-/** Time step window in seconds (RFC 6238 default). */
-const TIME_STEP = 30;
-/** Number of digits in the generated code. */
-const DIGITS = 6;
-/**
-* Derives a 6-digit TOTP code from a hex-encoded secret at the given wall-
-* clock time.
-*
-* @param secret - The shared secret as a hex string (e.g. 64 hex chars = 32
-*   bytes). Must be the output of `generateAttachToken()` or compatible.
-* @param when - Unix timestamp in milliseconds. Defaults to `Date.now()`.
-* @returns A zero-padded 6-digit decimal string, e.g. `"042193"`.
-*/
-function generateTotp(secret, when = Date.now()) {
-	const key = Buffer.from(secret, "hex");
-	const counter = Math.max(0, Math.floor(when / 1e3 / TIME_STEP));
-	const counterBuf = Buffer.alloc(8);
-	const hi = Math.floor(counter / 4294967296);
-	const lo = counter >>> 0;
-	counterBuf.writeUInt32BE(hi, 0);
-	counterBuf.writeUInt32BE(lo, 4);
-	const mac = createHmac("sha1", key).update(counterBuf).digest();
-	const offset = mac[19] & 15;
-	return (((mac[offset] & 127) << 24 | (mac[offset + 1] & 255) << 16 | (mac[offset + 2] & 255) << 8 | mac[offset + 3] & 255) % 10 ** DIGITS).toString().padStart(DIGITS, "0");
-}
-/**
-* Verifies a TOTP code against the secret, accepting ±`skew` time steps to
-* tolerate clock drift between the relay host and the client device.
-*
-* Uses `timingSafeEqual` for constant-time comparison to prevent timing
-* side-channel attacks.
-*
-* @param secret - Hex-encoded shared secret.
-* @param code - The 6-digit code to verify (string or numeric).
-* @param when - Unix timestamp in milliseconds. Defaults to `Date.now()`.
-* @param skew - Number of adjacent steps to accept on either side. Default 1
-*   (accepts T-1, T, T+1 — a 90-second acceptance window).
-* @returns `true` if the code matches any accepted step, `false` otherwise.
-*/
-function verifyTotp(secret, code, when = Date.now(), skew = 1) {
-	const normalised = String(code).padStart(DIGITS, "0");
-	if (normalised.length !== DIGITS || !/^\d{6}$/.test(normalised)) return false;
-	const candidateBuf = Buffer.from(normalised, "utf8");
-	for (let delta = -skew; delta <= skew; delta++) {
-		const expected = generateTotp(secret, when + delta * TIME_STEP * 1e3);
-		if (timingSafeEqual(Buffer.from(expected, "utf8"), candidateBuf)) return true;
-	}
-	return false;
-}
-/**
-* Minimum length (in hex characters) accepted for `AIT_DEBUG_TOTP_SECRET`.
-*
-* The secret is hex-encoded (see {@link generateTotp} — `Buffer.from(secret,
-* 'hex')`). 32 hex chars = 16 bytes = 128 bits, the floor for an HMAC-SHA1 key
-* we are willing to gate a public relay behind. `generateAttachToken()` emits
-* 64 hex chars (32 bytes), comfortably above this bar.
-*/
-const MIN_SECRET_HEX_CHARS = 32;
-/** Hex string: one or more hex digits, case-insensitive (RFC 4648 base16). */
-const HEX_RE = /^[0-9a-fA-F]+$/;
-/**
-* Human-facing guidance printed when {@link assertRelayAuthConfigured} fails.
-*
-* SECRET-HANDLING: this message states only the REQUIREMENT (≥32 hex chars) and
-* how to mint one. It NEVER echoes the configured value, its length, or any
-* fragment derived from it — see {@link assertRelayAuthConfigured}.
-*
-* Note on encoding: the secret is hex (base16), not base32 — `generateTotp`
-* decodes it with `Buffer.from(secret, 'hex')`. A base32 string would be
-* silently mis-decoded and every TOTP code would fail to match, so the minting
-* command emits hex.
-*/
-const RELAY_AUTH_SECRET_MISSING_MESSAGE = [
-	"[ait-debug] AIT_DEBUG_TOTP_SECRET이 필수입니다. 32자 이상 16진수(hex) 문자열을 설정하세요.",
-	"발급: openssl rand -hex 32",
-	"데몬은 start_debug의 projectRoot 인자로 받은 디렉토리에서 .ait_relay 파일을 읽어 이 시크릿을 채웁니다.",
-	"프로젝트에서 pnpm dev:phone:cdp를 한 번 띄우면 unplugin이 .ait_relay를 자동 생성하니(tunnel.cdp 옵션 필요), projectRoot를 전달하세요.",
-	"자세히: https://docs.aitc.dev/guides/relay-auth-totp"
-].join("\n");
-/**
-* Whether `secret` is a well-formed relay-auth TOTP secret: a hex string of at
-* least {@link MIN_SECRET_HEX_CHARS} characters with an even length (an odd
-* length would have its trailing nibble silently dropped by `Buffer.from(...,
-* 'hex')`, weakening the key without warning).
-*
-* Pure predicate so callers can test the validation independently of the
-* fail-fast side effect in {@link assertRelayAuthConfigured}.
-*
-* SECRET-HANDLING: returns only a boolean — the input value is never returned,
-* logged, or echoed.
-*/
-function isValidRelayAuthSecret(secret) {
-	if (secret === void 0 || secret === "") return false;
-	if (secret.length < MIN_SECRET_HEX_CHARS) return false;
-	if (secret.length % 2 !== 0) return false;
-	return HEX_RE.test(secret);
-}
-/**
-* Fail-fast guard enforcing that a relay-auth TOTP secret is configured before
-* a public-internet-exposed relay is booted (issue #250).
-*
-* Relay-auth (the §4 Layer C TOTP gate) is the only fail-fast layer that closes
-* the real gap: a leaked `wss://…trycloudflare.com` URL otherwise lets a third
-* party attach a debugger to a dog-food/live mini-app. Without a secret the relay
-* comes up unauthenticated, so this guard is called at every relay-boot site —
-* `bootRelayFamily` (intoss env 3/4) and `bootExternalRelayFamily` (env-2 PWA),
-* both eager and lazy. Local-only sessions never boot a relay and so never reach
-* this guard, matching the issue's exemption for non-relay debugging.
-*
-* Throws when the secret is unset, empty, too short, or not a valid hex string.
-* The thrown message is the bin entry's fatal stderr (see `cli.ts` `main().catch`)
-* — the same fatal model as the missing-`AIT_RELAY_BASE_URL` path.
-*
-* SECRET-HANDLING: the env value is read once, passed ONLY to the boolean
-* predicate, and never logged. The thrown message names the requirement, never
-* the value, its length, or any derived fragment.
-*
-* @param env - Environment to read from. Defaults to `process.env`; injectable
-*   for tests so they never mutate the real process environment.
-*/
-function assertRelayAuthConfigured(env = process.env) {
-	if (!isValidRelayAuthSecret(env.AIT_DEBUG_TOTP_SECRET)) throw new Error(RELAY_AUTH_SECRET_MISSING_MESSAGE);
-}
-/**
-* Reads `AIT_DEBUG_TOTP_SECRET` from `process.env` at runtime and builds a
-* `verifyAuth` predicate for the Chii relay's WebSocket upgrade gate.
-*
-* The predicate checks the `at` query parameter against the current and
-* adjacent TOTP time steps (±{@link RELAY_VERIFY_SKEW_STEPS} skew) using
-* {@link verifyTotp}. This gives the issued code a minimum validity of ~3
-* minutes, which is enough to cover the QR-scan → launcher-attach flow even
-* when the launcher PWA needs to load or reinstall (#490).
-*
-* Returns `undefined` when the env var is not set — callers treat that as
-* "auth disabled" (no predicate registered on the relay). Note that since
-* issue #250 the secret is MANDATORY at every relay-boot site (enforced by
-* {@link assertRelayAuthConfigured} BEFORE the relay starts), so in production
-* this never returns `undefined` for a relay that actually boots; the
-* `undefined` branch only matters for the no-relay local path and tests.
-*
-* Lives here (not in the MCP server) so the unplugin's env-2 relay can wire the
-* same gate without importing the heavy MCP server module graph. Re-exported
-* from `debug-server.ts` for back-compat.
-*
-* SECRET-HANDLING: The secret value read from env is captured in a closure and
-* is NEVER written to any log, error message, or process output.
-*/
-function buildRelayVerifyAuth(env = process.env) {
-	const secret = env.AIT_DEBUG_TOTP_SECRET;
-	if (!secret) return void 0;
-	return (req) => {
-		const rawUrl = req.url ?? "";
-		const qIndex = rawUrl.indexOf("?");
-		const queryStr = qIndex === -1 ? "" : rawUrl.slice(qIndex + 1);
-		return verifyTotp(secret, new URLSearchParams(queryStr).get("at") ?? "", void 0, 6);
-	};
-}
-//#endregion
-export { assertRelayAuthConfigured, buildRelayVerifyAuth, isValidRelayAuthSecret };
-
-//# sourceMappingURL=totp-BqmCLSNA.js.map