@ebbjs/storage 0.2.0 → 1.0.0

package/dist/memory/index.js

@@ -1,7 +1,7 @@
-import { m as b, a as E, i as M, c as m } from "../cursor-record-D39emd6R.js";
-import { l as D, c as _, a as A, f as T, b as h, h as w, k as j, j as v, n as R, M as f, m as k, p as I, r as F, i as q } from "../replica-record-D3lkFACh.js";
-import { compare as C } from "@ebbjs/core";
-const O = (t, n) => {
+import { m as g, a as S, i as E, c as l } from "../cursor-record-D39emd6R.js";
+import { l as b, c as M, a as A, f as D, b as _, h as x, k as T, j as h, q as j, M as m, m as v, s as w, r as R, i as k } from "../replica-record-D5gGEoVQ.js";
+import { compare as q } from "@ebbjs/core";
+const F = (t, n) => {
   const e = /* @__PURE__ */ new Map();
   for (const [s, a] of t)
     e.set(s, new Set(a));
@@ -10,16 +10,16 @@ const O = (t, n) => {
     a ? a.add(s.subject_id) : e.set(s.subject_type, /* @__PURE__ */ new Set([s.subject_id]));
   }
   return Array.from(e.entries()).map(([s, a]) => [s, Array.from(a)]);
-}, P = () => {
+}, C = () => {
   let t = {
     actions: [],
     typeIndex: []
   };
   const n = async (e) => {
-    const s = t.actions.findIndex((d) => d.id === e.id), a = s === -1 ? void 0 : t.actions[s], o = a === void 0 ? e : { ...a, updates: b(a.updates, e.updates) }, c = a === void 0, r = c ? t.actions.length + 1 : s + 1, i = E(a?.updates ?? [], e.updates);
+    const s = t.actions.findIndex((d) => d.id === e.id), a = s === -1 ? void 0 : t.actions[s], o = a === void 0 ? e : { ...a, updates: g(a.updates, e.updates) }, c = a === void 0, r = c ? t.actions.length + 1 : s + 1, i = S(a?.updates ?? [], e.updates);
     return t = {
       actions: c ? [...t.actions, o] : t.actions.map((d) => d.id === e.id ? o : d),
-      typeIndex: O(t.typeIndex, o)
+      typeIndex: F(t.typeIndex, o)
     }, { action: o, position: r, added: i };
   };
   return {
@@ -51,7 +51,7 @@ const O = (t, n) => {
       t = { actions: [], typeIndex: [] };
     }
   };
-}, B = () => {
+}, O = () => {
   let t = {
     entities: {},
     typeIndex: {}
@@ -89,37 +89,34 @@ const O = (t, n) => {
       t = { entities: {}, typeIndex: {} };
     }
   };
-}, u = (t) => JSON.parse(JSON.stringify(t)), g = (t, n, e) => {
+}, u = (t) => JSON.parse(JSON.stringify(t)), f = (t, n, e) => {
   const s = { ...t };
   if (e && e !== n.type) {
     const a = new Set(s[e] ?? []);
     a.delete(n.id), s[e] = a;
   }
   return s[n.type] || (s[n.type] = /* @__PURE__ */ new Set()), s[n.type] = new Set(s[n.type]).add(n.id), s;
-}, S = (t, n, e) => w(
-  w(t, v(n, e)),
-  j(n, e)
-), L = (t, n) => {
+}, I = (t, n, e) => x(
+  x(t, h(n, e)),
+  T(n, e)
+), P = (t, n) => {
   let e = { entities: {}, typeIndex: {}, index: {} };
   const s = async (r) => {
     if (!await n.isDirty(r)) return;
     const d = await t.getForEntity(r);
     if (d.length === 0) return;
-    let y = null;
-    for (const p of d)
-      for (const x of p.updates)
-        x.subject_id === r && (y = R(y, x, p.gsn, p.hlc));
+    const y = j(d, r);
     if (y === null) return;
-    const l = e.entities[r];
+    const p = e.entities[r];
     e = {
       entities: { ...e.entities, [r]: u(y) },
-      typeIndex: g(e.typeIndex, y, l?.type),
-      index: S(e.index, l, y)
+      typeIndex: f(e.typeIndex, y, p?.type),
+      index: I(e.index, p, y)
     }, await n.clear(r);
   }, a = async (r) => {
     for (const i of await n.getDirtyForType(r))
       await s(i);
-  }, o = (r) => h(e.index[r]);
+  }, o = (r) => _(e.index[r]);
   return {
     async get(r) {
       await s(r);
@@ -130,8 +127,8 @@ const O = (t, n) => {
       const i = e.entities[r.id];
       e = {
         entities: { ...e.entities, [r.id]: u(r) },
-        typeIndex: g(e.typeIndex, r, i?.type),
-        index: S(e.index, i, r)
+        typeIndex: f(e.typeIndex, r, i?.type),
+        index: I(e.index, i, r)
       };
     },
     async query(r) {
@@ -142,26 +139,26 @@ const O = (t, n) => {
       type: i,
       targetId: d
     }) {
-      return await a(I), o(F(r, i, d));
+      return await a(w), o(R(r, i, d));
     },
     async queryByRelationshipSource({
       as: r,
       type: i,
       sourceId: d
     }) {
-      return await a(I), A(e.index[T(r, i, d)]);
+      return await a(w), A(e.index[D(r, i, d)]);
     },
     async queryByMembership(r) {
-      return await a(f), o(k(r));
+      return await a(m), o(v(r));
     },
     async queryByMembershipEntity(r) {
-      return await a(f), D(e.index[_(r)]);
+      return await a(m), b(e.index[M(r)]);
     },
     async reset() {
       e = { entities: {}, typeIndex: {}, index: {} };
     }
   };
-}, N = () => {
+}, B = () => {
   let t = { records: {} };
   const n = (e) => t.records[e] ?? null;
   return {
@@ -170,19 +167,19 @@ const O = (t, n) => {
     },
     async set(e, s) {
       t = {
-        records: { ...t.records, [e]: m({ ...n(e), cursor: s }) }
+        records: { ...t.records, [e]: l({ ...n(e), cursor: s }) }
       };
     },
     async getRecord(e) {
       return n(e);
     },
     async setRecord(e, s) {
-      if (M(s)) {
+      if (E(s)) {
         const { [e]: a, ...o } = t.records;
         t = { records: o };
         return;
       }
-      t = { records: { ...t.records, [e]: m(s) } };
+      t = { records: { ...t.records, [e]: l(s) } };
     },
     async records() {
       return new Map(Object.entries(t.records));
@@ -191,7 +188,7 @@ const O = (t, n) => {
       t = { records: {} };
     }
   };
-}, H = () => {
+}, L = () => {
   let t = {};
   return {
     async put(n) {
@@ -202,7 +199,7 @@ const O = (t, n) => {
       t = { ...a, [n.action.id]: structuredClone(n) };
     },
     async list() {
-      return Object.values(t).map((n) => structuredClone(n)).sort((n, e) => C(n.enqueuedAtHlc, e.enqueuedAtHlc));
+      return Object.values(t).map((n) => structuredClone(n)).sort((n, e) => q(n.enqueuedAtHlc, e.enqueuedAtHlc));
     },
     async get(n) {
       const e = t[n];
@@ -216,11 +213,11 @@ const O = (t, n) => {
       t = {};
     }
   };
-}, K = () => {
+}, N = () => {
   let t = null;
   return {
     async load() {
-      return q(t) ? t : null;
+      return k(t) ? t : null;
     },
     async save(n) {
       t = n;
@@ -229,8 +226,8 @@ const O = (t, n) => {
       t = null;
     }
   };
-}, z = () => {
-  const t = P(), n = B(), e = L(t, n), s = N(), a = H(), o = K();
+}, J = () => {
+  const t = C(), n = O(), e = P(t, n), s = B(), a = L(), o = N();
   return {
     actions: {
       async append(c) {
@@ -292,5 +289,5 @@ const O = (t, n) => {
   };
 };
 export {
-  z as createMemoryAdapter
+  J as createMemoryAdapter
 };

package/dist/replica/index.d.ts

@@ -19,6 +19,15 @@ interface MaterializeOptions {
  *   no-op, so a per-Update delivery (#473) cannot break the drain.
  */
 declare const applyUpdate: (entity: Entity | null, update: Update, gsn: number, hlc: HLCTimestamp, options?: MaterializeOptions) => Entity | null;
+/**
+ * Fold one Action's Updates for `entityId` into a row: every Update addressed
+ * to that subject, in `updates` order, under the Action's `gsn` and `hlc`.
+ * An Update for another subject belongs to a different row and is skipped.
+ *
+ * This is the replay step every EntityStore adapter runs for the row it is
+ * materializing.
+ */
+declare const foldEntityAction: (entity: Entity | null, entityId: string, action: Action) => Entity | null;
 
 /**
  * True when `next` differs from `prev` in anything a reader can observe.
@@ -267,5 +276,5 @@ declare const DEFAULT_PINNED_TTL_MS = 30000;
  */
 declare const createReplica: (options?: ReplicaOptions) => Replica;
 
-export { DEFAULT_PINNED_CAPACITY, DEFAULT_PINNED_TTL_MS, applyUpdate, contentChanged, createReplica, holdAll };
+export { DEFAULT_PINNED_CAPACITY, DEFAULT_PINNED_TTL_MS, applyUpdate, contentChanged, createReplica, foldEntityAction, holdAll };
 export type { MaterializationPolicy, MembershipQuery, RelationshipQuery, Replica, ReplicaChange, ReplicaOptions, ReplicaStats, Revision };

package/dist/replica/index.js

@@ -1,4 +1,5 @@
-import { l as _e, a as Me, f as se, b as V, m as Ee, c as oe, r as Fe, w as Ne, R as Oe, i as je, d as re, e as ke, g as Se, h as ie, j as Pe, k as xe, n as J, o as H } from "../replica-record-D3lkFACh.js";
+import { l as _e, a as Ee, f as oe, b as V, m as Me, c as se, r as Fe, w as Ne, R as Oe, i as je, d as re, e as ke, g as Se, h as ie, j as Pe, k as xe, n as J, o as H } from "../replica-record-D5gGEoVQ.js";
+import { p as Qe } from "../replica-record-D5gGEoVQ.js";
 import { isFieldMap as ce } from "@ebbjs/core";
 const fe = (c, f) => {
   if (c === f) return !0;
@@ -26,8 +27,8 @@ const fe = (c, f) => {
 }, He = (c) => {
   const f = c?.materialization ?? Ce, a = (e) => f.holds(e), l = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), k = le(c?.journalCapacity, De), ae = le(c?.pinnedCapacity, Le), W = Ve(c?.pinnedTtlMs), g = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map();
   let G = 0;
-  const M = /* @__PURE__ */ new Map();
-  let I = [], w = 0, N = {}, m = {}, u = 0, O = 0, E = 0;
+  const E = /* @__PURE__ */ new Map();
+  let I = [], w = 0, N = {}, m = {}, u = 0, O = 0, M = 0;
   const Y = /* @__PURE__ */ new Set(), F = () => {
     for (const e of Y)
       try {
@@ -36,22 +37,22 @@ const fe = (c, f) => {
         console.error("[Replica] change listener threw:", t);
       }
   }, P = (e, t) => {
-    const o = p.get(e);
-    o === void 0 ? p.set(e, /* @__PURE__ */ new Set([t])) : o.add(t);
+    const s = p.get(e);
+    s === void 0 ? p.set(e, /* @__PURE__ */ new Set([t])) : s.add(t);
   }, x = (e, t) => {
-    const o = p.get(e);
-    o !== void 0 && (o.delete(t), o.size === 0 && p.delete(e));
+    const s = p.get(e);
+    s !== void 0 && (s.delete(t), s.size === 0 && p.delete(e));
   }, Q = (e) => a(e.type) || g.has(e.id), A = (e) => {
     const t = g.get(e);
     t !== void 0 && (t.timer !== null && clearTimeout(t.timer), g.delete(e));
   }, z = (e) => {
-    v.has(e) && (v.delete(e), M.delete(e), S.set(e, ++G));
+    v.has(e) && (v.delete(e), E.delete(e), S.set(e, ++G));
   }, X = (e) => {
     A(e), g.set(e, { open: !0, timer: null });
     const t = [];
-    for (const o of g.keys()) {
+    for (const s of g.keys()) {
       if (g.size - t.length <= ae) break;
-      t.push(o);
+      t.push(s);
     }
     t.length > 0 && j(t);
   }, ue = (e) => {
@@ -63,177 +64,177 @@ const fe = (c, f) => {
       }
       t.timer = setTimeout(() => j([e]), W), Ue(t.timer);
     }
-  }, de = (e) => g.get(e)?.open === !0, R = (e, t, o) => {
-    u += 1, I.push({ revision: u, id: e, type: t, deleted: o }), pe();
+  }, de = (e) => g.get(e)?.open === !0, R = (e, t, s) => {
+    u += 1, I.push({ revision: u, id: e, type: t, deleted: s }), pe();
   }, Z = () => I.length - w, pe = () => {
     const e = Z() - k;
     e <= 0 || (w += e, O = I[w - 1].revision, w * 2 >= I.length && (I = I.slice(w), w = 0));
   }, C = (e) => h.has(e) ? h.get(e) ?? null : l.get(e) ?? null, D = (e) => h.has(e) ? h.get(e) ?? void 0 : l.get(e), $ = (e) => {
     const t = new Set(p.get(e) ?? []);
-    for (const [n, s] of h)
-      s !== null && s.type === e ? t.add(n) : t.delete(n);
-    const o = [];
+    for (const [n, o] of h)
+      o !== null && o.type === e ? t.add(n) : t.delete(n);
+    const s = [];
     for (const n of t) {
-      const s = D(n);
-      s !== void 0 && o.push(s);
+      const o = D(n);
+      o !== void 0 && s.push(o);
     }
-    return o;
+    return s;
   }, q = (e, t) => {
-    const o = t.update.subject_id, n = e.get(o);
-    n === void 0 ? e.set(o, [t]) : n.push(t);
-  }, ee = (e, t, o, n) => {
-    const s = e.subject_id;
-    if (!a(e.subject_type) && !g.has(s) && v.has(s)) {
-      q(M, { update: e, gsn: t, hlc: o, position: n });
+    const s = t.update.subject_id, n = e.get(s);
+    n === void 0 ? e.set(s, [t]) : n.push(t);
+  }, ee = (e, t, s, n) => {
+    const o = e.subject_id;
+    if (!a(e.subject_type) && !g.has(o) && v.has(o)) {
+      q(E, { update: e, gsn: t, hlc: s, position: n });
       return;
     }
-    const r = l.get(s) ?? null, i = J(r, e, t, o, H);
+    const r = l.get(o) ?? null, i = J(r, e, t, s, H);
     if (i === null) {
-      if (!a(e.subject_type) && !g.has(s)) return;
-      q(y, { update: e, gsn: t, hlc: o, position: n });
+      if (!a(e.subject_type) && !g.has(o)) return;
+      q(y, { update: e, gsn: t, hlc: s, position: n });
       return;
     }
     if (!Q(i)) {
-      r !== null && (l.delete(s), x(r.type, s)), e.method === "put" && y.delete(s);
+      r !== null && (l.delete(o), x(r.type, o)), e.method === "put" && y.delete(o);
       return;
     }
-    if (l.set(s, i), r !== null && r.type !== i.type && x(r.type, s), P(i.type, s), e.method === "put") {
-      const b = y.get(s);
+    if (l.set(o, i), r !== null && r.type !== i.type && x(r.type, o), P(i.type, o), e.method === "put") {
+      const b = y.get(o);
       if (b !== void 0) {
-        y.delete(s);
+        y.delete(o);
         const K = b.filter((_) => _.gsn > t).sort((_, Te) => _.gsn - Te.gsn);
         let T = i;
         for (const _ of K)
           T = J(T, _.update, _.gsn, _.hlc, H) ?? T;
-        T !== i && (l.set(s, T), i.type !== T.type && (x(i.type, s), P(T.type, s)));
+        T !== i && (l.set(o, T), i.type !== T.type && (x(i.type, o), P(T.type, o)));
       }
     }
   }, te = (e, t) => {
-    const o = e ?? void 0, n = t ?? void 0;
-    N = ie(N, Pe(o, n)), m = ie(m, xe(o, n));
+    const s = e ?? void 0, n = t ?? void 0;
+    N = ie(N, Pe(s, n)), m = ie(m, xe(s, n));
   }, L = (e, t) => {
-    const o = l.get(e) ?? null, n = d.get(e);
-    let s = o;
+    const s = l.get(e) ?? null, n = d.get(e);
+    let o = s;
     if (n !== void 0)
       for (const i of n)
-        s = J(s, i.update, 0, i.hlc, H);
-    const r = s !== null && Q(s) ? s : null;
+        o = J(o, i.update, 0, i.hlc, H);
+    const r = o !== null && Q(o) ? o : null;
     if ((r === null || a(r.type)) && A(e), n === void 0 || n.length === 0 ? h.delete(e) : h.set(e, r), te(t, r), r === null) {
-      s !== null ? R(e, s.type, s.deleted_hlc !== null) : t !== null && R(e, t.type, !0);
+      o !== null ? R(e, o.type, o.deleted_hlc !== null) : t !== null && R(e, t.type, !0);
       return;
     }
     Re(t, r) && R(e, r.type, r.deleted_hlc !== null);
   }, B = (e, t) => {
     e.has(t) || e.set(t, C(t));
   }, ne = (e, t) => {
-    const o = [];
-    for (const [n, s] of d)
-      s.some((r) => r.actionId === e) && (B(t, n), o.push(n));
-    for (const n of o) {
+    const s = [];
+    for (const [n, o] of d)
+      o.some((r) => r.actionId === e) && (B(t, n), s.push(n));
+    for (const n of s) {
       const r = (d.get(n) ?? []).filter((i) => i.actionId !== e);
       r.length === 0 ? d.delete(n) : d.set(n, r);
     }
-    return o;
-  }, he = (e, t, o) => {
+    return s;
+  }, he = (e, t, s) => {
     const n = /* @__PURE__ */ new Map();
     for (const i of t) B(n, i.subject_id);
-    const s = ne(e.id, n);
-    for (const i of t) ee(i, e.gsn, e.hlc, o);
-    o > E && (E = o);
+    const o = ne(e.id, n);
+    for (const i of t) ee(i, e.gsn, e.hlc, s);
+    s > M && (M = s);
     const r = new Set(t.map((i) => i.subject_id));
-    for (const i of s) r.add(i);
+    for (const i of o) r.add(i);
     for (const i of r) L(i, n.get(i) ?? null);
     return F(), u;
   }, ge = (e) => {
-    const t = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Set();
+    const t = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Set();
     for (const n of e.updates) {
-      const s = n.subject_id;
-      B(t, s), o.add(s);
-      const r = { actionId: e.id, update: n, hlc: e.hlc }, i = d.get(s);
-      i === void 0 ? d.set(s, [r]) : i.push(r);
+      const o = n.subject_id;
+      B(t, o), s.add(o);
+      const r = { actionId: e.id, update: n, hlc: e.hlc }, i = d.get(o);
+      i === void 0 ? d.set(o, [r]) : i.push(r);
     }
-    for (const n of o) L(n, t.get(n) ?? null);
+    for (const n of s) L(n, t.get(n) ?? null);
     return F(), u;
   }, ye = (e) => {
-    const t = /* @__PURE__ */ new Map(), o = ne(e, t);
-    for (const n of o) L(n, t.get(n) ?? null);
+    const t = /* @__PURE__ */ new Map(), s = ne(e, t);
+    for (const n of s) L(n, t.get(n) ?? null);
     return F(), u;
   }, j = (e) => {
     const t = /* @__PURE__ */ new Set();
-    let o = !1;
+    let s = !1;
     for (const n of e) {
       if (t.has(n)) continue;
-      t.add(n), z(n), A(n), M.delete(n);
-      const s = C(n), r = l.get(n);
-      l.delete(n), d.delete(n), h.delete(n), y.delete(n), r !== void 0 && x(r.type, n), te(s, null);
-      const i = s ?? r ?? null;
-      i !== null && (o = !0, R(n, i.type, !0));
+      t.add(n), z(n), A(n), E.delete(n);
+      const o = C(n), r = l.get(n);
+      l.delete(n), d.delete(n), h.delete(n), y.delete(n), r !== void 0 && x(r.type, n), te(o, null);
+      const i = o ?? r ?? null;
+      i !== null && (s = !0, R(n, i.type, !0));
     }
-    return o && F(), u;
+    return s && F(), u;
   }, ve = (e) => {
     if (!je(e)) return u;
-    l.clear(), p.clear(), y.clear(), d.clear(), h.clear(), M.clear(), v.clear(), S.clear();
-    for (const s of g.keys()) A(s);
+    l.clear(), p.clear(), y.clear(), d.clear(), h.clear(), E.clear(), v.clear(), S.clear();
+    for (const o of g.keys()) A(o);
     I.length = 0, w = 0;
-    const t = {}, o = {}, n = (s, r) => {
-      const i = s[r.key];
-      i === void 0 ? s[r.key] = { [r.rowId]: r.value } : i[r.rowId] = r.value;
+    const t = {}, s = {}, n = (o, r) => {
+      const i = o[r.key];
+      i === void 0 ? o[r.key] = { [r.rowId]: r.value } : i[r.rowId] = r.value;
     };
-    for (const s of e.entities) {
-      if (!a(s.type)) continue;
-      const r = re(s);
+    for (const o of e.entities) {
+      if (!a(o.type)) continue;
+      const r = re(o);
       l.set(r.id, r), P(r.type, r.id);
       const i = ke(r);
       i !== null && n(t, i);
       const b = Se(r);
-      b !== null && n(o, b);
+      b !== null && n(s, b);
     }
-    return N = t, m = o, u = e.revision > u ? e.revision : u + 1, O = u, E = e.position, F(), u;
+    return N = t, m = s, u = e.revision > u ? e.revision : u + 1, O = u, M = e.position, F(), u;
   }, Ie = () => {
     let e = Number.POSITIVE_INFINITY;
     for (const n of y.values())
-      for (const s of n) e = Math.min(e, s.position);
-    const t = e === Number.POSITIVE_INFINITY ? E : Math.min(E, e - 1), o = [];
+      for (const o of n) e = Math.min(e, o.position);
+    const t = e === Number.POSITIVE_INFINITY ? M : Math.min(M, e - 1), s = [];
     for (const n of l.values())
-      a(n.type) && o.push(Ne(n));
+      a(n.type) && s.push(Ne(n));
     return {
       format: Oe,
       position: t,
       revision: u,
-      entities: o
+      entities: s
     };
   }, we = () => {
-    const e = {}, t = {}, o = new Set(p.keys());
+    const e = {}, t = {}, s = new Set(p.keys());
     for (const r of h.values())
-      r !== null && o.add(r.type);
-    let n = 0, s = 0;
-    for (const r of o) {
+      r !== null && s.add(r.type);
+    let n = 0, o = 0;
+    for (const r of s) {
       const i = $(r).length;
-      i !== 0 && (e[r] = i, n += i, a(r) && (t[r] = i, s += i));
+      i !== 0 && (e[r] = i, n += i, a(r) && (t[r] = i, o += i));
     }
     return {
       entities: n,
       byType: e,
-      held: s,
+      held: o,
       heldByType: t,
       pinned: g.size,
       revision: u,
-      position: E,
+      position: M,
       changes: Z(),
       changeFloor: O
     };
   }, me = (e) => {
     if (e < O) return [];
     const t = [];
-    for (let o = w; o < I.length; o += 1) {
-      const n = I[o];
+    for (let s = w; s < I.length; s += 1) {
+      const n = I[s];
       n.revision > e && t.push(n);
     }
     return t;
-  }, be = (e, t, o) => {
+  }, be = (e, t, s) => {
     const n = C(e);
     l.set(e, t), P(t.type, e), X(e);
-    for (const s of o) ee(s.update, s.gsn, s.hlc, s.position);
+    for (const o of s) ee(o.update, o.gsn, o.hlc, o.position);
     L(e, n), F();
   };
   return {
@@ -251,17 +252,17 @@ const fe = (c, f) => {
       const t = D(e);
       if (t !== void 0)
         return a(t.type) || X(e), Promise.resolve(t);
-      const o = v.get(e);
-      if (o !== void 0) return o;
+      const s = v.get(e);
+      if (s !== void 0) return s;
       const n = c?.readEntity;
       if (n === void 0) return Promise.resolve(null);
-      const s = ++G;
-      S.set(e, s);
+      const o = ++G;
+      S.set(e, o);
       const r = n(e).then(
         (i) => {
-          if (v.get(e) === r && v.delete(e), S.get(e) !== s) return null;
-          const b = M.get(e) ?? [];
-          if (M.delete(e), i === null) return null;
+          if (v.get(e) === r && v.delete(e), S.get(e) !== o) return null;
+          const b = E.get(e) ?? [];
+          if (E.delete(e), i === null) return null;
           if (a(i.type)) return i;
           const K = re(i);
           return be(e, K, b), D(e) ?? K;
@@ -283,10 +284,10 @@ const fe = (c, f) => {
     isOpen: de,
     changesSince: me,
     stats: we,
-    relationships: (e) => e.sourceId !== void 0 ? V(m[se(e.as, e.type, e.sourceId)]) : e.targetId !== void 0 ? V(N[Fe(e.as, e.type, e.targetId)]) : [],
-    memberships: (e) => e.groupId !== void 0 ? V(N[Ee(e.groupId)]) : e.entityId !== void 0 ? V(m[oe(e.entityId)]) : [],
-    relationshipLinks: (e) => Me(m[se(e.as, e.type, e.sourceId)]),
-    membershipLinks: (e) => _e(m[oe(e)]),
+    relationships: (e) => e.sourceId !== void 0 ? V(m[oe(e.as, e.type, e.sourceId)]) : e.targetId !== void 0 ? V(N[Fe(e.as, e.type, e.targetId)]) : [],
+    memberships: (e) => e.groupId !== void 0 ? V(N[Me(e.groupId)]) : e.entityId !== void 0 ? V(m[se(e.entityId)]) : [],
+    relationshipLinks: (e) => Ee(m[oe(e.as, e.type, e.sourceId)]),
+    membershipLinks: (e) => _e(m[se(e)]),
     ingest: he,
     optimistic: ge,
     discard: ye,
@@ -304,5 +305,6 @@ export {
   J as applyUpdate,
   Re as contentChanged,
   He as createReplica,
+  Qe as foldEntityAction,
   Ce as holdAll
 };