@rocicorp/zero 1.10.0-canary.23 → 1.10.0-canary.25

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/error.d.ts

@@ -1,15 +1,4 @@
 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;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,EAAE,CAaxD;AAiBD,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,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,iBAAiB,GAAG,SAAS,CA0B7E"}

package/out/shared/src/error.js

@@ -29,40 +29,6 @@ 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 {
@@ -79,6 +45,6 @@ function getErrorDetails(error) {
 	} catch {}
 }
 //#endregion
-export { getErrorCauses, getErrorDetails, getErrorMessage };
+export { 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\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"}
+{"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"}

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

@@ -1,5 +1,4 @@
 export declare const h32: (s: string) => number;
 export declare const h64: (s: string) => bigint;
 export declare const h128: (s: string) => bigint;
-export { avalanche32, PRIME32_1, PRIME32_5, round32 } from './xxhash32.ts';
 //# sourceMappingURL=hash.d.ts.map

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,GAAI,GAAG,MAAM,WAG5B,CAAC;AACF,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,GAAI,GAAG,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":"AAEA,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,WAAmB,CAAC;AACjD,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,WAAe,CAAC;AAC7C,eAAO,MAAM,IAAI,GAAI,GAAG,MAAM,WAAe,CAAC"}

package/out/shared/src/hash.js

@@ -1,93 +1,16 @@
-import { PRIME32_1, PRIME32_2, PRIME32_3, PRIME32_4, PRIME32_5, avalanche32, round32 } from "./xxhash32.js";
+import { xxHash32 } from "js-xxhash";
 //#region ../shared/src/hash.ts
-var h32 = (s) => {
-	digest(s, 1);
-	return digests[0];
-};
-var h64 = (s) => wide(s, 2);
-var h128 = (s) => wide(s, 4);
-var MAX_WORDS = 4;
-var accs = new Int32Array(MAX_WORDS);
-var stripes = new Int32Array(MAX_WORDS * 4);
-var digests = new Uint32Array(MAX_WORDS);
-var encoder;
+var h32 = (s) => xxHash32(s, 0);
+var h64 = (s) => hash(s, 2);
+var h128 = (s) => hash(s, 4);
 /**
-* xxHash32 over the UTF-8 bytes of `str` under seeds `0..words-1`, leaving the
-* digests in `digests[0..words)`.
-*
-* A seed only changes the initial accumulator values, so every word digests the
-* same input lanes. This walks the bytes once, advancing all `words` sets of
-* accumulators per lane, and UTF-8 encodes the string once. The result is
-* identical to `words` separate `xxHash32(str, i)` calls — which is what this
-* used to delegate to, and what `hash.test.ts` checks it still matches.
+* xxHash32 only computes 32-bit values. Run it n times with different seeds to
+* get a larger hash with better collision resistance.
 */
-function digest(str, words) {
-	const b = (encoder ??= new TextEncoder()).encode(str);
-	const len = b.length;
-	for (let w = 0; w < words; w++) accs[w] = w + PRIME32_5 & 4294967295;
-	let offset = 0;
-	if (len >= 16) {
-		for (let w = 0; w < words; w++) {
-			const base = w << 2;
-			stripes[base] = w + PRIME32_1 + PRIME32_2 & 4294967295;
-			stripes[base + 1] = w + PRIME32_2 & 4294967295;
-			stripes[base + 2] = w;
-			stripes[base + 3] = w - PRIME32_1 & 4294967295;
-		}
-		const limit = len - 16;
-		for (; offset <= limit; offset += 16) {
-			const l0 = b[offset] | b[offset + 1] << 8 | b[offset + 2] << 16 | b[offset + 3] << 24;
-			const l1 = b[offset + 4] | b[offset + 5] << 8 | b[offset + 6] << 16 | b[offset + 7] << 24;
-			const l2 = b[offset + 8] | b[offset + 9] << 8 | b[offset + 10] << 16 | b[offset + 11] << 24;
-			const l3 = b[offset + 12] | b[offset + 13] << 8 | b[offset + 14] << 16 | b[offset + 15] << 24;
-			for (let w = 0; w < words; w++) {
-				const base = w << 2;
-				stripes[base] = round32(stripes[base], l0);
-				stripes[base + 1] = round32(stripes[base + 1], l1);
-				stripes[base + 2] = round32(stripes[base + 2], l2);
-				stripes[base + 3] = round32(stripes[base + 3], l3);
-			}
-		}
-		for (let w = 0; w < words; w++) {
-			const base = w << 2;
-			const s0 = stripes[base];
-			const s1 = stripes[base + 1];
-			const s2 = stripes[base + 2];
-			const s3 = stripes[base + 3];
-			accs[w] = (s0 << 1 | s0 >>> 31) + (s1 << 7 | s1 >>> 25) + (s2 << 12 | s2 >>> 20) + (s3 << 18 | s3 >>> 14) & 4294967295;
-		}
-	}
-	for (let w = 0; w < words; w++) accs[w] = accs[w] + len & 4294967295;
-	const limit4 = len - 4;
-	for (; offset <= limit4; offset += 4) {
-		const laneN0 = b[offset] + (b[offset + 1] << 8);
-		const laneN1 = b[offset + 2] + (b[offset + 3] << 8);
-		const laneP = laneN0 * PRIME32_3 + (laneN1 * PRIME32_3 << 16);
-		for (let w = 0; w < words; w++) {
-			let acc = accs[w] + laneP | 0;
-			acc = acc << 17 | acc >>> 15;
-			accs[w] = Math.imul(acc, PRIME32_4);
-		}
-	}
-	for (; offset < len; ++offset) {
-		const lane = b[offset];
-		for (let w = 0; w < words; w++) {
-			let acc = accs[w] + Math.imul(lane, PRIME32_5) | 0;
-			acc = acc << 11 | acc >>> 21;
-			accs[w] = Math.imul(acc, PRIME32_1);
-		}
-	}
-	for (let w = 0; w < words; w++) digests[w] = avalanche32(accs[w]);
-}
-/**
-* A hash wider than 32 bits, folding `words` digests together highest seed
-* first.
-*/
-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;
+function hash(str, words) {
+	let hash = 0n;
+	for (let i = 0; i < words; i++) hash = (hash << 32n) + BigInt(xxHash32(str, i));
+	return hash;
 }
 //#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 {xxHash32} from 'js-xxhash';\n\nexport const h32 = (s: string) => xxHash32(s, 0);\nexport const h64 = (s: string) => hash(s, 2);\nexport const h128 = (s: string) => hash(s, 4);\n\n/**\n * xxHash32 only computes 32-bit values. Run it n times with different seeds to\n * get a larger hash with better collision resistance.\n */\nfunction hash(str: string, words: number): bigint {\n  let hash = 0n;\n  for (let i = 0; i < words; i++) {\n    hash = (hash << 32n) + BigInt(xxHash32(str, i));\n  }\n  return hash;\n}\n"],"mappings":";;AAEA,IAAa,OAAO,MAAc,SAAS,GAAG,CAAC;AAC/C,IAAa,OAAO,MAAc,KAAK,GAAG,CAAC;AAC3C,IAAa,QAAQ,MAAc,KAAK,GAAG,CAAC;;;;;AAM5C,SAAS,KAAK,KAAa,OAAuB;CAChD,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,QAAQ,QAAQ,OAAO,OAAO,SAAS,KAAK,CAAC,CAAC;CAEhD,OAAO;AACT"}

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

@@ -16,7 +16,5 @@ 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;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"}
+{"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"}

package/out/shared/src/iterables.js

@@ -55,24 +55,7 @@ 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 { emptyIterator, joinIterables, makeEmptyIteratorWithReturn, once, some, toSorted, wrapIterable };
+export { joinIterables, 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\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"}
+{"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"}

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

@@ -1 +1 @@
-{"version":3,"file":"json.d.ts","sourceRoot":"","sources":["../../../../shared/src/json.ts"],"names":[],"mappings":"AAIA,iDAAiD;AACjD,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,OAAO,GACP,MAAM,GACN,KAAK,CAAC,SAAS,CAAC,GAChB,UAAU,CAAC;AAEf;;;;;;;;;;;;;GAaG;AACH,MAAM,MAAM,UAAU,GAAG;IAAC,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAEhE,iDAAiD;AACjD,MAAM,MAAM,iBAAiB,GACzB,IAAI,GACJ,MAAM,GACN,OAAO,GACP,MAAM,GACN,aAAa,CAAC,iBAAiB,CAAC,GAChC,kBAAkB,CAAC;AAEvB,kDAAkD;AAClD,MAAM,MAAM,kBAAkB,GAAG;IAC/B,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,iBAAiB,GAAG,SAAS,CAAC;CACvD,CAAC;AAEF;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CACvB,CAAC,EAAE,iBAAiB,GAAG,SAAS,EAChC,CAAC,EAAE,iBAAiB,GAAG,SAAS,GAC/B,OAAO,CA6ET;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,SAAS,CAmBlE;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,UAAU,CAGpE;AAqBD,UAAU,IAAI;IACZ,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IACjC,GAAG,IAAI,IAAI,CAAC;CACb;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAgBlE;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAKpE;AA8BD,sEAAsE;AACtE,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,CAAC,SAC3B,IAAI,GACJ,OAAO,GACP,MAAM,GACN,MAAM,GACN,SAAS,GACT,CAAC,GACD;IAAC,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAC,CAAC"}
+{"version":3,"file":"json.d.ts","sourceRoot":"","sources":["../../../../shared/src/json.ts"],"names":[],"mappings":"AAIA,iDAAiD;AACjD,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,OAAO,GACP,MAAM,GACN,KAAK,CAAC,SAAS,CAAC,GAChB,UAAU,CAAC;AAEf;;;;;;;;;;;;;GAaG;AACH,MAAM,MAAM,UAAU,GAAG;IAAC,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAEhE,iDAAiD;AACjD,MAAM,MAAM,iBAAiB,GACzB,IAAI,GACJ,MAAM,GACN,OAAO,GACP,MAAM,GACN,aAAa,CAAC,iBAAiB,CAAC,GAChC,kBAAkB,CAAC;AAEvB,kDAAkD;AAClD,MAAM,MAAM,kBAAkB,GAAG;IAC/B,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,iBAAiB,GAAG,SAAS,CAAC;CACvD,CAAC;AAEF;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CACvB,CAAC,EAAE,iBAAiB,GAAG,SAAS,EAChC,CAAC,EAAE,iBAAiB,GAAG,SAAS,GAC/B,OAAO,CAsET;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,SAAS,CAmBlE;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,UAAU,CAGpE;AAqBD,UAAU,IAAI;IACZ,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IACjC,GAAG,IAAI,IAAI,CAAC;CACb;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAgBlE;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAKpE;AA8BD,sEAAsE;AACtE,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,CAAC,SAC3B,IAAI,GACJ,OAAO,GACP,MAAM,GACN,MAAM,GACN,SAAS,GACT,CAAC,GACD;IAAC,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAC,CAAC"}

package/out/shared/src/json.js

@@ -33,12 +33,12 @@ function deepEqual(a, b) {
 	a = a;
 	b = b;
 	let aSize = 0;
-	for (const key in a) if (hasOwn(a, key) && a[key] !== void 0) {
+	for (const key in a) if (hasOwn(a, key)) {
 		if (!deepEqual(a[key], b[key])) return false;
 		aSize++;
 	}
 	let bSize = 0;
-	for (const key in b) if (hasOwn(b, key) && b[key] !== void 0) bSize++;
+	for (const key in b) if (hasOwn(b, key)) bSize++;
 	return aSize === bSize;
 }
 function assertJSONValue(v) {

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

@@ -1 +1 @@
-{"version":3,"file":"json.js","names":[],"sources":["../../../../shared/src/json.ts"],"sourcesContent":["import {assertObject, throwInvalidType} from './asserts.ts';\nimport {skipAssertJSONValue} from './config.ts';\nimport {hasOwn} from './has-own.ts';\n\n/** The values that can be represented in JSON */\nexport type JSONValue =\n  | null\n  | string\n  | boolean\n  | number\n  | Array<JSONValue>\n  | JSONObject;\n\n/**\n * A JSON object. This is a map from strings to JSON values or `undefined`. We\n * allow `undefined` values as a convenience... but beware that the `undefined`\n * values do not round trip to the server. For example:\n *\n * ```\n * // Time t1\n * await tx.set('a', {a: undefined});\n *\n * // time passes, in a new transaction\n * const v = await tx.get('a');\n * console.log(v); // either {a: undefined} or {}\n * ```\n */\nexport type JSONObject = {[key: string]: JSONValue | undefined};\n\n/** Like {@link JSONValue} but deeply readonly */\nexport type ReadonlyJSONValue =\n  | null\n  | string\n  | boolean\n  | number\n  | ReadonlyArray<ReadonlyJSONValue>\n  | ReadonlyJSONObject;\n\n/** Like {@link JSONObject} but deeply readonly */\nexport type ReadonlyJSONObject = {\n  readonly [key: string]: ReadonlyJSONValue | undefined;\n};\n\n/**\n * Checks deep equality of two JSON value with (almost) same semantics as\n * `JSON.stringify`. The only difference is that with `JSON.stringify` the\n * ordering of the properties in an object/map/dictionary matters. In\n * {@link deepEqual} the following two values are consider equal, even though the\n * strings JSON.stringify would produce is different:\n *\n * ```js\n * assert(deepEqual(t({a: 1, b: 2}, {b: 2, a: 1}))\n * ```\n */\nexport function deepEqual(\n  a: ReadonlyJSONValue | undefined,\n  b: ReadonlyJSONValue | undefined,\n): boolean {\n  if (a === b) {\n    return true;\n  }\n\n  if (typeof a !== typeof b) {\n    return false;\n  }\n\n  switch (typeof a) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n      return false;\n  }\n\n  // a cannot be undefined here because either a and b are undefined or their\n  // types are different.\n  // oxlint-disable-next-line  @typescript-eslint/no-non-null-assertion\n  a = a!;\n\n  // 'object'\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (let i = 0; i < a.length; i++) {\n      if (!deepEqual(a[i], b[i])) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  if (a === null || b === null) {\n    return false;\n  }\n\n  if (Array.isArray(b)) {\n    return false;\n  }\n\n  // We know a and b are objects here but type inference is not smart enough.\n  a = a as ReadonlyJSONObject;\n  b = b as ReadonlyJSONObject;\n\n  // We use for-in loops instead of for of Object.keys() to make sure deepEquals\n  // does not allocate any objects.\n\n  // The behavior we want is that property values that are undefined are treated\n  // as if they do not exist. For example, the following two values are\n  // considered equal:\n  // ```\n  // deepEqual({a: undefined}, {})\n  // ```\n\n  let aSize = 0;\n  for (const key in a) {\n    if (hasOwn(a, key) && a[key] !== undefined) {\n      if (!deepEqual(a[key], b[key])) {\n        return false;\n      }\n      aSize++;\n    }\n  }\n\n  let bSize = 0;\n  for (const key in b) {\n    if (hasOwn(b, key) && b[key] !== undefined) {\n      bSize++;\n    }\n  }\n\n  return aSize === bSize;\n}\n\nexport function assertJSONValue(v: unknown): asserts v is JSONValue {\n  if (skipAssertJSONValue) {\n    return;\n  }\n  switch (typeof v) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n      return;\n    case 'object':\n      if (v === null) {\n        return;\n      }\n      if (Array.isArray(v)) {\n        return assertJSONArray(v);\n      }\n      return assertObjectIsJSONObject(v as Record<string, unknown>);\n  }\n  throwInvalidType(v, 'JSON value');\n}\n\nexport function assertJSONObject(v: unknown): asserts v is JSONObject {\n  assertObject(v);\n  assertObjectIsJSONObject(v);\n}\n\nfunction assertObjectIsJSONObject(\n  v: Record<string, unknown>,\n): asserts v is JSONObject {\n  for (const k in v) {\n    if (hasOwn(v, k)) {\n      const value = v[k];\n      if (value !== undefined) {\n        assertJSONValue(value);\n      }\n    }\n  }\n}\n\nfunction assertJSONArray(v: unknown[]): asserts v is JSONValue[] {\n  for (const item of v) {\n    assertJSONValue(item);\n  }\n}\n\ninterface Path {\n  push(key: string | number): void;\n  pop(): void;\n}\n\n/**\n * Checks if a value is a JSON value. If there is a value that is not a JSON\n * value, the path parameter is updated to the path of the invalid value.\n */\nexport function isJSONValue(v: unknown, path: Path): v is JSONValue {\n  switch (typeof v) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n      return true;\n    case 'object':\n      if (v === null) {\n        return true;\n      }\n      if (Array.isArray(v)) {\n        return isJSONArray(v, path);\n      }\n      return objectIsJSONObject(v as Record<string, unknown>, path);\n  }\n  return false;\n}\n\nexport function isJSONObject(v: unknown, path: Path): v is JSONObject {\n  if (typeof v !== 'object' || v === null) {\n    return false;\n  }\n  return objectIsJSONObject(v as Record<string, unknown>, path);\n}\n\nfunction objectIsJSONObject(\n  v: Record<string, unknown>,\n  path: Path,\n): v is JSONObject {\n  for (const k in v) {\n    if (hasOwn(v, k)) {\n      path.push(k);\n      const value = v[k];\n      if (value !== undefined && !isJSONValue(value, path)) {\n        return false;\n      }\n      path.pop();\n    }\n  }\n  return true;\n}\n\nfunction isJSONArray(v: unknown[], path: Path): v is JSONValue[] {\n  for (let i = 0; i < v.length; i++) {\n    path.push(i);\n    if (!isJSONValue(v[i], path)) {\n      return false;\n    }\n    path.pop();\n  }\n  return true;\n}\n\n/** Basic deep readonly type. It works for {@link JSONValue} types. */\nexport type DeepReadonly<T> = T extends\n  | null\n  | boolean\n  | string\n  | number\n  | undefined\n  ? T\n  : {readonly [K in keyof T]: DeepReadonly<T[K]>};\n"],"mappings":";;;;;;;;;;;;;;;AAsDA,SAAgB,UACd,GACA,GACS;CACT,IAAI,MAAM,GACR,OAAO;CAGT,IAAI,OAAO,MAAM,OAAO,GACtB,OAAO;CAGT,QAAQ,OAAO,GAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,UACH,OAAO;CACX;CAKA,IAAI;CAGJ,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,IAAI,CAAC,MAAM,QAAQ,CAAC,GAClB,OAAO;EAET,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO;EAET,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,GACvB,OAAO;EAGX,OAAO;CACT;CAEA,IAAI,MAAM,QAAQ,MAAM,MACtB,OAAO;CAGT,IAAI,MAAM,QAAQ,CAAC,GACjB,OAAO;CAIT,IAAI;CACJ,IAAI;CAYJ,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,GAChB,IAAI,OAAO,GAAG,GAAG,KAAK,EAAE,SAAS,KAAA,GAAW;EAC1C,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,GAC3B,OAAO;EAET;CACF;CAGF,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,GAChB,IAAI,OAAO,GAAG,GAAG,KAAK,EAAE,SAAS,KAAA,GAC/B;CAIJ,OAAO,UAAU;AACnB;AAEA,SAAgB,gBAAgB,GAAoC;CAClE,IAAI,QACF;CAEF,QAAQ,OAAO,GAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,UACH;EACF,KAAK;GACH,IAAI,MAAM,MACR;GAEF,IAAI,MAAM,QAAQ,CAAC,GACjB,OAAO,gBAAgB,CAAC;GAE1B,OAAO,yBAAyB,CAA4B;CAChE;CACA,iBAAiB,GAAG,YAAY;AAClC;AAEA,SAAgB,iBAAiB,GAAqC;CACpE,aAAa,CAAC;CACd,yBAAyB,CAAC;AAC5B;AAEA,SAAS,yBACP,GACyB;CACzB,KAAK,MAAM,KAAK,GACd,IAAI,OAAO,GAAG,CAAC,GAAG;EAChB,MAAM,QAAQ,EAAE;EAChB,IAAI,UAAU,KAAA,GACZ,gBAAgB,KAAK;CAEzB;AAEJ;AAEA,SAAS,gBAAgB,GAAwC;CAC/D,KAAK,MAAM,QAAQ,GACjB,gBAAgB,IAAI;AAExB;;;;;AAWA,SAAgB,YAAY,GAAY,MAA4B;CAClE,QAAQ,OAAO,GAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,UACH,OAAO;EACT,KAAK;GACH,IAAI,MAAM,MACR,OAAO;GAET,IAAI,MAAM,QAAQ,CAAC,GACjB,OAAO,YAAY,GAAG,IAAI;GAE5B,OAAO,mBAAmB,GAA8B,IAAI;CAChE;CACA,OAAO;AACT;AAEA,SAAgB,aAAa,GAAY,MAA6B;CACpE,IAAI,OAAO,MAAM,YAAY,MAAM,MACjC,OAAO;CAET,OAAO,mBAAmB,GAA8B,IAAI;AAC9D;AAEA,SAAS,mBACP,GACA,MACiB;CACjB,KAAK,MAAM,KAAK,GACd,IAAI,OAAO,GAAG,CAAC,GAAG;EAChB,KAAK,KAAK,CAAC;EACX,MAAM,QAAQ,EAAE;EAChB,IAAI,UAAU,KAAA,KAAa,CAAC,YAAY,OAAO,IAAI,GACjD,OAAO;EAET,KAAK,IAAI;CACX;CAEF,OAAO;AACT;AAEA,SAAS,YAAY,GAAc,MAA8B;CAC/D,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,KAAK,KAAK,CAAC;EACX,IAAI,CAAC,YAAY,EAAE,IAAI,IAAI,GACzB,OAAO;EAET,KAAK,IAAI;CACX;CACA,OAAO;AACT"}
+{"version":3,"file":"json.js","names":[],"sources":["../../../../shared/src/json.ts"],"sourcesContent":["import {assertObject, throwInvalidType} from './asserts.ts';\nimport {skipAssertJSONValue} from './config.ts';\nimport {hasOwn} from './has-own.ts';\n\n/** The values that can be represented in JSON */\nexport type JSONValue =\n  | null\n  | string\n  | boolean\n  | number\n  | Array<JSONValue>\n  | JSONObject;\n\n/**\n * A JSON object. This is a map from strings to JSON values or `undefined`. We\n * allow `undefined` values as a convenience... but beware that the `undefined`\n * values do not round trip to the server. For example:\n *\n * ```\n * // Time t1\n * await tx.set('a', {a: undefined});\n *\n * // time passes, in a new transaction\n * const v = await tx.get('a');\n * console.log(v); // either {a: undefined} or {}\n * ```\n */\nexport type JSONObject = {[key: string]: JSONValue | undefined};\n\n/** Like {@link JSONValue} but deeply readonly */\nexport type ReadonlyJSONValue =\n  | null\n  | string\n  | boolean\n  | number\n  | ReadonlyArray<ReadonlyJSONValue>\n  | ReadonlyJSONObject;\n\n/** Like {@link JSONObject} but deeply readonly */\nexport type ReadonlyJSONObject = {\n  readonly [key: string]: ReadonlyJSONValue | undefined;\n};\n\n/**\n * Checks deep equality of two JSON value with (almost) same semantics as\n * `JSON.stringify`. The only difference is that with `JSON.stringify` the\n * ordering of the properties in an object/map/dictionary matters. In\n * {@link deepEqual} the following two values are consider equal, even though the\n * strings JSON.stringify would produce is different:\n *\n * ```js\n * assert(deepEqual(t({a: 1, b: 2}, {b: 2, a: 1}))\n * ```\n */\nexport function deepEqual(\n  a: ReadonlyJSONValue | undefined,\n  b: ReadonlyJSONValue | undefined,\n): boolean {\n  if (a === b) {\n    return true;\n  }\n\n  if (typeof a !== typeof b) {\n    return false;\n  }\n\n  switch (typeof a) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n      return false;\n  }\n\n  // a cannot be undefined here because either a and b are undefined or their\n  // types are different.\n  // oxlint-disable-next-line  @typescript-eslint/no-non-null-assertion\n  a = a!;\n\n  // 'object'\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (let i = 0; i < a.length; i++) {\n      if (!deepEqual(a[i], b[i])) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  if (a === null || b === null) {\n    return false;\n  }\n\n  if (Array.isArray(b)) {\n    return false;\n  }\n\n  // We know a and b are objects here but type inference is not smart enough.\n  a = a as ReadonlyJSONObject;\n  b = b as ReadonlyJSONObject;\n\n  // We use for-in loops instead of for of Object.keys() to make sure deepEquals\n  // does not allocate any objects.\n\n  let aSize = 0;\n  for (const key in a) {\n    if (hasOwn(a, key)) {\n      if (!deepEqual(a[key], b[key])) {\n        return false;\n      }\n      aSize++;\n    }\n  }\n\n  let bSize = 0;\n  for (const key in b) {\n    if (hasOwn(b, key)) {\n      bSize++;\n    }\n  }\n\n  return aSize === bSize;\n}\n\nexport function assertJSONValue(v: unknown): asserts v is JSONValue {\n  if (skipAssertJSONValue) {\n    return;\n  }\n  switch (typeof v) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n      return;\n    case 'object':\n      if (v === null) {\n        return;\n      }\n      if (Array.isArray(v)) {\n        return assertJSONArray(v);\n      }\n      return assertObjectIsJSONObject(v as Record<string, unknown>);\n  }\n  throwInvalidType(v, 'JSON value');\n}\n\nexport function assertJSONObject(v: unknown): asserts v is JSONObject {\n  assertObject(v);\n  assertObjectIsJSONObject(v);\n}\n\nfunction assertObjectIsJSONObject(\n  v: Record<string, unknown>,\n): asserts v is JSONObject {\n  for (const k in v) {\n    if (hasOwn(v, k)) {\n      const value = v[k];\n      if (value !== undefined) {\n        assertJSONValue(value);\n      }\n    }\n  }\n}\n\nfunction assertJSONArray(v: unknown[]): asserts v is JSONValue[] {\n  for (const item of v) {\n    assertJSONValue(item);\n  }\n}\n\ninterface Path {\n  push(key: string | number): void;\n  pop(): void;\n}\n\n/**\n * Checks if a value is a JSON value. If there is a value that is not a JSON\n * value, the path parameter is updated to the path of the invalid value.\n */\nexport function isJSONValue(v: unknown, path: Path): v is JSONValue {\n  switch (typeof v) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n      return true;\n    case 'object':\n      if (v === null) {\n        return true;\n      }\n      if (Array.isArray(v)) {\n        return isJSONArray(v, path);\n      }\n      return objectIsJSONObject(v as Record<string, unknown>, path);\n  }\n  return false;\n}\n\nexport function isJSONObject(v: unknown, path: Path): v is JSONObject {\n  if (typeof v !== 'object' || v === null) {\n    return false;\n  }\n  return objectIsJSONObject(v as Record<string, unknown>, path);\n}\n\nfunction objectIsJSONObject(\n  v: Record<string, unknown>,\n  path: Path,\n): v is JSONObject {\n  for (const k in v) {\n    if (hasOwn(v, k)) {\n      path.push(k);\n      const value = v[k];\n      if (value !== undefined && !isJSONValue(value, path)) {\n        return false;\n      }\n      path.pop();\n    }\n  }\n  return true;\n}\n\nfunction isJSONArray(v: unknown[], path: Path): v is JSONValue[] {\n  for (let i = 0; i < v.length; i++) {\n    path.push(i);\n    if (!isJSONValue(v[i], path)) {\n      return false;\n    }\n    path.pop();\n  }\n  return true;\n}\n\n/** Basic deep readonly type. It works for {@link JSONValue} types. */\nexport type DeepReadonly<T> = T extends\n  | null\n  | boolean\n  | string\n  | number\n  | undefined\n  ? T\n  : {readonly [K in keyof T]: DeepReadonly<T[K]>};\n"],"mappings":";;;;;;;;;;;;;;;AAsDA,SAAgB,UACd,GACA,GACS;CACT,IAAI,MAAM,GACR,OAAO;CAGT,IAAI,OAAO,MAAM,OAAO,GACtB,OAAO;CAGT,QAAQ,OAAO,GAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,UACH,OAAO;CACX;CAKA,IAAI;CAGJ,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,IAAI,CAAC,MAAM,QAAQ,CAAC,GAClB,OAAO;EAET,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO;EAET,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,GACvB,OAAO;EAGX,OAAO;CACT;CAEA,IAAI,MAAM,QAAQ,MAAM,MACtB,OAAO;CAGT,IAAI,MAAM,QAAQ,CAAC,GACjB,OAAO;CAIT,IAAI;CACJ,IAAI;CAKJ,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,GAChB,IAAI,OAAO,GAAG,GAAG,GAAG;EAClB,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,GAC3B,OAAO;EAET;CACF;CAGF,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,GAChB,IAAI,OAAO,GAAG,GAAG,GACf;CAIJ,OAAO,UAAU;AACnB;AAEA,SAAgB,gBAAgB,GAAoC;CAClE,IAAI,QACF;CAEF,QAAQ,OAAO,GAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,UACH;EACF,KAAK;GACH,IAAI,MAAM,MACR;GAEF,IAAI,MAAM,QAAQ,CAAC,GACjB,OAAO,gBAAgB,CAAC;GAE1B,OAAO,yBAAyB,CAA4B;CAChE;CACA,iBAAiB,GAAG,YAAY;AAClC;AAEA,SAAgB,iBAAiB,GAAqC;CACpE,aAAa,CAAC;CACd,yBAAyB,CAAC;AAC5B;AAEA,SAAS,yBACP,GACyB;CACzB,KAAK,MAAM,KAAK,GACd,IAAI,OAAO,GAAG,CAAC,GAAG;EAChB,MAAM,QAAQ,EAAE;EAChB,IAAI,UAAU,KAAA,GACZ,gBAAgB,KAAK;CAEzB;AAEJ;AAEA,SAAS,gBAAgB,GAAwC;CAC/D,KAAK,MAAM,QAAQ,GACjB,gBAAgB,IAAI;AAExB;;;;;AAWA,SAAgB,YAAY,GAAY,MAA4B;CAClE,QAAQ,OAAO,GAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,UACH,OAAO;EACT,KAAK;GACH,IAAI,MAAM,MACR,OAAO;GAET,IAAI,MAAM,QAAQ,CAAC,GACjB,OAAO,YAAY,GAAG,IAAI;GAE5B,OAAO,mBAAmB,GAA8B,IAAI;CAChE;CACA,OAAO;AACT;AAEA,SAAgB,aAAa,GAAY,MAA6B;CACpE,IAAI,OAAO,MAAM,YAAY,MAAM,MACjC,OAAO;CAET,OAAO,mBAAmB,GAA8B,IAAI;AAC9D;AAEA,SAAS,mBACP,GACA,MACiB;CACjB,KAAK,MAAM,KAAK,GACd,IAAI,OAAO,GAAG,CAAC,GAAG;EAChB,KAAK,KAAK,CAAC;EACX,MAAM,QAAQ,EAAE;EAChB,IAAI,UAAU,KAAA,KAAa,CAAC,YAAY,OAAO,IAAI,GACjD,OAAO;EAET,KAAK,IAAI;CACX;CAEF,OAAO;AACT;AAEA,SAAS,YAAY,GAAc,MAA8B;CAC/D,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,KAAK,KAAK,CAAC;EACX,IAAI,CAAC,YAAY,EAAE,IAAI,IAAI,GACzB,OAAO;EAET,KAAK,IAAI;CACX;CACA,OAAO;AACT"}

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

@@ -1,10 +1,5 @@
-/**
- * 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;
-declare function getOrInsertNative<K, V extends Defined>(map: Map<K, V>, key: K, defaultValue: V): V;
-declare function getOrInsertComputedNative<K, V extends Defined>(map: Map<K, V>, key: K, compute: (key: K) => V): V;
+declare function getOrInsertNative<K, V>(map: Map<K, V>, key: K, defaultValue: V): V;
+declare function getOrInsertComputedNative<K, V>(map: Map<K, V>, key: K, compute: (key: K) => V): V;
 export declare const getOrInsert: typeof getOrInsertNative;
 export declare const getOrInsertComputed: typeof getOrInsertComputedNative;
 export {};

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

@@ -1 +1 @@
-{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../../../shared/src/map.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,KAAK,OAAO,GAAG,EAAE,GAAG,IAAI,CAAC;AAkDzB,iBAAS,iBAAiB,CAAC,CAAC,EAAE,CAAC,SAAS,OAAO,EAC7C,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,GAAG,EAAE,CAAC,EACN,YAAY,EAAE,CAAC,GACd,CAAC,CAEH;AAED,iBAAS,yBAAyB,CAAC,CAAC,EAAE,CAAC,SAAS,OAAO,EACrD,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GACrB,CAAC,CAEH;AAED,eAAO,MAAM,WAAW,0BAED,CAAC;AAExB,eAAO,MAAM,mBAAmB,kCAED,CAAC"}
+{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../../../shared/src/map.ts"],"names":[],"mappings":"AA4CA,iBAAS,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC,CAE3E;AAED,iBAAS,yBAAyB,CAAC,CAAC,EAAE,CAAC,EACrC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GACrB,CAAC,CAEH;AAED,eAAO,MAAM,WAAW,0BAED,CAAC;AAExB,eAAO,MAAM,mBAAmB,kCAED,CAAC"}

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

@@ -1 +1 @@
-{"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\nconst nativeSupport =\n  typeof (Map.prototype as unknown as MapES2026<unknown, Defined>)\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 extends Defined>(\n  map: Map<K, V>,\n  key: K,\n  defaultValue: V,\n): 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 extends Defined>(\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 extends Defined>(\n  map: Map<K, V>,\n  key: K,\n  defaultValue: 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: 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":";AAMA,IAAM,gBACJ,OAAQ,IAAI,UACT,gBAAgB;;;;;;;AAarB,SAAS,oBACP,KACA,KACA,cACG;CACH,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,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,gBACvB,oBACA;AAEJ,IAAa,sBAAsB,gBAC/B,4BACA"}
+{"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"}

package/out/shared/src/packed-boolean-map.d.ts

@@ -0,0 +1,7 @@
+export declare function packBooleanMap(map: ReadonlyMap<number, boolean>): Uint8Array;
+/**
+ * Reads `keys` from `bytes`. Keys not in `keys` are ignored, as is a value bit
+ * without its present bit.
+ */
+export declare function unpackBooleanMap<K extends number>(bytes: Uint8Array, keys: Iterable<K>): Map<K, boolean>;
+//# sourceMappingURL=packed-boolean-map.d.ts.map

package/out/shared/src/packed-boolean-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"packed-boolean-map.d.ts","sourceRoot":"","sources":["../../../../shared/src/packed-boolean-map.ts"],"names":[],"mappings":"AAkBA,wBAAgB,cAAc,CAAC,GAAG,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,UAAU,CAc5E;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,MAAM,EAC/C,KAAK,EAAE,UAAU,EACjB,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAChB,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CASjB"}

package/out/shared/src/packed-boolean-map.js

@@ -0,0 +1,36 @@
+import { assert } from "./asserts.js";
+//#region ../shared/src/packed-boolean-map.ts
+var PRESENT = 1;
+var TRUE = 2;
+function byteIndex(key) {
+	return key >> 2;
+}
+function shift(key) {
+	return (key & 3) * 2;
+}
+function packBooleanMap(map) {
+	let size = 0;
+	for (const key of map.keys()) {
+		assert(Number.isInteger(key) && key >= 0, "Key must be a non-negative integer");
+		size = Math.max(size, byteIndex(key) + 1);
+	}
+	const bytes = new Uint8Array(size);
+	for (const [key, value] of map) bytes[byteIndex(key)] |= (value ? PRESENT | TRUE : PRESENT) << shift(key);
+	return bytes;
+}
+/**
+* Reads `keys` from `bytes`. Keys not in `keys` are ignored, as is a value bit
+* without its present bit.
+*/
+function unpackBooleanMap(bytes, keys) {
+	const map = /* @__PURE__ */ new Map();
+	for (const key of keys) {
+		const bits = (bytes[byteIndex(key)] ?? 0) >> shift(key);
+		if (bits & PRESENT) map.set(key, (bits & TRUE) !== 0);
+	}
+	return map;
+}
+//#endregion
+export { packBooleanMap, unpackBooleanMap };
+
+//# sourceMappingURL=packed-boolean-map.js.map

package/out/shared/src/packed-boolean-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"packed-boolean-map.js","names":[],"sources":["../../../../shared/src/packed-boolean-map.ts"],"sourcesContent":["// Packs a map from small non-negative integers to booleans into bytes, two\n// bits per key, four keys per byte. Key n uses the two bits at 2 * (n % 4) in\n// byte floor(n / 4): the low bit says the key is present and the high bit is\n// its value. Unlike a bit set, this tells a missing key apart from `false`.\n\nimport {assert} from './asserts.ts';\n\nconst PRESENT = 0b01;\nconst TRUE = 0b10;\n\nfunction byteIndex(key: number): number {\n  return key >> 2;\n}\n\nfunction shift(key: number): number {\n  return (key & 3) * 2;\n}\n\nexport function packBooleanMap(map: ReadonlyMap<number, boolean>): Uint8Array {\n  let size = 0;\n  for (const key of map.keys()) {\n    assert(\n      Number.isInteger(key) && key >= 0,\n      'Key must be a non-negative integer',\n    );\n    size = Math.max(size, byteIndex(key) + 1);\n  }\n  const bytes = new Uint8Array(size);\n  for (const [key, value] of map) {\n    bytes[byteIndex(key)] |= (value ? PRESENT | TRUE : PRESENT) << shift(key);\n  }\n  return bytes;\n}\n\n/**\n * Reads `keys` from `bytes`. Keys not in `keys` are ignored, as is a value bit\n * without its present bit.\n */\nexport function unpackBooleanMap<K extends number>(\n  bytes: Uint8Array,\n  keys: Iterable<K>,\n): Map<K, boolean> {\n  const map = new Map<K, boolean>();\n  for (const key of keys) {\n    const bits = (bytes[byteIndex(key)] ?? 0) >> shift(key);\n    if (bits & PRESENT) {\n      map.set(key, (bits & TRUE) !== 0);\n    }\n  }\n  return map;\n}\n"],"mappings":";;AAOA,IAAM,UAAU;AAChB,IAAM,OAAO;AAEb,SAAS,UAAU,KAAqB;CACtC,OAAO,OAAO;AAChB;AAEA,SAAS,MAAM,KAAqB;CAClC,QAAQ,MAAM,KAAK;AACrB;AAEA,SAAgB,eAAe,KAA+C;CAC5E,IAAI,OAAO;CACX,KAAK,MAAM,OAAO,IAAI,KAAK,GAAG;EAC5B,OACE,OAAO,UAAU,GAAG,KAAK,OAAO,GAChC,oCACF;EACA,OAAO,KAAK,IAAI,MAAM,UAAU,GAAG,IAAI,CAAC;CAC1C;CACA,MAAM,QAAQ,IAAI,WAAW,IAAI;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,KACzB,MAAM,UAAU,GAAG,OAAO,QAAQ,UAAU,OAAO,YAAY,MAAM,GAAG;CAE1E,OAAO;AACT;;;;;AAMA,SAAgB,iBACd,OACA,MACiB;CACjB,MAAM,sBAAM,IAAI,IAAgB;CAChC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,MAAM,UAAU,GAAG,MAAM,MAAM,MAAM,GAAG;EACtD,IAAI,OAAO,SACT,IAAI,IAAI,MAAM,OAAO,UAAU,CAAC;CAEpC;CACA,OAAO;AACT"}

package/out/shared/src/ring-buffer.d.ts

@@ -14,10 +14,6 @@ export declare class RingBuffer<T> {
     constructor(initialCapacity?: number);
     get size(): number;
     push(value: T): void;
-    /** Returns the last element, or `undefined` if empty. */
-    last(): T | undefined;
-    /** Replaces the last element, or appends it if empty. */
-    replaceLast(value: T): void;
     /** Removes and returns the front element, or `undefined` if empty. */
     shift(): T | undefined;
     /**
@@ -32,9 +28,5 @@ export declare class RingBuffer<T> {
      * Removes and returns all elements in FIFO order, resetting the buffer.
      */
     drain(): T[];
-    /** Copies all elements in FIFO order without removing them. */
-    toArray(): T[];
-    /** Removes all elements and releases extra capacity. */
-    clear(): void;
 }
 //# sourceMappingURL=ring-buffer.d.ts.map

package/out/shared/src/ring-buffer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ring-buffer.d.ts","sourceRoot":"","sources":["../../../../shared/src/ring-buffer.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;GAUG;AACH,qBAAa,UAAU,CAAC,CAAC;;gBAMX,eAAe,SAA2B;IAKtD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAQpB,yDAAyD;IACzD,IAAI,IAAI,CAAC,GAAG,SAAS;IAMrB,yDAAyD;IACzD,WAAW,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAQ3B,sEAAsE;IACtE,KAAK,IAAI,CAAC,GAAG,SAAS;IAqBtB;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAsBxB;;OAEG;IACH,KAAK,IAAI,CAAC,EAAE;IAQZ,+DAA+D;IAC/D,OAAO,IAAI,CAAC,EAAE;IAQd,wDAAwD;IACxD,KAAK,IAAI,IAAI;CA+Cd"}
+{"version":3,"file":"ring-buffer.d.ts","sourceRoot":"","sources":["../../../../shared/src/ring-buffer.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;GAUG;AACH,qBAAa,UAAU,CAAC,CAAC;;gBAMX,eAAe,SAA2B;IAKtD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAQpB,sEAAsE;IACtE,KAAK,IAAI,CAAC,GAAG,SAAS;IAqBtB;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAsBxB;;OAEG;IACH,KAAK,IAAI,CAAC,EAAE;CAmDb"}

package/out/shared/src/ring-buffer.js

@@ -29,15 +29,6 @@ var RingBuffer = class {
 		this.#buffer[(this.#head + this.#size) % this.#capacity] = value;
 		this.#size++;
 	}
-	/** Returns the last element, or `undefined` if empty. */
-	last() {
-		return this.#size === 0 ? void 0 : this.#buffer[(this.#head + this.#size - 1) % this.#capacity];
-	}
-	/** Replaces the last element, or appends it if empty. */
-	replaceLast(value) {
-		if (this.#size === 0) this.push(value);
-		else this.#buffer[(this.#head + this.#size - 1) % this.#capacity] = value;
-	}
 	/** Removes and returns the front element, or `undefined` if empty. */
 	shift() {
 		if (this.#size === 0) return;
@@ -74,24 +65,12 @@ var RingBuffer = class {
 	* Removes and returns all elements in FIFO order, resetting the buffer.
 	*/
 	drain() {
-		const result = this.toArray();
-		this.#head = 0;
-		this.#size = 0;
-		this.#buffer = Array.from({ length: this.#capacity });
-		return result;
-	}
-	/** Copies all elements in FIFO order without removing them. */
-	toArray() {
 		const result = Array.from({ length: this.#size });
 		for (let i = 0; i < this.#size; i++) result[i] = this.#buffer[(this.#head + i) % this.#capacity];
-		return result;
-	}
-	/** Removes all elements and releases extra capacity. */
-	clear() {
 		this.#head = 0;
 		this.#size = 0;
-		this.#capacity = MIN_CAPACITY;
 		this.#buffer = Array.from({ length: this.#capacity });
+		return result;
 	}
 	/**
 	* Grows the buffer in place by doubling its length and relocating