@raphy-js/raph 1.0.0-dev.2 → 1.0.1-dev.25

package/dist/debug/path/{MetaController.js → meta/MetaController.js}

@@ -1,38 +1,34 @@
-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 {
+import { DataPath as u } from "../DataPath.js";
+import { PathRouter as _ } from "../PathRouter.js";
+import { RaphMeta as v } from "./RaphMeta.js";
+import { RaphMetaStore as f } from "./RaphMetaStore.js";
+class C {
   /**
    * Создаёт 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, storage и routing только при первом использовании.
+  _facade;
+  _store;
+  _router;
+  _pending;
+  // Управляют reentrant publication и режимами активных watchers.
+  _publishing = !1;
+  _watcherCount = 0;
+  _deferredWatcherCount = 0;
   /**
    * Возвращает metadata facade, принадлежащий контроллеру.
    */
   get facade() {
-    return this._facade ?? (this._facade = new m(this._kernel));
+    return this._facade ??= new v(this._kernel);
   }
   /**
    * Возвращает число зарегистрированных записей.
    */
   get size() {
-    var e;
-    return ((e = this._store) == null ? void 0 : e.size) ?? 0;
+    return this._store?.size ?? 0;
   }
   /**
    * Показывает, есть ли активные синхронные metadata/path watchers.
@@ -50,34 +46,31 @@ class k {
    * Возвращает значение по пути без создания отсутствующих данных.
    */
   get(e, t) {
-    var r;
-    return (r = this._store) == null ? void 0 : r.get(e, t);
+    return this._store?.get(e, t);
   }
   /**
    * Проверяет наличие значения по указанному пути.
    */
   has(e, t) {
-    var r;
-    return ((r = this._store) == null ? void 0 : r.has(e, t)) ?? !1;
+    return this._store?.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);
+  set(e, t, r, s) {
+    (this._store ??= new f()).set(e, t, r), this.record("set", e, t, "explicit", s);
   }
   /**
    * Объединяет значение по пути и публикует соответствующее изменение.
    */
-  merge(e, t, r, i) {
-    (this._store ?? (this._store = new _())).merge(e, t, r), this.record("merge", e, t, "explicit", i);
+  merge(e, t, r, s) {
+    (this._store ??= new f()).merge(e, t, r), this.record("merge", e, t, "explicit", s);
   }
   /**
    * Удаляет значение по пути и публикует изменение при наличии данных.
    */
   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;
+    return this._store?.delete(e, t) ? (this.record("delete", e, t ?? null, "explicit", r), !0) : !1;
   }
   /**
    * Удаляет metadata всего поддерева указанного data-owner.
@@ -85,8 +78,8 @@ class k {
   deleteSubtree(e, t) {
     const r = this._store;
     if (r !== void 0)
-      for (const i of r.deleteSubtree(e))
-        this.record("delete", i, null, t);
+      for (const s of r.deleteSubtree(e))
+        this.record("delete", s, null, t);
   }
   /**
    * Удаляет metadata, владельцы которой отсутствуют в data tree.
@@ -96,46 +89,46 @@ class k {
     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(
+      (i) => i.kind === "index" || i.kind === "selector"
+    ), c = o === -1 ? e : u.fromPlain({ segs: e.toPlain().segs.slice(0, o) });
+    for (const i of r.pruneMissing(
       c,
       (n) => this._ownerExists(n)
     ))
-      this.record("delete", s, null, t);
+      this.record("delete", i, null, t);
   }
   /**
    * Подписывает callback на подходящие изменения и возвращает disposer.
    */
-  watch(e, t, r = {}, i) {
+  watch(e, t, r = {}, s) {
     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 l = u.from(a, r)._asMask();
+      c.set(l.canonical, l);
     }
-    const s = {
+    const i = {
       active: !0,
       callback: t,
-      afterPublish: i,
+      afterPublish: s,
       ...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;
+    }, n = this._router ??= new _(), h = [...c.values()].map((a) => n.add(a, i));
+    return this._watcherCount++, s !== void 0 && this._deferredWatcherCount++, p(() => {
+      i.active = !1, i.callback = void 0, i.afterPublish = void 0;
       for (const a of h)
         a();
-      this._watcherCount--, i !== void 0 && this._deferredWatcherCount--, this._watcherCount === 0 && (this._router = void 0);
+      this._watcherCount--, s !== void 0 && this._deferredWatcherCount--, this._watcherCount === 0 && (this._router = void 0);
     });
   }
   /**
-   * Добавляет событие в текущую transaction либо публикует его сразу.
+   * Добавляет событие в текущую batch либо публикует его сразу.
    */
-  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
+  record(e, t, r, s, o) {
+    (this._pending ??= []).push({
+      event: { kind: e, path: t, namespace: r, cause: s },
+      invalidate: o?.invalidate ?? !0
     }), !this._publicationDeferred() && !this._publishing && this.publish();
   }
   /**
@@ -149,32 +142,32 @@ class k {
     this._publishing = !0;
     try {
       for (; e.length !== 0; ) {
-        const i = e.splice(0), o = this._router;
+        const s = 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 i of s) {
+          const n = i.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));
+              invalidate: i.invalidate
+            }) : (a.events.push(n), i.invalidate && (a.invalidate = !0));
           }
         }
-        for (const [s, n] of c) {
-          if (!s.active || s.callback === void 0)
+        for (const [i, n] of c) {
+          if (!i.active || i.callback === void 0)
             continue;
-          const h = s.afterPublish;
+          const h = i.afterPublish;
           h !== void 0 && r.set(
             h,
             (r.get(h) ?? !1) || n.invalidate
           );
           try {
-            s.callback({ events: n.events });
+            i.callback({ events: n.events });
           } catch (a) {
             t.push(a);
           }
@@ -183,9 +176,9 @@ class k {
     } finally {
       this._publishing = !1;
     }
-    for (const [i, o] of r)
+    for (const [s, o] of r)
       try {
-        i(o);
+        s(o);
       } catch (c) {
         t.push(c);
       }
@@ -198,17 +191,16 @@ class k {
    * Очищает 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;
+    this._store?.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) {
+function p(d) {
   let e = d;
   return () => {
     const t = e;
-    e = void 0, t == null || t();
+    e = void 0, t?.();
   };
 }
 export {
-  k as MetaController
+  C as MetaController
 };

package/dist/debug/path/meta/RaphMeta.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class a{constructor(e,t={}){this._kernel=e,this._binding=t}get(e,t,i){return this._binding.assertReadable?.(),this._kernel.getMeta(e,t,i)}has(e,t,i){return this._binding.assertReadable?.(),this._kernel.hasMeta(e,t,i)}set(e,t,i,r){this._binding.assertWritable?.(),this._write(()=>this._kernel.setMeta(e,t,i,r),r?.invalidate??!0)}merge(e,t,i,r){this._binding.assertWritable?.(),this._write(()=>this._kernel.mergeMeta(e,t,i,r),r?.invalidate??!0)}delete(e,t,i){this._binding.assertWritable?.(),this._write(()=>this._kernel.deleteMeta(e,t,i),i?.invalidate??!0)}watch(e,t,i={}){if(this._binding.assertReadable?.(),this._binding.watch===void 0)throw new Error("[RaphMeta] watch requires a runtime-bound Meta facade.");return this._binding.watch(e,t,i)}_write(e,t){const i=this._binding.runWrite;i===void 0?e():i(e,t)}}exports.RaphMeta=a;

package/dist/debug/path/meta/RaphMeta.js

@@ -0,0 +1,62 @@
+class s {
+  /**
+   * Создаёт metadata facade поверх указанного Kernel.
+   */
+  constructor(e, t = {}) {
+    this._kernel = e, this._binding = t;
+  }
+  /**
+   * Возвращает значение по пути без создания отсутствующих данных.
+   */
+  get(e, t, i) {
+    return this._binding.assertReadable?.(), this._kernel.getMeta(e, t, i);
+  }
+  /**
+   * Проверяет наличие значения по указанному пути.
+   */
+  has(e, t, i) {
+    return this._binding.assertReadable?.(), this._kernel.hasMeta(e, t, i);
+  }
+  /**
+   * Записывает значение и публикует соответствующее изменение.
+   */
+  set(e, t, i, r) {
+    this._binding.assertWritable?.(), this._write(
+      () => this._kernel.setMeta(e, t, i, r),
+      r?.invalidate ?? !0
+    );
+  }
+  /**
+   * Объединяет значение по пути и публикует соответствующее изменение.
+   */
+  merge(e, t, i, r) {
+    this._binding.assertWritable?.(), this._write(
+      () => this._kernel.mergeMeta(e, t, i, r),
+      r?.invalidate ?? !0
+    );
+  }
+  /**
+   * Удаляет значение по пути и публикует изменение при наличии данных.
+   */
+  delete(e, t, i) {
+    this._binding.assertWritable?.(), this._write(
+      () => this._kernel.deleteMeta(e, t, i),
+      i?.invalidate ?? !0
+    );
+  }
+  /**
+   * Подписывает callback на metadata-изменения и возвращает disposer.
+   */
+  watch(e, t, i = {}) {
+    if (this._binding.assertReadable?.(), this._binding.watch === void 0)
+      throw new Error("[RaphMeta] watch requires a runtime-bound Meta facade.");
+    return this._binding.watch(e, t, i);
+  }
+  _write(e, t) {
+    const i = this._binding.runWrite;
+    i === void 0 ? e() : i(e, t);
+  }
+}
+export {
+  s as RaphMeta
+};

package/dist/debug/path/meta/RaphMetaStore.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../pathSegmentKey.cjs");function u(){return{children:new Map,namespaces:new Map,path:void 0}}class p{_root=u();size=0;get(e,t){const r=this._find(e);if(r!==void 0)return t===void 0?Object.fromEntries(r.namespaces):r.namespaces.get(t)}has(e,t){const r=this._find(e);return r===void 0?!1:t===void 0?r.namespaces.size!==0:r.namespaces.has(t)}set(e,t,r){const s=this._ensure(e);s.namespaces.has(t)||this.size++,s.namespaces.set(t,r),s.path=e}merge(e,t,r){const s=this.get(e,t);if(d(s)&&d(r)){for(const i of Object.keys(r))_(s,i,r[i]);return}this.set(e,t,r)}delete(e,t){const r=this._findStack(e),s=r.at(-1)?.node;if(s===void 0)return!1;if(t===void 0){if(s.namespaces.size===0)return!1;this.size-=s.namespaces.size,s.namespaces.clear()}else{if(!s.namespaces.delete(t))return!1;this.size--}return this._pruneEmpty(r),!0}deleteSubtree(e){const t=o(e);if(t.length===0)return this.clear();let r=this._root;for(let c=0;c<t.length-1;c++){const h=r.children.get(t[c]);if(h===void 0)return[];r=h}const s=r.children.get(t.at(-1));if(s===void 0)return[];const i=a(s);return this.size-=l(s),r.children.delete(t.at(-1)),i}pruneMissing(e,t){const r=this._find(e);if(r===void 0)return[];const s=[];return this._pruneMissingNode(r,t,s),s}clear(){const e=a(this._root);return this._root.children.clear(),this._root.namespaces.clear(),this._root.path=void 0,this.size=0,e}_find(e){let t=this._root;for(const r of o(e)){const s=t.children.get(r);if(s===void 0)return;t=s}return t}_ensure(e){let t=this._root;for(const r of o(e)){let s=t.children.get(r);s===void 0&&(s=u(),t.children.set(r,s)),t=s}return t}_findStack(e){const t=[{key:void 0,node:this._root}];let r=this._root;for(const s of o(e)){const i=r.children.get(s);if(i===void 0)return[];t.push({key:s,node:i}),r=i}return t}_pruneEmpty(e){for(let t=e.length-1;t>0;t--){const r=e[t];if(r.node.namespaces.size!==0||r.node.children.size!==0)return;e[t-1].node.children.delete(r.key)}}_pruneMissingNode(e,t,r){for(const[s,i]of[...e.children])this._pruneMissingNode(i,t,r)&&e.children.delete(s);return e.path!==void 0&&e.namespaces.size!==0&&!t(e.path)&&(this.size-=e.namespaces.size,e.namespaces.clear(),r.push(e.path)),e!==this._root&&e.namespaces.size===0&&e.children.size===0}}function o(n){return n.segments().map(f.pathSegmentKey)}function a(n){const e=n.path!==void 0&&n.namespaces.size!==0?[n.path]:[];for(const t of n.children.values())e.push(...a(t));return e}function l(n){let e=n.namespaces.size;for(const t of n.children.values())e+=l(t);return e}function d(n){if(typeof n!="object"||n===null||Array.isArray(n))return!1;const e=Object.getPrototypeOf(n);return e===Object.prototype||e===null}function _(n,e,t){if(e!=="__proto__"){n[e]=t;return}Object.defineProperty(n,e,{configurable:!0,enumerable:!0,value:t,writable:!0})}exports.RaphMetaStore=p;

package/dist/debug/path/{RaphMetaStore.js → meta/RaphMetaStore.js}

@@ -1,16 +1,11 @@
-var p = Object.defineProperty;
-var _ = (n, e, t) => e in n ? p(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
-var h = (n, e, t) => _(n, typeof e != "symbol" ? e + "" : e, t);
-import { pathSegmentKey as m } from "./segment-key.js";
-function f() {
+import { pathSegmentKey as u } from "../pathSegmentKey.js";
+function d() {
   return { children: /* @__PURE__ */ new Map(), namespaces: /* @__PURE__ */ new Map(), path: void 0 };
 }
-class v {
-  constructor() {
-    // Хранят metadata tree и точное число записанных namespaces.
-    h(this, "_root", f());
-    h(this, "size", 0);
-  }
+class m {
+  // Хранят metadata tree и точное число записанных namespaces.
+  _root = d();
+  size = 0;
   /**
    * Возвращает значение по пути без создания отсутствующих данных.
    */
@@ -38,9 +33,9 @@ class v {
    */
   merge(e, t, r) {
     const s = this.get(e, t);
-    if (l(s) && l(r)) {
+    if (f(s) && f(r)) {
       for (const i of Object.keys(r))
-        g(s, i, r[i]);
+        p(s, i, r[i]);
       return;
     }
     this.set(e, t, r);
@@ -49,8 +44,7 @@ class v {
    * Удаляет namespace либо все metadata указанного owner.
    */
   delete(e, t) {
-    var i;
-    const r = this._findStack(e), s = (i = r.at(-1)) == null ? void 0 : i.node;
+    const r = this._findStack(e), s = r.at(-1)?.node;
     if (s === void 0)
       return !1;
     if (t === void 0) {
@@ -73,16 +67,16 @@ class v {
       return this.clear();
     let r = this._root;
     for (let c = 0; c < t.length - 1; c++) {
-      const d = r.children.get(t[c]);
-      if (d === void 0)
+      const a = r.children.get(t[c]);
+      if (a === void 0)
         return [];
-      r = d;
+      r = a;
     }
     const s = r.children.get(t.at(-1));
     if (s === void 0)
       return [];
-    const i = a(s);
-    return this.size -= u(s), r.children.delete(t.at(-1)), i;
+    const i = h(s);
+    return this.size -= l(s), r.children.delete(t.at(-1)), i;
   }
   /**
    * Удаляет metadata, владельцы которой отсутствуют в data tree.
@@ -98,7 +92,7 @@ class v {
    * Полностью очищает metadata storage.
    */
   clear() {
-    const e = a(this._root);
+    const e = h(this._root);
     return this._root.children.clear(), this._root.namespaces.clear(), this._root.path = void 0, this.size = 0, e;
   }
   _find(e) {
@@ -115,7 +109,7 @@ class v {
     let t = this._root;
     for (const r of o(e)) {
       let s = t.children.get(r);
-      s === void 0 && (s = f(), t.children.set(r, s)), t = s;
+      s === void 0 && (s = d(), t.children.set(r, s)), t = s;
     }
     return t;
   }
@@ -147,27 +141,27 @@ class v {
   }
 }
 function o(n) {
-  return n.segments().map(m);
+  return n.segments().map(u);
 }
-function a(n) {
+function h(n) {
   const e = n.path !== void 0 && n.namespaces.size !== 0 ? [n.path] : [];
   for (const t of n.children.values())
-    e.push(...a(t));
+    e.push(...h(t));
   return e;
 }
-function u(n) {
+function l(n) {
   let e = n.namespaces.size;
   for (const t of n.children.values())
-    e += u(t);
+    e += l(t);
   return e;
 }
-function l(n) {
+function f(n) {
   if (typeof n != "object" || n === null || Array.isArray(n))
     return !1;
   const e = Object.getPrototypeOf(n);
   return e === Object.prototype || e === null;
 }
-function g(n, e, t) {
+function p(n, e, t) {
   if (e !== "__proto__") {
     n[e] = t;
     return;
@@ -180,5 +174,5 @@ function g(n, e, t) {
   });
 }
 export {
-  v as RaphMetaStore
+  m as RaphMetaStore
 };

package/dist/debug/path/meta/meta.types.cjs

@@ -0,0 +1 @@
+"use strict";

package/dist/debug/path/meta/meta.types.js

@@ -0,0 +1 @@
+

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("../data-path.utils.cjs"),d=require("./PathEventHub.cjs");class u{constructor(a){this._adapter=a}_eventHub=new d.PathEventHub("[Raph] Adapter batch and publication failed.");get(a,e){const t=i.parseDataPath(a,e);return this._adapter.get(t.canonical)}peek(a,e){return this.get(a,e)}has(a,e){const t=i.parseDataPath(a,e);return this._adapter.has?.(t.canonical)??o(this._adapter.root(),t.segments)}set(a,e,t){const n=i.parseDataPath(a,t),s=this._eventHub.hasWatchers?this._adapter.get(n.canonical):void 0;this._adapter.set(n.canonical,e),this._eventHub.record({kind:"set",path:n.canonical,previous:s,value:this._eventHub.hasWatchers?this._adapter.get(n.canonical):void 0})}merge(a,e,t){const n=i.parseDataPath(a,t),s=this._eventHub.hasWatchers?this._adapter.get(n.canonical):void 0,h=c(s)&&c(e)?p(s):s;this._adapter.merge(n.canonical,e),this._eventHub.record({kind:"merge",path:n.canonical,previous:h,value:this._eventHub.hasWatchers?this._adapter.get(n.canonical):void 0})}delete(a,e){const t=i.parseDataPath(a,e);if(!(this._adapter.has?.(t.canonical)??o(this._adapter.root(),t.segments)))return;const s=this._eventHub.hasWatchers?this._adapter.get(t.canonical):void 0;this._adapter.delete(t.canonical),this._eventHub.record({kind:"delete",path:t.canonical,previous:s,value:void 0})}batch(a){return this._eventHub.batch(a)}watch(a,e){return this._eventHub.watch(a,e)}}function o(r,a){let e=r;for(const t of a)if(t.kind==="key"){if(!l(e)||!Object.hasOwn(e,t.key))return!1;e=e[t.key]}else if(t.kind==="index"){if(!Array.isArray(e)||!Object.hasOwn(e,t.index))return!1;e=e[t.index]}else{if(!Array.isArray(e))return!1;const n=e.findIndex(s=>c(s)&&Object.hasOwn(s,t.key)&&Object.is(s[t.key],t.value));if(n===-1)return!1;e=e[n]}return!0}function p(r){const a=Object.create(Object.getPrototypeOf(r));for(const e of Object.keys(r))e==="__proto__"?Object.defineProperty(a,e,{configurable:!0,enumerable:!0,value:r[e],writable:!0}):a[e]=r[e];return a}function c(r){return typeof r=="object"&&r!==null&&!Array.isArray(r)}function l(r){return Array.isArray(r)||c(r)}exports.AdapterPathStore=u;

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

@@ -0,0 +1,128 @@
+import { parseDataPath as i } from "../data-path.utils.js";
+import { PathEventHub as d } from "./PathEventHub.js";
+class b {
+  /**
+   * Связывает внешний DataAdapter с path events и watchers Kernel.
+   */
+  constructor(a) {
+    this._adapter = a;
+  }
+  // Публикует изменения внешнего adapter через общий path event lifecycle.
+  _eventHub = new d(
+    "[Raph] Adapter batch and publication failed."
+  );
+  /**
+   * Возвращает значение по пути без создания отсутствующих данных.
+   */
+  get(a, e) {
+    const t = i(a, e);
+    return this._adapter.get(t.canonical);
+  }
+  /**
+   * Читает значение по пути без регистрации реактивной зависимости.
+   */
+  peek(a, e) {
+    return this.get(a, e);
+  }
+  /**
+   * Проверяет наличие значения по указанному пути.
+   */
+  has(a, e) {
+    const t = i(a, e);
+    return this._adapter.has?.(t.canonical) ?? o(this._adapter.root(), t.segments);
+  }
+  /**
+   * Записывает значение и публикует соответствующее изменение.
+   */
+  set(a, e, t) {
+    const n = i(a, t), s = this._eventHub.hasWatchers ? this._adapter.get(n.canonical) : void 0;
+    this._adapter.set(n.canonical, e), this._eventHub.record({
+      kind: "set",
+      path: n.canonical,
+      previous: s,
+      value: this._eventHub.hasWatchers ? this._adapter.get(n.canonical) : void 0
+    });
+  }
+  /**
+   * Объединяет значение по пути и публикует соответствующее изменение.
+   */
+  merge(a, e, t) {
+    const n = i(a, t), s = this._eventHub.hasWatchers ? this._adapter.get(n.canonical) : void 0, h = c(s) && c(e) ? u(s) : s;
+    this._adapter.merge(n.canonical, e), this._eventHub.record({
+      kind: "merge",
+      path: n.canonical,
+      previous: h,
+      value: this._eventHub.hasWatchers ? this._adapter.get(n.canonical) : void 0
+    });
+  }
+  /**
+   * Удаляет значение по пути и публикует изменение при наличии данных.
+   */
+  delete(a, e) {
+    const t = i(a, e);
+    if (!(this._adapter.has?.(t.canonical) ?? o(this._adapter.root(), t.segments)))
+      return;
+    const s = this._eventHub.hasWatchers ? this._adapter.get(t.canonical) : void 0;
+    this._adapter.delete(t.canonical), this._eventHub.record({
+      kind: "delete",
+      path: t.canonical,
+      previous: s,
+      value: void 0
+    });
+  }
+  /**
+   * Выполняет операцию в общей синхронной batch boundary.
+   */
+  batch(a) {
+    return this._eventHub.batch(a);
+  }
+  /**
+   * Подписывает callback на подходящие изменения и возвращает disposer.
+   */
+  watch(a, e) {
+    return this._eventHub.watch(a, e);
+  }
+}
+function o(r, a) {
+  let e = r;
+  for (const t of a)
+    if (t.kind === "key") {
+      if (!p(e) || !Object.hasOwn(e, t.key))
+        return !1;
+      e = e[t.key];
+    } else if (t.kind === "index") {
+      if (!Array.isArray(e) || !Object.hasOwn(e, t.index))
+        return !1;
+      e = e[t.index];
+    } else {
+      if (!Array.isArray(e))
+        return !1;
+      const n = e.findIndex(
+        (s) => c(s) && Object.hasOwn(s, t.key) && Object.is(s[t.key], t.value)
+      );
+      if (n === -1)
+        return !1;
+      e = e[n];
+    }
+  return !0;
+}
+function u(r) {
+  const a = Object.create(Object.getPrototypeOf(r));
+  for (const e of Object.keys(r))
+    e === "__proto__" ? Object.defineProperty(a, e, {
+      configurable: !0,
+      enumerable: !0,
+      value: r[e],
+      writable: !0
+    }) : a[e] = r[e];
+  return a;
+}
+function c(r) {
+  return typeof r == "object" && r !== null && !Array.isArray(r);
+}
+function p(r) {
+  return Array.isArray(r) || c(r);
+}
+export {
+  b as AdapterPathStore
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("../data-path.utils.cjs"),A=require("./createDataDraft.cjs");class w{_root;_options;_indexes;constructor(e=b(),t={}){this._root=_(e),this._options={arrayDelete:t.arrayDelete??"unset",autoCreate:t.autoCreate??!0,indexEnabled:t.indexEnabled??!0,indexStrategy:t.indexStrategy??"eager-all-keys"}}root(){return this._root}fork(){const e=new w({},this._options);return e._root=A.createDataDraft(this._root,t=>e._indexes?.delete(t)).root,e}replaceRoot(e){this._root=_(e),this._indexes=void 0}options(e){e.arrayDelete!==void 0&&(this._options.arrayDelete=e.arrayDelete),e.autoCreate!==void 0&&(this._options.autoCreate=e.autoCreate),e.indexEnabled!==void 0&&(this._options.indexEnabled=e.indexEnabled),e.indexStrategy!==void 0&&(this._options.indexStrategy=e.indexStrategy),this._indexes=void 0}get(e,t){return this._read(h.parseDataPath(e,t)).value}has(e,t){return this._read(h.parseDataPath(e,t)).exists}set(e,t,r){const i=h.parseDataPath(e,r);if(i.segments.length===0){this.replaceRoot(_(t));return}let s=this._root,n;for(let a=0;a<i.segments.length-1;a++){const d=i.segments[a],c=i.segments[a+1],l=this._readOrCreateChild(s,d,c,i.canonical);s=l.value,n=l.indexedParent}this._writeSegment(s,i.segments[i.segments.length-1],t,i.canonical,n)}merge(e,t,r){const i=this.get(e,r);if(f(i)&&f(t)){for(const s of Object.keys(t))k(i,s,t[s]);this._indexes=void 0;return}this.set(e,t,r)}delete(e,t){const r=h.parseDataPath(e,t);if(r.segments.length===0){this._root=b(),this._indexes=void 0;return}let i=this._root;for(let n=0;n<r.segments.length-1;n++){if(!u(i))return;i=this._readSegment(i,r.segments[n])}if(!u(i))return;const s=r.segments[r.segments.length-1];if(s.kind==="key")delete i[s.key];else if(s.kind==="index"){if(!Array.isArray(i))return;this._options.arrayDelete==="splice"?i.splice(s.index,1):delete i[s.index]}else{if(!Array.isArray(i))return;const n=this._findSelector(i,s.key,s.value);if(n===-1)return;this._options.arrayDelete==="splice"?i.splice(n,1):delete i[n]}this._indexes=void 0}indexOf(e,t){const r=h.parseDataPath(e,t);let i=this._root;for(let s=0;s<r.segments.length;s++){const n=r.segments[s],a=s===r.segments.length-1;if(n.kind==="key"){if(!u(i)||!Object.hasOwn(i,n.key))return-1;i=i[n.key];continue}if(!Array.isArray(i))return-1;if(n.kind==="index"){if(!Object.hasOwn(i,n.index))return-1;if(a)return n.index;i=i[n.index];continue}const d=this._findSelector(i,n.key,n.value);if(d===-1)return-1;if(a)return d;i=i[d]}return-1}_read(e){let t=this._root;for(const r of e.segments)if(r.kind==="key"){if(!u(t)||!Object.hasOwn(t,r.key))return{exists:!1,value:void 0};t=t[r.key]}else if(r.kind==="index"){if(!Array.isArray(t)||!Object.hasOwn(t,r.index))return{exists:!1,value:void 0};t=t[r.index]}else{if(!Array.isArray(t))return{exists:!1,value:void 0};const i=this._findSelector(t,r.key,r.value);if(i===-1)return{exists:!1,value:void 0};t=t[i]}return{exists:!0,value:t}}_readSegment(e,t){if(t.kind==="key")return Object.hasOwn(e,t.key)?e[t.key]:void 0;if(!Array.isArray(e))return;if(t.kind==="index")return e[t.index];const r=this._findSelector(e,t.key,t.value);return r===-1?void 0:e[r]}_readOrCreateChild(e,t,r,i){if(t.kind==="key"){let n=e[t.key];if(!Object.hasOwn(e,t.key)||n===void 0){if(!this._options.autoCreate)throw y(i);n=O(r),k(e,t.key,n)}return{value:x(n,i)}}if(!Array.isArray(e))throw p(i);if(t.kind==="index"){let n=e[t.index];if(!Object.hasOwn(e,t.index)||n===void 0){if(!this._options.autoCreate)throw y(i);n=O(r),e[t.index]=n}return{value:x(n,i),indexedParent:{array:e,index:t.index}}}let s=this._findSelector(e,t.key,t.value);if(s===-1){if(!this._options.autoCreate)throw y(i);const n=Object.create(null);n[t.key]=t.value,e.push(n),s=e.length-1,this._invalidateArray(e)}return{value:x(e[s],i),indexedParent:{array:e,index:s}}}_writeSegment(e,t,r,i,s){if(t.kind==="key"){k(e,t.key,r),s!==void 0&&s.array[s.index]===e&&this._invalidateIndexKey(s.array,t.key);return}if(!Array.isArray(e))throw p(i);if(t.kind==="index"){e[t.index]=r,this._invalidateArray(e);return}if(!f(r))throw new TypeError(`[Raph] New selector target at "${i}" must be an object.`);if(Object.hasOwn(r,t.key)&&!Object.is(r[t.key],t.value))throw new TypeError(`[Raph] Selector target at "${i}" has a conflicting key.`);const n=this._findSelector(e,t.key,t.value);if(n===-1&&!this._options.autoCreate)throw y(i);const a=Object.hasOwn(r,t.key)?r:{...r,[t.key]:t.value};n===-1?e.push(a):e[n]=a,this._invalidateArray(e)}_invalidateArray(e){this._indexes?.delete(e)}_invalidateIndexKey(e,t){const r=this._indexes?.get(e);r!==void 0&&(r.delete(t),r.size===0&&this._indexes.delete(e))}_findSelector(e,t,r){if(!this._options.indexEnabled)return g(e,t,r);let s=this._indexes?.get(e)?.get(t);s===void 0&&(s=this._createIndex(e,t));const n=s.get(r);if(n!==void 0&&f(e[n])&&Object.is(e[n][t],r))return n;const a=g(e,t,r);return a===-1?s.delete(r):s.set(r,a),a}_createIndex(e,t){const r=this._indexes??=new WeakMap;let i=r.get(e);if(i===void 0&&(i=new Map,r.set(e,i)),this._options.indexStrategy==="eager-all-keys")for(let n=0;n<e.length;n++){const a=e[n];if(f(a))for(const d of Object.keys(a)){const c=a[d];if(!v(c))continue;let l=i.get(d);l===void 0&&(l=new Map,i.set(d,l)),l.has(c)||l.set(c,n)}}let s=i.get(t);if(s!==void 0)return s;s=new Map;for(let n=0;n<e.length;n++){const a=e[n];if(!f(a))continue;const d=a[t];v(d)&&!s.has(d)&&s.set(d,n)}return i.set(t,s),s}}function g(o,e,t){for(let r=0;r<o.length;r++){const i=o[r];if(f(i)&&Object.hasOwn(i,e)&&Object.is(i[e],t))return r}return-1}function O(o){return o.kind==="index"||o.kind==="selector"?[]:b()}function b(){return Object.create(null)}function _(o){if(u(o))return o;throw new TypeError("[Raph] Root value must be an object or array.")}function x(o,e){if(u(o))return o;throw p(e)}function f(o){return typeof o=="object"&&o!==null&&!Array.isArray(o)}function u(o){return Array.isArray(o)||f(o)}function v(o){return o===null||typeof o=="string"||typeof o=="number"||typeof o=="boolean"}function k(o,e,t){if(e==="__proto__"){Object.defineProperty(o,e,{configurable:!0,enumerable:!0,value:t,writable:!0});return}o[e]=t}function p(o){return new TypeError(`[Raph] Cannot traverse non-container data at "${o}".`)}function y(o){return new Error(`[Raph] Cannot create missing container at "${o}" (autoCreate=false).`)}exports.DefaultDataAdapter=w;