@raphy-js/raph 1.0.0-dev.18

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

@@ -0,0 +1,326 @@
+var R = Object.defineProperty;
+var m = (r, e, t) => e in r ? R(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t;
+var k = (r, e, t) => m(r, typeof e != "symbol" ? e + "" : e, t);
+import { parseDataPath as h } from "../data-path.utils.js";
+import { PathEventHub as H } from "./PathEventHub.js";
+const u = /* @__PURE__ */ new WeakMap();
+class $ {
+  constructor() {
+    // Владеют path data и независимым event lifecycle этого store.
+    k(this, "_root");
+    k(this, "_eventHub", new H(
+      "[Raph] Path batch and publication failed."
+    ));
+  }
+  /**
+   * Возвращает внутренний router для диагностического контракта Kernel.
+   * @internal
+   */
+  get _router() {
+    return this._eventHub.router;
+  }
+  get _events() {
+    return this._eventHub.events;
+  }
+  get _watcherCount() {
+    return this._eventHub.watcherCount;
+  }
+  /**
+   * Возвращает значение по пути без создания отсутствующих данных.
+   */
+  get(e, t) {
+    const n = h(e, t), o = this._root;
+    if (o !== void 0)
+      return a(o, n.segments).value;
+  }
+  /**
+   * Читает значение по пути без регистрации реактивной зависимости.
+   */
+  peek(e, t) {
+    return this.get(e, t);
+  }
+  /**
+   * Проверяет наличие значения по указанному пути.
+   */
+  has(e, t) {
+    const n = h(e, t), o = this._root;
+    return o !== void 0 && a(o, n.segments).exists;
+  }
+  /**
+   * Записывает значение и публикует соответствующее изменение.
+   */
+  set(e, t, n) {
+    const o = h(e, n);
+    if (o.segments.length === 0) {
+      this._setRoot(t);
+      return;
+    }
+    const s = this._eventHub.hasWatchers, i = s ? a(this._root, o.segments).value : void 0;
+    if (this._root ?? (this._root = /* @__PURE__ */ Object.create(null)), O(this._root, o, t), !s)
+      return;
+    const c = a(this._root, o.segments).value;
+    this._eventHub.record({
+      kind: "set",
+      path: o.canonical,
+      previous: i,
+      value: c
+    });
+  }
+  /**
+   * Объединяет значение по пути и публикует соответствующее изменение.
+   */
+  merge(e, t, n) {
+    const o = h(e, n);
+    if (o.segments.length === 0) {
+      this._mergeRoot(t);
+      return;
+    }
+    const s = this._eventHub.hasWatchers, i = a(this._root, o.segments).value, c = s && d(i) && d(t) ? A(i) : i;
+    if (d(i) && d(t)) {
+      g(this._root, o.segments);
+      for (const w of Object.keys(t))
+        l(i, w, t[w]);
+    } else
+      this._root ?? (this._root = /* @__PURE__ */ Object.create(null)), O(this._root, o, t);
+    if (!s)
+      return;
+    const f = a(this._root, o.segments).value;
+    this._eventHub.record({
+      kind: "merge",
+      path: o.canonical,
+      previous: c,
+      value: f
+    });
+  }
+  /**
+   * Удаляет значение по пути и публикует изменение при наличии данных.
+   */
+  delete(e, t) {
+    const n = h(e, t);
+    if (n.segments.length === 0) {
+      this._deleteRoot();
+      return;
+    }
+    const o = a(this._root, n.segments);
+    !o.exists || this._root === void 0 || (g(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 boundary.
+   */
+  batch(e) {
+    return this._eventHub.batch(e);
+  }
+  /**
+   * Подписывает callback на подходящие изменения и возвращает disposer.
+   */
+  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 && d(t) && d(e) ? A(t) : t;
+    if (d(t) && d(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 = S(), this._recordRootEvent("delete", e, void 0));
+  }
+  _recordRootEvent(e, t, n) {
+    this._eventHub.record({ kind: e, path: "", previous: t, value: n });
+  }
+}
+function a(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 g(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 O(r, e, t) {
+  let n = r, o;
+  for (let i = 0; i < e.segments.length - 1; i++) {
+    const c = e.segments[i], f = e.segments[i + 1];
+    c.kind === "selector" && Array.isArray(n) && (o = n), c.kind === "index" && Array.isArray(n) && (o = n), n = P(n, c, f, e.canonical);
+  }
+  const s = e.segments[e.segments.length - 1];
+  if (C(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 P(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 = p(t), l(s, e.key, i)), v(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 = p(t), r[e.index] = s), v(s, n);
+  }
+  if (!Array.isArray(r))
+    throw y(n);
+  let o = _(r, e.key, e.value);
+  if (o === -1) {
+    u.delete(r);
+    const s = /* @__PURE__ */ Object.create(null);
+    s[e.key] = e.value, r.push(s), o = r.length - 1;
+  }
+  return v(r[o], n);
+}
+function C(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 (!d(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 p(r) {
+  return r.kind === "index" || r.kind === "selector" ? [] : /* @__PURE__ */ Object.create(null);
+}
+function S() {
+  return /* @__PURE__ */ Object.create(null);
+}
+function x(r) {
+  if (b(r))
+    return r;
+  throw new TypeError("[Raph] Root value must be an object or array.");
+}
+function v(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 = /* @__PURE__ */ new Map();
+  for (let i = 0; i < r.length; i++) {
+    const c = r[i];
+    if (d(c) && Object.hasOwn(c, e)) {
+      const f = c[e];
+      (f === null || typeof f == "string" || typeof f == "number" || typeof f == "boolean") && !s.has(f) && s.set(f, i);
+    }
+  }
+  return n || (n = /* @__PURE__ */ 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 d(r) {
+  return typeof r == "object" && r !== null && !Array.isArray(r);
+}
+function b(r) {
+  return Array.isArray(r) || d(r);
+}
+function y(r) {
+  return new TypeError(`[Raph] Cannot traverse non-container data at "${r}".`);
+}
+export {
+  $ as PathStore
+};

package/dist/debug/path/storage/createDataDraft.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/storage/createDataDraft.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/storage/data-adapter.types.cjs

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

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

@@ -0,0 +1 @@
+

package/dist/debug/reactivity/engine.cjs

@@ -0,0 +1 @@
+"use strict";var z=Object.defineProperty;var P=(c,e,t)=>e in c?z(c,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):c[e]=t;var b=(c,e,t)=>P(c,typeof e!="symbol"?e+"":e,t);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./reactive-object.cjs"),R=require("./scope.cjs"),G=require("./watch.cjs"),w=1,p=2,C=4,S=8,W=16,y=32,x=64,O=128,m=256,v=512,E=w|p,_=16,M=2;function U(c){c.dependencyLookupDebt===void 0&&c.dependencyIndex===void 0||(c.dependencyIndex=void 0,c.dependencyLookupDebt=void 0,c.dependencyLookupSearches=void 0)}function Q(c,e){if(e<=_||c.flags&O||c.dependencyIndex!==void 0)return;const t=(c.dependencyLookupSearches??0)+1,i=(c.dependencyLookupDebt??0)+e;if(c.dependencyLookupSearches=t,c.dependencyLookupDebt=i,t<M||i<c.depCount)return;const s=new Map;for(let n=c.firstDep;n!==null;n=n.nextDep)s.set(n.dep,n);c.dependencyIndex=s,c.dependencyLookupDebt=void 0,c.dependencyLookupSearches=void 0}function j(c,e,t){var r;const i=c.firstSub;if(i===null)return;if(i===c.lastSub)return i.sub===e?i:void 0;const s=c.subSearchCursor??i;let n=1;if(s.sub===e)return c.subSearchCursor=s.nextSub??i,s;if(t){const l=(r=e.dependencyIndex)==null?void 0:r.get(c);if(l!==void 0)return c.subSearchCursor=l.nextSub??i,l;if(e.dependencyIndex!==void 0)return}let a=s.nextSub??i;for(;a!==s;){if(++n,a.sub===e)return c.subSearchCursor=a.nextSub??i,t&&Q(e,n),a;a=a.nextSub??i}t&&Q(e,n)}class N{constructor(e={}){b(this,"adaptiveDependencyIndex");b(this,"activeSub",null);b(this,"batchDepth",0);b(this,"effectReadIndex",0);b(this,"effectWriteIndex",0);b(this,"invalidationDepth",0);b(this,"dependencyDepth",0);b(this,"flushingEffects",!1);b(this,"effectQueue",new Array(16).fill(void 0));b(this,"invalidationStack",new Array(512).fill(null));b(this,"dependencyStack",[]);b(this,"handleReaders",this.createHandleReaders());b(this,"effectScheduler");b(this,"flushEffects");b(this,"_effectImmediate");this.adaptiveDependencyIndex=e.adaptiveDependencyIndex??!1,this.effectScheduler=e.effectScheduler,this._effectImmediate=this.effect.bind(this),this.signal=this.signal.bind(this),this.computed=this.computed.bind(this),this.reactive=this.reactive.bind(this),this.watch=this.watch.bind(this),this.batch=this.batch.bind(this),this.untracked=this.untracked.bind(this),this.scope=this.scope.bind(this),this._signalAccess=this._signalAccess.bind(this),this._computedAccess=this._computedAccess.bind(this),this._ownedSignal=this._ownedSignal.bind(this),this._ownedComputed=this._ownedComputed.bind(this),this._isTracking=this._isTracking.bind(this),this._isFlushingEffects=this._isFlushingEffects.bind(this),this._startBatch=this._startBatch.bind(this),this._endBatch=this._endBatch.bind(this),this.effect=this.effectScheduler===void 0?this._effectImmediate:this.createScheduledEffect.bind(this),this.flushEffects=this.effectScheduler===void 0?this.flushSyncEffects:this.flushExternalEffects}signal(e){let t=e,i;const s=()=>{const a=i;if(a!==void 0)return this.readSignalValue(a);const r=this.activeSub;return r===null||(i=this.materializeSignal(t,r)),t},n=a=>{const r=i;if(r!==void 0){this.writeSignalValue(r,a);return}t!==a&&(t=a)};return{get:s,peek:this.handleReaders.peek,set:n}}reactive(e){return B.reactiveObject(this,e,()=>this.createReactivePropertySourceBridge())}computed(e){if(typeof e=="function")return this.createComputedHandle(e);const t=this.createComputedHandle(e.get);return t.set=e.set,t}effect(e,t){const i=this.allocateGraphRecord(void 0,e,p|w|y);t!==void 0&&(i.onStop=t);const s=this.activeSub;s!==null&&s.flags&y&&R.appendScopeChild(s,i);try{this.executeEffect(i)}catch(n){try{this.disposeEffect(i)}catch(a){throw new AggregateError([n,a],"Effect registration and cleanup failed.")}throw n}return this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects(),()=>this.disposeEffect(i)}watch(e,t,i){return G.watchWithReactivity(this.effect,this.untracked,e,t,i)}batch(e){++this.batchDepth;let t;try{t=e()}catch(i){if(!--this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex)try{this.flushEffects()}catch(s){throw new AggregateError([i,s],"Batch operation and effect queue processing failed.")}throw i}return!--this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects(),t}untracked(e){if(this.activeSub===null)return e();const t=this.activeSub;this.activeSub=null;try{return e()}finally{this.activeSub=t}}scope(){return new R.ScopeNode(this)}allocateGraphRecord(e,t,i){return{flags:i,firstSub:null,lastSub:null,firstDep:null,tailDep:null,depCount:0,evaluate:t,cachedValue:e}}createReactivePropertySourceBridge(){return{batch:this.batch,create:()=>{if(this.activeSub===null)throw new Error("[Raph] Reactive property source requires a tracked read.");return{firstSub:null,lastSub:null}},isTracking:this._isTracking,track:e=>{const t=this.activeSub;t!==null&&this.trackDependency(e,t)},trigger:e=>{const t=e.firstSub;t!==null&&(this.propagateInvalidation(t),!this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects())}}}materializeSignal(e,t,i){const s=this.allocateGraphRecord(e,void 0,0);return i!==void 0&&(s.sourceHooks=i,s.flags|=v),t.flags&O?this.appendInitialDependency(s,t):this.trackDependency(s,t),s}createComputedHandle(e,t){const i={evaluate:e,get:this.handleReaders.initializeComputed,peek:this.handleReaders.peek};return t!==void 0&&(i.sourceHooks=t),i}createScheduledEffect(e,t){const i=this.allocateGraphRecord(void 0,e,p|w|y);let s=!1;t!==void 0&&(i.onStop=t);const n=this.activeSub;n!==null&&n.flags&y&&R.appendScopeChild(n,i);const a=()=>{if(!(!(i.flags&x)||i.evaluate===void 0)){i.flags&=~x,s=!0;try{this.executeEffect(i)}catch(r){if(!this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex)try{this.flushEffects()}catch(l){throw new AggregateError([r,l],"Effect execution and queue processing failed.")}throw r}!this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects()}};try{const r=this.effectScheduler.bind(a);r.cancelPending=()=>i.evaluate===void 0||!s?!1:(this.settleCancelledDependencies(i),i.flags&=~(x|E|C),!this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects(),!0),r.rearmPending=()=>{i.evaluate!==void 0&&(i.flags|=p|x,r.schedule())},i.effectTask=r,this.requestEffectTask(i)}catch(r){try{this.disposeEffect(i)}catch(l){throw new AggregateError([r,l],"Effect registration and cleanup failed.")}throw r}return!this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects(),()=>this.disposeEffect(i)}readSignalValue(e){const t=this.activeSub;let i=null;return t!==null&&(i=this.trackDependency(e,t)),e.flags&p&&this.commitSignalValue(e,i),e.cachedValue}writeSignalValue(e,t){if(e.flags&p||this.batchDepth){const s=!!(e.flags&p);if((e.flags&p?e.pendingValue:e.cachedValue)===t)return;if(e.pendingValue=t,e.cachedValue===t)e.flags&=~p,e.pendingAuthor=void 0;else{e.flags|=p;const r=this.activeSub!==null&&this.activeSub.flags&S?this.activeSub:null;s?e.pendingAuthor!==r&&(e.pendingAuthor=null):e.pendingAuthor=r}const a=e.firstSub;a!=null&&(!s||this.activeSub!==null&&this.activeSub.flags&S||e.flags&v)&&this.propagateInvalidation(a,!0);return}if(e.cachedValue===t)return;e.cachedValue=t;const i=e.firstSub;i!=null&&(this.propagateInvalidation(i),!this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects())}readComputedValue(e){const t=e.flags,i=t&(W|E|m),s=i===0?e.cachedValue:i&W?this.evaluateFirstValue(e):this.refreshComputedValue(e,t);if(e.evaluate===void 0)return s;const n=this.activeSub;if(n!==null){const a=n.tailDep;n.flags&O?(a===null||a.dep!==e)&&this.appendInitialDependency(e,n):this.trackDependency(e,n)}return s}evaluateFirstValue(e){const t=e.flags&v,i=e.evaluate;e.flags=t|S|O;const s=this.activeSub;this.activeSub=e;try{const n=i();return e.evaluate!==i?(e.cachedValue=void 0,e.flags=0,n):(e.cachedValue=n,e.flags=t|(e.flags&C?p:0),n)}catch(n){throw e.evaluate!==i?(e.cachedValue=void 0,e.flags=0,n):(e.flags=t|m,s!==null&&this.trackDependency(e,s),n)}finally{this.activeSub=s}}refreshComputedValue(e,t,i=null){try{if(t&(p|C|m))return this.recomputeValue(e,i)||(e.flags&=~E),e.cachedValue;const s=e.firstDep;return(s===null||!this.refreshDependencies(e,s)||!this.recomputeValue(e,i))&&(e.flags&=~E),e.cachedValue}catch(s){throw this.activeSub!==null&&this.trackDependency(e,this.activeSub),s}}commitSignalValue(e,t){const i=e.cachedValue;e.cachedValue=e.pendingValue,e.flags&=~p;const s=e.pendingAuthor;return e.pendingAuthor=void 0,i===e.cachedValue?!1:(e.firstSub!==null&&this.confirmSubUpdates(e.firstSub,t,s??null),!0)}trackDependency(e,t){const i=t.tailDep;if(i!==null){const n=i.nextDep;return n!==null&&n.dep===e?(t.tailDep=n,n):i.dep===e?i:this.reconcileDependency(e,t,i,n)}const s=t.firstDep;return s===null?t.tailDep=this.insertDependency(e,t,null):s.dep===e?(t.tailDep=s,s):this.reconcileDependency(e,t,null,s)}reconcileDependency(e,t,i,s){if(t.depCount<=_){for(let l=s;l!==null;l=l.nextDep)if(l.dep===e)return this.reorderDependency(t,l,i),t.tailDep=l,l;for(let l=i;l!==null;l=l.prevDep)if(l.dep===e)return l;return s!==null?(t.tailDep=this.reuseDepLink(s,e),s):t.tailDep=this.insertDependency(e,t,i)}let n=0,a=s;for(;a!==null&&n<_;){const l=a;if(l.dep===e)return this.reorderDependency(t,l,i),t.tailDep=l,l;a=l.nextDep,++n}let r=i;for(;r!==null&&n<_;){const l=r;if(l.dep===e)return l;r=l.prevDep,++n}if(a!==null||r!==null){const l=j(e,t,this.adaptiveDependencyIndex);if(l!==void 0)return this.reorderDependency(t,l,i),t.tailDep=l,l}return s!==null?(t.tailDep=this.reuseDepLink(s,e),s):t.tailDep=this.insertDependency(e,t,i)}appendInitialDependency(e,t){var a;const i=t.tailDep,s=e.lastSub,n={dep:e,sub:t,prevSub:s,nextSub:null,prevDep:i,nextDep:null};return s===null?e.firstSub=n:s.nextSub=n,e.lastSub=n,i===null?t.firstDep=n:i.nextDep=n,t.tailDep=n,++t.depCount,(a=t.dependencyIndex)==null||a.set(e,n),e.flags&v&&this.attachDependencyCleanup(n),n}insertDependency(e,t,i){var r;const s=e.lastSub,n={dep:e,sub:t,prevSub:s,nextSub:null,prevDep:i,nextDep:null};s===null?e.firstSub=n:s.nextSub=n,e.lastSub=n;const a=i===null?t.firstDep:i.nextDep;return n.nextDep=a,a!==null&&(a.prevDep=n),i===null?t.firstDep=n:i.nextDep=n,++t.depCount,(r=t.dependencyIndex)==null||r.set(e,n),e.flags&v&&this.attachDependencyCleanup(n),n}reuseDepLink(e,t){const i=e.sub.dependencyIndex;this.detachSubLink(e);const s=t.lastSub;return e.dep=t,e.prevSub=s,e.nextSub=null,s===null?t.firstSub=e:s.nextSub=e,t.lastSub=e,i==null||i.set(t,e),t.flags&v&&this.attachDependencyCleanup(e),e}reorderDependency(e,t,i){if(t.prevDep===i)return;const s=t.prevDep,n=t.nextDep;s===null?e.firstDep=n:s.nextDep=n,n!==null&&(n.prevDep=s);const a=i===null?e.firstDep:i.nextDep;t.prevDep=i,t.nextDep=a,a!==null&&(a.prevDep=t),i===null?e.firstDep=t:i.nextDep=t}pruneUnreadDependencies(e){const t=e.tailDep;let i=t===null?e.firstDep:t.nextDep;if(i!==null){for(t===null?e.firstDep=null:t.nextDep=null;i!==null;){const s=i.nextDep;this.detachSubLink(i),--e.depCount,i=s}e.depCount<=_&&U(e)}}detachSubLink(e){var t;if((t=e.sub.dependencyIndex)==null||t.delete(e.dep),e.dep.flags&v){const i=e.dependencyCleanup;e.dependencyCleanup=void 0,i==null||i()}e.dep.subSearchCursor===e&&(e.dep.subSearchCursor=e.nextSub??(e.dep.firstSub===e?void 0:e.dep.firstSub??void 0)),e.prevSub===null?e.dep.firstSub=e.nextSub:e.prevSub.nextSub=e.nextSub,e.nextSub===null?e.dep.lastSub=e.prevSub:e.nextSub.prevSub=e.prevSub}attachDependencyCleanup(e){var n,a;const t=e.dep.sourceHooks,i=t==null?void 0:t.onDependency;if(i===void 0)return;const s=((n=e.sub.sourceHooks)==null?void 0:n.dependencyOwner)??((a=e.sub.effectTask)==null?void 0:a.dependencyOwner);s!==void 0&&(e.dependencyCleanup=i(s))}releaseSourceSubs(e){if(!(e.flags&v)){let i=e.firstSub;for(;i!=null;){const s=i.nextSub,n=i.sub;this.detachDependencyLink(i),this.detachSubLink(i);const a=n.flags;(a&(E|S))===w&&(n.flags=a&~w|p,a&y&&this.enqueueEffect(n,e)),i=s}e.firstSub=e.lastSub=null,e.subSearchCursor=void 0;return}let t=e.firstSub;for(;t!=null;){const i=t.nextSub;this.detachDependencyLink(t),this.detachSubLink(t),t=i}e.firstSub=e.lastSub=null,e.subSearchCursor=void 0}detachDependencyLink(e){const t=e.sub,i=e.prevDep,s=e.nextDep;i===null?t.firstDep=s:i.nextDep=s,s!==null&&(s.prevDep=i),t.tailDep===e&&(t.tailDep=i),--t.depCount,t.depCount<=_&&U(t)}enqueueEffect(e,t){var s,n;const i=t!==void 0&&t.flags&v?t.sourceHooks.token:void 0;i!==void 0&&((n=(s=e.effectTask)==null?void 0:s.notify)==null||n.call(s,i)),!(e.flags&x)&&(e.flags|=x,this.effectQueue[this.effectWriteIndex]=e,++this.effectWriteIndex)}propagateInvalidation(e,t=!1){var n,a,r,l,h,g,u,o,I,A,L,q,F;const i=this.invalidationDepth;let s=i;for(let d=e;d!==null;d=d.nextSub){const f=d.sub,D=f.flags;let k=0;if(D&(E|S)?D&S&&(k=this.invalidateReadDependency(d,f,D)):(k=D&~C|(t?w:p),f.flags=k),k===0){if(D&y&&D&x){const T=d.dep.flags&v?d.dep.sourceHooks.token:void 0;T!==void 0&&((a=(n=f.effectTask)==null?void 0:n.notify)==null||a.call(n,T))}else f.flags&v&&((l=(r=f.sourceHooks).onInvalidate)==null||l.call(r,f.firstSub!==null),f.firstSub!==null&&(this.invalidationStack[s++]=f.firstSub));continue}k&y?(!(k&S)||((h=f.effectTask)==null?void 0:h.allowScheduleDuringRun)===!0)&&this.enqueueEffect(f,d.dep):(!(D&E)&&f.flags&v&&((u=(g=f.sourceHooks).onInvalidate)==null||u.call(g,f.firstSub!==null)),f.firstSub!==null&&(this.invalidationStack[s++]=f.firstSub))}for(;s!==i;){let d=this.invalidationStack[--s];do{const f=d.sub,D=f.flags;let k=0;if(D&(E|S)?D&S&&(k=this.invalidateReadDependency(d,f,D)):(k=D&~C|w,f.flags=k),k===0){if(D&y&&D&x){const T=d.dep.flags&v?d.dep.sourceHooks.token:void 0;T!==void 0&&((I=(o=f.effectTask)==null?void 0:o.notify)==null||I.call(o,T))}else if(f.flags&v&&((L=(A=f.sourceHooks).onInvalidate)==null||L.call(A,f.firstSub!==null),f.firstSub!==null)){d.nextSub!==null&&(this.invalidationStack[s++]=d.nextSub),d=f.firstSub;continue}}else if(k&y)this.enqueueEffect(f,d.dep);else if(!(D&E)&&f.flags&v&&((F=(q=f.sourceHooks).onInvalidate)==null||F.call(q,f.firstSub!==null)),f.firstSub!==null){d.nextSub!==null&&(this.invalidationStack[s++]=d.nextSub),d=f.firstSub;continue}d=d.nextSub}while(d!==null)}this.invalidationDepth=i}invalidateReadDependency(e,t,i){const s=t.tailDep;if(s===null)return 0;if(e!==s){for(let a=e.prevDep;a!==null;a=a.prevDep)if(a===s)return 0}const n=i|C|w;return t.flags=n,n}confirmSubUpdates(e,t,i=null){var s,n;for(let a=e;a!==null;a=a.nextSub){if(a===t||a.sub===i)continue;const r=a.sub,l=r.flags;l&p||(r.flags=l&~w|p,l&y?this.enqueueEffect(r,a.dep):l&E||r.flags&v&&((n=(s=r.sourceHooks).onInvalidate)==null||n.call(s,r.firstSub!==null)))}}recomputeValue(e,t=null){const i=e.evaluate;e.tailDep=null;const s=e.flags&~C|S;e.flags=s;const n=this.activeSub;this.activeSub=e;let a;try{a=i()}catch(u){throw e.evaluate!==i?(e.cachedValue=void 0,e.flags=0,u):(this.restoreComputedFailure(e,t),u)}finally{this.activeSub=n}if(e.evaluate!==i)return e.cachedValue=void 0,e.flags=0,!1;const r=e.flags&C,l=s&-268,h=e.tailDep;(h===null?e.firstDep:h.nextDep)!==null&&this.pruneUnreadDependencies(e);const g=e.cachedValue;return e.cachedValue=a,e.flags=s&v|(r?p:l),g===a?!1:(e.firstSub!==null&&this.confirmSubUpdates(e.firstSub,t),!0)}restoreComputedFailure(e,t){e.flags=e.flags&-144|m,this.pruneUnreadDependencies(e),t!==null&&this.restoreFailedDependency(t.sub)}refreshDependencies(e,t){const i=this.dependencyDepth;try{return this.walkDependencyChain(e,t)}catch(s){this.restoreFailedDependency(e);for(let n=i;n<this.dependencyDepth;n++)this.restoreFailedDependency(this.dependencyStack[n].sub);throw this.dependencyDepth=i,this.dependencyStack.length=i,s}}settleCancelledDependencies(e){for(let t=e.firstDep;t!==null;t=t.nextDep){const i=t.dep,s=i.flags;s&(W|E|m)&&(i.evaluate===void 0?s&p&&this.commitSignalValue(i,t):this.refreshComputedValue(i,s,t))}}walkDependencyChain(e,t){const i=this.dependencyDepth;let s=i,n=!1;e:for(;;){if(e.flags&p)n=!0;else{const a=t.dep,r=a.flags;if(r&(p|m))this.dependencyDepth=s,n=a.evaluate===void 0?this.commitSignalValue(a,t):this.recomputeValue(a,t);else if(r&w){if(a.firstDep!==null){this.dependencyStack[s++]=t,e=a,t=a.firstDep;continue e}this.dependencyDepth=s,n=this.recomputeValue(a,t)}else n=!1}if(!n&&t.nextDep!==null){t=t.nextDep;continue}if(n){for(;s!==i;){this.dependencyDepth=--s;const a=this.dependencyStack[s];if(n=this.recomputeValue(e,a),e=a.sub,!n){if(a.nextDep!==null){t=a.nextDep;continue e}break}}if(n)return this.dependencyDepth=i,!0}for(;s!==i;){this.dependencyDepth=--s;const a=this.dependencyStack[s];if(e.flags&=~w,e=a.sub,a.nextDep!==null){t=a.nextDep;continue e}}return e.flags&=~w,this.dependencyDepth=i,!1}}restoreFailedDependency(e){e.flags&=-16,e.flags&y||(e.flags|=m)}executeEffect(e){const t=e.flags;if(!(t&E))return;if(!(t&(p|C))){const h=e.firstDep;try{if(h===null||!this.refreshDependencies(e,h)){e.flags&=~E;return}}catch(g){throw e.flags&=-80,g}}const i=e.evaluate;if(i===void 0){e.flags&=~E;return}let s;if(e.scopeLastChild!==void 0)try{this.disposeNestedEffects(e)}catch(h){s=[h]}const n=typeof e.cachedValue=="function"?e.cachedValue:void 0;if(e.cachedValue=void 0,e.flags&=~C,n!==void 0)try{this.untracked(n)}catch(h){s??(s=[]),s.push(h)}if(s!==void 0){try{this.disposeEffect(e)}catch(h){s.push(h)}R.throwScopeErrors(s,"Effect cleanup failed.")}if(e.evaluate===void 0)return;e.tailDep=null,e.flags=e.flags&~C|S;const a=this.activeSub;this.activeSub=e;let r;try{r=i()}catch(h){this.activeSub=a,e.flags&=~S,this.failEffectRun(e,h,s)}finally{this.activeSub=a,e.flags&=~S}const l=e.tailDep;if((l===null?e.firstDep:l.nextDep)!==null&&this.pruneUnreadDependencies(e),typeof r=="function")if(e.evaluate===void 0)try{this.untracked(r)}catch(h){s??(s=[]),s.push(h)}else e.cachedValue=r;e.flags&x?e.flags=e.flags&-7|w:e.flags&=-8}failEffectRun(e,t,i){const s=i??[];s.push(t),this.pruneUnreadDependencies(e);try{this.disposeNestedEffects(e)}catch(n){s.push(n)}throw e.flags&=-72,s.length===1?s[0]:new AggregateError(s,"Effect execution failed.")}flushSyncEffects(){if(!(this.flushingEffects||this.activeSub!==null&&(this.activeSub.flags&(y|S))===(y|S))){this.flushingEffects=!0;try{for(;this.effectReadIndex!==this.effectWriteIndex;){const e=this.effectReadIndex,t=this.effectQueue[e];this.effectQueue[e]=void 0,++this.effectReadIndex,t.flags&=~x,this.executeEffect(t)}}catch(e){this.drainQueueAfterError(e,!1)}finally{this.effectReadIndex=0,this.effectWriteIndex=0,this.flushingEffects=!1}}}flushExternalEffects(){if(!(this.flushingEffects||this.activeSub!==null&&(this.activeSub.flags&(y|S))===(y|S))){this.flushingEffects=!0;try{for(;this.effectReadIndex!==this.effectWriteIndex;){const e=this.effectReadIndex,t=this.effectQueue[e];this.effectQueue[e]=void 0,++this.effectReadIndex;const i=t.effectTask;i===void 0?(t.flags&=~x,this.executeEffect(t)):t.evaluate!==void 0?this.scheduleEffectTask(t,i):t.flags&=~x}}catch(e){this.drainQueueAfterError(e,!0)}finally{this.effectReadIndex=0,this.effectWriteIndex=0,this.flushingEffects=!1}}}drainQueueAfterError(e,t){const i=[e];for(;this.effectReadIndex!==this.effectWriteIndex;){const s=this.effectReadIndex++,n=this.effectQueue[s];this.effectQueue[s]=void 0;try{const a=t?n.effectTask:void 0;a!==void 0&&n.evaluate!==void 0?this.scheduleEffectTask(n,a):(n.flags&=~x,this.executeEffect(n))}catch(a){i.push(a)}}throw i.length===1?e:new AggregateError(i,"Effect queue processing failed.")}requestEffectTask(e){const t=e.effectTask;t===void 0||e.evaluate===void 0||(e.flags|=x,this.scheduleEffectTask(e,t))}scheduleEffectTask(e,t){try{t.schedule()}catch(i){throw e.flags&=-72,i}}disposeEffect(e){if(e.evaluate===void 0)return;this.activeSub===e&&(this.activeSub=null);const t=e.effectTask,i=e.onStop,s=typeof e.cachedValue=="function"?e.cachedValue:void 0;e.evaluate=void 0,e.flags=0,e.cachedValue=void 0,e.effectTask=void 0,i!==void 0&&(e.onStop=void 0),R.detachScopeChild(e);let n=e.firstDep;for(;n!==null;){const r=n.nextDep;this.detachSubLink(n),n=r}e.firstDep=e.tailDep=null,e.depCount=0,U(e);let a;if(t!==void 0)try{t.dispose()}catch(r){a=[r]}try{this.disposeNestedEffects(e)}catch(r){a??(a=[]),a.push(r)}if(s!==void 0)try{this.untracked(s)}catch(r){a??(a=[]),a.push(r)}if(i!==void 0)try{this.untracked(i)}catch(r){a??(a=[]),a.push(r)}this.invalidationStack.length=this.invalidationDepth,this.dependencyStack.length=this.dependencyDepth,a!==void 0&&R.throwScopeErrors(a,"Effect disposal failed.")}disposeNestedEffects(e){let t;for(;e.scopeLastChild!==void 0;)try{this.disposeEffect(e.scopeLastChild)}catch(i){t??(t=[]),t.push(i)}t!==void 0&&R.throwScopeErrors(t,"Nested effect disposal failed.")}static materializeComputed(e){e.flags=W|(e.sourceHooks===void 0?0:v),e.firstSub=null,e.lastSub=null,e.firstDep=null,e.tailDep=null,e.depCount=0,e.cachedValue=void 0}createHandleReaders(){const e=this;function t(){return e.readComputedValue(this)}return{initializeComputed(){const i=this;return N.materializeComputed(i),this.get=t,e.readComputedValue(i)},initializeRaw(){const i=this;N.materializeComputed(i);const s=()=>e.readComputedValue(i);return this.read=s,s()},peek(){return e.peekHandle(this)}}}peekHandle(e){const t=this.activeSub;if(t===null)return e.get();this.activeSub=null;try{return e.get()}finally{this.activeSub=t}}_signalAccess(e){const t=this;let i=e,s;function n(a){if(arguments.length!==0){const h=s;h!==void 0?t.writeSignalValue(h,a):i!==a&&(i=a);return}const r=s;if(r!==void 0)return t.readSignalValue(r);const l=t.activeSub;return l===null||(s=t.materializeSignal(i,l)),i}return{read:n,write:n}}_computedAccess(e){return{evaluate:e,read:this.handleReaders.initializeRaw}}_ownedSignal(e,t){const i=this;let s=e,n,a=!1;const r=()=>{const u=n;if(u!==void 0)return this.readSignalValue(u);const o=this.activeSub;if(o===null)return s;const I=s;return n=this.materializeSignal(I,o,t),s=void 0,I},l=t===void 0?u=>{const o=n;o!==void 0?this.writeSignalValue(o,u):s!==u&&(s=u)}:u=>{var I,A;const o=n;if(o!==void 0){const L=o.flags&p?o.pendingValue:o.cachedValue;L!==u&&((I=t.onChange)==null||I.call(t,L,u,o.firstSub!==null)),this.writeSignalValue(o,u);return}s!==u&&((A=t.onChange)==null||A.call(t,s,u,!1),s=u)},g={source:{get:r,peek:this.handleReaders.peek,set:l},dispose(){var o;if(a)return!0;a=!0,s=void 0;let u;try{(o=t==null?void 0:t.onDispose)==null||o.call(t,(n==null?void 0:n.firstSub)!=null)}catch(I){(u??(u=[])).push(I)}if(n!==void 0){try{i.releaseSourceSubs(n)}catch(I){(u??(u=[])).push(I)}n.cachedValue=void 0,n.pendingValue=void 0,n.pendingAuthor=void 0,n.flags=0}if(n=void 0,(u==null?void 0:u.length)===1)throw u[0];if(u!==void 0&&u.length>1)throw new AggregateError(u,"Owned signal disposal failed.");return!0}};return t!==void 0&&(g.hasSubscribers=()=>(n==null?void 0:n.firstSub)!=null),g}_ownedComputed(e,t){const i=this,s=this.createComputedHandle(e,t);let n=!1;const a={source:s,dispose(){var h;if(n)return!0;n=!0,i.activeSub===s&&(i.activeSub=null);const r=[];try{(h=t==null?void 0:t.onDispose)==null||h.call(t,s.firstSub!=null)}catch(g){r.push(g)}if(s.flags!==void 0)try{i.releaseSourceSubs(s)}catch(g){r.push(g)}let l=s.firstDep;for(;l!=null;){const g=l.nextDep;i.detachSubLink(l),l=g}if(s.firstDep=s.tailDep=null,s.depCount=0,U(s),s.evaluate=void 0,s.cachedValue=void 0,s.flags=0,r.length===1)throw r[0];if(r.length>1)throw new AggregateError(r,"Owned computed disposal failed.");return!0}};return t!==void 0&&(a.hasSubscribers=()=>s.firstSub!=null),a}_startBatch(){++this.batchDepth}_endBatch(){!--this.batchDepth&&this.effectReadIndex!==this.effectWriteIndex&&this.flushEffects()}_isTracking(){return this.activeSub!==null}_isFlushingEffects(){return this.flushingEffects}}let K;function V(){return K??(K=new N)}const Y=c=>V().signal(c),X=c=>V().reactive(c);function Z(c){return V().computed(c)}const J=(c,e)=>V().effect(c,e),$=(c,e,t)=>V().watch(c,e,t),H=c=>V().batch(c),ee=c=>V().untracked(c),te=()=>V().scope();exports.ScopeNode=R.ScopeNode;exports.RaphReactivity=N;exports.batch=H;exports.computed=Z;exports.effect=J;exports.reactive=X;exports.scope=te;exports.signal=Y;exports.untracked=ee;exports.watch=$;