@raphy-js/raph 1.0.0-dev.2

package/dist/debug/path/PathStore.js

@@ -0,0 +1,326 @@
+var R = Object.defineProperty;
+var m = (r, e, t) => e in r ? R(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t;
+var v = (r, e, t) => m(r, typeof e != "symbol" ? e + "" : e, t);
+import { parseDataPath as l } from "./data-path.js";
+import { PathEventHub as H } from "./PathEventHub.js";
+const u = /* @__PURE__ */ new WeakMap();
+class $ {
+  constructor() {
+    // Владеют path data и независимым event lifecycle этого store.
+    v(this, "_root");
+    v(this, "_eventHub", new H(
+      "[Raph] Path transaction and publication failed."
+    ));
+  }
+  /**
+   * Возвращает внутренний router для диагностического контракта Kernel.
+   * @internal
+   */
+  get _router() {
+    return this._eventHub.router;
+  }
+  get _events() {
+    return this._eventHub.events;
+  }
+  get _watcherCount() {
+    return this._eventHub.watcherCount;
+  }
+  /**
+   * Возвращает значение по пути без создания отсутствующих данных.
+   */
+  get(e, t) {
+    const n = l(e, t), o = this._root;
+    if (o !== void 0)
+      return a(o, n.segments).value;
+  }
+  /**
+   * Читает значение по пути без регистрации реактивной зависимости.
+   */
+  peek(e, t) {
+    return this.get(e, t);
+  }
+  /**
+   * Проверяет наличие значения по указанному пути.
+   */
+  has(e, t) {
+    const n = l(e, t), o = this._root;
+    return o !== void 0 && a(o, n.segments).exists;
+  }
+  /**
+   * Записывает значение и публикует соответствующее изменение.
+   */
+  set(e, t, n) {
+    const o = l(e, n);
+    if (o.segments.length === 0) {
+      this._setRoot(t);
+      return;
+    }
+    const s = this._eventHub.hasWatchers, i = s ? a(this._root, o.segments).value : void 0;
+    if (this._root ?? (this._root = /* @__PURE__ */ Object.create(null)), O(this._root, o, t), !s)
+      return;
+    const c = a(this._root, o.segments).value;
+    this._eventHub.record({
+      kind: "set",
+      path: o.canonical,
+      previous: i,
+      value: c
+    });
+  }
+  /**
+   * Объединяет значение по пути и публикует соответствующее изменение.
+   */
+  merge(e, t, n) {
+    const o = l(e, n);
+    if (o.segments.length === 0) {
+      this._mergeRoot(t);
+      return;
+    }
+    const s = this._eventHub.hasWatchers, i = a(this._root, o.segments).value, c = s && d(i) && d(t) ? A(i) : i;
+    if (d(i) && d(t)) {
+      g(this._root, o.segments);
+      for (const w of Object.keys(t))
+        h(i, w, t[w]);
+    } else
+      this._root ?? (this._root = /* @__PURE__ */ Object.create(null)), O(this._root, o, t);
+    if (!s)
+      return;
+    const f = a(this._root, o.segments).value;
+    this._eventHub.record({
+      kind: "merge",
+      path: o.canonical,
+      previous: c,
+      value: f
+    });
+  }
+  /**
+   * Удаляет значение по пути и публикует изменение при наличии данных.
+   */
+  delete(e, t) {
+    const n = l(e, t);
+    if (n.segments.length === 0) {
+      this._deleteRoot();
+      return;
+    }
+    const o = a(this._root, n.segments);
+    !o.exists || this._root === void 0 || (g(this._root, n.segments), E(this._root, n), this._eventHub.hasWatchers && this._eventHub.record({
+      kind: "delete",
+      path: n.canonical,
+      previous: o.value,
+      value: void 0
+    }));
+  }
+  /**
+   * Выполняет операцию в общей синхронной transaction boundary.
+   */
+  transaction(e) {
+    return this._eventHub.transaction(e);
+  }
+  /**
+   * Подписывает callback на подходящие изменения и возвращает disposer.
+   */
+  watch(e, t) {
+    return this._eventHub.watch(e, t);
+  }
+  _setRoot(e) {
+    const t = x(e), n = this._root;
+    this._root = t, this._recordRootEvent("set", n, t);
+  }
+  _mergeRoot(e) {
+    const t = this._root, n = this._eventHub.hasWatchers && d(t) && d(e) ? A(t) : t;
+    if (d(t) && d(e))
+      for (const o of Object.keys(e))
+        h(t, o, e[o]);
+    else
+      this._root = x(e);
+    this._recordRootEvent("merge", n, this._root);
+  }
+  _deleteRoot() {
+    const e = this._root;
+    e !== void 0 && (this._root = S(), this._recordRootEvent("delete", e, void 0));
+  }
+  _recordRootEvent(e, t, n) {
+    this._eventHub.record({ kind: e, path: "", previous: t, value: n });
+  }
+}
+function a(r, e) {
+  let t = r;
+  for (const n of e)
+    if (n.kind === "key") {
+      if (!k(t) || !Object.hasOwn(t, n.key))
+        return { exists: !1, value: void 0 };
+      t = t[n.key];
+    } else if (n.kind === "index") {
+      if (!Array.isArray(t) || !Object.hasOwn(t, n.index))
+        return { exists: !1, value: void 0 };
+      t = t[n.index];
+    } else {
+      if (!Array.isArray(t))
+        return { exists: !1, value: void 0 };
+      const o = _(t, n.key, n.value);
+      if (o === -1)
+        return { exists: !1, value: void 0 };
+      t = t[o];
+    }
+  return { exists: !0, value: t };
+}
+function g(r, e) {
+  let t = r;
+  for (const n of e) {
+    if (!k(t))
+      return;
+    const o = j(t, n);
+    Array.isArray(t) && u.delete(t), t = o;
+  }
+}
+function O(r, e, t) {
+  let n = r, o;
+  for (let i = 0; i < e.segments.length - 1; i++) {
+    const c = e.segments[i], f = e.segments[i + 1];
+    c.kind === "selector" && Array.isArray(n) && (o = n), c.kind === "index" && Array.isArray(n) && (o = n), n = P(n, c, f, e.canonical);
+  }
+  const s = e.segments[e.segments.length - 1];
+  if (C(n, s, t, e.canonical), s.kind === "key" && o !== void 0) {
+    const i = u.get(o);
+    i == null || i.delete(s.key), (i == null ? void 0 : i.size) === 0 && u.delete(o);
+  }
+}
+function E(r, e) {
+  let t = r;
+  for (let s = 0; s < e.segments.length - 1; s++) {
+    const i = e.segments[s], c = j(t, i);
+    if (!k(c))
+      return;
+    t = c;
+  }
+  const n = e.segments[e.segments.length - 1];
+  if (n.kind === "key") {
+    delete t[n.key];
+    return;
+  }
+  if (!Array.isArray(t))
+    return;
+  if (n.kind === "index") {
+    u.delete(t), delete t[n.index];
+    return;
+  }
+  const o = _(t, n.key, n.value);
+  o !== -1 && (u.delete(t), delete t[o]);
+}
+function j(r, e) {
+  if (e.kind === "key")
+    return Object.hasOwn(r, e.key) ? r[e.key] : void 0;
+  if (!Array.isArray(r))
+    return;
+  if (e.kind === "index")
+    return r[e.index];
+  const t = _(r, e.key, e.value);
+  return t === -1 ? void 0 : r[t];
+}
+function P(r, e, t, n) {
+  if (e.kind === "key") {
+    const s = r;
+    let i = s[e.key];
+    return (!Object.hasOwn(s, e.key) || i === void 0) && (i = p(t), h(s, e.key, i)), b(i, n);
+  }
+  if (e.kind === "index") {
+    if (!Array.isArray(r))
+      throw y(n);
+    let s = r[e.index];
+    return (!Object.hasOwn(r, e.index) || s === void 0) && (u.delete(r), s = p(t), r[e.index] = s), b(s, n);
+  }
+  if (!Array.isArray(r))
+    throw y(n);
+  let o = _(r, e.key, e.value);
+  if (o === -1) {
+    u.delete(r);
+    const s = /* @__PURE__ */ Object.create(null);
+    s[e.key] = e.value, r.push(s), o = r.length - 1;
+  }
+  return b(r[o], n);
+}
+function C(r, e, t, n) {
+  if (e.kind === "key") {
+    h(r, e.key, t);
+    return;
+  }
+  if (e.kind === "index") {
+    if (!Array.isArray(r))
+      throw y(n);
+    u.delete(r), r[e.index] = t;
+    return;
+  }
+  if (!Array.isArray(r))
+    throw y(n);
+  const o = _(r, e.key, e.value);
+  if (o !== -1) {
+    u.delete(r), r[o] = t;
+    return;
+  }
+  if (!d(t))
+    throw new TypeError(`[Raph] New selector target at "${n}" must be an object.`);
+  const s = t[e.key];
+  if (Object.hasOwn(t, e.key) && !Object.is(s, e.value))
+    throw new TypeError(`[Raph] Selector target at "${n}" has a conflicting key.`);
+  u.delete(r), r.push(Object.hasOwn(t, e.key) ? t : { ...t, [e.key]: e.value });
+}
+function p(r) {
+  return r.kind === "index" || r.kind === "selector" ? [] : /* @__PURE__ */ Object.create(null);
+}
+function S() {
+  return /* @__PURE__ */ Object.create(null);
+}
+function x(r) {
+  if (k(r))
+    return r;
+  throw new TypeError("[Raph] Root value must be an object or array.");
+}
+function b(r, e) {
+  if (k(r))
+    return r;
+  throw y(e);
+}
+function _(r, e, t) {
+  let n = u.get(r);
+  const o = n == null ? void 0 : n.get(e);
+  if (o)
+    return o.get(t) ?? -1;
+  const s = /* @__PURE__ */ new Map();
+  for (let i = 0; i < r.length; i++) {
+    const c = r[i];
+    if (d(c) && Object.hasOwn(c, e)) {
+      const f = c[e];
+      (f === null || typeof f == "string" || typeof f == "number" || typeof f == "boolean") && !s.has(f) && s.set(f, i);
+    }
+  }
+  return n || (n = /* @__PURE__ */ new Map(), u.set(r, n)), n.set(e, s), s.get(t) ?? -1;
+}
+function h(r, e, t) {
+  if (e === "__proto__") {
+    Object.defineProperty(r, e, {
+      configurable: !0,
+      enumerable: !0,
+      value: t,
+      writable: !0
+    });
+    return;
+  }
+  r[e] = t;
+}
+function A(r) {
+  const e = Object.create(Object.getPrototypeOf(r));
+  for (const t of Object.keys(r))
+    h(e, t, r[t]);
+  return e;
+}
+function d(r) {
+  return typeof r == "object" && r !== null && !Array.isArray(r);
+}
+function k(r) {
+  return Array.isArray(r) || d(r);
+}
+function y(r) {
+  return new TypeError(`[Raph] Cannot traverse non-container data at "${r}".`);
+}
+export {
+  $ as PathStore
+};

package/dist/debug/path/RaphDerivedHandle.cjs

@@ -0,0 +1 @@
+"use strict";var o=Object.defineProperty;var d=(r,e,t)=>e in r?o(r,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):r[e]=t;var s=(r,e,t)=>d(r,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class a extends Error{constructor(e){super(`[Raph] Derived target is read-only: "${e}".`),this.name="RaphDerivedTargetWriteError"}}class h{constructor(e,t,i){s(this,"id");s(this,"options");s(this,"_kernel");s(this,"_removeRoutes");s(this,"_paused",!1);s(this,"_disposed",!1);s(this,"_status","idle");s(this,"_lastError",null);this._kernel=e,this.id=t,this.options=i}get paused(){return this._paused}get disposed(){return this._disposed}get status(){return this._status}get lastError(){return this._lastError}_recordSuccess(){this._status="success",this._lastError=null}_recordFailure(e){this._status="error",this._lastError=e instanceof Error?e:new Error(String(e))}pause(){this._assertAlive(),this._paused=!0}resume(){this._assertAlive(),this._paused=!1,this.recompute()}recompute(){this._assertAlive(),this._kernel._recomputeDerived(this)}dispose(){this._disposed||(this._disposed=!0,this._kernel._removeDerived(this),this.options.disposeTarget==="delete"&&this._kernel.delete(this.options.to))}_attachRoutes(e){this._removeRoutes=e}_detachRoutes(){const e=this._removeRoutes;if(this._removeRoutes=void 0,e!==void 0)for(const t of e)t()}_disposeFromKernel(){this._disposed=!0,this._removeRoutes=void 0}_assertAlive(){if(this._disposed)throw new Error(`[Raph] Derived "${this.id}" is disposed.`)}}exports.RaphDerivedHandle=h;exports.RaphDerivedTargetWriteError=a;

package/dist/debug/path/RaphDerivedHandle.js

@@ -0,0 +1,125 @@
+var o = Object.defineProperty;
+var d = (r, e, t) => e in r ? o(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t;
+var s = (r, e, t) => d(r, typeof e != "symbol" ? e + "" : e, t);
+class h extends Error {
+  /**
+   * Создаёт ошибку с canonical path защищённого derived target.
+   */
+  constructor(e) {
+    super(`[Raph] Derived target is read-only: "${e}".`), this.name = "RaphDerivedTargetWriteError";
+  }
+}
+class u {
+  /**
+   * Создаёт internal handle, которым управляет owning Kernel.
+   * @internal
+   */
+  constructor(e, t, i) {
+    // Публикуют identity и immutable параметры materialized dependency.
+    s(this, "id");
+    s(this, "options");
+    // Связывают handle с owning Kernel и зарегистрированными source routes.
+    s(this, "_kernel");
+    s(this, "_removeRoutes");
+    // Хранят lifecycle и результат последнего вычисления.
+    s(this, "_paused", !1);
+    s(this, "_disposed", !1);
+    s(this, "_status", "idle");
+    s(this, "_lastError", null);
+    this._kernel = e, this.id = t, this.options = i;
+  }
+  /**
+   * Показывает, приостановлено ли derived-вычисление.
+   */
+  get paused() {
+    return this._paused;
+  }
+  /**
+   * Показывает, освобождён ли derived handle.
+   */
+  get disposed() {
+    return this._disposed;
+  }
+  /**
+   * Возвращает состояние последнего derived-пересчёта.
+   */
+  get status() {
+    return this._status;
+  }
+  /**
+   * Возвращает последнюю ошибку derived-пересчёта либо null.
+   */
+  get lastError() {
+    return this._lastError;
+  }
+  /**
+   * Фиксирует успешное завершение derived-пересчёта.
+   * @internal
+   */
+  _recordSuccess() {
+    this._status = "success", this._lastError = null;
+  }
+  /**
+   * Фиксирует ошибку derived-пересчёта без потери handle.
+   * @internal
+   */
+  _recordFailure(e) {
+    this._status = "error", this._lastError = e instanceof Error ? e : new Error(String(e));
+  }
+  /**
+   * Приостанавливает автоматические пересчёты без освобождения handle.
+   */
+  pause() {
+    this._assertAlive(), this._paused = !0;
+  }
+  /**
+   * Возобновляет пересчёты и синхронизирует устаревший target.
+   */
+  resume() {
+    this._assertAlive(), this._paused = !1, this.recompute();
+  }
+  /**
+   * Принудительно пересчитывает derived target.
+   */
+  recompute() {
+    this._assertAlive(), this._kernel._recomputeDerived(this);
+  }
+  /**
+   * Удаляет derived registration и применяет выбранную политику target cleanup.
+   */
+  dispose() {
+    this._disposed || (this._disposed = !0, this._kernel._removeDerived(this), this.options.disposeTarget === "delete" && this._kernel.delete(this.options.to));
+  }
+  /**
+   * Сохраняет disposers source routes текущей стратегии.
+   * @internal
+   */
+  _attachRoutes(e) {
+    this._removeRoutes = e;
+  }
+  /**
+   * Отсоединяет все source routes текущей стратегии.
+   * @internal
+   */
+  _detachRoutes() {
+    const e = this._removeRoutes;
+    if (this._removeRoutes = void 0, e !== void 0)
+      for (const t of e)
+        t();
+  }
+  /**
+   * Помечает handle освобождённым после cleanup owning Kernel.
+   * @internal
+   */
+  _disposeFromKernel() {
+    this._disposed = !0, this._removeRoutes = void 0;
+  }
+  _assertAlive() {
+    if (this._disposed)
+      throw new Error(`[Raph] Derived "${this.id}" is disposed.`);
+  }
+}
+export {
+  u as RaphDerivedHandle,
+  h as RaphDerivedTargetWriteError
+};

package/dist/debug/path/RaphKernel.cjs

@@ -0,0 +1 @@
+"use strict";var z=Object.defineProperty;var A=(_,e,t)=>e in _?z(_,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):_[e]=t;var k=(_,e,t)=>A(_,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const M=require("./AdapterPathStore.cjs"),I=require("./data-adapter.cjs"),w=require("./data-path.cjs"),f=require("./derived-collection.cjs"),E=require("./DerivedRegistry.cjs"),R=require("./MetaController.cjs"),T=require("./PathStore.cjs"),C=require("./RaphDerivedHandle.cjs"),x=class x{constructor(e={}){k(this,"id");k(this,"_paths");k(this,"_derivedController");k(this,"_runtimes");k(this,"_metaController");k(this,"_transactionDepth",0);k(this,"_stabilizing",!1);k(this,"_derivedWriteDepth",0);if(this.id=e.id??`kernel-${x._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 M.AdapterPathStore(e.adapter)}else if(e.adapterOptions!==void 0)this._paths=new M.AdapterPathStore(new I.DefaultDataAdapter(e.initial,e.adapterOptions));else{const t=this._paths=new T.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;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;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;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")})}transaction(e){var c,d,v,g;const t=this._store;if(this._derivedController===void 0&&!((c=this._metaController)!=null&&c.hasWatchers))return t.transaction(e);const r=this._transactionDepth===0&&((d=this._metaController)!=null&&d.hasDeferredWatchers)&&this._runtimes!==void 0?[...this._runtimes]:void 0;if(r!==void 0)for(const o of r)(v=o._beginKernelTransaction)==null||v.call(o);let i,s,a=!1;try{i=t.transaction(()=>this._runDerivedTransaction(e))}catch(o){a=!0,s=o}const l=[];if(a&&l.push(s),r!==void 0)for(const o of r)try{(g=o._endKernelTransaction)==null||g.call(o)}catch(m){l.push(m)}if(l.length===1)throw l[0];if(l.length>1)throw new AggregateError(l,"[Raph] Kernel transaction execution failed.");return i}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){this._assertMetaNamespace(t);const s=this._exactMetaPath(e,i);this._assertMetaOwner(s),this._metadata.set(s,t,r,i)}mergeMeta(e,t,r,i){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;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,v,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=w.parseDataPath(e.from),r=w.parseDataPath(e.to);if(P(t,r))throw new Error("[Raph] Derived source and target must not overlap.");const i=this._derivedController??new E.DerivedRegistry,s=e.id??i.nextId(),a={...e,from:t.canonical,to:r.canonical},l=new C.RaphDerivedHandle(this,s,a),c=((v=e.strategy)==null?void 0:v.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,c);try{e.immediate!==!1&&l.recompute()}catch(o){throw this._removeDerived(l),l._disposeFromKernel(),o}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 R.MetaController(this,e=>this.has(e),()=>this._transactionDepth!==0||this._stabilizing))}_assertWritablePath(e,t,r,i){const s=this._derivedController;if(s===void 0||this._derivedWriteDepth!==0)return;const a=w.parseDataPath(t,i);for(const l of s.values()){const c=w.parseDataPath(l.options.to);if(!P(a,c))continue;const d=a.segments.length<c.segments.length;if(!(e==="merge"&&d&&!S(r,c.segments[a.segments.length])))throw new C.RaphDerivedTargetWriteError(a.canonical)}}_writeDerivedTarget(e,t){this._derivedWriteDepth++;try{this.set(e,t)}finally{this._derivedWriteDepth--}}_mutateDerived(e,t,r,i,s){const a=w.parseDataPath(r,s);t==="delete"&&!e.has(r,s)||e.transaction(()=>{t==="set"?e.set(r,i,s):t==="merge"?e.merge(r,i,s):e.delete(r,s),this._queueDerived(a),this._transactionDepth===0&&!this._stabilizing&&this._stabilizeDerived()})}_runDerivedTransaction(e){var v;let t=!1,r,i=!1,s,a=!1,l,c;this._transactionDepth++;try{c=e()}catch(g){t=!0,r=g}finally{if(this._transactionDepth--,this._transactionDepth===0){if(!this._stabilizing)try{this._stabilizeDerived()}catch(g){i=!0,s=g}try{(v=this._metaController)==null||v.publish()}catch(g){a=!0,l=g}}}const d=[];if(t&&d.push(r),i&&d.push(s),a&&d.push(l),d.length>1)throw new AggregateError(d,"[Raph] Kernel transaction publication failed.");if(d.length===1)throw d[0];return c}_mutateWithMetaLifecycle(e){if(this._transactionDepth!==0||this._stabilizing){e();return}this.transaction(e)}_pruneMissingMetaOwners(e,t,r){var i;(i=this._metaController)==null||i.pruneMissing(this._metaPath(e,r),t)}_metaPath(e,t){return w.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=w.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 c;const t=(c=this._derivedController)==null?void 0:c.state(e);t!==void 0&&(t.full=!0);const r=this.get(e.options.from),i=e.options.compute(r);let s=i,a,l;t!==void 0&&(r===void 0&&(i===void 0||Array.isArray(i)&&i.length===0)?(a=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),a=f.collectionIndex(r,t.key,"source"),l=f.collectionIndex(s,t.key,"output"))),this._writeDerivedTarget(e.options.to,s),t!==void 0&&(t.sourceIndex=a,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 a=[],l=[];for(const o of t.keys){const m=t.sourceIndex.get(o);m===void 0?l.push(o):a.push({key:o,index:m,item:r[m]})}a.sort((o,m)=>o.index-m.index);const c=a.map(o=>o.item),d=c.length===0?[]:e.options.compute(c);f.validateIncrementalCollection(e.id,t.key,a.map(o=>o.key),d);const v=d;if(l.length!==0||a.some(o=>!s.has(o.key))){const o=new Map;for(let u=0;u<a.length;u++)o.set(a[u].key,v[u]);const m=new Map;for(const[u,y]of s)m.set(u,i[y]);const n=f.collectionKeys(r,t.key,"source"),h=[];h.length=n.length;for(let u=0;u<n.length;u++){const y=n[u];if(y===void 0)continue;const D=o.has(y)?o.get(y):m.get(y);if(D===void 0)throw f.collectionError(e.id,`is missing target item for key "${String(y)}"`);h[u]=D}const p=f.collectionIndex(h,t.key,"target");this._replaceDerivedTarget(e.options.to,h,t.keys),t.targetIndex=p}else for(let o=0;o<a.length;o++)this._writeDerivedTarget(f.keyedPath(e.options.to,t.key,a[o].key),v[o]);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 a=[];for(const n of t.keys){const h=t.sourceIndex.get(n);h!==void 0&&a.push({key:n,index:h,item:r[h]})}a.sort((n,h)=>n.index-h.index);const l=a.map(n=>n.item),c=l.length===0?[]:e.options.compute(l);f.validateIncrementalFilter(e.id,t.key,a.map(n=>n.key),c);const d=new Map,v=c,g=f.collectionKeys(v,t.key,"output");for(let n=0;n<g.length;n++){const h=g[n];h!==void 0&&d.set(h,f.cloneMaterializedValue(v[n]))}const o=new Set;let m=!1;for(const n of t.keys){const h=s.has(n),p=d.has(n);!h&&!p||(o.add(n),h!==p&&(m=!0))}if(m&&t.keys.size===1&&i.length===s.size&&this._patchSingleFilterMembership(e,t,i,s,d,o)){t.keys.clear(),t.full=!1;return}if(m){const n=new Map;for(const[u,y]of s)n.set(u,i[y]);const h=[];for(const u of f.collectionKeys(r,t.key,"source"))if(u!==void 0){if(t.keys.has(u)){d.has(u)&&h.push(d.get(u));continue}n.has(u)&&h.push(n.get(u))}const p=f.collectionIndex(h,t.key,"target");this._replaceDerivedTarget(e.options.to,h,o),t.targetIndex=p}else for(const[n,h]of d)this._writeDerivedTarget(f.keyedPath(e.options.to,t.key,n),h);t.keys.clear(),t.full=!1}_patchSingleFilterMembership(e,t,r,i,s,a){const l=t.sourceIndex;if(l===void 0)return!1;const c=t.keys.values().next().value;if(c===void 0)return!1;const d=i.get(c),v=s.has(c);if(d!==void 0===v)return!1;const g=r.slice();let o;if(d!==void 0)o=d,g.splice(o,1);else{const m=l.get(c);if(m===void 0)return!1;let n=0,h=g.length;for(;n<h;){const p=n+h>>>1,u=g[p];if(typeof u!="object"||u===null||Array.isArray(u))return!1;const y=u[t.key];if(typeof y!="string"&&typeof y!="number")return!1;const D=l.get(y);if(D===void 0)return!1;D<m?n=p+1:h=p}o=n,g.splice(o,0,s.get(c))}if(this._replaceDerivedTarget(e.options.to,g,a),d!==void 0){i.delete(c);for(const[m,n]of i)n>o&&i.set(m,n-1)}else{for(const[m,n]of i)n>=o&&i.set(m,n+1);i.set(c,o)}return!0}};k(x,"_kernelCounter",0);let b=x;function P(_,e){const t=Math.min(_.segments.length,e.segments.length);for(let r=0;r<t;r++)if(!F(_.segments[r],e.segments[r]))return!1;return!0}function S(_,e){return typeof _!="object"||_===null||Array.isArray(_)||e.kind!=="key"?!0:Object.hasOwn(_,e.key)}function F(_,e){return _.kind!==e.kind?!1:_.kind==="key"&&e.kind==="key"?_.key===e.key:_.kind==="index"&&e.kind==="index"?_.index===e.index:_.kind==="selector"&&e.kind==="selector"&&_.key===e.key&&Object.is(_.value,e.value)}exports.RaphKernel=b;