@fluixi/reactive 1.0.0-alpha.100

package/dist/lib/signal/list.cjs

@@ -0,0 +1,561 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/lib/signal/list.ts
+var list_exports = {};
+__export(list_exports, {
+  indexArray: () => indexArray,
+  keyArray: () => keyArray,
+  mapArray: () => mapArray
+});
+module.exports = __toCommonJS(list_exports);
+
+// src/version.generated.ts
+var VERSION = "1.0.0-alpha.100";
+
+// 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;
+var currentScope;
+function reportReactiveNode(report) {
+  const observer = G.observer;
+  if (observer) {
+    observer.created(
+      report.parents === void 0 ? { ...report, parents: running, origin: report.origin ?? origin, scope: report.scope ?? currentScope } : { ...report, scope: report.scope ?? currentScope }
+    );
+  }
+}
+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);
+}
+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 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 untrack(() => fn(() => disposeOwner(owner)));
+  } finally {
+    G.owner = prev;
+  }
+}
+function setScheduler(fn) {
+  G.hostSchedule = fn ?? ((run) => void Promise.resolve().then(run));
+}
+function flushSync() {
+  G.scheduled = false;
+  if (G.flushing) return;
+  G.flushing = true;
+  let guard = 0;
+  let failed = false;
+  let first;
+  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) continue;
+        try {
+          e.run();
+        } catch (error) {
+          if (!failed) {
+            failed = true;
+            first = error;
+          }
+        }
+      }
+    }
+  } finally {
+    G.flushing = false;
+  }
+  if (failed) throw first;
+}
+function afterWrite() {
+  if (G.batchDepth === 0) flushSync();
+}
+
+// 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 untrack2(fn) {
+  return untrack(fn);
+}
+
+// src/lib/signal/list.ts
+function mapArray(list, mapFn, options) {
+  let items = [];
+  onCleanup(() => {
+    for (const e of items) e.dispose();
+    items = [];
+  });
+  return createMemo(() => {
+    const next = list() || [];
+    return untrack2(() => {
+      if (next.length === 0) {
+        for (const e of items) e.dispose();
+        items = [];
+        return options?.fallback ? options.fallback() : [];
+      }
+      const prevByItem = /* @__PURE__ */ new Map();
+      for (const e of items) if (!prevByItem.has(e.item)) prevByItem.set(e.item, e);
+      const result = [];
+      const used = /* @__PURE__ */ new Set();
+      for (let i = 0; i < next.length; i++) {
+        const value = next[i];
+        const reuse = prevByItem.get(value);
+        if (reuse && !used.has(reuse)) {
+          reuse.setIndex(i);
+          result.push(reuse);
+          used.add(reuse);
+        } else {
+          let rendered, setIndex, dispose;
+          createRoot((d) => {
+            dispose = d;
+            const [index, setIdx] = createSignal(i, { name: "row index" });
+            setIndex = setIdx;
+            rendered = mapFn(value, index);
+          });
+          const entry = { item: value, rendered, dispose, setIndex };
+          result.push(entry);
+          used.add(entry);
+        }
+      }
+      for (const e of items) if (!used.has(e)) e.dispose();
+      items = result;
+      return result.map((e) => e.rendered);
+    });
+  }, void 0, { name: "mapArray" });
+}
+function keyArray(list, keyFn, mapFn, options) {
+  let keys = [];
+  let entries = [];
+  onCleanup(() => {
+    for (const e of entries) e.dispose();
+    keys = [];
+    entries = [];
+  });
+  return createMemo(() => {
+    const next = list() || [];
+    return untrack2(() => {
+      if (next.length === 0) {
+        for (const e of entries) e.dispose();
+        keys = [];
+        entries = [];
+        return options?.fallback ? options.fallback() : [];
+      }
+      const prevByKey = /* @__PURE__ */ new Map();
+      for (let i = 0; i < keys.length; i++) prevByKey.set(keys[i], entries[i]);
+      const resultEntries = [];
+      const resultKeys = [];
+      const usedKeys = /* @__PURE__ */ new Set();
+      for (let i = 0; i < next.length; i++) {
+        const key = keyFn(next[i]);
+        const reuse = prevByKey.get(key);
+        if (reuse && !usedKeys.has(key)) {
+          reuse.setIndex(i);
+          resultEntries.push(reuse);
+        } else {
+          let rendered, setIndex, dispose;
+          createRoot((d) => {
+            dispose = d;
+            const [index, setIdx] = createSignal(i, { name: "row index" });
+            setIndex = setIdx;
+            const item = createMemo((prev) => {
+              const cur = list() || [];
+              const v = cur[index()];
+              return v !== void 0 && v !== null ? v : prev;
+            }, next[i]);
+            rendered = mapFn(item, index);
+          });
+          resultEntries.push({ rendered, dispose, setIndex });
+        }
+        resultKeys.push(key);
+        usedKeys.add(key);
+      }
+      for (const [key, e] of prevByKey) if (!usedKeys.has(key)) e.dispose();
+      keys = resultKeys;
+      entries = resultEntries;
+      return resultEntries.map((e) => e.rendered);
+    });
+  }, void 0, { name: "keyArray" });
+}
+function indexArray(list, mapFn, options) {
+  let slots = [];
+  onCleanup(() => {
+    for (const s of slots) s.dispose();
+    slots = [];
+  });
+  return createMemo(() => {
+    const next = list() || [];
+    return untrack2(() => {
+      if (next.length === 0) {
+        for (const s of slots) s.dispose();
+        slots = [];
+        return options?.fallback ? options.fallback() : [];
+      }
+      const prevLen = slots.length;
+      const nextLen = next.length;
+      for (let i = prevLen; i < nextLen; i++) {
+        let rendered, setItem, dispose;
+        const value = next[i];
+        createRoot((d) => {
+          dispose = d;
+          const [item, setVal] = createSignal(value);
+          setItem = setVal;
+          rendered = mapFn(item, i);
+        });
+        slots.push({ rendered, setItem, dispose });
+      }
+      for (let i = nextLen; i < prevLen; i++) slots[i].dispose();
+      if (nextLen < prevLen) slots = slots.slice(0, nextLen);
+      const survive = Math.min(prevLen, nextLen);
+      for (let i = 0; i < survive; i++) slots[i].setItem(next[i]);
+      return slots.map((s) => s.rendered);
+    });
+  }, void 0, { name: "indexArray" });
+}

package/dist/lib/signal/list.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Keyed list reconciliation primitives, the reactive foundation for `<For>`,
+ * `<For by>` and `<Index>` (mirrors SolidJS `mapArray`/`keyArray`/`indexArray`).
+ *
+ * Each maps a reactive array to an array of mapped values and reuses per-item
+ * reactive scopes across updates so only changed items re-run their map fn. Every
+ * mapped item lives in its own `createRoot`, so it has a disposable owner scope
+ * this is what keeps list items owner-stable (the thing ad-hoc array handling gets
+ * wrong).
+ */
+import { type Accessor } from './graph/compat.js';
+type ListSource<T> = Accessor<readonly T[] | null | undefined | false>;
+interface ListOptions {
+    /** Returned (as-is, not wrapped) when the list is empty/nullish. */
+    fallback?: () => any;
+}
+/**
+ * Reference-keyed map. Reuses an item's mapped value while the same value (by
+ * `===`) stays in the list; new values get a fresh root + index signal; removed
+ * values are disposed. The map fn receives the plain value (a snapshot) and a
+ * reactive index accessor. Backs `<For>`.
+ */
+export declare function mapArray<T, U>(list: ListSource<T>, mapFn: (item: T, index: Accessor<number>) => U, options?: ListOptions): Accessor<U[]>;
+/**
+ * Key-function map. Like `mapArray` but reuse is keyed by `keyFn(item)` (so the
+ * same key survives object recreation), and the map fn receives a *live* item
+ * accessor (reads through to the current list value, so sub-property updates
+ * propagate). Backs `<For by={...}>`.
+ */
+export declare function keyArray<T, U>(list: ListSource<T>, keyFn: (item: T) => any, mapFn: (item: Accessor<T>, index: Accessor<number>) => U, options?: ListOptions): Accessor<U[]>;
+/**
+ * Index-keyed map. Reuse is keyed by *position*, growing adds slots, shrinking
+ * disposes trailing slots, and when the value at a position changes only that
+ * slot's item signal updates (the map fn is not re-run). The map fn receives a
+ * live item accessor and a plain (stable) index. Backs `<Index>`.
+ */
+export declare function indexArray<T, U>(list: ListSource<T>, mapFn: (item: Accessor<T>, index: number) => U, options?: ListOptions): Accessor<U[]>;
+export {};
+//# sourceMappingURL=list.d.ts.map

package/dist/lib/signal/list.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../../src/lib/signal/list.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,KAAK,QAAQ,EAA4D,MAAM,mBAAmB,CAAC;AAE5G,KAAK,UAAU,CAAC,CAAC,IAAI,QAAQ,CAAC,SAAS,CAAC,EAAE,GAAG,IAAI,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC;AAEvE,UAAU,WAAW;IACnB,oEAAoE;IACpE,QAAQ,CAAC,EAAE,MAAM,GAAG,CAAC;CACtB;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAC3B,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,EAC9C,OAAO,CAAC,EAAE,WAAW,GACpB,QAAQ,CAAC,CAAC,EAAE,CAAC,CA6Cf;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAC3B,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,GAAG,EACvB,KAAK,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,EACxD,OAAO,CAAC,EAAE,WAAW,GACpB,QAAQ,CAAC,CAAC,EAAE,CAAC,CAuDf;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAC7B,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,EAC9C,OAAO,CAAC,EAAE,WAAW,GACpB,QAAQ,CAAC,CAAC,EAAE,CAAC,CAuCf"}