@raphy-js/raph 1.0.0-dev.18

package/dist/debug/path/storage/DefaultDataAdapter.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 { parseDataPath as h } from "../data-path.utils.js";
+import { createDataDraft as S } from "./createDataDraft.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/storage/PathEventHub.cjs

@@ -0,0 +1 @@
+"use strict";var _=Object.defineProperty;var f=(n,t,e)=>t in n?_(n,t,{enumerable:!0,configurable:!0,writable:!0,value:e}):n[t]=e;var c=(n,t,e)=>f(n,typeof t!="symbol"?t+"":t,e);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("../data-path.utils.cjs"),g=require("../PathRouter.cjs");class b{constructor(t){c(this,"_router");c(this,"_events");c(this,"_batchDepth",0);c(this,"_watcherCount",0);c(this,"_publishing",!1);this._batchErrorMessage=t}get hasWatchers(){return this._watcherCount!==0}get events(){return this._events}get router(){return this._router}get watcherCount(){return this._watcherCount}record(t){this._watcherCount!==0&&((this._events??(this._events=[])).push(t),this._batchDepth===0&&!this._publishing&&this._publish())}batch(t){var o;let e=!1,a,i=!1,h,s;this._batchDepth++;try{s=t()}catch(r){e=!0,a=r}finally{if(this._batchDepth--,this._batchDepth===0&&((o=this._events)!=null&&o.length))try{this._publish()}catch(r){i=!0,h=r}}if(e&&i)throw new AggregateError([a,h],this._batchErrorMessage);if(e)throw a;if(i)throw h;return s}watch(t,e){const a=Array.isArray(t)?t:[t];if(a.length===0)throw new TypeError("[Raph] Path watch requires at least one mask.");const i=new Map;for(const r of a){const u=p.parsePathMask(r);i.set(u.canonical,u)}const h={active:!0,callback:e},s=this._router??(this._router=new g.PathRouter),o=[...i.values()].map(r=>s.add(r,h));return this._watcherCount++,v(()=>{h.active=!1,h.callback=void 0;for(const r of o)r();this._watcherCount--,this._watcherCount===0&&(this._router=void 0)})}_publish(){const t=this._events;if(t===void 0||t.length===0||this._publishing)return;const e=[];this._publishing=!0;try{for(;t.length!==0;){const a=t.splice(0),i=this._router;if(i===void 0)continue;const h=new Map;for(const s of a){const o=p.parseDataPath(s.path),r=o.segments.length===0?i.matchAll():i.match(o.segments);for(const u of r){const l=h.get(u);l===void 0?h.set(u,[s]):l.push(s)}}for(const[s,o]of h)if(!(!s.active||s.callback===void 0))try{s.callback({events:o})}catch(r){e.push(r)}}}finally{this._publishing=!1}if(e.length===1)throw e[0];if(e.length>1)throw new AggregateError(e,"[Raph] Multiple path watchers failed.")}}function v(n){let t=n;return()=>{const e=t;t=void 0,e==null||e()}}exports.PathEventHub=b;

package/dist/debug/path/storage/PathEventHub.js

@@ -0,0 +1,148 @@
+var p = Object.defineProperty;
+var f = (n, t, e) => t in n ? p(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;
+var c = (n, t, e) => f(n, typeof t != "symbol" ? t + "" : t, e);
+import { parsePathMask as _, parseDataPath as g } from "../data-path.utils.js";
+import { PathRouter as b } from "../PathRouter.js";
+class y {
+  /**
+   * Создаёт общий batch и publication boundary для path store.
+   */
+  constructor(t) {
+    // Хранят ленивый routing и текущий batch path events.
+    c(this, "_router");
+    c(this, "_events");
+    // Защищают границы batch, reentrant publication и snapshot requirements.
+    c(this, "_batchDepth", 0);
+    c(this, "_watcherCount", 0);
+    c(this, "_publishing", !1);
+    this._batchErrorMessage = t;
+  }
+  /**
+   * Показывает, есть ли watchers, ради которых нужно сохранять значения событий.
+   */
+  get hasWatchers() {
+    return this._watcherCount !== 0;
+  }
+  /**
+   * Возвращает накопленные события текущей batch.
+   * @internal
+   */
+  get events() {
+    return this._events;
+  }
+  /**
+   * Возвращает внутренний path router для диагностики store.
+   * @internal
+   */
+  get router() {
+    return this._router;
+  }
+  /**
+   * Возвращает число активных watchers.
+   * @internal
+   */
+  get watcherCount() {
+    return this._watcherCount;
+  }
+  /**
+   * Добавляет событие в текущую batch либо публикует его сразу.
+   */
+  record(t) {
+    this._watcherCount !== 0 && ((this._events ?? (this._events = [])).push(t), this._batchDepth === 0 && !this._publishing && this._publish());
+  }
+  /**
+   * Выполняет операцию в общей синхронной batch boundary.
+   */
+  batch(t) {
+    var h;
+    let e = !1, a, o = !1, i, s;
+    this._batchDepth++;
+    try {
+      s = t();
+    } catch (r) {
+      e = !0, a = r;
+    } finally {
+      if (this._batchDepth--, this._batchDepth === 0 && ((h = this._events) != null && h.length))
+        try {
+          this._publish();
+        } catch (r) {
+          o = !0, i = r;
+        }
+    }
+    if (e && o)
+      throw new AggregateError(
+        [a, i],
+        this._batchErrorMessage
+      );
+    if (e)
+      throw a;
+    if (o)
+      throw i;
+    return s;
+  }
+  /**
+   * Подписывает callback на подходящие изменения и возвращает disposer.
+   */
+  watch(t, e) {
+    const a = Array.isArray(t) ? t : [t];
+    if (a.length === 0)
+      throw new TypeError("[Raph] Path watch requires at least one mask.");
+    const o = /* @__PURE__ */ new Map();
+    for (const r of a) {
+      const u = _(r);
+      o.set(u.canonical, u);
+    }
+    const i = { active: !0, callback: e }, s = this._router ?? (this._router = new b()), h = [...o.values()].map((r) => s.add(r, i));
+    return this._watcherCount++, v(() => {
+      i.active = !1, i.callback = void 0;
+      for (const r of h)
+        r();
+      this._watcherCount--, this._watcherCount === 0 && (this._router = void 0);
+    });
+  }
+  _publish() {
+    const t = this._events;
+    if (t === void 0 || t.length === 0 || this._publishing)
+      return;
+    const e = [];
+    this._publishing = !0;
+    try {
+      for (; t.length !== 0; ) {
+        const a = t.splice(0), o = this._router;
+        if (o === void 0)
+          continue;
+        const i = /* @__PURE__ */ new Map();
+        for (const s of a) {
+          const h = g(s.path), r = h.segments.length === 0 ? o.matchAll() : o.match(h.segments);
+          for (const u of r) {
+            const l = i.get(u);
+            l === void 0 ? i.set(u, [s]) : l.push(s);
+          }
+        }
+        for (const [s, h] of i)
+          if (!(!s.active || s.callback === void 0))
+            try {
+              s.callback({ events: h });
+            } catch (r) {
+              e.push(r);
+            }
+      }
+    } finally {
+      this._publishing = !1;
+    }
+    if (e.length === 1)
+      throw e[0];
+    if (e.length > 1)
+      throw new AggregateError(e, "[Raph] Multiple path watchers failed.");
+  }
+}
+function v(n) {
+  let t = n;
+  return () => {
+    const e = t;
+    t = void 0, e == null || e();
+  };
+}
+export {
+  y as PathEventHub
+};

package/dist/debug/path/storage/PathStore.cjs

@@ -0,0 +1 @@
+"use strict";var R=Object.defineProperty;var P=(r,e,t)=>e in r?R(r,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):r[e]=t;var v=(r,e,t)=>P(r,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../data-path.utils.cjs"),H=require("./PathEventHub.cjs"),u=new WeakMap;class m{constructor(){v(this,"_root");v(this,"_eventHub",new H.PathEventHub("[Raph] Path batch and publication failed."))}get _router(){return this._eventHub.router}get _events(){return this._eventHub.events}get _watcherCount(){return this._eventHub.watcherCount}get(e,t){const n=f.parseDataPath(e,t),o=this._root;if(o!==void 0)return h(o,n.segments).value}peek(e,t){return this.get(e,t)}has(e,t){const n=f.parseDataPath(e,t),o=this._root;return o!==void 0&&h(o,n.segments).exists}set(e,t,n){const o=f.parseDataPath(e,n);if(o.segments.length===0){this._setRoot(t);return}const s=this._eventHub.hasWatchers,i=s?h(this._root,o.segments).value:void 0;if(this._root??(this._root=Object.create(null)),w(this._root,o,t),!s)return;const c=h(this._root,o.segments).value;this._eventHub.record({kind:"set",path:o.canonical,previous:i,value:c})}merge(e,t,n){const o=f.parseDataPath(e,n);if(o.segments.length===0){this._mergeRoot(t);return}const s=this._eventHub.hasWatchers,i=h(this._root,o.segments).value,c=s&&a(i)&&a(t)?A(i):i;if(a(i)&&a(t)){p(this._root,o.segments);for(const g of Object.keys(t))l(i,g,t[g])}else this._root??(this._root=Object.create(null)),w(this._root,o,t);if(!s)return;const d=h(this._root,o.segments).value;this._eventHub.record({kind:"merge",path:o.canonical,previous:c,value:d})}delete(e,t){const n=f.parseDataPath(e,t);if(n.segments.length===0){this._deleteRoot();return}const o=h(this._root,n.segments);!o.exists||this._root===void 0||(p(this._root,n.segments),E(this._root,n),this._eventHub.hasWatchers&&this._eventHub.record({kind:"delete",path:n.canonical,previous:o.value,value:void 0}))}batch(e){return this._eventHub.batch(e)}watch(e,t){return this._eventHub.watch(e,t)}_setRoot(e){const t=x(e),n=this._root;this._root=t,this._recordRootEvent("set",n,t)}_mergeRoot(e){const t=this._root,n=this._eventHub.hasWatchers&&a(t)&&a(e)?A(t):t;if(a(t)&&a(e))for(const o of Object.keys(e))l(t,o,e[o]);else this._root=x(e);this._recordRootEvent("merge",n,this._root)}_deleteRoot(){const e=this._root;e!==void 0&&(this._root=D(),this._recordRootEvent("delete",e,void 0))}_recordRootEvent(e,t,n){this._eventHub.record({kind:e,path:"",previous:t,value:n})}}function h(r,e){let t=r;for(const n of e)if(n.kind==="key"){if(!b(t)||!Object.hasOwn(t,n.key))return{exists:!1,value:void 0};t=t[n.key]}else if(n.kind==="index"){if(!Array.isArray(t)||!Object.hasOwn(t,n.index))return{exists:!1,value:void 0};t=t[n.index]}else{if(!Array.isArray(t))return{exists:!1,value:void 0};const o=_(t,n.key,n.value);if(o===-1)return{exists:!1,value:void 0};t=t[o]}return{exists:!0,value:t}}function p(r,e){let t=r;for(const n of e){if(!b(t))return;const o=j(t,n);Array.isArray(t)&&u.delete(t),t=o}}function w(r,e,t){let n=r,o;for(let i=0;i<e.segments.length-1;i++){const c=e.segments[i],d=e.segments[i+1];c.kind==="selector"&&Array.isArray(n)&&(o=n),c.kind==="index"&&Array.isArray(n)&&(o=n),n=C(n,c,d,e.canonical)}const s=e.segments[e.segments.length-1];if(S(n,s,t,e.canonical),s.kind==="key"&&o!==void 0){const i=u.get(o);i==null||i.delete(s.key),(i==null?void 0:i.size)===0&&u.delete(o)}}function E(r,e){let t=r;for(let s=0;s<e.segments.length-1;s++){const i=e.segments[s],c=j(t,i);if(!b(c))return;t=c}const n=e.segments[e.segments.length-1];if(n.kind==="key"){delete t[n.key];return}if(!Array.isArray(t))return;if(n.kind==="index"){u.delete(t),delete t[n.index];return}const o=_(t,n.key,n.value);o!==-1&&(u.delete(t),delete t[o])}function j(r,e){if(e.kind==="key")return Object.hasOwn(r,e.key)?r[e.key]:void 0;if(!Array.isArray(r))return;if(e.kind==="index")return r[e.index];const t=_(r,e.key,e.value);return t===-1?void 0:r[t]}function C(r,e,t,n){if(e.kind==="key"){const s=r;let i=s[e.key];return(!Object.hasOwn(s,e.key)||i===void 0)&&(i=O(t),l(s,e.key,i)),k(i,n)}if(e.kind==="index"){if(!Array.isArray(r))throw y(n);let s=r[e.index];return(!Object.hasOwn(r,e.index)||s===void 0)&&(u.delete(r),s=O(t),r[e.index]=s),k(s,n)}if(!Array.isArray(r))throw y(n);let o=_(r,e.key,e.value);if(o===-1){u.delete(r);const s=Object.create(null);s[e.key]=e.value,r.push(s),o=r.length-1}return k(r[o],n)}function S(r,e,t,n){if(e.kind==="key"){l(r,e.key,t);return}if(e.kind==="index"){if(!Array.isArray(r))throw y(n);u.delete(r),r[e.index]=t;return}if(!Array.isArray(r))throw y(n);const o=_(r,e.key,e.value);if(o!==-1){u.delete(r),r[o]=t;return}if(!a(t))throw new TypeError(`[Raph] New selector target at "${n}" must be an object.`);const s=t[e.key];if(Object.hasOwn(t,e.key)&&!Object.is(s,e.value))throw new TypeError(`[Raph] Selector target at "${n}" has a conflicting key.`);u.delete(r),r.push(Object.hasOwn(t,e.key)?t:{...t,[e.key]:e.value})}function O(r){return r.kind==="index"||r.kind==="selector"?[]:Object.create(null)}function D(){return Object.create(null)}function x(r){if(b(r))return r;throw new TypeError("[Raph] Root value must be an object or array.")}function k(r,e){if(b(r))return r;throw y(e)}function _(r,e,t){let n=u.get(r);const o=n==null?void 0:n.get(e);if(o)return o.get(t)??-1;const s=new Map;for(let i=0;i<r.length;i++){const c=r[i];if(a(c)&&Object.hasOwn(c,e)){const d=c[e];(d===null||typeof d=="string"||typeof d=="number"||typeof d=="boolean")&&!s.has(d)&&s.set(d,i)}}return n||(n=new Map,u.set(r,n)),n.set(e,s),s.get(t)??-1}function l(r,e,t){if(e==="__proto__"){Object.defineProperty(r,e,{configurable:!0,enumerable:!0,value:t,writable:!0});return}r[e]=t}function A(r){const e=Object.create(Object.getPrototypeOf(r));for(const t of Object.keys(r))l(e,t,r[t]);return e}function a(r){return typeof r=="object"&&r!==null&&!Array.isArray(r)}function b(r){return Array.isArray(r)||a(r)}function y(r){return new TypeError(`[Raph] Cannot traverse non-container data at "${r}".`)}exports.PathStore=m;