@instantdb/core 0.22.86-experimental.split-store.20247691802.1 → 0.22.86-experimental.split-store.20249702529.1

package/dist/standalone/index.js

@@ -64,7 +64,7 @@ function st(t) {
 function it(t) {
   return Object.getPrototypeOf(t) === Map.prototype;
 }
-function U(t) {
+function L(t) {
   var e;
   return (e = t.copy) !== null && e !== void 0 ? e : t.original;
 }
@@ -116,7 +116,7 @@ function he(t, e, n) {
 }
 function De(t, e) {
   const n = S(t);
-  return (n ? U(n) : t)[e];
+  return (n ? L(n) : t)[e];
 }
 function Q(t, e) {
   return t === e ? t !== 0 || 1 / t === 1 / e : t !== t && e !== e;
@@ -449,13 +449,13 @@ const Ae = (t, e, n = !1) => {
     throw new Error("Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.");
 }, ze = {
   get size() {
-    return U(S(this)).size;
+    return L(S(this)).size;
   },
   has(t) {
-    return U(S(this)).has(t);
+    return L(S(this)).has(t);
   },
   set(t, e) {
-    const n = S(this), r = U(n);
+    const n = S(this), r = L(n);
     return (!r.has(t) || !Q(r.get(t), e)) && (j(n), V(n), n.assignedMap.set(t, !0), n.copy.set(t, e), ct(n, t, e, fe)), this;
   },
   delete(t) {
@@ -475,13 +475,13 @@ const Ae = (t, e, n = !1) => {
   },
   forEach(t, e) {
     const n = S(this);
-    U(n).forEach((r, s) => {
+    L(n).forEach((r, s) => {
       t.call(e, this.get(s), s, this);
     });
   },
   get(t) {
     var e, n;
-    const r = S(this), s = U(r).get(t), i = ((n = (e = r.options).mark) === null || n === void 0 ? void 0 : n.call(e, s, F)) === F.mutable;
+    const r = S(this), s = L(r).get(t), i = ((n = (e = r.options).mark) === null || n === void 0 ? void 0 : n.call(e, s, F)) === F.mutable;
     if (r.options.strict && Ae(s, r.options, i), i || r.finalized || !q(s, r.options) || s !== r.original.get(t))
       return s;
     const o = rt.createDraft({
@@ -494,7 +494,7 @@ const Ae = (t, e, n = !1) => {
     return j(r), r.copy.set(t, o), o;
   },
   keys() {
-    return U(S(this)).keys();
+    return L(S(this)).keys();
   },
   values() {
     const t = this.keys();
@@ -653,7 +653,7 @@ const rr = Reflect.ownKeys(ve), rn = /* @__PURE__ */ new WeakSet(), sn = {
       if (o = t.options.mark(u, F), o === F.mutable)
         return t.options.strict && Ae(u, t.options, !0), u;
     }
-    const a = U(t);
+    const a = L(t);
     if (a instanceof Map && nr.includes(e)) {
       if (e === "size")
         return Object.getOwnPropertyDescriptor(ze, "size").get.call(t.proxy);
@@ -700,20 +700,20 @@ const rr = Reflect.ownKeys(ve), rn = /* @__PURE__ */ new WeakSet(), sn = {
     let s;
     if (t.type === 1 && e !== "length" && !(Number.isInteger(s = Number(e)) && s >= 0 && (e === 0 || s === 0 || String(s) === String(e))))
       throw new Error("Only supports setting array indices and the 'length' property.");
-    const i = wt(U(t), e);
+    const i = wt(L(t), e);
     if (i != null && i.set)
       return i.set.call(t.proxy, n), !0;
-    const o = De(U(t), e), a = S(o);
+    const o = De(L(t), e), a = S(o);
     return a && Q(a.original, n) ? (t.copy[e] = n, t.assignedMap = (r = t.assignedMap) !== null && r !== void 0 ? r : /* @__PURE__ */ new Map(), t.assignedMap.set(e, !1), !0) : (Q(n, o) && (n !== void 0 || ce(t.original, e)) || (j(t), V(t), ce(t.original, e) && Q(n, t.original[e]) ? t.assignedMap.delete(e) : t.assignedMap.set(e, !0), t.copy[e] = n, ct(t, e, n, fe)), !0);
   },
   has(t, e) {
-    return e in U(t);
+    return e in L(t);
   },
   ownKeys(t) {
-    return Reflect.ownKeys(U(t));
+    return Reflect.ownKeys(L(t));
   },
   getOwnPropertyDescriptor(t, e) {
-    const n = U(t), r = Reflect.getOwnPropertyDescriptor(n, e);
+    const n = L(t), r = Reflect.getOwnPropertyDescriptor(n, e);
     return r && {
       writable: !0,
       configurable: t.type !== 1 || e !== "length",
@@ -877,9 +877,9 @@ const or = (t) => function e(n, r, s) {
     for (const M of l.mark) {
       if (typeof M != "function")
         throw new Error(`Invalid mark: ${M}, 'mark' should be a function.`);
-      const x = M(m, O);
-      if (x)
-        return x;
+      const U = M(m, O);
+      if (U)
+        return U;
     }
   } : l.mark, h = (i = l.enablePatches) !== null && i !== void 0 ? i : !1, p = (o = l.strict) !== null && o !== void 0 ? o : !1, b = {
     enableAutoFreeze: (a = l.enableAutoFreeze) !== null && a !== void 0 ? a : !1,
@@ -906,9 +906,9 @@ const or = (t) => function e(n, r, s) {
     if (!J(m)) {
       if (m !== void 0 && !Q(m, g) && (O != null && O.operated))
         throw new Error("Either the value is returned as a new non-draft value, or only the draft is modified without returning any value.");
-      const x = m == null ? void 0 : m[Bn];
-      if (x) {
-        const $e = x[0];
+      const U = m == null ? void 0 : m[Bn];
+      if (U) {
+        const $e = U[0];
         return b.strict && typeof m == "object" && m !== null && Ve({
           rootDraft: O,
           value: m,
@@ -1372,7 +1372,7 @@ class H {
     for (const e of Object.values(this.attrs))
       if (dt(e)) {
         const [n, r, s] = e["forward-identity"];
-        L(this.blobAttrs, [r, s], e);
+        D(this.blobAttrs, [r, s], e);
       }
     return this._blobAttrs;
   }
@@ -1383,7 +1383,7 @@ class H {
     for (const e of Object.values(this.attrs))
       if (e["primary?"]) {
         const [n, r] = e["forward-identity"];
-        L(this._primaryKeys, [r], e);
+        D(this._primaryKeys, [r], e);
       }
     return this._primaryKeys;
   }
@@ -1393,7 +1393,7 @@ class H {
     this._forwardIdents = /* @__PURE__ */ new Map();
     for (const e of Object.values(this.attrs)) {
       const n = e["forward-identity"], [r, s, i] = n;
-      L(this._forwardIdents, [s, i], e);
+      D(this._forwardIdents, [s, i], e);
     }
     return this._forwardIdents;
   }
@@ -1405,7 +1405,7 @@ class H {
       const n = e["reverse-identity"];
       if (n) {
         const [r, s, i] = n;
-        L(this._revIdents, [s, i], e);
+        D(this._revIdents, [s, i], e);
       }
     }
     return this._revIdents;
@@ -1435,7 +1435,7 @@ function K(t, e) {
   const [n, ...r] = e;
   t.has(n) && K(t.get(n), r);
 }
-function L(t, e, n) {
+function D(t, e, n) {
   let r = t;
   const s = e.length - 1;
   for (let i = 0; i < s; i++) {
@@ -1454,13 +1454,13 @@ function ln(t, e, n) {
       console.warn("no such attr", c, a);
       continue;
     }
-    l["checked-data-type"] === "date" && n && (u = Ie(u), o[2] = u), ft(l) && L(i, [u, c, a], o), L(r, [a, c, u], o), L(s, [c, a, u], o);
+    l["checked-data-type"] === "date" && n && (u = Ie(u), o[2] = u), ft(l) && D(i, [u, c, a], o), D(r, [a, c, u], o), D(s, [c, a, u], o);
   }
   return { eav: r, aev: s, vae: i };
 }
 function fn(t) {
   return {
-    triples: D(t.eav, 3),
+    triples: R(t.eav, 3),
     cardinalityInference: t.cardinalityInference,
     useDateObjects: t.useDateObjects,
     version: 1
@@ -1498,7 +1498,7 @@ function pe(t, e) {
     const [o, a] = e[0], c = t.aev.get(o);
     if (!c)
       return null;
-    n = (s = D(c, 2).find((l) => l[2] === a)) == null ? void 0 : s[0];
+    n = (s = R(c, 2).find((l) => l[2] === a)) == null ? void 0 : s[0];
   } else
     n = e[0];
   if (!n)
@@ -1508,7 +1508,7 @@ function pe(t, e) {
     const [o, a] = r, c = t.aev.get(o);
     if (!c)
       return null;
-    const l = (i = D(c, 2).find((y) => y[2] === a)) == null ? void 0 : i[0];
+    const l = (i = R(c, 2).find((y) => y[2] === a)) == null ? void 0 : i[0];
     if (!l)
       return null;
     const [f, d, h, ...p] = e;
@@ -1542,7 +1542,7 @@ function bn(t, e, n) {
     return;
   a["checked-data-type"] === "date" && t.useDateObjects && (o = Ie(o));
   const c = re(t.eav, [s, i, o]), u = (c == null ? void 0 : c[3]) ?? yn(t, a, r), l = [s, i, o, u];
-  kr(a) ? (L(t.eav, [s, i], /* @__PURE__ */ new Map([[o, l]])), L(t.aev, [i, s], /* @__PURE__ */ new Map([[o, l]]))) : (L(t.eav, [s, i, o], l), L(t.aev, [i, s, o], l)), ft(a) && L(t.vae, [o, i, s], l);
+  kr(a) ? (D(t.eav, [s, i], /* @__PURE__ */ new Map([[o, l]])), D(t.aev, [i, s], /* @__PURE__ */ new Map([[o, l]]))) : (D(t.eav, [s, i, o], l), D(t.aev, [i, s, o], l)), ft(a) && D(t.vae, [o, i, s], l);
 }
 function Cr(t, e, n) {
   var h;
@@ -1563,7 +1563,7 @@ function Cr(t, e, n) {
     f,
     yn(t, a, u)
   ];
-  L(t.eav, [s, i], /* @__PURE__ */ new Map([[f, d]]));
+  D(t.eav, [s, i], /* @__PURE__ */ new Map([[f, d]])), D(t.aev, [i, s], /* @__PURE__ */ new Map([[f, d]]));
 }
 function Qe(t, e, n) {
   var u, l;
@@ -1574,7 +1574,7 @@ function Qe(t, e, n) {
   if (a) {
     for (const f of a.keys()) {
       const d = e.getAttr(f);
-      d && d["on-delete-reverse"] === "cascade" && D(a.get(f), 1).forEach(
+      d && d["on-delete-reverse"] === "cascade" && R(a.get(f), 1).forEach(
         ([h, p, y]) => {
           var b;
           return Qe(t, e, [y, (b = d["reverse-identity"]) == null ? void 0 : b[1]]);
@@ -1587,7 +1587,7 @@ function Qe(t, e, n) {
     }
     a.size === 0 && K(t.eav, [o]);
   }
-  const c = t.vae.get(o) && D(t.vae.get(o), 2);
+  const c = t.vae.get(o) && R(t.vae.get(o), 2);
   c && c.forEach((f) => {
     var b, g, _;
     const [d, h, p] = f, y = e.getAttr(h);
@@ -1608,7 +1608,7 @@ function Mr(t, [e]) {
   t.addAttr(e);
 }
 function gn(t) {
-  return D(t.eav, 3);
+  return R(t.eav, 3);
 }
 function Pr(t, e, [n]) {
   if (!e.getAttr(n)) return;
@@ -1650,7 +1650,7 @@ function $r(t, e, n) {
       throw new Error(`unhandled transaction action: ${r}`);
   }
 }
-function D(t, e, n = []) {
+function R(t, e, n = []) {
   if (!t || e === 0)
     return n;
   if (e === 1) {
@@ -1659,7 +1659,7 @@ function D(t, e, n = []) {
     return n;
   }
   for (const r of t.values())
-    D(r, e - 1, n);
+    R(r, e - 1, n);
   return n;
 }
 function ye(t, e, n) {
@@ -1687,7 +1687,7 @@ function ye(t, e, n) {
     return r;
   }
   if (n != null && n.$comparator)
-    return D(e, 1).filter(n.$op);
+    return R(e, 1).filter(n.$op);
   const s = n.in || n.$in || [n];
   for (const o of s) {
     const a = e.get(o);
@@ -1704,11 +1704,11 @@ function Rr(t, [e, n, r]) {
   switch (Dr(e, n, r)) {
     case "e": {
       const a = t.eav.get(e);
-      return D(a, 2);
+      return R(a, 2);
     }
     case "ea": {
       const a = (i = t.eav.get(e)) == null ? void 0 : i.get(n);
-      return D(a, 1);
+      return R(a, 1);
     }
     case "eav": {
       const a = (o = t.eav.get(e)) == null ? void 0 : o.get(n);
@@ -1725,7 +1725,7 @@ function Rr(t, [e, n, r]) {
     }
     case "a": {
       const a = t.aev.get(n);
-      return D(a, 2);
+      return R(a, 2);
     }
     case "av": {
       const a = t.aev.get(n);
@@ -1744,7 +1744,7 @@ function Rr(t, [e, n, r]) {
       return a;
     }
     default:
-      return D(t.eav, 3);
+      return R(t.eav, 3);
   }
 }
 function xr(t, e, n) {
@@ -1753,7 +1753,7 @@ function xr(t, e, n) {
   if (!e)
     return r;
   for (const [i, o] of e.entries()) {
-    const a = (s = t.eav.get(n)) == null ? void 0 : s.get(o.id), c = D(a, 1);
+    const a = (s = t.eav.get(n)) == null ? void 0 : s.get(o.id), c = R(a, 1);
     for (const u of c)
       r[i] = u[2];
   }
@@ -2323,8 +2323,8 @@ function Cs(t, e, { etype: n, pageInfo: r, dq: s, form: i }) {
   if (f && ((y = f == null ? void 0 : f["forward-identity"]) == null ? void 0 : y[2]) !== "id") {
     const b = f["checked-data-type"] === "date", g = f.id;
     u = u.map(([_]) => {
-      var A, m, O, M, x;
-      let T = (x = (M = (O = (m = (A = t.eav.get(_)) == null ? void 0 : A.get(g)) == null ? void 0 : m.values()) == null ? void 0 : O.next()) == null ? void 0 : M.value) == null ? void 0 : x[2];
+      var A, m, O, M, U;
+      let T = (U = (M = (O = (m = (A = t.eav.get(_)) == null ? void 0 : A.get(g)) == null ? void 0 : m.values()) == null ? void 0 : O.next()) == null ? void 0 : M.value) == null ? void 0 : U[2];
       return b && (T = He(T)), [_, T];
     });
   }
@@ -2539,7 +2539,7 @@ function Ks(t, e, n) {
 function Ze(t) {
   return typeof t == "string" && !Ee(t) ? null : typeof t == "string" && Ee(t) ? kn(t) : Fs(t);
 }
-function R(t, e, n) {
+function x(t, e, n) {
   const r = Ze(n);
   if (r === null)
     return n;
@@ -2550,7 +2550,7 @@ function R(t, e, n) {
 }
 function In(t, e, n, r) {
   var o;
-  const s = R(t, e, n);
+  const s = x(t, e, n);
   return Array.isArray(s) ? [[
     "add-triple",
     s,
@@ -2563,18 +2563,18 @@ function qs({ attrsStore: t }, [e, n, r]) {
     const a = Array.isArray(o) ? o : [o], c = E(t, e, i), u = Z(t, e, i);
     return a.map((l) => c ? [
       "add-triple",
-      R(t, e, n),
+      x(t, e, n),
       c.id,
       // Uses `!` because if we get here, we should have created the attr if it doesn't
       // already exist
-      R(t, c["reverse-identity"][1], l)
+      x(t, c["reverse-identity"][1], l)
     ] : [
       "add-triple",
       // Uses `!` because if we get here, we should have created the attr if it doesn't
       // already exist
-      R(t, u["forward-identity"][1], l),
+      x(t, u["forward-identity"][1], l),
       u == null ? void 0 : u.id,
-      R(t, e, n)
+      x(t, e, n)
     ]);
   });
   return In(t, e, n, s);
@@ -2584,18 +2584,18 @@ function zs({ attrsStore: t }, [e, n, r]) {
     const a = Array.isArray(o) ? o : [o], c = E(t, e, i), u = Z(t, e, i);
     return a.map((l) => c ? [
       "retract-triple",
-      R(t, e, n),
+      x(t, e, n),
       c.id,
       // Uses `!` because if we get here, we should have created the attr if it doesn't
       // already exist
-      R(t, c["reverse-identity"][1], l)
+      x(t, c["reverse-identity"][1], l)
     ] : [
       "retract-triple",
       // Uses `!` because if we get here, we should have created the attr if it doesn't
       // already exist
-      R(t, u["forward-identity"][1], l),
+      x(t, u["forward-identity"][1], l),
       u.id,
-      R(t, e, n)
+      x(t, e, n)
     ]);
   });
   return In(t, e, n, s);
@@ -2607,7 +2607,7 @@ function Vs(t, e, n, r) {
     for (const a of t || []) {
       const c = a == null ? void 0 : a.aev.get(i);
       if (c) {
-        for (const [u, l, f] of D(c, 2))
+        for (const [u, l, f] of R(c, 2))
           if (f === o)
             return !0;
       }
@@ -2627,14 +2627,14 @@ function Cn({ stores: t, attrsStore: e }, [n, r, s, i]) {
   return (i == null ? void 0 : i.upsert) === !1 ? { mode: "update" } : (i == null ? void 0 : i.upsert) === !0 ? null : Vs(t, e, n, r) ? { mode: "update" } : null;
 }
 function Ws(t, e) {
-  const { attrsStore: n } = t, [r, s, i, o] = e, a = lt(i), c = R(n, r, s);
+  const { attrsStore: n } = t, [r, s, i, o] = e, a = lt(i), c = x(n, r, s);
   return [["id", c]].concat(Object.entries(a)).map(([l, f]) => {
     const d = E(n, r, l);
     return d["checked-data-type"] === "date" && t.useDateObjects && (f = Ie(f)), ["add-triple", c, d.id, f, { mode: "create" }];
   });
 }
 function Qs(t, e) {
-  const { attrsStore: n } = t, [r, s, i, o] = e, a = lt(i), c = R(n, r, s), u = Cn(t, [r, c, i, o]);
+  const { attrsStore: n } = t, [r, s, i, o] = e, a = lt(i), c = x(n, r, s), u = Cn(t, [r, c, i, o]);
   return [["id", c]].concat(Object.entries(a)).map(([f, d]) => {
     const h = E(n, r, f);
     return h["checked-data-type"] === "date" && t.useDateObjects && (d = Ie(d)), [
@@ -2647,10 +2647,10 @@ function Qs(t, e) {
   });
 }
 function Gs({ attrsStore: t }, [e, n]) {
-  return [["delete-entity", R(t, e, n), e]];
+  return [["delete-entity", x(t, e, n), e]];
 }
 function Bs(t, e) {
-  const { attrsStore: n } = t, [r, s, i, o] = e, a = lt(i), c = R(n, r, s), u = Cn(t, [r, c, i, o]), l = Object.entries(a).map(([d, h]) => {
+  const { attrsStore: n } = t, [r, s, i, o] = e, a = lt(i), c = x(n, r, s), u = Cn(t, [r, c, i, o]), l = Object.entries(a).map(([d, h]) => {
     const p = E(n, r, d);
     return [
       "deep-merge-triple",
@@ -2669,7 +2669,7 @@ function Bs(t, e) {
   ]].concat(l);
 }
 function Hs({ attrsStore: t }, [e, n, r]) {
-  return [["rule-params", R(t, e, n), e, r]];
+  return [["rule-params", x(t, e, n), e, r]];
 }
 function Js(t) {
   const [e, n, r, s, i] = t;
@@ -3639,7 +3639,7 @@ function Kt(t) {
     }, e;
   }, {});
 }
-const Rn = "v0.22.86-experimental.split-store.20247691802.1";
+const Rn = "v0.22.86-experimental.split-store.20249702529.1";
 function Mi(t, e) {
   return {
     info: t ? (...n) => console.info(...n, e()) : () => {
@@ -5300,13 +5300,13 @@ class oo {
         });
         const b = Jt(y.entries()), g = d.map((_) => {
           var yt, bt, _t, gt;
-          const T = _["instaql-query"], A = _["instaql-result"], m = P(T), O = Nt(A), M = this.ensureAttrs(), x = Se(
+          const T = _["instaql-query"], A = _["instaql-result"], m = P(T), O = Nt(A), M = this.ensureAttrs(), U = Se(
             M,
             O,
             r,
             this.config.useDateObjects
           ), { store: $e, attrsStore: zn } = this._applyOptimisticUpdates(
-            x,
+            U,
             M,
             b,
             p
@@ -5322,12 +5322,12 @@ class oo {
         });
         g.forEach(
           ({ hash: _, q: T, store: A, attrsStore: m, pageInfo: O, aggregate: M }) => {
-            this.querySubs.updateInPlace((x) => {
-              if (!x[_]) {
+            this.querySubs.updateInPlace((U) => {
+              if (!U[_]) {
                 this._log.error("Missing value in querySubs", { hash: _, q: T });
                 return;
               }
-              x[_].result = {
+              U[_].result = {
                 store: A,
                 attrsStore: m,
                 pageInfo: O,
@@ -5364,7 +5364,7 @@ class oo {
             b.push(_);
           }
         if (b.length) {
-          const g = Object.values(this.ensureAttrs());
+          const g = Object.values(this.ensureAttrs().attrs);
           this._setAttrs([...g, ...b]), this._setAttrs(b);
         }
         this._finishTransaction("synced", d), this._cleanupPendingMutationsTimeout();
@@ -5918,7 +5918,7 @@ class oo {
   notifyAttrsSubs() {
     if (!this.attrs) return;
     const e = this.optimisticAttrs();
-    this.attrsCbs.forEach((n) => n(e));
+    this.attrsCbs.forEach((n) => n(e.attrs));
   }
   notifyConnectionStatusSubs(e) {
     this.connectionStatusCbs.forEach((n) => n(e));