@raphy-js/raph 1.0.1-dev.20 → 1.0.1-dev.25

package/dist/debug/path/storage/PathEventHub.js

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

package/dist/debug/path/storage/PathStore.cjs

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

package/dist/debug/path/storage/PathStore.js

@@ -1,37 +1,27 @@
-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 k = (r, e, t) => m(r, typeof e != "symbol" ? e + "" : e, t);
-import { parseDataPath as h } from "../data-path.utils.js";
-import { PathEventHub as H } from "./PathEventHub.js";
-const u = /* @__PURE__ */ new WeakMap();
-class $ {
-  constructor() {
-    // Владеют path data и независимым event lifecycle этого store.
-    k(this, "_root");
-    k(this, "_eventHub", new H(
-      "[Raph] Path batch and publication failed."
-    ));
-  }
+import { parseDataPath as a } from "../data-path.utils.js";
+import { PathEventHub as j } from "./PathEventHub.js";
+const d = /* @__PURE__ */ new WeakMap();
+class S {
+  // Владеют path data и независимым event lifecycle этого store.
+  _root;
+  _eventHub = new j(
+    "[Raph] Path batch and publication failed."
+  );
   /**
-   * Возвращает внутренний router для диагностического контракта Kernel.
+   * Возвращает владельца batch boundary этого store: Kernel открывает и
+   * закрывает её без closure операции.
    * @internal
    */
-  get _router() {
-    return this._eventHub.router;
-  }
-  get _events() {
-    return this._eventHub.events;
-  }
-  get _watcherCount() {
-    return this._eventHub.watcherCount;
+  get _batchHub() {
+    return this._eventHub;
   }
   /**
    * Возвращает значение по пути без создания отсутствующих данных.
    */
   get(e, t) {
-    const n = h(e, t), o = this._root;
+    const n = a(e, t), o = this._root;
     if (o !== void 0)
-      return a(o, n.segments).value;
+      return l(o, n.segments).value;
   }
   /**
    * Читает значение по пути без регистрации реактивной зависимости.
@@ -43,22 +33,22 @@ class $ {
    * Проверяет наличие значения по указанному пути.
    */
   has(e, t) {
-    const n = h(e, t), o = this._root;
-    return o !== void 0 && a(o, n.segments).exists;
+    const n = a(e, t), o = this._root;
+    return o !== void 0 && l(o, n.segments).exists;
   }
   /**
    * Записывает значение и публикует соответствующее изменение.
    */
   set(e, t, n) {
-    const o = h(e, n);
+    const o = a(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)
+    const s = this._eventHub.hasWatchers, i = s ? l(this._root, o.segments).value : void 0;
+    if (this._root ??= /* @__PURE__ */ Object.create(null), w(this._root, o, t), !s)
       return;
-    const c = a(this._root, o.segments).value;
+    const c = l(this._root, o.segments).value;
     this._eventHub.record({
       kind: "set",
       path: o.canonical,
@@ -70,21 +60,21 @@ class $ {
    * Объединяет значение по пути и публикует соответствующее изменение.
    */
   merge(e, t, n) {
-    const o = h(e, n);
+    const o = a(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))
-        l(i, w, t[w]);
+    const s = this._eventHub.hasWatchers, i = l(this._root, o.segments).value, c = s && u(i) && u(t) ? p(i) : i;
+    if (u(i) && u(t)) {
+      x(this._root, o.segments);
+      for (const v of Object.keys(t))
+        h(i, v, t[v]);
     } else
-      this._root ?? (this._root = /* @__PURE__ */ Object.create(null)), O(this._root, o, t);
+      this._root ??= /* @__PURE__ */ Object.create(null), w(this._root, o, t);
     if (!s)
       return;
-    const f = a(this._root, o.segments).value;
+    const f = l(this._root, o.segments).value;
     this._eventHub.record({
       kind: "merge",
       path: o.canonical,
@@ -96,13 +86,13 @@ class $ {
    * Удаляет значение по пути и публикует изменение при наличии данных.
    */
   delete(e, t) {
-    const n = h(e, t);
+    const n = a(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({
+    const o = l(this._root, n.segments);
+    !o.exists || this._root === void 0 || (x(this._root, n.segments), R(this._root, n), this._eventHub.hasWatchers && this._eventHub.record({
       kind: "delete",
       path: n.canonical,
       previous: o.value,
@@ -122,31 +112,31 @@ class $ {
     return this._eventHub.watch(e, t);
   }
   _setRoot(e) {
-    const t = x(e), n = this._root;
+    const t = g(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))
+    const t = this._root, n = this._eventHub.hasWatchers && u(t) && u(e) ? p(t) : t;
+    if (u(t) && u(e))
       for (const o of Object.keys(e))
-        l(t, o, e[o]);
+        h(t, o, e[o]);
     else
-      this._root = x(e);
+      this._root = g(e);
     this._recordRootEvent("merge", n, this._root);
   }
   _deleteRoot() {
     const e = this._root;
-    e !== void 0 && (this._root = S(), this._recordRootEvent("delete", e, void 0));
+    e !== void 0 && (this._root = E(), this._recordRootEvent("delete", e, void 0));
   }
   _recordRootEvent(e, t, n) {
     this._eventHub.record({ kind: e, path: "", previous: t, value: n });
   }
 }
-function a(r, e) {
+function l(r, e) {
   let t = r;
   for (const n of e)
     if (n.kind === "key") {
-      if (!b(t) || !Object.hasOwn(t, n.key))
+      if (!_(t) || !Object.hasOwn(t, n.key))
         return { exists: !1, value: void 0 };
       t = t[n.key];
     } else if (n.kind === "index") {
@@ -156,39 +146,39 @@ function a(r, e) {
     } else {
       if (!Array.isArray(t))
         return { exists: !1, value: void 0 };
-      const o = _(t, n.key, n.value);
+      const o = b(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) {
+function x(r, e) {
   let t = r;
   for (const n of e) {
-    if (!b(t))
+    if (!_(t))
       return;
-    const o = j(t, n);
-    Array.isArray(t) && u.delete(t), t = o;
+    const o = A(t, n);
+    Array.isArray(t) && d.delete(t), t = o;
   }
 }
-function O(r, e, t) {
+function w(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);
+    c.kind === "selector" && Array.isArray(n) && (o = n), c.kind === "index" && Array.isArray(n) && (o = n), n = m(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);
+  if (H(n, s, t, e.canonical), s.kind === "key" && o !== void 0) {
+    const i = d.get(o);
+    i?.delete(s.key), i?.size === 0 && d.delete(o);
   }
 }
-function E(r, e) {
+function R(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))
+    const i = e.segments[s], c = A(t, i);
+    if (!_(c))
       return;
     t = c;
   }
@@ -200,101 +190,101 @@ function E(r, e) {
   if (!Array.isArray(t))
     return;
   if (n.kind === "index") {
-    u.delete(t), delete t[n.index];
+    d.delete(t), delete t[n.index];
     return;
   }
-  const o = _(t, n.key, n.value);
-  o !== -1 && (u.delete(t), delete t[o]);
+  const o = b(t, n.key, n.value);
+  o !== -1 && (d.delete(t), delete t[o]);
 }
-function j(r, e) {
+function A(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);
+  const t = b(r, e.key, e.value);
   return t === -1 ? void 0 : r[t];
 }
-function P(r, e, t, n) {
+function m(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), l(s, e.key, i)), v(i, n);
+    return (!Object.hasOwn(s, e.key) || i === void 0) && (i = O(t), h(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 = p(t), r[e.index] = s), v(s, n);
+    return (!Object.hasOwn(r, e.index) || s === void 0) && (d.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);
+  let o = b(r, e.key, e.value);
   if (o === -1) {
-    u.delete(r);
+    d.delete(r);
     const s = /* @__PURE__ */ Object.create(null);
     s[e.key] = e.value, r.push(s), o = r.length - 1;
   }
-  return v(r[o], n);
+  return k(r[o], n);
 }
-function C(r, e, t, n) {
+function H(r, e, t, n) {
   if (e.kind === "key") {
-    l(r, e.key, t);
+    h(r, e.key, t);
     return;
   }
   if (e.kind === "index") {
     if (!Array.isArray(r))
       throw y(n);
-    u.delete(r), r[e.index] = t;
+    d.delete(r), r[e.index] = t;
     return;
   }
   if (!Array.isArray(r))
     throw y(n);
-  const o = _(r, e.key, e.value);
+  const o = b(r, e.key, e.value);
   if (o !== -1) {
-    u.delete(r), r[o] = t;
+    d.delete(r), r[o] = t;
     return;
   }
-  if (!d(t))
+  if (!u(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 });
+  d.delete(r), r.push(Object.hasOwn(t, e.key) ? t : { ...t, [e.key]: e.value });
 }
-function p(r) {
+function O(r) {
   return r.kind === "index" || r.kind === "selector" ? [] : /* @__PURE__ */ Object.create(null);
 }
-function S() {
+function E() {
   return /* @__PURE__ */ Object.create(null);
 }
-function x(r) {
-  if (b(r))
+function g(r) {
+  if (_(r))
     return r;
   throw new TypeError("[Raph] Root value must be an object or array.");
 }
-function v(r, e) {
-  if (b(r))
+function k(r, e) {
+  if (_(r))
     return r;
   throw y(e);
 }
-function _(r, e, t) {
-  let n = u.get(r);
-  const o = n == null ? void 0 : n.get(e);
+function b(r, e, t) {
+  let n = d.get(r);
+  const o = 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)) {
+    if (u(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;
+  return n || (n = /* @__PURE__ */ new Map(), d.set(r, n)), n.set(e, s), s.get(t) ?? -1;
 }
-function l(r, e, t) {
+function h(r, e, t) {
   if (e === "__proto__") {
     Object.defineProperty(r, e, {
       configurable: !0,
@@ -306,21 +296,21 @@ function l(r, e, t) {
   }
   r[e] = t;
 }
-function A(r) {
+function p(r) {
   const e = Object.create(Object.getPrototypeOf(r));
   for (const t of Object.keys(r))
-    l(e, t, r[t]);
+    h(e, t, r[t]);
   return e;
 }
-function d(r) {
+function u(r) {
   return typeof r == "object" && r !== null && !Array.isArray(r);
 }
-function b(r) {
-  return Array.isArray(r) || d(r);
+function _(r) {
+  return Array.isArray(r) || u(r);
 }
 function y(r) {
   return new TypeError(`[Raph] Cannot traverse non-container data at "${r}".`);
 }
 export {
-  $ as PathStore
+  S as PathStore
 };

package/dist/debug/path/storage/createDataDraft.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function y(S,x){const m=new WeakMap,v=new WeakMap,b=(n,u,s=new Set)=>{if(!s.has(n)){s.add(n),n.changed.add(u),Array.isArray(n.source)&&x(n.proxy);for(const[c,l]of n.parents)for(const r of l)b(c,r,s)}},w=(n,u,s)=>{if(!n||typeof n!="object")return n;const c=Object.getPrototypeOf(n);let l=v.get(n)??m.get(n);if(!l){const r=n,g=Array.isArray(r),d=g?[]:Object.create(c);g&&(d.length=r.length),l={source:r,proxy:null,values:new Map,removed:new Set,changed:new Set,parents:new Map};const t=l,O=a=>!t.removed.has(a)&&(t.values.has(a)||Reflect.has(r,a)),i=a=>t.removed.has(a)?void 0:t.values.has(a)?t.values.get(a):Reflect.get(r,a);t.proxy=new Proxy(d,{get:(a,e)=>w(i(e),t,e),has:(a,e)=>O(e),set:(a,e,f)=>{if(g&&e==="length"){const o=Number(f);if(!Number.isInteger(o)||o<0||o>4294967295)throw new RangeError("Invalid array length");for(let h=o;h<Number(i("length"));h++)t.removed.add(String(h)),t.values.delete(String(h));d.length=o}else if(g&&typeof e=="string"&&/^(?:0|[1-9]\d*)$/.test(e)){const o=Number(e);o<4294967295&&o>=Number(i("length"))&&(t.values.set("length",o+1),d.length=o+1)}return t.values.set(e,f),t.removed.delete(e),b(t,e),!0},deleteProperty:(a,e)=>g&&e==="length"?!1:(t.values.delete(e),t.removed.add(e),b(t,e),!0),ownKeys:()=>[...new Set([...Reflect.ownKeys(r),...t.values.keys()])].filter(a=>!t.removed.has(a)),getOwnPropertyDescriptor:(a,e)=>{if(g&&e==="length")return{value:i(e),writable:!0,enumerable:!1,configurable:!1};const f=Object.getOwnPropertyDescriptor(r,e);if(!(t.removed.has(e)||!f&&!t.values.has(e)))return{value:w(i(e),t,e),writable:!0,enumerable:(f==null?void 0:f.enumerable)??!0,configurable:!0}}}),m.set(r,t),v.set(t.proxy,t)}if(u&&s!==void 0){let r=l.parents.get(u);r||(r=new Set,l.parents.set(u,r)),r.add(s)}return l.proxy};return{root:w(S),unchangedArray(n,u){const s=v.get(n);if(!s)return null;for(const c of s.changed){if(s.values.has(c)||s.removed.has(c))return null;const l=m.get(s.source[c]);if(l!=null&&l.changed.has(u))return null}return s.source}}}exports.createDataDraft=y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function y(S,x){const w=new WeakMap,m=new WeakMap,v=(n,u,s=new Set)=>{if(!s.has(n)){s.add(n),n.changed.add(u),Array.isArray(n.source)&&x(n.proxy);for(const[c,l]of n.parents)for(const r of l)v(c,r,s)}},b=(n,u,s)=>{if(!n||typeof n!="object")return n;const c=Object.getPrototypeOf(n);let l=m.get(n)??w.get(n);if(!l){const r=n,f=Array.isArray(r),d=f?[]:Object.create(c);f&&(d.length=r.length),l={source:r,proxy:null,values:new Map,removed:new Set,changed:new Set,parents:new Map};const t=l,O=a=>!t.removed.has(a)&&(t.values.has(a)||Reflect.has(r,a)),g=a=>t.removed.has(a)?void 0:t.values.has(a)?t.values.get(a):Reflect.get(r,a);t.proxy=new Proxy(d,{get:(a,e)=>b(g(e),t,e),has:(a,e)=>O(e),set:(a,e,i)=>{if(f&&e==="length"){const o=Number(i);if(!Number.isInteger(o)||o<0||o>4294967295)throw new RangeError("Invalid array length");for(let h=o;h<Number(g("length"));h++)t.removed.add(String(h)),t.values.delete(String(h));d.length=o}else if(f&&typeof e=="string"&&/^(?:0|[1-9]\d*)$/.test(e)){const o=Number(e);o<4294967295&&o>=Number(g("length"))&&(t.values.set("length",o+1),d.length=o+1)}return t.values.set(e,i),t.removed.delete(e),v(t,e),!0},deleteProperty:(a,e)=>f&&e==="length"?!1:(t.values.delete(e),t.removed.add(e),v(t,e),!0),ownKeys:()=>[...new Set([...Reflect.ownKeys(r),...t.values.keys()])].filter(a=>!t.removed.has(a)),getOwnPropertyDescriptor:(a,e)=>{if(f&&e==="length")return{value:g(e),writable:!0,enumerable:!1,configurable:!1};const i=Object.getOwnPropertyDescriptor(r,e);if(!(t.removed.has(e)||!i&&!t.values.has(e)))return{value:b(g(e),t,e),writable:!0,enumerable:i?.enumerable??!0,configurable:!0}}}),w.set(r,t),m.set(t.proxy,t)}if(u&&s!==void 0){let r=l.parents.get(u);r||(r=new Set,l.parents.set(u,r)),r.add(s)}return l.proxy};return{root:b(S),unchangedArray(n,u){const s=m.get(n);if(!s)return null;for(const c of s.changed)if(s.values.has(c)||s.removed.has(c)||w.get(s.source[c])?.changed.has(u))return null;return s.source}}}exports.createDataDraft=y;