@raphy-js/raph 1.0.0-dev.2

package/dist/debug/path/DerivedRegistry.js

@@ -0,0 +1,157 @@
+var a = Object.defineProperty;
+var h = (l, e, t) => e in l ? a(l, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : l[e] = t;
+var d = (l, e, t) => h(l, typeof e != "symbol" ? e + "" : e, t);
+import { pathRelationMasks as _, parsePathMask as u } from "./data-path.js";
+import { collectionMutationImpact as f } from "./derived-collection.js";
+import { PathRouter as m } from "./path-router.js";
+const g = 2e4;
+class z {
+  constructor() {
+    // Хранят routes, handles и инкрементальное состояние materialized derived.
+    d(this, "_router");
+    d(this, "_handles");
+    d(this, "_matches");
+    d(this, "_pending");
+    d(this, "_collections");
+    // Формирует локальные идентификаторы derived без глобального shared state.
+    d(this, "_counter", 0);
+  }
+  /**
+   * Возвращает число зарегистрированных записей.
+   */
+  get size() {
+    var e;
+    return ((e = this._handles) == null ? void 0 : e.size) ?? 0;
+  }
+  /**
+   * Возвращает очередь derived-вычислений, ожидающих стабилизации.
+   */
+  get pending() {
+    return this._pending;
+  }
+  /**
+   * Выделяет следующий стабильный идентификатор registry.
+   */
+  nextId() {
+    return `derived-${this._counter++}`;
+  }
+  /**
+   * Проверяет наличие derived handle с указанным id.
+   */
+  has(e) {
+    var t;
+    return ((t = this._handles) == null ? void 0 : t.has(e)) ?? !1;
+  }
+  /**
+   * Возвращает зарегистрированные derived handles.
+   */
+  values() {
+    var e;
+    return ((e = this._handles) == null ? void 0 : e.values()) ?? [][Symbol.iterator]();
+  }
+  /**
+   * Возвращает внутреннее состояние зарегистрированного handle.
+   */
+  state(e) {
+    var t;
+    return (t = this._collections) == null ? void 0 : t.get(e);
+  }
+  /**
+   * Регистрирует derived handle и его зависимости.
+   */
+  register(e, t, i) {
+    (this._handles ?? (this._handles = /* @__PURE__ */ new Map())).set(e.id, e), i !== void 0 && (this._collections ?? (this._collections = /* @__PURE__ */ new Map())).set(e, {
+      from: t,
+      kind: i.kind,
+      key: i.key,
+      initialized: !1,
+      full: !0,
+      keys: /* @__PURE__ */ new Set(),
+      sourceIndex: void 0,
+      targetIndex: void 0
+    });
+    const n = this._router ?? (this._router = new m());
+    this._matches = void 0, e._attachRoutes(_(t).map(
+      (s) => n.add(u(s), e)
+    ));
+  }
+  /**
+   * Удаляет регистрацию и связанные pending-записи.
+   */
+  remove(e) {
+    var i, o, n;
+    const t = this._handles;
+    (t == null ? void 0 : t.get(e.id)) === e && (t.delete(e.id), e._detachRoutes(), this._matches = void 0, (i = this._pending) == null || i.delete(e), (o = this._collections) == null || o.delete(e), ((n = this._collections) == null ? void 0 : n.size) === 0 && (this._collections = void 0), t.size === 0 && (this._handles = void 0, this._router = void 0, this._pending = void 0));
+  }
+  /**
+   * Добавляет derived handle в очередь пересчёта.
+   */
+  queue(e) {
+    var o;
+    const t = this._matching(e);
+    if (t.length === 0)
+      return;
+    const i = this._pending ?? (this._pending = /* @__PURE__ */ new Set());
+    for (const n of t) {
+      if (n.paused || n.disposed)
+        continue;
+      const s = (o = this._collections) == null ? void 0 : o.get(n);
+      if (s !== void 0 && s.initialized && !s.full) {
+        const c = f(s.from, s.key, e);
+        c.kind === "full" ? (s.full = !0, s.keys.clear()) : s.keys.add(c.key);
+      }
+      i.add(n);
+    }
+  }
+  /**
+   * Запоминает полную замену, которую нужно применить при стабилизации.
+   */
+  queueReplacement(e, t) {
+    var n;
+    const i = this._matching(e);
+    if (i.length === 0)
+      return;
+    const o = this._pending ?? (this._pending = /* @__PURE__ */ new Set());
+    for (const s of i) {
+      if (s.paused || s.disposed)
+        continue;
+      const c = (n = this._collections) == null ? void 0 : n.get(s);
+      if (c !== void 0 && c.initialized && !c.full && c.from.canonical === e.canonical)
+        for (const r of t)
+          c.keys.add(r);
+      else c !== void 0 && (c.full = !0, c.keys.clear());
+      o.add(s);
+    }
+  }
+  /**
+   * Сбрасывает pending-состояние после опустошения очереди.
+   */
+  clearPendingIfEmpty() {
+    var e;
+    ((e = this._pending) == null ? void 0 : e.size) === 0 && (this._pending = void 0);
+  }
+  /**
+   * Освобождает все handles и очищает derived registry.
+   */
+  dispose() {
+    if (this._handles !== void 0)
+      for (const e of this._handles.values())
+        e._disposeFromKernel();
+    this._handles = void 0, this._router = void 0, this._matches = void 0, this._pending = void 0, this._collections = void 0;
+  }
+  _matching(e) {
+    var n;
+    const t = this._router;
+    if (t === void 0)
+      return [];
+    let i = (n = this._matches) == null ? void 0 : n.get(e.canonical);
+    if (i !== void 0)
+      return i;
+    i = [...e.segments.length === 0 ? t.matchAll() : t.match(e.segments)];
+    const o = this._matches ?? (this._matches = /* @__PURE__ */ new Map());
+    return o.size >= g && o.clear(), o.set(e.canonical, i), i;
+  }
+}
+export {
+  z as DerivedRegistry
+};

package/dist/debug/path/MetaController.cjs

@@ -0,0 +1 @@
+"use strict";var v=Object.defineProperty;var p=(d,e,t)=>e in d?v(d,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):d[e]=t;var l=(d,e,t)=>p(d,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./data-path.cjs"),g=require("./path-router.cjs"),m=require("./RaphMeta.cjs"),_=require("./RaphMetaStore.cjs");class b{constructor(e,t,r){l(this,"_facade");l(this,"_store");l(this,"_router");l(this,"_pending");l(this,"_publishing",!1);l(this,"_watcherCount",0);l(this,"_deferredWatcherCount",0);this._kernel=e,this._ownerExists=t,this._publicationDeferred=r}get facade(){return this._facade??(this._facade=new m.RaphMeta(this._kernel))}get size(){var e;return((e=this._store)==null?void 0:e.size)??0}get hasWatchers(){return this._router!==void 0}get hasDeferredWatchers(){return this._deferredWatcherCount!==0}get(e,t){var r;return(r=this._store)==null?void 0:r.get(e,t)}has(e,t){var r;return((r=this._store)==null?void 0:r.has(e,t))??!1}set(e,t,r,i){(this._store??(this._store=new _.RaphMetaStore)).set(e,t,r),this.record("set",e,t,"explicit",i)}merge(e,t,r,i){(this._store??(this._store=new _.RaphMetaStore)).merge(e,t,r),this.record("merge",e,t,"explicit",i)}delete(e,t,r){var i;return(i=this._store)!=null&&i.delete(e,t)?(this.record("delete",e,t??null,"explicit",r),!0):!1}deleteSubtree(e,t){const r=this._store;if(r!==void 0)for(const i of r.deleteSubtree(e))this.record("delete",i,null,t)}pruneMissing(e,t){const r=this._store;if(r===void 0||r.size===0)return;const n=e.segments().findIndex(s=>s.kind==="index"||s.kind==="selector"),c=n===-1?e:f.DataPath.fromPlain({segs:e.toPlain().segs.slice(0,n)});for(const s of r.pruneMissing(c,o=>this._ownerExists(o)))this.record("delete",s,null,t)}watch(e,t,r={},i){const n=Array.isArray(e)?e:[e];if(n.length===0)throw new TypeError("[RaphMeta] watch requires at least one mask.");const c=new Map;for(const a of n){const u=f.DataPath.from(a,r)._asMask();c.set(u.canonical,u)}const s={active:!0,callback:t,afterPublish:i,...r.namespace===void 0?{}:{namespace:r.namespace}},o=this._router??(this._router=new g.PathRouter),h=[...c.values()].map(a=>o.add(a,s));return this._watcherCount++,i!==void 0&&this._deferredWatcherCount++,w(()=>{s.active=!1,s.callback=void 0,s.afterPublish=void 0;for(const a of h)a();this._watcherCount--,i!==void 0&&this._deferredWatcherCount--,this._watcherCount===0&&(this._router=void 0)})}record(e,t,r,i,n){(this._pending??(this._pending=[])).push({event:{kind:e,path:t,namespace:r,cause:i},invalidate:(n==null?void 0:n.invalidate)??!0}),!this._publicationDeferred()&&!this._publishing&&this.publish()}publish(){const e=this._pending;if(e===void 0||e.length===0||this._publishing)return;const t=[],r=new Map;this._publishing=!0;try{for(;e.length!==0;){const i=e.splice(0),n=this._router;if(n===void 0)continue;const c=new Map;for(const s of i){const o=s.event;for(const h of n.match(o.path._asExact().segments)){if(h.namespace!==void 0&&o.namespace!==null&&h.namespace!==o.namespace)continue;const a=c.get(h);a===void 0?c.set(h,{events:[o],invalidate:s.invalidate}):(a.events.push(o),s.invalidate&&(a.invalidate=!0))}}for(const[s,o]of c){if(!s.active||s.callback===void 0)continue;const h=s.afterPublish;h!==void 0&&r.set(h,(r.get(h)??!1)||o.invalidate);try{s.callback({events:o.events})}catch(a){t.push(a)}}}}finally{this._publishing=!1}for(const[i,n]of r)try{i(n)}catch(c){t.push(c)}if(t.length===1)throw t[0];if(t.length>1)throw new AggregateError(t,"[RaphMeta] Multiple watchers failed.")}dispose(){var e;(e=this._store)==null||e.clear(),this._store=void 0,this._facade=void 0,this._router=void 0,this._pending=void 0,this._watcherCount=0,this._deferredWatcherCount=0}}function w(d){let e=d;return()=>{const t=e;e=void 0,t==null||t()}}exports.MetaController=b;

package/dist/debug/path/MetaController.js

@@ -0,0 +1,214 @@
+var v = Object.defineProperty;
+var p = (d, e, t) => e in d ? v(d, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : d[e] = t;
+var l = (d, e, t) => p(d, typeof e != "symbol" ? e + "" : e, t);
+import { DataPath as f } from "./data-path.js";
+import { PathRouter as g } from "./path-router.js";
+import { RaphMeta as m } from "./RaphMeta.js";
+import { RaphMetaStore as _ } from "./RaphMetaStore.js";
+class k {
+  /**
+   * Создаёт lifecycle-контроллер metadata для одного Kernel.
+   */
+  constructor(e, t, r) {
+    // Лениво создают metadata facade, storage и routing только при первом использовании.
+    l(this, "_facade");
+    l(this, "_store");
+    l(this, "_router");
+    l(this, "_pending");
+    // Управляют reentrant publication и режимами активных watchers.
+    l(this, "_publishing", !1);
+    l(this, "_watcherCount", 0);
+    l(this, "_deferredWatcherCount", 0);
+    this._kernel = e, this._ownerExists = t, this._publicationDeferred = r;
+  }
+  /**
+   * Возвращает metadata facade, принадлежащий контроллеру.
+   */
+  get facade() {
+    return this._facade ?? (this._facade = new m(this._kernel));
+  }
+  /**
+   * Возвращает число зарегистрированных записей.
+   */
+  get size() {
+    var e;
+    return ((e = this._store) == null ? void 0 : e.size) ?? 0;
+  }
+  /**
+   * Показывает, есть ли активные синхронные metadata/path watchers.
+   */
+  get hasWatchers() {
+    return this._router !== void 0;
+  }
+  /**
+   * Показывает, есть ли watchers с отложенной публикацией.
+   */
+  get hasDeferredWatchers() {
+    return this._deferredWatcherCount !== 0;
+  }
+  /**
+   * Возвращает значение по пути без создания отсутствующих данных.
+   */
+  get(e, t) {
+    var r;
+    return (r = this._store) == null ? void 0 : r.get(e, t);
+  }
+  /**
+   * Проверяет наличие значения по указанному пути.
+   */
+  has(e, t) {
+    var r;
+    return ((r = this._store) == null ? void 0 : r.has(e, t)) ?? !1;
+  }
+  /**
+   * Записывает значение и публикует соответствующее изменение.
+   */
+  set(e, t, r, i) {
+    (this._store ?? (this._store = new _())).set(e, t, r), this.record("set", e, t, "explicit", i);
+  }
+  /**
+   * Объединяет значение по пути и публикует соответствующее изменение.
+   */
+  merge(e, t, r, i) {
+    (this._store ?? (this._store = new _())).merge(e, t, r), this.record("merge", e, t, "explicit", i);
+  }
+  /**
+   * Удаляет значение по пути и публикует изменение при наличии данных.
+   */
+  delete(e, t, r) {
+    var i;
+    return (i = this._store) != null && i.delete(e, t) ? (this.record("delete", e, t ?? null, "explicit", r), !0) : !1;
+  }
+  /**
+   * Удаляет metadata всего поддерева указанного data-owner.
+   */
+  deleteSubtree(e, t) {
+    const r = this._store;
+    if (r !== void 0)
+      for (const i of r.deleteSubtree(e))
+        this.record("delete", i, null, t);
+  }
+  /**
+   * Удаляет metadata, владельцы которой отсутствуют в data tree.
+   */
+  pruneMissing(e, t) {
+    const r = this._store;
+    if (r === void 0 || r.size === 0)
+      return;
+    const o = e.segments().findIndex(
+      (s) => s.kind === "index" || s.kind === "selector"
+    ), c = o === -1 ? e : f.fromPlain({ segs: e.toPlain().segs.slice(0, o) });
+    for (const s of r.pruneMissing(
+      c,
+      (n) => this._ownerExists(n)
+    ))
+      this.record("delete", s, null, t);
+  }
+  /**
+   * Подписывает callback на подходящие изменения и возвращает disposer.
+   */
+  watch(e, t, r = {}, i) {
+    const o = Array.isArray(e) ? e : [e];
+    if (o.length === 0)
+      throw new TypeError("[RaphMeta] watch requires at least one mask.");
+    const c = /* @__PURE__ */ new Map();
+    for (const a of o) {
+      const u = f.from(a, r)._asMask();
+      c.set(u.canonical, u);
+    }
+    const s = {
+      active: !0,
+      callback: t,
+      afterPublish: i,
+      ...r.namespace === void 0 ? {} : { namespace: r.namespace }
+    }, n = this._router ?? (this._router = new g()), h = [...c.values()].map((a) => n.add(a, s));
+    return this._watcherCount++, i !== void 0 && this._deferredWatcherCount++, w(() => {
+      s.active = !1, s.callback = void 0, s.afterPublish = void 0;
+      for (const a of h)
+        a();
+      this._watcherCount--, i !== void 0 && this._deferredWatcherCount--, this._watcherCount === 0 && (this._router = void 0);
+    });
+  }
+  /**
+   * Добавляет событие в текущую transaction либо публикует его сразу.
+   */
+  record(e, t, r, i, o) {
+    (this._pending ?? (this._pending = [])).push({
+      event: { kind: e, path: t, namespace: r, cause: i },
+      invalidate: (o == null ? void 0 : o.invalidate) ?? !0
+    }), !this._publicationDeferred() && !this._publishing && this.publish();
+  }
+  /**
+   * Публикует накопленные metadata-события с учётом watcher mode.
+   */
+  publish() {
+    const e = this._pending;
+    if (e === void 0 || e.length === 0 || this._publishing)
+      return;
+    const t = [], r = /* @__PURE__ */ new Map();
+    this._publishing = !0;
+    try {
+      for (; e.length !== 0; ) {
+        const i = e.splice(0), o = this._router;
+        if (o === void 0)
+          continue;
+        const c = /* @__PURE__ */ new Map();
+        for (const s of i) {
+          const n = s.event;
+          for (const h of o.match(n.path._asExact().segments)) {
+            if (h.namespace !== void 0 && n.namespace !== null && h.namespace !== n.namespace)
+              continue;
+            const a = c.get(h);
+            a === void 0 ? c.set(h, {
+              events: [n],
+              invalidate: s.invalidate
+            }) : (a.events.push(n), s.invalidate && (a.invalidate = !0));
+          }
+        }
+        for (const [s, n] of c) {
+          if (!s.active || s.callback === void 0)
+            continue;
+          const h = s.afterPublish;
+          h !== void 0 && r.set(
+            h,
+            (r.get(h) ?? !1) || n.invalidate
+          );
+          try {
+            s.callback({ events: n.events });
+          } catch (a) {
+            t.push(a);
+          }
+        }
+      }
+    } finally {
+      this._publishing = !1;
+    }
+    for (const [i, o] of r)
+      try {
+        i(o);
+      } catch (c) {
+        t.push(c);
+      }
+    if (t.length === 1)
+      throw t[0];
+    if (t.length > 1)
+      throw new AggregateError(t, "[RaphMeta] Multiple watchers failed.");
+  }
+  /**
+   * Очищает metadata storage, subscriptions и pending publication state.
+   */
+  dispose() {
+    var e;
+    (e = this._store) == null || e.clear(), this._store = void 0, this._facade = void 0, this._router = void 0, this._pending = void 0, this._watcherCount = 0, this._deferredWatcherCount = 0;
+  }
+}
+function w(d) {
+  let e = d;
+  return () => {
+    const t = e;
+    e = void 0, t == null || t();
+  };
+}
+export {
+  k as MetaController
+};

package/dist/debug/path/PathEventHub.cjs

@@ -0,0 +1 @@
+"use strict";var _=Object.defineProperty;var f=(a,t,e)=>t in a?_(a,t,{enumerable:!0,configurable:!0,writable:!0,value:e}):a[t]=e;var c=(a,t,e)=>f(a,typeof t!="symbol"?t+"":t,e);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./data-path.cjs"),g=require("./path-router.cjs");class v{constructor(t){c(this,"_router");c(this,"_events");c(this,"_transactionDepth",0);c(this,"_watcherCount",0);c(this,"_publishing",!1);this._transactionErrorMessage=t}get hasWatchers(){return this._watcherCount!==0}get events(){return this._events}get router(){return this._router}get watcherCount(){return this._watcherCount}record(t){this._watcherCount!==0&&((this._events??(this._events=[])).push(t),this._transactionDepth===0&&!this._publishing&&this._publish())}transaction(t){var o;let e=!1,h,n=!1,i,s;this._transactionDepth++;try{s=t()}catch(r){e=!0,h=r}finally{if(this._transactionDepth--,this._transactionDepth===0&&((o=this._events)!=null&&o.length))try{this._publish()}catch(r){n=!0,i=r}}if(e&&n)throw new AggregateError([h,i],this._transactionErrorMessage);if(e)throw h;if(n)throw i;return s}watch(t,e){const h=Array.isArray(t)?t:[t];if(h.length===0)throw new TypeError("[Raph] Path watch requires at least one mask.");const n=new Map;for(const r of h){const u=p.parsePathMask(r);n.set(u.canonical,u)}const i={active:!0,callback:e},s=this._router??(this._router=new g.PathRouter),o=[...n.values()].map(r=>s.add(r,i));return this._watcherCount++,d(()=>{i.active=!1,i.callback=void 0;for(const r of o)r();this._watcherCount--,this._watcherCount===0&&(this._router=void 0)})}_publish(){const t=this._events;if(t===void 0||t.length===0||this._publishing)return;const e=[];this._publishing=!0;try{for(;t.length!==0;){const h=t.splice(0),n=this._router;if(n===void 0)continue;const i=new Map;for(const s of h){const o=p.parseDataPath(s.path),r=o.segments.length===0?n.matchAll():n.match(o.segments);for(const u of r){const l=i.get(u);l===void 0?i.set(u,[s]):l.push(s)}}for(const[s,o]of i)if(!(!s.active||s.callback===void 0))try{s.callback({events:o})}catch(r){e.push(r)}}}finally{this._publishing=!1}if(e.length===1)throw e[0];if(e.length>1)throw new AggregateError(e,"[Raph] Multiple path watchers failed.")}}function d(a){let t=a;return()=>{const e=t;t=void 0,e==null||e()}}exports.PathEventHub=v;

package/dist/debug/path/PathEventHub.js

@@ -0,0 +1,148 @@
+var p = Object.defineProperty;
+var f = (a, t, e) => t in a ? p(a, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : a[t] = e;
+var c = (a, t, e) => f(a, typeof t != "symbol" ? t + "" : t, e);
+import { parsePathMask as _, parseDataPath as g } from "./data-path.js";
+import { PathRouter as v } from "./path-router.js";
+class y {
+  /**
+   * Создаёт общий transaction и publication boundary для path store.
+   */
+  constructor(t) {
+    // Хранят ленивый routing и текущий batch path events.
+    c(this, "_router");
+    c(this, "_events");
+    // Защищают границы transaction, reentrant publication и snapshot requirements.
+    c(this, "_transactionDepth", 0);
+    c(this, "_watcherCount", 0);
+    c(this, "_publishing", !1);
+    this._transactionErrorMessage = t;
+  }
+  /**
+   * Показывает, есть ли watchers, ради которых нужно сохранять значения событий.
+   */
+  get hasWatchers() {
+    return this._watcherCount !== 0;
+  }
+  /**
+   * Возвращает накопленные события текущей transaction.
+   * @internal
+   */
+  get events() {
+    return this._events;
+  }
+  /**
+   * Возвращает внутренний path router для диагностики store.
+   * @internal
+   */
+  get router() {
+    return this._router;
+  }
+  /**
+   * Возвращает число активных watchers.
+   * @internal
+   */
+  get watcherCount() {
+    return this._watcherCount;
+  }
+  /**
+   * Добавляет событие в текущую transaction либо публикует его сразу.
+   */
+  record(t) {
+    this._watcherCount !== 0 && ((this._events ?? (this._events = [])).push(t), this._transactionDepth === 0 && !this._publishing && this._publish());
+  }
+  /**
+   * Выполняет операцию в общей синхронной transaction boundary.
+   */
+  transaction(t) {
+    var n;
+    let e = !1, h, o = !1, i, s;
+    this._transactionDepth++;
+    try {
+      s = t();
+    } catch (r) {
+      e = !0, h = r;
+    } finally {
+      if (this._transactionDepth--, this._transactionDepth === 0 && ((n = this._events) != null && n.length))
+        try {
+          this._publish();
+        } catch (r) {
+          o = !0, i = r;
+        }
+    }
+    if (e && o)
+      throw new AggregateError(
+        [h, i],
+        this._transactionErrorMessage
+      );
+    if (e)
+      throw h;
+    if (o)
+      throw i;
+    return s;
+  }
+  /**
+   * Подписывает callback на подходящие изменения и возвращает disposer.
+   */
+  watch(t, e) {
+    const h = Array.isArray(t) ? t : [t];
+    if (h.length === 0)
+      throw new TypeError("[Raph] Path watch requires at least one mask.");
+    const o = /* @__PURE__ */ new Map();
+    for (const r of h) {
+      const u = _(r);
+      o.set(u.canonical, u);
+    }
+    const i = { active: !0, callback: e }, s = this._router ?? (this._router = new v()), n = [...o.values()].map((r) => s.add(r, i));
+    return this._watcherCount++, w(() => {
+      i.active = !1, i.callback = void 0;
+      for (const r of n)
+        r();
+      this._watcherCount--, this._watcherCount === 0 && (this._router = void 0);
+    });
+  }
+  _publish() {
+    const t = this._events;
+    if (t === void 0 || t.length === 0 || this._publishing)
+      return;
+    const e = [];
+    this._publishing = !0;
+    try {
+      for (; t.length !== 0; ) {
+        const h = t.splice(0), o = this._router;
+        if (o === void 0)
+          continue;
+        const i = /* @__PURE__ */ new Map();
+        for (const s of h) {
+          const n = g(s.path), r = n.segments.length === 0 ? o.matchAll() : o.match(n.segments);
+          for (const u of r) {
+            const l = i.get(u);
+            l === void 0 ? i.set(u, [s]) : l.push(s);
+          }
+        }
+        for (const [s, n] of i)
+          if (!(!s.active || s.callback === void 0))
+            try {
+              s.callback({ events: n });
+            } catch (r) {
+              e.push(r);
+            }
+      }
+    } finally {
+      this._publishing = !1;
+    }
+    if (e.length === 1)
+      throw e[0];
+    if (e.length > 1)
+      throw new AggregateError(e, "[Raph] Multiple path watchers failed.");
+  }
+}
+function w(a) {
+  let t = a;
+  return () => {
+    const e = t;
+    t = void 0, e == null || e();
+  };
+}
+export {
+  y as PathEventHub
+};

package/dist/debug/path/PathStore.cjs

@@ -0,0 +1 @@
+"use strict";var R=Object.defineProperty;var P=(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)=>P(r,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./data-path.cjs"),H=require("./PathEventHub.cjs"),u=new WeakMap;class m{constructor(){v(this,"_root");v(this,"_eventHub",new H.PathEventHub("[Raph] Path transaction and publication failed."))}get _router(){return this._eventHub.router}get _events(){return this._eventHub.events}get _watcherCount(){return this._eventHub.watcherCount}get(e,t){const n=f.parseDataPath(e,t),o=this._root;if(o!==void 0)return h(o,n.segments).value}peek(e,t){return this.get(e,t)}has(e,t){const n=f.parseDataPath(e,t),o=this._root;return o!==void 0&&h(o,n.segments).exists}set(e,t,n){const o=f.parseDataPath(e,n);if(o.segments.length===0){this._setRoot(t);return}const s=this._eventHub.hasWatchers,i=s?h(this._root,o.segments).value:void 0;if(this._root??(this._root=Object.create(null)),w(this._root,o,t),!s)return;const c=h(this._root,o.segments).value;this._eventHub.record({kind:"set",path:o.canonical,previous:i,value:c})}merge(e,t,n){const o=f.parseDataPath(e,n);if(o.segments.length===0){this._mergeRoot(t);return}const s=this._eventHub.hasWatchers,i=h(this._root,o.segments).value,c=s&&a(i)&&a(t)?A(i):i;if(a(i)&&a(t)){p(this._root,o.segments);for(const g of Object.keys(t))l(i,g,t[g])}else this._root??(this._root=Object.create(null)),w(this._root,o,t);if(!s)return;const d=h(this._root,o.segments).value;this._eventHub.record({kind:"merge",path:o.canonical,previous:c,value:d})}delete(e,t){const n=f.parseDataPath(e,t);if(n.segments.length===0){this._deleteRoot();return}const o=h(this._root,n.segments);!o.exists||this._root===void 0||(p(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(e){return this._eventHub.transaction(e)}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&&a(t)&&a(e)?A(t):t;if(a(t)&&a(e))for(const o of Object.keys(e))l(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=D(),this._recordRootEvent("delete",e,void 0))}_recordRootEvent(e,t,n){this._eventHub.record({kind:e,path:"",previous:t,value:n})}}function h(r,e){let t=r;for(const n of e)if(n.kind==="key"){if(!b(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 p(r,e){let t=r;for(const n of e){if(!b(t))return;const o=j(t,n);Array.isArray(t)&&u.delete(t),t=o}}function w(r,e,t){let n=r,o;for(let i=0;i<e.segments.length-1;i++){const c=e.segments[i],d=e.segments[i+1];c.kind==="selector"&&Array.isArray(n)&&(o=n),c.kind==="index"&&Array.isArray(n)&&(o=n),n=C(n,c,d,e.canonical)}const s=e.segments[e.segments.length-1];if(S(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(!b(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 C(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=O(t),l(s,e.key,i)),k(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=O(t),r[e.index]=s),k(s,n)}if(!Array.isArray(r))throw y(n);let o=_(r,e.key,e.value);if(o===-1){u.delete(r);const s=Object.create(null);s[e.key]=e.value,r.push(s),o=r.length-1}return k(r[o],n)}function S(r,e,t,n){if(e.kind==="key"){l(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(!a(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 O(r){return r.kind==="index"||r.kind==="selector"?[]:Object.create(null)}function D(){return Object.create(null)}function x(r){if(b(r))return r;throw new TypeError("[Raph] Root value must be an object or array.")}function k(r,e){if(b(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=new Map;for(let i=0;i<r.length;i++){const c=r[i];if(a(c)&&Object.hasOwn(c,e)){const d=c[e];(d===null||typeof d=="string"||typeof d=="number"||typeof d=="boolean")&&!s.has(d)&&s.set(d,i)}}return n||(n=new Map,u.set(r,n)),n.set(e,s),s.get(t)??-1}function l(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))l(e,t,r[t]);return e}function a(r){return typeof r=="object"&&r!==null&&!Array.isArray(r)}function b(r){return Array.isArray(r)||a(r)}function y(r){return new TypeError(`[Raph] Cannot traverse non-container data at "${r}".`)}exports.PathStore=m;