@raphy-js/raph 1.0.1-dev.20 → 1.0.1-dev.26

package/dist/debug/runtime/ownership/RaphEffectScope.js

@@ -1,50 +1,158 @@
-var f = Object.defineProperty;
-var l = (r, e, s) => e in r ? f(r, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : r[e] = s;
-var o = (r, e, s) => l(r, typeof e != "symbol" ? e + "" : e, s);
-import { RaphDisposedError as u } from "../errors.js";
+import { RaphDisposedError as c } from "../errors.js";
+const u = 16;
 class _ {
-  constructor(e, s = null) {
-    o(this, "_registrations");
-    o(this, "_children");
-    o(this, "_selfPaused", !1);
-    o(this, "_ancestorPauses", 0);
-    o(this, "_disposed", !1);
-    o(this, "_releaseOwner");
-    o(this, "_parent");
-    if (this._owner = e, e._assertAlive(), (s == null ? void 0 : s.disposed) === !0)
-      throw new u("[Raph] Parent effect scope is disposed.");
-    if (s !== null && s._owner.runtime !== e.runtime)
+  constructor(s, e = null) {
+    if (this._owner = s, s._assertAlive(), e?.disposed === !0)
+      throw new c("[Raph] Parent effect scope is disposed.");
+    if (e !== null && e._owner.runtime !== s.runtime)
       throw new TypeError("[Raph] Parent effect scope belongs to another runtime.");
-    this._parent = s, s == null || s._addChild(this), this._ancestorPauses = (s == null ? void 0 : s.paused) === !0 ? 1 : 0, this._releaseOwner = e.own(() => this.dispose());
+    this._parent = e, e?._addChild(this), this._ancestorPauses = e?.paused === !0 ? 1 : 0, this._releaseOwner = s.own(() => this.dispose());
   }
+  _registrations;
+  // Число регистраций, при котором группа в следующий раз забывает остановленные.
+  _pruneAt = u;
+  _children;
+  _selfPaused = !1;
+  _ancestorPauses = 0;
+  _disposed = !1;
+  _releaseOwner;
+  _parent;
   get paused() {
     return this._selfPaused || this._ancestorPauses !== 0;
   }
   get disposed() {
     return this._disposed;
   }
-  fork(e) {
-    return this._assertAlive(), new _(e, this);
+  fork(s) {
+    return this._assertAlive(), new _(s, this);
   }
-  effect(e, s, t) {
+  effect(s, e, t) {
     return this._assertAlive(), this._add(this._owner.runtime._effectRegistration(
       this._owner,
-      e,
       s,
+      e,
       t,
       this.paused
     ));
   }
-  watch(e, s, t, i) {
-    return this._assertAlive(), this._add(this._owner.runtime._watchRegistration(
+  /**
+   * Регистрирует в этой группе phase effect без task и без disposer: тело
+   * вызывается без аргументов, а binding живёт до освобождения группы или её
+   * владельца. Pause и resume группы действуют на него так же, как на effect,
+   * зарегистрированный через `effect()`.
+   *
+   * Binding, зарегистрированный внутри тела другого effect, останавливает ещё и
+   * перезапуск этого effect. Остановленный binding больше не исполняется и не
+   * реагирует на pause и resume; группа забывает его не сразу, а когда число её
+   * регистраций удваивается, поэтому остановленных регистраций в группе не
+   * больше, чем действующих, либо меньше `PRUNE_FLOOR`.
+   */
+  bindEffect(s, e, t) {
+    this._assertAlive(), this._track(this._owner.runtime._effectRegistration(
       this._owner,
+      s,
       e,
+      t,
+      this.paused,
+      !0
+    ));
+  }
+  /**
+   * Регистрирует в этой группе регистраций группу из `count` phase effects на
+   * одном binding, как `owner.effectGroup()`: без task и без disposer, с
+   * отдельным набором зависимостей у каждого slot и с запуском slots через
+   * `start()` возвращённой группы. Pause и resume действуют на все slots
+   * сразу; slots, запущенные или изменившиеся за время pause, исполняются
+   * одной доставкой после resume. Binding живёт до освобождения этой группы
+   * регистраций или её владельца.
+   *
+   * Pause изнутри тела slot останавливает доставку: оставшиеся slots
+   * исполняются после resume, и причины прерванной доставки приходят в
+   * `causes` следующей целиком, вместе с причинами уже исполненных slots.
+   *
+   * Освобождение отличается от отдельных bindings этой же группы регистраций:
+   * slots останавливаются в порядке, обратном порядку номеров, а не в порядке
+   * регистрации, и несколько сбоев их cleanup приходят одним вложенным
+   * `AggregateError` с сообщением `[Raph] Effect group disposal failed.`.
+   *
+   * @typeParam Context — значение, которое получает тело каждого slot.
+   * @param phase Имя объявленной phase.
+   * @param count Число slots: целое от 1 до 4294967293, иначе `RangeError`.
+   * @param runSlot Тело slot: получает запуск с `context` и номером slot.
+   * @param context Значение, которое группа передаёт телу каждого slot.
+   * @param options `priority` task группы, как у `effect()`.
+   */
+  effectGroup(s, e, t, r, i) {
+    this._assertAlive();
+    const o = this._owner.runtime._effectGroupRegistration(
+      this._owner,
       s,
+      e,
       t,
+      r,
       i,
       this.paused
+    );
+    return this._track(o), o;
+  }
+  watch(s, e, t, r) {
+    return this._assertAlive(), this._add(this._owner.runtime._watchRegistration(
+      this._owner,
+      s,
+      e,
+      t,
+      r,
+      this.paused
     ));
   }
+  /**
+   * Внутренний путь renderer сохраняет pause ancestry и late-disposal tracking.
+   * Возвращаемый disposer renderer не использует; регистрация остаётся у scope.
+   * @internal
+   */
+  _registerEffect(s, e, t, r, i, o) {
+    this._assertAlive();
+    const h = this._owner.runtime._effectRegistration(
+      this._owner,
+      s,
+      e,
+      t,
+      this.paused,
+      r,
+      i,
+      o
+    );
+    o?.() || this._track(h);
+  }
+  /** @internal */
+  _registerWatch(s, e, t, r, i, o) {
+    this._assertAlive();
+    const h = this._owner.runtime._watchRegistration(
+      this._owner,
+      s,
+      e,
+      t,
+      r,
+      this.paused,
+      i,
+      o
+    );
+    o?.() || this._track(h);
+  }
+  /** @internal */
+  _registerEffectGroup(s, e, t, r, i) {
+    this._assertAlive();
+    const o = this._owner.runtime._effectGroupRegistration(
+      this._owner,
+      s,
+      e,
+      t,
+      r,
+      i,
+      this.paused
+    );
+    return this._track(o), o;
+  }
   pause() {
     this._assertAlive(), this._owner.runtime._runPhaseTransition(() => this._pause());
   }
@@ -54,117 +162,142 @@ class _ {
   _pause() {
     if (this._selfPaused)
       return;
-    const e = this.paused;
-    if (this._selfPaused = !0, e)
+    const s = this.paused;
+    if (this._selfPaused = !0, s)
       return;
-    const s = [];
+    const e = [];
     for (const t of this._registrations ?? [])
       try {
         t.registration.pause();
-      } catch (i) {
-        s.push(i);
+      } catch (r) {
+        e.push(r);
       }
     for (const t of this._children ?? [])
       try {
         t._changeAncestorPause(1);
-      } catch (i) {
-        s.push(i);
+      } catch (r) {
+        e.push(r);
       }
-    n(s, "[Raph] Pausable effect scope pause failed.");
+    n(e, "[Raph] Pausable effect scope pause failed.");
   }
   _resume() {
     if (!this._selfPaused || (this._selfPaused = !1, this.paused))
       return;
-    const e = [];
-    for (const s of this._registrations ?? [])
+    const s = [];
+    for (const e of this._registrations ?? [])
       try {
-        s.registration.resume();
+        e.registration.resume();
       } catch (t) {
-        e.push(t);
+        s.push(t);
       }
-    for (const s of this._children ?? [])
+    for (const e of this._children ?? [])
       try {
-        s._changeAncestorPause(-1);
+        e._changeAncestorPause(-1);
       } catch (t) {
-        e.push(t);
+        s.push(t);
       }
-    n(e, "[Raph] Pausable effect scope resume failed.");
+    n(s, "[Raph] Pausable effect scope resume failed.");
   }
   dispose() {
-    var t, i, h, d;
     if (this._disposed)
       return;
     this._disposed = !0;
-    const e = this._owner.disposed, s = [];
-    for (const a of [...this._children ?? []])
+    const s = this._owner.disposed, e = [];
+    for (const t of [...this._children ?? []])
       try {
-        a.dispose();
-      } catch (c) {
-        s.push(c);
+        t.dispose();
+      } catch (r) {
+        e.push(r);
       }
-    (t = this._children) == null || t.clear(), this._children = void 0;
-    for (const a of this._registrations ?? [])
-      if (a.active = !1, !e)
+    this._children?.clear(), this._children = void 0;
+    for (const t of this._registrations ?? [])
+      if (t.active = !1, !s)
         try {
-          a.registration.dispose();
-        } catch (c) {
-          s.push(c);
+          t.registration.dispose();
+        } catch (r) {
+          e.push(r);
         }
-    if ((i = this._registrations) == null || i.clear(), this._registrations = void 0, (d = (h = this._parent) == null ? void 0 : h._children) == null || d.delete(this), !e)
+    if (this._registrations?.clear(), this._registrations = void 0, this._parent?._children?.delete(this), !s)
       try {
         this._releaseOwner();
-      } catch (a) {
-        s.push(a);
+      } catch (t) {
+        e.push(t);
       }
-    n(s, "[Raph] Pausable effect scope disposal failed.");
+    n(e, "[Raph] Pausable effect scope disposal failed.");
   }
-  _add(e) {
-    if (this._disposed || this._owner.disposed)
-      return e.dispose(), p;
-    const s = { active: !0, registration: e };
-    return (this._registrations ?? (this._registrations = /* @__PURE__ */ new Set())).add(s), () => {
-      var t;
-      s.active && (s.active = !1, (t = this._registrations) == null || t.delete(s), e.dispose());
+  _add(s) {
+    const e = this._track(s);
+    return e === void 0 ? d : () => {
+      e.active && (e.active = !1, this._registrations?.delete(e), e.registration.dispose());
     };
   }
+  /**
+   * Вносит регистрацию в группу и возвращает её элемент либо `undefined`,
+   * когда группа уже освобождена. Disposer здесь не создаётся: его строит
+   * только `_add()`, поэтому `bindEffect()` обходится без closure.
+   */
+  _track(s) {
+    if (this._disposed || this._owner.disposed) {
+      s.dispose();
+      return;
+    }
+    const e = { active: !0, registration: s }, t = this._registrations ??= /* @__PURE__ */ new Set();
+    return t.add(e), t.size >= this._pruneAt && this._prune(t), e;
+  }
+  /**
+   * Забывает регистрации, которые уже остановлены не через disposer группы:
+   * binding, вложенный в тело другого effect, останавливает engine при
+   * перезапуске этого effect, а у `bindEffect()` нет disposer, который убрал бы
+   * его отсюда. Без этого группа держала бы тело каждого такого binding до
+   * собственного освобождения.
+   *
+   * Проход выполняется, когда число регистраций достигает порога, и ставит
+   * следующий порог вдвое выше числа оставшихся: цена регистрации остаётся
+   * постоянной в среднем.
+   */
+  _prune(s) {
+    for (const e of s)
+      e.registration.active || (e.active = !1, s.delete(e));
+    this._pruneAt = Math.max(u, s.size * 2);
+  }
   _assertAlive() {
     if (this._disposed || this._owner.disposed)
-      throw new u("[Raph] Pausable effect scope is disposed.");
+      throw new c("[Raph] Pausable effect scope is disposed.");
   }
-  _addChild(e) {
-    (this._children ?? (this._children = /* @__PURE__ */ new Set())).add(e);
+  _addChild(s) {
+    (this._children ??= /* @__PURE__ */ new Set()).add(s);
   }
-  _changeAncestorPause(e) {
+  _changeAncestorPause(s) {
     if (this._disposed)
       return;
-    const s = this.paused;
-    if (this._ancestorPauses += e, this._ancestorPauses < 0)
+    const e = this.paused;
+    if (this._ancestorPauses += s, this._ancestorPauses < 0)
       throw this._ancestorPauses = 0, new Error("[Raph] Effect scope ancestor pause state is unbalanced.");
-    if (s === this.paused)
+    if (e === this.paused)
       return;
     const t = [];
-    for (const i of this._registrations ?? [])
+    for (const r of this._registrations ?? [])
       try {
-        this.paused ? i.registration.pause() : i.registration.resume();
-      } catch (h) {
-        t.push(h);
+        this.paused ? r.registration.pause() : r.registration.resume();
+      } catch (i) {
+        t.push(i);
       }
-    for (const i of this._children ?? [])
+    for (const r of this._children ?? [])
       try {
-        i._changeAncestorPause(e);
-      } catch (h) {
-        t.push(h);
+        r._changeAncestorPause(s);
+      } catch (i) {
+        t.push(i);
       }
     n(t, "[Raph] Pausable effect scope ancestor transition failed.");
   }
 }
-function n(r, e) {
-  if (r.length === 1)
-    throw r[0];
-  if (r.length > 1)
-    throw new AggregateError(r, e);
+function n(a, s) {
+  if (a.length === 1)
+    throw a[0];
+  if (a.length > 1)
+    throw new AggregateError(a, s);
 }
-function p() {
+function d() {
 }
 export {
   _ as RaphEffectScope

package/dist/debug/runtime/ownership/RaphNode.cjs

@@ -1 +1 @@
-"use strict";var b=Object.defineProperty;var y=(o,h,e)=>h in o?b(o,h,{enumerable:!0,configurable:!0,writable:!0,value:e}):o[h]=e;var l=(o,h,e)=>y(o,typeof h!="symbol"?h+"":h,e);Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../errors.cjs"),w=require("./RaphScope.cjs"),v=require("./throwDisposalErrors.cjs");let g=0;const _=Symbol("RaphProvisionalNode");class c extends w.RaphScope{constructor(e,t={},r,i){const s=r??(e instanceof c?e.runtime:e??void 0);if(s===void 0)throw new Error("[RaphNode] A root node requires an explicit runtime.");const n=e instanceof c?e:(e==null?void 0:e.root)??null;if(n!==null&&n.runtime!==s)throw new a.RaphCrossRuntimeError("[Raph] Parent belongs to another runtime.");n==null||n._assertAlive();const d=t.priority??0;p(d);super(t.id??`node-${g++}`,s);l(this,"priority");l(this,"_parent");l(this,"_children",[]);l(this,"_published");l(this,"api");l(this,"meta");l(this,"type");l(this,"_subtreeSourceIdentity",Object.freeze({}));this.priority=d,this._parent=n,this.meta={...t.meta},this.type=t.type??"default",this.api=Object.freeze({});const f=i===_;if(this._published=n===null||!f&&n._published,n!==null){const m=n._children.length;if(n._children.push(this),!this._published)return;s._notifyNodeStructure(this,{node:this,newIndex:m,newParent:n},[],u(this)),this._assertAlive()}}get node(){return this}get parent(){return this._parent}get children(){return this._children}addChild(e){if(this._assertAlive(),e._assertAlive(),e.runtime!==this.runtime)throw new a.RaphCrossRuntimeError("[Raph] Child belongs to another runtime.");if(this===e)throw new Error("[Raph] A node cannot become its own ancestor.");if(!e._published||!this._published)throw new Error("[Raph] A provisional node cannot be reparented before setup commits.");for(let t=this;t!==null;t=t.parent)if(t===e)throw new Error("[Raph] A node cannot become its own ancestor.");return e.parent===this?!0:this.runtime._runNodeMutation(()=>{this.runtime._assertNodeReparentAllowed(e,this);const t=u(e),r=e._parent,i=r==null?void 0:r._children.indexOf(e);r!==null&&i!==void 0&&i>=0&&r._children.splice(i,1),e._parent=this;const s=this._children.length;return this._children.push(e),this.runtime._notifyNodeStructure(e,{node:e,...r===null?{}:{oldParent:r},...i===void 0||i<0?{}:{oldIndex:i},newParent:this,newIndex:s},t,u(e)),!0})}reorderChildren(e){if(this._assertAlive(),e.length!==this._children.length||new Set(e).size!==e.length)throw new Error("[Raph] Child order must contain every direct child exactly once.");for(const t of e)if(t._assertAlive(),t._parent!==this)throw new Error("[Raph] Child order can contain only direct children of the node.");this.runtime._runNodeMutation(()=>{const t=new Map(this._children.map((r,i)=>[r,i]));this._children.splice(0,this._children.length,...e);for(let r=0;r<e.length;r++){const i=e[r],s=t.get(i);if(s===r)continue;const n=u(i);this.runtime._notifyNodeStructure(i,{node:i,oldParent:this,newParent:this,oldIndex:s,newIndex:r},n,n)}})}options(e){this._assertAlive(),e.meta!==void 0&&(this.meta={...e.meta}),e.priority!==void 0&&(p(e.priority),this.priority=e.priority),e.type!==void 0&&(this.type=e.type),this.touch(Object.freeze({options:Object.freeze({...e})}))}touch(e){this._assertAlive(),this.runtime._runNodeMutation(()=>this.runtime._notifyNodeTouch(this,e))}remove(){this.dispose()}dispose(){if(this._disposed||this._disposing)return;this._disposing=!0,this.runtime._beginOwnerDisposal();const e=[];try{for(const s of[...this._children])try{s.dispose()}catch(n){e.push(n)}this._children.length=0;const t=this._parent,r=u(this),i=t==null?void 0:t._children.indexOf(this);if(t!==null&&i!==void 0&&i>=0&&t._children.splice(i,1),this._parent=null,this._published)try{this.runtime._notifyNodeStructure(this,{node:this,...t===null?{}:{oldParent:t},...i===void 0||i<0?{}:{oldIndex:i}},r,[])}catch(s){e.push(s)}try{super.dispose()}catch(s){e.push(s)}this._published=!1;try{this.runtime._releaseNode(this)}catch(s){e.push(s)}}finally{try{this.runtime._endOwnerDisposal()}catch(t){e.push(t)}}v.throwDisposalErrors(e,`[Raph] Node "${this.id}" disposal failed.`)}_setApi(e){const t=typeof e=="object"&&e!==null?Object.freeze(e):e;Object.defineProperty(this,"api",{configurable:!1,enumerable:!0,value:t,writable:!1})}_publishCreation(){if(this._published)return;const e=this._parent;if(e===null||!e._published)return;this._published=!0;const t=e._children.indexOf(this);try{this.runtime._notifyNodeStructure(this,{node:this,newIndex:t,newParent:e},[],u(this));for(const r of this._children)r._publishCreation()}catch(r){throw this._published=!1,r}}_isPublished(){return this._published}}function N(o,h,e){return new c(o,h,e,_)}function u(o){const h=[];for(let e=o;e!==null;e=e.parent)h.push(e);return h}function p(o){if(!Number.isFinite(o))throw new TypeError("[Raph] Node priority must be finite.")}exports.RaphNode=c;exports.createProvisionalNode=N;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("../../reactivity/disposal.cjs"),b=require("../errors.cjs"),S=require("../reactivity/RaphWorkGraph.cjs"),w=require("./RaphScope.cjs");let x=0;const C=Symbol("RaphProvisionalNode"),A=Object.freeze({}),O="[Raph] Child order must contain every direct child exactly once.",p="[Raph] Child order can contain only direct children of the node.";let f,c;class u extends w.RaphScope{#i;constructor(i,t={},e,r){const s=e??(i instanceof u?i.runtime:i??void 0);if(s===void 0)throw new Error("[RaphNode] A root node requires an explicit runtime.");const n=i instanceof u?i:i?.root??null;if(n!==null&&n.runtime!==s)throw new b.RaphCrossRuntimeError("[Raph] Parent belongs to another runtime.");const l=t.priority??0,h=t.id,a=t.meta,y=a===void 0?void 0:{...a},g=t.type??"default";n?._assertAlive(),v(l),super(h??x++,s);const m=r===C;if(this.priority=l,this._parent=n,this._prevSibling=null,this._nextSibling=null,this._firstChild=null,this._lastChild=null,this._childCount=0,this._childArray=void 0,this._published=n===null||!m&&n._published,this.#i=A,new.target!==u&&Object.defineProperty(this,"api",{configurable:!0,enumerable:!0,value:this.#i,writable:!0}),this._meta=y,this.type=g,this._subtreeIdentity=void 0,n!==null){if(n._appendChild(this),!this._published)return;s._hasNodeStructureDemand(this)?s._notifyNodeStructure(this,{node:this,newIndex:n._childCount-1,newParent:n},[],d(this)):s._touchMutationBoundary(),this._assertAlive()}else s._addTopOwner(this)}get id(){const i=this._id;return typeof i=="string"?i:this._id=`node-${i}`}get meta(){return this._meta??={}}set meta(i){this._meta=i}get api(){return this.#i}get _subtreeSourceIdentity(){return this._subtreeIdentity??=Object.freeze({})}get node(){return this}get parent(){return this._parent}get children(){return this._childArray??this._materializeChildren()}addChild(i){if(this._assertAlive(),i._assertAlive(),i.runtime!==this.runtime)throw new b.RaphCrossRuntimeError("[Raph] Child belongs to another runtime.");if(this===i)throw new Error("[Raph] A node cannot become its own ancestor.");if(!i._published||!this._published)throw new Error("[Raph] A provisional node cannot be reparented before setup commits.");for(let t=this;t!==null;t=t.parent)if(t===i)throw new Error("[Raph] A node cannot become its own ancestor.");return i.parent===this?!0:this.runtime._runNodeMutation(()=>{const t=this.runtime;t._assertNodeReparentAllowed(i,this);const e=i._parent;if(!t._hasNodeStructureDemand(i))return e!==null&&i._unlinkFrom(e,-1),i._parent=this,this._appendChild(i),e===null&&t._removeTopOwner(i),!0;const r=d(i),s=e===null?-1:i._indexIn(e);e!==null&&i._unlinkFrom(e,s),i._parent=this;const n=this._childCount;return this._appendChild(i),e===null&&t._removeTopOwner(i),t._notifyNodeStructure(i,{node:i,...e===null?{}:{oldParent:e},...s<0?{}:{oldIndex:s},newParent:this,newIndex:n},r,d(i)),!0})}reorderChildren(i){this._assertAlive(),this._applyChildOrder(i)||this._rejectChildOrder(i)}moveChild(i,t){if(this._assertAlive(),i._assertAlive(),t!==null&&t._assertAlive(),i._parent!==this||t!==null&&t._parent!==this)throw new Error(p);const e=this.runtime;if(i===t||i._nextSibling===t){e._touchMutationBoundary();return}const r=e._hasNodeSubscribers()?this._indexChildren():void 0;if(this._relinkBefore(i,t),r!==void 0){this._publishChildOrder(r);return}this._childArray=void 0,e._touchMutationBoundary()}_swapChildren(i,t){if(this._assertAlive(),i._assertAlive(),t._assertAlive(),i._parent!==this||t._parent!==this)throw new Error(p);const e=this.runtime;if(i===t){e._touchMutationBoundary();return}const r=e._hasNodeSubscribers()?this._indexChildren():void 0,s=i._nextSibling,n=t._nextSibling;if(s===t?this._relinkBefore(t,i):n===i?this._relinkBefore(i,t):(this._relinkBefore(i,n),this._relinkBefore(t,s)),r!==void 0){this._publishChildOrder(r);return}this._childArray=void 0,e._touchMutationBoundary()}_disposeChildren(i,t=0,e=i===void 0?0:i.length){let r=i;if(r===void 0&&(r=this._childArray??this._collectChildren(),e=r.length),t>=e)return;const s=this._childArray;s!==void 0&&(s===r||this._firstChild===r[t].node)&&(this._childArray=void 0);const n=this.runtime;let l;n._beginOwnerDisposal();for(let h=t;h<e;h++)try{r[h].node.dispose()}catch(a){(l??=[]).push(a)}try{n._endOwnerDisposal()}catch(h){(l??=[]).push(h)}return l}options(i){this._assertAlive(),i.meta!==void 0&&(this._meta={...i.meta}),i.priority!==void 0&&(v(i.priority),this.priority=i.priority),i.type!==void 0&&(this.type=i.type),this.touch(Object.freeze({options:Object.freeze({...i})}))}touch(i){this._assertAlive(),this.runtime._runNodeMutation(()=>this.runtime._notifyNodeTouch(this,i))}remove(){this.dispose()}dispose(){o.throwDisposalFailure(c.call(this))}_disposeForOwner(){try{const i=this.dispose;if(i===f)return c.call(this);i.call(this);return}catch(i){return o.unroutedDisposalFailure(i)}}_disposeWithOutcome(){if(this._disposed||this._disposing)return;this._disposing=!0;const i=this.runtime;i._beginOwnerDisposal(this);let t;try{if(this._firstChild!==null){const r=this._takeChildSnapshot();for(let s=0;s<r.length;s++){const n=r[s];try{const l=n.dispose;if(l===f){const h=c.call(n);h!==void 0&&(t??=[]).push(h)}else l.call(n)}catch(l){(t??=[]).push(o.unroutedDisposalFailure(l))}}this._resetChildList(r)}const e=this._parent;if(this._published&&i._hasNodeStructureDemand(this)){const r=d(this),s=e===null?-1:this._indexIn(e);e!==null&&(this._unlinkFrom(e,s),this._parent=null);try{i._notifyNodeStructure(this,{node:this,...e===null?{}:{oldParent:e},...s<0?{}:{oldIndex:s}},r,[])}catch(n){(t??=[]).push(o.unroutedDisposalFailure(n))}}else if(e!==null&&(this._unlinkFrom(e,-1),this._parent=null),this._published)try{i._touchMutationBoundary()}catch(r){(t??=[]).push(o.unroutedDisposalFailure(r))}try{const r=super._disposeScopeForOwner(super.dispose);r!==void 0&&(t??=[]).push(r)}catch(r){(t??=[]).push(o.unroutedDisposalFailure(r))}e===null&&i._removeTopOwner(this),this._published=!1;try{i._releaseNode(this)}catch(r){(t??=[]).push(o.unroutedDisposalFailure(r))}}finally{try{i._endOwnerDisposal()}catch(e){(t??=[]).push(o.unroutedDisposalFailure(e))}}if(t!==void 0)return o.combineDisposalFailures(t,`[Raph] Node "${this.id}" disposal failed.`)}_setApi(i){this.#i=typeof i=="object"&&i!==null&&!(i instanceof S.RaphProducer)?Object.freeze(i):i,Object.hasOwn(this,"api")&&Object.defineProperty(this,"api",{configurable:!1,enumerable:!0,value:this.#i,writable:!1})}_publishCreation(){if(this._published)return;const i=this._parent;if(!(i===null||!i._published)){this._published=!0;try{const t=this.runtime;t._hasNodeStructureDemand(this)?t._notifyNodeStructure(this,{node:this,newIndex:this._indexIn(i),newParent:i},[],d(this)):t._touchMutationBoundary();for(let e=this._firstChild;e!==null;e=e._nextSibling)e._publishCreation()}catch(t){throw this._published=!1,t}}}_isPublished(){return this._published}_isLinked(){const i=this._parent;return i!==null&&(this._prevSibling!==null||i._firstChild===this)}_collectDescendants(i){let t=this;for(;;){let e=t._firstChild;for(;e===null;){if(t===this)return;e=t._nextSibling,e===null&&(t=t._parent)}t=e,i.push(t)}}_countSubtree(i){let t=this;for(;;){i.resources+=t._debugResourceCount(),i.sources+=t._debugSourceCount();let e=t._firstChild;for(;e===null;){if(t===this)return;e=t._nextSibling,e===null&&(t=t._parent)}t=e}}_findNode(i){let t=this;for(;;){if(t.id===i)return t;let e=t._lastChild;for(;e===null;){if(t===this)return;e=t._prevSibling,e===null&&(t=t._parent)}t=e}}_applyChildOrder(i){const t=i.length;if(t!==this._childCount)return!1;const e=[];for(let l=0;l<t;l++)e.push(i[l]);if(t!==this._childCount)return!1;const r=this.runtime,s=r._hasNodeSubscribers()?this._indexChildren():void 0;if(!this._relinkChildren(e))return!1;const n=this._childArray;if(n!==void 0&&n!==i)for(let l=0;l<t;l++)n[l]=e[l];return s===void 0?r._touchMutationBoundary():this._notifyChildOrder(e,s),!0}_relinkChildren(i){for(let n=this._firstChild;n!==null;n=n._nextSibling)n._prevSibling=this;const t=i.length;let e=null,r=0;try{for(;r<t;r++){const n=i[r];if(n?._parent!==this||n._prevSibling!==this||n._disposing)break;n._prevSibling=e,e=n}}finally{if(r!==t){let n=null;for(let l=this._firstChild;l!==null;l=l._nextSibling)l._prevSibling=n,n=l}}if(r!==t)return!1;let s=null;for(let n=e;n!==null;n=n._prevSibling)n._nextSibling=s,s=n;return this._firstChild=s,this._lastChild=e,!0}_rejectChildOrder(i){if(i.length===this._childCount&&new Set(i).size===i.length){for(const t of i)if(t._assertAlive(),t._parent!==this)throw new Error(p)}throw new Error(O)}_indexChildren(){const i=new Map;let t=0;for(let e=this._firstChild;e!==null;e=e._nextSibling)i.set(e,t++);return i}_publishChildOrder(i){let t=this._childArray;if(t===void 0)t=this._materializeChildren();else{let e=0;for(let r=this._firstChild;r!==null;r=r._nextSibling)t[e++]=r}this._notifyChildOrder(t,i)}_notifyChildOrder(i,t){const e=this.runtime;e._runNodeMutation(()=>{for(let r=0;r<i.length;r++){const s=i[r],n=t.get(s);if(n===r)continue;const l=d(s);e._notifyNodeStructure(s,{node:s,oldParent:this,newParent:this,oldIndex:n,newIndex:r},l,l)}})}_relinkBefore(i,t){const e=i._prevSibling,r=i._nextSibling;e===null?this._firstChild=r:e._nextSibling=r,r===null?this._lastChild=e:r._prevSibling=e;const s=t===null?this._lastChild:t._prevSibling;i._prevSibling=s,i._nextSibling=t,s===null?this._firstChild=i:s._nextSibling=i,t===null?this._lastChild=i:t._prevSibling=i}_materializeChildren(){return this._childArray=this._collectChildren()}_collectChildren(){const i=[];for(let t=this._firstChild;t!==null;t=t._nextSibling)i.push(t);return i}_clearChildArray(){const i=this._childArray;i!==void 0&&(i.length=0,this._childArray=void 0)}_appendChild(i){const t=this._lastChild;i._prevSibling=t,t===null?this._firstChild=i:t._nextSibling=i,this._lastChild=i,this._childCount++;const e=this._childArray;e!==void 0&&e.push(i)}_indexIn(i){return this._prevSibling===null?i._firstChild===this?0:-1:i._lastChild===this?i._childCount-1:(i._childArray??i._materializeChildren()).indexOf(this)}_unlinkFrom(i,t){const e=this._prevSibling,r=this._nextSibling;if(e===null){if(i._firstChild!==this)return;i._firstChild=r}else e._nextSibling=r,this._prevSibling=null;r===null?i._lastChild=e:(r._prevSibling=e,this._nextSibling=null),i._childCount--;const s=i._childArray;if(s!==void 0)if(r===null)s.pop();else if(t<0&&!i._disposing&&!this.runtime._hasNodeSubscribers())i._childArray=void 0;else if(e===null)s.shift();else{const n=t>=0?t:s.indexOf(this);n>=0?s.splice(n,1):i._childArray=void 0}}_takeChildSnapshot(){const i=this._childArray;return i===void 0?this._collectChildren():(this._childArray=void 0,i)}_resetChildList(i){i.length=0,this._clearChildArray();let t=this._firstChild;for(;t!==null;){const e=t._nextSibling;t._prevSibling=null,t._nextSibling=null,t=e}this._firstChild=null,this._lastChild=null,this._childCount=0}}function N(_,i,t){return new u(_,i,t,C)}u.prototype._isNode=!0;function d(_){const i=[];for(let t=_;t!==null;t=t.parent)i.push(t);return i}function v(_){if(!Number.isFinite(_))throw new TypeError("[Raph] Node priority must be finite.")}f=u.prototype.dispose;c=u.prototype._disposeWithOutcome;exports.RaphNode=u;exports.createProvisionalNode=N;