@raphy-js/raph 1.0.0-dev.18

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

@@ -0,0 +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;
+  }
+  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 t;
+}
+function M(e) {
+  const r = s == null ? void 0 : s.get(e);
+  if (r !== void 0)
+    return r;
+  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;
+}
+function d(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;
+}
+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);
+  }
+  return t;
+}
+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);
+  }
+  return r;
+}
+export {
+  g as parseDataPath,
+  M as parsePathMask,
+  d as pathRelationMasks
+};

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

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

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

@@ -0,0 +1,157 @@
+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);
+  }
+  /**
+   * Возвращает число зарегистрированных записей.
+   */
+  get size() {
+    var e;
+    return ((e = this._handles) == null ? void 0 : e.size) ?? 0;
+  }
+  /**
+   * Возвращает очередь derived-вычислений, ожидающих стабилизации.
+   */
+  get pending() {
+    return this._pending;
+  }
+  /**
+   * Выделяет следующий стабильный идентификатор registry.
+   */
+  nextId() {
+    return `derived-${this._counter++}`;
+  }
+  /**
+   * Проверяет наличие derived handle с указанным id.
+   */
+  has(e) {
+    var t;
+    return ((t = this._handles) == null ? void 0 : t.has(e)) ?? !1;
+  }
+  /**
+   * Возвращает зарегистрированные derived handles.
+   */
+  values() {
+    var e;
+    return ((e = this._handles) == null ? void 0 : e.values()) ?? [][Symbol.iterator]();
+  }
+  /**
+   * Возвращает внутреннее состояние зарегистрированного handle.
+   */
+  state(e) {
+    var t;
+    return (t = this._collections) == null ? void 0 : t.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, {
+      from: t,
+      kind: i.kind,
+      key: i.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)
+    ));
+  }
+  /**
+   * Удаляет регистрацию и связанные 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));
+  }
+  /**
+   * Добавляет 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)
+        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);
+      }
+      i.add(n);
+    }
+  }
+  /**
+   * Запоминает полную замену, которую нужно применить при стабилизации.
+   */
+  queueReplacement(e, t) {
+    var n;
+    const i = this._matching(e);
+    if (i.length === 0)
+      return;
+    const o = this._pending ?? (this._pending = /* @__PURE__ */ 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 r of t)
+          c.keys.add(r);
+      else c !== void 0 && (c.full = !0, c.keys.clear());
+      o.add(s);
+    }
+  }
+  /**
+   * Сбрасывает pending-состояние после опустошения очереди.
+   */
+  clearPendingIfEmpty() {
+    var e;
+    ((e = this._pending) == null ? void 0 : e.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) {
+    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;
+  }
+}
+export {
+  z as DerivedRegistry
+};

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

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

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

@@ -0,0 +1,125 @@
+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 {
+  /**
+   * Создаёт ошибку с canonical path защищённого derived target.
+   */
+  constructor(e) {
+    super(`[Raph] Derived target is read-only: "${e}".`), this.name = "RaphDerivedTargetWriteError";
+  }
+}
+class u {
+  /**
+   * Создаёт 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;
+  }
+  /**
+   * Показывает, приостановлено ли derived-вычисление.
+   */
+  get paused() {
+    return this._paused;
+  }
+  /**
+   * Показывает, освобождён ли derived handle.
+   */
+  get disposed() {
+    return this._disposed;
+  }
+  /**
+   * Возвращает состояние последнего derived-пересчёта.
+   */
+  get status() {
+    return this._status;
+  }
+  /**
+   * Возвращает последнюю ошибку derived-пересчёта либо null.
+   */
+  get lastError() {
+    return this._lastError;
+  }
+  /**
+   * Фиксирует успешное завершение derived-пересчёта.
+   * @internal
+   */
+  _recordSuccess() {
+    this._status = "success", this._lastError = null;
+  }
+  /**
+   * Фиксирует ошибку derived-пересчёта без потери handle.
+   * @internal
+   */
+  _recordFailure(e) {
+    this._status = "error", this._lastError = e instanceof Error ? e : new Error(String(e));
+  }
+  /**
+   * Приостанавливает автоматические пересчёты без освобождения handle.
+   */
+  pause() {
+    this._assertAlive(), this._paused = !0;
+  }
+  /**
+   * Возобновляет пересчёты и синхронизирует устаревший target.
+   */
+  resume() {
+    this._assertAlive(), this._paused = !1, this.recompute();
+  }
+  /**
+   * Принудительно пересчитывает derived target.
+   */
+  recompute() {
+    this._assertAlive(), this._kernel._recomputeDerived(this);
+  }
+  /**
+   * Удаляет derived registration и применяет выбранную политику target cleanup.
+   */
+  dispose() {
+    this._disposed || (this._disposed = !0, this._kernel._removeDerived(this), this.options.disposeTarget === "delete" && this._kernel.delete(this.options.to));
+  }
+  /**
+   * Сохраняет disposers source routes текущей стратегии.
+   * @internal
+   */
+  _attachRoutes(e) {
+    this._removeRoutes = e;
+  }
+  /**
+   * Отсоединяет все source routes текущей стратегии.
+   * @internal
+   */
+  _detachRoutes() {
+    const e = this._removeRoutes;
+    if (this._removeRoutes = void 0, e !== void 0)
+      for (const t of e)
+        t();
+  }
+  /**
+   * Помечает handle освобождённым после cleanup owning Kernel.
+   * @internal
+   */
+  _disposeFromKernel() {
+    this._disposed = !0, this._removeRoutes = void 0;
+  }
+  _assertAlive() {
+    if (this._disposed)
+      throw new Error(`[Raph] Derived "${this.id}" is disposed.`);
+  }
+}
+export {
+  u as RaphDerivedHandle,
+  h as RaphDerivedTargetWriteError
+};

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

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

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

@@ -0,0 +1 @@
+

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,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;

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

@@ -0,0 +1,179 @@
+import { parseDataPath as p } from "../data-path.utils.js";
+function g(e, t, i) {
+  if (i.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]))
+      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 h(e, t, i) {
+  const r = p(e).canonical, n = typeof i == "number" ? String(i) : JSON.stringify(i);
+  return `${r}[${t}=${n}]`;
+}
+function w(e, t, i, r) {
+  if (!Array.isArray(i) || !Array.isArray(r))
+    throw a(e, "requires array source and output");
+  if (i.length !== r.length)
+    throw a(e, "must preserve collection cardinality");
+  const n = f(i, t, "source"), o = f(r, t, "output");
+  for (let s = 0; s < n.length; s++)
+    if (n[s] !== o[s])
+      throw a(e, "must preserve key order");
+}
+function A(e, t, i, r) {
+  if (!Array.isArray(r))
+    throw a(e, "incremental compute must return an array");
+  if (i.length !== r.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])
+      throw a(e, "incremental compute must preserve key order");
+}
+function b(e, t, i, r) {
+  if (!Array.isArray(i) || !Array.isArray(r))
+    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")
+  );
+}
+function x(e, t, i, r) {
+  if (!Array.isArray(r))
+    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")
+  );
+}
+function f(e, t, i) {
+  const r = /* @__PURE__ */ 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 (!l(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 $(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);
+  }
+  return n;
+}
+function E(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 (!l(s) || s[t] !== n)
+      return !0;
+  }
+  return !1;
+}
+function a(e, t) {
+  return new TypeError(`[Raph] collectionByKey derived "${e}" ${t}.`);
+}
+function y(e, t) {
+  return new TypeError(`[Raph] filterByKey derived "${e}" ${t}.`);
+}
+function R(e) {
+  return u(e, /* @__PURE__ */ new WeakMap());
+}
+function d(e, t, i, r) {
+  const n = /* @__PURE__ */ 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 y(e, t);
+    o = c;
+  }
+}
+function u(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 = /* @__PURE__ */ new Map();
+    t.set(e, n);
+    for (const [o, s] of e)
+      n.set(u(o, 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));
+    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] = u(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] = u(e[n], t);
+  return r;
+}
+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);
+}
+function l(e) {
+  return typeof e == "object" && e !== null && !Array.isArray(e);
+}
+export {
+  R as cloneMaterializedValue,
+  a as collectionError,
+  $ as collectionIndex,
+  f as collectionKeys,
+  g as collectionMutationImpact,
+  y as filterError,
+  E as indexesAreStale,
+  h as keyedPath,
+  w as validateFullCollection,
+  b as validateFullFilter,
+  A as validateIncrementalCollection,
+  x as validateIncrementalFilter
+};

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/derived/derived-strategy.utils.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(){return Object.freeze({kind:"full"})}function n(r){const e=String(r??"").trim();if(e.length===0)throw new TypeError("[Raph] collectionByKey requires a non-empty key.");return Object.freeze({kind:"collection-by-key",key:e})}function i(r){const e=String(r??"").trim();if(e.length===0)throw new TypeError("[Raph] filterByKey requires a non-empty key.");return Object.freeze({kind:"filter-by-key",key:e})}exports.collectionByKey=n;exports.filterByKey=i;exports.full=t;

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

@@ -0,0 +1,20 @@
+function n() {
+  return Object.freeze({ kind: "full" });
+}
+function t(r) {
+  const e = String(r ?? "").trim();
+  if (e.length === 0)
+    throw new TypeError("[Raph] collectionByKey requires a non-empty key.");
+  return Object.freeze({ kind: "collection-by-key", key: e });
+}
+function i(r) {
+  const e = String(r ?? "").trim();
+  if (e.length === 0)
+    throw new TypeError("[Raph] filterByKey requires a non-empty key.");
+  return Object.freeze({ kind: "filter-by-key", key: e });
+}
+export {
+  t as collectionByKey,
+  i as filterByKey,
+  n as full
+};

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

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