@orkestrel/test 0.0.11 → 0.0.12

package/dist/src/core/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../src/core/validators.ts","../../../src/core/helpers.ts","../../../src/core/factories.ts"],"sourcesContent":["import type { RecorderMap } from './types.js'\n\n/**\n * Checks whether a value contains a recorder for every listed event.\n *\n * @typeParam TMap - The source's event names and delivered argument tuples.\n * @typeParam TName - The event names represented in the map.\n * @param value - The value to inspect.\n * @param events - The events the completed map must contain.\n * @returns True if every listed event has a structurally valid recorder; false otherwise.\n * @remarks Per-key tuple precision is the predicate's claim. The factory proves that claim by\n * wiring each recorder to exactly the event where it stores that recorder. A direct caller must\n * establish the same pairing before it relies on the narrowing. This guard takes the listed events\n * through a reference parameter rather than using the canonical single-value guard form.\n */\nexport function isRecorderMapComplete<\n\tTMap extends Record<string, readonly unknown[]>,\n\tTName extends keyof TMap,\n>(value: unknown, events: readonly TName[]): value is RecorderMap<TMap, TName> {\n\ttry {\n\t\tif (typeof value !== 'object' || value === null) return false\n\t\treturn events.every((event) => {\n\t\t\tif (!Object.hasOwn(value, event)) return false\n\t\t\tconst recorder = Reflect.get(value, event)\n\t\t\tif (typeof recorder !== 'object' || recorder === null) return false\n\t\t\treturn (\n\t\t\t\ttypeof Reflect.get(recorder, 'handler') === 'function' &&\n\t\t\t\tArray.isArray(Reflect.get(recorder, 'calls'))\n\t\t\t)\n\t\t})\n\t} catch {\n\t\treturn false\n\t}\n}\n","import type {\n\tEventSubscriber,\n\tHeadersSource,\n\tJSONSafe,\n\tRetryOptions,\n\tWaitOptions,\n} from './types.js'\n\n/**\n * Waits for a host timer to elapse.\n *\n * @param ms - The delay in milliseconds.\n * @returns A promise that resolves after the timer fires.\n */\nexport function waitForDelay(ms = 0): Promise<void> {\n\treturn new Promise((resolve) => setTimeout(resolve, ms))\n}\n\n/**\n * Waits until an abort signal is aborted.\n *\n * @param signal - The signal to observe.\n * @returns A promise that resolves when the signal is aborted.\n * @remarks An already-aborted signal resolves immediately. Otherwise the wait parks on a one-shot\n * abort listener without a timer or polling.\n */\nexport function waitForAbort(signal: AbortSignal): Promise<void> {\n\tif (signal.aborted) return Promise.resolve()\n\treturn new Promise((resolve) => signal.addEventListener('abort', () => resolve(), { once: true }))\n}\n\n/**\n * Waits until a condition holds within an elapsed-time budget.\n *\n * @param description - The condition described in a timeout error.\n * @param condition - The synchronous or asynchronous condition to read.\n * @param options - The time bounds and abort signal.\n * @returns A promise that resolves when the condition first returns `true`.\n * @throws The condition's thrown value, the abort reason, or an `Error` when a bound is invalid or\n * the condition does not hold within the budget.\n * @remarks The first read is immediate. Default budget: `1000` milliseconds. Default interval: `10`\n * milliseconds.\n */\nexport async function waitForCondition(\n\tdescription: string,\n\tcondition: () => boolean | Promise<boolean>,\n\toptions?: WaitOptions,\n): Promise<void> {\n\tconst budget = options?.budget ?? 1000\n\tconst interval = options?.interval ?? 10\n\tif (!Number.isFinite(budget) || budget < 0) {\n\t\tthrow new Error('Wait budget must be finite and non-negative')\n\t}\n\tif (!Number.isFinite(interval) || interval < 0) {\n\t\tthrow new Error('Wait interval must be finite and non-negative')\n\t}\n\n\tconst start = performance.now()\n\twhile (true) {\n\t\toptions?.signal?.throwIfAborted()\n\t\tconst held = await condition()\n\t\toptions?.signal?.throwIfAborted()\n\t\tif (held) return\n\n\t\tconst elapsed = performance.now() - start\n\t\tif (elapsed >= budget) {\n\t\t\tthrow new Error(\n\t\t\t\t`Condition \"${description}\" did not hold within ${budget}ms (waited ${elapsed}ms)`,\n\t\t\t)\n\t\t}\n\t\tawait waitForDelay(interval)\n\t}\n}\n\n/**\n * Repeats a producer until one produced value satisfies a predicate.\n *\n * @typeParam T - The produced value type.\n * @param description - The operation described in an exhaustion error.\n * @param produce - The synchronous or asynchronous operation to repeat.\n * @param satisfied - The predicate that accepts a produced value.\n * @param options - The time, attempt, and abort bounds.\n * @returns The first produced value the predicate accepts.\n * @throws The predicate's thrown value, the abort reason, or an `Error` when a bound is invalid or\n * the retry exhausts its budget or attempts.\n * @remarks A producer throw counts as an unsatisfied attempt. The last producer error becomes the\n * exhaustion error's `cause`. Default budget: `1000` milliseconds. Default interval: `10`\n * milliseconds.\n */\nexport async function retryUntil<T>(\n\tdescription: string,\n\tproduce: () => T | Promise<T>,\n\tsatisfied: (value: T) => boolean,\n\toptions?: RetryOptions,\n): Promise<T> {\n\tconst budget = options?.budget ?? 1000\n\tconst interval = options?.interval ?? 10\n\tconst attempts = options?.attempts\n\tif (!Number.isFinite(budget) || budget < 0) {\n\t\tthrow new Error('Retry budget must be finite and non-negative')\n\t}\n\tif (!Number.isFinite(interval) || interval < 0) {\n\t\tthrow new Error('Retry interval must be finite and non-negative')\n\t}\n\tif (attempts !== undefined && (!Number.isInteger(attempts) || attempts < 1)) {\n\t\tthrow new Error('Retry attempts must be a positive integer')\n\t}\n\n\tconst start = performance.now()\n\tlet count = 0\n\tlet cause: unknown\n\tlet last: string | undefined\n\twhile (true) {\n\t\toptions?.signal?.throwIfAborted()\n\t\tif (count > 0) {\n\t\t\tconst elapsed = performance.now() - start\n\t\t\tif (elapsed >= budget) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Retry \"${description}\" did not succeed within ${budget}ms (waited ${elapsed}ms)${last === undefined ? '' : ` (last value: ${last})`}`,\n\t\t\t\t\t{ cause },\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t\tlet produced:\n\t\t\t| { readonly success: false; readonly error: unknown }\n\t\t\t| { readonly success: true; readonly value: T }\n\t\ttry {\n\t\t\tproduced = { success: true, value: await produce() }\n\t\t} catch (error) {\n\t\t\tproduced = { success: false, error }\n\t\t}\n\t\tcount += 1\n\t\toptions?.signal?.throwIfAborted()\n\n\t\tif (produced.success) {\n\t\t\tif (satisfied(produced.value)) return produced.value\n\t\t\tlet rendered: string\n\t\t\ttry {\n\t\t\t\tconst serialized = JSON.stringify(produced.value)\n\t\t\t\trendered = serialized === undefined ? String(produced.value) : serialized\n\t\t\t} catch {\n\t\t\t\ttry {\n\t\t\t\t\trendered = String(produced.value)\n\t\t\t\t} catch {\n\t\t\t\t\trendered = '[unrenderable]'\n\t\t\t\t}\n\t\t\t}\n\t\t\tlast = rendered.length > 200 ? `${rendered.slice(0, 197)}...` : rendered\n\t\t} else {\n\t\t\tcause = produced.error\n\t\t}\n\n\t\tconst elapsed = performance.now() - start\n\t\tif (elapsed >= budget) {\n\t\t\tthrow new Error(\n\t\t\t\t`Retry \"${description}\" did not succeed within ${budget}ms (waited ${elapsed}ms)${last === undefined ? '' : ` (last value: ${last})`}`,\n\t\t\t\t{ cause },\n\t\t\t)\n\t\t}\n\t\tif (attempts !== undefined && count >= attempts) {\n\t\t\tthrow new Error(\n\t\t\t\t`Retry \"${description}\" did not succeed within ${attempts} attempts${last === undefined ? '' : ` (last value: ${last})`}`,\n\t\t\t\t{ cause },\n\t\t\t)\n\t\t}\n\t\tawait waitForDelay(Math.min(interval, budget - elapsed))\n\t}\n}\n\n/**\n * Invokes an unknown method through an explicit unchecked result contract.\n *\n * @typeParam T - The result type claimed by the caller.\n * @param target - The value used as the method's `this` argument.\n * @param method - The unknown method to invoke.\n * @param args - The arguments to pass.\n * @returns The method's result under the caller's claimed type.\n * @throws A `TypeError` when `method` is not callable.\n * @remarks The caller owns the claim that the returned value has type `T`. The contained `any`\n * bridges the unchecked runtime result to that caller-owned claim.\n */\nexport function invokeUnchecked<T>(target: unknown, method: unknown, args: readonly unknown[]): T {\n\tif (typeof method !== 'function') throw new TypeError('Method must be callable')\n\tconst result: T = Reflect.apply(method, target, args)\n\treturn result\n}\n\n/**\n * Reads a property from an unknown object or function.\n *\n * @typeParam T - The property type claimed by the caller.\n * @param target - The unknown value to read.\n * @param key - The property key to read.\n * @returns The property value under the caller's claimed type.\n * @throws A `TypeError` when `target` is neither an object nor a function.\n * @remarks The caller owns the claim that the returned value has type `T`. The contained `any`\n * bridges the unchecked runtime result to that caller-owned claim.\n */\nexport function readProperty<T>(target: unknown, key: PropertyKey): T {\n\tif ((typeof target !== 'object' || target === null) && typeof target !== 'function') {\n\t\tthrow new TypeError('Target must be an object or function')\n\t}\n\tconst result: T = Reflect.get(target, key)\n\treturn result\n}\n\n/**\n * Normalizes headers into a frozen plain record.\n *\n * @param init - The platform header initializer to normalize.\n * @returns A frozen record of normalized header names and values.\n * @remarks Normalization follows the host `Headers` implementation, including lowercased names and\n * combined values.\n */\nexport function flattenHeaders(init: HeadersSource): Readonly<Record<string, string>> {\n\treturn Object.freeze(Object.fromEntries(new Headers(init).entries()))\n}\n\n/**\n * Waits for the first delivery from an event subscription.\n *\n * @typeParam TArgs - The delivered argument tuple.\n * @param subscribe - The function that installs the event listener and may return its cleanup.\n * @param description - The event described in a timeout error.\n * @param options - The time bounds and abort signal.\n * @returns The first delivered argument tuple.\n * @throws The subscription's thrown value, the abort reason, or an `Error` when a bound is invalid\n * or the event is not delivered within the budget.\n * @remarks Default budget: `1000` milliseconds. The interval is validated for consistency with the\n * wait family but is not used because this helper parks on the event.\n */\nexport async function waitForEvent<TArgs extends readonly unknown[]>(\n\tsubscribe: EventSubscriber<TArgs>,\n\tdescription: string,\n\toptions?: WaitOptions,\n): Promise<TArgs> {\n\tconst budget = options?.budget ?? 1000\n\tconst interval = options?.interval ?? 10\n\tif (!Number.isFinite(budget) || budget < 0) {\n\t\tthrow new Error('Event budget must be finite and non-negative')\n\t}\n\tif (!Number.isFinite(interval) || interval < 0) {\n\t\tthrow new Error('Event interval must be finite and non-negative')\n\t}\n\n\tconst signal = options?.signal\n\tsignal?.throwIfAborted()\n\tconst delivery = Promise.withResolvers<TArgs>()\n\tconst controller = new AbortController()\n\tlet timeout: ReturnType<typeof setTimeout> | undefined\n\tconst pending: Array<Promise<TArgs>> = [\n\t\tdelivery.promise,\n\t\tnew Promise((_resolve, reject) => {\n\t\t\ttimeout = setTimeout(() => {\n\t\t\t\treject(new Error(`Event \"${description}\" was not delivered within ${budget}ms`))\n\t\t\t}, budget)\n\t\t}),\n\t]\n\tif (signal !== undefined) {\n\t\tpending.push(\n\t\t\tnew Promise((_resolve, reject) => {\n\t\t\t\tconst combined = AbortSignal.any([signal, controller.signal])\n\t\t\t\tcombined.addEventListener(\n\t\t\t\t\t'abort',\n\t\t\t\t\t() => {\n\t\t\t\t\t\tif (signal.aborted) reject(signal.reason)\n\t\t\t\t\t},\n\t\t\t\t\t{ once: true },\n\t\t\t\t)\n\t\t\t}),\n\t\t)\n\t}\n\tconst result = Promise.race(pending)\n\tlet cleanup: (() => void) | void = undefined\n\ttry {\n\t\ttry {\n\t\t\tcleanup = subscribe((...args) => delivery.resolve(args))\n\t\t} catch (error) {\n\t\t\tdelivery.reject(error)\n\t\t}\n\t\treturn await result\n\t} finally {\n\t\tcontroller.abort()\n\t\tif (timeout !== undefined) clearTimeout(timeout)\n\t\tcleanup?.()\n\t}\n}\n\n/**\n * Decodes newline-delimited JSON values.\n *\n * @param text - The JSON Lines text to decode.\n * @returns The decoded values in physical-line order.\n * @throws An `Error` naming the malformed physical line, with the native `SyntaxError` as its\n * `cause`.\n */\nexport function decodeJSONLines(text: string): readonly unknown[] {\n\tconst values: unknown[] = []\n\tfor (const [index, physical] of text.split('\\n').entries()) {\n\t\tconst line = physical.endsWith('\\r') ? physical.slice(0, -1) : physical\n\t\tif (line.length === 0) continue\n\t\ttry {\n\t\t\tconst value: unknown = JSON.parse(line)\n\t\t\tvalues.push(value)\n\t\t} catch (cause) {\n\t\t\tthrow new Error(`Invalid JSON on line ${index + 1}`, { cause })\n\t\t}\n\t}\n\treturn values\n}\n\n/**\n * Captures the value thrown by a thunk.\n *\n * @param thunk - The work whose thrown value to capture.\n * @returns The thrown value, or `undefined` when the thunk completes.\n */\nexport function captureError(thunk: () => unknown): unknown {\n\ttry {\n\t\tthunk()\n\t} catch (error) {\n\t\treturn error\n\t}\n\treturn undefined\n}\n\n/**\n * Requires a value to be present.\n *\n * @typeParam T - The required value type.\n * @param value - The value to check.\n * @param message - The error message used when the value is absent.\n * @returns The present value.\n */\nexport function requireValue<T>(value: T | null | undefined, message = 'Value is required'): T {\n\tif (value === null || value === undefined) throw new Error(message)\n\treturn value\n}\n\n/**\n * Collects every value from an async iterable.\n *\n * @typeParam T - The yielded value type.\n * @param source - The async iterable to drain.\n * @returns The yielded values in iteration order.\n */\nexport async function collect<T>(source: AsyncIterable<T>): Promise<readonly T[]> {\n\tconst values: T[] = []\n\tfor await (const value of source) values.push(value)\n\treturn values\n}\n\n/**\n * Collects every value from a readable stream.\n *\n * @typeParam T - The streamed value type.\n * @param stream - The readable stream to drain.\n * @returns The streamed values in read order.\n */\nexport async function collectStream<T>(stream: ReadableStream<T>): Promise<readonly T[]> {\n\tconst reader = stream.getReader()\n\tconst values: T[] = []\n\ttry {\n\t\twhile (true) {\n\t\t\tconst result = await reader.read()\n\t\t\tif (result.done) return values\n\t\t\tvalues.push(result.value)\n\t\t}\n\t} finally {\n\t\treader.releaseLock()\n\t}\n}\n\n/**\n * Copies a JSON value through serialization and parsing.\n *\n * @typeParam T - The copied value's type, which the copy keeps.\n * @param value - The value to copy, bounded by its own `JSONSafe` projection.\n * @returns The parsed JSON copy.\n * @remarks Non-finite numbers throw because JSON would replace them with `null`. Negative zero is\n * normalized to zero by JSON serialization. The bound intersects `JSONSafe<T>` rather than\n * constraining `T` to `JSONValue`, so an interface-typed value round-trips.\n */\nexport function roundTripJSON<T>(value: T & JSONSafe<T>): T {\n\tconst serialized = JSON.stringify(value, (_key, current) => {\n\t\tif (current === undefined || typeof current === 'function' || typeof current === 'symbol') {\n\t\t\tthrow new Error('JSON values must not contain undefined, functions, or symbols')\n\t\t}\n\t\tif (typeof current === 'number' && !Number.isFinite(current)) {\n\t\t\tthrow new Error('JSON values must contain finite numbers')\n\t\t}\n\t\treturn current\n\t})\n\tconst parsed: T = JSON.parse(serialized)\n\tconst pending: unknown[] = [parsed]\n\twhile (pending.length > 0) {\n\t\tconst current = pending.pop()\n\t\tif (typeof current === 'number' && !Number.isFinite(current)) {\n\t\t\tthrow new Error('JSON values must contain finite numbers')\n\t\t}\n\t\tif (Array.isArray(current)) {\n\t\t\tfor (const child of current) pending.push(child)\n\t\t} else if (typeof current === 'object' && current !== null) {\n\t\t\tfor (const child of Object.values(current)) pending.push(child)\n\t\t}\n\t}\n\treturn parsed\n}\n\n/**\n * Resolves the parent directory of a calling module, which is the workspace root when called from\n * the conventional `tests/setup.ts` location.\n *\n * @param meta - The calling module metadata.\n * @returns The root URL one directory above the calling file.\n */\nexport function resolveRoot(meta: ImportMeta): URL {\n\treturn new URL('../', meta.url)\n}\n","import type {\n\tEventSourceInterface,\n\tRecorderInterface,\n\tRecorderMap,\n\tResourceFactoryInterface,\n\tSignalInterface,\n\tTeardownHandler,\n\tTeardownInterface,\n} from './types.js'\nimport { isRecorderMapComplete } from './validators.js'\n\n/**\n * Creates values that make common object readers throw or violate their assumptions.\n *\n * @returns A frozen array whose values are fresh on every call.\n * @remarks Every member makes a naive read throw or violates a naive structural assumption. A total\n * guard survives every member without throwing. Whether it accepts or refuses one is that guard's\n * own contract. Membership may grow in a release, so test the whole returned set in a loop and\n * include the index in each failure.\n *\n * - The self-referential record makes JSON record serialization throw.\n * - The revoked object proxy makes reflective object access throw.\n * - The property proxy makes a named property read throw.\n * - The key proxy makes key enumeration throw.\n * - The prototype proxy makes a prototype read throw.\n * - The null-prototype record breaks a direct `hasOwnProperty` call.\n * - The array-target proxy passes an array check and makes an index read throw.\n * - The self-referential array makes JSON collection serialization throw.\n * - The sparse array violates the assumption that every index is enumerable.\n * - The hidden-key record violates the assumption that every own key is enumerable.\n * - The named getter makes its property read throw.\n * @example\n * ```ts\n * import { expect } from 'vitest'\n * import { createHostileValues } from '@orkestrel/test'\n *\n * function isWireRecord(value: unknown): value is Readonly<Record<string, string>> {\n * \tif (typeof value !== 'object' || value === null) return false\n * \ttry {\n * \t\tif (Object.getPrototypeOf(value) !== Object.prototype) return false\n * \t\tReflect.get(value, 'value')\n * \t\tif (Reflect.ownKeys(value).length === 0) return false\n * \t\treturn Object.values(value).every((member) => typeof member === 'string')\n * \t} catch {\n * \t\treturn false\n * \t}\n * }\n *\n * for (const [index, value] of createHostileValues().entries()) {\n * \tlet accepted: boolean | undefined\n * \texpect(() => {\n * \t\taccepted = isWireRecord(value)\n * \t}, `hostile value ${index}`).not.toThrow()\n * \texpect(accepted, `hostile value ${index}`).toBe(false)\n * }\n * ```\n */\nexport function createHostileValues(): readonly unknown[] {\n\tconst cyclic: Record<string, unknown> = {}\n\tcyclic.self = cyclic\n\tconst revoked = Proxy.revocable({}, {})\n\trevoked.revoke()\n\tconst cyclicArray: unknown[] = []\n\tcyclicArray.push(cyclicArray)\n\tconst sparseArray = Array<unknown>(2)\n\tsparseArray[1] = 'present'\n\tconst hidden = {}\n\tObject.defineProperty(hidden, 'hidden', { value: true })\n\tReflect.set(hidden, 'self', hidden)\n\tconst getter = {}\n\tObject.defineProperty(getter, 'danger', {\n\t\tenumerable: true,\n\t\tget() {\n\t\t\tthrow new Error('Hostile named getter read')\n\t\t},\n\t})\n\n\treturn Object.freeze([\n\t\tcyclic,\n\t\trevoked.proxy,\n\t\tnew Proxy(\n\t\t\t{},\n\t\t\t{\n\t\t\t\tget() {\n\t\t\t\t\tthrow new Error('Hostile property read')\n\t\t\t\t},\n\t\t\t},\n\t\t),\n\t\tnew Proxy(\n\t\t\t{},\n\t\t\t{\n\t\t\t\townKeys() {\n\t\t\t\t\tthrow new Error('Hostile key enumeration')\n\t\t\t\t},\n\t\t\t},\n\t\t),\n\t\tnew Proxy(\n\t\t\t{},\n\t\t\t{\n\t\t\t\tgetPrototypeOf() {\n\t\t\t\t\tthrow new Error('Hostile prototype read')\n\t\t\t\t},\n\t\t\t},\n\t\t),\n\t\tObject.create(null),\n\t\tnew Proxy([], {\n\t\t\tget() {\n\t\t\t\tthrow new Error('Hostile array index read')\n\t\t\t},\n\t\t}),\n\t\tcyclicArray,\n\t\tsparseArray,\n\t\thidden,\n\t\tgetter,\n\t])\n}\n\n/**\n * Creates a recorder for callback arguments.\n *\n * @typeParam TArgs - The argument tuple to record.\n * @returns A recorder whose handler appends calls in order.\n */\nexport function createRecorder<\n\tTArgs extends readonly unknown[] = readonly unknown[],\n>(): RecorderInterface<TArgs> {\n\tconst calls: TArgs[] = []\n\treturn {\n\t\tcalls,\n\t\tget count() {\n\t\t\treturn calls.length\n\t\t},\n\t\thandler(...args) {\n\t\t\tcalls.push(args)\n\t\t},\n\t\tclear() {\n\t\t\tcalls.length = 0\n\t\t},\n\t}\n}\n\n/**\n * Creates event recorders and subscribes them to the source.\n *\n * @typeParam TMap - The source's event names and delivered argument tuples.\n * @typeParam TName - The requested event names.\n * @param source - The source to subscribe to.\n * @param events - The events to record.\n * @returns A map from each requested event name to its recorder.\n * @throws Thrown when a listed event has no recorder, which a well-formed events array cannot\n * produce.\n * @remarks A duplicate event name installs a fresh recorder for every occurrence. The returned map\n * keeps the recorder installed for the last occurrence. `TName` derives from the array's element\n * type. An array declared with a wider union than its contents widens `TName` beyond the listed\n * events. The omitted key reads `undefined` at runtime under a non-optional type, and the guard\n * reports `true` because it checks the listed events. Pass a literal array or a tuple.\n */\nexport function createRecorders<\n\tTMap extends Record<string, readonly unknown[]>,\n\tTName extends keyof TMap,\n>(source: EventSourceInterface<TMap>, events: readonly TName[]): RecorderMap<TMap, TName> {\n\tconst building: { -readonly [K in TName]?: RecorderInterface<TMap[TName]> } = {}\n\tfor (const event of events) {\n\t\tconst recorder = createRecorder<TMap[TName]>()\n\t\tsource.on(event, recorder.handler)\n\t\tbuilding[event] = recorder\n\t}\n\tif (!isRecorderMapComplete<TMap, TName>(building, events)) {\n\t\tthrow new Error('Emitter recorder map is incomplete')\n\t}\n\treturn building\n}\n\n/**\n * Creates a real abort controller whose signal reports its live abort listeners.\n *\n * @returns The controller, its instrumented signal, and the current listener tally.\n * @remarks Instrumentation is installed on the created signal instance. A one-shot listener leaves\n * the tally when it fires, and removal accepts the original listener supplied by the caller. A\n * listener scoped by another signal leaves when that signal aborts. An already-aborted scope\n * installs and records nothing.\n */\nexport function createSignal(): SignalInterface {\n\tconst controller = new AbortController()\n\tconst signal = controller.signal\n\tconst add = signal.addEventListener.bind(signal)\n\tconst remove = signal.removeEventListener.bind(signal)\n\tconst registrations: Array<\n\t\treadonly [\n\t\t\tlistener: EventListener | EventListenerObject,\n\t\t\tinstalled: EventListener | EventListenerObject,\n\t\t\tcapture: boolean,\n\t\t\tcleanup: AbortController | undefined,\n\t\t]\n\t> = []\n\n\tObject.defineProperty(signal, 'addEventListener', {\n\t\tconfigurable: true,\n\t\tvalue(\n\t\t\ttype: string,\n\t\t\tlistener: EventListener | EventListenerObject | null,\n\t\t\toptions?: boolean | AddEventListenerOptions,\n\t\t) {\n\t\t\tif (listener === null) return\n\t\t\tif (type !== 'abort') {\n\t\t\t\tadd(type, listener, options)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tconst capture = typeof options === 'boolean' ? options : (options?.capture ?? false)\n\t\t\tconst scope = typeof options === 'object' ? options?.signal : undefined\n\t\t\tif (scope?.aborted === true) return\n\t\t\tif (\n\t\t\t\tregistrations.some(\n\t\t\t\t\t(registration) => registration[0] === listener && registration[2] === capture,\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tconst once = typeof options === 'object' && options?.once === true\n\t\t\tconst cleanup = scope === undefined ? undefined : new AbortController()\n\t\t\tconst installed: EventListenerObject = {\n\t\t\t\thandleEvent(event) {\n\t\t\t\t\tif (once) {\n\t\t\t\t\t\tconst index = registrations.findIndex((registration) => registration[1] === installed)\n\t\t\t\t\t\tconst registration = registrations[index]\n\t\t\t\t\t\tif (registration !== undefined) {\n\t\t\t\t\t\t\tregistrations.splice(index, 1)\n\t\t\t\t\t\t\tregistration[3]?.abort()\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (typeof listener === 'function') listener.call(signal, event)\n\t\t\t\t\telse listener.handleEvent(event)\n\t\t\t\t},\n\t\t\t}\n\t\t\tadd(\n\t\t\t\ttype,\n\t\t\t\tinstalled,\n\t\t\t\ttypeof options === 'object'\n\t\t\t\t\t? options?.passive === undefined\n\t\t\t\t\t\t? { capture, once }\n\t\t\t\t\t\t: { capture, once, passive: options.passive }\n\t\t\t\t\t: options,\n\t\t\t)\n\t\t\tregistrations.push([listener, installed, capture, cleanup])\n\t\t\tif (scope !== undefined && cleanup !== undefined) {\n\t\t\t\tscope.addEventListener(\n\t\t\t\t\t'abort',\n\t\t\t\t\t() => {\n\t\t\t\t\t\tconst index = registrations.findIndex((registration) => registration[1] === installed)\n\t\t\t\t\t\tconst registration = registrations[index]\n\t\t\t\t\t\tif (registration === undefined) return\n\t\t\t\t\t\tregistrations.splice(index, 1)\n\t\t\t\t\t\tregistration[3]?.abort()\n\t\t\t\t\t\tremove(type, registration[1], { capture })\n\t\t\t\t\t},\n\t\t\t\t\t{ once: true, signal: cleanup.signal },\n\t\t\t\t)\n\t\t\t}\n\t\t},\n\t})\n\tObject.defineProperty(signal, 'removeEventListener', {\n\t\tconfigurable: true,\n\t\tvalue(\n\t\t\ttype: string,\n\t\t\tlistener: EventListener | EventListenerObject | null,\n\t\t\toptions?: boolean | EventListenerOptions,\n\t\t) {\n\t\t\tif (listener === null) return\n\t\t\tif (type !== 'abort') {\n\t\t\t\tremove(type, listener, options)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tconst capture = typeof options === 'boolean' ? options : (options?.capture ?? false)\n\t\t\tconst index = registrations.findIndex(\n\t\t\t\t(registration) => registration[0] === listener && registration[2] === capture,\n\t\t\t)\n\t\t\tconst registration = registrations[index]\n\t\t\tif (registration === undefined) {\n\t\t\t\tremove(type, listener, options)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tregistrations.splice(index, 1)\n\t\t\tregistration[3]?.abort()\n\t\t\tremove(type, registration[1], options)\n\t\t},\n\t})\n\n\treturn {\n\t\tcontroller,\n\t\tsignal,\n\t\tget count() {\n\t\t\treturn registrations.length\n\t\t},\n\t}\n}\n\n/**\n * Creates a monotonically numbered resource factory with creation and destruction records.\n *\n * @returns A resource factory whose recorders retain every affected id in order.\n */\nexport function createResourceFactory(): ResourceFactoryInterface {\n\tconst created = createRecorder<readonly [id: number]>()\n\tconst destroyed = createRecorder<readonly [id: number]>()\n\treturn {\n\t\tcreated,\n\t\tdestroyed,\n\t\tcreate() {\n\t\t\tconst id = created.calls.length + 1\n\t\t\tcreated.handler(id)\n\t\t\treturn id\n\t\t},\n\t\tdestroy(id) {\n\t\t\tdestroyed.handler(id)\n\t\t},\n\t}\n}\n\n/**\n * Creates a teardown list that runs registered handlers newest-first.\n *\n * @returns A teardown list that awaits every handler and collects failures.\n */\nexport function createTeardown(): TeardownInterface {\n\tlet handlers: TeardownHandler[] = []\n\treturn {\n\t\tget count() {\n\t\t\treturn handlers.length\n\t\t},\n\t\tadd(handler) {\n\t\t\thandlers.push(handler)\n\t\t},\n\t\tasync destroy() {\n\t\t\tconst snapshot = handlers\n\t\t\thandlers = []\n\t\t\tconst failures: unknown[] = []\n\t\t\tfor (const handler of snapshot.reverse()) {\n\t\t\t\ttry {\n\t\t\t\t\tawait handler()\n\t\t\t\t} catch (error) {\n\t\t\t\t\tfailures.push(error)\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (failures.length === 1) throw failures[0]\n\t\t\tif (failures.length > 1) throw new AggregateError(failures)\n\t\t},\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;AAeA,SAAgB,sBAGd,OAAgB,QAA6D;CAC9E,IAAI;EACH,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;EACxD,OAAO,OAAO,OAAO,UAAU;GAC9B,IAAI,CAAC,OAAO,OAAO,OAAO,KAAK,GAAG,OAAO;GACzC,MAAM,WAAW,QAAQ,IAAI,OAAO,KAAK;GACzC,IAAI,OAAO,aAAa,YAAY,aAAa,MAAM,OAAO;GAC9D,OACC,OAAO,QAAQ,IAAI,UAAU,SAAS,MAAM,cAC5C,MAAM,QAAQ,QAAQ,IAAI,UAAU,OAAO,CAAC;EAE9C,CAAC;CACF,QAAQ;EACP,OAAO;CACR;AACD;;;;;;;;;ACnBA,SAAgB,aAAa,KAAK,GAAkB;CACnD,OAAO,IAAI,SAAS,YAAY,WAAW,SAAS,EAAE,CAAC;AACxD;;;;;;;;;AAUA,SAAgB,aAAa,QAAoC;CAChE,IAAI,OAAO,SAAS,OAAO,QAAQ,QAAQ;CAC3C,OAAO,IAAI,SAAS,YAAY,OAAO,iBAAiB,eAAe,QAAQ,GAAG,EAAE,MAAM,KAAK,CAAC,CAAC;AAClG;;;;;;;;;;;;;AAcA,eAAsB,iBACrB,aACA,WACA,SACgB;CAChB,MAAM,SAAS,SAAS,UAAU;CAClC,MAAM,WAAW,SAAS,YAAY;CACtC,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,GACxC,MAAM,IAAI,MAAM,6CAA6C;CAE9D,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW,GAC5C,MAAM,IAAI,MAAM,+CAA+C;CAGhE,MAAM,QAAQ,YAAY,IAAI;CAC9B,OAAO,MAAM;EACZ,SAAS,QAAQ,eAAe;EAChC,MAAM,OAAO,MAAM,UAAU;EAC7B,SAAS,QAAQ,eAAe;EAChC,IAAI,MAAM;EAEV,MAAM,UAAU,YAAY,IAAI,IAAI;EACpC,IAAI,WAAW,QACd,MAAM,IAAI,MACT,cAAc,YAAY,wBAAwB,OAAO,aAAa,QAAQ,IAC/E;EAED,MAAM,aAAa,QAAQ;CAC5B;AACD;;;;;;;;;;;;;;;;AAiBA,eAAsB,WACrB,aACA,SACA,WACA,SACa;CACb,MAAM,SAAS,SAAS,UAAU;CAClC,MAAM,WAAW,SAAS,YAAY;CACtC,MAAM,WAAW,SAAS;CAC1B,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,GACxC,MAAM,IAAI,MAAM,8CAA8C;CAE/D,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW,GAC5C,MAAM,IAAI,MAAM,gDAAgD;CAEjE,IAAI,aAAa,KAAA,MAAc,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,IACxE,MAAM,IAAI,MAAM,2CAA2C;CAG5D,MAAM,QAAQ,YAAY,IAAI;CAC9B,IAAI,QAAQ;CACZ,IAAI;CACJ,IAAI;CACJ,OAAO,MAAM;EACZ,SAAS,QAAQ,eAAe;EAChC,IAAI,QAAQ,GAAG;GACd,MAAM,UAAU,YAAY,IAAI,IAAI;GACpC,IAAI,WAAW,QACd,MAAM,IAAI,MACT,UAAU,YAAY,2BAA2B,OAAO,aAAa,QAAQ,KAAK,SAAS,KAAA,IAAY,KAAK,iBAAiB,KAAK,MAClI,EAAE,MAAM,CACT;EAEF;EACA,IAAI;EAGJ,IAAI;GACH,WAAW;IAAE,SAAS;IAAM,OAAO,MAAM,QAAQ;GAAE;EACpD,SAAS,OAAO;GACf,WAAW;IAAE,SAAS;IAAO;GAAM;EACpC;EACA,SAAS;EACT,SAAS,QAAQ,eAAe;EAEhC,IAAI,SAAS,SAAS;GACrB,IAAI,UAAU,SAAS,KAAK,GAAG,OAAO,SAAS;GAC/C,IAAI;GACJ,IAAI;IACH,MAAM,aAAa,KAAK,UAAU,SAAS,KAAK;IAChD,WAAW,eAAe,KAAA,IAAY,OAAO,SAAS,KAAK,IAAI;GAChE,QAAQ;IACP,IAAI;KACH,WAAW,OAAO,SAAS,KAAK;IACjC,QAAQ;KACP,WAAW;IACZ;GACD;GACA,OAAO,SAAS,SAAS,MAAM,GAAG,SAAS,MAAM,GAAG,GAAG,EAAE,OAAO;EACjE,OACC,QAAQ,SAAS;EAGlB,MAAM,UAAU,YAAY,IAAI,IAAI;EACpC,IAAI,WAAW,QACd,MAAM,IAAI,MACT,UAAU,YAAY,2BAA2B,OAAO,aAAa,QAAQ,KAAK,SAAS,KAAA,IAAY,KAAK,iBAAiB,KAAK,MAClI,EAAE,MAAM,CACT;EAED,IAAI,aAAa,KAAA,KAAa,SAAS,UACtC,MAAM,IAAI,MACT,UAAU,YAAY,2BAA2B,SAAS,WAAW,SAAS,KAAA,IAAY,KAAK,iBAAiB,KAAK,MACrH,EAAE,MAAM,CACT;EAED,MAAM,aAAa,KAAK,IAAI,UAAU,SAAS,OAAO,CAAC;CACxD;AACD;;;;;;;;;;;;;AAcA,SAAgB,gBAAmB,QAAiB,QAAiB,MAA6B;CACjG,IAAI,OAAO,WAAW,YAAY,MAAM,IAAI,UAAU,yBAAyB;CAE/E,OADkB,QAAQ,MAAM,QAAQ,QAAQ,IACzC;AACR;;;;;;;;;;;;AAaA,SAAgB,aAAgB,QAAiB,KAAqB;CACrE,KAAK,OAAO,WAAW,YAAY,WAAW,SAAS,OAAO,WAAW,YACxE,MAAM,IAAI,UAAU,sCAAsC;CAG3D,OADkB,QAAQ,IAAI,QAAQ,GAC/B;AACR;;;;;;;;;AAUA,SAAgB,eAAe,MAAuD;CACrF,OAAO,OAAO,OAAO,OAAO,YAAY,IAAI,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;AACrE;;;;;;;;;;;;;;AAeA,eAAsB,aACrB,WACA,aACA,SACiB;CACjB,MAAM,SAAS,SAAS,UAAU;CAClC,MAAM,WAAW,SAAS,YAAY;CACtC,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,GACxC,MAAM,IAAI,MAAM,8CAA8C;CAE/D,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW,GAC5C,MAAM,IAAI,MAAM,gDAAgD;CAGjE,MAAM,SAAS,SAAS;CACxB,QAAQ,eAAe;CACvB,MAAM,WAAW,QAAQ,cAAqB;CAC9C,MAAM,aAAa,IAAI,gBAAgB;CACvC,IAAI;CACJ,MAAM,UAAiC,CACtC,SAAS,SACT,IAAI,SAAS,UAAU,WAAW;EACjC,UAAU,iBAAiB;GAC1B,uBAAO,IAAI,MAAM,UAAU,YAAY,6BAA6B,OAAO,GAAG,CAAC;EAChF,GAAG,MAAM;CACV,CAAC,CACF;CACA,IAAI,WAAW,KAAA,GACd,QAAQ,KACP,IAAI,SAAS,UAAU,WAAW;EAEjC,YAD6B,IAAI,CAAC,QAAQ,WAAW,MAAM,CAC3D,CAAA,CAAS,iBACR,eACM;GACL,IAAI,OAAO,SAAS,OAAO,OAAO,MAAM;EACzC,GACA,EAAE,MAAM,KAAK,CACd;CACD,CAAC,CACF;CAED,MAAM,SAAS,QAAQ,KAAK,OAAO;CACnC,IAAI,UAA+B,KAAA;CACnC,IAAI;EACH,IAAI;GACH,UAAU,WAAW,GAAG,SAAS,SAAS,QAAQ,IAAI,CAAC;EACxD,SAAS,OAAO;GACf,SAAS,OAAO,KAAK;EACtB;EACA,OAAO,MAAM;CACd,UAAU;EACT,WAAW,MAAM;EACjB,IAAI,YAAY,KAAA,GAAW,aAAa,OAAO;EAC/C,UAAU;CACX;AACD;;;;;;;;;AAUA,SAAgB,gBAAgB,MAAkC;CACjE,MAAM,SAAoB,CAAC;CAC3B,KAAK,MAAM,CAAC,OAAO,aAAa,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,GAAG;EAC3D,MAAM,OAAO,SAAS,SAAS,IAAI,IAAI,SAAS,MAAM,GAAG,EAAE,IAAI;EAC/D,IAAI,KAAK,WAAW,GAAG;EACvB,IAAI;GACH,MAAM,QAAiB,KAAK,MAAM,IAAI;GACtC,OAAO,KAAK,KAAK;EAClB,SAAS,OAAO;GACf,MAAM,IAAI,MAAM,wBAAwB,QAAQ,KAAK,EAAE,MAAM,CAAC;EAC/D;CACD;CACA,OAAO;AACR;;;;;;;AAQA,SAAgB,aAAa,OAA+B;CAC3D,IAAI;EACH,MAAM;CACP,SAAS,OAAO;EACf,OAAO;CACR;AAED;;;;;;;;;AAUA,SAAgB,aAAgB,OAA6B,UAAU,qBAAwB;CAC9F,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,MAAM,IAAI,MAAM,OAAO;CAClE,OAAO;AACR;;;;;;;;AASA,eAAsB,QAAW,QAAiD;CACjF,MAAM,SAAc,CAAC;CACrB,WAAW,MAAM,SAAS,QAAQ,OAAO,KAAK,KAAK;CACnD,OAAO;AACR;;;;;;;;AASA,eAAsB,cAAiB,QAAkD;CACxF,MAAM,SAAS,OAAO,UAAU;CAChC,MAAM,SAAc,CAAC;CACrB,IAAI;EACH,OAAO,MAAM;GACZ,MAAM,SAAS,MAAM,OAAO,KAAK;GACjC,IAAI,OAAO,MAAM,OAAO;GACxB,OAAO,KAAK,OAAO,KAAK;EACzB;CACD,UAAU;EACT,OAAO,YAAY;CACpB;AACD;;;;;;;;;;;AAYA,SAAgB,cAAiB,OAA2B;CAC3D,MAAM,aAAa,KAAK,UAAU,QAAQ,MAAM,YAAY;EAC3D,IAAI,YAAY,KAAA,KAAa,OAAO,YAAY,cAAc,OAAO,YAAY,UAChF,MAAM,IAAI,MAAM,+DAA+D;EAEhF,IAAI,OAAO,YAAY,YAAY,CAAC,OAAO,SAAS,OAAO,GAC1D,MAAM,IAAI,MAAM,yCAAyC;EAE1D,OAAO;CACR,CAAC;CACD,MAAM,SAAY,KAAK,MAAM,UAAU;CACvC,MAAM,UAAqB,CAAC,MAAM;CAClC,OAAO,QAAQ,SAAS,GAAG;EAC1B,MAAM,UAAU,QAAQ,IAAI;EAC5B,IAAI,OAAO,YAAY,YAAY,CAAC,OAAO,SAAS,OAAO,GAC1D,MAAM,IAAI,MAAM,yCAAyC;EAE1D,IAAI,MAAM,QAAQ,OAAO,GACxB,KAAK,MAAM,SAAS,SAAS,QAAQ,KAAK,KAAK;OACzC,IAAI,OAAO,YAAY,YAAY,YAAY,MACrD,KAAK,MAAM,SAAS,OAAO,OAAO,OAAO,GAAG,QAAQ,KAAK,KAAK;CAEhE;CACA,OAAO;AACR;;;;;;;;AASA,SAAgB,YAAY,MAAuB;CAClD,OAAO,IAAI,IAAI,OAAO,KAAK,GAAG;AAC/B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzWA,SAAgB,sBAA0C;CACzD,MAAM,SAAkC,CAAC;CACzC,OAAO,OAAO;CACd,MAAM,UAAU,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC;CACtC,QAAQ,OAAO;CACf,MAAM,cAAyB,CAAC;CAChC,YAAY,KAAK,WAAW;CAC5B,MAAM,cAAc,MAAe,CAAC;CACpC,YAAY,KAAK;CACjB,MAAM,SAAS,CAAC;CAChB,OAAO,eAAe,QAAQ,UAAU,EAAE,OAAO,KAAK,CAAC;CACvD,QAAQ,IAAI,QAAQ,QAAQ,MAAM;CAClC,MAAM,SAAS,CAAC;CAChB,OAAO,eAAe,QAAQ,UAAU;EACvC,YAAY;EACZ,MAAM;GACL,MAAM,IAAI,MAAM,2BAA2B;EAC5C;CACD,CAAC;CAED,OAAO,OAAO,OAAO;EACpB;EACA,QAAQ;EACR,IAAI,MACH,CAAC,GACD,EACC,MAAM;GACL,MAAM,IAAI,MAAM,uBAAuB;EACxC,EACD,CACD;EACA,IAAI,MACH,CAAC,GACD,EACC,UAAU;GACT,MAAM,IAAI,MAAM,yBAAyB;EAC1C,EACD,CACD;EACA,IAAI,MACH,CAAC,GACD,EACC,iBAAiB;GAChB,MAAM,IAAI,MAAM,wBAAwB;EACzC,EACD,CACD;EACA,OAAO,OAAO,IAAI;EAClB,IAAI,MAAM,CAAC,GAAG,EACb,MAAM;GACL,MAAM,IAAI,MAAM,0BAA0B;EAC3C,EACD,CAAC;EACD;EACA;EACA;EACA;CACD,CAAC;AACF;;;;;;;AAQA,SAAgB,iBAEc;CAC7B,MAAM,QAAiB,CAAC;CACxB,OAAO;EACN;EACA,IAAI,QAAQ;GACX,OAAO,MAAM;EACd;EACA,QAAQ,GAAG,MAAM;GAChB,MAAM,KAAK,IAAI;EAChB;EACA,QAAQ;GACP,MAAM,SAAS;EAChB;CACD;AACD;;;;;;;;;;;;;;;;;AAkBA,SAAgB,gBAGd,QAAoC,QAAoD;CACzF,MAAM,WAAwE,CAAC;CAC/E,KAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,WAAW,eAA4B;EAC7C,OAAO,GAAG,OAAO,SAAS,OAAO;EACjC,SAAS,SAAS;CACnB;CACA,IAAI,CAAC,sBAAmC,UAAU,MAAM,GACvD,MAAM,IAAI,MAAM,oCAAoC;CAErD,OAAO;AACR;;;;;;;;;;AAWA,SAAgB,eAAgC;CAC/C,MAAM,aAAa,IAAI,gBAAgB;CACvC,MAAM,SAAS,WAAW;CAC1B,MAAM,MAAM,OAAO,iBAAiB,KAAK,MAAM;CAC/C,MAAM,SAAS,OAAO,oBAAoB,KAAK,MAAM;CACrD,MAAM,gBAOF,CAAC;CAEL,OAAO,eAAe,QAAQ,oBAAoB;EACjD,cAAc;EACd,MACC,MACA,UACA,SACC;GACD,IAAI,aAAa,MAAM;GACvB,IAAI,SAAS,SAAS;IACrB,IAAI,MAAM,UAAU,OAAO;IAC3B;GACD;GACA,MAAM,UAAU,OAAO,YAAY,YAAY,UAAW,SAAS,WAAW;GAC9E,MAAM,QAAQ,OAAO,YAAY,WAAW,SAAS,SAAS,KAAA;GAC9D,IAAI,OAAO,YAAY,MAAM;GAC7B,IACC,cAAc,MACZ,iBAAiB,aAAa,OAAO,YAAY,aAAa,OAAO,OACvE,GAEA;GAED,MAAM,OAAO,OAAO,YAAY,YAAY,SAAS,SAAS;GAC9D,MAAM,UAAU,UAAU,KAAA,IAAY,KAAA,IAAY,IAAI,gBAAgB;GACtE,MAAM,YAAiC,EACtC,YAAY,OAAO;IAClB,IAAI,MAAM;KACT,MAAM,QAAQ,cAAc,WAAW,iBAAiB,aAAa,OAAO,SAAS;KACrF,MAAM,eAAe,cAAc;KACnC,IAAI,iBAAiB,KAAA,GAAW;MAC/B,cAAc,OAAO,OAAO,CAAC;MAC7B,aAAa,EAAE,EAAE,MAAM;KACxB;IACD;IACA,IAAI,OAAO,aAAa,YAAY,SAAS,KAAK,QAAQ,KAAK;SAC1D,SAAS,YAAY,KAAK;GAChC,EACD;GACA,IACC,MACA,WACA,OAAO,YAAY,WAChB,SAAS,YAAY,KAAA,IACpB;IAAE;IAAS;GAAK,IAChB;IAAE;IAAS;IAAM,SAAS,QAAQ;GAAQ,IAC3C,OACJ;GACA,cAAc,KAAK;IAAC;IAAU;IAAW;IAAS;GAAO,CAAC;GAC1D,IAAI,UAAU,KAAA,KAAa,YAAY,KAAA,GACtC,MAAM,iBACL,eACM;IACL,MAAM,QAAQ,cAAc,WAAW,iBAAiB,aAAa,OAAO,SAAS;IACrF,MAAM,eAAe,cAAc;IACnC,IAAI,iBAAiB,KAAA,GAAW;IAChC,cAAc,OAAO,OAAO,CAAC;IAC7B,aAAa,EAAE,EAAE,MAAM;IACvB,OAAO,MAAM,aAAa,IAAI,EAAE,QAAQ,CAAC;GAC1C,GACA;IAAE,MAAM;IAAM,QAAQ,QAAQ;GAAO,CACtC;EAEF;CACD,CAAC;CACD,OAAO,eAAe,QAAQ,uBAAuB;EACpD,cAAc;EACd,MACC,MACA,UACA,SACC;GACD,IAAI,aAAa,MAAM;GACvB,IAAI,SAAS,SAAS;IACrB,OAAO,MAAM,UAAU,OAAO;IAC9B;GACD;GACA,MAAM,UAAU,OAAO,YAAY,YAAY,UAAW,SAAS,WAAW;GAC9E,MAAM,QAAQ,cAAc,WAC1B,iBAAiB,aAAa,OAAO,YAAY,aAAa,OAAO,OACvE;GACA,MAAM,eAAe,cAAc;GACnC,IAAI,iBAAiB,KAAA,GAAW;IAC/B,OAAO,MAAM,UAAU,OAAO;IAC9B;GACD;GACA,cAAc,OAAO,OAAO,CAAC;GAC7B,aAAa,EAAE,EAAE,MAAM;GACvB,OAAO,MAAM,aAAa,IAAI,OAAO;EACtC;CACD,CAAC;CAED,OAAO;EACN;EACA;EACA,IAAI,QAAQ;GACX,OAAO,cAAc;EACtB;CACD;AACD;;;;;;AAOA,SAAgB,wBAAkD;CACjE,MAAM,UAAU,eAAsC;CACtD,MAAM,YAAY,eAAsC;CACxD,OAAO;EACN;EACA;EACA,SAAS;GACR,MAAM,KAAK,QAAQ,MAAM,SAAS;GAClC,QAAQ,QAAQ,EAAE;GAClB,OAAO;EACR;EACA,QAAQ,IAAI;GACX,UAAU,QAAQ,EAAE;EACrB;CACD;AACD;;;;;;AAOA,SAAgB,iBAAoC;CACnD,IAAI,WAA8B,CAAC;CACnC,OAAO;EACN,IAAI,QAAQ;GACX,OAAO,SAAS;EACjB;EACA,IAAI,SAAS;GACZ,SAAS,KAAK,OAAO;EACtB;EACA,MAAM,UAAU;GACf,MAAM,WAAW;GACjB,WAAW,CAAC;GACZ,MAAM,WAAsB,CAAC;GAC7B,KAAK,MAAM,WAAW,SAAS,QAAQ,GACtC,IAAI;IACH,MAAM,QAAQ;GACf,SAAS,OAAO;IACf,SAAS,KAAK,KAAK;GACpB;GAED,IAAI,SAAS,WAAW,GAAG,MAAM,SAAS;GAC1C,IAAI,SAAS,SAAS,GAAG,MAAM,IAAI,eAAe,QAAQ;EAC3D;CACD;AACD"}
+{"version":3,"file":"index.js","names":[],"sources":["../../../src/core/constants.ts","../../../src/core/validators.ts","../../../src/core/helpers.ts","../../../src/core/factories.ts"],"sourcesContent":["/**\n * Names the attributes a statechart harness publishes, keyed by the fact each one carries.\n *\n * @remarks\n * A harness renders its own table and a gate outside the page polls the rendered markup, so these\n * names are the whole contract between the two. `status`, `passed`, `failed`, and `total` belong on\n * the harness root, because a gate finds the harness by `status` and reads the tally from the same\n * element. `scenario` and `result` belong on each row, so a failing row is found by `result` and\n * named by `scenario`. `state` belongs on the element rendering the entity's current state.\n *\n * The values are the attribute names themselves, so a harness writes `setAttribute` against this map\n * and a gate writes `querySelector` against it, and neither spells a `data-statechart-*` string of\n * its own.\n *\n * @example\n * ```ts\n * harness.getAttribute(STATECHART_ATTRIBUTES.status) // 'passed'\n * ```\n */\nexport const STATECHART_ATTRIBUTES = Object.freeze({\n\tstatus: 'data-statechart-status',\n\tpassed: 'data-statechart-passed',\n\tfailed: 'data-statechart-failed',\n\ttotal: 'data-statechart-total',\n\tscenario: 'data-statechart-scenario',\n\tresult: 'data-statechart-result',\n\tstate: 'data-statechart-state',\n})\n\n/**\n * Lists every value a statechart harness reports through its `status` attribute.\n *\n * @remarks\n * `pending` is what a harness carries before a run has produced a result for every row, `idle` is a\n * harness standing ready with nothing running, and `running` is a run in flight. `passed` and\n * `failed` are the two terminal readings, so a gate waits for membership in that pair rather than\n * for a fixed duration.\n *\n * The tuple's order is the order a run passes through, and its element type is the literal union, so\n * `(typeof STATECHART_STATUSES)[number]` is the status type a harness and its gate share.\n *\n * @example\n * ```ts\n * const terminal = new Set<string>([STATECHART_STATUSES[3], STATECHART_STATUSES[4]])\n * ```\n */\nexport const STATECHART_STATUSES = Object.freeze([\n\t'pending',\n\t'idle',\n\t'running',\n\t'passed',\n\t'failed',\n] as const)\n","import type { RecorderMap } from './types.js'\n\n/**\n * Checks whether a value contains a recorder for every listed event.\n *\n * @typeParam TMap - The source's event names and delivered argument tuples.\n * @typeParam TName - The event names represented in the map.\n * @param value - The value to inspect.\n * @param events - The events the completed map must contain.\n * @returns True if every listed event has a structurally valid recorder; false otherwise.\n * @remarks Per-key tuple precision is the predicate's claim. The factory proves that claim by\n * wiring each recorder to exactly the event where it stores that recorder. A direct caller must\n * establish the same pairing before it relies on the narrowing. This guard takes the listed events\n * through a reference parameter rather than using the canonical single-value guard form.\n */\nexport function isRecorderMapComplete<\n\tTMap extends Record<string, readonly unknown[]>,\n\tTName extends keyof TMap,\n>(value: unknown, events: readonly TName[]): value is RecorderMap<TMap, TName> {\n\ttry {\n\t\tif (typeof value !== 'object' || value === null) return false\n\t\treturn events.every((event) => {\n\t\t\tif (!Object.hasOwn(value, event)) return false\n\t\t\tconst recorder = Reflect.get(value, event)\n\t\t\tif (typeof recorder !== 'object' || recorder === null) return false\n\t\t\treturn (\n\t\t\t\ttypeof Reflect.get(recorder, 'handler') === 'function' &&\n\t\t\t\tArray.isArray(Reflect.get(recorder, 'calls'))\n\t\t\t)\n\t\t})\n\t} catch {\n\t\treturn false\n\t}\n}\n","import type {\n\tEventSubscriber,\n\tHeadersSource,\n\tJSONSafe,\n\tResult,\n\tRetryOptions,\n\tSignalRegistration,\n\tStateScenario,\n\tWaitOptions,\n} from './types.js'\n\n/**\n * Checks the resolved bounds one bounded wait runs under.\n *\n * @param subject - The bound's owner, which opens each refusal message.\n * @param budget - The resolved elapsed-time limit in milliseconds.\n * @param interval - The resolved delay between readings in milliseconds.\n * @throws An `Error` reading `<subject> budget must be finite and non-negative` or\n * `<subject> interval must be finite and non-negative`.\n * @remarks Every member of the wait family resolves its own defaults first and passes the resolved\n * numbers here, so each keeps its own defaults while one contract states what a bound must be.\n */\nexport function checkBounds(subject: string, budget: number, interval: number): void {\n\tif (!Number.isFinite(budget) || budget < 0) {\n\t\tthrow new Error(`${subject} budget must be finite and non-negative`)\n\t}\n\tif (!Number.isFinite(interval) || interval < 0) {\n\t\tthrow new Error(`${subject} interval must be finite and non-negative`)\n\t}\n}\n\n/**\n * Builds the error {@link retryUntil} raises when its elapsed-time budget runs out.\n *\n * @param description - The operation the retry was named for.\n * @param budget - The elapsed-time limit in milliseconds.\n * @param elapsed - The milliseconds the retry actually spent.\n * @param last - The rendered last unsatisfying value, or `undefined` when the retry produced none.\n * @param cause - The last producer error, which becomes the returned error's `cause`.\n * @returns The exhaustion error, unthrown.\n * @remarks Both of `retryUntil`'s elapsed checks raise this one message, so an edit to it lands in\n * one place. The rendered value is appended only when the retry produced one.\n */\nexport function buildRetryExhausted(\n\tdescription: string,\n\tbudget: number,\n\telapsed: number,\n\tlast: string | undefined,\n\tcause: unknown,\n): Error {\n\treturn new Error(\n\t\t`Retry \"${description}\" did not succeed within ${budget}ms (waited ${elapsed}ms)${last === undefined ? '' : ` (last value: ${last})`}`,\n\t\t{ cause },\n\t)\n}\n\n/**\n * Drops the registration an instrumented signal installed for one listener.\n *\n * @param registrations - The live registration list, spliced in place.\n * @param installed - The installed listener naming the registration to drop.\n * @returns The dropped registration, or `undefined` when the list holds none for that listener.\n * @remarks The dropped registration's cleanup controller is aborted as it leaves, so the scope\n * subscription installed beside it leaves with it. Removing the installed listener from the signal\n * stays with the caller, because only the scope-abort path has one to remove.\n */\nexport function dropRegistration(\n\tregistrations: SignalRegistration[],\n\tinstalled: EventListener | EventListenerObject,\n): SignalRegistration | undefined {\n\tconst index = registrations.findIndex((registration) => registration[1] === installed)\n\tconst registration = registrations[index]\n\tif (registration === undefined) return undefined\n\tregistrations.splice(index, 1)\n\tregistration[3]?.abort()\n\treturn registration\n}\n\n/**\n * Waits for a host timer to elapse.\n *\n * @param ms - The delay in milliseconds.\n * @returns A promise that resolves after the timer fires.\n */\nexport function waitForDelay(ms = 0): Promise<void> {\n\treturn new Promise((resolve) => setTimeout(resolve, ms))\n}\n\n/**\n * Waits until an abort signal is aborted.\n *\n * @param signal - The signal to observe.\n * @returns A promise that resolves when the signal is aborted.\n * @remarks An already-aborted signal resolves immediately. Otherwise the wait parks on a one-shot\n * abort listener without a timer or polling.\n */\nexport function waitForAbort(signal: AbortSignal): Promise<void> {\n\tif (signal.aborted) return Promise.resolve()\n\treturn new Promise((resolve) => signal.addEventListener('abort', () => resolve(), { once: true }))\n}\n\n/**\n * Waits until a condition holds within an elapsed-time budget.\n *\n * @param description - The condition described in a timeout error.\n * @param condition - The synchronous or asynchronous condition to read.\n * @param options - The time bounds and abort signal.\n * @returns A promise that resolves when the condition first returns `true`.\n * @throws The condition's thrown value, the abort reason, or an `Error` when a bound is invalid or\n * the condition does not hold within the budget.\n * @remarks The first read is immediate. Default budget: `1000` milliseconds. Default interval: `10`\n * milliseconds.\n */\nexport async function waitForCondition(\n\tdescription: string,\n\tcondition: () => boolean | Promise<boolean>,\n\toptions?: WaitOptions,\n): Promise<void> {\n\tconst budget = options?.budget ?? 1000\n\tconst interval = options?.interval ?? 10\n\tcheckBounds('Wait', budget, interval)\n\n\tconst start = performance.now()\n\twhile (true) {\n\t\toptions?.signal?.throwIfAborted()\n\t\tconst held = await condition()\n\t\toptions?.signal?.throwIfAborted()\n\t\tif (held) return\n\n\t\tconst elapsed = performance.now() - start\n\t\tif (elapsed >= budget) {\n\t\t\tthrow new Error(\n\t\t\t\t`Condition \"${description}\" did not hold within ${budget}ms (waited ${elapsed}ms)`,\n\t\t\t)\n\t\t}\n\t\tawait waitForDelay(interval)\n\t}\n}\n\n/**\n * Repeats a producer until one produced value satisfies a predicate.\n *\n * @typeParam T - The produced value type.\n * @param description - The operation described in an exhaustion error.\n * @param produce - The synchronous or asynchronous operation to repeat.\n * @param satisfied - The predicate that accepts a produced value.\n * @param options - The time, attempt, and abort bounds.\n * @returns The first produced value the predicate accepts.\n * @throws The predicate's thrown value, the abort reason, or an `Error` when a bound is invalid or\n * the retry exhausts its budget or attempts.\n * @remarks A producer throw counts as an unsatisfied attempt. The last producer error becomes the\n * exhaustion error's `cause`. Default budget: `1000` milliseconds. Default interval: `10`\n * milliseconds.\n */\nexport async function retryUntil<T>(\n\tdescription: string,\n\tproduce: () => T | Promise<T>,\n\tsatisfied: (value: T) => boolean,\n\toptions?: RetryOptions,\n): Promise<T> {\n\tconst budget = options?.budget ?? 1000\n\tconst interval = options?.interval ?? 10\n\tconst attempts = options?.attempts\n\tcheckBounds('Retry', budget, interval)\n\tif (attempts !== undefined && (!Number.isInteger(attempts) || attempts < 1)) {\n\t\tthrow new Error('Retry attempts must be a positive integer')\n\t}\n\n\tconst start = performance.now()\n\tlet count = 0\n\tlet cause: unknown\n\tlet last: string | undefined\n\twhile (true) {\n\t\toptions?.signal?.throwIfAborted()\n\t\tif (count > 0) {\n\t\t\tconst elapsed = performance.now() - start\n\t\t\tif (elapsed >= budget) {\n\t\t\t\tthrow buildRetryExhausted(description, budget, elapsed, last, cause)\n\t\t\t}\n\t\t}\n\t\tlet produced: Result<T, unknown>\n\t\ttry {\n\t\t\tproduced = { success: true, value: await produce() }\n\t\t} catch (error) {\n\t\t\tproduced = { success: false, error }\n\t\t}\n\t\tcount += 1\n\t\toptions?.signal?.throwIfAborted()\n\n\t\tif (produced.success) {\n\t\t\tif (satisfied(produced.value)) return produced.value\n\t\t\tlet rendered: string\n\t\t\ttry {\n\t\t\t\tconst serialized = JSON.stringify(produced.value)\n\t\t\t\trendered = serialized === undefined ? String(produced.value) : serialized\n\t\t\t} catch {\n\t\t\t\ttry {\n\t\t\t\t\trendered = String(produced.value)\n\t\t\t\t} catch {\n\t\t\t\t\trendered = '[unrenderable]'\n\t\t\t\t}\n\t\t\t}\n\t\t\tlast = rendered.length > 200 ? `${rendered.slice(0, 197)}...` : rendered\n\t\t} else {\n\t\t\tcause = produced.error\n\t\t}\n\n\t\tconst elapsed = performance.now() - start\n\t\tif (elapsed >= budget) {\n\t\t\tthrow buildRetryExhausted(description, budget, elapsed, last, cause)\n\t\t}\n\t\tif (attempts !== undefined && count >= attempts) {\n\t\t\tthrow new Error(\n\t\t\t\t`Retry \"${description}\" did not succeed within ${attempts} attempts${last === undefined ? '' : ` (last value: ${last})`}`,\n\t\t\t\t{ cause },\n\t\t\t)\n\t\t}\n\t\tawait waitForDelay(Math.min(interval, budget - elapsed))\n\t}\n}\n\n/**\n * Invokes an unknown method through an explicit unchecked result contract.\n *\n * @typeParam T - The result type claimed by the caller.\n * @param target - The value used as the method's `this` argument.\n * @param method - The unknown method to invoke.\n * @param args - The arguments to pass.\n * @returns The method's result under the caller's claimed type.\n * @throws A `TypeError` when `method` is not callable.\n * @remarks The caller owns the claim that the returned value has type `T`. The contained `any`\n * bridges the unchecked runtime result to that caller-owned claim.\n */\nexport function invokeUnchecked<T>(target: unknown, method: unknown, args: readonly unknown[]): T {\n\tif (typeof method !== 'function') throw new TypeError('Method must be callable')\n\tconst result: T = Reflect.apply(method, target, args)\n\treturn result\n}\n\n/**\n * Reads a property from an unknown object or function.\n *\n * @typeParam T - The property type claimed by the caller.\n * @param target - The unknown value to read.\n * @param key - The property key to read.\n * @returns The property value under the caller's claimed type.\n * @throws A `TypeError` when `target` is neither an object nor a function.\n * @remarks The caller owns the claim that the returned value has type `T`. The contained `any`\n * bridges the unchecked runtime result to that caller-owned claim.\n */\nexport function readProperty<T>(target: unknown, key: PropertyKey): T {\n\tif ((typeof target !== 'object' || target === null) && typeof target !== 'function') {\n\t\tthrow new TypeError('Target must be an object or function')\n\t}\n\tconst result: T = Reflect.get(target, key)\n\treturn result\n}\n\n/**\n * Normalizes headers into a frozen plain record.\n *\n * @param init - The platform header initializer to normalize.\n * @returns A frozen record of normalized header names and values.\n * @remarks Normalization follows the host `Headers` implementation, including lowercased names and\n * combined values.\n */\nexport function flattenHeaders(init: HeadersSource): Readonly<Record<string, string>> {\n\treturn Object.freeze(Object.fromEntries(new Headers(init).entries()))\n}\n\n/**\n * Waits for the first delivery from an event subscription.\n *\n * @typeParam TArgs - The delivered argument tuple.\n * @param subscribe - The function that installs the event listener and may return its cleanup.\n * @param description - The event described in a timeout error.\n * @param options - The time bounds and abort signal.\n * @returns The first delivered argument tuple.\n * @throws The subscription's thrown value, the abort reason, or an `Error` when a bound is invalid\n * or the event is not delivered within the budget.\n * @remarks Default budget: `1000` milliseconds. The interval is validated for consistency with the\n * wait family but is not used because this helper parks on the event.\n */\nexport async function waitForEvent<TArgs extends readonly unknown[]>(\n\tsubscribe: EventSubscriber<TArgs>,\n\tdescription: string,\n\toptions?: WaitOptions,\n): Promise<TArgs> {\n\tconst budget = options?.budget ?? 1000\n\tconst interval = options?.interval ?? 10\n\tcheckBounds('Event', budget, interval)\n\n\tconst signal = options?.signal\n\tsignal?.throwIfAborted()\n\tconst delivery = Promise.withResolvers<TArgs>()\n\tconst controller = new AbortController()\n\tlet timeout: ReturnType<typeof setTimeout> | undefined\n\tconst pending: Array<Promise<TArgs>> = [\n\t\tdelivery.promise,\n\t\tnew Promise((_resolve, reject) => {\n\t\t\ttimeout = setTimeout(() => {\n\t\t\t\treject(new Error(`Event \"${description}\" was not delivered within ${budget}ms`))\n\t\t\t}, budget)\n\t\t}),\n\t]\n\tif (signal !== undefined) {\n\t\tpending.push(\n\t\t\tnew Promise((_resolve, reject) => {\n\t\t\t\tconst combined = AbortSignal.any([signal, controller.signal])\n\t\t\t\tcombined.addEventListener(\n\t\t\t\t\t'abort',\n\t\t\t\t\t() => {\n\t\t\t\t\t\tif (signal.aborted) reject(signal.reason)\n\t\t\t\t\t},\n\t\t\t\t\t{ once: true },\n\t\t\t\t)\n\t\t\t}),\n\t\t)\n\t}\n\tconst result = Promise.race(pending)\n\tlet cleanup: (() => void) | void = undefined\n\ttry {\n\t\ttry {\n\t\t\tcleanup = subscribe((...args) => delivery.resolve(args))\n\t\t} catch (error) {\n\t\t\tdelivery.reject(error)\n\t\t}\n\t\treturn await result\n\t} finally {\n\t\tcontroller.abort()\n\t\tif (timeout !== undefined) clearTimeout(timeout)\n\t\tcleanup?.()\n\t}\n}\n\n/**\n * Decodes newline-delimited JSON values.\n *\n * @param text - The JSON Lines text to decode.\n * @returns The decoded values in physical-line order.\n * @throws An `Error` naming the malformed physical line, with the native `SyntaxError` as its\n * `cause`.\n */\nexport function decodeJSONLines(text: string): readonly unknown[] {\n\tconst values: unknown[] = []\n\tfor (const [index, physical] of text.split('\\n').entries()) {\n\t\tconst line = physical.endsWith('\\r') ? physical.slice(0, -1) : physical\n\t\tif (line.length === 0) continue\n\t\ttry {\n\t\t\tconst value: unknown = JSON.parse(line)\n\t\t\tvalues.push(value)\n\t\t} catch (cause) {\n\t\t\tthrow new Error(`Invalid JSON on line ${index + 1}`, { cause })\n\t\t}\n\t}\n\treturn values\n}\n\n/**\n * Captures the value thrown by a thunk.\n *\n * @param thunk - The work whose thrown value to capture.\n * @returns The thrown value, or `undefined` when the thunk completes.\n */\nexport function captureError(thunk: () => unknown): unknown {\n\ttry {\n\t\tthunk()\n\t} catch (error) {\n\t\treturn error\n\t}\n\treturn undefined\n}\n\n/**\n * Requires a value to be present.\n *\n * @typeParam T - The required value type.\n * @param value - The value to check.\n * @param message - The error message used when the value is absent.\n * @returns The present value.\n */\nexport function requireValue<T>(value: T | null | undefined, message = 'Value is required'): T {\n\tif (value === null || value === undefined) throw new Error(message)\n\treturn value\n}\n\n/**\n * Collects every value from an async iterable.\n *\n * @typeParam T - The yielded value type.\n * @param source - The async iterable to drain.\n * @returns The yielded values in iteration order.\n */\nexport async function collect<T>(source: AsyncIterable<T>): Promise<readonly T[]> {\n\tconst values: T[] = []\n\tfor await (const value of source) values.push(value)\n\treturn values\n}\n\n/**\n * Collects every value from a readable stream.\n *\n * @typeParam T - The streamed value type.\n * @param stream - The readable stream to drain.\n * @returns The streamed values in read order.\n */\nexport async function collectStream<T>(stream: ReadableStream<T>): Promise<readonly T[]> {\n\tconst reader = stream.getReader()\n\tconst values: T[] = []\n\ttry {\n\t\twhile (true) {\n\t\t\tconst result = await reader.read()\n\t\t\tif (result.done) return values\n\t\t\tvalues.push(result.value)\n\t\t}\n\t} finally {\n\t\treader.releaseLock()\n\t}\n}\n\n/**\n * Copies a JSON value through serialization and parsing.\n *\n * @typeParam T - The copied value's type, which the copy keeps.\n * @param value - The value to copy, bounded by its own `JSONSafe` projection.\n * @returns The parsed JSON copy.\n * @remarks Non-finite numbers throw because JSON would replace them with `null`. Negative zero is\n * normalized to zero by JSON serialization. The bound intersects `JSONSafe<T>` rather than\n * constraining `T` to `JSONValue`, so an interface-typed value round-trips.\n */\nexport function roundTripJSON<T>(value: T & JSONSafe<T>): T {\n\tconst serialized = JSON.stringify(value, (_key, current) => {\n\t\tif (current === undefined || typeof current === 'function' || typeof current === 'symbol') {\n\t\t\tthrow new Error('JSON values must not contain undefined, functions, or symbols')\n\t\t}\n\t\tif (typeof current === 'number' && !Number.isFinite(current)) {\n\t\t\tthrow new Error('JSON values must contain finite numbers')\n\t\t}\n\t\treturn current\n\t})\n\tconst parsed: T = JSON.parse(serialized)\n\tconst pending: unknown[] = [parsed]\n\twhile (pending.length > 0) {\n\t\tconst current = pending.pop()\n\t\tif (typeof current === 'number' && !Number.isFinite(current)) {\n\t\t\tthrow new Error('JSON values must contain finite numbers')\n\t\t}\n\t\tif (Array.isArray(current)) {\n\t\t\tfor (const child of current) pending.push(child)\n\t\t} else if (typeof current === 'object' && current !== null) {\n\t\t\tfor (const child of Object.values(current)) pending.push(child)\n\t\t}\n\t}\n\treturn parsed\n}\n\n/**\n * Resolves the parent directory of a calling module, which is the workspace root when called from\n * the conventional `tests/setup.ts` location.\n *\n * @param meta - The calling module metadata.\n * @returns The root URL one directory above the calling file.\n */\nexport function resolveRoot(meta: ImportMeta): URL {\n\treturn new URL('../', meta.url)\n}\n\n/**\n * Drives one statechart scenario through its arrange, act, and assert phases.\n *\n * @typeParam TState - The states the entity moves between.\n * @typeParam TEvent - The events the entity accepts.\n * @typeParam TContext - The fixture the phases drive.\n * @param scenario - The scenario to drive.\n * @param context - The fixture handed to each phase.\n * @returns A promise that resolves after the assert phase completes.\n * @throws An `Error` whose message opens with the transition's `name` and whose `cause` is the value\n * the failing phase threw.\n * @remarks Each phase is awaited before the next begins, so an asynchronous arrange settles before\n * the event is applied. The phases receive the transition's own parts: `arrange` receives `from`,\n * `act` receives `event`, and `assert` receives `to`.\n *\n * The row's name is prepended because a table's rows run under one test name, so a bare assertion\n * message says what failed and never which row. A thrown `Error` keeps its own message after the\n * name and arrives as the `cause`; anything else thrown is named by its type and arrives as the\n * `cause` unchanged.\n *\n * @example\n * ```ts\n * await executeScenario(scenarios[0], { disclosure: new Disclosure() })\n * ```\n */\nexport async function executeScenario<TState extends string, TEvent extends string, TContext>(\n\tscenario: StateScenario<TState, TEvent, TContext>,\n\tcontext: TContext,\n): Promise<void> {\n\tconst transition = scenario.transition\n\ttry {\n\t\tawait scenario.arrange(context, transition.from)\n\t\tawait scenario.act(context, transition.event)\n\t\tawait scenario.assert(context, transition.to)\n\t} catch (cause) {\n\t\tconst message =\n\t\t\tcause instanceof Error ? cause.message : `threw a non-error ${typeof cause} value`\n\t\tthrow new Error(`${transition.name}: ${message}`, { cause })\n\t}\n}\n\n/**\n * Drives a statechart table row by row, each row against a context of its own.\n *\n * @typeParam TState - The states the entity moves between.\n * @typeParam TEvent - The events the entity accepts.\n * @typeParam TContext - The fixture the phases drive.\n * @param scenarios - The table to drive, in the order it is written.\n * @param build - The fixture builder, called once per row and awaited when it returns a promise.\n * @returns A promise that resolves after the last row completes.\n * @throws An `Error` reading `<name>: build refused` when the row's builder throws or rejects, whose\n * `cause` is the value the builder refused with, or whatever {@link executeScenario} throws for the\n * first row whose phases fail. Either way the run stops at that row and the rows after it never\n * start.\n * @remarks The rows run one after another rather than together: a statechart's rows drive one\n * entity on one page, so a parallel run would have them arranging over each other. `build` receives\n * the row it is building for, which is what lets one table mix fixtures.\n *\n * A refusing builder is named for its row the way a failing phase is, because a table's rows build\n * under one test name too. The refusal itself arrives as the `cause`, by identity, so its own\n * message and stack survive the naming.\n *\n * @example\n * ```ts\n * await executeScenarios(SCENARIOS, () => ({ disclosure: new Disclosure() }))\n * ```\n */\nexport async function executeScenarios<TState extends string, TEvent extends string, TContext>(\n\tscenarios: ReadonlyArray<StateScenario<TState, TEvent, TContext>>,\n\tbuild: (scenario: StateScenario<TState, TEvent, TContext>) => TContext | Promise<TContext>,\n): Promise<void> {\n\tfor (const scenario of scenarios) {\n\t\tlet context: TContext\n\t\ttry {\n\t\t\tcontext = await build(scenario)\n\t\t} catch (cause) {\n\t\t\tthrow new Error(`${scenario.transition.name}: build refused`, { cause })\n\t\t}\n\t\tawait executeScenario(scenario, context)\n\t}\n}\n","import type {\n\tEventSourceInterface,\n\tRecorderInterface,\n\tRecorderMap,\n\tResourceFactoryInterface,\n\tSignalInterface,\n\tSignalRegistration,\n\tTeardownHandler,\n\tTeardownInterface,\n} from './types.js'\nimport { dropRegistration } from './helpers.js'\nimport { isRecorderMapComplete } from './validators.js'\n\n/**\n * Creates values that make common object readers throw or violate their assumptions.\n *\n * @returns A frozen array whose values are fresh on every call.\n * @remarks Every member makes a naive read throw or violates a naive structural assumption. A total\n * guard survives every member without throwing. Whether it accepts or refuses one is that guard's\n * own contract. Membership may grow in a release, so test the whole returned set in a loop and\n * include the index in each failure.\n *\n * - The self-referential record makes JSON record serialization throw.\n * - The revoked object proxy makes reflective object access throw.\n * - The property proxy makes a named property read throw.\n * - The key proxy makes key enumeration throw.\n * - The prototype proxy makes a prototype read throw.\n * - The null-prototype record breaks a direct `hasOwnProperty` call.\n * - The array-target proxy passes an array check and makes an index read throw.\n * - The self-referential array makes JSON collection serialization throw.\n * - The sparse array violates the assumption that every index is enumerable.\n * - The hidden-key record violates the assumption that every own key is enumerable.\n * - The named getter makes its property read throw.\n * @example\n * ```ts\n * import { expect } from 'vitest'\n * import { createHostileValues } from '@orkestrel/test'\n *\n * function isWireRecord(value: unknown): value is Readonly<Record<string, string>> {\n * \tif (typeof value !== 'object' || value === null) return false\n * \ttry {\n * \t\tif (Object.getPrototypeOf(value) !== Object.prototype) return false\n * \t\tReflect.get(value, 'value')\n * \t\tif (Reflect.ownKeys(value).length === 0) return false\n * \t\treturn Object.values(value).every((member) => typeof member === 'string')\n * \t} catch {\n * \t\treturn false\n * \t}\n * }\n *\n * for (const [index, value] of createHostileValues().entries()) {\n * \tlet accepted: boolean | undefined\n * \texpect(() => {\n * \t\taccepted = isWireRecord(value)\n * \t}, `hostile value ${index}`).not.toThrow()\n * \texpect(accepted, `hostile value ${index}`).toBe(false)\n * }\n * ```\n */\nexport function createHostileValues(): readonly unknown[] {\n\tconst cyclic: Record<string, unknown> = {}\n\tcyclic.self = cyclic\n\tconst revoked = Proxy.revocable({}, {})\n\trevoked.revoke()\n\tconst cyclicArray: unknown[] = []\n\tcyclicArray.push(cyclicArray)\n\tconst sparseArray = Array<unknown>(2)\n\tsparseArray[1] = 'present'\n\tconst hidden = {}\n\tObject.defineProperty(hidden, 'hidden', { value: true })\n\tReflect.set(hidden, 'self', hidden)\n\tconst getter = {}\n\tObject.defineProperty(getter, 'danger', {\n\t\tenumerable: true,\n\t\tget() {\n\t\t\tthrow new Error('Hostile named getter read')\n\t\t},\n\t})\n\n\treturn Object.freeze([\n\t\tcyclic,\n\t\trevoked.proxy,\n\t\tnew Proxy(\n\t\t\t{},\n\t\t\t{\n\t\t\t\tget() {\n\t\t\t\t\tthrow new Error('Hostile property read')\n\t\t\t\t},\n\t\t\t},\n\t\t),\n\t\tnew Proxy(\n\t\t\t{},\n\t\t\t{\n\t\t\t\townKeys() {\n\t\t\t\t\tthrow new Error('Hostile key enumeration')\n\t\t\t\t},\n\t\t\t},\n\t\t),\n\t\tnew Proxy(\n\t\t\t{},\n\t\t\t{\n\t\t\t\tgetPrototypeOf() {\n\t\t\t\t\tthrow new Error('Hostile prototype read')\n\t\t\t\t},\n\t\t\t},\n\t\t),\n\t\tObject.create(null),\n\t\tnew Proxy([], {\n\t\t\tget() {\n\t\t\t\tthrow new Error('Hostile array index read')\n\t\t\t},\n\t\t}),\n\t\tcyclicArray,\n\t\tsparseArray,\n\t\thidden,\n\t\tgetter,\n\t])\n}\n\n/**\n * Creates a recorder for callback arguments.\n *\n * @typeParam TArgs - The argument tuple to record.\n * @returns A recorder whose handler appends calls in order.\n */\nexport function createRecorder<\n\tTArgs extends readonly unknown[] = readonly unknown[],\n>(): RecorderInterface<TArgs> {\n\tconst calls: TArgs[] = []\n\treturn {\n\t\tcalls,\n\t\tget count() {\n\t\t\treturn calls.length\n\t\t},\n\t\thandler(...args) {\n\t\t\tcalls.push(args)\n\t\t},\n\t\tclear() {\n\t\t\tcalls.length = 0\n\t\t},\n\t}\n}\n\n/**\n * Creates event recorders and subscribes them to the source.\n *\n * @typeParam TMap - The source's event names and delivered argument tuples.\n * @typeParam TName - The requested event names.\n * @param source - The source to subscribe to.\n * @param events - The events to record.\n * @returns A map from each requested event name to its recorder.\n * @throws Thrown when a listed event has no recorder, which a well-formed events array cannot\n * produce.\n * @remarks A duplicate event name installs a fresh recorder for every occurrence. The returned map\n * keeps the recorder installed for the last occurrence. `TName` derives from the array's element\n * type. An array declared with a wider union than its contents widens `TName` beyond the listed\n * events. The omitted key reads `undefined` at runtime under a non-optional type, and the guard\n * reports `true` because it checks the listed events. Pass a literal array or a tuple.\n */\nexport function createRecorders<\n\tTMap extends Record<string, readonly unknown[]>,\n\tTName extends keyof TMap,\n>(source: EventSourceInterface<TMap>, events: readonly TName[]): RecorderMap<TMap, TName> {\n\tconst building: { -readonly [K in TName]?: RecorderInterface<TMap[TName]> } = {}\n\tfor (const event of events) {\n\t\tconst recorder = createRecorder<TMap[TName]>()\n\t\tsource.on(event, recorder.handler)\n\t\tbuilding[event] = recorder\n\t}\n\tif (!isRecorderMapComplete<TMap, TName>(building, events)) {\n\t\tthrow new Error('Emitter recorder map is incomplete')\n\t}\n\treturn building\n}\n\n/**\n * Creates a real abort controller whose signal reports its live abort listeners.\n *\n * @returns The controller, its instrumented signal, and the current listener tally.\n * @remarks Instrumentation is installed on the created signal instance. A one-shot listener leaves\n * the tally when it fires, and removal accepts the original listener supplied by the caller. A\n * listener scoped by another signal leaves when that signal aborts. An already-aborted scope\n * installs and records nothing.\n */\nexport function createSignal(): SignalInterface {\n\tconst controller = new AbortController()\n\tconst signal = controller.signal\n\tconst add = signal.addEventListener.bind(signal)\n\tconst remove = signal.removeEventListener.bind(signal)\n\tconst registrations: SignalRegistration[] = []\n\n\tObject.defineProperty(signal, 'addEventListener', {\n\t\tconfigurable: true,\n\t\tvalue(\n\t\t\ttype: string,\n\t\t\tlistener: EventListener | EventListenerObject | null,\n\t\t\toptions?: boolean | AddEventListenerOptions,\n\t\t) {\n\t\t\tif (listener === null) return\n\t\t\tif (type !== 'abort') {\n\t\t\t\tadd(type, listener, options)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tconst capture = typeof options === 'boolean' ? options : (options?.capture ?? false)\n\t\t\tconst scope = typeof options === 'object' ? options?.signal : undefined\n\t\t\tif (scope?.aborted === true) return\n\t\t\tif (\n\t\t\t\tregistrations.some(\n\t\t\t\t\t(registration) => registration[0] === listener && registration[2] === capture,\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tconst once = typeof options === 'object' && options?.once === true\n\t\t\tconst cleanup = scope === undefined ? undefined : new AbortController()\n\t\t\tconst installed: EventListenerObject = {\n\t\t\t\thandleEvent(event) {\n\t\t\t\t\tif (once) dropRegistration(registrations, installed)\n\t\t\t\t\tif (typeof listener === 'function') listener.call(signal, event)\n\t\t\t\t\telse listener.handleEvent(event)\n\t\t\t\t},\n\t\t\t}\n\t\t\tadd(\n\t\t\t\ttype,\n\t\t\t\tinstalled,\n\t\t\t\ttypeof options === 'object'\n\t\t\t\t\t? options?.passive === undefined\n\t\t\t\t\t\t? { capture, once }\n\t\t\t\t\t\t: { capture, once, passive: options.passive }\n\t\t\t\t\t: options,\n\t\t\t)\n\t\t\tregistrations.push([listener, installed, capture, cleanup])\n\t\t\tif (scope !== undefined && cleanup !== undefined) {\n\t\t\t\tscope.addEventListener(\n\t\t\t\t\t'abort',\n\t\t\t\t\t() => {\n\t\t\t\t\t\tconst registration = dropRegistration(registrations, installed)\n\t\t\t\t\t\tif (registration === undefined) return\n\t\t\t\t\t\tremove(type, registration[1], { capture })\n\t\t\t\t\t},\n\t\t\t\t\t{ once: true, signal: cleanup.signal },\n\t\t\t\t)\n\t\t\t}\n\t\t},\n\t})\n\tObject.defineProperty(signal, 'removeEventListener', {\n\t\tconfigurable: true,\n\t\tvalue(\n\t\t\ttype: string,\n\t\t\tlistener: EventListener | EventListenerObject | null,\n\t\t\toptions?: boolean | EventListenerOptions,\n\t\t) {\n\t\t\tif (listener === null) return\n\t\t\tif (type !== 'abort') {\n\t\t\t\tremove(type, listener, options)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tconst capture = typeof options === 'boolean' ? options : (options?.capture ?? false)\n\t\t\tconst index = registrations.findIndex(\n\t\t\t\t(registration) => registration[0] === listener && registration[2] === capture,\n\t\t\t)\n\t\t\tconst registration = registrations[index]\n\t\t\tif (registration === undefined) {\n\t\t\t\tremove(type, listener, options)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tregistrations.splice(index, 1)\n\t\t\tregistration[3]?.abort()\n\t\t\tremove(type, registration[1], options)\n\t\t},\n\t})\n\n\treturn {\n\t\tcontroller,\n\t\tsignal,\n\t\tget count() {\n\t\t\treturn registrations.length\n\t\t},\n\t}\n}\n\n/**\n * Creates a monotonically numbered resource factory with creation and destruction records.\n *\n * @returns A resource factory whose recorders retain every affected id in order.\n */\nexport function createResourceFactory(): ResourceFactoryInterface {\n\tconst created = createRecorder<readonly [id: number]>()\n\tconst destroyed = createRecorder<readonly [id: number]>()\n\treturn {\n\t\tcreated,\n\t\tdestroyed,\n\t\tcreate() {\n\t\t\tconst id = created.calls.length + 1\n\t\t\tcreated.handler(id)\n\t\t\treturn id\n\t\t},\n\t\tdestroy(id) {\n\t\t\tdestroyed.handler(id)\n\t\t},\n\t}\n}\n\n/**\n * Creates a teardown list that runs registered handlers newest-first.\n *\n * @returns A teardown list that awaits every handler and collects failures.\n */\nexport function createTeardown(): TeardownInterface {\n\tlet handlers: TeardownHandler[] = []\n\treturn {\n\t\tget count() {\n\t\t\treturn handlers.length\n\t\t},\n\t\tadd(handler) {\n\t\t\thandlers.push(handler)\n\t\t},\n\t\tasync destroy() {\n\t\t\tconst snapshot = handlers\n\t\t\thandlers = []\n\t\t\tconst failures: unknown[] = []\n\t\t\tfor (const handler of snapshot.reverse()) {\n\t\t\t\ttry {\n\t\t\t\t\tawait handler()\n\t\t\t\t} catch (error) {\n\t\t\t\t\tfailures.push(error)\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (failures.length === 1) throw failures[0]\n\t\t\tif (failures.length > 1) throw new AggregateError(failures)\n\t\t},\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAmBA,IAAa,wBAAwB,OAAO,OAAO;CAClD,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,OAAO;CACP,UAAU;CACV,QAAQ;CACR,OAAO;AACR,CAAC;;;;;;;;;;;;;;;;;;AAmBD,IAAa,sBAAsB,OAAO,OAAO;CAChD;CACA;CACA;CACA;CACA;AACD,CAAU;;;;;;;;;;;;;;;;ACrCV,SAAgB,sBAGd,OAAgB,QAA6D;CAC9E,IAAI;EACH,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;EACxD,OAAO,OAAO,OAAO,UAAU;GAC9B,IAAI,CAAC,OAAO,OAAO,OAAO,KAAK,GAAG,OAAO;GACzC,MAAM,WAAW,QAAQ,IAAI,OAAO,KAAK;GACzC,IAAI,OAAO,aAAa,YAAY,aAAa,MAAM,OAAO;GAC9D,OACC,OAAO,QAAQ,IAAI,UAAU,SAAS,MAAM,cAC5C,MAAM,QAAQ,QAAQ,IAAI,UAAU,OAAO,CAAC;EAE9C,CAAC;CACF,QAAQ;EACP,OAAO;CACR;AACD;;;;;;;;;;;;;;ACXA,SAAgB,YAAY,SAAiB,QAAgB,UAAwB;CACpF,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,GACxC,MAAM,IAAI,MAAM,GAAG,QAAQ,wCAAwC;CAEpE,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW,GAC5C,MAAM,IAAI,MAAM,GAAG,QAAQ,0CAA0C;AAEvE;;;;;;;;;;;;;AAcA,SAAgB,oBACf,aACA,QACA,SACA,MACA,OACQ;CACR,OAAO,IAAI,MACV,UAAU,YAAY,2BAA2B,OAAO,aAAa,QAAQ,KAAK,SAAS,KAAA,IAAY,KAAK,iBAAiB,KAAK,MAClI,EAAE,MAAM,CACT;AACD;;;;;;;;;;;AAYA,SAAgB,iBACf,eACA,WACiC;CACjC,MAAM,QAAQ,cAAc,WAAW,iBAAiB,aAAa,OAAO,SAAS;CACrF,MAAM,eAAe,cAAc;CACnC,IAAI,iBAAiB,KAAA,GAAW,OAAO,KAAA;CACvC,cAAc,OAAO,OAAO,CAAC;CAC7B,aAAa,EAAE,EAAE,MAAM;CACvB,OAAO;AACR;;;;;;;AAQA,SAAgB,aAAa,KAAK,GAAkB;CACnD,OAAO,IAAI,SAAS,YAAY,WAAW,SAAS,EAAE,CAAC;AACxD;;;;;;;;;AAUA,SAAgB,aAAa,QAAoC;CAChE,IAAI,OAAO,SAAS,OAAO,QAAQ,QAAQ;CAC3C,OAAO,IAAI,SAAS,YAAY,OAAO,iBAAiB,eAAe,QAAQ,GAAG,EAAE,MAAM,KAAK,CAAC,CAAC;AAClG;;;;;;;;;;;;;AAcA,eAAsB,iBACrB,aACA,WACA,SACgB;CAChB,MAAM,SAAS,SAAS,UAAU;CAClC,MAAM,WAAW,SAAS,YAAY;CACtC,YAAY,QAAQ,QAAQ,QAAQ;CAEpC,MAAM,QAAQ,YAAY,IAAI;CAC9B,OAAO,MAAM;EACZ,SAAS,QAAQ,eAAe;EAChC,MAAM,OAAO,MAAM,UAAU;EAC7B,SAAS,QAAQ,eAAe;EAChC,IAAI,MAAM;EAEV,MAAM,UAAU,YAAY,IAAI,IAAI;EACpC,IAAI,WAAW,QACd,MAAM,IAAI,MACT,cAAc,YAAY,wBAAwB,OAAO,aAAa,QAAQ,IAC/E;EAED,MAAM,aAAa,QAAQ;CAC5B;AACD;;;;;;;;;;;;;;;;AAiBA,eAAsB,WACrB,aACA,SACA,WACA,SACa;CACb,MAAM,SAAS,SAAS,UAAU;CAClC,MAAM,WAAW,SAAS,YAAY;CACtC,MAAM,WAAW,SAAS;CAC1B,YAAY,SAAS,QAAQ,QAAQ;CACrC,IAAI,aAAa,KAAA,MAAc,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,IACxE,MAAM,IAAI,MAAM,2CAA2C;CAG5D,MAAM,QAAQ,YAAY,IAAI;CAC9B,IAAI,QAAQ;CACZ,IAAI;CACJ,IAAI;CACJ,OAAO,MAAM;EACZ,SAAS,QAAQ,eAAe;EAChC,IAAI,QAAQ,GAAG;GACd,MAAM,UAAU,YAAY,IAAI,IAAI;GACpC,IAAI,WAAW,QACd,MAAM,oBAAoB,aAAa,QAAQ,SAAS,MAAM,KAAK;EAErE;EACA,IAAI;EACJ,IAAI;GACH,WAAW;IAAE,SAAS;IAAM,OAAO,MAAM,QAAQ;GAAE;EACpD,SAAS,OAAO;GACf,WAAW;IAAE,SAAS;IAAO;GAAM;EACpC;EACA,SAAS;EACT,SAAS,QAAQ,eAAe;EAEhC,IAAI,SAAS,SAAS;GACrB,IAAI,UAAU,SAAS,KAAK,GAAG,OAAO,SAAS;GAC/C,IAAI;GACJ,IAAI;IACH,MAAM,aAAa,KAAK,UAAU,SAAS,KAAK;IAChD,WAAW,eAAe,KAAA,IAAY,OAAO,SAAS,KAAK,IAAI;GAChE,QAAQ;IACP,IAAI;KACH,WAAW,OAAO,SAAS,KAAK;IACjC,QAAQ;KACP,WAAW;IACZ;GACD;GACA,OAAO,SAAS,SAAS,MAAM,GAAG,SAAS,MAAM,GAAG,GAAG,EAAE,OAAO;EACjE,OACC,QAAQ,SAAS;EAGlB,MAAM,UAAU,YAAY,IAAI,IAAI;EACpC,IAAI,WAAW,QACd,MAAM,oBAAoB,aAAa,QAAQ,SAAS,MAAM,KAAK;EAEpE,IAAI,aAAa,KAAA,KAAa,SAAS,UACtC,MAAM,IAAI,MACT,UAAU,YAAY,2BAA2B,SAAS,WAAW,SAAS,KAAA,IAAY,KAAK,iBAAiB,KAAK,MACrH,EAAE,MAAM,CACT;EAED,MAAM,aAAa,KAAK,IAAI,UAAU,SAAS,OAAO,CAAC;CACxD;AACD;;;;;;;;;;;;;AAcA,SAAgB,gBAAmB,QAAiB,QAAiB,MAA6B;CACjG,IAAI,OAAO,WAAW,YAAY,MAAM,IAAI,UAAU,yBAAyB;CAE/E,OADkB,QAAQ,MAAM,QAAQ,QAAQ,IACzC;AACR;;;;;;;;;;;;AAaA,SAAgB,aAAgB,QAAiB,KAAqB;CACrE,KAAK,OAAO,WAAW,YAAY,WAAW,SAAS,OAAO,WAAW,YACxE,MAAM,IAAI,UAAU,sCAAsC;CAG3D,OADkB,QAAQ,IAAI,QAAQ,GAC/B;AACR;;;;;;;;;AAUA,SAAgB,eAAe,MAAuD;CACrF,OAAO,OAAO,OAAO,OAAO,YAAY,IAAI,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;AACrE;;;;;;;;;;;;;;AAeA,eAAsB,aACrB,WACA,aACA,SACiB;CACjB,MAAM,SAAS,SAAS,UAAU;CAElC,YAAY,SAAS,QADJ,SAAS,YAAY,EACD;CAErC,MAAM,SAAS,SAAS;CACxB,QAAQ,eAAe;CACvB,MAAM,WAAW,QAAQ,cAAqB;CAC9C,MAAM,aAAa,IAAI,gBAAgB;CACvC,IAAI;CACJ,MAAM,UAAiC,CACtC,SAAS,SACT,IAAI,SAAS,UAAU,WAAW;EACjC,UAAU,iBAAiB;GAC1B,uBAAO,IAAI,MAAM,UAAU,YAAY,6BAA6B,OAAO,GAAG,CAAC;EAChF,GAAG,MAAM;CACV,CAAC,CACF;CACA,IAAI,WAAW,KAAA,GACd,QAAQ,KACP,IAAI,SAAS,UAAU,WAAW;EAEjC,YAD6B,IAAI,CAAC,QAAQ,WAAW,MAAM,CAC3D,CAAA,CAAS,iBACR,eACM;GACL,IAAI,OAAO,SAAS,OAAO,OAAO,MAAM;EACzC,GACA,EAAE,MAAM,KAAK,CACd;CACD,CAAC,CACF;CAED,MAAM,SAAS,QAAQ,KAAK,OAAO;CACnC,IAAI,UAA+B,KAAA;CACnC,IAAI;EACH,IAAI;GACH,UAAU,WAAW,GAAG,SAAS,SAAS,QAAQ,IAAI,CAAC;EACxD,SAAS,OAAO;GACf,SAAS,OAAO,KAAK;EACtB;EACA,OAAO,MAAM;CACd,UAAU;EACT,WAAW,MAAM;EACjB,IAAI,YAAY,KAAA,GAAW,aAAa,OAAO;EAC/C,UAAU;CACX;AACD;;;;;;;;;AAUA,SAAgB,gBAAgB,MAAkC;CACjE,MAAM,SAAoB,CAAC;CAC3B,KAAK,MAAM,CAAC,OAAO,aAAa,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,GAAG;EAC3D,MAAM,OAAO,SAAS,SAAS,IAAI,IAAI,SAAS,MAAM,GAAG,EAAE,IAAI;EAC/D,IAAI,KAAK,WAAW,GAAG;EACvB,IAAI;GACH,MAAM,QAAiB,KAAK,MAAM,IAAI;GACtC,OAAO,KAAK,KAAK;EAClB,SAAS,OAAO;GACf,MAAM,IAAI,MAAM,wBAAwB,QAAQ,KAAK,EAAE,MAAM,CAAC;EAC/D;CACD;CACA,OAAO;AACR;;;;;;;AAQA,SAAgB,aAAa,OAA+B;CAC3D,IAAI;EACH,MAAM;CACP,SAAS,OAAO;EACf,OAAO;CACR;AAED;;;;;;;;;AAUA,SAAgB,aAAgB,OAA6B,UAAU,qBAAwB;CAC9F,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,MAAM,IAAI,MAAM,OAAO;CAClE,OAAO;AACR;;;;;;;;AASA,eAAsB,QAAW,QAAiD;CACjF,MAAM,SAAc,CAAC;CACrB,WAAW,MAAM,SAAS,QAAQ,OAAO,KAAK,KAAK;CACnD,OAAO;AACR;;;;;;;;AASA,eAAsB,cAAiB,QAAkD;CACxF,MAAM,SAAS,OAAO,UAAU;CAChC,MAAM,SAAc,CAAC;CACrB,IAAI;EACH,OAAO,MAAM;GACZ,MAAM,SAAS,MAAM,OAAO,KAAK;GACjC,IAAI,OAAO,MAAM,OAAO;GACxB,OAAO,KAAK,OAAO,KAAK;EACzB;CACD,UAAU;EACT,OAAO,YAAY;CACpB;AACD;;;;;;;;;;;AAYA,SAAgB,cAAiB,OAA2B;CAC3D,MAAM,aAAa,KAAK,UAAU,QAAQ,MAAM,YAAY;EAC3D,IAAI,YAAY,KAAA,KAAa,OAAO,YAAY,cAAc,OAAO,YAAY,UAChF,MAAM,IAAI,MAAM,+DAA+D;EAEhF,IAAI,OAAO,YAAY,YAAY,CAAC,OAAO,SAAS,OAAO,GAC1D,MAAM,IAAI,MAAM,yCAAyC;EAE1D,OAAO;CACR,CAAC;CACD,MAAM,SAAY,KAAK,MAAM,UAAU;CACvC,MAAM,UAAqB,CAAC,MAAM;CAClC,OAAO,QAAQ,SAAS,GAAG;EAC1B,MAAM,UAAU,QAAQ,IAAI;EAC5B,IAAI,OAAO,YAAY,YAAY,CAAC,OAAO,SAAS,OAAO,GAC1D,MAAM,IAAI,MAAM,yCAAyC;EAE1D,IAAI,MAAM,QAAQ,OAAO,GACxB,KAAK,MAAM,SAAS,SAAS,QAAQ,KAAK,KAAK;OACzC,IAAI,OAAO,YAAY,YAAY,YAAY,MACrD,KAAK,MAAM,SAAS,OAAO,OAAO,OAAO,GAAG,QAAQ,KAAK,KAAK;CAEhE;CACA,OAAO;AACR;;;;;;;;AASA,SAAgB,YAAY,MAAuB;CAClD,OAAO,IAAI,IAAI,OAAO,KAAK,GAAG;AAC/B;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,eAAsB,gBACrB,UACA,SACgB;CAChB,MAAM,aAAa,SAAS;CAC5B,IAAI;EACH,MAAM,SAAS,QAAQ,SAAS,WAAW,IAAI;EAC/C,MAAM,SAAS,IAAI,SAAS,WAAW,KAAK;EAC5C,MAAM,SAAS,OAAO,SAAS,WAAW,EAAE;CAC7C,SAAS,OAAO;EACf,MAAM,UACL,iBAAiB,QAAQ,MAAM,UAAU,qBAAqB,OAAO,MAAM;EAC5E,MAAM,IAAI,MAAM,GAAG,WAAW,KAAK,IAAI,WAAW,EAAE,MAAM,CAAC;CAC5D;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,eAAsB,iBACrB,WACA,OACgB;CAChB,KAAK,MAAM,YAAY,WAAW;EACjC,IAAI;EACJ,IAAI;GACH,UAAU,MAAM,MAAM,QAAQ;EAC/B,SAAS,OAAO;GACf,MAAM,IAAI,MAAM,GAAG,SAAS,WAAW,KAAK,kBAAkB,EAAE,MAAM,CAAC;EACxE;EACA,MAAM,gBAAgB,UAAU,OAAO;CACxC;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxeA,SAAgB,sBAA0C;CACzD,MAAM,SAAkC,CAAC;CACzC,OAAO,OAAO;CACd,MAAM,UAAU,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC;CACtC,QAAQ,OAAO;CACf,MAAM,cAAyB,CAAC;CAChC,YAAY,KAAK,WAAW;CAC5B,MAAM,cAAc,MAAe,CAAC;CACpC,YAAY,KAAK;CACjB,MAAM,SAAS,CAAC;CAChB,OAAO,eAAe,QAAQ,UAAU,EAAE,OAAO,KAAK,CAAC;CACvD,QAAQ,IAAI,QAAQ,QAAQ,MAAM;CAClC,MAAM,SAAS,CAAC;CAChB,OAAO,eAAe,QAAQ,UAAU;EACvC,YAAY;EACZ,MAAM;GACL,MAAM,IAAI,MAAM,2BAA2B;EAC5C;CACD,CAAC;CAED,OAAO,OAAO,OAAO;EACpB;EACA,QAAQ;EACR,IAAI,MACH,CAAC,GACD,EACC,MAAM;GACL,MAAM,IAAI,MAAM,uBAAuB;EACxC,EACD,CACD;EACA,IAAI,MACH,CAAC,GACD,EACC,UAAU;GACT,MAAM,IAAI,MAAM,yBAAyB;EAC1C,EACD,CACD;EACA,IAAI,MACH,CAAC,GACD,EACC,iBAAiB;GAChB,MAAM,IAAI,MAAM,wBAAwB;EACzC,EACD,CACD;EACA,OAAO,OAAO,IAAI;EAClB,IAAI,MAAM,CAAC,GAAG,EACb,MAAM;GACL,MAAM,IAAI,MAAM,0BAA0B;EAC3C,EACD,CAAC;EACD;EACA;EACA;EACA;CACD,CAAC;AACF;;;;;;;AAQA,SAAgB,iBAEc;CAC7B,MAAM,QAAiB,CAAC;CACxB,OAAO;EACN;EACA,IAAI,QAAQ;GACX,OAAO,MAAM;EACd;EACA,QAAQ,GAAG,MAAM;GAChB,MAAM,KAAK,IAAI;EAChB;EACA,QAAQ;GACP,MAAM,SAAS;EAChB;CACD;AACD;;;;;;;;;;;;;;;;;AAkBA,SAAgB,gBAGd,QAAoC,QAAoD;CACzF,MAAM,WAAwE,CAAC;CAC/E,KAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,WAAW,eAA4B;EAC7C,OAAO,GAAG,OAAO,SAAS,OAAO;EACjC,SAAS,SAAS;CACnB;CACA,IAAI,CAAC,sBAAmC,UAAU,MAAM,GACvD,MAAM,IAAI,MAAM,oCAAoC;CAErD,OAAO;AACR;;;;;;;;;;AAWA,SAAgB,eAAgC;CAC/C,MAAM,aAAa,IAAI,gBAAgB;CACvC,MAAM,SAAS,WAAW;CAC1B,MAAM,MAAM,OAAO,iBAAiB,KAAK,MAAM;CAC/C,MAAM,SAAS,OAAO,oBAAoB,KAAK,MAAM;CACrD,MAAM,gBAAsC,CAAC;CAE7C,OAAO,eAAe,QAAQ,oBAAoB;EACjD,cAAc;EACd,MACC,MACA,UACA,SACC;GACD,IAAI,aAAa,MAAM;GACvB,IAAI,SAAS,SAAS;IACrB,IAAI,MAAM,UAAU,OAAO;IAC3B;GACD;GACA,MAAM,UAAU,OAAO,YAAY,YAAY,UAAW,SAAS,WAAW;GAC9E,MAAM,QAAQ,OAAO,YAAY,WAAW,SAAS,SAAS,KAAA;GAC9D,IAAI,OAAO,YAAY,MAAM;GAC7B,IACC,cAAc,MACZ,iBAAiB,aAAa,OAAO,YAAY,aAAa,OAAO,OACvE,GAEA;GAED,MAAM,OAAO,OAAO,YAAY,YAAY,SAAS,SAAS;GAC9D,MAAM,UAAU,UAAU,KAAA,IAAY,KAAA,IAAY,IAAI,gBAAgB;GACtE,MAAM,YAAiC,EACtC,YAAY,OAAO;IAClB,IAAI,MAAM,iBAAiB,eAAe,SAAS;IACnD,IAAI,OAAO,aAAa,YAAY,SAAS,KAAK,QAAQ,KAAK;SAC1D,SAAS,YAAY,KAAK;GAChC,EACD;GACA,IACC,MACA,WACA,OAAO,YAAY,WAChB,SAAS,YAAY,KAAA,IACpB;IAAE;IAAS;GAAK,IAChB;IAAE;IAAS;IAAM,SAAS,QAAQ;GAAQ,IAC3C,OACJ;GACA,cAAc,KAAK;IAAC;IAAU;IAAW;IAAS;GAAO,CAAC;GAC1D,IAAI,UAAU,KAAA,KAAa,YAAY,KAAA,GACtC,MAAM,iBACL,eACM;IACL,MAAM,eAAe,iBAAiB,eAAe,SAAS;IAC9D,IAAI,iBAAiB,KAAA,GAAW;IAChC,OAAO,MAAM,aAAa,IAAI,EAAE,QAAQ,CAAC;GAC1C,GACA;IAAE,MAAM;IAAM,QAAQ,QAAQ;GAAO,CACtC;EAEF;CACD,CAAC;CACD,OAAO,eAAe,QAAQ,uBAAuB;EACpD,cAAc;EACd,MACC,MACA,UACA,SACC;GACD,IAAI,aAAa,MAAM;GACvB,IAAI,SAAS,SAAS;IACrB,OAAO,MAAM,UAAU,OAAO;IAC9B;GACD;GACA,MAAM,UAAU,OAAO,YAAY,YAAY,UAAW,SAAS,WAAW;GAC9E,MAAM,QAAQ,cAAc,WAC1B,iBAAiB,aAAa,OAAO,YAAY,aAAa,OAAO,OACvE;GACA,MAAM,eAAe,cAAc;GACnC,IAAI,iBAAiB,KAAA,GAAW;IAC/B,OAAO,MAAM,UAAU,OAAO;IAC9B;GACD;GACA,cAAc,OAAO,OAAO,CAAC;GAC7B,aAAa,EAAE,EAAE,MAAM;GACvB,OAAO,MAAM,aAAa,IAAI,OAAO;EACtC;CACD,CAAC;CAED,OAAO;EACN;EACA;EACA,IAAI,QAAQ;GACX,OAAO,cAAc;EACtB;CACD;AACD;;;;;;AAOA,SAAgB,wBAAkD;CACjE,MAAM,UAAU,eAAsC;CACtD,MAAM,YAAY,eAAsC;CACxD,OAAO;EACN;EACA;EACA,SAAS;GACR,MAAM,KAAK,QAAQ,MAAM,SAAS;GAClC,QAAQ,QAAQ,EAAE;GAClB,OAAO;EACR;EACA,QAAQ,IAAI;GACX,UAAU,QAAQ,EAAE;EACrB;CACD;AACD;;;;;;AAOA,SAAgB,iBAAoC;CACnD,IAAI,WAA8B,CAAC;CACnC,OAAO;EACN,IAAI,QAAQ;GACX,OAAO,SAAS;EACjB;EACA,IAAI,SAAS;GACZ,SAAS,KAAK,OAAO;EACtB;EACA,MAAM,UAAU;GACf,MAAM,WAAW;GACjB,WAAW,CAAC;GACZ,MAAM,WAAsB,CAAC;GAC7B,KAAK,MAAM,WAAW,SAAS,QAAQ,GACtC,IAAI;IACH,MAAM,QAAQ;GACf,SAAS,OAAO;IACf,SAAS,KAAK,KAAK;GACpB;GAED,IAAI,SAAS,WAAW,GAAG,MAAM,SAAS;GAC1C,IAAI,SAAS,SAAS,GAAG,MAAM,IAAI,eAAe,QAAQ;EAC3D;CACD;AACD"}

package/dist/src/server/index.cjs

@@ -9,15 +9,15 @@ let _src_core = require("../core/index.cjs");
 let node_events = require("node:events");
 //#region src/server/constants.ts
 /**
-* The attempts `removeTree` makes before rethrowing a retryable removal error.
+* Caps the attempts `removeTree` makes before rethrowing a retryable removal error.
 */
 var REMOVE_TREE_MAX_ATTEMPTS = 10;
 /**
-* The synchronous delay, in milliseconds, `removeTree` waits between attempts.
+* Names the synchronous delay, in milliseconds, `removeTree` waits between attempts.
 */
 var REMOVE_TREE_RETRY_DELAY_MS = 100;
 /**
-* The error codes `removeTree` retries; every other code rethrows immediately.
+* Names the error codes `removeTree` retries; every other code rethrows immediately.
 */
 var REMOVE_TREE_RETRYABLE_CODES = Object.freeze([
 	"EBUSY",
@@ -40,11 +40,54 @@ function resolveContained(root, target) {
 	return candidate;
 }
 /**
+* Resolves a target that stays below a root directory, refusing an escape.
+*
+* @param root - The absolute root directory.
+* @param target - The relative or absolute target to resolve.
+* @returns The absolute target below the root.
+* @throws An `Error` reading `Path outside scratch directory: <target>` when the target escapes the
+* root.
+* @remarks This is {@link resolveContained} with the refusal every contained scratch operation makes
+* of an escape, so the check and its one message are stated once. Read `resolveContained` where an
+* escape is an answer rather than a refusal.
+*/
+function requireContained(root, target) {
+	const candidate = resolveContained(root, target);
+	if (candidate === void 0) throw new Error(`Path outside scratch directory: ${target}`);
+	return candidate;
+}
+/**
+* Reads the identity of one allocated directory off a host status.
+*
+* @param status - The status read from the directory's path.
+* @returns The device, index node, and creation time that together name the allocation.
+*/
+function readIdentity(status) {
+	return {
+		birth: status.birthtimeMs,
+		device: status.dev,
+		inode: status.ino
+	};
+}
+/**
+* Reads the `code` an unknown thrown value carries.
+*
+* @param error - The thrown value to read.
+* @returns The string `code` the value carries, or `undefined` when it carries none.
+* @remarks The read is contained on its own terms: a value that is not an object, one carrying no
+* `code`, and one carrying a `code` that is not a string all answer `undefined`. A null-prototype
+* object is read the same way, because the key is tested with `in` rather than through
+* `hasOwnProperty`.
+*/
+function readErrorCode(error) {
+	return typeof error === "object" && error !== null && "code" in error && typeof error.code === "string" ? error.code : void 0;
+}
+/**
 * Reports whether two directory identities name the same allocation.
 *
 * @param current - The identity read from the path now.
 * @param allocation - The identity recorded when the directory was allocated.
-* @returns Whether the device, the index node, and the creation time all match.
+* @returns True if the device, the index node, and the creation time all match; false otherwise.
 * @remarks All three fields are compared because none of them alone identifies an allocation. A
 * device is shared by every directory on one filesystem, an index node is reused once its directory
 * is removed, and a creation time repeats within the host's timestamp resolution.
@@ -57,7 +100,7 @@ function matchesIdentity(current, allocation) {
 *
 * @param key - The root-relative key to test.
 * @param exclusions - The normalized root-relative exclusion keys.
-* @returns Whether an exclusion names the key or one of its ancestors.
+* @returns True if an exclusion names the key or one of its ancestors; false otherwise.
 */
 function isExcluded(key, exclusions) {
 	return exclusions.some((rule) => rule === "" || key === rule || key.startsWith(`${rule}/`));
@@ -79,7 +122,7 @@ function createLink(path, source) {
 	try {
 		(0, node_fs.symlinkSync)(source, path);
 	} catch (error) {
-		if ((typeof error === "object" && error !== null && "code" in error && typeof error.code === "string" ? error.code : void 0) !== "EPERM") throw error;
+		if (readErrorCode(error) !== "EPERM") throw error;
 		const resolved = (0, node_path.resolve)((0, node_path.dirname)(path), source);
 		const status = (0, node_fs.statSync)(resolved, { throwIfNoEntry: false });
 		if (status !== void 0 && !status.isDirectory()) throw error;
@@ -108,7 +151,7 @@ function removeTree(path) {
 		});
 		return;
 	} catch (error) {
-		const code = typeof error === "object" && error !== null && "code" in error && typeof error.code === "string" ? error.code : void 0;
+		const code = readErrorCode(error);
 		if (code === void 0 || !REMOVE_TREE_RETRYABLE_CODES.includes(code) || attempt >= 10) throw error;
 		Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, 100);
 	}
@@ -231,8 +274,7 @@ function isRunning(pid) {
 async function waitForSocketClose(socket, options) {
 	const budget = options?.budget ?? 1e3;
 	const interval = options?.interval ?? 10;
-	if (!Number.isFinite(budget) || budget < 0) throw new Error("Socket budget must be finite and non-negative");
-	if (!Number.isFinite(interval) || interval < 0) throw new Error("Socket interval must be finite and non-negative");
+	(0, _src_core.checkBounds)("Socket", budget, interval);
 	const signal = options?.signal;
 	signal?.throwIfAborted();
 	if (socket.closed) return;
@@ -299,8 +341,7 @@ async function waitForSocketClose(socket, options) {
 async function destroyScratch(scratch, options) {
 	const budget = options?.budget ?? 1e4;
 	const interval = options?.interval ?? 25;
-	if (!Number.isFinite(budget) || budget < 0) throw new Error("Scratch budget must be finite and non-negative");
-	if (!Number.isFinite(interval) || interval < 0) throw new Error("Scratch interval must be finite and non-negative");
+	(0, _src_core.checkBounds)("Scratch", budget, interval);
 	const start = performance.now();
 	let refusal;
 	while (true) {
@@ -349,8 +390,7 @@ async function destroyScratch(scratch, options) {
 async function requestUpgrade(port, options) {
 	const budget = options?.budget ?? 1e3;
 	const interval = options?.interval ?? 10;
-	if (!Number.isFinite(budget) || budget < 0) throw new Error("Upgrade budget must be finite and non-negative");
-	if (!Number.isFinite(interval) || interval < 0) throw new Error("Upgrade interval must be finite and non-negative");
+	(0, _src_core.checkBounds)("Upgrade", budget, interval);
 	const signal = options?.signal;
 	signal?.throwIfAborted();
 	const path = options?.path ?? "/";
@@ -569,18 +609,11 @@ function createScratch(options) {
 	const prefix = options?.prefix ?? "orkestrel-test-";
 	if (prefix.includes("/") || prefix.includes("\\")) throw new Error("Scratch prefix must be a name fragment");
 	const path = (0, node_fs.mkdtempSync)(`${parent}${node_path.sep}${prefix}`);
-	const allocated = (0, node_fs.statSync)(path);
-	const allocation = {
-		birth: allocated.birthtimeMs,
-		device: allocated.dev,
-		inode: allocated.ino
-	};
-	const outside = "Path outside scratch directory";
+	const allocation = readIdentity((0, node_fs.statSync)(path));
 	const unremovable = "Scratch directory is not a removable target";
 	try {
 		for (const [target, text] of Object.entries(options?.files ?? {})) {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			(0, node_fs.mkdirSync)((0, node_path.dirname)(candidate), { recursive: true });
 			(0, node_fs.writeFileSync)(candidate, text);
 		}
@@ -591,16 +624,14 @@ function createScratch(options) {
 	const scratch = {
 		path,
 		write(target, text) {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			if (!scratch.has(".")) throw new Error("Scratch directory does not exist");
 			(0, node_fs.mkdirSync)((0, node_path.dirname)(candidate), { recursive: true });
 			(0, node_fs.writeFileSync)(candidate, text);
 			return candidate;
 		},
 		read(target) {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			if (!scratch.has(target)) return void 0;
 			const status = (0, node_fs.statSync)(candidate, { throwIfNoEntry: false });
 			if (status === void 0) return void 0;
@@ -608,8 +639,7 @@ function createScratch(options) {
 			return (0, node_fs.readFileSync)(candidate, "utf8");
 		},
 		has(target) {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			const rootStatus = (0, node_fs.lstatSync)(path, { throwIfNoEntry: false });
 			if (rootStatus === void 0) return false;
 			if (rootStatus.isSymbolicLink()) throw new Error("Scratch directory is a symbolic link");
@@ -617,8 +647,7 @@ function createScratch(options) {
 			return (0, node_fs.lstatSync)(candidate, { throwIfNoEntry: false }) !== void 0;
 		},
 		names(target = ".") {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			if (!scratch.has(".")) throw new Error("Scratch directory does not exist");
 			const status = (0, node_fs.statSync)(candidate, { throwIfNoEntry: false });
 			if (status === void 0) throw new Error(`Scratch path does not exist: ${target}`);
@@ -626,8 +655,7 @@ function createScratch(options) {
 			return (0, node_fs.readdirSync)(candidate).sort();
 		},
 		ensure(target) {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			if (!scratch.has(".")) throw new Error("Scratch directory does not exist");
 			const status = (0, node_fs.statSync)(candidate, { throwIfNoEntry: false });
 			if (status !== void 0 && !status.isDirectory()) throw new Error(`Scratch path is not a directory: ${target}`);
@@ -635,36 +663,24 @@ function createScratch(options) {
 			return candidate;
 		},
 		link(target, source) {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			if (!scratch.has(".")) throw new Error("Scratch directory does not exist");
 			(0, node_fs.mkdirSync)((0, node_path.dirname)(candidate), { recursive: true });
 			createLink(candidate, source);
 			return candidate;
 		},
 		remove(target) {
-			const candidate = resolveContained(path, target);
-			if (candidate === void 0) throw new Error(`${outside}: ${target}`);
+			const candidate = requireContained(path, target);
 			if (candidate === path) throw new Error(`${unremovable}: ${target}`);
 			if (!scratch.has(".")) throw new Error("Scratch directory does not exist");
 			const status = (0, node_fs.lstatSync)(candidate, { throwIfNoEntry: false });
-			if (status !== void 0) {
-				if (matchesIdentity({
-					birth: status.birthtimeMs,
-					device: status.dev,
-					inode: status.ino
-				}, allocation)) throw new Error(`${unremovable}: ${target}`);
-			}
+			if (status !== void 0 && matchesIdentity(readIdentity(status), allocation)) throw new Error(`${unremovable}: ${target}`);
 			removeTree(candidate);
 		},
 		destroy() {
 			const status = (0, node_fs.lstatSync)(path, { throwIfNoEntry: false });
 			if (status === void 0) return;
-			if (!matchesIdentity({
-				birth: status.birthtimeMs,
-				device: status.dev,
-				inode: status.ino
-			}, allocation)) return;
+			if (!matchesIdentity(readIdentity(status), allocation)) return;
 			removeTree(path);
 		}
 	};
@@ -744,9 +760,12 @@ exports.destroyScratch = destroyScratch;
 exports.isExcluded = isExcluded;
 exports.isRunning = isRunning;
 exports.matchesIdentity = matchesIdentity;
+exports.readErrorCode = readErrorCode;
+exports.readIdentity = readIdentity;
 exports.readInventory = readInventory;
 exports.removeTree = removeTree;
 exports.requestUpgrade = requestUpgrade;
+exports.requireContained = requireContained;
 exports.resolveContained = resolveContained;
 exports.supportsBytes = supportsBytes;
 exports.supportsCase = supportsCase;