sigmx 0.1.1 → 0.2.0

package/dist/kernel/state.js

@@ -1,10 +1,13 @@
-import { expand, isPlain, toPredicate } from "../lib/objects.js";
+import { expand, isPlain, safeKey, toPredicate } from "../lib/objects.js";
 import { batch, Computed, onSettled, Signal } from "./reactive.js";
-const parentOf = (p) => p.slice(0, Math.max(0, p.lastIndexOf(".")));
-const nameOf = (p) => p.slice(p.lastIndexOf(".") + 1);
+const split = (p) => {
+  const i = p.lastIndexOf(".");
+  return [i < 0 ? "" : p.slice(0, i), p.slice(i + 1)];
+};
 const join = (a, b) => a ? `${a}.${b}` : b;
-const under = (p, at) => !at || p === at || p.startsWith(`${at}.`);
+const under = (p, at) => !at || p.startsWith(`${at}.`);
 const str = (k) => typeof k === "string";
+const rawOf = /* @__PURE__ */ new WeakMap();
 const createStore = () => {
   const leaves = /* @__PURE__ */ new Map();
   const kids = /* @__PURE__ */ new Map([["", /* @__PURE__ */ new Set()]]);
@@ -12,15 +15,24 @@ const createStore = () => {
   const pending = /* @__PURE__ */ new Map();
   const listeners = /* @__PURE__ */ new Set();
   const nsCache = /* @__PURE__ */ new Map();
-  const arrCache = /* @__PURE__ */ new WeakMap();
+  const proxies = /* @__PURE__ */ new WeakMap();
+  const link = (p) => {
+    const [parent, name] = split(p);
+    ensureNs(parent).add(name);
+    shape.bump();
+  };
+  const unlink = (p) => {
+    const [parent, name] = split(p);
+    kids.get(parent)?.delete(name);
+    shape.bump();
+  };
   const ensureNs = (p) => {
     let set2 = kids.get(p);
     if (!set2) {
       if (leaves.has(p)) dropLeaf(p);
       set2 = /* @__PURE__ */ new Set();
       kids.set(p, set2);
-      ensureNs(parentOf(p)).add(nameOf(p));
-      shape.bump();
+      link(p);
     }
     return set2;
   };
@@ -28,10 +40,10 @@ const createStore = () => {
     const s = leaves.get(p);
     if (!s) return;
     leaves.delete(p);
-    kids.get(parentOf(p))?.delete(nameOf(p));
+    unlink(p);
     pending.set(p, null);
     s.bump();
-    shape.bump();
+    if (s instanceof Computed) s.dispose();
   };
   const dropNs = (p) => {
     const set2 = kids.get(p);
@@ -39,34 +51,35 @@ const createStore = () => {
     for (const k of [...set2]) remove(join(p, k));
     if (p) {
       kids.delete(p);
-      kids.get(parentOf(p))?.delete(nameOf(p));
       nsCache.delete(p);
+      unlink(p);
     }
-    shape.bump();
   };
   const remove = (p) => batch(() => {
     dropLeaf(p);
     dropNs(p);
   });
   const define = (p, node) => batch(() => {
-    if (kids.has(p)) dropNs(p);
+    dropNs(p);
     const old = leaves.get(p);
     leaves.set(p, node);
-    ensureNs(parentOf(p)).add(nameOf(p));
-    old?.bump();
-    shape.bump();
+    link(p);
+    if (old) {
+      old.bump();
+      if (old instanceof Computed) old.dispose();
+    }
   });
   const set = (p, v) => batch(() => {
     if (v == null) return remove(p);
+    v = (v && rawOf.get(v)) ?? v;
     if (isPlain(v)) {
-      const names = ensureNs(p);
-      for (const k of [...names]) if (!(k in v)) remove(join(p, k));
-      for (const k in v) set(join(p, k), v[k]);
+      for (const k of [...ensureNs(p)]) if (!(k in v)) remove(join(p, k));
+      for (const k in v) if (safeKey(k)) set(join(p, k), v[k]);
       return;
     }
-    if (kids.has(p)) dropNs(p);
+    dropNs(p);
     const s = leaves.get(p);
-    if (s instanceof Computed) throw new Error(`"${p}" is a computed signal and cannot be assigned`);
+    if (s instanceof Computed) throw new Error(`computed "${p}" is read-only`);
     if (s) {
       if (Object.is(s.peek(), v)) return;
       s.value = v;
@@ -77,41 +90,57 @@ const createStore = () => {
   });
   const merge = (patch, { at = "", ifMissing = false } = {}) => batch(() => {
     if (!isPlain(patch)) return;
-    ensureNs(at);
-    for (const k in patch) {
+    const keys = Object.keys(patch).filter(safeKey);
+    if (keys.length) ensureNs(at);
+    for (const k of keys) {
       const p = join(at, k);
       const v = patch[k];
+      const leaf = leaves.get(p);
+      if (leaf && (ifMissing || leaf instanceof Computed)) continue;
       if (v === null) {
         if (!ifMissing) remove(p);
-      } else if (isPlain(v)) {
-        merge(v, { at: p, ifMissing });
-      } else if (!(ifMissing && (leaves.has(p) || kids.has(p))) && !(leaves.get(p) instanceof Computed)) {
-        set(p, v);
-      }
+      } else if (isPlain(v)) merge(v, { at: p, ifMissing });
+      else if (!(ifMissing && kids.has(p))) set(p, v);
     }
   });
+  const has = (p) => leaves.has(p) || kids.has(p);
   const wrapArray = (raw, s, p) => {
-    let px = arrCache.get(raw);
-    if (!px) {
-      const touch = () => {
-        pending.set(p, raw);
-        s.bump();
-      };
-      px = new Proxy(raw, {
-        set: (t, k, v) => {
-          t[k] = v;
-          touch();
-          return true;
-        },
-        deleteProperty: (t, k) => {
-          delete t[k];
-          touch();
-          return true;
-        }
-      });
-      arrCache.set(raw, px);
+    let cache = proxies.get(s);
+    if (!cache) {
+      cache = /* @__PURE__ */ new WeakMap();
+      proxies.set(s, cache);
     }
-    return px;
+    const touch = () => {
+      pending.set(p, raw);
+      s.bump();
+      return true;
+    };
+    const wrap = (target) => {
+      let px = cache?.get(target);
+      if (!px) {
+        px = new Proxy(target, {
+          get: (t, k, r) => {
+            const v = Reflect.get(t, k, r);
+            if (typeof v === "function" && Array.isArray(t)) return (...a) => batch(() => v.apply(r, a));
+            if (!v || typeof v !== "object" || !(Array.isArray(v) || isPlain(v))) return v;
+            const d = Object.getOwnPropertyDescriptor(t, k);
+            return d && !d.configurable && !d.writable ? v : wrap(v);
+          },
+          set: (t, k, v) => {
+            t[k] = (v && rawOf.get(v)) ?? v;
+            return touch();
+          },
+          deleteProperty: (t, k) => {
+            delete t[k];
+            return touch();
+          }
+        });
+        cache?.set(target, px);
+        rawOf.set(px, target);
+      }
+      return px;
+    };
+    return wrap(raw);
   };
   const get = (p) => {
     const s = leaves.get(p);
@@ -119,16 +148,15 @@ const createStore = () => {
       const v = s.value;
       return Array.isArray(v) ? wrapArray(v, s, p) : v;
     }
-    if (kids.has(p)) return ns(p);
     shape.value;
-    return void 0;
+    if (kids.has(p)) return ns(p);
   };
   const ns = (p) => {
     let px = nsCache.get(p);
     if (!px) {
-      const names = () => {
+      const names = (k) => {
         shape.value;
-        return kids.get(p);
+        return str(k) && !!kids.get(p)?.has(k);
       };
       px = new Proxy(
         {},
@@ -142,43 +170,27 @@ const createStore = () => {
             if (str(k)) remove(join(p, k));
             return true;
           },
-          has: (_, k) => str(k) && !!names()?.has(k),
-          ownKeys: () => [...names() ?? []],
-          getOwnPropertyDescriptor: (_, k) => str(k) && names()?.has(k) ? { enumerable: true, configurable: true, writable: true, value: get(join(p, k)) } : void 0
+          has: (_, k) => names(k),
+          ownKeys: () => {
+            shape.value;
+            return [...kids.get(p) ?? []];
+          },
+          getOwnPropertyDescriptor: (_, k) => names(k) ? { enumerable: true, configurable: true, writable: true, value: get(join(p, k)) } : void 0
         }
       );
       nsCache.set(p, px);
     }
     return px;
   };
-  const scope = new Proxy(
-    {},
-    {
-      has: (_, k) => str(k) && k[0] === "$",
-      get: (_, k) => !str(k) ? void 0 : k === "$" ? ns("") : get(k.slice(1)),
-      set: (_, k, v) => {
-        if (str(k)) k === "$" ? merge(v) : set(k.slice(1), v);
-        return true;
-      }
-    }
-  );
-  const paths = (filter) => {
+  const paths = (filter, { computed = true } = {}) => {
     shape.value;
     const ok = toPredicate(filter);
-    return [...leaves.keys()].filter(ok);
+    return [...leaves].filter(([p, s]) => ok(p) && (computed || !(s instanceof Computed))).map(([p]) => p);
   };
   const snapshot = (filter, { at = "", computed = true } = {}) => {
-    shape.value;
-    const ok = toPredicate(filter);
     const out = {};
-    const rel = (p) => at ? p.slice(at.length + 1) : p;
-    for (const [p, s] of leaves) {
-      if (!under(p, at) || !ok(p) || !computed && s instanceof Computed) continue;
-      expand(out, rel(p), s.value);
-    }
-    for (const p of kids.keys()) {
-      if (p && p !== at && under(p, at) && ok(p) && !kids.get(p)?.size) expand(out, rel(p), {});
-    }
+    for (const p of paths(filter, { computed }))
+      if (under(p, at)) expand(out, at ? p.slice(at.length + 1) : p, leaves.get(p)?.value);
     return out;
   };
   onSettled(() => {
@@ -193,7 +205,7 @@ const createStore = () => {
     set,
     merge,
     remove,
-    has: (p) => leaves.has(p) || kids.has(p),
+    has,
     define,
     paths,
     snapshot,
@@ -203,8 +215,7 @@ const createStore = () => {
     },
     get $() {
       return ns("");
-    },
-    scope
+    }
   };
 };
 export {

package/dist/kernel/state.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/kernel/state.ts"],
-  "sourcesContent": ["import { expand, type Filter, isPlain, toPredicate } from '../lib/objects.js';\nimport { batch, Computed, onSettled, Signal } from './reactive.js';\n\nexport type Patch = Record<string, any>;\n\nexport interface Store {\n  /** Value at a dotted path: a leaf value, a namespace proxy, or undefined. Reads subscribe. */\n  get(path: string): any;\n  /** Replace the value at a path. Plain objects become namespaces; null/undefined removes. */\n  set(path: string, value: any): void;\n  /** JSON merge-patch (RFC 7396): objects merge, null removes, everything else replaces. */\n  merge(patch: Patch, options?: { at?: string; ifMissing?: boolean }): void;\n  remove(path: string): void;\n  has(path: string): boolean;\n  define(path: string, node: Signal<any>): void;\n  paths(filter?: Filter): string[];\n  snapshot(filter?: Filter, options?: { at?: string; computed?: boolean }): Patch;\n  /** Called after each settled batch with the nested object of changed paths (null = removed). */\n  onPatch(fn: (patch: Patch) => void): () => void;\n  readonly $: any;\n  /** Identifier scope for compiled expressions: resolves `$count`, `$user`, and `$`. */\n  readonly scope: object;\n}\n\nconst parentOf = (p: string): string => p.slice(0, Math.max(0, p.lastIndexOf('.')));\nconst nameOf = (p: string): string => p.slice(p.lastIndexOf('.') + 1);\nconst join = (a: string, b: string): string => (a ? `${a}.${b}` : b);\nconst under = (p: string, at: string): boolean => !at || p === at || p.startsWith(`${at}.`);\nconst str = (k: unknown): k is string => typeof k === 'string';\n\nexport const createStore = (): Store => {\n  const leaves = new Map<string, Signal<any>>();\n  const kids = new Map<string, Set<string>>([['', new Set()]]);\n  const shape = new Signal(0); // bumped on any structural change; enumerations subscribe to it\n  const pending = new Map<string, any>();\n  const listeners = new Set<(p: Patch) => void>();\n  const nsCache = new Map<string, any>();\n  const arrCache = new WeakMap<object, any>();\n\n  const ensureNs = (p: string): Set<string> => {\n    let set = kids.get(p);\n    if (!set) {\n      if (leaves.has(p)) dropLeaf(p);\n      set = new Set();\n      kids.set(p, set);\n      ensureNs(parentOf(p)).add(nameOf(p));\n      shape.bump();\n    }\n    return set;\n  };\n\n  const dropLeaf = (p: string): void => {\n    const s = leaves.get(p);\n    if (!s) return;\n    leaves.delete(p);\n    kids.get(parentOf(p))?.delete(nameOf(p));\n    pending.set(p, null);\n    s.bump();\n    shape.bump();\n  };\n\n  const dropNs = (p: string): void => {\n    const set = kids.get(p);\n    if (!set) return;\n    for (const k of [...set]) remove(join(p, k));\n    if (p) {\n      kids.delete(p);\n      kids.get(parentOf(p))?.delete(nameOf(p));\n      nsCache.delete(p);\n    }\n    shape.bump();\n  };\n\n  const remove = (p: string): void =>\n    batch(() => {\n      dropLeaf(p);\n      dropNs(p);\n    });\n\n  const define = (p: string, node: Signal<any>): void =>\n    batch(() => {\n      if (kids.has(p)) dropNs(p);\n      const old = leaves.get(p);\n      leaves.set(p, node);\n      ensureNs(parentOf(p)).add(nameOf(p));\n      old?.bump();\n      shape.bump();\n    });\n\n  const set = (p: string, v: any): void =>\n    batch(() => {\n      if (v == null) return remove(p);\n      if (isPlain(v)) {\n        const names = ensureNs(p);\n        for (const k of [...names]) if (!(k in v)) remove(join(p, k));\n        for (const k in v) set(join(p, k), v[k]);\n        return;\n      }\n      if (kids.has(p)) dropNs(p);\n      const s = leaves.get(p);\n      if (s instanceof Computed) throw new Error(`\"${p}\" is a computed signal and cannot be assigned`);\n      if (s) {\n        if (Object.is(s.peek(), v)) return;\n        s.value = v;\n      } else {\n        define(p, new Signal(v));\n      }\n      pending.set(p, v);\n    });\n\n  const merge = (patch: Patch, { at = '', ifMissing = false } = {}): void =>\n    batch(() => {\n      if (!isPlain(patch)) return;\n      ensureNs(at);\n      for (const k in patch) {\n        const p = join(at, k);\n        const v = patch[k];\n        if (v === null) {\n          if (!ifMissing) remove(p);\n        } else if (isPlain(v)) {\n          merge(v, { at: p, ifMissing });\n        } else if (!(ifMissing && (leaves.has(p) || kids.has(p))) && !(leaves.get(p) instanceof Computed)) {\n          set(p, v); // computed leaves are skipped: patches from storage or a server cannot overwrite them\n        }\n      }\n    });\n\n  /** Arrays are returned through a proxy so in-place mutation notifies the leaf. */\n  const wrapArray = (raw: any[], s: Signal<any>, p: string): any => {\n    let px = arrCache.get(raw);\n    if (!px) {\n      const touch = () => {\n        pending.set(p, raw);\n        s.bump();\n      };\n      px = new Proxy(raw, {\n        set: (t, k, v) => {\n          (t as any)[k] = v;\n          touch();\n          return true;\n        },\n        deleteProperty: (t, k) => {\n          delete (t as any)[k];\n          touch();\n          return true;\n        },\n      });\n      arrCache.set(raw, px);\n    }\n    return px;\n  };\n\n  const get = (p: string): any => {\n    const s = leaves.get(p);\n    if (s) {\n      const v = s.value;\n      return Array.isArray(v) ? wrapArray(v, s, p) : v;\n    }\n    if (kids.has(p)) return ns(p);\n    shape.value; // subscribe, so creating this path later re-runs the reader\n    return undefined;\n  };\n\n  const ns = (p: string): any => {\n    let px = nsCache.get(p);\n    if (!px) {\n      const names = () => {\n        shape.value; // read so the effect tracks shape changes\n        return kids.get(p);\n      };\n      px = new Proxy(\n        {},\n        {\n          get: (_, k) =>\n            !str(k) ? undefined : k === 'toJSON' ? () => snapshot(undefined, { at: p }) : get(join(p, k)),\n          set: (_, k, v) => {\n            if (str(k)) set(join(p, k), v);\n            return true;\n          },\n          deleteProperty: (_, k) => {\n            if (str(k)) remove(join(p, k));\n            return true;\n          },\n          has: (_, k) => str(k) && !!names()?.has(k),\n          ownKeys: () => [...(names() ?? [])],\n          getOwnPropertyDescriptor: (_, k) =>\n            str(k) && names()?.has(k)\n              ? { enumerable: true, configurable: true, writable: true, value: get(join(p, k)) }\n              : undefined,\n        },\n      );\n      nsCache.set(p, px);\n    }\n    return px;\n  };\n\n  const scope = new Proxy(\n    {},\n    {\n      has: (_, k) => str(k) && k[0] === '$',\n      get: (_, k) => (!str(k) ? undefined : k === '$' ? ns('') : get(k.slice(1))),\n      set: (_, k, v) => {\n        if (str(k)) k === '$' ? merge(v) : set(k.slice(1), v);\n        return true;\n      },\n    },\n  );\n\n  const paths = (filter?: Filter): string[] => {\n    shape.value;\n    const ok = toPredicate(filter);\n    return [...leaves.keys()].filter(ok);\n  };\n\n  const snapshot = (filter?: Filter, { at = '', computed = true } = {}): Patch => {\n    shape.value;\n    const ok = toPredicate(filter);\n    const out: Patch = {};\n    const rel = (p: string) => (at ? p.slice(at.length + 1) : p);\n    for (const [p, s] of leaves) {\n      if (!under(p, at) || !ok(p) || (!computed && s instanceof Computed)) continue;\n      expand(out, rel(p), s.value);\n    }\n    // Empty namespaces still appear as `{}`.\n    for (const p of kids.keys()) {\n      if (p && p !== at && under(p, at) && ok(p) && !kids.get(p)?.size) expand(out, rel(p), {});\n    }\n    return out;\n  };\n\n  onSettled(() => {\n    if (!pending.size) return;\n    const patch: Patch = {};\n    for (const [p, v] of pending) expand(patch, p, v);\n    pending.clear();\n    for (const fn of listeners) fn(patch);\n  });\n\n  return {\n    get,\n    set,\n    merge,\n    remove,\n    has: (p) => leaves.has(p) || kids.has(p),\n    define,\n    paths,\n    snapshot,\n    onPatch: (fn) => {\n      listeners.add(fn);\n      return () => listeners.delete(fn);\n    },\n    get $() {\n      return ns('');\n    },\n    scope,\n  };\n};\n"],
-  "mappings": "AAAA,SAAS,QAAqB,SAAS,mBAAmB;AAC1D,SAAS,OAAO,UAAU,WAAW,cAAc;AAuBnD,MAAM,WAAW,CAAC,MAAsB,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,EAAE,YAAY,GAAG,CAAC,CAAC;AAClF,MAAM,SAAS,CAAC,MAAsB,EAAE,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;AACpE,MAAM,OAAO,CAAC,GAAW,MAAuB,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK;AAClE,MAAM,QAAQ,CAAC,GAAW,OAAwB,CAAC,MAAM,MAAM,MAAM,EAAE,WAAW,GAAG,EAAE,GAAG;AAC1F,MAAM,MAAM,CAAC,MAA4B,OAAO,MAAM;AAE/C,MAAM,cAAc,MAAa;AACtC,QAAM,SAAS,oBAAI,IAAyB;AAC5C,QAAM,OAAO,oBAAI,IAAyB,CAAC,CAAC,IAAI,oBAAI,IAAI,CAAC,CAAC,CAAC;AAC3D,QAAM,QAAQ,IAAI,OAAO,CAAC;AAC1B,QAAM,UAAU,oBAAI,IAAiB;AACrC,QAAM,YAAY,oBAAI,IAAwB;AAC9C,QAAM,UAAU,oBAAI,IAAiB;AACrC,QAAM,WAAW,oBAAI,QAAqB;AAE1C,QAAM,WAAW,CAAC,MAA2B;AAC3C,QAAIA,OAAM,KAAK,IAAI,CAAC;AACpB,QAAI,CAACA,MAAK;AACR,UAAI,OAAO,IAAI,CAAC,EAAG,UAAS,CAAC;AAC7B,MAAAA,OAAM,oBAAI,IAAI;AACd,WAAK,IAAI,GAAGA,IAAG;AACf,eAAS,SAAS,CAAC,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC;AACnC,YAAM,KAAK;AAAA,IACb;AACA,WAAOA;AAAA,EACT;AAEA,QAAM,WAAW,CAAC,MAAoB;AACpC,UAAM,IAAI,OAAO,IAAI,CAAC;AACtB,QAAI,CAAC,EAAG;AACR,WAAO,OAAO,CAAC;AACf,SAAK,IAAI,SAAS,CAAC,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC;AACvC,YAAQ,IAAI,GAAG,IAAI;AACnB,MAAE,KAAK;AACP,UAAM,KAAK;AAAA,EACb;AAEA,QAAM,SAAS,CAAC,MAAoB;AAClC,UAAMA,OAAM,KAAK,IAAI,CAAC;AACtB,QAAI,CAACA,KAAK;AACV,eAAW,KAAK,CAAC,GAAGA,IAAG,EAAG,QAAO,KAAK,GAAG,CAAC,CAAC;AAC3C,QAAI,GAAG;AACL,WAAK,OAAO,CAAC;AACb,WAAK,IAAI,SAAS,CAAC,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC;AACvC,cAAQ,OAAO,CAAC;AAAA,IAClB;AACA,UAAM,KAAK;AAAA,EACb;AAEA,QAAM,SAAS,CAAC,MACd,MAAM,MAAM;AACV,aAAS,CAAC;AACV,WAAO,CAAC;AAAA,EACV,CAAC;AAEH,QAAM,SAAS,CAAC,GAAW,SACzB,MAAM,MAAM;AACV,QAAI,KAAK,IAAI,CAAC,EAAG,QAAO,CAAC;AACzB,UAAM,MAAM,OAAO,IAAI,CAAC;AACxB,WAAO,IAAI,GAAG,IAAI;AAClB,aAAS,SAAS,CAAC,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC;AACnC,SAAK,KAAK;AACV,UAAM,KAAK;AAAA,EACb,CAAC;AAEH,QAAM,MAAM,CAAC,GAAW,MACtB,MAAM,MAAM;AACV,QAAI,KAAK,KAAM,QAAO,OAAO,CAAC;AAC9B,QAAI,QAAQ,CAAC,GAAG;AACd,YAAM,QAAQ,SAAS,CAAC;AACxB,iBAAW,KAAK,CAAC,GAAG,KAAK,EAAG,KAAI,EAAE,KAAK,GAAI,QAAO,KAAK,GAAG,CAAC,CAAC;AAC5D,iBAAW,KAAK,EAAG,KAAI,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AACvC;AAAA,IACF;AACA,QAAI,KAAK,IAAI,CAAC,EAAG,QAAO,CAAC;AACzB,UAAM,IAAI,OAAO,IAAI,CAAC;AACtB,QAAI,aAAa,SAAU,OAAM,IAAI,MAAM,IAAI,CAAC,+CAA+C;AAC/F,QAAI,GAAG;AACL,UAAI,OAAO,GAAG,EAAE,KAAK,GAAG,CAAC,EAAG;AAC5B,QAAE,QAAQ;AAAA,IACZ,OAAO;AACL,aAAO,GAAG,IAAI,OAAO,CAAC,CAAC;AAAA,IACzB;AACA,YAAQ,IAAI,GAAG,CAAC;AAAA,EAClB,CAAC;AAEH,QAAM,QAAQ,CAAC,OAAc,EAAE,KAAK,IAAI,YAAY,MAAM,IAAI,CAAC,MAC7D,MAAM,MAAM;AACV,QAAI,CAAC,QAAQ,KAAK,EAAG;AACrB,aAAS,EAAE;AACX,eAAW,KAAK,OAAO;AACrB,YAAM,IAAI,KAAK,IAAI,CAAC;AACpB,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,MAAM,MAAM;AACd,YAAI,CAAC,UAAW,QAAO,CAAC;AAAA,MAC1B,WAAW,QAAQ,CAAC,GAAG;AACrB,cAAM,GAAG,EAAE,IAAI,GAAG,UAAU,CAAC;AAAA,MAC/B,WAAW,EAAE,cAAc,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,aAAa,WAAW;AACjG,YAAI,GAAG,CAAC;AAAA,MACV;AAAA,IACF;AAAA,EACF,CAAC;AAGH,QAAM,YAAY,CAAC,KAAY,GAAgB,MAAmB;AAChE,QAAI,KAAK,SAAS,IAAI,GAAG;AACzB,QAAI,CAAC,IAAI;AACP,YAAM,QAAQ,MAAM;AAClB,gBAAQ,IAAI,GAAG,GAAG;AAClB,UAAE,KAAK;AAAA,MACT;AACA,WAAK,IAAI,MAAM,KAAK;AAAA,QAClB,KAAK,CAAC,GAAG,GAAG,MAAM;AAChB,UAAC,EAAU,CAAC,IAAI;AAChB,gBAAM;AACN,iBAAO;AAAA,QACT;AAAA,QACA,gBAAgB,CAAC,GAAG,MAAM;AACxB,iBAAQ,EAAU,CAAC;AACnB,gBAAM;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AACD,eAAS,IAAI,KAAK,EAAE;AAAA,IACtB;AACA,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,CAAC,MAAmB;AAC9B,UAAM,IAAI,OAAO,IAAI,CAAC;AACtB,QAAI,GAAG;AACL,YAAM,IAAI,EAAE;AACZ,aAAO,MAAM,QAAQ,CAAC,IAAI,UAAU,GAAG,GAAG,CAAC,IAAI;AAAA,IACjD;AACA,QAAI,KAAK,IAAI,CAAC,EAAG,QAAO,GAAG,CAAC;AAC5B,UAAM;AACN,WAAO;AAAA,EACT;AAEA,QAAM,KAAK,CAAC,MAAmB;AAC7B,QAAI,KAAK,QAAQ,IAAI,CAAC;AACtB,QAAI,CAAC,IAAI;AACP,YAAM,QAAQ,MAAM;AAClB,cAAM;AACN,eAAO,KAAK,IAAI,CAAC;AAAA,MACnB;AACA,WAAK,IAAI;AAAA,QACP,CAAC;AAAA,QACD;AAAA,UACE,KAAK,CAAC,GAAG,MACP,CAAC,IAAI,CAAC,IAAI,SAAY,MAAM,WAAW,MAAM,SAAS,QAAW,EAAE,IAAI,EAAE,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;AAAA,UAC9F,KAAK,CAAC,GAAG,GAAG,MAAM;AAChB,gBAAI,IAAI,CAAC,EAAG,KAAI,KAAK,GAAG,CAAC,GAAG,CAAC;AAC7B,mBAAO;AAAA,UACT;AAAA,UACA,gBAAgB,CAAC,GAAG,MAAM;AACxB,gBAAI,IAAI,CAAC,EAAG,QAAO,KAAK,GAAG,CAAC,CAAC;AAC7B,mBAAO;AAAA,UACT;AAAA,UACA,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;AAAA,UACzC,SAAS,MAAM,CAAC,GAAI,MAAM,KAAK,CAAC,CAAE;AAAA,UAClC,0BAA0B,CAAC,GAAG,MAC5B,IAAI,CAAC,KAAK,MAAM,GAAG,IAAI,CAAC,IACpB,EAAE,YAAY,MAAM,cAAc,MAAM,UAAU,MAAM,OAAO,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,IAC/E;AAAA,QACR;AAAA,MACF;AACA,cAAQ,IAAI,GAAG,EAAE;AAAA,IACnB;AACA,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,IAAI;AAAA,IAChB,CAAC;AAAA,IACD;AAAA,MACE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC,MAAM;AAAA,MAClC,KAAK,CAAC,GAAG,MAAO,CAAC,IAAI,CAAC,IAAI,SAAY,MAAM,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,MAAM,CAAC,CAAC;AAAA,MACzE,KAAK,CAAC,GAAG,GAAG,MAAM;AAChB,YAAI,IAAI,CAAC,EAAG,OAAM,MAAM,MAAM,CAAC,IAAI,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC;AACpD,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,CAAC,WAA8B;AAC3C,UAAM;AACN,UAAM,KAAK,YAAY,MAAM;AAC7B,WAAO,CAAC,GAAG,OAAO,KAAK,CAAC,EAAE,OAAO,EAAE;AAAA,EACrC;AAEA,QAAM,WAAW,CAAC,QAAiB,EAAE,KAAK,IAAI,WAAW,KAAK,IAAI,CAAC,MAAa;AAC9E,UAAM;AACN,UAAM,KAAK,YAAY,MAAM;AAC7B,UAAM,MAAa,CAAC;AACpB,UAAM,MAAM,CAAC,MAAe,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC,IAAI;AAC1D,eAAW,CAAC,GAAG,CAAC,KAAK,QAAQ;AAC3B,UAAI,CAAC,MAAM,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,KAAM,CAAC,YAAY,aAAa,SAAW;AACrE,aAAO,KAAK,IAAI,CAAC,GAAG,EAAE,KAAK;AAAA,IAC7B;AAEA,eAAW,KAAK,KAAK,KAAK,GAAG;AAC3B,UAAI,KAAK,MAAM,MAAM,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,KAAM,QAAO,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;AAAA,IAC1F;AACA,WAAO;AAAA,EACT;AAEA,YAAU,MAAM;AACd,QAAI,CAAC,QAAQ,KAAM;AACnB,UAAM,QAAe,CAAC;AACtB,eAAW,CAAC,GAAG,CAAC,KAAK,QAAS,QAAO,OAAO,GAAG,CAAC;AAChD,YAAQ,MAAM;AACd,eAAW,MAAM,UAAW,IAAG,KAAK;AAAA,EACtC,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,CAAC,MAAM,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC;AAAA,IACvC;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,CAAC,OAAO;AACf,gBAAU,IAAI,EAAE;AAChB,aAAO,MAAM,UAAU,OAAO,EAAE;AAAA,IAClC;AAAA,IACA,IAAI,IAAI;AACN,aAAO,GAAG,EAAE;AAAA,IACd;AAAA,IACA;AAAA,EACF;AACF;",
+  "sourcesContent": ["import { expand, type Filter, isPlain, safeKey, toPredicate } from '../lib/objects.js';\nimport { batch, Computed, onSettled, Signal } from './reactive.js';\n\nexport type Patch = Record<string, any>;\n\nexport interface Store {\n  /** Value at a dotted path: a leaf value, a namespace proxy, or undefined. Reads subscribe. */\n  get(path: string): any;\n  /** Replace the value at a path. Plain objects become namespaces; null/undefined removes. */\n  set(path: string, value: any): void;\n  /** JSON merge-patch (RFC 7396): objects merge, null removes, everything else replaces. */\n  merge(patch: Patch, options?: { at?: string; ifMissing?: boolean }): void;\n  remove(path: string): void;\n  has(path: string): boolean;\n  define(path: string, node: Signal<any>): void;\n  /** Leaf paths, filtered; `computed: false` leaves out computed signals. */\n  paths(filter?: Filter, options?: { computed?: boolean }): string[];\n  snapshot(filter?: Filter, options?: { at?: string; computed?: boolean }): Patch;\n  /** Called after each settled batch with the nested object of changed paths (null = removed). */\n  onPatch(fn: (patch: Patch) => void): () => void;\n  readonly $: any;\n}\n\n/** 'a.b.c' \u2192 ['a.b', 'c']; 'a' \u2192 ['', 'a']. */\nconst split = (p: string): [string, string] => {\n  const i = p.lastIndexOf('.');\n  return [i < 0 ? '' : p.slice(0, i), p.slice(i + 1)];\n};\nconst join = (a: string, b: string): string => (a ? `${a}.${b}` : b);\nconst under = (p: string, at: string): boolean => !at || p.startsWith(`${at}.`);\nconst str = (k: unknown): k is string => typeof k === 'string';\n/** Proxy \u2192 the raw array or object behind it, so a proxied value can be stored or compared. */\nconst rawOf = new WeakMap<object, object>();\n\nexport const createStore = (): Store => {\n  const leaves = new Map<string, Signal<any>>();\n  const kids = new Map<string, Set<string>>([['', new Set()]]);\n  const shape = new Signal(0); // bumped on any structural change; enumerations subscribe to it\n  const pending = new Map<string, any>();\n  const listeners = new Set<(p: Patch) => void>();\n  const nsCache = new Map<string, any>();\n  /** Per leaf signal, per raw object: its reactive proxy. */\n  const proxies = new WeakMap<Signal<any>, WeakMap<object, any>>();\n\n  /** Register `p` under its parent namespace (creating the namespace chain) and mark the shape changed. */\n  const link = (p: string): void => {\n    const [parent, name] = split(p);\n    ensureNs(parent).add(name);\n    shape.bump();\n  };\n  const unlink = (p: string): void => {\n    const [parent, name] = split(p);\n    kids.get(parent)?.delete(name);\n    shape.bump();\n  };\n\n  const ensureNs = (p: string): Set<string> => {\n    let set = kids.get(p);\n    if (!set) {\n      if (leaves.has(p)) dropLeaf(p);\n      set = new Set();\n      kids.set(p, set);\n      link(p);\n    }\n    return set;\n  };\n\n  const dropLeaf = (p: string): void => {\n    const s = leaves.get(p);\n    if (!s) return;\n    leaves.delete(p);\n    unlink(p);\n    pending.set(p, null);\n    s.bump();\n    if (s instanceof Computed) s.dispose();\n  };\n\n  const dropNs = (p: string): void => {\n    const set = kids.get(p);\n    if (!set) return;\n    for (const k of [...set]) remove(join(p, k));\n    if (p) {\n      kids.delete(p);\n      nsCache.delete(p);\n      unlink(p);\n    }\n  };\n\n  const remove = (p: string): void =>\n    batch(() => {\n      dropLeaf(p);\n      dropNs(p);\n    });\n\n  const define = (p: string, node: Signal<any>): void =>\n    batch(() => {\n      dropNs(p);\n      const old = leaves.get(p);\n      leaves.set(p, node);\n      link(p);\n      if (old) {\n        old.bump();\n        if (old instanceof Computed) old.dispose();\n      }\n    });\n\n  const set = (p: string, v: any): void =>\n    batch(() => {\n      if (v == null) return remove(p);\n      v = (v && rawOf.get(v)) ?? v;\n      if (isPlain(v)) {\n        for (const k of [...ensureNs(p)]) if (!(k in v)) remove(join(p, k));\n        for (const k in v) if (safeKey(k)) set(join(p, k), v[k]);\n        return;\n      }\n      dropNs(p);\n      const s = leaves.get(p);\n      if (s instanceof Computed) throw new Error(`computed \"${p}\" is read-only`);\n      if (s) {\n        if (Object.is(s.peek(), v)) return;\n        s.value = v;\n      } else {\n        define(p, new Signal(v));\n      }\n      pending.set(p, v);\n    });\n\n  const merge = (patch: Patch, { at = '', ifMissing = false } = {}): void =>\n    batch(() => {\n      if (!isPlain(patch)) return;\n      const keys = Object.keys(patch).filter(safeKey);\n      if (keys.length) ensureNs(at);\n      for (const k of keys) {\n        const p = join(at, k);\n        const v = patch[k];\n        const leaf = leaves.get(p);\n        // Existing values win under ifMissing, and computed leaves are never overwritten by a patch.\n        if (leaf && (ifMissing || leaf instanceof Computed)) continue;\n        if (v === null) {\n          if (!ifMissing) remove(p);\n        } else if (isPlain(v)) merge(v, { at: p, ifMissing });\n        else if (!(ifMissing && kids.has(p))) set(p, v);\n      }\n    });\n\n  const has = (p: string): boolean => leaves.has(p) || kids.has(p);\n\n  /**\n   * Arrays are returned through a proxy so in-place mutation notifies the leaf: writes anywhere\n   * inside (nested objects and arrays included) bump the leaf, and array methods run as one batch.\n   * Proxies are cached per leaf, so the same object under two paths notifies both.\n   */\n  const wrapArray = (raw: any[], s: Signal<any>, p: string): any => {\n    let cache = proxies.get(s);\n    if (!cache) {\n      cache = new WeakMap();\n      proxies.set(s, cache);\n    }\n    const touch = () => {\n      pending.set(p, raw);\n      s.bump();\n      return true;\n    };\n    const wrap = (target: object): any => {\n      let px = cache?.get(target);\n      if (!px) {\n        px = new Proxy(target, {\n          get: (t, k, r) => {\n            const v = Reflect.get(t, k, r);\n            if (typeof v === 'function' && Array.isArray(t)) return (...a: any[]) => batch(() => v.apply(r, a));\n            if (!v || typeof v !== 'object' || !(Array.isArray(v) || isPlain(v))) return v;\n            const d = Object.getOwnPropertyDescriptor(t, k);\n            return d && !d.configurable && !d.writable ? v : wrap(v); // frozen data: the proxy invariant forbids wrapping\n          },\n          set: (t, k, v) => {\n            (t as any)[k] = (v && rawOf.get(v)) ?? v;\n            return touch();\n          },\n          deleteProperty: (t, k) => {\n            delete (t as any)[k];\n            return touch();\n          },\n        });\n        cache?.set(target, px);\n        rawOf.set(px, target);\n      }\n      return px;\n    };\n    return wrap(raw);\n  };\n\n  const get = (p: string): any => {\n    const s = leaves.get(p);\n    if (s) {\n      const v = s.value;\n      return Array.isArray(v) ? wrapArray(v, s, p) : v;\n    }\n    shape.value; // subscribe: a namespace may become a leaf, and a missing path may appear\n    if (kids.has(p)) return ns(p);\n  };\n\n  const ns = (p: string): any => {\n    let px = nsCache.get(p);\n    if (!px) {\n      const names = (k: unknown): k is string => {\n        shape.value; // read so the effect tracks shape changes\n        return str(k) && !!kids.get(p)?.has(k);\n      };\n      px = new Proxy(\n        {},\n        {\n          get: (_, k) =>\n            !str(k) ? undefined : k === 'toJSON' ? () => snapshot(undefined, { at: p }) : get(join(p, k)),\n          set: (_, k, v) => {\n            if (str(k)) set(join(p, k), v);\n            return true;\n          },\n          deleteProperty: (_, k) => {\n            if (str(k)) remove(join(p, k));\n            return true;\n          },\n          has: (_, k) => names(k),\n          ownKeys: () => {\n            shape.value;\n            return [...(kids.get(p) ?? [])];\n          },\n          getOwnPropertyDescriptor: (_, k) =>\n            names(k) ? { enumerable: true, configurable: true, writable: true, value: get(join(p, k)) } : undefined,\n        },\n      );\n      nsCache.set(p, px);\n    }\n    return px;\n  };\n\n  const paths = (filter?: Filter, { computed = true } = {}): string[] => {\n    shape.value;\n    const ok = toPredicate(filter);\n    return [...leaves].filter(([p, s]) => ok(p) && (computed || !(s instanceof Computed))).map(([p]) => p);\n  };\n\n  const snapshot = (filter?: Filter, { at = '', computed = true } = {}): Patch => {\n    const out: Patch = {};\n    for (const p of paths(filter, { computed }))\n      if (under(p, at)) expand(out, at ? p.slice(at.length + 1) : p, leaves.get(p)?.value);\n    return out;\n  };\n\n  onSettled(() => {\n    if (!pending.size) return;\n    const patch: Patch = {};\n    for (const [p, v] of pending) expand(patch, p, v);\n    pending.clear();\n    for (const fn of listeners) fn(patch);\n  });\n\n  return {\n    get,\n    set,\n    merge,\n    remove,\n    has,\n    define,\n    paths,\n    snapshot,\n    onPatch: (fn) => {\n      listeners.add(fn);\n      return () => listeners.delete(fn);\n    },\n    get $() {\n      return ns('');\n    },\n  };\n};\n"],
+  "mappings": "AAAA,SAAS,QAAqB,SAAS,SAAS,mBAAmB;AACnE,SAAS,OAAO,UAAU,WAAW,cAAc;AAuBnD,MAAM,QAAQ,CAAC,MAAgC;AAC7C,QAAM,IAAI,EAAE,YAAY,GAAG;AAC3B,SAAO,CAAC,IAAI,IAAI,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,EAAE,MAAM,IAAI,CAAC,CAAC;AACpD;AACA,MAAM,OAAO,CAAC,GAAW,MAAuB,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK;AAClE,MAAM,QAAQ,CAAC,GAAW,OAAwB,CAAC,MAAM,EAAE,WAAW,GAAG,EAAE,GAAG;AAC9E,MAAM,MAAM,CAAC,MAA4B,OAAO,MAAM;AAEtD,MAAM,QAAQ,oBAAI,QAAwB;AAEnC,MAAM,cAAc,MAAa;AACtC,QAAM,SAAS,oBAAI,IAAyB;AAC5C,QAAM,OAAO,oBAAI,IAAyB,CAAC,CAAC,IAAI,oBAAI,IAAI,CAAC,CAAC,CAAC;AAC3D,QAAM,QAAQ,IAAI,OAAO,CAAC;AAC1B,QAAM,UAAU,oBAAI,IAAiB;AACrC,QAAM,YAAY,oBAAI,IAAwB;AAC9C,QAAM,UAAU,oBAAI,IAAiB;AAErC,QAAM,UAAU,oBAAI,QAA2C;AAG/D,QAAM,OAAO,CAAC,MAAoB;AAChC,UAAM,CAAC,QAAQ,IAAI,IAAI,MAAM,CAAC;AAC9B,aAAS,MAAM,EAAE,IAAI,IAAI;AACzB,UAAM,KAAK;AAAA,EACb;AACA,QAAM,SAAS,CAAC,MAAoB;AAClC,UAAM,CAAC,QAAQ,IAAI,IAAI,MAAM,CAAC;AAC9B,SAAK,IAAI,MAAM,GAAG,OAAO,IAAI;AAC7B,UAAM,KAAK;AAAA,EACb;AAEA,QAAM,WAAW,CAAC,MAA2B;AAC3C,QAAIA,OAAM,KAAK,IAAI,CAAC;AACpB,QAAI,CAACA,MAAK;AACR,UAAI,OAAO,IAAI,CAAC,EAAG,UAAS,CAAC;AAC7B,MAAAA,OAAM,oBAAI,IAAI;AACd,WAAK,IAAI,GAAGA,IAAG;AACf,WAAK,CAAC;AAAA,IACR;AACA,WAAOA;AAAA,EACT;AAEA,QAAM,WAAW,CAAC,MAAoB;AACpC,UAAM,IAAI,OAAO,IAAI,CAAC;AACtB,QAAI,CAAC,EAAG;AACR,WAAO,OAAO,CAAC;AACf,WAAO,CAAC;AACR,YAAQ,IAAI,GAAG,IAAI;AACnB,MAAE,KAAK;AACP,QAAI,aAAa,SAAU,GAAE,QAAQ;AAAA,EACvC;AAEA,QAAM,SAAS,CAAC,MAAoB;AAClC,UAAMA,OAAM,KAAK,IAAI,CAAC;AACtB,QAAI,CAACA,KAAK;AACV,eAAW,KAAK,CAAC,GAAGA,IAAG,EAAG,QAAO,KAAK,GAAG,CAAC,CAAC;AAC3C,QAAI,GAAG;AACL,WAAK,OAAO,CAAC;AACb,cAAQ,OAAO,CAAC;AAChB,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAEA,QAAM,SAAS,CAAC,MACd,MAAM,MAAM;AACV,aAAS,CAAC;AACV,WAAO,CAAC;AAAA,EACV,CAAC;AAEH,QAAM,SAAS,CAAC,GAAW,SACzB,MAAM,MAAM;AACV,WAAO,CAAC;AACR,UAAM,MAAM,OAAO,IAAI,CAAC;AACxB,WAAO,IAAI,GAAG,IAAI;AAClB,SAAK,CAAC;AACN,QAAI,KAAK;AACP,UAAI,KAAK;AACT,UAAI,eAAe,SAAU,KAAI,QAAQ;AAAA,IAC3C;AAAA,EACF,CAAC;AAEH,QAAM,MAAM,CAAC,GAAW,MACtB,MAAM,MAAM;AACV,QAAI,KAAK,KAAM,QAAO,OAAO,CAAC;AAC9B,SAAK,KAAK,MAAM,IAAI,CAAC,MAAM;AAC3B,QAAI,QAAQ,CAAC,GAAG;AACd,iBAAW,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,EAAG,KAAI,EAAE,KAAK,GAAI,QAAO,KAAK,GAAG,CAAC,CAAC;AAClE,iBAAW,KAAK,EAAG,KAAI,QAAQ,CAAC,EAAG,KAAI,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AACvD;AAAA,IACF;AACA,WAAO,CAAC;AACR,UAAM,IAAI,OAAO,IAAI,CAAC;AACtB,QAAI,aAAa,SAAU,OAAM,IAAI,MAAM,aAAa,CAAC,gBAAgB;AACzE,QAAI,GAAG;AACL,UAAI,OAAO,GAAG,EAAE,KAAK,GAAG,CAAC,EAAG;AAC5B,QAAE,QAAQ;AAAA,IACZ,OAAO;AACL,aAAO,GAAG,IAAI,OAAO,CAAC,CAAC;AAAA,IACzB;AACA,YAAQ,IAAI,GAAG,CAAC;AAAA,EAClB,CAAC;AAEH,QAAM,QAAQ,CAAC,OAAc,EAAE,KAAK,IAAI,YAAY,MAAM,IAAI,CAAC,MAC7D,MAAM,MAAM;AACV,QAAI,CAAC,QAAQ,KAAK,EAAG;AACrB,UAAM,OAAO,OAAO,KAAK,KAAK,EAAE,OAAO,OAAO;AAC9C,QAAI,KAAK,OAAQ,UAAS,EAAE;AAC5B,eAAW,KAAK,MAAM;AACpB,YAAM,IAAI,KAAK,IAAI,CAAC;AACpB,YAAM,IAAI,MAAM,CAAC;AACjB,YAAM,OAAO,OAAO,IAAI,CAAC;AAEzB,UAAI,SAAS,aAAa,gBAAgB,UAAW;AACrD,UAAI,MAAM,MAAM;AACd,YAAI,CAAC,UAAW,QAAO,CAAC;AAAA,MAC1B,WAAW,QAAQ,CAAC,EAAG,OAAM,GAAG,EAAE,IAAI,GAAG,UAAU,CAAC;AAAA,eAC3C,EAAE,aAAa,KAAK,IAAI,CAAC,GAAI,KAAI,GAAG,CAAC;AAAA,IAChD;AAAA,EACF,CAAC;AAEH,QAAM,MAAM,CAAC,MAAuB,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC;AAO/D,QAAM,YAAY,CAAC,KAAY,GAAgB,MAAmB;AAChE,QAAI,QAAQ,QAAQ,IAAI,CAAC;AACzB,QAAI,CAAC,OAAO;AACV,cAAQ,oBAAI,QAAQ;AACpB,cAAQ,IAAI,GAAG,KAAK;AAAA,IACtB;AACA,UAAM,QAAQ,MAAM;AAClB,cAAQ,IAAI,GAAG,GAAG;AAClB,QAAE,KAAK;AACP,aAAO;AAAA,IACT;AACA,UAAM,OAAO,CAAC,WAAwB;AACpC,UAAI,KAAK,OAAO,IAAI,MAAM;AAC1B,UAAI,CAAC,IAAI;AACP,aAAK,IAAI,MAAM,QAAQ;AAAA,UACrB,KAAK,CAAC,GAAG,GAAG,MAAM;AAChB,kBAAM,IAAI,QAAQ,IAAI,GAAG,GAAG,CAAC;AAC7B,gBAAI,OAAO,MAAM,cAAc,MAAM,QAAQ,CAAC,EAAG,QAAO,IAAI,MAAa,MAAM,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC;AAClG,gBAAI,CAAC,KAAK,OAAO,MAAM,YAAY,EAAE,MAAM,QAAQ,CAAC,KAAK,QAAQ,CAAC,GAAI,QAAO;AAC7E,kBAAM,IAAI,OAAO,yBAAyB,GAAG,CAAC;AAC9C,mBAAO,KAAK,CAAC,EAAE,gBAAgB,CAAC,EAAE,WAAW,IAAI,KAAK,CAAC;AAAA,UACzD;AAAA,UACA,KAAK,CAAC,GAAG,GAAG,MAAM;AAChB,YAAC,EAAU,CAAC,KAAK,KAAK,MAAM,IAAI,CAAC,MAAM;AACvC,mBAAO,MAAM;AAAA,UACf;AAAA,UACA,gBAAgB,CAAC,GAAG,MAAM;AACxB,mBAAQ,EAAU,CAAC;AACnB,mBAAO,MAAM;AAAA,UACf;AAAA,QACF,CAAC;AACD,eAAO,IAAI,QAAQ,EAAE;AACrB,cAAM,IAAI,IAAI,MAAM;AAAA,MACtB;AACA,aAAO;AAAA,IACT;AACA,WAAO,KAAK,GAAG;AAAA,EACjB;AAEA,QAAM,MAAM,CAAC,MAAmB;AAC9B,UAAM,IAAI,OAAO,IAAI,CAAC;AACtB,QAAI,GAAG;AACL,YAAM,IAAI,EAAE;AACZ,aAAO,MAAM,QAAQ,CAAC,IAAI,UAAU,GAAG,GAAG,CAAC,IAAI;AAAA,IACjD;AACA,UAAM;AACN,QAAI,KAAK,IAAI,CAAC,EAAG,QAAO,GAAG,CAAC;AAAA,EAC9B;AAEA,QAAM,KAAK,CAAC,MAAmB;AAC7B,QAAI,KAAK,QAAQ,IAAI,CAAC;AACtB,QAAI,CAAC,IAAI;AACP,YAAM,QAAQ,CAAC,MAA4B;AACzC,cAAM;AACN,eAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;AAAA,MACvC;AACA,WAAK,IAAI;AAAA,QACP,CAAC;AAAA,QACD;AAAA,UACE,KAAK,CAAC,GAAG,MACP,CAAC,IAAI,CAAC,IAAI,SAAY,MAAM,WAAW,MAAM,SAAS,QAAW,EAAE,IAAI,EAAE,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;AAAA,UAC9F,KAAK,CAAC,GAAG,GAAG,MAAM;AAChB,gBAAI,IAAI,CAAC,EAAG,KAAI,KAAK,GAAG,CAAC,GAAG,CAAC;AAC7B,mBAAO;AAAA,UACT;AAAA,UACA,gBAAgB,CAAC,GAAG,MAAM;AACxB,gBAAI,IAAI,CAAC,EAAG,QAAO,KAAK,GAAG,CAAC,CAAC;AAC7B,mBAAO;AAAA,UACT;AAAA,UACA,KAAK,CAAC,GAAG,MAAM,MAAM,CAAC;AAAA,UACtB,SAAS,MAAM;AACb,kBAAM;AACN,mBAAO,CAAC,GAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAE;AAAA,UAChC;AAAA,UACA,0BAA0B,CAAC,GAAG,MAC5B,MAAM,CAAC,IAAI,EAAE,YAAY,MAAM,cAAc,MAAM,UAAU,MAAM,OAAO,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI;AAAA,QAClG;AAAA,MACF;AACA,cAAQ,IAAI,GAAG,EAAE;AAAA,IACnB;AACA,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,CAAC,QAAiB,EAAE,WAAW,KAAK,IAAI,CAAC,MAAgB;AACrE,UAAM;AACN,UAAM,KAAK,YAAY,MAAM;AAC7B,WAAO,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,MAAM,YAAY,EAAE,aAAa,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AAAA,EACvG;AAEA,QAAM,WAAW,CAAC,QAAiB,EAAE,KAAK,IAAI,WAAW,KAAK,IAAI,CAAC,MAAa;AAC9E,UAAM,MAAa,CAAC;AACpB,eAAW,KAAK,MAAM,QAAQ,EAAE,SAAS,CAAC;AACxC,UAAI,MAAM,GAAG,EAAE,EAAG,QAAO,KAAK,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC,IAAI,GAAG,OAAO,IAAI,CAAC,GAAG,KAAK;AACrF,WAAO;AAAA,EACT;AAEA,YAAU,MAAM;AACd,QAAI,CAAC,QAAQ,KAAM;AACnB,UAAM,QAAe,CAAC;AACtB,eAAW,CAAC,GAAG,CAAC,KAAK,QAAS,QAAO,OAAO,GAAG,CAAC;AAChD,YAAQ,MAAM;AACd,eAAW,MAAM,UAAW,IAAG,KAAK;AAAA,EACtC,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,CAAC,OAAO;AACf,gBAAU,IAAI,EAAE;AAChB,aAAO,MAAM,UAAU,OAAO,EAAE;AAAA,IAClC;AAAA,IACA,IAAI,IAAI;AACN,aAAO,GAAG,EAAE;AAAA,IACd;AAAA,EACF;AACF;",
   "names": ["set"]
 }

package/dist/kernel/strict-csp.d.ts

@@ -1,7 +1,2 @@
 import type { Compiler } from './compile.js';
-/**
- * Compiler for pages with a strict Content-Security-Policy: compiles through a nonce-bearing
- * inline `<script>` (and a Trusted Types policy when present) instead of `new Function`.
- * Pass as `createSigmx({ compile: cspCompiler(nonce) })`.
- */
 export declare const cspCompiler: (nonce: string) => Compiler;

package/dist/kernel/strict-csp.js

@@ -1,7 +1,7 @@
+let policy;
 const cspCompiler = (nonce) => {
   if (!nonce) throw new Error("cspCompiler needs the page nonce");
-  const tt = window.trustedTypes;
-  const policy = tt?.createPolicy("sigmx", { createScript: (s) => s });
+  policy ??= window.trustedTypes?.createPolicy("sigmx", { createScript: (s) => s });
   return (params, body) => {
     const script = document.createElement("script");
     script.nonce = nonce;

package/dist/kernel/strict-csp.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/kernel/strict-csp.ts"],
-  "sourcesContent": ["import type { Compiler } from './compile.js';\n\n/**\n * Compiler for pages with a strict Content-Security-Policy: compiles through a nonce-bearing\n * inline `<script>` (and a Trusted Types policy when present) instead of `new Function`.\n * Pass as `createSigmx({ compile: cspCompiler(nonce) })`.\n */\nexport const cspCompiler = (nonce: string): Compiler => {\n  if (!nonce) throw new Error('cspCompiler needs the page nonce');\n  const tt = (window as any).trustedTypes;\n  const policy = tt?.createPolicy('sigmx', { createScript: (s: string) => s });\n  return (params, body) => {\n    const script = document.createElement('script');\n    script.nonce = nonce;\n    const text = `document.currentScript.f=function(${params.join(',')}){${body}}`;\n    script.text = policy ? policy.createScript(text) : text;\n    document.head.append(script);\n    script.remove();\n    const fn = (script as any).f;\n    if (!fn) throw new Error('the Content-Security-Policy blocked expression compilation');\n    return fn;\n  };\n};\n"],
-  "mappings": "AAOO,MAAM,cAAc,CAAC,UAA4B;AACtD,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,kCAAkC;AAC9D,QAAM,KAAM,OAAe;AAC3B,QAAM,SAAS,IAAI,aAAa,SAAS,EAAE,cAAc,CAAC,MAAc,EAAE,CAAC;AAC3E,SAAO,CAAC,QAAQ,SAAS;AACvB,UAAM,SAAS,SAAS,cAAc,QAAQ;AAC9C,WAAO,QAAQ;AACf,UAAM,OAAO,qCAAqC,OAAO,KAAK,GAAG,CAAC,KAAK,IAAI;AAC3E,WAAO,OAAO,SAAS,OAAO,aAAa,IAAI,IAAI;AACnD,aAAS,KAAK,OAAO,MAAM;AAC3B,WAAO,OAAO;AACd,UAAM,KAAM,OAAe;AAC3B,QAAI,CAAC,GAAI,OAAM,IAAI,MAAM,4DAA4D;AACrF,WAAO;AAAA,EACT;AACF;",
+  "sourcesContent": ["import type { Compiler } from './compile.js';\n\n/**\n * Compiler for pages with a strict Content-Security-Policy: compiles through a nonce-bearing\n * inline `<script>` (and a Trusted Types policy when present) instead of `new Function`.\n * Pass as `createSigmx({ compile: cspCompiler(nonce) })`.\n */\nlet policy: { createScript(s: string): any } | undefined;\n\nexport const cspCompiler = (nonce: string): Compiler => {\n  if (!nonce) throw new Error('cspCompiler needs the page nonce');\n  // One Trusted Types policy per page: creating a second one with the same name throws under a strict CSP.\n  policy ??= (window as any).trustedTypes?.createPolicy('sigmx', { createScript: (s: string) => s });\n  return (params, body) => {\n    const script = document.createElement('script');\n    script.nonce = nonce;\n    const text = `document.currentScript.f=function(${params.join(',')}){${body}}`;\n    script.text = policy ? policy.createScript(text) : text;\n    document.head.append(script);\n    script.remove();\n    const fn = (script as any).f;\n    if (!fn) throw new Error('the Content-Security-Policy blocked expression compilation');\n    return fn;\n  };\n};\n"],
+  "mappings": "AAOA,IAAI;AAEG,MAAM,cAAc,CAAC,UAA4B;AACtD,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,kCAAkC;AAE9D,aAAY,OAAe,cAAc,aAAa,SAAS,EAAE,cAAc,CAAC,MAAc,EAAE,CAAC;AACjG,SAAO,CAAC,QAAQ,SAAS;AACvB,UAAM,SAAS,SAAS,cAAc,QAAQ;AAC9C,WAAO,QAAQ;AACf,UAAM,OAAO,qCAAqC,OAAO,KAAK,GAAG,CAAC,KAAK,IAAI;AAC3E,WAAO,OAAO,SAAS,OAAO,aAAa,IAAI,IAAI;AACnD,aAAS,KAAK,OAAO,MAAM;AAC3B,WAAO,OAAO;AACd,UAAM,KAAM,OAAe;AAC3B,QAAI,CAAC,GAAI,OAAM,IAAI,MAAM,4DAA4D;AACrF,WAAO;AAAA,EACT;AACF;",
   "names": []
 }

package/dist/lib/casing.d.ts

@@ -3,5 +3,8 @@ export declare const kebab: (s: string) => string;
 export declare const snake: (s: string) => string;
 export declare const camel: (s: string) => string;
 export declare const pascal: (s: string) => string;
-/** Recase a dotted path segment by segment so `user.first-name` becomes `user.firstName`. */
+/**
+ * Recase a dotted path segment by segment so `user.first-name` becomes `user.firstName`. Leading
+ * underscores survive (`_draft` stays `_draft`); an unknown style is an error.
+ */
 export declare const recase: (path: string, style: CaseStyle) => string;

package/dist/lib/casing.js

@@ -5,7 +5,14 @@ const snake = (s) => words(s).join("_");
 const camel = (s) => words(s).map((w, i) => i ? cap(w) : w).join("");
 const pascal = (s) => words(s).map(cap).join("");
 const styles = { camel, kebab, snake, pascal };
-const recase = (path, style) => path.split(".").map(styles[style]).join(".");
+const recase = (path, style) => {
+  const f = styles[style];
+  if (!f) throw new Error(`unknown case "${style}"`);
+  return path.split(".").map((seg) => {
+    const u = /^_+/.exec(seg)?.[0] ?? "";
+    return u + f(seg.slice(u.length));
+  }).join(".");
+};
 export {
   camel,
   kebab,

package/dist/lib/casing.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/lib/casing.ts"],
-  "sourcesContent": ["export type CaseStyle = 'camel' | 'kebab' | 'snake' | 'pascal';\n\nconst words = (s: string): string[] =>\n  s\n    .replace(/([a-z0-9])([A-Z])|([A-Z]+)([A-Z][a-z])/g, '$1$3 $2$4')\n    .split(/[^A-Za-z0-9]+/)\n    .filter(Boolean)\n    .map((w) => w.toLowerCase());\n\nconst cap = (w: string): string => w[0].toUpperCase() + w.slice(1);\n\nexport const kebab = (s: string): string => words(s).join('-');\nexport const snake = (s: string): string => words(s).join('_');\nexport const camel = (s: string): string =>\n  words(s)\n    .map((w, i) => (i ? cap(w) : w))\n    .join('');\nexport const pascal = (s: string): string => words(s).map(cap).join('');\n\nconst styles = { camel, kebab, snake, pascal };\n\n/** Recase a dotted path segment by segment so `user.first-name` becomes `user.firstName`. */\nexport const recase = (path: string, style: CaseStyle): string => path.split('.').map(styles[style]).join('.');\n"],
-  "mappings": "AAEA,MAAM,QAAQ,CAAC,MACb,EACG,QAAQ,2CAA2C,WAAW,EAC9D,MAAM,eAAe,EACrB,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAE/B,MAAM,MAAM,CAAC,MAAsB,EAAE,CAAC,EAAE,YAAY,IAAI,EAAE,MAAM,CAAC;AAE1D,MAAM,QAAQ,CAAC,MAAsB,MAAM,CAAC,EAAE,KAAK,GAAG;AACtD,MAAM,QAAQ,CAAC,MAAsB,MAAM,CAAC,EAAE,KAAK,GAAG;AACtD,MAAM,QAAQ,CAAC,MACpB,MAAM,CAAC,EACJ,IAAI,CAAC,GAAG,MAAO,IAAI,IAAI,CAAC,IAAI,CAAE,EAC9B,KAAK,EAAE;AACL,MAAM,SAAS,CAAC,MAAsB,MAAM,CAAC,EAAE,IAAI,GAAG,EAAE,KAAK,EAAE;AAEtE,MAAM,SAAS,EAAE,OAAO,OAAO,OAAO,OAAO;AAGtC,MAAM,SAAS,CAAC,MAAc,UAA6B,KAAK,MAAM,GAAG,EAAE,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,GAAG;",
+  "sourcesContent": ["export type CaseStyle = 'camel' | 'kebab' | 'snake' | 'pascal';\n\nconst words = (s: string): string[] =>\n  s\n    .replace(/([a-z0-9])([A-Z])|([A-Z]+)([A-Z][a-z])/g, '$1$3 $2$4')\n    .split(/[^A-Za-z0-9]+/)\n    .filter(Boolean)\n    .map((w) => w.toLowerCase());\n\nconst cap = (w: string): string => w[0].toUpperCase() + w.slice(1);\n\nexport const kebab = (s: string): string => words(s).join('-');\nexport const snake = (s: string): string => words(s).join('_');\nexport const camel = (s: string): string =>\n  words(s)\n    .map((w, i) => (i ? cap(w) : w))\n    .join('');\nexport const pascal = (s: string): string => words(s).map(cap).join('');\n\nconst styles = { camel, kebab, snake, pascal };\n\n/**\n * Recase a dotted path segment by segment so `user.first-name` becomes `user.firstName`. Leading\n * underscores survive (`_draft` stays `_draft`); an unknown style is an error.\n */\nexport const recase = (path: string, style: CaseStyle): string => {\n  const f = styles[style];\n  if (!f) throw new Error(`unknown case \"${style}\"`);\n  return path\n    .split('.')\n    .map((seg) => {\n      const u = /^_+/.exec(seg)?.[0] ?? '';\n      return u + f(seg.slice(u.length));\n    })\n    .join('.');\n};\n"],
+  "mappings": "AAEA,MAAM,QAAQ,CAAC,MACb,EACG,QAAQ,2CAA2C,WAAW,EAC9D,MAAM,eAAe,EACrB,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAE/B,MAAM,MAAM,CAAC,MAAsB,EAAE,CAAC,EAAE,YAAY,IAAI,EAAE,MAAM,CAAC;AAE1D,MAAM,QAAQ,CAAC,MAAsB,MAAM,CAAC,EAAE,KAAK,GAAG;AACtD,MAAM,QAAQ,CAAC,MAAsB,MAAM,CAAC,EAAE,KAAK,GAAG;AACtD,MAAM,QAAQ,CAAC,MACpB,MAAM,CAAC,EACJ,IAAI,CAAC,GAAG,MAAO,IAAI,IAAI,CAAC,IAAI,CAAE,EAC9B,KAAK,EAAE;AACL,MAAM,SAAS,CAAC,MAAsB,MAAM,CAAC,EAAE,IAAI,GAAG,EAAE,KAAK,EAAE;AAEtE,MAAM,SAAS,EAAE,OAAO,OAAO,OAAO,OAAO;AAMtC,MAAM,SAAS,CAAC,MAAc,UAA6B;AAChE,QAAM,IAAI,OAAO,KAAK;AACtB,MAAI,CAAC,EAAG,OAAM,IAAI,MAAM,iBAAiB,KAAK,GAAG;AACjD,SAAO,KACJ,MAAM,GAAG,EACT,IAAI,CAAC,QAAQ;AACZ,UAAM,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK;AAClC,WAAO,IAAI,EAAE,IAAI,MAAM,EAAE,MAAM,CAAC;AAAA,EAClC,CAAC,EACA,KAAK,GAAG;AACb;",
   "names": []
 }

package/dist/lib/objects.d.ts

@@ -1,8 +1,10 @@
 export declare const isPlain: (v: unknown) => v is Record<string, any>;
+/** Keys that would walk into Object.prototype are never written: patches can come from a network. */
+export declare const safeKey: (k: string) => boolean;
 export declare const expand: (out: Record<string, any>, path: string, value: any) => Record<string, any>;
 export type Filter = {
-    include?: RegExp | string;
-    exclude?: RegExp | string;
+    include?: RegExp;
+    exclude?: RegExp;
 } | ((path: string) => boolean);
-/** Turn `{ include, exclude }` (regex or string) or a predicate into a path predicate. */
+/** Turn `{ include, exclude }` regexes or a predicate into a path predicate. */
 export declare const toPredicate: (f?: Filter) => ((path: string) => boolean);

package/dist/lib/objects.js

@@ -3,27 +3,32 @@ const isPlain = (v) => {
   const proto = Object.getPrototypeOf(v);
   return proto === Object.prototype || proto === null;
 };
+const safeKey = (k) => k !== "__proto__" && k !== "constructor" && k !== "prototype";
 const expand = (out, path, value) => {
   const keys = path.split(".");
+  if (!keys.every(safeKey)) return out;
   const last = keys.pop();
   let cur = out;
   for (const k of keys) {
-    if (!isPlain(cur[k])) cur[k] = {};
+    if (!isPlain(cur[k]) || !Object.hasOwn(cur, k)) cur[k] = {};
     cur = cur[k];
   }
   cur[last] = value;
   return out;
 };
-const re = (v, fallback) => v === void 0 ? fallback : typeof v === "string" ? new RegExp(v.replace(/^\/|\/$/g, "")) : v;
 const toPredicate = (f) => {
   if (typeof f === "function") return f;
-  const inc = re(f?.include, /(?:)/);
-  const exc = re(f?.exclude, /(?!)/);
-  return (p) => inc.test(p) && !exc.test(p);
+  const test = (re, p) => {
+    if (!re) return void 0;
+    re.lastIndex = 0;
+    return re.test(p);
+  };
+  return (p) => (test(f?.include, p) ?? true) && !test(f?.exclude, p);
 };
 export {
   expand,
   isPlain,
+  safeKey,
   toPredicate
 };
 //# sourceMappingURL=objects.js.map

package/dist/lib/objects.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/lib/objects.ts"],
-  "sourcesContent": ["export const isPlain = (v: unknown): v is Record<string, any> => {\n  if (v === null || typeof v !== 'object') return false;\n  const proto = Object.getPrototypeOf(v);\n  return proto === Object.prototype || proto === null;\n};\n\nexport const expand = (out: Record<string, any>, path: string, value: any): Record<string, any> => {\n  const keys = path.split('.');\n  const last = keys.pop() as string;\n  let cur = out;\n  for (const k of keys) {\n    if (!isPlain(cur[k])) cur[k] = {};\n    cur = cur[k];\n  }\n  cur[last] = value;\n  return out;\n};\n\nexport type Filter = { include?: RegExp | string; exclude?: RegExp | string } | ((path: string) => boolean);\n\nconst re = (v: RegExp | string | undefined, fallback: RegExp): RegExp =>\n  v === undefined ? fallback : typeof v === 'string' ? new RegExp(v.replace(/^\\/|\\/$/g, '')) : v;\n\n/** Turn `{ include, exclude }` (regex or string) or a predicate into a path predicate. */\nexport const toPredicate = (f?: Filter): ((path: string) => boolean) => {\n  if (typeof f === 'function') return f;\n  const inc = re(f?.include, /(?:)/);\n  const exc = re(f?.exclude, /(?!)/);\n  return (p) => inc.test(p) && !exc.test(p);\n};\n"],
-  "mappings": "AAAO,MAAM,UAAU,CAAC,MAAyC;AAC/D,MAAI,MAAM,QAAQ,OAAO,MAAM,SAAU,QAAO;AAChD,QAAM,QAAQ,OAAO,eAAe,CAAC;AACrC,SAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAEO,MAAM,SAAS,CAAC,KAA0B,MAAc,UAAoC;AACjG,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,QAAM,OAAO,KAAK,IAAI;AACtB,MAAI,MAAM;AACV,aAAW,KAAK,MAAM;AACpB,QAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAG,KAAI,CAAC,IAAI,CAAC;AAChC,UAAM,IAAI,CAAC;AAAA,EACb;AACA,MAAI,IAAI,IAAI;AACZ,SAAO;AACT;AAIA,MAAM,KAAK,CAAC,GAAgC,aAC1C,MAAM,SAAY,WAAW,OAAO,MAAM,WAAW,IAAI,OAAO,EAAE,QAAQ,YAAY,EAAE,CAAC,IAAI;AAGxF,MAAM,cAAc,CAAC,MAA4C;AACtE,MAAI,OAAO,MAAM,WAAY,QAAO;AACpC,QAAM,MAAM,GAAG,GAAG,SAAS,MAAM;AACjC,QAAM,MAAM,GAAG,GAAG,SAAS,MAAM;AACjC,SAAO,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;AAC1C;",
+  "sourcesContent": ["export const isPlain = (v: unknown): v is Record<string, any> => {\n  if (v === null || typeof v !== 'object') return false;\n  const proto = Object.getPrototypeOf(v);\n  return proto === Object.prototype || proto === null;\n};\n\n/** Keys that would walk into Object.prototype are never written: patches can come from a network. */\nexport const safeKey = (k: string): boolean => k !== '__proto__' && k !== 'constructor' && k !== 'prototype';\n\nexport const expand = (out: Record<string, any>, path: string, value: any): Record<string, any> => {\n  const keys = path.split('.');\n  if (!keys.every(safeKey)) return out;\n  const last = keys.pop() as string;\n  let cur = out;\n  for (const k of keys) {\n    if (!isPlain(cur[k]) || !Object.hasOwn(cur, k)) cur[k] = {};\n    cur = cur[k];\n  }\n  cur[last] = value;\n  return out;\n};\n\nexport type Filter = { include?: RegExp; exclude?: RegExp } | ((path: string) => boolean);\n\n/** Turn `{ include, exclude }` regexes or a predicate into a path predicate. */\nexport const toPredicate = (f?: Filter): ((path: string) => boolean) => {\n  if (typeof f === 'function') return f;\n  // Reset lastIndex so a /g or /y regex gives the same answer for every path.\n  const test = (re: RegExp | undefined, p: string) => {\n    if (!re) return undefined;\n    re.lastIndex = 0;\n    return re.test(p);\n  };\n  return (p) => (test(f?.include, p) ?? true) && !test(f?.exclude, p);\n};\n"],
+  "mappings": "AAAO,MAAM,UAAU,CAAC,MAAyC;AAC/D,MAAI,MAAM,QAAQ,OAAO,MAAM,SAAU,QAAO;AAChD,QAAM,QAAQ,OAAO,eAAe,CAAC;AACrC,SAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAGO,MAAM,UAAU,CAAC,MAAuB,MAAM,eAAe,MAAM,iBAAiB,MAAM;AAE1F,MAAM,SAAS,CAAC,KAA0B,MAAc,UAAoC;AACjG,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,MAAI,CAAC,KAAK,MAAM,OAAO,EAAG,QAAO;AACjC,QAAM,OAAO,KAAK,IAAI;AACtB,MAAI,MAAM;AACV,aAAW,KAAK,MAAM;AACpB,QAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,OAAO,KAAK,CAAC,EAAG,KAAI,CAAC,IAAI,CAAC;AAC1D,UAAM,IAAI,CAAC;AAAA,EACb;AACA,MAAI,IAAI,IAAI;AACZ,SAAO;AACT;AAKO,MAAM,cAAc,CAAC,MAA4C;AACtE,MAAI,OAAO,MAAM,WAAY,QAAO;AAEpC,QAAM,OAAO,CAAC,IAAwB,MAAc;AAClD,QAAI,CAAC,GAAI,QAAO;AAChB,OAAG,YAAY;AACf,WAAO,GAAG,KAAK,CAAC;AAAA,EAClB;AACA,SAAO,CAAC,OAAO,KAAK,GAAG,SAAS,CAAC,KAAK,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC;AACpE;",
   "names": []
 }

package/dist/lib/schedule.d.ts

@@ -1,12 +1,12 @@
 export type Mods = Map<string, string[]>;
 type Fn = (...args: any[]) => void;
-/** '300ms' → 300, '2s' → 2000, '150' → 150. */
+/** '300ms' → 300, '2s' → 2000, '150' → 150; `__x.1.5s` arrives split on the dot and is joined back first. */
 export declare const toMs: (args: string[] | undefined, fallback?: number) => number;
 export declare const delay: (fn: Fn, ms: number) => Fn;
 /** Debounce: wait for a quiet period. `leading` fires on the first call, `trailing` on the last. */
 export declare const debounce: (fn: Fn, ms: number, leading?: boolean, trailing?: boolean) => Fn;
 /** Throttle: at most one call per window. `leading` fires immediately, `trailing` fires once at the end. */
 export declare const throttle: (fn: Fn, ms: number, leading?: boolean, trailing?: boolean) => Fn;
-export declare const withTiming: (fn: Fn, mods: Mods) => Fn;
-export declare const withViewTransition: (fn: Fn, mods: Mods) => Fn;
+/** Apply `__debounce` / `__throttle`; `cleanup` cancels a pending trailing call when the attribute unmounts. */
+export declare const withTiming: (fn: Fn, mods: Mods, cleanup?: (f: () => void) => unknown) => Fn;
 export {};

package/dist/lib/schedule.js

@@ -1,5 +1,5 @@
 const toMs = (args, fallback = 0) => {
-  for (const a of args ?? []) {
+  for (const a of args?.length ? [args.join("."), ...args] : []) {
     const m = /^(\d+(?:\.\d+)?)(ms|s)?$/.exec(a);
     if (m) return +m[1] * (m[2] === "s" ? 1e3 : 1);
   }
@@ -14,7 +14,7 @@ const limit = (fn, ms, leading, trailing, restart) => {
     if (trailing && last) fn(...last);
     last = void 0;
   };
-  return (...args) => {
+  const limited = (...args) => {
     if (timer) {
       last = args;
       if (restart) {
@@ -27,25 +27,27 @@ const limit = (fn, ms, leading, trailing, restart) => {
     else last = args;
     timer = setTimeout(fire, ms);
   };
+  limited.cancel = () => {
+    clearTimeout(timer);
+    timer = last = void 0;
+  };
+  return limited;
 };
 const debounce = (fn, ms, leading = false, trailing = true) => limit(fn, ms, leading, trailing, true);
 const throttle = (fn, ms, leading = true, trailing = false) => limit(fn, ms, leading, trailing, false);
-const withTiming = (fn, mods) => {
-  const d = mods.get("delay");
-  if (d) fn = delay(fn, toMs(d));
+const withTiming = (fn, mods, cleanup) => {
   const db = mods.get("debounce");
-  if (db) fn = debounce(fn, toMs(db, 300), db.includes("leading"), !db.includes("notrailing"));
   const th = mods.get("throttle");
-  if (th) fn = throttle(fn, toMs(th, 300), !th.includes("noleading"), th.includes("trailing"));
+  if (db) fn = limit(fn, toMs(db, 300), db.includes("leading"), !db.includes("notrailing"), true);
+  if (th) fn = limit(fn, toMs(th, 300), !th.includes("noleading"), th.includes("trailing"), false);
+  if (db || th) cleanup?.(fn.cancel);
   return fn;
 };
-const withViewTransition = (fn, mods) => mods.has("viewtransition") && "startViewTransition" in document ? (...args) => void document.startViewTransition(() => fn(...args)) : fn;
 export {
   debounce,
   delay,
   throttle,
   toMs,
-  withTiming,
-  withViewTransition
+  withTiming
 };
 //# sourceMappingURL=schedule.js.map

package/dist/lib/schedule.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/lib/schedule.ts"],
-  "sourcesContent": ["export type Mods = Map<string, string[]>;\ntype Fn = (...args: any[]) => void;\n\n/** '300ms' \u2192 300, '2s' \u2192 2000, '150' \u2192 150. */\nexport const toMs = (args: string[] | undefined, fallback = 0): number => {\n  for (const a of args ?? []) {\n    const m = /^(\\d+(?:\\.\\d+)?)(ms|s)?$/.exec(a);\n    if (m) return +m[1] * (m[2] === 's' ? 1000 : 1);\n  }\n  return fallback;\n};\n\nexport const delay =\n  (fn: Fn, ms: number): Fn =>\n  (...args) =>\n    void setTimeout(fn, ms, ...args);\n\n/** Shared rate limiter. `restart` makes it a debounce (the window restarts on every call). */\nconst limit = (fn: Fn, ms: number, leading: boolean, trailing: boolean, restart: boolean): Fn => {\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  let last: any[] | undefined;\n  const fire = () => {\n    timer = undefined;\n    if (trailing && last) fn(...last);\n    last = undefined;\n  };\n  return (...args) => {\n    if (timer) {\n      last = args;\n      if (restart) {\n        clearTimeout(timer);\n        timer = setTimeout(fire, ms);\n      }\n      return;\n    }\n    if (leading) fn(...args);\n    else last = args;\n    timer = setTimeout(fire, ms);\n  };\n};\n\n/** Debounce: wait for a quiet period. `leading` fires on the first call, `trailing` on the last. */\nexport const debounce = (fn: Fn, ms: number, leading = false, trailing = true): Fn =>\n  limit(fn, ms, leading, trailing, true);\n\n/** Throttle: at most one call per window. `leading` fires immediately, `trailing` fires once at the end. */\nexport const throttle = (fn: Fn, ms: number, leading = true, trailing = false): Fn =>\n  limit(fn, ms, leading, trailing, false);\n\nexport const withTiming = (fn: Fn, mods: Mods): Fn => {\n  const d = mods.get('delay');\n  if (d) fn = delay(fn, toMs(d));\n  const db = mods.get('debounce');\n  if (db) fn = debounce(fn, toMs(db, 300), db.includes('leading'), !db.includes('notrailing'));\n  const th = mods.get('throttle');\n  if (th) fn = throttle(fn, toMs(th, 300), !th.includes('noleading'), th.includes('trailing'));\n  return fn;\n};\n\nexport const withViewTransition = (fn: Fn, mods: Mods): Fn =>\n  mods.has('viewtransition') && 'startViewTransition' in document\n    ? (...args) => void document.startViewTransition(() => fn(...args))\n    : fn;\n"],
-  "mappings": "AAIO,MAAM,OAAO,CAAC,MAA4B,WAAW,MAAc;AACxE,aAAW,KAAK,QAAQ,CAAC,GAAG;AAC1B,UAAM,IAAI,2BAA2B,KAAK,CAAC;AAC3C,QAAI,EAAG,QAAO,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,MAAM,MAAO;AAAA,EAC/C;AACA,SAAO;AACT;AAEO,MAAM,QACX,CAAC,IAAQ,OACT,IAAI,SACF,KAAK,WAAW,IAAI,IAAI,GAAG,IAAI;AAGnC,MAAM,QAAQ,CAAC,IAAQ,IAAY,SAAkB,UAAmB,YAAyB;AAC/F,MAAI;AACJ,MAAI;AACJ,QAAM,OAAO,MAAM;AACjB,YAAQ;AACR,QAAI,YAAY,KAAM,IAAG,GAAG,IAAI;AAChC,WAAO;AAAA,EACT;AACA,SAAO,IAAI,SAAS;AAClB,QAAI,OAAO;AACT,aAAO;AACP,UAAI,SAAS;AACX,qBAAa,KAAK;AAClB,gBAAQ,WAAW,MAAM,EAAE;AAAA,MAC7B;AACA;AAAA,IACF;AACA,QAAI,QAAS,IAAG,GAAG,IAAI;AAAA,QAClB,QAAO;AACZ,YAAQ,WAAW,MAAM,EAAE;AAAA,EAC7B;AACF;AAGO,MAAM,WAAW,CAAC,IAAQ,IAAY,UAAU,OAAO,WAAW,SACvE,MAAM,IAAI,IAAI,SAAS,UAAU,IAAI;AAGhC,MAAM,WAAW,CAAC,IAAQ,IAAY,UAAU,MAAM,WAAW,UACtE,MAAM,IAAI,IAAI,SAAS,UAAU,KAAK;AAEjC,MAAM,aAAa,CAAC,IAAQ,SAAmB;AACpD,QAAM,IAAI,KAAK,IAAI,OAAO;AAC1B,MAAI,EAAG,MAAK,MAAM,IAAI,KAAK,CAAC,CAAC;AAC7B,QAAM,KAAK,KAAK,IAAI,UAAU;AAC9B,MAAI,GAAI,MAAK,SAAS,IAAI,KAAK,IAAI,GAAG,GAAG,GAAG,SAAS,SAAS,GAAG,CAAC,GAAG,SAAS,YAAY,CAAC;AAC3F,QAAM,KAAK,KAAK,IAAI,UAAU;AAC9B,MAAI,GAAI,MAAK,SAAS,IAAI,KAAK,IAAI,GAAG,GAAG,CAAC,GAAG,SAAS,WAAW,GAAG,GAAG,SAAS,UAAU,CAAC;AAC3F,SAAO;AACT;AAEO,MAAM,qBAAqB,CAAC,IAAQ,SACzC,KAAK,IAAI,gBAAgB,KAAK,yBAAyB,WACnD,IAAI,SAAS,KAAK,SAAS,oBAAoB,MAAM,GAAG,GAAG,IAAI,CAAC,IAChE;",
+  "sourcesContent": ["export type Mods = Map<string, string[]>;\ntype Fn = (...args: any[]) => void;\n\n/** '300ms' \u2192 300, '2s' \u2192 2000, '150' \u2192 150; `__x.1.5s` arrives split on the dot and is joined back first. */\nexport const toMs = (args: string[] | undefined, fallback = 0): number => {\n  for (const a of args?.length ? [args.join('.'), ...args] : []) {\n    const m = /^(\\d+(?:\\.\\d+)?)(ms|s)?$/.exec(a);\n    if (m) return +m[1] * (m[2] === 's' ? 1000 : 1);\n  }\n  return fallback;\n};\n\nexport const delay =\n  (fn: Fn, ms: number): Fn =>\n  (...args) =>\n    void setTimeout(fn, ms, ...args);\n\n/** Shared rate limiter. `restart` makes it a debounce (the window restarts on every call). */\ntype Limited = Fn & { cancel(): void };\nconst limit = (fn: Fn, ms: number, leading: boolean, trailing: boolean, restart: boolean): Limited => {\n  let timer: ReturnType<typeof setTimeout> | undefined;\n  let last: any[] | undefined;\n  const fire = () => {\n    timer = undefined;\n    if (trailing && last) fn(...last);\n    last = undefined;\n  };\n  const limited: Limited = (...args) => {\n    if (timer) {\n      last = args;\n      if (restart) {\n        clearTimeout(timer);\n        timer = setTimeout(fire, ms);\n      }\n      return;\n    }\n    if (leading) fn(...args);\n    else last = args;\n    timer = setTimeout(fire, ms);\n  };\n  limited.cancel = () => {\n    clearTimeout(timer);\n    timer = last = undefined;\n  };\n  return limited;\n};\n\n/** Debounce: wait for a quiet period. `leading` fires on the first call, `trailing` on the last. */\nexport const debounce = (fn: Fn, ms: number, leading = false, trailing = true): Fn =>\n  limit(fn, ms, leading, trailing, true);\n\n/** Throttle: at most one call per window. `leading` fires immediately, `trailing` fires once at the end. */\nexport const throttle = (fn: Fn, ms: number, leading = true, trailing = false): Fn =>\n  limit(fn, ms, leading, trailing, false);\n\n/** Apply `__debounce` / `__throttle`; `cleanup` cancels a pending trailing call when the attribute unmounts. */\nexport const withTiming = (fn: Fn, mods: Mods, cleanup?: (f: () => void) => unknown): Fn => {\n  const db = mods.get('debounce');\n  const th = mods.get('throttle');\n  if (db) fn = limit(fn, toMs(db, 300), db.includes('leading'), !db.includes('notrailing'), true);\n  if (th) fn = limit(fn, toMs(th, 300), !th.includes('noleading'), th.includes('trailing'), false);\n  if (db || th) cleanup?.((fn as Limited).cancel);\n  return fn;\n};\n"],
+  "mappings": "AAIO,MAAM,OAAO,CAAC,MAA4B,WAAW,MAAc;AACxE,aAAW,KAAK,MAAM,SAAS,CAAC,KAAK,KAAK,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG;AAC7D,UAAM,IAAI,2BAA2B,KAAK,CAAC;AAC3C,QAAI,EAAG,QAAO,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,MAAM,MAAO;AAAA,EAC/C;AACA,SAAO;AACT;AAEO,MAAM,QACX,CAAC,IAAQ,OACT,IAAI,SACF,KAAK,WAAW,IAAI,IAAI,GAAG,IAAI;AAInC,MAAM,QAAQ,CAAC,IAAQ,IAAY,SAAkB,UAAmB,YAA8B;AACpG,MAAI;AACJ,MAAI;AACJ,QAAM,OAAO,MAAM;AACjB,YAAQ;AACR,QAAI,YAAY,KAAM,IAAG,GAAG,IAAI;AAChC,WAAO;AAAA,EACT;AACA,QAAM,UAAmB,IAAI,SAAS;AACpC,QAAI,OAAO;AACT,aAAO;AACP,UAAI,SAAS;AACX,qBAAa,KAAK;AAClB,gBAAQ,WAAW,MAAM,EAAE;AAAA,MAC7B;AACA;AAAA,IACF;AACA,QAAI,QAAS,IAAG,GAAG,IAAI;AAAA,QAClB,QAAO;AACZ,YAAQ,WAAW,MAAM,EAAE;AAAA,EAC7B;AACA,UAAQ,SAAS,MAAM;AACrB,iBAAa,KAAK;AAClB,YAAQ,OAAO;AAAA,EACjB;AACA,SAAO;AACT;AAGO,MAAM,WAAW,CAAC,IAAQ,IAAY,UAAU,OAAO,WAAW,SACvE,MAAM,IAAI,IAAI,SAAS,UAAU,IAAI;AAGhC,MAAM,WAAW,CAAC,IAAQ,IAAY,UAAU,MAAM,WAAW,UACtE,MAAM,IAAI,IAAI,SAAS,UAAU,KAAK;AAGjC,MAAM,aAAa,CAAC,IAAQ,MAAY,YAA6C;AAC1F,QAAM,KAAK,KAAK,IAAI,UAAU;AAC9B,QAAM,KAAK,KAAK,IAAI,UAAU;AAC9B,MAAI,GAAI,MAAK,MAAM,IAAI,KAAK,IAAI,GAAG,GAAG,GAAG,SAAS,SAAS,GAAG,CAAC,GAAG,SAAS,YAAY,GAAG,IAAI;AAC9F,MAAI,GAAI,MAAK,MAAM,IAAI,KAAK,IAAI,GAAG,GAAG,CAAC,GAAG,SAAS,WAAW,GAAG,GAAG,SAAS,UAAU,GAAG,KAAK;AAC/F,MAAI,MAAM,GAAI,WAAW,GAAe,MAAM;AAC9C,SAAO;AACT;",
   "names": []
 }