humn 1.3.2 → 1.3.3

package/dist/humn.js

@@ -1,211 +1,219 @@
-let C = null, x = null;
-const S = () => C, g = (e) => {
-  C = e;
-}, E = () => x, k = (e) => {
-  x = e;
+let N = null, x = null;
+const M = () => N, b = (t) => {
+  N = t;
+}, S = () => x, w = (t) => {
+  x = t;
 };
-class w {
-  constructor({ memory: t, synapses: o }) {
-    const i = { ...t };
+class T {
+  constructor({ memory: e, synapses: n }) {
+    const o = { ...e };
     this._persistenceMap = /* @__PURE__ */ new Map();
-    for (const [s, r] of Object.entries(t)) if (r && r.__humn_persist) {
-      const c = r.config.key || s;
-      this._persistenceMap.set(s, c);
+    for (const [r, s] of Object.entries(e)) if (s && s.__humn_persist) {
+      const c = s.config.key || r;
+      this._persistenceMap.set(r, c);
       try {
-        const n = localStorage.getItem(c);
-        i[s] = n !== null ? JSON.parse(n) : r.initial;
+        const i = localStorage.getItem(c);
+        o[r] = i !== null ? JSON.parse(i) : s.initial;
       } catch {
-        i[s] = r.initial;
+        o[r] = s.initial;
       }
     }
-    this._memory = i, this._listeners = /* @__PURE__ */ new Map(), this.synapses = o((s) => {
-      let r, c = /* @__PURE__ */ new Set();
-      if (typeof s == "function") {
-        const n = structuredClone(this._memory), l = s(this._createChangeTrackingProxy(n, c));
-        l && typeof l == "object" ? (r = { ...this._memory, ...l }, Object.keys(l).forEach((a) => c.add(a))) : r = n;
-      } else r = { ...this._memory, ...s }, c = new Set(Object.keys(s));
-      this._memory = r, this._persistenceMap.size > 0 && this._persistenceMap.forEach((n, l) => {
+    this._memory = o, this._listeners = /* @__PURE__ */ new Map(), this.synapses = n((r) => {
+      let s, c = /* @__PURE__ */ new Set();
+      if (typeof r == "function") {
+        const i = structuredClone(this._memory), l = r(this._createChangeTrackingProxy(i, c));
+        l && typeof l == "object" ? (s = { ...this._memory, ...l }, Object.keys(l).forEach((a) => c.add(a))) : s = i;
+      } else s = { ...this._memory, ...r }, c = new Set(Object.keys(r));
+      this._memory = s, this._persistenceMap.size > 0 && this._persistenceMap.forEach((i, l) => {
         if (Array.from(c).some((a) => a === l || a.startsWith(l + "."))) try {
           const a = this._memory[l];
-          localStorage.setItem(n, JSON.stringify(a));
+          localStorage.setItem(i, JSON.stringify(a));
         } catch {
         }
       }), this._notifyRelevantListeners(c);
     }, () => this._memory);
   }
-  _createChangeTrackingProxy(t, o, i = "") {
-    return new Proxy(t, { get: (s, r) => {
-      if (typeof r == "symbol" || r === "__proto__") return s[r];
-      const c = s[r], n = i ? `${i}.${r}` : r;
-      return typeof c == "object" && c !== null ? this._createChangeTrackingProxy(c, o, n) : c;
-    }, set: (s, r, c) => {
-      if (typeof r == "symbol" || r === "__proto__") return s[r] = c, !0;
-      const n = i ? `${i}.${r}` : r;
-      return o.add(n), s[r] = c, !0;
+  _createChangeTrackingProxy(e, n, o = "") {
+    return new Proxy(e, { get: (r, s) => {
+      if (typeof s == "symbol" || s === "__proto__") return r[s];
+      const c = r[s], i = o ? `${o}.${s}` : s;
+      return typeof c == "object" && c !== null ? this._createChangeTrackingProxy(c, n, i) : c;
+    }, set: (r, s, c) => {
+      if (typeof s == "symbol" || s === "__proto__") return r[s] = c, !0;
+      const i = o ? `${o}.${s}` : s;
+      return n.add(i), r[s] = c, !0;
     } });
   }
-  _notifyRelevantListeners(t) {
-    this._listeners.forEach((o, i) => {
-      Array.from(o).some((s) => Array.from(t).some((r) => s === r || s.startsWith(r + ".") || r.startsWith(s + "."))) && i();
+  _notifyRelevantListeners(e) {
+    this._listeners.forEach((n, o) => {
+      Array.from(n).some((r) => Array.from(e).some((s) => r === s || r.startsWith(s + ".") || s.startsWith(r + "."))) && o();
     });
   }
-  _createAccessTrackingProxy(t, o, i = "") {
-    return typeof t != "object" || t === null ? t : new Proxy(t, { get: (s, r) => {
-      if (typeof r == "symbol" || r === "__proto__") return s[r];
-      const c = i ? `${i}.${r}` : r;
-      o.add(c);
-      const n = s[r];
-      return typeof n == "object" && n !== null ? this._createAccessTrackingProxy(n, o, c) : n;
+  _createAccessTrackingProxy(e, n, o = "") {
+    return typeof e != "object" || e === null ? e : new Proxy(e, { get: (r, s) => {
+      if (typeof s == "symbol" || s === "__proto__") return r[s];
+      const c = o ? `${o}.${s}` : s;
+      n.add(c);
+      const i = r[s];
+      return typeof i == "object" && i !== null ? this._createAccessTrackingProxy(i, n, c) : i;
     } });
   }
   get memory() {
-    const t = S();
-    if (!t) return this._memory;
-    this._listeners.has(t) || this._listeners.set(t, /* @__PURE__ */ new Set());
-    const o = this._listeners.get(t);
-    return o.clear(), this._createAccessTrackingProxy(this._memory, o);
+    const e = M();
+    if (!e) return this._memory;
+    this._listeners.has(e) || this._listeners.set(e, /* @__PURE__ */ new Set());
+    const n = this._listeners.get(e);
+    return n.clear(), this._createAccessTrackingProxy(this._memory, n);
   }
 }
 let p = null;
-const v = /* @__PURE__ */ new Set();
-function T(e, ...t) {
-  let o = "", i = !1;
-  Array.isArray(e) && e.raw ? o = e.reduce((n, l, a) => n + l + (t[a] || ""), "") : (o = e, i = t[0] === !0);
-  let s = (function(n) {
-    return n.replace(/\/\*[\s\S]*?\*\//g, "").replace(/\s+/g, " ").trim();
-  })(o);
-  if (!s) return "";
-  i && (s = s.replace(/(^|[{};,])(\s*)(?!from|to)((?:[.#]?[\w-]+|\[[^\]]+\]|:{1,2}[^:,{\s]+)+)(?=\s*\{)/gi, "$1$2$3&, $3"));
-  const r = (function(n) {
-    let l = 5381, a = n.length;
-    for (; a; ) l = 33 * l ^ n.charCodeAt(--a);
+const C = /* @__PURE__ */ new Set();
+function O(t, ...e) {
+  let n = "", o = !1;
+  Array.isArray(t) && t.raw ? n = t.reduce((i, l, a) => i + l + (e[a] || ""), "") : (n = t, o = e[0] === !0);
+  let r = (function(i) {
+    return i.replace(/\/\*[\s\S]*?\*\//g, "").replace(/\s+/g, " ").trim();
+  })(n);
+  if (!r) return "";
+  o && (r = r.replace(/(^|[{};,])(\s*)(?!from|to)((?:[.#]?[\w-]+|\[[^\]]+\]|:{1,2}[^:,{\s]+)+)(?=\s*\{)/gi, "$1$2$3&, $3"));
+  const s = (function(i) {
+    let l = 5381, a = i.length;
+    for (; a; ) l = 33 * l ^ i.charCodeAt(--a);
     return (l >>> 0).toString(36);
-  })(s), c = `humn-${r}`;
-  return v.has(r) || (p || (p = document.createElement("style"), p.id = "humn-styles", document.head.appendChild(p)), p.textContent += `.${c} { 
-    ${s} 
+  })(r), c = `humn-${s}`;
+  return C.has(s) || (p || (p = document.createElement("style"), p.id = "humn-styles", document.head.appendChild(p)), p.textContent += `.${c} { 
+    ${r} 
   }
-`, v.add(r)), c;
+`, C.add(s)), c;
 }
-const j = (e, t = {}, o = []) => ({ tag: e, props: t, children: (Array.isArray(o) ? o : [o]).flat().filter((i) => i != null && i !== !1 && i !== "") });
-function M(e) {
-  const t = E();
-  t && t.mounts.push(e);
+const P = (t, e = {}, n = []) => ({ tag: t, props: e, children: (Array.isArray(n) ? n : [n]).flat().filter((o) => o != null && o !== !1 && o !== "") });
+function L(t) {
+  const e = S();
+  e && e.mounts.push(t);
 }
-function P(e) {
-  const t = E();
-  t && t.cleanups.push(e);
+function I(t) {
+  const e = S();
+  e && e.cleanups.push(t);
 }
-function b(e) {
-  return e && e.some((t) => t && t.props && t.props.key != null);
+function y(t) {
+  return t.namespaceURI === g && t.tagName !== "foreignObject" ? g : t.namespaceURI === _ ? _ : null;
 }
-function f(e) {
-  if (typeof e == "string" || typeof e == "number") return document.createTextNode(String(e));
-  if (typeof e.tag == "function") {
-    const o = A(e);
-    e.child = o;
-    const i = f(o);
-    return e.el = i, e.hooks && e.hooks.mounts.length > 0 && setTimeout(() => e.hooks.mounts.forEach((s) => s()), 0), i;
+function E(t) {
+  return t && t.some((e) => e && e.props && e.props.key != null);
+}
+const g = "http://www.w3.org/2000/svg", _ = "http://www.w3.org/1998/Math/MathML";
+function f(t, e) {
+  if (typeof t == "string" || typeof t == "number") return document.createTextNode(String(t));
+  if (typeof t.tag == "function") {
+    const s = $(t);
+    t.child = s;
+    const c = f(s, e);
+    return t.el = c, t.hooks?.mounts.length > 0 && setTimeout(() => t.hooks.mounts.forEach((i) => i()), 0), c;
   }
-  const t = document.createElement(e.tag);
-  return e.el = t, N(t, e.props), e.children.forEach((o) => {
-    t.appendChild(f(o));
-  }), t;
+  const n = t.tag;
+  n === "svg" ? e = g : n === "math" && (e = _);
+  const o = e ? document.createElementNS(e, n) : document.createElement(n);
+  t.el = o, A(o, t.props);
+  const r = n === "foreignObject" ? null : e;
+  return t.children.forEach((s) => {
+    o.appendChild(f(s, r));
+  }), o;
 }
-function N(e, t = {}, o = {}) {
-  if (!e) return;
-  const i = { ...o, ...t };
-  for (const s in i) {
-    const r = o[s], c = t[s];
-    if (c != null) if (s !== "value" && s !== "checked") {
-      if (r !== c) {
-        if (s.startsWith("on")) {
-          const n = s.slice(2).toLowerCase();
-          r && e.removeEventListener(n, r), e.addEventListener(n, c);
+function A(t, e = {}, n = {}) {
+  if (!t) return;
+  const o = { ...n, ...e };
+  for (const r in o) {
+    const s = n[r], c = e[r];
+    if (c != null) if (r !== "value" && r !== "checked") {
+      if (s !== c) {
+        if (r.startsWith("on")) {
+          const i = r.slice(2).toLowerCase();
+          s && t.removeEventListener(i, s), t.addEventListener(i, c);
         }
-        s === "disabled" ? e.disabled = c === !0 || c === "true" : e.setAttribute(s, c);
+        r === "disabled" ? t.disabled = c === !0 || c === "true" : t.setAttribute(r, c);
       }
-    } else e[s] !== c && (e[s] = c);
-    else e.removeAttribute(s);
+    } else t[r] !== c && (t[r] = c);
+    else t.removeAttribute(r);
   }
 }
-function $(e, t, o) {
-  if (!(b(t) || b(o))) {
-    const i = Math.max(t.length, o.length);
-    for (let s = 0; s < i; s++) m(e, t[s], o[s], s);
+function j(t, e, n) {
+  if (!(E(e) || E(n))) {
+    const o = Math.max(e.length, n.length);
+    for (let r = 0; r < o; r++) m(t, e[r], n[r], r);
     return;
   }
-  (function(i, s, r) {
+  (function(o, r, s) {
     const c = {};
-    r.forEach((n, l) => {
-      const a = (n.props && n.props.key) != null ? n.props.key : l;
-      c[a] = { vNode: n, index: l };
-    }), s.forEach((n, l) => {
-      const a = (n.props && n.props.key) != null ? n.props.key : l, y = c[a];
-      if (y) {
-        const u = y.vNode;
-        m(i, n, u, l);
-        const h = n.el || u.el, _ = i.childNodes[l];
-        h && _ !== h && i.insertBefore(h, _), delete c[a];
+    s.forEach((i, l) => {
+      const a = (i.props && i.props.key) != null ? i.props.key : l;
+      c[a] = { vNode: i, index: l };
+    }), r.forEach((i, l) => {
+      const a = (i.props && i.props.key) != null ? i.props.key : l, k = c[a];
+      if (k) {
+        const h = k.vNode;
+        m(o, i, h, l);
+        const u = i.el || h.el, v = o.childNodes[l];
+        u && v !== u && o.insertBefore(u, v), delete c[a];
       } else {
-        const u = f(n), h = i.childNodes[l];
-        h ? i.insertBefore(u, h) : i.appendChild(u);
+        const h = f(i, y(o)), u = o.childNodes[l];
+        u ? o.insertBefore(h, u) : o.appendChild(h);
       }
-    }), Object.values(c).forEach(({ vNode: n }) => {
-      n.el && n.el.parentNode === i && (d(n), i.removeChild(n.el));
+    }), Object.values(c).forEach(({ vNode: i }) => {
+      i.el && i.el.parentNode === o && (d(i), o.removeChild(i.el));
     });
-  })(e, t, o);
+  })(t, e, n);
 }
-function A(e) {
-  const t = { mounts: [], cleanups: [] };
-  k(t);
-  const o = e.tag(e.props);
-  return k(null), e.hooks = t, o;
+function $(t) {
+  const e = { mounts: [], cleanups: [] };
+  w(e);
+  const n = t.tag(t.props);
+  return w(null), t.hooks = e, n;
 }
-function d(e) {
-  e && (e.hooks && e.hooks.cleanups && e.hooks.cleanups.forEach((t) => t()), e.child && d(e.child), e.children && e.children.forEach(d));
+function d(t) {
+  t && (t.hooks && t.hooks.cleanups && t.hooks.cleanups.forEach((e) => e()), t.child && d(t.child), t.children && t.children.forEach(d));
 }
-function m(e, t, o, i = 0) {
-  if (t == null) {
-    const r = o.el || e.childNodes[i];
-    return d(o), void (r && e.removeChild(r));
+function m(t, e, n, o = 0) {
+  if (e == null) {
+    const s = n.el || t.childNodes[o];
+    return d(n), void (s && t.removeChild(s));
   }
-  if (typeof t.tag == "function") {
-    const r = !o, c = A(t);
-    return t.child = c, m(e, c, o ? o.child : void 0, i), t.el = c.el, void (r && t.hooks && t.hooks.mounts.length > 0 && setTimeout(() => {
-      t.hooks.mounts.forEach((n) => n());
+  if (typeof e.tag == "function") {
+    const s = !n, c = $(e);
+    return e.child = c, m(t, c, n ? n.child : void 0, o), e.el = c.el, void (s && e.hooks && e.hooks.mounts.length > 0 && setTimeout(() => {
+      e.hooks.mounts.forEach((i) => i());
     }, 0));
   }
-  if (o == null) return void e.appendChild(f(t));
-  if (typeof t != typeof o || typeof t != "string" && t.tag !== o.tag) {
-    const r = o.el || e.childNodes[i];
-    return void (r && e.replaceChild(f(t), r));
+  if (n == null) return void t.appendChild(f(e, y(t)));
+  if (typeof e != typeof n || typeof e != "string" && e.tag !== n.tag) {
+    const s = n.el || t.childNodes[o];
+    return void (s && t.replaceChild(f(e, y(t)), s));
   }
-  if (typeof t == "string" || typeof t == "number") {
-    if (t !== o) {
-      const r = e.childNodes[i];
-      r ? r.nodeValue = String(t) : e.appendChild(document.createTextNode(String(t)));
+  if (typeof e == "string" || typeof e == "number") {
+    if (e !== n) {
+      const s = t.childNodes[o];
+      s ? s.nodeValue = String(e) : t.appendChild(document.createTextNode(String(e)));
     }
     return;
   }
-  const s = o.el || e.childNodes[i];
-  s && (t.el = s, N(s, t.props, o.props), $(s, t.children, o.children));
+  const r = n.el || t.childNodes[o];
+  r && (e.el = r, A(r, e.props, n.props), j(r, e.children, n.children));
 }
-const O = (e, t) => {
-  let o = null;
-  const i = () => {
-    g(i);
-    const s = { tag: t, props: {}, children: [] };
-    m(e, s, o), g(null), o = s;
+const R = (t, e) => {
+  let n = null;
+  const o = () => {
+    b(o);
+    const r = { tag: e, props: {}, children: [] };
+    m(t, r, n), b(null), n = r;
   };
-  i();
-}, L = (e, t = {}) => ({ __humn_persist: !0, initial: e, config: t });
+  o();
+}, W = (t, e = {}) => ({ __humn_persist: !0, initial: t, config: e });
 export {
-  w as Cortex,
-  T as css,
-  j as h,
-  O as mount,
-  P as onCleanup,
-  M as onMount,
-  L as persist
+  T as Cortex,
+  O as css,
+  P as h,
+  R as mount,
+  I as onCleanup,
+  L as onMount,
+  W as persist
 };
 //# sourceMappingURL=humn.js.map

package/dist/humn.js.map

@@ -1 +1 @@
-{"version":3,"file":"humn.js","sources":["../src/observer.js","../src/cortex.js","../src/css.js","../src/h.js","../src/lifecycle.js","../src/patch.js","../src/mount.js","../src/persist.js"],"sourcesContent":["/**\n * @file Observer module for tracking global state during rendering.\n * @module observer\n */\n\nlet currentObserver = null // For Cortex/State dependency\nlet currentInstance = null // For Lifecycle Hooks\n\n/**\n * Gets the current observer (render function).\n * @returns {function|null}\n */\nexport const getObserver = () => currentObserver\n\n/**\n * Sets the current observer.\n * @param {function|null} obs\n */\nexport const setObserver = (obs) => {\n  currentObserver = obs\n}\n\n/**\n * Gets the current component instance (hook container).\n * @returns {object|null}\n */\nexport const getInstance = () => currentInstance\n\n/**\n * Sets the current component instance.\n * @param {object|null} inst\n */\nexport const setInstance = (inst) => {\n  currentInstance = inst\n}\n","import { getObserver } from './observer.js'\nimport { isDev } from './metrics.js'\n\n/**\n * @typedef {object} Synapses\n * @property {function} set - Function to update the memory\n * @property {function} get - Function to get the memory\n */\n\n/**\n * @typedef {object} CortexParams\n * @property {object} memory - The initial state\n * @property {function(function, function): object} synapses - The synapses function\n */\n\n/**\n * The Cortex class manages the state of the application.\n * This uses a Proxy for fine-grained reactivity, ensuring only those components\n * which use the updated value get re-rendered.\n *\n * WHY: We use Proxies instead of simple getters/setters because it allows us to\n * detect access to nested properties dynamically without needing to declare\n * dependencies upfront. This \"magic\" auto-subscription is what makes Humn's\n * DX so clean.\n */\nexport class Cortex {\n  /**\n   * Creates an instance of Cortex.\n   * @param {CortexParams} CortexParams - The parameters for the Cortex.\n   */\n  constructor({ memory, synapses }) {\n    const liveMemory = { ...memory }\n    this._persistenceMap = new Map()\n\n    // Load in any existing values from local-storage\n    for (const [key, value] of Object.entries(memory)) {\n      if (value && value.__humn_persist) {\n        const storageKey = value.config.key || key\n        this._persistenceMap.set(key, storageKey)\n\n        try {\n          const stored = localStorage.getItem(storageKey)\n          if (stored !== null) {\n            liveMemory[key] = JSON.parse(stored)\n          } else {\n            liveMemory[key] = value.initial\n          }\n        } catch (err) {\n          if (isDev)\n            console.warn(`Humn: Failed to load '${key}' from storage.`, err)\n          liveMemory[key] = value.initial\n        }\n      }\n    }\n\n    this._memory = liveMemory\n    this._listeners = new Map()\n\n    const get = () => this._memory\n\n    const set = (updater) => {\n      let nextState\n      let changedPaths = new Set()\n\n      if (typeof updater === 'function') {\n        const clone = structuredClone(this._memory)\n        const proxy = this._createChangeTrackingProxy(clone, changedPaths)\n        const result = updater(proxy)\n\n        if (result && typeof result === 'object') {\n          nextState = { ...this._memory, ...result }\n          Object.keys(result).forEach((key) => changedPaths.add(key))\n        } else {\n          nextState = clone\n        }\n      } else {\n        nextState = { ...this._memory, ...updater }\n        changedPaths = new Set(Object.keys(updater))\n      }\n\n      this._memory = nextState\n\n      // If we need to persist any of the values\n      // we save them to localStorage here\n      if (this._persistenceMap.size > 0) {\n        this._persistenceMap.forEach((storageKey, stateKey) => {\n          const isDirty = Array.from(changedPaths).some(\n            (path) => path === stateKey || path.startsWith(stateKey + '.'),\n          )\n\n          if (isDirty) {\n            try {\n              const value = this._memory[stateKey]\n              localStorage.setItem(storageKey, JSON.stringify(value))\n            } catch (err) {\n              if (isDev)\n                console.error(`Humn: Failed to save '${stateKey}'.`, err)\n            }\n          }\n        })\n      }\n\n      this._notifyRelevantListeners(changedPaths)\n    }\n\n    this.synapses = synapses(set, get)\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are being mutated.\n   * Includes a GET trap to recursively proxy nested objects for deep mutation tracking.\n   *\n   * WHY: We need to know exactly which paths were changed so we can notify ONLY\n   * the components that care about those specific paths. If we just knew \"something changed\",\n   * we'd have to re-render the whole app (like Redux) or rely on manual optimization.\n   */\n  _createChangeTrackingProxy(obj, changedPaths, path = '') {\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const value = target[prop]\n        const fullPath = path ? `${path}.${prop}` : prop\n\n        // Recursively proxy nested objects so we can trap their sets too\n        if (typeof value === 'object' && value !== null) {\n          return this._createChangeTrackingProxy(value, changedPaths, fullPath)\n        }\n        return value\n      },\n      set: (target, prop, value) => {\n        if (typeof prop === 'symbol' || prop === '__proto__') {\n          target[prop] = value\n          return true\n        }\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        changedPaths.add(fullPath)\n\n        target[prop] = value\n        return true\n      },\n    })\n  }\n\n  /**\n   * Only notify listeners that read properties which changed\n   */\n  _notifyRelevantListeners(changedPaths) {\n    this._listeners.forEach((accessedPaths, renderFn) => {\n      const shouldNotify = Array.from(accessedPaths).some((accessedPath) => {\n        return Array.from(changedPaths).some((changedPath) => {\n          // Check for exact match or parent/child relationship\n          return (\n            accessedPath === changedPath ||\n            accessedPath.startsWith(changedPath + '.') ||\n            changedPath.startsWith(accessedPath + '.')\n          )\n        })\n      })\n\n      if (shouldNotify) renderFn()\n    })\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are accessed during render\n   *\n   * WHY: This is the other half of the magic. By tracking what a component READS\n   * during its render, we build a precise dependency graph. If a component reads\n   * `state.user.name`, it will only re-render when `state.user.name` changes,\n   * not when `state.count` changes.\n   */\n  _createAccessTrackingProxy(obj, accessedPaths, path = '') {\n    if (typeof obj !== 'object' || obj === null) return obj\n\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        // We don't care about prototype and symbol properties\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        accessedPaths.add(fullPath)\n\n        const value = target[prop]\n\n        // Recursively wrap nested objects\n        if (typeof value === 'object' && value !== null)\n          return this._createAccessTrackingProxy(value, accessedPaths, fullPath)\n\n        return value\n      },\n    })\n  }\n\n  /**\n   * Returns memory wrapped in a tracking Proxy\n   */\n  get memory() {\n    const currentObserver = getObserver()\n\n    if (!currentObserver) return this._memory\n\n    if (!this._listeners.has(currentObserver))\n      this._listeners.set(currentObserver, new Set())\n\n    const accessedPaths = this._listeners.get(currentObserver)\n\n    // This gives us fresh tracking each render\n    accessedPaths.clear()\n\n    return this._createAccessTrackingProxy(this._memory, accessedPaths)\n  }\n}\n","/**\n * @file Runtime Scoped CSS implementation using Native CSS Nesting.\n * @module css\n */\n\nlet styleSheet = null\nconst cache = new Set()\n\n/**\n * Simple DJB2 hashing function.\n */\nfunction hashString(str) {\n  let hash = 5381\n  let i = str.length\n  while (i) {\n    hash = (hash * 33) ^ str.charCodeAt(--i)\n  }\n  return (hash >>> 0).toString(36)\n}\n\n/**\n * Lightweight Runtime Minifier.\n * Removes comments and collapses whitespace.\n * We do not strip spaces around colons/brackets to ensure safety for calc().\n */\nfunction minify(css) {\n  return css\n    .replace(/\\/\\*[\\s\\S]*?\\*\\//g, '') // Remove comments\n    .replace(/\\s+/g, ' ') // Collapse newlines/tabs to single space\n    .trim() // Remove leading/trailing\n}\n\n/**\n * Scoped CSS Tag.\n * Wraps content in a unique class using Native CSS Nesting.\n * Supports two signatures:\n * 1. Tagged Template: css`...`\n * 2. Function: css(string, isSingleRoot)\n */\nexport function css(stringsOrStr, ...args) {\n  let raw = ''\n  let isSingleRoot = false\n\n  // Detect usage of Tagged Template vs Function Call\n  if (Array.isArray(stringsOrStr) && stringsOrStr.raw) {\n    raw = stringsOrStr.reduce((acc, str, i) => {\n      return acc + str + (args[i] || '')\n    }, '')\n  } else {\n    raw = stringsOrStr\n    // If called as function, the first arg is our boolean flag\n    isSingleRoot = args[0] === true\n  }\n  let content = minify(raw)\n\n  if (!content) return ''\n\n  if (isSingleRoot) {\n    // Transforms selectors to apply to BOTH the root (using &) AND descendants.\n    // e.g. \"div\" -> \"div&, div\"\n\n    // Regex Breakdown:\n    // 1. (^|[{};,])      -> Hard Start (Line start, brace, semi, comma)\n    // 2. (\\s*)           -> Whitespace\n    // 3. (?!from|to)     -> Negative Lookahead: Ignore 'from'/'to' (keyframes)\n    // 4. ( ... )+        -> Compound Selector:\n    //    (?:[.#]?[\\w-]+ ... ) -> Matches tags (div), classes (.class), ids (#id)\n    // 5. (?=\\s*\\{)       -> Lookahead: Must be followed by {\n\n    content = content.replace(\n      /(^|[{};,])(\\s*)(?!from|to)((?:[.#]?[\\w-]+|\\[[^\\]]+\\]|:{1,2}[^:,{\\s]+)+)(?=\\s*\\{)/gi,\n      '$1$2$3&, $3',\n    )\n  }\n\n  const hash = hashString(content)\n  const hashedClassName = `humn-${hash}`\n\n  if (cache.has(hash)) {\n    return hashedClassName\n  }\n\n  if (!styleSheet) {\n    styleSheet = document.createElement('style')\n    styleSheet.id = 'humn-styles'\n    document.head.appendChild(styleSheet)\n  }\n\n  styleSheet.textContent += `.${hashedClassName} { \n    ${content} \n  }\\n`\n  cache.add(hash)\n\n  return hashedClassName\n}\n","/**\n * @typedef {object} VNode\n * @property {string} tag\n * @property {object} props\n * @property {VNode[]} children\n */\n\n/**\n * Creates a virtual DOM node.\n * This is a hyperscript-like function.\n *\n * @param {string} tag - The tag name of the element.\n * @param {object} props - The properties of the element.\n * @param {VNode[]|VNode} children - The children of the element.\n * @returns {VNode} The virtual DOM node.\n */\nexport const h = (tag, props = {}, children = []) => {\n  const childArray = Array.isArray(children) ? children : [children]\n\n  // Filter out null/false so we don't have \"ghost\" nodes\n  const cleanChildren = childArray\n    .flat()\n    .filter((c) => c !== null && c !== undefined && c !== false && c !== '')\n\n  return {\n    tag,\n    props,\n    children: cleanChildren,\n  }\n}\n","/**\n * @file Lifecycle hooks for components.\n * @module lifecycle\n */\nimport { getInstance } from './observer.js'\n\n/**\n * Registers a callback to run after the component mounts.\n * @param {function} fn - The callback function.\n */\nexport function onMount(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.mounts.push(fn)\n  }\n}\n\n/**\n * Registers a callback to run when the component unmounts.\n * @param {function} fn - The callback function.\n */\nexport function onCleanup(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.cleanups.push(fn)\n  }\n}\n","/**\n * @file This file contains the diffing and patching algorithm for the virtual DOM,\n * including support for Keyed Diffing.\n * @module patch\n */\nimport { track } from './metrics.js'\nimport { setInstance } from './observer.js'\n\n/**\n * Checks if a list of children contains keys.\n * @param {Array<import(\"./h.js\").VNode>} children - The list of VNodes.\n * @returns {boolean} True if keys are present.\n */\nexport function hasKeys(children) {\n  return children && children.some((c) => c && c.props && c.props.key != null)\n}\n\n/**\n * Creates a real DOM element from a virtual node.\n * @param {import(\"./h.js\").VNode | string | number} vNode - The virtual node.\n * @returns {Text | HTMLElement} The created DOM element.\n */\nfunction createElement(vNode) {\n  if (typeof vNode === 'string' || typeof vNode === 'number') {\n    return document.createTextNode(String(vNode))\n  }\n\n  if (typeof vNode.tag === 'function') {\n    const childVNode = renderComponent(vNode)\n    vNode.child = childVNode\n\n    // Recursively create the DOM for the child\n    const el = createElement(childVNode)\n    vNode.el = el\n\n    // Queue Mount Hooks\n    if (vNode.hooks && vNode.hooks.mounts.length > 0) {\n      setTimeout(() => vNode.hooks.mounts.forEach((fn) => fn()), 0)\n    }\n    return el\n  }\n\n  track('elementsCreated')\n\n  const el = document.createElement(vNode.tag)\n  vNode.el = el\n  patchProps(el, vNode.props)\n\n  vNode.children.forEach((child) => {\n    el.appendChild(createElement(child))\n  })\n\n  return el\n}\n\n/**\n * Updates the properties (attributes/events) of a DOM element.\n * @param {HTMLElement} el - The DOM element to update.\n * @param {object} [newProps={}] - The new properties.\n * @param {object} [oldProps={}] - The old properties.\n *\n * WHY: We check against the LIVE DOM value for inputs (value/checked) to prevent\n * the \"cursor jumping\" bug. If we just blindly set the attribute, the browser\n * might reset the cursor position to the end of the input.\n */\nfunction patchProps(el, newProps = {}, oldProps = {}) {\n  if (!el) return\n\n  const allProps = { ...oldProps, ...newProps }\n\n  for (const key in allProps) {\n    const oldValue = oldProps[key]\n    const newValue = newProps[key]\n\n    // Handle removed props\n    if (newValue === undefined || newValue === null) {\n      el.removeAttribute(key)\n      track('patches')\n      continue\n    }\n\n    // We check against the LIVE DOM value to prevent cursor jumping\n    if (key === 'value' || key === 'checked') {\n      if (el[key] !== newValue) {\n        el[key] = newValue\n        track('patches')\n      }\n      continue\n    }\n\n    // If prop hasn't changed, skip\n    if (oldValue === newValue) continue\n\n    track('patches')\n\n    // Handle Events\n    if (key.startsWith('on')) {\n      const eventName = key.slice(2).toLowerCase()\n      if (oldValue) el.removeEventListener(eventName, oldValue)\n      el.addEventListener(eventName, newValue)\n    }\n    // Handle the disabled attribute\n    if (key === 'disabled') {\n      el.disabled = newValue === true || newValue === 'true'\n    }\n    // Handle standard attributes\n    else {\n      el.setAttribute(key, newValue)\n    }\n  }\n}\n\n/**\n * Reconciles the children of a node, handling both simple lists and keyed reordering.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {Array<import(\"./h.js\").VNode>} newChildren - The new list of children.\n * @param {Array<import(\"./h.js\").VNode>} oldChildren - The old list of children.\n *\n * WHY: This is the most complex part of the VDOM. We need to efficiently update\n * a list of items. Without keys, we just update index-by-index, which is fast\n * but causes issues if items are reordered (state gets mixed up).\n * With keys, we can track items as they move around, preserving their state\n * and minimizing DOM operations.\n */\nfunction reconcileChildren(parent, newChildren, oldChildren) {\n  const isKeyed = hasKeys(newChildren) || hasKeys(oldChildren)\n\n  // If no keys are used, use the fast index-based simple loop.\n  // This is faster for static lists or simple text replacements.\n  if (!isKeyed) {\n    const maxLen = Math.max(newChildren.length, oldChildren.length)\n    for (let i = 0; i < maxLen; i++) {\n      patch(parent, newChildren[i], oldChildren[i], i)\n    }\n    return\n  }\n\n  reconcileKeyedChildren(parent, newChildren, oldChildren)\n}\n\n/**\n * Handles the complex logic of reconciling keyed children.\n *\n * WHY: When keys are present, we can't just iterate by index. We need to map\n * existing children by their key so we can find them even if they've moved.\n * This allows us to re-use DOM nodes (preserving focus/state) instead of\n * destroying and re-creating them.\n */\nfunction reconcileKeyedChildren(parent, newChildren, oldChildren) {\n  // Map existing children by Key for O(1) lookup\n  const keyed = {}\n  oldChildren.forEach((child, i) => {\n    const key = (child.props && child.props.key) != null ? child.props.key : i\n    keyed[key] = { vNode: child, index: i }\n  })\n\n  newChildren.forEach((newChild, i) => {\n    const key =\n      (newChild.props && newChild.props.key) != null ? newChild.props.key : i\n    const existingChildMatch = keyed[key]\n\n    if (existingChildMatch) {\n      // A. MATCH FOUND - The item existed before\n      const oldVNode = existingChildMatch.vNode\n\n      // Update the node's content recursively\n      patch(parent, newChild, oldVNode, i)\n\n      // If the DOM node isn't in the right spot, move it.\n      // We use oldVNode.el because patch transfers the ref, but just to be safe:\n      const el = newChild.el || oldVNode.el\n\n      // Get the node currently at this index in the real DOM\n      const domChildAtIndex = parent.childNodes[i]\n\n      // If the element exists but is in the wrong place, move it\n      if (el && domChildAtIndex !== el) {\n        parent.insertBefore(el, domChildAtIndex)\n        track('patches')\n      }\n\n      // Remove from map so we know it was re-used\n      delete keyed[key]\n    } else {\n      // B. NO MATCH - This is a new item\n      const newEl = createElement(newChild)\n      const domChildAtIndex = parent.childNodes[i]\n\n      if (domChildAtIndex) {\n        parent.insertBefore(newEl, domChildAtIndex)\n      } else {\n        parent.appendChild(newEl)\n      }\n    }\n  })\n\n  // Remove any old keys that weren't used in the new list\n  Object.values(keyed).forEach(({ vNode }) => {\n    if (vNode.el && vNode.el.parentNode === parent) {\n      runUnmount(vNode) // Clean up hooks\n      parent.removeChild(vNode.el)\n      track('elementsRemoved')\n    }\n  })\n}\n\n/**\n * Executes a Functional Component, tracks hooks, and returns the VNode.\n * @param {import(\"./h.js\").VNode} vNode - The component vNode.\n * @returns {import(\"./h.js\").VNode} The rendered child vNode.\n */\nfunction renderComponent(vNode) {\n  track('componentsRendered')\n\n  // 1. Prepare Hook Container\n  const hooks = {\n    mounts: [],\n    cleanups: [],\n  }\n\n  // 2. Set Global Scope\n  setInstance(hooks)\n\n  // 3. Run the User's Component Function\n  // We pass props as the first argument\n  const renderedVNode = vNode.tag(vNode.props)\n\n  // 4. Clear Global Scope\n  setInstance(null)\n\n  // 5. Attach hooks to the VNode so we can run them later\n  vNode.hooks = hooks\n\n  return renderedVNode\n}\n\n/**\n * Helper to recursively run cleanup hooks when a tree is removed.\n * @param {import(\"./h.js\").VNode} vNode - The vNode to unmount.\n */\nfunction runUnmount(vNode) {\n  if (!vNode) return\n\n  // 1. Run hooks for this node\n  if (vNode.hooks && vNode.hooks.cleanups) {\n    vNode.hooks.cleanups.forEach((fn) => fn())\n  }\n\n  // 2. Recurse into child (if component)\n  if (vNode.child) {\n    runUnmount(vNode.child)\n  }\n\n  // 3. Recurse into children (if element)\n  if (vNode.children) {\n    vNode.children.forEach(runUnmount)\n  }\n}\n\n/**\n * The main diffing function. Compares V-DOM trees and updates the real DOM.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {import(\"./h.js\").VNode | string | number} newVNode - The new virtual node.\n * @param {import(\"./h.js\").VNode | string | number} oldVNode - The old virtual node.\n * @param {number} [index=0] - The index of the child node (used for simple diffing).\n */\nexport function patch(parent, newVNode, oldVNode, index = 0) {\n  track('diffs')\n\n  // Case 1: Removal - The new node is null/undefined, so we remove the old one.\n  if (newVNode === undefined || newVNode === null) {\n    const el = oldVNode.el || parent.childNodes[index]\n\n    // Recursive Cleanup\n    runUnmount(oldVNode)\n\n    if (el) {\n      parent.removeChild(el)\n      track('elementsRemoved')\n    }\n    return\n  }\n\n  // Case 2: Component - If it's a function, we delegate to the component logic.\n  if (typeof newVNode.tag === 'function') {\n    const isNew = !oldVNode\n\n    const childVNode = renderComponent(newVNode)\n    newVNode.child = childVNode\n\n    const oldChild = oldVNode ? oldVNode.child : undefined\n    patch(parent, childVNode, oldChild, index)\n\n    newVNode.el = childVNode.el\n\n    // Run mount hooks on the next tick\n    if (isNew && newVNode.hooks && newVNode.hooks.mounts.length > 0) {\n      setTimeout(() => {\n        newVNode.hooks.mounts.forEach((fn) => fn())\n      }, 0)\n    }\n    // TODO: Handle updates (running old cleanups if necessary) for Phase 2\n    return\n  }\n\n  // Case 3: Creation - No old node exists, so we create a new one.\n  if (oldVNode === undefined || oldVNode === null) {\n    parent.appendChild(createElement(newVNode))\n    return\n  }\n\n  // Case 4: Replacement - The node type changed (e.g. div -> span), so we replace it entirely.\n  if (\n    typeof newVNode !== typeof oldVNode ||\n    (typeof newVNode !== 'string' && newVNode.tag !== oldVNode.tag)\n  ) {\n    const el = oldVNode.el || parent.childNodes[index]\n    if (el) {\n      parent.replaceChild(createElement(newVNode), el)\n      track('patches')\n    }\n    return\n  }\n\n  // Case 5: Text Update - It's a text node, so we just update the text content.\n  if (typeof newVNode === 'string' || typeof newVNode === 'number') {\n    if (newVNode !== oldVNode) {\n      const el = parent.childNodes[index]\n      if (el) {\n        el.nodeValue = String(newVNode)\n        track('patches')\n      } else {\n        // Self healing: if text node missing, append it\n        parent.appendChild(document.createTextNode(String(newVNode)))\n      }\n    }\n    return\n  }\n\n  // Case 6: Update - Same tag, so we update props and recurse into children.\n  const el = oldVNode.el || parent.childNodes[index]\n\n  if (!el) return\n\n  // Transfer DOM reference to the new VNode\n  newVNode.el = el\n\n  patchProps(el, newVNode.props, oldVNode.props)\n\n  reconcileChildren(el, newVNode.children, oldVNode.children)\n}\n","/**\n * @file Mounts the application to the DOM.\n * @module mount\n */\nimport { setObserver } from './observer.js'\nimport { patch } from './patch.js'\n\n/**\n * Mounts a component to a target DOM element.\n * @param {HTMLElement} target - The DOM element to mount to.\n * @param {function} Component - The root component function.\n */\nexport const mount = (target, Component) => {\n  let prevVNode = null\n\n  const lifecycle = () => {\n    setObserver(lifecycle)\n\n    const nextVNode = {\n      tag: Component,\n      props: {},\n      children: [],\n    }\n\n    patch(target, nextVNode, prevVNode)\n    setObserver(null)\n    prevVNode = nextVNode\n  }\n\n  lifecycle()\n}\n","/**\n * @typedef {object} HumnPersist\n * @property {boolean} __humn_persist\n * @property {any} initial\n * @property {PersistConfig} config\n */\n\n/**\n * @typedef {object} PersistConfig\n * @property {string} key\n */\n\n/**\n * Marks a section of the state for persistence in localStorage.\n *\n * @param {any} initial - The initial value of the state.\n * @param {PersistConfig} config - The configuration for persistence.\n * @returns {HumnPersist}\n */\nexport const persist = (initial, config = {}) => ({\n  __humn_persist: true,\n  initial,\n  config,\n})\n"],"names":["currentObserver","currentInstance","getObserver","setObserver","obs","getInstance","setInstance","inst","Cortex","memory","synapses","liveMemory","this","_persistenceMap","Map","key","value","Object","entries","__humn_persist","storageKey","config","set","stored","localStorage","getItem","JSON","parse","initial","err","_memory","_listeners","updater","nextState","changedPaths","Set","clone","structuredClone","result","_createChangeTrackingProxy","keys","forEach","add","size","stateKey","Array","from","some","path","startsWith","setItem","stringify","_notifyRelevantListeners","obj","Proxy","get","target","prop","fullPath","accessedPaths","renderFn","accessedPath","changedPath","_createAccessTrackingProxy","has","clear","styleSheet","cache","css","stringsOrStr","args","raw","isSingleRoot","isArray","reduce","acc","str","i","content","replace","trim","hash","length","charCodeAt","toString","hashedClassName","document","createElement","id","head","appendChild","textContent","h","tag","props","children","flat","filter","c","onMount","fn","instance","mounts","push","onCleanup","cleanups","hasKeys","vNode","createTextNode","String","childVNode","renderComponent","child","el","hooks","setTimeout","patchProps","newProps","oldProps","allProps","oldValue","newValue","eventName","slice","toLowerCase","removeEventListener","addEventListener","disabled","setAttribute","removeAttribute","reconcileChildren","parent","newChildren","oldChildren","maxLen","Math","max","patch","keyed","index","newChild","existingChildMatch","oldVNode","domChildAtIndex","childNodes","insertBefore","newEl","values","parentNode","runUnmount","removeChild","renderedVNode","newVNode","isNew","replaceChild","nodeValue","mount","Component","prevVNode","lifecycle","nextVNode","persist"],"mappings":"AAKA,IAAIA,IAAkB,MAClBC,IAAkB;AAMf,MAAMC,IAAc,MAAMF,GAMpBG,IAAeC,CAAAA,MAAAA;AAC1BJ,EAAAA,IAAkBI;AAAAA,GAOPC,IAAc,MAAMJ,GAMpBK,IAAeC,OAAAA;AAC1BN,EAAAA,IAAkBM;AAAAA;ACRb,MAAMC,EAAAA;AAAAA,EAKX,cAAYC,QAAEA,GAAMC,UAAEA,EAAAA,GAAAA;AACpB,UAAMC,IAAa,EAAA,GAAKF,EAAAA;AACxBG,SAAKC,kBAAkB,oBAAIC;AAG3B,eAAK,CAAOC,GAAKC,CAAAA,KAAUC,OAAOC,QAAQT,CAAAA,EACxC,KAAIO,KAASA,EAAMG,gBAAgB;AACjC,YAAMC,IAAaJ,EAAMK,OAAON,OAAOA;AACvCH,WAAKC,gBAAgBS,IAAIP,GAAKK,CAAAA;AAE9B;AACE,cAAMG,IAASC,aAAaC,QAAQL,CAAAA;AAElCT,QAAAA,EAAWI,CAAAA,IADTQ,MAAW,OACKG,KAAKC,MAAMJ,CAAAA,IAEXP,EAAMY;AAAAA,MAE5B,QAASC;AAGPlB,QAAAA,EAAWI,CAAAA,IAAOC,EAAMY;AAAAA,MAC1B;AAAA,IACF;AAGFhB,SAAKkB,UAAUnB,GACfC,KAAKmB,aAAa,oBAAIjB,OAiDtBF,KAAKF,WAAWA,EA7CHsB,CAAAA,MAAAA;AACX,UAAIC,GACAC,IAAe,oBAAIC;AAEvB,UAAuB,OAAZH,KAAY,YAAY;AACjC,cAAMI,IAAQC,gBAAgBzB,KAAKkB,OAAAA,GAE7BQ,IAASN,EADDpB,KAAK2B,2BAA2BH,GAAOF;AAGjDI,QAAAA,KAA4B,OAAXA,KAAW,YAC9BL,IAAY,EAAA,GAAKrB,KAAKkB,SAAAA,GAAYQ,EAAAA,GAClCrB,OAAOuB,KAAKF,CAAAA,EAAQG,QAAS1B,CAAAA,MAAQmB,EAAaQ,IAAI3B,CAAAA,CAAAA,KAEtDkB,IAAYG;AAAAA,MAEhB,MACEH,CAAAA,IAAY,EAAA,GAAKrB,KAAKkB,SAAAA,GAAYE,EAAAA,GAClCE,IAAe,IAAIC,IAAIlB,OAAOuB,KAAKR,CAAAA,CAAAA;AAGrCpB,WAAKkB,UAAUG,GAIXrB,KAAKC,gBAAgB8B,OAAO,KAC9B/B,KAAKC,gBAAgB4B,QAAQ,CAACrB,GAAYwB,MAAAA;AAKxC,YAJgBC,MAAMC,KAAKZ,CAAAA,EAAca,KACtCC,CAAAA,MAASA,MAASJ,KAAYI,EAAKC,WAAWL,IAAW,GAAA,CAAA,EAI1D,KAAA;AACE,gBAAM5B,IAAQJ,KAAKkB,QAAQc,CAAAA;AAC3BpB,uBAAa0B,QAAQ9B,GAAYM,KAAKyB,UAAUnC,CAAAA,CAAAA;AAAAA,QAClD,QAASa;AAAAA,QAGT;AAAA,MAAA,CAAA,GAKNjB,KAAKwC,yBAAyBlB,CAAAA;AAAAA,IAAAA,GA5CpB,MAAMtB,KAAKkB,OAAAA;AAAAA,EAgDzB;AAAA,EAUA,2BAA2BuB,GAAKnB,GAAcc,IAAO,IAAA;AACnD,WAAO,IAAIM,MAAMD,GAAK,EACpBE,KAAK,CAACC,GAAQC,MAAAA;AACZ,UAAoB,OAATA,KAAS,YAAYA,MAAS,YACvC,QAAOD,EAAOC,CAAAA;AAEhB,YAAMzC,IAAQwC,EAAOC,CAAAA,GACfC,IAAWV,IAAO,GAAGA,CAAAA,IAAQS,CAAAA,KAASA;AAG5C,aAAqB,OAAVzC,KAAU,YAAYA,MAAU,OAClCJ,KAAK2B,2BAA2BvB,GAAOkB,GAAcwB,CAAAA,IAEvD1C;AAAAA,IAAAA,GAETM,KAAK,CAACkC,GAAQC,GAAMzC,MAAAA;AAClB,UAAoB,OAATyC,KAAS,YAAYA,MAAS,YAEvC,QADAD,EAAOC,KAAQzC,GAAAA;AAIjB,YAAM0C,IAAWV,IAAO,GAAGA,CAAAA,IAAQS,CAAAA,KAASA;AAI5C,aAHAvB,EAAaQ,IAAIgB,CAAAA,GAEjBF,EAAOC,CAAAA,IAAQzC,GAAAA;AAAAA,IACR,EAAA,CAAA;AAAA,EAGb;AAAA,EAKA,yBAAyBkB,GAAAA;AACvBtB,SAAKmB,WAAWU,QAAQ,CAACkB,GAAeC;AACjBf,YAAMC,KAAKa,CAAAA,EAAeZ,KAAMc,CAAAA,MAC5ChB,MAAMC,KAAKZ,CAAAA,EAAca,KAAMe,CAAAA,MAGlCD,MAAiBC,KACjBD,EAAaZ,WAAWa,IAAc,GAAA,KACtCA,EAAYb,WAAWY,IAAe,GAAA,CAAA,CAAA,KAK1BD,EAAAA;AAAAA,IAAAA,CAAAA;AAAAA,EAEtB;AAAA,EAUA,2BAA2BP,GAAKM,GAAeX,IAAO,IAAA;AACpD,WAAmB,OAARK,KAAQ,YAAYA,MAAQ,OAAaA,IAE7C,IAAIC,MAAMD,GAAK,EACpBE,KAAK,CAACC,GAAQC,MAAAA;AAEZ,UAAoB,OAATA,KAAS,YAAYA,MAAS,YACvC,QAAOD,EAAOC,CAAAA;AAEhB,YAAMC,IAAWV,IAAO,GAAGA,CAAAA,IAAQS,CAAAA,KAASA;AAC5CE,MAAAA,EAAcjB,IAAIgB,CAAAA;AAElB,YAAM1C,IAAQwC,EAAOC,CAAAA;AAGrB,aAAqB,OAAVzC,KAAU,YAAYA,MAAU,OAClCJ,KAAKmD,2BAA2B/C,GAAO2C,GAAeD,CAAAA,IAExD1C;AAAAA,IAAAA,EAAAA,CAAAA;AAAAA,EAGb;AAAA,EAKA,IAAA,SAAIP;AACF,UAAMT,IAAkBE;AAExB,QAAA,CAAKF,EAAiB,QAAOY,KAAKkB;AAE7BlB,SAAKmB,WAAWiC,IAAIhE,MACvBY,KAAKmB,WAAWT,IAAItB,GAAiB,oBAAImC,KAAAA;AAE3C,UAAMwB,IAAgB/C,KAAKmB,WAAWwB,IAAIvD,CAAAA;AAK1C,WAFA2D,EAAcM,MAAAA,GAEPrD,KAAKmD,2BAA2BnD,KAAKkB,SAAS6B,CAAAA;AAAAA,EACvD;AAAA;ACjNF,IAAIO,IAAa;AACjB,MAAMC,IAAQ,oBAAIhC;AAiCX,SAASiC,EAAIC,MAAiBC,GAAAA;AACnC,MAAIC,IAAM,IACNC;AAGA3B,QAAM4B,QAAQJ,CAAAA,KAAiBA,EAAaE,MAC9CA,IAAMF,EAAaK,OAAO,CAACC,GAAKC,GAAKC,MAC5BF,IAAMC,KAAON,EAAKO,CAAAA,KAAM,KAC9B,EAAA,KAEHN,IAAMF,GAENG,IAAeF,EAAK,CAAA,MAApBE;AAEF,MAAIM,KA5BN,SAAgBV,GAAAA;AACd,WAAOA,EACJW,QAAQ,qBAAqB,EAAA,EAC7BA,QAAQ,QAAQ,GAAA,EAChBC,KAAAA;AAAAA,EACL,GAuBuBT,CAAAA;AAErB,MAAA,CAAKO,EAAS,QAAO;AAEjBN,EAAAA,MAYFM,IAAUA,EAAQC,QAChB,sFACA,aAAA;AAIJ,QAAME,KAhER,SAAoBL,GAAAA;AAClB,QAAIK,IAAO,MACPJ,IAAID,EAAIM;AACZ,WAAOL,IACLI,CAAAA,IAAe,KAAPA,IAAaL,EAAIO,WAAAA,EAAaN,CAAAA;AAExC,YAAQI,MAAS,GAAGG,SAAS,EAAA;AAAA,EAC/B,GAyD0BN,CAAAA,GAClBO,IAAkB,QAAQJ,CAAAA;AAEhC,SAAId,EAAMH,IAAIiB,CAAAA,MAITf,MACHA,IAAaoB,SAASC,cAAc,OAAA,GACpCrB,EAAWsB,KAAK,eAChBF,SAASG,KAAKC,YAAYxB,CAAAA,IAG5BA,EAAWyB,eAAe,IAAIN,CAAAA;AAAAA,MAC1BP,CAAAA;AAAAA;AAAAA,GAEJX,EAAMzB,IAAIuC,CAAAA,IAZDI;AAeX;AC9EY,MAACO,IAAI,CAACC,GAAKC,IAAQ,CAAA,GAAIC,IAAW,CAAA,OAQrC,EACLF,QACAC,OAAAA,GACAC,WAViBlD,MAAM4B,QAAQsB,CAAAA,IAAYA,IAAW,CAACA,CAAAA,GAItDC,OACAC,OAAQC,CAAAA,MAAMA,KAAAA,QAAiCA,MAAjCA,MAAgDA,MAAM,EAANA,EAAAA;ACZ5D,SAASC,EAAQC,GAAAA;AACtB,QAAMC,IAAWhG,EAAAA;AACbgG,OACFA,EAASC,OAAOC,KAAKH;AAEzB;AAMO,SAASI,EAAUJ,GAAAA;AACxB,QAAMC,IAAWhG,EAAAA;AACbgG,OACFA,EAASI,SAASF,KAAKH,CAAAA;AAE3B;ACbO,SAASM,EAAQX,GAAAA;AACtB,SAAOA,KAAYA,EAAShD,KAAMmD,CAAAA,MAAMA,KAAKA,EAAEJ,SAASI,EAAEJ,MAAM/E,OAAO;AACzE;AAOA,SAASwE,EAAcoB,GAAAA;AACrB,MAAqB,OAAVA,KAAU,YAA6B,OAAVA,KAAU,SAChD,QAAOrB,SAASsB,eAAeC,OAAOF,CAAAA,CAAAA;AAGxC,MAAyB,OAAdA,EAAMd,OAAQ,YAAY;AACnC,UAAMiB,IAAaC,EAAgBJ,CAAAA;AACnCA,MAAMK,QAAQF;AAGd,UAAMG,IAAK1B,EAAcuB,CAAAA;AAOzB,WANAH,EAAMM,KAAKA,GAGPN,EAAMO,SAASP,EAAMO,MAAMZ,OAAOpB,SAAS,KAC7CiC,WAAW,MAAMR,EAAMO,MAAMZ,OAAO7D,QAAS2D,CAAAA,MAAOA,EAAAA,CAAAA,GAAO,CAAA,GAEtDa;AAAAA,EACT;AAIA,QAAMA,IAAK3B,SAASC,cAAcoB,EAAMd,GAAAA;AAQxC,SAPAc,EAAMM,KAAKA,GACXG,EAAWH,GAAIN,EAAMb,KAAAA,GAErBa,EAAMZ,SAAStD,QAASuE,CAAAA,MAAAA;AACtBC,MAAGvB,YAAYH,EAAcyB,CAAAA,CAAAA;AAAAA,EAAAA,CAAAA,GAGxBC;AACT;AAYA,SAASG,EAAWH,GAAII,IAAW,CAAA,GAAIC,IAAW,CAAA,GAAA;AAChD,MAAA,CAAKL,EAAI;AAET,QAAMM,IAAW,EAAA,GAAKD,GAAAA,GAAaD,EAAAA;AAEnC,aAAWtG,KAAOwG,GAAU;AAC1B,UAAMC,IAAWF,EAASvG,CAAAA,GACpB0G,IAAWJ,EAAStG,CAAAA;AAG1B,QAAI0G,KAAAA,KAOJ,KAAI1G,MAAQ,WAAWA,MAAQ;AAS/B,UAAIyG,MAAaC,GAAjB;AAKA,YAAI1G,EAAIkC,WAAW,IAAA,GAAO;AACxB,gBAAMyE,IAAY3G,EAAI4G,MAAM,GAAGC,YAAAA;AAC3BJ,UAAAA,KAAUP,EAAGY,oBAAoBH,GAAWF,CAAAA,GAChDP,EAAGa,iBAAiBJ,GAAWD,CAAAA;AAAAA,QACjC;AAEY,QAAR1G,MAAQ,aACVkG,EAAGc,WAAWN,MAAXM,MAAgCN,MAAa,SAIhDR,EAAGe,aAAajH,GAAK0G,CAAAA;AAAAA,MAhBI;AAAA,UARrBR,GAAGlG,CAAAA,MAAS0G,MACdR,EAAGlG,CAAAA,IAAO0G;AAAAA,QARZR,GAAGgB,gBAAgBlH,CAAAA;AAAAA,EAiCvB;AACF;AAcA,SAASmH,EAAkBC,GAAQC,GAAaC,GAAAA;AAK9C,MAAA,EAJgB3B,EAAQ0B,CAAAA,KAAgB1B,EAAQ2B,KAIlC;AACZ,UAAMC,IAASC,KAAKC,IAAIJ,EAAYlD,QAAQmD,EAAYnD;AACxD,aAASL,IAAI,GAAGA,IAAIyD,GAAQzD,IAC1B4D,CAAAA,EAAMN,GAAQC,EAAYvD,CAAAA,GAAIwD,EAAYxD,CAAAA,GAAIA,CAAAA;AAEhD;AAAA,EACF;AAAA,GAaF,SAAgCsD,GAAQC,GAAaC,GAAAA;AAEnD,UAAMK,IAAQ,CAAA;AACdL,IAAAA,EAAY5F,QAAQ,CAACuE,GAAOnC,MAAAA;AAC1B,YAAM9D,KAAOiG,EAAMlB,SAASkB,EAAMlB,MAAM/E,QAAQ,OAAOiG,EAAMlB,MAAM/E,MAAM8D;AACzE6D,MAAAA,EAAM3H,CAAAA,IAAO,EAAE4F,OAAOK,GAAO2B,OAAO9D,EAAAA;AAAAA,IAAAA,CAAAA,GAGtCuD,EAAY3F,QAAQ,CAACmG,GAAU/D,MAAAA;AAC7B,YAAM9D,KACH6H,EAAS9C,SAAS8C,EAAS9C,MAAM/E,QAAQ,OAAO6H,EAAS9C,MAAM/E,MAAM8D,GAClEgE,IAAqBH,EAAM3H,CAAAA;AAEjC,UAAI8H,GAAoB;AAEtB,cAAMC,IAAWD,EAAmBlC;AAGpC8B,QAAAA,EAAMN,GAAQS,GAAUE,GAAUjE,CAAAA;AAIlC,cAAMoC,IAAK2B,EAAS3B,MAAM6B,EAAS7B,IAG7B8B,IAAkBZ,EAAOa,WAAWnE;AAGtCoC,QAAAA,KAAM8B,MAAoB9B,KAC5BkB,EAAOc,aAAahC,GAAI8B,CAAAA,GAAAA,OAKnBL,EAAM3H;MACf,OAAO;AAEL,cAAMmI,IAAQ3D,EAAcqD,CAAAA,GACtBG,IAAkBZ,EAAOa,WAAWnE;AAEtCkE,QAAAA,IACFZ,EAAOc,aAAaC,GAAOH,CAAAA,IAE3BZ,EAAOzC,YAAYwD,CAAAA;AAAAA,MAEvB;AAAA,QAIFjI,OAAOkI,OAAOT,CAAAA,EAAOjG,QAAQ,CAAA,EAAGkE,OAAAA,EAAAA,MAAAA;AAC1BA,MAAAA,EAAMM,MAAMN,EAAMM,GAAGmC,eAAejB,MACtCkB,EAAW1C,CAAAA,GACXwB,EAAOmB,YAAY3C,EAAMM;;EAI/B,GAnEyBkB,GAAQC,GAAaC,CAAAA;AAC9C;AAyEA,SAAStB,EAAgBJ;AAIvB,QAAMO,IAAQ,EACZZ,QAAQ,CAAA,GACRG,UAAU,CAAA,EAAA;AAIZnG,EAAAA,EAAY4G;AAIZ,QAAMqC,IAAgB5C,EAAMd,IAAIc,EAAMb,KAAAA;AAQtC,SALAxF,EAAY,OAGZqG,EAAMO,QAAQA,GAEPqC;AACT;AAMA,SAASF,EAAW1C,GAAAA;AACbA,QAGDA,EAAMO,SAASP,EAAMO,MAAMT,YAC7BE,EAAMO,MAAMT,SAAShE,QAAS2D,CAAAA,MAAOA,EAAAA,CAAAA,GAInCO,EAAMK,SACRqC,EAAW1C,EAAMK,KAAAA,GAIfL,EAAMZ,YACRY,EAAMZ,SAAStD,QAAQ4G,CAAAA;AAE3B;AASO,SAASZ,EAAMN,GAAQqB,GAAUV,GAAUH,IAAQ,GAAA;AAIxD,MAAIa,KAAAA,MAA6C;AAC/C,UAAMvC,IAAK6B,EAAS7B,MAAMkB,EAAOa,WAAWL,CAAAA;AAS5C,WANAU,EAAWP,CAAAA,GAAAA,MAEP7B,KACFkB,EAAOmB,YAAYrC,CAAAA;AAAAA,EAIvB;AAGA,MAA4B,OAAjBuC,EAAS3D,OAAQ,YAAY;AACtC,UAAM4D,IAAAA,CAASX,GAEThC,IAAaC,EAAgByC,CAAAA;AACnCA,aAASxC,QAAQF,GAGjB2B,EAAMN,GAAQrB,GADGgC,IAAWA,EAAS9B,QAAAA,QACD2B,CAAAA,GAEpCa,EAASvC,KAAKH,EAAWG,IAAAA,MAGrBwC,KAASD,EAAStC,SAASsC,EAAStC,MAAMZ,OAAOpB,SAAS,KAC5DiC,WAAW,MAAA;AACTqC,QAAStC,MAAMZ,OAAO7D,QAAS2D,CAAAA,MAAOA,EAAAA,CAAAA;AAAAA,IAAAA,GACrC,CAAA;AAAA,EAIP;AAGA,MAAI0C,KAAAA,KAEF,QAAA,KADAX,EAAOzC,YAAYH,EAAciE,CAAAA,CAAAA;AAKnC,MAAA,OACSA,KAAAA,OAAoBV,KACN,OAAbU,KAAa,YAAYA,EAAS3D,QAAQiD,EAASjD,KAC3D;AACA,UAAMoB,IAAK6B,EAAS7B,MAAMkB,EAAOa,WAAWL;AAK5C,WAAA,MAJI1B,KACFkB,EAAOuB,aAAanE,EAAciE,CAAAA,GAAWvC,CAAAA;AAAAA,EAIjD;AAGA,MAAwB,OAAbuC,KAAa,YAAgC,OAAbA,KAAa,UAAU;AAChE,QAAIA,MAAaV,GAAU;AACzB,YAAM7B,IAAKkB,EAAOa,WAAWL,CAAAA;AACzB1B,MAAAA,IACFA,EAAG0C,YAAY9C,OAAO2C,CAAAA,IAItBrB,EAAOzC,YAAYJ,SAASsB,eAAeC,OAAO2C,CAAAA,CAAAA,CAAAA;AAAAA,IAEtD;AACA;AAAA,EACF;AAGA,QAAMvC,IAAK6B,EAAS7B,MAAMkB,EAAOa,WAAWL,CAAAA;AAEvC1B,EAAAA,MAGLuC,EAASvC,KAAKA,GAEdG,EAAWH,GAAIuC,EAAS1D,OAAOgD,EAAShD,QAExCoC,EAAkBjB,GAAIuC,EAASzD,UAAU+C,EAAS/C,QAAAA;AACpD;AClVY,MAAC6D,IAAQ,CAACpG,GAAQqG,MAAAA;AAC5B,MAAIC,IAAY;AAEhB,QAAMC,IAAY;AAChB5J,IAAAA,EAAY4J,CAAAA;AAEZ,UAAMC,IAAY,EAChBnE,KAAKgE,GACL/D,OAAO,CAAA,GACPC,UAAU,CAAA,EAAA;AAGZ0C,IAAAA,EAAMjF,GAAQwG,GAAWF,CAAAA,GACzB3J,EAAY,OACZ2J,IAAYE;AAAAA,EAAAA;AAGdD,EAAAA,EAAAA;AAAAA,GCVWE,IAAU,CAACrI,GAASP,IAAS,QAAE,EAC1CF,gBAAAA,IACAS,SAAAA,GACAP;"}
+{"version":3,"file":"humn.js","sources":["../src/observer.js","../src/cortex.js","../src/css.js","../src/h.js","../src/lifecycle.js","../src/patch.js","../src/mount.js","../src/persist.js"],"sourcesContent":["/**\n * @file Observer module for tracking global state during rendering.\n * @module observer\n */\n\nlet currentObserver = null // For Cortex/State dependency\nlet currentInstance = null // For Lifecycle Hooks\n\n/**\n * Gets the current observer (render function).\n * @returns {function|null}\n */\nexport const getObserver = () => currentObserver\n\n/**\n * Sets the current observer.\n * @param {function|null} obs\n */\nexport const setObserver = (obs) => {\n  currentObserver = obs\n}\n\n/**\n * Gets the current component instance (hook container).\n * @returns {object|null}\n */\nexport const getInstance = () => currentInstance\n\n/**\n * Sets the current component instance.\n * @param {object|null} inst\n */\nexport const setInstance = (inst) => {\n  currentInstance = inst\n}\n","import { getObserver } from './observer.js'\nimport { isDev } from './metrics.js'\n\n/**\n * @typedef {object} Synapses\n * @property {function} set - Function to update the memory\n * @property {function} get - Function to get the memory\n */\n\n/**\n * @typedef {object} CortexParams\n * @property {object} memory - The initial state\n * @property {function(function, function): object} synapses - The synapses function\n */\n\n/**\n * The Cortex class manages the state of the application.\n * This uses a Proxy for fine-grained reactivity, ensuring only those components\n * which use the updated value get re-rendered.\n *\n * WHY: We use Proxies instead of simple getters/setters because it allows us to\n * detect access to nested properties dynamically without needing to declare\n * dependencies upfront. This \"magic\" auto-subscription is what makes Humn's\n * DX so clean.\n */\nexport class Cortex {\n  /**\n   * Creates an instance of Cortex.\n   * @param {CortexParams} CortexParams - The parameters for the Cortex.\n   */\n  constructor({ memory, synapses }) {\n    const liveMemory = { ...memory }\n    this._persistenceMap = new Map()\n\n    // Load in any existing values from local-storage\n    for (const [key, value] of Object.entries(memory)) {\n      if (value && value.__humn_persist) {\n        const storageKey = value.config.key || key\n        this._persistenceMap.set(key, storageKey)\n\n        try {\n          const stored = localStorage.getItem(storageKey)\n          if (stored !== null) {\n            liveMemory[key] = JSON.parse(stored)\n          } else {\n            liveMemory[key] = value.initial\n          }\n        } catch (err) {\n          if (isDev)\n            console.warn(`Humn: Failed to load '${key}' from storage.`, err)\n          liveMemory[key] = value.initial\n        }\n      }\n    }\n\n    this._memory = liveMemory\n    this._listeners = new Map()\n\n    const get = () => this._memory\n\n    const set = (updater) => {\n      let nextState\n      let changedPaths = new Set()\n\n      if (typeof updater === 'function') {\n        const clone = structuredClone(this._memory)\n        const proxy = this._createChangeTrackingProxy(clone, changedPaths)\n        const result = updater(proxy)\n\n        if (result && typeof result === 'object') {\n          nextState = { ...this._memory, ...result }\n          Object.keys(result).forEach((key) => changedPaths.add(key))\n        } else {\n          nextState = clone\n        }\n      } else {\n        nextState = { ...this._memory, ...updater }\n        changedPaths = new Set(Object.keys(updater))\n      }\n\n      this._memory = nextState\n\n      // If we need to persist any of the values\n      // we save them to localStorage here\n      if (this._persistenceMap.size > 0) {\n        this._persistenceMap.forEach((storageKey, stateKey) => {\n          const isDirty = Array.from(changedPaths).some(\n            (path) => path === stateKey || path.startsWith(stateKey + '.'),\n          )\n\n          if (isDirty) {\n            try {\n              const value = this._memory[stateKey]\n              localStorage.setItem(storageKey, JSON.stringify(value))\n            } catch (err) {\n              if (isDev)\n                console.error(`Humn: Failed to save '${stateKey}'.`, err)\n            }\n          }\n        })\n      }\n\n      this._notifyRelevantListeners(changedPaths)\n    }\n\n    this.synapses = synapses(set, get)\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are being mutated.\n   * Includes a GET trap to recursively proxy nested objects for deep mutation tracking.\n   *\n   * WHY: We need to know exactly which paths were changed so we can notify ONLY\n   * the components that care about those specific paths. If we just knew \"something changed\",\n   * we'd have to re-render the whole app (like Redux) or rely on manual optimization.\n   */\n  _createChangeTrackingProxy(obj, changedPaths, path = '') {\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const value = target[prop]\n        const fullPath = path ? `${path}.${prop}` : prop\n\n        // Recursively proxy nested objects so we can trap their sets too\n        if (typeof value === 'object' && value !== null) {\n          return this._createChangeTrackingProxy(value, changedPaths, fullPath)\n        }\n        return value\n      },\n      set: (target, prop, value) => {\n        if (typeof prop === 'symbol' || prop === '__proto__') {\n          target[prop] = value\n          return true\n        }\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        changedPaths.add(fullPath)\n\n        target[prop] = value\n        return true\n      },\n    })\n  }\n\n  /**\n   * Only notify listeners that read properties which changed\n   */\n  _notifyRelevantListeners(changedPaths) {\n    this._listeners.forEach((accessedPaths, renderFn) => {\n      const shouldNotify = Array.from(accessedPaths).some((accessedPath) => {\n        return Array.from(changedPaths).some((changedPath) => {\n          // Check for exact match or parent/child relationship\n          return (\n            accessedPath === changedPath ||\n            accessedPath.startsWith(changedPath + '.') ||\n            changedPath.startsWith(accessedPath + '.')\n          )\n        })\n      })\n\n      if (shouldNotify) renderFn()\n    })\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are accessed during render\n   *\n   * WHY: This is the other half of the magic. By tracking what a component READS\n   * during its render, we build a precise dependency graph. If a component reads\n   * `state.user.name`, it will only re-render when `state.user.name` changes,\n   * not when `state.count` changes.\n   */\n  _createAccessTrackingProxy(obj, accessedPaths, path = '') {\n    if (typeof obj !== 'object' || obj === null) return obj\n\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        // We don't care about prototype and symbol properties\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        accessedPaths.add(fullPath)\n\n        const value = target[prop]\n\n        // Recursively wrap nested objects\n        if (typeof value === 'object' && value !== null)\n          return this._createAccessTrackingProxy(value, accessedPaths, fullPath)\n\n        return value\n      },\n    })\n  }\n\n  /**\n   * Returns memory wrapped in a tracking Proxy\n   */\n  get memory() {\n    const currentObserver = getObserver()\n\n    if (!currentObserver) return this._memory\n\n    if (!this._listeners.has(currentObserver))\n      this._listeners.set(currentObserver, new Set())\n\n    const accessedPaths = this._listeners.get(currentObserver)\n\n    // This gives us fresh tracking each render\n    accessedPaths.clear()\n\n    return this._createAccessTrackingProxy(this._memory, accessedPaths)\n  }\n}\n","/**\n * @file Runtime Scoped CSS implementation using Native CSS Nesting.\n * @module css\n */\n\nlet styleSheet = null\nconst cache = new Set()\n\n/**\n * Simple DJB2 hashing function.\n */\nfunction hashString(str) {\n  let hash = 5381\n  let i = str.length\n  while (i) {\n    hash = (hash * 33) ^ str.charCodeAt(--i)\n  }\n  return (hash >>> 0).toString(36)\n}\n\n/**\n * Lightweight Runtime Minifier.\n * Removes comments and collapses whitespace.\n * We do not strip spaces around colons/brackets to ensure safety for calc().\n */\nfunction minify(css) {\n  return css\n    .replace(/\\/\\*[\\s\\S]*?\\*\\//g, '') // Remove comments\n    .replace(/\\s+/g, ' ') // Collapse newlines/tabs to single space\n    .trim() // Remove leading/trailing\n}\n\n/**\n * Scoped CSS Tag.\n * Wraps content in a unique class using Native CSS Nesting.\n * Supports two signatures:\n * 1. Tagged Template: css`...`\n * 2. Function: css(string, isSingleRoot)\n */\nexport function css(stringsOrStr, ...args) {\n  let raw = ''\n  let isSingleRoot = false\n\n  // Detect usage of Tagged Template vs Function Call\n  if (Array.isArray(stringsOrStr) && stringsOrStr.raw) {\n    raw = stringsOrStr.reduce((acc, str, i) => {\n      return acc + str + (args[i] || '')\n    }, '')\n  } else {\n    raw = stringsOrStr\n    // If called as function, the first arg is our boolean flag\n    isSingleRoot = args[0] === true\n  }\n  let content = minify(raw)\n\n  if (!content) return ''\n\n  if (isSingleRoot) {\n    // Transforms selectors to apply to BOTH the root (using &) AND descendants.\n    // e.g. \"div\" -> \"div&, div\"\n\n    // Regex Breakdown:\n    // 1. (^|[{};,])      -> Hard Start (Line start, brace, semi, comma)\n    // 2. (\\s*)           -> Whitespace\n    // 3. (?!from|to)     -> Negative Lookahead: Ignore 'from'/'to' (keyframes)\n    // 4. ( ... )+        -> Compound Selector:\n    //    (?:[.#]?[\\w-]+ ... ) -> Matches tags (div), classes (.class), ids (#id)\n    // 5. (?=\\s*\\{)       -> Lookahead: Must be followed by {\n\n    content = content.replace(\n      /(^|[{};,])(\\s*)(?!from|to)((?:[.#]?[\\w-]+|\\[[^\\]]+\\]|:{1,2}[^:,{\\s]+)+)(?=\\s*\\{)/gi,\n      '$1$2$3&, $3',\n    )\n  }\n\n  const hash = hashString(content)\n  const hashedClassName = `humn-${hash}`\n\n  if (cache.has(hash)) {\n    return hashedClassName\n  }\n\n  if (!styleSheet) {\n    styleSheet = document.createElement('style')\n    styleSheet.id = 'humn-styles'\n    document.head.appendChild(styleSheet)\n  }\n\n  styleSheet.textContent += `.${hashedClassName} { \n    ${content} \n  }\\n`\n  cache.add(hash)\n\n  return hashedClassName\n}\n","/**\n * @typedef {object} VNode\n * @property {string} tag\n * @property {object} props\n * @property {VNode[]} children\n */\n\n/**\n * Creates a virtual DOM node.\n * This is a hyperscript-like function.\n *\n * @param {string} tag - The tag name of the element.\n * @param {object} props - The properties of the element.\n * @param {VNode[]|VNode} children - The children of the element.\n * @returns {VNode} The virtual DOM node.\n */\nexport const h = (tag, props = {}, children = []) => {\n  const childArray = Array.isArray(children) ? children : [children]\n\n  // Filter out null/false so we don't have \"ghost\" nodes\n  const cleanChildren = childArray\n    .flat()\n    .filter((c) => c !== null && c !== undefined && c !== false && c !== '')\n\n  return {\n    tag,\n    props,\n    children: cleanChildren,\n  }\n}\n","/**\n * @file Lifecycle hooks for components.\n * @module lifecycle\n */\nimport { getInstance } from './observer.js'\n\n/**\n * Registers a callback to run after the component mounts.\n * @param {function} fn - The callback function.\n */\nexport function onMount(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.mounts.push(fn)\n  }\n}\n\n/**\n * Registers a callback to run when the component unmounts.\n * @param {function} fn - The callback function.\n */\nexport function onCleanup(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.cleanups.push(fn)\n  }\n}\n","/**\n * @file This file contains the diffing and patching algorithm for the virtual DOM,\n * including support for Keyed Diffing.\n * @module patch\n */\nimport { track } from './metrics.js'\nimport { setInstance } from './observer.js'\n\nfunction getNamespace(parent) {\n  if (parent.namespaceURI === SVG_NS && parent.tagName !== 'foreignObject') {\n    return SVG_NS\n  }\n  if (parent.namespaceURI === MATH_NS) {\n    return MATH_NS\n  }\n  return null\n}\n\n/**\n * Checks if a list of children contains keys.\n * @param {Array<import(\"./h.js\").VNode>} children - The list of VNodes.\n * @returns {boolean} True if keys are present.\n */\nexport function hasKeys(children) {\n  return children && children.some((c) => c && c.props && c.props.key != null)\n}\n\nconst SVG_NS = 'http://www.w3.org/2000/svg'\nconst MATH_NS = 'http://www.w3.org/1998/Math/MathML'\n/**\n * Creates a real DOM element from a virtual node.\n * @param {import(\"./h.js\").VNode | string | number} vNode\n * @param {string} [namespace] - The current namespace URI (if any).\n * @returns {Text | HTMLElement | SVGElement}\n */\nfunction createElement(vNode, namespace) {\n  if (typeof vNode === 'string' || typeof vNode === 'number') {\n    return document.createTextNode(String(vNode))\n  }\n\n  if (typeof vNode.tag === 'function') {\n    const childVNode = renderComponent(vNode)\n    vNode.child = childVNode\n\n    const el = createElement(childVNode, namespace)\n\n    vNode.el = el\n    if (vNode.hooks?.mounts.length > 0) {\n      setTimeout(() => vNode.hooks.mounts.forEach((fn) => fn()), 0)\n    }\n    return el\n  }\n\n  track('elementsCreated')\n\n  const tag = vNode.tag\n\n  // We prioritize specific tag declarations over the inherited namespace.\n  if (tag === 'svg') namespace = SVG_NS\n  else if (tag === 'math') namespace = MATH_NS\n  // NOTE: If we are inside 'foreignObject', we must NOT use the SVG NS.\n  // We handle this by resetting 'ns' in the recursion step below,\n  // so 'ns' entering here is already null for the foreignObject's children.\n\n  // createElementNS is slower than createElement, so only use it if we have a namespace.\n  const element = namespace\n    ? document.createElementNS(namespace, tag)\n    : document.createElement(tag)\n\n  vNode.el = element\n  patchProps(element, vNode.props)\n\n  // If we are currently at a 'foreignObject', children must exit the SVG namespace.\n  const childNS = tag === 'foreignObject' ? null : namespace\n\n  vNode.children.forEach((child) => {\n    element.appendChild(createElement(child, childNS))\n  })\n\n  return element\n}\n\n/**\n * Updates the properties (attributes/events) of a DOM element.\n * @param {HTMLElement} element - The DOM element to update.\n * @param {object} [newProps={}] - The new properties.\n * @param {object} [oldProps={}] - The old properties.\n *\n * WHY: We check against the LIVE DOM value for inputs (value/checked) to prevent\n * the \"cursor jumping\" bug. If we just blindly set the attribute, the browser\n * might reset the cursor position to the end of the input.\n */\nfunction patchProps(element, newProps = {}, oldProps = {}) {\n  if (!element) return\n\n  const allProps = { ...oldProps, ...newProps }\n\n  for (const key in allProps) {\n    const oldValue = oldProps[key]\n    const newValue = newProps[key]\n\n    // Handle removed props\n    if (newValue === undefined || newValue === null) {\n      element.removeAttribute(key)\n      track('patches')\n      continue\n    }\n\n    // We check against the LIVE DOM value to prevent cursor jumping\n    if (key === 'value' || key === 'checked') {\n      if (element[key] !== newValue) {\n        element[key] = newValue\n        track('patches')\n      }\n      continue\n    }\n\n    // If prop hasn't changed, skip\n    if (oldValue === newValue) continue\n\n    track('patches')\n\n    // Handle Events\n    if (key.startsWith('on')) {\n      const eventName = key.slice(2).toLowerCase()\n      if (oldValue) element.removeEventListener(eventName, oldValue)\n      element.addEventListener(eventName, newValue)\n    }\n    // Handle the disabled attribute\n    if (key === 'disabled') {\n      element.disabled = newValue === true || newValue === 'true'\n    }\n    // Handle standard attributes\n    else {\n      element.setAttribute(key, newValue)\n    }\n  }\n}\n\n/**\n * Reconciles the children of a node, handling both simple lists and keyed reordering.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {Array<import(\"./h.js\").VNode>} newChildren - The new list of children.\n * @param {Array<import(\"./h.js\").VNode>} oldChildren - The old list of children.\n *\n * WHY: This is the most complex part of the VDOM. We need to efficiently update\n * a list of items. Without keys, we just update index-by-index, which is fast\n * but causes issues if items are reordered (state gets mixed up).\n * With keys, we can track items as they move around, preserving their state\n * and minimizing DOM operations.\n */\nfunction reconcileChildren(parent, newChildren, oldChildren) {\n  const isKeyed = hasKeys(newChildren) || hasKeys(oldChildren)\n\n  // If no keys are used, use the fast index-based simple loop.\n  // This is faster for static lists or simple text replacements.\n  if (!isKeyed) {\n    const maxLen = Math.max(newChildren.length, oldChildren.length)\n    for (let i = 0; i < maxLen; i++) {\n      patch(parent, newChildren[i], oldChildren[i], i)\n    }\n    return\n  }\n\n  reconcileKeyedChildren(parent, newChildren, oldChildren)\n}\n\n/**\n * Handles the complex logic of reconciling keyed children.\n *\n * WHY: When keys are present, we can't just iterate by index. We need to map\n * existing children by their key so we can find them even if they've moved.\n * This allows us to re-use DOM nodes (preserving focus/state) instead of\n * destroying and re-creating them.\n */\nfunction reconcileKeyedChildren(parent, newChildren, oldChildren) {\n  // Map existing children by Key for O(1) lookup\n  const keyed = {}\n  oldChildren.forEach((child, i) => {\n    const key = (child.props && child.props.key) != null ? child.props.key : i\n    keyed[key] = { vNode: child, index: i }\n  })\n\n  newChildren.forEach((newChild, i) => {\n    const key =\n      (newChild.props && newChild.props.key) != null ? newChild.props.key : i\n    const existingChildMatch = keyed[key]\n\n    if (existingChildMatch) {\n      // A. MATCH FOUND - The item existed before\n      const oldVNode = existingChildMatch.vNode\n\n      // Update the node's content recursively\n      patch(parent, newChild, oldVNode, i)\n\n      // If the DOM node isn't in the right spot, move it.\n      // We use oldVNode.el because patch transfers the ref, but just to be safe:\n      const element = newChild.el || oldVNode.el\n\n      // Get the node currently at this index in the real DOM\n      const domChildAtIndex = parent.childNodes[i]\n\n      // If the element exists but is in the wrong place, move it\n      if (element && domChildAtIndex !== element) {\n        parent.insertBefore(element, domChildAtIndex)\n        track('patches')\n      }\n\n      // Remove from map so we know it was re-used\n      delete keyed[key]\n    } else {\n      // B. NO MATCH - This is a new item\n      const newElement = createElement(newChild, getNamespace(parent))\n      const domChildAtIndex = parent.childNodes[i]\n\n      if (domChildAtIndex) {\n        parent.insertBefore(newElement, domChildAtIndex)\n      } else {\n        parent.appendChild(newElement)\n      }\n    }\n  })\n\n  // Remove any old keys that weren't used in the new list\n  Object.values(keyed).forEach(({ vNode }) => {\n    if (vNode.el && vNode.el.parentNode === parent) {\n      runUnmount(vNode) // Clean up hooks\n      parent.removeChild(vNode.el)\n      track('elementsRemoved')\n    }\n  })\n}\n\n/**\n * Executes a Functional Component, tracks hooks, and returns the VNode.\n * @param {import(\"./h.js\").VNode} vNode - The component vNode.\n * @returns {import(\"./h.js\").VNode} The rendered child vNode.\n */\nfunction renderComponent(vNode) {\n  track('componentsRendered')\n\n  // 1. Prepare Hook Container\n  const hooks = {\n    mounts: [],\n    cleanups: [],\n  }\n\n  // 2. Set Global Scope\n  setInstance(hooks)\n\n  // 3. Run the User's Component Function\n  // We pass props as the first argument\n  const renderedVNode = vNode.tag(vNode.props)\n\n  // 4. Clear Global Scope\n  setInstance(null)\n\n  // 5. Attach hooks to the VNode so we can run them later\n  vNode.hooks = hooks\n\n  return renderedVNode\n}\n\n/**\n * Helper to recursively run cleanup hooks when a tree is removed.\n * @param {import(\"./h.js\").VNode} vNode - The vNode to unmount.\n */\nfunction runUnmount(vNode) {\n  if (!vNode) return\n\n  // 1. Run hooks for this node\n  if (vNode.hooks && vNode.hooks.cleanups) {\n    vNode.hooks.cleanups.forEach((fn) => fn())\n  }\n\n  // 2. Recurse into child (if component)\n  if (vNode.child) {\n    runUnmount(vNode.child)\n  }\n\n  // 3. Recurse into children (if element)\n  if (vNode.children) {\n    vNode.children.forEach(runUnmount)\n  }\n}\n\n/**\n * The main diffing function. Compares V-DOM trees and updates the real DOM.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {import(\"./h.js\").VNode | string | number} newVNode - The new virtual node.\n * @param {import(\"./h.js\").VNode | string | number} oldVNode - The old virtual node.\n * @param {number} [index=0] - The index of the child node (used for simple diffing).\n */\nexport function patch(parent, newVNode, oldVNode, index = 0) {\n  track('diffs')\n\n  // Case 1: Removal - The new node is null/undefined, so we remove the old one.\n  if (newVNode === undefined || newVNode === null) {\n    const el = oldVNode.el || parent.childNodes[index]\n\n    // Recursive Cleanup\n    runUnmount(oldVNode)\n\n    if (el) {\n      parent.removeChild(el)\n      track('elementsRemoved')\n    }\n    return\n  }\n\n  // Case 2: Component - If it's a function, we delegate to the component logic.\n  if (typeof newVNode.tag === 'function') {\n    const isNew = !oldVNode\n\n    const childVNode = renderComponent(newVNode)\n    newVNode.child = childVNode\n\n    const oldChild = oldVNode ? oldVNode.child : undefined\n    patch(parent, childVNode, oldChild, index)\n\n    newVNode.el = childVNode.el\n\n    // Run mount hooks on the next tick\n    if (isNew && newVNode.hooks && newVNode.hooks.mounts.length > 0) {\n      setTimeout(() => {\n        newVNode.hooks.mounts.forEach((fn) => fn())\n      }, 0)\n    }\n    // TODO: Handle updates (running old cleanups if necessary) for Phase 2\n    return\n  }\n\n  // Case 3: Creation - No old node exists, so we create a new one.\n  if (oldVNode === undefined || oldVNode === null) {\n    parent.appendChild(createElement(newVNode, getNamespace(parent)))\n    return\n  }\n\n  // Case 4: Replacement - The node type changed (e.g. div -> span), so we replace it entirely.\n  if (\n    typeof newVNode !== typeof oldVNode ||\n    (typeof newVNode !== 'string' && newVNode.tag !== oldVNode.tag)\n  ) {\n    const el = oldVNode.el || parent.childNodes[index]\n    if (el) {\n      parent.replaceChild(createElement(newVNode, getNamespace(parent)), el)\n      track('patches')\n    }\n    return\n  }\n\n  // Case 5: Text Update - It's a text node, so we just update the text content.\n  if (typeof newVNode === 'string' || typeof newVNode === 'number') {\n    if (newVNode !== oldVNode) {\n      const el = parent.childNodes[index]\n      if (el) {\n        el.nodeValue = String(newVNode)\n        track('patches')\n      } else {\n        // Self healing: if text node missing, append it\n        parent.appendChild(document.createTextNode(String(newVNode)))\n      }\n    }\n    return\n  }\n\n  // Case 6: Update - Same tag, so we update props and recurse into children.\n  const el = oldVNode.el || parent.childNodes[index]\n\n  if (!el) return\n\n  // Transfer DOM reference to the new VNode\n  newVNode.el = el\n\n  patchProps(el, newVNode.props, oldVNode.props)\n\n  reconcileChildren(el, newVNode.children, oldVNode.children)\n}\n","/**\n * @file Mounts the application to the DOM.\n * @module mount\n */\nimport { setObserver } from './observer.js'\nimport { patch } from './patch.js'\n\n/**\n * Mounts a component to a target DOM element.\n * @param {HTMLElement} target - The DOM element to mount to.\n * @param {function} Component - The root component function.\n */\nexport const mount = (target, Component) => {\n  let prevVNode = null\n\n  const lifecycle = () => {\n    setObserver(lifecycle)\n\n    const nextVNode = {\n      tag: Component,\n      props: {},\n      children: [],\n    }\n\n    patch(target, nextVNode, prevVNode)\n    setObserver(null)\n    prevVNode = nextVNode\n  }\n\n  lifecycle()\n}\n","/**\n * @typedef {object} HumnPersist\n * @property {boolean} __humn_persist\n * @property {any} initial\n * @property {PersistConfig} config\n */\n\n/**\n * @typedef {object} PersistConfig\n * @property {string} key\n */\n\n/**\n * Marks a section of the state for persistence in localStorage.\n *\n * @param {any} initial - The initial value of the state.\n * @param {PersistConfig} config - The configuration for persistence.\n * @returns {HumnPersist}\n */\nexport const persist = (initial, config = {}) => ({\n  __humn_persist: true,\n  initial,\n  config,\n})\n"],"names":["currentObserver","currentInstance","getObserver","setObserver","obs","getInstance","setInstance","inst","Cortex","memory","synapses","liveMemory","this","_persistenceMap","Map","key","value","Object","entries","__humn_persist","storageKey","config","set","stored","localStorage","getItem","JSON","parse","initial","err","_memory","_listeners","updater","nextState","changedPaths","Set","clone","structuredClone","result","_createChangeTrackingProxy","keys","forEach","add","size","stateKey","Array","from","some","path","startsWith","setItem","stringify","_notifyRelevantListeners","obj","Proxy","get","target","prop","fullPath","accessedPaths","renderFn","accessedPath","changedPath","_createAccessTrackingProxy","has","clear","styleSheet","cache","css","stringsOrStr","args","raw","isSingleRoot","isArray","reduce","acc","str","i","content","replace","trim","hash","length","charCodeAt","toString","hashedClassName","document","createElement","id","head","appendChild","textContent","h","tag","props","children","flat","filter","c","onMount","fn","instance","mounts","push","onCleanup","cleanups","getNamespace","parent","namespaceURI","SVG_NS","tagName","MATH_NS","hasKeys","vNode","namespace","createTextNode","String","childVNode","renderComponent","child","el","hooks","setTimeout","element","createElementNS","patchProps","childNS","newProps","oldProps","allProps","oldValue","newValue","eventName","slice","toLowerCase","removeEventListener","addEventListener","disabled","setAttribute","removeAttribute","reconcileChildren","newChildren","oldChildren","maxLen","Math","max","patch","keyed","index","newChild","existingChildMatch","oldVNode","domChildAtIndex","childNodes","insertBefore","newElement","values","parentNode","runUnmount","removeChild","renderedVNode","newVNode","isNew","replaceChild","nodeValue","mount","Component","prevVNode","lifecycle","nextVNode","persist"],"mappings":"AAKA,IAAIA,IAAkB,MAClBC,IAAkB;AAMf,MAAMC,IAAc,MAAMF,GAMpBG,IAAeC,OAAAA;AAC1BJ,EAAAA,IAAkBI;AAAAA,GAOPC,IAAc,MAAMJ,GAMpBK,IAAeC,CAAAA,MAAAA;AAC1BN,EAAAA,IAAkBM;AAAAA;ACRb,MAAMC,EAAAA;AAAAA,EAKX,cAAYC,QAAEA,GAAMC,UAAEA,EAAAA,GAAAA;AACpB,UAAMC,IAAa,EAAA,GAAKF,EAAAA;AACxBG,SAAKC,kBAAkB,oBAAIC;AAG3B,eAAK,CAAOC,GAAKC,CAAAA,KAAUC,OAAOC,QAAQT,GACxC,KAAIO,KAASA,EAAMG,gBAAgB;AACjC,YAAMC,IAAaJ,EAAMK,OAAON,OAAOA;AACvCH,WAAKC,gBAAgBS,IAAIP,GAAKK,CAAAA;AAE9B,UAAA;AACE,cAAMG,IAASC,aAAaC,QAAQL,CAAAA;AAElCT,QAAAA,EAAWI,KADTQ,MAAW,OACKG,KAAKC,MAAMJ,KAEXP,EAAMY;AAAAA,MAE5B,QAASC;AAGPlB,QAAAA,EAAWI,CAAAA,IAAOC,EAAMY;AAAAA,MAC1B;AAAA,IACF;AAGFhB,SAAKkB,UAAUnB,GACfC,KAAKmB,aAAa,oBAAIjB,OAiDtBF,KAAKF,WAAWA,EA7CHsB,CAAAA,MAAAA;AACX,UAAIC,GACAC,IAAe,oBAAIC;AAEvB,UAAuB,OAAZH,KAAY,YAAY;AACjC,cAAMI,IAAQC,gBAAgBzB,KAAKkB,OAAAA,GAE7BQ,IAASN,EADDpB,KAAK2B,2BAA2BH,GAAOF,CAAAA,CAAAA;AAGjDI,QAAAA,KAA4B,OAAXA,KAAW,YAC9BL,IAAY,EAAA,GAAKrB,KAAKkB,SAAAA,GAAYQ,EAAAA,GAClCrB,OAAOuB,KAAKF,CAAAA,EAAQG,QAAS1B,CAAAA,MAAQmB,EAAaQ,IAAI3B,CAAAA,CAAAA,KAEtDkB,IAAYG;AAAAA,MAEhB,MACEH,CAAAA,IAAY,EAAA,GAAKrB,KAAKkB,YAAYE,EAAAA,GAClCE,IAAe,IAAIC,IAAIlB,OAAOuB,KAAKR,CAAAA,CAAAA;AAGrCpB,WAAKkB,UAAUG,GAIXrB,KAAKC,gBAAgB8B,OAAO,KAC9B/B,KAAKC,gBAAgB4B,QAAQ,CAACrB,GAAYwB,MAAAA;AAKxC,YAJgBC,MAAMC,KAAKZ,CAAAA,EAAca,KACtCC,CAAAA,MAASA,MAASJ,KAAYI,EAAKC,WAAWL,IAAW,GAAA,CAAA,EAI1D,KAAA;AACE,gBAAM5B,IAAQJ,KAAKkB,QAAQc,CAAAA;AAC3BpB,uBAAa0B,QAAQ9B,GAAYM,KAAKyB,UAAUnC,CAAAA,CAAAA;AAAAA,QAClD;QAGA;AAAA,MAAA,CAAA,GAKNJ,KAAKwC,yBAAyBlB,CAAAA;AAAAA,IAAAA,GA5CpB,MAAMtB,KAAKkB,OAAAA;AAAAA,EAgDzB;AAAA,EAUA,2BAA2BuB,GAAKnB,GAAcc,IAAO;AACnD,WAAO,IAAIM,MAAMD,GAAK,EACpBE,KAAK,CAACC,GAAQC,MAAAA;AACZ,UAAoB,OAATA,KAAS,YAAYA,MAAS,YACvC,QAAOD,EAAOC,CAAAA;AAEhB,YAAMzC,IAAQwC,EAAOC,CAAAA,GACfC,IAAWV,IAAO,GAAGA,CAAAA,IAAQS,CAAAA,KAASA;AAG5C,aAAqB,OAAVzC,KAAU,YAAYA,MAAU,OAClCJ,KAAK2B,2BAA2BvB,GAAOkB,GAAcwB,CAAAA,IAEvD1C;AAAAA,OAETM,KAAK,CAACkC,GAAQC,GAAMzC;AAClB,UAAoB,OAATyC,KAAS,YAAYA,MAAS,YAEvC,QADAD,EAAOC,CAAAA,IAAQzC;AAIjB,YAAM0C,IAAWV,IAAO,GAAGA,CAAAA,IAAQS,CAAAA,KAASA;AAI5C,aAHAvB,EAAaQ,IAAIgB,CAAAA,GAEjBF,EAAOC,CAAAA,IAAQzC,GAAAA;AAAAA,IACR,EAAA,CAAA;AAAA,EAGb;AAAA,EAKA,yBAAyBkB,GAAAA;AACvBtB,SAAKmB,WAAWU,QAAQ,CAACkB,GAAeC,MAAAA;AACjBf,YAAMC,KAAKa,GAAeZ,KAAMc,CAAAA,MAC5ChB,MAAMC,KAAKZ,CAAAA,EAAca,KAAMe,CAAAA,MAGlCD,MAAiBC,KACjBD,EAAaZ,WAAWa,IAAc,GAAA,KACtCA,EAAYb,WAAWY,IAAe,GAAA,CAAA,CAAA,KAK1BD,EAAAA;AAAAA,IAAAA,CAAAA;AAAAA,EAEtB;AAAA,EAUA,2BAA2BP,GAAKM,GAAeX,IAAO,IAAA;AACpD,WAAmB,OAARK,KAAQ,YAAYA,MAAQ,OAAaA,IAE7C,IAAIC,MAAMD,GAAK,EACpBE,KAAK,CAACC,GAAQC,MAAAA;AAEZ,UAAoB,OAATA,KAAS,YAAYA,MAAS,YACvC,QAAOD,EAAOC,CAAAA;AAEhB,YAAMC,IAAWV,IAAO,GAAGA,CAAAA,IAAQS,CAAAA,KAASA;AAC5CE,MAAAA,EAAcjB,IAAIgB,CAAAA;AAElB,YAAM1C,IAAQwC,EAAOC,CAAAA;AAGrB,aAAqB,OAAVzC,KAAU,YAAYA,MAAU,OAClCJ,KAAKmD,2BAA2B/C,GAAO2C,GAAeD,CAAAA,IAExD1C;AAAAA,IAAAA,EAAAA,CAAAA;AAAAA,EAGb;AAAA,EAKA,IAAA;AACE,UAAMhB,IAAkBE,EAAAA;AAExB,QAAA,CAAKF,EAAiB,QAAOY,KAAKkB;AAE7BlB,SAAKmB,WAAWiC,IAAIhE,CAAAA,KACvBY,KAAKmB,WAAWT,IAAItB,GAAiB,oBAAImC,KAAAA;AAE3C,UAAMwB,IAAgB/C,KAAKmB,WAAWwB,IAAIvD,CAAAA;AAK1C,WAFA2D,EAAcM,MAAAA,GAEPrD,KAAKmD,2BAA2BnD,KAAKkB,SAAS6B,CAAAA;AAAAA,EACvD;;ACjNF,IAAIO,IAAa;AACjB,MAAMC,IAAQ,oBAAIhC;AAiCX,SAASiC,EAAIC,MAAiBC,GAAAA;AACnC,MAAIC,IAAM,IACNC,IAAAA;AAGA3B,QAAM4B,QAAQJ,MAAiBA,EAAaE,MAC9CA,IAAMF,EAAaK,OAAO,CAACC,GAAKC,GAAKC,MAC5BF,IAAMC,KAAON,EAAKO,CAAAA,KAAM,KAC9B,EAAA,KAEHN,IAAMF,GAENG,IAAeF,EAAK,CAAA,MAApBE;AAEF,MAAIM,KA5BN,SAAgBV,GAAAA;AACd,WAAOA,EACJW,QAAQ,qBAAqB,EAAA,EAC7BA,QAAQ,QAAQ,KAChBC,KAAAA;AAAAA,EACL,GAuBuBT,CAAAA;AAErB,OAAKO,EAAS,QAAO;AAEjBN,QAYFM,IAAUA,EAAQC,QAChB,sFACA,aAAA;AAIJ,QAAME,KAhER,SAAoBL,GAAAA;AAClB,QAAIK,IAAO,MACPJ,IAAID,EAAIM;AACZ,WAAOL,IACLI,CAAAA,IAAe,KAAPA,IAAaL,EAAIO,WAAAA,EAAaN,CAAAA;AAExC,YAAQI,MAAS,GAAGG,SAAS;EAC/B,GAyD0BN,CAAAA,GAClBO,IAAkB,QAAQJ,CAAAA;AAEhC,SAAId,EAAMH,IAAIiB,OAITf,MACHA,IAAaoB,SAASC,cAAc,OAAA,GACpCrB,EAAWsB,KAAK,eAChBF,SAASG,KAAKC,YAAYxB,CAAAA,IAG5BA,EAAWyB,eAAe,IAAIN,CAAAA;AAAAA,MAC1BP,CAAAA;AAAAA;AAAAA,GAEJX,EAAMzB,IAAIuC,CAAAA,IAZDI;AAeX;AC9EY,MAACO,IAAI,CAACC,GAAKC,IAAQ,CAAA,GAAIC,IAAW,CAAA,OAQrC,EACLF,QACAC,OAAAA,GACAC,WAViBlD,MAAM4B,QAAQsB,KAAYA,IAAW,CAACA,CAAAA,GAItDC,KAAAA,EACAC,OAAQC,CAAAA,MAAMA,KAAAA,QAAiCA,MAAjCA,MAAgDA,MAAM,EAANA,EAAAA;ACZ5D,SAASC,EAAQC;AACtB,QAAMC,IAAWhG,EAAAA;AACbgG,EAAAA,KACFA,EAASC,OAAOC,KAAKH,CAAAA;AAEzB;AAMO,SAASI,EAAUJ,GAAAA;AACxB,QAAMC,IAAWhG,EAAAA;AACbgG,EAAAA,KACFA,EAASI,SAASF,KAAKH,CAAAA;AAE3B;AClBA,SAASM,EAAaC;AACpB,SAAIA,EAAOC,iBAAiBC,KAAUF,EAAOG,YAAY,kBAChDD,IAELF,EAAOC,iBAAiBG,IACnBA,IAEF;AACT;AAOO,SAASC,EAAQjB,GAAAA;AACtB,SAAOA,KAAYA,EAAShD,KAAMmD,OAAMA,KAAKA,EAAEJ,SAASI,EAAEJ,MAAM/E,OAAO,IAAPA;AAClE;AAEA,MAAM8F,IAAS,8BACTE,IAAU;AAOhB,SAASxB,EAAc0B,GAAOC,GAAAA;AAC5B,MAAqB,OAAVD,KAAU,YAA6B,OAAVA,KAAU,SAChD,QAAO3B,SAAS6B,eAAeC,OAAOH,CAAAA,CAAAA;AAGxC,MAAyB,OAAdA,EAAMpB,OAAQ,YAAY;AACnC,UAAMwB,IAAaC,EAAgBL,CAAAA;AACnCA,IAAAA,EAAMM,QAAQF;AAEd,UAAMG,IAAKjC,EAAc8B,GAAYH,CAAAA;AAMrC,WAJAD,EAAMO,KAAKA,GACPP,EAAMQ,OAAOnB,OAAOpB,SAAS,KAC/BwC,WAAW,MAAMT,EAAMQ,MAAMnB,OAAO7D,QAAS2D,CAAAA,MAAOA,EAAAA,CAAAA,GAAO,IAEtDoB;AAAAA,EACT;AAIA,QAAM3B,IAAMoB,EAAMpB;AAGN,EAARA,MAAQ,QAAOqB,IAAYL,IACtBhB,MAAQ,WAAQqB,IAAYH;AAMrC,QAAMY,IAAUT,IACZ5B,SAASsC,gBAAgBV,GAAWrB,CAAAA,IACpCP,SAASC,cAAcM;AAE3BoB,EAAAA,EAAMO,KAAKG,GACXE,EAAWF,GAASV,EAAMnB,KAAAA;AAG1B,QAAMgC,IAAUjC,MAAQ,kBAAkB,OAAOqB;AAMjD,SAJAD,EAAMlB,SAAStD,QAAS8E,CAAAA,MAAAA;AACtBI,MAAQjC,YAAYH,EAAcgC,GAAOO;MAGpCH;AACT;AAYA,SAASE,EAAWF,GAASI,IAAW,CAAA,GAAIC,IAAW,CAAA,GAAA;AACrD,MAAA,CAAKL,EAAS;AAEd,QAAMM,IAAW,EAAA,GAAKD,GAAAA,GAAaD;AAEnC,aAAWhH,KAAOkH,GAAU;AAC1B,UAAMC,IAAWF,EAASjH,IACpBoH,IAAWJ,EAAShH,CAAAA;AAG1B,aAAIoH,KAOJ,KAAIpH,MAAQ,WAAWA,MAAQ;AAS/B,UAAImH,MAAaC,GAAjB;AAKA,YAAIpH,EAAIkC,WAAW,IAAA,GAAO;AACxB,gBAAMmF,IAAYrH,EAAIsH,MAAM,GAAGC,YAAAA;AAC3BJ,UAAAA,KAAUP,EAAQY,oBAAoBH,GAAWF,CAAAA,GACrDP,EAAQa,iBAAiBJ,GAAWD,CAAAA;AAAAA,QACtC;AAEY,QAARpH,MAAQ,aACV4G,EAAQc,WAAWN,MAAXM,MAAgCN,MAAa,SAIrDR,EAAQe,aAAa3H,GAAKoH;MAhBD;AAAA,UARrBR,CAAAA,EAAQ5G,CAAAA,MAASoH,MACnBR,EAAQ5G,CAAAA,IAAOoH;AAAAA,QARjBR,CAAAA,EAAQgB,gBAAgB5H,CAAAA;AAAAA,EAiC5B;AACF;AAcA,SAAS6H,EAAkBjC,GAAQkC,GAAaC,GAAAA;AAK9C,MAAA,EAJgB9B,EAAQ6B,CAAAA,KAAgB7B,EAAQ8B,CAAAA,IAIlC;AACZ,UAAMC,IAASC,KAAKC,IAAIJ,EAAY3D,QAAQ4D,EAAY5D,MAAAA;AACxD,aAASL,IAAI,GAAGA,IAAIkE,GAAQlE,IAC1BqE,CAAAA,EAAMvC,GAAQkC,EAAYhE,CAAAA,GAAIiE,EAAYjE,CAAAA,GAAIA,CAAAA;AAEhD;AAAA,EACF;GAaF,SAAgC8B,GAAQkC,GAAaC,GAAAA;AAEnD,UAAMK,IAAQ,CAAA;AACdL,IAAAA,EAAYrG,QAAQ,CAAC8E,GAAO1C,MAAAA;AAC1B,YAAM9D,KAAOwG,EAAMzB,SAASyB,EAAMzB,MAAM/E,QAAQ,OAAOwG,EAAMzB,MAAM/E,MAAM8D;AACzEsE,MAAAA,EAAMpI,CAAAA,IAAO,EAAEkG,OAAOM,GAAO6B,OAAOvE,EAAAA;AAAAA,IAAAA,CAAAA,GAGtCgE,EAAYpG,QAAQ,CAAC4G,GAAUxE,MAAAA;AAC7B,YAAM9D,KACHsI,EAASvD,SAASuD,EAASvD,MAAM/E,QAAQ,OAAOsI,EAASvD,MAAM/E,MAAM8D,GAClEyE,IAAqBH,EAAMpI,CAAAA;AAEjC,UAAIuI,GAAoB;AAEtB,cAAMC,IAAWD,EAAmBrC;AAGpCiC,QAAAA,EAAMvC,GAAQ0C,GAAUE,GAAU1E,CAAAA;AAIlC,cAAM8C,IAAU0B,EAAS7B,MAAM+B,EAAS/B,IAGlCgC,IAAkB7C,EAAO8C,WAAW5E,CAAAA;AAGtC8C,QAAAA,KAAW6B,MAAoB7B,KACjChB,EAAO+C,aAAa/B,GAAS6B,WAKxBL,EAAMpI,CAAAA;AAAAA,MACf,OAAO;AAEL,cAAM4I,IAAapE,EAAc8D,GAAU3C,EAAaC,CAAAA,CAAAA,GAClD6C,IAAkB7C,EAAO8C,WAAW5E;AAEtC2E,QAAAA,IACF7C,EAAO+C,aAAaC,GAAYH,CAAAA,IAEhC7C,EAAOjB,YAAYiE,CAAAA;AAAAA,MAEvB;AAAA,QAIF1I,OAAO2I,OAAOT,CAAAA,EAAO1G,QAAQ,CAAA,EAAGwE,OAAAA,EAAAA,MAAAA;AAC1BA,MAAAA,EAAMO,MAAMP,EAAMO,GAAGqC,eAAelD,MACtCmD,EAAW7C,IACXN,EAAOoD,YAAY9C,EAAMO,EAAAA;AAAAA,IAAAA,CAAAA;AAAAA,EAI/B,GAnEyBb,GAAQkC,GAAaC,CAAAA;AAC9C;AAyEA,SAASxB,EAAgBL,GAAAA;AAIvB,QAAMQ,IAAQ,EACZnB,QAAQ,CAAA,GACRG,UAAU,CAAA,EAAA;AAIZnG,EAAAA,EAAYmH,CAAAA;AAIZ,QAAMuC,IAAgB/C,EAAMpB,IAAIoB,EAAMnB,KAAAA;AAQtC,SALAxF,EAAY,IAAA,GAGZ2G,EAAMQ,QAAQA,GAEPuC;AACT;AAMA,SAASF,EAAW7C,GAAAA;AACbA,EAAAA,MAGDA,EAAMQ,SAASR,EAAMQ,MAAMhB,YAC7BQ,EAAMQ,MAAMhB,SAAShE,QAAS2D,OAAOA,EAAAA,CAAAA,GAInCa,EAAMM,SACRuC,EAAW7C,EAAMM,KAAAA,GAIfN,EAAMlB,YACRkB,EAAMlB,SAAStD,QAAQqH;AAE3B;AASO,SAASZ,EAAMvC,GAAQsD,GAAUV,GAAUH,IAAQ,GAAA;AAIxD,MAAIa,KAAAA,MAA6C;AAC/C,UAAMzC,IAAK+B,EAAS/B,MAAMb,EAAO8C,WAAWL,CAAAA;AAS5C,WANAU,EAAWP,CAAAA,GAAAA,MAEP/B,KACFb,EAAOoD,YAAYvC,CAAAA;AAAAA,EAIvB;AAGA,aAAWyC,EAASpE,OAAQ,YAAY;AACtC,UAAMqE,KAASX,GAETlC,IAAaC,EAAgB2C,CAAAA;AACnCA,WAAAA,EAAS1C,QAAQF,GAGjB6B,EAAMvC,GAAQU,GADGkC,IAAWA,EAAShC,gBACD6B,CAAAA,GAEpCa,EAASzC,KAAKH,EAAWG,IAAAA,MAGrB0C,KAASD,EAASxC,SAASwC,EAASxC,MAAMnB,OAAOpB,SAAS,KAC5DwC,WAAW,MAAA;AACTuC,MAAAA,EAASxC,MAAMnB,OAAO7D,QAAS2D,CAAAA,MAAOA,EAAAA,CAAAA;AAAAA,IAAAA,GACrC,CAAA;AAAA,EAIP;AAGA,MAAImD,KAAAA,KAEF,QAAA,KADA5C,EAAOjB,YAAYH,EAAc0E,GAAUvD,EAAaC,CAAAA,CAAAA,CAAAA;AAK1D,MAAA,OACSsD,KAAAA,OAAoBV,YACnBU,KAAa,YAAYA,EAASpE,QAAQ0D,EAAS1D,KAC3D;AACA,UAAM2B,IAAK+B,EAAS/B,MAAMb,EAAO8C,WAAWL,CAAAA;AAK5C,WAAA,MAJI5B,KACFb,EAAOwD,aAAa5E,EAAc0E,GAAUvD,EAAaC,CAAAA,CAAAA,GAAUa,CAAAA;AAAAA,EAIvE;AAGA,MAAwB,OAAbyC,KAAa,YAAgC,OAAbA,KAAa,UAAU;AAChE,QAAIA,MAAaV,GAAU;AACzB,YAAM/B,IAAKb,EAAO8C,WAAWL;AACzB5B,MAAAA,IACFA,EAAG4C,YAAYhD,OAAO6C,KAItBtD,EAAOjB,YAAYJ,SAAS6B,eAAeC,OAAO6C,CAAAA,CAAAA,CAAAA;AAAAA,IAEtD;AACA;AAAA,EACF;AAGA,QAAMzC,IAAK+B,EAAS/B,MAAMb,EAAO8C,WAAWL,CAAAA;AAEvC5B,QAGLyC,EAASzC,KAAKA,GAEdK,EAAWL,GAAIyC,EAASnE,OAAOyD,EAASzD,KAAAA,GAExC8C,EAAkBpB,GAAIyC,EAASlE,UAAUwD,EAASxD,QAAAA;AACpD;AC7WY,MAACsE,IAAQ,CAAC7G,GAAQ8G;AAC5B,MAAIC,IAAY;AAEhB,QAAMC,IAAY,MAAA;AAChBrK,IAAAA,EAAYqK,CAAAA;AAEZ,UAAMC,IAAY,EAChB5E,KAAKyE,GACLxE,OAAO,CAAA,GACPC,UAAU,CAAA,EAAA;AAGZmD,IAAAA,EAAM1F,GAAQiH,GAAWF,CAAAA,GACzBpK,EAAY,OACZoK,IAAYE;AAAAA,EAAAA;AAGdD,EAAAA,EAAAA;AAAAA,GCVWE,IAAU,CAAC9I,GAASP,IAAS,QAAE,EAC1CF,gBAAAA,IACAS,SAAAA,GACAP;"}

package/dist/humn.umd.js

@@ -1,5 +1,5 @@
-(function(a,h){typeof exports=="object"&&typeof module<"u"?h(exports):typeof define=="function"&&define.amd?define(["exports"],h):h((a=typeof globalThis<"u"?globalThis:a||self).Humn={})})(this,function(a){"use strict";let h=null,_=null;const T=()=>h,k=t=>{h=t},b=()=>_,v=t=>{_=t};let p=null;const x=new Set;function C(t){return t&&t.some(e=>e&&e.props&&e.props.key!=null)}function d(t){if(typeof t=="string"||typeof t=="number")return document.createTextNode(String(t));if(typeof t.tag=="function"){const n=S(t);t.child=n;const s=d(n);return t.el=s,t.hooks&&t.hooks.mounts.length>0&&setTimeout(()=>t.hooks.mounts.forEach(o=>o()),0),s}const e=document.createElement(t.tag);return t.el=e,E(e,t.props),t.children.forEach(n=>{e.appendChild(d(n))}),e}function E(t,e={},n={}){if(!t)return;const s={...n,...e};for(const o in s){const r=n[o],i=e[o];if(i!=null)if(o!=="value"&&o!=="checked"){if(r!==i){if(o.startsWith("on")){const c=o.slice(2).toLowerCase();r&&t.removeEventListener(c,r),t.addEventListener(c,i)}o==="disabled"?t.disabled=i===!0||i==="true":t.setAttribute(o,i)}}else t[o]!==i&&(t[o]=i);else t.removeAttribute(o)}}function $(t,e,n){if(!(C(e)||C(n))){const s=Math.max(e.length,n.length);for(let o=0;o<s;o++)g(t,e[o],n[o],o);return}(function(s,o,r){const i={};r.forEach((c,l)=>{const u=(c.props&&c.props.key)!=null?c.props.key:l;i[u]={vNode:c,index:l}}),o.forEach((c,l)=>{const u=(c.props&&c.props.key)!=null?c.props.key:l,N=i[u];if(N){const y=N.vNode;g(s,c,y,l);const f=c.el||y.el,A=s.childNodes[l];f&&A!==f&&s.insertBefore(f,A),delete i[u]}else{const y=d(c),f=s.childNodes[l];f?s.insertBefore(y,f):s.appendChild(y)}}),Object.values(i).forEach(({vNode:c})=>{c.el&&c.el.parentNode===s&&(m(c),s.removeChild(c.el))})})(t,e,n)}function S(t){const e={mounts:[],cleanups:[]};v(e);const n=t.tag(t.props);return v(null),t.hooks=e,n}function m(t){t&&(t.hooks&&t.hooks.cleanups&&t.hooks.cleanups.forEach(e=>e()),t.child&&m(t.child),t.children&&t.children.forEach(m))}function g(t,e,n,s=0){if(e==null){const r=n.el||t.childNodes[s];return m(n),void(r&&t.removeChild(r))}if(typeof e.tag=="function"){const r=!n,i=S(e);return e.child=i,g(t,i,n?n.child:void 0,s),e.el=i.el,void(r&&e.hooks&&e.hooks.mounts.length>0&&setTimeout(()=>{e.hooks.mounts.forEach(c=>c())},0))}if(n==null)return void t.appendChild(d(e));if(typeof e!=typeof n||typeof e!="string"&&e.tag!==n.tag){const r=n.el||t.childNodes[s];return void(r&&t.replaceChild(d(e),r))}if(typeof e=="string"||typeof e=="number"){if(e!==n){const r=t.childNodes[s];r?r.nodeValue=String(e):t.appendChild(document.createTextNode(String(e)))}return}const o=n.el||t.childNodes[s];o&&(e.el=o,E(o,e.props,n.props),$(o,e.children,n.children))}a.Cortex=class{constructor({memory:t,synapses:e}){const n={...t};this._persistenceMap=new Map;for(const[s,o]of Object.entries(t))if(o&&o.__humn_persist){const r=o.config.key||s;this._persistenceMap.set(s,r);try{const i=localStorage.getItem(r);n[s]=i!==null?JSON.parse(i):o.initial}catch{n[s]=o.initial}}this._memory=n,this._listeners=new Map,this.synapses=e(s=>{let o,r=new Set;if(typeof s=="function"){const i=structuredClone(this._memory),c=s(this._createChangeTrackingProxy(i,r));c&&typeof c=="object"?(o={...this._memory,...c},Object.keys(c).forEach(l=>r.add(l))):o=i}else o={...this._memory,...s},r=new Set(Object.keys(s));this._memory=o,this._persistenceMap.size>0&&this._persistenceMap.forEach((i,c)=>{if(Array.from(r).some(l=>l===c||l.startsWith(c+".")))try{const l=this._memory[c];localStorage.setItem(i,JSON.stringify(l))}catch{}}),this._notifyRelevantListeners(r)},()=>this._memory)}_createChangeTrackingProxy(t,e,n=""){return new Proxy(t,{get:(s,o)=>{if(typeof o=="symbol"||o==="__proto__")return s[o];const r=s[o],i=n?`${n}.${o}`:o;return typeof r=="object"&&r!==null?this._createChangeTrackingProxy(r,e,i):r},set:(s,o,r)=>{if(typeof o=="symbol"||o==="__proto__")return s[o]=r,!0;const i=n?`${n}.${o}`:o;return e.add(i),s[o]=r,!0}})}_notifyRelevantListeners(t){this._listeners.forEach((e,n)=>{Array.from(e).some(s=>Array.from(t).some(o=>s===o||s.startsWith(o+".")||o.startsWith(s+".")))&&n()})}_createAccessTrackingProxy(t,e,n=""){return typeof t!="object"||t===null?t:new Proxy(t,{get:(s,o)=>{if(typeof o=="symbol"||o==="__proto__")return s[o];const r=n?`${n}.${o}`:o;e.add(r);const i=s[o];return typeof i=="object"&&i!==null?this._createAccessTrackingProxy(i,e,r):i}})}get memory(){const t=T();if(!t)return this._memory;this._listeners.has(t)||this._listeners.set(t,new Set);const e=this._listeners.get(t);return e.clear(),this._createAccessTrackingProxy(this._memory,e)}},a.css=function(t,...e){let n="",s=!1;Array.isArray(t)&&t.raw?n=t.reduce((c,l,u)=>c+l+(e[u]||""),""):(n=t,s=e[0]===!0);let o=(function(c){return c.replace(/\/\*[\s\S]*?\*\//g,"").replace(/\s+/g," ").trim()})(n);if(!o)return"";s&&(o=o.replace(/(^|[{};,])(\s*)(?!from|to)((?:[.#]?[\w-]+|\[[^\]]+\]|:{1,2}[^:,{\s]+)+)(?=\s*\{)/gi,"$1$2$3&, $3"));const r=(function(c){let l=5381,u=c.length;for(;u;)l=33*l^c.charCodeAt(--u);return(l>>>0).toString(36)})(o),i=`humn-${r}`;return x.has(r)||(p||(p=document.createElement("style"),p.id="humn-styles",document.head.appendChild(p)),p.textContent+=`.${i} { 
-    ${o} 
+(function(a,h){typeof exports=="object"&&typeof module<"u"?h(exports):typeof define=="function"&&define.amd?define(["exports"],h):h((a=typeof globalThis<"u"?globalThis:a||self).Humn={})})(this,function(a){"use strict";let h=null,v=null;const j=()=>h,w=t=>{h=t},x=()=>v,C=t=>{v=t};let p=null;const E=new Set;function _(t){return t.namespaceURI===b&&t.tagName!=="foreignObject"?b:t.namespaceURI===k?k:null}function N(t){return t&&t.some(e=>e&&e.props&&e.props.key!=null)}const b="http://www.w3.org/2000/svg",k="http://www.w3.org/1998/Math/MathML";function d(t,e){if(typeof t=="string"||typeof t=="number")return document.createTextNode(String(t));if(typeof t.tag=="function"){const r=A(t);t.child=r;const i=d(r,e);return t.el=i,t.hooks?.mounts.length>0&&setTimeout(()=>t.hooks.mounts.forEach(c=>c()),0),i}const s=t.tag;s==="svg"?e=b:s==="math"&&(e=k);const o=e?document.createElementNS(e,s):document.createElement(s);t.el=o,S(o,t.props);const n=s==="foreignObject"?null:e;return t.children.forEach(r=>{o.appendChild(d(r,n))}),o}function S(t,e={},s={}){if(!t)return;const o={...s,...e};for(const n in o){const r=s[n],i=e[n];if(i!=null)if(n!=="value"&&n!=="checked"){if(r!==i){if(n.startsWith("on")){const c=n.slice(2).toLowerCase();r&&t.removeEventListener(c,r),t.addEventListener(c,i)}n==="disabled"?t.disabled=i===!0||i==="true":t.setAttribute(n,i)}}else t[n]!==i&&(t[n]=i);else t.removeAttribute(n)}}function M(t,e,s){if(!(N(e)||N(s))){const o=Math.max(e.length,s.length);for(let n=0;n<o;n++)g(t,e[n],s[n],n);return}(function(o,n,r){const i={};r.forEach((c,l)=>{const u=(c.props&&c.props.key)!=null?c.props.key:l;i[u]={vNode:c,index:l}}),n.forEach((c,l)=>{const u=(c.props&&c.props.key)!=null?c.props.key:l,T=i[u];if(T){const m=T.vNode;g(o,c,m,l);const f=c.el||m.el,$=o.childNodes[l];f&&$!==f&&o.insertBefore(f,$),delete i[u]}else{const m=d(c,_(o)),f=o.childNodes[l];f?o.insertBefore(m,f):o.appendChild(m)}}),Object.values(i).forEach(({vNode:c})=>{c.el&&c.el.parentNode===o&&(y(c),o.removeChild(c.el))})})(t,e,s)}function A(t){const e={mounts:[],cleanups:[]};C(e);const s=t.tag(t.props);return C(null),t.hooks=e,s}function y(t){t&&(t.hooks&&t.hooks.cleanups&&t.hooks.cleanups.forEach(e=>e()),t.child&&y(t.child),t.children&&t.children.forEach(y))}function g(t,e,s,o=0){if(e==null){const r=s.el||t.childNodes[o];return y(s),void(r&&t.removeChild(r))}if(typeof e.tag=="function"){const r=!s,i=A(e);return e.child=i,g(t,i,s?s.child:void 0,o),e.el=i.el,void(r&&e.hooks&&e.hooks.mounts.length>0&&setTimeout(()=>{e.hooks.mounts.forEach(c=>c())},0))}if(s==null)return void t.appendChild(d(e,_(t)));if(typeof e!=typeof s||typeof e!="string"&&e.tag!==s.tag){const r=s.el||t.childNodes[o];return void(r&&t.replaceChild(d(e,_(t)),r))}if(typeof e=="string"||typeof e=="number"){if(e!==s){const r=t.childNodes[o];r?r.nodeValue=String(e):t.appendChild(document.createTextNode(String(e)))}return}const n=s.el||t.childNodes[o];n&&(e.el=n,S(n,e.props,s.props),M(n,e.children,s.children))}a.Cortex=class{constructor({memory:t,synapses:e}){const s={...t};this._persistenceMap=new Map;for(const[o,n]of Object.entries(t))if(n&&n.__humn_persist){const r=n.config.key||o;this._persistenceMap.set(o,r);try{const i=localStorage.getItem(r);s[o]=i!==null?JSON.parse(i):n.initial}catch{s[o]=n.initial}}this._memory=s,this._listeners=new Map,this.synapses=e(o=>{let n,r=new Set;if(typeof o=="function"){const i=structuredClone(this._memory),c=o(this._createChangeTrackingProxy(i,r));c&&typeof c=="object"?(n={...this._memory,...c},Object.keys(c).forEach(l=>r.add(l))):n=i}else n={...this._memory,...o},r=new Set(Object.keys(o));this._memory=n,this._persistenceMap.size>0&&this._persistenceMap.forEach((i,c)=>{if(Array.from(r).some(l=>l===c||l.startsWith(c+".")))try{const l=this._memory[c];localStorage.setItem(i,JSON.stringify(l))}catch{}}),this._notifyRelevantListeners(r)},()=>this._memory)}_createChangeTrackingProxy(t,e,s=""){return new Proxy(t,{get:(o,n)=>{if(typeof n=="symbol"||n==="__proto__")return o[n];const r=o[n],i=s?`${s}.${n}`:n;return typeof r=="object"&&r!==null?this._createChangeTrackingProxy(r,e,i):r},set:(o,n,r)=>{if(typeof n=="symbol"||n==="__proto__")return o[n]=r,!0;const i=s?`${s}.${n}`:n;return e.add(i),o[n]=r,!0}})}_notifyRelevantListeners(t){this._listeners.forEach((e,s)=>{Array.from(e).some(o=>Array.from(t).some(n=>o===n||o.startsWith(n+".")||n.startsWith(o+".")))&&s()})}_createAccessTrackingProxy(t,e,s=""){return typeof t!="object"||t===null?t:new Proxy(t,{get:(o,n)=>{if(typeof n=="symbol"||n==="__proto__")return o[n];const r=s?`${s}.${n}`:n;e.add(r);const i=o[n];return typeof i=="object"&&i!==null?this._createAccessTrackingProxy(i,e,r):i}})}get memory(){const t=j();if(!t)return this._memory;this._listeners.has(t)||this._listeners.set(t,new Set);const e=this._listeners.get(t);return e.clear(),this._createAccessTrackingProxy(this._memory,e)}},a.css=function(t,...e){let s="",o=!1;Array.isArray(t)&&t.raw?s=t.reduce((c,l,u)=>c+l+(e[u]||""),""):(s=t,o=e[0]===!0);let n=(function(c){return c.replace(/\/\*[\s\S]*?\*\//g,"").replace(/\s+/g," ").trim()})(s);if(!n)return"";o&&(n=n.replace(/(^|[{};,])(\s*)(?!from|to)((?:[.#]?[\w-]+|\[[^\]]+\]|:{1,2}[^:,{\s]+)+)(?=\s*\{)/gi,"$1$2$3&, $3"));const r=(function(c){let l=5381,u=c.length;for(;u;)l=33*l^c.charCodeAt(--u);return(l>>>0).toString(36)})(n),i=`humn-${r}`;return E.has(r)||(p||(p=document.createElement("style"),p.id="humn-styles",document.head.appendChild(p)),p.textContent+=`.${i} { 
+    ${n} 
   }
-`,x.add(r)),i},a.h=(t,e={},n=[])=>({tag:t,props:e,children:(Array.isArray(n)?n:[n]).flat().filter(s=>s!=null&&s!==!1&&s!=="")}),a.mount=(t,e)=>{let n=null;const s=()=>{k(s);const o={tag:e,props:{},children:[]};g(t,o,n),k(null),n=o};s()},a.onCleanup=function(t){const e=b();e&&e.cleanups.push(t)},a.onMount=function(t){const e=b();e&&e.mounts.push(t)},a.persist=(t,e={})=>({__humn_persist:!0,initial:t,config:e}),Object.defineProperty(a,Symbol.toStringTag,{value:"Module"})});
+`,E.add(r)),i},a.h=(t,e={},s=[])=>({tag:t,props:e,children:(Array.isArray(s)?s:[s]).flat().filter(o=>o!=null&&o!==!1&&o!=="")}),a.mount=(t,e)=>{let s=null;const o=()=>{w(o);const n={tag:e,props:{},children:[]};g(t,n,s),w(null),s=n};o()},a.onCleanup=function(t){const e=x();e&&e.cleanups.push(t)},a.onMount=function(t){const e=x();e&&e.mounts.push(t)},a.persist=(t,e={})=>({__humn_persist:!0,initial:t,config:e}),Object.defineProperty(a,Symbol.toStringTag,{value:"Module"})});
 //# sourceMappingURL=humn.umd.js.map

package/dist/humn.umd.js.map

@@ -1 +1 @@
-{"version":3,"file":"humn.umd.js","sources":["../src/observer.js","../src/css.js","../src/patch.js","../src/persist.js","../src/cortex.js","../src/h.js","../src/mount.js","../src/lifecycle.js"],"sourcesContent":["/**\n * @file Observer module for tracking global state during rendering.\n * @module observer\n */\n\nlet currentObserver = null // For Cortex/State dependency\nlet currentInstance = null // For Lifecycle Hooks\n\n/**\n * Gets the current observer (render function).\n * @returns {function|null}\n */\nexport const getObserver = () => currentObserver\n\n/**\n * Sets the current observer.\n * @param {function|null} obs\n */\nexport const setObserver = (obs) => {\n  currentObserver = obs\n}\n\n/**\n * Gets the current component instance (hook container).\n * @returns {object|null}\n */\nexport const getInstance = () => currentInstance\n\n/**\n * Sets the current component instance.\n * @param {object|null} inst\n */\nexport const setInstance = (inst) => {\n  currentInstance = inst\n}\n","/**\n * @file Runtime Scoped CSS implementation using Native CSS Nesting.\n * @module css\n */\n\nlet styleSheet = null\nconst cache = new Set()\n\n/**\n * Simple DJB2 hashing function.\n */\nfunction hashString(str) {\n  let hash = 5381\n  let i = str.length\n  while (i) {\n    hash = (hash * 33) ^ str.charCodeAt(--i)\n  }\n  return (hash >>> 0).toString(36)\n}\n\n/**\n * Lightweight Runtime Minifier.\n * Removes comments and collapses whitespace.\n * We do not strip spaces around colons/brackets to ensure safety for calc().\n */\nfunction minify(css) {\n  return css\n    .replace(/\\/\\*[\\s\\S]*?\\*\\//g, '') // Remove comments\n    .replace(/\\s+/g, ' ') // Collapse newlines/tabs to single space\n    .trim() // Remove leading/trailing\n}\n\n/**\n * Scoped CSS Tag.\n * Wraps content in a unique class using Native CSS Nesting.\n * Supports two signatures:\n * 1. Tagged Template: css`...`\n * 2. Function: css(string, isSingleRoot)\n */\nexport function css(stringsOrStr, ...args) {\n  let raw = ''\n  let isSingleRoot = false\n\n  // Detect usage of Tagged Template vs Function Call\n  if (Array.isArray(stringsOrStr) && stringsOrStr.raw) {\n    raw = stringsOrStr.reduce((acc, str, i) => {\n      return acc + str + (args[i] || '')\n    }, '')\n  } else {\n    raw = stringsOrStr\n    // If called as function, the first arg is our boolean flag\n    isSingleRoot = args[0] === true\n  }\n  let content = minify(raw)\n\n  if (!content) return ''\n\n  if (isSingleRoot) {\n    // Transforms selectors to apply to BOTH the root (using &) AND descendants.\n    // e.g. \"div\" -> \"div&, div\"\n\n    // Regex Breakdown:\n    // 1. (^|[{};,])      -> Hard Start (Line start, brace, semi, comma)\n    // 2. (\\s*)           -> Whitespace\n    // 3. (?!from|to)     -> Negative Lookahead: Ignore 'from'/'to' (keyframes)\n    // 4. ( ... )+        -> Compound Selector:\n    //    (?:[.#]?[\\w-]+ ... ) -> Matches tags (div), classes (.class), ids (#id)\n    // 5. (?=\\s*\\{)       -> Lookahead: Must be followed by {\n\n    content = content.replace(\n      /(^|[{};,])(\\s*)(?!from|to)((?:[.#]?[\\w-]+|\\[[^\\]]+\\]|:{1,2}[^:,{\\s]+)+)(?=\\s*\\{)/gi,\n      '$1$2$3&, $3',\n    )\n  }\n\n  const hash = hashString(content)\n  const hashedClassName = `humn-${hash}`\n\n  if (cache.has(hash)) {\n    return hashedClassName\n  }\n\n  if (!styleSheet) {\n    styleSheet = document.createElement('style')\n    styleSheet.id = 'humn-styles'\n    document.head.appendChild(styleSheet)\n  }\n\n  styleSheet.textContent += `.${hashedClassName} { \n    ${content} \n  }\\n`\n  cache.add(hash)\n\n  return hashedClassName\n}\n","/**\n * @file This file contains the diffing and patching algorithm for the virtual DOM,\n * including support for Keyed Diffing.\n * @module patch\n */\nimport { track } from './metrics.js'\nimport { setInstance } from './observer.js'\n\n/**\n * Checks if a list of children contains keys.\n * @param {Array<import(\"./h.js\").VNode>} children - The list of VNodes.\n * @returns {boolean} True if keys are present.\n */\nexport function hasKeys(children) {\n  return children && children.some((c) => c && c.props && c.props.key != null)\n}\n\n/**\n * Creates a real DOM element from a virtual node.\n * @param {import(\"./h.js\").VNode | string | number} vNode - The virtual node.\n * @returns {Text | HTMLElement} The created DOM element.\n */\nfunction createElement(vNode) {\n  if (typeof vNode === 'string' || typeof vNode === 'number') {\n    return document.createTextNode(String(vNode))\n  }\n\n  if (typeof vNode.tag === 'function') {\n    const childVNode = renderComponent(vNode)\n    vNode.child = childVNode\n\n    // Recursively create the DOM for the child\n    const el = createElement(childVNode)\n    vNode.el = el\n\n    // Queue Mount Hooks\n    if (vNode.hooks && vNode.hooks.mounts.length > 0) {\n      setTimeout(() => vNode.hooks.mounts.forEach((fn) => fn()), 0)\n    }\n    return el\n  }\n\n  track('elementsCreated')\n\n  const el = document.createElement(vNode.tag)\n  vNode.el = el\n  patchProps(el, vNode.props)\n\n  vNode.children.forEach((child) => {\n    el.appendChild(createElement(child))\n  })\n\n  return el\n}\n\n/**\n * Updates the properties (attributes/events) of a DOM element.\n * @param {HTMLElement} el - The DOM element to update.\n * @param {object} [newProps={}] - The new properties.\n * @param {object} [oldProps={}] - The old properties.\n *\n * WHY: We check against the LIVE DOM value for inputs (value/checked) to prevent\n * the \"cursor jumping\" bug. If we just blindly set the attribute, the browser\n * might reset the cursor position to the end of the input.\n */\nfunction patchProps(el, newProps = {}, oldProps = {}) {\n  if (!el) return\n\n  const allProps = { ...oldProps, ...newProps }\n\n  for (const key in allProps) {\n    const oldValue = oldProps[key]\n    const newValue = newProps[key]\n\n    // Handle removed props\n    if (newValue === undefined || newValue === null) {\n      el.removeAttribute(key)\n      track('patches')\n      continue\n    }\n\n    // We check against the LIVE DOM value to prevent cursor jumping\n    if (key === 'value' || key === 'checked') {\n      if (el[key] !== newValue) {\n        el[key] = newValue\n        track('patches')\n      }\n      continue\n    }\n\n    // If prop hasn't changed, skip\n    if (oldValue === newValue) continue\n\n    track('patches')\n\n    // Handle Events\n    if (key.startsWith('on')) {\n      const eventName = key.slice(2).toLowerCase()\n      if (oldValue) el.removeEventListener(eventName, oldValue)\n      el.addEventListener(eventName, newValue)\n    }\n    // Handle the disabled attribute\n    if (key === 'disabled') {\n      el.disabled = newValue === true || newValue === 'true'\n    }\n    // Handle standard attributes\n    else {\n      el.setAttribute(key, newValue)\n    }\n  }\n}\n\n/**\n * Reconciles the children of a node, handling both simple lists and keyed reordering.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {Array<import(\"./h.js\").VNode>} newChildren - The new list of children.\n * @param {Array<import(\"./h.js\").VNode>} oldChildren - The old list of children.\n *\n * WHY: This is the most complex part of the VDOM. We need to efficiently update\n * a list of items. Without keys, we just update index-by-index, which is fast\n * but causes issues if items are reordered (state gets mixed up).\n * With keys, we can track items as they move around, preserving their state\n * and minimizing DOM operations.\n */\nfunction reconcileChildren(parent, newChildren, oldChildren) {\n  const isKeyed = hasKeys(newChildren) || hasKeys(oldChildren)\n\n  // If no keys are used, use the fast index-based simple loop.\n  // This is faster for static lists or simple text replacements.\n  if (!isKeyed) {\n    const maxLen = Math.max(newChildren.length, oldChildren.length)\n    for (let i = 0; i < maxLen; i++) {\n      patch(parent, newChildren[i], oldChildren[i], i)\n    }\n    return\n  }\n\n  reconcileKeyedChildren(parent, newChildren, oldChildren)\n}\n\n/**\n * Handles the complex logic of reconciling keyed children.\n *\n * WHY: When keys are present, we can't just iterate by index. We need to map\n * existing children by their key so we can find them even if they've moved.\n * This allows us to re-use DOM nodes (preserving focus/state) instead of\n * destroying and re-creating them.\n */\nfunction reconcileKeyedChildren(parent, newChildren, oldChildren) {\n  // Map existing children by Key for O(1) lookup\n  const keyed = {}\n  oldChildren.forEach((child, i) => {\n    const key = (child.props && child.props.key) != null ? child.props.key : i\n    keyed[key] = { vNode: child, index: i }\n  })\n\n  newChildren.forEach((newChild, i) => {\n    const key =\n      (newChild.props && newChild.props.key) != null ? newChild.props.key : i\n    const existingChildMatch = keyed[key]\n\n    if (existingChildMatch) {\n      // A. MATCH FOUND - The item existed before\n      const oldVNode = existingChildMatch.vNode\n\n      // Update the node's content recursively\n      patch(parent, newChild, oldVNode, i)\n\n      // If the DOM node isn't in the right spot, move it.\n      // We use oldVNode.el because patch transfers the ref, but just to be safe:\n      const el = newChild.el || oldVNode.el\n\n      // Get the node currently at this index in the real DOM\n      const domChildAtIndex = parent.childNodes[i]\n\n      // If the element exists but is in the wrong place, move it\n      if (el && domChildAtIndex !== el) {\n        parent.insertBefore(el, domChildAtIndex)\n        track('patches')\n      }\n\n      // Remove from map so we know it was re-used\n      delete keyed[key]\n    } else {\n      // B. NO MATCH - This is a new item\n      const newEl = createElement(newChild)\n      const domChildAtIndex = parent.childNodes[i]\n\n      if (domChildAtIndex) {\n        parent.insertBefore(newEl, domChildAtIndex)\n      } else {\n        parent.appendChild(newEl)\n      }\n    }\n  })\n\n  // Remove any old keys that weren't used in the new list\n  Object.values(keyed).forEach(({ vNode }) => {\n    if (vNode.el && vNode.el.parentNode === parent) {\n      runUnmount(vNode) // Clean up hooks\n      parent.removeChild(vNode.el)\n      track('elementsRemoved')\n    }\n  })\n}\n\n/**\n * Executes a Functional Component, tracks hooks, and returns the VNode.\n * @param {import(\"./h.js\").VNode} vNode - The component vNode.\n * @returns {import(\"./h.js\").VNode} The rendered child vNode.\n */\nfunction renderComponent(vNode) {\n  track('componentsRendered')\n\n  // 1. Prepare Hook Container\n  const hooks = {\n    mounts: [],\n    cleanups: [],\n  }\n\n  // 2. Set Global Scope\n  setInstance(hooks)\n\n  // 3. Run the User's Component Function\n  // We pass props as the first argument\n  const renderedVNode = vNode.tag(vNode.props)\n\n  // 4. Clear Global Scope\n  setInstance(null)\n\n  // 5. Attach hooks to the VNode so we can run them later\n  vNode.hooks = hooks\n\n  return renderedVNode\n}\n\n/**\n * Helper to recursively run cleanup hooks when a tree is removed.\n * @param {import(\"./h.js\").VNode} vNode - The vNode to unmount.\n */\nfunction runUnmount(vNode) {\n  if (!vNode) return\n\n  // 1. Run hooks for this node\n  if (vNode.hooks && vNode.hooks.cleanups) {\n    vNode.hooks.cleanups.forEach((fn) => fn())\n  }\n\n  // 2. Recurse into child (if component)\n  if (vNode.child) {\n    runUnmount(vNode.child)\n  }\n\n  // 3. Recurse into children (if element)\n  if (vNode.children) {\n    vNode.children.forEach(runUnmount)\n  }\n}\n\n/**\n * The main diffing function. Compares V-DOM trees and updates the real DOM.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {import(\"./h.js\").VNode | string | number} newVNode - The new virtual node.\n * @param {import(\"./h.js\").VNode | string | number} oldVNode - The old virtual node.\n * @param {number} [index=0] - The index of the child node (used for simple diffing).\n */\nexport function patch(parent, newVNode, oldVNode, index = 0) {\n  track('diffs')\n\n  // Case 1: Removal - The new node is null/undefined, so we remove the old one.\n  if (newVNode === undefined || newVNode === null) {\n    const el = oldVNode.el || parent.childNodes[index]\n\n    // Recursive Cleanup\n    runUnmount(oldVNode)\n\n    if (el) {\n      parent.removeChild(el)\n      track('elementsRemoved')\n    }\n    return\n  }\n\n  // Case 2: Component - If it's a function, we delegate to the component logic.\n  if (typeof newVNode.tag === 'function') {\n    const isNew = !oldVNode\n\n    const childVNode = renderComponent(newVNode)\n    newVNode.child = childVNode\n\n    const oldChild = oldVNode ? oldVNode.child : undefined\n    patch(parent, childVNode, oldChild, index)\n\n    newVNode.el = childVNode.el\n\n    // Run mount hooks on the next tick\n    if (isNew && newVNode.hooks && newVNode.hooks.mounts.length > 0) {\n      setTimeout(() => {\n        newVNode.hooks.mounts.forEach((fn) => fn())\n      }, 0)\n    }\n    // TODO: Handle updates (running old cleanups if necessary) for Phase 2\n    return\n  }\n\n  // Case 3: Creation - No old node exists, so we create a new one.\n  if (oldVNode === undefined || oldVNode === null) {\n    parent.appendChild(createElement(newVNode))\n    return\n  }\n\n  // Case 4: Replacement - The node type changed (e.g. div -> span), so we replace it entirely.\n  if (\n    typeof newVNode !== typeof oldVNode ||\n    (typeof newVNode !== 'string' && newVNode.tag !== oldVNode.tag)\n  ) {\n    const el = oldVNode.el || parent.childNodes[index]\n    if (el) {\n      parent.replaceChild(createElement(newVNode), el)\n      track('patches')\n    }\n    return\n  }\n\n  // Case 5: Text Update - It's a text node, so we just update the text content.\n  if (typeof newVNode === 'string' || typeof newVNode === 'number') {\n    if (newVNode !== oldVNode) {\n      const el = parent.childNodes[index]\n      if (el) {\n        el.nodeValue = String(newVNode)\n        track('patches')\n      } else {\n        // Self healing: if text node missing, append it\n        parent.appendChild(document.createTextNode(String(newVNode)))\n      }\n    }\n    return\n  }\n\n  // Case 6: Update - Same tag, so we update props and recurse into children.\n  const el = oldVNode.el || parent.childNodes[index]\n\n  if (!el) return\n\n  // Transfer DOM reference to the new VNode\n  newVNode.el = el\n\n  patchProps(el, newVNode.props, oldVNode.props)\n\n  reconcileChildren(el, newVNode.children, oldVNode.children)\n}\n","/**\n * @typedef {object} HumnPersist\n * @property {boolean} __humn_persist\n * @property {any} initial\n * @property {PersistConfig} config\n */\n\n/**\n * @typedef {object} PersistConfig\n * @property {string} key\n */\n\n/**\n * Marks a section of the state for persistence in localStorage.\n *\n * @param {any} initial - The initial value of the state.\n * @param {PersistConfig} config - The configuration for persistence.\n * @returns {HumnPersist}\n */\nexport const persist = (initial, config = {}) => ({\n  __humn_persist: true,\n  initial,\n  config,\n})\n","import { getObserver } from './observer.js'\nimport { isDev } from './metrics.js'\n\n/**\n * @typedef {object} Synapses\n * @property {function} set - Function to update the memory\n * @property {function} get - Function to get the memory\n */\n\n/**\n * @typedef {object} CortexParams\n * @property {object} memory - The initial state\n * @property {function(function, function): object} synapses - The synapses function\n */\n\n/**\n * The Cortex class manages the state of the application.\n * This uses a Proxy for fine-grained reactivity, ensuring only those components\n * which use the updated value get re-rendered.\n *\n * WHY: We use Proxies instead of simple getters/setters because it allows us to\n * detect access to nested properties dynamically without needing to declare\n * dependencies upfront. This \"magic\" auto-subscription is what makes Humn's\n * DX so clean.\n */\nexport class Cortex {\n  /**\n   * Creates an instance of Cortex.\n   * @param {CortexParams} CortexParams - The parameters for the Cortex.\n   */\n  constructor({ memory, synapses }) {\n    const liveMemory = { ...memory }\n    this._persistenceMap = new Map()\n\n    // Load in any existing values from local-storage\n    for (const [key, value] of Object.entries(memory)) {\n      if (value && value.__humn_persist) {\n        const storageKey = value.config.key || key\n        this._persistenceMap.set(key, storageKey)\n\n        try {\n          const stored = localStorage.getItem(storageKey)\n          if (stored !== null) {\n            liveMemory[key] = JSON.parse(stored)\n          } else {\n            liveMemory[key] = value.initial\n          }\n        } catch (err) {\n          if (isDev)\n            console.warn(`Humn: Failed to load '${key}' from storage.`, err)\n          liveMemory[key] = value.initial\n        }\n      }\n    }\n\n    this._memory = liveMemory\n    this._listeners = new Map()\n\n    const get = () => this._memory\n\n    const set = (updater) => {\n      let nextState\n      let changedPaths = new Set()\n\n      if (typeof updater === 'function') {\n        const clone = structuredClone(this._memory)\n        const proxy = this._createChangeTrackingProxy(clone, changedPaths)\n        const result = updater(proxy)\n\n        if (result && typeof result === 'object') {\n          nextState = { ...this._memory, ...result }\n          Object.keys(result).forEach((key) => changedPaths.add(key))\n        } else {\n          nextState = clone\n        }\n      } else {\n        nextState = { ...this._memory, ...updater }\n        changedPaths = new Set(Object.keys(updater))\n      }\n\n      this._memory = nextState\n\n      // If we need to persist any of the values\n      // we save them to localStorage here\n      if (this._persistenceMap.size > 0) {\n        this._persistenceMap.forEach((storageKey, stateKey) => {\n          const isDirty = Array.from(changedPaths).some(\n            (path) => path === stateKey || path.startsWith(stateKey + '.'),\n          )\n\n          if (isDirty) {\n            try {\n              const value = this._memory[stateKey]\n              localStorage.setItem(storageKey, JSON.stringify(value))\n            } catch (err) {\n              if (isDev)\n                console.error(`Humn: Failed to save '${stateKey}'.`, err)\n            }\n          }\n        })\n      }\n\n      this._notifyRelevantListeners(changedPaths)\n    }\n\n    this.synapses = synapses(set, get)\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are being mutated.\n   * Includes a GET trap to recursively proxy nested objects for deep mutation tracking.\n   *\n   * WHY: We need to know exactly which paths were changed so we can notify ONLY\n   * the components that care about those specific paths. If we just knew \"something changed\",\n   * we'd have to re-render the whole app (like Redux) or rely on manual optimization.\n   */\n  _createChangeTrackingProxy(obj, changedPaths, path = '') {\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const value = target[prop]\n        const fullPath = path ? `${path}.${prop}` : prop\n\n        // Recursively proxy nested objects so we can trap their sets too\n        if (typeof value === 'object' && value !== null) {\n          return this._createChangeTrackingProxy(value, changedPaths, fullPath)\n        }\n        return value\n      },\n      set: (target, prop, value) => {\n        if (typeof prop === 'symbol' || prop === '__proto__') {\n          target[prop] = value\n          return true\n        }\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        changedPaths.add(fullPath)\n\n        target[prop] = value\n        return true\n      },\n    })\n  }\n\n  /**\n   * Only notify listeners that read properties which changed\n   */\n  _notifyRelevantListeners(changedPaths) {\n    this._listeners.forEach((accessedPaths, renderFn) => {\n      const shouldNotify = Array.from(accessedPaths).some((accessedPath) => {\n        return Array.from(changedPaths).some((changedPath) => {\n          // Check for exact match or parent/child relationship\n          return (\n            accessedPath === changedPath ||\n            accessedPath.startsWith(changedPath + '.') ||\n            changedPath.startsWith(accessedPath + '.')\n          )\n        })\n      })\n\n      if (shouldNotify) renderFn()\n    })\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are accessed during render\n   *\n   * WHY: This is the other half of the magic. By tracking what a component READS\n   * during its render, we build a precise dependency graph. If a component reads\n   * `state.user.name`, it will only re-render when `state.user.name` changes,\n   * not when `state.count` changes.\n   */\n  _createAccessTrackingProxy(obj, accessedPaths, path = '') {\n    if (typeof obj !== 'object' || obj === null) return obj\n\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        // We don't care about prototype and symbol properties\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        accessedPaths.add(fullPath)\n\n        const value = target[prop]\n\n        // Recursively wrap nested objects\n        if (typeof value === 'object' && value !== null)\n          return this._createAccessTrackingProxy(value, accessedPaths, fullPath)\n\n        return value\n      },\n    })\n  }\n\n  /**\n   * Returns memory wrapped in a tracking Proxy\n   */\n  get memory() {\n    const currentObserver = getObserver()\n\n    if (!currentObserver) return this._memory\n\n    if (!this._listeners.has(currentObserver))\n      this._listeners.set(currentObserver, new Set())\n\n    const accessedPaths = this._listeners.get(currentObserver)\n\n    // This gives us fresh tracking each render\n    accessedPaths.clear()\n\n    return this._createAccessTrackingProxy(this._memory, accessedPaths)\n  }\n}\n","/**\n * @typedef {object} VNode\n * @property {string} tag\n * @property {object} props\n * @property {VNode[]} children\n */\n\n/**\n * Creates a virtual DOM node.\n * This is a hyperscript-like function.\n *\n * @param {string} tag - The tag name of the element.\n * @param {object} props - The properties of the element.\n * @param {VNode[]|VNode} children - The children of the element.\n * @returns {VNode} The virtual DOM node.\n */\nexport const h = (tag, props = {}, children = []) => {\n  const childArray = Array.isArray(children) ? children : [children]\n\n  // Filter out null/false so we don't have \"ghost\" nodes\n  const cleanChildren = childArray\n    .flat()\n    .filter((c) => c !== null && c !== undefined && c !== false && c !== '')\n\n  return {\n    tag,\n    props,\n    children: cleanChildren,\n  }\n}\n","/**\n * @file Mounts the application to the DOM.\n * @module mount\n */\nimport { setObserver } from './observer.js'\nimport { patch } from './patch.js'\n\n/**\n * Mounts a component to a target DOM element.\n * @param {HTMLElement} target - The DOM element to mount to.\n * @param {function} Component - The root component function.\n */\nexport const mount = (target, Component) => {\n  let prevVNode = null\n\n  const lifecycle = () => {\n    setObserver(lifecycle)\n\n    const nextVNode = {\n      tag: Component,\n      props: {},\n      children: [],\n    }\n\n    patch(target, nextVNode, prevVNode)\n    setObserver(null)\n    prevVNode = nextVNode\n  }\n\n  lifecycle()\n}\n","/**\n * @file Lifecycle hooks for components.\n * @module lifecycle\n */\nimport { getInstance } from './observer.js'\n\n/**\n * Registers a callback to run after the component mounts.\n * @param {function} fn - The callback function.\n */\nexport function onMount(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.mounts.push(fn)\n  }\n}\n\n/**\n * Registers a callback to run when the component unmounts.\n * @param {function} fn - The callback function.\n */\nexport function onCleanup(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.cleanups.push(fn)\n  }\n}\n"],"names":["g","f","exports","module","define","amd","globalThis","self","Humn","this","currentObserver","currentInstance","getObserver","setObserver","obs","getInstance","setInstance","inst","styleSheet","cache","Set","hasKeys","children","some","c","props","key","createElement","vNode","document","createTextNode","String","tag","childVNode","renderComponent","child","el","hooks","mounts","length","setTimeout","forEach","fn","patchProps","appendChild","newProps","oldProps","allProps","oldValue","newValue","startsWith","eventName","slice","toLowerCase","removeEventListener","addEventListener","disabled","setAttribute","removeAttribute","reconcileChildren","parent","newChildren","oldChildren","maxLen","Math","max","i","patch","keyed","index","newChild","existingChildMatch","oldVNode","domChildAtIndex","childNodes","insertBefore","newEl","Object","values","parentNode","runUnmount","removeChild","cleanups","renderedVNode","newVNode","isNew","replaceChild","nodeValue","Cortex","constructor","memory","synapses","liveMemory","_persistenceMap","Map","value","entries","__humn_persist","storageKey","config","set","stored","localStorage","getItem","JSON","parse","initial","_memory","_listeners","updater","nextState","changedPaths","clone","structuredClone","result","_createChangeTrackingProxy","keys","add","size","stateKey","Array","from","path","setItem","stringify","_notifyRelevantListeners","obj","Proxy","get","target","prop","fullPath","accessedPaths","renderFn","accessedPath","changedPath","_createAccessTrackingProxy","has","clear","css","stringsOrStr","args","raw","isSingleRoot","isArray","reduce","acc","str","content","replace","trim","hash","charCodeAt","toString","hashedClassName","id","head","textContent","h","flat","filter","mount","Component","prevVNode","lifecycle","nextVNode","onCleanup","instance","push","onMount","persist","defineProperty","Symbol","toStringTag"],"mappings":"CAAA,SAAAA,EAAAC,EAAAA,CAAA,OAAAC,SAAA,iBAAAC,OAAA,IAAAF,EAAAC,OAAAA,EAAA,OAAAE,QAAA,YAAAA,OAAAC,IAAAD,OAAA,CAAA,SAAA,EAAAH,CAAAA,EAAAA,GAAAD,EAAA,OAAAM,WAAA,IAAAA,WAAAN,GAAAO,MAAAC,KAAA,CAAA,CAAA,CAAA,GAAAC,KAAA,SAAAP,EAAAA,CAAA,aAKA,IAAIQ,EAAkB,KAClBC,EAAkB,KAMf,MAAMC,EAAc,IAAMF,EAMpBG,EAAeC,GAAAA,CAC1BJ,EAAkBI,CAAAA,EAOPC,EAAc,IAAMJ,EAMpBK,EAAeC,GAAAA,CAC1BN,EAAkBM,CAAAA,EC5BpB,IAAIC,EAAa,KACjB,MAAMC,EAAQ,IAAIC,ICOX,SAASC,EAAQC,EAAAA,CACtB,OAAOA,GAAYA,EAASC,KAAMC,GAAMA,GAAKA,EAAEC,OAASD,EAAEC,MAAMC,KAAO,IAAPA,CAClE,CAOA,SAASC,EAAcC,EAAAA,CACrB,GAAqB,OAAVA,GAAU,UAA6B,OAAVA,GAAU,SAChD,OAAOC,SAASC,eAAeC,OAAOH,IAGxC,GAAyB,OAAdA,EAAMI,KAAQ,WAAY,CACnC,MAAMC,EAAaC,EAAgBN,GACnCA,EAAMO,MAAQF,EAGd,MAAMG,EAAKT,EAAcM,CAAAA,EAOzB,OANAL,EAAMQ,GAAKA,EAGPR,EAAMS,OAAST,EAAMS,MAAMC,OAAOC,OAAS,GAC7CC,WAAW,IAAMZ,EAAMS,MAAMC,OAAOG,QAASC,GAAOA,EAAAA,CAAAA,EAAO,CAAA,EAEtDN,CACT,CAIA,MAAMA,EAAKP,SAASF,cAAcC,EAAMI,GAAAA,EAQxC,OAPAJ,EAAMQ,GAAKA,EACXO,EAAWP,EAAIR,EAAMH,OAErBG,EAAMN,SAASmB,QAASN,GAAAA,CACtBC,EAAGQ,YAAYjB,EAAcQ,CAAAA,CAAAA,CAAAA,CAAAA,EAGxBC,CACT,CAYA,SAASO,EAAWP,EAAIS,EAAW,CAAA,EAAIC,EAAW,CAAA,EAAA,CAChD,GAAA,CAAKV,EAAI,OAET,MAAMW,EAAW,CAAA,GAAKD,EAAAA,GAAaD,CAAAA,EAEnC,UAAWnB,KAAOqB,EAAU,CAC1B,MAAMC,EAAWF,EAASpB,CAAAA,EACpBuB,EAAWJ,EAASnB,CAAAA,EAG1B,GAAIuB,GAAAA,KAOJ,GAAIvB,IAAQ,SAAWA,IAAQ,WAS/B,GAAIsB,IAAaC,EAAjB,CAKA,GAAIvB,EAAIwB,WAAW,IAAA,EAAO,CACxB,MAAMC,EAAYzB,EAAI0B,MAAM,GAAGC,YAAAA,EAC3BL,GAAUZ,EAAGkB,oBAAoBH,EAAWH,CAAAA,EAChDZ,EAAGmB,iBAAiBJ,EAAWF,CAAAA,CACjC,CAEIvB,IAAQ,WACVU,EAAGoB,SAAWP,IAAXO,IAAgCP,IAAa,OAIhDb,EAAGqB,aAAa/B,EAAKuB,CAAAA,CAhBI,OARrBb,EAAGV,CAAAA,IAASuB,IACdb,EAAGV,CAAAA,EAAOuB,QARZb,EAAGsB,gBAAgBhC,CAAAA,CAiCvB,CACF,CAcA,SAASiC,EAAkBC,EAAQC,EAAaC,EAAAA,CAK9C,GAAA,EAJgBzC,EAAQwC,CAAAA,GAAgBxC,EAAQyC,CAAAA,GAIlC,CACZ,MAAMC,EAASC,KAAKC,IAAIJ,EAAYtB,OAAQuB,EAAYvB,MAAAA,EACxD,QAAS2B,EAAI,EAAGA,EAAIH,EAAQG,IAC1BC,EAAMP,EAAQC,EAAYK,GAAIJ,EAAYI,CAAAA,EAAIA,CAAAA,EAEhD,MACF,EAaF,SAAgCN,EAAQC,EAAaC,EAAAA,CAEnD,MAAMM,EAAQ,CAAA,EACdN,EAAYrB,QAAQ,CAACN,EAAO+B,IAAAA,CAC1B,MAAMxC,GAAOS,EAAMV,OAASU,EAAMV,MAAMC,MAAQ,KAAOS,EAAMV,MAAMC,IAAMwC,EACzEE,EAAM1C,CAAAA,EAAO,CAAEE,MAAOO,EAAOkC,MAAOH,CAAAA,CAAAA,CAAAA,EAGtCL,EAAYpB,QAAQ,CAAC6B,EAAUJ,IAAAA,CAC7B,MAAMxC,GACH4C,EAAS7C,OAAS6C,EAAS7C,MAAMC,MAAQ,KAAO4C,EAAS7C,MAAMC,IAAMwC,EAClEK,EAAqBH,EAAM1C,CAAAA,EAEjC,GAAI6C,EAAoB,CAEtB,MAAMC,EAAWD,EAAmB3C,MAGpCuC,EAAMP,EAAQU,EAAUE,EAAUN,CAAAA,EAIlC,MAAM9B,EAAKkC,EAASlC,IAAMoC,EAASpC,GAG7BqC,EAAkBb,EAAOc,WAAWR,CAAAA,EAGtC9B,GAAMqC,IAAoBrC,GAC5BwB,EAAOe,aAAavC,EAAIqC,CAAAA,EAAAA,OAKnBL,EAAM1C,CAAAA,CACf,KAAO,CAEL,MAAMkD,EAAQjD,EAAc2C,CAAAA,EACtBG,EAAkBb,EAAOc,WAAWR,GAEtCO,EACFb,EAAOe,aAAaC,EAAOH,GAE3Bb,EAAOhB,YAAYgC,CAAAA,CAEvB,CAAA,CAAA,EAIFC,OAAOC,OAAOV,CAAAA,EAAO3B,QAAQ,EAAGb,MAAAA,CAAAA,IAAAA,CAC1BA,EAAMQ,IAAMR,EAAMQ,GAAG2C,aAAenB,IACtCoB,EAAWpD,GACXgC,EAAOqB,YAAYrD,EAAMQ,EAAAA,EAAAA,CAAAA,CAI/B,GAnEyBwB,EAAQC,EAAaC,EAC9C,CAyEA,SAAS5B,EAAgBN,EAAAA,CAIvB,MAAMS,EAAQ,CACZC,OAAQ,CAAA,EACR4C,SAAU,CAAA,CAAA,EAIZlE,EAAYqB,CAAAA,EAIZ,MAAM8C,EAAgBvD,EAAMI,IAAIJ,EAAMH,OAQtC,OALAT,EAAY,IAAA,EAGZY,EAAMS,MAAQA,EAEP8C,CACT,CAMA,SAASH,EAAWpD,EAAAA,CACbA,IAGDA,EAAMS,OAAST,EAAMS,MAAM6C,UAC7BtD,EAAMS,MAAM6C,SAASzC,QAASC,GAAOA,EAAAA,CAAAA,EAInCd,EAAMO,OACR6C,EAAWpD,EAAMO,KAAAA,EAIfP,EAAMN,UACRM,EAAMN,SAASmB,QAAQuC,CAAAA,EAE3B,CASO,SAASb,EAAMP,EAAQwB,EAAUZ,EAAUH,EAAQ,EAAA,CAIxD,GAAIe,GAAAA,KAA6C,CAC/C,MAAMhD,EAAKoC,EAASpC,IAAMwB,EAAOc,WAAWL,CAAAA,EAS5C,OANAW,EAAWR,CAAAA,EAAAA,KAEPpC,GACFwB,EAAOqB,YAAY7C,CAAAA,EAIvB,CAGA,GAA4B,OAAjBgD,EAASpD,KAAQ,WAAY,CACtC,MAAMqD,EAAAA,CAASb,EAETvC,EAAaC,EAAgBkD,CAAAA,EACnCA,OAAAA,EAASjD,MAAQF,EAGjBkC,EAAMP,EAAQ3B,EADGuC,EAAWA,EAASrC,MAAAA,OACDkC,CAAAA,EAEpCe,EAAShD,GAAKH,EAAWG,GAAAA,KAGrBiD,GAASD,EAAS/C,OAAS+C,EAAS/C,MAAMC,OAAOC,OAAS,GAC5DC,WAAW,IAAA,CACT4C,EAAS/C,MAAMC,OAAOG,QAASC,GAAOA,EAAAA,CAAAA,CAAAA,EACrC,GAIP,CAGA,GAAI8B,GAAAA,KAEF,OAAA,KADAZ,EAAOhB,YAAYjB,EAAcyD,CAAAA,CAAAA,EAKnC,UACSA,GAAAA,OAAoBZ,GACN,OAAbY,GAAa,UAAYA,EAASpD,MAAQwC,EAASxC,IAC3D,CACA,MAAMI,EAAKoC,EAASpC,IAAMwB,EAAOc,WAAWL,CAAAA,EAK5C,OAAA,KAJIjC,GACFwB,EAAO0B,aAAa3D,EAAcyD,CAAAA,EAAWhD,GAIjD,CAGA,GAAwB,OAAbgD,GAAa,iBAAmBA,GAAa,SAAU,CAChE,GAAIA,IAAaZ,EAAU,CACzB,MAAMpC,EAAKwB,EAAOc,WAAWL,CAAAA,EACzBjC,EACFA,EAAGmD,UAAYxD,OAAOqD,CAAAA,EAItBxB,EAAOhB,YAAYf,SAASC,eAAeC,OAAOqD,CAAAA,CAAAA,CAAAA,CAEtD,CACA,MACF,CAGA,MAAMhD,EAAKoC,EAASpC,IAAMwB,EAAOc,WAAWL,CAAAA,EAEvCjC,IAGLgD,EAAShD,GAAKA,EAEdO,EAAWP,EAAIgD,EAAS3D,MAAO+C,EAAS/C,KAAAA,EAExCkC,EAAkBvB,EAAIgD,EAAS9D,SAAUkD,EAASlD,QAAAA,EACpD,CCvUCpB,EAAAsF,OCEM,KAAA,CAKL,YAAAC,CAAYC,OAAEA,EAAMC,SAAEA,CAAAA,EAAAA,CACpB,MAAMC,EAAa,CAAA,GAAKF,CAAAA,EACxBjF,KAAKoF,gBAAkB,IAAIC,IAG3B,SAAK,CAAOpE,EAAKqE,KAAUlB,OAAOmB,QAAQN,CAAAA,EACxC,GAAIK,GAASA,EAAME,eAAgB,CACjC,MAAMC,EAAaH,EAAMI,OAAOzE,KAAOA,EACvCjB,KAAKoF,gBAAgBO,IAAI1E,EAAKwE,CAAAA,EAE9B,GAAA,CACE,MAAMG,EAASC,aAAaC,QAAQL,CAAAA,EAElCN,EAAWlE,CAAAA,EADT2E,IAAW,KACKG,KAAKC,MAAMJ,GAEXN,EAAMW,OAE5B,OAGEd,EAAWlE,CAAAA,EAAOqE,EAAMW,OAC1B,CACF,CAGFjG,KAAKkG,QAAUf,EACfnF,KAAKmG,WAAa,IAAId,IAiDtBrF,KAAKkF,SAAWA,EA7CHkB,GAAAA,CACX,IAAIC,EACAC,EAAe,IAAI3F,IAEvB,GAAuB,OAAZyF,GAAY,WAAY,CACjC,MAAMG,EAAQC,gBAAgBxG,KAAKkG,OAAAA,EAE7BO,EAASL,EADDpG,KAAK0G,2BAA2BH,EAAOD,IAGjDG,GAA4B,OAAXA,GAAW,UAC9BJ,EAAY,IAAKrG,KAAKkG,QAAAA,GAAYO,CAAAA,EAClCrC,OAAOuC,KAAKF,CAAAA,EAAQzE,QAASf,GAAQqF,EAAaM,IAAI3F,CAAAA,CAAAA,GAEtDoF,EAAYE,CAEhB,MACEF,EAAY,CAAA,GAAKrG,KAAKkG,QAAAA,GAAYE,GAClCE,EAAe,IAAI3F,IAAIyD,OAAOuC,KAAKP,CAAAA,CAAAA,EAGrCpG,KAAKkG,QAAUG,EAIXrG,KAAKoF,gBAAgByB,KAAO,GAC9B7G,KAAKoF,gBAAgBpD,QAAQ,CAACyD,EAAYqB,KAKxC,GAJgBC,MAAMC,KAAKV,CAAAA,EAAcxF,KACtCmG,GAASA,IAASH,GAAYG,EAAKxE,WAAWqE,EAAW,GAAA,CAAA,EAI1D,GAAA,CACE,MAAMxB,EAAQtF,KAAKkG,QAAQY,GAC3BjB,aAAaqB,QAAQzB,EAAYM,KAAKoB,UAAU7B,CAAAA,CAAAA,CAClD,OAGA,CAAA,CAAA,EAKNtF,KAAKoH,yBAAyBd,CAAAA,CAAAA,EA5CpB,IAAMtG,KAAKkG,OAAAA,CAgDzB,CAUA,2BAA2BmB,EAAKf,EAAcW,EAAO,GAAA,CACnD,OAAO,IAAIK,MAAMD,EAAK,CACpBE,IAAK,CAACC,EAAQC,IAAAA,CACZ,GAAoB,OAATA,GAAS,UAAYA,IAAS,YACvC,OAAOD,EAAOC,CAAAA,EAEhB,MAAMnC,EAAQkC,EAAOC,CAAAA,EACfC,EAAWT,EAAO,GAAGA,CAAAA,IAAQQ,CAAAA,GAASA,EAG5C,cAAWnC,GAAU,UAAYA,IAAU,KAClCtF,KAAK0G,2BAA2BpB,EAAOgB,EAAcoB,CAAAA,EAEvDpC,CAAAA,EAETK,IAAK,CAAC6B,EAAQC,EAAMnC,KAClB,GAAoB,OAATmC,GAAS,UAAYA,IAAS,YAEvC,OADAD,EAAOC,CAAAA,EAAQnC,KAIjB,MAAMoC,EAAWT,EAAO,GAAGA,CAAAA,IAAQQ,CAAAA,GAASA,EAI5C,OAHAnB,EAAaM,IAAIc,CAAAA,EAEjBF,EAAOC,GAAQnC,EAAAA,EACR,CAAA,CAAA,CAGb,CAKA,yBAAyBgB,EAAAA,CACvBtG,KAAKmG,WAAWnE,QAAQ,CAAC2F,EAAeC,IAAAA,CACjBb,MAAMC,KAAKW,CAAAA,EAAe7G,KAAM+G,GAC5Cd,MAAMC,KAAKV,CAAAA,EAAcxF,KAAMgH,GAGlCD,IAAiBC,GACjBD,EAAapF,WAAWqF,EAAc,GAAA,GACtCA,EAAYrF,WAAWoF,EAAe,GAAA,CAAA,CAAA,GAK1BD,KAEtB,CAUA,2BAA2BP,EAAKM,EAAeV,EAAO,GAAA,CACpD,OAAmB,OAARI,GAAQ,UAAYA,IAAQ,KAAaA,EAE7C,IAAIC,MAAMD,EAAK,CACpBE,IAAK,CAACC,EAAQC,IAAAA,CAEZ,GAAoB,OAATA,GAAS,UAAYA,IAAS,YACvC,OAAOD,EAAOC,CAAAA,EAEhB,MAAMC,EAAWT,EAAO,GAAGA,CAAAA,IAAQQ,CAAAA,GAASA,EAC5CE,EAAcf,IAAIc,CAAAA,EAElB,MAAMpC,EAAQkC,EAAOC,CAAAA,EAGrB,OAAqB,OAAVnC,GAAU,UAAYA,IAAU,KAClCtF,KAAK+H,2BAA2BzC,EAAOqC,EAAeD,CAAAA,EAExDpC,CAAAA,CAAAA,CAAAA,CAGb,CAKA,YAAIL,CACF,MAAMhF,EAAkBE,EAAAA,EAExB,GAAA,CAAKF,EAAiB,OAAOD,KAAKkG,QAE7BlG,KAAKmG,WAAW6B,IAAI/H,CAAAA,GACvBD,KAAKmG,WAAWR,IAAI1F,EAAiB,IAAIU,GAAAA,EAE3C,MAAMgH,EAAgB3H,KAAKmG,WAAWoB,IAAItH,CAAAA,EAK1C,OAFA0H,EAAcM,QAEPjI,KAAK+H,2BAA2B/H,KAAKkG,QAASyB,CAAAA,CACvD,CAAA,ED/LDlI,EAAAyI,IFgBM,SAAaC,KAAiBC,EAAAA,CACnC,IAAIC,EAAM,GACNC,EAAAA,GAGAvB,MAAMwB,QAAQJ,CAAAA,GAAiBA,EAAaE,IAC9CA,EAAMF,EAAaK,OAAO,CAACC,EAAKC,EAAKjF,IAC5BgF,EAAMC,GAAON,EAAK3E,IAAM,IAC9B,EAAA,GAEH4E,EAAMF,EAENG,EAAeF,EAAK,CAAA,QAEtB,IAAIO,GA5BN,SAAgBT,EAAAA,CACd,OAAOA,EACJU,QAAQ,oBAAqB,EAAA,EAC7BA,QAAQ,OAAQ,GAAA,EAChBC,KAAAA,CACL,GAuBuBR,GAErB,GAAA,CAAKM,EAAS,MAAO,GAEjBL,IAYFK,EAAUA,EAAQC,QAChB,qFACA,aAAA,GAIJ,MAAME,GAhER,SAAoBJ,GAClB,IAAII,EAAO,KACPrF,EAAIiF,EAAI5G,OACZ,KAAO2B,GACLqF,EAAe,GAAPA,EAAaJ,EAAIK,WAAAA,EAAatF,GAExC,OAAQqF,IAAS,GAAGE,SAAS,EAAA,CAC/B,GAyD0BL,CAAAA,EAClBM,EAAkB,QAAQH,CAAAA,GAEhC,OAAIpI,EAAMsH,IAAIc,CAAAA,IAITrI,IACHA,EAAaW,SAASF,cAAc,OAAA,EACpCT,EAAWyI,GAAK,cAChB9H,SAAS+H,KAAKhH,YAAY1B,CAAAA,GAG5BA,EAAW2I,aAAe,IAAIH,CAAAA;AAAAA,MAC1BN,CAAAA;AAAAA;AAAAA,EAEJjI,EAAMkG,IAAIkC,CAAAA,GAZDG,CAeX,EEvECxJ,EAAA4J,EEPgB,CAAC9H,EAAKP,EAAQ,CAAA,EAAIH,EAAW,CAAA,KAQrC,CACLU,IAAAA,EACAP,MAAAA,EACAH,UAViBkG,MAAMwB,QAAQ1H,CAAAA,EAAYA,EAAW,CAACA,IAItDyI,KAAAA,EACAC,OAAQxI,GAAMA,GAAAA,MAAiCA,IAAjCA,IAAgDA,IAAM,EAANA,CAAAA,GFClEtB,EAAA+J,MGXoB,CAAChC,EAAQiC,IAAAA,CAC5B,IAAIC,EAAY,KAEhB,MAAMC,EAAY,KAChBvJ,EAAYuJ,CAAAA,EAEZ,MAAMC,EAAY,CAChBrI,IAAKkI,EACLzI,MAAO,CAAA,EACPH,SAAU,CAAA,CAAA,EAGZ6C,EAAM8D,EAAQoC,EAAWF,CAAAA,EACzBtJ,EAAY,MACZsJ,EAAYE,CAAAA,EAGdD,EAAAA,CAAAA,EHNDlK,EAAAoK,UIFM,SAAmB5H,EAAAA,CACxB,MAAM6H,EAAWxJ,IACbwJ,GACFA,EAASrF,SAASsF,KAAK9H,CAAAA,CAE3B,EJHCxC,EAAAuK,QIbM,SAAiB/H,EAAAA,CACtB,MAAM6H,EAAWxJ,EAAAA,EACbwJ,GACFA,EAASjI,OAAOkI,KAAK9H,CAAAA,CAEzB,EJQCxC,EAAAwK,QAJsB,CAAChE,EAASP,EAAS,MAAE,CAC1CF,kBACAS,QAAAA,EACAP,OAAAA,CAAAA,GACDtB,OAAA8F,eAAAzK,EAAA0K,OAAAC,YAAA,CAAA9E,MAAA,QAAA,CAAA,CAAA,CAAA"}
+{"version":3,"file":"humn.umd.js","sources":["../src/observer.js","../src/css.js","../src/patch.js","../src/persist.js","../src/cortex.js","../src/h.js","../src/mount.js","../src/lifecycle.js"],"sourcesContent":["/**\n * @file Observer module for tracking global state during rendering.\n * @module observer\n */\n\nlet currentObserver = null // For Cortex/State dependency\nlet currentInstance = null // For Lifecycle Hooks\n\n/**\n * Gets the current observer (render function).\n * @returns {function|null}\n */\nexport const getObserver = () => currentObserver\n\n/**\n * Sets the current observer.\n * @param {function|null} obs\n */\nexport const setObserver = (obs) => {\n  currentObserver = obs\n}\n\n/**\n * Gets the current component instance (hook container).\n * @returns {object|null}\n */\nexport const getInstance = () => currentInstance\n\n/**\n * Sets the current component instance.\n * @param {object|null} inst\n */\nexport const setInstance = (inst) => {\n  currentInstance = inst\n}\n","/**\n * @file Runtime Scoped CSS implementation using Native CSS Nesting.\n * @module css\n */\n\nlet styleSheet = null\nconst cache = new Set()\n\n/**\n * Simple DJB2 hashing function.\n */\nfunction hashString(str) {\n  let hash = 5381\n  let i = str.length\n  while (i) {\n    hash = (hash * 33) ^ str.charCodeAt(--i)\n  }\n  return (hash >>> 0).toString(36)\n}\n\n/**\n * Lightweight Runtime Minifier.\n * Removes comments and collapses whitespace.\n * We do not strip spaces around colons/brackets to ensure safety for calc().\n */\nfunction minify(css) {\n  return css\n    .replace(/\\/\\*[\\s\\S]*?\\*\\//g, '') // Remove comments\n    .replace(/\\s+/g, ' ') // Collapse newlines/tabs to single space\n    .trim() // Remove leading/trailing\n}\n\n/**\n * Scoped CSS Tag.\n * Wraps content in a unique class using Native CSS Nesting.\n * Supports two signatures:\n * 1. Tagged Template: css`...`\n * 2. Function: css(string, isSingleRoot)\n */\nexport function css(stringsOrStr, ...args) {\n  let raw = ''\n  let isSingleRoot = false\n\n  // Detect usage of Tagged Template vs Function Call\n  if (Array.isArray(stringsOrStr) && stringsOrStr.raw) {\n    raw = stringsOrStr.reduce((acc, str, i) => {\n      return acc + str + (args[i] || '')\n    }, '')\n  } else {\n    raw = stringsOrStr\n    // If called as function, the first arg is our boolean flag\n    isSingleRoot = args[0] === true\n  }\n  let content = minify(raw)\n\n  if (!content) return ''\n\n  if (isSingleRoot) {\n    // Transforms selectors to apply to BOTH the root (using &) AND descendants.\n    // e.g. \"div\" -> \"div&, div\"\n\n    // Regex Breakdown:\n    // 1. (^|[{};,])      -> Hard Start (Line start, brace, semi, comma)\n    // 2. (\\s*)           -> Whitespace\n    // 3. (?!from|to)     -> Negative Lookahead: Ignore 'from'/'to' (keyframes)\n    // 4. ( ... )+        -> Compound Selector:\n    //    (?:[.#]?[\\w-]+ ... ) -> Matches tags (div), classes (.class), ids (#id)\n    // 5. (?=\\s*\\{)       -> Lookahead: Must be followed by {\n\n    content = content.replace(\n      /(^|[{};,])(\\s*)(?!from|to)((?:[.#]?[\\w-]+|\\[[^\\]]+\\]|:{1,2}[^:,{\\s]+)+)(?=\\s*\\{)/gi,\n      '$1$2$3&, $3',\n    )\n  }\n\n  const hash = hashString(content)\n  const hashedClassName = `humn-${hash}`\n\n  if (cache.has(hash)) {\n    return hashedClassName\n  }\n\n  if (!styleSheet) {\n    styleSheet = document.createElement('style')\n    styleSheet.id = 'humn-styles'\n    document.head.appendChild(styleSheet)\n  }\n\n  styleSheet.textContent += `.${hashedClassName} { \n    ${content} \n  }\\n`\n  cache.add(hash)\n\n  return hashedClassName\n}\n","/**\n * @file This file contains the diffing and patching algorithm for the virtual DOM,\n * including support for Keyed Diffing.\n * @module patch\n */\nimport { track } from './metrics.js'\nimport { setInstance } from './observer.js'\n\nfunction getNamespace(parent) {\n  if (parent.namespaceURI === SVG_NS && parent.tagName !== 'foreignObject') {\n    return SVG_NS\n  }\n  if (parent.namespaceURI === MATH_NS) {\n    return MATH_NS\n  }\n  return null\n}\n\n/**\n * Checks if a list of children contains keys.\n * @param {Array<import(\"./h.js\").VNode>} children - The list of VNodes.\n * @returns {boolean} True if keys are present.\n */\nexport function hasKeys(children) {\n  return children && children.some((c) => c && c.props && c.props.key != null)\n}\n\nconst SVG_NS = 'http://www.w3.org/2000/svg'\nconst MATH_NS = 'http://www.w3.org/1998/Math/MathML'\n/**\n * Creates a real DOM element from a virtual node.\n * @param {import(\"./h.js\").VNode | string | number} vNode\n * @param {string} [namespace] - The current namespace URI (if any).\n * @returns {Text | HTMLElement | SVGElement}\n */\nfunction createElement(vNode, namespace) {\n  if (typeof vNode === 'string' || typeof vNode === 'number') {\n    return document.createTextNode(String(vNode))\n  }\n\n  if (typeof vNode.tag === 'function') {\n    const childVNode = renderComponent(vNode)\n    vNode.child = childVNode\n\n    const el = createElement(childVNode, namespace)\n\n    vNode.el = el\n    if (vNode.hooks?.mounts.length > 0) {\n      setTimeout(() => vNode.hooks.mounts.forEach((fn) => fn()), 0)\n    }\n    return el\n  }\n\n  track('elementsCreated')\n\n  const tag = vNode.tag\n\n  // We prioritize specific tag declarations over the inherited namespace.\n  if (tag === 'svg') namespace = SVG_NS\n  else if (tag === 'math') namespace = MATH_NS\n  // NOTE: If we are inside 'foreignObject', we must NOT use the SVG NS.\n  // We handle this by resetting 'ns' in the recursion step below,\n  // so 'ns' entering here is already null for the foreignObject's children.\n\n  // createElementNS is slower than createElement, so only use it if we have a namespace.\n  const element = namespace\n    ? document.createElementNS(namespace, tag)\n    : document.createElement(tag)\n\n  vNode.el = element\n  patchProps(element, vNode.props)\n\n  // If we are currently at a 'foreignObject', children must exit the SVG namespace.\n  const childNS = tag === 'foreignObject' ? null : namespace\n\n  vNode.children.forEach((child) => {\n    element.appendChild(createElement(child, childNS))\n  })\n\n  return element\n}\n\n/**\n * Updates the properties (attributes/events) of a DOM element.\n * @param {HTMLElement} element - The DOM element to update.\n * @param {object} [newProps={}] - The new properties.\n * @param {object} [oldProps={}] - The old properties.\n *\n * WHY: We check against the LIVE DOM value for inputs (value/checked) to prevent\n * the \"cursor jumping\" bug. If we just blindly set the attribute, the browser\n * might reset the cursor position to the end of the input.\n */\nfunction patchProps(element, newProps = {}, oldProps = {}) {\n  if (!element) return\n\n  const allProps = { ...oldProps, ...newProps }\n\n  for (const key in allProps) {\n    const oldValue = oldProps[key]\n    const newValue = newProps[key]\n\n    // Handle removed props\n    if (newValue === undefined || newValue === null) {\n      element.removeAttribute(key)\n      track('patches')\n      continue\n    }\n\n    // We check against the LIVE DOM value to prevent cursor jumping\n    if (key === 'value' || key === 'checked') {\n      if (element[key] !== newValue) {\n        element[key] = newValue\n        track('patches')\n      }\n      continue\n    }\n\n    // If prop hasn't changed, skip\n    if (oldValue === newValue) continue\n\n    track('patches')\n\n    // Handle Events\n    if (key.startsWith('on')) {\n      const eventName = key.slice(2).toLowerCase()\n      if (oldValue) element.removeEventListener(eventName, oldValue)\n      element.addEventListener(eventName, newValue)\n    }\n    // Handle the disabled attribute\n    if (key === 'disabled') {\n      element.disabled = newValue === true || newValue === 'true'\n    }\n    // Handle standard attributes\n    else {\n      element.setAttribute(key, newValue)\n    }\n  }\n}\n\n/**\n * Reconciles the children of a node, handling both simple lists and keyed reordering.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {Array<import(\"./h.js\").VNode>} newChildren - The new list of children.\n * @param {Array<import(\"./h.js\").VNode>} oldChildren - The old list of children.\n *\n * WHY: This is the most complex part of the VDOM. We need to efficiently update\n * a list of items. Without keys, we just update index-by-index, which is fast\n * but causes issues if items are reordered (state gets mixed up).\n * With keys, we can track items as they move around, preserving their state\n * and minimizing DOM operations.\n */\nfunction reconcileChildren(parent, newChildren, oldChildren) {\n  const isKeyed = hasKeys(newChildren) || hasKeys(oldChildren)\n\n  // If no keys are used, use the fast index-based simple loop.\n  // This is faster for static lists or simple text replacements.\n  if (!isKeyed) {\n    const maxLen = Math.max(newChildren.length, oldChildren.length)\n    for (let i = 0; i < maxLen; i++) {\n      patch(parent, newChildren[i], oldChildren[i], i)\n    }\n    return\n  }\n\n  reconcileKeyedChildren(parent, newChildren, oldChildren)\n}\n\n/**\n * Handles the complex logic of reconciling keyed children.\n *\n * WHY: When keys are present, we can't just iterate by index. We need to map\n * existing children by their key so we can find them even if they've moved.\n * This allows us to re-use DOM nodes (preserving focus/state) instead of\n * destroying and re-creating them.\n */\nfunction reconcileKeyedChildren(parent, newChildren, oldChildren) {\n  // Map existing children by Key for O(1) lookup\n  const keyed = {}\n  oldChildren.forEach((child, i) => {\n    const key = (child.props && child.props.key) != null ? child.props.key : i\n    keyed[key] = { vNode: child, index: i }\n  })\n\n  newChildren.forEach((newChild, i) => {\n    const key =\n      (newChild.props && newChild.props.key) != null ? newChild.props.key : i\n    const existingChildMatch = keyed[key]\n\n    if (existingChildMatch) {\n      // A. MATCH FOUND - The item existed before\n      const oldVNode = existingChildMatch.vNode\n\n      // Update the node's content recursively\n      patch(parent, newChild, oldVNode, i)\n\n      // If the DOM node isn't in the right spot, move it.\n      // We use oldVNode.el because patch transfers the ref, but just to be safe:\n      const element = newChild.el || oldVNode.el\n\n      // Get the node currently at this index in the real DOM\n      const domChildAtIndex = parent.childNodes[i]\n\n      // If the element exists but is in the wrong place, move it\n      if (element && domChildAtIndex !== element) {\n        parent.insertBefore(element, domChildAtIndex)\n        track('patches')\n      }\n\n      // Remove from map so we know it was re-used\n      delete keyed[key]\n    } else {\n      // B. NO MATCH - This is a new item\n      const newElement = createElement(newChild, getNamespace(parent))\n      const domChildAtIndex = parent.childNodes[i]\n\n      if (domChildAtIndex) {\n        parent.insertBefore(newElement, domChildAtIndex)\n      } else {\n        parent.appendChild(newElement)\n      }\n    }\n  })\n\n  // Remove any old keys that weren't used in the new list\n  Object.values(keyed).forEach(({ vNode }) => {\n    if (vNode.el && vNode.el.parentNode === parent) {\n      runUnmount(vNode) // Clean up hooks\n      parent.removeChild(vNode.el)\n      track('elementsRemoved')\n    }\n  })\n}\n\n/**\n * Executes a Functional Component, tracks hooks, and returns the VNode.\n * @param {import(\"./h.js\").VNode} vNode - The component vNode.\n * @returns {import(\"./h.js\").VNode} The rendered child vNode.\n */\nfunction renderComponent(vNode) {\n  track('componentsRendered')\n\n  // 1. Prepare Hook Container\n  const hooks = {\n    mounts: [],\n    cleanups: [],\n  }\n\n  // 2. Set Global Scope\n  setInstance(hooks)\n\n  // 3. Run the User's Component Function\n  // We pass props as the first argument\n  const renderedVNode = vNode.tag(vNode.props)\n\n  // 4. Clear Global Scope\n  setInstance(null)\n\n  // 5. Attach hooks to the VNode so we can run them later\n  vNode.hooks = hooks\n\n  return renderedVNode\n}\n\n/**\n * Helper to recursively run cleanup hooks when a tree is removed.\n * @param {import(\"./h.js\").VNode} vNode - The vNode to unmount.\n */\nfunction runUnmount(vNode) {\n  if (!vNode) return\n\n  // 1. Run hooks for this node\n  if (vNode.hooks && vNode.hooks.cleanups) {\n    vNode.hooks.cleanups.forEach((fn) => fn())\n  }\n\n  // 2. Recurse into child (if component)\n  if (vNode.child) {\n    runUnmount(vNode.child)\n  }\n\n  // 3. Recurse into children (if element)\n  if (vNode.children) {\n    vNode.children.forEach(runUnmount)\n  }\n}\n\n/**\n * The main diffing function. Compares V-DOM trees and updates the real DOM.\n * @param {HTMLElement} parent - The parent DOM element.\n * @param {import(\"./h.js\").VNode | string | number} newVNode - The new virtual node.\n * @param {import(\"./h.js\").VNode | string | number} oldVNode - The old virtual node.\n * @param {number} [index=0] - The index of the child node (used for simple diffing).\n */\nexport function patch(parent, newVNode, oldVNode, index = 0) {\n  track('diffs')\n\n  // Case 1: Removal - The new node is null/undefined, so we remove the old one.\n  if (newVNode === undefined || newVNode === null) {\n    const el = oldVNode.el || parent.childNodes[index]\n\n    // Recursive Cleanup\n    runUnmount(oldVNode)\n\n    if (el) {\n      parent.removeChild(el)\n      track('elementsRemoved')\n    }\n    return\n  }\n\n  // Case 2: Component - If it's a function, we delegate to the component logic.\n  if (typeof newVNode.tag === 'function') {\n    const isNew = !oldVNode\n\n    const childVNode = renderComponent(newVNode)\n    newVNode.child = childVNode\n\n    const oldChild = oldVNode ? oldVNode.child : undefined\n    patch(parent, childVNode, oldChild, index)\n\n    newVNode.el = childVNode.el\n\n    // Run mount hooks on the next tick\n    if (isNew && newVNode.hooks && newVNode.hooks.mounts.length > 0) {\n      setTimeout(() => {\n        newVNode.hooks.mounts.forEach((fn) => fn())\n      }, 0)\n    }\n    // TODO: Handle updates (running old cleanups if necessary) for Phase 2\n    return\n  }\n\n  // Case 3: Creation - No old node exists, so we create a new one.\n  if (oldVNode === undefined || oldVNode === null) {\n    parent.appendChild(createElement(newVNode, getNamespace(parent)))\n    return\n  }\n\n  // Case 4: Replacement - The node type changed (e.g. div -> span), so we replace it entirely.\n  if (\n    typeof newVNode !== typeof oldVNode ||\n    (typeof newVNode !== 'string' && newVNode.tag !== oldVNode.tag)\n  ) {\n    const el = oldVNode.el || parent.childNodes[index]\n    if (el) {\n      parent.replaceChild(createElement(newVNode, getNamespace(parent)), el)\n      track('patches')\n    }\n    return\n  }\n\n  // Case 5: Text Update - It's a text node, so we just update the text content.\n  if (typeof newVNode === 'string' || typeof newVNode === 'number') {\n    if (newVNode !== oldVNode) {\n      const el = parent.childNodes[index]\n      if (el) {\n        el.nodeValue = String(newVNode)\n        track('patches')\n      } else {\n        // Self healing: if text node missing, append it\n        parent.appendChild(document.createTextNode(String(newVNode)))\n      }\n    }\n    return\n  }\n\n  // Case 6: Update - Same tag, so we update props and recurse into children.\n  const el = oldVNode.el || parent.childNodes[index]\n\n  if (!el) return\n\n  // Transfer DOM reference to the new VNode\n  newVNode.el = el\n\n  patchProps(el, newVNode.props, oldVNode.props)\n\n  reconcileChildren(el, newVNode.children, oldVNode.children)\n}\n","/**\n * @typedef {object} HumnPersist\n * @property {boolean} __humn_persist\n * @property {any} initial\n * @property {PersistConfig} config\n */\n\n/**\n * @typedef {object} PersistConfig\n * @property {string} key\n */\n\n/**\n * Marks a section of the state for persistence in localStorage.\n *\n * @param {any} initial - The initial value of the state.\n * @param {PersistConfig} config - The configuration for persistence.\n * @returns {HumnPersist}\n */\nexport const persist = (initial, config = {}) => ({\n  __humn_persist: true,\n  initial,\n  config,\n})\n","import { getObserver } from './observer.js'\nimport { isDev } from './metrics.js'\n\n/**\n * @typedef {object} Synapses\n * @property {function} set - Function to update the memory\n * @property {function} get - Function to get the memory\n */\n\n/**\n * @typedef {object} CortexParams\n * @property {object} memory - The initial state\n * @property {function(function, function): object} synapses - The synapses function\n */\n\n/**\n * The Cortex class manages the state of the application.\n * This uses a Proxy for fine-grained reactivity, ensuring only those components\n * which use the updated value get re-rendered.\n *\n * WHY: We use Proxies instead of simple getters/setters because it allows us to\n * detect access to nested properties dynamically without needing to declare\n * dependencies upfront. This \"magic\" auto-subscription is what makes Humn's\n * DX so clean.\n */\nexport class Cortex {\n  /**\n   * Creates an instance of Cortex.\n   * @param {CortexParams} CortexParams - The parameters for the Cortex.\n   */\n  constructor({ memory, synapses }) {\n    const liveMemory = { ...memory }\n    this._persistenceMap = new Map()\n\n    // Load in any existing values from local-storage\n    for (const [key, value] of Object.entries(memory)) {\n      if (value && value.__humn_persist) {\n        const storageKey = value.config.key || key\n        this._persistenceMap.set(key, storageKey)\n\n        try {\n          const stored = localStorage.getItem(storageKey)\n          if (stored !== null) {\n            liveMemory[key] = JSON.parse(stored)\n          } else {\n            liveMemory[key] = value.initial\n          }\n        } catch (err) {\n          if (isDev)\n            console.warn(`Humn: Failed to load '${key}' from storage.`, err)\n          liveMemory[key] = value.initial\n        }\n      }\n    }\n\n    this._memory = liveMemory\n    this._listeners = new Map()\n\n    const get = () => this._memory\n\n    const set = (updater) => {\n      let nextState\n      let changedPaths = new Set()\n\n      if (typeof updater === 'function') {\n        const clone = structuredClone(this._memory)\n        const proxy = this._createChangeTrackingProxy(clone, changedPaths)\n        const result = updater(proxy)\n\n        if (result && typeof result === 'object') {\n          nextState = { ...this._memory, ...result }\n          Object.keys(result).forEach((key) => changedPaths.add(key))\n        } else {\n          nextState = clone\n        }\n      } else {\n        nextState = { ...this._memory, ...updater }\n        changedPaths = new Set(Object.keys(updater))\n      }\n\n      this._memory = nextState\n\n      // If we need to persist any of the values\n      // we save them to localStorage here\n      if (this._persistenceMap.size > 0) {\n        this._persistenceMap.forEach((storageKey, stateKey) => {\n          const isDirty = Array.from(changedPaths).some(\n            (path) => path === stateKey || path.startsWith(stateKey + '.'),\n          )\n\n          if (isDirty) {\n            try {\n              const value = this._memory[stateKey]\n              localStorage.setItem(storageKey, JSON.stringify(value))\n            } catch (err) {\n              if (isDev)\n                console.error(`Humn: Failed to save '${stateKey}'.`, err)\n            }\n          }\n        })\n      }\n\n      this._notifyRelevantListeners(changedPaths)\n    }\n\n    this.synapses = synapses(set, get)\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are being mutated.\n   * Includes a GET trap to recursively proxy nested objects for deep mutation tracking.\n   *\n   * WHY: We need to know exactly which paths were changed so we can notify ONLY\n   * the components that care about those specific paths. If we just knew \"something changed\",\n   * we'd have to re-render the whole app (like Redux) or rely on manual optimization.\n   */\n  _createChangeTrackingProxy(obj, changedPaths, path = '') {\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const value = target[prop]\n        const fullPath = path ? `${path}.${prop}` : prop\n\n        // Recursively proxy nested objects so we can trap their sets too\n        if (typeof value === 'object' && value !== null) {\n          return this._createChangeTrackingProxy(value, changedPaths, fullPath)\n        }\n        return value\n      },\n      set: (target, prop, value) => {\n        if (typeof prop === 'symbol' || prop === '__proto__') {\n          target[prop] = value\n          return true\n        }\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        changedPaths.add(fullPath)\n\n        target[prop] = value\n        return true\n      },\n    })\n  }\n\n  /**\n   * Only notify listeners that read properties which changed\n   */\n  _notifyRelevantListeners(changedPaths) {\n    this._listeners.forEach((accessedPaths, renderFn) => {\n      const shouldNotify = Array.from(accessedPaths).some((accessedPath) => {\n        return Array.from(changedPaths).some((changedPath) => {\n          // Check for exact match or parent/child relationship\n          return (\n            accessedPath === changedPath ||\n            accessedPath.startsWith(changedPath + '.') ||\n            changedPath.startsWith(accessedPath + '.')\n          )\n        })\n      })\n\n      if (shouldNotify) renderFn()\n    })\n  }\n\n  /**\n   * Creates a Proxy that tracks which properties are accessed during render\n   *\n   * WHY: This is the other half of the magic. By tracking what a component READS\n   * during its render, we build a precise dependency graph. If a component reads\n   * `state.user.name`, it will only re-render when `state.user.name` changes,\n   * not when `state.count` changes.\n   */\n  _createAccessTrackingProxy(obj, accessedPaths, path = '') {\n    if (typeof obj !== 'object' || obj === null) return obj\n\n    return new Proxy(obj, {\n      get: (target, prop) => {\n        // We don't care about prototype and symbol properties\n        if (typeof prop === 'symbol' || prop === '__proto__')\n          return target[prop]\n\n        const fullPath = path ? `${path}.${prop}` : prop\n        accessedPaths.add(fullPath)\n\n        const value = target[prop]\n\n        // Recursively wrap nested objects\n        if (typeof value === 'object' && value !== null)\n          return this._createAccessTrackingProxy(value, accessedPaths, fullPath)\n\n        return value\n      },\n    })\n  }\n\n  /**\n   * Returns memory wrapped in a tracking Proxy\n   */\n  get memory() {\n    const currentObserver = getObserver()\n\n    if (!currentObserver) return this._memory\n\n    if (!this._listeners.has(currentObserver))\n      this._listeners.set(currentObserver, new Set())\n\n    const accessedPaths = this._listeners.get(currentObserver)\n\n    // This gives us fresh tracking each render\n    accessedPaths.clear()\n\n    return this._createAccessTrackingProxy(this._memory, accessedPaths)\n  }\n}\n","/**\n * @typedef {object} VNode\n * @property {string} tag\n * @property {object} props\n * @property {VNode[]} children\n */\n\n/**\n * Creates a virtual DOM node.\n * This is a hyperscript-like function.\n *\n * @param {string} tag - The tag name of the element.\n * @param {object} props - The properties of the element.\n * @param {VNode[]|VNode} children - The children of the element.\n * @returns {VNode} The virtual DOM node.\n */\nexport const h = (tag, props = {}, children = []) => {\n  const childArray = Array.isArray(children) ? children : [children]\n\n  // Filter out null/false so we don't have \"ghost\" nodes\n  const cleanChildren = childArray\n    .flat()\n    .filter((c) => c !== null && c !== undefined && c !== false && c !== '')\n\n  return {\n    tag,\n    props,\n    children: cleanChildren,\n  }\n}\n","/**\n * @file Mounts the application to the DOM.\n * @module mount\n */\nimport { setObserver } from './observer.js'\nimport { patch } from './patch.js'\n\n/**\n * Mounts a component to a target DOM element.\n * @param {HTMLElement} target - The DOM element to mount to.\n * @param {function} Component - The root component function.\n */\nexport const mount = (target, Component) => {\n  let prevVNode = null\n\n  const lifecycle = () => {\n    setObserver(lifecycle)\n\n    const nextVNode = {\n      tag: Component,\n      props: {},\n      children: [],\n    }\n\n    patch(target, nextVNode, prevVNode)\n    setObserver(null)\n    prevVNode = nextVNode\n  }\n\n  lifecycle()\n}\n","/**\n * @file Lifecycle hooks for components.\n * @module lifecycle\n */\nimport { getInstance } from './observer.js'\n\n/**\n * Registers a callback to run after the component mounts.\n * @param {function} fn - The callback function.\n */\nexport function onMount(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.mounts.push(fn)\n  }\n}\n\n/**\n * Registers a callback to run when the component unmounts.\n * @param {function} fn - The callback function.\n */\nexport function onCleanup(fn) {\n  const instance = getInstance()\n  if (instance) {\n    instance.cleanups.push(fn)\n  }\n}\n"],"names":["g","f","exports","module","define","amd","globalThis","self","Humn","this","currentObserver","currentInstance","getObserver","setObserver","obs","getInstance","setInstance","inst","styleSheet","cache","Set","getNamespace","parent","namespaceURI","SVG_NS","tagName","MATH_NS","hasKeys","children","some","c","props","key","createElement","vNode","namespace","document","createTextNode","String","tag","childVNode","renderComponent","child","el","hooks","mounts","length","setTimeout","forEach","fn","element","createElementNS","patchProps","childNS","appendChild","newProps","oldProps","allProps","oldValue","newValue","startsWith","eventName","slice","toLowerCase","removeEventListener","addEventListener","disabled","setAttribute","removeAttribute","reconcileChildren","newChildren","oldChildren","maxLen","Math","max","i","patch","keyed","index","newChild","existingChildMatch","oldVNode","domChildAtIndex","childNodes","insertBefore","newElement","Object","values","parentNode","runUnmount","removeChild","cleanups","renderedVNode","newVNode","isNew","replaceChild","nodeValue","Cortex","constructor","memory","synapses","liveMemory","_persistenceMap","Map","value","entries","__humn_persist","storageKey","config","set","stored","localStorage","getItem","JSON","parse","initial","err","_memory","_listeners","updater","nextState","changedPaths","clone","structuredClone","result","_createChangeTrackingProxy","keys","add","size","stateKey","Array","from","path","setItem","stringify","_notifyRelevantListeners","obj","Proxy","get","target","prop","fullPath","accessedPaths","renderFn","accessedPath","changedPath","_createAccessTrackingProxy","has","clear","css","stringsOrStr","args","raw","isSingleRoot","isArray","reduce","acc","str","content","replace","trim","hash","charCodeAt","toString","hashedClassName","id","head","textContent","h","flat","filter","mount","Component","prevVNode","lifecycle","nextVNode","onCleanup","instance","push","onMount","persist","defineProperty","Symbol","toStringTag"],"mappings":"CAAA,SAAAA,EAAAC,EAAAA,CAAA,OAAAC,SAAA,iBAAAC,OAAA,IAAAF,EAAAC,OAAAA,EAAA,OAAAE,QAAA,YAAAA,OAAAC,IAAAD,OAAA,CAAA,WAAAH,CAAAA,EAAAA,GAAAD,EAAA,OAAAM,WAAA,IAAAA,WAAAN,GAAAO,MAAAC,KAAA,CAAA,CAAA,CAAA,GAAAC,KAAA,SAAAP,EAAAA,CAAA,aAKA,IAAIQ,EAAkB,KAClBC,EAAkB,KAMf,MAAMC,EAAc,IAAMF,EAMpBG,EAAeC,IAC1BJ,EAAkBI,CAAAA,EAOPC,EAAc,IAAMJ,EAMpBK,EAAeC,GAAAA,CAC1BN,EAAkBM,CAAAA,EC5BpB,IAAIC,EAAa,KACjB,MAAMC,EAAQ,IAAIC,ICElB,SAASC,EAAaC,EAAAA,CACpB,OAAIA,EAAOC,eAAiBC,GAAUF,EAAOG,UAAY,gBAChDD,EAELF,EAAOC,eAAiBG,EACnBA,EAEF,IACT,CAOO,SAASC,EAAQC,EAAAA,CACtB,OAAOA,GAAYA,EAASC,KAAMC,GAAMA,GAAKA,EAAEC,OAASD,EAAEC,MAAMC,KAAO,IAAPA,CAClE,CAEA,MAAMR,EAAS,6BACTE,EAAU,qCAOhB,SAASO,EAAcC,EAAOC,EAAAA,CAC5B,GAAqB,OAAVD,GAAU,UAA6B,OAAVA,GAAU,SAChD,OAAOE,SAASC,eAAeC,OAAOJ,CAAAA,CAAAA,EAGxC,GAAyB,OAAdA,EAAMK,KAAQ,WAAY,CACnC,MAAMC,EAAaC,EAAgBP,CAAAA,EACnCA,EAAMQ,MAAQF,EAEd,MAAMG,EAAKV,EAAcO,EAAYL,CAAAA,EAMrC,OAJAD,EAAMS,GAAKA,EACPT,EAAMU,OAAOC,OAAOC,OAAS,GAC/BC,WAAW,IAAMb,EAAMU,MAAMC,OAAOG,QAASC,GAAOA,EAAAA,CAAAA,EAAO,GAEtDN,CACT,CAIA,MAAMJ,EAAML,EAAMK,IAGdA,IAAQ,MAAOJ,EAAYX,EACtBe,IAAQ,SAAQJ,EAAYT,GAMrC,MAAMwB,EAAUf,EACZC,SAASe,gBAAgBhB,EAAWI,CAAAA,EACpCH,SAASH,cAAcM,GAE3BL,EAAMS,GAAKO,EACXE,EAAWF,EAAShB,EAAMH,KAAAA,EAG1B,MAAMsB,EAAUd,IAAQ,gBAAkB,KAAOJ,EAMjD,OAJAD,EAAMN,SAASoB,QAASN,GAAAA,CACtBQ,EAAQI,YAAYrB,EAAcS,EAAOW,CAAAA,CAAAA,CAAAA,CAAAA,EAGpCH,CACT,CAYA,SAASE,EAAWF,EAASK,EAAW,CAAA,EAAIC,EAAW,CAAA,GACrD,GAAA,CAAKN,EAAS,OAEd,MAAMO,EAAW,CAAA,GAAKD,EAAAA,GAAaD,CAAAA,EAEnC,UAAWvB,KAAOyB,EAAU,CAC1B,MAAMC,EAAWF,EAASxB,CAAAA,EACpB2B,EAAWJ,EAASvB,GAG1B,GAAI2B,GAAAA,KAOJ,GAAI3B,IAAQ,SAAWA,IAAQ,WAS/B,GAAI0B,IAAaC,EAAjB,CAKA,GAAI3B,EAAI4B,WAAW,IAAA,EAAO,CACxB,MAAMC,EAAY7B,EAAI8B,MAAM,CAAA,EAAGC,YAAAA,EAC3BL,GAAUR,EAAQc,oBAAoBH,EAAWH,CAAAA,EACrDR,EAAQe,iBAAiBJ,EAAWF,CAAAA,CACtC,CAEI3B,IAAQ,WACVkB,EAAQgB,SAAWP,IAAXO,IAAgCP,IAAa,OAIrDT,EAAQiB,aAAanC,EAAK2B,EAhBD,OARrBT,EAAQlB,CAAAA,IAAS2B,IACnBT,EAAQlB,CAAAA,EAAO2B,QARjBT,EAAQkB,gBAAgBpC,CAAAA,CAiC5B,CACF,CAcA,SAASqC,EAAkB/C,EAAQgD,EAAaC,EAAAA,CAK9C,GAAA,EAJgB5C,EAAQ2C,CAAAA,GAAgB3C,EAAQ4C,CAAAA,GAIlC,CACZ,MAAMC,EAASC,KAAKC,IAAIJ,EAAYxB,OAAQyB,EAAYzB,MAAAA,EACxD,QAAS6B,EAAI,EAAGA,EAAIH,EAAQG,IAC1BC,EAAMtD,EAAQgD,EAAYK,CAAAA,EAAIJ,EAAYI,CAAAA,EAAIA,CAAAA,EAEhD,MACF,EAaF,SAAgCrD,EAAQgD,EAAaC,EAAAA,CAEnD,MAAMM,EAAQ,CAAA,EACdN,EAAYvB,QAAQ,CAACN,EAAOiC,IAAAA,CAC1B,MAAM3C,GAAOU,EAAMX,OAASW,EAAMX,MAAMC,MAAQ,KAAOU,EAAMX,MAAMC,IAAM2C,EACzEE,EAAM7C,CAAAA,EAAO,CAAEE,MAAOQ,EAAOoC,MAAOH,CAAAA,CAAAA,CAAAA,EAGtCL,EAAYtB,QAAQ,CAAC+B,EAAUJ,IAAAA,CAC7B,MAAM3C,GACH+C,EAAShD,OAASgD,EAAShD,MAAMC,MAAQ,KAAO+C,EAAShD,MAAMC,IAAM2C,EAClEK,EAAqBH,EAAM7C,CAAAA,EAEjC,GAAIgD,EAAoB,CAEtB,MAAMC,EAAWD,EAAmB9C,MAGpC0C,EAAMtD,EAAQyD,EAAUE,EAAUN,CAAAA,EAIlC,MAAMzB,EAAU6B,EAASpC,IAAMsC,EAAStC,GAGlCuC,EAAkB5D,EAAO6D,WAAWR,CAAAA,EAGtCzB,GAAWgC,IAAoBhC,GACjC5B,EAAO8D,aAAalC,EAASgC,CAAAA,EAAAA,OAKxBL,EAAM7C,CAAAA,CACf,KAAO,CAEL,MAAMqD,EAAapD,EAAc8C,EAAU1D,EAAaC,CAAAA,CAAAA,EAClD4D,EAAkB5D,EAAO6D,WAAWR,CAAAA,EAEtCO,EACF5D,EAAO8D,aAAaC,EAAYH,CAAAA,EAEhC5D,EAAOgC,YAAY+B,CAAAA,CAEvB,IAIFC,OAAOC,OAAOV,CAAAA,EAAO7B,QAAQ,EAAGd,MAAAA,CAAAA,IAAAA,CAC1BA,EAAMS,IAAMT,EAAMS,GAAG6C,aAAelE,IACtCmE,EAAWvD,GACXZ,EAAOoE,YAAYxD,EAAMS,EAAAA,EAAAA,CAAAA,CAI/B,GAnEyBrB,EAAQgD,EAAaC,CAAAA,CAC9C,CAyEA,SAAS9B,EAAgBP,EAAAA,CAIvB,MAAMU,EAAQ,CACZC,OAAQ,CAAA,EACR8C,SAAU,IAIZ3E,EAAY4B,CAAAA,EAIZ,MAAMgD,EAAgB1D,EAAMK,IAAIL,EAAMH,KAAAA,EAQtC,OALAf,EAAY,IAAA,EAGZkB,EAAMU,MAAQA,EAEPgD,CACT,CAMA,SAASH,EAAWvD,GACbA,IAGDA,EAAMU,OAASV,EAAMU,MAAM+C,UAC7BzD,EAAMU,MAAM+C,SAAS3C,QAASC,GAAOA,EAAAA,CAAAA,EAInCf,EAAMQ,OACR+C,EAAWvD,EAAMQ,KAAAA,EAIfR,EAAMN,UACRM,EAAMN,SAASoB,QAAQyC,CAAAA,EAE3B,CASO,SAASb,EAAMtD,EAAQuE,EAAUZ,EAAUH,EAAQ,EAAA,CAIxD,GAAIe,GAAAA,KAA6C,CAC/C,MAAMlD,EAAKsC,EAAStC,IAAMrB,EAAO6D,WAAWL,CAAAA,EAS5C,OANAW,EAAWR,QAEPtC,GACFrB,EAAOoE,YAAY/C,CAAAA,EAIvB,CAGA,GAA4B,OAAjBkD,EAAStD,KAAQ,WAAY,CACtC,MAAMuD,EAAAA,CAASb,EAETzC,EAAaC,EAAgBoD,CAAAA,EACnCA,OAAAA,EAASnD,MAAQF,EAGjBoC,EAAMtD,EAAQkB,EADGyC,EAAWA,EAASvC,MAAAA,OACDoC,CAAAA,EAEpCe,EAASlD,GAAKH,EAAWG,GAAAA,KAGrBmD,GAASD,EAASjD,OAASiD,EAASjD,MAAMC,OAAOC,OAAS,GAC5DC,WAAW,IAAA,CACT8C,EAASjD,MAAMC,OAAOG,QAASC,GAAOA,EAAAA,CAAAA,CAAAA,EACrC,GAIP,CAGA,GAAIgC,GAAAA,KAEF,OAAA,KADA3D,EAAOgC,YAAYrB,EAAc4D,EAAUxE,EAAaC,KAK1D,GAAA,OACSuE,GAAAA,OAAoBZ,GACN,OAAbY,GAAa,UAAYA,EAAStD,MAAQ0C,EAAS1C,IAC3D,CACA,MAAMI,EAAKsC,EAAStC,IAAMrB,EAAO6D,WAAWL,CAAAA,EAK5C,OAAA,KAJInC,GACFrB,EAAOyE,aAAa9D,EAAc4D,EAAUxE,EAAaC,CAAAA,CAAAA,EAAUqB,CAAAA,EAIvE,CAGA,UAAWkD,GAAa,UAAgC,OAAbA,GAAa,SAAU,CAChE,GAAIA,IAAaZ,EAAU,CACzB,MAAMtC,EAAKrB,EAAO6D,WAAWL,CAAAA,EACzBnC,EACFA,EAAGqD,UAAY1D,OAAOuD,CAAAA,EAItBvE,EAAOgC,YAAYlB,SAASC,eAAeC,OAAOuD,IAEtD,CACA,MACF,CAGA,MAAMlD,EAAKsC,EAAStC,IAAMrB,EAAO6D,WAAWL,GAEvCnC,IAGLkD,EAASlD,GAAKA,EAEdS,EAAWT,EAAIkD,EAAS9D,MAAOkD,EAASlD,KAAAA,EAExCsC,EAAkB1B,EAAIkD,EAASjE,SAAUqD,EAASrD,QAAAA,EACpD,CClWC1B,EAAA+F,OCEM,KAAA,CAKL,YAAAC,CAAYC,OAAEA,EAAMC,SAAEA,CAAAA,EAAAA,CACpB,MAAMC,EAAa,CAAA,GAAKF,CAAAA,EACxB1F,KAAK6F,gBAAkB,IAAIC,IAG3B,SAAK,CAAOvE,EAAKwE,KAAUlB,OAAOmB,QAAQN,CAAAA,EACxC,GAAIK,GAASA,EAAME,eAAgB,CACjC,MAAMC,EAAaH,EAAMI,OAAO5E,KAAOA,EACvCvB,KAAK6F,gBAAgBO,IAAI7E,EAAK2E,CAAAA,EAE9B,IACE,MAAMG,EAASC,aAAaC,QAAQL,CAAAA,EAElCN,EAAWrE,CAAAA,EADT8E,IAAW,KACKG,KAAKC,MAAMJ,CAAAA,EAEXN,EAAMW,OAE5B,MAASC,CAGPf,EAAWrE,GAAOwE,EAAMW,OAC1B,CACF,CAGF1G,KAAK4G,QAAUhB,EACf5F,KAAK6G,WAAa,IAAIf,IAiDtB9F,KAAK2F,SAAWA,EA7CHmB,IACX,IAAIC,EACAC,EAAe,IAAIrG,IAEvB,GAAuB,OAAZmG,GAAY,WAAY,CACjC,MAAMG,EAAQC,gBAAgBlH,KAAK4G,SAE7BO,EAASL,EADD9G,KAAKoH,2BAA2BH,EAAOD,CAAAA,CAAAA,EAGjDG,GAA4B,OAAXA,GAAW,UAC9BJ,EAAY,CAAA,GAAK/G,KAAK4G,QAAAA,GAAYO,CAAAA,EAClCtC,OAAOwC,KAAKF,CAAAA,EAAQ5E,QAAShB,GAAQyF,EAAaM,IAAI/F,CAAAA,CAAAA,GAEtDwF,EAAYE,CAEhB,MACEF,EAAY,CAAA,GAAK/G,KAAK4G,QAAAA,GAAYE,GAClCE,EAAe,IAAIrG,IAAIkE,OAAOwC,KAAKP,CAAAA,CAAAA,EAGrC9G,KAAK4G,QAAUG,EAIX/G,KAAK6F,gBAAgB0B,KAAO,GAC9BvH,KAAK6F,gBAAgBtD,QAAQ,CAAC2D,EAAYsB,KAKxC,GAJgBC,MAAMC,KAAKV,CAAAA,EAAc5F,KACtCuG,GAASA,IAASH,GAAYG,EAAKxE,WAAWqE,EAAW,GAAA,CAAA,EAI1D,GAAA,CACE,MAAMzB,EAAQ/F,KAAK4G,QAAQY,CAAAA,EAC3BlB,aAAasB,QAAQ1B,EAAYM,KAAKqB,UAAU9B,CAAAA,CAAAA,CAClD,MAASY,CAGT,CAAA,CAAA,EAKN3G,KAAK8H,yBAAyBd,CAAAA,CAAAA,EA5CpB,IAAMhH,KAAK4G,QAgDzB,CAUA,2BAA2BmB,EAAKf,EAAcW,EAAO,GAAA,CACnD,OAAO,IAAIK,MAAMD,EAAK,CACpBE,IAAK,CAACC,EAAQC,IAAAA,CACZ,GAAoB,OAATA,GAAS,UAAYA,IAAS,YACvC,OAAOD,EAAOC,CAAAA,EAEhB,MAAMpC,EAAQmC,EAAOC,CAAAA,EACfC,EAAWT,EAAO,GAAGA,CAAAA,IAAQQ,CAAAA,GAASA,EAG5C,OAAqB,OAAVpC,GAAU,UAAYA,IAAU,KAClC/F,KAAKoH,2BAA2BrB,EAAOiB,EAAcoB,GAEvDrC,CAAAA,EAETK,IAAK,CAAC8B,EAAQC,EAAMpC,IAAAA,CAClB,GAAoB,OAAToC,GAAS,UAAYA,IAAS,YAEvC,OADAD,EAAOC,CAAAA,EAAQpC,KAIjB,MAAMqC,EAAWT,EAAO,GAAGA,CAAAA,IAAQQ,CAAAA,GAASA,EAI5C,OAHAnB,EAAaM,IAAIc,CAAAA,EAEjBF,EAAOC,GAAQpC,EAAAA,EACR,CAAA,CAAA,CAGb,CAKA,yBAAyBiB,EAAAA,CACvBhH,KAAK6G,WAAWtE,QAAQ,CAAC8F,EAAeC,IAAAA,CACjBb,MAAMC,KAAKW,GAAejH,KAAMmH,GAC5Cd,MAAMC,KAAKV,GAAc5F,KAAMoH,GAGlCD,IAAiBC,GACjBD,EAAapF,WAAWqF,EAAc,GAAA,GACtCA,EAAYrF,WAAWoF,EAAe,GAAA,CAAA,CAAA,GAK1BD,EAAAA,CAAAA,CAAAA,CAEtB,CAUA,2BAA2BP,EAAKM,EAAeV,EAAO,GAAA,CACpD,OAAmB,OAARI,GAAQ,UAAYA,IAAQ,KAAaA,EAE7C,IAAIC,MAAMD,EAAK,CACpBE,IAAK,CAACC,EAAQC,KAEZ,GAAoB,OAATA,GAAS,UAAYA,IAAS,YACvC,OAAOD,EAAOC,CAAAA,EAEhB,MAAMC,EAAWT,EAAO,GAAGA,CAAAA,IAAQQ,CAAAA,GAASA,EAC5CE,EAAcf,IAAIc,CAAAA,EAElB,MAAMrC,EAAQmC,EAAOC,CAAAA,EAGrB,cAAWpC,GAAU,UAAYA,IAAU,KAClC/F,KAAKyI,2BAA2B1C,EAAOsC,EAAeD,CAAAA,EAExDrC,CAAAA,CAAAA,CAAAA,CAGb,CAKA,IAAA,QAAIL,CACF,MAAMzF,EAAkBE,IAExB,GAAA,CAAKF,EAAiB,OAAOD,KAAK4G,QAE7B5G,KAAK6G,WAAW6B,IAAIzI,CAAAA,GACvBD,KAAK6G,WAAWT,IAAInG,EAAiB,IAAIU,KAE3C,MAAM0H,EAAgBrI,KAAK6G,WAAWoB,IAAIhI,CAAAA,EAK1C,OAFAoI,EAAcM,QAEP3I,KAAKyI,2BAA2BzI,KAAK4G,QAASyB,EACvD,CAAA,ED/LD5I,EAAAmJ,IFgBM,SAAaC,KAAiBC,EAAAA,CACnC,IAAIC,EAAM,GACNC,KAGAvB,MAAMwB,QAAQJ,CAAAA,GAAiBA,EAAaE,IAC9CA,EAAMF,EAAaK,OAAO,CAACC,EAAKC,EAAKlF,IAC5BiF,EAAMC,GAAON,EAAK5E,CAAAA,GAAM,IAC9B,EAAA,GAEH6E,EAAMF,EAENG,EAAeF,EAAK,CAAA,IAApBE,IAEF,IAAIK,GA5BN,SAAgBT,GACd,OAAOA,EACJU,QAAQ,oBAAqB,IAC7BA,QAAQ,OAAQ,GAAA,EAChBC,KAAAA,CACL,GAuBuBR,CAAAA,EAErB,GAAA,CAAKM,EAAS,MAAO,GAEjBL,IAYFK,EAAUA,EAAQC,QAChB,qFACA,aAAA,GAIJ,MAAME,GAhER,SAAoBJ,EAAAA,CAClB,IAAII,EAAO,KACPtF,EAAIkF,EAAI/G,OACZ,KAAO6B,GACLsF,EAAe,GAAPA,EAAaJ,EAAIK,aAAavF,CAAAA,EAExC,OAAQsF,IAAS,GAAGE,SAAS,EAAA,CAC/B,GAyD0BL,CAAAA,EAClBM,EAAkB,QAAQH,CAAAA,GAEhC,OAAI9I,EAAMgI,IAAIc,CAAAA,IAIT/I,IACHA,EAAakB,SAASH,cAAc,OAAA,EACpCf,EAAWmJ,GAAK,cAChBjI,SAASkI,KAAKhH,YAAYpC,CAAAA,GAG5BA,EAAWqJ,aAAe,IAAIH,CAAAA;AAAAA,MAC1BN,CAAAA;AAAAA;AAAAA,EAEJ3I,EAAM4G,IAAIkC,CAAAA,GAZDG,CAeX,EEvEClK,EAAAsK,EEPgB,CAACjI,EAAKR,EAAQ,CAAA,EAAIH,EAAW,CAAA,KAQrC,CACLW,MACAR,MAAAA,EACAH,UAViBsG,MAAMwB,QAAQ9H,GAAYA,EAAW,CAACA,CAAAA,GAItD6I,KAAAA,EACAC,OAAQ5I,GAAMA,GAAAA,MAAiCA,IAAjCA,IAAgDA,IAAM,EAANA,CAAAA,GFClE5B,EAAAyK,MGXoB,CAAChC,EAAQiC,IAAAA,CAC5B,IAAIC,EAAY,KAEhB,MAAMC,EAAY,IAAA,CAChBjK,EAAYiK,GAEZ,MAAMC,EAAY,CAChBxI,IAAKqI,EACL7I,MAAO,CAAA,EACPH,SAAU,IAGZgD,EAAM+D,EAAQoC,EAAWF,CAAAA,EACzBhK,EAAY,IAAA,EACZgK,EAAYE,CAAAA,EAGdD,EAAAA,CAAAA,EHND5K,EAAA8K,UIFM,SAAmB/H,EAAAA,CACxB,MAAMgI,EAAWlK,EAAAA,EACbkK,GACFA,EAAStF,SAASuF,KAAKjI,CAAAA,CAE3B,EJHC/C,EAAAiL,QIbM,SAAiBlI,EAAAA,CACtB,MAAMgI,EAAWlK,IACbkK,GACFA,EAASpI,OAAOqI,KAAKjI,EAEzB,EJQC/C,EAAAkL,QAJsB,CAACjE,EAASP,EAAS,MAAE,CAC1CF,kBACAS,QAAAA,EACAP,OAAAA,CAAAA,GACDtB,OAAA+F,eAAAnL,EAAAoL,OAAAC,YAAA,CAAA/E,MAAA,QAAA,CAAA,CAAA,CAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "humn",
-  "version": "1.3.2",
+  "version": "1.3.3",
   "description": "A minimal, human-centric reactive UI library with built in state management.",
   "keywords": [
     "reactive",