@raphy-js/raph 1.0.0-dev.18

package/dist/debug/path/DataPath.js

@@ -0,0 +1,394 @@
+var v = Object.defineProperty;
+var S = (n, e, t) => e in n ? v(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
+var o = (n, e, t) => S(n, typeof e != "symbol" ? e + "" : e, t);
+const u = class u {
+  /**
+   * Сохраняет уже разобранный immutable path value.
+   */
+  constructor(e, t) {
+    // Хранят canonical value и разобранные сегменты пути.
+    o(this, "_canonical");
+    o(this, "_segments");
+    // Кешируют проверенные exact и mask представления.
+    o(this, "_exact");
+    o(this, "_mask");
+    this._canonical = e, this._segments = Object.freeze(
+      t.map((r) => Object.freeze({ ...r }))
+    );
+  }
+  /**
+   * Нормализует поддерживаемое определение пути в DataPath.
+   */
+  static from(e, t) {
+    return e instanceof u ? e : typeof e == "string" ? this.fromString(e, t) : this.fromPlain(e);
+  }
+  /**
+   * Разбирает строковый path согласно строгой грамматике.
+   */
+  static fromString(e, t) {
+    const r = m(
+      e,
+      t == null ? void 0 : t.vars,
+      !0,
+      (t == null ? void 0 : t.wildcardDynamic) === !0,
+      !0
+    ), s = this._cache ?? (this._cache = /* @__PURE__ */ new Map()), i = s.get(r.canonical);
+    if (i !== void 0)
+      return i;
+    s.size >= 2e4 && s.clear();
+    const c = new u(r.canonical, r.segments);
+    return s.set(r.canonical, c), c;
+  }
+  /**
+   * Восстанавливает DataPath из сериализованного представления.
+   */
+  static fromPlain(e) {
+    const r = (Array.isArray(e.segs) ? e.segs : []).map(O);
+    return new u(w(r), r);
+  }
+  /**
+   * Разбирает строку exact path без создания публичного value object.
+   * @internal
+   */
+  static _parseExactString(e, t) {
+    const r = m(e, t == null ? void 0 : t.vars, !1, !1, !0);
+    return {
+      canonical: r.canonical,
+      segments: r.segments
+    };
+  }
+  /**
+   * Разбирает строку path mask без создания публичного value object.
+   * @internal
+   */
+  static _parseMaskString(e) {
+    const t = m(e, void 0, !0, !1, !0);
+    for (let i = 0; i < t.segments.length - 1; i++) {
+      const c = t.segments[i];
+      if (c.kind === "wildcard" && !c.indexed)
+        throw new TypeError(
+          `[Raph] Dot wildcard must be the final mask segment: "${e}".`
+        );
+    }
+    const r = t.segments[t.segments.length - 1], s = (r == null ? void 0 : r.kind) === "wildcard" && !r.indexed;
+    return {
+      canonical: t.canonical,
+      deep: s,
+      segments: s ? t.segments.slice(0, -1) : t.segments
+    };
+  }
+  /**
+   * Формирует canonical path из уже проверенных сегментов.
+   * @internal
+   */
+  static _renderSegments(e) {
+    return w(e);
+  }
+  /**
+   * Сериализует path в независимое plain-представление.
+   */
+  toPlain() {
+    return {
+      segs: this._segments.map((e) => e.kind === "key" ? { t: "key", k: e.key } : e.kind === "index" ? { t: "idx", i: e.index } : e.kind === "selector" ? { t: "param", pk: e.key, pv: e.value } : { t: "wc", indexed: e.indexed }),
+      deepOnTail: b(this._segments)
+    };
+  }
+  /**
+   * Возвращает canonical строковое представление пути.
+   */
+  toStringPath() {
+    return this._canonical;
+  }
+  /**
+   * Возвращает canonical строковое представление пути.
+   */
+  toString() {
+    return this._canonical;
+  }
+  /**
+   * Возвращает immutable список сегментов пути.
+   */
+  segments() {
+    return this._segments;
+  }
+  /**
+   * Проверяет соответствие exact path указанной маске.
+   */
+  static match(e, t) {
+    const r = this.from(e)._segments, s = this.from(t)._segments;
+    let i = 0;
+    for (; i < r.length; i++) {
+      const c = r[i];
+      if (c.kind === "wildcard" && !c.indexed && i === r.length - 1)
+        return !0;
+      const a = s[i];
+      if (a === void 0 || !j(c, a))
+        return !1;
+    }
+    return i === s.length;
+  }
+  /**
+   * Возвращает exact path либо отклоняет wildcard-сегменты.
+   * @internal
+   */
+  _asExact() {
+    for (const e of this._segments)
+      if (e.kind === "wildcard")
+        throw y(this._canonical);
+    return this._exact ?? (this._exact = {
+      canonical: this._canonical,
+      segments: this._segments
+    });
+  }
+  /**
+   * Возвращает path mask с проверкой позиции wildcard.
+   * @internal
+   */
+  _asMask() {
+    for (let t = 0; t < this._segments.length - 1; t++) {
+      const r = this._segments[t];
+      if (r.kind === "wildcard" && !r.indexed)
+        throw new TypeError(
+          `[Raph] Dot wildcard must be the final mask segment: "${this._canonical}".`
+        );
+    }
+    const e = b(this._segments);
+    return this._mask ?? (this._mask = {
+      canonical: this._canonical,
+      deep: e,
+      segments: e ? this._segments.slice(0, -1) : this._segments
+    });
+  }
+};
+// Переиспользует immutable экземпляры для одинаковых canonical paths.
+o(u, "_cache");
+let k = u;
+function m(n, e, t, r = !1, s = !1) {
+  const i = n.trim();
+  if (i.length === 0) {
+    if (s)
+      return { canonical: "", segments: [] };
+    throw new TypeError("[Raph] Data path must not be empty.");
+  }
+  const c = [];
+  let a = 0, l = !0;
+  for (; a < i.length; ) {
+    const x = i[a];
+    if (x === ".") {
+      if (l)
+        throw d(n);
+      l = !0, a++;
+      continue;
+    }
+    if (x === "[") {
+      const _ = E(i, a);
+      c.push(T(
+        i.slice(a + 1, _),
+        e,
+        t,
+        r
+      )), a = _ + 1, l = !1;
+      continue;
+    }
+    if (!l)
+      throw d(n);
+    let f = a;
+    for (; f < i.length && i[f] !== "." && i[f] !== "["; )
+      f++;
+    const h = i.slice(a, f).trim();
+    if (h.length === 0)
+      throw d(n);
+    if (h === "*") {
+      if (!t)
+        throw y(n);
+      c.push({ kind: "wildcard", indexed: !1 });
+    } else r && h.startsWith("$") && !g(h.slice(1), e) ? c.push({ kind: "wildcard", indexed: !1 }) : c.push({ kind: "key", key: N(h, e) });
+    a = f, l = !1;
+  }
+  if (l || c.length === 0)
+    throw d(n);
+  return { canonical: w(c), segments: c };
+}
+function E(n, e) {
+  let t, r = 1;
+  for (let s = e + 1; s < n.length; s++) {
+    const i = n[s];
+    if (i === "\\") {
+      s++;
+      continue;
+    }
+    if (t !== void 0) {
+      i === t && (t = void 0);
+      continue;
+    }
+    if (i === '"' || i === "'") {
+      t = i;
+      continue;
+    }
+    if (i === "[") {
+      r++;
+      continue;
+    }
+    if (i === "]" && --r === 0)
+      return s;
+  }
+  throw d(n);
+}
+function T(n, e, t, r) {
+  const s = n.trim();
+  if (s === "*") {
+    if (!t)
+      throw y(`[${n}]`);
+    return { kind: "wildcard", indexed: !0 };
+  }
+  if (/^\d+$/.test(s))
+    return { kind: "index", index: Number(s) };
+  if (/^\$[A-Z_$][\w$]*$/i.test(s)) {
+    if (r && !g(s.slice(1), e))
+      return { kind: "wildcard", indexed: !0 };
+    const l = p(s.slice(1), e);
+    if (!Number.isInteger(l) || l < 0)
+      throw new TypeError(`[Raph] Index variable "${s}" must be a non-negative integer.`);
+    return { kind: "index", index: l };
+  }
+  const i = R(s);
+  if (i === -1)
+    throw d(`[${n}]`);
+  const c = s.slice(0, i).trim(), a = s.slice(i + 1).trim();
+  if (!c || !a)
+    throw d(`[${n}]`);
+  return r && I(a, e) ? { kind: "wildcard", indexed: !0 } : {
+    kind: "selector",
+    key: c,
+    value: A(a, e)
+  };
+}
+function R(n) {
+  let e;
+  for (let t = 0; t < n.length; t++) {
+    const r = n[t];
+    if (r === "\\") {
+      t++;
+      continue;
+    }
+    if (e !== void 0) {
+      r === e && (e = void 0);
+      continue;
+    }
+    if (r === '"' || r === "'")
+      e = r;
+    else if (r === "=")
+      return t;
+  }
+  return -1;
+}
+function A(n, e) {
+  if (/^\$[A-Z_$][\w$]*$/i.test(n)) {
+    const t = p(n.slice(1), e);
+    if (t === null || typeof t == "string" || typeof t == "boolean" || typeof t == "number" && Number.isFinite(t))
+      return t;
+    throw new TypeError(`[Raph] Selector variable "${n}" must be scalar.`);
+  }
+  if (n[0] === '"' || n[0] === "'")
+    return P(n);
+  if (/^-?(?:\d+(?:\.\d*)?|\.\d+)$/.test(n)) {
+    const t = Number(n);
+    if (Number.isFinite(t))
+      return t;
+  }
+  return n === "true" ? !0 : n === "false" ? !1 : n === "null" ? null : n;
+}
+function P(n) {
+  const e = n[0];
+  if (n.length < 2 || n[n.length - 1] !== e)
+    throw d(n);
+  if (e === '"')
+    try {
+      const r = JSON.parse(n);
+      if (typeof r == "string")
+        return r;
+    } catch {
+      throw d(n);
+    }
+  let t = "";
+  for (let r = 1; r < n.length - 1; r++) {
+    const s = n[r];
+    if (s === "\\") {
+      if (r++, r >= n.length - 1)
+        throw d(n);
+      t += n[r];
+    } else
+      t += s;
+  }
+  return t;
+}
+function N(n, e) {
+  if (!n.startsWith("$"))
+    return n;
+  const t = p(n.slice(1), e);
+  if (typeof t != "string" && typeof t != "number")
+    throw new TypeError(`[Raph] Key variable "${n}" must be a string or number.`);
+  const r = String(t);
+  if (!r || r.includes(".") || r.includes("[") || r.includes("]"))
+    throw new TypeError(`[Raph] Key variable "${n}" contains path syntax.`);
+  return r;
+}
+function p(n, e) {
+  if (!g(n, e))
+    throw new TypeError(`[Raph] Missing path variable "${n}".`);
+  return e[n];
+}
+function g(n, e) {
+  return e !== void 0 && Object.hasOwn(e, n);
+}
+function I(n, e) {
+  for (const t of n.matchAll(/\$([A-Z_$][\w$]*)/gi))
+    if (!g(t[1], e))
+      return !0;
+  return !1;
+}
+function O(n) {
+  if (typeof n != "object" || n === null)
+    throw $();
+  const e = n;
+  if (e.t === "key" && typeof e.k == "string")
+    return { kind: "key", key: e.k };
+  if (e.t === "idx" && typeof e.i == "number" && Number.isInteger(e.i) && e.i >= 0)
+    return { kind: "index", index: e.i };
+  if (e.t === "wc")
+    return { kind: "wildcard", indexed: e.indexed === !0 };
+  if (e.t === "param" && typeof e.pk == "string" && M(e.pv))
+    return { kind: "selector", key: e.pk, value: e.pv };
+  throw $();
+}
+function M(n) {
+  return n === null || typeof n == "string" || typeof n == "boolean" || typeof n == "number" && Number.isFinite(n);
+}
+function b(n) {
+  const e = n[n.length - 1];
+  return (e == null ? void 0 : e.kind) === "wildcard" && !e.indexed;
+}
+function j(n, e) {
+  return n.kind === "wildcard" ? !n.indexed || e.kind === "index" || e.kind === "selector" : n.kind !== e.kind ? !1 : n.kind === "key" ? n.key === e.key : n.kind === "index" ? n.index === e.index : n.key === e.key && Object.is(n.value, e.value);
+}
+function w(n) {
+  let e = "";
+  for (const t of n)
+    t.kind === "key" ? e += e ? `.${t.key}` : t.key : t.kind === "index" ? e += `[${t.index}]` : t.kind === "selector" ? e += `[${t.key}=${C(t.value)}]` : e += t.indexed ? "[*]" : e ? ".*" : "*";
+  return e;
+}
+function C(n) {
+  return typeof n == "string" ? JSON.stringify(n) : String(n);
+}
+function d(n) {
+  return new TypeError(`[Raph] Invalid data path "${n}".`);
+}
+function $() {
+  return new TypeError("[Raph] Invalid plain DataPath representation.");
+}
+function y(n) {
+  return new TypeError(`[Raph] Wildcard is only allowed in watch masks: "${n}".`);
+}
+export {
+  k as DataPath
+};

package/dist/debug/path/PathRouter.cjs

@@ -0,0 +1 @@
+"use strict";var u=Object.defineProperty;var x=(n,t,i)=>t in n?u(n,t,{enumerable:!0,configurable:!0,writable:!0,value:i}):n[t]=i;var p=(n,t,i)=>x(n,typeof t!="symbol"?t+"":t,i);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./pathSegmentKey.cjs");class g{constructor(){p(this,"_root",{})}add(t,i){let e=this._root;const o=[];for(const c of t.segments)if(c.kind==="wildcard"){const d=e.indexedWildcard??(e.indexedWildcard={});o.push({child:d,parent:e,indexedWildcard:!0}),e=d}else{const d=h.pathSegmentKey(c),a=e.exact??(e.exact=new Map);let s=a.get(d);s===void 0&&(s={},a.set(d,s)),o.push({child:s,key:d,parent:e,indexedWildcard:!1}),e=s}const r=t.deep?e.deep??(e.deep=new Set):e.end??(e.end=new Set);r.add(i);let l=!0;return()=>{if(l){l=!1,r.delete(i),r.size===0&&(t.deep?e.deep=void 0:e.end=void 0);for(let c=o.length-1;c>=0;c--){const d=o[c];if(!v(d.child))break;d.indexedWildcard?d.parent.indexedWildcard=void 0:(d.parent.exact.delete(d.key),d.parent.exact.size===0&&(d.parent.exact=void 0))}}}}match(t){var o;let i=[this._root];const e=new Set;for(let r=0;r<=t.length;r++){const l=r===t.length,c=[];for(const d of i){if(f(e,d.deep),l){f(e,d.end);continue}const a=t[r],s=(o=d.exact)==null?void 0:o.get(h.pathSegmentKey(a));s!==void 0&&c.push(s),d.indexedWildcard!==void 0&&(a.kind==="index"||a.kind==="selector")&&c.push(d.indexedWildcard)}if(l||(i=c,i.length===0))break}return e}matchAll(){const t=new Set,i=[this._root];for(;i.length;){const e=i.pop();if(f(t,e.deep),f(t,e.end),e.indexedWildcard!==void 0&&i.push(e.indexedWildcard),e.exact!==void 0)for(const o of e.exact.values())i.push(o)}return t}}function f(n,t){if(t!==void 0)for(const i of t)n.add(i)}function v(n){return n.deep===void 0&&n.end===void 0&&n.exact===void 0&&n.indexedWildcard===void 0}exports.PathRouter=g;

package/dist/debug/path/PathRouter.js

@@ -0,0 +1,86 @@
+var h = Object.defineProperty;
+var u = (n, t, i) => t in n ? h(n, t, { enumerable: !0, configurable: !0, writable: !0, value: i }) : n[t] = i;
+var p = (n, t, i) => u(n, typeof t != "symbol" ? t + "" : t, i);
+import { pathSegmentKey as x } from "./pathSegmentKey.js";
+class m {
+  constructor() {
+    // Корень trie разделяет exact и indexed-wildcard transitions.
+    p(this, "_root", {});
+  }
+  /**
+   * Регистрирует route mask и возвращает функцию удаления.
+   */
+  add(t, i) {
+    let e = this._root;
+    const o = [];
+    for (const c of t.segments)
+      if (c.kind === "wildcard") {
+        const d = e.indexedWildcard ?? (e.indexedWildcard = {});
+        o.push({ child: d, parent: e, indexedWildcard: !0 }), e = d;
+      } else {
+        const d = x(c), a = e.exact ?? (e.exact = /* @__PURE__ */ new Map());
+        let s = a.get(d);
+        s === void 0 && (s = {}, a.set(d, s)), o.push({ child: s, key: d, parent: e, indexedWildcard: !1 }), e = s;
+      }
+    const r = t.deep ? e.deep ?? (e.deep = /* @__PURE__ */ new Set()) : e.end ?? (e.end = /* @__PURE__ */ new Set());
+    r.add(i);
+    let l = !0;
+    return () => {
+      if (l) {
+        l = !1, r.delete(i), r.size === 0 && (t.deep ? e.deep = void 0 : e.end = void 0);
+        for (let c = o.length - 1; c >= 0; c--) {
+          const d = o[c];
+          if (!v(d.child))
+            break;
+          d.indexedWildcard ? d.parent.indexedWildcard = void 0 : (d.parent.exact.delete(d.key), d.parent.exact.size === 0 && (d.parent.exact = void 0));
+        }
+      }
+    };
+  }
+  /**
+   * Возвращает routes, чьи masks соответствуют указанному событию.
+   */
+  match(t) {
+    var o;
+    let i = [this._root];
+    const e = /* @__PURE__ */ new Set();
+    for (let r = 0; r <= t.length; r++) {
+      const l = r === t.length, c = [];
+      for (const d of i) {
+        if (f(e, d.deep), l) {
+          f(e, d.end);
+          continue;
+        }
+        const a = t[r], s = (o = d.exact) == null ? void 0 : o.get(x(a));
+        s !== void 0 && c.push(s), d.indexedWildcard !== void 0 && (a.kind === "index" || a.kind === "selector") && c.push(d.indexedWildcard);
+      }
+      if (l || (i = c, i.length === 0))
+        break;
+    }
+    return e;
+  }
+  /**
+   * При замене root возвращает все зарегистрированные path masks.
+   */
+  matchAll() {
+    const t = /* @__PURE__ */ new Set(), i = [this._root];
+    for (; i.length; ) {
+      const e = i.pop();
+      if (f(t, e.deep), f(t, e.end), e.indexedWildcard !== void 0 && i.push(e.indexedWildcard), e.exact !== void 0)
+        for (const o of e.exact.values())
+          i.push(o);
+    }
+    return t;
+  }
+}
+function f(n, t) {
+  if (t !== void 0)
+    for (const i of t)
+      n.add(i);
+}
+function v(n) {
+  return n.deep === void 0 && n.end === void 0 && n.exact === void 0 && n.indexedWildcard === void 0;
+}
+export {
+  m as PathRouter
+};

package/dist/debug/path/RaphKernel.cjs

@@ -0,0 +1 @@
+"use strict";var A=Object.defineProperty;var z=(m,e,t)=>e in m?A(m,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):m[e]=t;var p=(m,e,t)=>z(m,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./data-path.utils.cjs"),R=require("./DataPath.cjs"),f=require("./derived/derived-collection.utils.cjs"),I=require("./derived/DerivedRegistry.cjs"),M=require("./derived/RaphDerivedHandle.cjs"),E=require("./meta/MetaController.cjs"),C=require("./storage/AdapterPathStore.cjs"),S=require("./storage/DefaultDataAdapter.cjs"),F=require("./storage/PathStore.cjs"),b=class b{constructor(e={}){p(this,"id");p(this,"_paths");p(this,"_derivedController");p(this,"_runtimes");p(this,"_metaController");p(this,"_batchDepth",0);p(this,"_runtimeMutationDepth",0);p(this,"_stabilizing",!1);p(this,"_derivedWriteDepth",0);if(this.id=e.id??`kernel-${b._kernelCounter++}`,e.adapter!==void 0){if(e.initial!==void 0||e.adapterOptions!==void 0)throw new TypeError("[Raph] A custom adapter cannot be combined with initial or adapterOptions.");this._paths=new C.AdapterPathStore(e.adapter)}else if(e.adapterOptions!==void 0)this._paths=new C.AdapterPathStore(new S.DefaultDataAdapter(e.initial,e.adapterOptions));else{const t=this._paths=new F.PathStore;e.initial!==void 0&&t.set("",e.initial)}}get disposed(){return this._paths===void 0}getDerivedSnapshot(){var t;const e=this._derivedController;return{registrations:(e==null?void 0:e.size)??0,errors:[...(e==null?void 0:e.values())??[]].filter(r=>r.status==="error").length,pending:((t=e==null?void 0:e.pending)==null?void 0:t.size)??0,stabilizing:this._stabilizing}}get meta(){return this._metadata.facade}get(e,t){return this._store.get(e??"",t)}peek(e,t){return this._store.peek(e??"",t)}has(e,t){return this._store.has(e,t)}set(e,t,r){var s;if(this._runtimeMutationDepth===0&&this._runtimes!==void 0){this._withAttachedRuntimeBoundary(()=>this.set(e,t,r));return}this._assertWritablePath("set",e,t,r);const i=this._store;if((((s=this._metaController)==null?void 0:s.size)??0)===0){if(this._derivedController===void 0){i.set(e,t,r);return}this._mutateDerived(i,"set",e,t,r);return}this._mutateWithMetaLifecycle(()=>{this._derivedController===void 0?i.set(e,t,r):this._mutateDerived(i,"set",e,t,r),this._pruneMissingMetaOwners(e,"owner-replaced",r)})}merge(e,t,r){var s;if(this._runtimeMutationDepth===0&&this._runtimes!==void 0){this._withAttachedRuntimeBoundary(()=>this.merge(e,t,r));return}this._assertWritablePath("merge",e,t,r);const i=this._store;if((((s=this._metaController)==null?void 0:s.size)??0)===0){if(this._derivedController===void 0){i.merge(e,t,r);return}this._mutateDerived(i,"merge",e,t,r);return}this._mutateWithMetaLifecycle(()=>{this._derivedController===void 0?i.merge(e,t,r):this._mutateDerived(i,"merge",e,t,r),this._pruneMissingMetaOwners(e,"owner-replaced",r)})}delete(e,t){var i;if(this._runtimeMutationDepth===0&&this._runtimes!==void 0){this._withAttachedRuntimeBoundary(()=>this.delete(e,t));return}this._assertWritablePath("delete",e,void 0,t);const r=this._store;if((((i=this._metaController)==null?void 0:i.size)??0)===0){if(this._derivedController===void 0){r.delete(e,t);return}this._mutateDerived(r,"delete",e,void 0,t);return}r.has(e,t)&&this._mutateWithMetaLifecycle(()=>{this._derivedController===void 0?r.delete(e,t):this._mutateDerived(r,"delete",e,void 0,t);const s=this._metaPath(e,t);this._metaController.deleteSubtree(s,"owner-delete"),this._pruneMissingMetaOwners(s,"owner-delete")})}batch(e){var o;if(this._runtimeMutationDepth===0&&this._runtimes!==void 0)return this._withAttachedRuntimeBoundary(()=>this.batch(e));const t=this._store;if(this._derivedController===void 0&&!((o=this._metaController)!=null&&o.hasWatchers))return t.batch(e);let r,i,s=!1;try{r=t.batch(()=>this._runDerivedBatch(e))}catch(l){s=!0,i=l}if(s)throw i;return r}watch(e,t){return this._store.watch(e,t)}getMeta(e,t,r){var i;return this._store,t!==void 0&&this._assertMetaNamespace(t),(i=this._metaController)==null?void 0:i.get(this._metaPath(e,r),t)}hasMeta(e,t,r){var i;return this._store,t!==void 0&&this._assertMetaNamespace(t),((i=this._metaController)==null?void 0:i.has(this._metaPath(e,r),t))??!1}setMeta(e,t,r,i){if(this._runtimeMutationDepth===0&&this._runtimes!==void 0){this._withAttachedRuntimeBoundary(()=>this.setMeta(e,t,r,i));return}this._assertMetaNamespace(t);const s=this._exactMetaPath(e,i);this._assertMetaOwner(s),this._metadata.set(s,t,r,i)}mergeMeta(e,t,r,i){if(this._runtimeMutationDepth===0&&this._runtimes!==void 0){this._withAttachedRuntimeBoundary(()=>this.mergeMeta(e,t,r,i));return}this._assertMetaNamespace(t);const s=this._exactMetaPath(e,i);this._assertMetaOwner(s),this._metadata.merge(s,t,r,i)}deleteMeta(e,t,r){var s;if(this._runtimeMutationDepth===0&&this._runtimes!==void 0){this._withAttachedRuntimeBoundary(()=>this.deleteMeta(e,t,r));return}t!==void 0&&this._assertMetaNamespace(t);const i=this._exactMetaPath(e,r);(s=this._metaController)==null||s.delete(i,t,r)}_watchMeta(e,t,r={},i){return this._store,r.namespace!==void 0&&this._assertMetaNamespace(r.namespace),this._metadata.watch(e,t,r,i)}derive(e){var d,u,g;if(this._store,e.strategy!==void 0&&e.strategy.kind!=="full"&&e.strategy.kind!=="collection-by-key"&&e.strategy.kind!=="filter-by-key")throw new Error(`[Raph] Unsupported derived strategy "${String(e.strategy.kind)}".`);if(e.id!==void 0&&((d=this._derivedController)!=null&&d.has(e.id)))throw new Error(`[Raph] Duplicate derived id "${e.id}".`);const t=k.parseDataPath(e.from),r=k.parseDataPath(e.to);if(P(t,r))throw new Error("[Raph] Derived source and target must not overlap.");const i=this._derivedController??new I.DerivedRegistry,s=e.id??i.nextId(),o={...e,from:t.canonical,to:r.canonical},l=new M.RaphDerivedHandle(this,s,o),h=((u=e.strategy)==null?void 0:u.kind)==="collection-by-key"||((g=e.strategy)==null?void 0:g.kind)==="filter-by-key"?e.strategy:void 0;this._derivedController=i,i.register(l,t,h);try{e.immediate!==!1&&l.recompute()}catch(a){throw this._removeDerived(l),l._disposeFromKernel(),a}return l}_attachRuntime(e){this._store,(this._runtimes??(this._runtimes=new Set)).add(e)}_detachRuntime(e){const t=this._runtimes;t!==void 0&&(t.delete(e),t.size===0&&(this._runtimes=void 0))}dispose(){var t,r;if(this._paths===void 0)return;const e=[];if(this._runtimes!==void 0)for(const i of[...this._runtimes])try{i.dispose()}catch(s){e.push(s)}if(this._runtimes=void 0,(t=this._derivedController)==null||t.dispose(),this._derivedController=void 0,(r=this._metaController)==null||r.dispose(),this._metaController=void 0,this._paths=void 0,e.length===1)throw e[0];if(e.length>1)throw new AggregateError(e,`[Raph] Kernel "${this.id}" disposal failed.`)}_recomputeDerived(e){if(!(e.paused||e.disposed))try{this._recomputeDerivedFull(e),e._recordSuccess()}catch(t){throw e._recordFailure(t),t}}_removeDerived(e){const t=this._derivedController;t!==void 0&&(t.remove(e),t.size===0&&(this._derivedController=void 0))}get _store(){const e=this._paths;if(e!==void 0)return e;throw new Error(`[Raph] Kernel "${this.id}" is disposed.`)}get _metadata(){return this._store,this._metaController??(this._metaController=new E.MetaController(this,e=>this.has(e),()=>this._batchDepth!==0||this._stabilizing))}_withAttachedRuntimeBoundary(e){var l,h,d;const t=this._runtimes===void 0?[]:[...this._runtimes];if(t.length===0)return e();const r=[],i=[];let s,o=!1;this._runtimeMutationDepth++;try{for(const u of t)(l=u._beginKernelBatch)==null||l.call(u),r.push(u);try{s=e()}catch(u){o=!0,i.push(u)}}catch(u){o=!0,i.push(u)}finally{this._runtimeMutationDepth--;for(let u=r.length-1;u>=0;u--)try{(d=(h=r[u])._endKernelBatch)==null||d.call(h)}catch(g){i.push(g)}}if(i.length===1)throw i[0];if(i.length>1)throw new AggregateError(i,o?"[Raph] Kernel mutation and Runtime publication failed.":"[Raph] Runtime publication failed after a Kernel mutation.");return s}_assertWritablePath(e,t,r,i){const s=this._derivedController;if(s===void 0||this._derivedWriteDepth!==0)return;const o=k.parseDataPath(t,i);for(const l of s.values()){const h=k.parseDataPath(l.options.to);if(!P(o,h))continue;const d=o.segments.length<h.segments.length;if(!(e==="merge"&&d&&!q(r,h.segments[o.segments.length])))throw new M.RaphDerivedTargetWriteError(o.canonical)}}_writeDerivedTarget(e,t){this._derivedWriteDepth++;try{this.set(e,t)}finally{this._derivedWriteDepth--}}_mutateDerived(e,t,r,i,s){const o=k.parseDataPath(r,s);t==="delete"&&!e.has(r,s)||e.batch(()=>{t==="set"?e.set(r,i,s):t==="merge"?e.merge(r,i,s):e.delete(r,s),this._queueDerived(o),this._batchDepth===0&&!this._stabilizing&&this._stabilizeDerived()})}_runDerivedBatch(e){var u;let t=!1,r,i=!1,s,o=!1,l,h;this._batchDepth++;try{h=e()}catch(g){t=!0,r=g}finally{if(this._batchDepth--,this._batchDepth===0){if(!this._stabilizing)try{this._stabilizeDerived()}catch(g){i=!0,s=g}try{(u=this._metaController)==null||u.publish()}catch(g){o=!0,l=g}}}const d=[];if(t&&d.push(r),i&&d.push(s),o&&d.push(l),d.length>1)throw new AggregateError(d,"[Raph] Kernel batch publication failed.");if(d.length===1)throw d[0];return h}_mutateWithMetaLifecycle(e){if(this._batchDepth!==0||this._stabilizing){e();return}this.batch(e)}_pruneMissingMetaOwners(e,t,r){var i;(i=this._metaController)==null||i.pruneMissing(this._metaPath(e,r),t)}_metaPath(e,t){return R.DataPath.from(e,t)}_exactMetaPath(e,t){const r=this._metaPath(e,t);if(r.segments().some(i=>i.kind==="wildcard"))throw new Error("[RaphMeta] wildcard paths are read-only observation masks.");return r}_assertMetaNamespace(e){if(this._store,!e.trim())throw new Error("[RaphMeta] namespace must not be empty.")}_assertMetaOwner(e){if(!this.has(e))throw new Error(`[RaphMeta] Owner data path does not exist: "${e}".`)}_queueDerived(e){var t;(t=this._derivedController)==null||t.queue(e)}_queueDerivedReplacement(e,t){var r;(r=this._derivedController)==null||r.queueReplacement(e,t)}_replaceDerivedTarget(e,t,r){const i=k.parseDataPath(e);this._store.set(i.canonical,t),this._queueDerivedReplacement(i,r)}_stabilizeDerived(){const e=this._derivedController,t=e==null?void 0:e.pending;if(t===void 0||t.size===0)return;this._stabilizing=!0;let r=0;try{for(;t.size!==0;){const i=t.values().next().value;if(t.delete(i),!(i.paused||i.disposed)){try{this._recomputePendingDerived(i),i._recordSuccess()}catch(s){throw i._recordFailure(s),s}if(++r>1e4)throw new Error("[Raph] Derived stabilization exceeded 10000 recomputations.")}}}catch(i){throw t.clear(),i}finally{this._stabilizing=!1,e==null||e.clearPendingIfEmpty()}}_recomputePendingDerived(e){var r;const t=(r=this._derivedController)==null?void 0:r.state(e);if(t===void 0||!t.initialized||t.full){this._recomputeDerivedFull(e);return}t.kind==="filter-by-key"?this._recomputeDerivedFilter(e,t):this._recomputeDerivedCollection(e,t)}_recomputeDerivedFull(e){var h;const t=(h=this._derivedController)==null?void 0:h.state(e);t!==void 0&&(t.full=!0);const r=this.get(e.options.from),i=e.options.compute(r);let s=i,o,l;t!==void 0&&(r===void 0&&(i===void 0||Array.isArray(i)&&i.length===0)?(o=new Map,l=new Map):(t.kind==="filter-by-key"?(f.validateFullFilter(e.id,t.key,r,i),s=f.cloneMaterializedValue(i)):f.validateFullCollection(e.id,t.key,r,i),o=f.collectionIndex(r,t.key,"source"),l=f.collectionIndex(s,t.key,"output"))),this._writeDerivedTarget(e.options.to,s),t!==void 0&&(t.sourceIndex=o,t.targetIndex=l,t.initialized=!0,t.full=!1,t.keys.clear())}_recomputeDerivedCollection(e,t){t.full=!0;const r=this.get(e.options.from),i=this.get(e.options.to);if(!Array.isArray(r)||!Array.isArray(i))throw f.collectionError(e.id,"requires array source and target");(t.sourceIndex===void 0||f.indexesAreStale(r,t.key,t.sourceIndex,t.keys))&&(t.sourceIndex=f.collectionIndex(r,t.key,"source"));const s=t.targetIndex;if(s===void 0)throw f.collectionError(e.id,"has no materialized target index");const o=[],l=[];for(const a of t.keys){const v=t.sourceIndex.get(a);v===void 0?l.push(a):o.push({key:a,index:v,item:r[v]})}o.sort((a,v)=>a.index-v.index);const h=o.map(a=>a.item),d=h.length===0?[]:e.options.compute(h);f.validateIncrementalCollection(e.id,t.key,o.map(a=>a.key),d);const u=d;if(l.length!==0||o.some(a=>!s.has(a.key))){const a=new Map;for(let _=0;_<o.length;_++)a.set(o[_].key,u[_]);const v=new Map;for(const[_,y]of s)v.set(_,i[y]);const n=f.collectionKeys(r,t.key,"source"),c=[];c.length=n.length;for(let _=0;_<n.length;_++){const y=n[_];if(y===void 0)continue;const D=a.has(y)?a.get(y):v.get(y);if(D===void 0)throw f.collectionError(e.id,`is missing target item for key "${String(y)}"`);c[_]=D}const w=f.collectionIndex(c,t.key,"target");this._replaceDerivedTarget(e.options.to,c,t.keys),t.targetIndex=w}else for(let a=0;a<o.length;a++)this._writeDerivedTarget(f.keyedPath(e.options.to,t.key,o[a].key),u[a]);t.keys.clear(),t.full=!1}_recomputeDerivedFilter(e,t){t.full=!0;const r=this.get(e.options.from),i=this.get(e.options.to);if(!Array.isArray(r)||!Array.isArray(i))throw f.filterError(e.id,"requires array source and target");(t.sourceIndex===void 0||f.indexesAreStale(r,t.key,t.sourceIndex,t.keys))&&(t.sourceIndex=f.collectionIndex(r,t.key,"source"));const s=t.targetIndex;if(s===void 0)throw f.filterError(e.id,"has no materialized target index");const o=[];for(const n of t.keys){const c=t.sourceIndex.get(n);c!==void 0&&o.push({key:n,index:c,item:r[c]})}o.sort((n,c)=>n.index-c.index);const l=o.map(n=>n.item),h=l.length===0?[]:e.options.compute(l);f.validateIncrementalFilter(e.id,t.key,o.map(n=>n.key),h);const d=new Map,u=h,g=f.collectionKeys(u,t.key,"output");for(let n=0;n<g.length;n++){const c=g[n];c!==void 0&&d.set(c,f.cloneMaterializedValue(u[n]))}const a=new Set;let v=!1;for(const n of t.keys){const c=s.has(n),w=d.has(n);!c&&!w||(a.add(n),c!==w&&(v=!0))}if(v&&t.keys.size===1&&i.length===s.size&&this._patchSingleFilterMembership(e,t,i,s,d,a)){t.keys.clear(),t.full=!1;return}if(v){const n=new Map;for(const[_,y]of s)n.set(_,i[y]);const c=[];for(const _ of f.collectionKeys(r,t.key,"source"))if(_!==void 0){if(t.keys.has(_)){d.has(_)&&c.push(d.get(_));continue}n.has(_)&&c.push(n.get(_))}const w=f.collectionIndex(c,t.key,"target");this._replaceDerivedTarget(e.options.to,c,a),t.targetIndex=w}else for(const[n,c]of d)this._writeDerivedTarget(f.keyedPath(e.options.to,t.key,n),c);t.keys.clear(),t.full=!1}_patchSingleFilterMembership(e,t,r,i,s,o){const l=t.sourceIndex;if(l===void 0)return!1;const h=t.keys.values().next().value;if(h===void 0)return!1;const d=i.get(h),u=s.has(h);if(d!==void 0===u)return!1;const g=r.slice();let a;if(d!==void 0)a=d,g.splice(a,1);else{const v=l.get(h);if(v===void 0)return!1;let n=0,c=g.length;for(;n<c;){const w=n+c>>>1,_=g[w];if(typeof _!="object"||_===null||Array.isArray(_))return!1;const y=_[t.key];if(typeof y!="string"&&typeof y!="number")return!1;const D=l.get(y);if(D===void 0)return!1;D<v?n=w+1:c=w}a=n,g.splice(a,0,s.get(h))}if(this._replaceDerivedTarget(e.options.to,g,o),d!==void 0){i.delete(h);for(const[v,n]of i)n>a&&i.set(v,n-1)}else{for(const[v,n]of i)n>=a&&i.set(v,n+1);i.set(h,a)}return!0}};p(b,"_kernelCounter",0);let x=b;function P(m,e){const t=Math.min(m.segments.length,e.segments.length);for(let r=0;r<t;r++)if(!O(m.segments[r],e.segments[r]))return!1;return!0}function q(m,e){return typeof m!="object"||m===null||Array.isArray(m)||e.kind!=="key"?!0:Object.hasOwn(m,e.key)}function O(m,e){return m.kind!==e.kind?!1:m.kind==="key"&&e.kind==="key"?m.key===e.key:m.kind==="index"&&e.kind==="index"?m.index===e.index:m.kind==="selector"&&e.kind==="selector"&&m.key===e.key&&Object.is(m.value,e.value)}exports.RaphKernel=x;