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

package/dist/debug/path/data-path.utils.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./DataPath.cjs"),f=2e4;let n,s;function u(e,t){if(!(t!=null&&t.vars)){const r=n==null?void 0:n.get(e);if(r!==void 0)return r}if(typeof e!="string")return g(e,t);const a=c.DataPath._parseExactString(e,t);if(!(t!=null&&t.vars)){const r=n??(n=new Map);r.size>=f&&r.clear(),r.set(e,a)}return a}function i(e){const t=s==null?void 0:s.get(e);if(t!==void 0)return t;if(typeof e!="string")return h(e);const a=c.DataPath._parseMaskString(e),r=s??(s=new Map);return r.size>=f&&r.clear(),r.set(e,a),a}function l(e){if(e.segments.length===0)return["*"];const t=[`${e.canonical}.*`];for(let a=1;a<e.segments.length;a++)t.push(c.DataPath._renderSegments(e.segments.slice(0,a)));return t}function g(e,t){const a=c.DataPath.from(e,t)._asExact();if(e instanceof c.DataPath&&!(t!=null&&t.vars)){const r=n??(n=new Map);r.size>=f&&r.clear(),r.set(e,a)}return a}function h(e){const t=c.DataPath.from(e)._asMask();if(e instanceof c.DataPath){const a=s??(s=new Map);a.size>=f&&a.clear(),a.set(e,t)}return t}exports.parseDataPath=u;exports.parsePathMask=i;exports.pathRelationMasks=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./DataPath.cjs"),r=2e4;let c,i;function f(e,t){if(!t?.vars){const n=c?.get(e);if(n!==void 0)return n}if(typeof e!="string")return h(e,t);const a=s.DataPath._parseExactString(e,t);if(!t?.vars){const n=c??=new Map;n.size>=r&&n.clear(),n.set(e,a)}return a}function o(e){const t=i?.get(e);if(t!==void 0)return t;if(typeof e!="string")return l(e);const a=s.DataPath._parseMaskString(e),n=i??=new Map;return n.size>=r&&n.clear(),n.set(e,a),a}function u(e){if(e.segments.length===0)return["*"];const t=[`${e.canonical}.*`];for(let a=1;a<e.segments.length;a++)t.push(s.DataPath._renderSegments(e.segments.slice(0,a)));return t}function h(e,t){const a=s.DataPath.from(e,t)._asExact();if(e instanceof s.DataPath&&!t?.vars){const n=c??=new Map;n.size>=r&&n.clear(),n.set(e,a)}return a}function l(e){const t=s.DataPath.from(e)._asMask();if(e instanceof s.DataPath){const a=i??=new Map;a.size>=r&&a.clear(),a.set(e,t)}return t}exports.parseDataPath=f;exports.parsePathMask=o;exports.pathRelationMasks=u;

package/dist/debug/path/data-path.utils.js

@@ -1,56 +1,56 @@
-import { DataPath as n } from "./DataPath.js";
-const f = 2e4;
-let a, s;
-function g(e, r) {
-  if (!(r != null && r.vars)) {
-    const c = a == null ? void 0 : a.get(e);
-    if (c !== void 0)
-      return c;
+import { DataPath as s } from "./DataPath.js";
+const c = 2e4;
+let a, i;
+function l(e, t) {
+  if (!t?.vars) {
+    const r = a?.get(e);
+    if (r !== void 0)
+      return r;
   }
   if (typeof e != "string")
-    return i(e, r);
-  const t = n._parseExactString(e, r);
-  if (!(r != null && r.vars)) {
-    const c = a ?? (a = /* @__PURE__ */ new Map());
-    c.size >= f && c.clear(), c.set(e, t);
+    return f(e, t);
+  const n = s._parseExactString(e, t);
+  if (!t?.vars) {
+    const r = a ??= /* @__PURE__ */ new Map();
+    r.size >= c && r.clear(), r.set(e, n);
   }
-  return t;
+  return n;
 }
-function M(e) {
-  const r = s == null ? void 0 : s.get(e);
-  if (r !== void 0)
-    return r;
+function g(e) {
+  const t = i?.get(e);
+  if (t !== void 0)
+    return t;
   if (typeof e != "string")
-    return u(e);
-  const t = n._parseMaskString(e), c = s ?? (s = /* @__PURE__ */ new Map());
-  return c.size >= f && c.clear(), c.set(e, t), t;
+    return o(e);
+  const n = s._parseMaskString(e), r = i ??= /* @__PURE__ */ new Map();
+  return r.size >= c && r.clear(), r.set(e, n), n;
 }
-function d(e) {
+function h(e) {
   if (e.segments.length === 0)
     return ["*"];
-  const r = [`${e.canonical}.*`];
-  for (let t = 1; t < e.segments.length; t++)
-    r.push(n._renderSegments(e.segments.slice(0, t)));
-  return r;
+  const t = [`${e.canonical}.*`];
+  for (let n = 1; n < e.segments.length; n++)
+    t.push(s._renderSegments(e.segments.slice(0, n)));
+  return t;
 }
-function i(e, r) {
-  const t = n.from(e, r)._asExact();
-  if (e instanceof n && !(r != null && r.vars)) {
-    const c = a ?? (a = /* @__PURE__ */ new Map());
-    c.size >= f && c.clear(), c.set(e, t);
+function f(e, t) {
+  const n = s.from(e, t)._asExact();
+  if (e instanceof s && !t?.vars) {
+    const r = a ??= /* @__PURE__ */ new Map();
+    r.size >= c && r.clear(), r.set(e, n);
   }
-  return t;
+  return n;
 }
-function u(e) {
-  const r = n.from(e)._asMask();
-  if (e instanceof n) {
-    const t = s ?? (s = /* @__PURE__ */ new Map());
-    t.size >= f && t.clear(), t.set(e, r);
+function o(e) {
+  const t = s.from(e)._asMask();
+  if (e instanceof s) {
+    const n = i ??= /* @__PURE__ */ new Map();
+    n.size >= c && n.clear(), n.set(e, t);
   }
-  return r;
+  return t;
 }
 export {
-  g as parseDataPath,
-  M as parsePathMask,
-  d as pathRelationMasks
+  l as parseDataPath,
+  g as parsePathMask,
+  h as pathRelationMasks
 };

package/dist/debug/path/derived/DerivedRegistry.cjs

@@ -1 +1 @@
-"use strict";var h=Object.defineProperty;var _=(r,e,t)=>e in r?h(r,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):r[e]=t;var d=(r,e,t)=>_(r,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("../data-path.utils.cjs"),u=require("../PathRouter.cjs"),f=require("./derived-collection.utils.cjs"),g=2e4;class v{constructor(){d(this,"_router");d(this,"_handles");d(this,"_matches");d(this,"_pending");d(this,"_collections");d(this,"_counter",0)}get size(){var e;return((e=this._handles)==null?void 0:e.size)??0}get pending(){return this._pending}nextId(){return`derived-${this._counter++}`}has(e){var t;return((t=this._handles)==null?void 0:t.has(e))??!1}values(){var e;return((e=this._handles)==null?void 0:e.values())??[][Symbol.iterator]()}state(e){var t;return(t=this._collections)==null?void 0:t.get(e)}register(e,t,i){(this._handles??(this._handles=new Map)).set(e.id,e),i!==void 0&&(this._collections??(this._collections=new Map)).set(e,{from:t,kind:i.kind,key:i.key,initialized:!1,full:!0,keys:new Set,sourceIndex:void 0,targetIndex:void 0});const n=this._router??(this._router=new u.PathRouter);this._matches=void 0,e._attachRoutes(l.pathRelationMasks(t).map(s=>n.add(l.parsePathMask(s),e)))}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))}queue(e){var o;const t=this._matching(e);if(t.length===0)return;const i=this._pending??(this._pending=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.collectionMutationImpact(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=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 a of t)c.keys.add(a);else c!==void 0&&(c.full=!0,c.keys.clear());o.add(s)}}clearPendingIfEmpty(){var e;((e=this._pending)==null?void 0:e.size)===0&&(this._pending=void 0)}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=new Map);return o.size>=g&&o.clear(),o.set(e.canonical,i),i}}exports.DerivedRegistry=v;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const d=require("../data-path.utils.cjs"),l=require("../PathRouter.cjs"),r=require("./derived-collection.utils.cjs"),a=2e4;class h{_router;_handles;_matches;_pending;_collections;_counter=0;get size(){return this._handles?.size??0}get pending(){return this._pending}nextId(){return`derived-${this._counter++}`}has(e){return this._handles?.has(e)??!1}values(){return this._handles?.values()??[][Symbol.iterator]()}state(e){return this._collections?.get(e)}register(e,t,s){(this._handles??=new Map).set(e.id,e),s!==void 0&&(this._collections??=new Map).set(e,{from:t,kind:s.kind,key:s.key,initialized:!1,full:!0,keys:new Set,sourceIndex:void 0,targetIndex:void 0});const i=this._router??=new l.PathRouter;this._matches=void 0,e._attachRoutes(d.pathRelationMasks(t).map(n=>i.add(d.parsePathMask(n),e)))}remove(e){const t=this._handles;t?.get(e.id)===e&&(t.delete(e.id),e._detachRoutes(),this._matches=void 0,this._pending?.delete(e),this._collections?.delete(e),this._collections?.size===0&&(this._collections=void 0),t.size===0&&(this._handles=void 0,this._router=void 0,this._pending=void 0))}queue(e){const t=this._matching(e);if(t.length===0)return;const s=this._pending??=new Set;for(const o of t){if(o.paused||o.disposed)continue;const i=this._collections?.get(o);if(i!==void 0&&i.initialized&&!i.full){const n=r.collectionMutationImpact(i.from,i.key,e);n.kind==="full"?(i.full=!0,i.keys.clear()):i.keys.add(n.key)}s.add(o)}}queueReplacement(e,t){const s=this._matching(e);if(s.length===0)return;const o=this._pending??=new Set;for(const i of s){if(i.paused||i.disposed)continue;const n=this._collections?.get(i);if(n!==void 0&&n.initialized&&!n.full&&n.from.canonical===e.canonical)for(const c of t)n.keys.add(c);else n!==void 0&&(n.full=!0,n.keys.clear());o.add(i)}}clearPendingIfEmpty(){this._pending?.size===0&&(this._pending=void 0)}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){const t=this._router;if(t===void 0)return[];let s=this._matches?.get(e.canonical);if(s!==void 0)return s;s=[...e.segments.length===0?t.matchAll():t.match(e.segments)];const o=this._matches??=new Map;return o.size>=a&&o.clear(),o.set(e.canonical,s),s}}exports.DerivedRegistry=h;

package/dist/debug/path/derived/DerivedRegistry.js

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

package/dist/debug/path/derived/RaphDerivedHandle.cjs

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

package/dist/debug/path/derived/RaphDerivedHandle.js

@@ -1,7 +1,4 @@
-var o = Object.defineProperty;
-var d = (r, e, t) => e in r ? o(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t;
-var s = (r, e, t) => d(r, typeof e != "symbol" ? e + "" : e, t);
-class h extends Error {
+class i extends Error {
   /**
    * Создаёт ошибку с canonical path защищённого derived target.
    */
@@ -9,24 +6,24 @@ class h extends Error {
     super(`[Raph] Derived target is read-only: "${e}".`), this.name = "RaphDerivedTargetWriteError";
   }
 }
-class u {
+class o {
+  // Публикуют identity и immutable параметры materialized dependency.
+  id;
+  options;
+  // Связывают handle с owning Kernel и зарегистрированными source routes.
+  _kernel;
+  _removeRoutes;
+  // Хранят lifecycle и результат последнего вычисления.
+  _paused = !1;
+  _disposed = !1;
+  _status = "idle";
+  _lastError = null;
   /**
    * Создаёт internal handle, которым управляет owning Kernel.
    * @internal
    */
-  constructor(e, t, i) {
-    // Публикуют identity и immutable параметры materialized dependency.
-    s(this, "id");
-    s(this, "options");
-    // Связывают handle с owning Kernel и зарегистрированными source routes.
-    s(this, "_kernel");
-    s(this, "_removeRoutes");
-    // Хранят lifecycle и результат последнего вычисления.
-    s(this, "_paused", !1);
-    s(this, "_disposed", !1);
-    s(this, "_status", "idle");
-    s(this, "_lastError", null);
-    this._kernel = e, this.id = t, this.options = i;
+  constructor(e, s, r) {
+    this._kernel = e, this.id = s, this.options = r;
   }
   /**
    * Показывает, приостановлено ли derived-вычисление.
@@ -104,8 +101,8 @@ class u {
   _detachRoutes() {
     const e = this._removeRoutes;
     if (this._removeRoutes = void 0, e !== void 0)
-      for (const t of e)
-        t();
+      for (const s of e)
+        s();
   }
   /**
    * Помечает handle освобождённым после cleanup owning Kernel.
@@ -120,6 +117,6 @@ class u {
   }
 }
 export {
-  u as RaphDerivedHandle,
-  h as RaphDerivedTargetWriteError
+  o as RaphDerivedHandle,
+  i as RaphDerivedTargetWriteError
 };

package/dist/debug/path/derived/derived-collection.utils.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("../data-path.utils.cjs");function m(e,t,i){if(i.segments.length<=e.segments.length)return{kind:"full"};for(let o=0;o<e.segments.length;o++)if(!$(e.segments[o],i.segments[o]))return{kind:"full"};const r=i.segments[e.segments.length];if((r==null?void 0:r.kind)!=="selector"||r.key!==t||typeof r.value!="string"&&typeof r.value!="number")return{kind:"full"};const n=i.segments[e.segments.length+1];return(n==null?void 0:n.kind)==="key"&&n.key===t?{kind:"full"}:{kind:"key",key:r.value}}function k(e,t,i){const r=p.parseDataPath(e).canonical,n=typeof i=="number"?String(i):JSON.stringify(i);return`${r}[${t}=${n}]`}function g(e,t,i,r){if(!Array.isArray(i)||!Array.isArray(r))throw f(e,"requires array source and output");if(i.length!==r.length)throw f(e,"must preserve collection cardinality");const n=a(i,t,"source"),o=a(r,t,"output");for(let s=0;s<n.length;s++)if(n[s]!==o[s])throw f(e,"must preserve key order")}function h(e,t,i,r){if(!Array.isArray(r))throw f(e,"incremental compute must return an array");if(i.length!==r.length)throw f(e,"incremental compute must preserve cardinality");const n=a(r,t,"output");for(let o=0;o<i.length;o++)if(i[o]!==n[o])throw f(e,"incremental compute must preserve key order")}function w(e,t,i,r){if(!Array.isArray(i)||!Array.isArray(r))throw u(e,"requires array source and output");d(e,"output must be an ordered subset of source",a(i,t,"source"),a(r,t,"output"))}function b(e,t,i,r){if(!Array.isArray(r))throw u(e,"incremental compute must return an array");d(e,"incremental output must be an ordered subset of input",i,a(r,t,"output"))}function a(e,t,i){const r=new Set,n=[];for(let o=0;o<e.length;o++){if(!(o in e)){n.push(void 0);continue}const s=e[o];if(!y(s))throw new TypeError(`[Raph] ${i} collection items must be objects.`);const c=s[t];if(typeof c!="string"&&typeof c!="number")throw new TypeError(`[Raph] ${i} item key "${t}" must be a string or number.`);if(r.has(c))throw new TypeError(`[Raph] Duplicate ${i} key: "${String(c)}".`);r.add(c),n.push(c)}return n}function A(e,t,i){const r=a(e,t,i),n=new Map;for(let o=0;o<r.length;o++){const s=r[o];s!==void 0&&n.set(s,o)}return n}function x(e,t,i,r){for(const n of r){const o=i.get(n);if(o===void 0)return!0;const s=e[o];if(!y(s)||s[t]!==n)return!0}return!1}function f(e,t){return new TypeError(`[Raph] collectionByKey derived "${e}" ${t}.`)}function u(e,t){return new TypeError(`[Raph] filterByKey derived "${e}" ${t}.`)}function E(e){return l(e,new WeakMap)}function d(e,t,i,r){const n=new Map;for(let s=0;s<i.length;s++){const c=i[s];c!==void 0&&n.set(c,s)}let o=-1;for(const s of r){if(s===void 0)continue;const c=n.get(s);if(c===void 0||c<=o)throw u(e,t);o=c}}function l(e,t){if(e===null||typeof e!="object")return e;const i=t.get(e);if(i!==void 0)return i;if(e instanceof Date)return new Date(e.getTime());if(e instanceof RegExp)return new RegExp(e.source,e.flags);if(e instanceof Map){const n=new Map;t.set(e,n);for(const[o,s]of e)n.set(l(o,t),l(s,t));return n}if(e instanceof Set){const n=new Set;t.set(e,n);for(const o of e)n.add(l(o,t));return n}if(e instanceof ArrayBuffer||ArrayBuffer.isView(e))return structuredClone(e);if(Array.isArray(e)){const n=[];t.set(e,n);for(let o=0;o<e.length;o++)o in e&&(n[o]=l(e[o],t));return n}const r=Object.create(Object.getPrototypeOf(e));t.set(e,r);for(const n of Reflect.ownKeys(e))r[n]=l(e[n],t);return r}function $(e,t){return e.kind!==t.kind?!1:e.kind==="key"&&t.kind==="key"?e.key===t.key:e.kind==="index"&&t.kind==="index"?e.index===t.index:e.kind==="selector"&&t.kind==="selector"&&e.key===t.key&&Object.is(e.value,t.value)}function y(e){return typeof e=="object"&&e!==null&&!Array.isArray(e)}exports.cloneMaterializedValue=E;exports.collectionError=f;exports.collectionIndex=A;exports.collectionKeys=a;exports.collectionMutationImpact=m;exports.filterError=u;exports.indexesAreStale=x;exports.keyedPath=k;exports.validateFullCollection=g;exports.validateFullFilter=w;exports.validateIncrementalCollection=h;exports.validateIncrementalFilter=b;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("../data-path.utils.cjs");function m(e,t,o){if(o.segments.length<=e.segments.length)return{kind:"full"};for(let r=0;r<e.segments.length;r++)if(!$(e.segments[r],o.segments[r]))return{kind:"full"};const i=o.segments[e.segments.length];if(i?.kind!=="selector"||i.key!==t||typeof i.value!="string"&&typeof i.value!="number")return{kind:"full"};const n=o.segments[e.segments.length+1];return n?.kind==="key"&&n.key===t?{kind:"full"}:{kind:"key",key:i.value}}function k(e,t,o){const i=p.parseDataPath(e).canonical,n=typeof o=="number"?String(o):JSON.stringify(o);return`${i}[${t}=${n}]`}function g(e,t,o,i){if(!Array.isArray(o)||!Array.isArray(i))throw f(e,"requires array source and output");if(o.length!==i.length)throw f(e,"must preserve collection cardinality");const n=a(o,t,"source"),r=a(i,t,"output");for(let s=0;s<n.length;s++)if(n[s]!==r[s])throw f(e,"must preserve key order")}function h(e,t,o,i){if(!Array.isArray(i))throw f(e,"incremental compute must return an array");if(o.length!==i.length)throw f(e,"incremental compute must preserve cardinality");const n=a(i,t,"output");for(let r=0;r<o.length;r++)if(o[r]!==n[r])throw f(e,"incremental compute must preserve key order")}function w(e,t,o,i){if(!Array.isArray(o)||!Array.isArray(i))throw u(e,"requires array source and output");d(e,"output must be an ordered subset of source",a(o,t,"source"),a(i,t,"output"))}function b(e,t,o,i){if(!Array.isArray(i))throw u(e,"incremental compute must return an array");d(e,"incremental output must be an ordered subset of input",o,a(i,t,"output"))}function a(e,t,o){const i=new Set,n=[];for(let r=0;r<e.length;r++){if(!(r in e)){n.push(void 0);continue}const s=e[r];if(!y(s))throw new TypeError(`[Raph] ${o} collection items must be objects.`);const c=s[t];if(typeof c!="string"&&typeof c!="number")throw new TypeError(`[Raph] ${o} item key "${t}" must be a string or number.`);if(i.has(c))throw new TypeError(`[Raph] Duplicate ${o} key: "${String(c)}".`);i.add(c),n.push(c)}return n}function A(e,t,o){const i=a(e,t,o),n=new Map;for(let r=0;r<i.length;r++){const s=i[r];s!==void 0&&n.set(s,r)}return n}function x(e,t,o,i){for(const n of i){const r=o.get(n);if(r===void 0)return!0;const s=e[r];if(!y(s)||s[t]!==n)return!0}return!1}function f(e,t){return new TypeError(`[Raph] collectionByKey derived "${e}" ${t}.`)}function u(e,t){return new TypeError(`[Raph] filterByKey derived "${e}" ${t}.`)}function E(e){return l(e,new WeakMap)}function d(e,t,o,i){const n=new Map;for(let s=0;s<o.length;s++){const c=o[s];c!==void 0&&n.set(c,s)}let r=-1;for(const s of i){if(s===void 0)continue;const c=n.get(s);if(c===void 0||c<=r)throw u(e,t);r=c}}function l(e,t){if(e===null||typeof e!="object")return e;const o=t.get(e);if(o!==void 0)return o;if(e instanceof Date)return new Date(e.getTime());if(e instanceof RegExp)return new RegExp(e.source,e.flags);if(e instanceof Map){const n=new Map;t.set(e,n);for(const[r,s]of e)n.set(l(r,t),l(s,t));return n}if(e instanceof Set){const n=new Set;t.set(e,n);for(const r of e)n.add(l(r,t));return n}if(e instanceof ArrayBuffer||ArrayBuffer.isView(e))return structuredClone(e);if(Array.isArray(e)){const n=[];t.set(e,n);for(let r=0;r<e.length;r++)r in e&&(n[r]=l(e[r],t));return n}const i=Object.create(Object.getPrototypeOf(e));t.set(e,i);for(const n of Reflect.ownKeys(e))i[n]=l(e[n],t);return i}function $(e,t){return e.kind!==t.kind?!1:e.kind==="key"&&t.kind==="key"?e.key===t.key:e.kind==="index"&&t.kind==="index"?e.index===t.index:e.kind==="selector"&&t.kind==="selector"&&e.key===t.key&&Object.is(e.value,t.value)}function y(e){return typeof e=="object"&&e!==null&&!Array.isArray(e)}exports.cloneMaterializedValue=E;exports.collectionError=f;exports.collectionIndex=A;exports.collectionKeys=a;exports.collectionMutationImpact=m;exports.filterError=u;exports.indexesAreStale=x;exports.keyedPath=k;exports.validateFullCollection=g;exports.validateFullFilter=w;exports.validateIncrementalCollection=h;exports.validateIncrementalFilter=b;