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

package/dist/debug/path/{data-adapter.js → storage/DefaultDataAdapter.js}

@@ -1,18 +1,15 @@
-var j = Object.defineProperty;
-var C = (o, e, t) => e in o ? j(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
-var y = (o, e, t) => C(o, typeof e != "symbol" ? e + "" : e, t);
-import { createDataDraft as S } from "./data-draft.js";
-import { parseDataPath as h } from "./data-path.js";
-class A {
+import { parseDataPath as h } from "../data-path.utils.js";
+import { createDataDraft as A } from "./createDataDraft.js";
+class v {
+  // Хранят root, нормализованные опции и ленивые selector indexes.
+  _root;
+  _options;
+  _indexes;
   /**
    * Создаёт in-memory adapter с заданным начальным root и опциями.
    */
-  constructor(e = w(), t = {}) {
-    // Хранят root, нормализованные опции и ленивые selector indexes.
-    y(this, "_root");
-    y(this, "_options");
-    y(this, "_indexes");
-    this._root = _(e), this._options = {
+  constructor(e = b(), t = {}) {
+    this._root = x(e), this._options = {
       arrayDelete: t.arrayDelete ?? "unset",
       autoCreate: t.autoCreate ?? !0,
       indexEnabled: t.indexEnabled ?? !0,
@@ -29,17 +26,14 @@ class A {
    * Создаёт изолированную copy-on-write проекцию для синхронной проверки mutation.
    */
   fork() {
-    const e = new A({}, this._options);
-    return e._root = S(this._root, (t) => {
-      var r;
-      return (r = e._indexes) == null ? void 0 : r.delete(t);
-    }).root, e;
+    const e = new v({}, this._options);
+    return e._root = A(this._root, (t) => e._indexes?.delete(t)).root, e;
   }
   /**
    * Заменяет корневой объект без path-level публикации.
    */
   replaceRoot(e) {
-    this._root = _(e), this._indexes = void 0;
+    this._root = x(e), this._indexes = void 0;
   }
   /**
    * Обновляет изменяемые опции adapter и сбрасывает построенные indexes.
@@ -65,7 +59,7 @@ class A {
   set(e, t, r) {
     const i = h(e, r);
     if (i.segments.length === 0) {
-      this.replaceRoot(_(t));
+      this.replaceRoot(x(t));
       return;
     }
     let s = this._root, n;
@@ -88,7 +82,7 @@ class A {
     const i = this.get(e, r);
     if (f(i) && f(t)) {
       for (const s of Object.keys(t))
-        b(i, s, t[s]);
+        k(i, s, t[s]);
       this._indexes = void 0;
       return;
     }
@@ -100,7 +94,7 @@ class A {
   delete(e, t) {
     const r = h(e, t);
     if (r.segments.length === 0) {
-      this._root = w(), this._indexes = void 0;
+      this._root = b(), this._indexes = void 0;
       return;
     }
     let i = this._root;
@@ -197,44 +191,44 @@ class A {
       let n = e[t.key];
       if (!Object.hasOwn(e, t.key) || n === void 0) {
         if (!this._options.autoCreate)
-          throw x(i);
-        n = g(r), b(e, t.key, n);
+          throw y(i);
+        n = p(r), k(e, t.key, n);
       }
-      return { value: k(n, i) };
+      return { value: _(n, i) };
     }
     if (!Array.isArray(e))
-      throw O(i);
+      throw w(i);
     if (t.kind === "index") {
       let n = e[t.index];
       if (!Object.hasOwn(e, t.index) || n === void 0) {
         if (!this._options.autoCreate)
-          throw x(i);
-        n = g(r), e[t.index] = n;
+          throw y(i);
+        n = p(r), e[t.index] = n;
       }
       return {
-        value: k(n, i),
+        value: _(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 x(i);
+        throw y(i);
       const n = /* @__PURE__ */ Object.create(null);
       n[t.key] = t.value, e.push(n), s = e.length - 1, this._invalidateArray(e);
     }
     return {
-      value: k(e[s], i),
+      value: _(e[s], i),
       indexedParent: { array: e, index: s }
     };
   }
   _writeSegment(e, t, r, i, s) {
     if (t.kind === "key") {
-      b(e, t.key, r), s !== void 0 && s.array[s.index] === e && this._invalidateIndexKey(s.array, t.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 O(i);
+      throw w(i);
     if (t.kind === "index") {
       e[t.index] = r, this._invalidateArray(e);
       return;
@@ -245,34 +239,30 @@ class A {
       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 x(i);
+      throw y(i);
     const d = Object.hasOwn(r, t.key) ? r : { ...r, [t.key]: t.value };
     n === -1 ? e.push(d) : e[n] = d, this._invalidateArray(e);
   }
   _invalidateArray(e) {
-    var t;
-    (t = this._indexes) == null || t.delete(e);
+    this._indexes?.delete(e);
   }
   _invalidateIndexKey(e, t) {
-    var i;
-    const r = (i = this._indexes) == null ? void 0 : i.get(e);
+    const r = this._indexes?.get(e);
     r !== void 0 && (r.delete(t), r.size === 0 && this._indexes.delete(e));
   }
   _findSelector(e, t, r) {
-    var a;
     if (!this._options.indexEnabled)
-      return p(e, t, r);
-    const i = (a = this._indexes) == null ? void 0 : a.get(e);
-    let s = i == null ? void 0 : i.get(t);
+      return O(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 d = p(e, t, r);
+    const d = O(e, t, r);
     return d === -1 ? s.delete(r) : s.set(r, d), d;
   }
   _createIndex(e, t) {
-    const r = this._indexes ?? (this._indexes = /* @__PURE__ */ new WeakMap());
+    const r = this._indexes ??= /* @__PURE__ */ new WeakMap();
     let i = r.get(e);
     if (i === void 0 && (i = /* @__PURE__ */ new Map(), r.set(e, i)), this._options.indexStrategy === "eager-all-keys")
       for (let n = 0; n < e.length; n++) {
@@ -280,7 +270,7 @@ class A {
         if (f(d))
           for (const a of Object.keys(d)) {
             const c = d[a];
-            if (!v(c))
+            if (!g(c))
               continue;
             let l = i.get(a);
             l === void 0 && (l = /* @__PURE__ */ new Map(), i.set(a, l)), l.has(c) || l.set(c, n);
@@ -295,12 +285,12 @@ class A {
       if (!f(d))
         continue;
       const a = d[t];
-      v(a) && !s.has(a) && s.set(a, n);
+      g(a) && !s.has(a) && s.set(a, n);
     }
     return i.set(t, s), s;
   }
 }
-function p(o, e, t) {
+function O(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))
@@ -308,21 +298,21 @@ function p(o, e, t) {
   }
   return -1;
 }
-function g(o) {
-  return o.kind === "index" || o.kind === "selector" ? [] : w();
+function p(o) {
+  return o.kind === "index" || o.kind === "selector" ? [] : b();
 }
-function w() {
+function b() {
   return /* @__PURE__ */ Object.create(null);
 }
-function _(o) {
+function x(o) {
   if (u(o))
     return o;
   throw new TypeError("[Raph] Root value must be an object or array.");
 }
-function k(o, e) {
+function _(o, e) {
   if (u(o))
     return o;
-  throw O(e);
+  throw w(e);
 }
 function f(o) {
   return typeof o == "object" && o !== null && !Array.isArray(o);
@@ -330,10 +320,10 @@ function f(o) {
 function u(o) {
   return Array.isArray(o) || f(o);
 }
-function v(o) {
+function g(o) {
   return o === null || typeof o == "string" || typeof o == "number" || typeof o == "boolean";
 }
-function b(o, e, t) {
+function k(o, e, t) {
   if (e === "__proto__") {
     Object.defineProperty(o, e, {
       configurable: !0,
@@ -345,12 +335,12 @@ function b(o, e, t) {
   }
   o[e] = t;
 }
-function O(o) {
+function w(o) {
   return new TypeError(`[Raph] Cannot traverse non-container data at "${o}".`);
 }
-function x(o) {
+function y(o) {
   return new Error(`[Raph] Cannot create missing container at "${o}" (autoCreate=false).`);
 }
 export {
-  A as DefaultDataAdapter
+  v as DefaultDataAdapter
 };

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("../data-path.utils.cjs"),p=require("../PathRouter.cjs");class _{constructor(t){this._batchErrorMessage=t}_router;_events;_batchDepth=0;_watcherCount=0;_publishing=!1;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??=[]).push(t),this._batchDepth===0&&!this._publishing&&this._publish())}batch(t){let e=!1,s,r;this._batchDepth++;try{r=t()}catch(h){e=!0,s=h}return this._closeBatch(e,s),r}_openBatch(){this._batchDepth++}_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([e,r],this._batchErrorMessage);if(t)throw e;if(s)throw r}watch(t,e){const s=Array.isArray(t)?t:[t];if(s.length===0)throw new TypeError("[Raph] Path watch requires at least one mask.");const r=new Map;for(const o of s){const a=l.parsePathMask(o);r.set(a.canonical,a)}const h={active:!0,callback:e},i=this._router??=new p.PathRouter,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)})}_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 s=t.splice(0),r=this._router;if(r===void 0)continue;const h=new Map;for(const i of s){const n=l.parseDataPath(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[i,n]of h)if(!(!i.active||i.callback===void 0))try{i.callback({events:n})}catch(o){e.push(o)}}}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 f(c){let t=c;return()=>{const e=t;t=void 0,e?.()}}exports.PathEventHub=_;

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

@@ -0,0 +1,161 @@
+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) {
+    this._batchErrorMessage = t;
+  }
+  // Хранят ленивый routing и текущий batch path events.
+  _router;
+  _events;
+  // Защищают границы batch, reentrant publication и snapshot requirements.
+  _batchDepth = 0;
+  _watcherCount = 0;
+  _publishing = !1;
+  /**
+   * Показывает, есть ли watchers, ради которых нужно сохранять значения событий.
+   */
+  get hasWatchers() {
+    return this._watcherCount !== 0;
+  }
+  /**
+   * Возвращает накопленные события текущей batch.
+   * @internal
+   */
+  get events() {
+    return this._events;
+  }
+  /**
+   * Возвращает внутренний path router для диагностики store.
+   * @internal
+   */
+  get router() {
+    return this._router;
+  }
+  /**
+   * Возвращает число активных watchers.
+   * @internal
+   */
+  get watcherCount() {
+    return this._watcherCount;
+  }
+  /**
+   * Добавляет событие в текущую batch либо публикует его сразу.
+   */
+  record(t) {
+    this._watcherCount !== 0 && ((this._events ??= []).push(t), this._batchDepth === 0 && !this._publishing && this._publish());
+  }
+  /**
+   * Выполняет операцию в общей синхронной batch boundary.
+   */
+  batch(t) {
+    let e = !1, s, r;
+    this._batchDepth++;
+    try {
+      r = t();
+    } catch (h) {
+      e = !0, s = h;
+    }
+    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(
+        [e, r],
+        this._batchErrorMessage
+      );
+    if (t)
+      throw e;
+    if (s)
+      throw r;
+  }
+  /**
+   * Подписывает callback на подходящие изменения и возвращает disposer.
+   */
+  watch(t, e) {
+    const s = Array.isArray(t) ? t : [t];
+    if (s.length === 0)
+      throw new TypeError("[Raph] Path watch requires at least one mask.");
+    const r = /* @__PURE__ */ new Map();
+    for (const o of s) {
+      const a = l(o);
+      r.set(a.canonical, a);
+    }
+    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);
+    });
+  }
+  _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 s = t.splice(0), r = this._router;
+        if (r === void 0)
+          continue;
+        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 [i, n] of h)
+          if (!(!i.active || i.callback === void 0))
+            try {
+              i.callback({ events: n });
+            } catch (o) {
+              e.push(o);
+            }
+      }
+    } 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 f(c) {
+  let t = c;
+  return () => {
+    const e = t;
+    t = void 0, e?.();
+  };
+}
+export {
+  v as PathEventHub
+};

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

@@ -0,0 +1 @@
+"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;