@rocicorp/zero 0.25.0 → 0.26.0-canary.0

package/out/shared/src/sentinels.js

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

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

@@ -1 +1 @@
-{"version":3,"file":"sentinels.js","sourceRoot":"","sources":["../../../../shared/src/sentinels.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,aAAa,KAAI,CAAC;AAClC,MAAM,CAAC,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAC7C,MAAM,CAAC,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAC5C,MAAM,UAAU,QAAQ,CAAI,CAAI;IAC9B,OAAO,CAAC,CAAC;AACX,CAAC"}
+{"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;"}

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

@@ -1,72 +1,73 @@
-// TODO: Change lib to pick up this type definition
-export function equals(a, b) {
-    if (a.size !== b.size) {
-        return false;
+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;
     }
-    const iterator = a.keys();
-    for (let { done, value } = iterator.next(); !done; { done, value } = iterator.next()) {
-        if (!b.has(value)) {
-            return false;
-        }
-    }
-    return true;
-}
-export function union(...sets) {
-    const result = 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;
+  }
+  return true;
 }
-export function intersection(a, b) {
-    const result = new Set();
-    if (a.size > b.size) {
-        // Optimization: iterate over the smaller Set.
-        const swap = a;
-        a = b;
-        b = swap;
-    }
-    const iterator = a.keys();
+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()) {
-        if (b.has(value)) {
-            result.add(value);
-        }
+      result.add(value);
     }
-    return result;
+  }
+  return result;
 }
-/**
- * Returns the elements in {@linkcode a} that are not in {@linkcode b}.
- */
-export function difference(a, b) {
-    const result = new Set();
-    const iterator = a.keys();
-    for (let { done, value } = iterator.next(); !done; { done, value } = iterator.next()) {
-        if (!b.has(value)) {
-            result.add(value);
-        }
+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;
+  }
+  return result;
 }
-export function symmetricDifferences(a, b) {
-    const onlyA = new Set();
-    const iteratorA = a.keys();
-    for (let { done, value } = iteratorA.next(); !done; { done, value } = iteratorA.next()) {
-        onlyA.add(value);
+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);
     }
-    const onlyB = 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 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];
+  }
+  return [onlyA, onlyB];
 }
-//# sourceMappingURL=set-utils.js.map
+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","sourceRoot":"","sources":["../../../../shared/src/set-utils.ts"],"names":[],"mappings":"AAAA,mDAAmD;AAiBnD,MAAM,UAAU,MAAM,CACpB,CAAqB,EACrB,CAAqB;IAErB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1B,KACE,IAAI,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EACnC,CAAC,IAAI,EACL,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAC/B,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,KAAK,CAAI,GAAG,IAA0B;IACpD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC5B,KACE,IAAI,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EACnC,CAAC,IAAI,EACL,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAC/B,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,CAAqB,EACrB,CAAqB;IAErB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACpB,8CAA8C;QAC9C,MAAM,IAAI,GAAG,CAAC,CAAC;QACf,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,GAAG,IAAI,CAAC;IACX,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1B,KACE,IAAI,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EACnC,CAAC,IAAI,EACL,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAC/B,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CACxB,CAAqB,EACrB,CAAqB;IAErB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1B,KACE,IAAI,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EACnC,CAAC,IAAI,EACL,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAC/B,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,CAAqB,EACrB,CAAqB;IAErB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAK,CAAC;IAC3B,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3B,KACE,IAAI,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,SAAS,CAAC,IAAI,EAAE,EACpC,CAAC,IAAI,EACL,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,SAAS,CAAC,IAAI,EAAE,EAChC,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAK,CAAC;IAC3B,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3B,KACE,IAAI,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,SAAS,CAAC,IAAI,EAAE,EACpC,CAAC,IAAI,EACL,EAAC,IAAI,EAAE,KAAK,EAAC,GAAG,SAAS,CAAC,IAAI,EAAE,EAChC,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACpB,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AACxB,CAAC"}
+{"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;"}

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

@@ -0,0 +1,58 @@
+import { hasOwn } from "./has-own.js";
+const SIZE_TAG = 1;
+const SIZE_INT32 = 4;
+const SIZE_SMI = 5;
+const SIZE_DOUBLE = 8;
+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}`);
+}
+function isSmi(value) {
+  return value === (value | 0);
+}
+const entryFixed = 2 * SIZE_TAG + SIZE_INT32 + SIZE_TAG + SIZE_INT32;
+function getSizeOfEntry(key, value) {
+  return entryFixed + getSizeOfValue(key) + getSizeOfValue(value);
+}
+export {
+  getSizeOfEntry,
+  getSizeOfValue
+};
+//# sourceMappingURL=size-of-value.js.map

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

@@ -0,0 +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;"}

package/out/shared/src/sleep.js

@@ -1,58 +1,50 @@
-import { resolver } from '@rocicorp/resolver';
+import { resolver } from "@rocicorp/resolver";
 import { AbortError } from "./abort-error.js";
 const promiseVoid = Promise.resolve();
-const promiseNever = new Promise(() => undefined);
-/**
- * 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.
- */
-export function sleep(ms, signal) {
-    const newAbortError = () => new AbortError('Aborted');
-    if (signal?.aborted) {
-        return Promise.reject(newAbortError());
+const promiseNever = new Promise(() => void 0);
+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 });
     }
-    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 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.
- */
-export 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];
+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];
 }
-//# sourceMappingURL=sleep.js.map
+export {
+  sleep,
+  sleepWithAbort
+};
+//# sourceMappingURL=sleep.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"sleep.js","sourceRoot":"","sources":["../../../../shared/src/sleep.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAC,MAAM,oBAAoB,CAAC;AAC5C,OAAO,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAE5C,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;AACtC,MAAM,YAAY,GAAG,IAAI,OAAO,CAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAExD;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAC,EAAU,EAAE,MAAoB;IACpD,MAAM,aAAa,GAAG,GAAG,EAAE,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IAEtD,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;QACpB,OAAO,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,IAAI,WAAuB,CAAC;QAC5B,IAAI,MAAM,EAAE,CAAC;YACX,WAAW,GAAG,GAAG,EAAE;gBACjB,YAAY,CAAC,EAAE,CAAC,CAAC;gBACjB,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC;YAC1B,CAAC,CAAC;YACF,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAC,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE;YACzB,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACpD,CAAC,EAAE,EAAE,CAAC,CAAC;IACT,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,EAAU,EACV,MAAmB;IAEnB,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,EAAC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,cAAc,EAAC,GAAG,QAAQ,EAAQ,CAAC;IAE5E,MAAM,YAAY,GAAG,IAAI,OAAO,CAAO,OAAO,CAAC,EAAE;QAC/C,MAAM,WAAW,GAAG,GAAG,EAAE;YACvB,YAAY,CAAC,EAAE,CAAC,CAAC;YACjB,cAAc,EAAE,CAAC;QACnB,CAAC,CAAC;QAEF,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE;YACzB,OAAO,EAAE,CAAC;YACV,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACnD,CAAC,EAAE,EAAE,CAAC,CAAC;QAEP,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAC,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;AACxC,CAAC"}
+{"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;"}

package/out/shared/src/string-compare.js

@@ -1,10 +1,13 @@
-export function stringCompare(a, b) {
-    if (a === b) {
-        return 0;
-    }
-    if (a < b) {
-        return -1;
-    }
-    return 1;
+function stringCompare(a, b) {
+  if (a === b) {
+    return 0;
+  }
+  if (a < b) {
+    return -1;
+  }
+  return 1;
 }
-//# sourceMappingURL=string-compare.js.map
+export {
+  stringCompare
+};
+//# sourceMappingURL=string-compare.js.map

package/out/shared/src/string-compare.js.map

@@ -1 +1 @@
-{"version":3,"file":"string-compare.js","sourceRoot":"","sources":["../../../../shared/src/string-compare.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,aAAa,CAAC,CAAS,EAAE,CAAS;IAChD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}
+{"version":3,"file":"string-compare.js","sources":["../../../../shared/src/string-compare.ts"],"sourcesContent":["export function stringCompare(a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  }\n  if (a < b) {\n    return -1;\n  }\n  return 1;\n}\n"],"names":[],"mappings":"AAAO,SAAS,cAAc,GAAW,GAAmB;AAC1D,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,MAAI,IAAI,GAAG;AACT,WAAO;AAAA,EACT;AACA,SAAO;AACT;"}

package/out/shared/src/subscribable.js

@@ -0,0 +1,34 @@
+class Subscribable {
+  _listeners = /* @__PURE__ */ new Set();
+  /**
+   * Subscribe to the subscribable.
+   *
+   * @param listener - The listener to subscribe to.
+   * @returns A function to unsubscribe from the subscribable.
+   */
+  subscribe = (listener) => {
+    this._listeners.add(listener);
+    return () => {
+      this._listeners.delete(listener);
+    };
+  };
+  /**
+   * Notify all listeners.
+   *
+   * @param update - The update to notify listeners with.
+   */
+  notify = (update) => {
+    this._listeners.forEach((listener) => listener(update));
+  };
+  hasListeners = () => this._listeners.size > 0;
+  /**
+   * Unsubscribe all listeners.
+   */
+  cleanup = () => {
+    this._listeners.clear();
+  };
+}
+export {
+  Subscribable
+};
+//# sourceMappingURL=subscribable.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"subscribable.js","sources":["../../../../shared/src/subscribable.ts"],"sourcesContent":["export class Subscribable<\n  TArgs,\n  TListener extends (obj: TArgs) => unknown = (obj: TArgs) => unknown,\n> {\n  protected _listeners = new Set<TListener>();\n\n  /**\n   * Subscribe to the subscribable.\n   *\n   * @param listener - The listener to subscribe to.\n   * @returns A function to unsubscribe from the subscribable.\n   */\n  subscribe = (listener: TListener): (() => void) => {\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  };\n\n  /**\n   * Notify all listeners.\n   *\n   * @param update - The update to notify listeners with.\n   */\n  notify = (update: TArgs): void => {\n    this._listeners.forEach(listener => listener(update));\n  };\n\n  hasListeners = (): boolean => this._listeners.size > 0;\n\n  /**\n   * Unsubscribe all listeners.\n   */\n  cleanup = (): void => {\n    this._listeners.clear();\n  };\n}\n"],"names":[],"mappings":"AAAO,MAAM,aAGX;AAAA,EACU,iCAAiB,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3B,YAAY,CAAC,aAAsC;AACjD,SAAK,WAAW,IAAI,QAAQ;AAE5B,WAAO,MAAM;AACX,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,CAAC,WAAwB;AAChC,SAAK,WAAW,QAAQ,CAAA,aAAY,SAAS,MAAM,CAAC;AAAA,EACtD;AAAA,EAEA,eAAe,MAAe,KAAK,WAAW,OAAO;AAAA;AAAA;AAAA;AAAA,EAKrD,UAAU,MAAY;AACpB,SAAK,WAAW,MAAA;AAAA,EAClB;AACF;"}

package/out/shared/src/tdigest-schema.js

@@ -1,7 +1,7 @@
-import * as v from "./valita.js";
-/**
- * Valita schema for TDigest JSON representation.
- * Matches the structure returned by TDigest.toJSON().
- */
-export const tdigestSchema = v.tuple([v.number()]).concat(v.array(v.number()));
-//# sourceMappingURL=tdigest-schema.js.map
+import "./valita.js";
+import { tuple, number, array } from "@badrap/valita";
+const tdigestSchema = tuple([number()]).concat(array(number()));
+export {
+  tdigestSchema
+};
+//# sourceMappingURL=tdigest-schema.js.map

package/out/shared/src/tdigest-schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"tdigest-schema.js","sourceRoot":"","sources":["../../../../shared/src/tdigest-schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAEjC;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC"}
+{"version":3,"file":"tdigest-schema.js","sources":["../../../../shared/src/tdigest-schema.ts"],"sourcesContent":["import * as v from './valita.ts';\n\n/**\n * Valita schema for TDigest JSON representation.\n * Matches the structure returned by TDigest.toJSON().\n */\nexport const tdigestSchema = v.tuple([v.number()]).concat(v.array(v.number()));\n\nexport type TDigestJSON = v.Infer<typeof tdigestSchema>;\n"],"names":["v.tuple","v.number","v.array"],"mappings":";;AAMO,MAAM,gBAAgBA,MAAQ,CAACC,OAAE,CAAQ,CAAC,EAAE,OAAOC,MAAQD,QAAU,CAAC;"}