vestjs-runtime 0.0.2-next-2cf993 → 0.0.2-next-04eea9

package/dist/cjs/vestjs-runtime.development.js

@@ -19,6 +19,7 @@ class IsolateMutator {
     static addChild(isolate, child) {
         vestUtils.invariant(isolate.children);
         isolate.children.push(child);
+        IsolateMutator.setParent(child, isolate);
     }
     static removeChild(isolate, node) {
         var _a, _b;
@@ -122,12 +123,12 @@ function pluck(startNode, predicate, visitOnly) {
 //startNode that satisfies the given predicate function.
 function closest(startNode, predicate) {
     let current = startNode;
-    while (current.parent) {
+    do {
         if (predicate(current)) {
             return current;
         }
         current = current.parent;
-    }
+    } while (current);
     return null;
 }
 // This function returns true if the closest ancestor Isolates of the
@@ -164,11 +165,10 @@ class IsolateInspector {
         return (_b = (_a = isolate.children) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0;
     }
     static shouldAllowReorder(isolate) {
-        var _a;
         if (vestUtils.isNullish(isolate)) {
             return false;
         }
-        return (_a = closestExists(isolate, node => node.allowReorder)) !== null && _a !== void 0 ? _a : false;
+        return closestExists(isolate, node => node.allowReorder);
     }
     static usesKey(isolate) {
         if (vestUtils.isNullish(isolate)) {
@@ -362,7 +362,7 @@ class Isolate {
         this.parent = null;
         this.key = null;
         this.allowReorder = false;
-        this.type = Symbol('Isolate');
+        this.type = 'Isolate';
     }
     static create(callback, data) {
         const parent = useIsolate();

package/dist/cjs/vestjs-runtime.production.js

@@ -1 +1 @@
-"use strict";var t=require("vest-utils"),e=require("context");class n{static setParent(t,e){return t.parent=e,t}static saveOutput(t,e){return t.output=e,t}static setKey(t,e){return t.key=e,t}static addChild(e,n){t.invariant(e.children),e.children.push(n)}static removeChild(t,e){var n,r;t.children=null!==(r=null===(n=t.children)||void 0===n?void 0:n.filter((t=>t!==e)))&&void 0!==r?r:null}static slice(e,n){t.isNullish(e.children)||(e.children.length=n)}}function r(e,n,i){if(t.isNullish(e.children))return;let s=!1;for(const u of e.children){if(s)return;if((t.isNullish(i)||t.optionalFunctionValue(i,u))&&n(u,o),s)return;r(u,((t,e)=>{n(t,(()=>{e(),o()}))}),i)}function o(){s=!0}}function i(t,e,n){let i=!1;return r(t,((t,n)=>{e(t)&&(n(),i=!0)}),n),i}function s(t,e){let n=t;for(;n.parent;){if(e(n))return n;n=n.parent}return null}function o(t,e){return!!s(t,e)}var u,l=Object.freeze({__proto__:null,closest:s,closestExists:o,every:function(t,e,n){let i=!0;return r(t,((t,n)=>{e(t)||(n(),i=!1)}),n),i},find:function(t,e,n){let i=null;return r(t,((t,n)=>{e(t)&&(n(),i=t)}),n),i},has:function(t,e){return i(t,(()=>!0),e)},pluck:function(t,e,i){r(t,(t=>{e(t)&&t.parent&&n.removeChild(t.parent,t)}),i)},some:i,walk:r});class c{static at(e,n){var r,i;return t.isNullish(e)?null:null!==(i=null===(r=e.children)||void 0===r?void 0:r[n])&&void 0!==i?i:null}static cursor(e){var n,r;return t.isNullish(e)?0:null!==(r=null===(n=e.children)||void 0===n?void 0:n.length)&&void 0!==r?r:0}static shouldAllowReorder(e){var n;return!t.isNullish(e)&&(null!==(n=o(e,(t=>t.allowReorder)))&&void 0!==n&&n)}static usesKey(e){return!t.isNullish(e)&&t.isNotNullish(e.key)}}!function(t){t.NO_ACTIVE_ISOLATE="Not within an active isolate",t.ENCOUNTERED_THE_SAME_KEY_TWICE='Encountered the same test key "{key}" twice. This may lead to tests overriding each other\'s results, or to tests being unexpectedly omitted.'}(u||(u={}));const a=e.createCascade(((e,n)=>{if(n)return null;t.invariant(e.historyRoot);const[r]=e.historyRoot(),i={};return t.assign(i,{historyNode:r,runtimeNode:null,runtimeRoot:null,stateRef:e}),i})),d=a.run,h={Run:d,addNodeToHistory:y,createRef:function(e){return Object.freeze({historyRoot:t.tinyState.createTinyState(null),Bus:t.bus.createBus(),appData:t.optionalFunctionValue(e)})},persist:f,reset:function(){const[,,t]=p();t()},useAvailableRoot:function(){const t=R();if(t)return t;const[e]=p();return e},useCurrentCursor:function(){const t=E();return t?c.cursor(t):0},useXAppData:function(){return v().stateRef.appData}};function f(t){const e=a.useX();return(...n)=>{var r;const i=null!==(r=a.use())&&void 0!==r?r:e;return a.run(i.stateRef,(()=>t(...n)))}}function v(){return a.useX()}function p(){return v().stateRef.historyRoot()}function N(){return v().historyNode}function y(e){const r=E();r?function(e){const r=E();t.invariant(r,u.NO_ACTIVE_ISOLATE),n.addChild(r,e)}(e):function(t){const[,e]=p();e(t)}(e),n.setParent(e,r)}function E(){var t;return null!==(t=v().runtimeNode)&&void 0!==t?t:null}function R(){return v().runtimeRoot}class _{static reconcile(e,n,r){const i=E(),s=N();let o=s;i&&(o=c.at(s,c.cursor(i)));const u=e(n,o);return t.invariant(u),Object.is(u,n)?[n,m(o,n,r)]:[u,u.output]}static removeAllNextNodesInIsolate(){const t=E(),e=N();e&&t&&n.slice(e,c.cursor(t))}static handleIsolateNodeWithKey(e){t.invariant(c.usesKey(e));const n=function(e){var n;if(t.isNullish(e))return null;const r=v().historyNode;return null!==(n=null==r?void 0:r.keys[e])&&void 0!==n?n:null}(e.key);let r=e;return t.isNullish(n)||(r=n),function(e,n){if(!e)return;const r=E();t.invariant(r,u.NO_ACTIVE_ISOLATE),t.isNullish(r.keys[e])?r.keys[e]=n:t.deferThrow(t.text(u.ENCOUNTERED_THE_SAME_KEY_TWICE,{key:e}))}(e.key,e),r}}function m(t,e,n){const r=R(),i=d(Object.assign({historyNode:t,runtimeNode:e},!r&&{runtimeRoot:e}),(()=>n(e)));return e.output=i,i}class I{constructor(t){this.children=[],this.keys={},this.parent=null,this.key=null,this.allowReorder=!1,this.type=Symbol("Isolate")}static create(t,e){const r=E(),i=n.setParent(new this(e),r),[s,o]=_.reconcile(this.reconciler,i,t);return n.saveOutput(s,o),y(s),s}}function T(){return v().stateRef.Bus}function k(e,n){const r=T().emit;return t.isNullish(e)||r(e,n),f(r)}I.reconciler=function(e,n){return t.isNullish(n),e};var O=Object.freeze({__proto__:null,useBus:T,useEmit:k,usePrepareEmitter:function(t){const e=k();return n=>e(t,n)}});exports.Bus=O,exports.Isolate=I,exports.IsolateInspector=c,exports.IsolateMutator=n,exports.Reconciler=_,exports.VestRuntime=h,exports.Walker=l;
+"use strict";var t=require("vest-utils"),e=require("context");class n{static setParent(t,e){return t.parent=e,t}static saveOutput(t,e){return t.output=e,t}static setKey(t,e){return t.key=e,t}static addChild(e,r){t.invariant(e.children),e.children.push(r),n.setParent(r,e)}static removeChild(t,e){var n,r;t.children=null!==(r=null===(n=t.children)||void 0===n?void 0:n.filter((t=>t!==e)))&&void 0!==r?r:null}static slice(e,n){t.isNullish(e.children)||(e.children.length=n)}}function r(e,n,i){if(t.isNullish(e.children))return;let s=!1;for(const o of e.children){if(s)return;if((t.isNullish(i)||t.optionalFunctionValue(i,o))&&n(o,u),s)return;r(o,((t,e)=>{n(t,(()=>{e(),u()}))}),i)}function u(){s=!0}}function i(t,e,n){let i=!1;return r(t,((t,n)=>{e(t)&&(n(),i=!0)}),n),i}function s(t,e){let n=t;do{if(e(n))return n;n=n.parent}while(n);return null}function u(t,e){return!!s(t,e)}var o,l=Object.freeze({__proto__:null,closest:s,closestExists:u,every:function(t,e,n){let i=!0;return r(t,((t,n)=>{e(t)||(n(),i=!1)}),n),i},find:function(t,e,n){let i=null;return r(t,((t,n)=>{e(t)&&(n(),i=t)}),n),i},has:function(t,e){return i(t,(()=>!0),e)},pluck:function(t,e,i){r(t,(t=>{e(t)&&t.parent&&n.removeChild(t.parent,t)}),i)},some:i,walk:r});class c{static at(e,n){var r,i;return t.isNullish(e)?null:null!==(i=null===(r=e.children)||void 0===r?void 0:r[n])&&void 0!==i?i:null}static cursor(e){var n,r;return t.isNullish(e)?0:null!==(r=null===(n=e.children)||void 0===n?void 0:n.length)&&void 0!==r?r:0}static shouldAllowReorder(e){return!t.isNullish(e)&&u(e,(t=>t.allowReorder))}static usesKey(e){return!t.isNullish(e)&&t.isNotNullish(e.key)}}!function(t){t.NO_ACTIVE_ISOLATE="Not within an active isolate",t.ENCOUNTERED_THE_SAME_KEY_TWICE='Encountered the same test key "{key}" twice. This may lead to tests overriding each other\'s results, or to tests being unexpectedly omitted.'}(o||(o={}));const a=e.createCascade(((e,n)=>{if(n)return null;t.invariant(e.historyRoot);const[r]=e.historyRoot(),i={};return t.assign(i,{historyNode:r,runtimeNode:null,runtimeRoot:null,stateRef:e}),i})),d=a.run,h={Run:d,addNodeToHistory:y,createRef:function(e){return Object.freeze({historyRoot:t.tinyState.createTinyState(null),Bus:t.bus.createBus(),appData:t.optionalFunctionValue(e)})},persist:f,reset:function(){const[,,t]=p();t()},useAvailableRoot:function(){const t=R();if(t)return t;const[e]=p();return e},useCurrentCursor:function(){const t=E();return t?c.cursor(t):0},useXAppData:function(){return v().stateRef.appData}};function f(t){const e=a.useX();return(...n)=>{var r;const i=null!==(r=a.use())&&void 0!==r?r:e;return a.run(i.stateRef,(()=>t(...n)))}}function v(){return a.useX()}function p(){return v().stateRef.historyRoot()}function N(){return v().historyNode}function y(e){const r=E();r?function(e){const r=E();t.invariant(r,o.NO_ACTIVE_ISOLATE),n.addChild(r,e)}(e):function(t){const[,e]=p();e(t)}(e),n.setParent(e,r)}function E(){var t;return null!==(t=v().runtimeNode)&&void 0!==t?t:null}function R(){return v().runtimeRoot}class _{static reconcile(e,n,r){const i=E(),s=N();let u=s;i&&(u=c.at(s,c.cursor(i)));const o=e(n,u);return t.invariant(o),Object.is(o,n)?[n,m(u,n,r)]:[o,o.output]}static removeAllNextNodesInIsolate(){const t=E(),e=N();e&&t&&n.slice(e,c.cursor(t))}static handleIsolateNodeWithKey(e){t.invariant(c.usesKey(e));const n=function(e){var n;if(t.isNullish(e))return null;const r=v().historyNode;return null!==(n=null==r?void 0:r.keys[e])&&void 0!==n?n:null}(e.key);let r=e;return t.isNullish(n)||(r=n),function(e,n){if(!e)return;const r=E();t.invariant(r,o.NO_ACTIVE_ISOLATE),t.isNullish(r.keys[e])?r.keys[e]=n:t.deferThrow(t.text(o.ENCOUNTERED_THE_SAME_KEY_TWICE,{key:e}))}(e.key,e),r}}function m(t,e,n){const r=R(),i=d(Object.assign({historyNode:t,runtimeNode:e},!r&&{runtimeRoot:e}),(()=>n(e)));return e.output=i,i}class I{constructor(t){this.children=[],this.keys={},this.parent=null,this.key=null,this.allowReorder=!1,this.type="Isolate"}static create(t,e){const r=E(),i=n.setParent(new this(e),r),[s,u]=_.reconcile(this.reconciler,i,t);return n.saveOutput(s,u),y(s),s}}function T(){return v().stateRef.Bus}function k(e,n){const r=T().emit;return t.isNullish(e)||r(e,n),f(r)}I.reconciler=function(e,n){return t.isNullish(n),e};var O=Object.freeze({__proto__:null,useBus:T,useEmit:k,usePrepareEmitter:function(t){const e=k();return n=>e(t,n)}});exports.Bus=O,exports.Isolate=I,exports.IsolateInspector=c,exports.IsolateMutator=n,exports.Reconciler=_,exports.VestRuntime=h,exports.Walker=l;

package/dist/es/vestjs-runtime.development.js

@@ -17,6 +17,7 @@ class IsolateMutator {
     static addChild(isolate, child) {
         invariant(isolate.children);
         isolate.children.push(child);
+        IsolateMutator.setParent(child, isolate);
     }
     static removeChild(isolate, node) {
         var _a, _b;
@@ -120,12 +121,12 @@ function pluck(startNode, predicate, visitOnly) {
 //startNode that satisfies the given predicate function.
 function closest(startNode, predicate) {
     let current = startNode;
-    while (current.parent) {
+    do {
         if (predicate(current)) {
             return current;
         }
         current = current.parent;
-    }
+    } while (current);
     return null;
 }
 // This function returns true if the closest ancestor Isolates of the
@@ -162,11 +163,10 @@ class IsolateInspector {
         return (_b = (_a = isolate.children) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0;
     }
     static shouldAllowReorder(isolate) {
-        var _a;
         if (isNullish(isolate)) {
             return false;
         }
-        return (_a = closestExists(isolate, node => node.allowReorder)) !== null && _a !== void 0 ? _a : false;
+        return closestExists(isolate, node => node.allowReorder);
     }
     static usesKey(isolate) {
         if (isNullish(isolate)) {
@@ -360,7 +360,7 @@ class Isolate {
         this.parent = null;
         this.key = null;
         this.allowReorder = false;
-        this.type = Symbol('Isolate');
+        this.type = 'Isolate';
     }
     static create(callback, data) {
         const parent = useIsolate();

package/dist/es/vestjs-runtime.production.js

@@ -1 +1 @@
-import{invariant as t,isNullish as e,optionalFunctionValue as n,isNotNullish as r,assign as o,tinyState as u,bus as i,deferThrow as s,text as c}from"vest-utils";import{createCascade as l}from"context";class a{static setParent(t,e){return t.parent=e,t}static saveOutput(t,e){return t.output=e,t}static setKey(t,e){return t.key=e,t}static addChild(e,n){t(e.children),e.children.push(n)}static removeChild(t,e){var n,r;t.children=null!==(r=null===(n=t.children)||void 0===n?void 0:n.filter((t=>t!==e)))&&void 0!==r?r:null}static slice(t,n){e(t.children)||(t.children.length=n)}}function d(t,r,o){if(e(t.children))return;let u=!1;for(const s of t.children){if(u)return;if((e(o)||n(o,s))&&r(s,i),u)return;d(s,((t,e)=>{r(t,(()=>{e(),i()}))}),o)}function i(){u=!0}}function f(t,e,n){let r=!1;return d(t,((t,n)=>{e(t)&&(n(),r=!0)}),n),r}function h(t,e){let n=t;for(;n.parent;){if(e(n))return n;n=n.parent}return null}function v(t,e){return!!h(t,e)}var y,p=Object.freeze({__proto__:null,closest:h,closestExists:v,every:function(t,e,n){let r=!0;return d(t,((t,n)=>{e(t)||(n(),r=!1)}),n),r},find:function(t,e,n){let r=null;return d(t,((t,n)=>{e(t)&&(n(),r=t)}),n),r},has:function(t,e){return f(t,(()=>!0),e)},pluck:function(t,e,n){d(t,(t=>{e(t)&&t.parent&&a.removeChild(t.parent,t)}),n)},some:f,walk:d});class E{static at(t,n){var r,o;return e(t)?null:null!==(o=null===(r=t.children)||void 0===r?void 0:r[n])&&void 0!==o?o:null}static cursor(t){var n,r;return e(t)?0:null!==(r=null===(n=t.children)||void 0===n?void 0:n.length)&&void 0!==r?r:0}static shouldAllowReorder(t){var n;return!e(t)&&(null!==(n=v(t,(t=>t.allowReorder)))&&void 0!==n&&n)}static usesKey(t){return!e(t)&&r(t.key)}}!function(t){t.NO_ACTIVE_ISOLATE="Not within an active isolate",t.ENCOUNTERED_THE_SAME_KEY_TWICE='Encountered the same test key "{key}" twice. This may lead to tests overriding each other\'s results, or to tests being unexpectedly omitted.'}(y||(y={}));const m=l(((e,n)=>{if(n)return null;t(e.historyRoot);const[r]=e.historyRoot(),u={};return o(u,{historyNode:r,runtimeNode:null,runtimeRoot:null,stateRef:e}),u})),_=m.run,R={Run:_,addNodeToHistory:C,createRef:function(t){return Object.freeze({historyRoot:u.createTinyState(null),Bus:i.createBus(),appData:n(t)})},persist:N,reset:function(){const[,,t]=O();t()},useAvailableRoot:function(){const t=I();if(t)return t;const[e]=O();return e},useCurrentCursor:function(){const t=A();return t?E.cursor(t):0},useXAppData:function(){return k().stateRef.appData}};function N(t){const e=m.useX();return(...n)=>{var r;const o=null!==(r=m.use())&&void 0!==r?r:e;return m.run(o.stateRef,(()=>t(...n)))}}function k(){return m.useX()}function O(){return k().stateRef.historyRoot()}function T(){return k().historyNode}function C(e){const n=A();n?function(e){const n=A();t(n,y.NO_ACTIVE_ISOLATE),a.addChild(n,e)}(e):function(t){const[,e]=O();e(t)}(e),a.setParent(e,n)}function A(){var t;return null!==(t=k().runtimeNode)&&void 0!==t?t:null}function I(){return k().runtimeRoot}class b{static reconcile(e,n,r){const o=A(),u=T();let i=u;o&&(i=E.at(u,E.cursor(o)));const s=e(n,i);return t(s),Object.is(s,n)?[n,w(i,n,r)]:[s,s.output]}static removeAllNextNodesInIsolate(){const t=A(),e=T();e&&t&&a.slice(e,E.cursor(t))}static handleIsolateNodeWithKey(n){t(E.usesKey(n));const r=function(t){var n;if(e(t))return null;const r=k().historyNode;return null!==(n=null==r?void 0:r.keys[t])&&void 0!==n?n:null}(n.key);let o=n;return e(r)||(o=r),function(n,r){if(!n)return;const o=A();t(o,y.NO_ACTIVE_ISOLATE),e(o.keys[n])?o.keys[n]=r:s(c(y.ENCOUNTERED_THE_SAME_KEY_TWICE,{key:n}))}(n.key,n),o}}function w(t,e,n){const r=I(),o=_(Object.assign({historyNode:t,runtimeNode:e},!r&&{runtimeRoot:e}),(()=>n(e)));return e.output=o,o}class S{constructor(t){this.children=[],this.keys={},this.parent=null,this.key=null,this.allowReorder=!1,this.type=Symbol("Isolate")}static create(t,e){const n=A(),r=a.setParent(new this(e),n),[o,u]=b.reconcile(this.reconciler,r,t);return a.saveOutput(o,u),C(o),o}}function K(){return k().stateRef.Bus}function g(t,n){const r=K().emit;return e(t)||r(t,n),N(r)}S.reconciler=function(t,n){return e(n),t};var j=Object.freeze({__proto__:null,useBus:K,useEmit:g,usePrepareEmitter:function(t){const e=g();return n=>e(t,n)}});export{j as Bus,S as Isolate,E as IsolateInspector,a as IsolateMutator,b as Reconciler,R as VestRuntime,p as Walker};
+import{invariant as t,isNullish as e,optionalFunctionValue as n,isNotNullish as r,assign as o,tinyState as u,bus as s,deferThrow as i,text as c}from"vest-utils";import{createCascade as l}from"context";class a{static setParent(t,e){return t.parent=e,t}static saveOutput(t,e){return t.output=e,t}static setKey(t,e){return t.key=e,t}static addChild(e,n){t(e.children),e.children.push(n),a.setParent(n,e)}static removeChild(t,e){var n,r;t.children=null!==(r=null===(n=t.children)||void 0===n?void 0:n.filter((t=>t!==e)))&&void 0!==r?r:null}static slice(t,n){e(t.children)||(t.children.length=n)}}function d(t,r,o){if(e(t.children))return;let u=!1;for(const i of t.children){if(u)return;if((e(o)||n(o,i))&&r(i,s),u)return;d(i,((t,e)=>{r(t,(()=>{e(),s()}))}),o)}function s(){u=!0}}function f(t,e,n){let r=!1;return d(t,((t,n)=>{e(t)&&(n(),r=!0)}),n),r}function h(t,e){let n=t;do{if(e(n))return n;n=n.parent}while(n);return null}function v(t,e){return!!h(t,e)}var y,p=Object.freeze({__proto__:null,closest:h,closestExists:v,every:function(t,e,n){let r=!0;return d(t,((t,n)=>{e(t)||(n(),r=!1)}),n),r},find:function(t,e,n){let r=null;return d(t,((t,n)=>{e(t)&&(n(),r=t)}),n),r},has:function(t,e){return f(t,(()=>!0),e)},pluck:function(t,e,n){d(t,(t=>{e(t)&&t.parent&&a.removeChild(t.parent,t)}),n)},some:f,walk:d});class E{static at(t,n){var r,o;return e(t)?null:null!==(o=null===(r=t.children)||void 0===r?void 0:r[n])&&void 0!==o?o:null}static cursor(t){var n,r;return e(t)?0:null!==(r=null===(n=t.children)||void 0===n?void 0:n.length)&&void 0!==r?r:0}static shouldAllowReorder(t){return!e(t)&&v(t,(t=>t.allowReorder))}static usesKey(t){return!e(t)&&r(t.key)}}!function(t){t.NO_ACTIVE_ISOLATE="Not within an active isolate",t.ENCOUNTERED_THE_SAME_KEY_TWICE='Encountered the same test key "{key}" twice. This may lead to tests overriding each other\'s results, or to tests being unexpectedly omitted.'}(y||(y={}));const _=l(((e,n)=>{if(n)return null;t(e.historyRoot);const[r]=e.historyRoot(),u={};return o(u,{historyNode:r,runtimeNode:null,runtimeRoot:null,stateRef:e}),u})),m=_.run,R={Run:m,addNodeToHistory:C,createRef:function(t){return Object.freeze({historyRoot:u.createTinyState(null),Bus:s.createBus(),appData:n(t)})},persist:N,reset:function(){const[,,t]=O();t()},useAvailableRoot:function(){const t=I();if(t)return t;const[e]=O();return e},useCurrentCursor:function(){const t=A();return t?E.cursor(t):0},useXAppData:function(){return k().stateRef.appData}};function N(t){const e=_.useX();return(...n)=>{var r;const o=null!==(r=_.use())&&void 0!==r?r:e;return _.run(o.stateRef,(()=>t(...n)))}}function k(){return _.useX()}function O(){return k().stateRef.historyRoot()}function T(){return k().historyNode}function C(e){const n=A();n?function(e){const n=A();t(n,y.NO_ACTIVE_ISOLATE),a.addChild(n,e)}(e):function(t){const[,e]=O();e(t)}(e),a.setParent(e,n)}function A(){var t;return null!==(t=k().runtimeNode)&&void 0!==t?t:null}function I(){return k().runtimeRoot}class w{static reconcile(e,n,r){const o=A(),u=T();let s=u;o&&(s=E.at(u,E.cursor(o)));const i=e(n,s);return t(i),Object.is(i,n)?[n,b(s,n,r)]:[i,i.output]}static removeAllNextNodesInIsolate(){const t=A(),e=T();e&&t&&a.slice(e,E.cursor(t))}static handleIsolateNodeWithKey(n){t(E.usesKey(n));const r=function(t){var n;if(e(t))return null;const r=k().historyNode;return null!==(n=null==r?void 0:r.keys[t])&&void 0!==n?n:null}(n.key);let o=n;return e(r)||(o=r),function(n,r){if(!n)return;const o=A();t(o,y.NO_ACTIVE_ISOLATE),e(o.keys[n])?o.keys[n]=r:i(c(y.ENCOUNTERED_THE_SAME_KEY_TWICE,{key:n}))}(n.key,n),o}}function b(t,e,n){const r=I(),o=m(Object.assign({historyNode:t,runtimeNode:e},!r&&{runtimeRoot:e}),(()=>n(e)));return e.output=o,o}class K{constructor(t){this.children=[],this.keys={},this.parent=null,this.key=null,this.allowReorder=!1,this.type="Isolate"}static create(t,e){const n=A(),r=a.setParent(new this(e),n),[o,u]=w.reconcile(this.reconciler,r,t);return a.saveOutput(o,u),C(o),o}}function S(){return k().stateRef.Bus}function g(t,n){const r=S().emit;return e(t)||r(t,n),N(r)}K.reconciler=function(t,n){return e(n),t};var j=Object.freeze({__proto__:null,useBus:S,useEmit:g,usePrepareEmitter:function(t){const e=g();return n=>e(t,n)}});export{j as Bus,K as Isolate,E as IsolateInspector,a as IsolateMutator,w as Reconciler,R as VestRuntime,p as Walker};

package/dist/umd/vestjs-runtime.development.js

@@ -20,6 +20,7 @@
       static addChild(isolate, child) {
           vestUtils.invariant(isolate.children);
           isolate.children.push(child);
+          IsolateMutator.setParent(child, isolate);
       }
       static removeChild(isolate, node) {
           var _a, _b;
@@ -123,12 +124,12 @@
   //startNode that satisfies the given predicate function.
   function closest(startNode, predicate) {
       let current = startNode;
-      while (current.parent) {
+      do {
           if (predicate(current)) {
               return current;
           }
           current = current.parent;
-      }
+      } while (current);
       return null;
   }
   // This function returns true if the closest ancestor Isolates of the
@@ -165,11 +166,10 @@
           return (_b = (_a = isolate.children) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0;
       }
       static shouldAllowReorder(isolate) {
-          var _a;
           if (vestUtils.isNullish(isolate)) {
               return false;
           }
-          return (_a = closestExists(isolate, node => node.allowReorder)) !== null && _a !== void 0 ? _a : false;
+          return closestExists(isolate, node => node.allowReorder);
       }
       static usesKey(isolate) {
           if (vestUtils.isNullish(isolate)) {
@@ -363,7 +363,7 @@
           this.parent = null;
           this.key = null;
           this.allowReorder = false;
-          this.type = Symbol('Isolate');
+          this.type = 'Isolate';
       }
       static create(callback, data) {
           const parent = useIsolate();

package/dist/umd/vestjs-runtime.production.js

@@ -1 +1 @@
-!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports,require("vest-utils"),require("context")):"function"==typeof define&&define.amd?define(["exports","vest-utils","context"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self)["vestjs-runtime"]={},t["vest-utils"],t.context)}(this,(function(t,e,n){"use strict";class r{static setParent(t,e){return t.parent=e,t}static saveOutput(t,e){return t.output=e,t}static setKey(t,e){return t.key=e,t}static addChild(t,n){e.invariant(t.children),t.children.push(n)}static removeChild(t,e){var n,r;t.children=null!==(r=null===(n=t.children)||void 0===n?void 0:n.filter((t=>t!==e)))&&void 0!==r?r:null}static slice(t,n){e.isNullish(t.children)||(t.children.length=n)}}function i(t,n,r){if(e.isNullish(t.children))return;let s=!1;for(const u of t.children){if(s)return;if((e.isNullish(r)||e.optionalFunctionValue(r,u))&&n(u,o),s)return;i(u,((t,e)=>{n(t,(()=>{e(),o()}))}),r)}function o(){s=!0}}function s(t,e,n){let r=!1;return i(t,((t,n)=>{e(t)&&(n(),r=!0)}),n),r}function o(t,e){let n=t;for(;n.parent;){if(e(n))return n;n=n.parent}return null}function u(t,e){return!!o(t,e)}var l,c=Object.freeze({__proto__:null,closest:o,closestExists:u,every:function(t,e,n){let r=!0;return i(t,((t,n)=>{e(t)||(n(),r=!1)}),n),r},find:function(t,e,n){let r=null;return i(t,((t,n)=>{e(t)&&(n(),r=t)}),n),r},has:function(t,e){return s(t,(()=>!0),e)},pluck:function(t,e,n){i(t,(t=>{e(t)&&t.parent&&r.removeChild(t.parent,t)}),n)},some:s,walk:i});class a{static at(t,n){var r,i;return e.isNullish(t)?null:null!==(i=null===(r=t.children)||void 0===r?void 0:r[n])&&void 0!==i?i:null}static cursor(t){var n,r;return e.isNullish(t)?0:null!==(r=null===(n=t.children)||void 0===n?void 0:n.length)&&void 0!==r?r:0}static shouldAllowReorder(t){var n;return!e.isNullish(t)&&(null!==(n=u(t,(t=>t.allowReorder)))&&void 0!==n&&n)}static usesKey(t){return!e.isNullish(t)&&e.isNotNullish(t.key)}}!function(t){t.NO_ACTIVE_ISOLATE="Not within an active isolate",t.ENCOUNTERED_THE_SAME_KEY_TWICE='Encountered the same test key "{key}" twice. This may lead to tests overriding each other\'s results, or to tests being unexpectedly omitted.'}(l||(l={}));const d=n.createCascade(((t,n)=>{if(n)return null;e.invariant(t.historyRoot);const[r]=t.historyRoot(),i={};return e.assign(i,{historyNode:r,runtimeNode:null,runtimeRoot:null,stateRef:t}),i})),f=d.run,h={Run:f,addNodeToHistory:E,createRef:function(t){return Object.freeze({historyRoot:e.tinyState.createTinyState(null),Bus:e.bus.createBus(),appData:e.optionalFunctionValue(t)})},persist:v,reset:function(){const[,,t]=p();t()},useAvailableRoot:function(){const t=_();if(t)return t;const[e]=p();return e},useCurrentCursor:function(){const t=R();return t?a.cursor(t):0},useXAppData:function(){return y().stateRef.appData}};function v(t){const e=d.useX();return(...n)=>{var r;const i=null!==(r=d.use())&&void 0!==r?r:e;return d.run(i.stateRef,(()=>t(...n)))}}function y(){return d.useX()}function p(){return y().stateRef.historyRoot()}function N(){return y().historyNode}function E(t){const n=R();n?function(t){const n=R();e.invariant(n,l.NO_ACTIVE_ISOLATE),r.addChild(n,t)}(t):function(t){const[,e]=p();e(t)}(t),r.setParent(t,n)}function R(){var t;return null!==(t=y().runtimeNode)&&void 0!==t?t:null}function _(){return y().runtimeRoot}class m{static reconcile(t,n,r){const i=R(),s=N();let o=s;i&&(o=a.at(s,a.cursor(i)));const u=t(n,o);return e.invariant(u),Object.is(u,n)?[n,T(o,n,r)]:[u,u.output]}static removeAllNextNodesInIsolate(){const t=R(),e=N();e&&t&&r.slice(e,a.cursor(t))}static handleIsolateNodeWithKey(t){e.invariant(a.usesKey(t));const n=function(t){var n;if(e.isNullish(t))return null;const r=y().historyNode;return null!==(n=null==r?void 0:r.keys[t])&&void 0!==n?n:null}(t.key);let r=t;return e.isNullish(n)||(r=n),function(t,n){if(!t)return;const r=R();e.invariant(r,l.NO_ACTIVE_ISOLATE),e.isNullish(r.keys[t])?r.keys[t]=n:e.deferThrow(e.text(l.ENCOUNTERED_THE_SAME_KEY_TWICE,{key:t}))}(t.key,t),r}}function T(t,e,n){const r=_(),i=f(Object.assign({historyNode:t,runtimeNode:e},!r&&{runtimeRoot:e}),(()=>n(e)));return e.output=i,i}class I{constructor(t){this.children=[],this.keys={},this.parent=null,this.key=null,this.allowReorder=!1,this.type=Symbol("Isolate")}static create(t,e){const n=R(),i=r.setParent(new this(e),n),[s,o]=m.reconcile(this.reconciler,i,t);return r.saveOutput(s,o),E(s),s}}function k(){return y().stateRef.Bus}function O(t,n){const r=k().emit;return e.isNullish(t)||r(t,n),v(r)}I.reconciler=function(t,n){return e.isNullish(n),t};var C=Object.freeze({__proto__:null,useBus:k,useEmit:O,usePrepareEmitter:function(t){const e=O();return n=>e(t,n)}});t.Bus=C,t.Isolate=I,t.IsolateInspector=a,t.IsolateMutator=r,t.Reconciler=m,t.VestRuntime=h,t.Walker=c}));
+!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports,require("vest-utils"),require("context")):"function"==typeof define&&define.amd?define(["exports","vest-utils","context"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self)["vestjs-runtime"]={},t["vest-utils"],t.context)}(this,(function(t,e,n){"use strict";class r{static setParent(t,e){return t.parent=e,t}static saveOutput(t,e){return t.output=e,t}static setKey(t,e){return t.key=e,t}static addChild(t,n){e.invariant(t.children),t.children.push(n),r.setParent(n,t)}static removeChild(t,e){var n,r;t.children=null!==(r=null===(n=t.children)||void 0===n?void 0:n.filter((t=>t!==e)))&&void 0!==r?r:null}static slice(t,n){e.isNullish(t.children)||(t.children.length=n)}}function i(t,n,r){if(e.isNullish(t.children))return;let s=!1;for(const o of t.children){if(s)return;if((e.isNullish(r)||e.optionalFunctionValue(r,o))&&n(o,u),s)return;i(o,((t,e)=>{n(t,(()=>{e(),u()}))}),r)}function u(){s=!0}}function s(t,e,n){let r=!1;return i(t,((t,n)=>{e(t)&&(n(),r=!0)}),n),r}function u(t,e){let n=t;do{if(e(n))return n;n=n.parent}while(n);return null}function o(t,e){return!!u(t,e)}var l,c=Object.freeze({__proto__:null,closest:u,closestExists:o,every:function(t,e,n){let r=!0;return i(t,((t,n)=>{e(t)||(n(),r=!1)}),n),r},find:function(t,e,n){let r=null;return i(t,((t,n)=>{e(t)&&(n(),r=t)}),n),r},has:function(t,e){return s(t,(()=>!0),e)},pluck:function(t,e,n){i(t,(t=>{e(t)&&t.parent&&r.removeChild(t.parent,t)}),n)},some:s,walk:i});class a{static at(t,n){var r,i;return e.isNullish(t)?null:null!==(i=null===(r=t.children)||void 0===r?void 0:r[n])&&void 0!==i?i:null}static cursor(t){var n,r;return e.isNullish(t)?0:null!==(r=null===(n=t.children)||void 0===n?void 0:n.length)&&void 0!==r?r:0}static shouldAllowReorder(t){return!e.isNullish(t)&&o(t,(t=>t.allowReorder))}static usesKey(t){return!e.isNullish(t)&&e.isNotNullish(t.key)}}!function(t){t.NO_ACTIVE_ISOLATE="Not within an active isolate",t.ENCOUNTERED_THE_SAME_KEY_TWICE='Encountered the same test key "{key}" twice. This may lead to tests overriding each other\'s results, or to tests being unexpectedly omitted.'}(l||(l={}));const d=n.createCascade(((t,n)=>{if(n)return null;e.invariant(t.historyRoot);const[r]=t.historyRoot(),i={};return e.assign(i,{historyNode:r,runtimeNode:null,runtimeRoot:null,stateRef:t}),i})),f=d.run,h={Run:f,addNodeToHistory:E,createRef:function(t){return Object.freeze({historyRoot:e.tinyState.createTinyState(null),Bus:e.bus.createBus(),appData:e.optionalFunctionValue(t)})},persist:v,reset:function(){const[,,t]=p();t()},useAvailableRoot:function(){const t=_();if(t)return t;const[e]=p();return e},useCurrentCursor:function(){const t=R();return t?a.cursor(t):0},useXAppData:function(){return y().stateRef.appData}};function v(t){const e=d.useX();return(...n)=>{var r;const i=null!==(r=d.use())&&void 0!==r?r:e;return d.run(i.stateRef,(()=>t(...n)))}}function y(){return d.useX()}function p(){return y().stateRef.historyRoot()}function N(){return y().historyNode}function E(t){const n=R();n?function(t){const n=R();e.invariant(n,l.NO_ACTIVE_ISOLATE),r.addChild(n,t)}(t):function(t){const[,e]=p();e(t)}(t),r.setParent(t,n)}function R(){var t;return null!==(t=y().runtimeNode)&&void 0!==t?t:null}function _(){return y().runtimeRoot}class m{static reconcile(t,n,r){const i=R(),s=N();let u=s;i&&(u=a.at(s,a.cursor(i)));const o=t(n,u);return e.invariant(o),Object.is(o,n)?[n,T(u,n,r)]:[o,o.output]}static removeAllNextNodesInIsolate(){const t=R(),e=N();e&&t&&r.slice(e,a.cursor(t))}static handleIsolateNodeWithKey(t){e.invariant(a.usesKey(t));const n=function(t){var n;if(e.isNullish(t))return null;const r=y().historyNode;return null!==(n=null==r?void 0:r.keys[t])&&void 0!==n?n:null}(t.key);let r=t;return e.isNullish(n)||(r=n),function(t,n){if(!t)return;const r=R();e.invariant(r,l.NO_ACTIVE_ISOLATE),e.isNullish(r.keys[t])?r.keys[t]=n:e.deferThrow(e.text(l.ENCOUNTERED_THE_SAME_KEY_TWICE,{key:t}))}(t.key,t),r}}function T(t,e,n){const r=_(),i=f(Object.assign({historyNode:t,runtimeNode:e},!r&&{runtimeRoot:e}),(()=>n(e)));return e.output=i,i}class I{constructor(t){this.children=[],this.keys={},this.parent=null,this.key=null,this.allowReorder=!1,this.type="Isolate"}static create(t,e){const n=R(),i=r.setParent(new this(e),n),[s,u]=m.reconcile(this.reconciler,i,t);return r.saveOutput(s,u),E(s),s}}function k(){return y().stateRef.Bus}function O(t,n){const r=k().emit;return e.isNullish(t)||r(t,n),v(r)}I.reconciler=function(t,n){return e.isNullish(n),t};var C=Object.freeze({__proto__:null,useBus:k,useEmit:O,usePrepareEmitter:function(t){const e=O();return n=>e(t,n)}});t.Bus=C,t.Isolate=I,t.IsolateInspector=a,t.IsolateMutator=r,t.Reconciler=m,t.VestRuntime=h,t.Walker=c}));

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "vestjs-runtime",
-  "version": "0.0.2-next-2cf993",
+  "version": "0.0.2-next-04eea9",
   "description": "Internal runtime module used by Vest",
   "license": "MIT",
   "author": "ealush",
@@ -18,8 +18,8 @@
     "url": "https://github.com/ealush/vest.git/issues"
   },
   "dependencies": {
-    "context": "3.0.9-next-2cf993",
-    "vest-utils": "1.0.0-next-2cf993"
+    "context": "3.0.9-next-04eea9",
+    "vest-utils": "1.0.0-next-04eea9"
   },
   "exports": {
     ".": {

package/types/vestjs-runtime.d.ts

@@ -1,9 +1,9 @@
-import { CB, TinyState, BusType } from "vest-utils";
+import { CB, Nullable, TinyState, BusType, DynamicValue } from "vest-utils";
 // I would rather not use `any` here, but instead use `Isolate`.
 // The problem is that it breaks the actual implementation of `Isolate` in `IsolateTest`
 // As it is not properly extending `Isolate`.
 interface IRecociler<I = any> {
-    (currentNode: I, historicNode: Isolate | null): I;
+    (currentNode: I, historicNode: Nullable<Isolate>): I;
 }
 declare class Reconciler {
     static reconcile<Callback extends CB = CB>(reconciler: IRecociler<Isolate>, node: Isolate, callback: Callback): [
@@ -13,15 +13,15 @@ declare class Reconciler {
     static removeAllNextNodesInIsolate(): void;
     static handleIsolateNodeWithKey(node: Isolate): Isolate;
 }
-type IsolateKey = null | string;
+type IsolateKey = Nullable<string>;
 declare class Isolate<_D = any> {
-    children: Isolate[] | null;
+    children: Nullable<Isolate[]>;
     keys: Record<string, Isolate>;
-    parent: Isolate | null;
+    parent: Nullable<Isolate>;
     output: any;
     key: IsolateKey;
     allowReorder: boolean;
-    type: symbol;
+    type: string;
     // eslint-disable-next-line @typescript-eslint/no-unused-vars, @typescript-eslint/no-empty-function
     constructor(_data?: _D);
     static reconciler: IRecociler;
@@ -32,9 +32,9 @@ declare namespace Walker {
     // The problem is that it breaks the actual implementation of `Isolate` in `IsolateTest`
     // As it is not properly extending `Isolate`.
     interface IRecociler<I = any> {
-        (currentNode: I, historicNode: Isolate | null): I;
+        (currentNode: I, historicNode: Nullable<Isolate>): I;
     }
-    function BaseReconciler(currentNode: Isolate, historicNode: Isolate | null): Isolate;
+    function BaseReconciler(currentNode: Isolate, historicNode: Nullable<Isolate>): Isolate;
     class Reconciler {
         static reconcile<Callback extends CB = CB>(reconciler: IRecociler<Isolate>, node: Isolate, callback: Callback): [
             Isolate,
@@ -43,15 +43,15 @@ declare namespace Walker {
         static removeAllNextNodesInIsolate(): void;
         static handleIsolateNodeWithKey(node: Isolate): Isolate;
     }
-    type IsolateKey = null | string;
+    type IsolateKey = Nullable<string>;
     class Isolate<_D = any> {
-        children: Isolate[] | null;
+        children: Nullable<Isolate[]>;
         keys: Record<string, Isolate>;
-        parent: Isolate | null;
+        parent: Nullable<Isolate>;
         output: any;
         key: IsolateKey;
         allowReorder: boolean;
-        type: symbol;
+        type: string;
         // eslint-disable-next-line @typescript-eslint/no-unused-vars, @typescript-eslint/no-empty-function
         constructor(_data?: _D);
         static reconciler: IRecociler;
@@ -68,7 +68,7 @@ declare namespace Walker {
     function has(startNode: Isolate, match: VisitOnlyPredicate): boolean;
     // This function returns the first Isolate object in the tree that satisfies the given predicate function.
     // If visitOnly is provided, only Isolate objects that satisfy the predicate are visited.
-    function find(startNode: Isolate, predicate: (node: Isolate) => boolean, visitOnly?: VisitOnlyPredicate): Isolate | null;
+    function find(startNode: Isolate, predicate: (node: Isolate) => boolean, visitOnly?: VisitOnlyPredicate): Nullable<Isolate>;
     // This function returns true if the given predicate function returns true for every Isolate object in the tree.
     // If visitOnly is provided, only Isolate objects that satisfy the predicate are visited.
     function every(startNode: Isolate, predicate: (node: Isolate) => boolean, visitOnly?: VisitOnlyPredicate): boolean;
@@ -78,19 +78,19 @@ declare namespace Walker {
     function pluck(startNode: Isolate, predicate: (node: Isolate) => boolean, visitOnly?: VisitOnlyPredicate): void;
     // Returns the closest ancestor Isolate object of the given
     //startNode that satisfies the given predicate function.
-    function closest(startNode: Isolate, predicate: (node: Isolate) => boolean): Isolate | null;
+    function closest(startNode: Isolate, predicate: (node: Isolate) => boolean): Nullable<Isolate>;
     // This function returns true if the closest ancestor Isolates of the
     // given startNode that satisfies the given predicate function exists.
     function closestExists(startNode: Isolate, predicate: (node: Isolate) => boolean): boolean;
 }
 type CTXType = StateRefType & {
-    historyNode: Isolate | null;
-    runtimeNode: Isolate | null;
-    runtimeRoot: Isolate | null;
+    historyNode: Nullable<Isolate>;
+    runtimeNode: Nullable<Isolate>;
+    runtimeRoot: Nullable<Isolate>;
     stateRef: StateRefType;
 };
 type StateRefType = {
-    historyRoot: TinyState<Isolate | null>;
+    historyRoot: TinyState<Nullable<Isolate>>;
     Bus: BusType;
     appData: Record<string, any>;
 };
@@ -105,22 +105,22 @@ declare const RuntimeApi: {
     useXAppData: typeof useXAppData;
 };
 declare function useXAppData<T = object>(): T;
-declare function createRef(setter: Record<string, any> | (() => Record<string, any>)): StateRefType;
-declare function persist<T extends CB>(cb: T): T;
+declare function createRef(setter: DynamicValue<Record<string, any>>): StateRefType;
+declare function persist<T extends (...args: any[]) => any>(cb: T): T;
 declare function addNodeToHistory(node: Isolate): void;
 declare function useCurrentCursor(): number;
 declare function useAvailableRoot<I extends Isolate = Isolate>(): I;
 declare function reset(): void;
 declare class IsolateInspector {
-    static at(isolate: Isolate | null, at: number): Isolate | null;
-    static cursor(isolate: Isolate | null): number;
-    static shouldAllowReorder(isolate: Isolate | null): boolean;
-    static usesKey(isolate: Isolate | null): boolean;
+    static at(isolate: Nullable<Isolate>, at: number): Nullable<Isolate>;
+    static cursor(isolate: Nullable<Isolate>): number;
+    static shouldAllowReorder(isolate: Nullable<Isolate>): boolean;
+    static usesKey(isolate: Nullable<Isolate>): boolean;
 }
 declare class IsolateMutator {
-    static setParent(isolate: Isolate, parent: Isolate | null): Isolate;
+    static setParent(isolate: Isolate, parent: Nullable<Isolate>): Isolate;
     static saveOutput(isolate: Isolate, output: any): Isolate;
-    static setKey(isolate: Isolate, key: string | null): Isolate;
+    static setKey(isolate: Isolate, key: Nullable<string>): Isolate;
     static addChild(isolate: Isolate, child: Isolate): void;
     static removeChild(isolate: Isolate, node: Isolate): void;
     static slice(isolate: Isolate, at: number): void;