0&&(t[s]=n[o-1]),n[o]=s)}}for(o=n.length,a=n[o-1];o-- >0;)n[o]=a,a=t[a];return n}function Pf(e){const t=e.subTree.component;if(t)return t.asyncDep&&!t.asyncResolved?t:Pf(t)}function Tc(e){if(e)for(let t=0;t=5)break}}this._dirtyLevel===1&&(this._dirtyLevel=0),mn()}return this._dirtyLevel>=5}set dirty(t){this._dirtyLevel=t?5:0}run(){if(this._dirtyLevel=0,!this.active)return this.fn();let t=Ln,n=es;try{return Ln=!0,es=this,this._runnings++,ic(this),this.fn()}finally{oc(this),this._runnings--,es=n,Ln=t}}stop(){this.active&&(ic(this),oc(this),this.onStop&&this.onStop(),this.active=!1)}}function hm(e){return e.value}function ic(e){e._trackId++,e._depsLength=0}function oc(e){if(e.deps.length>e._depsLength){for(let t=e._depsLength;t