@geajs/ui 0.2.9 → 0.2.10

package/dist/compiled-reactive-component.mjs

@@ -4,34 +4,65 @@ import { i as GEA_SET_PROPS, n as GEA_DISPOSER, r as GEA_OBSERVE_DIRECT, t as GE
 import { t as getComponentId } from "./component-id.mjs";
 import { n as _DIRTY_PROPS, t as _DIRTY } from "./dirty-symbols.mjs";
 //#region ../gea/src/runtime/compiled-store.ts
-const _priv = /* @__PURE__ */ new WeakMap();
-const _nestedCache = /* @__PURE__ */ new WeakMap();
-const _isArr = Array.isArray;
+const _PRIV = Symbol("gea.store.priv");
+const _NESTED = Symbol("gea.store.nested");
+/**
+* `O`/`V` are generic (not `object`/`any`) — this helper hides a value under
+* a symbol key on WHATEVER object it's called with (the raw store, its
+* proxy, a Map cache, ...), so its own declaration can't pin a single
+* concrete shape; each call site supplies its own concrete `O`/`V`.
+*/
+function _hidden(target, key, value) {
+	Object.defineProperty(target, key, {
+		value,
+		writable: true,
+		configurable: true,
+		enumerable: false
+	});
+}
+/** Same shape as `_hidden`: a generic reflection probe, not tied to one type. */
 function _isPlain(v) {
 	if (!v || typeof v !== "object") return false;
 	const p = Object.getPrototypeOf(v);
-	return p === Object.prototype || p === null || _isArr(v);
+	return p === Object.prototype || p === null || Array.isArray(v);
 }
+/** Unwrap a proxy value to its raw target, preserving whatever type it was. */
 function _unwrap(v) {
 	return v && v[GEA_PROXY_RAW] || v;
 }
+function _fireBucket(bucket, value, changes) {
+	if (bucket.size === 0) return;
+	if (bucket.size === 1) for (const h of bucket) {
+		h(value, changes);
+		return;
+	}
+	const snapshot = [];
+	for (const h of bucket) snapshot.push(h);
+	for (let i = 0; i < snapshot.length; i++) try {
+		snapshot[i](value, changes);
+	} catch {}
+}
 function _flush(raw, state) {
 	state.scheduled = false;
 	const pending = state.pending;
 	if (!pending || pending.size === 0) return;
 	state.pending = void 0;
 	let allChanges = null;
-	for (const [prop, changes] of pending) {
+	for (const entry of pending) {
+		const prop = entry[0];
+		const changes = entry[1];
 		if (state.rootObservers || state.derived) {
 			allChanges ??= [];
 			for (let i = 0; i < changes.length; i++) allChanges.push(changes[i]);
 		}
 		const bucket = state.observers?.get(prop);
 		if (!bucket || bucket.size === 0) continue;
-		for (const h of bucket) h(raw[prop], changes);
+		_fireBucket(bucket, raw[prop], changes);
 	}
-	if (allChanges && state.rootObservers) for (const h of state.rootObservers) h(raw, allChanges);
-	if (allChanges && state.derived) for (const [prop, bucket] of state.derived) {
+	if (allChanges && state.rootObservers) _fireBucket(state.rootObservers, raw, allChanges);
+	if (allChanges && state.derived) for (const entry of state.derived) {
+		const prop = entry[0];
+		const bucket = entry[1];
 		if (bucket.size === 0) continue;
 		let value;
 		try {
@@ -39,11 +70,15 @@ function _flush(raw, state) {
 		} catch {
 			continue;
 		}
-		for (const h of bucket) h(value, allChanges);
+		_fireBucket(bucket, value, allChanges);
 	}
 }
+function _hasQueuedConsumers(state, prop) {
+	const bucket = state.observers?.get(prop);
+	return !!(bucket && bucket.size > 0 || state.rootObservers && state.rootObservers.size > 0 || state.derived && state.derived.size > 0);
+}
 function _queue(raw, state, prop, change = {}) {
-	if (!state.ready || !state.observers?.has(prop)) return;
+	if (!state.ready || !_hasQueuedConsumers(state, prop)) return;
 	const rec = {
 		prop,
 		pathParts: [prop],
@@ -60,19 +95,31 @@ function _queue(raw, state, prop, change = {}) {
 		queueMicrotask(() => _flush(raw, state));
 	}
 }
+/**
+* Nested object/array traversal INSIDE one of `S`'s own fields (e.g.
+* `store.list[0].name`): once inside a field's own substructure, the shape
+* is no longer described by `S` (a field's element/property types aren't
+* modeled recursively here) — `V` is a genuinely open per-call type at this
+* depth, kept as a type parameter rather than `any` so it's at least
+* threaded through instead of erased, but this is the one spot in this file
+* that's honestly a dynamic-JS-object-graph boundary: how deep a nested
+* value's shape goes isn't knowable without walking `S` structurally.
+*/
 function _wrapNested(raw, state, target, rootProp) {
 	if (!_isPlain(target)) return target;
-	let perTarget = _nestedCache.get(target);
+	const targetObj = target;
+	let perTarget = targetObj[_NESTED];
 	if (perTarget) {
 		const cached = perTarget.get(rootProp);
 		if (cached) return cached;
 	}
-	const proxy = new Proxy(target, {
+	const proxy = new Proxy(targetObj, {
 		get(obj, prop) {
 			if (prop === GEA_PROXY_RAW) return obj;
 			if (typeof prop === "symbol") return obj[prop];
+			trackRead(raw, rootProp);
 			const val = obj[prop];
-			if (_isArr(obj) && typeof val === "function") {
+			if (Array.isArray(obj) && typeof val === "function") {
 				if (prop === "push") return (...args) => {
 					const start = obj.length;
 					const result = Array.prototype.push.apply(obj, args.map(_unwrap));
@@ -81,6 +128,7 @@ function _wrapNested(raw, state, target, rootProp) {
 						start,
 						count: obj.length - start
 					});
+					else _queue(raw, state, rootProp);
 					return result;
 				};
 				if (prop === "splice") return (...args) => {
@@ -99,7 +147,26 @@ function _wrapNested(raw, state, target, rootProp) {
 							count: before - after
 						});
 						else _queue(raw, state, rootProp, { type: "reorder" });
-					}
+					} else _queue(raw, state, rootProp);
+					return result;
+				};
+				if (prop === "pop" || prop === "shift") return (...args) => {
+					const before = obj.length;
+					const result = Array.prototype[prop].apply(obj, args);
+					const after = obj.length;
+					if (obj === raw[rootProp] && after < before) _queue(raw, state, rootProp, {
+						type: "remove",
+						start: prop === "pop" ? after : 0,
+						count: 1
+					});
+					else _queue(raw, state, rootProp);
+					return result;
+				};
+				if (prop === "unshift" || prop === "sort" || prop === "reverse") return (...args) => {
+					const callArgs = prop === "unshift" ? args.map(_unwrap) : args;
+					const result = Array.prototype[prop].apply(obj, callArgs);
+					if (obj === raw[rootProp]) _queue(raw, state, rootProp, { type: "reorder" });
+					else _queue(raw, state, rootProp);
 					return result;
 				};
 			}
@@ -114,7 +181,7 @@ function _wrapNested(raw, state, target, rootProp) {
 			const old = obj[prop];
 			if (old === value) return true;
 			obj[prop] = value;
-			if (_isArr(obj)) {
+			if (Array.isArray(obj)) {
 				if (value && typeof value === "object") value[_DIRTY] = true;
 				const idx = +prop;
 				if (Number.isInteger(idx) && obj === raw[rootProp]) {
@@ -135,11 +202,25 @@ function _wrapNested(raw, state, target, rootProp) {
 				newValue: value
 			});
 			return true;
+		},
+		deleteProperty(obj, prop) {
+			if (typeof prop === "symbol") {
+				delete obj[prop];
+				return true;
+			}
+			const old = obj[prop];
+			delete obj[prop];
+			if (!Array.isArray(obj)) obj[_DIRTY] = true;
+			_queue(raw, state, rootProp, {
+				previousValue: old,
+				type: "delete"
+			});
+			return true;
 		}
 	});
 	if (!perTarget) {
 		perTarget = /* @__PURE__ */ new Map();
-		_nestedCache.set(target, perTarget);
+		_hidden(targetObj, _NESTED, perTarget);
 	}
 	perTarget.set(rootProp, proxy);
 	return proxy;
@@ -147,7 +228,7 @@ function _wrapNested(raw, state, target, rootProp) {
 var CompiledStore = class {
 	constructor() {
 		const state = { ready: false };
-		_priv.set(this, state);
+		_hidden(this, _PRIV, state);
 		const proxy = new Proxy(this, {
 			get(target, prop, receiver) {
 				if (prop === GEA_PROXY_RAW) return target;
@@ -164,8 +245,14 @@ var CompiledStore = class {
 				}
 				value = _unwrap(value);
 				const old = target[prop];
-				if (old === value && prop in target) return true;
-				if (old && typeof old === "object") _nestedCache.delete(old);
+				if (old === value && prop in target) {
+					if (Array.isArray(value)) _queue(target, state, prop, {
+						previousValue: old,
+						newValue: value
+					});
+					return true;
+				}
+				if (old && typeof old === "object") delete old[_NESTED];
 				target[prop] = value;
 				const direct = state.direct?.get(prop);
 				if (direct) for (const h of direct) h(value);
@@ -176,22 +263,28 @@ var CompiledStore = class {
 				return true;
 			}
 		});
-		_priv.set(proxy, state);
+		_hidden(proxy, _PRIV, state);
 		this[GEA_STORE_ROOT] = proxy;
 		return proxy;
 	}
 	observe(pathOrProp, handler) {
-		const state = _priv.get(this);
+		const state = this[_PRIV];
 		if (!state) return () => {};
 		state.ready = true;
 		const isArr = Array.isArray(pathOrProp);
-		if (isArr && pathOrProp.length === 0 || pathOrProp === "") {
+		let path = [];
+		let text = "";
+		if (typeof pathOrProp === "string") text = pathOrProp;
+		else path = pathOrProp;
+		if (isArr && path.length === 0 || !isArr && text === "") {
 			const bucket = state.rootObservers ?? (state.rootObservers = /* @__PURE__ */ new Set());
 			bucket.add(handler);
-			return () => bucket.delete(handler);
+			return () => {
+				bucket.delete(handler);
+			};
 		}
-		const prop = isArr ? pathOrProp[0] : pathOrProp;
-		const tail = isArr && pathOrProp.length > 1 ? pathOrProp.slice(1) : null;
+		const prop = isArr ? path[0] ?? "" : text;
+		const tail = isArr && path.length > 1 ? path.slice(1) : null;
 		const finalHandler = tail ? (value, changes) => {
 			let next = value;
 			for (let i = 0; i < tail.length; i++) {
@@ -212,17 +305,21 @@ var CompiledStore = class {
 		let bucket = observers.get(prop);
 		if (!bucket) observers.set(prop, bucket = /* @__PURE__ */ new Set());
 		bucket.add(finalHandler);
-		return () => bucket.delete(finalHandler);
+		return () => {
+			bucket.delete(finalHandler);
+		};
 	}
 	[GEA_OBSERVE_DIRECT](prop, handler) {
-		const state = _priv.get(this);
+		const state = this[_PRIV];
 		if (!state) return () => {};
 		state.ready = true;
 		const direct = state.direct ?? (state.direct = /* @__PURE__ */ new Map());
 		let bucket = direct.get(prop);
 		if (!bucket) direct.set(prop, bucket = /* @__PURE__ */ new Set());
 		bucket.add(handler);
-		return () => bucket.delete(handler);
+		return () => {
+			bucket.delete(handler);
+		};
 	}
 };
 //#endregion
@@ -257,7 +354,8 @@ var CompiledReactiveComponent = class CompiledReactiveComponent extends Compiled
 			configurable: true,
 			get: () => thunks[k]()
 		});
-		if (typeof thunks.children === "function") {
+		const childrenThunk = thunks.children;
+		if (typeof childrenThunk === "function") {
 			let cached = void 0;
 			let cacheNode = false;
 			Object.defineProperty(out, "children", {
@@ -265,8 +363,8 @@ var CompiledReactiveComponent = class CompiledReactiveComponent extends Compiled
 				configurable: true,
 				get: () => {
 					if (cacheNode) return cached;
-					const v = thunks.children();
-					if (v && typeof v.nodeType === "number") {
+					const v = childrenThunk();
+					if (v !== null && typeof v === "object" && typeof v.nodeType === "number") {
 						cached = v;
 						cacheNode = true;
 					}

package/dist/compiled-reactive-component.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"compiled-reactive-component.mjs","names":["GEA_DIRTY","GEA_DIRTY_PROPS"],"sources":["../../gea/src/runtime/compiled-store.ts","../../gea/src/runtime/compiled-reactive-component.ts"],"sourcesContent":["import { GEA_PROXY_RAW, GEA_STORE_ROOT } from './symbols'\nimport { GEA_OBSERVE_DIRECT } from './internal-symbols'\nimport { GEA_DIRTY, GEA_DIRTY_PROPS } from './dirty-symbols'\nimport { trackRead } from './with-tracking'\n\ntype Handler = (value: any, changes?: any[]) => void\n\ninterface StoreState {\n  observers?: Map<string, Set<Handler>>\n  rootObservers?: Set<Handler>\n  derived?: Map<string, Set<Handler>>\n  direct?: Map<string, Set<(value: any) => void>>\n  pending?: Map<string, any[]>\n  scheduled?: boolean\n  ready?: boolean\n}\n\nconst _priv = new WeakMap<any, StoreState>()\nconst _nestedCache = new WeakMap<object, Map<string, any>>()\nconst _isArr = Array.isArray\n\nfunction _isPlain(v: any): boolean {\n  if (!v || typeof v !== 'object') return false\n  const p = Object.getPrototypeOf(v)\n  return p === Object.prototype || p === null || _isArr(v)\n}\n\nfunction _unwrap(v: any): any {\n  return (v && v[GEA_PROXY_RAW]) || v\n}\n\nfunction _flush(raw: any, state: StoreState): void {\n  state.scheduled = false\n  const pending = state.pending\n  if (!pending || pending.size === 0) return\n  state.pending = undefined\n  let allChanges: any[] | null = null\n  for (const [prop, changes] of pending) {\n    if (state.rootObservers || state.derived) {\n      allChanges ??= []\n      for (let i = 0; i < changes.length; i++) allChanges.push(changes[i])\n    }\n    const bucket = state.observers?.get(prop)\n    if (!bucket || bucket.size === 0) continue\n    for (const h of bucket) h(raw[prop], changes)\n  }\n  if (allChanges && state.rootObservers) {\n    for (const h of state.rootObservers) h(raw, allChanges)\n  }\n  if (allChanges && state.derived) {\n    for (const [prop, bucket] of state.derived) {\n      if (bucket.size === 0) continue\n      let value: any\n      try {\n        value = raw[prop]\n      } catch {\n        continue\n      }\n      for (const h of bucket) h(value, allChanges)\n    }\n  }\n}\n\nfunction _queue(raw: any, state: StoreState, prop: string, change: any = {}): void {\n  if (!state.ready || !state.observers?.has(prop)) return\n  const rec = { prop, pathParts: [prop], type: 'update', target: raw, ...change }\n  const pending = state.pending ?? (state.pending = new Map())\n  const arr = pending.get(prop)\n  if (arr) arr.push(rec)\n  else pending.set(prop, [rec])\n  if (!state.scheduled) {\n    state.scheduled = true\n    queueMicrotask(() => _flush(raw, state))\n  }\n}\n\nfunction _wrapNested(raw: any, state: StoreState, target: any, rootProp: string): any {\n  if (!_isPlain(target)) return target\n  let perTarget = _nestedCache.get(target)\n  if (perTarget) {\n    const cached = perTarget.get(rootProp)\n    if (cached) return cached\n  }\n  const proxy = new Proxy(target, {\n    get(obj, prop) {\n      if (prop === GEA_PROXY_RAW) return obj\n      if (typeof prop === 'symbol') return obj[prop as any]\n      const val = obj[prop as any]\n      if (_isArr(obj) && typeof val === 'function') {\n        if (prop === 'push') {\n          return (...args: any[]) => {\n            const start = obj.length\n            const result = Array.prototype.push.apply(obj, args.map(_unwrap))\n            if (obj === raw[rootProp] && obj.length > start) {\n              _queue(raw, state, rootProp, { type: 'append', start, count: obj.length - start })\n            }\n            return result\n          }\n        }\n        if (prop === 'splice') {\n          return (...args: any[]) => {\n            const before = obj.length\n            const start = args[0] | 0\n            const result = Array.prototype.splice.apply(\n              obj,\n              args.length > 2 ? [args[0], args[1], ...args.slice(2).map(_unwrap)] : args,\n            )\n            if (obj === raw[rootProp]) {\n              const after = obj.length\n              if (after < before) _queue(raw, state, rootProp, { type: 'remove', start, count: before - after })\n              else _queue(raw, state, rootProp, { type: 'reorder' })\n            }\n            return result\n          }\n        }\n      }\n      return _isPlain(val) ? _wrapNested(raw, state, val, rootProp) : val\n    },\n    set(obj, prop, value) {\n      if (typeof prop === 'symbol') {\n        obj[prop as any] = value\n        return true\n      }\n      value = _unwrap(value)\n      const old = obj[prop as any]\n      if (old === value) return true\n      obj[prop as any] = value\n      if (_isArr(obj)) {\n        if (value && typeof value === 'object') value[GEA_DIRTY] = true\n        const idx = +prop\n        if (Number.isInteger(idx) && obj === raw[rootProp]) {\n          _queue(raw, state, rootProp, { aipu: true, arix: idx, previousValue: old, newValue: value })\n          return true\n        }\n      } else {\n        obj[GEA_DIRTY] = true\n        ;(obj[GEA_DIRTY_PROPS] ??= new Set()).add(prop)\n      }\n      _queue(raw, state, rootProp, { previousValue: old, newValue: value })\n      return true\n    },\n  })\n  if (!perTarget) {\n    perTarget = new Map()\n    _nestedCache.set(target, perTarget)\n  }\n  perTarget.set(rootProp, proxy)\n  return proxy\n}\n\nexport class CompiledStore {\n  constructor() {\n    const state: StoreState = { ready: false }\n    _priv.set(this, state)\n    const proxy = new Proxy(this, {\n      get(target, prop, receiver) {\n        if (prop === GEA_PROXY_RAW) return target\n        if (typeof prop === 'symbol') return (target as any)[prop]\n        trackRead(receiver ?? target, prop)\n        const value = (target as any)[prop]\n        if (typeof value === 'function') return value.bind(receiver)\n        return _isPlain(value) ? _wrapNested(target, state, value, prop) : value\n      },\n      set(target, prop, value) {\n        if (typeof prop === 'symbol') {\n          ;(target as any)[prop] = value\n          return true\n        }\n        value = _unwrap(value)\n        const old = (target as any)[prop]\n        if (old === value && prop in target) return true\n        if (old && typeof old === 'object') _nestedCache.delete(old)\n        ;(target as any)[prop] = value\n        const direct = state.direct?.get(prop)\n        if (direct) for (const h of direct) h(value)\n        _queue(target, state, prop, { previousValue: old, newValue: value })\n        return true\n      },\n    })\n    _priv.set(proxy, state)\n    ;(this as any)[GEA_STORE_ROOT] = proxy\n    return proxy\n  }\n\n  observe(pathOrProp: string | readonly string[], handler: Handler): () => void {\n    const state = _priv.get(this)\n    if (!state) return () => {}\n    state.ready = true\n    const isArr = Array.isArray(pathOrProp)\n    if ((isArr && pathOrProp.length === 0) || pathOrProp === '') {\n      const bucket = state.rootObservers ?? (state.rootObservers = new Set())\n      bucket.add(handler)\n      return () => bucket.delete(handler)\n    }\n    const prop = isArr ? pathOrProp[0] : pathOrProp\n    const tail = isArr && pathOrProp.length > 1 ? pathOrProp.slice(1) : null\n    const finalHandler: Handler = tail\n      ? (value, changes) => {\n          let next = value\n          for (let i = 0; i < tail.length; i++) {\n            if (next == null) return\n            next = next[tail[i]]\n          }\n          handler(next, changes)\n        }\n      : handler\n    let isDerived = false\n    if (!Object.prototype.hasOwnProperty.call(this, prop)) {\n      for (\n        let proto = Object.getPrototypeOf(this);\n        proto && proto !== Object.prototype;\n        proto = Object.getPrototypeOf(proto)\n      ) {\n        const descriptor = Object.getOwnPropertyDescriptor(proto, prop)\n        if (descriptor) {\n          isDerived = !!descriptor.get\n          break\n        }\n      }\n    }\n    const observers = isDerived\n      ? (state.derived ?? (state.derived = new Map()))\n      : (state.observers ?? (state.observers = new Map()))\n    let bucket = observers.get(prop)\n    if (!bucket) observers.set(prop, (bucket = new Set()))\n    bucket.add(finalHandler)\n    return () => bucket!.delete(finalHandler)\n  }\n\n  [GEA_OBSERVE_DIRECT](prop: string, handler: (value: any) => void): () => void {\n    const state = _priv.get(this)\n    if (!state) return () => {}\n    state.ready = true\n    const direct = state.direct ?? (state.direct = new Map())\n    let bucket = direct.get(prop)\n    if (!bucket) direct.set(prop, (bucket = new Set()))\n    bucket.add(handler)\n    return () => bucket!.delete(handler)\n  }\n}\n\nexport default CompiledStore\n","import { GEA_CREATE_TEMPLATE, GEA_DOM_COMPONENT, GEA_ELEMENT, GEA_ON_PROP_CHANGE } from './symbols'\nimport { GEA_CREATED_CALLED, GEA_DISPOSER, GEA_SET_PROPS } from './internal-symbols'\nimport { createDisposer, type Disposer } from './disposer'\nimport { CompiledStore } from './compiled-store'\nimport { getComponentId } from './component-id'\n\ntype PropThunks = Record<string, () => any>\nconst GEA_COMPONENT_ID = Symbol()\nconst GEA_LAST_PROP_VALUES = Symbol()\n\nexport class CompiledReactiveComponent<P extends Record<string, any> = Record<string, any>> extends CompiledStore {\n  rendered = false\n  props: P = {} as P;\n\n  [GEA_ELEMENT] = null as HTMLElement | null;\n  [GEA_DISPOSER] = createDisposer() as Disposer;\n  [GEA_CREATED_CALLED] = false\n\n  get id(): string {\n    return ((this as any)[GEA_COMPONENT_ID] ??= getComponentId())\n  }\n\n  set id(value: string) {\n    ;(this as any)[GEA_COMPONENT_ID] = value\n  }\n\n  get el(): HTMLElement | null {\n    return this[GEA_ELEMENT] ?? null\n  }\n\n  [GEA_SET_PROPS](thunks: PropThunks): void {\n    const createdCalled = this[GEA_CREATED_CALLED]\n    const notifyPropChange = createdCalled ? (this as any)[GEA_ON_PROP_CHANGE] : undefined\n    const prevValues: Record<string, any> | undefined =\n      typeof notifyPropChange === 'function' ? (this as any)[GEA_LAST_PROP_VALUES] : undefined\n    const out: Record<string, any> = {}\n    for (const k in thunks) {\n      Object.defineProperty(out, k, {\n        enumerable: true,\n        configurable: true,\n        get: () => thunks[k](),\n      })\n    }\n    if (typeof thunks.children === 'function') {\n      let cached: any = undefined\n      let cacheNode = false\n      Object.defineProperty(out, 'children', {\n        enumerable: true,\n        configurable: true,\n        get: () => {\n          if (cacheNode) return cached\n          const v = thunks.children()\n          if (v && typeof v.nodeType === 'number') {\n            cached = v\n            cacheNode = true\n          }\n          return v\n        },\n      })\n    }\n    this.props = out as P\n    const nextValues: Record<string, any> = {}\n    for (const key in thunks) nextValues[key] = this.props?.[key]\n    ;(this as any)[GEA_LAST_PROP_VALUES] = nextValues\n    if (!createdCalled) {\n      this[GEA_CREATED_CALLED] = true\n      if (this.created !== CompiledReactiveComponent.prototype.created) this.created(this.props)\n    } else if (typeof notifyPropChange === 'function') {\n      for (const key in thunks) {\n        const prev = prevValues?.[key]\n        const next = this.props?.[key]\n        if (next !== prev || (prev !== null && typeof prev === 'object')) notifyPropChange.call(this, key, next)\n      }\n    }\n  }\n\n  [GEA_CREATE_TEMPLATE](_disposer: Disposer): Node {\n    return document.createDocumentFragment()\n  }\n\n  render(parent: Node, _index?: number): void {\n    if (!this[GEA_CREATED_CALLED]) {\n      this[GEA_CREATED_CALLED] = true\n      if (this.created !== CompiledReactiveComponent.prototype.created) this.created(this.props)\n    }\n    let node = this[GEA_CREATE_TEMPLATE](this[GEA_DISPOSER])\n    if (node == null) node = document.createComment('')\n    if (typeof (node as any).nodeType !== 'number') {\n      if (Array.isArray(node)) {\n        const frag = document.createDocumentFragment()\n        for (const n of node) {\n          if (n == null) continue\n          if (typeof (n as any).nodeType === 'number') frag.appendChild(n as Node)\n          else frag.appendChild(document.createTextNode(String(n)))\n        }\n        node = frag\n      } else {\n        node = document.createTextNode(String(node))\n      }\n    }\n    parent.appendChild(node)\n    if (node.nodeType === 11) {\n      this[GEA_ELEMENT] = ((parent as Element).lastElementChild as HTMLElement | null) ?? null\n    } else if (node.nodeType === 1) {\n      this[GEA_ELEMENT] = node as HTMLElement\n    }\n    const el = this[GEA_ELEMENT] as any\n    if (el) el[GEA_DOM_COMPONENT] = this\n    this.rendered = true\n    this.onAfterRender()\n  }\n\n  onAfterRender(): void {\n    /* no-op */\n  }\n\n  created(_props?: P): void {\n    /* no-op */\n  }\n\n  dispose(): void {\n    this[GEA_DISPOSER].dispose()\n    const e = this[GEA_ELEMENT] as HTMLElement | null\n    if (e && e.parentNode) e.parentNode.removeChild(e)\n    this[GEA_ELEMENT] = null\n  }\n\n  $(sel: string): Element | null {\n    const e = this[GEA_ELEMENT] as HTMLElement | null\n    return e ? e.querySelector(sel) : null\n  }\n\n  $$(sel: string): Element[] {\n    const e = this[GEA_ELEMENT] as HTMLElement | null\n    return e ? Array.from(e.querySelectorAll(sel)) : []\n  }\n}\n\nexport default CompiledReactiveComponent\n"],"mappings":";;;;;;AAiBA,MAAM,wBAAQ,IAAI,SAA0B;AAC5C,MAAM,+BAAe,IAAI,SAAmC;AAC5D,MAAM,SAAS,MAAM;AAErB,SAAS,SAAS,GAAiB;AACjC,KAAI,CAAC,KAAK,OAAO,MAAM,SAAU,QAAO;CACxC,MAAM,IAAI,OAAO,eAAe,EAAE;AAClC,QAAO,MAAM,OAAO,aAAa,MAAM,QAAQ,OAAO,EAAE;;AAG1D,SAAS,QAAQ,GAAa;AAC5B,QAAQ,KAAK,EAAE,kBAAmB;;AAGpC,SAAS,OAAO,KAAU,OAAyB;AACjD,OAAM,YAAY;CAClB,MAAM,UAAU,MAAM;AACtB,KAAI,CAAC,WAAW,QAAQ,SAAS,EAAG;AACpC,OAAM,UAAU,KAAA;CAChB,IAAI,aAA2B;AAC/B,MAAK,MAAM,CAAC,MAAM,YAAY,SAAS;AACrC,MAAI,MAAM,iBAAiB,MAAM,SAAS;AACxC,kBAAe,EAAE;AACjB,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAK,YAAW,KAAK,QAAQ,GAAG;;EAEtE,MAAM,SAAS,MAAM,WAAW,IAAI,KAAK;AACzC,MAAI,CAAC,UAAU,OAAO,SAAS,EAAG;AAClC,OAAK,MAAM,KAAK,OAAQ,GAAE,IAAI,OAAO,QAAQ;;AAE/C,KAAI,cAAc,MAAM,cACtB,MAAK,MAAM,KAAK,MAAM,cAAe,GAAE,KAAK,WAAW;AAEzD,KAAI,cAAc,MAAM,QACtB,MAAK,MAAM,CAAC,MAAM,WAAW,MAAM,SAAS;AAC1C,MAAI,OAAO,SAAS,EAAG;EACvB,IAAI;AACJ,MAAI;AACF,WAAQ,IAAI;UACN;AACN;;AAEF,OAAK,MAAM,KAAK,OAAQ,GAAE,OAAO,WAAW;;;AAKlD,SAAS,OAAO,KAAU,OAAmB,MAAc,SAAc,EAAE,EAAQ;AACjF,KAAI,CAAC,MAAM,SAAS,CAAC,MAAM,WAAW,IAAI,KAAK,CAAE;CACjD,MAAM,MAAM;EAAE;EAAM,WAAW,CAAC,KAAK;EAAE,MAAM;EAAU,QAAQ;EAAK,GAAG;EAAQ;CAC/E,MAAM,UAAU,MAAM,YAAY,MAAM,0BAAU,IAAI,KAAK;CAC3D,MAAM,MAAM,QAAQ,IAAI,KAAK;AAC7B,KAAI,IAAK,KAAI,KAAK,IAAI;KACjB,SAAQ,IAAI,MAAM,CAAC,IAAI,CAAC;AAC7B,KAAI,CAAC,MAAM,WAAW;AACpB,QAAM,YAAY;AAClB,uBAAqB,OAAO,KAAK,MAAM,CAAC;;;AAI5C,SAAS,YAAY,KAAU,OAAmB,QAAa,UAAuB;AACpF,KAAI,CAAC,SAAS,OAAO,CAAE,QAAO;CAC9B,IAAI,YAAY,aAAa,IAAI,OAAO;AACxC,KAAI,WAAW;EACb,MAAM,SAAS,UAAU,IAAI,SAAS;AACtC,MAAI,OAAQ,QAAO;;CAErB,MAAM,QAAQ,IAAI,MAAM,QAAQ;EAC9B,IAAI,KAAK,MAAM;AACb,OAAI,SAAS,cAAe,QAAO;AACnC,OAAI,OAAO,SAAS,SAAU,QAAO,IAAI;GACzC,MAAM,MAAM,IAAI;AAChB,OAAI,OAAO,IAAI,IAAI,OAAO,QAAQ,YAAY;AAC5C,QAAI,SAAS,OACX,SAAQ,GAAG,SAAgB;KACzB,MAAM,QAAQ,IAAI;KAClB,MAAM,SAAS,MAAM,UAAU,KAAK,MAAM,KAAK,KAAK,IAAI,QAAQ,CAAC;AACjE,SAAI,QAAQ,IAAI,aAAa,IAAI,SAAS,MACxC,QAAO,KAAK,OAAO,UAAU;MAAE,MAAM;MAAU;MAAO,OAAO,IAAI,SAAS;MAAO,CAAC;AAEpF,YAAO;;AAGX,QAAI,SAAS,SACX,SAAQ,GAAG,SAAgB;KACzB,MAAM,SAAS,IAAI;KACnB,MAAM,QAAQ,KAAK,KAAK;KACxB,MAAM,SAAS,MAAM,UAAU,OAAO,MACpC,KACA,KAAK,SAAS,IAAI;MAAC,KAAK;MAAI,KAAK;MAAI,GAAG,KAAK,MAAM,EAAE,CAAC,IAAI,QAAQ;MAAC,GAAG,KACvE;AACD,SAAI,QAAQ,IAAI,WAAW;MACzB,MAAM,QAAQ,IAAI;AAClB,UAAI,QAAQ,OAAQ,QAAO,KAAK,OAAO,UAAU;OAAE,MAAM;OAAU;OAAO,OAAO,SAAS;OAAO,CAAC;UAC7F,QAAO,KAAK,OAAO,UAAU,EAAE,MAAM,WAAW,CAAC;;AAExD,YAAO;;;AAIb,UAAO,SAAS,IAAI,GAAG,YAAY,KAAK,OAAO,KAAK,SAAS,GAAG;;EAElE,IAAI,KAAK,MAAM,OAAO;AACpB,OAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,QAAe;AACnB,WAAO;;AAET,WAAQ,QAAQ,MAAM;GACtB,MAAM,MAAM,IAAI;AAChB,OAAI,QAAQ,MAAO,QAAO;AAC1B,OAAI,QAAe;AACnB,OAAI,OAAO,IAAI,EAAE;AACf,QAAI,SAAS,OAAO,UAAU,SAAU,OAAMA,UAAa;IAC3D,MAAM,MAAM,CAAC;AACb,QAAI,OAAO,UAAU,IAAI,IAAI,QAAQ,IAAI,WAAW;AAClD,YAAO,KAAK,OAAO,UAAU;MAAE,MAAM;MAAM,MAAM;MAAK,eAAe;MAAK,UAAU;MAAO,CAAC;AAC5F,YAAO;;UAEJ;AACL,QAAIA,UAAa;AAChB,KAAC,IAAIC,kCAAqB,IAAI,KAAK,EAAE,IAAI,KAAK;;AAEjD,UAAO,KAAK,OAAO,UAAU;IAAE,eAAe;IAAK,UAAU;IAAO,CAAC;AACrE,UAAO;;EAEV,CAAC;AACF,KAAI,CAAC,WAAW;AACd,8BAAY,IAAI,KAAK;AACrB,eAAa,IAAI,QAAQ,UAAU;;AAErC,WAAU,IAAI,UAAU,MAAM;AAC9B,QAAO;;AAGT,IAAa,gBAAb,MAA2B;CACzB,cAAc;EACZ,MAAM,QAAoB,EAAE,OAAO,OAAO;AAC1C,QAAM,IAAI,MAAM,MAAM;EACtB,MAAM,QAAQ,IAAI,MAAM,MAAM;GAC5B,IAAI,QAAQ,MAAM,UAAU;AAC1B,QAAI,SAAS,cAAe,QAAO;AACnC,QAAI,OAAO,SAAS,SAAU,QAAQ,OAAe;AACrD,cAAU,YAAY,QAAQ,KAAK;IACnC,MAAM,QAAS,OAAe;AAC9B,QAAI,OAAO,UAAU,WAAY,QAAO,MAAM,KAAK,SAAS;AAC5D,WAAO,SAAS,MAAM,GAAG,YAAY,QAAQ,OAAO,OAAO,KAAK,GAAG;;GAErE,IAAI,QAAQ,MAAM,OAAO;AACvB,QAAI,OAAO,SAAS,UAAU;AAC1B,YAAe,QAAQ;AACzB,YAAO;;AAET,YAAQ,QAAQ,MAAM;IACtB,MAAM,MAAO,OAAe;AAC5B,QAAI,QAAQ,SAAS,QAAQ,OAAQ,QAAO;AAC5C,QAAI,OAAO,OAAO,QAAQ,SAAU,cAAa,OAAO,IAAI;AAC1D,WAAe,QAAQ;IACzB,MAAM,SAAS,MAAM,QAAQ,IAAI,KAAK;AACtC,QAAI,OAAQ,MAAK,MAAM,KAAK,OAAQ,GAAE,MAAM;AAC5C,WAAO,QAAQ,OAAO,MAAM;KAAE,eAAe;KAAK,UAAU;KAAO,CAAC;AACpE,WAAO;;GAEV,CAAC;AACF,QAAM,IAAI,OAAO,MAAM;AACrB,OAAa,kBAAkB;AACjC,SAAO;;CAGT,QAAQ,YAAwC,SAA8B;EAC5E,MAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,MAAI,CAAC,MAAO,cAAa;AACzB,QAAM,QAAQ;EACd,MAAM,QAAQ,MAAM,QAAQ,WAAW;AACvC,MAAK,SAAS,WAAW,WAAW,KAAM,eAAe,IAAI;GAC3D,MAAM,SAAS,MAAM,kBAAkB,MAAM,gCAAgB,IAAI,KAAK;AACtE,UAAO,IAAI,QAAQ;AACnB,gBAAa,OAAO,OAAO,QAAQ;;EAErC,MAAM,OAAO,QAAQ,WAAW,KAAK;EACrC,MAAM,OAAO,SAAS,WAAW,SAAS,IAAI,WAAW,MAAM,EAAE,GAAG;EACpE,MAAM,eAAwB,QACzB,OAAO,YAAY;GAClB,IAAI,OAAO;AACX,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,QAAI,QAAQ,KAAM;AAClB,WAAO,KAAK,KAAK;;AAEnB,WAAQ,MAAM,QAAQ;MAExB;EACJ,IAAI,YAAY;AAChB,MAAI,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,KAAK,CACnD,MACE,IAAI,QAAQ,OAAO,eAAe,KAAK,EACvC,SAAS,UAAU,OAAO,WAC1B,QAAQ,OAAO,eAAe,MAAM,EACpC;GACA,MAAM,aAAa,OAAO,yBAAyB,OAAO,KAAK;AAC/D,OAAI,YAAY;AACd,gBAAY,CAAC,CAAC,WAAW;AACzB;;;EAIN,MAAM,YAAY,YACb,MAAM,YAAY,MAAM,0BAAU,IAAI,KAAK,IAC3C,MAAM,cAAc,MAAM,4BAAY,IAAI,KAAK;EACpD,IAAI,SAAS,UAAU,IAAI,KAAK;AAChC,MAAI,CAAC,OAAQ,WAAU,IAAI,MAAO,yBAAS,IAAI,KAAK,CAAE;AACtD,SAAO,IAAI,aAAa;AACxB,eAAa,OAAQ,OAAO,aAAa;;CAG3C,CAAC,oBAAoB,MAAc,SAA2C;EAC5E,MAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,MAAI,CAAC,MAAO,cAAa;AACzB,QAAM,QAAQ;EACd,MAAM,SAAS,MAAM,WAAW,MAAM,yBAAS,IAAI,KAAK;EACxD,IAAI,SAAS,OAAO,IAAI,KAAK;AAC7B,MAAI,CAAC,OAAQ,QAAO,IAAI,MAAO,yBAAS,IAAI,KAAK,CAAE;AACnD,SAAO,IAAI,QAAQ;AACnB,eAAa,OAAQ,OAAO,QAAQ;;;;;ACtOxC,MAAM,mBAAmB,QAAQ;AACjC,MAAM,uBAAuB,QAAQ;AAErC,IAAa,4BAAb,MAAa,kCAAuF,cAAc;;;kBACrG;eACA,EAAE;OAEZ,eAAe;OACf,gBAAgB,gBAAgB;OAChC,sBAAsB;;CAEvB,IAAI,KAAa;AACf,SAAQ,KAAc,sBAAsB,gBAAgB;;CAG9D,IAAI,GAAG,OAAe;AAClB,OAAa,oBAAoB;;CAGrC,IAAI,KAAyB;AAC3B,SAAO,KAAK,gBAAgB;;CAG9B,CAAC,eAAe,QAA0B;EACxC,MAAM,gBAAgB,KAAK;EAC3B,MAAM,mBAAmB,gBAAiB,KAAa,sBAAsB,KAAA;EAC7E,MAAM,aACJ,OAAO,qBAAqB,aAAc,KAAa,wBAAwB,KAAA;EACjF,MAAM,MAA2B,EAAE;AACnC,OAAK,MAAM,KAAK,OACd,QAAO,eAAe,KAAK,GAAG;GAC5B,YAAY;GACZ,cAAc;GACd,WAAW,OAAO,IAAI;GACvB,CAAC;AAEJ,MAAI,OAAO,OAAO,aAAa,YAAY;GACzC,IAAI,SAAc,KAAA;GAClB,IAAI,YAAY;AAChB,UAAO,eAAe,KAAK,YAAY;IACrC,YAAY;IACZ,cAAc;IACd,WAAW;AACT,SAAI,UAAW,QAAO;KACtB,MAAM,IAAI,OAAO,UAAU;AAC3B,SAAI,KAAK,OAAO,EAAE,aAAa,UAAU;AACvC,eAAS;AACT,kBAAY;;AAEd,YAAO;;IAEV,CAAC;;AAEJ,OAAK,QAAQ;EACb,MAAM,aAAkC,EAAE;AAC1C,OAAK,MAAM,OAAO,OAAQ,YAAW,OAAO,KAAK,QAAQ;AACvD,OAAa,wBAAwB;AACvC,MAAI,CAAC,eAAe;AAClB,QAAK,sBAAsB;AAC3B,OAAI,KAAK,YAAY,0BAA0B,UAAU,QAAS,MAAK,QAAQ,KAAK,MAAM;aACjF,OAAO,qBAAqB,WACrC,MAAK,MAAM,OAAO,QAAQ;GACxB,MAAM,OAAO,aAAa;GAC1B,MAAM,OAAO,KAAK,QAAQ;AAC1B,OAAI,SAAS,QAAS,SAAS,QAAQ,OAAO,SAAS,SAAW,kBAAiB,KAAK,MAAM,KAAK,KAAK;;;CAK9G,CAAC,qBAAqB,WAA2B;AAC/C,SAAO,SAAS,wBAAwB;;CAG1C,OAAO,QAAc,QAAuB;AAC1C,MAAI,CAAC,KAAK,qBAAqB;AAC7B,QAAK,sBAAsB;AAC3B,OAAI,KAAK,YAAY,0BAA0B,UAAU,QAAS,MAAK,QAAQ,KAAK,MAAM;;EAE5F,IAAI,OAAO,KAAK,qBAAqB,KAAK,cAAc;AACxD,MAAI,QAAQ,KAAM,QAAO,SAAS,cAAc,GAAG;AACnD,MAAI,OAAQ,KAAa,aAAa,SACpC,KAAI,MAAM,QAAQ,KAAK,EAAE;GACvB,MAAM,OAAO,SAAS,wBAAwB;AAC9C,QAAK,MAAM,KAAK,MAAM;AACpB,QAAI,KAAK,KAAM;AACf,QAAI,OAAQ,EAAU,aAAa,SAAU,MAAK,YAAY,EAAU;QACnE,MAAK,YAAY,SAAS,eAAe,OAAO,EAAE,CAAC,CAAC;;AAE3D,UAAO;QAEP,QAAO,SAAS,eAAe,OAAO,KAAK,CAAC;AAGhD,SAAO,YAAY,KAAK;AACxB,MAAI,KAAK,aAAa,GACpB,MAAK,eAAiB,OAAmB,oBAA2C;WAC3E,KAAK,aAAa,EAC3B,MAAK,eAAe;EAEtB,MAAM,KAAK,KAAK;AAChB,MAAI,GAAI,IAAG,qBAAqB;AAChC,OAAK,WAAW;AAChB,OAAK,eAAe;;CAGtB,gBAAsB;CAItB,QAAQ,QAAkB;CAI1B,UAAgB;AACd,OAAK,cAAc,SAAS;EAC5B,MAAM,IAAI,KAAK;AACf,MAAI,KAAK,EAAE,WAAY,GAAE,WAAW,YAAY,EAAE;AAClD,OAAK,eAAe;;CAGtB,EAAE,KAA6B;EAC7B,MAAM,IAAI,KAAK;AACf,SAAO,IAAI,EAAE,cAAc,IAAI,GAAG;;CAGpC,GAAG,KAAwB;EACzB,MAAM,IAAI,KAAK;AACf,SAAO,IAAI,MAAM,KAAK,EAAE,iBAAiB,IAAI,CAAC,GAAG,EAAE"}
+{"version":3,"file":"compiled-reactive-component.mjs","names":["GEA_DIRTY","GEA_DIRTY_PROPS"],"sources":["../../gea/src/runtime/compiled-store.ts","../../gea/src/runtime/compiled-reactive-component.ts"],"sourcesContent":["import { GEA_PROXY_RAW, GEA_STORE_ROOT } from './symbols'\nimport { GEA_OBSERVE_DIRECT } from './internal-symbols'\nimport { GEA_DIRTY, GEA_DIRTY_PROPS } from './dirty-symbols'\nimport { trackRead } from './with-tracking'\nimport type { Change } from '../store'\n\n/**\n * A store observer: the changed value, and the batch of changes that\n * produced it. `S` is `CompiledStore<S>`'s own type parameter — the\n * concrete store subclass's field shape, resolved once per subclass exactly\n * the way `CompiledComponent<P>` resolves `P` for a component's props. A\n * single `Map<string, Set<Handler<S>>>` holds observers across every field\n * of `S` at once, so the exact field a given handler fires for isn't known\n * at this layer — but the closed set of types it could possibly be (every\n * member of `S`) is, which is why `value` is `S[keyof S]` rather than\n * `any`/`unknown`.\n */\ntype Handler<S> = (value: S[keyof S], changes: Change[]) => void\n\ninterface StoreState<S> {\n  observers?: Map<string, Set<Handler<S>>>\n  rootObservers?: Set<Handler<S>>\n  derived?: Map<string, Set<Handler<S>>>\n  direct?: Map<string, Set<(value: S[keyof S]) => void>>\n  /** Queued change records, keyed by the prop they were recorded against —\n   * each entry is `Change`-shaped (built by `_queue` below), not a raw\n   * store value, so `Change[]` is exact rather than `any[]`. */\n  pending?: Map<string, Change[]>\n  scheduled?: boolean\n  ready?: boolean\n}\n\n// Symbol properties, not `WeakMap`s keyed by the store object. See the same\n// change in `compiled-lean-store`: geatsc marks any value reaching a weak-key\n// position as a weak-handle ownership subject and then rejects it for carrying a\n// dynamic representation, which every store value does. A non-enumerable symbol\n// property has the same lifetime, stays out of `Object.keys` / `for...in` /\n// `JSON.stringify`, and passes through the proxy traps' existing symbol\n// short-circuit.\nconst _PRIV = Symbol('gea.store.priv')\nconst _NESTED = Symbol('gea.store.nested')\n\n/**\n * `O`/`V` are generic (not `object`/`any`) — this helper hides a value under\n * a symbol key on WHATEVER object it's called with (the raw store, its\n * proxy, a Map cache, ...), so its own declaration can't pin a single\n * concrete shape; each call site supplies its own concrete `O`/`V`.\n */\nfunction _hidden<O extends object, V>(target: O, key: symbol, value: V): void {\n  Object.defineProperty(target, key, { value, writable: true, configurable: true, enumerable: false })\n}\n\n/** Same shape as `_hidden`: a generic reflection probe, not tied to one type. */\nfunction _isPlain<V>(v: V): boolean {\n  if (!v || typeof v !== 'object') return false\n  const p = Object.getPrototypeOf(v)\n  return p === Object.prototype || p === null || Array.isArray(v)\n}\n\n/** Unwrap a proxy value to its raw target, preserving whatever type it was. */\nfunction _unwrap<V>(v: V): V {\n  const rawTarget = v && (v as unknown as Record<symbol, unknown>)[GEA_PROXY_RAW]\n  return (rawTarget as V) || v\n}\n\nfunction _fireBucket<S>(bucket: Set<Handler<S>>, value: S[keyof S], changes: Change[]): void {\n  if (bucket.size === 0) return\n  if (bucket.size === 1) {\n    for (const h of bucket) {\n      h(value, changes)\n      return\n    }\n  }\n  const snapshot: Handler<S>[] = []\n  for (const h of bucket) snapshot.push(h)\n  for (let i = 0; i < snapshot.length; i++) {\n    try {\n      snapshot[i](value, changes)\n    } catch {\n      /* isolate sibling observers */\n    }\n  }\n}\n\nfunction _flush<S>(raw: S, state: StoreState<S>): void {\n  state.scheduled = false\n  const pending = state.pending\n  if (!pending || pending.size === 0) return\n  state.pending = undefined\n  let allChanges: Change[] | null = null\n  for (const entry of pending) {\n    const prop = entry[0]\n    const changes = entry[1]\n    if (state.rootObservers || state.derived) {\n      allChanges ??= []\n      for (let i = 0; i < changes.length; i++) allChanges.push(changes[i])\n    }\n    const bucket = state.observers?.get(prop)\n    if (!bucket || bucket.size === 0) continue\n    _fireBucket(bucket, raw[prop as keyof S], changes)\n  }\n  if (allChanges && state.rootObservers) {\n    _fireBucket(state.rootObservers, raw as S[keyof S], allChanges)\n  }\n  if (allChanges && state.derived) {\n    for (const entry of state.derived) {\n      const prop = entry[0]\n      const bucket = entry[1]\n      if (bucket.size === 0) continue\n      let value: S[keyof S]\n      try {\n        value = raw[prop as keyof S]\n      } catch {\n        continue\n      }\n      _fireBucket(bucket, value, allChanges)\n    }\n  }\n}\n\nfunction _hasQueuedConsumers<S>(state: StoreState<S>, prop: string): boolean {\n  const bucket = state.observers?.get(prop)\n  return !!(\n    (bucket && bucket.size > 0) ||\n    (state.rootObservers && state.rootObservers.size > 0) ||\n    (state.derived && state.derived.size > 0)\n  )\n}\n\nfunction _queue<S>(raw: S, state: StoreState<S>, prop: string, change: Partial<Change> = {}): void {\n  if (!state.ready || !_hasQueuedConsumers(state, prop)) return\n  const rec: Change = { prop, pathParts: [prop], type: 'update', target: raw, ...change }\n  const pending = state.pending ?? (state.pending = new Map())\n  const arr = pending.get(prop)\n  if (arr) arr.push(rec)\n  else pending.set(prop, [rec])\n  if (!state.scheduled) {\n    state.scheduled = true\n    queueMicrotask(() => _flush(raw, state))\n  }\n}\n\n/**\n * Nested object/array traversal INSIDE one of `S`'s own fields (e.g.\n * `store.list[0].name`): once inside a field's own substructure, the shape\n * is no longer described by `S` (a field's element/property types aren't\n * modeled recursively here) — `V` is a genuinely open per-call type at this\n * depth, kept as a type parameter rather than `any` so it's at least\n * threaded through instead of erased, but this is the one spot in this file\n * that's honestly a dynamic-JS-object-graph boundary: how deep a nested\n * value's shape goes isn't knowable without walking `S` structurally.\n */\nfunction _wrapNested<S, V>(raw: S, state: StoreState<S>, target: V, rootProp: string): V {\n  if (!_isPlain(target)) return target\n  const targetObj = target as unknown as Record<PropertyKey, unknown>\n  let perTarget: Map<string, unknown> | undefined = (targetObj as unknown as Record<symbol, Map<string, unknown>>)[\n    _NESTED\n  ]\n  if (perTarget) {\n    const cached = perTarget.get(rootProp)\n    if (cached) return cached as V\n  }\n  const proxy = new Proxy(targetObj, {\n    get(obj, prop) {\n      if (prop === GEA_PROXY_RAW) return obj\n      if (typeof prop === 'symbol') return obj[prop]\n      trackRead(raw as object, rootProp)\n      const val = obj[prop]\n      if (Array.isArray(obj) && typeof val === 'function') {\n        if (prop === 'push') {\n          return (...args: unknown[]) => {\n            const start = (obj as unknown[]).length\n            const result = Array.prototype.push.apply(obj, args.map(_unwrap))\n            if (obj === (raw as Record<string, unknown>)[rootProp] && (obj as unknown[]).length > start) {\n              _queue(raw, state, rootProp, { type: 'append', start, count: (obj as unknown[]).length - start })\n            } else {\n              _queue(raw, state, rootProp)\n            }\n            return result\n          }\n        }\n        if (prop === 'splice') {\n          return (...args: unknown[]) => {\n            const before = (obj as unknown[]).length\n            const start = (args[0] as number) | 0\n            const result = Array.prototype.splice.apply(\n              obj,\n              args.length > 2\n                ? ([args[0], args[1], ...args.slice(2).map(_unwrap)] as [number, number, ...unknown[]])\n                : (args as [number, number]),\n            )\n            if (obj === (raw as Record<string, unknown>)[rootProp]) {\n              const after = (obj as unknown[]).length\n              if (after < before) _queue(raw, state, rootProp, { type: 'remove', start, count: before - after })\n              else _queue(raw, state, rootProp, { type: 'reorder' })\n            } else {\n              _queue(raw, state, rootProp)\n            }\n            return result\n          }\n        }\n        if (prop === 'pop' || prop === 'shift') {\n          return (...args: unknown[]) => {\n            const before = (obj as unknown[]).length\n            const result = (Array.prototype as unknown as Record<string, (...a: unknown[]) => unknown>)[prop].apply(\n              obj,\n              args,\n            )\n            const after = (obj as unknown[]).length\n            if (obj === (raw as Record<string, unknown>)[rootProp] && after < before) {\n              _queue(raw, state, rootProp, { type: 'remove', start: prop === 'pop' ? after : 0, count: 1 })\n            } else {\n              _queue(raw, state, rootProp)\n            }\n            return result\n          }\n        }\n        if (prop === 'unshift' || prop === 'sort' || prop === 'reverse') {\n          return (...args: unknown[]) => {\n            const callArgs = prop === 'unshift' ? args.map(_unwrap) : args\n            const result = (Array.prototype as unknown as Record<string, (...a: unknown[]) => unknown>)[prop].apply(\n              obj,\n              callArgs,\n            )\n            if (obj === (raw as Record<string, unknown>)[rootProp]) {\n              _queue(raw, state, rootProp, { type: 'reorder' })\n            } else {\n              _queue(raw, state, rootProp)\n            }\n            return result\n          }\n        }\n      }\n      return _isPlain(val) ? _wrapNested(raw, state, val, rootProp) : val\n    },\n    set(obj, prop, value) {\n      if (typeof prop === 'symbol') {\n        obj[prop] = value\n        return true\n      }\n      value = _unwrap(value)\n      const old = obj[prop]\n      if (old === value) return true\n      obj[prop] = value\n      if (Array.isArray(obj)) {\n        if (value && typeof value === 'object') (value as Record<symbol, unknown>)[GEA_DIRTY] = true\n        const idx = +prop\n        if (Number.isInteger(idx) && obj === (raw as Record<string, unknown>)[rootProp]) {\n          _queue(raw, state, rootProp, { aipu: true, arix: idx, previousValue: old, newValue: value })\n          return true\n        }\n      } else {\n        ;(obj as Record<symbol, unknown>)[GEA_DIRTY] = true\n        const dirtyProps = ((obj as Record<symbol, unknown>)[GEA_DIRTY_PROPS] ??= new Set()) as Set<string>\n        dirtyProps.add(prop)\n      }\n      _queue(raw, state, rootProp, { previousValue: old, newValue: value })\n      return true\n    },\n    deleteProperty(obj, prop) {\n      if (typeof prop === 'symbol') {\n        delete obj[prop]\n        return true\n      }\n      const old = obj[prop]\n      delete obj[prop]\n      if (!Array.isArray(obj)) (obj as Record<symbol, unknown>)[GEA_DIRTY] = true\n      _queue(raw, state, rootProp, { previousValue: old, type: 'delete' })\n      return true\n    },\n  })\n  if (!perTarget) {\n    perTarget = new Map()\n    _hidden(targetObj, _NESTED, perTarget)\n  }\n  perTarget.set(rootProp, proxy)\n  return proxy as V\n}\n\nexport class CompiledStore<S extends Record<string, any> = Record<string, any>> {\n  constructor() {\n    const state: StoreState<S> = { ready: false }\n    _hidden(this, _PRIV, state)\n    const proxy = new Proxy(this as unknown as S, {\n      get(target: S, prop: string | symbol, receiver: object) {\n        if (prop === GEA_PROXY_RAW) return target\n        if (typeof prop === 'symbol') return (target as Record<symbol, unknown>)[prop]\n        trackRead(receiver ?? target, prop)\n        const value = target[prop as keyof S]\n        if (typeof value === 'function') return (value as (...args: unknown[]) => unknown).bind(receiver)\n        return _isPlain(value) ? _wrapNested(target, state, value, prop) : value\n      },\n      set(target: S, prop: string | symbol, value: unknown) {\n        if (typeof prop === 'symbol') {\n          ;(target as Record<symbol, unknown>)[prop] = value\n          return true\n        }\n        value = _unwrap(value)\n        const old = target[prop as keyof S]\n        if (old === value && prop in target) {\n          if (Array.isArray(value)) _queue(target, state, prop, { previousValue: old, newValue: value })\n          return true\n        }\n        if (old && typeof old === 'object') delete (old as Record<symbol, unknown>)[_NESTED]\n        ;(target as Record<string, unknown>)[prop] = value\n        const direct = state.direct?.get(prop)\n        if (direct) for (const h of direct) h(value as S[keyof S])\n        _queue(target, state, prop, { previousValue: old, newValue: value })\n        return true\n      },\n    })\n    _hidden(proxy as unknown as object, _PRIV, state)\n    ;(this as unknown as Record<symbol, unknown>)[GEA_STORE_ROOT] = proxy\n    return proxy as unknown as this\n  }\n\n  observe(pathOrProp: string | readonly string[], handler: Handler<S>): () => void {\n    const state: StoreState<S> | undefined = (this as unknown as Record<symbol, StoreState<S>>)[_PRIV]\n    if (!state) return () => {}\n    state.ready = true\n    const isArr = Array.isArray(pathOrProp)\n    // `path` / `text` carry the two alternatives in their own exact slots so\n    // `.length` / `[0]` / `.slice` have a `readonly string[]` receiver: called on\n    // `pathOrProp` — declared `string | readonly string[]` — the intrinsic has no\n    // single receiver carrier and `pathOrProp.slice(1)` fail-closed with\n    // `representation-plan coverage gap for CallExpression`. Each read is already\n    // guarded by `isArr`, so neither default is ever observed.\n    let path: readonly string[] = []\n    let text = ''\n    if (typeof pathOrProp === 'string') text = pathOrProp\n    else path = pathOrProp\n    if ((isArr && path.length === 0) || (!isArr && text === '')) {\n      const bucket = state.rootObservers ?? (state.rootObservers = new Set())\n      bucket.add(handler)\n      return () => {\n        bucket.delete(handler)\n      }\n    }\n    const prop = isArr ? (path[0] ?? '') : text\n    const tail = isArr && path.length > 1 ? path.slice(1) : null\n    const finalHandler: Handler<S> = tail\n      ? (value, changes) => {\n          let next: unknown = value\n          for (let i = 0; i < tail.length; i++) {\n            if (next == null) return\n            next = (next as Record<string, unknown>)[tail[i]]\n          }\n          handler(next as S[keyof S], changes)\n        }\n      : handler\n    let isDerived = false\n    if (!Object.prototype.hasOwnProperty.call(this, prop)) {\n      for (\n        let proto = Object.getPrototypeOf(this);\n        proto && proto !== Object.prototype;\n        proto = Object.getPrototypeOf(proto)\n      ) {\n        const descriptor = Object.getOwnPropertyDescriptor(proto, prop)\n        if (descriptor) {\n          isDerived = !!descriptor.get\n          break\n        }\n      }\n    }\n    const observers = isDerived\n      ? (state.derived ?? (state.derived = new Map()))\n      : (state.observers ?? (state.observers = new Map()))\n    let bucket = observers.get(prop)\n    if (!bucket) observers.set(prop, (bucket = new Set()))\n    bucket.add(finalHandler)\n    return () => {\n      bucket!.delete(finalHandler)\n    }\n  }\n\n  [GEA_OBSERVE_DIRECT](prop: string, handler: (value: S[keyof S]) => void): () => void {\n    const state: StoreState<S> | undefined = (this as unknown as Record<symbol, StoreState<S>>)[_PRIV]\n    if (!state) return () => {}\n    state.ready = true\n    const direct = state.direct ?? (state.direct = new Map())\n    let bucket = direct.get(prop)\n    if (!bucket) direct.set(prop, (bucket = new Set()))\n    bucket.add(handler)\n    return () => {\n      bucket!.delete(handler)\n    }\n  }\n}\n\nexport default CompiledStore\n","import { GEA_CREATE_TEMPLATE, GEA_DOM_COMPONENT, GEA_ELEMENT, GEA_ON_PROP_CHANGE } from './symbols'\nimport { GEA_CREATED_CALLED, GEA_DISPOSER, GEA_SET_PROPS } from './internal-symbols'\nimport { createDisposer, type Disposer } from './disposer'\nimport { CompiledStore } from './compiled-store'\nimport { getComponentId } from './component-id'\nimport type { Renderable } from './renderable'\n\n/**\n * One thunk per prop of `P`, each returning that prop's own type.\n *\n * Generic rather than a flat dictionary so a component's props keep their\n * declared types all the way through `GEA_SET_PROPS` — the compiler emits one\n * thunk per JSX attribute, so the mapping is exact at every instantiation.\n *\n * `children` is intersected in separately (not folded into the mapped part)\n * because JSX always permits a childless invocation regardless of whether\n * `P` declares a `children` field — the compiler attaches a children thunk\n * whenever the call site has JSX children, independent of `P`'s own shape.\n */\ntype PropThunks<P> = { [K in keyof P]: () => P[K] } & { children?: () => Renderable }\nconst GEA_COMPONENT_ID = Symbol()\nconst GEA_LAST_PROP_VALUES = Symbol()\n\nexport class CompiledReactiveComponent<P extends Record<string, any> = Record<string, any>> extends CompiledStore {\n  rendered = false\n  props: P = {} as P;\n\n  [GEA_ELEMENT] = null as HTMLElement | null;\n  [GEA_DISPOSER] = createDisposer() as Disposer;\n  [GEA_CREATED_CALLED] = false\n\n  get id(): string {\n    return ((this as any)[GEA_COMPONENT_ID] ??= getComponentId())\n  }\n\n  set id(value: string) {\n    ;(this as any)[GEA_COMPONENT_ID] = value\n  }\n\n  get el(): HTMLElement | null {\n    return this[GEA_ELEMENT] ?? null\n  }\n\n  [GEA_SET_PROPS](thunks: PropThunks<P>): void {\n    const createdCalled = this[GEA_CREATED_CALLED]\n    const notifyPropChange = createdCalled ? (this as any)[GEA_ON_PROP_CHANGE] : undefined\n    const prevValues: Record<string, any> | undefined =\n      typeof notifyPropChange === 'function' ? (this as any)[GEA_LAST_PROP_VALUES] : undefined\n    const out: Record<string, any> = {}\n    for (const k in thunks) {\n      Object.defineProperty(out, k, {\n        enumerable: true,\n        configurable: true,\n        get: () => thunks[k](),\n      })\n    }\n    const childrenThunk = thunks.children\n    if (typeof childrenThunk === 'function') {\n      let cached: Renderable = undefined\n      let cacheNode = false\n      Object.defineProperty(out, 'children', {\n        enumerable: true,\n        configurable: true,\n        get: () => {\n          if (cacheNode) return cached\n          const v = childrenThunk()\n          if (v !== null && typeof v === 'object' && typeof (v as Node).nodeType === 'number') {\n            cached = v\n            cacheNode = true\n          }\n          return v\n        },\n      })\n    }\n    this.props = out as P\n    const nextValues: Record<string, any> = {}\n    for (const key in thunks) nextValues[key] = this.props?.[key]\n    ;(this as any)[GEA_LAST_PROP_VALUES] = nextValues\n    if (!createdCalled) {\n      this[GEA_CREATED_CALLED] = true\n      if (this.created !== CompiledReactiveComponent.prototype.created) this.created(this.props)\n    } else if (typeof notifyPropChange === 'function') {\n      for (const key in thunks) {\n        const prev = prevValues?.[key]\n        const next = this.props?.[key]\n        if (next !== prev || (prev !== null && typeof prev === 'object')) notifyPropChange.call(this, key, next)\n      }\n    }\n  }\n\n  [GEA_CREATE_TEMPLATE](_disposer: Disposer): Node {\n    return document.createDocumentFragment()\n  }\n\n  render(parent: Node, _index?: number): void {\n    if (!this[GEA_CREATED_CALLED]) {\n      this[GEA_CREATED_CALLED] = true\n      if (this.created !== CompiledReactiveComponent.prototype.created) this.created(this.props)\n    }\n    let node = this[GEA_CREATE_TEMPLATE](this[GEA_DISPOSER])\n    if (node == null) node = document.createComment('')\n    if (typeof (node as any).nodeType !== 'number') {\n      if (Array.isArray(node)) {\n        const frag = document.createDocumentFragment()\n        for (const n of node) {\n          if (n == null) continue\n          if (typeof (n as any).nodeType === 'number') frag.appendChild(n as Node)\n          else frag.appendChild(document.createTextNode(String(n)))\n        }\n        node = frag\n      } else {\n        node = document.createTextNode(String(node))\n      }\n    }\n    parent.appendChild(node)\n    if (node.nodeType === 11) {\n      this[GEA_ELEMENT] = ((parent as Element).lastElementChild as HTMLElement | null) ?? null\n    } else if (node.nodeType === 1) {\n      this[GEA_ELEMENT] = node as HTMLElement\n    }\n    const el = this[GEA_ELEMENT] as any\n    if (el) el[GEA_DOM_COMPONENT] = this\n    this.rendered = true\n    this.onAfterRender()\n  }\n\n  onAfterRender(): void {\n    /* no-op */\n  }\n\n  created(_props?: P): void {\n    /* no-op */\n  }\n\n  dispose(): void {\n    this[GEA_DISPOSER].dispose()\n    const e = this[GEA_ELEMENT] as HTMLElement | null\n    if (e && e.parentNode) e.parentNode.removeChild(e)\n    this[GEA_ELEMENT] = null\n  }\n\n  $(sel: string): Element | null {\n    const e = this[GEA_ELEMENT] as HTMLElement | null\n    return e ? e.querySelector(sel) : null\n  }\n\n  $$(sel: string): Element[] {\n    const e = this[GEA_ELEMENT] as HTMLElement | null\n    return e ? Array.from(e.querySelectorAll(sel)) : []\n  }\n}\n\nexport default CompiledReactiveComponent\n"],"mappings":";;;;;;AAuCA,MAAM,QAAQ,OAAO,iBAAiB;AACtC,MAAM,UAAU,OAAO,mBAAmB;;;;;;;AAQ1C,SAAS,QAA6B,QAAW,KAAa,OAAgB;AAC5E,QAAO,eAAe,QAAQ,KAAK;EAAE;EAAO,UAAU;EAAM,cAAc;EAAM,YAAY;EAAO,CAAC;;;AAItG,SAAS,SAAY,GAAe;AAClC,KAAI,CAAC,KAAK,OAAO,MAAM,SAAU,QAAO;CACxC,MAAM,IAAI,OAAO,eAAe,EAAE;AAClC,QAAO,MAAM,OAAO,aAAa,MAAM,QAAQ,MAAM,QAAQ,EAAE;;;AAIjE,SAAS,QAAW,GAAS;AAE3B,QADkB,KAAM,EAAyC,kBACtC;;AAG7B,SAAS,YAAe,QAAyB,OAAmB,SAAyB;AAC3F,KAAI,OAAO,SAAS,EAAG;AACvB,KAAI,OAAO,SAAS,EAClB,MAAK,MAAM,KAAK,QAAQ;AACtB,IAAE,OAAO,QAAQ;AACjB;;CAGJ,MAAM,WAAyB,EAAE;AACjC,MAAK,MAAM,KAAK,OAAQ,UAAS,KAAK,EAAE;AACxC,MAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI;AACF,WAAS,GAAG,OAAO,QAAQ;SACrB;;AAMZ,SAAS,OAAU,KAAQ,OAA4B;AACrD,OAAM,YAAY;CAClB,MAAM,UAAU,MAAM;AACtB,KAAI,CAAC,WAAW,QAAQ,SAAS,EAAG;AACpC,OAAM,UAAU,KAAA;CAChB,IAAI,aAA8B;AAClC,MAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,OAAO,MAAM;EACnB,MAAM,UAAU,MAAM;AACtB,MAAI,MAAM,iBAAiB,MAAM,SAAS;AACxC,kBAAe,EAAE;AACjB,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAK,YAAW,KAAK,QAAQ,GAAG;;EAEtE,MAAM,SAAS,MAAM,WAAW,IAAI,KAAK;AACzC,MAAI,CAAC,UAAU,OAAO,SAAS,EAAG;AAClC,cAAY,QAAQ,IAAI,OAAkB,QAAQ;;AAEpD,KAAI,cAAc,MAAM,cACtB,aAAY,MAAM,eAAe,KAAmB,WAAW;AAEjE,KAAI,cAAc,MAAM,QACtB,MAAK,MAAM,SAAS,MAAM,SAAS;EACjC,MAAM,OAAO,MAAM;EACnB,MAAM,SAAS,MAAM;AACrB,MAAI,OAAO,SAAS,EAAG;EACvB,IAAI;AACJ,MAAI;AACF,WAAQ,IAAI;UACN;AACN;;AAEF,cAAY,QAAQ,OAAO,WAAW;;;AAK5C,SAAS,oBAAuB,OAAsB,MAAuB;CAC3E,MAAM,SAAS,MAAM,WAAW,IAAI,KAAK;AACzC,QAAO,CAAC,EACL,UAAU,OAAO,OAAO,KACxB,MAAM,iBAAiB,MAAM,cAAc,OAAO,KAClD,MAAM,WAAW,MAAM,QAAQ,OAAO;;AAI3C,SAAS,OAAU,KAAQ,OAAsB,MAAc,SAA0B,EAAE,EAAQ;AACjG,KAAI,CAAC,MAAM,SAAS,CAAC,oBAAoB,OAAO,KAAK,CAAE;CACvD,MAAM,MAAc;EAAE;EAAM,WAAW,CAAC,KAAK;EAAE,MAAM;EAAU,QAAQ;EAAK,GAAG;EAAQ;CACvF,MAAM,UAAU,MAAM,YAAY,MAAM,0BAAU,IAAI,KAAK;CAC3D,MAAM,MAAM,QAAQ,IAAI,KAAK;AAC7B,KAAI,IAAK,KAAI,KAAK,IAAI;KACjB,SAAQ,IAAI,MAAM,CAAC,IAAI,CAAC;AAC7B,KAAI,CAAC,MAAM,WAAW;AACpB,QAAM,YAAY;AAClB,uBAAqB,OAAO,KAAK,MAAM,CAAC;;;;;;;;;;;;;AAc5C,SAAS,YAAkB,KAAQ,OAAsB,QAAW,UAAqB;AACvF,KAAI,CAAC,SAAS,OAAO,CAAE,QAAO;CAC9B,MAAM,YAAY;CAClB,IAAI,YAA+C,UACjD;AAEF,KAAI,WAAW;EACb,MAAM,SAAS,UAAU,IAAI,SAAS;AACtC,MAAI,OAAQ,QAAO;;CAErB,MAAM,QAAQ,IAAI,MAAM,WAAW;EACjC,IAAI,KAAK,MAAM;AACb,OAAI,SAAS,cAAe,QAAO;AACnC,OAAI,OAAO,SAAS,SAAU,QAAO,IAAI;AACzC,aAAU,KAAe,SAAS;GAClC,MAAM,MAAM,IAAI;AAChB,OAAI,MAAM,QAAQ,IAAI,IAAI,OAAO,QAAQ,YAAY;AACnD,QAAI,SAAS,OACX,SAAQ,GAAG,SAAoB;KAC7B,MAAM,QAAS,IAAkB;KACjC,MAAM,SAAS,MAAM,UAAU,KAAK,MAAM,KAAK,KAAK,IAAI,QAAQ,CAAC;AACjE,SAAI,QAAS,IAAgC,aAAc,IAAkB,SAAS,MACpF,QAAO,KAAK,OAAO,UAAU;MAAE,MAAM;MAAU;MAAO,OAAQ,IAAkB,SAAS;MAAO,CAAC;SAEjG,QAAO,KAAK,OAAO,SAAS;AAE9B,YAAO;;AAGX,QAAI,SAAS,SACX,SAAQ,GAAG,SAAoB;KAC7B,MAAM,SAAU,IAAkB;KAClC,MAAM,QAAS,KAAK,KAAgB;KACpC,MAAM,SAAS,MAAM,UAAU,OAAO,MACpC,KACA,KAAK,SAAS,IACT;MAAC,KAAK;MAAI,KAAK;MAAI,GAAG,KAAK,MAAM,EAAE,CAAC,IAAI,QAAQ;MAAC,GACjD,KACN;AACD,SAAI,QAAS,IAAgC,WAAW;MACtD,MAAM,QAAS,IAAkB;AACjC,UAAI,QAAQ,OAAQ,QAAO,KAAK,OAAO,UAAU;OAAE,MAAM;OAAU;OAAO,OAAO,SAAS;OAAO,CAAC;UAC7F,QAAO,KAAK,OAAO,UAAU,EAAE,MAAM,WAAW,CAAC;WAEtD,QAAO,KAAK,OAAO,SAAS;AAE9B,YAAO;;AAGX,QAAI,SAAS,SAAS,SAAS,QAC7B,SAAQ,GAAG,SAAoB;KAC7B,MAAM,SAAU,IAAkB;KAClC,MAAM,SAAU,MAAM,UAAsE,MAAM,MAChG,KACA,KACD;KACD,MAAM,QAAS,IAAkB;AACjC,SAAI,QAAS,IAAgC,aAAa,QAAQ,OAChE,QAAO,KAAK,OAAO,UAAU;MAAE,MAAM;MAAU,OAAO,SAAS,QAAQ,QAAQ;MAAG,OAAO;MAAG,CAAC;SAE7F,QAAO,KAAK,OAAO,SAAS;AAE9B,YAAO;;AAGX,QAAI,SAAS,aAAa,SAAS,UAAU,SAAS,UACpD,SAAQ,GAAG,SAAoB;KAC7B,MAAM,WAAW,SAAS,YAAY,KAAK,IAAI,QAAQ,GAAG;KAC1D,MAAM,SAAU,MAAM,UAAsE,MAAM,MAChG,KACA,SACD;AACD,SAAI,QAAS,IAAgC,UAC3C,QAAO,KAAK,OAAO,UAAU,EAAE,MAAM,WAAW,CAAC;SAEjD,QAAO,KAAK,OAAO,SAAS;AAE9B,YAAO;;;AAIb,UAAO,SAAS,IAAI,GAAG,YAAY,KAAK,OAAO,KAAK,SAAS,GAAG;;EAElE,IAAI,KAAK,MAAM,OAAO;AACpB,OAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,QAAQ;AACZ,WAAO;;AAET,WAAQ,QAAQ,MAAM;GACtB,MAAM,MAAM,IAAI;AAChB,OAAI,QAAQ,MAAO,QAAO;AAC1B,OAAI,QAAQ;AACZ,OAAI,MAAM,QAAQ,IAAI,EAAE;AACtB,QAAI,SAAS,OAAO,UAAU,SAAW,OAAkCA,UAAa;IACxF,MAAM,MAAM,CAAC;AACb,QAAI,OAAO,UAAU,IAAI,IAAI,QAAS,IAAgC,WAAW;AAC/E,YAAO,KAAK,OAAO,UAAU;MAAE,MAAM;MAAM,MAAM;MAAK,eAAe;MAAK,UAAU;MAAO,CAAC;AAC5F,YAAO;;UAEJ;AACH,QAAgCA,UAAa;AAE/C,KADqB,IAAgCC,kCAAqB,IAAI,KAAK,EACxE,IAAI,KAAK;;AAEtB,UAAO,KAAK,OAAO,UAAU;IAAE,eAAe;IAAK,UAAU;IAAO,CAAC;AACrE,UAAO;;EAET,eAAe,KAAK,MAAM;AACxB,OAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,IAAI;AACX,WAAO;;GAET,MAAM,MAAM,IAAI;AAChB,UAAO,IAAI;AACX,OAAI,CAAC,MAAM,QAAQ,IAAI,CAAG,KAAgCD,UAAa;AACvE,UAAO,KAAK,OAAO,UAAU;IAAE,eAAe;IAAK,MAAM;IAAU,CAAC;AACpE,UAAO;;EAEV,CAAC;AACF,KAAI,CAAC,WAAW;AACd,8BAAY,IAAI,KAAK;AACrB,UAAQ,WAAW,SAAS,UAAU;;AAExC,WAAU,IAAI,UAAU,MAAM;AAC9B,QAAO;;AAGT,IAAa,gBAAb,MAAgF;CAC9E,cAAc;EACZ,MAAM,QAAuB,EAAE,OAAO,OAAO;AAC7C,UAAQ,MAAM,OAAO,MAAM;EAC3B,MAAM,QAAQ,IAAI,MAAM,MAAsB;GAC5C,IAAI,QAAW,MAAuB,UAAkB;AACtD,QAAI,SAAS,cAAe,QAAO;AACnC,QAAI,OAAO,SAAS,SAAU,QAAQ,OAAmC;AACzE,cAAU,YAAY,QAAQ,KAAK;IACnC,MAAM,QAAQ,OAAO;AACrB,QAAI,OAAO,UAAU,WAAY,QAAQ,MAA0C,KAAK,SAAS;AACjG,WAAO,SAAS,MAAM,GAAG,YAAY,QAAQ,OAAO,OAAO,KAAK,GAAG;;GAErE,IAAI,QAAW,MAAuB,OAAgB;AACpD,QAAI,OAAO,SAAS,UAAU;AAC1B,YAAmC,QAAQ;AAC7C,YAAO;;AAET,YAAQ,QAAQ,MAAM;IACtB,MAAM,MAAM,OAAO;AACnB,QAAI,QAAQ,SAAS,QAAQ,QAAQ;AACnC,SAAI,MAAM,QAAQ,MAAM,CAAE,QAAO,QAAQ,OAAO,MAAM;MAAE,eAAe;MAAK,UAAU;MAAO,CAAC;AAC9F,YAAO;;AAET,QAAI,OAAO,OAAO,QAAQ,SAAU,QAAQ,IAAgC;AAC1E,WAAmC,QAAQ;IAC7C,MAAM,SAAS,MAAM,QAAQ,IAAI,KAAK;AACtC,QAAI,OAAQ,MAAK,MAAM,KAAK,OAAQ,GAAE,MAAoB;AAC1D,WAAO,QAAQ,OAAO,MAAM;KAAE,eAAe;KAAK,UAAU;KAAO,CAAC;AACpE,WAAO;;GAEV,CAAC;AACF,UAAQ,OAA4B,OAAO,MAAM;AAC/C,OAA4C,kBAAkB;AAChE,SAAO;;CAGT,QAAQ,YAAwC,SAAiC;EAC/E,MAAM,QAAoC,KAAkD;AAC5F,MAAI,CAAC,MAAO,cAAa;AACzB,QAAM,QAAQ;EACd,MAAM,QAAQ,MAAM,QAAQ,WAAW;EAOvC,IAAI,OAA0B,EAAE;EAChC,IAAI,OAAO;AACX,MAAI,OAAO,eAAe,SAAU,QAAO;MACtC,QAAO;AACZ,MAAK,SAAS,KAAK,WAAW,KAAO,CAAC,SAAS,SAAS,IAAK;GAC3D,MAAM,SAAS,MAAM,kBAAkB,MAAM,gCAAgB,IAAI,KAAK;AACtE,UAAO,IAAI,QAAQ;AACnB,gBAAa;AACX,WAAO,OAAO,QAAQ;;;EAG1B,MAAM,OAAO,QAAS,KAAK,MAAM,KAAM;EACvC,MAAM,OAAO,SAAS,KAAK,SAAS,IAAI,KAAK,MAAM,EAAE,GAAG;EACxD,MAAM,eAA2B,QAC5B,OAAO,YAAY;GAClB,IAAI,OAAgB;AACpB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,QAAI,QAAQ,KAAM;AAClB,WAAQ,KAAiC,KAAK;;AAEhD,WAAQ,MAAoB,QAAQ;MAEtC;EACJ,IAAI,YAAY;AAChB,MAAI,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,KAAK,CACnD,MACE,IAAI,QAAQ,OAAO,eAAe,KAAK,EACvC,SAAS,UAAU,OAAO,WAC1B,QAAQ,OAAO,eAAe,MAAM,EACpC;GACA,MAAM,aAAa,OAAO,yBAAyB,OAAO,KAAK;AAC/D,OAAI,YAAY;AACd,gBAAY,CAAC,CAAC,WAAW;AACzB;;;EAIN,MAAM,YAAY,YACb,MAAM,YAAY,MAAM,0BAAU,IAAI,KAAK,IAC3C,MAAM,cAAc,MAAM,4BAAY,IAAI,KAAK;EACpD,IAAI,SAAS,UAAU,IAAI,KAAK;AAChC,MAAI,CAAC,OAAQ,WAAU,IAAI,MAAO,yBAAS,IAAI,KAAK,CAAE;AACtD,SAAO,IAAI,aAAa;AACxB,eAAa;AACX,UAAQ,OAAO,aAAa;;;CAIhC,CAAC,oBAAoB,MAAc,SAAkD;EACnF,MAAM,QAAoC,KAAkD;AAC5F,MAAI,CAAC,MAAO,cAAa;AACzB,QAAM,QAAQ;EACd,MAAM,SAAS,MAAM,WAAW,MAAM,yBAAS,IAAI,KAAK;EACxD,IAAI,SAAS,OAAO,IAAI,KAAK;AAC7B,MAAI,CAAC,OAAQ,QAAO,IAAI,MAAO,yBAAS,IAAI,KAAK,CAAE;AACnD,SAAO,IAAI,QAAQ;AACnB,eAAa;AACX,UAAQ,OAAO,QAAQ;;;;;;AC5W7B,MAAM,mBAAmB,QAAQ;AACjC,MAAM,uBAAuB,QAAQ;AAErC,IAAa,4BAAb,MAAa,kCAAuF,cAAc;;;kBACrG;eACA,EAAE;OAEZ,eAAe;OACf,gBAAgB,gBAAgB;OAChC,sBAAsB;;CAEvB,IAAI,KAAa;AACf,SAAQ,KAAc,sBAAsB,gBAAgB;;CAG9D,IAAI,GAAG,OAAe;AAClB,OAAa,oBAAoB;;CAGrC,IAAI,KAAyB;AAC3B,SAAO,KAAK,gBAAgB;;CAG9B,CAAC,eAAe,QAA6B;EAC3C,MAAM,gBAAgB,KAAK;EAC3B,MAAM,mBAAmB,gBAAiB,KAAa,sBAAsB,KAAA;EAC7E,MAAM,aACJ,OAAO,qBAAqB,aAAc,KAAa,wBAAwB,KAAA;EACjF,MAAM,MAA2B,EAAE;AACnC,OAAK,MAAM,KAAK,OACd,QAAO,eAAe,KAAK,GAAG;GAC5B,YAAY;GACZ,cAAc;GACd,WAAW,OAAO,IAAI;GACvB,CAAC;EAEJ,MAAM,gBAAgB,OAAO;AAC7B,MAAI,OAAO,kBAAkB,YAAY;GACvC,IAAI,SAAqB,KAAA;GACzB,IAAI,YAAY;AAChB,UAAO,eAAe,KAAK,YAAY;IACrC,YAAY;IACZ,cAAc;IACd,WAAW;AACT,SAAI,UAAW,QAAO;KACtB,MAAM,IAAI,eAAe;AACzB,SAAI,MAAM,QAAQ,OAAO,MAAM,YAAY,OAAQ,EAAW,aAAa,UAAU;AACnF,eAAS;AACT,kBAAY;;AAEd,YAAO;;IAEV,CAAC;;AAEJ,OAAK,QAAQ;EACb,MAAM,aAAkC,EAAE;AAC1C,OAAK,MAAM,OAAO,OAAQ,YAAW,OAAO,KAAK,QAAQ;AACvD,OAAa,wBAAwB;AACvC,MAAI,CAAC,eAAe;AAClB,QAAK,sBAAsB;AAC3B,OAAI,KAAK,YAAY,0BAA0B,UAAU,QAAS,MAAK,QAAQ,KAAK,MAAM;aACjF,OAAO,qBAAqB,WACrC,MAAK,MAAM,OAAO,QAAQ;GACxB,MAAM,OAAO,aAAa;GAC1B,MAAM,OAAO,KAAK,QAAQ;AAC1B,OAAI,SAAS,QAAS,SAAS,QAAQ,OAAO,SAAS,SAAW,kBAAiB,KAAK,MAAM,KAAK,KAAK;;;CAK9G,CAAC,qBAAqB,WAA2B;AAC/C,SAAO,SAAS,wBAAwB;;CAG1C,OAAO,QAAc,QAAuB;AAC1C,MAAI,CAAC,KAAK,qBAAqB;AAC7B,QAAK,sBAAsB;AAC3B,OAAI,KAAK,YAAY,0BAA0B,UAAU,QAAS,MAAK,QAAQ,KAAK,MAAM;;EAE5F,IAAI,OAAO,KAAK,qBAAqB,KAAK,cAAc;AACxD,MAAI,QAAQ,KAAM,QAAO,SAAS,cAAc,GAAG;AACnD,MAAI,OAAQ,KAAa,aAAa,SACpC,KAAI,MAAM,QAAQ,KAAK,EAAE;GACvB,MAAM,OAAO,SAAS,wBAAwB;AAC9C,QAAK,MAAM,KAAK,MAAM;AACpB,QAAI,KAAK,KAAM;AACf,QAAI,OAAQ,EAAU,aAAa,SAAU,MAAK,YAAY,EAAU;QACnE,MAAK,YAAY,SAAS,eAAe,OAAO,EAAE,CAAC,CAAC;;AAE3D,UAAO;QAEP,QAAO,SAAS,eAAe,OAAO,KAAK,CAAC;AAGhD,SAAO,YAAY,KAAK;AACxB,MAAI,KAAK,aAAa,GACpB,MAAK,eAAiB,OAAmB,oBAA2C;WAC3E,KAAK,aAAa,EAC3B,MAAK,eAAe;EAEtB,MAAM,KAAK,KAAK;AAChB,MAAI,GAAI,IAAG,qBAAqB;AAChC,OAAK,WAAW;AAChB,OAAK,eAAe;;CAGtB,gBAAsB;CAItB,QAAQ,QAAkB;CAI1B,UAAgB;AACd,OAAK,cAAc,SAAS;EAC5B,MAAM,IAAI,KAAK;AACf,MAAI,KAAK,EAAE,WAAY,GAAE,WAAW,YAAY,EAAE;AAClD,OAAK,eAAe;;CAGtB,EAAE,KAA6B;EAC7B,MAAM,IAAI,KAAK;AACf,SAAO,IAAI,EAAE,cAAc,IAAI,GAAG;;CAGpC,GAAG,KAAwB;EACzB,MAAM,IAAI,KAAK;AACf,SAAO,IAAI,MAAM,KAAK,EAAE,iBAAiB,IAAI,CAAC,GAAG,EAAE"}

package/dist/component-id.mjs

@@ -1,8 +1,19 @@
 //#region ../gea/src/runtime/component-id.ts
 let counter = null;
+/**
+* A process-unique component id.
+*
+* Deliberately base 10, not base 36. `Number.prototype.toString(radix)` is only
+* exactly specified for a receiver that is a safe integer, and a compiler that
+* proves its output rather than trusting it cannot establish that for a runtime
+* counter without an integer-domain analysis — so the radix form is refused on
+* the embedded target, where this module is compiled ahead of time.
+*
+* The radix only ever bought a shorter string. Ids stay just as unique.
+*/
 function getComponentId() {
 	counter ??= Math.floor(Math.random() * 2147483648);
-	return (counter++).toString(36);
+	return (counter++).toString();
 }
 //#endregion
 export { getComponentId as t };

package/dist/component-id.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"component-id.mjs","names":[],"sources":["../../gea/src/runtime/component-id.ts"],"sourcesContent":["let counter: number | null = null\n\nexport function getComponentId(): string {\n  counter ??= Math.floor(Math.random() * 2147483648)\n  return (counter++).toString(36)\n}\n"],"mappings":";AAAA,IAAI,UAAyB;AAE7B,SAAgB,iBAAyB;AACvC,aAAY,KAAK,MAAM,KAAK,QAAQ,GAAG,WAAW;AAClD,SAAQ,WAAW,SAAS,GAAG"}
+{"version":3,"file":"component-id.mjs","names":[],"sources":["../../gea/src/runtime/component-id.ts"],"sourcesContent":["let counter: number | null = null\n\n/**\n * A process-unique component id.\n *\n * Deliberately base 10, not base 36. `Number.prototype.toString(radix)` is only\n * exactly specified for a receiver that is a safe integer, and a compiler that\n * proves its output rather than trusting it cannot establish that for a runtime\n * counter without an integer-domain analysis — so the radix form is refused on\n * the embedded target, where this module is compiled ahead of time.\n *\n * The radix only ever bought a shorter string. Ids stay just as unique.\n */\nexport function getComponentId(): string {\n  counter ??= Math.floor(Math.random() * 2147483648)\n  return (counter++).toString()\n}\n"],"mappings":";AAAA,IAAI,UAAyB;;;;;;;;;;;;AAa7B,SAAgB,iBAAyB;AACvC,aAAY,KAAK,MAAM,KAAK,QAAQ,GAAG,WAAW;AAClD,SAAQ,WAAW,UAAU"}

package/dist/conditional.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"conditional.mjs","names":[],"sources":["../../gea/src/runtime/conditional.ts"],"sourcesContent":["/**\n * conditional(parent, anchor, disposer, root, cond, mkTrue, mkFalse?)\n *\n * Closure-compiled reactive conditional: mounts one of two branches into\n * `parent` immediately before `anchor`, and swaps when `cond()` changes.\n *\n * - Each branch gets its own child disposer scope (`disposer.child()`), so\n *   anything the branch sets up (subscriptions, nested conditionals, keyed\n *   lists, mounted components) tears down when the branch unmounts.\n * - Dep tracking on `cond` is done lexically via `withTracking(disposer, root, ...)`.\n *   `root` is the enclosing component's store proxy — proxy gets during `cond()`\n *   push paths into the active scope; on any notified path, the scope re-runs.\n * - `mkFalse` is optional; if omitted, the falsy branch renders a placeholder\n *   comment so the anchor position stays well-defined.\n * - DocumentFragment returns are handled: `insertBefore` moves a fragment's\n *   children into `parent`, so we capture `childNodes` BEFORE insertion to\n *   later remove the exact set of inserted nodes.\n */\n\nimport type { Disposer } from './disposer'\nimport { withTracking, untrack } from './with-tracking'\n\ntype BranchFactory = (d: Disposer) => Node\n\nexport function conditional(\n  parent: Node,\n  anchor: Comment,\n  disposer: Disposer,\n  root: any,\n  cond: () => boolean,\n  mkTrue: BranchFactory,\n  mkFalse?: BranchFactory,\n): void {\n  let currentValue: boolean | null = null\n  let currentNodes: Node[] | null = null\n  let currentChild: Disposer | null = null\n\n  // Install a persistent sentinel at the compiler anchor's position. The\n  // original anchor is removed so downstream compiler walk indices (which\n  // treat the conditional slot as a single node position) stay correct. The\n  // sentinel stays in the DOM for the lifetime of this conditional and serves\n  // as a stable insertion point for every swap.\n  const sentinel = document.createComment('')\n  const p0 = anchor.parentNode ?? parent\n  p0.insertBefore(sentinel, anchor)\n  p0.removeChild(anchor)\n\n  const placeholder: BranchFactory = () => document.createComment('')\n  const elseFactory = mkFalse ?? placeholder\n\n  function unmount(): void {\n    if (currentChild) {\n      currentChild.dispose()\n      currentChild = null\n    }\n    if (currentNodes) {\n      for (let i = 0; i < currentNodes.length; i++) {\n        const n = currentNodes[i]\n        const p = n.parentNode\n        if (p) p.removeChild(n)\n      }\n      currentNodes = null\n    }\n  }\n\n  function mount(v: boolean): void {\n    const childD = disposer.child()\n    const factory = v ? mkTrue : elseFactory\n    // Build the branch's DOM without leaking eager reads into the enclosing\n    // withTracking scope. Fine-grained reactive primitives inside the branch\n    // (reactiveText, reactiveAttr, keyedList, etc.) set up their own tracking\n    // scopes via bind/withTracking — they don't need the outer scope.\n    const node = untrack(() => factory(childD))\n    // Capture child list BEFORE insertion — DocumentFragment children are\n    // moved out of the fragment into `parent` on insertBefore. Use nodeType\n    // (11 = DOCUMENT_FRAGMENT_NODE) so the check works regardless of whether\n    // `DocumentFragment` is a global in the host environment.\n    const isFragment = node.nodeType === 11\n    const nodes: Node[] = isFragment ? Array.from(node.childNodes) : [node]\n    const p = sentinel.parentNode ?? parent\n    p.insertBefore(node, sentinel)\n    currentChild = childD\n    currentNodes = nodes\n  }\n\n  function swap(v: boolean): void {\n    if (v === currentValue) return\n    unmount()\n    currentValue = v\n    mount(v)\n  }\n\n  withTracking(disposer, root, () => {\n    const v = !!cond()\n    swap(v)\n  })\n\n  // Ensure final teardown when the parent scope disposes. `withTracking`\n  // already registers its own teardown for subscriptions; we additionally\n  // remove the live branch nodes + dispose the active branch scope.\n  disposer.add(() => {\n    unmount()\n    if (sentinel.parentNode) sentinel.parentNode.removeChild(sentinel)\n    currentValue = null\n  })\n}\n"],"mappings":";;AAwBA,SAAgB,YACd,QACA,QACA,UACA,MACA,MACA,QACA,SACM;CACN,IAAI,eAA+B;CACnC,IAAI,eAA8B;CAClC,IAAI,eAAgC;CAOpC,MAAM,WAAW,SAAS,cAAc,GAAG;CAC3C,MAAM,KAAK,OAAO,cAAc;AAChC,IAAG,aAAa,UAAU,OAAO;AACjC,IAAG,YAAY,OAAO;CAEtB,MAAM,oBAAmC,SAAS,cAAc,GAAG;CACnE,MAAM,cAAc,WAAW;CAE/B,SAAS,UAAgB;AACvB,MAAI,cAAc;AAChB,gBAAa,SAAS;AACtB,kBAAe;;AAEjB,MAAI,cAAc;AAChB,QAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;IAC5C,MAAM,IAAI,aAAa;IACvB,MAAM,IAAI,EAAE;AACZ,QAAI,EAAG,GAAE,YAAY,EAAE;;AAEzB,kBAAe;;;CAInB,SAAS,MAAM,GAAkB;EAC/B,MAAM,SAAS,SAAS,OAAO;EAC/B,MAAM,UAAU,IAAI,SAAS;EAK7B,MAAM,OAAO,cAAc,QAAQ,OAAO,CAAC;EAM3C,MAAM,QADa,KAAK,aAAa,KACF,MAAM,KAAK,KAAK,WAAW,GAAG,CAAC,KAAK;AAEvE,GADU,SAAS,cAAc,QAC/B,aAAa,MAAM,SAAS;AAC9B,iBAAe;AACf,iBAAe;;CAGjB,SAAS,KAAK,GAAkB;AAC9B,MAAI,MAAM,aAAc;AACxB,WAAS;AACT,iBAAe;AACf,QAAM,EAAE;;AAGV,cAAa,UAAU,YAAY;AAEjC,OAAK,CADM,CAAC,MAAM,CACX;GACP;AAKF,UAAS,UAAU;AACjB,WAAS;AACT,MAAI,SAAS,WAAY,UAAS,WAAW,YAAY,SAAS;AAClE,iBAAe;GACf"}
+{"version":3,"file":"conditional.mjs","names":[],"sources":["../../gea/src/runtime/conditional.ts"],"sourcesContent":["/**\n * conditional(parent, anchor, disposer, root, cond, mkTrue, mkFalse?)\n *\n * Closure-compiled reactive conditional: mounts one of two branches into\n * `parent` immediately before `anchor`, and swaps when `cond()` changes.\n *\n * - Each branch gets its own child disposer scope (`disposer.child()`), so\n *   anything the branch sets up (subscriptions, nested conditionals, keyed\n *   lists, mounted components) tears down when the branch unmounts.\n * - Dep tracking on `cond` is done lexically via `withTracking(disposer, root, ...)`.\n *   `root` is the enclosing component's store proxy — proxy gets during `cond()`\n *   push paths into the active scope; on any notified path, the scope re-runs.\n * - `mkFalse` is optional; if omitted, the falsy branch renders a placeholder\n *   comment so the anchor position stays well-defined.\n * - DocumentFragment returns are handled: `insertBefore` moves a fragment's\n *   children into `parent`, so we capture `childNodes` BEFORE insertion to\n *   later remove the exact set of inserted nodes.\n */\n\nimport type { Disposer } from './disposer'\nimport { withTracking, untrack } from './with-tracking'\n\ntype BranchFactory = (d: Disposer) => Node\n\nexport function conditional(\n  parent: Node,\n  anchor: Comment,\n  disposer: Disposer,\n  root: object,\n  cond: () => boolean,\n  mkTrue: BranchFactory,\n  mkFalse?: BranchFactory,\n): void {\n  let currentValue: boolean | null = null\n  let currentNodes: Node[] | null = null\n  let currentChild: Disposer | null = null\n\n  // Install a persistent sentinel at the compiler anchor's position. The\n  // original anchor is removed so downstream compiler walk indices (which\n  // treat the conditional slot as a single node position) stay correct. The\n  // sentinel stays in the DOM for the lifetime of this conditional and serves\n  // as a stable insertion point for every swap.\n  const sentinel = document.createComment('')\n  const p0 = anchor.parentNode ?? parent\n  p0.insertBefore(sentinel, anchor)\n  p0.removeChild(anchor)\n\n  const placeholder: BranchFactory = () => document.createComment('')\n  const elseFactory = mkFalse ?? placeholder\n\n  function unmount(): void {\n    if (currentChild) {\n      currentChild.dispose()\n      currentChild = null\n    }\n    if (currentNodes) {\n      for (let i = 0; i < currentNodes.length; i++) {\n        const n = currentNodes[i]\n        const p = n.parentNode\n        if (p) p.removeChild(n)\n      }\n      currentNodes = null\n    }\n  }\n\n  function mount(v: boolean): void {\n    const childD = disposer.child()\n    const factory = v ? mkTrue : elseFactory\n    // Build the branch's DOM without leaking eager reads into the enclosing\n    // withTracking scope. Fine-grained reactive primitives inside the branch\n    // (reactiveText, reactiveAttr, keyedList, etc.) set up their own tracking\n    // scopes via bind/withTracking — they don't need the outer scope.\n    const node = untrack(() => factory(childD))\n    // Capture child list BEFORE insertion — DocumentFragment children are\n    // moved out of the fragment into `parent` on insertBefore. Use nodeType\n    // (11 = DOCUMENT_FRAGMENT_NODE) so the check works regardless of whether\n    // `DocumentFragment` is a global in the host environment.\n    const isFragment = node.nodeType === 11\n    const nodes: Node[] = isFragment ? Array.from(node.childNodes) : [node]\n    const p = sentinel.parentNode ?? parent\n    p.insertBefore(node, sentinel)\n    currentChild = childD\n    currentNodes = nodes\n  }\n\n  function swap(v: boolean): void {\n    if (v === currentValue) return\n    unmount()\n    currentValue = v\n    mount(v)\n  }\n\n  withTracking(disposer, root, () => {\n    const v = !!cond()\n    swap(v)\n  })\n\n  // Ensure final teardown when the parent scope disposes. `withTracking`\n  // already registers its own teardown for subscriptions; we additionally\n  // remove the live branch nodes + dispose the active branch scope.\n  disposer.add(() => {\n    unmount()\n    if (sentinel.parentNode) sentinel.parentNode.removeChild(sentinel)\n    currentValue = null\n  })\n}\n"],"mappings":";;AAwBA,SAAgB,YACd,QACA,QACA,UACA,MACA,MACA,QACA,SACM;CACN,IAAI,eAA+B;CACnC,IAAI,eAA8B;CAClC,IAAI,eAAgC;CAOpC,MAAM,WAAW,SAAS,cAAc,GAAG;CAC3C,MAAM,KAAK,OAAO,cAAc;AAChC,IAAG,aAAa,UAAU,OAAO;AACjC,IAAG,YAAY,OAAO;CAEtB,MAAM,oBAAmC,SAAS,cAAc,GAAG;CACnE,MAAM,cAAc,WAAW;CAE/B,SAAS,UAAgB;AACvB,MAAI,cAAc;AAChB,gBAAa,SAAS;AACtB,kBAAe;;AAEjB,MAAI,cAAc;AAChB,QAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;IAC5C,MAAM,IAAI,aAAa;IACvB,MAAM,IAAI,EAAE;AACZ,QAAI,EAAG,GAAE,YAAY,EAAE;;AAEzB,kBAAe;;;CAInB,SAAS,MAAM,GAAkB;EAC/B,MAAM,SAAS,SAAS,OAAO;EAC/B,MAAM,UAAU,IAAI,SAAS;EAK7B,MAAM,OAAO,cAAc,QAAQ,OAAO,CAAC;EAM3C,MAAM,QADa,KAAK,aAAa,KACF,MAAM,KAAK,KAAK,WAAW,GAAG,CAAC,KAAK;AAEvE,GADU,SAAS,cAAc,QAC/B,aAAa,MAAM,SAAS;AAC9B,iBAAe;AACf,iBAAe;;CAGjB,SAAS,KAAK,GAAkB;AAC9B,MAAI,MAAM,aAAc;AACxB,WAAS;AACT,iBAAe;AACf,QAAM,EAAE;;AAGV,cAAa,UAAU,YAAY;AAEjC,OAAK,CADM,CAAC,MAAM,CACX;GACP;AAKF,UAAS,UAAU;AACjB,WAAS;AACT,MAAI,SAAS,WAAY,UAAS,WAAW,YAAY,SAAS;AAClE,iBAAe;GACf"}

package/dist/delegate-event.mjs

@@ -1,11 +1,11 @@
 //#region ../gea/src/runtime/delegate-event.ts
-const _NON_BUBBLING = {
-	blur: true,
-	focus: true,
-	mouseenter: true,
-	mouseleave: true,
-	scroll: true
-};
+const _NON_BUBBLING = new Set([
+	"blur",
+	"focus",
+	"mouseenter",
+	"mouseleave",
+	"scroll"
+]);
 function dispatchWithCurrentTarget(handler, event, currentTarget) {
 	const previous = Object.getOwnPropertyDescriptor(event, "currentTarget");
 	Object.defineProperty(event, "currentTarget", {
@@ -39,11 +39,11 @@ function delegateEvent(root, type, pairs, _disposer) {
 					return;
 				}
 			}
-		}, _NON_BUBBLING[type] === true);
+		}, _NON_BUBBLING.has(type));
 	}
 	for (let i = 0; i < pairs.length; i++) {
 		const el = pairs[i][0];
-		if (el) if (pairs[i][2] === false) el[k] = pairs[i][1];
+		if (el) if (pairs[i].length > 2) el[k] = pairs[i][1];
 		else el[currentTargetKey] = pairs[i][1];
 	}
 }

package/dist/delegate-event.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"delegate-event.mjs","names":[],"sources":["../../gea/src/runtime/delegate-event.ts"],"sourcesContent":["/**\n * Per-document event delegation via element expando properties.\n *\n * Fast JSX-declared handlers are stored as own properties on their host\n * element (`el.__on_click = handler`). Handlers that need element-local\n * `currentTarget` semantics use the slower `__onct_click` slot.\n * A single document-level listener per eventType walks from `e.target` up,\n * checks the expando on each node, and dispatches.\n *\n * Why this beats a Map<Element, Handler> dispatcher:\n *   - Expando lookup is an inline-cached own-property read.\n *   - No per-list Map allocation; DOM nodes are the storage.\n *   - Detached elements take their handler expando with them, so bulk row\n *     teardown avoids removeEventListener / Map.delete work.\n *\n * Although the real DOM listener is installed on the document, Gea exposes\n * element-local handler semantics: while a matched handler runs,\n * `e.currentTarget` is the element that owned that handler.\n */\n\nimport type { Disposer } from './disposer'\n\nconst _NON_BUBBLING: Record<string, true> = {\n  blur: true,\n  focus: true,\n  mouseenter: true,\n  mouseleave: true,\n  scroll: true,\n}\n\ntype Handler = (e: Event) => void\ntype HandlerPair = [Element, Handler] | [Element, Handler, false]\n\nfunction dispatchWithCurrentTarget(handler: Handler, event: Event, currentTarget: Element): void {\n  const previous = Object.getOwnPropertyDescriptor(event, 'currentTarget')\n  Object.defineProperty(event, 'currentTarget', { configurable: true, value: currentTarget })\n  try {\n    handler(event)\n  } finally {\n    if (previous) Object.defineProperty(event, 'currentTarget', previous)\n    else delete (event as any).currentTarget\n  }\n}\n\nexport function delegateEvent(root: Element, type: string, pairs: HandlerPair[], _disposer: Disposer): void {\n  // Prefer the live global `document` — template clones' ownerDocument may\n  // differ from the adopted document (jsdom installs fresh docs per test).\n  const rt: any = typeof document !== 'undefined' ? document : root.ownerDocument\n  const k = '__on_' + type\n  const currentTargetKey = '__onct_' + type\n  const flag = '__d_' + type\n  if (!rt[flag]) {\n    rt[flag] = 1\n    rt.addEventListener(\n      type,\n      (e: Event) => {\n        for (let n: Node | null = e.target as Node | null; n && n !== rt; n = n.parentNode) {\n          const h = (n as any)[k] as Handler | undefined\n          if (h !== undefined) {\n            h(e)\n            return\n          }\n          const hct = (n as any)[currentTargetKey] as Handler | undefined\n          if (hct !== undefined) {\n            dispatchWithCurrentTarget(hct, e, n as Element)\n            return\n          }\n        }\n      },\n      _NON_BUBBLING[type] === true,\n    )\n  }\n  for (let i = 0; i < pairs.length; i++) {\n    const el = pairs[i][0]\n    if (el) {\n      if (pairs[i][2] === false) {\n        ;(el as any)[k] = pairs[i][1]\n      } else {\n        ;(el as any)[currentTargetKey] = pairs[i][1]\n      }\n    }\n  }\n  // No disposer cleanup: when the element is removed from the DOM and GC'd,\n  // the expando dies with it. Skipping a symmetric removeDelegate avoids\n  // N `delete el[k]` per row on large replace/clear workloads. A dead expando\n  // on a detached element is harmless: events no longer bubble through it, so\n  // the document listener never walks into it.\n}\n"],"mappings":";AAsBA,MAAM,gBAAsC;CAC1C,MAAM;CACN,OAAO;CACP,YAAY;CACZ,YAAY;CACZ,QAAQ;CACT;AAKD,SAAS,0BAA0B,SAAkB,OAAc,eAA8B;CAC/F,MAAM,WAAW,OAAO,yBAAyB,OAAO,gBAAgB;AACxE,QAAO,eAAe,OAAO,iBAAiB;EAAE,cAAc;EAAM,OAAO;EAAe,CAAC;AAC3F,KAAI;AACF,UAAQ,MAAM;WACN;AACR,MAAI,SAAU,QAAO,eAAe,OAAO,iBAAiB,SAAS;MAChE,QAAQ,MAAc;;;AAI/B,SAAgB,cAAc,MAAe,MAAc,OAAsB,WAA2B;CAG1G,MAAM,KAAU,OAAO,aAAa,cAAc,WAAW,KAAK;CAClE,MAAM,IAAI,UAAU;CACpB,MAAM,mBAAmB,YAAY;CACrC,MAAM,OAAO,SAAS;AACtB,KAAI,CAAC,GAAG,OAAO;AACb,KAAG,QAAQ;AACX,KAAG,iBACD,OACC,MAAa;AACZ,QAAK,IAAI,IAAiB,EAAE,QAAuB,KAAK,MAAM,IAAI,IAAI,EAAE,YAAY;IAClF,MAAM,IAAK,EAAU;AACrB,QAAI,MAAM,KAAA,GAAW;AACnB,OAAE,EAAE;AACJ;;IAEF,MAAM,MAAO,EAAU;AACvB,QAAI,QAAQ,KAAA,GAAW;AACrB,+BAA0B,KAAK,GAAG,EAAa;AAC/C;;;KAIN,cAAc,UAAU,KACzB;;AAEH,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,KAAK,MAAM,GAAG;AACpB,MAAI,GACF,KAAI,MAAM,GAAG,OAAO,MAChB,IAAW,KAAK,MAAM,GAAG;MAEzB,IAAW,oBAAoB,MAAM,GAAG"}
+{"version":3,"file":"delegate-event.mjs","names":[],"sources":["../../gea/src/runtime/delegate-event.ts"],"sourcesContent":["/**\n * Per-document event delegation via element expando properties.\n *\n * Fast JSX-declared handlers are stored as own properties on their host\n * element (`el.__on_click = handler`). Handlers that need element-local\n * `currentTarget` semantics use the slower `__onct_click` slot.\n * A single document-level listener per eventType walks from `e.target` up,\n * checks the expando on each node, and dispatches.\n *\n * Why this beats a Map<Element, Handler> dispatcher:\n *   - Expando lookup is an inline-cached own-property read.\n *   - No per-list Map allocation; DOM nodes are the storage.\n *   - Detached elements take their handler expando with them, so bulk row\n *     teardown avoids removeEventListener / Map.delete work.\n *\n * Although the real DOM listener is installed on the document, Gea exposes\n * element-local handler semantics: while a matched handler runs,\n * `e.currentTarget` is the element that owned that handler.\n */\n\nimport type { Disposer } from './disposer'\n\n// A Set keeps the membership test native under geatsc; a Record<string, true>\n// computed access has no native plan and trips the boxed-equality guard.\n// Mirrors `delegate-event-fast.ts`, which took the same treatment.\nconst _NON_BUBBLING = new Set<string>(['blur', 'focus', 'mouseenter', 'mouseleave', 'scroll'])\n\ntype Handler = (e: Event) => void\ntype HandlerPair = [Element, Handler] | [Element, Handler, false]\n\nfunction dispatchWithCurrentTarget(handler: Handler, event: Event, currentTarget: Element): void {\n  const previous = Object.getOwnPropertyDescriptor(event, 'currentTarget')\n  Object.defineProperty(event, 'currentTarget', { configurable: true, value: currentTarget })\n  try {\n    handler(event)\n  } finally {\n    if (previous) Object.defineProperty(event, 'currentTarget', previous)\n    else delete (event as any).currentTarget\n  }\n}\n\nexport function delegateEvent(root: Element, type: string, pairs: HandlerPair[], _disposer: Disposer): void {\n  // Prefer the live global `document` — template clones' ownerDocument may\n  // differ from the adopted document (jsdom installs fresh docs per test).\n  const rt: any = typeof document !== 'undefined' ? document : root.ownerDocument\n  const k = '__on_' + type\n  const currentTargetKey = '__onct_' + type\n  const flag = '__d_' + type\n  if (!rt[flag]) {\n    rt[flag] = 1\n    rt.addEventListener(\n      type,\n      (e: Event) => {\n        for (let n: Node | null = e.target as Node | null; n && n !== rt; n = n.parentNode) {\n          const h = (n as any)[k] as Handler | undefined\n          if (h !== undefined) {\n            h(e)\n            return\n          }\n          const hct = (n as any)[currentTargetKey] as Handler | undefined\n          if (hct !== undefined) {\n            dispatchWithCurrentTarget(hct, e, n as Element)\n            return\n          }\n        }\n      },\n      _NON_BUBBLING.has(type),\n    )\n  }\n  for (let i = 0; i < pairs.length; i++) {\n    const el = pairs[i][0]\n    if (el) {\n      // A 3-element pair (`[el, handler, false]`) is the compiler's\n      // fast, no-shadow marker; a plain 2-element pair defaults to the\n      // slower `currentTarget`-shadowing slot. Test the pair length (a\n      // native numeric compare) rather than `pairs[i][2] === false`, whose\n      // boxed `false | undefined` equality has no native plan under geatsc.\n      if (pairs[i].length > 2) {\n        ;(el as any)[k] = pairs[i][1]\n      } else {\n        ;(el as any)[currentTargetKey] = pairs[i][1]\n      }\n    }\n  }\n  // No disposer cleanup: when the element is removed from the DOM and GC'd,\n  // the expando dies with it. Skipping a symmetric removeDelegate avoids\n  // N `delete el[k]` per row on large replace/clear workloads. A dead expando\n  // on a detached element is harmless: events no longer bubble through it, so\n  // the document listener never walks into it.\n}\n"],"mappings":";AAyBA,MAAM,gBAAgB,IAAI,IAAY;CAAC;CAAQ;CAAS;CAAc;CAAc;CAAS,CAAC;AAK9F,SAAS,0BAA0B,SAAkB,OAAc,eAA8B;CAC/F,MAAM,WAAW,OAAO,yBAAyB,OAAO,gBAAgB;AACxE,QAAO,eAAe,OAAO,iBAAiB;EAAE,cAAc;EAAM,OAAO;EAAe,CAAC;AAC3F,KAAI;AACF,UAAQ,MAAM;WACN;AACR,MAAI,SAAU,QAAO,eAAe,OAAO,iBAAiB,SAAS;MAChE,QAAQ,MAAc;;;AAI/B,SAAgB,cAAc,MAAe,MAAc,OAAsB,WAA2B;CAG1G,MAAM,KAAU,OAAO,aAAa,cAAc,WAAW,KAAK;CAClE,MAAM,IAAI,UAAU;CACpB,MAAM,mBAAmB,YAAY;CACrC,MAAM,OAAO,SAAS;AACtB,KAAI,CAAC,GAAG,OAAO;AACb,KAAG,QAAQ;AACX,KAAG,iBACD,OACC,MAAa;AACZ,QAAK,IAAI,IAAiB,EAAE,QAAuB,KAAK,MAAM,IAAI,IAAI,EAAE,YAAY;IAClF,MAAM,IAAK,EAAU;AACrB,QAAI,MAAM,KAAA,GAAW;AACnB,OAAE,EAAE;AACJ;;IAEF,MAAM,MAAO,EAAU;AACvB,QAAI,QAAQ,KAAA,GAAW;AACrB,+BAA0B,KAAK,GAAG,EAAa;AAC/C;;;KAIN,cAAc,IAAI,KAAK,CACxB;;AAEH,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,KAAK,MAAM,GAAG;AACpB,MAAI,GAMF,KAAI,MAAM,GAAG,SAAS,EAClB,IAAW,KAAK,MAAM,GAAG;MAEzB,IAAW,oBAAoB,MAAM,GAAG"}

package/dist/disposer.mjs

@@ -1,9 +1,33 @@
 //#region ../gea/src/runtime/disposer.ts
-var _Disposer = class _Disposer {
-	constructor() {
+/**
+* Disposer — LIFO teardown registry.
+*
+* Class-based so the `add` / `dispose` / `child` methods live on the prototype
+* once, instead of being closures created per instance. Each `createDisposer()`
+* call was allocating 3 closures; on a 1000-row keyed list with per-row
+* children that's ~3000 closure allocations that GC had to chase. The class
+* form drops that to one shared prototype plus the per-instance `f[]` array
+* and (for children) a single dispose-bridge closure.
+*
+* `Disposer` is the CLASS, not an interface over it. The interface had exactly
+* two implementors — this class and the `NOOP_DISPOSER` object literal — which
+* made every `Disposer`-typed slot polymorphic between a class instance and a
+* record, and geatsc has no native carrier for that: the type derives lattice
+* bottom, so `CompiledComponent`'s `[GEA_DISPOSER] = createDisposer() as
+* Disposer` field raised `representation-plan coverage gap for
+* PropertyDeclaration`, and `conditional()`'s `currentChild: Disposer | null`
+* capture blocked its whole nested-function cluster. One class with a `noop`
+* flag has a single concrete carrier and behaves identically: a no-op disposer
+* registers nothing, disposes an empty stack, and hands back itself as its own
+* child.
+*/
+var Disposer = class Disposer {
+	constructor(noop = false) {
 		this.f = [];
+		this.noop = noop;
 	}
 	add(fn) {
+		if (this.noop) return;
 		this.f.push(fn);
 	}
 	dispose() {
@@ -14,7 +38,8 @@ var _Disposer = class _Disposer {
 		f.length = 0;
 	}
 	child() {
-		const c = new _Disposer();
+		if (this.noop) return this;
+		const c = new Disposer();
 		this.f.push(_dispatchChild(c));
 		return c;
 	}
@@ -23,7 +48,7 @@ function _dispatchChild(c) {
 	return () => c.dispose();
 }
 function createDisposer() {
-	return new _Disposer();
+	return new Disposer();
 }
 /**
 * Shared no-op disposer for rows that register no cleanup work.
@@ -33,13 +58,7 @@ function createDisposer() {
 * fresh `{ add() {}, dispose() {}, child() { return this } }` literal per
 * row. 09 clear1k ×8 was paying ~8k object-literal allocations before.
 */
-const NOOP_DISPOSER = {
-	add(_fn) {},
-	dispose() {},
-	child() {
-		return NOOP_DISPOSER;
-	}
-};
+const NOOP_DISPOSER = new Disposer(true);
 //#endregion
 export { createDisposer as n, NOOP_DISPOSER as t };
 

package/dist/disposer.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"disposer.mjs","names":[],"sources":["../../gea/src/runtime/disposer.ts"],"sourcesContent":["/**\n * Disposer — LIFO teardown registry.\n *\n * Class-based so the `add` / `dispose` / `child` methods live on the prototype\n * once, instead of being closures created per instance. Each `createDisposer()`\n * call was allocating 3 closures; on a 1000-row keyed list with per-row\n * children that's ~3000 closure allocations that GC had to chase. The class\n * form drops that to one shared prototype plus the per-instance `f[]` array\n * and (for children) a single dispose-bridge closure.\n */\n\nexport interface Disposer {\n  add(fn: () => void): void\n  dispose(): void\n  child(): Disposer\n}\n\nclass _Disposer implements Disposer {\n  f: Array<() => void> = []\n  add(fn: () => void): void {\n    this.f.push(fn)\n  }\n  dispose(): void {\n    const f = this.f\n    // Hoisted try/catch (one per dispose call, not per iteration) — measurable\n    // on 09_clear1k's ~5000-cleanup teardown. Framework-owned cleanups don't\n    // throw under normal operation; if one does, the remainder of THIS\n    // disposer's stack is skipped (best-effort teardown: one failure does not\n    // run the rest of this disposer's callbacks).\n    try {\n      for (let i = f.length - 1; i >= 0; i--) f[i]()\n    } catch {\n      /* one handler threw */\n    }\n    f.length = 0\n  }\n  child(): Disposer {\n    const c = new _Disposer()\n    this.f.push(_dispatchChild(c))\n    return c\n  }\n}\n\nfunction _dispatchChild(c: _Disposer): () => void {\n  return () => c.dispose()\n}\n\nexport function createDisposer(): Disposer {\n  return new _Disposer()\n}\n\n/**\n * Shared no-op disposer for rows that register no cleanup work.\n *\n * The compiler references this (via `@geajs/core`'s export surface) whenever\n * a keyed-list site proves `noRowDisposer: true` — cheaper than emitting a\n * fresh `{ add() {}, dispose() {}, child() { return this } }` literal per\n * row. 09 clear1k ×8 was paying ~8k object-literal allocations before.\n */\nexport const NOOP_DISPOSER: Disposer = {\n  add(_fn: () => void): void {\n    /* no-op */\n  },\n  dispose(): void {\n    /* no-op */\n  },\n  child(): Disposer {\n    return NOOP_DISPOSER\n  },\n}\n"],"mappings":";AAiBA,IAAM,YAAN,MAAM,UAA8B;;WACX,EAAE;;CACzB,IAAI,IAAsB;AACxB,OAAK,EAAE,KAAK,GAAG;;CAEjB,UAAgB;EACd,MAAM,IAAI,KAAK;AAMf,MAAI;AACF,QAAK,IAAI,IAAI,EAAE,SAAS,GAAG,KAAK,GAAG,IAAK,GAAE,IAAI;UACxC;AAGR,IAAE,SAAS;;CAEb,QAAkB;EAChB,MAAM,IAAI,IAAI,WAAW;AACzB,OAAK,EAAE,KAAK,eAAe,EAAE,CAAC;AAC9B,SAAO;;;AAIX,SAAS,eAAe,GAA0B;AAChD,cAAa,EAAE,SAAS;;AAG1B,SAAgB,iBAA2B;AACzC,QAAO,IAAI,WAAW;;;;;;;;;;AAWxB,MAAa,gBAA0B;CACrC,IAAI,KAAuB;CAG3B,UAAgB;CAGhB,QAAkB;AAChB,SAAO;;CAEV"}
+{"version":3,"file":"disposer.mjs","names":[],"sources":["../../gea/src/runtime/disposer.ts"],"sourcesContent":["/**\n * Disposer — LIFO teardown registry.\n *\n * Class-based so the `add` / `dispose` / `child` methods live on the prototype\n * once, instead of being closures created per instance. Each `createDisposer()`\n * call was allocating 3 closures; on a 1000-row keyed list with per-row\n * children that's ~3000 closure allocations that GC had to chase. The class\n * form drops that to one shared prototype plus the per-instance `f[]` array\n * and (for children) a single dispose-bridge closure.\n *\n * `Disposer` is the CLASS, not an interface over it. The interface had exactly\n * two implementors — this class and the `NOOP_DISPOSER` object literal — which\n * made every `Disposer`-typed slot polymorphic between a class instance and a\n * record, and geatsc has no native carrier for that: the type derives lattice\n * bottom, so `CompiledComponent`'s `[GEA_DISPOSER] = createDisposer() as\n * Disposer` field raised `representation-plan coverage gap for\n * PropertyDeclaration`, and `conditional()`'s `currentChild: Disposer | null`\n * capture blocked its whole nested-function cluster. One class with a `noop`\n * flag has a single concrete carrier and behaves identically: a no-op disposer\n * registers nothing, disposes an empty stack, and hands back itself as its own\n * child.\n */\n\nexport class Disposer {\n  f: Array<() => void> = []\n  /** A shared no-op disposer ignores registrations and owns no children. */\n  noop: boolean\n\n  constructor(noop = false) {\n    this.noop = noop\n  }\n\n  add(fn: () => void): void {\n    if (this.noop) return\n    this.f.push(fn)\n  }\n\n  dispose(): void {\n    const f = this.f\n    // Hoisted try/catch (one per dispose call, not per iteration) — measurable\n    // on 09_clear1k's ~5000-cleanup teardown. Framework-owned cleanups don't\n    // throw under normal operation; if one does, the remainder of THIS\n    // disposer's stack is skipped (best-effort teardown: one failure does not\n    // run the rest of this disposer's callbacks).\n    try {\n      for (let i = f.length - 1; i >= 0; i--) f[i]()\n    } catch {\n      /* one handler threw */\n    }\n    f.length = 0\n  }\n\n  child(): Disposer {\n    if (this.noop) return this\n    const c = new Disposer()\n    this.f.push(_dispatchChild(c))\n    return c\n  }\n}\n\nfunction _dispatchChild(c: Disposer): () => void {\n  return () => c.dispose()\n}\n\nexport function createDisposer(): Disposer {\n  return new Disposer()\n}\n\n/**\n * Shared no-op disposer for rows that register no cleanup work.\n *\n * The compiler references this (via `@geajs/core`'s export surface) whenever\n * a keyed-list site proves `noRowDisposer: true` — cheaper than emitting a\n * fresh `{ add() {}, dispose() {}, child() { return this } }` literal per\n * row. 09 clear1k ×8 was paying ~8k object-literal allocations before.\n */\nexport const NOOP_DISPOSER: Disposer = new Disposer(true)\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAuBA,IAAa,WAAb,MAAa,SAAS;CAKpB,YAAY,OAAO,OAAO;WAJH,EAAE;AAKvB,OAAK,OAAO;;CAGd,IAAI,IAAsB;AACxB,MAAI,KAAK,KAAM;AACf,OAAK,EAAE,KAAK,GAAG;;CAGjB,UAAgB;EACd,MAAM,IAAI,KAAK;AAMf,MAAI;AACF,QAAK,IAAI,IAAI,EAAE,SAAS,GAAG,KAAK,GAAG,IAAK,GAAE,IAAI;UACxC;AAGR,IAAE,SAAS;;CAGb,QAAkB;AAChB,MAAI,KAAK,KAAM,QAAO;EACtB,MAAM,IAAI,IAAI,UAAU;AACxB,OAAK,EAAE,KAAK,eAAe,EAAE,CAAC;AAC9B,SAAO;;;AAIX,SAAS,eAAe,GAAyB;AAC/C,cAAa,EAAE,SAAS;;AAG1B,SAAgB,iBAA2B;AACzC,QAAO,IAAI,UAAU;;;;;;;;;;AAWvB,MAAa,gBAA0B,IAAI,SAAS,KAAK"}