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

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

@@ -1,423 +0,0 @@
-var S = Object.defineProperty;
-var A = (n, e, t) => e in n ? S(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
-var u = (n, e, t) => A(n, typeof e != "symbol" ? e + "" : e, t);
-let m, w;
-const o = class o {
-  /**
-   * Сохраняет уже разобранный immutable path value.
-   */
-  constructor(e, t) {
-    // Хранят canonical value и разобранные сегменты пути.
-    u(this, "_canonical");
-    u(this, "_segments");
-    // Кешируют проверенные exact и mask представления.
-    u(this, "_exact");
-    u(this, "_mask");
-    this._canonical = e, this._segments = Object.freeze(
-      t.map((r) => Object.freeze({ ...r }))
-    );
-  }
-  /**
-   * Нормализует поддерживаемое определение пути в DataPath.
-   */
-  static from(e, t) {
-    return e instanceof o ? e : typeof e == "string" ? this.fromString(e, t) : this.fromPlain(e);
-  }
-  /**
-   * Разбирает строковый path согласно строгой грамматике.
-   */
-  static fromString(e, t) {
-    const r = x(
-      e,
-      t == null ? void 0 : t.vars,
-      !0,
-      (t == null ? void 0 : t.wildcardDynamic) === !0,
-      !0
-    ), i = this._cache ?? (this._cache = /* @__PURE__ */ new Map()), s = i.get(r.canonical);
-    if (s !== void 0)
-      return s;
-    i.size >= 2e4 && i.clear();
-    const c = new o(r.canonical, r.segments);
-    return i.set(r.canonical, c), c;
-  }
-  /**
-   * Восстанавливает DataPath из сериализованного представления.
-   */
-  static fromPlain(e) {
-    const r = (Array.isArray(e.segs) ? e.segs : []).map(j);
-    return new o(_(r), r);
-  }
-  /**
-   * Сериализует path в независимое plain-представление.
-   */
-  toPlain() {
-    return {
-      segs: this._segments.map((e) => e.kind === "key" ? { t: "key", k: e.key } : e.kind === "index" ? { t: "idx", i: e.index } : e.kind === "selector" ? { t: "param", pk: e.key, pv: e.value } : { t: "wc", indexed: e.indexed }),
-      deepOnTail: v(this._segments)
-    };
-  }
-  /**
-   * Возвращает canonical строковое представление пути.
-   */
-  toStringPath() {
-    return this._canonical;
-  }
-  /**
-   * Возвращает canonical строковое представление пути.
-   */
-  toString() {
-    return this._canonical;
-  }
-  /**
-   * Возвращает immutable список сегментов пути.
-   */
-  segments() {
-    return this._segments;
-  }
-  /**
-   * Проверяет соответствие exact path указанной маске.
-   */
-  static match(e, t) {
-    const r = this.from(e)._segments, i = this.from(t)._segments;
-    let s = 0;
-    for (; s < r.length; s++) {
-      const c = r[s];
-      if (c.kind === "wildcard" && !c.indexed && s === r.length - 1)
-        return !0;
-      const a = i[s];
-      if (a === void 0 || !H(c, a))
-        return !1;
-    }
-    return s === i.length;
-  }
-  /**
-   * Возвращает exact path либо отклоняет wildcard-сегменты.
-   * @internal
-   */
-  _asExact() {
-    for (const e of this._segments)
-      if (e.kind === "wildcard")
-        throw b(this._canonical);
-    return this._exact ?? (this._exact = {
-      canonical: this._canonical,
-      segments: this._segments
-    });
-  }
-  /**
-   * Возвращает path mask с проверкой позиции wildcard.
-   * @internal
-   */
-  _asMask() {
-    for (let t = 0; t < this._segments.length - 1; t++) {
-      const r = this._segments[t];
-      if (r.kind === "wildcard" && !r.indexed)
-        throw new TypeError(
-          `[Raph] Dot wildcard must be the final mask segment: "${this._canonical}".`
-        );
-    }
-    const e = v(this._segments);
-    return this._mask ?? (this._mask = {
-      canonical: this._canonical,
-      deep: e,
-      segments: e ? this._segments.slice(0, -1) : this._segments
-    });
-  }
-};
-// Переиспользует immutable экземпляры для одинаковых canonical paths.
-u(o, "_cache");
-let h = o;
-function q(n, e) {
-  if (!(e != null && e.vars)) {
-    const i = m == null ? void 0 : m.get(n);
-    if (i !== void 0)
-      return i;
-  }
-  if (typeof n != "string")
-    return M(n, e);
-  const t = x(n, e == null ? void 0 : e.vars, !1, !1, !0), r = {
-    canonical: t.canonical,
-    segments: t.segments
-  };
-  if (!(e != null && e.vars)) {
-    const i = m ?? (m = /* @__PURE__ */ new Map());
-    i.size >= 2e4 && i.clear(), i.set(n, r);
-  }
-  return r;
-}
-function V(n) {
-  const e = w == null ? void 0 : w.get(n);
-  if (e !== void 0)
-    return e;
-  if (typeof n != "string")
-    return P(n);
-  const t = x(n, void 0, !0, !1, !0);
-  for (let a = 0; a < t.segments.length - 1; a++) {
-    const l = t.segments[a];
-    if (l.kind === "wildcard" && !l.indexed)
-      throw new TypeError(
-        `[Raph] Dot wildcard must be the final mask segment: "${n}".`
-      );
-  }
-  const r = t.segments[t.segments.length - 1], i = (r == null ? void 0 : r.kind) === "wildcard" && !r.indexed, s = {
-    canonical: t.canonical,
-    deep: i,
-    segments: i ? t.segments.slice(0, -1) : t.segments
-  }, c = w ?? (w = /* @__PURE__ */ new Map());
-  return c.size >= 2e4 && c.clear(), c.set(n, s), s;
-}
-function M(n, e) {
-  const t = h.from(n, e)._asExact();
-  if (n instanceof h && !(e != null && e.vars)) {
-    const r = m ?? (m = /* @__PURE__ */ new Map());
-    r.size >= 2e4 && r.clear(), r.set(n, t);
-  }
-  return t;
-}
-function P(n) {
-  const e = h.from(n)._asMask();
-  if (n instanceof h) {
-    const t = w ?? (w = /* @__PURE__ */ new Map());
-    t.size >= 2e4 && t.clear(), t.set(n, e);
-  }
-  return e;
-}
-function F(n) {
-  if (n.segments.length === 0)
-    return ["*"];
-  const e = [`${n.canonical}.*`];
-  for (let t = 1; t < n.segments.length; t++)
-    e.push(_(n.segments.slice(0, t)));
-  return e;
-}
-function x(n, e, t, r = !1, i = !1) {
-  const s = n.trim();
-  if (s.length === 0) {
-    if (i)
-      return { canonical: "", segments: [] };
-    throw new TypeError("[Raph] Data path must not be empty.");
-  }
-  const c = [];
-  let a = 0, l = !0;
-  for (; a < s.length; ) {
-    const k = s[a];
-    if (k === ".") {
-      if (l)
-        throw f(n);
-      l = !0, a++;
-      continue;
-    }
-    if (k === "[") {
-      const $ = T(s, a);
-      c.push(I(
-        s.slice(a + 1, $),
-        e,
-        t,
-        r
-      )), a = $ + 1, l = !1;
-      continue;
-    }
-    if (!l)
-      throw f(n);
-    let d = a;
-    for (; d < s.length && s[d] !== "." && s[d] !== "["; )
-      d++;
-    const g = s.slice(a, d).trim();
-    if (g.length === 0)
-      throw f(n);
-    if (g === "*") {
-      if (!t)
-        throw b(n);
-      c.push({ kind: "wildcard", indexed: !1 });
-    } else r && g.startsWith("$") && !y(g.slice(1), e) ? c.push({ kind: "wildcard", indexed: !1 }) : c.push({ kind: "key", key: N(g, e) });
-    a = d, l = !1;
-  }
-  if (l || c.length === 0)
-    throw f(n);
-  return { canonical: _(c), segments: c };
-}
-function T(n, e) {
-  let t, r = 1;
-  for (let i = e + 1; i < n.length; i++) {
-    const s = n[i];
-    if (s === "\\") {
-      i++;
-      continue;
-    }
-    if (t !== void 0) {
-      s === t && (t = void 0);
-      continue;
-    }
-    if (s === '"' || s === "'") {
-      t = s;
-      continue;
-    }
-    if (s === "[") {
-      r++;
-      continue;
-    }
-    if (s === "]" && --r === 0)
-      return i;
-  }
-  throw f(n);
-}
-function I(n, e, t, r) {
-  const i = n.trim();
-  if (i === "*") {
-    if (!t)
-      throw b(`[${n}]`);
-    return { kind: "wildcard", indexed: !0 };
-  }
-  if (/^\d+$/.test(i))
-    return { kind: "index", index: Number(i) };
-  if (/^\$[A-Z_$][\w$]*$/i.test(i)) {
-    if (r && !y(i.slice(1), e))
-      return { kind: "wildcard", indexed: !0 };
-    const l = p(i.slice(1), e);
-    if (!Number.isInteger(l) || l < 0)
-      throw new TypeError(`[Raph] Index variable "${i}" must be a non-negative integer.`);
-    return { kind: "index", index: l };
-  }
-  const s = R(i);
-  if (s === -1)
-    throw f(`[${n}]`);
-  const c = i.slice(0, s).trim(), a = i.slice(s + 1).trim();
-  if (!c || !a)
-    throw f(`[${n}]`);
-  return r && Z(a, e) ? { kind: "wildcard", indexed: !0 } : {
-    kind: "selector",
-    key: c,
-    value: C(a, e)
-  };
-}
-function R(n) {
-  let e;
-  for (let t = 0; t < n.length; t++) {
-    const r = n[t];
-    if (r === "\\") {
-      t++;
-      continue;
-    }
-    if (e !== void 0) {
-      r === e && (e = void 0);
-      continue;
-    }
-    if (r === '"' || r === "'")
-      e = r;
-    else if (r === "=")
-      return t;
-  }
-  return -1;
-}
-function C(n, e) {
-  if (/^\$[A-Z_$][\w$]*$/i.test(n)) {
-    const t = p(n.slice(1), e);
-    if (t === null || typeof t == "string" || typeof t == "boolean" || typeof t == "number" && Number.isFinite(t))
-      return t;
-    throw new TypeError(`[Raph] Selector variable "${n}" must be scalar.`);
-  }
-  if (n[0] === '"' || n[0] === "'")
-    return O(n);
-  if (/^-?(?:\d+(?:\.\d*)?|\.\d+)$/.test(n)) {
-    const t = Number(n);
-    if (Number.isFinite(t))
-      return t;
-  }
-  return n === "true" ? !0 : n === "false" ? !1 : n === "null" ? null : n;
-}
-function O(n) {
-  const e = n[0];
-  if (n.length < 2 || n[n.length - 1] !== e)
-    throw f(n);
-  if (e === '"')
-    try {
-      const r = JSON.parse(n);
-      if (typeof r == "string")
-        return r;
-    } catch {
-      throw f(n);
-    }
-  let t = "";
-  for (let r = 1; r < n.length - 1; r++) {
-    const i = n[r];
-    if (i === "\\") {
-      if (r++, r >= n.length - 1)
-        throw f(n);
-      t += n[r];
-    } else
-      t += i;
-  }
-  return t;
-}
-function N(n, e) {
-  if (!n.startsWith("$"))
-    return n;
-  const t = p(n.slice(1), e);
-  if (typeof t != "string" && typeof t != "number")
-    throw new TypeError(`[Raph] Key variable "${n}" must be a string or number.`);
-  const r = String(t);
-  if (!r || r.includes(".") || r.includes("[") || r.includes("]"))
-    throw new TypeError(`[Raph] Key variable "${n}" contains path syntax.`);
-  return r;
-}
-function p(n, e) {
-  if (!y(n, e))
-    throw new TypeError(`[Raph] Missing path variable "${n}".`);
-  return e[n];
-}
-function y(n, e) {
-  return e !== void 0 && Object.hasOwn(e, n);
-}
-function Z(n, e) {
-  for (const t of n.matchAll(/\$([A-Z_$][\w$]*)/gi))
-    if (!y(t[1], e))
-      return !0;
-  return !1;
-}
-function j(n) {
-  if (typeof n != "object" || n === null)
-    throw E();
-  const e = n;
-  if (e.t === "key" && typeof e.k == "string")
-    return { kind: "key", key: e.k };
-  if (e.t === "idx" && typeof e.i == "number" && Number.isInteger(e.i) && e.i >= 0)
-    return { kind: "index", index: e.i };
-  if (e.t === "wc")
-    return { kind: "wildcard", indexed: e.indexed === !0 };
-  if (e.t === "param" && typeof e.pk == "string" && z(e.pv))
-    return { kind: "selector", key: e.pk, value: e.pv };
-  throw E();
-}
-function z(n) {
-  return n === null || typeof n == "string" || typeof n == "boolean" || typeof n == "number" && Number.isFinite(n);
-}
-function v(n) {
-  const e = n[n.length - 1];
-  return (e == null ? void 0 : e.kind) === "wildcard" && !e.indexed;
-}
-function H(n, e) {
-  return n.kind === "wildcard" ? !n.indexed || e.kind === "index" || e.kind === "selector" : n.kind !== e.kind ? !1 : n.kind === "key" ? n.key === e.key : n.kind === "index" ? n.index === e.index : n.key === e.key && Object.is(n.value, e.value);
-}
-function _(n) {
-  let e = "";
-  for (const t of n)
-    t.kind === "key" ? e += e ? `.${t.key}` : t.key : t.kind === "index" ? e += `[${t.index}]` : t.kind === "selector" ? e += `[${t.key}=${X(t.value)}]` : e += t.indexed ? "[*]" : e ? ".*" : "*";
-  return e;
-}
-function X(n) {
-  return typeof n == "string" ? JSON.stringify(n) : String(n);
-}
-function f(n) {
-  return new TypeError(`[Raph] Invalid data path "${n}".`);
-}
-function E() {
-  return new TypeError("[Raph] Invalid plain DataPath representation.");
-}
-function b(n) {
-  return new TypeError(`[Raph] Wildcard is only allowed in watch masks: "${n}".`);
-}
-export {
-  h as DataPath,
-  q as parseDataPath,
-  V as parsePathMask,
-  F as pathRelationMasks
-};

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

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./data-path.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/path-router.cjs

@@ -1 +0,0 @@
-"use strict";var u=Object.defineProperty;var x=(n,t,i)=>t in n?u(n,t,{enumerable:!0,configurable:!0,writable:!0,value:i}):n[t]=i;var p=(n,t,i)=>x(n,typeof t!="symbol"?t+"":t,i);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./segment-key.cjs");class g{constructor(){p(this,"_root",{})}add(t,i){let e=this._root;const o=[];for(const c of t.segments)if(c.kind==="wildcard"){const d=e.indexedWildcard??(e.indexedWildcard={});o.push({child:d,parent:e,indexedWildcard:!0}),e=d}else{const d=h.pathSegmentKey(c),a=e.exact??(e.exact=new Map);let s=a.get(d);s===void 0&&(s={},a.set(d,s)),o.push({child:s,key:d,parent:e,indexedWildcard:!1}),e=s}const r=t.deep?e.deep??(e.deep=new Set):e.end??(e.end=new Set);r.add(i);let l=!0;return()=>{if(l){l=!1,r.delete(i),r.size===0&&(t.deep?e.deep=void 0:e.end=void 0);for(let c=o.length-1;c>=0;c--){const d=o[c];if(!v(d.child))break;d.indexedWildcard?d.parent.indexedWildcard=void 0:(d.parent.exact.delete(d.key),d.parent.exact.size===0&&(d.parent.exact=void 0))}}}}match(t){var o;let i=[this._root];const e=new Set;for(let r=0;r<=t.length;r++){const l=r===t.length,c=[];for(const d of i){if(f(e,d.deep),l){f(e,d.end);continue}const a=t[r],s=(o=d.exact)==null?void 0:o.get(h.pathSegmentKey(a));s!==void 0&&c.push(s),d.indexedWildcard!==void 0&&(a.kind==="index"||a.kind==="selector")&&c.push(d.indexedWildcard)}if(l||(i=c,i.length===0))break}return e}matchAll(){const t=new Set,i=[this._root];for(;i.length;){const e=i.pop();if(f(t,e.deep),f(t,e.end),e.indexedWildcard!==void 0&&i.push(e.indexedWildcard),e.exact!==void 0)for(const o of e.exact.values())i.push(o)}return t}}function f(n,t){if(t!==void 0)for(const i of t)n.add(i)}function v(n){return n.deep===void 0&&n.end===void 0&&n.exact===void 0&&n.indexedWildcard===void 0}exports.PathRouter=g;

package/dist/debug/path/path-router.js

@@ -1,86 +0,0 @@
-var h = Object.defineProperty;
-var u = (n, t, i) => t in n ? h(n, t, { enumerable: !0, configurable: !0, writable: !0, value: i }) : n[t] = i;
-var p = (n, t, i) => u(n, typeof t != "symbol" ? t + "" : t, i);
-import { pathSegmentKey as x } from "./segment-key.js";
-class m {
-  constructor() {
-    // Корень trie разделяет exact и indexed-wildcard transitions.
-    p(this, "_root", {});
-  }
-  /**
-   * Регистрирует route mask и возвращает функцию удаления.
-   */
-  add(t, i) {
-    let e = this._root;
-    const o = [];
-    for (const c of t.segments)
-      if (c.kind === "wildcard") {
-        const d = e.indexedWildcard ?? (e.indexedWildcard = {});
-        o.push({ child: d, parent: e, indexedWildcard: !0 }), e = d;
-      } else {
-        const d = x(c), a = e.exact ?? (e.exact = /* @__PURE__ */ new Map());
-        let s = a.get(d);
-        s === void 0 && (s = {}, a.set(d, s)), o.push({ child: s, key: d, parent: e, indexedWildcard: !1 }), e = s;
-      }
-    const r = t.deep ? e.deep ?? (e.deep = /* @__PURE__ */ new Set()) : e.end ?? (e.end = /* @__PURE__ */ new Set());
-    r.add(i);
-    let l = !0;
-    return () => {
-      if (l) {
-        l = !1, r.delete(i), r.size === 0 && (t.deep ? e.deep = void 0 : e.end = void 0);
-        for (let c = o.length - 1; c >= 0; c--) {
-          const d = o[c];
-          if (!v(d.child))
-            break;
-          d.indexedWildcard ? d.parent.indexedWildcard = void 0 : (d.parent.exact.delete(d.key), d.parent.exact.size === 0 && (d.parent.exact = void 0));
-        }
-      }
-    };
-  }
-  /**
-   * Возвращает routes, чьи masks соответствуют указанному событию.
-   */
-  match(t) {
-    var o;
-    let i = [this._root];
-    const e = /* @__PURE__ */ new Set();
-    for (let r = 0; r <= t.length; r++) {
-      const l = r === t.length, c = [];
-      for (const d of i) {
-        if (f(e, d.deep), l) {
-          f(e, d.end);
-          continue;
-        }
-        const a = t[r], s = (o = d.exact) == null ? void 0 : o.get(x(a));
-        s !== void 0 && c.push(s), d.indexedWildcard !== void 0 && (a.kind === "index" || a.kind === "selector") && c.push(d.indexedWildcard);
-      }
-      if (l || (i = c, i.length === 0))
-        break;
-    }
-    return e;
-  }
-  /**
-   * При замене root возвращает все зарегистрированные path masks.
-   */
-  matchAll() {
-    const t = /* @__PURE__ */ new Set(), i = [this._root];
-    for (; i.length; ) {
-      const e = i.pop();
-      if (f(t, e.deep), f(t, e.end), e.indexedWildcard !== void 0 && i.push(e.indexedWildcard), e.exact !== void 0)
-        for (const o of e.exact.values())
-          i.push(o);
-    }
-    return t;
-  }
-}
-function f(n, t) {
-  if (t !== void 0)
-    for (const i of t)
-      n.add(i);
-}
-function v(n) {
-  return n.deep === void 0 && n.end === void 0 && n.exact === void 0 && n.indexedWildcard === void 0;
-}
-export {
-  m as PathRouter
-};

package/dist/debug/path/public.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./data-adapter.cjs"),a=require("./data-path.cjs"),e=require("./derived-strategies.cjs"),r=require("./PathStore.cjs"),d=require("./RaphDerivedHandle.cjs"),h=require("./RaphKernel.cjs"),l=require("./RaphMeta.cjs");exports.DefaultDataAdapter=t.DefaultDataAdapter;exports.DataPath=a.DataPath;exports.collectionByKey=e.collectionByKey;exports.filterByKey=e.filterByKey;exports.full=e.full;exports.PathStore=r.PathStore;exports.RaphDerivedHandle=d.RaphDerivedHandle;exports.RaphKernel=h.RaphKernel;exports.RaphMeta=l.RaphMeta;

package/dist/debug/path/public.js

@@ -1,18 +0,0 @@
-import { DefaultDataAdapter as o } from "./data-adapter.js";
-import { DataPath as a } from "./data-path.js";
-import { collectionByKey as f, filterByKey as l, full as m } from "./derived-strategies.js";
-import { PathStore as h } from "./PathStore.js";
-import { RaphDerivedHandle as D } from "./RaphDerivedHandle.js";
-import { RaphKernel as i } from "./RaphKernel.js";
-import { RaphMeta as K } from "./RaphMeta.js";
-export {
-  a as DataPath,
-  o as DefaultDataAdapter,
-  h as PathStore,
-  D as RaphDerivedHandle,
-  i as RaphKernel,
-  K as RaphMeta,
-  f as collectionByKey,
-  l as filterByKey,
-  m as full
-};

package/dist/debug/runtime/PathHandle.cjs

@@ -1 +0,0 @@
-"use strict";var p=Object.defineProperty;var c=(r,s,t)=>s in r?p(r,s,{enumerable:!0,configurable:!0,writable:!0,value:t}):r[s]=t;var e=(r,s,t)=>c(r,typeof s!="symbol"?s+"":s,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("../path/data-path.cjs"),u=require("./disposal.cjs"),k=require("./errors.cjs");class w{constructor(s,t,h,a,i,_,d,n,l){e(this,"path");e(this,"options");e(this,"_revision");e(this,"_disposeRevision");e(this,"_isTracking");e(this,"_store");e(this,"_release");e(this,"_masks");e(this,"_assertOwnerAlive");e(this,"_assertTrackedRead");e(this,"_assertWriteAllowed");e(this,"_runWrite");e(this,"_stop");e(this,"_disposed",!1);const o=i._ownedSignal(0);this._store=s,this._revision=o.source,this._disposeRevision=o.dispose,this._isTracking=i._isTracking,this.path=t.canonical,this.options=h,this._release=a,this._masks=v.pathRelationMasks(t),this._assertOwnerAlive=_,this._assertTrackedRead=d,this._assertWriteAllowed=n,this._runWrite=l}get disposed(){return this._disposed}get(){var s;return this._assertAlive(),(s=this._assertTrackedRead)==null||s.call(this),this._isTracking()?this._readTracked():this._store.peek(this.path)}peek(){return this._assertAlive(),this._store.peek(this.path)}set(s){var t;this._assertAlive(),(t=this._assertWriteAllowed)==null||t.call(this),this._write(()=>this._store.set(this.path,s))}merge(s){var t;this._assertAlive(),(t=this._assertWriteAllowed)==null||t.call(this),this._write(()=>this._store.merge(this.path,s))}delete(){var s;this._assertAlive(),(s=this._assertWriteAllowed)==null||s.call(this),this._write(()=>this._store.delete(this.path))}has(){return this._assertAlive(),this._store.has(this.path)}dispose(){if(this._disposed)return;this._disposed=!0;const s=[],t=this._stop;this._stop=void 0;const h=this._disposeRevision;this._disposeRevision=void 0;const a=this._release;this._release=void 0,this._revision=void 0,this._isTracking=void 0,this._store=void 0,this._assertOwnerAlive=void 0,this._assertTrackedRead=void 0,this._assertWriteAllowed=void 0,this._runWrite=void 0;try{t==null||t()}catch(i){s.push(i)}try{h==null||h()}catch(i){s.push(i)}try{a==null||a(this)}catch(i){s.push(i)}u.throwDisposalErrors(s,`[Raph] Path handle "${this.path}" disposal failed.`)}_getTracked(){var s;return this._assertAlive(),(s=this._assertTrackedRead)==null||s.call(this),this._readTracked()}_readTracked(){return this._observe(),this._revision.get(),this._store.get(this.path)}_observe(){this._stop??(this._stop=this._store.watch(this._masks,()=>{this._revision.set(this._revision.peek()+1)}))}_write(s){const t=this._runWrite;t===void 0?s():t(s)}_assertAlive(){var s;if(this._disposed)throw new k.RaphDisposedError(`[Raph] Path handle "${this.path}" is disposed.`);(s=this._assertOwnerAlive)==null||s.call(this)}}exports.PathHandle=w;

package/dist/debug/runtime/PathHandle.js

@@ -1,139 +0,0 @@
-var l = Object.defineProperty;
-var v = (r, s, t) => s in r ? l(r, s, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[s] = t;
-var e = (r, s, t) => v(r, typeof s != "symbol" ? s + "" : s, t);
-import { pathRelationMasks as c } from "../path/data-path.js";
-import { throwDisposalErrors as k } from "./disposal.js";
-import { RaphDisposedError as w } from "./errors.js";
-class R {
-  /**
-   * Создаёт internal path handle и связывает его с runtime lifecycle.
-   * @internal
-   */
-  constructor(s, t, h, o, i, _, d, n, p) {
-    // Публикуют canonical path и нормализованные параметры handle.
-    e(this, "path");
-    e(this, "options");
-    // Связывают path revision с runtime reactivity и owning Kernel.
-    e(this, "_revision");
-    e(this, "_disposeRevision");
-    e(this, "_isTracking");
-    e(this, "_store");
-    e(this, "_release");
-    e(this, "_masks");
-    // Применяют runtime lifecycle и write policy к операциям handle.
-    e(this, "_assertOwnerAlive");
-    e(this, "_assertTrackedRead");
-    e(this, "_assertWriteAllowed");
-    e(this, "_runWrite");
-    // Хранят активную Kernel subscription и окончательное состояние handle.
-    e(this, "_stop");
-    e(this, "_disposed", !1);
-    const a = i._ownedSignal(0);
-    this._store = s, this._revision = a.source, this._disposeRevision = a.dispose, this._isTracking = i._isTracking, this.path = t.canonical, this.options = h, this._release = o, this._masks = c(t), this._assertOwnerAlive = _, this._assertTrackedRead = d, this._assertWriteAllowed = n, this._runWrite = p;
-  }
-  /**
-   * Показывает, освобождён ли path handle.
-   */
-  get disposed() {
-    return this._disposed;
-  }
-  /**
-   * Читает path с регистрацией реактивной зависимости.
-   */
-  get() {
-    var s;
-    return this._assertAlive(), (s = this._assertTrackedRead) == null || s.call(this), this._isTracking() ? this._readTracked() : this._store.peek(this.path);
-  }
-  /**
-   * Читает path без регистрации реактивной зависимости.
-   */
-  peek() {
-    return this._assertAlive(), this._store.peek(this.path);
-  }
-  /**
-   * Записывает значение path через runtime write policy.
-   */
-  set(s) {
-    var t;
-    this._assertAlive(), (t = this._assertWriteAllowed) == null || t.call(this), this._write(() => this._store.set(this.path, s));
-  }
-  /**
-   * Объединяет значение path через runtime write policy.
-   */
-  merge(s) {
-    var t;
-    this._assertAlive(), (t = this._assertWriteAllowed) == null || t.call(this), this._write(() => this._store.merge(this.path, s));
-  }
-  /**
-   * Удаляет значение path через runtime write policy.
-   */
-  delete() {
-    var s;
-    this._assertAlive(), (s = this._assertWriteAllowed) == null || s.call(this), this._write(() => this._store.delete(this.path));
-  }
-  /**
-   * Проверяет наличие значения path.
-   */
-  has() {
-    return this._assertAlive(), this._store.has(this.path);
-  }
-  /**
-   * Отсоединяет Kernel subscription и освобождает reactive revision handle.
-   */
-  dispose() {
-    if (this._disposed)
-      return;
-    this._disposed = !0;
-    const s = [], t = this._stop;
-    this._stop = void 0;
-    const h = this._disposeRevision;
-    this._disposeRevision = void 0;
-    const o = this._release;
-    this._release = void 0, this._revision = void 0, this._isTracking = void 0, this._store = void 0, this._assertOwnerAlive = void 0, this._assertTrackedRead = void 0, this._assertWriteAllowed = void 0, this._runWrite = void 0;
-    try {
-      t == null || t();
-    } catch (i) {
-      s.push(i);
-    }
-    try {
-      h == null || h();
-    } catch (i) {
-      s.push(i);
-    }
-    try {
-      o == null || o(this);
-    } catch (i) {
-      s.push(i);
-    }
-    k(s, `[Raph] Path handle "${this.path}" disposal failed.`);
-  }
-  /**
-   * Читает path с регистрацией runtime reactive dependency.
-   * @internal
-   */
-  _getTracked() {
-    var s;
-    return this._assertAlive(), (s = this._assertTrackedRead) == null || s.call(this), this._readTracked();
-  }
-  _readTracked() {
-    return this._observe(), this._revision.get(), this._store.get(this.path);
-  }
-  _observe() {
-    this._stop ?? (this._stop = this._store.watch(this._masks, () => {
-      this._revision.set(this._revision.peek() + 1);
-    }));
-  }
-  _write(s) {
-    const t = this._runWrite;
-    t === void 0 ? s() : t(s);
-  }
-  _assertAlive() {
-    var s;
-    if (this._disposed)
-      throw new w(`[Raph] Path handle "${this.path}" is disposed.`);
-    (s = this._assertOwnerAlive) == null || s.call(this);
-  }
-}
-export {
-  R as PathHandle
-};