@ebbjs/storage 1.0.0 → 1.1.0

package/dist/replica/index.js

@@ -1,81 +1,83 @@
-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 { l as Ee, a as Fe, f as oe, b as K, m as Ne, c as se, d as Oe, r as xe, e as ke, w as Se, R as je, i as Ce, g as re, h as Pe, j as Ae, k as De, n as ie, o as Re, p as Le, q as Ke, s as Ve, t as B, u as Ue, v as Ye, x as J } from "../replica-record-BaptWabD.js";
+import { y as st } from "../replica-record-BaptWabD.js";
 import { isFieldMap as ce } from "@ebbjs/core";
-const fe = (c, f) => {
-  if (c === f) return !0;
-  const a = ce(c), l = ce(f);
-  if (a !== l || !a || !l) return !1;
-  const p = Object.keys(c.map), d = Object.keys(f.map);
-  if (p.length !== d.length) return !1;
-  for (const h of p) {
-    const y = c.map[h], k = f.map[h];
-    if (y === void 0 || k === void 0 || !fe(y, k)) return !1;
+const ae = (c, a) => {
+  if (c === a) return !0;
+  const u = ce(c), l = ce(a);
+  if (u !== l || !u || !l) return !1;
+  const p = Object.keys(c.map), y = Object.keys(a.map);
+  if (p.length !== y.length) return !1;
+  for (const m of p) {
+    const h = c.map[m], I = a.map[m];
+    if (h === void 0 || I === void 0 || !ae(h, I)) return !1;
   }
   return !0;
-}, Ae = (c, f) => {
-  const a = Object.keys(c);
-  if (a.length !== Object.keys(f).length) return !1;
-  for (const l of a) {
-    const p = c[l], d = f[l];
-    if (p === void 0 || d === void 0 || !fe(p, d)) return !1;
+}, ze = (c, a) => {
+  const u = Object.keys(c);
+  if (u.length !== Object.keys(a).length) return !1;
+  for (const l of u) {
+    const p = c[l], y = a[l];
+    if (p === void 0 || y === void 0 || !ae(p, y)) return !1;
   }
   return !0;
-}, U = (c) => c == null, Re = (c, f) => U(c) || U(f) ? U(c) !== U(f) : c.type !== f.type || c.updated_hlc !== f.updated_hlc || c.deleted_hlc !== f.deleted_hlc ? !0 : !Ae(c.data.fields, f.data.fields), Ce = {
+}, V = (c) => c == null, Be = (c, a) => V(c) || V(a) ? V(c) !== V(a) : c.type !== a.type || c.exists !== a.exists || c.created_hlc !== a.created_hlc || c.updated_hlc !== a.updated_hlc || c.deleted_hlc !== a.deleted_hlc ? !0 : !ze(c.data.fields, a.data.fields), Je = {
   holds: () => !0
-}, De = 1024, Le = 16, Ke = 3e4, le = (c, f) => c === void 0 ? f : !Number.isFinite(c) || c <= 0 ? Number.POSITIVE_INFINITY : Math.max(1, Math.floor(c)), Ve = (c) => c === void 0 ? Ke : !Number.isFinite(c) || c <= 0 ? Number.POSITIVE_INFINITY : c, Ue = (c) => {
+}, He = 1024, We = 16, Ge = 3e4, le = (c, a) => c === void 0 ? a : !Number.isFinite(c) || c <= 0 ? Number.POSITIVE_INFINITY : Math.max(1, Math.floor(c)), Qe = (c) => c === void 0 ? Ge : !Number.isFinite(c) || c <= 0 ? Number.POSITIVE_INFINITY : c, Xe = (c) => {
   typeof c == "object" && "unref" in c && typeof c.unref == "function" && c.unref();
-}, 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;
+}, tt = (c) => {
+  const a = c?.materialization ?? Je, u = (e) => a.holds(e), l = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map();
+  let y = /* @__PURE__ */ new Map();
+  const m = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map(), I = /* @__PURE__ */ new Map(), fe = le(c?.journalCapacity, He), ue = le(c?.pinnedCapacity, We), H = Qe(c?.pinnedTtlMs), g = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), j = /* @__PURE__ */ new Map();
+  let W = 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)
+  let w = [], b = 0, O = {}, M = {}, d = 0, x = 0, F = 0;
+  const U = /* @__PURE__ */ new Set(), N = () => {
+    for (const e of U)
       try {
         e();
       } catch (t) {
         console.error("[Replica] change listener threw:", t);
       }
-  }, P = (e, t) => {
+  }, C = (e, t) => {
     const s = p.get(e);
     s === void 0 ? p.set(e, /* @__PURE__ */ new Set([t])) : s.add(t);
-  }, x = (e, t) => {
+  }, P = (e, t) => {
     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) => {
+  }, G = (e) => u(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), E.delete(e), S.set(e, ++G));
-  }, X = (e) => {
+  }, Y = (e) => {
+    v.has(e) && (v.delete(e), E.delete(e), j.set(e, ++W));
+  }, Q = (e) => {
     A(e), g.set(e, { open: !0, timer: null });
     const t = [];
     for (const s of g.keys()) {
-      if (g.size - t.length <= ae) break;
+      if (g.size - t.length <= ue) break;
       t.push(s);
     }
-    t.length > 0 && j(t);
-  }, ue = (e) => {
+    t.length > 0 && k(t);
+  }, de = (e) => {
     const t = g.get(e);
     if (!(t === void 0 || !t.open)) {
-      if (t.open = !1, !Number.isFinite(W)) {
-        j([e]);
+      if (t.open = !1, !Number.isFinite(H)) {
+        k([e]);
         return;
       }
-      t.timer = setTimeout(() => j([e]), W), Ue(t.timer);
+      t.timer = setTimeout(() => k([e]), H), Xe(t.timer);
     }
-  }, 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) => {
+  }, pe = (e) => g.get(e)?.open === !0, X = (e, t, s) => {
+    d += 1, w.push({ revision: d, id: e, deleted: t, components: s }), he();
+  }, Z = () => w.length - b, he = () => {
+    const e = Z() - fe;
+    e <= 0 || (b += e, x = w[b - 1].revision, b * 2 >= w.length && (w = w.slice(b), b = 0));
+  }, D = (e) => h.has(e) ? h.get(e) ?? null : l.get(e) ?? null, R = (e) => h.has(e) ? h.get(e) ?? void 0 : l.get(e), $ = (e) => {
     const t = new Set(p.get(e) ?? []);
     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 o = D(n);
+      const o = R(n);
       o !== void 0 && s.push(o);
     }
     return s;
@@ -83,124 +85,128 @@ const fe = (c, f) => {
     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)) {
+    const o = e.subject_id, r = l.get(o) ?? null, i = Ue(e, r);
+    if (!u(i) && !g.has(o) && v.has(o)) {
       q(E, { update: e, gsn: t, hlc: s, position: n });
       return;
     }
-    const r = l.get(o) ?? null, i = J(r, e, t, s, H);
-    if (i === null) {
-      if (!a(e.subject_type) && !g.has(o)) return;
-      q(y, { update: e, gsn: t, hlc: s, position: n });
+    const f = B(r, e, t, s, J);
+    if (f === null) {
+      if (!u(i) && !g.has(o)) return;
+      q(I, { update: e, gsn: t, hlc: s, position: n });
       return;
     }
-    if (!Q(i)) {
-      r !== null && (l.delete(o), x(r.type, o)), e.method === "put" && y.delete(o);
+    if (!G(f)) {
+      r !== null && (l.delete(o), P(r.type, o)), r === null && I.delete(o);
       return;
     }
-    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(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(o, T), i.type !== T.type && (x(i.type, o), P(T.type, o)));
+    if (l.set(o, f), r !== null && r.type !== f.type && P(r.type, o), C(f.type, o), r === null) {
+      const S = I.get(o);
+      if (S !== void 0) {
+        I.delete(o);
+        const _e = S.filter((T) => T.gsn > t).sort((T, Te) => T.gsn - Te.gsn);
+        let _ = f;
+        for (const T of _e)
+          _ = B(_, T.update, T.gsn, T.hlc, J) ?? _;
+        _ !== f && (l.set(o, _), f.type !== _.type && (P(f.type, o), C(_.type, o)));
       }
     }
   }, te = (e, t) => {
     const s = e ?? void 0, n = t ?? void 0;
-    N = ie(N, Pe(s, n)), m = ie(m, xe(s, n));
+    O = ie(O, Re(s, n)), M = ie(M, Le(s, n));
+    const o = Ke(s, n);
+    o !== null && (y = Ve(y, o));
   }, L = (e, t) => {
-    const s = l.get(e) ?? null, n = d.get(e);
+    const s = l.get(e) ?? null, n = m.get(e);
     let o = s;
     if (n !== void 0)
-      for (const i of n)
-        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) {
-      o !== null ? R(e, o.type, o.deleted_hlc !== null) : t !== null && R(e, t.type, !0);
+      for (const f of n)
+        o = B(o, f.update, 0, f.hlc, J);
+    const r = o !== null && G(o) ? o : null;
+    (r === null || u(r.type)) && A(e), n === void 0 || n.length === 0 ? h.delete(e) : h.set(e, r), te(t, r);
+    const i = (f) => X(e, f, Ye(t, r));
+    if (r === null) {
+      o !== null ? i(o.deleted_hlc !== null) : t !== null && i(!0);
       return;
     }
-    Re(t, r) && R(e, r.type, r.deleted_hlc !== null);
-  }, B = (e, t) => {
-    e.has(t) || e.set(t, C(t));
+    Be(t, r) && i(r.deleted_hlc !== null);
+  }, z = (e, t) => {
+    e.has(t) || e.set(t, D(t));
   }, ne = (e, t) => {
     const s = [];
-    for (const [n, o] of d)
-      o.some((r) => r.actionId === e) && (B(t, n), s.push(n));
+    for (const [n, o] of m)
+      o.some((r) => r.actionId === e) && (z(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);
+      const r = (m.get(n) ?? []).filter((i) => i.actionId !== e);
+      r.length === 0 ? m.delete(n) : m.set(n, r);
     }
     return s;
-  }, he = (e, t, s) => {
+  }, ge = (e, t, s) => {
     const n = /* @__PURE__ */ new Map();
-    for (const i of t) B(n, i.subject_id);
+    for (const i of t) z(n, i.subject_id);
     const o = ne(e.id, n);
     for (const i of t) ee(i, e.gsn, e.hlc, s);
-    s > M && (M = s);
+    s > F && (F = s);
     const r = new Set(t.map((i) => i.subject_id));
     for (const i of o) r.add(i);
     for (const i of r) L(i, n.get(i) ?? null);
-    return F(), u;
-  }, ge = (e) => {
+    return N(), d;
+  }, me = (e) => {
     const t = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Set();
     for (const n of e.updates) {
       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);
+      z(t, o), s.add(o);
+      const r = { actionId: e.id, update: n, hlc: e.hlc }, i = m.get(o);
+      i === void 0 ? m.set(o, [r]) : i.push(r);
     }
     for (const n of s) L(n, t.get(n) ?? null);
-    return F(), u;
-  }, ye = (e) => {
+    return N(), d;
+  }, Ie = (e) => {
     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) => {
+    return N(), d;
+  }, k = (e) => {
     const t = /* @__PURE__ */ new Set();
     let s = !1;
     for (const n of e) {
       if (t.has(n)) continue;
-      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);
+      t.add(n), Y(n), A(n), E.delete(n);
+      const o = D(n), r = l.get(n);
+      l.delete(n), m.delete(n), h.delete(n), I.delete(n), r !== void 0 && P(r.type, n), te(o, null);
       const i = o ?? r ?? null;
-      i !== null && (s = !0, R(n, i.type, !0));
+      i !== null && (s = !0, X(n, !0, ke(i)));
     }
-    return s && F(), u;
+    return s && N(), d;
   }, ve = (e) => {
-    if (!je(e)) return u;
-    l.clear(), p.clear(), y.clear(), d.clear(), h.clear(), E.clear(), v.clear(), S.clear();
+    if (!Ce(e)) return d;
+    l.clear(), p.clear(), I.clear(), m.clear(), h.clear(), E.clear(), v.clear(), j.clear();
     for (const o of g.keys()) A(o);
-    I.length = 0, w = 0;
+    w.length = 0, b = 0;
     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 o of e.entities) {
-      if (!a(o.type)) continue;
+      if (!u(o.type)) continue;
       const r = re(o);
-      l.set(r.id, r), P(r.type, r.id);
-      const i = ke(r);
+      l.set(r.id, r), C(r.type, r.id);
+      const i = Pe(r);
       i !== null && n(t, i);
-      const b = Se(r);
-      b !== null && n(s, b);
+      const f = Ae(r);
+      f !== null && n(s, f);
     }
-    return N = t, m = s, u = e.revision > u ? e.revision : u + 1, O = u, M = e.position, F(), u;
-  }, Ie = () => {
+    return y = De(l.values()), O = t, M = s, d = e.revision > d ? e.revision : d + 1, x = d, F = e.position, N(), d;
+  }, ye = () => {
     let e = Number.POSITIVE_INFINITY;
-    for (const n of y.values())
+    for (const n of I.values())
       for (const o of n) e = Math.min(e, o.position);
-    const t = e === Number.POSITIVE_INFINITY ? M : Math.min(M, e - 1), s = [];
+    const t = e === Number.POSITIVE_INFINITY ? F : Math.min(F, e - 1), s = [];
     for (const n of l.values())
-      a(n.type) && s.push(Ne(n));
+      u(n.type) && s.push(Se(n));
     return {
-      format: Oe,
+      format: je,
       position: t,
-      revision: u,
+      revision: d,
       entities: s
     };
   }, we = () => {
@@ -210,7 +216,7 @@ const fe = (c, f) => {
     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, o += i));
+      i !== 0 && (e[r] = i, n += i, u(r) && (t[r] = i, o += i));
     }
     return {
       entities: n,
@@ -218,54 +224,54 @@ const fe = (c, f) => {
       held: o,
       heldByType: t,
       pinned: g.size,
-      revision: u,
-      position: M,
+      revision: d,
+      position: F,
       changes: Z(),
-      changeFloor: O
+      changeFloor: x
     };
-  }, me = (e) => {
-    if (e < O) return [];
+  }, be = (e) => {
+    if (e < x) return [];
     const t = [];
-    for (let s = w; s < I.length; s += 1) {
-      const n = I[s];
+    for (let s = b; s < w.length; s += 1) {
+      const n = w[s];
       n.revision > e && t.push(n);
     }
     return t;
-  }, be = (e, t, s) => {
-    const n = C(e);
-    l.set(e, t), P(t.type, e), X(e);
+  }, Me = (e, t, s) => {
+    const n = D(e);
+    l.set(e, t), C(t.type, e), Q(e);
     for (const o of s) ee(o.update, o.gsn, o.hlc, o.position);
-    L(e, n), F();
+    L(e, n), N();
   };
   return {
     get revision() {
-      return u;
+      return d;
     },
     get changeFloor() {
-      return O;
+      return x;
     },
-    get: D,
+    get: R,
     base: (e) => l.get(e),
     iterate: $,
-    isHeld: a,
+    isHeld: u,
     open: (e) => {
-      const t = D(e);
+      const t = R(e);
       if (t !== void 0)
-        return a(t.type) || X(e), Promise.resolve(t);
+        return u(t.type) || Q(e), Promise.resolve(t);
       const s = v.get(e);
       if (s !== void 0) return s;
       const n = c?.readEntity;
       if (n === void 0) return Promise.resolve(null);
-      const o = ++G;
-      S.set(e, o);
+      const o = ++W;
+      j.set(e, o);
       const r = n(e).then(
         (i) => {
-          if (v.get(e) === r && v.delete(e), S.get(e) !== o) return null;
-          const b = E.get(e) ?? [];
+          if (v.get(e) === r && v.delete(e), j.get(e) !== o) return null;
+          const f = 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;
+          if (u(i.type)) return i;
+          const S = re(i);
+          return Me(e, S, f), R(e) ?? S;
         },
         (i) => {
           throw v.get(e) === r && v.delete(e), i;
@@ -274,37 +280,38 @@ const fe = (c, f) => {
       return v.set(e, r), r;
     },
     close: (e) => {
-      const t = C(e);
+      const t = D(e);
       if (t === null) {
-        z(e);
+        Y(e);
         return;
       }
-      a(t.type) || (z(e), g.has(e) ? ue(e) : j([e]));
+      u(t.type) || (Y(e), g.has(e) ? de(e) : k([e]));
     },
-    isOpen: de,
-    changesSince: me,
+    isOpen: pe,
+    changesSince: be,
     stats: we,
-    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,
+    relationships: (e) => e.sourceId !== void 0 ? K(M[oe(e.as, e.type, e.sourceId)]) : e.targetId !== void 0 ? K(O[xe(e.as, e.type, e.targetId)]) : [],
+    components: (e) => Oe(y, e),
+    memberships: (e) => e.groupId !== void 0 ? K(O[Ne(e.groupId)]) : e.entityId !== void 0 ? K(M[se(e.entityId)]) : [],
+    relationshipLinks: (e) => Fe(M[oe(e.as, e.type, e.sourceId)]),
+    membershipLinks: (e) => Ee(M[se(e)]),
+    ingest: ge,
+    optimistic: me,
+    discard: Ie,
     load: ve,
-    toRecord: Ie,
-    evict: j,
-    subscribe: (e) => (Y.add(e), () => {
-      Y.delete(e);
+    toRecord: ye,
+    evict: k,
+    subscribe: (e) => (U.add(e), () => {
+      U.delete(e);
     })
   };
 };
 export {
-  Le as DEFAULT_PINNED_CAPACITY,
-  Ke as DEFAULT_PINNED_TTL_MS,
-  J as applyUpdate,
-  Re as contentChanged,
-  He as createReplica,
-  Qe as foldEntityAction,
-  Ce as holdAll
+  We as DEFAULT_PINNED_CAPACITY,
+  Ge as DEFAULT_PINNED_TTL_MS,
+  B as applyUpdate,
+  Be as contentChanged,
+  tt as createReplica,
+  st as foldEntityAction,
+  Je as holdAll
 };