@rocicorp/zero 1.12.0-canary.2 → 1.12.0-canary.4

package/out/shared/src/bigint-json.d.ts

@@ -5,6 +5,15 @@ export type JSONObject = {
 };
 export declare const jsonValueSchema: v.Type<JSONValue>;
 export declare const jsonObjectSchema: v.Type<Readonly<Record<string, JSONValue>>>;
+/**
+ * Whether `str` has a run of 16 or more digits. Every such run covers one of
+ * every 16 consecutive indices, so only every 16th char needs to be checked and
+ * a digit there is expanded to its full run. This is several times faster than
+ * `/\d{16}/`, which restarts at every digit of a shorter run.
+ *
+ * A run inside a JSON string also matches; that merely takes the slow path.
+ */
+export declare function hasUnsafeIntegerDigits(str: string): boolean;
 /**
  * Parses JSON strings that may contain arbitrarily large integers. Integers
  * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.

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

@@ -1 +1 @@
-{"version":3,"file":"bigint-json.d.ts","sourceRoot":"","sources":["../../../../shared/src/bigint-json.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAYjC,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,SAAS,EAAE,GACpB,UAAU,CAAC;AAEf,MAAM,MAAM,UAAU,GAAG;IAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAE1E,eAAO,MAAM,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAY5C,CAAC;AAEH,eAAO,MAAM,gBAAgB,6CAAwC,CAAC;AAEtE;;;GAGG;AACH,wBAAgB,KAAK,CACnB,GAAG,EAAE,MAAM,EACX,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,KAAK,OAAO,GAC3C,SAAS,CAEX;AAOD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,OAAO,EACZ,QAAQ,CAAC,EACL,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GACnB,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAC1C,IAAI,EACR,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,UAGzB;AAED,eAAO,MAAM,UAAU;;;CAGb,CAAC"}
+{"version":3,"file":"bigint-json.d.ts","sourceRoot":"","sources":["../../../../shared/src/bigint-json.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAYjC,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,SAAS,EAAE,GACpB,UAAU,CAAC;AAEf,MAAM,MAAM,UAAU,GAAG;IAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAE1E,eAAO,MAAM,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAY5C,CAAC;AAEH,eAAO,MAAM,gBAAgB,6CAAwC,CAAC;AAUtE;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAsB3D;AAED;;;GAGG;AACH,wBAAgB,KAAK,CACnB,GAAG,EAAE,MAAM,EACX,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,KAAK,OAAO,GAC3C,SAAS,CAIX;AAOD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,OAAO,EACZ,QAAQ,CAAC,EACL,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GACnB,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAC1C,IAAI,EACR,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,UAGzB;AAED,eAAO,MAAM,UAAU;;;CAGb,CAAC"}

package/out/shared/src/bigint-json.js

@@ -17,12 +17,37 @@ var jsonValueSchema = valita_exports.lazy(() => {
 	return valita_exports.union(valita_exports.null(), valita_exports.string(), valita_exports.number(), valita_exports.bigint(), valita_exports.boolean(), readonly(valita_exports.array(jsonValueSchema)), jsonObjectSchema);
 });
 var jsonObjectSchema = readonly(valita_exports.record(jsonValueSchema));
+var UNSAFE_INTEGER_DIGITS = 16;
+function isDigit(c) {
+	return c >= 48 && c <= 57;
+}
+/**
+* Whether `str` has a run of 16 or more digits. Every such run covers one of
+* every 16 consecutive indices, so only every 16th char needs to be checked and
+* a digit there is expanded to its full run. This is several times faster than
+* `/\d{16}/`, which restarts at every digit of a shorter run.
+*
+* A run inside a JSON string also matches; that merely takes the slow path.
+*/
+function hasUnsafeIntegerDigits(str) {
+	const n = str.length;
+	for (let i = 15; i < n; i += UNSAFE_INTEGER_DIGITS) {
+		if (!isDigit(str.charCodeAt(i))) continue;
+		let start = i;
+		while (start > 0 && isDigit(str.charCodeAt(start - 1))) start--;
+		let end = i + 1;
+		while (end < n && isDigit(str.charCodeAt(end))) end++;
+		if (end - start >= UNSAFE_INTEGER_DIGITS) return true;
+		i = end - 1;
+	}
+	return false;
+}
 /**
 * Parses JSON strings that may contain arbitrarily large integers. Integers
 * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.
 */
 function parse$1(str, reviver) {
-	return parse(str, reviver, numberParser);
+	return hasUnsafeIntegerDigits(str) ? parse(str, reviver, numberParser) : JSON.parse(str, reviver);
 }
 function customSerializer(_, v, type) {
 	if (type === "bigint") return v.toString();
@@ -43,6 +68,6 @@ var BigIntJSON = {
 	stringify: stringify$1
 };
 //#endregion
-export { BigIntJSON, jsonObjectSchema, jsonValueSchema, parse$1 as parse, stringify$1 as stringify };
+export { BigIntJSON, hasUnsafeIntegerDigits, jsonObjectSchema, jsonValueSchema, parse$1 as parse, stringify$1 as stringify };
 
 //# sourceMappingURL=bigint-json.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"bigint-json.js","names":[],"sources":["../../../../shared/src/bigint-json.ts"],"sourcesContent":["/**\n * Background for using `json-custom-numbers`:\n *\n * https://neon.tech/blog/parsing-json-from-postgres-in-js\n */\nimport {\n  parse as customParse,\n  stringify as customStringify,\n} from 'json-custom-numbers';\nimport * as v from './valita.ts';\n\nfunction numberParser(_: unknown, v: string) {\n  const n = +v;\n  if (n >= Number.MIN_SAFE_INTEGER && n <= Number.MAX_SAFE_INTEGER) return n;\n  if (v.includes('.') || v.includes('e') || v.includes('E')) {\n    return n;\n  }\n  return BigInt(v);\n}\n\n// Variant of postgres.JSONValue adapted to include bigints\nexport type JSONValue =\n  | null\n  | string\n  | number\n  | bigint\n  | boolean\n  | readonly JSONValue[]\n  | JSONObject;\n\nexport type JSONObject = {readonly [prop: string]: JSONValue | undefined};\n\nexport const jsonValueSchema: v.Type<JSONValue> = v.lazy(() => {\n  const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n  return v.union(\n    v.null(),\n    v.string(),\n    v.number(),\n    v.bigint(),\n    v.boolean(),\n    v.readonly(v.array(jsonValueSchema)),\n    jsonObjectSchema,\n  );\n});\n\nexport const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n/**\n * Parses JSON strings that may contain arbitrarily large integers. Integers\n * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.\n */\nexport function parse(\n  str: string,\n  reviver?: (k: string, v: unknown) => unknown,\n): JSONValue {\n  return customParse(str, reviver, numberParser);\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nfunction customSerializer(_: string, v: any, type: string) {\n  if (type === 'bigint') return v.toString();\n}\n\n/**\n * Stringifies objects to JSON, supporting objects containing bigint values.\n * Note that the resulting JSON string may not be deserializable by\n * all environments, but it is supported by Postgres. The string should be\n * deserialized with the corresponding {@link parse} method that will represent\n * large numbers as bigints. From there it is up to the application to suitably\n * handle bigints passed to downstream logic.\n */\nexport function stringify(\n  obj: unknown,\n  replacer?:\n    | (string | number)[]\n    | ((key: string, value: unknown) => unknown)\n    | null,\n  indent?: string | number,\n) {\n  return customStringify(obj, replacer, indent, customSerializer);\n}\n\nexport const BigIntJSON = {\n  parse,\n  stringify,\n} as const;\n"],"mappings":";;;;;;;;AAWA,SAAS,aAAa,GAAY,GAAW;CAC3C,MAAM,IAAI,CAAC;CACX,IAAI,KAAK,OAAO,oBAAoB,KAAK,OAAO,kBAAkB,OAAO;CACzE,IAAI,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,GACtD,OAAO;CAET,OAAO,OAAO,CAAC;AACjB;AAcA,IAAa,kBAAqC,eAAE,WAAW;CAC7D,MAAM,mBAAmB,SAAW,eAAE,OAAO,eAAe,CAAC;CAE7D,OAAO,eAAE,MACP,eAAE,KAAK,GACP,eAAE,OAAO,GACT,eAAE,OAAO,GACT,eAAE,OAAO,GACT,eAAE,QAAQ,GACV,SAAW,eAAE,MAAM,eAAe,CAAC,GACnC,gBACF;AACF,CAAC;AAED,IAAa,mBAAmB,SAAW,eAAE,OAAO,eAAe,CAAC;;;;;AAMpE,SAAgB,QACd,KACA,SACW;CACX,OAAO,MAAY,KAAK,SAAS,YAAY;AAC/C;AAGA,SAAS,iBAAiB,GAAW,GAAQ,MAAc;CACzD,IAAI,SAAS,UAAU,OAAO,EAAE,SAAS;AAC3C;;;;;;;;;AAUA,SAAgB,YACd,KACA,UAIA,QACA;CACA,OAAO,UAAgB,KAAK,UAAU,QAAQ,gBAAgB;AAChE;AAEA,IAAa,aAAa;CACxB,OAAA;CACA,WAAA;AACF"}
+{"version":3,"file":"bigint-json.js","names":["v","v.readonly","parse","customParse","stringify","customStringify"],"sources":["../../../../shared/src/bigint-json.ts"],"sourcesContent":["/**\n * Background for using `json-custom-numbers`:\n *\n * https://neon.tech/blog/parsing-json-from-postgres-in-js\n */\nimport {\n  parse as customParse,\n  stringify as customStringify,\n} from 'json-custom-numbers';\nimport * as v from './valita.ts';\n\nfunction numberParser(_: unknown, v: string) {\n  const n = +v;\n  if (n >= Number.MIN_SAFE_INTEGER && n <= Number.MAX_SAFE_INTEGER) return n;\n  if (v.includes('.') || v.includes('e') || v.includes('E')) {\n    return n;\n  }\n  return BigInt(v);\n}\n\n// Variant of postgres.JSONValue adapted to include bigints\nexport type JSONValue =\n  | null\n  | string\n  | number\n  | bigint\n  | boolean\n  | readonly JSONValue[]\n  | JSONObject;\n\nexport type JSONObject = {readonly [prop: string]: JSONValue | undefined};\n\nexport const jsonValueSchema: v.Type<JSONValue> = v.lazy(() => {\n  const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n  return v.union(\n    v.null(),\n    v.string(),\n    v.number(),\n    v.bigint(),\n    v.boolean(),\n    v.readonly(v.array(jsonValueSchema)),\n    jsonObjectSchema,\n  );\n});\n\nexport const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n// Integers of up to 15 digits are safe, so only a run of 16 or more digits can\n// be an integer that needs the (much slower) custom number parsing.\nconst UNSAFE_INTEGER_DIGITS = 16;\n\nfunction isDigit(c: number): boolean {\n  return c >= 48 && c <= 57;\n}\n\n/**\n * Whether `str` has a run of 16 or more digits. Every such run covers one of\n * every 16 consecutive indices, so only every 16th char needs to be checked and\n * a digit there is expanded to its full run. This is several times faster than\n * `/\\d{16}/`, which restarts at every digit of a shorter run.\n *\n * A run inside a JSON string also matches; that merely takes the slow path.\n */\nexport function hasUnsafeIntegerDigits(str: string): boolean {\n  const n = str.length;\n  for (let i = UNSAFE_INTEGER_DIGITS - 1; i < n; i += UNSAFE_INTEGER_DIGITS) {\n    if (!isDigit(str.charCodeAt(i))) {\n      continue;\n    }\n    let start = i;\n    while (start > 0 && isDigit(str.charCodeAt(start - 1))) {\n      start--;\n    }\n    let end = i + 1;\n    while (end < n && isDigit(str.charCodeAt(end))) {\n      end++;\n    }\n    if (end - start >= UNSAFE_INTEGER_DIGITS) {\n      return true;\n    }\n    // The next run starts after `end`, and covers one of every 16 indices from\n    // there on.\n    i = end - 1;\n  }\n  return false;\n}\n\n/**\n * Parses JSON strings that may contain arbitrarily large integers. Integers\n * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.\n */\nexport function parse(\n  str: string,\n  reviver?: (k: string, v: unknown) => unknown,\n): JSONValue {\n  return hasUnsafeIntegerDigits(str)\n    ? customParse(str, reviver, numberParser)\n    : JSON.parse(str, reviver);\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nfunction customSerializer(_: string, v: any, type: string) {\n  if (type === 'bigint') return v.toString();\n}\n\n/**\n * Stringifies objects to JSON, supporting objects containing bigint values.\n * Note that the resulting JSON string may not be deserializable by\n * all environments, but it is supported by Postgres. The string should be\n * deserialized with the corresponding {@link parse} method that will represent\n * large numbers as bigints. From there it is up to the application to suitably\n * handle bigints passed to downstream logic.\n */\nexport function stringify(\n  obj: unknown,\n  replacer?:\n    | (string | number)[]\n    | ((key: string, value: unknown) => unknown)\n    | null,\n  indent?: string | number,\n) {\n  return customStringify(obj, replacer, indent, customSerializer);\n}\n\nexport const BigIntJSON = {\n  parse,\n  stringify,\n} as const;\n"],"mappings":";;;;;;;;AAWA,SAAS,aAAa,GAAY,GAAW;CAC3C,MAAM,IAAI,CAAC;CACX,IAAI,KAAK,OAAO,oBAAoB,KAAK,OAAO,kBAAkB,OAAO;CACzE,IAAI,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,GACtD,OAAO;CAET,OAAO,OAAO,CAAC;AACjB;AAcA,IAAa,kBAAqCA,eAAE,WAAW;CAC7D,MAAM,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;CAE7D,OAAOA,eAAE,MACPA,eAAE,KAAK,GACPA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,QAAQ,GACVC,SAAWD,eAAE,MAAM,eAAe,CAAC,GACnC,gBACF;AACF,CAAC;AAED,IAAa,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;AAIpE,IAAM,wBAAwB;AAE9B,SAAS,QAAQ,GAAoB;CACnC,OAAO,KAAK,MAAM,KAAK;AACzB;;;;;;;;;AAUA,SAAgB,uBAAuB,KAAsB;CAC3D,MAAM,IAAI,IAAI;CACd,KAAK,IAAI,IAAI,IAA2B,IAAI,GAAG,KAAK,uBAAuB;EACzE,IAAI,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC,GAC5B;EAEF,IAAI,QAAQ;EACZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,WAAW,QAAQ,CAAC,CAAC,GACnD;EAEF,IAAI,MAAM,IAAI;EACd,OAAO,MAAM,KAAK,QAAQ,IAAI,WAAW,GAAG,CAAC,GAC3C;EAEF,IAAI,MAAM,SAAS,uBACjB,OAAO;EAIT,IAAI,MAAM;CACZ;CACA,OAAO;AACT;;;;;AAMA,SAAgBE,QACd,KACA,SACW;CACX,OAAO,uBAAuB,GAAG,IAC7BC,MAAY,KAAK,SAAS,YAAY,IACtC,KAAK,MAAM,KAAK,OAAO;AAC7B;AAGA,SAAS,iBAAiB,GAAW,GAAQ,MAAc;CACzD,IAAI,SAAS,UAAU,OAAO,EAAE,SAAS;AAC3C;;;;;;;;;AAUA,SAAgBC,YACd,KACA,UAIA,QACA;CACA,OAAOC,UAAgB,KAAK,UAAU,QAAQ,gBAAgB;AAChE;AAEA,IAAa,aAAa;CACxB,OAAA;CACA,WAAA;AACF"}

package/out/shared/src/broadcast-channel.js

@@ -16,6 +16,6 @@ var NoopBroadcastChannel = class {
 };
 var bc = typeof BroadcastChannel === "undefined" ? NoopBroadcastChannel : BroadcastChannel;
 //#endregion
-export { bc };
+export { bc as BroadcastChannel };
 
 //# sourceMappingURL=broadcast-channel.js.map

package/out/shared/src/btree-set.js

@@ -175,8 +175,8 @@ var BTreeReverseIterator = class {
 				done: false,
 				value: this.#leaf.keys[this.#i]
 			};
-			let level;
-			for (level = -1;;) {
+			let level = -1;
+			for (;;) {
 				if (++level >= this.#nodeQueue.length) return {
 					done: true,
 					value: void 0
@@ -305,7 +305,8 @@ var BNode = class BNode {
 	}
 	splitOffRightSide() {
 		const half = this.keys.length >> 1;
-		return new BNode(this.keys.splice(half));
+		const keys = this.keys.splice(half);
+		return new BNode(keys);
 	}
 	delete(key, tree) {
 		const cmp = tree.comparator;
@@ -433,12 +434,14 @@ var BNodeInternal = class BNodeInternal extends BNode {
 			keys[i] = children[i].maxKey();
 			return result;
 		} finally {
-			const half = MAX_NODE_SIZE >> 1;
+			const half = 16;
 			if (iLow > 0) iLow--;
-			for (i = iHigh; i >= iLow; i--) if (children[i].keys.length <= half) if (children[i].keys.length !== 0) this.tryMerge(i, MAX_NODE_SIZE);
-			else {
-				keys.splice(i, 1);
-				children.splice(i, 1);
+			for (i = iHigh; i >= iLow; i--) if (children[i].keys.length <= half) {
+				if (children[i].keys.length !== 0) this.tryMerge(i, MAX_NODE_SIZE);
+				else {
+					keys.splice(i, 1);
+					children.splice(i, 1);
+				}
 			}
 		}
 		return false;

package/out/shared/src/btree-set.js.map

@@ -1 +1 @@
-{"version":3,"file":"btree-set.js","names":["#root","#delete","#maxKey","#nodeQueue","#nodeIndex","#leaf","#i"],"sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\ntype Comparator<K> = (a: K, b: K) => number;\n\nexport class BTreeSet<K> {\n  #root: BNode<K> = emptyLeaf as BNode<K>;\n  size: number = 0;\n\n  readonly comparator: Comparator<K>;\n\n  constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n    this.comparator = comparator;\n    if (entries) {\n      for (const key of entries) {\n        this.add(key);\n      }\n    }\n  }\n\n  /** Releases the tree so that its size is 0. */\n  clear() {\n    this.#root = emptyLeaf as BNode<K>;\n    this.size = 0;\n  }\n\n  clone() {\n    this.#root.isShared = true;\n    const ret = new BTreeSet<K>(this.comparator);\n    ret.#root = this.#root;\n    ret.size = this.size;\n    return ret;\n  }\n\n  get(key: K): K | undefined {\n    return this.#root.get(key, this);\n  }\n\n  add(key: K): this {\n    if (this.#root.isShared) this.#root = this.#root.clone();\n    const result = this.#root.set(key, this);\n    if (result === null) return this;\n    // Root node has split, so create a new root node.\n    this.#root = new BNodeInternal<K>([this.#root, result]);\n    return this;\n  }\n\n  /**\n   * Returns true if the key exists in the B+ tree, false if not.\n   * Use get() for best performance; use has() if you need to\n   * distinguish between \"undefined value\" and \"key not present\".\n   * @param key Key to detect\n   * @description Computational complexity: O(log size)\n   */\n  has(key: K): boolean {\n    return this.#root.has(key, this);\n  }\n\n  /**\n   * Removes a single key-value pair from the B+ tree.\n   * @param key Key to find\n   * @returns true if a pair was found and removed, false otherwise.\n   * @description Computational complexity: O(log size)\n   */\n  delete(key: K): boolean {\n    return this.#delete(key);\n  }\n\n  #delete(key: K): boolean {\n    let root = this.#root;\n    if (root.isShared) {\n      this.#root = root = root.clone();\n    }\n    try {\n      return root.delete(key, this);\n    } finally {\n      let isShared;\n      while (root.keys.length <= 1 && root.isInternal()) {\n        isShared ||= root.isShared;\n        this.#root = root =\n          root.keys.length === 0 ? emptyLeaf : root.children[0];\n      }\n      // If any ancestor of the new root was shared, the new root must also be shared\n      if (isShared) {\n        root.isShared = true;\n      }\n    }\n  }\n\n  keys(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  values(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n  }\n\n  valuesReversed(): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      undefined,\n      true,\n    );\n  }\n\n  valuesFromReversed(\n    highestKey?: K,\n    inclusive: boolean = true,\n  ): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      highestKey,\n      inclusive,\n    );\n  }\n\n  /** Gets the highest key in the tree. Complexity: O(1) */\n  #maxKey(): K | undefined {\n    return this.#root.maxKey();\n  }\n\n  [Symbol.iterator](): IterableIterator<K> {\n    return this.keys();\n  }\n\n  /**\n   * Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing\n   * the tree bottom-up. The caller must ensure entries are sorted by\n   * `comparator`; violating this produces an invalid tree.\n   */\n  static fromSorted<K>(\n    comparator: Comparator<K>,\n    sortedEntries: Iterable<K>,\n  ): BTreeSet<K> {\n    const tree = new BTreeSet<K>(comparator);\n\n    // Stream through entries, flushing a leaf node each time we fill MAX_NODE_SIZE keys.\n    const leaves: BNode<K>[] = [];\n    let currentKeys: K[] = [];\n    let size = 0;\n\n    for (const key of sortedEntries) {\n      currentKeys.push(key);\n      if (currentKeys.length === MAX_NODE_SIZE) {\n        leaves.push(new BNode<K>(currentKeys));\n        currentKeys = [];\n      }\n      size++;\n    }\n\n    if (currentKeys.length > 0) {\n      leaves.push(new BNode<K>(currentKeys));\n    }\n\n    if (leaves.length === 0) return tree;\n\n    tree.size = size;\n\n    if (leaves.length === 1) {\n      tree.#root = leaves[0];\n      return tree;\n    }\n\n    // Build internal nodes bottom-up until a single root remains.\n    let currentLevel: BNode<K>[] = leaves;\n    while (currentLevel.length > 1) {\n      const nextLevel: BNodeInternal<K>[] = [];\n      for (let i = 0; i < currentLevel.length; i += MAX_NODE_SIZE) {\n        nextLevel.push(\n          new BNodeInternal<K>(currentLevel.slice(i, i + MAX_NODE_SIZE)),\n        );\n      }\n      currentLevel = nextLevel;\n    }\n\n    tree.#root = currentLevel[0];\n    return tree;\n  }\n}\n\nclass BTreeForwardIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (++this.#i < this.#leaf.keys.length) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level = -1;\n      for (;;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (++this.#nodeIndex[level] < this.#nodeQueue[level].length) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = 0;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = -1;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nclass BTreeReverseIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (--this.#i >= 0) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level;\n      // Advance to the next leaf node\n      for (level = -1; ;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (--this.#nodeIndex[level] >= 0) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = this.#nodeQueue[level - 1].length - 1;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = this.#leaf.keys.length;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nfunction valuesFrom<K>(\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  lowestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  const info = findPath(lowestKey, root, comparator);\n  if (info === undefined) {\n    return iterator<K>(() => ({done: true, value: undefined}));\n  }\n\n  let [nodeQueue, nodeIndex, leaf] = info;\n  let i =\n    lowestKey === undefined\n      ? -1\n      : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n  if (\n    !inclusive &&\n    lowestKey !== undefined &&\n    // +1 because we did -1 above.\n    i + 1 < leaf.keys.length &&\n    comparator(leaf.keys[i + 1], lowestKey) === 0\n  ) {\n    i++;\n  }\n\n  return new BTreeForwardIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction valuesFromReversed<K>(\n  maxKey: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  highestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  if (highestKey === undefined) {\n    highestKey = maxKey;\n    if (highestKey === undefined) {\n      return iterator<K>(() => ({done: true, value: undefined}));\n    } // collection is empty\n  }\n  let [nodeQueue, nodeIndex, leaf] =\n    findPath(highestKey, root, comparator) ||\n    findPath(maxKey, root, comparator)!;\n  assert(\n    !nodeQueue[0] || leaf === nodeQueue[0][nodeIndex[0]],\n    'BTreeSet: leaf node mismatch in iteration',\n  );\n  let i = indexOf(highestKey, leaf.keys, 0, comparator);\n  if (\n    inclusive &&\n    i < leaf.keys.length &&\n    comparator(leaf.keys[i], highestKey) <= 0\n  ) {\n    i++;\n  }\n\n  return new BTreeReverseIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction findPath<K>(\n  key: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] | undefined {\n  let nextNode = root;\n  const nodeQueue: BNode<K>[][] = [];\n  const nodeIndex: number[] = [];\n\n  if (nextNode.isInternal()) {\n    for (let d = 0; nextNode.isInternal(); d++) {\n      nodeQueue[d] = nextNode.children;\n      nodeIndex[d] =\n        key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n      if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n      nextNode = nodeQueue[d][nodeIndex[d]];\n    }\n    nodeQueue.reverse();\n    nodeIndex.reverse();\n  }\n  return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n  return {\n    next,\n    [Symbol.iterator]() {\n      return this;\n    },\n  };\n}\n\n/** Leaf node / base class. **************************************************/\nclass BNode<K> {\n  // If this is an internal node, _keys[i] is the highest key in children[i].\n  keys: K[];\n  // True if this node might be within multiple `BTree`s (or have multiple parents).\n  // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n  // This is transitive: if it's true, children are also shared even if `isShared!=true`\n  // in those children. (Certain operations will propagate isShared=true to children.)\n  isShared: true | undefined;\n\n  constructor(keys: K[]) {\n    this.keys = keys;\n    this.isShared = undefined;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return false;\n  }\n\n  maxKey() {\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    return this.keys.at(-1)!;\n  }\n\n  minKey(): K | undefined {\n    return this.keys[0];\n  }\n\n  clone(): BNode<K> {\n    return new BNode<K>(this.keys.slice(0));\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i < 0 ? undefined : this.keys[i];\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i >= 0 && i < this.keys.length;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    let i = indexOf(key, this.keys, -1, tree.comparator);\n    if (i < 0) {\n      // key does not exist yet\n      i = ~i;\n      tree.size++;\n\n      if (this.keys.length < MAX_NODE_SIZE) {\n        this.keys.splice(i, 0, key);\n        return null;\n      }\n      // This leaf node is full and must split\n      const newRightSibling = this.splitOffRightSide();\n      // oxlint-disable-next-line @typescript-eslint/no-this-alias\n      let target: BNode<K> = this;\n      if (i > this.keys.length) {\n        i -= this.keys.length;\n        target = newRightSibling;\n      }\n      // target.#insertInLeaf(i, key);\n      target.keys.splice(i, 0, key);\n\n      return newRightSibling;\n    }\n\n    // usually this is a no-op, but some users may wish to edit the key\n    this.keys[i] = key;\n    return null;\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n  }\n\n  splitOffRightSide(): BNode<K> {\n    const half = this.keys.length >> 1;\n    const keys = this.keys.splice(half);\n    return new BNode<K>(keys);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const iLow = indexOf(key, this.keys, -1, cmp);\n    const iHigh = iLow + 1;\n\n    if (iLow < 0) {\n      return false;\n    }\n\n    const {keys} = this;\n    for (let i = iLow; i < iHigh; i++) {\n      const key = keys[i];\n\n      if (key !== keys[i] || this.isShared === true) {\n        throw new Error('BTree illegally changed or cloned in delete');\n      }\n\n      this.keys.splice(i, 1);\n      tree.size--;\n      return true;\n    }\n\n    return false;\n  }\n\n  mergeSibling(rhs: BNode<K>, _: number) {\n    this.keys.push(...rhs.keys);\n  }\n}\n\n/** Internal node (non-leaf node) ********************************************/\nclass BNodeInternal<K> extends BNode<K> {\n  // Note: conventionally B+ trees have one fewer key than the number of\n  // children, but I find it easier to keep the array lengths equal: each\n  // keys[i] caches the value of children[i].maxKey().\n  children: BNode<K>[];\n\n  /**\n   * This does not mark `children` as shared, so it is the responsibility of the caller\n   * to ensure children are either marked shared, or aren't included in another tree.\n   */\n  constructor(children: BNode<K>[], keys?: K[]) {\n    if (!keys) {\n      keys = [];\n      for (let i = 0; i < children.length; i++) {\n        keys[i] = children[i].maxKey();\n      }\n    }\n    super(keys);\n    this.children = children;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return true;\n  }\n\n  clone(): BNode<K> {\n    const children = this.children.slice(0);\n    for (let i = 0; i < children.length; i++) {\n      children[i].isShared = true;\n    }\n    return new BNodeInternal<K>(children, this.keys.slice(0));\n  }\n\n  minKey() {\n    return this.children[0].minKey();\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].get(key, tree) : undefined;\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].has(key, tree) : false;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    const c = this.children;\n    const cmp = tree.comparator;\n    let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n    let child = c[i];\n\n    if (child.isShared) {\n      c[i] = child = child.clone();\n    }\n    if (child.keys.length >= MAX_NODE_SIZE) {\n      // child is full; inserting anything else will cause a split.\n      // Shifting an item to the left or right sibling may avoid a split.\n      // We can do a shift if the adjacent node is not full and if the\n      // current key can still be placed in the same node after the shift.\n      let other: BNode<K>;\n      if (\n        i > 0 &&\n        (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n        cmp(child.keys[0], key) < 0\n      ) {\n        if (other.isShared) {\n          c[i - 1] = other = other.clone();\n        }\n        other.takeFromRight(child);\n        this.keys[i - 1] = other.maxKey();\n      } else if (\n        (other = c[i + 1]) !== undefined &&\n        other.keys.length < MAX_NODE_SIZE &&\n        cmp(child.maxKey(), key) < 0\n      ) {\n        if (other.isShared) c[i + 1] = other = other.clone();\n        other.takeFromLeft(child);\n        this.keys[i] = c[i].maxKey();\n      }\n    }\n\n    const result = child.set(key, tree);\n    this.keys[i] = child.maxKey();\n    if (result === null) return null;\n\n    // The child has split and `result` is a new right child... does it fit?\n    if (this.keys.length < MAX_NODE_SIZE) {\n      // yes\n      this.insert(i + 1, result);\n      return null;\n    }\n    // no, we must split also\n    const newRightSibling = this.splitOffRightSide();\n    // oxlint-disable-next-line @typescript-eslint/no-this-alias\n    let target: BNodeInternal<K> = this;\n    if (cmp(result.maxKey(), this.maxKey()) > 0) {\n      target = newRightSibling;\n      i -= this.keys.length;\n    }\n    target.insert(i + 1, result);\n    return newRightSibling;\n  }\n\n  /**\n   * Inserts `child` at index `i`.\n   * This does not mark `child` as shared, so it is the responsibility of the caller\n   * to ensure that either child is marked shared, or it is not included in another tree.\n   */\n  insert(i: number, child: BNode<K>) {\n    this.children.splice(i, 0, child);\n    this.keys.splice(i, 0, child.maxKey());\n  }\n\n  /**\n   * Split this node.\n   * Modifies this to remove the second half of the items, returning a separate node containing them.\n   */\n  splitOffRightSide() {\n    const half = this.children.length >> 1;\n    return new BNodeInternal<K>(\n      this.children.splice(half),\n      this.keys.splice(half),\n    );\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n    this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n    this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const {keys} = this;\n    const {children} = this;\n    let iLow = indexOf(key, this.keys, 0, cmp);\n    let i = iLow;\n    const iHigh = Math.min(iLow, keys.length - 1);\n    if (i <= iHigh) {\n      try {\n        if (children[i].isShared) {\n          children[i] = children[i].clone();\n        }\n        const result = children[i].delete(key, tree);\n        // Note: if children[i] is empty then keys[i]=undefined.\n        //       This is an invalid state, but it is fixed below.\n        keys[i] = children[i].maxKey();\n        return result;\n      } finally {\n        // Deletions may have occurred, so look for opportunities to merge nodes.\n        const half = MAX_NODE_SIZE >> 1;\n        if (iLow > 0) iLow--;\n        for (i = iHigh; i >= iLow; i--) {\n          if (children[i].keys.length <= half) {\n            if (children[i].keys.length !== 0) {\n              this.tryMerge(i, MAX_NODE_SIZE);\n            } else {\n              // child is empty! delete it!\n              keys.splice(i, 1);\n              children.splice(i, 1);\n            }\n          }\n        }\n      }\n    }\n    return false;\n  }\n\n  /** Merges child i with child i+1 if their combined size is not too large */\n  tryMerge(i: number, maxSize: number): boolean {\n    const {children} = this;\n    if (i >= 0 && i + 1 < children.length) {\n      if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n        if (\n          children[i].isShared\n        ) // cloned already UNLESS i is outside scan range\n        {\n          children[i] = children[i].clone();\n        }\n        children[i].mergeSibling(children[i + 1], maxSize);\n        children.splice(i + 1, 1);\n        this.keys.splice(i + 1, 1);\n        this.keys[i] = children[i].maxKey();\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Move children from `rhs` into this.\n   * `rhs` must be part of this tree, and be removed from it after this call\n   * (otherwise isShared for its children could be incorrect).\n   */\n  mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n    // assert !this.isShared;\n    const oldLength = this.keys.length;\n    this.keys.push(...rhs.keys);\n    const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n    this.children.push(...rhsChildren);\n\n    if (rhs.isShared && !this.isShared) {\n      // All children of a shared node are implicitly shared, and since their new\n      // parent is not shared, they must now be explicitly marked as shared.\n      for (let i = 0; i < rhsChildren.length; i++) {\n        rhsChildren[i].isShared = true;\n      }\n    }\n\n    // If our children are themselves almost empty due to a mass-delete,\n    // they may need to be merged too (but only the oldLength-1 and its\n    // right sibling should need this).\n    this.tryMerge(oldLength - 1, maxNodeSize);\n  }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n  key: K,\n  keys: K[],\n  failXor: number,\n  comparator: Comparator<K>,\n): number {\n  let lo = 0;\n  let hi = keys.length;\n  let mid = hi >> 1;\n  while (lo < hi) {\n    const c = comparator(keys[mid], key);\n    if (c < 0) {\n      lo = mid + 1;\n    } else if (c > 0) {\n      // key < keys[mid]\n      hi = mid;\n    } else if (c === 0) {\n      return mid;\n    } else {\n      // c is NaN or otherwise invalid\n      if (key === key) {\n        // at least the search key is not NaN\n        return keys.length;\n      }\n      throw new Error('NaN was used as a key');\n    }\n    mid = (lo + hi) >> 1;\n  }\n  return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"mappings":";;AAEA,IAAM,gBAAgB;AAItB,IAAa,WAAb,MAAa,SAAY;CACvB,QAAkB;CAClB,OAAe;CAEf;CAEA,YAAY,YAA2B,SAA+B;EACpE,KAAK,aAAa;EAClB,IAAI,SACF,KAAK,MAAM,OAAO,SAChB,KAAK,IAAI,GAAG;CAGlB;;CAGA,QAAQ;EACN,KAAKA,QAAQ;EACb,KAAK,OAAO;CACd;CAEA,QAAQ;EACN,KAAKA,MAAM,WAAW;EACtB,MAAM,MAAM,IAAI,SAAY,KAAK,UAAU;EAC3C,IAAIA,QAAQ,KAAKA;EACjB,IAAI,OAAO,KAAK;EAChB,OAAO;CACT;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAKA,MAAM,IAAI,KAAK,IAAI;CACjC;CAEA,IAAI,KAAc;EAChB,IAAI,KAAKA,MAAM,UAAU,KAAKA,QAAQ,KAAKA,MAAM,MAAM;EACvD,MAAM,SAAS,KAAKA,MAAM,IAAI,KAAK,IAAI;EACvC,IAAI,WAAW,MAAM,OAAO;EAE5B,KAAKA,QAAQ,IAAI,cAAiB,CAAC,KAAKA,OAAO,MAAM,CAAC;EACtD,OAAO;CACT;;;;;;;;CASA,IAAI,KAAiB;EACnB,OAAO,KAAKA,MAAM,IAAI,KAAK,IAAI;CACjC;;;;;;;CAQA,OAAO,KAAiB;EACtB,OAAO,KAAKC,QAAQ,GAAG;CACzB;CAEA,QAAQ,KAAiB;EACvB,IAAI,OAAO,KAAKD;EAChB,IAAI,KAAK,UACP,KAAKA,QAAQ,OAAO,KAAK,MAAM;EAEjC,IAAI;GACF,OAAO,KAAK,OAAO,KAAK,IAAI;EAC9B,UAAU;GACR,IAAI;GACJ,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,WAAW,GAAG;IACjD,aAAa,KAAK;IAClB,KAAKA,QAAQ,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS;GACvD;GAEA,IAAI,UACF,KAAK,WAAW;EAEpB;CACF;CAEA,OAA4B;EAC1B,OAAO,WAAW,KAAKA,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,SAA8B;EAC5B,OAAO,WAAW,KAAKA,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,WAAW,WAAe,YAAqB,MAA2B;EACxE,OAAO,WAAW,KAAKA,OAAO,KAAK,YAAY,WAAW,SAAS;CACrE;CAEA,iBAAsC;EACpC,OAAO,mBACL,KAAKE,QAAQ,GACb,KAAKF,OACL,KAAK,YACL,KAAA,GACA,IACF;CACF;CAEA,mBACE,YACA,YAAqB,MACA;EACrB,OAAO,mBACL,KAAKE,QAAQ,GACb,KAAKF,OACL,KAAK,YACL,YACA,SACF;CACF;;CAGA,UAAyB;EACvB,OAAO,KAAKA,MAAM,OAAO;CAC3B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK;CACnB;;;;;;CAOA,OAAO,WACL,YACA,eACa;EACb,MAAM,OAAO,IAAI,SAAY,UAAU;EAGvC,MAAM,SAAqB,CAAC;EAC5B,IAAI,cAAmB,CAAC;EACxB,IAAI,OAAO;EAEX,KAAK,MAAM,OAAO,eAAe;GAC/B,YAAY,KAAK,GAAG;GACpB,IAAI,YAAY,WAAW,eAAe;IACxC,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;IACrC,cAAc,CAAC;GACjB;GACA;EACF;EAEA,IAAI,YAAY,SAAS,GACvB,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;EAGvC,IAAI,OAAO,WAAW,GAAG,OAAO;EAEhC,KAAK,OAAO;EAEZ,IAAI,OAAO,WAAW,GAAG;GACvB,KAAKA,QAAQ,OAAO;GACpB,OAAO;EACT;EAGA,IAAI,eAA2B;EAC/B,OAAO,aAAa,SAAS,GAAG;GAC9B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,eAC5C,UAAU,KACR,IAAI,cAAiB,aAAa,MAAM,GAAG,IAAI,aAAa,CAAC,CAC/D;GAEF,eAAe;EACjB;EAEA,KAAKA,QAAQ,aAAa;EAC1B,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAKG,aAAa;EAClB,KAAKC,aAAa;EAClB,KAAKC,QAAQ;EACb,KAAKC,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAKA,KAAK,KAAKD,MAAM,KAAK,QAC9B,OAAO;IAAC,MAAM;IAAO,OAAO,KAAKA,MAAM,KAAK,KAAKC;GAAG;GAGtD,IAAI,QAAQ;GACZ,SAAS;IACP,IAAI,EAAE,SAAS,KAAKH,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAKC,WAAW,SAAS,KAAKD,WAAW,OAAO,QACpD;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAKA,WAAW,QAAQ,KACtB,KAAKA,WAAW,OAAO,KAAKC,WAAW,QACvC;IACF,KAAKA,WAAW,QAAQ,KAAK;GAC/B;GACA,KAAKC,QAAQ,KAAKF,WAAW,GAAG,KAAKC,WAAW;GAChD,KAAKE,KAAK;EACZ;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAKH,aAAa;EAClB,KAAKC,aAAa;EAClB,KAAKC,QAAQ;EACb,KAAKC,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAKA,MAAM,GACf,OAAO;IAAC,MAAM;IAAO,OAAO,KAAKD,MAAM,KAAK,KAAKC;GAAG;GAGtD,IAAI;GAEJ,KAAK,QAAQ,MAAO;IAClB,IAAI,EAAE,SAAS,KAAKH,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAKC,WAAW,UAAU,GAC9B;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAKD,WAAW,QAAQ,KACtB,KAAKA,WAAW,OAAO,KAAKC,WAAW,QACvC;IACF,KAAKA,WAAW,QAAQ,KAAK,KAAKD,WAAW,QAAQ,GAAG,SAAS;GACnE;GACA,KAAKE,QAAQ,KAAKF,WAAW,GAAG,KAAKC,WAAW;GAChD,KAAKE,KAAK,KAAKD,MAAM,KAAK;EAC5B;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,SAAS,WACP,MACA,YACA,WACA,WACqB;CACrB,MAAM,OAAO,SAAS,WAAW,MAAM,UAAU;CACjD,IAAI,SAAS,KAAA,GACX,OAAO,gBAAmB;EAAC,MAAM;EAAM,OAAO,KAAA;CAAS,EAAE;CAG3D,IAAI,CAAC,WAAW,WAAW,QAAQ;CACnC,IAAI,IACF,cAAc,KAAA,IACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,UAAU,IAAI;CAErD,IACE,CAAC,aACD,cAAc,KAAA,KAEd,IAAI,IAAI,KAAK,KAAK,UAClB,WAAW,KAAK,KAAK,IAAI,IAAI,SAAS,MAAM,GAE5C;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;CACrB,IAAI,eAAe,KAAA,GAAW;EAC5B,aAAa;EACb,IAAI,eAAe,KAAA,GACjB,OAAO,gBAAmB;GAAC,MAAM;GAAM,OAAO,KAAA;EAAS,EAAE;CAE7D;CACA,IAAI,CAAC,WAAW,WAAW,QACzB,SAAS,YAAY,MAAM,UAAU,KACrC,SAAS,QAAQ,MAAM,UAAU;CACnC,OACE,CAAC,UAAU,MAAM,SAAS,UAAU,GAAG,UAAU,KACjD,2CACF;CACA,IAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,UAAU;CACpD,IACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,IAAI,UAAU,KAAK,GAExC;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,SACP,KACA,MACA,YAC4E;CAC5E,IAAI,WAAW;CACf,MAAM,YAA0B,CAAC;CACjC,MAAM,YAAsB,CAAC;CAE7B,IAAI,SAAS,WAAW,GAAG;EACzB,KAAK,IAAI,IAAI,GAAG,SAAS,WAAW,GAAG,KAAK;GAC1C,UAAU,KAAK,SAAS;GACxB,UAAU,KACR,QAAQ,KAAA,IAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,UAAU;GACnE,IAAI,UAAU,MAAM,UAAU,GAAG,QAAQ;GACzC,WAAW,UAAU,GAAG,UAAU;EACpC;EACA,UAAU,QAAQ;EAClB,UAAU,QAAQ;CACpB;CACA,OAAO;EAAC;EAAW;EAAW;CAAQ;AACxC;AAEA,SAAS,SAAY,MAAoD;CACvE,OAAO;EACL;EACA,CAAC,OAAO,YAAY;GAClB,OAAO;EACT;CACF;AACF;;AAGA,IAAM,QAAN,MAAM,MAAS;CAEb;CAKA;CAEA,YAAY,MAAW;EACrB,KAAK,OAAO;EACZ,KAAK,WAAW,KAAA;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,SAAS;EAEP,OAAO,KAAK,KAAK,GAAG,EAAE;CACxB;CAEA,SAAwB;EACtB,OAAO,KAAK,KAAK;CACnB;CAEA,QAAkB;EAChB,OAAO,IAAI,MAAS,KAAK,KAAK,MAAM,CAAC,CAAC;CACxC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,KAAK;CACvC;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,KAAK,KAAK,IAAI,KAAK,KAAK;CACjC;CAEA,IAAI,KAAQ,MAAoC;EAC9C,IAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACnD,IAAI,IAAI,GAAG;GAET,IAAI,CAAC;GACL,KAAK;GAEL,IAAI,KAAK,KAAK,SAAS,eAAe;IACpC,KAAK,KAAK,OAAO,GAAG,GAAG,GAAG;IAC1B,OAAO;GACT;GAEA,MAAM,kBAAkB,KAAK,kBAAkB;GAE/C,IAAI,SAAmB;GACvB,IAAI,IAAI,KAAK,KAAK,QAAQ;IACxB,KAAK,KAAK,KAAK;IACf,SAAS;GACX;GAEA,OAAO,KAAK,OAAO,GAAG,GAAG,GAAG;GAE5B,OAAO;EACT;EAGA,KAAK,KAAK,KAAK;EACf,OAAO;CACT;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;CAClC;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;CACnC;CAEA,oBAA8B;EAC5B,MAAM,OAAO,KAAK,KAAK,UAAU;EAEjC,OAAO,IAAI,MADE,KAAK,KAAK,OAAO,IACV,CAAI;CAC1B;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG;EAC5C,MAAM,QAAQ,OAAO;EAErB,IAAI,OAAO,GACT,OAAO;EAGT,MAAM,EAAC,SAAQ;EACf,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK;GAGjC,IAFY,KAAK,OAEL,KAAK,MAAM,KAAK,aAAa,MACvC,MAAM,IAAI,MAAM,6CAA6C;GAG/D,KAAK,KAAK,OAAO,GAAG,CAAC;GACrB,KAAK;GACL,OAAO;EACT;EAEA,OAAO;CACT;CAEA,aAAa,KAAe,GAAW;EACrC,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;CAC5B;AACF;;AAGA,IAAM,gBAAN,MAAM,sBAAyB,MAAS;CAItC;;;;;CAMA,YAAY,UAAsB,MAAY;EAC5C,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,KAAK,SAAS,GAAG,OAAO;EAEjC;EACA,MAAM,IAAI;EACV,KAAK,WAAW;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,QAAkB;EAChB,MAAM,WAAW,KAAK,SAAS,MAAM,CAAC;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,SAAS,GAAG,WAAW;EAEzB,OAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC;CAC1D;CAEA,SAAS;EACP,OAAO,KAAK,SAAS,GAAG,OAAO;CACjC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,GAAG,IAAI,KAAK,IAAI,IAAI,KAAA;CAC5D;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,GAAG,IAAI,KAAK,IAAI,IAAI;CAC5D;CAEA,IAAI,KAAQ,MAAoC;EAC9C,MAAM,IAAI,KAAK;EACf,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE,SAAS,CAAC;EAC9D,IAAI,QAAQ,EAAE;EAEd,IAAI,MAAM,UACR,EAAE,KAAK,QAAQ,MAAM,MAAM;EAE7B,IAAI,MAAM,KAAK,UAAU,eAAe;GAKtC,IAAI;GACJ,IACE,IAAI,MACH,QAAQ,EAAE,IAAI,IAAI,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,GAC1B;IACA,IAAI,MAAM,UACR,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IAEjC,MAAM,cAAc,KAAK;IACzB,KAAK,KAAK,IAAI,KAAK,MAAM,OAAO;GAClC,OAAO,KACJ,QAAQ,EAAE,IAAI,QAAQ,KAAA,KACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,OAAO,GAAG,GAAG,IAAI,GAC3B;IACA,IAAI,MAAM,UAAU,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IACnD,MAAM,aAAa,KAAK;IACxB,KAAK,KAAK,KAAK,EAAE,GAAG,OAAO;GAC7B;EACF;EAEA,MAAM,SAAS,MAAM,IAAI,KAAK,IAAI;EAClC,KAAK,KAAK,KAAK,MAAM,OAAO;EAC5B,IAAI,WAAW,MAAM,OAAO;EAG5B,IAAI,KAAK,KAAK,SAAS,eAAe;GAEpC,KAAK,OAAO,IAAI,GAAG,MAAM;GACzB,OAAO;EACT;EAEA,MAAM,kBAAkB,KAAK,kBAAkB;EAE/C,IAAI,SAA2B;EAC/B,IAAI,IAAI,OAAO,OAAO,GAAG,KAAK,OAAO,CAAC,IAAI,GAAG;GAC3C,SAAS;GACT,KAAK,KAAK,KAAK;EACjB;EACA,OAAO,OAAO,IAAI,GAAG,MAAM;EAC3B,OAAO;CACT;;;;;;CAOA,OAAO,GAAW,OAAiB;EACjC,KAAK,SAAS,OAAO,GAAG,GAAG,KAAK;EAChC,KAAK,KAAK,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;CACvC;;;;;CAMA,oBAAoB;EAClB,MAAM,OAAO,KAAK,SAAS,UAAU;EACrC,OAAO,IAAI,cACT,KAAK,SAAS,OAAO,IAAI,GACzB,KAAK,KAAK,OAAO,IAAI,CACvB;CACF;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;EAChC,KAAK,SAAS,KAAM,IAAyB,SAAS,MAAM,CAAE;CAChE;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;EACjC,KAAK,SAAS,QAAS,IAAyB,SAAS,IAAI,CAAE;CACjE;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,EAAC,SAAQ;EACf,MAAM,EAAC,aAAY;EACnB,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG;EACzC,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;EAC5C,IAAI,KAAK,OACP,IAAI;GACF,IAAI,SAAS,GAAG,UACd,SAAS,KAAK,SAAS,GAAG,MAAM;GAElC,MAAM,SAAS,SAAS,GAAG,OAAO,KAAK,IAAI;GAG3C,KAAK,KAAK,SAAS,GAAG,OAAO;GAC7B,OAAO;EACT,UAAU;GAER,MAAM,OAAO,iBAAiB;GAC9B,IAAI,OAAO,GAAG;GACd,KAAK,IAAI,OAAO,KAAK,MAAM,KACzB,IAAI,SAAS,GAAG,KAAK,UAAU,MAC7B,IAAI,SAAS,GAAG,KAAK,WAAW,GAC9B,KAAK,SAAS,GAAG,aAAa;QACzB;IAEL,KAAK,OAAO,GAAG,CAAC;IAChB,SAAS,OAAO,GAAG,CAAC;GACtB;EAGN;EAEF,OAAO;CACT;;CAGA,SAAS,GAAW,SAA0B;EAC5C,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS;OACzB,SAAS,GAAG,KAAK,SAAS,SAAS,IAAI,GAAG,KAAK,UAAU,SAAS;IACpE,IACE,SAAS,GAAG,UAGZ,SAAS,KAAK,SAAS,GAAG,MAAM;IAElC,SAAS,GAAG,aAAa,SAAS,IAAI,IAAI,OAAO;IACjD,SAAS,OAAO,IAAI,GAAG,CAAC;IACxB,KAAK,KAAK,OAAO,IAAI,GAAG,CAAC;IACzB,KAAK,KAAK,KAAK,SAAS,GAAG,OAAO;IAClC,OAAO;GACT;;EAEF,OAAO;CACT;;;;;;CAOA,aAAa,KAAe,aAAqB;EAE/C,MAAM,YAAY,KAAK,KAAK;EAC5B,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;EAC1B,MAAM,cAAe,IAAoC;EACzD,KAAK,SAAS,KAAK,GAAG,WAAW;EAEjC,IAAI,IAAI,YAAY,CAAC,KAAK,UAGxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,YAAY,GAAG,WAAW;EAO9B,KAAK,SAAS,YAAY,GAAG,WAAW;CAC1C;AACF;AAIA,SAAS,QACP,KACA,MACA,SACA,YACQ;CACR,IAAI,KAAK;CACT,IAAI,KAAK,KAAK;CACd,IAAI,MAAM,MAAM;CAChB,OAAO,KAAK,IAAI;EACd,MAAM,IAAI,WAAW,KAAK,MAAM,GAAG;EACnC,IAAI,IAAI,GACN,KAAK,MAAM;OACN,IAAI,IAAI,GAEb,KAAK;OACA,IAAI,MAAM,GACf,OAAO;OACF;GAEL,IAAI,QAAQ,KAEV,OAAO,KAAK;GAEd,MAAM,IAAI,MAAM,uBAAuB;EACzC;EACA,MAAO,KAAK,MAAO;CACrB;CACA,OAAO,MAAM;AACf;AAGA,IAAM,YAAY,IAAI,MAAW,CAAC,CAAC;AACnC,UAAU,WAAW"}
+{"version":3,"file":"btree-set.js","names":[],"sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\ntype Comparator<K> = (a: K, b: K) => number;\n\nexport class BTreeSet<K> {\n  #root: BNode<K> = emptyLeaf as BNode<K>;\n  size: number = 0;\n\n  readonly comparator: Comparator<K>;\n\n  constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n    this.comparator = comparator;\n    if (entries) {\n      for (const key of entries) {\n        this.add(key);\n      }\n    }\n  }\n\n  /** Releases the tree so that its size is 0. */\n  clear() {\n    this.#root = emptyLeaf as BNode<K>;\n    this.size = 0;\n  }\n\n  clone() {\n    this.#root.isShared = true;\n    const ret = new BTreeSet<K>(this.comparator);\n    ret.#root = this.#root;\n    ret.size = this.size;\n    return ret;\n  }\n\n  get(key: K): K | undefined {\n    return this.#root.get(key, this);\n  }\n\n  add(key: K): this {\n    if (this.#root.isShared) this.#root = this.#root.clone();\n    const result = this.#root.set(key, this);\n    if (result === null) return this;\n    // Root node has split, so create a new root node.\n    this.#root = new BNodeInternal<K>([this.#root, result]);\n    return this;\n  }\n\n  /**\n   * Returns true if the key exists in the B+ tree, false if not.\n   * Use get() for best performance; use has() if you need to\n   * distinguish between \"undefined value\" and \"key not present\".\n   * @param key Key to detect\n   * @description Computational complexity: O(log size)\n   */\n  has(key: K): boolean {\n    return this.#root.has(key, this);\n  }\n\n  /**\n   * Removes a single key-value pair from the B+ tree.\n   * @param key Key to find\n   * @returns true if a pair was found and removed, false otherwise.\n   * @description Computational complexity: O(log size)\n   */\n  delete(key: K): boolean {\n    return this.#delete(key);\n  }\n\n  #delete(key: K): boolean {\n    let root = this.#root;\n    if (root.isShared) {\n      this.#root = root = root.clone();\n    }\n    try {\n      return root.delete(key, this);\n    } finally {\n      let isShared;\n      while (root.keys.length <= 1 && root.isInternal()) {\n        isShared ||= root.isShared;\n        this.#root = root =\n          root.keys.length === 0 ? emptyLeaf : root.children[0];\n      }\n      // If any ancestor of the new root was shared, the new root must also be shared\n      if (isShared) {\n        root.isShared = true;\n      }\n    }\n  }\n\n  keys(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  values(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n  }\n\n  valuesReversed(): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      undefined,\n      true,\n    );\n  }\n\n  valuesFromReversed(\n    highestKey?: K,\n    inclusive: boolean = true,\n  ): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      highestKey,\n      inclusive,\n    );\n  }\n\n  /** Gets the highest key in the tree. Complexity: O(1) */\n  #maxKey(): K | undefined {\n    return this.#root.maxKey();\n  }\n\n  [Symbol.iterator](): IterableIterator<K> {\n    return this.keys();\n  }\n\n  /**\n   * Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing\n   * the tree bottom-up. The caller must ensure entries are sorted by\n   * `comparator`; violating this produces an invalid tree.\n   */\n  static fromSorted<K>(\n    comparator: Comparator<K>,\n    sortedEntries: Iterable<K>,\n  ): BTreeSet<K> {\n    const tree = new BTreeSet<K>(comparator);\n\n    // Stream through entries, flushing a leaf node each time we fill MAX_NODE_SIZE keys.\n    const leaves: BNode<K>[] = [];\n    let currentKeys: K[] = [];\n    let size = 0;\n\n    for (const key of sortedEntries) {\n      currentKeys.push(key);\n      if (currentKeys.length === MAX_NODE_SIZE) {\n        leaves.push(new BNode<K>(currentKeys));\n        currentKeys = [];\n      }\n      size++;\n    }\n\n    if (currentKeys.length > 0) {\n      leaves.push(new BNode<K>(currentKeys));\n    }\n\n    if (leaves.length === 0) return tree;\n\n    tree.size = size;\n\n    if (leaves.length === 1) {\n      tree.#root = leaves[0];\n      return tree;\n    }\n\n    // Build internal nodes bottom-up until a single root remains.\n    let currentLevel: BNode<K>[] = leaves;\n    while (currentLevel.length > 1) {\n      const nextLevel: BNodeInternal<K>[] = [];\n      for (let i = 0; i < currentLevel.length; i += MAX_NODE_SIZE) {\n        nextLevel.push(\n          new BNodeInternal<K>(currentLevel.slice(i, i + MAX_NODE_SIZE)),\n        );\n      }\n      currentLevel = nextLevel;\n    }\n\n    tree.#root = currentLevel[0];\n    return tree;\n  }\n}\n\nclass BTreeForwardIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (++this.#i < this.#leaf.keys.length) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level = -1;\n      for (;;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (++this.#nodeIndex[level] < this.#nodeQueue[level].length) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = 0;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = -1;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nclass BTreeReverseIterator<K> implements IterableIterator<K> {\n  readonly #nodeQueue: BNode<K>[][];\n  readonly #nodeIndex: number[];\n  #leaf: BNode<K>;\n  #i: number;\n\n  constructor(\n    nodeQueue: BNode<K>[][],\n    nodeIndex: number[],\n    leaf: BNode<K>,\n    startI: number,\n  ) {\n    this.#nodeQueue = nodeQueue;\n    this.#nodeIndex = nodeIndex;\n    this.#leaf = leaf;\n    this.#i = startI;\n  }\n\n  next(): IteratorResult<K> {\n    for (;;) {\n      if (--this.#i >= 0) {\n        return {done: false, value: this.#leaf.keys[this.#i]};\n      }\n\n      let level;\n      // Advance to the next leaf node\n      for (level = -1; ;) {\n        if (++level >= this.#nodeQueue.length) {\n          return {done: true, value: undefined as unknown as K};\n        }\n        if (--this.#nodeIndex[level] >= 0) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        this.#nodeQueue[level - 1] = (\n          this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        this.#nodeIndex[level - 1] = this.#nodeQueue[level - 1].length - 1;\n      }\n      this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n      this.#i = this.#leaf.keys.length;\n    }\n  }\n\n  [Symbol.iterator]() {\n    return this;\n  }\n}\n\nfunction valuesFrom<K>(\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  lowestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  const info = findPath(lowestKey, root, comparator);\n  if (info === undefined) {\n    return iterator<K>(() => ({done: true, value: undefined}));\n  }\n\n  let [nodeQueue, nodeIndex, leaf] = info;\n  let i =\n    lowestKey === undefined\n      ? -1\n      : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n  if (\n    !inclusive &&\n    lowestKey !== undefined &&\n    // +1 because we did -1 above.\n    i + 1 < leaf.keys.length &&\n    comparator(leaf.keys[i + 1], lowestKey) === 0\n  ) {\n    i++;\n  }\n\n  return new BTreeForwardIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction valuesFromReversed<K>(\n  maxKey: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  highestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  if (highestKey === undefined) {\n    highestKey = maxKey;\n    if (highestKey === undefined) {\n      return iterator<K>(() => ({done: true, value: undefined}));\n    } // collection is empty\n  }\n  let [nodeQueue, nodeIndex, leaf] =\n    findPath(highestKey, root, comparator) ||\n    findPath(maxKey, root, comparator)!;\n  assert(\n    !nodeQueue[0] || leaf === nodeQueue[0][nodeIndex[0]],\n    'BTreeSet: leaf node mismatch in iteration',\n  );\n  let i = indexOf(highestKey, leaf.keys, 0, comparator);\n  if (\n    inclusive &&\n    i < leaf.keys.length &&\n    comparator(leaf.keys[i], highestKey) <= 0\n  ) {\n    i++;\n  }\n\n  return new BTreeReverseIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction findPath<K>(\n  key: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] | undefined {\n  let nextNode = root;\n  const nodeQueue: BNode<K>[][] = [];\n  const nodeIndex: number[] = [];\n\n  if (nextNode.isInternal()) {\n    for (let d = 0; nextNode.isInternal(); d++) {\n      nodeQueue[d] = nextNode.children;\n      nodeIndex[d] =\n        key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n      if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n      nextNode = nodeQueue[d][nodeIndex[d]];\n    }\n    nodeQueue.reverse();\n    nodeIndex.reverse();\n  }\n  return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n  return {\n    next,\n    [Symbol.iterator]() {\n      return this;\n    },\n  };\n}\n\n/** Leaf node / base class. **************************************************/\nclass BNode<K> {\n  // If this is an internal node, _keys[i] is the highest key in children[i].\n  keys: K[];\n  // True if this node might be within multiple `BTree`s (or have multiple parents).\n  // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n  // This is transitive: if it's true, children are also shared even if `isShared!=true`\n  // in those children. (Certain operations will propagate isShared=true to children.)\n  isShared: true | undefined;\n\n  constructor(keys: K[]) {\n    this.keys = keys;\n    this.isShared = undefined;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return false;\n  }\n\n  maxKey() {\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    return this.keys.at(-1)!;\n  }\n\n  minKey(): K | undefined {\n    return this.keys[0];\n  }\n\n  clone(): BNode<K> {\n    return new BNode<K>(this.keys.slice(0));\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i < 0 ? undefined : this.keys[i];\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i >= 0 && i < this.keys.length;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    let i = indexOf(key, this.keys, -1, tree.comparator);\n    if (i < 0) {\n      // key does not exist yet\n      i = ~i;\n      tree.size++;\n\n      if (this.keys.length < MAX_NODE_SIZE) {\n        this.keys.splice(i, 0, key);\n        return null;\n      }\n      // This leaf node is full and must split\n      const newRightSibling = this.splitOffRightSide();\n      // oxlint-disable-next-line @typescript-eslint/no-this-alias\n      let target: BNode<K> = this;\n      if (i > this.keys.length) {\n        i -= this.keys.length;\n        target = newRightSibling;\n      }\n      // target.#insertInLeaf(i, key);\n      target.keys.splice(i, 0, key);\n\n      return newRightSibling;\n    }\n\n    // usually this is a no-op, but some users may wish to edit the key\n    this.keys[i] = key;\n    return null;\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n  }\n\n  splitOffRightSide(): BNode<K> {\n    const half = this.keys.length >> 1;\n    const keys = this.keys.splice(half);\n    return new BNode<K>(keys);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const iLow = indexOf(key, this.keys, -1, cmp);\n    const iHigh = iLow + 1;\n\n    if (iLow < 0) {\n      return false;\n    }\n\n    const {keys} = this;\n    for (let i = iLow; i < iHigh; i++) {\n      const key = keys[i];\n\n      if (key !== keys[i] || this.isShared === true) {\n        throw new Error('BTree illegally changed or cloned in delete');\n      }\n\n      this.keys.splice(i, 1);\n      tree.size--;\n      return true;\n    }\n\n    return false;\n  }\n\n  mergeSibling(rhs: BNode<K>, _: number) {\n    this.keys.push(...rhs.keys);\n  }\n}\n\n/** Internal node (non-leaf node) ********************************************/\nclass BNodeInternal<K> extends BNode<K> {\n  // Note: conventionally B+ trees have one fewer key than the number of\n  // children, but I find it easier to keep the array lengths equal: each\n  // keys[i] caches the value of children[i].maxKey().\n  children: BNode<K>[];\n\n  /**\n   * This does not mark `children` as shared, so it is the responsibility of the caller\n   * to ensure children are either marked shared, or aren't included in another tree.\n   */\n  constructor(children: BNode<K>[], keys?: K[]) {\n    if (!keys) {\n      keys = [];\n      for (let i = 0; i < children.length; i++) {\n        keys[i] = children[i].maxKey();\n      }\n    }\n    super(keys);\n    this.children = children;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return true;\n  }\n\n  clone(): BNode<K> {\n    const children = this.children.slice(0);\n    for (let i = 0; i < children.length; i++) {\n      children[i].isShared = true;\n    }\n    return new BNodeInternal<K>(children, this.keys.slice(0));\n  }\n\n  minKey() {\n    return this.children[0].minKey();\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].get(key, tree) : undefined;\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].has(key, tree) : false;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    const c = this.children;\n    const cmp = tree.comparator;\n    let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n    let child = c[i];\n\n    if (child.isShared) {\n      c[i] = child = child.clone();\n    }\n    if (child.keys.length >= MAX_NODE_SIZE) {\n      // child is full; inserting anything else will cause a split.\n      // Shifting an item to the left or right sibling may avoid a split.\n      // We can do a shift if the adjacent node is not full and if the\n      // current key can still be placed in the same node after the shift.\n      let other: BNode<K>;\n      if (\n        i > 0 &&\n        (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n        cmp(child.keys[0], key) < 0\n      ) {\n        if (other.isShared) {\n          c[i - 1] = other = other.clone();\n        }\n        other.takeFromRight(child);\n        this.keys[i - 1] = other.maxKey();\n      } else if (\n        (other = c[i + 1]) !== undefined &&\n        other.keys.length < MAX_NODE_SIZE &&\n        cmp(child.maxKey(), key) < 0\n      ) {\n        if (other.isShared) c[i + 1] = other = other.clone();\n        other.takeFromLeft(child);\n        this.keys[i] = c[i].maxKey();\n      }\n    }\n\n    const result = child.set(key, tree);\n    this.keys[i] = child.maxKey();\n    if (result === null) return null;\n\n    // The child has split and `result` is a new right child... does it fit?\n    if (this.keys.length < MAX_NODE_SIZE) {\n      // yes\n      this.insert(i + 1, result);\n      return null;\n    }\n    // no, we must split also\n    const newRightSibling = this.splitOffRightSide();\n    // oxlint-disable-next-line @typescript-eslint/no-this-alias\n    let target: BNodeInternal<K> = this;\n    if (cmp(result.maxKey(), this.maxKey()) > 0) {\n      target = newRightSibling;\n      i -= this.keys.length;\n    }\n    target.insert(i + 1, result);\n    return newRightSibling;\n  }\n\n  /**\n   * Inserts `child` at index `i`.\n   * This does not mark `child` as shared, so it is the responsibility of the caller\n   * to ensure that either child is marked shared, or it is not included in another tree.\n   */\n  insert(i: number, child: BNode<K>) {\n    this.children.splice(i, 0, child);\n    this.keys.splice(i, 0, child.maxKey());\n  }\n\n  /**\n   * Split this node.\n   * Modifies this to remove the second half of the items, returning a separate node containing them.\n   */\n  splitOffRightSide() {\n    const half = this.children.length >> 1;\n    return new BNodeInternal<K>(\n      this.children.splice(half),\n      this.keys.splice(half),\n    );\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n    this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n    this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const {keys} = this;\n    const {children} = this;\n    let iLow = indexOf(key, this.keys, 0, cmp);\n    let i = iLow;\n    const iHigh = Math.min(iLow, keys.length - 1);\n    if (i <= iHigh) {\n      try {\n        if (children[i].isShared) {\n          children[i] = children[i].clone();\n        }\n        const result = children[i].delete(key, tree);\n        // Note: if children[i] is empty then keys[i]=undefined.\n        //       This is an invalid state, but it is fixed below.\n        keys[i] = children[i].maxKey();\n        return result;\n      } finally {\n        // Deletions may have occurred, so look for opportunities to merge nodes.\n        const half = MAX_NODE_SIZE >> 1;\n        if (iLow > 0) iLow--;\n        for (i = iHigh; i >= iLow; i--) {\n          if (children[i].keys.length <= half) {\n            if (children[i].keys.length !== 0) {\n              this.tryMerge(i, MAX_NODE_SIZE);\n            } else {\n              // child is empty! delete it!\n              keys.splice(i, 1);\n              children.splice(i, 1);\n            }\n          }\n        }\n      }\n    }\n    return false;\n  }\n\n  /** Merges child i with child i+1 if their combined size is not too large */\n  tryMerge(i: number, maxSize: number): boolean {\n    const {children} = this;\n    if (i >= 0 && i + 1 < children.length) {\n      if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n        if (\n          children[i].isShared\n        ) // cloned already UNLESS i is outside scan range\n        {\n          children[i] = children[i].clone();\n        }\n        children[i].mergeSibling(children[i + 1], maxSize);\n        children.splice(i + 1, 1);\n        this.keys.splice(i + 1, 1);\n        this.keys[i] = children[i].maxKey();\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Move children from `rhs` into this.\n   * `rhs` must be part of this tree, and be removed from it after this call\n   * (otherwise isShared for its children could be incorrect).\n   */\n  mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n    // assert !this.isShared;\n    const oldLength = this.keys.length;\n    this.keys.push(...rhs.keys);\n    const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n    this.children.push(...rhsChildren);\n\n    if (rhs.isShared && !this.isShared) {\n      // All children of a shared node are implicitly shared, and since their new\n      // parent is not shared, they must now be explicitly marked as shared.\n      for (let i = 0; i < rhsChildren.length; i++) {\n        rhsChildren[i].isShared = true;\n      }\n    }\n\n    // If our children are themselves almost empty due to a mass-delete,\n    // they may need to be merged too (but only the oldLength-1 and its\n    // right sibling should need this).\n    this.tryMerge(oldLength - 1, maxNodeSize);\n  }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n  key: K,\n  keys: K[],\n  failXor: number,\n  comparator: Comparator<K>,\n): number {\n  let lo = 0;\n  let hi = keys.length;\n  let mid = hi >> 1;\n  while (lo < hi) {\n    const c = comparator(keys[mid], key);\n    if (c < 0) {\n      lo = mid + 1;\n    } else if (c > 0) {\n      // key < keys[mid]\n      hi = mid;\n    } else if (c === 0) {\n      return mid;\n    } else {\n      // c is NaN or otherwise invalid\n      if (key === key) {\n        // at least the search key is not NaN\n        return keys.length;\n      }\n      throw new Error('NaN was used as a key');\n    }\n    mid = (lo + hi) >> 1;\n  }\n  return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"mappings":";;AAEA,IAAM,gBAAgB;AAItB,IAAa,WAAb,MAAa,SAAY;CACvB,QAAkB;CAClB,OAAe;CAEf;CAEA,YAAY,YAA2B,SAA+B;EACpE,KAAK,aAAa;EAClB,IAAI,SACF,KAAK,MAAM,OAAO,SAChB,KAAK,IAAI,GAAG;CAGlB;;CAGA,QAAQ;EACN,KAAK,QAAQ;EACb,KAAK,OAAO;CACd;CAEA,QAAQ;EACN,KAAK,MAAM,WAAW;EACtB,MAAM,MAAM,IAAI,SAAY,KAAK,UAAU;EAC3C,IAAI,QAAQ,KAAK;EACjB,IAAI,OAAO,KAAK;EAChB,OAAO;CACT;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;CAEA,IAAI,KAAc;EAChB,IAAI,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,MAAM,MAAM;EACvD,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK,IAAI;EACvC,IAAI,WAAW,MAAM,OAAO;EAE5B,KAAK,QAAQ,IAAI,cAAiB,CAAC,KAAK,OAAO,MAAM,CAAC;EACtD,OAAO;CACT;;;;;;;;CASA,IAAI,KAAiB;EACnB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;;;;;;;CAQA,OAAO,KAAiB;EACtB,OAAO,KAAK,QAAQ,GAAG;CACzB;CAEA,QAAQ,KAAiB;EACvB,IAAI,OAAO,KAAK;EAChB,IAAI,KAAK,UACP,KAAK,QAAQ,OAAO,KAAK,MAAM;EAEjC,IAAI;GACF,OAAO,KAAK,OAAO,KAAK,IAAI;EAC9B,UAAU;GACR,IAAI;GACJ,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,WAAW,GAAG;IACjD,aAAa,KAAK;IAClB,KAAK,QAAQ,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS;GACvD;GAEA,IAAI,UACF,KAAK,WAAW;EAEpB;CACF;CAEA,OAA4B;EAC1B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,SAA8B;EAC5B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,WAAW,WAAe,YAAqB,MAA2B;EACxE,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,WAAW,SAAS;CACrE;CAEA,iBAAsC;EACpC,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,KAAA,GACA,IACF;CACF;CAEA,mBACE,YACA,YAAqB,MACA;EACrB,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,YACA,SACF;CACF;;CAGA,UAAyB;EACvB,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK;CACnB;;;;;;CAOA,OAAO,WACL,YACA,eACa;EACb,MAAM,OAAO,IAAI,SAAY,UAAU;EAGvC,MAAM,SAAqB,CAAC;EAC5B,IAAI,cAAmB,CAAC;EACxB,IAAI,OAAO;EAEX,KAAK,MAAM,OAAO,eAAe;GAC/B,YAAY,KAAK,GAAG;GACpB,IAAI,YAAY,WAAW,eAAe;IACxC,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;IACrC,cAAc,CAAC;GACjB;GACA;EACF;EAEA,IAAI,YAAY,SAAS,GACvB,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;EAGvC,IAAI,OAAO,WAAW,GAAG,OAAO;EAEhC,KAAK,OAAO;EAEZ,IAAI,OAAO,WAAW,GAAG;GACvB,KAAK,QAAQ,OAAO;GACpB,OAAO;EACT;EAGA,IAAI,eAA2B;EAC/B,OAAO,aAAa,SAAS,GAAG;GAC9B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,eAC5C,UAAU,KACR,IAAI,cAAiB,aAAa,MAAM,GAAG,IAAI,aAAa,CAAC,CAC/D;GAEF,eAAe;EACjB;EAEA,KAAK,QAAQ,aAAa;EAC1B,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,KAAK,KAAK,MAAM,KAAK,QAC9B,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAAQ;GACZ,SAAS;IACP,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,SAAS,KAAK,WAAW,MAAM,CAAC,QACpD;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK;GAC/B;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK;EACZ;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,MAAM,GACf,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAES;GAAb,SAAoB;IAClB,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,UAAU,GAC9B;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK,KAAK,WAAW,QAAQ,EAAE,CAAC,SAAS;GACnE;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK,KAAK,MAAM,KAAK;EAC5B;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,SAAS,WACP,MACA,YACA,WACA,WACqB;CACrB,MAAM,OAAO,SAAS,WAAW,MAAM,UAAU;CACjD,IAAI,SAAS,KAAA,GACX,OAAO,gBAAmB;EAAC,MAAM;EAAM,OAAO,KAAA;CAAS,EAAE;CAG3D,IAAI,CAAC,WAAW,WAAW,QAAQ;CACnC,IAAI,IACF,cAAc,KAAA,IACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,UAAU,IAAI;CAErD,IACE,CAAC,aACD,cAAc,KAAA,KAEd,IAAI,IAAI,KAAK,KAAK,UAClB,WAAW,KAAK,KAAK,IAAI,IAAI,SAAS,MAAM,GAE5C;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;CACrB,IAAI,eAAe,KAAA,GAAW;EAC5B,aAAa;EACb,IAAI,eAAe,KAAA,GACjB,OAAO,gBAAmB;GAAC,MAAM;GAAM,OAAO,KAAA;EAAS,EAAE;CAE7D;CACA,IAAI,CAAC,WAAW,WAAW,QACzB,SAAS,YAAY,MAAM,UAAU,KACrC,SAAS,QAAQ,MAAM,UAAU;CACnC,OACE,CAAC,UAAU,MAAM,SAAS,UAAU,EAAE,CAAC,UAAU,KACjD,2CACF;CACA,IAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,UAAU;CACpD,IACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,IAAI,UAAU,KAAK,GAExC;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,SACP,KACA,MACA,YAC4E;CAC5E,IAAI,WAAW;CACf,MAAM,YAA0B,CAAC;CACjC,MAAM,YAAsB,CAAC;CAE7B,IAAI,SAAS,WAAW,GAAG;EACzB,KAAK,IAAI,IAAI,GAAG,SAAS,WAAW,GAAG,KAAK;GAC1C,UAAU,KAAK,SAAS;GACxB,UAAU,KACR,QAAQ,KAAA,IAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,UAAU;GACnE,IAAI,UAAU,MAAM,UAAU,EAAE,CAAC,QAAQ;GACzC,WAAW,UAAU,EAAE,CAAC,UAAU;EACpC;EACA,UAAU,QAAQ;EAClB,UAAU,QAAQ;CACpB;CACA,OAAO;EAAC;EAAW;EAAW;CAAQ;AACxC;AAEA,SAAS,SAAY,MAAoD;CACvE,OAAO;EACL;EACA,CAAC,OAAO,YAAY;GAClB,OAAO;EACT;CACF;AACF;;AAGA,IAAM,QAAN,MAAM,MAAS;CAEb;CAKA;CAEA,YAAY,MAAW;EACrB,KAAK,OAAO;EACZ,KAAK,WAAW,KAAA;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,SAAS;EAEP,OAAO,KAAK,KAAK,GAAG,EAAE;CACxB;CAEA,SAAwB;EACtB,OAAO,KAAK,KAAK;CACnB;CAEA,QAAkB;EAChB,OAAO,IAAI,MAAS,KAAK,KAAK,MAAM,CAAC,CAAC;CACxC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,KAAK;CACvC;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,KAAK,KAAK,IAAI,KAAK,KAAK;CACjC;CAEA,IAAI,KAAQ,MAAoC;EAC9C,IAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACnD,IAAI,IAAI,GAAG;GAET,IAAI,CAAC;GACL,KAAK;GAEL,IAAI,KAAK,KAAK,SAAS,eAAe;IACpC,KAAK,KAAK,OAAO,GAAG,GAAG,GAAG;IAC1B,OAAO;GACT;GAEA,MAAM,kBAAkB,KAAK,kBAAkB;GAE/C,IAAI,SAAmB;GACvB,IAAI,IAAI,KAAK,KAAK,QAAQ;IACxB,KAAK,KAAK,KAAK;IACf,SAAS;GACX;GAEA,OAAO,KAAK,OAAO,GAAG,GAAG,GAAG;GAE5B,OAAO;EACT;EAGA,KAAK,KAAK,KAAK;EACf,OAAO;CACT;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;CAClC;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;CACnC;CAEA,oBAA8B;EAC5B,MAAM,OAAO,KAAK,KAAK,UAAU;EACjC,MAAM,OAAO,KAAK,KAAK,OAAO,IAAI;EAClC,OAAO,IAAI,MAAS,IAAI;CAC1B;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG;EAC5C,MAAM,QAAQ,OAAO;EAErB,IAAI,OAAO,GACT,OAAO;EAGT,MAAM,EAAC,SAAQ;EACf,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK;GAGjC,IAFY,KAAK,OAEL,KAAK,MAAM,KAAK,aAAa,MACvC,MAAM,IAAI,MAAM,6CAA6C;GAG/D,KAAK,KAAK,OAAO,GAAG,CAAC;GACrB,KAAK;GACL,OAAO;EACT;EAEA,OAAO;CACT;CAEA,aAAa,KAAe,GAAW;EACrC,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;CAC5B;AACF;;AAGA,IAAM,gBAAN,MAAM,sBAAyB,MAAS;CAItC;;;;;CAMA,YAAY,UAAsB,MAAY;EAC5C,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;EAEjC;EACA,MAAM,IAAI;EACV,KAAK,WAAW;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,QAAkB;EAChB,MAAM,WAAW,KAAK,SAAS,MAAM,CAAC;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,SAAS,EAAE,CAAC,WAAW;EAEzB,OAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC;CAC1D;CAEA,SAAS;EACP,OAAO,KAAK,SAAS,EAAE,CAAC,OAAO;CACjC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI,KAAA;CAC5D;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI;CAC5D;CAEA,IAAI,KAAQ,MAAoC;EAC9C,MAAM,IAAI,KAAK;EACf,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE,SAAS,CAAC;EAC9D,IAAI,QAAQ,EAAE;EAEd,IAAI,MAAM,UACR,EAAE,KAAK,QAAQ,MAAM,MAAM;EAE7B,IAAI,MAAM,KAAK,UAAU,eAAe;GAKtC,IAAI;GACJ,IACE,IAAI,MACH,QAAQ,EAAE,IAAI,GAAA,CAAI,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,GAC1B;IACA,IAAI,MAAM,UACR,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IAEjC,MAAM,cAAc,KAAK;IACzB,KAAK,KAAK,IAAI,KAAK,MAAM,OAAO;GAClC,OAAO,KACJ,QAAQ,EAAE,IAAI,QAAQ,KAAA,KACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,OAAO,GAAG,GAAG,IAAI,GAC3B;IACA,IAAI,MAAM,UAAU,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IACnD,MAAM,aAAa,KAAK;IACxB,KAAK,KAAK,KAAK,EAAE,EAAE,CAAC,OAAO;GAC7B;EACF;EAEA,MAAM,SAAS,MAAM,IAAI,KAAK,IAAI;EAClC,KAAK,KAAK,KAAK,MAAM,OAAO;EAC5B,IAAI,WAAW,MAAM,OAAO;EAG5B,IAAI,KAAK,KAAK,SAAS,eAAe;GAEpC,KAAK,OAAO,IAAI,GAAG,MAAM;GACzB,OAAO;EACT;EAEA,MAAM,kBAAkB,KAAK,kBAAkB;EAE/C,IAAI,SAA2B;EAC/B,IAAI,IAAI,OAAO,OAAO,GAAG,KAAK,OAAO,CAAC,IAAI,GAAG;GAC3C,SAAS;GACT,KAAK,KAAK,KAAK;EACjB;EACA,OAAO,OAAO,IAAI,GAAG,MAAM;EAC3B,OAAO;CACT;;;;;;CAOA,OAAO,GAAW,OAAiB;EACjC,KAAK,SAAS,OAAO,GAAG,GAAG,KAAK;EAChC,KAAK,KAAK,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;CACvC;;;;;CAMA,oBAAoB;EAClB,MAAM,OAAO,KAAK,SAAS,UAAU;EACrC,OAAO,IAAI,cACT,KAAK,SAAS,OAAO,IAAI,GACzB,KAAK,KAAK,OAAO,IAAI,CACvB;CACF;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;EAChC,KAAK,SAAS,KAAM,IAAyB,SAAS,MAAM,CAAE;CAChE;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;EACjC,KAAK,SAAS,QAAS,IAAyB,SAAS,IAAI,CAAE;CACjE;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,EAAC,SAAQ;EACf,MAAM,EAAC,aAAY;EACnB,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG;EACzC,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;EAC5C,IAAI,KAAK,OACP,IAAI;GACF,IAAI,SAAS,EAAE,CAAC,UACd,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;GAElC,MAAM,SAAS,SAAS,EAAE,CAAC,OAAO,KAAK,IAAI;GAG3C,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;GAC7B,OAAO;EACT,UAAU;GAER,MAAM,OAAO;GACb,IAAI,OAAO,GAAG;GACd,KAAK,IAAI,OAAO,KAAK,MAAM,KACzB,IAAI,SAAS,EAAE,CAAC,KAAK,UAAU,MAAM;IACnC,IAAI,SAAS,EAAE,CAAC,KAAK,WAAW,GAC9B,KAAK,SAAS,GAAG,aAAa;SACzB;KAEL,KAAK,OAAO,GAAG,CAAC;KAChB,SAAS,OAAO,GAAG,CAAC;IACtB;GACF;EAEJ;EAEF,OAAO;CACT;;CAGA,SAAS,GAAW,SAA0B;EAC5C,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS,QACzB;OAAA,SAAS,EAAE,CAAC,KAAK,SAAS,SAAS,IAAI,EAAE,CAAC,KAAK,UAAU,SAAS;IACpE,IACE,SAAS,EAAE,CAAC,UAGZ,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;IAElC,SAAS,EAAE,CAAC,aAAa,SAAS,IAAI,IAAI,OAAO;IACjD,SAAS,OAAO,IAAI,GAAG,CAAC;IACxB,KAAK,KAAK,OAAO,IAAI,GAAG,CAAC;IACzB,KAAK,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;IAClC,OAAO;GACT;;EAEF,OAAO;CACT;;;;;;CAOA,aAAa,KAAe,aAAqB;EAE/C,MAAM,YAAY,KAAK,KAAK;EAC5B,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;EAC1B,MAAM,cAAe,IAAoC;EACzD,KAAK,SAAS,KAAK,GAAG,WAAW;EAEjC,IAAI,IAAI,YAAY,CAAC,KAAK,UAGxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,YAAY,EAAE,CAAC,WAAW;EAO9B,KAAK,SAAS,YAAY,GAAG,WAAW;CAC1C;AACF;AAIA,SAAS,QACP,KACA,MACA,SACA,YACQ;CACR,IAAI,KAAK;CACT,IAAI,KAAK,KAAK;CACd,IAAI,MAAM,MAAM;CAChB,OAAO,KAAK,IAAI;EACd,MAAM,IAAI,WAAW,KAAK,MAAM,GAAG;EACnC,IAAI,IAAI,GACN,KAAK,MAAM;OACN,IAAI,IAAI,GAEb,KAAK;OACA,IAAI,MAAM,GACf,OAAO;OACF;GAEL,IAAI,QAAQ,KAEV,OAAO,KAAK;GAEd,MAAM,IAAI,MAAM,uBAAuB;EACzC;EACA,MAAO,KAAK,MAAO;CACrB;CACA,OAAO,MAAM;AACf;AAGA,IAAM,YAAY,IAAI,MAAW,CAAC,CAAC;AACnC,UAAU,WAAW"}

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

@@ -1 +1 @@
-{"version":3,"file":"cache.js","names":["#cache","#ttlMs","#destroyed","#intervalHandle","#removeExpired"],"sources":["../../../../shared/src/cache.ts"],"sourcesContent":["/**\n * Stores values with an expiration time at time of insertion.\n * Does not update the expiration time on retrieval.\n * Values are automatically removed from the cache after the TTL expires.\n * The cache is cleaned up periodically based on the TTL so it does\n * not grow indefinitely. The cleanup interval is started lazily on the\n * first `set()` and is `unref`ed (where supported) so it never keeps\n * the process alive.\n *\n * Call `destroy()` to stop the cleanup interval and release the cached\n * values. `destroy()` is idempotent, and a destroyed cache is inert:\n * `get()` always misses, `set()` is a no-op, and the cleanup interval\n * is never restarted.\n */\nexport class TimedCache<T> {\n  readonly #cache: Map<string, {value: T; expiresAt: number}>;\n  readonly #ttlMs: number;\n  #intervalHandle: ReturnType<typeof setInterval> | undefined;\n  #destroyed = false;\n\n  constructor(ttlMs: number) {\n    this.#cache = new Map();\n    this.#ttlMs = ttlMs;\n  }\n\n  set(key: string, value: T): void {\n    if (this.#destroyed) {\n      return;\n    }\n    if (this.#intervalHandle === undefined) {\n      this.#intervalHandle = setInterval(\n        () => this.#removeExpired(),\n        this.#ttlMs * 2,\n      );\n      // In browsers setInterval returns a number, which has no unref.\n      this.#intervalHandle.unref?.();\n    }\n    this.#cache.set(key, {value, expiresAt: Date.now() + this.#ttlMs});\n  }\n\n  get(key: string): T | undefined {\n    const entry = this.#cache.get(key);\n    if (entry === undefined || entry.expiresAt < Date.now()) {\n      this.#cache.delete(key);\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  #removeExpired(): void {\n    const now = Date.now();\n    for (const [key, entry] of this.#cache.entries()) {\n      if (entry.expiresAt < now) {\n        this.#cache.delete(key);\n      }\n    }\n  }\n\n  destroy(): void {\n    this.#destroyed = true;\n    if (this.#intervalHandle !== undefined) {\n      clearInterval(this.#intervalHandle);\n      this.#intervalHandle = undefined;\n    }\n    this.#cache.clear();\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,IAAa,aAAb,MAA2B;CACzB;CACA;CACA;CACA,aAAa;CAEb,YAAY,OAAe;EACzB,KAAKA,yBAAS,IAAI,IAAI;EACtB,KAAKC,SAAS;CAChB;CAEA,IAAI,KAAa,OAAgB;EAC/B,IAAI,KAAKC,YACP;EAEF,IAAI,KAAKC,oBAAoB,KAAA,GAAW;GACtC,KAAKA,kBAAkB,kBACf,KAAKC,eAAe,GAC1B,KAAKH,SAAS,CAChB;GAEA,KAAKE,gBAAgB,QAAQ;EAC/B;EACA,KAAKH,OAAO,IAAI,KAAK;GAAC;GAAO,WAAW,KAAK,IAAI,IAAI,KAAKC;EAAM,CAAC;CACnE;CAEA,IAAI,KAA4B;EAC9B,MAAM,QAAQ,KAAKD,OAAO,IAAI,GAAG;EACjC,IAAI,UAAU,KAAA,KAAa,MAAM,YAAY,KAAK,IAAI,GAAG;GACvD,KAAKA,OAAO,OAAO,GAAG;GACtB;EACF;EACA,OAAO,MAAM;CACf;CAEA,iBAAuB;EACrB,MAAM,MAAM,KAAK,IAAI;EACrB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAKA,OAAO,QAAQ,GAC7C,IAAI,MAAM,YAAY,KACpB,KAAKA,OAAO,OAAO,GAAG;CAG5B;CAEA,UAAgB;EACd,KAAKE,aAAa;EAClB,IAAI,KAAKC,oBAAoB,KAAA,GAAW;GACtC,cAAc,KAAKA,eAAe;GAClC,KAAKA,kBAAkB,KAAA;EACzB;EACA,KAAKH,OAAO,MAAM;CACpB;AACF"}
+{"version":3,"file":"cache.js","names":[],"sources":["../../../../shared/src/cache.ts"],"sourcesContent":["/**\n * Stores values with an expiration time at time of insertion.\n * Does not update the expiration time on retrieval.\n * Values are automatically removed from the cache after the TTL expires.\n * The cache is cleaned up periodically based on the TTL so it does\n * not grow indefinitely. The cleanup interval is started lazily on the\n * first `set()` and is `unref`ed (where supported) so it never keeps\n * the process alive.\n *\n * Call `destroy()` to stop the cleanup interval and release the cached\n * values. `destroy()` is idempotent, and a destroyed cache is inert:\n * `get()` always misses, `set()` is a no-op, and the cleanup interval\n * is never restarted.\n */\nexport class TimedCache<T> {\n  readonly #cache: Map<string, {value: T; expiresAt: number}>;\n  readonly #ttlMs: number;\n  #intervalHandle: ReturnType<typeof setInterval> | undefined;\n  #destroyed = false;\n\n  constructor(ttlMs: number) {\n    this.#cache = new Map();\n    this.#ttlMs = ttlMs;\n  }\n\n  set(key: string, value: T): void {\n    if (this.#destroyed) {\n      return;\n    }\n    if (this.#intervalHandle === undefined) {\n      this.#intervalHandle = setInterval(\n        () => this.#removeExpired(),\n        this.#ttlMs * 2,\n      );\n      // In browsers setInterval returns a number, which has no unref.\n      this.#intervalHandle.unref?.();\n    }\n    this.#cache.set(key, {value, expiresAt: Date.now() + this.#ttlMs});\n  }\n\n  get(key: string): T | undefined {\n    const entry = this.#cache.get(key);\n    if (entry === undefined || entry.expiresAt < Date.now()) {\n      this.#cache.delete(key);\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  #removeExpired(): void {\n    const now = Date.now();\n    for (const [key, entry] of this.#cache.entries()) {\n      if (entry.expiresAt < now) {\n        this.#cache.delete(key);\n      }\n    }\n  }\n\n  destroy(): void {\n    this.#destroyed = true;\n    if (this.#intervalHandle !== undefined) {\n      clearInterval(this.#intervalHandle);\n      this.#intervalHandle = undefined;\n    }\n    this.#cache.clear();\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,IAAa,aAAb,MAA2B;CACzB;CACA;CACA;CACA,aAAa;CAEb,YAAY,OAAe;EACzB,KAAK,yBAAS,IAAI,IAAI;EACtB,KAAK,SAAS;CAChB;CAEA,IAAI,KAAa,OAAgB;EAC/B,IAAI,KAAK,YACP;EAEF,IAAI,KAAK,oBAAoB,KAAA,GAAW;GACtC,KAAK,kBAAkB,kBACf,KAAK,eAAe,GAC1B,KAAK,SAAS,CAChB;GAEA,KAAK,gBAAgB,QAAQ;EAC/B;EACA,KAAK,OAAO,IAAI,KAAK;GAAC;GAAO,WAAW,KAAK,IAAI,IAAI,KAAK;EAAM,CAAC;CACnE;CAEA,IAAI,KAA4B;EAC9B,MAAM,QAAQ,KAAK,OAAO,IAAI,GAAG;EACjC,IAAI,UAAU,KAAA,KAAa,MAAM,YAAY,KAAK,IAAI,GAAG;GACvD,KAAK,OAAO,OAAO,GAAG;GACtB;EACF;EACA,OAAO,MAAM;CACf;CAEA,iBAAuB;EACrB,MAAM,MAAM,KAAK,IAAI;EACrB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,GAC7C,IAAI,MAAM,YAAY,KACpB,KAAK,OAAO,OAAO,GAAG;CAG5B;CAEA,UAAgB;EACd,KAAK,aAAa;EAClB,IAAI,KAAK,oBAAoB,KAAA,GAAW;GACtC,cAAc,KAAK,eAAe;GAClC,KAAK,kBAAkB,KAAA;EACzB;EACA,KAAK,OAAO,MAAM;CACpB;AACF"}

package/out/shared/src/config.js

@@ -1,6 +1,6 @@
 //#region ../shared/src/config.ts
 var isProd = process.env.NODE_ENV === "production";
 //#endregion
-export { isProd };
+export { isProd, isProd as skipAssertJSONValue };
 
 //# sourceMappingURL=config.js.map

package/out/shared/src/custom-key-map.js.map

@@ -1 +1 @@
-{"version":3,"file":"custom-key-map.js","names":["#toKey","#map"],"sources":["../../../../shared/src/custom-key-map.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Map} that uses a custom key transformation function to convert keys\n * to a primitive type that can be used as a {@link Map} key.\n *\n * This allows for using objects as keys in a {@link Map} without worrying about\n * reference equality.\n */\nexport class CustomKeyMap<K, V> {\n  readonly [Symbol.toStringTag] = 'CustomKeyMap';\n  readonly #toKey: (key: K) => Primitive;\n  readonly #map = new Map<Primitive, readonly [K, V]>();\n\n  constructor(\n    toKey: (key: K) => Primitive,\n    iterable?: Iterable<readonly [K, V]> | null,\n  ) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const [key, value] of iterable ?? []) {\n        this.#map.set(toKey(key), [key, value]);\n      }\n    }\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(key: K): boolean {\n    return this.#map.delete(this.#toKey(key));\n  }\n\n  forEach(\n    callbackfn: (value: V, key: K, map: CustomKeyMap<K, V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    for (const [key, value] of this.#map.values()) {\n      callbackfn.call(thisArg, value, key, this);\n    }\n  }\n\n  get(key: K): V | undefined {\n    return this.#map.get(this.#toKey(key))?.[1];\n  }\n\n  has(key: K): boolean {\n    return this.#map.has(this.#toKey(key));\n  }\n\n  set(key: K, value: V): this {\n    this.#map.set(this.#toKey(key), [key, value]);\n    return this;\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): MapIterator<[K, V]> {\n    for (const entry of this.#map.values()) {\n      yield entry.slice(0, 2) as [K, V];\n    }\n  }\n\n  *keys(): MapIterator<K> {\n    for (const entry of this.#map.values()) {\n      yield entry[0];\n    }\n  }\n\n  *values(): MapIterator<V> {\n    for (const entry of this.#map.values()) {\n      yield entry[1];\n    }\n  }\n\n  [Symbol.iterator](): MapIterator<[K, V]> {\n    return this.entries();\n  }\n}\n"],"mappings":";;;;;;;;AASA,IAAa,eAAb,MAAgC;CAC9B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAgC;CAEpD,YACE,OACA,UACA;EACA,KAAKA,SAAS;EACd,IAAI,UACF,KAAK,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,GACtC,KAAKC,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;CAG5C;CAEA,QAAc;EACZ,KAAKA,KAAK,MAAM;CAClB;CAEA,OAAO,KAAiB;EACtB,OAAO,KAAKA,KAAK,OAAO,KAAKD,OAAO,GAAG,CAAC;CAC1C;CAEA,QACE,YAEA,SACM;EACN,KAAK,MAAM,CAAC,KAAK,UAAU,KAAKC,KAAK,OAAO,GAC1C,WAAW,KAAK,SAAS,OAAO,KAAK,IAAI;CAE7C;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAKA,KAAK,IAAI,KAAKD,OAAO,GAAG,CAAC,IAAI;CAC3C;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAKC,KAAK,IAAI,KAAKD,OAAO,GAAG,CAAC;CACvC;CAEA,IAAI,KAAQ,OAAgB;EAC1B,KAAKC,KAAK,IAAI,KAAKD,OAAO,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;EAC5C,OAAO;CACT;CAEA,IAAI,OAAe;EACjB,OAAO,KAAKC,KAAK;CACnB;CAEA,CAAC,UAA+B;EAC9B,KAAK,MAAM,SAAS,KAAKA,KAAK,OAAO,GACnC,MAAM,MAAM,MAAM,GAAG,CAAC;CAE1B;CAEA,CAAC,OAAuB;EACtB,KAAK,MAAM,SAAS,KAAKA,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,SAAyB;EACxB,KAAK,MAAM,SAAS,KAAKA,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,QAAQ;CACtB;AACF"}
+{"version":3,"file":"custom-key-map.js","names":[],"sources":["../../../../shared/src/custom-key-map.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Map} that uses a custom key transformation function to convert keys\n * to a primitive type that can be used as a {@link Map} key.\n *\n * This allows for using objects as keys in a {@link Map} without worrying about\n * reference equality.\n */\nexport class CustomKeyMap<K, V> {\n  readonly [Symbol.toStringTag] = 'CustomKeyMap';\n  readonly #toKey: (key: K) => Primitive;\n  readonly #map = new Map<Primitive, readonly [K, V]>();\n\n  constructor(\n    toKey: (key: K) => Primitive,\n    iterable?: Iterable<readonly [K, V]> | null,\n  ) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const [key, value] of iterable ?? []) {\n        this.#map.set(toKey(key), [key, value]);\n      }\n    }\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(key: K): boolean {\n    return this.#map.delete(this.#toKey(key));\n  }\n\n  forEach(\n    callbackfn: (value: V, key: K, map: CustomKeyMap<K, V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    for (const [key, value] of this.#map.values()) {\n      callbackfn.call(thisArg, value, key, this);\n    }\n  }\n\n  get(key: K): V | undefined {\n    return this.#map.get(this.#toKey(key))?.[1];\n  }\n\n  has(key: K): boolean {\n    return this.#map.has(this.#toKey(key));\n  }\n\n  set(key: K, value: V): this {\n    this.#map.set(this.#toKey(key), [key, value]);\n    return this;\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): MapIterator<[K, V]> {\n    for (const entry of this.#map.values()) {\n      yield entry.slice(0, 2) as [K, V];\n    }\n  }\n\n  *keys(): MapIterator<K> {\n    for (const entry of this.#map.values()) {\n      yield entry[0];\n    }\n  }\n\n  *values(): MapIterator<V> {\n    for (const entry of this.#map.values()) {\n      yield entry[1];\n    }\n  }\n\n  [Symbol.iterator](): MapIterator<[K, V]> {\n    return this.entries();\n  }\n}\n"],"mappings":";;;;;;;;AASA,IAAa,eAAb,MAAgC;CAC9B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAgC;CAEpD,YACE,OACA,UACA;EACA,KAAK,SAAS;EACd,IAAI,UACF,KAAK,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,GACtC,KAAK,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;CAG5C;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;CAEA,OAAO,KAAiB;EACtB,OAAO,KAAK,KAAK,OAAO,KAAK,OAAO,GAAG,CAAC;CAC1C;CAEA,QACE,YAEA,SACM;EACN,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,KAAK,OAAO,GAC1C,WAAW,KAAK,SAAS,OAAO,KAAK,IAAI;CAE7C;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC,CAAC,GAAG;CAC3C;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC;CACvC;CAEA,IAAI,KAAQ,OAAgB;EAC1B,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;EAC5C,OAAO;CACT;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,CAAC,UAA+B;EAC9B,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,MAAM,MAAM,GAAG,CAAC;CAE1B;CAEA,CAAC,OAAuB;EACtB,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,SAAyB;EACxB,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,QAAQ;CACtB;AACF"}

package/out/shared/src/custom-key-set.js.map

@@ -1 +1 @@
-{"version":3,"file":"custom-key-set.js","names":["#toKey","#map"],"sources":["../../../../shared/src/custom-key-set.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Set} that uses a custom value transformation function to convert values\n * to a primitive type that can be used as a {@link Set} value.\n *\n * This allows for using objects as values in a {@link Set} without worrying about\n * reference equality.\n */\n\nexport class CustomKeySet<V> {\n  readonly [Symbol.toStringTag] = 'CustomKeySet';\n  readonly #toKey: (value: V) => Primitive;\n  readonly #map = new Map<Primitive, V>();\n\n  constructor(toKey: (value: V) => Primitive, iterable?: Iterable<V> | null) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const value of iterable ?? []) {\n        this.#map.set(toKey(value), value);\n      }\n    }\n  }\n\n  add(value: V): this {\n    this.#map.set(this.#toKey(value), value);\n    return this;\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(value: V): boolean {\n    return this.#map.delete(this.#toKey(value));\n  }\n\n  forEach(\n    callbackfn: (value: V, value2: V, set: CustomKeySet<V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    this.#map.forEach(value => {\n      callbackfn.call(thisArg, value, value, this);\n    });\n  }\n\n  has(value: V): boolean {\n    return this.#map.has(this.#toKey(value));\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): IterableIterator<[V, V]> {\n    for (const value of this.#map.values()) {\n      yield [value, value];\n    }\n  }\n\n  keys(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  values(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  [Symbol.iterator](): IterableIterator<V> {\n    return this.#map.values();\n  }\n}\n"],"mappings":";;;;;;;;AAUA,IAAa,eAAb,MAA6B;CAC3B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAkB;CAEtC,YAAY,OAAgC,UAA+B;EACzE,KAAKA,SAAS;EACd,IAAI,UACF,KAAK,MAAM,SAAS,YAAY,CAAC,GAC/B,KAAKC,KAAK,IAAI,MAAM,KAAK,GAAG,KAAK;CAGvC;CAEA,IAAI,OAAgB;EAClB,KAAKA,KAAK,IAAI,KAAKD,OAAO,KAAK,GAAG,KAAK;EACvC,OAAO;CACT;CAEA,QAAc;EACZ,KAAKC,KAAK,MAAM;CAClB;CAEA,OAAO,OAAmB;EACxB,OAAO,KAAKA,KAAK,OAAO,KAAKD,OAAO,KAAK,CAAC;CAC5C;CAEA,QACE,YAEA,SACM;EACN,KAAKC,KAAK,SAAQ,UAAS;GACzB,WAAW,KAAK,SAAS,OAAO,OAAO,IAAI;EAC7C,CAAC;CACH;CAEA,IAAI,OAAmB;EACrB,OAAO,KAAKA,KAAK,IAAI,KAAKD,OAAO,KAAK,CAAC;CACzC;CAEA,IAAI,OAAe;EACjB,OAAO,KAAKC,KAAK;CACnB;CAEA,CAAC,UAAoC;EACnC,KAAK,MAAM,SAAS,KAAKA,KAAK,OAAO,GACnC,MAAM,CAAC,OAAO,KAAK;CAEvB;CAEA,OAA4B;EAC1B,OAAO,KAAKA,KAAK,OAAO;CAC1B;CAEA,SAA8B;EAC5B,OAAO,KAAKA,KAAK,OAAO;CAC1B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAKA,KAAK,OAAO;CAC1B;AACF"}
+{"version":3,"file":"custom-key-set.js","names":[],"sources":["../../../../shared/src/custom-key-set.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Set} that uses a custom value transformation function to convert values\n * to a primitive type that can be used as a {@link Set} value.\n *\n * This allows for using objects as values in a {@link Set} without worrying about\n * reference equality.\n */\n\nexport class CustomKeySet<V> {\n  readonly [Symbol.toStringTag] = 'CustomKeySet';\n  readonly #toKey: (value: V) => Primitive;\n  readonly #map = new Map<Primitive, V>();\n\n  constructor(toKey: (value: V) => Primitive, iterable?: Iterable<V> | null) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const value of iterable ?? []) {\n        this.#map.set(toKey(value), value);\n      }\n    }\n  }\n\n  add(value: V): this {\n    this.#map.set(this.#toKey(value), value);\n    return this;\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(value: V): boolean {\n    return this.#map.delete(this.#toKey(value));\n  }\n\n  forEach(\n    callbackfn: (value: V, value2: V, set: CustomKeySet<V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    this.#map.forEach(value => {\n      callbackfn.call(thisArg, value, value, this);\n    });\n  }\n\n  has(value: V): boolean {\n    return this.#map.has(this.#toKey(value));\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): IterableIterator<[V, V]> {\n    for (const value of this.#map.values()) {\n      yield [value, value];\n    }\n  }\n\n  keys(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  values(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  [Symbol.iterator](): IterableIterator<V> {\n    return this.#map.values();\n  }\n}\n"],"mappings":";;;;;;;;AAUA,IAAa,eAAb,MAA6B;CAC3B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAkB;CAEtC,YAAY,OAAgC,UAA+B;EACzE,KAAK,SAAS;EACd,IAAI,UACF,KAAK,MAAM,SAAS,YAAY,CAAC,GAC/B,KAAK,KAAK,IAAI,MAAM,KAAK,GAAG,KAAK;CAGvC;CAEA,IAAI,OAAgB;EAClB,KAAK,KAAK,IAAI,KAAK,OAAO,KAAK,GAAG,KAAK;EACvC,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;CAEA,OAAO,OAAmB;EACxB,OAAO,KAAK,KAAK,OAAO,KAAK,OAAO,KAAK,CAAC;CAC5C;CAEA,QACE,YAEA,SACM;EACN,KAAK,KAAK,SAAQ,UAAS;GACzB,WAAW,KAAK,SAAS,OAAO,OAAO,IAAI;EAC7C,CAAC;CACH;CAEA,IAAI,OAAmB;EACrB,OAAO,KAAK,KAAK,IAAI,KAAK,OAAO,KAAK,CAAC;CACzC;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,CAAC,UAAoC;EACnC,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,CAAC,OAAO,KAAK;CAEvB;CAEA,OAA4B;EAC1B,OAAO,KAAK,KAAK,OAAO;CAC1B;CAEA,SAA8B;EAC5B,OAAO,KAAK,KAAK,OAAO;CAC1B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK,OAAO;CAC1B;AACF"}

package/out/shared/src/deep-clone.js

@@ -30,6 +30,6 @@ function internalDeepClone(value, seen) {
 	}
 }
 //#endregion
-export { deepClone };
+export { deepClone, internalDeepClone };
 
 //# sourceMappingURL=deep-clone.js.map

package/out/shared/src/document-visible.js.map

@@ -1 +1 @@
-{"version":3,"file":"document-visible.js","names":["#doc","#hiddenIntervalMS","#promises","#onVisibilityChange","#timeoutID","#setVisibilityState","#waitFor"],"sources":["../../../../shared/src/document-visible.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\n\ntype PartialDocument = Pick<\n  Document,\n  'visibilityState' | 'addEventListener' | 'removeEventListener'\n>;\n\nexport function getDocumentVisibilityWatcher(\n  doc: PartialDocument | undefined,\n  hiddenIntervalMS: number,\n  signal: AbortSignal,\n): DocumentVisibilityWatcher {\n  return doc\n    ? new DocumentVisibilityWatcherImpl(doc, hiddenIntervalMS, signal)\n    : new DocumentVisibilityWatcherNoDoc();\n}\n\nexport interface DocumentVisibilityWatcher {\n  readonly visibilityState: DocumentVisibilityState;\n  waitForVisible(): Promise<unknown>;\n  waitForHidden(): Promise<unknown>;\n}\n\nclass DocumentVisibilityWatcherImpl implements DocumentVisibilityWatcher {\n  readonly #doc: PartialDocument;\n  readonly #hiddenIntervalMS: number;\n  #timeoutID: ReturnType<typeof setTimeout> | 0 = 0;\n\n  // This trails doc.visibilityState by hiddenIntervalMS when being hidden. This\n  // is because we want to wait for the tab to be hidden for a while before\n  // considering as hidden.\n  visibilityState: DocumentVisibilityState;\n\n  readonly #promises = new Set<{\n    resolve: () => void;\n    state: DocumentVisibilityState;\n  }>();\n\n  constructor(\n    doc: PartialDocument,\n    hiddenIntervalMS: number,\n    signal: AbortSignal,\n  ) {\n    this.#doc = doc;\n    this.#hiddenIntervalMS = hiddenIntervalMS;\n    this.visibilityState = doc.visibilityState;\n    // Safari got support for abort signal in addEventListener in version\n    // 15 (Released 2021-09-20)\n    this.#doc.addEventListener('visibilitychange', this.#onVisibilityChange, {\n      signal,\n    });\n  }\n\n  #onVisibilityChange = () => {\n    if (this.#doc.visibilityState === 'visible') {\n      clearTimeout(this.#timeoutID);\n      this.#setVisibilityState('visible');\n    } else {\n      this.#timeoutID = setTimeout(() => {\n        this.#setVisibilityState('hidden');\n      }, this.#hiddenIntervalMS);\n    }\n  };\n\n  #setVisibilityState(visibilityState: DocumentVisibilityState) {\n    if (visibilityState === this.visibilityState) {\n      return;\n    }\n    this.visibilityState = visibilityState;\n    for (const entry of this.#promises) {\n      const {resolve, state} = entry;\n      if (state === visibilityState) {\n        resolve();\n        this.#promises.delete(entry);\n      }\n    }\n  }\n\n  waitForVisible(): Promise<unknown> {\n    return this.#waitFor('visible');\n  }\n\n  waitForHidden(): Promise<unknown> {\n    return this.#waitFor('hidden');\n  }\n\n  #waitFor(state: DocumentVisibilityState): Promise<unknown> {\n    if (this.visibilityState === state) {\n      return Promise.resolve();\n    }\n\n    const {promise, resolve} = resolver();\n    this.#promises.add({resolve, state});\n    return promise;\n  }\n}\n\nconst resolvedPromise = Promise.resolve();\nconst promiseThatNeverResolves = new Promise(() => undefined);\n\nclass DocumentVisibilityWatcherNoDoc implements DocumentVisibilityWatcher {\n  readonly visibilityState: DocumentVisibilityState = 'visible';\n  waitForVisible(): Promise<unknown> {\n    return resolvedPromise;\n  }\n\n  waitForHidden(): Promise<unknown> {\n    return promiseThatNeverResolves;\n  }\n}\n"],"mappings":";;AAOA,SAAgB,6BACd,KACA,kBACA,QAC2B;CAC3B,OAAO,MACH,IAAI,8BAA8B,KAAK,kBAAkB,MAAM,IAC/D,IAAI,+BAA+B;AACzC;AAQA,IAAM,gCAAN,MAAyE;CACvE;CACA;CACA,aAAgD;CAKhD;CAEA,4BAAqB,IAAI,IAGtB;CAEH,YACE,KACA,kBACA,QACA;EACA,KAAKA,OAAO;EACZ,KAAKC,oBAAoB;EACzB,KAAK,kBAAkB,IAAI;EAG3B,KAAKD,KAAK,iBAAiB,oBAAoB,KAAKG,qBAAqB,EACvE,OACF,CAAC;CACH;CAEA,4BAA4B;EAC1B,IAAI,KAAKH,KAAK,oBAAoB,WAAW;GAC3C,aAAa,KAAKI,UAAU;GAC5B,KAAKC,oBAAoB,SAAS;EACpC,OACE,KAAKD,aAAa,iBAAiB;GACjC,KAAKC,oBAAoB,QAAQ;EACnC,GAAG,KAAKJ,iBAAiB;CAE7B;CAEA,oBAAoB,iBAA0C;EAC5D,IAAI,oBAAoB,KAAK,iBAC3B;EAEF,KAAK,kBAAkB;EACvB,KAAK,MAAM,SAAS,KAAKC,WAAW;GAClC,MAAM,EAAC,SAAS,UAAS;GACzB,IAAI,UAAU,iBAAiB;IAC7B,QAAQ;IACR,KAAKA,UAAU,OAAO,KAAK;GAC7B;EACF;CACF;CAEA,iBAAmC;EACjC,OAAO,KAAKI,SAAS,SAAS;CAChC;CAEA,gBAAkC;EAChC,OAAO,KAAKA,SAAS,QAAQ;CAC/B;CAEA,SAAS,OAAkD;EACzD,IAAI,KAAK,oBAAoB,OAC3B,OAAO,QAAQ,QAAQ;EAGzB,MAAM,EAAC,SAAS,YAAW,SAAS;EACpC,KAAKJ,UAAU,IAAI;GAAC;GAAS;EAAK,CAAC;EACnC,OAAO;CACT;AACF;AAEA,IAAM,kBAAkB,QAAQ,QAAQ;AACxC,IAAM,2BAA2B,IAAI,cAAc,KAAA,CAAS;AAE5D,IAAM,iCAAN,MAA0E;CACxE,kBAAoD;CACpD,iBAAmC;EACjC,OAAO;CACT;CAEA,gBAAkC;EAChC,OAAO;CACT;AACF"}
+{"version":3,"file":"document-visible.js","names":[],"sources":["../../../../shared/src/document-visible.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\n\ntype PartialDocument = Pick<\n  Document,\n  'visibilityState' | 'addEventListener' | 'removeEventListener'\n>;\n\nexport function getDocumentVisibilityWatcher(\n  doc: PartialDocument | undefined,\n  hiddenIntervalMS: number,\n  signal: AbortSignal,\n): DocumentVisibilityWatcher {\n  return doc\n    ? new DocumentVisibilityWatcherImpl(doc, hiddenIntervalMS, signal)\n    : new DocumentVisibilityWatcherNoDoc();\n}\n\nexport interface DocumentVisibilityWatcher {\n  readonly visibilityState: DocumentVisibilityState;\n  waitForVisible(): Promise<unknown>;\n  waitForHidden(): Promise<unknown>;\n}\n\nclass DocumentVisibilityWatcherImpl implements DocumentVisibilityWatcher {\n  readonly #doc: PartialDocument;\n  readonly #hiddenIntervalMS: number;\n  #timeoutID: ReturnType<typeof setTimeout> | 0 = 0;\n\n  // This trails doc.visibilityState by hiddenIntervalMS when being hidden. This\n  // is because we want to wait for the tab to be hidden for a while before\n  // considering as hidden.\n  visibilityState: DocumentVisibilityState;\n\n  readonly #promises = new Set<{\n    resolve: () => void;\n    state: DocumentVisibilityState;\n  }>();\n\n  constructor(\n    doc: PartialDocument,\n    hiddenIntervalMS: number,\n    signal: AbortSignal,\n  ) {\n    this.#doc = doc;\n    this.#hiddenIntervalMS = hiddenIntervalMS;\n    this.visibilityState = doc.visibilityState;\n    // Safari got support for abort signal in addEventListener in version\n    // 15 (Released 2021-09-20)\n    this.#doc.addEventListener('visibilitychange', this.#onVisibilityChange, {\n      signal,\n    });\n  }\n\n  #onVisibilityChange = () => {\n    if (this.#doc.visibilityState === 'visible') {\n      clearTimeout(this.#timeoutID);\n      this.#setVisibilityState('visible');\n    } else {\n      this.#timeoutID = setTimeout(() => {\n        this.#setVisibilityState('hidden');\n      }, this.#hiddenIntervalMS);\n    }\n  };\n\n  #setVisibilityState(visibilityState: DocumentVisibilityState) {\n    if (visibilityState === this.visibilityState) {\n      return;\n    }\n    this.visibilityState = visibilityState;\n    for (const entry of this.#promises) {\n      const {resolve, state} = entry;\n      if (state === visibilityState) {\n        resolve();\n        this.#promises.delete(entry);\n      }\n    }\n  }\n\n  waitForVisible(): Promise<unknown> {\n    return this.#waitFor('visible');\n  }\n\n  waitForHidden(): Promise<unknown> {\n    return this.#waitFor('hidden');\n  }\n\n  #waitFor(state: DocumentVisibilityState): Promise<unknown> {\n    if (this.visibilityState === state) {\n      return Promise.resolve();\n    }\n\n    const {promise, resolve} = resolver();\n    this.#promises.add({resolve, state});\n    return promise;\n  }\n}\n\nconst resolvedPromise = Promise.resolve();\nconst promiseThatNeverResolves = new Promise(() => undefined);\n\nclass DocumentVisibilityWatcherNoDoc implements DocumentVisibilityWatcher {\n  readonly visibilityState: DocumentVisibilityState = 'visible';\n  waitForVisible(): Promise<unknown> {\n    return resolvedPromise;\n  }\n\n  waitForHidden(): Promise<unknown> {\n    return promiseThatNeverResolves;\n  }\n}\n"],"mappings":";;AAOA,SAAgB,6BACd,KACA,kBACA,QAC2B;CAC3B,OAAO,MACH,IAAI,8BAA8B,KAAK,kBAAkB,MAAM,IAC/D,IAAI,+BAA+B;AACzC;AAQA,IAAM,gCAAN,MAAyE;CACvE;CACA;CACA,aAAgD;CAKhD;CAEA,4BAAqB,IAAI,IAGtB;CAEH,YACE,KACA,kBACA,QACA;EACA,KAAK,OAAO;EACZ,KAAK,oBAAoB;EACzB,KAAK,kBAAkB,IAAI;EAG3B,KAAK,KAAK,iBAAiB,oBAAoB,KAAK,qBAAqB,EACvE,OACF,CAAC;CACH;CAEA,4BAA4B;EAC1B,IAAI,KAAK,KAAK,oBAAoB,WAAW;GAC3C,aAAa,KAAK,UAAU;GAC5B,KAAK,oBAAoB,SAAS;EACpC,OACE,KAAK,aAAa,iBAAiB;GACjC,KAAK,oBAAoB,QAAQ;EACnC,GAAG,KAAK,iBAAiB;CAE7B;CAEA,oBAAoB,iBAA0C;EAC5D,IAAI,oBAAoB,KAAK,iBAC3B;EAEF,KAAK,kBAAkB;EACvB,KAAK,MAAM,SAAS,KAAK,WAAW;GAClC,MAAM,EAAC,SAAS,UAAS;GACzB,IAAI,UAAU,iBAAiB;IAC7B,QAAQ;IACR,KAAK,UAAU,OAAO,KAAK;GAC7B;EACF;CACF;CAEA,iBAAmC;EACjC,OAAO,KAAK,SAAS,SAAS;CAChC;CAEA,gBAAkC;EAChC,OAAO,KAAK,SAAS,QAAQ;CAC/B;CAEA,SAAS,OAAkD;EACzD,IAAI,KAAK,oBAAoB,OAC3B,OAAO,QAAQ,QAAQ;EAGzB,MAAM,EAAC,SAAS,YAAW,SAAS;EACpC,KAAK,UAAU,IAAI;GAAC;GAAS;EAAK,CAAC;EACnC,OAAO;CACT;AACF;AAEA,IAAM,kBAAkB,QAAQ,QAAQ;AACxC,IAAM,2BAA2B,IAAI,cAAc,KAAA,CAAS;AAE5D,IAAM,iCAAN,MAA0E;CACxE,kBAAoD;CACpD,iBAAmC;EACjC,OAAO;CACT;CAEA,gBAAkC;EAChC,OAAO;CACT;AACF"}

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

@@ -1 +1 @@
-{"version":3,"file":"dotenv.js","names":[],"sources":["../../../../shared/src/dotenv.ts"],"sourcesContent":["import {config as dotenvxConfig} from '@dotenvx/dotenvx';\n\n// Import env vars from .env file if present but don't whine if not present.\n// Also no free marketing for dotenvx.\ndotenvxConfig({\n  ignore: ['MISSING_ENV_FILE'],\n  quiet: true,\n});\n"],"mappings":";;AAIA,OAAc;CACZ,QAAQ,CAAC,kBAAkB;CAC3B,OAAO;AACT,CAAC"}
+{"version":3,"file":"dotenv.js","names":["dotenvxConfig"],"sources":["../../../../shared/src/dotenv.ts"],"sourcesContent":["import {config as dotenvxConfig} from '@dotenvx/dotenvx';\n\n// Import env vars from .env file if present but don't whine if not present.\n// Also no free marketing for dotenvx.\ndotenvxConfig({\n  ignore: ['MISSING_ENV_FILE'],\n  quiet: true,\n});\n"],"mappings":";;AAIAA,OAAc;CACZ,QAAQ,CAAC,kBAAkB;CAC3B,OAAO;AACT,CAAC"}

package/out/shared/src/error.js

@@ -41,7 +41,7 @@ function getErrorMessageInternal(error, seen) {
 */
 function getErrorCauses(error) {
 	const causes = [];
-	const seen = new Set([error]);
+	const seen = /* @__PURE__ */ new Set([error]);
 	let current = error;
 	for (;;) {
 		const cause = readCause(current);

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\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,uBAAO,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.js

@@ -8,7 +8,7 @@ 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 stripes = /* @__PURE__ */ new Int32Array(16);
 var digests = new Uint32Array(MAX_WORDS);
 var encoder;
 /**
@@ -115,6 +115,6 @@ function wide(str, words) {
 	return wideView.getBigUint64(0) << 64n | wideView.getBigUint64(8);
 }
 //#endregion
-export { h128, h32, h64 };
+export { PRIME32_1, PRIME32_5, avalanche32, h128, h32, h64, round32 };
 
 //# sourceMappingURL=hash.js.map

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 * 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"}
+{"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,0BAAU,IAAI,WAAW,EAAa;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,CAAC,CAAC;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.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":[],"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,SAAS,CAAC;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,KAAK,YAAY,SAAS,OAAO,SAAS,CAAC;CAC7C;CAEA,OAA0B;EACxB,OAAO,KAAK,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,CAAC,CAAC,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/json-schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"json-schema.js","names":[],"sources":["../../../../shared/src/json-schema.ts"],"sourcesContent":["import * as valita from '@badrap/valita';\nimport {skipAssertJSONValue} from './config.ts';\nimport type {ReadonlyJSONObject, ReadonlyJSONValue} from './json.ts';\nimport {isJSONObject, isJSONValue} from './json.ts';\nimport * as v from './valita.ts';\n\n// Re-exported so that inferred schema types stay nameable from modules that\n// import `jsonSchema` without also importing `./json.ts`.\nexport type {ReadonlyJSONObject, ReadonlyJSONValue} from './json.ts';\n\nconst path: (string | number)[] = [];\n\nexport const jsonSchema: valita.Type<ReadonlyJSONValue> = v\n  .unknown()\n  .chain(v => {\n    if (skipAssertJSONValue) {\n      return valita.ok(v as ReadonlyJSONValue);\n    }\n    const rv = isJSONValue(v, path)\n      ? valita.ok(v)\n      : valita.err({\n          message: `Not a JSON value`,\n          path: path.slice(),\n        });\n    path.length = 0;\n    return rv;\n  });\n\nexport const jsonObjectSchema: valita.Type<ReadonlyJSONObject> = v\n  .unknown()\n  .chain(v => {\n    if (skipAssertJSONValue) {\n      return valita.ok(v as ReadonlyJSONObject);\n    }\n    const rv = isJSONObject(v, path)\n      ? valita.ok(v)\n      : valita.err({\n          message: `Not a JSON object`,\n          path: path.slice(),\n        });\n    path.length = 0;\n    return rv;\n  });\n"],"mappings":";;;;;AAUA,IAAM,OAA4B,CAAC;AAEnC,IAAa,aAA6C,eACvD,QAAQ,EACR,OAAM,MAAK;CACV,IAAI,QACF,OAAO,OAAO,GAAG,CAAsB;CAEzC,MAAM,KAAK,YAAY,GAAG,IAAI,IAC1B,OAAO,GAAG,CAAC,IACX,OAAO,IAAI;EACT,SAAS;EACT,MAAM,KAAK,MAAM;CACnB,CAAC;CACL,KAAK,SAAS;CACd,OAAO;AACT,CAAC;AAEH,IAAa,mBAAoD,eAC9D,QAAQ,EACR,OAAM,MAAK;CACV,IAAI,QACF,OAAO,OAAO,GAAG,CAAuB;CAE1C,MAAM,KAAK,aAAa,GAAG,IAAI,IAC3B,OAAO,GAAG,CAAC,IACX,OAAO,IAAI;EACT,SAAS;EACT,MAAM,KAAK,MAAM;CACnB,CAAC;CACL,KAAK,SAAS;CACd,OAAO;AACT,CAAC"}
+{"version":3,"file":"json-schema.js","names":["v","skipAssertJSONValue"],"sources":["../../../../shared/src/json-schema.ts"],"sourcesContent":["import * as valita from '@badrap/valita';\nimport {skipAssertJSONValue} from './config.ts';\nimport type {ReadonlyJSONObject, ReadonlyJSONValue} from './json.ts';\nimport {isJSONObject, isJSONValue} from './json.ts';\nimport * as v from './valita.ts';\n\n// Re-exported so that inferred schema types stay nameable from modules that\n// import `jsonSchema` without also importing `./json.ts`.\nexport type {ReadonlyJSONObject, ReadonlyJSONValue} from './json.ts';\n\nconst path: (string | number)[] = [];\n\nexport const jsonSchema: valita.Type<ReadonlyJSONValue> = v\n  .unknown()\n  .chain(v => {\n    if (skipAssertJSONValue) {\n      return valita.ok(v as ReadonlyJSONValue);\n    }\n    const rv = isJSONValue(v, path)\n      ? valita.ok(v)\n      : valita.err({\n          message: `Not a JSON value`,\n          path: path.slice(),\n        });\n    path.length = 0;\n    return rv;\n  });\n\nexport const jsonObjectSchema: valita.Type<ReadonlyJSONObject> = v\n  .unknown()\n  .chain(v => {\n    if (skipAssertJSONValue) {\n      return valita.ok(v as ReadonlyJSONObject);\n    }\n    const rv = isJSONObject(v, path)\n      ? valita.ok(v)\n      : valita.err({\n          message: `Not a JSON object`,\n          path: path.slice(),\n        });\n    path.length = 0;\n    return rv;\n  });\n"],"mappings":";;;;;AAUA,IAAM,OAA4B,CAAC;AAEnC,IAAa,aAA6CA,eACvD,QAAQ,CAAC,CACT,OAAM,MAAK;CACV,IAAIC,QACF,OAAO,OAAO,GAAG,CAAsB;CAEzC,MAAM,KAAK,YAAY,GAAG,IAAI,IAC1B,OAAO,GAAG,CAAC,IACX,OAAO,IAAI;EACT,SAAS;EACT,MAAM,KAAK,MAAM;CACnB,CAAC;CACL,KAAK,SAAS;CACd,OAAO;AACT,CAAC;AAEH,IAAa,mBAAoDD,eAC9D,QAAQ,CAAC,CACT,OAAM,MAAK;CACV,IAAIC,QACF,OAAO,OAAO,GAAG,CAAuB;CAE1C,MAAM,KAAK,aAAa,GAAG,IAAI,IAC3B,OAAO,GAAG,CAAC,IACX,OAAO,IAAI;EACT,SAAS;EACT,MAAM,KAAK,MAAM;CACnB,CAAC;CACL,KAAK,SAAS;CACd,OAAO;AACT,CAAC"}