@rocicorp/zero 1.11.0-canary.3 → 1.11.0-canary.30

package/out/shared/src/base64.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base64.d.ts","sourceRoot":"","sources":["../../../../shared/src/base64.ts"],"names":[],"mappings":"AAaA,6CAA6C;AAC7C,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAOrD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,UAAU,CAUzD;AAED,yBAAyB;AACzB,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAU7D;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,MAAM,GAAG,UAAU,CAI3D"}

package/out/shared/src/base64.js

@@ -0,0 +1,40 @@
+//#region ../shared/src/base64.ts
+var PADDING = /=+$/;
+var BASE64URL = /^(?:[\w-]{4})*(?:[\w-]{2}(?:==)?|[\w-]{3}=?)?$/;
+/** Encodes `bytes` as unpadded base64url. */
+function toBase64url(bytes) {
+	const native = bytes;
+	return native.toBase64 ? native.toBase64({
+		alphabet: "base64url",
+		omitPadding: true
+	}) : toBase64urlWithBtoa(bytes);
+}
+/**
+* Decodes base64url, padded or not.
+*
+* @throws SyntaxError if `encoded` is not base64url, including when it has
+*   whitespace, which the standard and atob skip. atob doesn't reject
+*   everything the standard rejects, so this checks first.
+*/
+function fromBase64url(encoded) {
+	if (!BASE64URL.test(encoded)) throw new SyntaxError("Invalid base64url");
+	const native = Uint8Array;
+	return native.fromBase64 ? native.fromBase64(encoded, { alphabet: "base64url" }) : fromBase64urlWithAtob(encoded);
+}
+/** @visibleForTesting */
+function toBase64urlWithBtoa(bytes) {
+	const { fromCharCode } = String;
+	return btoa(Array.from(bytes, (b) => fromCharCode(b)).join("")).replaceAll("+", "-").replaceAll("/", "_").replace(PADDING, "");
+}
+/**
+* Decodes base64url that {@link fromBase64url} has checked.
+*
+* @visibleForTesting
+*/
+function fromBase64urlWithAtob(s) {
+	return Uint8Array.from(atob(s.replaceAll("-", "+").replaceAll("_", "/")), (c) => c.charCodeAt(0));
+}
+//#endregion
+export { fromBase64url, toBase64url };
+
+//# sourceMappingURL=base64.js.map

package/out/shared/src/base64.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base64.js","names":[],"sources":["../../../../shared/src/base64.ts"],"sourcesContent":["// Unpadded base64url (RFC 4648 §5: base64 with `-` and `_` instead of `+` and\n// `/`) for Uint8Arrays. Uses the standard `Uint8Array.prototype.toBase64` and\n// `Uint8Array.fromBase64` when the runtime has them, and btoa/atob otherwise\n// (Node 22, older browsers). Node's Buffer isn't used: React Native apps\n// often polyfill it with the `buffer` package, which has no base64url.\n\ntype Base64urlOptions = {alphabet: 'base64url'; omitPadding?: boolean};\n\nconst PADDING = /=+$/;\n// Whole groups of four characters, then an unpadded or correctly padded last\n// group.\nconst BASE64URL = /^(?:[\\w-]{4})*(?:[\\w-]{2}(?:==)?|[\\w-]{3}=?)?$/;\n\n/** Encodes `bytes` as unpadded base64url. */\nexport function toBase64url(bytes: Uint8Array): string {\n  const native = bytes as Uint8Array & {\n    toBase64?: (options: Base64urlOptions) => string;\n  };\n  return native.toBase64\n    ? native.toBase64({alphabet: 'base64url', omitPadding: true})\n    : toBase64urlWithBtoa(bytes);\n}\n\n/**\n * Decodes base64url, padded or not.\n *\n * @throws SyntaxError if `encoded` is not base64url, including when it has\n *   whitespace, which the standard and atob skip. atob doesn't reject\n *   everything the standard rejects, so this checks first.\n */\nexport function fromBase64url(encoded: string): Uint8Array {\n  if (!BASE64URL.test(encoded)) {\n    throw new SyntaxError('Invalid base64url');\n  }\n  const native = Uint8Array as {\n    fromBase64?: (s: string, options: Base64urlOptions) => Uint8Array;\n  };\n  return native.fromBase64\n    ? native.fromBase64(encoded, {alphabet: 'base64url'})\n    : fromBase64urlWithAtob(encoded);\n}\n\n/** @visibleForTesting */\nexport function toBase64urlWithBtoa(bytes: Uint8Array): string {\n  // A local, so the loop doesn't look it up on String for every byte\n  // (Hermes).\n  const {fromCharCode} = String;\n  // One character per byte. Spreading a large array into fromCharCode could\n  // overflow the stack.\n  return btoa(Array.from(bytes, b => fromCharCode(b)).join(''))\n    .replaceAll('+', '-')\n    .replaceAll('/', '_')\n    .replace(PADDING, '');\n}\n\n/**\n * Decodes base64url that {@link fromBase64url} has checked.\n *\n * @visibleForTesting\n */\nexport function fromBase64urlWithAtob(s: string): Uint8Array {\n  return Uint8Array.from(atob(s.replaceAll('-', '+').replaceAll('_', '/')), c =>\n    c.charCodeAt(0),\n  );\n}\n"],"mappings":";AAQA,IAAM,UAAU;AAGhB,IAAM,YAAY;;AAGlB,SAAgB,YAAY,OAA2B;CACrD,MAAM,SAAS;CAGf,OAAO,OAAO,WACV,OAAO,SAAS;EAAC,UAAU;EAAa,aAAa;CAAI,CAAC,IAC1D,oBAAoB,KAAK;AAC/B;;;;;;;;AASA,SAAgB,cAAc,SAA6B;CACzD,IAAI,CAAC,UAAU,KAAK,OAAO,GACzB,MAAM,IAAI,YAAY,mBAAmB;CAE3C,MAAM,SAAS;CAGf,OAAO,OAAO,aACV,OAAO,WAAW,SAAS,EAAC,UAAU,YAAW,CAAC,IAClD,sBAAsB,OAAO;AACnC;;AAGA,SAAgB,oBAAoB,OAA2B;CAG7D,MAAM,EAAC,iBAAgB;CAGvB,OAAO,KAAK,MAAM,KAAK,QAAO,MAAK,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EACzD,WAAW,KAAK,GAAG,EACnB,WAAW,KAAK,GAAG,EACnB,QAAQ,SAAS,EAAE;AACxB;;;;;;AAOA,SAAgB,sBAAsB,GAAuB;CAC3D,OAAO,WAAW,KAAK,KAAK,EAAE,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,GAAG,CAAC,IAAG,MACxE,EAAE,WAAW,CAAC,CAChB;AACF"}

package/out/shared/src/centroid.d.ts

@@ -6,5 +6,4 @@ export declare class Centroid {
 }
 /** CentroidList is sorted by the mean of the centroid, ascending. */
 export type CentroidList = Centroid[];
-export declare function sortCentroidList(centroids: CentroidList): void;
 //# sourceMappingURL=centroid.d.ts.map

package/out/shared/src/centroid.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"centroid.d.ts","sourceRoot":"","sources":["../../../../shared/src/centroid.ts"],"names":[],"mappings":"AAIA,qBAAa,QAAQ;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IAEf,YAAY,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAGvC;IAED,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAWrB;CACF;AAED,qEAAqE;AACrE,MAAM,MAAM,YAAY,GAAG,QAAQ,EAAE,CAAC;AAEtC,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,YAAY,GAAG,IAAI,CAE9D"}
+{"version":3,"file":"centroid.d.ts","sourceRoot":"","sources":["../../../../shared/src/centroid.ts"],"names":[],"mappings":"AAIA,qBAAa,QAAQ;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IAEf,YAAY,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAGvC;IAED,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAWrB;CACF;AAED,qEAAqE;AACrE,MAAM,MAAM,YAAY,GAAG,QAAQ,EAAE,CAAC"}

package/out/shared/src/centroid.js

@@ -17,10 +17,7 @@ var Centroid = class {
 		}
 	}
 };
-function sortCentroidList(centroids) {
-	centroids.sort((a, b) => a.mean - b.mean);
-}
 //#endregion
-export { Centroid, sortCentroidList };
+export { Centroid };
 
 //# sourceMappingURL=centroid.js.map

package/out/shared/src/centroid.js.map

@@ -1 +1 @@
-{"version":3,"file":"centroid.js","names":[],"sources":["../../../../shared/src/centroid.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\n// Centroid average position of all points in a shape\nexport class Centroid {\n  mean: number;\n  weight: number;\n\n  constructor(mean: number, weight: number) {\n    this.mean = mean;\n    this.weight = weight;\n  }\n\n  add(r: Centroid): void {\n    if (r.weight < 0) {\n      throw new Error('centroid weight cannot be less than zero');\n    }\n    if (this.weight !== 0) {\n      this.weight += r.weight;\n      this.mean += (r.weight * (r.mean - this.mean)) / this.weight;\n    } else {\n      this.weight = r.weight;\n      this.mean = r.mean;\n    }\n  }\n}\n\n/** CentroidList is sorted by the mean of the centroid, ascending. */\nexport type CentroidList = Centroid[];\n\nexport function sortCentroidList(centroids: CentroidList): void {\n  centroids.sort((a, b) => a.mean - b.mean);\n}\n"],"mappings":";AAIA,IAAa,WAAb,MAAsB;CACpB;CACA;CAEA,YAAY,MAAc,QAAgB;EACxC,KAAK,OAAO;EACZ,KAAK,SAAS;CAChB;CAEA,IAAI,GAAmB;EACrB,IAAI,EAAE,SAAS,GACb,MAAM,IAAI,MAAM,0CAA0C;EAE5D,IAAI,KAAK,WAAW,GAAG;GACrB,KAAK,UAAU,EAAE;GACjB,KAAK,QAAS,EAAE,UAAU,EAAE,OAAO,KAAK,QAAS,KAAK;EACxD,OAAO;GACL,KAAK,SAAS,EAAE;GAChB,KAAK,OAAO,EAAE;EAChB;CACF;AACF;AAKA,SAAgB,iBAAiB,WAA+B;CAC9D,UAAU,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAC1C"}
+{"version":3,"file":"centroid.js","names":[],"sources":["../../../../shared/src/centroid.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\n// Centroid average position of all points in a shape\nexport class Centroid {\n  mean: number;\n  weight: number;\n\n  constructor(mean: number, weight: number) {\n    this.mean = mean;\n    this.weight = weight;\n  }\n\n  add(r: Centroid): void {\n    if (r.weight < 0) {\n      throw new Error('centroid weight cannot be less than zero');\n    }\n    if (this.weight !== 0) {\n      this.weight += r.weight;\n      this.mean += (r.weight * (r.mean - this.mean)) / this.weight;\n    } else {\n      this.weight = r.weight;\n      this.mean = r.mean;\n    }\n  }\n}\n\n/** CentroidList is sorted by the mean of the centroid, ascending. */\nexport type CentroidList = Centroid[];\n"],"mappings":";AAIA,IAAa,WAAb,MAAsB;CACpB;CACA;CAEA,YAAY,MAAc,QAAgB;EACxC,KAAK,OAAO;EACZ,KAAK,SAAS;CAChB;CAEA,IAAI,GAAmB;EACrB,IAAI,EAAE,SAAS,GACb,MAAM,IAAI,MAAM,0CAA0C;EAE5D,IAAI,KAAK,WAAW,GAAG;GACrB,KAAK,UAAU,EAAE;GACjB,KAAK,QAAS,EAAE,UAAU,EAAE,OAAO,KAAK,QAAS,KAAK;EACxD,OAAO;GACL,KAAK,SAAS,EAAE;GAChB,KAAK,OAAO,EAAE;EAChB;CACF;AACF"}

package/out/shared/src/error.d.ts

@@ -1,4 +1,15 @@
 import type { ReadonlyJSONValue } from './json.ts';
 export declare function getErrorMessage(error: unknown): string;
+/**
+ * Returns the chain of `cause` values hanging off `error`, outermost first.
+ *
+ * Errors that Zero raises on a fatal path wrap the original exception as
+ * `cause`. Console sinks on some runtimes (React Native's Hermes among them)
+ * print only the outer error's message and stack, so the original error's
+ * name, message and stack are lost unless they are logged as separate
+ * arguments. Spread the result of this function into a log call to keep them
+ * visible.
+ */
+export declare function getErrorCauses(error: unknown): unknown[];
 export declare function getErrorDetails(error: unknown): ReadonlyJSONValue | undefined;
 //# sourceMappingURL=error.d.ts.map

package/out/shared/src/error.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../../../shared/src/error.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,WAAW,CAAC;AAEjD,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAEtD;AAkDD,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,iBAAiB,GAAG,SAAS,CA0B7E"}
+{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../../../shared/src/error.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,WAAW,CAAC;AAEjD,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAEtD;AAkDD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,EAAE,CAaxD;AAiBD,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,iBAAiB,GAAG,SAAS,CA0B7E"}

package/out/shared/src/error.js

@@ -29,6 +29,40 @@ function getErrorMessageInternal(error, seen) {
 	} catch {}
 	return `Unknown error of type ${typeof error} was thrown and the message could not be determined. See cause for details.`;
 }
+/**
+* Returns the chain of `cause` values hanging off `error`, outermost first.
+*
+* Errors that Zero raises on a fatal path wrap the original exception as
+* `cause`. Console sinks on some runtimes (React Native's Hermes among them)
+* print only the outer error's message and stack, so the original error's
+* name, message and stack are lost unless they are logged as separate
+* arguments. Spread the result of this function into a log call to keep them
+* visible.
+*/
+function getErrorCauses(error) {
+	const causes = [];
+	const seen = new Set([error]);
+	let current = error;
+	for (;;) {
+		const cause = readCause(current);
+		if (cause === void 0 || seen.has(cause)) return causes;
+		seen.add(cause);
+		causes.push(cause);
+		current = cause;
+	}
+}
+/**
+* Reads `cause` exactly once. `error` is `unknown`, so `cause` may be an
+* accessor or proxy trap: a stateful getter must not be consulted twice per
+* hop, and a throwing one must not escape from a log call in an error handler.
+*/
+function readCause(error) {
+	try {
+		return typeof error === "object" && error !== null && "cause" in error ? error.cause : void 0;
+	} catch {
+		return;
+	}
+}
 function getErrorDetails(error) {
 	if (error instanceof Error) {
 		if ("details" in error) try {
@@ -45,6 +79,6 @@ function getErrorDetails(error) {
 	} catch {}
 }
 //#endregion
-export { getErrorDetails, getErrorMessage };
+export { getErrorCauses, getErrorDetails, getErrorMessage };
 
 //# sourceMappingURL=error.js.map

package/out/shared/src/error.js.map

@@ -1 +1 @@
-{"version":3,"file":"error.js","names":[],"sources":["../../../../shared/src/error.ts"],"sourcesContent":["import {jsonSchema} from './json-schema.ts';\nimport type {ReadonlyJSONValue} from './json.ts';\n\nexport function getErrorMessage(error: unknown): string {\n  return getErrorMessageInternal(error, new Set());\n}\n\nfunction getErrorMessageInternal(error: unknown, seen: Set<unknown>): string {\n  if (typeof error === 'string') {\n    return error;\n  }\n\n  if (typeof error === 'object' && error !== null) {\n    if (seen.has(error)) {\n      return 'Circular error reference detected while extracting the error message.';\n    }\n    seen.add(error);\n  }\n\n  if (error instanceof Error) {\n    if (error.message) {\n      return error.message;\n    }\n\n    if ('cause' in error) {\n      const {cause} = error as {cause: unknown};\n      if (cause !== undefined) {\n        const causeMessage = getErrorMessageInternal(cause, seen);\n        if (causeMessage) {\n          return causeMessage;\n        }\n      }\n    }\n  }\n\n  if (\n    typeof error === 'object' &&\n    error !== null &&\n    'message' in error &&\n    typeof (error as {message: unknown}).message === 'string'\n  ) {\n    const message = (error as {message: string}).message;\n    if (message) {\n      return message;\n    }\n  }\n\n  try {\n    const json = jsonSchema.parse(error);\n    return `Parsed message: ${JSON.stringify(json)}`;\n  } catch {}\n\n  return `Unknown error of type ${typeof error} was thrown and the message could not be determined. See cause for details.`;\n}\n\nexport function getErrorDetails(error: unknown): ReadonlyJSONValue | undefined {\n  if (error instanceof Error) {\n    if ('details' in error) {\n      try {\n        return jsonSchema.parse(error?.details);\n      } catch {}\n    }\n\n    if (error.name && error.name !== 'Error') {\n      return {name: error.name};\n    }\n\n    return undefined;\n  }\n\n  if (typeof error === 'object' && error !== null && 'details' in error) {\n    try {\n      return jsonSchema.parse((error as {details: ReadonlyJSONValue})?.details);\n    } catch {}\n  }\n\n  try {\n    return jsonSchema.parse(error);\n  } catch {}\n\n  return undefined;\n}\n"],"mappings":";;AAGA,SAAgB,gBAAgB,OAAwB;CACtD,OAAO,wBAAwB,uBAAO,IAAI,IAAI,CAAC;AACjD;AAEA,SAAS,wBAAwB,OAAgB,MAA4B;CAC3E,IAAI,OAAO,UAAU,UACnB,OAAO;CAGT,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;EAC/C,IAAI,KAAK,IAAI,KAAK,GAChB,OAAO;EAET,KAAK,IAAI,KAAK;CAChB;CAEA,IAAI,iBAAiB,OAAO;EAC1B,IAAI,MAAM,SACR,OAAO,MAAM;EAGf,IAAI,WAAW,OAAO;GACpB,MAAM,EAAC,UAAS;GAChB,IAAI,UAAU,KAAA,GAAW;IACvB,MAAM,eAAe,wBAAwB,OAAO,IAAI;IACxD,IAAI,cACF,OAAO;GAEX;EACF;CACF;CAEA,IACE,OAAO,UAAU,YACjB,UAAU,QACV,aAAa,SACb,OAAQ,MAA6B,YAAY,UACjD;EACA,MAAM,UAAW,MAA4B;EAC7C,IAAI,SACF,OAAO;CAEX;CAEA,IAAI;EACF,MAAM,OAAO,WAAW,MAAM,KAAK;EACnC,OAAO,mBAAmB,KAAK,UAAU,IAAI;CAC/C,QAAQ,CAAC;CAET,OAAO,yBAAyB,OAAO,MAAM;AAC/C;AAEA,SAAgB,gBAAgB,OAA+C;CAC7E,IAAI,iBAAiB,OAAO;EAC1B,IAAI,aAAa,OACf,IAAI;GACF,OAAO,WAAW,MAAM,OAAO,OAAO;EACxC,QAAQ,CAAC;EAGX,IAAI,MAAM,QAAQ,MAAM,SAAS,SAC/B,OAAO,EAAC,MAAM,MAAM,KAAI;EAG1B;CACF;CAEA,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa,OAC9D,IAAI;EACF,OAAO,WAAW,MAAO,OAAwC,OAAO;CAC1E,QAAQ,CAAC;CAGX,IAAI;EACF,OAAO,WAAW,MAAM,KAAK;CAC/B,QAAQ,CAAC;AAGX"}
+{"version":3,"file":"error.js","names":[],"sources":["../../../../shared/src/error.ts"],"sourcesContent":["import {jsonSchema} from './json-schema.ts';\nimport type {ReadonlyJSONValue} from './json.ts';\n\nexport function getErrorMessage(error: unknown): string {\n  return getErrorMessageInternal(error, new Set());\n}\n\nfunction getErrorMessageInternal(error: unknown, seen: Set<unknown>): string {\n  if (typeof error === 'string') {\n    return error;\n  }\n\n  if (typeof error === 'object' && error !== null) {\n    if (seen.has(error)) {\n      return 'Circular error reference detected while extracting the error message.';\n    }\n    seen.add(error);\n  }\n\n  if (error instanceof Error) {\n    if (error.message) {\n      return error.message;\n    }\n\n    if ('cause' in error) {\n      const {cause} = error as {cause: unknown};\n      if (cause !== undefined) {\n        const causeMessage = getErrorMessageInternal(cause, seen);\n        if (causeMessage) {\n          return causeMessage;\n        }\n      }\n    }\n  }\n\n  if (\n    typeof error === 'object' &&\n    error !== null &&\n    'message' in error &&\n    typeof (error as {message: unknown}).message === 'string'\n  ) {\n    const message = (error as {message: string}).message;\n    if (message) {\n      return message;\n    }\n  }\n\n  try {\n    const json = jsonSchema.parse(error);\n    return `Parsed message: ${JSON.stringify(json)}`;\n  } catch {}\n\n  return `Unknown error of type ${typeof error} was thrown and the message could not be determined. See cause for details.`;\n}\n\n/**\n * Returns the chain of `cause` values hanging off `error`, outermost first.\n *\n * Errors that Zero raises on a fatal path wrap the original exception as\n * `cause`. Console sinks on some runtimes (React Native's Hermes among them)\n * print only the outer error's message and stack, so the original error's\n * name, message and stack are lost unless they are logged as separate\n * arguments. Spread the result of this function into a log call to keep them\n * visible.\n */\nexport function getErrorCauses(error: unknown): unknown[] {\n  const causes: unknown[] = [];\n  const seen = new Set<unknown>([error]);\n  let current = error;\n  for (;;) {\n    const cause = readCause(current);\n    if (cause === undefined || seen.has(cause)) {\n      return causes;\n    }\n    seen.add(cause);\n    causes.push(cause);\n    current = cause;\n  }\n}\n\n/**\n * Reads `cause` exactly once. `error` is `unknown`, so `cause` may be an\n * accessor or proxy trap: a stateful getter must not be consulted twice per\n * hop, and a throwing one must not escape from a log call in an error handler.\n */\nfunction readCause(error: unknown): unknown {\n  try {\n    return typeof error === 'object' && error !== null && 'cause' in error\n      ? (error as {cause: unknown}).cause\n      : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\nexport function getErrorDetails(error: unknown): ReadonlyJSONValue | undefined {\n  if (error instanceof Error) {\n    if ('details' in error) {\n      try {\n        return jsonSchema.parse(error?.details);\n      } catch {}\n    }\n\n    if (error.name && error.name !== 'Error') {\n      return {name: error.name};\n    }\n\n    return undefined;\n  }\n\n  if (typeof error === 'object' && error !== null && 'details' in error) {\n    try {\n      return jsonSchema.parse((error as {details: ReadonlyJSONValue})?.details);\n    } catch {}\n  }\n\n  try {\n    return jsonSchema.parse(error);\n  } catch {}\n\n  return undefined;\n}\n"],"mappings":";;AAGA,SAAgB,gBAAgB,OAAwB;CACtD,OAAO,wBAAwB,uBAAO,IAAI,IAAI,CAAC;AACjD;AAEA,SAAS,wBAAwB,OAAgB,MAA4B;CAC3E,IAAI,OAAO,UAAU,UACnB,OAAO;CAGT,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;EAC/C,IAAI,KAAK,IAAI,KAAK,GAChB,OAAO;EAET,KAAK,IAAI,KAAK;CAChB;CAEA,IAAI,iBAAiB,OAAO;EAC1B,IAAI,MAAM,SACR,OAAO,MAAM;EAGf,IAAI,WAAW,OAAO;GACpB,MAAM,EAAC,UAAS;GAChB,IAAI,UAAU,KAAA,GAAW;IACvB,MAAM,eAAe,wBAAwB,OAAO,IAAI;IACxD,IAAI,cACF,OAAO;GAEX;EACF;CACF;CAEA,IACE,OAAO,UAAU,YACjB,UAAU,QACV,aAAa,SACb,OAAQ,MAA6B,YAAY,UACjD;EACA,MAAM,UAAW,MAA4B;EAC7C,IAAI,SACF,OAAO;CAEX;CAEA,IAAI;EACF,MAAM,OAAO,WAAW,MAAM,KAAK;EACnC,OAAO,mBAAmB,KAAK,UAAU,IAAI;CAC/C,QAAQ,CAAC;CAET,OAAO,yBAAyB,OAAO,MAAM;AAC/C;;;;;;;;;;;AAYA,SAAgB,eAAe,OAA2B;CACxD,MAAM,SAAoB,CAAC;CAC3B,MAAM,OAAO,IAAI,IAAa,CAAC,KAAK,CAAC;CACrC,IAAI,UAAU;CACd,SAAS;EACP,MAAM,QAAQ,UAAU,OAAO;EAC/B,IAAI,UAAU,KAAA,KAAa,KAAK,IAAI,KAAK,GACvC,OAAO;EAET,KAAK,IAAI,KAAK;EACd,OAAO,KAAK,KAAK;EACjB,UAAU;CACZ;AACF;;;;;;AAOA,SAAS,UAAU,OAAyB;CAC1C,IAAI;EACF,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,WAAW,QAC5D,MAA2B,QAC5B,KAAA;CACN,QAAQ;EACN;CACF;AACF;AAEA,SAAgB,gBAAgB,OAA+C;CAC7E,IAAI,iBAAiB,OAAO;EAC1B,IAAI,aAAa,OACf,IAAI;GACF,OAAO,WAAW,MAAM,OAAO,OAAO;EACxC,QAAQ,CAAC;EAGX,IAAI,MAAM,QAAQ,MAAM,SAAS,SAC/B,OAAO,EAAC,MAAM,MAAM,KAAI;EAG1B;CACF;CAEA,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa,OAC9D,IAAI;EACF,OAAO,WAAW,MAAO,OAAwC,OAAO;CAC1E,QAAQ,CAAC;CAGX,IAAI;EACF,OAAO,WAAW,MAAM,KAAK;CAC/B,QAAQ,CAAC;AAGX"}

package/out/shared/src/hash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../shared/src/hash.ts"],"names":[],"mappings":"AAUA,eAAO,MAAM,GAAG,MAAO,MAAM,WAG5B,CAAC;AACF,eAAO,MAAM,GAAG,MAAO,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,MAAO,MAAM,WAAe,CAAC;AAkJ9C,OAAO,EAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAC,MAAM,eAAe,CAAC"}
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../shared/src/hash.ts"],"names":[],"mappings":"AAUA,eAAO,MAAM,GAAG,MAAO,MAAM,WAG5B,CAAC;AACF,eAAO,MAAM,GAAG,MAAO,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,MAAO,MAAM,WAAe,CAAC;AAgL9C,OAAO,EAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAC,MAAM,eAAe,CAAC"}

package/out/shared/src/hash.js

@@ -12,6 +12,15 @@ var stripes = new Int32Array(MAX_WORDS * 4);
 var digests = new Uint32Array(MAX_WORDS);
 var encoder;
 /**
+* Inputs of up to this many UTF-16 code units are UTF-8 encoded into a reused
+* buffer: `TextEncoder#encode` allocates a fresh Uint8Array per call, which for
+* a row-key-sized string cost several times the hashing itself. Longer inputs
+* still allocate: there the allocation is a small share of the cost, and not
+* worth keeping a buffer that size alive.
+*/
+var MAX_REUSED_UNITS = 4096;
+var utf8;
+/**
 * xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the
 * digests in `digests[0..words)`.
 *
@@ -22,8 +31,16 @@ var encoder;
 * used to delegate to, and what `hash.test.ts` checks it still matches.
 */
 function digest(str, words) {
-	const b = (encoder ??= new TextEncoder()).encode(str);
-	const len = b.length;
+	encoder ??= new TextEncoder();
+	let b;
+	let len;
+	if (str.length <= MAX_REUSED_UNITS) {
+		b = utf8 ??= new Uint8Array(3 * MAX_REUSED_UNITS);
+		len = encoder.encodeInto(str, b).written;
+	} else {
+		b = encoder.encode(str);
+		len = b.length;
+	}
 	for (let w = 0; w < words; w++) accs[w] = w + PRIME32_5 & 4294967295;
 	let offset = 0;
 	if (len >= 16) {
@@ -79,15 +96,23 @@ function digest(str, words) {
 	}
 	for (let w = 0; w < words; w++) digests[w] = avalanche32(accs[w]);
 }
+var wideView = /* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(16));
 /**
-* A hash wider than 32 bits, folding `words` digests together highest seed
-* first.
+* A hash wider than 32 bits, folding the digests together highest seed first.
+*
+* Every bigint operation allocates its result, so folding word by word with a
+* `BigInt()`, a shift and an add per word allocated up to 6 bigints for h64 and
+* 12 for h128. Laying the words out big-endian and reading them back with
+* `getBigUint64` allocates 1 and 4 for the same values.
 */
 function wide(str, words) {
 	digest(str, words);
-	let result = 0n;
-	for (let w = 0; w < words; w++) result = (result << 32n) + BigInt(digests[w]);
-	return result;
+	wideView.setUint32(0, digests[0]);
+	wideView.setUint32(4, digests[1]);
+	if (words === 2) return wideView.getBigUint64(0);
+	wideView.setUint32(8, digests[2]);
+	wideView.setUint32(12, digests[3]);
+	return wideView.getBigUint64(0) << 64n | wideView.getBigUint64(8);
 }
 //#endregion
 export { h128, h32, h64 };

package/out/shared/src/hash.js.map

@@ -1 +1 @@
-{"version":3,"file":"hash.js","names":[],"sources":["../../../../shared/src/hash.ts"],"sourcesContent":["import {\n  avalanche32,\n  PRIME32_1,\n  PRIME32_2,\n  PRIME32_3,\n  PRIME32_4,\n  PRIME32_5,\n  round32,\n} from './xxhash32.ts';\n\nexport const h32 = (s: string) => {\n  digest(s, 1);\n  return digests[0];\n};\nexport const h64 = (s: string) => wide(s, 2);\nexport const h128 = (s: string) => wide(s, 4);\n\nconst MAX_WORDS = 4;\n\n// `digest` is synchronous and does not recurse, so these can be reused across\n// calls instead of allocated per call.\nconst accs = new Int32Array(MAX_WORDS);\nconst stripes = new Int32Array(MAX_WORDS * 4);\nconst digests = new Uint32Array(MAX_WORDS);\nlet encoder: TextEncoder | undefined;\n\n/**\n * xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the\n * digests in `digests[0..words)`.\n *\n * A seed only changes the initial accumulator values, so every word digests the\n * same input lanes. This walks the bytes once, advancing all `words` sets of\n * accumulators per lane, and UTF-8 encodes the string once. The result is\n * identical to `words` separate `xxHash32(str, i)` calls — which is what this\n * used to delegate to, and what `hash.test.ts` checks it still matches.\n */\nfunction digest(str: string, words: number): void {\n  const b = (encoder ??= new TextEncoder()).encode(str);\n  const len = b.length;\n\n  for (let w = 0; w < words; w++) {\n    accs[w] = (w + PRIME32_5) & 0xffffffff;\n  }\n\n  let offset = 0;\n\n  /*\n      Step 2. Process stripes\n      A stripe is a contiguous segment of 16 bytes, evenly divided into 4 lanes\n      of 4 bytes each, each lane updating its own accumulator. Inputs shorter\n      than a stripe skip straight to step 4 with a single accumulator.\n  */\n  if (len >= 16) {\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      stripes[base] = (w + PRIME32_1 + PRIME32_2) & 0xffffffff;\n      stripes[base + 1] = (w + PRIME32_2) & 0xffffffff;\n      stripes[base + 2] = w;\n      stripes[base + 3] = (w - PRIME32_1) & 0xffffffff;\n    }\n\n    const limit = len - 16;\n    for (; offset <= limit; offset += 16) {\n      const l0 =\n        b[offset] |\n        (b[offset + 1] << 8) |\n        (b[offset + 2] << 16) |\n        (b[offset + 3] << 24);\n      const l1 =\n        b[offset + 4] |\n        (b[offset + 5] << 8) |\n        (b[offset + 6] << 16) |\n        (b[offset + 7] << 24);\n      const l2 =\n        b[offset + 8] |\n        (b[offset + 9] << 8) |\n        (b[offset + 10] << 16) |\n        (b[offset + 11] << 24);\n      const l3 =\n        b[offset + 12] |\n        (b[offset + 13] << 8) |\n        (b[offset + 14] << 16) |\n        (b[offset + 15] << 24);\n      for (let w = 0; w < words; w++) {\n        const base = w << 2;\n        stripes[base] = round32(stripes[base], l0);\n        stripes[base + 1] = round32(stripes[base + 1], l1);\n        stripes[base + 2] = round32(stripes[base + 2], l2);\n        stripes[base + 3] = round32(stripes[base + 3], l3);\n      }\n    }\n\n    /*\n        Step 3. Accumulator convergence\n        acc = (acc1 <<< 1) + (acc2 <<< 7) + (acc3 <<< 12) + (acc4 <<< 18);\n    */\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      const s0 = stripes[base];\n      const s1 = stripes[base + 1];\n      const s2 = stripes[base + 2];\n      const s3 = stripes[base + 3];\n      accs[w] =\n        (((s0 << 1) | (s0 >>> 31)) +\n          ((s1 << 7) | (s1 >>> 25)) +\n          ((s2 << 12) | (s2 >>> 20)) +\n          ((s3 << 18) | (s3 >>> 14))) &\n        0xffffffff;\n    }\n  }\n\n  // Step 4. Add input length.\n  for (let w = 0; w < words; w++) {\n    accs[w] = (accs[w] + len) & 0xffffffff;\n  }\n\n  // Step 5. Consume the remaining input, 4 bytes at a time and then 1 at a time.\n  const limit4 = len - 4;\n  for (; offset <= limit4; offset += 4) {\n    const laneN0 = b[offset] + (b[offset + 1] << 8);\n    const laneN1 = b[offset + 2] + (b[offset + 3] << 8);\n    const laneP = laneN0 * PRIME32_3 + ((laneN1 * PRIME32_3) << 16);\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + laneP) | 0;\n      acc = (acc << 17) | (acc >>> 15);\n      accs[w] = Math.imul(acc, PRIME32_4);\n    }\n  }\n\n  for (; offset < len; ++offset) {\n    const lane = b[offset];\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + Math.imul(lane, PRIME32_5)) | 0;\n      acc = (acc << 11) | (acc >>> 21);\n      accs[w] = Math.imul(acc, PRIME32_1);\n    }\n  }\n\n  // Step 6. Final mix (avalanche). The Uint32Array store turns any negatives\n  // back into a positive number.\n  for (let w = 0; w < words; w++) {\n    digests[w] = avalanche32(accs[w]);\n  }\n}\n\n/**\n * A hash wider than 32 bits, folding `words` digests together highest seed\n * first.\n */\nfunction wide(str: string, words: number): bigint {\n  digest(str, words);\n  let result = 0n;\n  for (let w = 0; w < words; w++) {\n    result = (result << 32n) + BigInt(digests[w]);\n  }\n  return result;\n}\n\n// Re-exported for zero-protocol's AST hash, which cannot import xxhash32.ts\n// directly without tripping a tsc 7.0.2 bug (see the import comment in\n// zero-protocol/src/query-hash-visitor.ts).\nexport {avalanche32, PRIME32_1, PRIME32_5, round32} from './xxhash32.ts';\n"],"mappings":";;AAUA,IAAa,OAAO,MAAc;CAChC,OAAO,GAAG,CAAC;CACX,OAAO,QAAQ;AACjB;AACA,IAAa,OAAO,MAAc,KAAK,GAAG,CAAC;AAC3C,IAAa,QAAQ,MAAc,KAAK,GAAG,CAAC;AAE5C,IAAM,YAAY;AAIlB,IAAM,OAAO,IAAI,WAAW,SAAS;AACrC,IAAM,UAAU,IAAI,WAAW,YAAY,CAAC;AAC5C,IAAM,UAAU,IAAI,YAAY,SAAS;AACzC,IAAI;;;;;;;;;;;AAYJ,SAAS,OAAO,KAAa,OAAqB;CAChD,MAAM,KAAK,YAAY,IAAI,YAAY,GAAG,OAAO,GAAG;CACpD,MAAM,MAAM,EAAE;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,IAAI,YAAa;CAG9B,IAAI,SAAS;CAQb,IAAI,OAAO,IAAI;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,QAAQ,QAAS,IAAI,YAAY,YAAa;GAC9C,QAAQ,OAAO,KAAM,IAAI,YAAa;GACtC,QAAQ,OAAO,KAAK;GACpB,QAAQ,OAAO,KAAM,IAAI,YAAa;EACxC;EAEA,MAAM,QAAQ,MAAM;EACpB,OAAO,UAAU,OAAO,UAAU,IAAI;GACpC,MAAM,KACJ,EAAE,UACD,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,MAAM,KACJ,EAAE,SAAS,MACV,EAAE,SAAS,OAAO,IAClB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,OAAO,KAAK;IAClB,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,EAAE;IACzC,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;GACnD;EACF;EAMA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,KAAK,MACA,MAAM,IAAM,OAAO,OAClB,MAAM,IAAM,OAAO,OACnB,MAAM,KAAO,OAAO,OACpB,MAAM,KAAO,OAAO,MACxB;EACJ;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,KAAK,KAAK,MAAO;CAI9B,MAAM,SAAS,MAAM;CACrB,OAAO,UAAU,QAAQ,UAAU,GAAG;EACpC,MAAM,SAAS,EAAE,WAAW,EAAE,SAAS,MAAM;EAC7C,MAAM,SAAS,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM;EACjD,MAAM,QAAQ,SAAS,aAAc,SAAS,aAAc;EAC5D,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,QAAS;GAC9B,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAEA,OAAO,SAAS,KAAK,EAAE,QAAQ;EAC7B,MAAM,OAAO,EAAE;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,KAAK,KAAK,MAAM,SAAS,IAAK;GACnD,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAIA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,QAAQ,KAAK,YAAY,KAAK,EAAE;AAEpC;;;;;AAMA,SAAS,KAAK,KAAa,OAAuB;CAChD,OAAO,KAAK,KAAK;CACjB,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,UAAU,UAAU,OAAO,OAAO,QAAQ,EAAE;CAE9C,OAAO;AACT"}
+{"version":3,"file":"hash.js","names":[],"sources":["../../../../shared/src/hash.ts"],"sourcesContent":["import {\n  avalanche32,\n  PRIME32_1,\n  PRIME32_2,\n  PRIME32_3,\n  PRIME32_4,\n  PRIME32_5,\n  round32,\n} from './xxhash32.ts';\n\nexport const h32 = (s: string) => {\n  digest(s, 1);\n  return digests[0];\n};\nexport const h64 = (s: string) => wide(s, 2);\nexport const h128 = (s: string) => wide(s, 4);\n\nconst MAX_WORDS = 4;\n\n// `digest` is synchronous and does not recurse, so these can be reused across\n// calls instead of allocated per call.\nconst accs = new Int32Array(MAX_WORDS);\nconst stripes = new Int32Array(MAX_WORDS * 4);\nconst digests = new Uint32Array(MAX_WORDS);\nlet encoder: TextEncoder | undefined;\n\n/**\n * Inputs of up to this many UTF-16 code units are UTF-8 encoded into a reused\n * buffer: `TextEncoder#encode` allocates a fresh Uint8Array per call, which for\n * a row-key-sized string cost several times the hashing itself. Longer inputs\n * still allocate: there the allocation is a small share of the cost, and not\n * worth keeping a buffer that size alive.\n */\nconst MAX_REUSED_UNITS = 4096;\nlet utf8: Uint8Array | undefined;\n\n/**\n * xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the\n * digests in `digests[0..words)`.\n *\n * A seed only changes the initial accumulator values, so every word digests the\n * same input lanes. This walks the bytes once, advancing all `words` sets of\n * accumulators per lane, and UTF-8 encodes the string once. The result is\n * identical to `words` separate `xxHash32(str, i)` calls — which is what this\n * used to delegate to, and what `hash.test.ts` checks it still matches.\n */\nfunction digest(str: string, words: number): void {\n  encoder ??= new TextEncoder();\n  let b: Uint8Array;\n  let len: number;\n  if (str.length <= MAX_REUSED_UNITS) {\n    // A UTF-16 code unit is at most 3 UTF-8 bytes (a surrogate pair is 2 units\n    // and 4 bytes), so the whole string always fits. Bytes past `len` are left\n    // over from earlier calls and never read.\n    b = utf8 ??= new Uint8Array(3 * MAX_REUSED_UNITS);\n    len = encoder.encodeInto(str, b).written;\n  } else {\n    b = encoder.encode(str);\n    len = b.length;\n  }\n\n  for (let w = 0; w < words; w++) {\n    accs[w] = (w + PRIME32_5) & 0xffffffff;\n  }\n\n  let offset = 0;\n\n  /*\n      Step 2. Process stripes\n      A stripe is a contiguous segment of 16 bytes, evenly divided into 4 lanes\n      of 4 bytes each, each lane updating its own accumulator. Inputs shorter\n      than a stripe skip straight to step 4 with a single accumulator.\n  */\n  if (len >= 16) {\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      stripes[base] = (w + PRIME32_1 + PRIME32_2) & 0xffffffff;\n      stripes[base + 1] = (w + PRIME32_2) & 0xffffffff;\n      stripes[base + 2] = w;\n      stripes[base + 3] = (w - PRIME32_1) & 0xffffffff;\n    }\n\n    const limit = len - 16;\n    for (; offset <= limit; offset += 16) {\n      const l0 =\n        b[offset] |\n        (b[offset + 1] << 8) |\n        (b[offset + 2] << 16) |\n        (b[offset + 3] << 24);\n      const l1 =\n        b[offset + 4] |\n        (b[offset + 5] << 8) |\n        (b[offset + 6] << 16) |\n        (b[offset + 7] << 24);\n      const l2 =\n        b[offset + 8] |\n        (b[offset + 9] << 8) |\n        (b[offset + 10] << 16) |\n        (b[offset + 11] << 24);\n      const l3 =\n        b[offset + 12] |\n        (b[offset + 13] << 8) |\n        (b[offset + 14] << 16) |\n        (b[offset + 15] << 24);\n      for (let w = 0; w < words; w++) {\n        const base = w << 2;\n        stripes[base] = round32(stripes[base], l0);\n        stripes[base + 1] = round32(stripes[base + 1], l1);\n        stripes[base + 2] = round32(stripes[base + 2], l2);\n        stripes[base + 3] = round32(stripes[base + 3], l3);\n      }\n    }\n\n    /*\n        Step 3. Accumulator convergence\n        acc = (acc1 <<< 1) + (acc2 <<< 7) + (acc3 <<< 12) + (acc4 <<< 18);\n    */\n    for (let w = 0; w < words; w++) {\n      const base = w << 2;\n      const s0 = stripes[base];\n      const s1 = stripes[base + 1];\n      const s2 = stripes[base + 2];\n      const s3 = stripes[base + 3];\n      accs[w] =\n        (((s0 << 1) | (s0 >>> 31)) +\n          ((s1 << 7) | (s1 >>> 25)) +\n          ((s2 << 12) | (s2 >>> 20)) +\n          ((s3 << 18) | (s3 >>> 14))) &\n        0xffffffff;\n    }\n  }\n\n  // Step 4. Add input length.\n  for (let w = 0; w < words; w++) {\n    accs[w] = (accs[w] + len) & 0xffffffff;\n  }\n\n  // Step 5. Consume the remaining input, 4 bytes at a time and then 1 at a time.\n  const limit4 = len - 4;\n  for (; offset <= limit4; offset += 4) {\n    const laneN0 = b[offset] + (b[offset + 1] << 8);\n    const laneN1 = b[offset + 2] + (b[offset + 3] << 8);\n    const laneP = laneN0 * PRIME32_3 + ((laneN1 * PRIME32_3) << 16);\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + laneP) | 0;\n      acc = (acc << 17) | (acc >>> 15);\n      accs[w] = Math.imul(acc, PRIME32_4);\n    }\n  }\n\n  for (; offset < len; ++offset) {\n    const lane = b[offset];\n    for (let w = 0; w < words; w++) {\n      let acc = (accs[w] + Math.imul(lane, PRIME32_5)) | 0;\n      acc = (acc << 11) | (acc >>> 21);\n      accs[w] = Math.imul(acc, PRIME32_1);\n    }\n  }\n\n  // Step 6. Final mix (avalanche). The Uint32Array store turns any negatives\n  // back into a positive number.\n  for (let w = 0; w < words; w++) {\n    digests[w] = avalanche32(accs[w]);\n  }\n}\n\nconst wideView = new DataView(new ArrayBuffer(16));\n\n/**\n * A hash wider than 32 bits, folding the digests together highest seed first.\n *\n * Every bigint operation allocates its result, so folding word by word with a\n * `BigInt()`, a shift and an add per word allocated up to 6 bigints for h64 and\n * 12 for h128. Laying the words out big-endian and reading them back with\n * `getBigUint64` allocates 1 and 4 for the same values.\n */\nfunction wide(str: string, words: 2 | 4): bigint {\n  digest(str, words);\n  wideView.setUint32(0, digests[0]);\n  wideView.setUint32(4, digests[1]);\n  if (words === 2) {\n    return wideView.getBigUint64(0);\n  }\n  wideView.setUint32(8, digests[2]);\n  wideView.setUint32(12, digests[3]);\n  return (wideView.getBigUint64(0) << 64n) | wideView.getBigUint64(8);\n}\n\n// Re-exported for zero-protocol's AST hash, which cannot import xxhash32.ts\n// directly without tripping a tsc 7.0.2 bug (see the import comment in\n// zero-protocol/src/query-hash-visitor.ts).\nexport {avalanche32, PRIME32_1, PRIME32_5, round32} from './xxhash32.ts';\n"],"mappings":";;AAUA,IAAa,OAAO,MAAc;CAChC,OAAO,GAAG,CAAC;CACX,OAAO,QAAQ;AACjB;AACA,IAAa,OAAO,MAAc,KAAK,GAAG,CAAC;AAC3C,IAAa,QAAQ,MAAc,KAAK,GAAG,CAAC;AAE5C,IAAM,YAAY;AAIlB,IAAM,OAAO,IAAI,WAAW,SAAS;AACrC,IAAM,UAAU,IAAI,WAAW,YAAY,CAAC;AAC5C,IAAM,UAAU,IAAI,YAAY,SAAS;AACzC,IAAI;;;;;;;;AASJ,IAAM,mBAAmB;AACzB,IAAI;;;;;;;;;;;AAYJ,SAAS,OAAO,KAAa,OAAqB;CAChD,YAAY,IAAI,YAAY;CAC5B,IAAI;CACJ,IAAI;CACJ,IAAI,IAAI,UAAU,kBAAkB;EAIlC,IAAI,SAAS,IAAI,WAAW,IAAI,gBAAgB;EAChD,MAAM,QAAQ,WAAW,KAAK,CAAC,EAAE;CACnC,OAAO;EACL,IAAI,QAAQ,OAAO,GAAG;EACtB,MAAM,EAAE;CACV;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,IAAI,YAAa;CAG9B,IAAI,SAAS;CAQb,IAAI,OAAO,IAAI;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,QAAQ,QAAS,IAAI,YAAY,YAAa;GAC9C,QAAQ,OAAO,KAAM,IAAI,YAAa;GACtC,QAAQ,OAAO,KAAK;GACpB,QAAQ,OAAO,KAAM,IAAI,YAAa;EACxC;EAEA,MAAM,QAAQ,MAAM;EACpB,OAAO,UAAU,OAAO,UAAU,IAAI;GACpC,MAAM,KACJ,EAAE,UACD,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,MAAM;GACpB,MAAM,KACJ,EAAE,SAAS,KACV,EAAE,SAAS,MAAM,IACjB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,MAAM,KACJ,EAAE,SAAS,MACV,EAAE,SAAS,OAAO,IAClB,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,OAAO;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,OAAO,KAAK;IAClB,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,EAAE;IACzC,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;IACjD,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,IAAI,EAAE;GACnD;EACF;EAMA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,MAAM,KAAK,QAAQ,OAAO;GAC1B,KAAK,MACA,MAAM,IAAM,OAAO,OAClB,MAAM,IAAM,OAAO,OACnB,MAAM,KAAO,OAAO,OACpB,MAAM,KAAO,OAAO,MACxB;EACJ;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,KAAK,KAAM,KAAK,KAAK,MAAO;CAI9B,MAAM,SAAS,MAAM;CACrB,OAAO,UAAU,QAAQ,UAAU,GAAG;EACpC,MAAM,SAAS,EAAE,WAAW,EAAE,SAAS,MAAM;EAC7C,MAAM,SAAS,EAAE,SAAS,MAAM,EAAE,SAAS,MAAM;EACjD,MAAM,QAAQ,SAAS,aAAc,SAAS,aAAc;EAC5D,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,QAAS;GAC9B,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAEA,OAAO,SAAS,KAAK,EAAE,QAAQ;EAC7B,MAAM,OAAO,EAAE;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,MAAO,KAAK,KAAK,KAAK,KAAK,MAAM,SAAS,IAAK;GACnD,MAAO,OAAO,KAAO,QAAQ;GAC7B,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS;EACpC;CACF;CAIA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,QAAQ,KAAK,YAAY,KAAK,EAAE;AAEpC;AAEA,IAAM,2BAAW,IAAI,yBAAS,IAAI,YAAY,EAAE,CAAC;;;;;;;;;AAUjD,SAAS,KAAK,KAAa,OAAsB;CAC/C,OAAO,KAAK,KAAK;CACjB,SAAS,UAAU,GAAG,QAAQ,EAAE;CAChC,SAAS,UAAU,GAAG,QAAQ,EAAE;CAChC,IAAI,UAAU,GACZ,OAAO,SAAS,aAAa,CAAC;CAEhC,SAAS,UAAU,GAAG,QAAQ,EAAE;CAChC,SAAS,UAAU,IAAI,QAAQ,EAAE;CACjC,OAAQ,SAAS,aAAa,CAAC,KAAK,MAAO,SAAS,aAAa,CAAC;AACpE"}

package/out/shared/src/iterables.d.ts

@@ -16,5 +16,7 @@ export declare function wrapIterable<T>(iter: Iterable<T>): IteratorWithHelpers<
  */
 export declare function toSorted<T>(iter: Iterable<T>, compare?: (a: T, b: T) => number): T[];
 export declare function some<T>(iterable: Iterable<T>, predicate: (item: T, index: number) => boolean): boolean;
+export declare const emptyIterator: IterableIterator<any, undefined, any>;
+export declare function makeEmptyIteratorWithReturn<T>(value: T): IterableIterator<any, T, any>;
 export {};
 //# sourceMappingURL=iterables.d.ts.map

package/out/shared/src/iterables.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"iterables.d.ts","sourceRoot":"","sources":["../../../../shared/src/iterables.ts"],"names":[],"mappings":"AAAA,wBAAiB,aAAa,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,2BAIxD;AAwBD,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAK3D;AAED,wBAAiB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAOzD;AAKD,KAAK,mBAAmB,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG;IAC1C,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,OAAO,CAAC;IACnD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,CAAC;CAC7C,CAAC;AA6CF,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAEzE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACxB,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAC/B,CAAC,EAAE,CAGL;AAED,wBAAgB,IAAI,CAAC,CAAC,EACpB,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAC7C,OAAO,CAQT"}
+{"version":3,"file":"iterables.d.ts","sourceRoot":"","sources":["../../../../shared/src/iterables.ts"],"names":[],"mappings":"AAAA,wBAAiB,aAAa,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,2BAIxD;AAwBD,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAK3D;AAED,wBAAiB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAOzD;AAKD,KAAK,mBAAmB,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG;IAC1C,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,OAAO,CAAC;IACnD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,CAAC;CAC7C,CAAC;AA6CF,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAEzE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACxB,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAC/B,CAAC,EAAE,CAGL;AAED,wBAAgB,IAAI,CAAC,CAAC,EACpB,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAC7C,OAAO,CAQT;AAuBD,eAAO,MAAM,aAAa,EAAE,gBAAgB,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,CACxB,CAAC;AAEzC,wBAAgB,2BAA2B,CAAC,CAAC,EAC3C,KAAK,EAAE,CAAC,GAEP,gBAAgB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAE/B"}

package/out/shared/src/iterables.js

@@ -55,7 +55,24 @@ function some(iterable, predicate) {
 	for (const item of iterable) if (predicate(item, index++)) return true;
 	return false;
 }
+var EmptyIteratorWithReturn = class {
+	value;
+	done = true;
+	constructor(value) {
+		this.value = value;
+	}
+	[Symbol.iterator]() {
+		return this;
+	}
+	next() {
+		return this;
+	}
+};
+var emptyIterator = new EmptyIteratorWithReturn(void 0);
+function makeEmptyIteratorWithReturn(value) {
+	return new EmptyIteratorWithReturn(value);
+}
 //#endregion
-export { joinIterables, once, some, toSorted, wrapIterable };
+export { emptyIterator, joinIterables, makeEmptyIteratorWithReturn, once, some, toSorted, wrapIterable };
 
 //# sourceMappingURL=iterables.js.map

package/out/shared/src/iterables.js.map

@@ -1 +1 @@
-{"version":3,"file":"iterables.js","names":["#iterator"],"sources":["../../../../shared/src/iterables.ts"],"sourcesContent":["export function* joinIterables<T>(...iters: Iterable<T>[]) {\n  for (const iter of iters) {\n    yield* iter;\n  }\n}\n\nfunction* filterIter<T>(\n  iter: Iterable<T>,\n  p: (t: T, index: number) => boolean,\n): Iterable<T> {\n  let index = 0;\n  for (const t of iter) {\n    if (p(t, index++)) {\n      yield t;\n    }\n  }\n}\n\nfunction* mapIter<T, U>(\n  iter: Iterable<T>,\n  f: (t: T, index: number) => U,\n): Iterable<U> {\n  let index = 0;\n  for (const t of iter) {\n    yield f(t, index++);\n  }\n}\n\nexport function first<T>(stream: Iterable<T>): T | undefined {\n  const it = stream[Symbol.iterator]();\n  const {value} = it.next();\n  it.return?.();\n  return value;\n}\n\nexport function* once<T>(stream: Iterable<T>): Iterable<T> {\n  const it = stream[Symbol.iterator]();\n  const {value} = it.next();\n  if (value !== undefined) {\n    yield value;\n  }\n  it.return?.();\n}\n\n// ES2024 Iterator helpers are available in Node 22+ and part of ES2024.\n// https://github.com/tc39/proposal-iterator-helpers\n\ntype IteratorWithHelpers<T> = Iterator<T> & {\n  map<U>(f: (t: T, index: number) => U): IteratorWithHelpers<U>;\n  filter(p: (t: T, index: number) => boolean): IteratorWithHelpers<T>;\n  some(p: (t: T, index: number) => boolean): boolean;\n  [Symbol.iterator](): IteratorWithHelpers<T>;\n};\n\ntype IteratorConstructor = {\n  from<T>(this: void, iter: Iterable<T>): IteratorWithHelpers<T>;\n};\n\n// Check if native Iterator.from is available and bind it once at startup\n// We use globalThis to access the runtime value safely\nconst iteratorCtor = (globalThis as {Iterator?: IteratorConstructor}).Iterator;\nconst nativeIteratorFrom = iteratorCtor?.from as\n  | (<T>(iter: Iterable<T>) => IteratorWithHelpers<T>)\n  | undefined;\n\nconst iteratorFrom: <T>(e: Iterable<T>) => IteratorWithHelpers<T> =\n  nativeIteratorFrom ?? (e => new IterWrapper(e));\n\n// Fallback implementation for environments without ES2024 Iterator helpers\nclass IterWrapper<T> implements IteratorWithHelpers<T>, IterableIterator<T> {\n  readonly #iterator: Iterator<T>;\n\n  constructor(iterable: Iterable<T>) {\n    this.#iterator = iterable[Symbol.iterator]();\n  }\n\n  next(): IteratorResult<T> {\n    return this.#iterator.next();\n  }\n\n  [Symbol.iterator](): IteratorWithHelpers<T> {\n    return this;\n  }\n\n  map<U>(f: (t: T, index: number) => U): IterWrapper<U> {\n    return new IterWrapper(mapIter(this, f));\n  }\n\n  filter(p: (t: T, index: number) => boolean): IterWrapper<T> {\n    return new IterWrapper(filterIter(this, p));\n  }\n\n  some(p: (t: T, index: number) => boolean): boolean {\n    return some(this, p);\n  }\n}\n\nexport function wrapIterable<T>(iter: Iterable<T>): IteratorWithHelpers<T> {\n  return iteratorFrom(iter);\n}\n\n/**\n * This will make a new array where the elements are the same as the iterable\n * but sorted according to the compare function. If the compare function is not\n * provided, it will sort the elements in JS standard way which is string\n * compare.\n */\nexport function toSorted<T>(\n  iter: Iterable<T>,\n  compare?: (a: T, b: T) => number,\n): T[] {\n  // oxlint-disable-next-line e18e/prefer-array-to-sorted\n  return [...iter].sort(compare);\n}\n\nexport function some<T>(\n  iterable: Iterable<T>,\n  predicate: (item: T, index: number) => boolean,\n): boolean {\n  let index = 0;\n  for (const item of iterable) {\n    if (predicate(item, index++)) {\n      return true;\n    }\n  }\n  return false;\n}\n"],"mappings":";AAAA,UAAiB,cAAiB,GAAG,OAAsB;CACzD,KAAK,MAAM,QAAQ,OACjB,OAAO;AAEX;AAEA,UAAU,WACR,MACA,GACa;CACb,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,MACd,IAAI,EAAE,GAAG,OAAO,GACd,MAAM;AAGZ;AAEA,UAAU,QACR,MACA,GACa;CACb,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,MACd,MAAM,EAAE,GAAG,OAAO;AAEtB;AASA,UAAiB,KAAQ,QAAkC;CACzD,MAAM,KAAK,OAAO,OAAO,UAAU;CACnC,MAAM,EAAC,UAAS,GAAG,KAAK;CACxB,IAAI,UAAU,KAAA,GACZ,MAAM;CAER,GAAG,SAAS;AACd;AAuBA,IAAM,eALgB,WAAgD,UAC7B,UAKhB,MAAK,IAAI,YAAY,CAAC;AAG/C,IAAM,cAAN,MAAM,YAAsE;CAC1E;CAEA,YAAY,UAAuB;EACjC,KAAKA,YAAY,SAAS,OAAO,UAAU;CAC7C;CAEA,OAA0B;EACxB,OAAO,KAAKA,UAAU,KAAK;CAC7B;CAEA,CAAC,OAAO,YAAoC;EAC1C,OAAO;CACT;CAEA,IAAO,GAA+C;EACpD,OAAO,IAAI,YAAY,QAAQ,MAAM,CAAC,CAAC;CACzC;CAEA,OAAO,GAAqD;EAC1D,OAAO,IAAI,YAAY,WAAW,MAAM,CAAC,CAAC;CAC5C;CAEA,KAAK,GAA8C;EACjD,OAAO,KAAK,MAAM,CAAC;CACrB;AACF;AAEA,SAAgB,aAAgB,MAA2C;CACzE,OAAO,aAAa,IAAI;AAC1B;;;;;;;AAQA,SAAgB,SACd,MACA,SACK;CAEL,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,OAAO;AAC/B;AAEA,SAAgB,KACd,UACA,WACS;CACT,IAAI,QAAQ;CACZ,KAAK,MAAM,QAAQ,UACjB,IAAI,UAAU,MAAM,OAAO,GACzB,OAAO;CAGX,OAAO;AACT"}
+{"version":3,"file":"iterables.js","names":["#iterator"],"sources":["../../../../shared/src/iterables.ts"],"sourcesContent":["export function* joinIterables<T>(...iters: Iterable<T>[]) {\n  for (const iter of iters) {\n    yield* iter;\n  }\n}\n\nfunction* filterIter<T>(\n  iter: Iterable<T>,\n  p: (t: T, index: number) => boolean,\n): Iterable<T> {\n  let index = 0;\n  for (const t of iter) {\n    if (p(t, index++)) {\n      yield t;\n    }\n  }\n}\n\nfunction* mapIter<T, U>(\n  iter: Iterable<T>,\n  f: (t: T, index: number) => U,\n): Iterable<U> {\n  let index = 0;\n  for (const t of iter) {\n    yield f(t, index++);\n  }\n}\n\nexport function first<T>(stream: Iterable<T>): T | undefined {\n  const it = stream[Symbol.iterator]();\n  const {value} = it.next();\n  it.return?.();\n  return value;\n}\n\nexport function* once<T>(stream: Iterable<T>): Iterable<T> {\n  const it = stream[Symbol.iterator]();\n  const {value} = it.next();\n  if (value !== undefined) {\n    yield value;\n  }\n  it.return?.();\n}\n\n// ES2024 Iterator helpers are available in Node 22+ and part of ES2024.\n// https://github.com/tc39/proposal-iterator-helpers\n\ntype IteratorWithHelpers<T> = Iterator<T> & {\n  map<U>(f: (t: T, index: number) => U): IteratorWithHelpers<U>;\n  filter(p: (t: T, index: number) => boolean): IteratorWithHelpers<T>;\n  some(p: (t: T, index: number) => boolean): boolean;\n  [Symbol.iterator](): IteratorWithHelpers<T>;\n};\n\ntype IteratorConstructor = {\n  from<T>(this: void, iter: Iterable<T>): IteratorWithHelpers<T>;\n};\n\n// Check if native Iterator.from is available and bind it once at startup\n// We use globalThis to access the runtime value safely\nconst iteratorCtor = (globalThis as {Iterator?: IteratorConstructor}).Iterator;\nconst nativeIteratorFrom = iteratorCtor?.from as\n  | (<T>(iter: Iterable<T>) => IteratorWithHelpers<T>)\n  | undefined;\n\nconst iteratorFrom: <T>(e: Iterable<T>) => IteratorWithHelpers<T> =\n  nativeIteratorFrom ?? (e => new IterWrapper(e));\n\n// Fallback implementation for environments without ES2024 Iterator helpers\nclass IterWrapper<T> implements IteratorWithHelpers<T>, IterableIterator<T> {\n  readonly #iterator: Iterator<T>;\n\n  constructor(iterable: Iterable<T>) {\n    this.#iterator = iterable[Symbol.iterator]();\n  }\n\n  next(): IteratorResult<T> {\n    return this.#iterator.next();\n  }\n\n  [Symbol.iterator](): IteratorWithHelpers<T> {\n    return this;\n  }\n\n  map<U>(f: (t: T, index: number) => U): IterWrapper<U> {\n    return new IterWrapper(mapIter(this, f));\n  }\n\n  filter(p: (t: T, index: number) => boolean): IterWrapper<T> {\n    return new IterWrapper(filterIter(this, p));\n  }\n\n  some(p: (t: T, index: number) => boolean): boolean {\n    return some(this, p);\n  }\n}\n\nexport function wrapIterable<T>(iter: Iterable<T>): IteratorWithHelpers<T> {\n  return iteratorFrom(iter);\n}\n\n/**\n * This will make a new array where the elements are the same as the iterable\n * but sorted according to the compare function. If the compare function is not\n * provided, it will sort the elements in JS standard way which is string\n * compare.\n */\nexport function toSorted<T>(\n  iter: Iterable<T>,\n  compare?: (a: T, b: T) => number,\n): T[] {\n  // oxlint-disable-next-line e18e/prefer-array-to-sorted\n  return [...iter].sort(compare);\n}\n\nexport function some<T>(\n  iterable: Iterable<T>,\n  predicate: (item: T, index: number) => boolean,\n): boolean {\n  let index = 0;\n  for (const item of iterable) {\n    if (predicate(item, index++)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nclass EmptyIteratorWithReturn<T>\n  // oxlint-disable-next-line typescript/no-explicit-any\n  implements IterableIterator<any, T, any>, IteratorReturnResult<T>\n{\n  readonly value: T;\n  readonly done = true;\n\n  constructor(value: T) {\n    this.value = value;\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n\n  next() {\n    return this;\n  }\n}\n\n// oxlint-disable-next-line typescript/no-explicit-any\nexport const emptyIterator: IterableIterator<any, undefined, any> =\n  new EmptyIteratorWithReturn(undefined);\n\nexport function makeEmptyIteratorWithReturn<T>(\n  value: T,\n  // oxlint-disable-next-line typescript/no-explicit-any\n): IterableIterator<any, T, any> {\n  return new EmptyIteratorWithReturn(value);\n}\n"],"mappings":";AAAA,UAAiB,cAAiB,GAAG,OAAsB;CACzD,KAAK,MAAM,QAAQ,OACjB,OAAO;AAEX;AAEA,UAAU,WACR,MACA,GACa;CACb,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,MACd,IAAI,EAAE,GAAG,OAAO,GACd,MAAM;AAGZ;AAEA,UAAU,QACR,MACA,GACa;CACb,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,MACd,MAAM,EAAE,GAAG,OAAO;AAEtB;AASA,UAAiB,KAAQ,QAAkC;CACzD,MAAM,KAAK,OAAO,OAAO,UAAU;CACnC,MAAM,EAAC,UAAS,GAAG,KAAK;CACxB,IAAI,UAAU,KAAA,GACZ,MAAM;CAER,GAAG,SAAS;AACd;AAuBA,IAAM,eALgB,WAAgD,UAC7B,UAKhB,MAAK,IAAI,YAAY,CAAC;AAG/C,IAAM,cAAN,MAAM,YAAsE;CAC1E;CAEA,YAAY,UAAuB;EACjC,KAAKA,YAAY,SAAS,OAAO,UAAU;CAC7C;CAEA,OAA0B;EACxB,OAAO,KAAKA,UAAU,KAAK;CAC7B;CAEA,CAAC,OAAO,YAAoC;EAC1C,OAAO;CACT;CAEA,IAAO,GAA+C;EACpD,OAAO,IAAI,YAAY,QAAQ,MAAM,CAAC,CAAC;CACzC;CAEA,OAAO,GAAqD;EAC1D,OAAO,IAAI,YAAY,WAAW,MAAM,CAAC,CAAC;CAC5C;CAEA,KAAK,GAA8C;EACjD,OAAO,KAAK,MAAM,CAAC;CACrB;AACF;AAEA,SAAgB,aAAgB,MAA2C;CACzE,OAAO,aAAa,IAAI;AAC1B;;;;;;;AAQA,SAAgB,SACd,MACA,SACK;CAEL,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,OAAO;AAC/B;AAEA,SAAgB,KACd,UACA,WACS;CACT,IAAI,QAAQ;CACZ,KAAK,MAAM,QAAQ,UACjB,IAAI,UAAU,MAAM,OAAO,GACzB,OAAO;CAGX,OAAO;AACT;AAEA,IAAM,0BAAN,MAGA;CACE;CACA,OAAgB;CAEhB,YAAY,OAAU;EACpB,KAAK,QAAQ;CACf;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;CAEA,OAAO;EACL,OAAO;CACT;AACF;AAGA,IAAa,gBACX,IAAI,wBAAwB,KAAA,CAAS;AAEvC,SAAgB,4BACd,OAE+B;CAC/B,OAAO,IAAI,wBAAwB,KAAK;AAC1C"}

package/out/shared/src/map.d.ts

@@ -1,18 +1,40 @@
+/**
+ * A value that {@link Map.get} can distinguish from a missing entry.  `undefined`
+ * is excluded because these helpers use `get() !== undefined` to detect absence.
+ */
+type Defined = {} | null;
+/**
+ * A {@link Map} or a {@link WeakMap}.  The ES2026 proposal adds `getOrInsert`
+ * and `getOrInsertComputed` to both.
+ */
+type MapOrWeakMap<K, V> = Map<K, V> | WeakMap<K & WeakKey, V>;
 /**
  * Returns the value for {@link key} in {@link map}.  If no mapping exists,
  * inserts {@link defaultValue} and returns it.
  *
  * Mirrors the ES2026 `Map.prototype.getOrInsert` proposal.
  */
-declare function getOrInsertPolyfill<K, V>(map: Map<K, V>, key: K, defaultValue: V): V;
+declare function getOrInsertPolyfill<K, V extends Defined>(map: MapOrWeakMap<K, V>, key: K, defaultValue: NoInfer<V>): V;
 /**
  * Returns the value for {@link key} in {@link map}.  If no mapping exists,
  * calls {@link compute} with the key, inserts the result, and returns it.
  *
  * Mirrors the ES2026 `Map.prototype.getOrInsertComputed` proposal.
  */
-declare function getOrInsertComputedPolyfill<K, V>(map: Map<K, V>, key: K, compute: (key: K) => V): V;
+declare function getOrInsertComputedPolyfill<K, V extends Defined>(map: MapOrWeakMap<K, V>, key: K, compute: (key: K) => NoInfer<V>): V;
 export declare const getOrInsert: typeof getOrInsertPolyfill;
 export declare const getOrInsertComputed: typeof getOrInsertComputedPolyfill;
+/**
+ * Creates an empty {@link Map}.  Pass this to {@link getOrInsertComputed}
+ * instead of an inline `() => new Map()` so that a hit does not allocate a
+ * closure.
+ */
+export declare const newMap: <K, V>() => Map<K, V>;
+/**
+ * Creates an empty {@link WeakMap}.  Pass this to {@link getOrInsertComputed}
+ * instead of an inline `() => new WeakMap()` so that a hit does not allocate a
+ * closure.
+ */
+export declare const newWeakMap: <K extends WeakKey, V>() => WeakMap<K, V>;
 export {};
 //# sourceMappingURL=map.d.ts.map

package/out/shared/src/map.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../../../shared/src/map.ts"],"names":[],"mappings":"AASA;;;;;GAKG;AACH,iBAAS,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC,CAO7E;AAED;;;;;GAKG;AACH,iBAAS,2BAA2B,CAAC,CAAC,EAAE,CAAC,EACvC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GACrB,CAAC,CAQH;AAcD,eAAO,MAAM,WAAW,4BAED,CAAC;AAExB,eAAO,MAAM,mBAAmB,oCAED,CAAC"}
+{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../../../shared/src/map.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,KAAK,OAAO,GAAG,EAAE,GAAG,IAAI,CAAC;AAEzB;;;GAGG;AACH,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;AAiB9D;;;;;GAKG;AACH,iBAAS,mBAAmB,CAAC,CAAC,EAAE,CAAC,SAAS,OAAO,EAC/C,GAAG,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EACvB,GAAG,EAAE,CAAC,EACN,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC,GACvB,CAAC,CAOH;AAED;;;;;GAKG;AACH,iBAAS,2BAA2B,CAAC,CAAC,EAAE,CAAC,SAAS,OAAO,EACvD,GAAG,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EACvB,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,GAC9B,CAAC,CAQH;AAkBD,eAAO,MAAM,WAAW,4BAED,CAAC;AAExB,eAAO,MAAM,mBAAmB,oCAED,CAAC;AAEhC;;;;GAIG;AACH,eAAO,MAAM,MAAM,GAAI,CAAC,EAAE,CAAC,OAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAc,CAAC;AAEvD;;;;GAIG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,SAAS,OAAO,EAAE,CAAC,OAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CACjD,CAAC"}

package/out/shared/src/map.js

@@ -1,5 +1,7 @@
 //#region ../shared/src/map.ts
-var nativeSupport = typeof Map.prototype.getOrInsert === "function";
+function hasNative(name) {
+	return typeof Map.prototype[name] === "function" && typeof WeakMap.prototype[name] === "function";
+}
 /**
 * Returns the value for {@link key} in {@link map}.  If no mapping exists,
 * inserts {@link defaultValue} and returns it.
@@ -31,9 +33,21 @@ function getOrInsertNative(map, key, defaultValue) {
 function getOrInsertComputedNative(map, key, compute) {
 	return map.getOrInsertComputed(key, compute);
 }
-var getOrInsert = nativeSupport ? getOrInsertNative : getOrInsertPolyfill;
-var getOrInsertComputed = nativeSupport ? getOrInsertComputedNative : getOrInsertComputedPolyfill;
+var getOrInsert = hasNative("getOrInsert") ? getOrInsertNative : getOrInsertPolyfill;
+var getOrInsertComputed = hasNative("getOrInsertComputed") ? getOrInsertComputedNative : getOrInsertComputedPolyfill;
+/**
+* Creates an empty {@link Map}.  Pass this to {@link getOrInsertComputed}
+* instead of an inline `() => new Map()` so that a hit does not allocate a
+* closure.
+*/
+var newMap = () => /* @__PURE__ */ new Map();
+/**
+* Creates an empty {@link WeakMap}.  Pass this to {@link getOrInsertComputed}
+* instead of an inline `() => new WeakMap()` so that a hit does not allocate a
+* closure.
+*/
+var newWeakMap = () => /* @__PURE__ */ new WeakMap();
 //#endregion
-export { getOrInsert, getOrInsertComputed };
+export { getOrInsert, getOrInsertComputed, newMap, newWeakMap };
 
 //# sourceMappingURL=map.js.map

package/out/shared/src/map.js.map

@@ -1 +1 @@
-{"version":3,"file":"map.js","names":[],"sources":["../../../../shared/src/map.ts"],"sourcesContent":["const nativeSupport =\n  typeof (Map.prototype as unknown as MapES2026<unknown, unknown>)\n    .getOrInsert === 'function';\n\ninterface MapES2026<K, V> {\n  getOrInsert(key: K, defaultValue: V): V;\n  getOrInsertComputed(key: K, compute: (key: K) => V): V;\n}\n\n/**\n * Returns the value for {@link key} in {@link map}.  If no mapping exists,\n * inserts {@link defaultValue} and returns it.\n *\n * Mirrors the ES2026 `Map.prototype.getOrInsert` proposal.\n */\nfunction getOrInsertPolyfill<K, V>(map: Map<K, V>, key: K, defaultValue: V): V {\n  const existing = map.get(key);\n  if (existing !== undefined) {\n    return existing;\n  }\n  map.set(key, defaultValue);\n  return defaultValue;\n}\n\n/**\n * Returns the value for {@link key} in {@link map}.  If no mapping exists,\n * calls {@link compute} with the key, inserts the result, and returns it.\n *\n * Mirrors the ES2026 `Map.prototype.getOrInsertComputed` proposal.\n */\nfunction getOrInsertComputedPolyfill<K, V>(\n  map: Map<K, V>,\n  key: K,\n  compute: (key: K) => V,\n): V {\n  const existing = map.get(key);\n  if (existing !== undefined) {\n    return existing;\n  }\n  const value = compute(key);\n  map.set(key, value);\n  return value;\n}\n\nfunction getOrInsertNative<K, V>(map: Map<K, V>, key: K, defaultValue: V): V {\n  return (map as unknown as MapES2026<K, V>).getOrInsert(key, defaultValue);\n}\n\nfunction getOrInsertComputedNative<K, V>(\n  map: Map<K, V>,\n  key: K,\n  compute: (key: K) => V,\n): V {\n  return (map as unknown as MapES2026<K, V>).getOrInsertComputed(key, compute);\n}\n\nexport const getOrInsert = nativeSupport\n  ? getOrInsertNative\n  : getOrInsertPolyfill;\n\nexport const getOrInsertComputed = nativeSupport\n  ? getOrInsertComputedNative\n  : getOrInsertComputedPolyfill;\n"],"mappings":";AAAA,IAAM,gBACJ,OAAQ,IAAI,UACT,gBAAgB;;;;;;;AAarB,SAAS,oBAA0B,KAAgB,KAAQ,cAAoB;CAC7E,MAAM,WAAW,IAAI,IAAI,GAAG;CAC5B,IAAI,aAAa,KAAA,GACf,OAAO;CAET,IAAI,IAAI,KAAK,YAAY;CACzB,OAAO;AACT;;;;;;;AAQA,SAAS,4BACP,KACA,KACA,SACG;CACH,MAAM,WAAW,IAAI,IAAI,GAAG;CAC5B,IAAI,aAAa,KAAA,GACf,OAAO;CAET,MAAM,QAAQ,QAAQ,GAAG;CACzB,IAAI,IAAI,KAAK,KAAK;CAClB,OAAO;AACT;AAEA,SAAS,kBAAwB,KAAgB,KAAQ,cAAoB;CAC3E,OAAQ,IAAmC,YAAY,KAAK,YAAY;AAC1E;AAEA,SAAS,0BACP,KACA,KACA,SACG;CACH,OAAQ,IAAmC,oBAAoB,KAAK,OAAO;AAC7E;AAEA,IAAa,cAAc,gBACvB,oBACA;AAEJ,IAAa,sBAAsB,gBAC/B,4BACA"}
+{"version":3,"file":"map.js","names":[],"sources":["../../../../shared/src/map.ts"],"sourcesContent":["/**\n * A value that {@link Map.get} can distinguish from a missing entry.  `undefined`\n * is excluded because these helpers use `get() !== undefined` to detect absence.\n */\ntype Defined = {} | null;\n\n/**\n * A {@link Map} or a {@link WeakMap}.  The ES2026 proposal adds `getOrInsert`\n * and `getOrInsertComputed` to both.\n */\ntype MapOrWeakMap<K, V> = Map<K, V> | WeakMap<K & WeakKey, V>;\n\nfunction hasNative(name: keyof MapES2026<unknown, Defined>): boolean {\n  return (\n    typeof (Map.prototype as unknown as MapES2026<unknown, Defined>)[name] ===\n      'function' &&\n    typeof (WeakMap.prototype as unknown as MapES2026<WeakKey, Defined>)[\n      name\n    ] === 'function'\n  );\n}\n\ninterface MapES2026<K, V> {\n  getOrInsert(key: K, defaultValue: V): V;\n  getOrInsertComputed(key: K, compute: (key: K) => V): V;\n}\n\n/**\n * Returns the value for {@link key} in {@link map}.  If no mapping exists,\n * inserts {@link defaultValue} and returns it.\n *\n * Mirrors the ES2026 `Map.prototype.getOrInsert` proposal.\n */\nfunction getOrInsertPolyfill<K, V extends Defined>(\n  map: MapOrWeakMap<K, V>,\n  key: K,\n  defaultValue: NoInfer<V>,\n): V {\n  const existing = map.get(key as K & WeakKey);\n  if (existing !== undefined) {\n    return existing;\n  }\n  map.set(key as K & WeakKey, defaultValue);\n  return defaultValue;\n}\n\n/**\n * Returns the value for {@link key} in {@link map}.  If no mapping exists,\n * calls {@link compute} with the key, inserts the result, and returns it.\n *\n * Mirrors the ES2026 `Map.prototype.getOrInsertComputed` proposal.\n */\nfunction getOrInsertComputedPolyfill<K, V extends Defined>(\n  map: MapOrWeakMap<K, V>,\n  key: K,\n  compute: (key: K) => NoInfer<V>,\n): V {\n  const existing = map.get(key as K & WeakKey);\n  if (existing !== undefined) {\n    return existing;\n  }\n  const value = compute(key);\n  map.set(key as K & WeakKey, value);\n  return value;\n}\n\nfunction getOrInsertNative<K, V extends Defined>(\n  map: MapOrWeakMap<K, V>,\n  key: K,\n  defaultValue: NoInfer<V>,\n): V {\n  return (map as unknown as MapES2026<K, V>).getOrInsert(key, defaultValue);\n}\n\nfunction getOrInsertComputedNative<K, V extends Defined>(\n  map: MapOrWeakMap<K, V>,\n  key: K,\n  compute: (key: K) => NoInfer<V>,\n): V {\n  return (map as unknown as MapES2026<K, V>).getOrInsertComputed(key, compute);\n}\n\nexport const getOrInsert = hasNative('getOrInsert')\n  ? getOrInsertNative\n  : getOrInsertPolyfill;\n\nexport const getOrInsertComputed = hasNative('getOrInsertComputed')\n  ? getOrInsertComputedNative\n  : getOrInsertComputedPolyfill;\n\n/**\n * Creates an empty {@link Map}.  Pass this to {@link getOrInsertComputed}\n * instead of an inline `() => new Map()` so that a hit does not allocate a\n * closure.\n */\nexport const newMap = <K, V>(): Map<K, V> => new Map();\n\n/**\n * Creates an empty {@link WeakMap}.  Pass this to {@link getOrInsertComputed}\n * instead of an inline `() => new WeakMap()` so that a hit does not allocate a\n * closure.\n */\nexport const newWeakMap = <K extends WeakKey, V>(): WeakMap<K, V> =>\n  new WeakMap();\n"],"mappings":";AAYA,SAAS,UAAU,MAAkD;CACnE,OACE,OAAQ,IAAI,UAAqD,UAC/D,cACF,OAAQ,QAAQ,UACd,UACI;AAEV;;;;;;;AAaA,SAAS,oBACP,KACA,KACA,cACG;CACH,MAAM,WAAW,IAAI,IAAI,GAAkB;CAC3C,IAAI,aAAa,KAAA,GACf,OAAO;CAET,IAAI,IAAI,KAAoB,YAAY;CACxC,OAAO;AACT;;;;;;;AAQA,SAAS,4BACP,KACA,KACA,SACG;CACH,MAAM,WAAW,IAAI,IAAI,GAAkB;CAC3C,IAAI,aAAa,KAAA,GACf,OAAO;CAET,MAAM,QAAQ,QAAQ,GAAG;CACzB,IAAI,IAAI,KAAoB,KAAK;CACjC,OAAO;AACT;AAEA,SAAS,kBACP,KACA,KACA,cACG;CACH,OAAQ,IAAmC,YAAY,KAAK,YAAY;AAC1E;AAEA,SAAS,0BACP,KACA,KACA,SACG;CACH,OAAQ,IAAmC,oBAAoB,KAAK,OAAO;AAC7E;AAEA,IAAa,cAAc,UAAU,aAAa,IAC9C,oBACA;AAEJ,IAAa,sBAAsB,UAAU,qBAAqB,IAC9D,4BACA;;;;;;AAOJ,IAAa,+BAAgC,IAAI,IAAI;;;;;;AAOrD,IAAa,mCACX,IAAI,QAAQ"}

package/out/shared/src/options-types.d.ts

@@ -29,13 +29,13 @@ export type Group = Record<string, Option>;
  *
  * ```ts
  * {
- *   port: v.number().default(8080),
+ *   port: v.number().optional(() => 8080),
  *
  *   numWorkers: v.number(),
  *
  *   log: {
  *     level: v.union(v.literal('debug'), v.literal('info'), ...),
- *     format: v.union(v.literal('text'), v.literal('json')).default('text'),
+ *     format: v.union(v.literal('text'), v.literal('json')).optional(() => 'text'),
  *   }
  * }
  * ```

package/out/shared/src/options.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"options.d.ts","sourceRoot":"","sources":["../../../../shared/src/options.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,cAAc,EAAC,MAAM,kBAAkB,CAAC;AASrD,OAAO,KAAK,EACV,MAAM,EACN,KAAK,EACL,MAAM,EACN,OAAO,EACP,iBAAiB,EAClB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAEjC,YAAY,EAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAC,CAAC;AAiFhE;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,aAAa,SAAK;;cAgC1E;AAeD,MAAM,MAAM,YAAY,GAAG;IACzB,wCAAwC;IACxC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAEhB,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,WAAW,CAAC,EAAE;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAC,EAAE,CAAC;IAElD,0BAA0B;IAC1B,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB,0BAA0B;IAC1B,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB,iCAAiC;IACjC,GAAG,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC;IAExB,0BAA0B;IAC1B,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAElC,sGAAsG;IACtG,eAAe,CAAC,EAAE,OAAO,CAAC;IAE1B,4BAA4B;IAC5B,MAAM,CAAC,EAAE,cAAc,CAAC;IAExB,iCAAiC;IACjC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,KAAK,KAAK,CAAC;CACjD,CAAC;AAEF,wBAAgB,YAAY,CAAC,CAAC,SAAS,OAAO,EAC5C,UAAU,EAAE,CAAC,EACb,IAAI,GAAE,YAAiB,GACtB,MAAM,CAAC,CAAC,CAAC,CAEX;AAED,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,OAAO,EACpD,UAAU,EAAE,CAAC,EACb,IAAI,GAAE,YAAiB,GACtB;IAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;CAAC,CA0KtE;AA6FD,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAE9D;AAED,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,WAQ7D"}
+{"version":3,"file":"options.d.ts","sourceRoot":"","sources":["../../../../shared/src/options.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,cAAc,EAAC,MAAM,kBAAkB,CAAC;AASrD,OAAO,KAAK,EACV,MAAM,EACN,KAAK,EACL,MAAM,EACN,OAAO,EACP,iBAAiB,EAClB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAEjC,YAAY,EAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAC,CAAC;AAiFhE;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,aAAa,SAAK;;cAgC1E;AAUD,MAAM,MAAM,YAAY,GAAG;IACzB,wCAAwC;IACxC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAEhB,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,WAAW,CAAC,EAAE;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAC,EAAE,CAAC;IAElD,0BAA0B;IAC1B,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB,0BAA0B;IAC1B,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB,iCAAiC;IACjC,GAAG,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC;IAExB,0BAA0B;IAC1B,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAElC,sGAAsG;IACtG,eAAe,CAAC,EAAE,OAAO,CAAC;IAE1B,4BAA4B;IAC5B,MAAM,CAAC,EAAE,cAAc,CAAC;IAExB,iCAAiC;IACjC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,KAAK,KAAK,CAAC;CACjD,CAAC;AAEF,wBAAgB,YAAY,CAAC,CAAC,SAAS,OAAO,EAC5C,UAAU,EAAE,CAAC,EACb,IAAI,GAAE,YAAiB,GACtB,MAAM,CAAC,CAAC,CAAC,CAEX;AAED,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,OAAO,EACpD,UAAU,EAAE,CAAC,EACb,IAAI,GAAE,YAAiB,GACtB;IAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;CAAC,CA+KtE;AA6FD,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAE9D;AAED,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,WAQ7D"}

package/out/shared/src/options.js

@@ -1,5 +1,5 @@
 import { assert } from "./asserts.js";
-import { deepPartial, instanceOfAbstractType, parse, testOptional, valita_exports } from "./valita.js";
+import { deepPartial, instanceOfAbstractType, parse, testOptional, toTerminals, valita_exports } from "./valita.js";
 import { must } from "./must.js";
 import { stripVTControlCharacters } from "node:util";
 import { template } from "chalk-template";
@@ -57,16 +57,16 @@ function parseOptionsAdvanced(appOptions, opts = {}) {
 		let multiple = type.name === "array";
 		const literals = /* @__PURE__ */ new Set();
 		const terminalTypes = /* @__PURE__ */ new Set();
-		type.toTerminals(getTerminalTypes);
+		toTerminals(type, getTerminalTypes);
 		function getTerminalTypes(t) {
 			switch (t.name) {
 				case "undefined":
 				case "optional": break;
 				case "array":
 					multiple = true;
-					t.prefix.forEach((t) => t.toTerminals(getTerminalTypes));
-					t.rest?.toTerminals(getTerminalTypes);
-					t.suffix.forEach((t) => t.toTerminals(getTerminalTypes));
+					t.prefix.forEach((t) => toTerminals(t, getTerminalTypes));
+					if (t.restType) toTerminals(t.restType, getTerminalTypes);
+					t.suffix.forEach((t) => toTerminals(t, getTerminalTypes));
 					break;
 				case "literal":
 					literals.add(String(t.value));
@@ -81,8 +81,11 @@ function parseOptionsAdvanced(appOptions, opts = {}) {
 		if (terminalTypes.size > 1) throw new TypeError(`${env} has mixed types ${[...terminalTypes]}`);
 		assert(terminalTypes.size === 1, "Expected exactly one terminal type");
 		const terminalType = [...terminalTypes][0];
-		if (processEnv[env]) if (multiple) envArgv.push(`--${flag}`, ...processEnv[env].split(","));
-		else envArgv.push(`--${flag}`, processEnv[env]);
+		const value = processEnv[env];
+		if (value) {
+			const values = multiple ? value.split(",") : [value];
+			envArgv.push(...values.map((val) => `--${flag}=${val}`));
+		}
 		names.set(flag, {
 			field,
 			env