@fluixi/reactive 1.0.0-alpha.83 → 1.0.0-alpha.84

package/dist/lib/signal/graph/compat.mjs

@@ -1 +1,556 @@
-var K="__fluixi_signal_next_state__",F=e=>{typeof queueMicrotask=="function"?queueMicrotask(e):Promise.resolve().then(e)},n=globalThis[K]??={consumer:null,untracked:!1,owner:null,queue:[],scheduled:!1,flushing:!1,batchDepth:0,hostSchedule:F,onSuspend:null,onError:null,observer:null};var D="1.0.0-alpha.83";function L(e){return n.observer=e,()=>{n.observer===e&&(n.observer=null)}}var g=[],Y;function d(e){let t=n.observer;t&&t.created(e.parents===void 0?{...e,parents:g,origin:e.origin??Y}:e)}function P(e){return n.observer?(g.push(e),!0):!1}function E(){g.pop()}function A(e){n.observer?.ran?.(e)}function I(e,t){n.observer?.wrote?.(e,t)}function f(e){n.observer?.disposed?.(e)}var $="__FLUIXI_DEVTOOLS_HOOK__",N=globalThis[$];if(typeof N?.inject=="function")try{N.inject({observeReactiveNodes:L,version:D})}catch{}function R(){return n.observer!=null}var M=0,W=1,p=2,h=class{constructor(){this.observers=null;this.watchers=null;this.version=0}updateIfNecessary(){}track(){if(n.untracked)return;let t=n.consumer;t&&((this.observers??=new Set).add(t),(t.sources??=new Set).add(this))}},w=class extends h{constructor(t,r){super(),this._value=t,this._equals=r?.equals===!1?()=>!1:r?.equals??Object.is}get(){return this.track(),this._value}set(t){if(!this._equals(this._value,t)){if(this._value=t,this.version++,I(this,n.consumer),this.observers)for(let r of[...this.observers])r.markDirty(p);O(this)}}peek(){return this._value}},l=class extends h{constructor(r,o){super();this._threw=!1;this._initialized=!1;this.state=p;this.sources=null;this._fn=r,this._equals=o?.equals===!1?()=>!1:o?.equals??Object.is}get(){if(n.consumer===this)throw new Error("Signal.Computed cannot read itself");if(this.track(),this.updateIfNecessary(),this._threw)throw this._error;return this._value}updateIfNecessary(){if(this.state===W&&this.sources){for(let r of this.sources)if(r.updateIfNecessary(),this.state===p)break}(this.state===p||!this._initialized)&&this.recompute(),this.state=M}recompute(){if(this.sources){for(let c of this.sources)c.observers?.delete(this);this.sources.clear()}let r=n.consumer,o=n.untracked,u=P(this);n.consumer=this,n.untracked=!1;let i,s=!1,a;try{i=this._fn()}catch(c){s=!0,a=c,i=this._value}finally{n.consumer=r,n.untracked=o,u&&E()}let x=!this._initialized||this._threw!==s||(s?a!==this._error:!this._equals(this._value,i));if(this._initialized=!0,this._threw=s,this._error=a,this._value=i,A(this),x){if(this.version++,this.observers)for(let c of[...this.observers])c.markDirty(p);O(this)}}markDirty(r){if(this.state>=r)return;let o=this.state===M;if(this.state=r,o){if(this.observers)for(let u of[...this.observers])u.markDirty(W);O(this)}}peek(){if(this.updateIfNecessary(),this._threw)throw this._error;return this._value}};function O(e){if(e.watchers)for(let t of[...e.watchers])t._notify(e)}var b=class{constructor(t){this._watched=new Set;this._pending=new Set;this._notifyFn=t}watch(...t){for(let r of t)this._watched.add(r),(r.watchers??=new Set).add(this)}unwatch(...t){for(let r of t)this._watched.delete(r),r.watchers?.delete(this),this._pending.delete(r)}getPending(){let t=[...this._pending];return this._pending.clear(),t}_notify(t){if(!this._watched.has(t)||this._pending.has(t))return;let r=this._pending.size===0;this._pending.add(t),r&&this._notifyFn()}};function _(e){if(n.untracked)return e();n.untracked=!0;try{return e()}finally{n.untracked=!1}}function j(e){return{cleanups:null,owned:null,parent:e,contexts:null}}function V(e){return n.onSuspend?(n.onSuspend(e,n.owner),!0):!1}function C(){return n.owner}function U(e){let t=n.owner;return n.owner=e,t}function m(e,t){let r=n.owner;n.owner=e;try{return t()}finally{n.owner=r}}function k(e){if(n.owner){if(n.owner.disposed){e();return}(n.owner.cleanups??=[]).push(e)}}function T(e,t=!0){if(!e.disposed){if(e.owned){for(let r=e.owned.length-1;r>=0;r--)T(e.owned[r]);e.owned=null}if(e.cleanups){for(let r=e.cleanups.length-1;r>=0;r--)e.cleanups[r]();e.cleanups=null}t&&(e.disposed=!0)}}function B(e){let t=j(n.owner);n.owner&&(n.owner.owned??=[]).push(t);let r=n.owner;n.owner=t;try{return e(()=>T(t))}finally{n.owner=r}}function G(e){n.hostSchedule=e??(t=>{Promise.resolve().then(t)})}function X(e){e.queued||(e.queued=!0,n.queue.push(e),!n.scheduled&&n.batchDepth===0&&(n.scheduled=!0,n.hostSchedule(v)))}function v(){if(n.scheduled=!1,n.flushing)return;n.flushing=!0;let e=0;try{for(;n.queue.length;){if(++e>1e5)throw new Error("[fluixi] effect flush did not settle (cycle?)");let t=n.queue;n.queue=[];for(let r of t)r.queued=!1,r.disposed||r.run()}}finally{n.flushing=!1}}function H(){n.batchDepth===0&&v()}function q(e){n.batchDepth++;try{return e()}finally{--n.batchDepth===0&&v()}}var S=class{constructor(t,r=!1){this.queued=!1;this.disposed=!1;this.owner=j(n.owner),n.owner&&(n.owner.cleanups??=[]).push(()=>this.dispose()),this.computed=new l(()=>{T(this.owner,!1),m(this.owner,()=>{let o=t();typeof o=="function"&&(this.owner.cleanups??=[]).push(o)})}),d({kind:"effect",node:this.computed,handle:this,internal:!r}),this.watcher=new b(()=>X(this)),this.run(),this.watcher.watch(this.computed)}run(){if(!this.disposed){this.watcher.getPending();try{this.computed.get()}catch(t){if(t&&typeof t.then=="function"&&n.onSuspend){n.onSuspend(t,this.owner);return}if(n.onError&&n.onError(t,this.owner))return;throw t}}}dispose(){this.disposed||(this.disposed=!0,f(this.computed),this.watcher.unwatch(this.computed),T(this.owner))}};function y(e,t=!1){let r=new S(e,t);return()=>r.dispose()}function J(e){return!!e&&typeof e.then=="function"}G(()=>{});var z=Symbol.for("signal"),Q=Symbol.for("memo"),Z=Symbol.for("signal-node");function Te(e,t){let r=new w(e,{equals:t?.equals}),o=(()=>r.get()),u=(i=>{let s=typeof i=="function"?i(r.peek()):i;return r.set(s),H(),s});return Object.defineProperty(o,z,{value:!0,enumerable:!0}),Object.defineProperty(o,Z,{value:{get value(){return r.peek()},get version(){return r.version}},enumerable:!1}),d({kind:"signal",node:r,handle:o,name:t?.name,set:u}),R()&&k(()=>f(r)),[o,u]}function me(e,t,r){let o=t,u=C(),i=new l(()=>m(u,()=>{try{return o=e(o)}catch(a){if(J(a))return V(a),o;throw a}}),{equals:r?.equals}),s=(()=>i.get());return Object.defineProperty(s,z,{value:!0,enumerable:!0}),Object.defineProperty(s,Q,{value:!0,enumerable:!0}),d({kind:"memo",node:i,handle:s,name:r?.name}),R()&&k(()=>f(i)),s}function ke(e,t){let r=t;return y(()=>{r=e(r)},!0)}function ye(e,t){let r=t;y(()=>{r=e(r)})}function xe(e,t){let r=t;return y(()=>{r=e(r)})}function ge(e){return q(e)}function Re(e){return _(e)}function ee(e){return q(e),Promise.resolve()}function Oe(){return[()=>!1,ee]}function _e(){return v(),Promise.resolve()}function Se(e,t,r){let o=Array.isArray(e),u,i=r?.defer??!1;return s=>{let a=o?e.map(c=>c()):e();if(i){i=!1,u=a;return}let x=_(()=>t(a,u,s));return u=a,x}}export{ge as batch,ye as createComputed,ke as createEffect,me as createMemo,xe as createRenderEffect,B as createRoot,Te as createSignal,_e as flush,v as flushSync,C as getOwner,Se as on,k as onCleanup,m as runWithOwner,U as setOwner,ee as startTransition,Re as untrack,Oe as useTransition};
+/*! @fluixi/reactive v1.0.0-alpha.84 | (c) 2026 Ibrahima Touré and Fluixi contributors | MIT */
+
+// src/version.generated.ts
+var VERSION = "1.0.0-alpha.84";
+
+// src/lib/signal/graph/state.ts
+var MAJOR = VERSION.split(".")[0];
+var KEY = `__fluixi_signal_state_v${MAJOR}__`;
+var VERSIONS_KEY = `__fluixi_signal_builds_v${MAJOR}__`;
+var defaultSchedule = (run) => {
+  if (typeof queueMicrotask === "function") queueMicrotask(run);
+  else void Promise.resolve().then(run);
+};
+function defaults() {
+  return {
+    consumer: null,
+    untracked: false,
+    owner: null,
+    queue: [],
+    scheduled: false,
+    flushing: false,
+    batchDepth: 0,
+    hostSchedule: defaultSchedule,
+    onSuspend: null,
+    onError: null,
+    observer: null
+  };
+}
+var realm = globalThis;
+function backfillState(existing) {
+  const fresh = defaults();
+  const target = existing;
+  for (const field of Object.keys(fresh)) {
+    if (!(field in existing)) target[field] = fresh[field];
+  }
+  return existing;
+}
+function claim() {
+  const existing = realm[KEY];
+  return existing ? backfillState(existing) : realm[KEY] = defaults();
+}
+var G = claim();
+(realm[VERSIONS_KEY] ??= []).push(VERSION);
+
+// src/lib/signal/graph/observe.ts
+function observeReactiveNodes(next) {
+  G.observer = next;
+  return () => {
+    if (G.observer === next) G.observer = null;
+  };
+}
+var running = [];
+var origin;
+function reportReactiveNode(report) {
+  const observer = G.observer;
+  if (observer) {
+    observer.created(
+      report.parents === void 0 ? { ...report, parents: running, origin: report.origin ?? origin } : report
+    );
+  }
+}
+function enterReactiveRun(node) {
+  if (!G.observer) return false;
+  running.push(node);
+  return true;
+}
+function exitReactiveRun() {
+  running.pop();
+}
+function reportReactiveRun(node) {
+  G.observer?.ran?.(node);
+}
+function reportReactiveWrite(node, by) {
+  G.observer?.wrote?.(node, by);
+}
+function reportReactiveDispose(node) {
+  G.observer?.disposed?.(node);
+}
+var HOOK = "__FLUIXI_DEVTOOLS_HOOK__";
+var hook = globalThis[HOOK];
+if (typeof hook?.inject === "function") {
+  try {
+    hook.inject({ observeReactiveNodes, version: VERSION });
+  } catch {
+  }
+}
+function isObserved() {
+  return G.observer != null;
+}
+
+// src/lib/signal/graph/core.ts
+var CLEAN = 0;
+var CHECK = 1;
+var DIRTY = 2;
+var Source = class {
+  constructor() {
+    /** Computeds, and watched leaves, that read this node. */
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    this.observers = null;
+    /** Watchers eagerly observing this node, which is how `runtime.ts` schedules effects. */
+    this.watchers = null;
+    /** Bumped whenever this node's value actually changes (equality-gated). */
+    this.version = 0;
+  }
+  /** Settle this node so a reader sees a current value/version. Overridden by Computed. */
+  updateIfNecessary() {
+  }
+  /** Link the current consumer (if any) as an observer of this node. */
+  track() {
+    if (G.untracked) return;
+    const consumer = G.consumer;
+    if (!consumer) return;
+    (this.observers ??= /* @__PURE__ */ new Set()).add(consumer);
+    (consumer.sources ??= /* @__PURE__ */ new Set()).add(this);
+  }
+};
+var State = class extends Source {
+  constructor(value, options) {
+    super();
+    this._value = value;
+    this._equals = options?.equals === false ? () => false : options?.equals ?? Object.is;
+  }
+  get() {
+    this.track();
+    return this._value;
+  }
+  set(next) {
+    if (this._equals(this._value, next)) return;
+    this._value = next;
+    this.version++;
+    reportReactiveWrite(this, G.consumer);
+    if (this.observers) for (const o of [...this.observers]) o.markDirty(DIRTY);
+    notifyWatchers(this);
+  }
+  /** Read without subscribing (peek). */
+  peek() {
+    return this._value;
+  }
+};
+var Computed = class extends Source {
+  constructor(fn, options) {
+    super();
+    this._threw = false;
+    this._initialized = false;
+    this.state = DIRTY;
+    /** Nodes this computation read on its last run. Rebuilt on every run. */
+    this.sources = null;
+    this._fn = fn;
+    this._equals = options?.equals === false ? () => false : options?.equals ?? Object.is;
+  }
+  get() {
+    if (G.consumer === this) {
+      throw new Error("Signal.Computed cannot read itself");
+    }
+    this.track();
+    this.updateIfNecessary();
+    if (this._threw) throw this._error;
+    return this._value;
+  }
+  /** Settle, if CHECK, verify sources; if DIRTY (or never run), recompute. */
+  updateIfNecessary() {
+    if (this.state === CHECK) {
+      if (this.sources) {
+        for (const s of this.sources) {
+          s.updateIfNecessary();
+          if (this.state === DIRTY) break;
+        }
+      }
+    }
+    if (this.state === DIRTY || !this._initialized) this.recompute();
+    this.state = CLEAN;
+  }
+  recompute() {
+    if (this.sources) {
+      for (const s of this.sources) s.observers?.delete(this);
+      this.sources.clear();
+    }
+    const prevConsumer = G.consumer;
+    const prevUntracked = G.untracked;
+    const watched = enterReactiveRun(this);
+    G.consumer = this;
+    G.untracked = false;
+    let next;
+    let threw = false;
+    let err;
+    try {
+      next = this._fn();
+    } catch (e) {
+      threw = true;
+      err = e;
+      next = this._value;
+    } finally {
+      G.consumer = prevConsumer;
+      G.untracked = prevUntracked;
+      if (watched) exitReactiveRun();
+    }
+    const changed = !this._initialized || this._threw !== threw || (threw ? err !== this._error : !this._equals(this._value, next));
+    this._initialized = true;
+    this._threw = threw;
+    this._error = err;
+    this._value = next;
+    reportReactiveRun(this);
+    if (changed) {
+      this.version++;
+      if (this.observers) for (const o of [...this.observers]) o.markDirty(DIRTY);
+      notifyWatchers(this);
+    }
+  }
+  /**
+   * Push a maybe-dirty mark. A direct observer of a changed node gets DIRTY; its
+   * own observers get CHECK (recurse), stopping where already marked, so the
+   * push is O(newly-dirtied) and never recomputes.
+   */
+  markDirty(level) {
+    if (this.state >= level) return;
+    const wasClean = this.state === CLEAN;
+    this.state = level;
+    if (wasClean) {
+      if (this.observers) for (const o of [...this.observers]) o.markDirty(CHECK);
+      notifyWatchers(this);
+    }
+  }
+  peek() {
+    this.updateIfNecessary();
+    if (this._threw) throw this._error;
+    return this._value;
+  }
+};
+function notifyWatchers(node) {
+  if (!node.watchers) return;
+  for (const w of [...node.watchers]) w._notify(node);
+}
+var Watcher = class {
+  constructor(notify) {
+    this._watched = /* @__PURE__ */ new Set();
+    this._pending = /* @__PURE__ */ new Set();
+    this._notifyFn = notify;
+  }
+  watch(...nodes) {
+    for (const n of nodes) {
+      this._watched.add(n);
+      (n.watchers ??= /* @__PURE__ */ new Set()).add(this);
+    }
+  }
+  unwatch(...nodes) {
+    for (const n of nodes) {
+      this._watched.delete(n);
+      n.watchers?.delete(this);
+      this._pending.delete(n);
+    }
+  }
+  /** Watched nodes that may have changed since the last getPending(). */
+  getPending() {
+    const out = [...this._pending];
+    this._pending.clear();
+    return out;
+  }
+  /** @internal, a watched node became non-clean. Edge-triggered: notify once. */
+  _notify(node) {
+    if (!this._watched.has(node) || this._pending.has(node)) return;
+    const wasEmpty = this._pending.size === 0;
+    this._pending.add(node);
+    if (wasEmpty) this._notifyFn();
+  }
+};
+function untrack(fn) {
+  if (G.untracked) return fn();
+  G.untracked = true;
+  try {
+    return fn();
+  } finally {
+    G.untracked = false;
+  }
+}
+
+// src/lib/signal/graph/runtime.ts
+function makeOwner(parent) {
+  return { cleanups: null, owned: null, parent, contexts: null };
+}
+function reportSuspend(promise) {
+  if (G.onSuspend) {
+    G.onSuspend(promise, G.owner);
+    return true;
+  }
+  return false;
+}
+function getOwner() {
+  return G.owner;
+}
+function setOwner(owner) {
+  const prev = G.owner;
+  G.owner = owner;
+  return prev;
+}
+function runWithOwner(owner, fn) {
+  const prev = G.owner;
+  G.owner = owner;
+  try {
+    return fn();
+  } finally {
+    G.owner = prev;
+  }
+}
+function onCleanup(fn) {
+  if (!G.owner) return;
+  if (G.owner.disposed) {
+    fn();
+    return;
+  }
+  (G.owner.cleanups ??= []).push(fn);
+}
+function disposeOwner(owner, final = true) {
+  if (owner.disposed) return;
+  if (owner.owned) {
+    for (let i = owner.owned.length - 1; i >= 0; i--) disposeOwner(owner.owned[i]);
+    owner.owned = null;
+  }
+  if (owner.cleanups) {
+    for (let i = owner.cleanups.length - 1; i >= 0; i--) owner.cleanups[i]();
+    owner.cleanups = null;
+  }
+  if (final) owner.disposed = true;
+}
+function createRoot(fn) {
+  const owner = makeOwner(G.owner);
+  if (G.owner) (G.owner.owned ??= []).push(owner);
+  const prev = G.owner;
+  G.owner = owner;
+  try {
+    return fn(() => disposeOwner(owner));
+  } finally {
+    G.owner = prev;
+  }
+}
+function setScheduler(fn) {
+  G.hostSchedule = fn ?? ((run) => void Promise.resolve().then(run));
+}
+function enqueue(e) {
+  if (e.queued) return;
+  e.queued = true;
+  G.queue.push(e);
+  if (!G.scheduled && G.batchDepth === 0) {
+    G.scheduled = true;
+    G.hostSchedule(flushSync);
+  }
+}
+function flushSync() {
+  G.scheduled = false;
+  if (G.flushing) return;
+  G.flushing = true;
+  let guard = 0;
+  try {
+    while (G.queue.length) {
+      if (++guard > 1e5) throw new Error("[fluixi] effect flush did not settle (cycle?)");
+      const batchOf = G.queue;
+      G.queue = [];
+      for (const e of batchOf) {
+        e.queued = false;
+        if (!e.disposed) e.run();
+      }
+    }
+  } finally {
+    G.flushing = false;
+  }
+}
+function afterWrite() {
+  if (G.batchDepth === 0) flushSync();
+}
+function batch(fn) {
+  G.batchDepth++;
+  try {
+    return fn();
+  } finally {
+    if (--G.batchDepth === 0) flushSync();
+  }
+}
+var EffectNode = class {
+  constructor(fn, report = false) {
+    this.queued = false;
+    this.disposed = false;
+    this.owner = makeOwner(G.owner);
+    if (G.owner) (G.owner.cleanups ??= []).push(() => this.dispose());
+    this.computed = new Computed(() => {
+      disposeOwner(this.owner, false);
+      runWithOwner(this.owner, () => {
+        const r = fn();
+        if (typeof r === "function") (this.owner.cleanups ??= []).push(r);
+      });
+    });
+    reportReactiveNode({ kind: "effect", node: this.computed, handle: this, internal: !report });
+    this.watcher = new Watcher(() => enqueue(this));
+    this.run();
+    this.watcher.watch(this.computed);
+  }
+  run() {
+    if (this.disposed) return;
+    this.watcher.getPending();
+    try {
+      this.computed.get();
+    } catch (e) {
+      if (e && typeof e.then === "function" && G.onSuspend) {
+        G.onSuspend(e, this.owner);
+        return;
+      }
+      if (G.onError && G.onError(e, this.owner)) return;
+      throw e;
+    }
+  }
+  dispose() {
+    if (this.disposed) return;
+    this.disposed = true;
+    reportReactiveDispose(this.computed);
+    this.watcher.unwatch(this.computed);
+    disposeOwner(this.owner);
+  }
+};
+function effect(fn, report = false) {
+  const node = new EffectNode(fn, report);
+  return () => node.dispose();
+}
+
+// src/lib/signal/graph/compat.ts
+function isThenable(v) {
+  return !!v && typeof v.then === "function";
+}
+setScheduler(() => {
+});
+var $SIGNAL = /* @__PURE__ */ Symbol.for("signal");
+var $MEMO = /* @__PURE__ */ Symbol.for("memo");
+var $NODE = /* @__PURE__ */ Symbol.for("signal-node");
+function createSignal(value, options) {
+  const state = new State(value, { equals: options?.equals });
+  const read = (() => state.get());
+  const write = ((next) => {
+    const v = typeof next === "function" ? next(state.peek()) : next;
+    state.set(v);
+    afterWrite();
+    return v;
+  });
+  Object.defineProperty(read, $SIGNAL, { value: true, enumerable: true });
+  Object.defineProperty(read, $NODE, {
+    value: {
+      get value() {
+        return state.peek();
+      },
+      get version() {
+        return state.version;
+      }
+    },
+    enumerable: false
+  });
+  reportReactiveNode({
+    kind: "signal",
+    node: state,
+    handle: read,
+    name: options?.name,
+    set: write
+  });
+  if (isObserved()) onCleanup(() => reportReactiveDispose(state));
+  return [read, write];
+}
+function createMemo(fn, value, options) {
+  let prev = value;
+  const owner = getOwner();
+  const c = new Computed(
+    () => runWithOwner(owner, () => {
+      try {
+        return prev = fn(prev);
+      } catch (e) {
+        if (isThenable(e)) {
+          reportSuspend(e);
+          return prev;
+        }
+        throw e;
+      }
+    }),
+    { equals: options?.equals }
+  );
+  const read = (() => c.get());
+  Object.defineProperty(read, $SIGNAL, { value: true, enumerable: true });
+  Object.defineProperty(read, $MEMO, { value: true, enumerable: true });
+  reportReactiveNode({ kind: "memo", node: c, handle: read, name: options?.name });
+  if (isObserved()) onCleanup(() => reportReactiveDispose(c));
+  return read;
+}
+function createEffect(fn, value) {
+  let prev = value;
+  return effect(() => {
+    const r = fn(prev);
+    prev = r;
+  }, true);
+}
+function createComputed(fn, value) {
+  let prev = value;
+  effect(() => {
+    prev = fn(prev);
+  });
+}
+function createRenderEffect(fn, value) {
+  let prev = value;
+  return effect(() => {
+    prev = fn(prev);
+  });
+}
+function batch2(fn) {
+  return batch(fn);
+}
+function untrack2(fn) {
+  return untrack(fn);
+}
+function startTransition(fn) {
+  batch(fn);
+  return Promise.resolve();
+}
+function useTransition() {
+  return [() => false, startTransition];
+}
+function flush() {
+  flushSync();
+  return Promise.resolve();
+}
+function on(deps, fn, options) {
+  const isArray = Array.isArray(deps);
+  let prevValue;
+  let defer = options?.defer ?? false;
+  return (prevResult) => {
+    const value = isArray ? deps.map((d) => d()) : deps();
+    if (defer) {
+      defer = false;
+      prevValue = value;
+      return void 0;
+    }
+    const result = untrack(() => fn(value, prevValue, prevResult));
+    prevValue = value;
+    return result;
+  };
+}
+export {
+  batch2 as batch,
+  createComputed,
+  createEffect,
+  createMemo,
+  createRenderEffect,
+  createRoot,
+  createSignal,
+  flush,
+  flushSync,
+  getOwner,
+  on,
+  onCleanup,
+  runWithOwner,
+  setOwner,
+  startTransition,
+  untrack2 as untrack,
+  useTransition
+};