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

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

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

@@ -0,0 +1,56 @@
+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 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 n;
+}
+function g(e) {
+  const t = i?.get(e);
+  if (t !== void 0)
+    return t;
+  if (typeof e != "string")
+    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 h(e) {
+  if (e.segments.length === 0)
+    return ["*"];
+  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 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 n;
+}
+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 t;
+}
+export {
+  l as parseDataPath,
+  g as parsePathMask,
+  h as pathRelationMasks
+};

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

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

@@ -0,0 +1,143 @@
+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() {
+    return this._handles?.size ?? 0;
+  }
+  /**
+   * Возвращает очередь derived-вычислений, ожидающих стабилизации.
+   */
+  get pending() {
+    return this._pending;
+  }
+  /**
+   * Выделяет следующий стабильный идентификатор registry.
+   */
+  nextId() {
+    return `derived-${this._counter++}`;
+  }
+  /**
+   * Проверяет наличие derived handle с указанным id.
+   */
+  has(e) {
+    return this._handles?.has(e) ?? !1;
+  }
+  /**
+   * Возвращает зарегистрированные derived handles.
+   */
+  values() {
+    return this._handles?.values() ?? [][Symbol.iterator]();
+  }
+  /**
+   * Возвращает внутреннее состояние зарегистрированного handle.
+   */
+  state(e) {
+    return this._collections?.get(e);
+  }
+  /**
+   * Регистрирует derived handle и его зависимости.
+   */
+  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: s.kind,
+      key: s.key,
+      initialized: !1,
+      full: !0,
+      keys: /* @__PURE__ */ new Set(),
+      sourceIndex: void 0,
+      targetIndex: void 0
+    });
+    const i = this._router ??= new r();
+    this._matches = void 0, e._attachRoutes(d(t).map(
+      (n) => i.add(l(n), e)
+    ));
+  }
+  /**
+   * Удаляет регистрацию и связанные pending-записи.
+   */
+  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));
+  }
+  /**
+   * Добавляет derived handle в очередь пересчёта.
+   */
+  queue(e) {
+    const t = this._matching(e);
+    if (t.length === 0)
+      return;
+    const s = this._pending ??= /* @__PURE__ */ 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 = a(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 ??= /* @__PURE__ */ 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);
+    }
+  }
+  /**
+   * Сбрасывает pending-состояние после опустошения очереди.
+   */
+  clearPendingIfEmpty() {
+    this._pending?.size === 0 && (this._pending = void 0);
+  }
+  /**
+   * Освобождает все handles и очищает derived registry.
+   */
+  dispose() {
+    if (this._handles !== void 0)
+      for (const e of this._handles.values())
+        e._disposeFromKernel();
+    this._handles = void 0, this._router = void 0, this._matches = void 0, this._pending = void 0, this._collections = void 0;
+  }
+  _matching(e) {
+    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 ??= /* @__PURE__ */ new Map();
+    return o.size >= h && o.clear(), o.set(e.canonical, s), s;
+  }
+}
+export {
+  g as DerivedRegistry
+};

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

@@ -0,0 +1 @@
+"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/{RaphDerivedHandle.js → 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

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

package/dist/debug/path/{derived-collection.js → derived/derived-collection.utils.js}

@@ -1,93 +1,93 @@
-import { parseDataPath as p } from "./data-path.js";
-function g(e, t, i) {
-  if (i.segments.length <= e.segments.length)
+import { parseDataPath as p } from "../data-path.utils.js";
+function g(e, t, o) {
+  if (o.segments.length <= e.segments.length)
     return { kind: "full" };
-  for (let o = 0; o < e.segments.length; o++)
-    if (!m(e.segments[o], i.segments[o]))
+  for (let r = 0; r < e.segments.length; r++)
+    if (!m(e.segments[r], o.segments[r]))
       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")
+  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 = i.segments[e.segments.length + 1];
-  return (n == null ? void 0 : n.kind) === "key" && n.key === t ? { kind: "full" } : { kind: "key", key: r.value };
+  const n = o.segments[e.segments.length + 1];
+  return n?.kind === "key" && n.key === t ? { kind: "full" } : { kind: "key", key: i.value };
 }
-function h(e, t, i) {
-  const r = p(e).canonical, n = typeof i == "number" ? String(i) : JSON.stringify(i);
-  return `${r}[${t}=${n}]`;
+function h(e, t, o) {
+  const i = p(e).canonical, n = typeof o == "number" ? String(o) : JSON.stringify(o);
+  return `${i}[${t}=${n}]`;
 }
-function w(e, t, i, r) {
-  if (!Array.isArray(i) || !Array.isArray(r))
+function w(e, t, o, i) {
+  if (!Array.isArray(o) || !Array.isArray(i))
     throw a(e, "requires array source and output");
-  if (i.length !== r.length)
+  if (o.length !== i.length)
     throw a(e, "must preserve collection cardinality");
-  const n = f(i, t, "source"), o = f(r, t, "output");
+  const n = f(o, t, "source"), r = f(i, t, "output");
   for (let s = 0; s < n.length; s++)
-    if (n[s] !== o[s])
+    if (n[s] !== r[s])
       throw a(e, "must preserve key order");
 }
-function A(e, t, i, r) {
-  if (!Array.isArray(r))
+function A(e, t, o, i) {
+  if (!Array.isArray(i))
     throw a(e, "incremental compute must return an array");
-  if (i.length !== r.length)
+  if (o.length !== i.length)
     throw a(e, "incremental compute must preserve cardinality");
-  const n = f(r, t, "output");
-  for (let o = 0; o < i.length; o++)
-    if (i[o] !== n[o])
+  const n = f(i, t, "output");
+  for (let r = 0; r < o.length; r++)
+    if (o[r] !== n[r])
       throw a(e, "incremental compute must preserve key order");
 }
-function b(e, t, i, r) {
-  if (!Array.isArray(i) || !Array.isArray(r))
+function b(e, t, o, i) {
+  if (!Array.isArray(o) || !Array.isArray(i))
     throw y(e, "requires array source and output");
   d(
     e,
     "output must be an ordered subset of source",
-    f(i, t, "source"),
-    f(r, t, "output")
+    f(o, t, "source"),
+    f(i, t, "output")
   );
 }
-function x(e, t, i, r) {
-  if (!Array.isArray(r))
+function x(e, t, o, i) {
+  if (!Array.isArray(i))
     throw y(e, "incremental compute must return an array");
   d(
     e,
     "incremental output must be an ordered subset of input",
-    i,
-    f(r, t, "output")
+    o,
+    f(i, t, "output")
   );
 }
-function f(e, t, i) {
-  const r = /* @__PURE__ */ new Set(), n = [];
-  for (let o = 0; o < e.length; o++) {
-    if (!(o in e)) {
+function f(e, t, o) {
+  const i = /* @__PURE__ */ new Set(), n = [];
+  for (let r = 0; r < e.length; r++) {
+    if (!(r in e)) {
       n.push(void 0);
       continue;
     }
-    const s = e[o];
+    const s = e[r];
     if (!l(s))
-      throw new TypeError(`[Raph] ${i} collection items must be objects.`);
+      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] ${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);
+      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 $(e, t, i) {
-  const r = f(e, t, i), n = /* @__PURE__ */ new Map();
-  for (let o = 0; o < r.length; o++) {
-    const s = r[o];
-    s !== void 0 && n.set(s, o);
+function $(e, t, o) {
+  const i = f(e, t, o), n = /* @__PURE__ */ new Map();
+  for (let r = 0; r < i.length; r++) {
+    const s = i[r];
+    s !== void 0 && n.set(s, r);
   }
   return n;
 }
-function E(e, t, i, r) {
-  for (const n of r) {
-    const o = i.get(n);
-    if (o === void 0)
+function E(e, t, o, i) {
+  for (const n of i) {
+    const r = o.get(n);
+    if (r === void 0)
       return !0;
-    const s = e[o];
+    const s = e[r];
     if (!l(s) || s[t] !== n)
       return !0;
   }
@@ -102,28 +102,28 @@ function y(e, t) {
 function R(e) {
   return u(e, /* @__PURE__ */ new WeakMap());
 }
-function d(e, t, i, r) {
+function d(e, t, o, i) {
   const n = /* @__PURE__ */ new Map();
-  for (let s = 0; s < i.length; s++) {
-    const c = i[s];
+  for (let s = 0; s < o.length; s++) {
+    const c = o[s];
     c !== void 0 && n.set(c, s);
   }
-  let o = -1;
-  for (const s of r) {
+  let r = -1;
+  for (const s of i) {
     if (s === void 0)
       continue;
     const c = n.get(s);
-    if (c === void 0 || c <= o)
+    if (c === void 0 || c <= r)
       throw y(e, t);
-    o = c;
+    r = c;
   }
 }
 function u(e, t) {
   if (e === null || typeof e != "object")
     return e;
-  const i = t.get(e);
-  if (i !== void 0)
-    return i;
+  const o = t.get(e);
+  if (o !== void 0)
+    return o;
   if (e instanceof Date)
     return new Date(e.getTime());
   if (e instanceof RegExp)
@@ -131,15 +131,15 @@ function u(e, t) {
   if (e instanceof Map) {
     const n = /* @__PURE__ */ new Map();
     t.set(e, n);
-    for (const [o, s] of e)
-      n.set(u(o, t), u(s, t));
+    for (const [r, s] of e)
+      n.set(u(r, t), u(s, t));
     return n;
   }
   if (e instanceof Set) {
     const n = /* @__PURE__ */ new Set();
     t.set(e, n);
-    for (const o of e)
-      n.add(u(o, t));
+    for (const r of e)
+      n.add(u(r, t));
     return n;
   }
   if (e instanceof ArrayBuffer || ArrayBuffer.isView(e))
@@ -147,15 +147,15 @@ function u(e, t) {
   if (Array.isArray(e)) {
     const n = [];
     t.set(e, n);
-    for (let o = 0; o < e.length; o++)
-      o in e && (n[o] = u(e[o], t));
+    for (let r = 0; r < e.length; r++)
+      r in e && (n[r] = u(e[r], t));
     return n;
   }
-  const r = Object.create(Object.getPrototypeOf(e));
-  t.set(e, r);
+  const i = Object.create(Object.getPrototypeOf(e));
+  t.set(e, i);
   for (const n of Reflect.ownKeys(e))
-    r[n] = u(e[n], t);
-  return r;
+    i[n] = u(e[n], t);
+  return i;
 }
 function m(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);

package/dist/debug/path/derived/derived-strategy.types.cjs

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

package/dist/debug/path/derived/derived-strategy.types.js

@@ -0,0 +1 @@
+

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

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