@rocicorp/zero 0.26.1-canary.9 → 0.26.2-canary.1

package/out/shared/src/record-proxy.js

@@ -1,59 +1,70 @@
-const missing = Symbol();
-class RecordProxyHandler {
-  #toValue;
-  #onMissing;
-  #cache = /* @__PURE__ */ new Map();
-  /**
-   * @param toValue - Function to transform source values to destination values
-   * @param onMissing - Optional function called when accessing a non-existent
-   *   property. Can throw an error if desired.
-   */
-  constructor(toValue, onMissing) {
-    this.#toValue = toValue;
-    this.#onMissing = onMissing;
-  }
-  #getOwnValue(target, prop) {
-    const v = this.#cache.get(prop);
-    if (v !== void 0) {
-      return v;
-    }
-    if (Object.hasOwn(target, prop)) {
-      const value = this.#toValue(target[prop], prop);
-      this.#cache.set(prop, value);
-      return value;
-    }
-    return missing;
-  }
-  get(target, prop) {
-    if (typeof prop !== "string") {
-      return void 0;
-    }
-    const ownValue = this.#getOwnValue(target, prop);
-    if (ownValue !== missing) {
-      return ownValue;
-    }
-    this.#onMissing?.(prop);
-    return target[prop];
-  }
-  getOwnPropertyDescriptor(target, p) {
-    if (typeof p !== "string") {
-      return void 0;
-    }
-    const value = this.#getOwnValue(target, p);
-    if (value === missing) {
-      return void 0;
-    }
-    const desc = Reflect.getOwnPropertyDescriptor(target, p);
-    return { ...desc, value };
-  }
-}
+//#region ../shared/src/record-proxy.ts
+var missing = Symbol();
+/**
+* A proxy handler that lazily transforms and caches record values.
+*
+* When a property is accessed, the handler transforms the source value using
+* the provided `toValue` function and caches the result. Subsequent accesses
+* return the cached value without re-transforming.
+*
+* @template Source - The type of values in the source record
+* @template Dest - The type of transformed values
+*/
+var RecordProxyHandler = class {
+	#toValue;
+	#onMissing;
+	#cache = /* @__PURE__ */ new Map();
+	/**
+	* @param toValue - Function to transform source values to destination values
+	* @param onMissing - Optional function called when accessing a non-existent
+	*   property. Can throw an error if desired.
+	*/
+	constructor(toValue, onMissing) {
+		this.#toValue = toValue;
+		this.#onMissing = onMissing;
+	}
+	#getOwnValue(target, prop) {
+		const v = this.#cache.get(prop);
+		if (v !== void 0) return v;
+		if (Object.hasOwn(target, prop)) {
+			const value = this.#toValue(target[prop], prop);
+			this.#cache.set(prop, value);
+			return value;
+		}
+		return missing;
+	}
+	get(target, prop) {
+		if (typeof prop !== "string") return;
+		const ownValue = this.#getOwnValue(target, prop);
+		if (ownValue !== missing) return ownValue;
+		this.#onMissing?.(prop);
+		return target[prop];
+	}
+	getOwnPropertyDescriptor(target, p) {
+		if (typeof p !== "string") return;
+		const value = this.#getOwnValue(target, p);
+		if (value === missing) return;
+		return {
+			...Reflect.getOwnPropertyDescriptor(target, p),
+			value
+		};
+	}
+};
+/**
+* Creates a proxy that lazily transforms and caches record values.
+*
+* @template Source - The type of values in the source record
+* @template Dest - The type of transformed values
+* @param target - The source record to proxy
+* @param toValue - Function to transform source values to destination values
+* @param onMissing - Optional function called when accessing a non-existent
+*   property. Can throw an error if desired.
+* @returns A proxy that presents transformed values
+*/
 function recordProxy(target, toValue, onMissing) {
-  return new Proxy(
-    target,
-    new RecordProxyHandler(toValue, onMissing)
-  );
+	return new Proxy(target, new RecordProxyHandler(toValue, onMissing));
 }
-export {
-  recordProxy
-};
-//# sourceMappingURL=record-proxy.js.map
+//#endregion
+export { recordProxy };
+
+//# sourceMappingURL=record-proxy.js.map

package/out/shared/src/record-proxy.js.map

@@ -1 +1 @@
-{"version":3,"file":"record-proxy.js","sources":["../../../../shared/src/record-proxy.ts"],"sourcesContent":["const missing = Symbol();\n\n/**\n * A proxy handler that lazily transforms and caches record values.\n *\n * When a property is accessed, the handler transforms the source value using\n * the provided `toValue` function and caches the result. Subsequent accesses\n * return the cached value without re-transforming.\n *\n * @template Source - The type of values in the source record\n * @template Dest - The type of transformed values\n */\nclass RecordProxyHandler<Source, Dest>\n  implements ProxyHandler<Record<string, Source>>\n{\n  readonly #toValue: (source: Source, prop: string) => Dest;\n  readonly #onMissing: ((prop: string) => void) | undefined;\n  readonly #cache: Map<string, Dest | typeof missing> = new Map();\n\n  /**\n   * @param toValue - Function to transform source values to destination values\n   * @param onMissing - Optional function called when accessing a non-existent\n   *   property. Can throw an error if desired.\n   */\n  constructor(\n    toValue: (source: Source, prop: string) => Dest,\n    onMissing?: (prop: string) => void,\n  ) {\n    this.#toValue = toValue;\n    this.#onMissing = onMissing;\n  }\n\n  #getOwnValue(\n    target: Record<string, Source>,\n    prop: string,\n  ): Dest | typeof missing {\n    const v = this.#cache.get(prop);\n    if (v !== undefined) {\n      return v;\n    }\n\n    if (Object.hasOwn(target, prop)) {\n      const value = this.#toValue(target[prop], prop);\n      this.#cache.set(prop, value);\n      return value;\n    }\n    return missing;\n  }\n\n  get(target: Record<string, Source>, prop: string | symbol) {\n    if (typeof prop !== 'string') {\n      return undefined;\n    }\n    // Only transform own properties; return inherited properties as-is\n    const ownValue = this.#getOwnValue(target, prop);\n    if (ownValue !== missing) {\n      return ownValue;\n    }\n    this.#onMissing?.(prop);\n\n    // Inherited property - return without transformation\n    return target[prop];\n  }\n\n  getOwnPropertyDescriptor(\n    target: Record<string, Source>,\n    p: string | symbol,\n  ): PropertyDescriptor | undefined {\n    if (typeof p !== 'string') {\n      return undefined;\n    }\n\n    const value = this.#getOwnValue(target, p);\n    if (value === missing) {\n      return undefined;\n    }\n    const desc = Reflect.getOwnPropertyDescriptor(target, p);\n    return {...desc, value};\n  }\n}\n\n/**\n * Creates a proxy that lazily transforms and caches record values.\n *\n * @template Source - The type of values in the source record\n * @template Dest - The type of transformed values\n * @param target - The source record to proxy\n * @param toValue - Function to transform source values to destination values\n * @param onMissing - Optional function called when accessing a non-existent\n *   property. Can throw an error if desired.\n * @returns A proxy that presents transformed values\n */\nexport function recordProxy<Source, Dest>(\n  target: Record<string, Source>,\n  toValue: (source: Source, prop: string) => Dest,\n  onMissing?: (prop: string) => void,\n): Record<string, Dest> {\n  return new Proxy(\n    target,\n    new RecordProxyHandler(toValue, onMissing),\n  ) as unknown as Record<string, Dest>;\n}\n"],"names":[],"mappings":"AAAA,MAAM,UAAU,OAAA;AAYhB,MAAM,mBAEN;AAAA,EACW;AAAA,EACA;AAAA,EACA,6BAAiD,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAO1D,YACE,SACA,WACA;AACA,SAAK,WAAW;AAChB,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,aACE,QACA,MACuB;AACvB,UAAM,IAAI,KAAK,OAAO,IAAI,IAAI;AAC9B,QAAI,MAAM,QAAW;AACnB,aAAO;AAAA,IACT;AAEA,QAAI,OAAO,OAAO,QAAQ,IAAI,GAAG;AAC/B,YAAM,QAAQ,KAAK,SAAS,OAAO,IAAI,GAAG,IAAI;AAC9C,WAAK,OAAO,IAAI,MAAM,KAAK;AAC3B,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,QAAgC,MAAuB;AACzD,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO;AAAA,IACT;AAEA,UAAM,WAAW,KAAK,aAAa,QAAQ,IAAI;AAC/C,QAAI,aAAa,SAAS;AACxB,aAAO;AAAA,IACT;AACA,SAAK,aAAa,IAAI;AAGtB,WAAO,OAAO,IAAI;AAAA,EACpB;AAAA,EAEA,yBACE,QACA,GACgC;AAChC,QAAI,OAAO,MAAM,UAAU;AACzB,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,KAAK,aAAa,QAAQ,CAAC;AACzC,QAAI,UAAU,SAAS;AACrB,aAAO;AAAA,IACT;AACA,UAAM,OAAO,QAAQ,yBAAyB,QAAQ,CAAC;AACvD,WAAO,EAAC,GAAG,MAAM,MAAA;AAAA,EACnB;AACF;AAaO,SAAS,YACd,QACA,SACA,WACsB;AACtB,SAAO,IAAI;AAAA,IACT;AAAA,IACA,IAAI,mBAAmB,SAAS,SAAS;AAAA,EAAA;AAE7C;"}
+{"version":3,"file":"record-proxy.js","names":["#toValue","#onMissing","#cache","#getOwnValue"],"sources":["../../../../shared/src/record-proxy.ts"],"sourcesContent":["const missing = Symbol();\n\n/**\n * A proxy handler that lazily transforms and caches record values.\n *\n * When a property is accessed, the handler transforms the source value using\n * the provided `toValue` function and caches the result. Subsequent accesses\n * return the cached value without re-transforming.\n *\n * @template Source - The type of values in the source record\n * @template Dest - The type of transformed values\n */\nclass RecordProxyHandler<Source, Dest> implements ProxyHandler<\n  Record<string, Source>\n> {\n  readonly #toValue: (source: Source, prop: string) => Dest;\n  readonly #onMissing: ((prop: string) => void) | undefined;\n  readonly #cache: Map<string, Dest | typeof missing> = new Map();\n\n  /**\n   * @param toValue - Function to transform source values to destination values\n   * @param onMissing - Optional function called when accessing a non-existent\n   *   property. Can throw an error if desired.\n   */\n  constructor(\n    toValue: (source: Source, prop: string) => Dest,\n    onMissing?: (prop: string) => void,\n  ) {\n    this.#toValue = toValue;\n    this.#onMissing = onMissing;\n  }\n\n  #getOwnValue(\n    target: Record<string, Source>,\n    prop: string,\n  ): Dest | typeof missing {\n    const v = this.#cache.get(prop);\n    if (v !== undefined) {\n      return v;\n    }\n\n    if (Object.hasOwn(target, prop)) {\n      const value = this.#toValue(target[prop], prop);\n      this.#cache.set(prop, value);\n      return value;\n    }\n    return missing;\n  }\n\n  get(target: Record<string, Source>, prop: string | symbol) {\n    if (typeof prop !== 'string') {\n      return undefined;\n    }\n    // Only transform own properties; return inherited properties as-is\n    const ownValue = this.#getOwnValue(target, prop);\n    if (ownValue !== missing) {\n      return ownValue;\n    }\n    this.#onMissing?.(prop);\n\n    // Inherited property - return without transformation\n    return target[prop];\n  }\n\n  getOwnPropertyDescriptor(\n    target: Record<string, Source>,\n    p: string | symbol,\n  ): PropertyDescriptor | undefined {\n    if (typeof p !== 'string') {\n      return undefined;\n    }\n\n    const value = this.#getOwnValue(target, p);\n    if (value === missing) {\n      return undefined;\n    }\n    const desc = Reflect.getOwnPropertyDescriptor(target, p);\n    return {...desc, value};\n  }\n}\n\n/**\n * Creates a proxy that lazily transforms and caches record values.\n *\n * @template Source - The type of values in the source record\n * @template Dest - The type of transformed values\n * @param target - The source record to proxy\n * @param toValue - Function to transform source values to destination values\n * @param onMissing - Optional function called when accessing a non-existent\n *   property. Can throw an error if desired.\n * @returns A proxy that presents transformed values\n */\nexport function recordProxy<Source, Dest>(\n  target: Record<string, Source>,\n  toValue: (source: Source, prop: string) => Dest,\n  onMissing?: (prop: string) => void,\n): Record<string, Dest> {\n  return new Proxy(\n    target,\n    new RecordProxyHandler(toValue, onMissing),\n  ) as unknown as Record<string, Dest>;\n}\n"],"mappings":";AAAA,IAAM,UAAU,QAAQ;;;;;;;;;;;AAYxB,IAAM,qBAAN,MAEE;CACA;CACA;CACA,yBAAsD,IAAI,KAAK;;;;;;CAO/D,YACE,SACA,WACA;AACA,QAAA,UAAgB;AAChB,QAAA,YAAkB;;CAGpB,aACE,QACA,MACuB;EACvB,MAAM,IAAI,MAAA,MAAY,IAAI,KAAK;AAC/B,MAAI,MAAM,KAAA,EACR,QAAO;AAGT,MAAI,OAAO,OAAO,QAAQ,KAAK,EAAE;GAC/B,MAAM,QAAQ,MAAA,QAAc,OAAO,OAAO,KAAK;AAC/C,SAAA,MAAY,IAAI,MAAM,MAAM;AAC5B,UAAO;;AAET,SAAO;;CAGT,IAAI,QAAgC,MAAuB;AACzD,MAAI,OAAO,SAAS,SAClB;EAGF,MAAM,WAAW,MAAA,YAAkB,QAAQ,KAAK;AAChD,MAAI,aAAa,QACf,QAAO;AAET,QAAA,YAAkB,KAAK;AAGvB,SAAO,OAAO;;CAGhB,yBACE,QACA,GACgC;AAChC,MAAI,OAAO,MAAM,SACf;EAGF,MAAM,QAAQ,MAAA,YAAkB,QAAQ,EAAE;AAC1C,MAAI,UAAU,QACZ;AAGF,SAAO;GAAC,GADK,QAAQ,yBAAyB,QAAQ,EAAE;GACvC;GAAM;;;;;;;;;;;;;;AAe3B,SAAgB,YACd,QACA,SACA,WACsB;AACtB,QAAO,IAAI,MACT,QACA,IAAI,mBAAmB,SAAS,UAAU,CAC3C"}

package/out/shared/src/resolved-promises.js

@@ -1,12 +1,10 @@
-const promiseTrue = Promise.resolve(true);
-const promiseFalse = Promise.resolve(false);
+//#region ../shared/src/resolved-promises.ts
+var promiseTrue = Promise.resolve(true);
+var promiseFalse = Promise.resolve(false);
 Promise.resolve(void 0);
-const promiseVoid = Promise.resolve();
-new Promise(() => {
-});
-export {
-  promiseFalse,
-  promiseTrue,
-  promiseVoid
-};
-//# sourceMappingURL=resolved-promises.js.map
+var promiseVoid = Promise.resolve();
+new Promise(() => {});
+//#endregion
+export { promiseFalse, promiseTrue, promiseVoid };
+
+//# sourceMappingURL=resolved-promises.js.map

package/out/shared/src/resolved-promises.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolved-promises.js","sources":["../../../../shared/src/resolved-promises.ts"],"sourcesContent":["export const promiseTrue = Promise.resolve(true as const);\nexport const promiseFalse = Promise.resolve(false as const);\nexport const promiseUndefined = Promise.resolve(undefined);\nexport const promiseVoid = Promise.resolve();\n\n/**\n * A promise that never resolves.\n */\nexport const promiseNever = new Promise<never>(() => {});\n"],"names":[],"mappings":"AAAO,MAAM,cAAc,QAAQ,QAAQ,IAAa;AACjD,MAAM,eAAe,QAAQ,QAAQ,KAAc;AAC1B,QAAQ,QAAQ,MAAS;AAClD,MAAM,cAAc,QAAQ,QAAA;AAKP,IAAI,QAAe,MAAM;AAAC,CAAC;"}
+{"version":3,"file":"resolved-promises.js","names":[],"sources":["../../../../shared/src/resolved-promises.ts"],"sourcesContent":["export const promiseTrue = Promise.resolve(true as const);\nexport const promiseFalse = Promise.resolve(false as const);\nexport const promiseUndefined = Promise.resolve(undefined);\nexport const promiseVoid = Promise.resolve();\n\n/**\n * A promise that never resolves.\n */\nexport const promiseNever = new Promise<never>(() => {});\n"],"mappings":";AAAA,IAAa,cAAc,QAAQ,QAAQ,KAAc;AACzD,IAAa,eAAe,QAAQ,QAAQ,MAAe;AAC3B,QAAQ,QAAQ,KAAA,EAAU;AAC1D,IAAa,cAAc,QAAQ,SAAS;AAKhB,IAAI,cAAqB,GAAG"}

package/out/shared/src/sentinels.js

@@ -1,14 +1,11 @@
-function emptyFunction() {
-}
-const emptyObject = Object.freeze({});
-const emptyArray = Object.freeze([]);
+//#region ../shared/src/sentinels.ts
+function emptyFunction() {}
+var emptyObject = Object.freeze({});
+var emptyArray = Object.freeze([]);
 function identity(x) {
-  return x;
+	return x;
 }
-export {
-  emptyArray,
-  emptyFunction,
-  emptyObject,
-  identity
-};
-//# sourceMappingURL=sentinels.js.map
+//#endregion
+export { emptyArray, emptyFunction, emptyObject, identity };
+
+//# sourceMappingURL=sentinels.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"sentinels.js","sources":["../../../../shared/src/sentinels.ts"],"sourcesContent":["export function emptyFunction() {}\nexport const emptyObject = Object.freeze({});\nexport const emptyArray = Object.freeze([]);\nexport function identity<T>(x: T): T {\n  return x;\n}\n"],"names":[],"mappings":"AAAO,SAAS,gBAAgB;AAAC;AAC1B,MAAM,cAAc,OAAO,OAAO,CAAA,CAAE;AACpC,MAAM,aAAa,OAAO,OAAO,CAAA,CAAE;AACnC,SAAS,SAAY,GAAS;AACnC,SAAO;AACT;"}
+{"version":3,"file":"sentinels.js","names":[],"sources":["../../../../shared/src/sentinels.ts"],"sourcesContent":["export function emptyFunction() {}\nexport const emptyObject = Object.freeze({});\nexport const emptyArray = Object.freeze([]);\nexport function identity<T>(x: T): T {\n  return x;\n}\n"],"mappings":";AAAA,SAAgB,gBAAgB;AAChC,IAAa,cAAc,OAAO,OAAO,EAAE,CAAC;AAC5C,IAAa,aAAa,OAAO,OAAO,EAAE,CAAC;AAC3C,SAAgB,SAAY,GAAS;AACnC,QAAO"}

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

@@ -1,73 +1,51 @@
+//#region ../shared/src/set-utils.ts
 function equals(a, b) {
-  if (a.size !== b.size) {
-    return false;
-  }
-  const iterator = a.keys();
-  for (let { done, value } = iterator.next(); !done; { done, value } = iterator.next()) {
-    if (!b.has(value)) {
-      return false;
-    }
-  }
-  return true;
+	if (a.size !== b.size) return false;
+	const iterator = a.keys();
+	for (let { done, value } = iterator.next(); !done; {done, value} = iterator.next()) if (!b.has(value)) return false;
+	return true;
 }
 function union(...sets) {
-  const result = /* @__PURE__ */ new Set();
-  for (const set of sets) {
-    const iterator = set.keys();
-    for (let { done, value } = iterator.next(); !done; { done, value } = iterator.next()) {
-      result.add(value);
-    }
-  }
-  return result;
+	const result = /* @__PURE__ */ new Set();
+	for (const set of sets) {
+		const iterator = set.keys();
+		for (let { done, value } = iterator.next(); !done; {done, value} = iterator.next()) result.add(value);
+	}
+	return result;
 }
 function intersection(a, b) {
-  const result = /* @__PURE__ */ new Set();
-  if (a.size > b.size) {
-    const swap = a;
-    a = b;
-    b = swap;
-  }
-  const iterator = a.keys();
-  for (let { done, value } = iterator.next(); !done; { done, value } = iterator.next()) {
-    if (b.has(value)) {
-      result.add(value);
-    }
-  }
-  return result;
+	const result = /* @__PURE__ */ new Set();
+	if (a.size > b.size) {
+		const swap = a;
+		a = b;
+		b = swap;
+	}
+	const iterator = a.keys();
+	for (let { done, value } = iterator.next(); !done; {done, value} = iterator.next()) if (b.has(value)) result.add(value);
+	return result;
 }
+/**
+* Returns the elements in {@linkcode a} that are not in {@linkcode b}.
+*/
 function difference(a, b) {
-  const result = /* @__PURE__ */ new Set();
-  const iterator = a.keys();
-  for (let { done, value } = iterator.next(); !done; { done, value } = iterator.next()) {
-    if (!b.has(value)) {
-      result.add(value);
-    }
-  }
-  return result;
+	const result = /* @__PURE__ */ new Set();
+	const iterator = a.keys();
+	for (let { done, value } = iterator.next(); !done; {done, value} = iterator.next()) if (!b.has(value)) result.add(value);
+	return result;
 }
 function symmetricDifferences(a, b) {
-  const onlyA = /* @__PURE__ */ new Set();
-  const iteratorA = a.keys();
-  for (let { done, value } = iteratorA.next(); !done; { done, value } = iteratorA.next()) {
-    onlyA.add(value);
-  }
-  const onlyB = /* @__PURE__ */ new Set();
-  const iteratorB = b.keys();
-  for (let { done, value } = iteratorB.next(); !done; { done, value } = iteratorB.next()) {
-    if (a.has(value)) {
-      onlyA.delete(value);
-      onlyB.delete(value);
-    } else {
-      onlyB.add(value);
-    }
-  }
-  return [onlyA, onlyB];
+	const onlyA = /* @__PURE__ */ new Set();
+	const iteratorA = a.keys();
+	for (let { done, value } = iteratorA.next(); !done; {done, value} = iteratorA.next()) onlyA.add(value);
+	const onlyB = /* @__PURE__ */ new Set();
+	const iteratorB = b.keys();
+	for (let { done, value } = iteratorB.next(); !done; {done, value} = iteratorB.next()) if (a.has(value)) {
+		onlyA.delete(value);
+		onlyB.delete(value);
+	} else onlyB.add(value);
+	return [onlyA, onlyB];
 }
-export {
-  difference,
-  equals,
-  intersection,
-  symmetricDifferences,
-  union
-};
-//# sourceMappingURL=set-utils.js.map
+//#endregion
+export { difference, equals, intersection, symmetricDifferences, union };
+
+//# sourceMappingURL=set-utils.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"set-utils.js","sources":["../../../../shared/src/set-utils.ts"],"sourcesContent":["// TODO: Change lib to pick up this type definition\n\ninterface ReadonlySetLike<T> {\n  /**\n   * Despite its name, returns an iterator of the values in the set-like.\n   */\n  keys(): Iterator<T>;\n  /**\n   * @returns a boolean indicating whether an element with the specified value exists in the set-like or not.\n   */\n  has(value: T): boolean;\n  /**\n   * @returns the number of (unique) elements in the set-like.\n   */\n  readonly size: number;\n}\n\nexport function equals<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): boolean {\n  if (a.size !== b.size) {\n    return false;\n  }\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (!b.has(value)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function union<T>(...sets: ReadonlySetLike<T>[]): Set<T> {\n  const result = new Set<T>();\n  for (const set of sets) {\n    const iterator = set.keys();\n    for (\n      let {done, value} = iterator.next();\n      !done;\n      {done, value} = iterator.next()\n    ) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\nexport function intersection<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): Set<T> {\n  const result = new Set<T>();\n  if (a.size > b.size) {\n    // Optimization: iterate over the smaller Set.\n    const swap = a;\n    a = b;\n    b = swap;\n  }\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (b.has(value)) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\n/**\n * Returns the elements in {@linkcode a} that are not in {@linkcode b}.\n */\nexport function difference<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): Set<T> {\n  const result = new Set<T>();\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (!b.has(value)) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\nexport function symmetricDifferences<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): [onlyA: Set<T>, onlyB: Set<T>] {\n  const onlyA = new Set<T>();\n  const iteratorA = a.keys();\n  for (\n    let {done, value} = iteratorA.next();\n    !done;\n    {done, value} = iteratorA.next()\n  ) {\n    onlyA.add(value);\n  }\n\n  const onlyB = new Set<T>();\n  const iteratorB = b.keys();\n  for (\n    let {done, value} = iteratorB.next();\n    !done;\n    {done, value} = iteratorB.next()\n  ) {\n    if (a.has(value)) {\n      onlyA.delete(value);\n      onlyB.delete(value);\n    } else {\n      onlyB.add(value);\n    }\n  }\n  return [onlyA, onlyB];\n}\n"],"names":[],"mappings":"AAiBO,SAAS,OACd,GACA,GACS;AACT,MAAI,EAAE,SAAS,EAAE,MAAM;AACrB,WAAO;AAAA,EACT;AACA,QAAM,WAAW,EAAE,KAAA;AACnB,WACM,EAAC,MAAM,MAAA,IAAS,SAAS,KAAA,GAC7B,CAAC,MACD,EAAC,MAAM,MAAA,IAAS,SAAS,QACzB;AACA,QAAI,CAAC,EAAE,IAAI,KAAK,GAAG;AACjB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,SAAY,MAAoC;AAC9D,QAAM,6BAAa,IAAA;AACnB,aAAW,OAAO,MAAM;AACtB,UAAM,WAAW,IAAI,KAAA;AACrB,aACM,EAAC,MAAM,MAAA,IAAS,SAAS,KAAA,GAC7B,CAAC,MACD,EAAC,MAAM,MAAA,IAAS,SAAS,QACzB;AACA,aAAO,IAAI,KAAK;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,aACd,GACA,GACQ;AACR,QAAM,6BAAa,IAAA;AACnB,MAAI,EAAE,OAAO,EAAE,MAAM;AAEnB,UAAM,OAAO;AACb,QAAI;AACJ,QAAI;AAAA,EACN;AACA,QAAM,WAAW,EAAE,KAAA;AACnB,WACM,EAAC,MAAM,MAAA,IAAS,SAAS,KAAA,GAC7B,CAAC,MACD,EAAC,MAAM,MAAA,IAAS,SAAS,QACzB;AACA,QAAI,EAAE,IAAI,KAAK,GAAG;AAChB,aAAO,IAAI,KAAK;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,WACd,GACA,GACQ;AACR,QAAM,6BAAa,IAAA;AACnB,QAAM,WAAW,EAAE,KAAA;AACnB,WACM,EAAC,MAAM,MAAA,IAAS,SAAS,KAAA,GAC7B,CAAC,MACD,EAAC,MAAM,MAAA,IAAS,SAAS,QACzB;AACA,QAAI,CAAC,EAAE,IAAI,KAAK,GAAG;AACjB,aAAO,IAAI,KAAK;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,qBACd,GACA,GACgC;AAChC,QAAM,4BAAY,IAAA;AAClB,QAAM,YAAY,EAAE,KAAA;AACpB,WACM,EAAC,MAAM,MAAA,IAAS,UAAU,KAAA,GAC9B,CAAC,MACD,EAAC,MAAM,MAAA,IAAS,UAAU,QAC1B;AACA,UAAM,IAAI,KAAK;AAAA,EACjB;AAEA,QAAM,4BAAY,IAAA;AAClB,QAAM,YAAY,EAAE,KAAA;AACpB,WACM,EAAC,MAAM,MAAA,IAAS,UAAU,KAAA,GAC9B,CAAC,MACD,EAAC,MAAM,MAAA,IAAS,UAAU,QAC1B;AACA,QAAI,EAAE,IAAI,KAAK,GAAG;AAChB,YAAM,OAAO,KAAK;AAClB,YAAM,OAAO,KAAK;AAAA,IACpB,OAAO;AACL,YAAM,IAAI,KAAK;AAAA,IACjB;AAAA,EACF;AACA,SAAO,CAAC,OAAO,KAAK;AACtB;"}
+{"version":3,"file":"set-utils.js","names":[],"sources":["../../../../shared/src/set-utils.ts"],"sourcesContent":["// TODO: Change lib to pick up this type definition\n\ninterface ReadonlySetLike<T> {\n  /**\n   * Despite its name, returns an iterator of the values in the set-like.\n   */\n  keys(): Iterator<T>;\n  /**\n   * @returns a boolean indicating whether an element with the specified value exists in the set-like or not.\n   */\n  has(value: T): boolean;\n  /**\n   * @returns the number of (unique) elements in the set-like.\n   */\n  readonly size: number;\n}\n\nexport function equals<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): boolean {\n  if (a.size !== b.size) {\n    return false;\n  }\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (!b.has(value)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function union<T>(...sets: ReadonlySetLike<T>[]): Set<T> {\n  const result = new Set<T>();\n  for (const set of sets) {\n    const iterator = set.keys();\n    for (\n      let {done, value} = iterator.next();\n      !done;\n      {done, value} = iterator.next()\n    ) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\nexport function intersection<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): Set<T> {\n  const result = new Set<T>();\n  if (a.size > b.size) {\n    // Optimization: iterate over the smaller Set.\n    const swap = a;\n    a = b;\n    b = swap;\n  }\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (b.has(value)) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\n/**\n * Returns the elements in {@linkcode a} that are not in {@linkcode b}.\n */\nexport function difference<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): Set<T> {\n  const result = new Set<T>();\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (!b.has(value)) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\nexport function symmetricDifferences<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): [onlyA: Set<T>, onlyB: Set<T>] {\n  const onlyA = new Set<T>();\n  const iteratorA = a.keys();\n  for (\n    let {done, value} = iteratorA.next();\n    !done;\n    {done, value} = iteratorA.next()\n  ) {\n    onlyA.add(value);\n  }\n\n  const onlyB = new Set<T>();\n  const iteratorB = b.keys();\n  for (\n    let {done, value} = iteratorB.next();\n    !done;\n    {done, value} = iteratorB.next()\n  ) {\n    if (a.has(value)) {\n      onlyA.delete(value);\n      onlyB.delete(value);\n    } else {\n      onlyB.add(value);\n    }\n  }\n  return [onlyA, onlyB];\n}\n"],"mappings":";AAiBA,SAAgB,OACd,GACA,GACS;AACT,KAAI,EAAE,SAAS,EAAE,KACf,QAAO;CAET,MAAM,WAAW,EAAE,MAAM;AACzB,MACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,KAAI,CAAC,EAAE,IAAI,MAAM,CACf,QAAO;AAGX,QAAO;;AAGT,SAAgB,MAAS,GAAG,MAAoC;CAC9D,MAAM,yBAAS,IAAI,KAAQ;AAC3B,MAAK,MAAM,OAAO,MAAM;EACtB,MAAM,WAAW,IAAI,MAAM;AAC3B,OACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,QAAO,IAAI,MAAM;;AAGrB,QAAO;;AAGT,SAAgB,aACd,GACA,GACQ;CACR,MAAM,yBAAS,IAAI,KAAQ;AAC3B,KAAI,EAAE,OAAO,EAAE,MAAM;EAEnB,MAAM,OAAO;AACb,MAAI;AACJ,MAAI;;CAEN,MAAM,WAAW,EAAE,MAAM;AACzB,MACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,KAAI,EAAE,IAAI,MAAM,CACd,QAAO,IAAI,MAAM;AAGrB,QAAO;;;;;AAMT,SAAgB,WACd,GACA,GACQ;CACR,MAAM,yBAAS,IAAI,KAAQ;CAC3B,MAAM,WAAW,EAAE,MAAM;AACzB,MACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,KAAI,CAAC,EAAE,IAAI,MAAM,CACf,QAAO,IAAI,MAAM;AAGrB,QAAO;;AAGT,SAAgB,qBACd,GACA,GACgC;CAChC,MAAM,wBAAQ,IAAI,KAAQ;CAC1B,MAAM,YAAY,EAAE,MAAM;AAC1B,MACE,IAAI,EAAC,MAAM,UAAS,UAAU,MAAM,EACpC,CAAC,MACD,CAAC,MAAM,SAAS,UAAU,MAAM,CAEhC,OAAM,IAAI,MAAM;CAGlB,MAAM,wBAAQ,IAAI,KAAQ;CAC1B,MAAM,YAAY,EAAE,MAAM;AAC1B,MACE,IAAI,EAAC,MAAM,UAAS,UAAU,MAAM,EACpC,CAAC,MACD,CAAC,MAAM,SAAS,UAAU,MAAM,CAEhC,KAAI,EAAE,IAAI,MAAM,EAAE;AAChB,QAAM,OAAO,MAAM;AACnB,QAAM,OAAO,MAAM;OAEnB,OAAM,IAAI,MAAM;AAGpB,QAAO,CAAC,OAAO,MAAM"}

package/out/shared/src/size-of-value.js

@@ -1,58 +1,62 @@
 import { hasOwn } from "./has-own.js";
-const SIZE_TAG = 1;
-const SIZE_INT32 = 4;
-const SIZE_SMI = 5;
-const SIZE_DOUBLE = 8;
+//#region ../shared/src/size-of-value.ts
+var SIZE_TAG = 1;
+var SIZE_INT32 = 4;
+var SIZE_SMI = 5;
+var SIZE_DOUBLE = 8;
+/**
+* Gives a size of a value. The size is modelled after the size used by
+* Chromium/V8's structuredClone algorithm. It does not match exactly so the
+* size is just an approximation.
+* https://source.chromium.org/chromium/chromium/src/+/main:v8/src/objects/value-serializer.cc;l=102;drc=f0b6f7d12ea47ad7c08fb554f678c1e73801ca36;bpv=1;bpt=1
+* For example we follow JSC/Mozilla for ints and skip the varint encoding.
+*
+* Mozilla does things similarly. Main difference is that there is no varint
+* encoding and every value uses multiples of 64bits
+* https://searchfox.org/mozilla-central/source/js/src/vm/StructuredClone.cpp#94
+*
+* And JSC:
+* https://github.com/WebKit/WebKit/blob/main/Source/WebCore/bindings/js/SerializedScriptValue.cpp#L356
+* - Use 1 byte tag
+* - Numbers are either stored as Int32 or Float64
+*/
 function getSizeOfValue(value) {
-  switch (typeof value) {
-    case "string":
-      return SIZE_TAG + SIZE_INT32 + value.length;
-    case "number":
-      if (isSmi(value)) {
-        if (value <= -1073741824 || value >= 2 ** 30 - 1) {
-          return SIZE_TAG + SIZE_SMI;
-        }
-        return SIZE_TAG + SIZE_INT32;
-      }
-      return SIZE_TAG + SIZE_DOUBLE;
-    case "boolean":
-      return SIZE_TAG;
-    case "object":
-      if (value === null) {
-        return SIZE_TAG;
-      }
-      if (Array.isArray(value)) {
-        let sum = 2 * SIZE_TAG + SIZE_INT32;
-        for (const element of value) {
-          sum += getSizeOfValue(element);
-        }
-        return sum;
-      }
-      {
-        const val = value;
-        let sum = 2 * SIZE_TAG + SIZE_INT32;
-        for (const k in val) {
-          if (hasOwn(val, k)) {
-            const propertyValue = val[k];
-            if (propertyValue !== void 0) {
-              sum += getSizeOfValue(k) + getSizeOfValue(propertyValue);
-            }
-          }
-        }
-        return sum;
-      }
-  }
-  throw new Error(`Invalid value. type: ${typeof value}, value: ${value}`);
+	switch (typeof value) {
+		case "string": return SIZE_TAG + SIZE_INT32 + value.length;
+		case "number":
+			if (isSmi(value)) {
+				if (value <= -(2 ** 30) || value >= 2 ** 30 - 1) return SIZE_TAG + SIZE_SMI;
+				return SIZE_TAG + SIZE_INT32;
+			}
+			return SIZE_TAG + SIZE_DOUBLE;
+		case "boolean": return SIZE_TAG;
+		case "object":
+			if (value === null) return SIZE_TAG;
+			if (Array.isArray(value)) {
+				let sum = 2 * SIZE_TAG + SIZE_INT32;
+				for (const element of value) sum += getSizeOfValue(element);
+				return sum;
+			}
+			{
+				const val = value;
+				let sum = 2 * SIZE_TAG + SIZE_INT32;
+				for (const k in val) if (hasOwn(val, k)) {
+					const propertyValue = val[k];
+					if (propertyValue !== void 0) sum += getSizeOfValue(k) + getSizeOfValue(propertyValue);
+				}
+				return sum;
+			}
+	}
+	throw new Error(`Invalid value. type: ${typeof value}, value: ${value}`);
 }
 function isSmi(value) {
-  return value === (value | 0);
+	return value === (value | 0);
 }
-const entryFixed = 2 * SIZE_TAG + SIZE_INT32 + SIZE_TAG + SIZE_INT32;
+var entryFixed = 2 * SIZE_TAG + SIZE_INT32 + SIZE_TAG + SIZE_INT32;
 function getSizeOfEntry(key, value) {
-  return entryFixed + getSizeOfValue(key) + getSizeOfValue(value);
+	return entryFixed + getSizeOfValue(key) + getSizeOfValue(value);
 }
-export {
-  getSizeOfEntry,
-  getSizeOfValue
-};
-//# sourceMappingURL=size-of-value.js.map
+//#endregion
+export { getSizeOfEntry, getSizeOfValue };
+
+//# sourceMappingURL=size-of-value.js.map

package/out/shared/src/size-of-value.js.map

@@ -1 +1 @@
-{"version":3,"file":"size-of-value.js","sources":["../../../../shared/src/size-of-value.ts"],"sourcesContent":["import {hasOwn} from './has-own.ts';\nimport type {ReadonlyJSONObject} from './json.ts';\n\nconst SIZE_TAG = 1;\nconst SIZE_INT32 = 4;\nconst SIZE_SMI = 5;\nconst SIZE_DOUBLE = 8;\n\n/**\n * Gives a size of a value. The size is modelled after the size used by\n * Chromium/V8's structuredClone algorithm. It does not match exactly so the\n * size is just an approximation.\n * https://source.chromium.org/chromium/chromium/src/+/main:v8/src/objects/value-serializer.cc;l=102;drc=f0b6f7d12ea47ad7c08fb554f678c1e73801ca36;bpv=1;bpt=1\n * For example we follow JSC/Mozilla for ints and skip the varint encoding.\n *\n * Mozilla does things similarly. Main difference is that there is no varint\n * encoding and every value uses multiples of 64bits\n * https://searchfox.org/mozilla-central/source/js/src/vm/StructuredClone.cpp#94\n *\n * And JSC:\n * https://github.com/WebKit/WebKit/blob/main/Source/WebCore/bindings/js/SerializedScriptValue.cpp#L356\n * - Use 1 byte tag\n * - Numbers are either stored as Int32 or Float64\n */\nexport function getSizeOfValue(value: unknown): number {\n  switch (typeof value) {\n    case 'string':\n      // Assumes all strings are one byte strings. V8 writes OneByteString and\n      // TwoByteString. We could check the string but it would require iterating\n      // over all the characters.\n      return SIZE_TAG + SIZE_INT32 + value.length;\n    case 'number':\n      if (isSmi(value)) {\n        if (value <= -(2 ** 30) || value >= 2 ** 30 - 1) {\n          return SIZE_TAG + SIZE_SMI;\n        }\n        return SIZE_TAG + SIZE_INT32;\n      }\n      return SIZE_TAG + SIZE_DOUBLE;\n    case 'boolean':\n      return SIZE_TAG;\n    case 'object':\n      if (value === null) {\n        return SIZE_TAG;\n      }\n\n      if (Array.isArray(value)) {\n        let sum = 2 * SIZE_TAG + SIZE_INT32;\n        for (const element of value) {\n          sum += getSizeOfValue(element);\n        }\n        return sum;\n      }\n\n      {\n        const val = value as ReadonlyJSONObject;\n        let sum: number = 2 * SIZE_TAG + SIZE_INT32;\n        for (const k in val) {\n          if (hasOwn(val, k)) {\n            // Skip undefined values. undefined values in an object gets\n            // stripped if we round trip through JSON.stringif which is what we\n            // use when syncing.\n            const propertyValue = val[k];\n            if (propertyValue !== undefined) {\n              sum += getSizeOfValue(k) + getSizeOfValue(propertyValue);\n            }\n          }\n        }\n        return sum;\n      }\n  }\n\n  throw new Error(`Invalid value. type: ${typeof value}, value: ${value}`);\n}\n\nfunction isSmi(value: number): boolean {\n  return value === (value | 0);\n}\n\nconst entryFixed = 2 * SIZE_TAG + SIZE_INT32 + SIZE_TAG + SIZE_INT32;\n\nexport function getSizeOfEntry<K, V>(key: K, value: V): number {\n  // Entries are stored as [key, value, sizeOfEntry]\n  return entryFixed + getSizeOfValue(key) + getSizeOfValue(value);\n}\n"],"names":[],"mappings":";AAGA,MAAM,WAAW;AACjB,MAAM,aAAa;AACnB,MAAM,WAAW;AACjB,MAAM,cAAc;AAkBb,SAAS,eAAe,OAAwB;AACrD,UAAQ,OAAO,OAAA;AAAA,IACb,KAAK;AAIH,aAAO,WAAW,aAAa,MAAM;AAAA,IACvC,KAAK;AACH,UAAI,MAAM,KAAK,GAAG;AAChB,YAAI,SAAS,eAAc,SAAS,KAAK,KAAK,GAAG;AAC/C,iBAAO,WAAW;AAAA,QACpB;AACA,eAAO,WAAW;AAAA,MACpB;AACA,aAAO,WAAW;AAAA,IACpB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,UAAI,UAAU,MAAM;AAClB,eAAO;AAAA,MACT;AAEA,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,YAAI,MAAM,IAAI,WAAW;AACzB,mBAAW,WAAW,OAAO;AAC3B,iBAAO,eAAe,OAAO;AAAA,QAC/B;AACA,eAAO;AAAA,MACT;AAEA;AACE,cAAM,MAAM;AACZ,YAAI,MAAc,IAAI,WAAW;AACjC,mBAAW,KAAK,KAAK;AACnB,cAAI,OAAO,KAAK,CAAC,GAAG;AAIlB,kBAAM,gBAAgB,IAAI,CAAC;AAC3B,gBAAI,kBAAkB,QAAW;AAC/B,qBAAO,eAAe,CAAC,IAAI,eAAe,aAAa;AAAA,YACzD;AAAA,UACF;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,EAAA;AAGJ,QAAM,IAAI,MAAM,wBAAwB,OAAO,KAAK,YAAY,KAAK,EAAE;AACzE;AAEA,SAAS,MAAM,OAAwB;AACrC,SAAO,WAAW,QAAQ;AAC5B;AAEA,MAAM,aAAa,IAAI,WAAW,aAAa,WAAW;AAEnD,SAAS,eAAqB,KAAQ,OAAkB;AAE7D,SAAO,aAAa,eAAe,GAAG,IAAI,eAAe,KAAK;AAChE;"}
+{"version":3,"file":"size-of-value.js","names":[],"sources":["../../../../shared/src/size-of-value.ts"],"sourcesContent":["import {hasOwn} from './has-own.ts';\nimport type {ReadonlyJSONObject} from './json.ts';\n\nconst SIZE_TAG = 1;\nconst SIZE_INT32 = 4;\nconst SIZE_SMI = 5;\nconst SIZE_DOUBLE = 8;\n\n/**\n * Gives a size of a value. The size is modelled after the size used by\n * Chromium/V8's structuredClone algorithm. It does not match exactly so the\n * size is just an approximation.\n * https://source.chromium.org/chromium/chromium/src/+/main:v8/src/objects/value-serializer.cc;l=102;drc=f0b6f7d12ea47ad7c08fb554f678c1e73801ca36;bpv=1;bpt=1\n * For example we follow JSC/Mozilla for ints and skip the varint encoding.\n *\n * Mozilla does things similarly. Main difference is that there is no varint\n * encoding and every value uses multiples of 64bits\n * https://searchfox.org/mozilla-central/source/js/src/vm/StructuredClone.cpp#94\n *\n * And JSC:\n * https://github.com/WebKit/WebKit/blob/main/Source/WebCore/bindings/js/SerializedScriptValue.cpp#L356\n * - Use 1 byte tag\n * - Numbers are either stored as Int32 or Float64\n */\nexport function getSizeOfValue(value: unknown): number {\n  switch (typeof value) {\n    case 'string':\n      // Assumes all strings are one byte strings. V8 writes OneByteString and\n      // TwoByteString. We could check the string but it would require iterating\n      // over all the characters.\n      return SIZE_TAG + SIZE_INT32 + value.length;\n    case 'number':\n      if (isSmi(value)) {\n        if (value <= -(2 ** 30) || value >= 2 ** 30 - 1) {\n          return SIZE_TAG + SIZE_SMI;\n        }\n        return SIZE_TAG + SIZE_INT32;\n      }\n      return SIZE_TAG + SIZE_DOUBLE;\n    case 'boolean':\n      return SIZE_TAG;\n    case 'object':\n      if (value === null) {\n        return SIZE_TAG;\n      }\n\n      if (Array.isArray(value)) {\n        let sum = 2 * SIZE_TAG + SIZE_INT32;\n        for (const element of value) {\n          sum += getSizeOfValue(element);\n        }\n        return sum;\n      }\n\n      {\n        const val = value as ReadonlyJSONObject;\n        let sum: number = 2 * SIZE_TAG + SIZE_INT32;\n        for (const k in val) {\n          if (hasOwn(val, k)) {\n            // Skip undefined values. undefined values in an object gets\n            // stripped if we round trip through JSON.stringif which is what we\n            // use when syncing.\n            const propertyValue = val[k];\n            if (propertyValue !== undefined) {\n              sum += getSizeOfValue(k) + getSizeOfValue(propertyValue);\n            }\n          }\n        }\n        return sum;\n      }\n  }\n\n  throw new Error(`Invalid value. type: ${typeof value}, value: ${value}`);\n}\n\nfunction isSmi(value: number): boolean {\n  return value === (value | 0);\n}\n\nconst entryFixed = 2 * SIZE_TAG + SIZE_INT32 + SIZE_TAG + SIZE_INT32;\n\nexport function getSizeOfEntry<K, V>(key: K, value: V): number {\n  // Entries are stored as [key, value, sizeOfEntry]\n  return entryFixed + getSizeOfValue(key) + getSizeOfValue(value);\n}\n"],"mappings":";;AAGA,IAAM,WAAW;AACjB,IAAM,aAAa;AACnB,IAAM,WAAW;AACjB,IAAM,cAAc;;;;;;;;;;;;;;;;;AAkBpB,SAAgB,eAAe,OAAwB;AACrD,SAAQ,OAAO,OAAf;EACE,KAAK,SAIH,QAAO,WAAW,aAAa,MAAM;EACvC,KAAK;AACH,OAAI,MAAM,MAAM,EAAE;AAChB,QAAI,SAAS,EAAE,KAAK,OAAO,SAAS,KAAK,KAAK,EAC5C,QAAO,WAAW;AAEpB,WAAO,WAAW;;AAEpB,UAAO,WAAW;EACpB,KAAK,UACH,QAAO;EACT,KAAK;AACH,OAAI,UAAU,KACZ,QAAO;AAGT,OAAI,MAAM,QAAQ,MAAM,EAAE;IACxB,IAAI,MAAM,IAAI,WAAW;AACzB,SAAK,MAAM,WAAW,MACpB,QAAO,eAAe,QAAQ;AAEhC,WAAO;;GAGT;IACE,MAAM,MAAM;IACZ,IAAI,MAAc,IAAI,WAAW;AACjC,SAAK,MAAM,KAAK,IACd,KAAI,OAAO,KAAK,EAAE,EAAE;KAIlB,MAAM,gBAAgB,IAAI;AAC1B,SAAI,kBAAkB,KAAA,EACpB,QAAO,eAAe,EAAE,GAAG,eAAe,cAAc;;AAI9D,WAAO;;;AAIb,OAAM,IAAI,MAAM,wBAAwB,OAAO,MAAM,WAAW,QAAQ;;AAG1E,SAAS,MAAM,OAAwB;AACrC,QAAO,WAAW,QAAQ;;AAG5B,IAAM,aAAa,IAAI,WAAW,aAAa,WAAW;AAE1D,SAAgB,eAAqB,KAAQ,OAAkB;AAE7D,QAAO,aAAa,eAAe,IAAI,GAAG,eAAe,MAAM"}

package/out/shared/src/sleep.js

@@ -1,50 +1,55 @@
-import { resolver } from "@rocicorp/resolver";
 import { AbortError } from "./abort-error.js";
-const promiseVoid = Promise.resolve();
-const promiseNever = new Promise(() => void 0);
+import { resolver } from "@rocicorp/resolver";
+//#region ../shared/src/sleep.ts
+var promiseVoid = Promise.resolve();
+var promiseNever = new Promise(() => void 0);
+/**
+* Creates a promise that resolves after `ms` milliseconds. Note that if you
+* pass in `0` no `setTimeout` is used and the promise resolves immediately. In
+* other words no macro task is used in that case.
+*
+* Pass in an AbortSignal to clear the timeout.
+*/
 function sleep(ms, signal) {
-  const newAbortError = () => new AbortError("Aborted");
-  if (signal?.aborted) {
-    return Promise.reject(newAbortError());
-  }
-  if (ms === 0) {
-    return promiseVoid;
-  }
-  return new Promise((resolve, reject) => {
-    let handleAbort;
-    if (signal) {
-      handleAbort = () => {
-        clearTimeout(id);
-        reject(newAbortError());
-      };
-      signal.addEventListener("abort", handleAbort, { once: true });
-    }
-    const id = setTimeout(() => {
-      resolve();
-      signal?.removeEventListener("abort", handleAbort);
-    }, ms);
-  });
+	const newAbortError = () => new AbortError("Aborted");
+	if (signal?.aborted) return Promise.reject(newAbortError());
+	if (ms === 0) return promiseVoid;
+	return new Promise((resolve, reject) => {
+		let handleAbort;
+		if (signal) {
+			handleAbort = () => {
+				clearTimeout(id);
+				reject(newAbortError());
+			};
+			signal.addEventListener("abort", handleAbort, { once: true });
+		}
+		const id = setTimeout(() => {
+			resolve();
+			signal?.removeEventListener("abort", handleAbort);
+		}, ms);
+	});
 }
+/**
+* Returns a pair of promises. The first promise resolves after `ms` milliseconds
+* unless the AbortSignal is aborted. The second promise resolves when the AbortSignal
+* is aborted.
+*/
 function sleepWithAbort(ms, signal) {
-  if (ms === 0) {
-    return [promiseVoid, promiseNever];
-  }
-  const { promise: abortedPromise, resolve: abortedResolve } = resolver();
-  const sleepPromise = new Promise((resolve) => {
-    const handleAbort = () => {
-      clearTimeout(id);
-      abortedResolve();
-    };
-    const id = setTimeout(() => {
-      resolve();
-      signal.removeEventListener("abort", handleAbort);
-    }, ms);
-    signal.addEventListener("abort", handleAbort, { once: true });
-  });
-  return [sleepPromise, abortedPromise];
+	if (ms === 0) return [promiseVoid, promiseNever];
+	const { promise: abortedPromise, resolve: abortedResolve } = resolver();
+	return [new Promise((resolve) => {
+		const handleAbort = () => {
+			clearTimeout(id);
+			abortedResolve();
+		};
+		const id = setTimeout(() => {
+			resolve();
+			signal.removeEventListener("abort", handleAbort);
+		}, ms);
+		signal.addEventListener("abort", handleAbort, { once: true });
+	}), abortedPromise];
 }
-export {
-  sleep,
-  sleepWithAbort
-};
-//# sourceMappingURL=sleep.js.map
+//#endregion
+export { sleep, sleepWithAbort };
+
+//# sourceMappingURL=sleep.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"sleep.js","sources":["../../../../shared/src/sleep.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\nimport {AbortError} from './abort-error.ts';\n\nconst promiseVoid = Promise.resolve();\nconst promiseNever = new Promise<void>(() => undefined);\n\n/**\n * Creates a promise that resolves after `ms` milliseconds. Note that if you\n * pass in `0` no `setTimeout` is used and the promise resolves immediately. In\n * other words no macro task is used in that case.\n *\n * Pass in an AbortSignal to clear the timeout.\n */\nexport function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  const newAbortError = () => new AbortError('Aborted');\n\n  if (signal?.aborted) {\n    return Promise.reject(newAbortError());\n  }\n\n  if (ms === 0) {\n    return promiseVoid;\n  }\n\n  return new Promise((resolve, reject) => {\n    let handleAbort: () => void;\n    if (signal) {\n      handleAbort = () => {\n        clearTimeout(id);\n        reject(newAbortError());\n      };\n      signal.addEventListener('abort', handleAbort, {once: true});\n    }\n\n    const id = setTimeout(() => {\n      resolve();\n      signal?.removeEventListener('abort', handleAbort);\n    }, ms);\n  });\n}\n\n/**\n * Returns a pair of promises. The first promise resolves after `ms` milliseconds\n * unless the AbortSignal is aborted. The second promise resolves when the AbortSignal\n * is aborted.\n */\nexport function sleepWithAbort(\n  ms: number,\n  signal: AbortSignal,\n): [ok: Promise<void>, aborted: Promise<void>] {\n  if (ms === 0) {\n    return [promiseVoid, promiseNever];\n  }\n\n  const {promise: abortedPromise, resolve: abortedResolve} = resolver<void>();\n\n  const sleepPromise = new Promise<void>(resolve => {\n    const handleAbort = () => {\n      clearTimeout(id);\n      abortedResolve();\n    };\n\n    const id = setTimeout(() => {\n      resolve();\n      signal.removeEventListener('abort', handleAbort);\n    }, ms);\n\n    signal.addEventListener('abort', handleAbort, {once: true});\n  });\n\n  return [sleepPromise, abortedPromise];\n}\n"],"names":[],"mappings":";;AAGA,MAAM,cAAc,QAAQ,QAAA;AAC5B,MAAM,eAAe,IAAI,QAAc,MAAM,MAAS;AAS/C,SAAS,MAAM,IAAY,QAAqC;AACrE,QAAM,gBAAgB,MAAM,IAAI,WAAW,SAAS;AAEpD,MAAI,QAAQ,SAAS;AACnB,WAAO,QAAQ,OAAO,eAAe;AAAA,EACvC;AAEA,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACT;AAEA,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,QAAI;AACJ,QAAI,QAAQ;AACV,oBAAc,MAAM;AAClB,qBAAa,EAAE;AACf,eAAO,eAAe;AAAA,MACxB;AACA,aAAO,iBAAiB,SAAS,aAAa,EAAC,MAAM,MAAK;AAAA,IAC5D;AAEA,UAAM,KAAK,WAAW,MAAM;AAC1B,cAAA;AACA,cAAQ,oBAAoB,SAAS,WAAW;AAAA,IAClD,GAAG,EAAE;AAAA,EACP,CAAC;AACH;AAOO,SAAS,eACd,IACA,QAC6C;AAC7C,MAAI,OAAO,GAAG;AACZ,WAAO,CAAC,aAAa,YAAY;AAAA,EACnC;AAEA,QAAM,EAAC,SAAS,gBAAgB,SAAS,eAAA,IAAkB,SAAA;AAE3D,QAAM,eAAe,IAAI,QAAc,CAAA,YAAW;AAChD,UAAM,cAAc,MAAM;AACxB,mBAAa,EAAE;AACf,qBAAA;AAAA,IACF;AAEA,UAAM,KAAK,WAAW,MAAM;AAC1B,cAAA;AACA,aAAO,oBAAoB,SAAS,WAAW;AAAA,IACjD,GAAG,EAAE;AAEL,WAAO,iBAAiB,SAAS,aAAa,EAAC,MAAM,MAAK;AAAA,EAC5D,CAAC;AAED,SAAO,CAAC,cAAc,cAAc;AACtC;"}
+{"version":3,"file":"sleep.js","names":[],"sources":["../../../../shared/src/sleep.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\nimport {AbortError} from './abort-error.ts';\n\nconst promiseVoid = Promise.resolve();\nconst promiseNever = new Promise<void>(() => undefined);\n\n/**\n * Creates a promise that resolves after `ms` milliseconds. Note that if you\n * pass in `0` no `setTimeout` is used and the promise resolves immediately. In\n * other words no macro task is used in that case.\n *\n * Pass in an AbortSignal to clear the timeout.\n */\nexport function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  const newAbortError = () => new AbortError('Aborted');\n\n  if (signal?.aborted) {\n    return Promise.reject(newAbortError());\n  }\n\n  if (ms === 0) {\n    return promiseVoid;\n  }\n\n  return new Promise((resolve, reject) => {\n    let handleAbort: () => void;\n    if (signal) {\n      handleAbort = () => {\n        clearTimeout(id);\n        reject(newAbortError());\n      };\n      signal.addEventListener('abort', handleAbort, {once: true});\n    }\n\n    const id = setTimeout(() => {\n      resolve();\n      signal?.removeEventListener('abort', handleAbort);\n    }, ms);\n  });\n}\n\n/**\n * Returns a pair of promises. The first promise resolves after `ms` milliseconds\n * unless the AbortSignal is aborted. The second promise resolves when the AbortSignal\n * is aborted.\n */\nexport function sleepWithAbort(\n  ms: number,\n  signal: AbortSignal,\n): [ok: Promise<void>, aborted: Promise<void>] {\n  if (ms === 0) {\n    return [promiseVoid, promiseNever];\n  }\n\n  const {promise: abortedPromise, resolve: abortedResolve} = resolver<void>();\n\n  const sleepPromise = new Promise<void>(resolve => {\n    const handleAbort = () => {\n      clearTimeout(id);\n      abortedResolve();\n    };\n\n    const id = setTimeout(() => {\n      resolve();\n      signal.removeEventListener('abort', handleAbort);\n    }, ms);\n\n    signal.addEventListener('abort', handleAbort, {once: true});\n  });\n\n  return [sleepPromise, abortedPromise];\n}\n"],"mappings":";;;AAGA,IAAM,cAAc,QAAQ,SAAS;AACrC,IAAM,eAAe,IAAI,cAAoB,KAAA,EAAU;;;;;;;;AASvD,SAAgB,MAAM,IAAY,QAAqC;CACrE,MAAM,sBAAsB,IAAI,WAAW,UAAU;AAErD,KAAI,QAAQ,QACV,QAAO,QAAQ,OAAO,eAAe,CAAC;AAGxC,KAAI,OAAO,EACT,QAAO;AAGT,QAAO,IAAI,SAAS,SAAS,WAAW;EACtC,IAAI;AACJ,MAAI,QAAQ;AACV,uBAAoB;AAClB,iBAAa,GAAG;AAChB,WAAO,eAAe,CAAC;;AAEzB,UAAO,iBAAiB,SAAS,aAAa,EAAC,MAAM,MAAK,CAAC;;EAG7D,MAAM,KAAK,iBAAiB;AAC1B,YAAS;AACT,WAAQ,oBAAoB,SAAS,YAAY;KAChD,GAAG;GACN;;;;;;;AAQJ,SAAgB,eACd,IACA,QAC6C;AAC7C,KAAI,OAAO,EACT,QAAO,CAAC,aAAa,aAAa;CAGpC,MAAM,EAAC,SAAS,gBAAgB,SAAS,mBAAkB,UAAgB;AAgB3E,QAAO,CAdc,IAAI,SAAc,YAAW;EAChD,MAAM,oBAAoB;AACxB,gBAAa,GAAG;AAChB,mBAAgB;;EAGlB,MAAM,KAAK,iBAAiB;AAC1B,YAAS;AACT,UAAO,oBAAoB,SAAS,YAAY;KAC/C,GAAG;AAEN,SAAO,iBAAiB,SAAS,aAAa,EAAC,MAAM,MAAK,CAAC;GAC3D,EAEoB,eAAe"}