@ebbjs/storage 0.0.0-stage → 0.1.1

package/dist/replica/index.js

@@ -0,0 +1,308 @@
+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 { 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;
+  }
+  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;
+  }
+  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 = {
+  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) => {
+  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;
+  const M = /* @__PURE__ */ new Map();
+  let I = [], w = 0, N = {}, m = {}, u = 0, O = 0, E = 0;
+  const Y = /* @__PURE__ */ new Set(), F = () => {
+    for (const e of Y)
+      try {
+        e();
+      } catch (t) {
+        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);
+  }, x = (e, t) => {
+    const o = p.get(e);
+    o !== void 0 && (o.delete(t), o.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));
+  }, X = (e) => {
+    A(e), g.set(e, { open: !0, timer: null });
+    const t = [];
+    for (const o of g.keys()) {
+      if (g.size - t.length <= ae) break;
+      t.push(o);
+    }
+    t.length > 0 && j(t);
+  }, ue = (e) => {
+    const t = g.get(e);
+    if (!(t === void 0 || !t.open)) {
+      if (t.open = !1, !Number.isFinite(W)) {
+        j([e]);
+        return;
+      }
+      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();
+  }, 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 of t) {
+      const s = D(n);
+      s !== void 0 && o.push(s);
+    }
+    return o;
+  }, 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 });
+      return;
+    }
+    const r = l.get(s) ?? null, i = J(r, e, t, o, H);
+    if (i === null) {
+      if (!a(e.subject_type) && !g.has(s)) return;
+      q(y, { update: e, gsn: t, hlc: o, position: n });
+      return;
+    }
+    if (!Q(i)) {
+      r !== null && (l.delete(s), x(r.type, s)), e.method === "put" && y.delete(s);
+      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 (b !== void 0) {
+        y.delete(s);
+        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)));
+      }
+    }
+  }, te = (e, t) => {
+    const o = e ?? void 0, n = t ?? void 0;
+    N = ie(N, Pe(o, n)), m = ie(m, xe(o, n));
+  }, L = (e, t) => {
+    const o = l.get(e) ?? null, n = d.get(e);
+    let s = o;
+    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;
+    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);
+      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 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) => {
+    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 r = new Set(t.map((i) => i.subject_id));
+    for (const i of s) 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();
+    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);
+    }
+    for (const n of o) 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);
+    return F(), u;
+  }, j = (e) => {
+    const t = /* @__PURE__ */ new Set();
+    let o = !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));
+    }
+    return o && 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);
+    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;
+    };
+    for (const s of e.entities) {
+      if (!a(s.type)) continue;
+      const r = re(s);
+      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);
+    }
+    return N = t, m = o, u = e.revision > u ? e.revision : u + 1, O = u, E = 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 n of l.values())
+      a(n.type) && o.push(Ne(n));
+    return {
+      format: Oe,
+      position: t,
+      revision: u,
+      entities: o
+    };
+  }, we = () => {
+    const e = {}, t = {}, o = 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) {
+      const i = $(r).length;
+      i !== 0 && (e[r] = i, n += i, a(r) && (t[r] = i, s += i));
+    }
+    return {
+      entities: n,
+      byType: e,
+      held: s,
+      heldByType: t,
+      pinned: g.size,
+      revision: u,
+      position: E,
+      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];
+      n.revision > e && t.push(n);
+    }
+    return t;
+  }, be = (e, t, o) => {
+    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);
+    L(e, n), F();
+  };
+  return {
+    get revision() {
+      return u;
+    },
+    get changeFloor() {
+      return O;
+    },
+    get: D,
+    base: (e) => l.get(e),
+    iterate: $,
+    isHeld: a,
+    open: (e) => {
+      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 n = c?.readEntity;
+      if (n === void 0) return Promise.resolve(null);
+      const s = ++G;
+      S.set(e, s);
+      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 (a(i.type)) return i;
+          const K = re(i);
+          return be(e, K, b), D(e) ?? K;
+        },
+        (i) => {
+          throw v.get(e) === r && v.delete(e), i;
+        }
+      );
+      return v.set(e, r), r;
+    },
+    close: (e) => {
+      const t = C(e);
+      if (t === null) {
+        z(e);
+        return;
+      }
+      a(t.type) || (z(e), g.has(e) ? ue(e) : j([e]));
+    },
+    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)]),
+    ingest: he,
+    optimistic: ge,
+    discard: ye,
+    load: ve,
+    toRecord: Ie,
+    evict: j,
+    subscribe: (e) => (Y.add(e), () => {
+      Y.delete(e);
+    })
+  };
+};
+export {
+  Le as DEFAULT_PINNED_CAPACITY,
+  Ke as DEFAULT_PINNED_TTL_MS,
+  J as applyUpdate,
+  Re as contentChanged,
+  He as createReplica,
+  Ce as holdAll
+};

package/dist/replica-record-D3lkFACh.js

@@ -0,0 +1,167 @@
+import { isFieldMap as u, mergeFieldValue as m, latestHlc as P, isFieldLeaf as D } from "@ebbjs/core";
+const L = 500, M = 64, I = /* @__PURE__ */ new WeakMap(), N = (e) => {
+  let r = 2166136261;
+  for (let t = 0; t < e.length; t += 1)
+    r ^= e.charCodeAt(t), r = Math.imul(r, 16777619) >>> 0;
+  return r >>> 0;
+}, E = (e) => N(e) % M, C = () => Array.from({ length: M }, () => ({})), R = (e, r) => {
+  let t = r;
+  const n = {
+    get map() {
+      if (t === void 0) {
+        const s = {};
+        for (const o of e) Object.assign(s, o);
+        t = s;
+      }
+      return t;
+    }
+  };
+  return I.set(n, e), n;
+}, _ = (e) => u(e) && I.has(e), H = (e) => {
+  const r = I.get(e);
+  if (r === void 0) throw new Error("not a sharded map field");
+  return r;
+}, V = (e) => e.map, W = (e) => {
+  const r = C(), t = {};
+  for (const [n, s] of Object.entries(e))
+    r[E(n)][n] = s, t[n] = s;
+  return R(r, t);
+}, b = (e) => !u(e) || _(e) ? e : Object.keys(e.map).length >= L ? W(e.map) : e, k = (e) => {
+  let r;
+  for (const [t, n] of Object.entries(e)) {
+    const s = b(n);
+    s !== n && (r === void 0 && (r = { ...e }), r[t] = s);
+  }
+  return r ?? e;
+}, K = (e) => {
+  let r;
+  for (const [t, n] of Object.entries(e))
+    !u(n) || !_(n) || (r === void 0 && (r = { ...e }), r[t] = { map: V(n) });
+  return r ?? e;
+}, Y = (e, r) => {
+  const t = H(e), n = [...t], s = /* @__PURE__ */ new Map();
+  for (const [o, d] of Object.entries(r.map)) {
+    const a = E(o), c = (s.get(a) ?? t[a])[o], F = m(c, d);
+    if (F === c) continue;
+    let i = s.get(a);
+    i === void 0 && (i = { ...t[a] }, s.set(a, i)), i[o] = F;
+  }
+  if (s.size === 0) return e;
+  for (const [o, d] of s) n[o] = d;
+  return R(n);
+}, $ = (e, r) => {
+  if (e !== void 0 && u(e) && _(e))
+    return u(r) ? Y(e, r) : r;
+  const t = m(e, r);
+  return t === e ? t : b(t);
+}, h = (e) => e.data?.fields ?? {}, de = { residentMapFields: !0 }, B = (e, r, t) => {
+  const n = h(r), s = t?.residentMapFields ? $ : m;
+  let o;
+  for (const [d, a] of Object.entries(n)) {
+    const p = o === void 0 ? e.fields[d] : o[d], c = s(p, a);
+    c !== p && (o === void 0 && (o = { ...e.fields }), o[d] = c);
+  }
+  return o === void 0 ? e : { fields: o };
+}, y = (e, r) => {
+  const t = r(e.data.fields);
+  return t === e.data.fields ? e : { ...e, data: { ...e.data, fields: t } };
+}, ae = (e) => y(e, k), ce = (e) => y(e, K), ue = (e, r, t, n, s) => {
+  switch (r.method) {
+    case "put":
+      return {
+        id: r.subject_id,
+        type: r.subject_type,
+        data: {
+          fields: s?.residentMapFields ? k(h(r)) : h(r)
+        },
+        created_hlc: n,
+        updated_hlc: n,
+        deleted_hlc: null,
+        last_gsn: t
+      };
+    case "patch":
+      return e ? e.deleted_hlc ? e : {
+        ...e,
+        data: B(e.data, r, s),
+        updated_hlc: P(e.updated_hlc, n),
+        last_gsn: Math.max(e.last_gsn, t)
+      } : null;
+    case "delete":
+      return e ? {
+        ...e,
+        deleted_hlc: n,
+        updated_hlc: n,
+        last_gsn: Math.max(e.last_gsn, t)
+      } : null;
+  }
+}, S = "relationship", f = "entityGroup", O = "groups", v = (e, r, t) => `${e}\0${r}\0${t}`, j = (e, r, t) => `
${v(e, r, t)}`, U = (e) => v(O, f, e), q = (e) => j(O, f, e), l = (e, r) => {
+  const t = e.data?.fields?.[r];
+  if (t === void 0 || !D(t)) return null;
+  const n = t.value;
+  return typeof n == "string" ? n : null;
+}, z = (e) => {
+  if (e.type !== S || e.deleted_hlc !== null) return null;
+  const r = l(e, "field"), t = l(e, "type"), n = l(e, "target_id"), s = l(e, "source_id");
+  return r === null || t === null || n === null || s === null ? null : { key: v(r, t, n), rowId: e.id, value: s };
+}, G = (e) => {
+  if (e.type !== S || e.deleted_hlc !== null) return null;
+  const r = l(e, "field"), t = l(e, "type"), n = l(e, "source_id"), s = l(e, "target_id");
+  return r === null || t === null || n === null || s === null ? null : { key: j(r, t, n), rowId: e.id, value: s };
+}, J = (e) => {
+  if (e.type !== f || e.deleted_hlc !== null) return null;
+  const r = l(e, "group_id"), t = l(e, "entity_id");
+  return r === null || t === null ? null : { key: U(r), rowId: e.id, value: t };
+}, Q = (e) => {
+  if (e.type !== f || e.deleted_hlc !== null) return null;
+  const r = l(e, "group_id"), t = l(e, "entity_id");
+  return r === null || t === null ? null : { key: q(t), rowId: e.id, value: r };
+}, X = (e) => z(e) ?? J(e), Z = (e) => G(e) ?? Q(e), ee = (e) => [...e].sort(), ie = (e) => ee(new Set(Object.values(e ?? {}))), x = (e) => Object.entries(e ?? {}).map(([r, t]) => ({ rowId: r, value: t })).sort(
+  (r, t) => r.value === t.value ? r.rowId.localeCompare(t.rowId) : r.value.localeCompare(t.value)
+), fe = (e) => x(e).map(({ rowId: r, value: t }) => ({ relationshipId: r, targetId: t })), pe = (e) => x(e).map(({ rowId: r, value: t }) => ({ membershipId: r, groupId: t })), A = (e, r, t) => {
+  const n = { ...e };
+  return t ? n[r.rowId] = r.value : delete n[r.rowId], n;
+}, re = (e, r) => A(e, r, !0), te = (e, r) => {
+  const t = A(e, r, !1);
+  return Object.keys(t).length === 0 ? null : t;
+}, ne = (e, r) => e?.key === r?.key && e?.rowId === r?.rowId && e?.value === r?.value, T = (e) => (r, t) => {
+  const n = r === void 0 ? null : e(r), s = t === void 0 ? null : e(t);
+  return ne(n, s) ? { remove: null, add: null } : { remove: n, add: s };
+}, he = T(X), me = T(Z), w = (e, r, t) => {
+  if (t === null) {
+    const n = { ...e };
+    return delete n[r.key], n;
+  }
+  return { ...e, [r.key]: t };
+}, Ie = (e, r) => {
+  if (r.remove === null && r.add === null) return e;
+  let t = e;
+  return r.remove !== null && (t = w(t, r.remove, te(t[r.remove.key], r.remove))), r.add !== null && (t = w(t, r.add, re(t[r.add.key], r.add))), t;
+}, se = 1, g = (e) => typeof e == "number" && Number.isInteger(e) && e >= 0, oe = (e) => typeof e == "object" && e !== null && typeof e.id == "string" && typeof e.type == "string", _e = (e) => {
+  if (typeof e != "object" || e === null) return !1;
+  const r = e;
+  return r.format !== se || !g(r.position) || !g(r.revision) || !Array.isArray(r.entities) ? !1 : r.entities.every(oe);
+};
+export {
+  f as M,
+  se as R,
+  fe as a,
+  ie as b,
+  q as c,
+  ae as d,
+  X as e,
+  j as f,
+  Z as g,
+  Ie as h,
+  _e as i,
+  he as j,
+  me as k,
+  pe as l,
+  U as m,
+  ue as n,
+  de as o,
+  S as p,
+  te as q,
+  v as r,
+  re as s,
+  ce as w
+};