@raphy-js/raph 1.0.0-dev.2

package/dist/debug/path/RaphMetaStore.cjs

@@ -0,0 +1 @@
+"use strict";var p=Object.defineProperty;var _=(n,e,t)=>e in n?p(n,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):n[e]=t;var a=(n,e,t)=>_(n,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./segment-key.cjs");function d(){return{children:new Map,namespaces:new Map,path:void 0}}class g{constructor(){a(this,"_root",d());a(this,"size",0)}get(e,t){const r=this._find(e);if(r!==void 0)return t===void 0?Object.fromEntries(r.namespaces):r.namespaces.get(t)}has(e,t){const r=this._find(e);return r===void 0?!1:t===void 0?r.namespaces.size!==0:r.namespaces.has(t)}set(e,t,r){const s=this._ensure(e);s.namespaces.has(t)||this.size++,s.namespaces.set(t,r),s.path=e}merge(e,t,r){const s=this.get(e,t);if(l(s)&&l(r)){for(const i of Object.keys(r))y(s,i,r[i]);return}this.set(e,t,r)}delete(e,t){var i;const r=this._findStack(e),s=(i=r.at(-1))==null?void 0:i.node;if(s===void 0)return!1;if(t===void 0){if(s.namespaces.size===0)return!1;this.size-=s.namespaces.size,s.namespaces.clear()}else{if(!s.namespaces.delete(t))return!1;this.size--}return this._pruneEmpty(r),!0}deleteSubtree(e){const t=o(e);if(t.length===0)return this.clear();let r=this._root;for(let c=0;c<t.length-1;c++){const u=r.children.get(t[c]);if(u===void 0)return[];r=u}const s=r.children.get(t.at(-1));if(s===void 0)return[];const i=h(s);return this.size-=f(s),r.children.delete(t.at(-1)),i}pruneMissing(e,t){const r=this._find(e);if(r===void 0)return[];const s=[];return this._pruneMissingNode(r,t,s),s}clear(){const e=h(this._root);return this._root.children.clear(),this._root.namespaces.clear(),this._root.path=void 0,this.size=0,e}_find(e){let t=this._root;for(const r of o(e)){const s=t.children.get(r);if(s===void 0)return;t=s}return t}_ensure(e){let t=this._root;for(const r of o(e)){let s=t.children.get(r);s===void 0&&(s=d(),t.children.set(r,s)),t=s}return t}_findStack(e){const t=[{key:void 0,node:this._root}];let r=this._root;for(const s of o(e)){const i=r.children.get(s);if(i===void 0)return[];t.push({key:s,node:i}),r=i}return t}_pruneEmpty(e){for(let t=e.length-1;t>0;t--){const r=e[t];if(r.node.namespaces.size!==0||r.node.children.size!==0)return;e[t-1].node.children.delete(r.key)}}_pruneMissingNode(e,t,r){for(const[s,i]of[...e.children])this._pruneMissingNode(i,t,r)&&e.children.delete(s);return e.path!==void 0&&e.namespaces.size!==0&&!t(e.path)&&(this.size-=e.namespaces.size,e.namespaces.clear(),r.push(e.path)),e!==this._root&&e.namespaces.size===0&&e.children.size===0}}function o(n){return n.segments().map(m.pathSegmentKey)}function h(n){const e=n.path!==void 0&&n.namespaces.size!==0?[n.path]:[];for(const t of n.children.values())e.push(...h(t));return e}function f(n){let e=n.namespaces.size;for(const t of n.children.values())e+=f(t);return e}function l(n){if(typeof n!="object"||n===null||Array.isArray(n))return!1;const e=Object.getPrototypeOf(n);return e===Object.prototype||e===null}function y(n,e,t){if(e!=="__proto__"){n[e]=t;return}Object.defineProperty(n,e,{configurable:!0,enumerable:!0,value:t,writable:!0})}exports.RaphMetaStore=g;

package/dist/debug/path/RaphMetaStore.js

@@ -0,0 +1,184 @@
+var p = Object.defineProperty;
+var _ = (n, e, t) => e in n ? p(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
+var h = (n, e, t) => _(n, typeof e != "symbol" ? e + "" : e, t);
+import { pathSegmentKey as m } from "./segment-key.js";
+function f() {
+  return { children: /* @__PURE__ */ new Map(), namespaces: /* @__PURE__ */ new Map(), path: void 0 };
+}
+class v {
+  constructor() {
+    // Хранят metadata tree и точное число записанных namespaces.
+    h(this, "_root", f());
+    h(this, "size", 0);
+  }
+  /**
+   * Возвращает значение по пути без создания отсутствующих данных.
+   */
+  get(e, t) {
+    const r = this._find(e);
+    if (r !== void 0)
+      return t === void 0 ? Object.fromEntries(r.namespaces) : r.namespaces.get(t);
+  }
+  /**
+   * Проверяет наличие значения по указанному пути.
+   */
+  has(e, t) {
+    const r = this._find(e);
+    return r === void 0 ? !1 : t === void 0 ? r.namespaces.size !== 0 : r.namespaces.has(t);
+  }
+  /**
+   * Записывает значение namespace в metadata tree.
+   */
+  set(e, t, r) {
+    const s = this._ensure(e);
+    s.namespaces.has(t) || this.size++, s.namespaces.set(t, r), s.path = e;
+  }
+  /**
+   * Объединяет object metadata либо заменяет значение namespace.
+   */
+  merge(e, t, r) {
+    const s = this.get(e, t);
+    if (l(s) && l(r)) {
+      for (const i of Object.keys(r))
+        g(s, i, r[i]);
+      return;
+    }
+    this.set(e, t, r);
+  }
+  /**
+   * Удаляет namespace либо все metadata указанного owner.
+   */
+  delete(e, t) {
+    var i;
+    const r = this._findStack(e), s = (i = r.at(-1)) == null ? void 0 : i.node;
+    if (s === void 0)
+      return !1;
+    if (t === void 0) {
+      if (s.namespaces.size === 0)
+        return !1;
+      this.size -= s.namespaces.size, s.namespaces.clear();
+    } else {
+      if (!s.namespaces.delete(t))
+        return !1;
+      this.size--;
+    }
+    return this._pruneEmpty(r), !0;
+  }
+  /**
+   * Удаляет metadata всего поддерева указанного data-owner.
+   */
+  deleteSubtree(e) {
+    const t = o(e);
+    if (t.length === 0)
+      return this.clear();
+    let r = this._root;
+    for (let c = 0; c < t.length - 1; c++) {
+      const d = r.children.get(t[c]);
+      if (d === void 0)
+        return [];
+      r = d;
+    }
+    const s = r.children.get(t.at(-1));
+    if (s === void 0)
+      return [];
+    const i = a(s);
+    return this.size -= u(s), r.children.delete(t.at(-1)), i;
+  }
+  /**
+   * Удаляет metadata, владельцы которой отсутствуют в data tree.
+   */
+  pruneMissing(e, t) {
+    const r = this._find(e);
+    if (r === void 0)
+      return [];
+    const s = [];
+    return this._pruneMissingNode(r, t, s), s;
+  }
+  /**
+   * Полностью очищает metadata storage.
+   */
+  clear() {
+    const e = a(this._root);
+    return this._root.children.clear(), this._root.namespaces.clear(), this._root.path = void 0, this.size = 0, e;
+  }
+  _find(e) {
+    let t = this._root;
+    for (const r of o(e)) {
+      const s = t.children.get(r);
+      if (s === void 0)
+        return;
+      t = s;
+    }
+    return t;
+  }
+  _ensure(e) {
+    let t = this._root;
+    for (const r of o(e)) {
+      let s = t.children.get(r);
+      s === void 0 && (s = f(), t.children.set(r, s)), t = s;
+    }
+    return t;
+  }
+  _findStack(e) {
+    const t = [
+      { key: void 0, node: this._root }
+    ];
+    let r = this._root;
+    for (const s of o(e)) {
+      const i = r.children.get(s);
+      if (i === void 0)
+        return [];
+      t.push({ key: s, node: i }), r = i;
+    }
+    return t;
+  }
+  _pruneEmpty(e) {
+    for (let t = e.length - 1; t > 0; t--) {
+      const r = e[t];
+      if (r.node.namespaces.size !== 0 || r.node.children.size !== 0)
+        return;
+      e[t - 1].node.children.delete(r.key);
+    }
+  }
+  _pruneMissingNode(e, t, r) {
+    for (const [s, i] of [...e.children])
+      this._pruneMissingNode(i, t, r) && e.children.delete(s);
+    return e.path !== void 0 && e.namespaces.size !== 0 && !t(e.path) && (this.size -= e.namespaces.size, e.namespaces.clear(), r.push(e.path)), e !== this._root && e.namespaces.size === 0 && e.children.size === 0;
+  }
+}
+function o(n) {
+  return n.segments().map(m);
+}
+function a(n) {
+  const e = n.path !== void 0 && n.namespaces.size !== 0 ? [n.path] : [];
+  for (const t of n.children.values())
+    e.push(...a(t));
+  return e;
+}
+function u(n) {
+  let e = n.namespaces.size;
+  for (const t of n.children.values())
+    e += u(t);
+  return e;
+}
+function l(n) {
+  if (typeof n != "object" || n === null || Array.isArray(n))
+    return !1;
+  const e = Object.getPrototypeOf(n);
+  return e === Object.prototype || e === null;
+}
+function g(n, e, t) {
+  if (e !== "__proto__") {
+    n[e] = t;
+    return;
+  }
+  Object.defineProperty(n, e, {
+    configurable: !0,
+    enumerable: !0,
+    value: t,
+    writable: !0
+  });
+}
+export {
+  v as RaphMetaStore
+};

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

@@ -0,0 +1 @@
+"use strict";var j=Object.defineProperty;var S=(o,e,t)=>e in o?j(o,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):o[e]=t;var y=(o,e,t)=>S(o,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const C=require("./data-draft.cjs"),h=require("./data-path.cjs");class g{constructor(e=p(),t={}){y(this,"_root");y(this,"_options");y(this,"_indexes");this._root=x(e),this._options={arrayDelete:t.arrayDelete??"unset",autoCreate:t.autoCreate??!0,indexEnabled:t.indexEnabled??!0,indexStrategy:t.indexStrategy??"eager-all-keys"}}root(){return this._root}fork(){const e=new g({},this._options);return e._root=C.createDataDraft(this._root,t=>{var r;return(r=e._indexes)==null?void 0:r.delete(t)}).root,e}replaceRoot(e){this._root=x(e),this._indexes=void 0}options(e){e.arrayDelete!==void 0&&(this._options.arrayDelete=e.arrayDelete),e.autoCreate!==void 0&&(this._options.autoCreate=e.autoCreate),e.indexEnabled!==void 0&&(this._options.indexEnabled=e.indexEnabled),e.indexStrategy!==void 0&&(this._options.indexStrategy=e.indexStrategy),this._indexes=void 0}get(e,t){return this._read(h.parseDataPath(e,t)).value}has(e,t){return this._read(h.parseDataPath(e,t)).exists}set(e,t,r){const i=h.parseDataPath(e,r);if(i.segments.length===0){this.replaceRoot(x(t));return}let s=this._root,n;for(let a=0;a<i.segments.length-1;a++){const d=i.segments[a],c=i.segments[a+1],l=this._readOrCreateChild(s,d,c,i.canonical);s=l.value,n=l.indexedParent}this._writeSegment(s,i.segments[i.segments.length-1],t,i.canonical,n)}merge(e,t,r){const i=this.get(e,r);if(f(i)&&f(t)){for(const s of Object.keys(t))b(i,s,t[s]);this._indexes=void 0;return}this.set(e,t,r)}delete(e,t){const r=h.parseDataPath(e,t);if(r.segments.length===0){this._root=p(),this._indexes=void 0;return}let i=this._root;for(let n=0;n<r.segments.length-1;n++){if(!u(i))return;i=this._readSegment(i,r.segments[n])}if(!u(i))return;const s=r.segments[r.segments.length-1];if(s.kind==="key")delete i[s.key];else if(s.kind==="index"){if(!Array.isArray(i))return;this._options.arrayDelete==="splice"?i.splice(s.index,1):delete i[s.index]}else{if(!Array.isArray(i))return;const n=this._findSelector(i,s.key,s.value);if(n===-1)return;this._options.arrayDelete==="splice"?i.splice(n,1):delete i[n]}this._indexes=void 0}indexOf(e,t){const r=h.parseDataPath(e,t);let i=this._root;for(let s=0;s<r.segments.length;s++){const n=r.segments[s],a=s===r.segments.length-1;if(n.kind==="key"){if(!u(i)||!Object.hasOwn(i,n.key))return-1;i=i[n.key];continue}if(!Array.isArray(i))return-1;if(n.kind==="index"){if(!Object.hasOwn(i,n.index))return-1;if(a)return n.index;i=i[n.index];continue}const d=this._findSelector(i,n.key,n.value);if(d===-1)return-1;if(a)return d;i=i[d]}return-1}_read(e){let t=this._root;for(const r of e.segments)if(r.kind==="key"){if(!u(t)||!Object.hasOwn(t,r.key))return{exists:!1,value:void 0};t=t[r.key]}else if(r.kind==="index"){if(!Array.isArray(t)||!Object.hasOwn(t,r.index))return{exists:!1,value:void 0};t=t[r.index]}else{if(!Array.isArray(t))return{exists:!1,value:void 0};const i=this._findSelector(t,r.key,r.value);if(i===-1)return{exists:!1,value:void 0};t=t[i]}return{exists:!0,value:t}}_readSegment(e,t){if(t.kind==="key")return Object.hasOwn(e,t.key)?e[t.key]:void 0;if(!Array.isArray(e))return;if(t.kind==="index")return e[t.index];const r=this._findSelector(e,t.key,t.value);return r===-1?void 0:e[r]}_readOrCreateChild(e,t,r,i){if(t.kind==="key"){let n=e[t.key];if(!Object.hasOwn(e,t.key)||n===void 0){if(!this._options.autoCreate)throw _(i);n=v(r),b(e,t.key,n)}return{value:k(n,i)}}if(!Array.isArray(e))throw w(i);if(t.kind==="index"){let n=e[t.index];if(!Object.hasOwn(e,t.index)||n===void 0){if(!this._options.autoCreate)throw _(i);n=v(r),e[t.index]=n}return{value:k(n,i),indexedParent:{array:e,index:t.index}}}let s=this._findSelector(e,t.key,t.value);if(s===-1){if(!this._options.autoCreate)throw _(i);const n=Object.create(null);n[t.key]=t.value,e.push(n),s=e.length-1,this._invalidateArray(e)}return{value:k(e[s],i),indexedParent:{array:e,index:s}}}_writeSegment(e,t,r,i,s){if(t.kind==="key"){b(e,t.key,r),s!==void 0&&s.array[s.index]===e&&this._invalidateIndexKey(s.array,t.key);return}if(!Array.isArray(e))throw w(i);if(t.kind==="index"){e[t.index]=r,this._invalidateArray(e);return}if(!f(r))throw new TypeError(`[Raph] New selector target at "${i}" must be an object.`);if(Object.hasOwn(r,t.key)&&!Object.is(r[t.key],t.value))throw new TypeError(`[Raph] Selector target at "${i}" has a conflicting key.`);const n=this._findSelector(e,t.key,t.value);if(n===-1&&!this._options.autoCreate)throw _(i);const a=Object.hasOwn(r,t.key)?r:{...r,[t.key]:t.value};n===-1?e.push(a):e[n]=a,this._invalidateArray(e)}_invalidateArray(e){var t;(t=this._indexes)==null||t.delete(e)}_invalidateIndexKey(e,t){var i;const r=(i=this._indexes)==null?void 0:i.get(e);r!==void 0&&(r.delete(t),r.size===0&&this._indexes.delete(e))}_findSelector(e,t,r){var d;if(!this._options.indexEnabled)return O(e,t,r);const i=(d=this._indexes)==null?void 0:d.get(e);let s=i==null?void 0:i.get(t);s===void 0&&(s=this._createIndex(e,t));const n=s.get(r);if(n!==void 0&&f(e[n])&&Object.is(e[n][t],r))return n;const a=O(e,t,r);return a===-1?s.delete(r):s.set(r,a),a}_createIndex(e,t){const r=this._indexes??(this._indexes=new WeakMap);let i=r.get(e);if(i===void 0&&(i=new Map,r.set(e,i)),this._options.indexStrategy==="eager-all-keys")for(let n=0;n<e.length;n++){const a=e[n];if(f(a))for(const d of Object.keys(a)){const c=a[d];if(!A(c))continue;let l=i.get(d);l===void 0&&(l=new Map,i.set(d,l)),l.has(c)||l.set(c,n)}}let s=i.get(t);if(s!==void 0)return s;s=new Map;for(let n=0;n<e.length;n++){const a=e[n];if(!f(a))continue;const d=a[t];A(d)&&!s.has(d)&&s.set(d,n)}return i.set(t,s),s}}function O(o,e,t){for(let r=0;r<o.length;r++){const i=o[r];if(f(i)&&Object.hasOwn(i,e)&&Object.is(i[e],t))return r}return-1}function v(o){return o.kind==="index"||o.kind==="selector"?[]:p()}function p(){return Object.create(null)}function x(o){if(u(o))return o;throw new TypeError("[Raph] Root value must be an object or array.")}function k(o,e){if(u(o))return o;throw w(e)}function f(o){return typeof o=="object"&&o!==null&&!Array.isArray(o)}function u(o){return Array.isArray(o)||f(o)}function A(o){return o===null||typeof o=="string"||typeof o=="number"||typeof o=="boolean"}function b(o,e,t){if(e==="__proto__"){Object.defineProperty(o,e,{configurable:!0,enumerable:!0,value:t,writable:!0});return}o[e]=t}function w(o){return new TypeError(`[Raph] Cannot traverse non-container data at "${o}".`)}function _(o){return new Error(`[Raph] Cannot create missing container at "${o}" (autoCreate=false).`)}exports.DefaultDataAdapter=g;

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

@@ -0,0 +1,356 @@
+var j = Object.defineProperty;
+var C = (o, e, t) => e in o ? j(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
+var y = (o, e, t) => C(o, typeof e != "symbol" ? e + "" : e, t);
+import { createDataDraft as S } from "./data-draft.js";
+import { parseDataPath as h } from "./data-path.js";
+class A {
+  /**
+   * Создаёт in-memory adapter с заданным начальным root и опциями.
+   */
+  constructor(e = w(), t = {}) {
+    // Хранят root, нормализованные опции и ленивые selector indexes.
+    y(this, "_root");
+    y(this, "_options");
+    y(this, "_indexes");
+    this._root = _(e), this._options = {
+      arrayDelete: t.arrayDelete ?? "unset",
+      autoCreate: t.autoCreate ?? !0,
+      indexEnabled: t.indexEnabled ?? !0,
+      indexStrategy: t.indexStrategy ?? "eager-all-keys"
+    };
+  }
+  /**
+   * Возвращает текущий корневой объект adapter.
+   */
+  root() {
+    return this._root;
+  }
+  /**
+   * Создаёт изолированную copy-on-write проекцию для синхронной проверки mutation.
+   */
+  fork() {
+    const e = new A({}, this._options);
+    return e._root = S(this._root, (t) => {
+      var r;
+      return (r = e._indexes) == null ? void 0 : r.delete(t);
+    }).root, e;
+  }
+  /**
+   * Заменяет корневой объект без path-level публикации.
+   */
+  replaceRoot(e) {
+    this._root = _(e), this._indexes = void 0;
+  }
+  /**
+   * Обновляет изменяемые опции adapter и сбрасывает построенные indexes.
+   */
+  options(e) {
+    e.arrayDelete !== void 0 && (this._options.arrayDelete = e.arrayDelete), e.autoCreate !== void 0 && (this._options.autoCreate = e.autoCreate), e.indexEnabled !== void 0 && (this._options.indexEnabled = e.indexEnabled), e.indexStrategy !== void 0 && (this._options.indexStrategy = e.indexStrategy), this._indexes = void 0;
+  }
+  /**
+   * Возвращает значение по пути без создания отсутствующих данных.
+   */
+  get(e, t) {
+    return this._read(h(e, t)).value;
+  }
+  /**
+   * Проверяет наличие значения по указанному пути.
+   */
+  has(e, t) {
+    return this._read(h(e, t)).exists;
+  }
+  /**
+   * Записывает значение по пути и обновляет затронутые selector indexes.
+   */
+  set(e, t, r) {
+    const i = h(e, r);
+    if (i.segments.length === 0) {
+      this.replaceRoot(_(t));
+      return;
+    }
+    let s = this._root, n;
+    for (let d = 0; d < i.segments.length - 1; d++) {
+      const a = i.segments[d], c = i.segments[d + 1], l = this._readOrCreateChild(s, a, c, i.canonical);
+      s = l.value, n = l.indexedParent;
+    }
+    this._writeSegment(
+      s,
+      i.segments[i.segments.length - 1],
+      t,
+      i.canonical,
+      n
+    );
+  }
+  /**
+   * Объединяет object value либо заменяет значение по пути.
+   */
+  merge(e, t, r) {
+    const i = this.get(e, r);
+    if (f(i) && f(t)) {
+      for (const s of Object.keys(t))
+        b(i, s, t[s]);
+      this._indexes = void 0;
+      return;
+    }
+    this.set(e, t, r);
+  }
+  /**
+   * Удаляет значение согласно arrayDelete policy adapter.
+   */
+  delete(e, t) {
+    const r = h(e, t);
+    if (r.segments.length === 0) {
+      this._root = w(), this._indexes = void 0;
+      return;
+    }
+    let i = this._root;
+    for (let n = 0; n < r.segments.length - 1; n++) {
+      if (!u(i))
+        return;
+      i = this._readSegment(i, r.segments[n]);
+    }
+    if (!u(i))
+      return;
+    const s = r.segments[r.segments.length - 1];
+    if (s.kind === "key")
+      delete i[s.key];
+    else if (s.kind === "index") {
+      if (!Array.isArray(i))
+        return;
+      this._options.arrayDelete === "splice" ? i.splice(s.index, 1) : delete i[s.index];
+    } else {
+      if (!Array.isArray(i))
+        return;
+      const n = this._findSelector(i, s.key, s.value);
+      if (n === -1)
+        return;
+      this._options.arrayDelete === "splice" ? i.splice(n, 1) : delete i[n];
+    }
+    this._indexes = void 0;
+  }
+  /**
+   * Находит индекс элемента массива по selector-сегменту.
+   */
+  indexOf(e, t) {
+    const r = h(e, t);
+    let i = this._root;
+    for (let s = 0; s < r.segments.length; s++) {
+      const n = r.segments[s], d = s === r.segments.length - 1;
+      if (n.kind === "key") {
+        if (!u(i) || !Object.hasOwn(i, n.key))
+          return -1;
+        i = i[n.key];
+        continue;
+      }
+      if (!Array.isArray(i))
+        return -1;
+      if (n.kind === "index") {
+        if (!Object.hasOwn(i, n.index))
+          return -1;
+        if (d)
+          return n.index;
+        i = i[n.index];
+        continue;
+      }
+      const a = this._findSelector(i, n.key, n.value);
+      if (a === -1)
+        return -1;
+      if (d)
+        return a;
+      i = i[a];
+    }
+    return -1;
+  }
+  _read(e) {
+    let t = this._root;
+    for (const r of e.segments)
+      if (r.kind === "key") {
+        if (!u(t) || !Object.hasOwn(t, r.key))
+          return { exists: !1, value: void 0 };
+        t = t[r.key];
+      } else if (r.kind === "index") {
+        if (!Array.isArray(t) || !Object.hasOwn(t, r.index))
+          return { exists: !1, value: void 0 };
+        t = t[r.index];
+      } else {
+        if (!Array.isArray(t))
+          return { exists: !1, value: void 0 };
+        const i = this._findSelector(t, r.key, r.value);
+        if (i === -1)
+          return { exists: !1, value: void 0 };
+        t = t[i];
+      }
+    return { exists: !0, value: t };
+  }
+  _readSegment(e, t) {
+    if (t.kind === "key")
+      return Object.hasOwn(e, t.key) ? e[t.key] : void 0;
+    if (!Array.isArray(e))
+      return;
+    if (t.kind === "index")
+      return e[t.index];
+    const r = this._findSelector(e, t.key, t.value);
+    return r === -1 ? void 0 : e[r];
+  }
+  _readOrCreateChild(e, t, r, i) {
+    if (t.kind === "key") {
+      let n = e[t.key];
+      if (!Object.hasOwn(e, t.key) || n === void 0) {
+        if (!this._options.autoCreate)
+          throw x(i);
+        n = g(r), b(e, t.key, n);
+      }
+      return { value: k(n, i) };
+    }
+    if (!Array.isArray(e))
+      throw O(i);
+    if (t.kind === "index") {
+      let n = e[t.index];
+      if (!Object.hasOwn(e, t.index) || n === void 0) {
+        if (!this._options.autoCreate)
+          throw x(i);
+        n = g(r), e[t.index] = n;
+      }
+      return {
+        value: k(n, i),
+        indexedParent: { array: e, index: t.index }
+      };
+    }
+    let s = this._findSelector(e, t.key, t.value);
+    if (s === -1) {
+      if (!this._options.autoCreate)
+        throw x(i);
+      const n = /* @__PURE__ */ Object.create(null);
+      n[t.key] = t.value, e.push(n), s = e.length - 1, this._invalidateArray(e);
+    }
+    return {
+      value: k(e[s], i),
+      indexedParent: { array: e, index: s }
+    };
+  }
+  _writeSegment(e, t, r, i, s) {
+    if (t.kind === "key") {
+      b(e, t.key, r), s !== void 0 && s.array[s.index] === e && this._invalidateIndexKey(s.array, t.key);
+      return;
+    }
+    if (!Array.isArray(e))
+      throw O(i);
+    if (t.kind === "index") {
+      e[t.index] = r, this._invalidateArray(e);
+      return;
+    }
+    if (!f(r))
+      throw new TypeError(`[Raph] New selector target at "${i}" must be an object.`);
+    if (Object.hasOwn(r, t.key) && !Object.is(r[t.key], t.value))
+      throw new TypeError(`[Raph] Selector target at "${i}" has a conflicting key.`);
+    const n = this._findSelector(e, t.key, t.value);
+    if (n === -1 && !this._options.autoCreate)
+      throw x(i);
+    const d = Object.hasOwn(r, t.key) ? r : { ...r, [t.key]: t.value };
+    n === -1 ? e.push(d) : e[n] = d, this._invalidateArray(e);
+  }
+  _invalidateArray(e) {
+    var t;
+    (t = this._indexes) == null || t.delete(e);
+  }
+  _invalidateIndexKey(e, t) {
+    var i;
+    const r = (i = this._indexes) == null ? void 0 : i.get(e);
+    r !== void 0 && (r.delete(t), r.size === 0 && this._indexes.delete(e));
+  }
+  _findSelector(e, t, r) {
+    var a;
+    if (!this._options.indexEnabled)
+      return p(e, t, r);
+    const i = (a = this._indexes) == null ? void 0 : a.get(e);
+    let s = i == null ? void 0 : i.get(t);
+    s === void 0 && (s = this._createIndex(e, t));
+    const n = s.get(r);
+    if (n !== void 0 && f(e[n]) && Object.is(e[n][t], r))
+      return n;
+    const d = p(e, t, r);
+    return d === -1 ? s.delete(r) : s.set(r, d), d;
+  }
+  _createIndex(e, t) {
+    const r = this._indexes ?? (this._indexes = /* @__PURE__ */ new WeakMap());
+    let i = r.get(e);
+    if (i === void 0 && (i = /* @__PURE__ */ new Map(), r.set(e, i)), this._options.indexStrategy === "eager-all-keys")
+      for (let n = 0; n < e.length; n++) {
+        const d = e[n];
+        if (f(d))
+          for (const a of Object.keys(d)) {
+            const c = d[a];
+            if (!v(c))
+              continue;
+            let l = i.get(a);
+            l === void 0 && (l = /* @__PURE__ */ new Map(), i.set(a, l)), l.has(c) || l.set(c, n);
+          }
+      }
+    let s = i.get(t);
+    if (s !== void 0)
+      return s;
+    s = /* @__PURE__ */ new Map();
+    for (let n = 0; n < e.length; n++) {
+      const d = e[n];
+      if (!f(d))
+        continue;
+      const a = d[t];
+      v(a) && !s.has(a) && s.set(a, n);
+    }
+    return i.set(t, s), s;
+  }
+}
+function p(o, e, t) {
+  for (let r = 0; r < o.length; r++) {
+    const i = o[r];
+    if (f(i) && Object.hasOwn(i, e) && Object.is(i[e], t))
+      return r;
+  }
+  return -1;
+}
+function g(o) {
+  return o.kind === "index" || o.kind === "selector" ? [] : w();
+}
+function w() {
+  return /* @__PURE__ */ Object.create(null);
+}
+function _(o) {
+  if (u(o))
+    return o;
+  throw new TypeError("[Raph] Root value must be an object or array.");
+}
+function k(o, e) {
+  if (u(o))
+    return o;
+  throw O(e);
+}
+function f(o) {
+  return typeof o == "object" && o !== null && !Array.isArray(o);
+}
+function u(o) {
+  return Array.isArray(o) || f(o);
+}
+function v(o) {
+  return o === null || typeof o == "string" || typeof o == "number" || typeof o == "boolean";
+}
+function b(o, e, t) {
+  if (e === "__proto__") {
+    Object.defineProperty(o, e, {
+      configurable: !0,
+      enumerable: !0,
+      value: t,
+      writable: !0
+    });
+    return;
+  }
+  o[e] = t;
+}
+function O(o) {
+  return new TypeError(`[Raph] Cannot traverse non-container data at "${o}".`);
+}
+function x(o) {
+  return new Error(`[Raph] Cannot create missing container at "${o}" (autoCreate=false).`);
+}
+export {
+  A as DefaultDataAdapter
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function y(S,x){const m=new WeakMap,v=new WeakMap,b=(n,u,s=new Set)=>{if(!s.has(n)){s.add(n),n.changed.add(u),Array.isArray(n.source)&&x(n.proxy);for(const[c,l]of n.parents)for(const r of l)b(c,r,s)}},w=(n,u,s)=>{if(!n||typeof n!="object")return n;const c=Object.getPrototypeOf(n);let l=v.get(n)??m.get(n);if(!l){const r=n,g=Array.isArray(r),d=g?[]:Object.create(c);g&&(d.length=r.length),l={source:r,proxy:null,values:new Map,removed:new Set,changed:new Set,parents:new Map};const t=l,O=a=>!t.removed.has(a)&&(t.values.has(a)||Reflect.has(r,a)),i=a=>t.removed.has(a)?void 0:t.values.has(a)?t.values.get(a):Reflect.get(r,a);t.proxy=new Proxy(d,{get:(a,e)=>w(i(e),t,e),has:(a,e)=>O(e),set:(a,e,f)=>{if(g&&e==="length"){const o=Number(f);if(!Number.isInteger(o)||o<0||o>4294967295)throw new RangeError("Invalid array length");for(let h=o;h<Number(i("length"));h++)t.removed.add(String(h)),t.values.delete(String(h));d.length=o}else if(g&&typeof e=="string"&&/^(?:0|[1-9]\d*)$/.test(e)){const o=Number(e);o<4294967295&&o>=Number(i("length"))&&(t.values.set("length",o+1),d.length=o+1)}return t.values.set(e,f),t.removed.delete(e),b(t,e),!0},deleteProperty:(a,e)=>g&&e==="length"?!1:(t.values.delete(e),t.removed.add(e),b(t,e),!0),ownKeys:()=>[...new Set([...Reflect.ownKeys(r),...t.values.keys()])].filter(a=>!t.removed.has(a)),getOwnPropertyDescriptor:(a,e)=>{if(g&&e==="length")return{value:i(e),writable:!0,enumerable:!1,configurable:!1};const f=Object.getOwnPropertyDescriptor(r,e);if(!(t.removed.has(e)||!f&&!t.values.has(e)))return{value:w(i(e),t,e),writable:!0,enumerable:(f==null?void 0:f.enumerable)??!0,configurable:!0}}}),m.set(r,t),v.set(t.proxy,t)}if(u&&s!==void 0){let r=l.parents.get(u);r||(r=new Set,l.parents.set(u,r)),r.add(s)}return l.proxy};return{root:w(S),unchangedArray(n,u){const s=v.get(n);if(!s)return null;for(const c of s.changed){if(s.values.has(c)||s.removed.has(c))return null;const l=m.get(s.source[c]);if(l!=null&&l.changed.has(u))return null}return s.source}}}exports.createDataDraft=y;

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

@@ -0,0 +1,71 @@
+function k(x, S) {
+  const m = /* @__PURE__ */ new WeakMap(), v = /* @__PURE__ */ new WeakMap(), w = (n, u, a = /* @__PURE__ */ new Set()) => {
+    if (!a.has(n)) {
+      a.add(n), n.changed.add(u), Array.isArray(n.source) && S(n.proxy);
+      for (const [c, l] of n.parents)
+        for (const r of l)
+          w(c, r, a);
+    }
+  }, b = (n, u, a) => {
+    if (!n || typeof n != "object")
+      return n;
+    const c = Object.getPrototypeOf(n);
+    let l = v.get(n) ?? m.get(n);
+    if (!l) {
+      const r = n, g = Array.isArray(r), i = g ? [] : Object.create(c);
+      g && (i.length = r.length), l = { source: r, proxy: null, values: /* @__PURE__ */ new Map(), removed: /* @__PURE__ */ new Set(), changed: /* @__PURE__ */ new Set(), parents: /* @__PURE__ */ new Map() };
+      const t = l, O = (s) => !t.removed.has(s) && (t.values.has(s) || Reflect.has(r, s)), d = (s) => t.removed.has(s) ? void 0 : t.values.has(s) ? t.values.get(s) : Reflect.get(r, s);
+      t.proxy = new Proxy(i, {
+        get: (s, e) => b(d(e), t, e),
+        has: (s, e) => O(e),
+        set: (s, e, f) => {
+          if (g && e === "length") {
+            const o = Number(f);
+            if (!Number.isInteger(o) || o < 0 || o > 4294967295)
+              throw new RangeError("Invalid array length");
+            for (let h = o; h < Number(d("length")); h++)
+              t.removed.add(String(h)), t.values.delete(String(h));
+            i.length = o;
+          } else if (g && typeof e == "string" && /^(?:0|[1-9]\d*)$/.test(e)) {
+            const o = Number(e);
+            o < 4294967295 && o >= Number(d("length")) && (t.values.set("length", o + 1), i.length = o + 1);
+          }
+          return t.values.set(e, f), t.removed.delete(e), w(t, e), !0;
+        },
+        deleteProperty: (s, e) => g && e === "length" ? !1 : (t.values.delete(e), t.removed.add(e), w(t, e), !0),
+        ownKeys: () => [.../* @__PURE__ */ new Set([...Reflect.ownKeys(r), ...t.values.keys()])].filter((s) => !t.removed.has(s)),
+        getOwnPropertyDescriptor: (s, e) => {
+          if (g && e === "length")
+            return { value: d(e), writable: !0, enumerable: !1, configurable: !1 };
+          const f = Object.getOwnPropertyDescriptor(r, e);
+          if (!(t.removed.has(e) || !f && !t.values.has(e)))
+            return { value: b(d(e), t, e), writable: !0, enumerable: (f == null ? void 0 : f.enumerable) ?? !0, configurable: !0 };
+        }
+      }), m.set(r, t), v.set(t.proxy, t);
+    }
+    if (u && a !== void 0) {
+      let r = l.parents.get(u);
+      r || (r = /* @__PURE__ */ new Set(), l.parents.set(u, r)), r.add(a);
+    }
+    return l.proxy;
+  };
+  return {
+    root: b(x),
+    unchangedArray(n, u) {
+      const a = v.get(n);
+      if (!a)
+        return null;
+      for (const c of a.changed) {
+        if (a.values.has(c) || a.removed.has(c))
+          return null;
+        const l = m.get(a.source[c]);
+        if (l != null && l.changed.has(u))
+          return null;
+      }
+      return a.source;
+    }
+  };
+}
+export {
+  k as createDataDraft
+};

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

@@ -0,0 +1 @@
+"use strict";var E=Object.defineProperty;var M=(t,e,n)=>e in t?E(t,e,{enumerable:!0,configurable:!0,writable:!0,value:n}):t[e]=n;var o=(t,e,n)=>M(t,typeof e!="symbol"?e+"":e,n);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=2e4;let m,w;const h=class h{constructor(e,n){o(this,"_canonical");o(this,"_segments");o(this,"_exact");o(this,"_mask");this._canonical=e,this._segments=Object.freeze(n.map(r=>Object.freeze({...r})))}static from(e,n){return e instanceof h?e:typeof e=="string"?this.fromString(e,n):this.fromPlain(e)}static fromString(e,n){const r=p(e,n==null?void 0:n.vars,!0,(n==null?void 0:n.wildcardDynamic)===!0,!0),i=this._cache??(this._cache=new Map),s=i.get(r.canonical);if(s!==void 0)return s;i.size>=y&&i.clear();const c=new h(r.canonical,r.segments);return i.set(r.canonical,c),c}static fromPlain(e){const r=(Array.isArray(e.segs)?e.segs:[]).map(F);return new h(k(r),r)}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:S(this._segments)}}toStringPath(){return this._canonical}toString(){return this._canonical}segments(){return this._segments}static match(e,n){const r=this.from(e)._segments,i=this.from(n)._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||!W(c,a))return!1}return s===i.length}_asExact(){for(const e of this._segments)if(e.kind==="wildcard")throw $(this._canonical);return this._exact??(this._exact={canonical:this._canonical,segments:this._segments})}_asMask(){for(let n=0;n<this._segments.length-1;n++){const r=this._segments[n];if(r.kind==="wildcard"&&!r.indexed)throw new TypeError(`[Raph] Dot wildcard must be the final mask segment: "${this._canonical}".`)}const e=S(this._segments);return this._mask??(this._mask={canonical:this._canonical,deep:e,segments:e?this._segments.slice(0,-1):this._segments})}};o(h,"_cache");let d=h;function T(t,e){if(!(e!=null&&e.vars)){const i=m==null?void 0:m.get(t);if(i!==void 0)return i}if(typeof t!="string")return O(t,e);const n=p(t,e==null?void 0:e.vars,!1,!1,!0),r={canonical:n.canonical,segments:n.segments};if(!(e!=null&&e.vars)){const i=m??(m=new Map);i.size>=y&&i.clear(),i.set(t,r)}return r}function R(t){const e=w==null?void 0:w.get(t);if(e!==void 0)return e;if(typeof t!="string")return N(t);const n=p(t,void 0,!0,!1,!0);for(let a=0;a<n.segments.length-1;a++){const l=n.segments[a];if(l.kind==="wildcard"&&!l.indexed)throw new TypeError(`[Raph] Dot wildcard must be the final mask segment: "${t}".`)}const r=n.segments[n.segments.length-1],i=(r==null?void 0:r.kind)==="wildcard"&&!r.indexed,s={canonical:n.canonical,deep:i,segments:i?n.segments.slice(0,-1):n.segments},c=w??(w=new Map);return c.size>=y&&c.clear(),c.set(t,s),s}function O(t,e){const n=d.from(t,e)._asExact();if(t instanceof d&&!(e!=null&&e.vars)){const r=m??(m=new Map);r.size>=y&&r.clear(),r.set(t,n)}return n}function N(t){const e=d.from(t)._asMask();if(t instanceof d){const n=w??(w=new Map);n.size>=y&&n.clear(),n.set(t,e)}return e}function j(t){if(t.segments.length===0)return["*"];const e=[`${t.canonical}.*`];for(let n=1;n<t.segments.length;n++)e.push(k(t.segments.slice(0,n)));return e}function p(t,e,n,r=!1,i=!1){const s=t.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 _=s[a];if(_==="."){if(l)throw f(t);l=!0,a++;continue}if(_==="["){const v=A(s,a);c.push(z(s.slice(a+1,v),e,n,r)),a=v+1,l=!1;continue}if(!l)throw f(t);let u=a;for(;u<s.length&&s[u]!=="."&&s[u]!=="[";)u++;const g=s.slice(a,u).trim();if(g.length===0)throw f(t);if(g==="*"){if(!n)throw $(t);c.push({kind:"wildcard",indexed:!1})}else r&&g.startsWith("$")&&!x(g.slice(1),e)?c.push({kind:"wildcard",indexed:!1}):c.push({kind:"key",key:V(g,e)});a=u,l=!1}if(l||c.length===0)throw f(t);return{canonical:k(c),segments:c}}function A(t,e){let n,r=1;for(let i=e+1;i<t.length;i++){const s=t[i];if(s==="\\"){i++;continue}if(n!==void 0){s===n&&(n=void 0);continue}if(s==='"'||s==="'"){n=s;continue}if(s==="["){r++;continue}if(s==="]"&&--r===0)return i}throw f(t)}function z(t,e,n,r){const i=t.trim();if(i==="*"){if(!n)throw $(`[${t}]`);return{kind:"wildcard",indexed:!0}}if(/^\d+$/.test(i))return{kind:"index",index:Number(i)};if(/^\$[A-Z_$][\w$]*$/i.test(i)){if(r&&!x(i.slice(1),e))return{kind:"wildcard",indexed:!0};const l=b(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=D(i);if(s===-1)throw f(`[${t}]`);const c=i.slice(0,s).trim(),a=i.slice(s+1).trim();if(!c||!a)throw f(`[${t}]`);return r&&Z(a,e)?{kind:"wildcard",indexed:!0}:{kind:"selector",key:c,value:I(a,e)}}function D(t){let e;for(let n=0;n<t.length;n++){const r=t[n];if(r==="\\"){n++;continue}if(e!==void 0){r===e&&(e=void 0);continue}if(r==='"'||r==="'")e=r;else if(r==="=")return n}return-1}function I(t,e){if(/^\$[A-Z_$][\w$]*$/i.test(t)){const n=b(t.slice(1),e);if(n===null||typeof n=="string"||typeof n=="boolean"||typeof n=="number"&&Number.isFinite(n))return n;throw new TypeError(`[Raph] Selector variable "${t}" must be scalar.`)}if(t[0]==='"'||t[0]==="'")return q(t);if(/^-?(?:\d+(?:\.\d*)?|\.\d+)$/.test(t)){const n=Number(t);if(Number.isFinite(n))return n}return t==="true"?!0:t==="false"?!1:t==="null"?null:t}function q(t){const e=t[0];if(t.length<2||t[t.length-1]!==e)throw f(t);if(e==='"')try{const r=JSON.parse(t);if(typeof r=="string")return r}catch{throw f(t)}let n="";for(let r=1;r<t.length-1;r++){const i=t[r];if(i==="\\"){if(r++,r>=t.length-1)throw f(t);n+=t[r]}else n+=i}return n}function V(t,e){if(!t.startsWith("$"))return t;const n=b(t.slice(1),e);if(typeof n!="string"&&typeof n!="number")throw new TypeError(`[Raph] Key variable "${t}" must be a string or number.`);const r=String(n);if(!r||r.includes(".")||r.includes("[")||r.includes("]"))throw new TypeError(`[Raph] Key variable "${t}" contains path syntax.`);return r}function b(t,e){if(!x(t,e))throw new TypeError(`[Raph] Missing path variable "${t}".`);return e[t]}function x(t,e){return e!==void 0&&Object.hasOwn(e,t)}function Z(t,e){for(const n of t.matchAll(/\$([A-Z_$][\w$]*)/gi))if(!x(n[1],e))return!0;return!1}function F(t){if(typeof t!="object"||t===null)throw P();const e=t;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"&&K(e.pv))return{kind:"selector",key:e.pk,value:e.pv};throw P()}function K(t){return t===null||typeof t=="string"||typeof t=="boolean"||typeof t=="number"&&Number.isFinite(t)}function S(t){const e=t[t.length-1];return(e==null?void 0:e.kind)==="wildcard"&&!e.indexed}function W(t,e){return t.kind==="wildcard"?!t.indexed||e.kind==="index"||e.kind==="selector":t.kind!==e.kind?!1:t.kind==="key"?t.key===e.key:t.kind==="index"?t.index===e.index:t.key===e.key&&Object.is(t.value,e.value)}function k(t){let e="";for(const n of t)n.kind==="key"?e+=e?`.${n.key}`:n.key:n.kind==="index"?e+=`[${n.index}]`:n.kind==="selector"?e+=`[${n.key}=${B(n.value)}]`:e+=n.indexed?"[*]":e?".*":"*";return e}function B(t){return typeof t=="string"?JSON.stringify(t):String(t)}function f(t){return new TypeError(`[Raph] Invalid data path "${t}".`)}function P(){return new TypeError("[Raph] Invalid plain DataPath representation.")}function $(t){return new TypeError(`[Raph] Wildcard is only allowed in watch masks: "${t}".`)}exports.DataPath=d;exports.parseDataPath=T;exports.parsePathMask=R;exports.pathRelationMasks=j;