@ktjs/core 0.38.7 → 0.38.8

package/dist/index.mjs

@@ -353,7 +353,7 @@ function applyKModel(element, valueRef) {
  * ## About
  * @package @ktjs/core
  * @author Kasukabe Tsumugi <futami16237@gmail.com>
- * @version 0.38.7 (Last Update: 2026.04.11 15:30:51.606)
+ * @version 0.38.8 (Last Update: 2026.04.11 16:54:04.892)
  * @license MIT
  * @link https://github.com/baendlorel/kt.js
  * @link https://baendlorel.github.io/ Welcome to my site!
@@ -675,7 +675,7 @@ function KTFor(props) {
         if (0 === newLength) return nodeMap.forEach(node => node.remove()), nodeMap.clear(), 
         anchor.list.length = 0, anchor;
         if (0 === oldLength) {
-            anchor.list.length = 0;
+            anchor.list.length = 0, nodeMap.clear();
             const fragment = document.createDocumentFragment();
             for (let i = 0; i < newLength; i++) {
                 const item = newList[i], itemKey = currentKey(item, i, newList), node = currentMap(item, i, newList);

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","sources":["../src/reactable/common.ts","../src/reactable/reactive.ts","../src/jsx/anchor.ts","../src/h/attr-helpers.ts","../src/h/attr.ts","../src/h/content.ts","../src/h/model.ts","../src/h/index.ts","../src/reactable/scheduler.ts","../src/reactable/ref.ts","../src/reactable/computed.ts","../src/reactable/effect.ts","../src/reactable/index.ts","../src/jsx/fragment.ts","../src/jsx/common.ts","../src/jsx/jsx-runtime.ts","../src/jsx/async.ts","../src/jsx/for.ts","../src/jsx/if.ts"],"sourcesContent":["import { KTReactiveLike, KTReactiveType, type KTReactive } from './reactive.js';\nimport type { KTRef, KTRefLike, KTSubRef } from './ref.js';\nimport type { KTComputed, KTComputedLike, KTSubComputed } from './computed.js';\n\n// # type guards\nexport function isKT<T = any>(obj: any): obj is KTReactiveLike<T> {\n  return typeof obj?.kid === 'number';\n}\n\nexport function isReactiveLike<T = any>(obj: any): obj is KTReactiveLike<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.ReactiveLike) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isRef<T = any>(obj: any): obj is KTRef<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.Ref;\n  } else {\n    return false;\n  }\n}\n\nexport function isSubRef<T = any>(obj: any): obj is KTSubRef<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.SubRef;\n  } else {\n    return false;\n  }\n}\n\nexport function isRefLike<T = any>(obj: any): obj is KTRefLike<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.RefLike) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isComputed<T = any>(obj: any): obj is KTComputed<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.Computed;\n  } else {\n    return false;\n  }\n}\n\nexport function isSubComputed<T = any>(obj: any): obj is KTSubComputed<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.SubComputed;\n  } else {\n    return false;\n  }\n}\n\nexport function isComputedLike<T = any>(obj: any): obj is KTComputedLike<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.ComputedLike) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isReactive<T = any>(obj: any): obj is KTReactive<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.Reactive) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isSubReactive<T = any>(obj: any): obj is KTSubComputed<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.SubReactive) !== 0;\n  } else {\n    return false;\n  }\n}\n\n// # sub getter/setter factory\n\ntype SubGetter = (s: any) => any;\ntype SubSetter = (s: any, newValue: any) => void;\n\n/**\n * Create a value getter which params is `reactive.value`(or `ref.draft`)\n */\nexport const $createSubGetter = (path: Array<string | number>): SubGetter => {\n  // & path.length is guaranteed to be greater than 0 in `KTReactive.get` and `KTRef.get`\n  switch (path.length) {\n    // ? Does it use less memory if we write this:\n    // const [k2_0, k2_1] = path;\n    // return (s) => s[k2_0][k2_1];\n    case 1:\n      return (s) => s[path[0]];\n    case 2:\n      return (s) => s[path[0]][path[1]];\n    case 3:\n      return (s) => s[path[0]][path[1]][path[2]];\n    case 4:\n      return (s) => s[path[0]][path[1]][path[2]][path[3]];\n    case 5:\n      return (s) => s[path[0]][path[1]][path[2]][path[3]][path[4]];\n    default:\n      return (s) => {\n        let r = s[path[0]][path[1]][path[2]][path[3]][path[4]];\n        for (let i = 5; i < path.length; i++) {\n          r = r[path[i]];\n        }\n        return r;\n      };\n  }\n};\n\n/**\n * Create a value setter which params is `reactive.value`(or `ref.draft`)\n */\nexport const $createSubSetter = (path: Array<string | number>): SubSetter => {\n  switch (path.length) {\n    case 1:\n      return (s, newValue) => (s[path[0]] = newValue);\n    case 2:\n      return (s, newValue) => (s[path[0]][path[1]] = newValue);\n    case 3:\n      return (s, newValue) => (s[path[0]][path[1]][path[2]] = newValue);\n    case 4:\n      return (s, newValue) => (s[path[0]][path[1]][path[2]][path[3]] = newValue);\n    case 5:\n      return (s, newValue) => (s[path[0]][path[1]][path[2]][path[3]][path[4]] = newValue);\n    default:\n      return (s, newValue) => {\n        let r = s[path[0]][path[1]][path[2]][path[3]][path[4]];\n        for (let i = 5; i < path.length - 1; i++) {\n          r = r[path[i]];\n        }\n        r[path[path.length - 1]] = newValue;\n      };\n  }\n};\n","import type { KTComputed, KTSubComputed } from './computed.js';\n\nimport { $stringify } from '@ktjs/shared';\n\nexport type ChangeHandler<T> = (newValue: T, oldValue: T) => void;\n\nexport const enum KTReactiveType {\n  Pseudo = 0b000001,\n  Ref = 0b000010,\n  SubRef = 0b000100,\n  RefLike = Ref | SubRef,\n  Computed = 0b001000,\n  SubComputed = 0b010000,\n  ComputedLike = Computed | SubComputed,\n  Reactive = Ref | Computed,\n  SubReactive = SubRef | SubComputed,\n  ReactiveLike = RefLike | ComputedLike | Pseudo,\n}\n\nlet kid = 1;\nlet handlerId = 1;\n\nexport const nextKid = () => kid++;\nexport const nextHandlerId = (kid: number) => `@@k-handler-${kid}-${handlerId++}`;\n\nexport abstract class KTReactiveLike<T> {\n  readonly kid = nextKid();\n\n  abstract readonly ktype: KTReactiveType;\n\n  abstract get value(): T;\n\n  abstract addOnChange(handler: ChangeHandler<T>, key?: any): this;\n  abstract removeOnChange(key: any): this;\n\n  abstract dispose(): void;\n}\n\nexport abstract class KTReactive<T> extends KTReactiveLike<T> {\n  /**\n   * @internal\n   */\n  protected _value: T;\n\n  /**\n   * @internal\n   */\n  protected readonly _changeHandlers = new Map<any, ChangeHandler<any>>();\n\n  constructor(value: T) {\n    super();\n    this._value = value;\n  }\n\n  get value() {\n    return this._value;\n  }\n\n  set value(_newValue: T) {\n    $warn('Setting value to a non-ref instance takes no effect.');\n  }\n\n  /**\n   * @internal\n   */\n  protected _emit(newValue: T, oldValue: T): this {\n    this._changeHandlers.forEach((handler) => handler(newValue, oldValue));\n    return this;\n  }\n\n  addOnChange(handler: ChangeHandler<T>, key: any = nextHandlerId(this.kid)): this {\n    if (this._changeHandlers.has(key)) {\n      $throw(`Overriding existing change handler with key ${$stringify(key)}.`);\n    }\n    this._changeHandlers.set(key, handler);\n    return this;\n  }\n\n  removeOnChange(key: any): this {\n    this._changeHandlers.delete(key);\n    return this;\n  }\n\n  clearOnChange(): this {\n    this._changeHandlers.clear();\n    return this;\n  }\n\n  notify(): this {\n    return this._emit(this._value, this._value);\n  }\n\n  /**\n   * Create a computed value via current reactive value.\n   * - No matter `this` is added to `dependencies` or not, it is always listened.\n   * @param calculator A function that generates a new value based on current value.\n   * @param dependencies optional other dependencies that the computed value depends on.\n   */\n  map<U>(calculator: (value: T) => U, dependencies?: Array<KTReactiveLike<any>>): KTComputed<U> {\n    return null as any; // & implemented in computed.ts to avoid circular dependency\n  }\n\n  /**\n   * Make a computed value that checks if the reactive value is strictly equal to a specific value.\n   * - Use `Object.is` for comparison.\n   * - if `o` is reactive-like, it will be added to dependencies\n   */\n  is(o: T | KTReactiveLike<T>): KTSubComputed<boolean> {\n    return null as any; // & implemented in computed.ts to avoid circular dependency\n  }\n\n  /**\n   * Make a computed value that checks if the reactive value matches a specific object structure.\n   * - Deeply match.\n   * - if `o` is reactive-like, it will be added to dependencies\n   */\n  match(o: object | KTReactiveLike<object>): KTSubComputed<boolean> {\n    return null as any; // & implemented in computed.ts to avoid circular dependency\n  }\n\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<\n    K0 extends keyof T,\n    K1 extends keyof T[K0],\n    K2 extends keyof T[K0][K1],\n    K3 extends keyof T[K0][K1][K2],\n    K4 extends keyof T[K0][K1][K2][K3],\n  >(key0: K0, key1: K1, key2: K2, key3: K3, key4: K4): KTSubComputed<T[K0][K1][K2][K3][K4]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1], K3 extends keyof T[K0][K1][K2]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n    key3: K3,\n  ): KTSubComputed<T[K0][K1][K2][K3]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n  ): KTSubComputed<T[K0][K1][K2]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T, K1 extends keyof T[K0]>(key0: K0, key1: K1): KTSubComputed<T[K0][K1]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T>(key0: K0): KTSubComputed<T[K0]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get(..._keys: Array<string | number>): KTSubComputed<any> {\n    // & Will be implemented in computed.ts to avoid circular dependency\n    return null as any;\n  }\n}\n\nexport abstract class KTSubReactive<T> extends KTReactiveLike<T> {\n  readonly source: KTReactive<any>;\n\n  /**\n   * @internal\n   */\n  protected _value: T;\n\n  /**\n   * @internal\n   */\n  protected readonly _getter: (sv: KTReactive<any>['value']) => T;\n\n  /**\n   * @internal\n   */\n  protected readonly _handler: ChangeHandler<any>;\n\n  /**\n   * @internal\n   */\n  protected readonly _handlerKeys: string[];\n\n  constructor(source: KTReactive<any>, getter: (sv: KTReactive<any>['value']) => T) {\n    super();\n    this.source = source;\n    this._getter = getter;\n    this._handlerKeys = [];\n\n    // @ts-expect-error _value is protected\n    this._value = this._getter(source._value);\n    // @ts-expect-error _value is protected\n    this._handler = () => (this._value = getter(source._value));\n\n    this._handlerKeys.push(nextHandlerId(this.kid));\n    source.addOnChange(this._handler, this._handlerKeys[0]);\n  }\n\n  addOnChange(handler: ChangeHandler<T>, key: any = nextHandlerId(this.kid)): this {\n    this._handlerKeys.push(key);\n    this.source.addOnChange((newValue, oldValue) => handler(this._getter(newValue), this._getter(oldValue)), key);\n    return this;\n  }\n\n  removeOnChange(key: any): this {\n    this.source.removeOnChange(key);\n    return this;\n  }\n\n  dispose(): void {\n    this._handlerKeys.forEach((key) => this.source.removeOnChange(key));\n  }\n}\n","export const enum AnchorType {\n  Fragment = 'kt-fragment',\n  For = 'kt-for',\n}\n\nexport abstract class KTAnchor<T extends Node = Node> extends Comment {\n  readonly isKTAnchor: true = true;\n  readonly list: T[] = [];\n  abstract readonly type: AnchorType;\n  mountCallback?: () => void;\n\n  constructor(data: AnchorType) {\n    super(data);\n    $ensureAnchorObserver();\n  }\n\n  mount(parent?: Node) {\n    if (parent && this.parentNode !== parent) {\n      parent.appendChild(this);\n    }\n    if (this.parentNode) {\n      this.mountCallback?.();\n    }\n  }\n}\n\ntype MountableKTAnchor = Node & {\n  isKTAnchor?: true;\n  mount?: (parent?: Node) => void;\n};\ntype NodeCleanup = () => void;\n\nconst CANNOT_MOUNT = typeof document === 'undefined' || typeof Node === 'undefined';\nconst CANNOT_OBSERVE = CANNOT_MOUNT || typeof MutationObserver === 'undefined';\nconst COMMENT_FILTER = typeof NodeFilter === 'undefined' ? 0x80 : NodeFilter.SHOW_COMMENT;\nconst ELEMENT_NODE = 1;\nconst DOCUMENT_FRAGMENT_NODE = 11;\nconst nodeToCleanups = new WeakMap<Node, NodeCleanup[]>();\nlet anchorObserver: MutationObserver | undefined;\n\nconst $cleanupRemovedNode = (node: Node) => {\n  if (node.nodeType === ELEMENT_NODE || node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n    const children = Array.from(node.childNodes);\n    for (let i = 0; i < children.length; i++) {\n      $cleanupRemovedNode(children[i]);\n    }\n  }\n\n  const anchor = node as KTAnchor<Node>;\n  if (anchor.isKTAnchor === true) {\n    const list = anchor.list.slice();\n    anchor.list.length = 0;\n    for (let i = 0; i < list.length; i++) {\n      const listNode = list[i] as ChildNode;\n      if (listNode.parentNode) {\n        listNode.remove();\n      }\n      $cleanupRemovedNode(listNode);\n    }\n  }\n\n  $runNodeCleanups(node);\n};\n\nconst $ensureAnchorObserver = () => {\n  if (CANNOT_OBSERVE || anchorObserver || !document.body) {\n    return;\n  }\n\n  anchorObserver = new MutationObserver((records) => {\n    if (typeof document === 'undefined') {\n      anchorObserver?.disconnect();\n      anchorObserver = undefined;\n      return;\n    }\n\n    for (let i = 0; i < records.length; i++) {\n      const addedNodes = records[i].addedNodes;\n      for (let j = 0; j < addedNodes.length; j++) {\n        $mountFragmentAnchors(addedNodes[j]);\n      }\n\n      const removedNodes = records[i].removedNodes;\n      for (let j = 0; j < removedNodes.length; j++) {\n        $cleanupRemovedNode(removedNodes[j]);\n      }\n    }\n  });\n  anchorObserver.observe(document.body, { childList: true, subtree: true });\n};\n\nconst $mountIfFragmentAnchor = (node: Node) => {\n  const anchor = node as MountableKTAnchor;\n  if (anchor.isKTAnchor === true && typeof anchor.mount === 'function') {\n    anchor.mount();\n  }\n};\n\nconst $runNodeCleanups = (node: Node) => {\n  const cleanups = nodeToCleanups.get(node);\n  if (!cleanups) {\n    return;\n  }\n\n  nodeToCleanups.delete(node);\n  for (let i = cleanups.length - 1; i >= 0; i--) {\n    try {\n      cleanups[i]();\n    } catch (error) {\n      $error('KTNodeCleanup:', error);\n    }\n  }\n};\n\nexport const $addNodeCleanup = (node: Node, cleanup: NodeCleanup) => {\n  $ensureAnchorObserver();\n  const cleanups = nodeToCleanups.get(node);\n  if (cleanups) {\n    cleanups.push(cleanup);\n  } else {\n    nodeToCleanups.set(node, [cleanup]);\n  }\n  return cleanup;\n};\n\nexport const $removeNodeCleanup = (node: Node, cleanup: NodeCleanup) => {\n  const cleanups = nodeToCleanups.get(node);\n  if (!cleanups) {\n    return;\n  }\n\n  const index = cleanups.indexOf(cleanup);\n  if (index === -1) {\n    return;\n  }\n\n  cleanups.splice(index, 1);\n  if (cleanups.length === 0) {\n    nodeToCleanups.delete(node);\n  }\n};\n\nexport const $mountFragmentAnchors = (node: unknown) => {\n  if (CANNOT_MOUNT || typeof document === 'undefined' || !node || typeof (node as any).nodeType !== 'number') {\n    return;\n  }\n\n  const nodeObj = node as Node;\n  $mountIfFragmentAnchor(nodeObj);\n\n  if (nodeObj.nodeType !== ELEMENT_NODE && nodeObj.nodeType !== DOCUMENT_FRAGMENT_NODE) {\n    return;\n  }\n\n  const walker = document.createTreeWalker(nodeObj, COMMENT_FILTER);\n  let current = walker.nextNode();\n  while (current) {\n    $mountIfFragmentAnchor(current);\n    current = walker.nextNode();\n  }\n};\n","const booleanHandler = (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) => {\n  if (key in element) {\n    (element as any)[key] = !!value;\n  } else {\n    element.setAttribute(key, value);\n  }\n};\n\nconst valueHandler = (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) => {\n  if (key in element) {\n    (element as any)[key] = value;\n  } else {\n    element.setAttribute(key, value);\n  }\n};\n\n// Attribute handlers map for optimized lookup\nexport const handlers: Record<\n  string,\n  (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) => void\n> = {\n  checked: booleanHandler,\n  selected: booleanHandler,\n  value: valueHandler,\n  valueAsDate: valueHandler,\n  valueAsNumber: valueHandler,\n  defaultValue: valueHandler,\n  defaultChecked: booleanHandler,\n  defaultSelected: booleanHandler,\n  disabled: booleanHandler,\n  readOnly: booleanHandler,\n  multiple: booleanHandler,\n  required: booleanHandler,\n  autofocus: booleanHandler,\n  open: booleanHandler,\n  controls: booleanHandler,\n  autoplay: booleanHandler,\n  loop: booleanHandler,\n  muted: booleanHandler,\n  defer: booleanHandler,\n  async: booleanHandler,\n  hidden: (element, _key, value) => ((element as HTMLElement).hidden = !!value),\n};\n","import type { KTReactifyProps } from '../reactable/types.js';\nimport type { KTRawAttr, KTAttribute } from '../types/h.js';\nimport { isKT } from '../reactable/common.js';\nimport { nextHandlerId } from '../reactable/reactive.js';\nimport { $addNodeCleanup } from '../jsx/anchor.js';\nimport { handlers } from './attr-helpers.js';\n\nconst defaultHandler = (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) =>\n  element.setAttribute(key, value);\n\nconst setElementStyle = (\n  element: HTMLElement | SVGElement | MathMLElement,\n  style: Partial<CSSStyleDeclaration> | string,\n) => {\n  if (typeof style === 'string') {\n    (element as HTMLElement).style.cssText = style;\n    return;\n  }\n\n  for (const key in style) {\n    (element as any).style[key as any] = style[key];\n  }\n};\n\nconst addReactiveCleanup = (\n  element: HTMLElement | SVGElement | MathMLElement,\n  reactive: {\n    addOnChange: (handler: (value: any) => void, key?: any) => unknown;\n    removeOnChange: (key: any) => unknown;\n  },\n  handler: (value: any) => void,\n) => {\n  reactive.addOnChange(handler, handler);\n  $addNodeCleanup(element, () => reactive.removeOnChange(handler));\n};\n\nfunction attrIsObject(element: HTMLElement | SVGElement | MathMLElement, attr: KTReactifyProps<KTAttribute>) {\n  const classValue = attr.class || attr.className;\n  if (classValue !== undefined) {\n    if (isKT<string>(classValue)) {\n      element.setAttribute('class', classValue.value);\n      addReactiveCleanup(element, classValue, (v) => element.setAttribute('class', v));\n    } else {\n      element.setAttribute('class', classValue);\n    }\n  }\n\n  const style = attr.style;\n  if (style) {\n    if (typeof style === 'string') {\n      element.setAttribute('style', style);\n    } else if (typeof style === 'object') {\n      if (isKT(style)) {\n        setElementStyle(element, style.value);\n        addReactiveCleanup(element, style, (v: Partial<CSSStyleDeclaration> | string) => setElementStyle(element, v));\n      } else {\n        setElementStyle(element, style as Partial<CSSStyleDeclaration>);\n      }\n    }\n  }\n\n  // ! Security: `k-html` is an explicit raw HTML escape hatch. kt.js intentionally does not sanitize here; callers must pass only trusted HTML.\n  if ('k-html' in attr) {\n    const html = attr['k-html'];\n    // ?? 如何在元素消失后自动消除html的onChangeHandler呢\n    if (isKT(html)) {\n      element.innerHTML = html.value;\n      const key = nextHandlerId(html.kid);\n      html.addOnChange((v) => (element.innerHTML = v), key);\n      $addNodeCleanup(element, () => html.removeOnChange(key));\n    } else {\n      element.innerHTML = html;\n    }\n  }\n\n  for (const key in attr) {\n    // & Arranged in order of usage frequency\n    if (\n      // key === 'k-if' ||\n      // key === 'k-else' ||\n      key === 'k-model' ||\n      key === 'k-for' ||\n      key === 'k-key' ||\n      key === 'ref' ||\n      key === 'class' ||\n      key === 'className' ||\n      key === 'style' ||\n      key === 'children' ||\n      key === 'k-html'\n    ) {\n      continue;\n    }\n\n    const o = attr[key];\n\n    // normal event handler\n    if (key.startsWith('on:')) {\n      if (o) {\n        const eventName = key.slice(3);\n        element.addEventListener(eventName, o); // chop off the `on:`\n        $addNodeCleanup(element, () => element.removeEventListener(eventName, o));\n      }\n      continue;\n    }\n\n    // normal attributes\n    // Security: all non-`on:` attributes are forwarded as-is.\n    // Dangerous values such as raw `on*`, `href`, `src`, `srcdoc`, SVG href, etc.\n    // remain the caller's responsibility.\n    const handler = handlers[key] || defaultHandler;\n    if (isKT(o)) {\n      handler(element, key, o.value);\n      addReactiveCleanup(element, o, (v) => handler(element, key, v));\n    } else {\n      handler(element, key, o);\n    }\n  }\n}\n\nexport function applyAttr(element: HTMLElement | SVGElement | MathMLElement, attr: KTRawAttr) {\n  if (!attr) {\n    return;\n  }\n  if (typeof attr === 'object' && attr !== null) {\n    attrIsObject(element, attr as KTAttribute);\n  } else {\n    $throw('attr must be an object.');\n  }\n}\n","import { $isArray, $isNode, $isThenable } from '@ktjs/shared';\nimport type { KTAvailableContent, KTRawContent } from '../types/h.js';\nimport { isKT } from '../reactable/common.js';\nimport { AnchorType } from '../jsx/anchor.js';\nimport { $addNodeCleanup, $mountFragmentAnchors } from '../jsx/anchor.js';\n\nconst assureNode = (o: any) => ($isNode(o) ? o : document.createTextNode(o));\n\nfunction apdSingle(element: HTMLElement | DocumentFragment | SVGElement | MathMLElement, c: KTAvailableContent) {\n  // & Ignores falsy values, consistent with React's behavior\n  if (c === undefined || c === null || c === false) {\n    return;\n  }\n\n  if (isKT(c)) {\n    let node = assureNode(c.value);\n    element.appendChild(node);\n    const onChange = (newValue: KTAvailableContent) => {\n      const newNode = assureNode(newValue);\n      const oldNode = node;\n      node = newNode;\n      oldNode.replaceWith(newNode);\n      $mountFragmentAnchors(newNode);\n    };\n    c.addOnChange(onChange, onChange);\n    $addNodeCleanup(element, () => c.removeOnChange(onChange));\n  } else {\n    const node = assureNode(c);\n    element.appendChild(node);\n    const anchor = node as { type?: AnchorType; list?: any[] };\n    if (anchor.type === AnchorType.For) {\n      apd(element, anchor.list);\n    }\n  }\n}\n\nfunction apd(element: HTMLElement | DocumentFragment | SVGElement | MathMLElement, c: KTAvailableContent) {\n  if ($isThenable(c)) {\n    c.then((r) => apd(element, r));\n  } else if ($isArray(c)) {\n    for (let i = 0; i < c.length; i++) {\n      // & might be thenable here too\n      const ci = c[i];\n      if ($isThenable(ci)) {\n        const comment = document.createComment('ktjs-promise-placeholder');\n        element.appendChild(comment);\n        ci.then((awaited) => {\n          if ($isNode(awaited)) {\n            // ?? 难道不能都在observer回调里做吗\n            comment.replaceWith(awaited);\n            $mountFragmentAnchors(awaited);\n          } else {\n            const awaitedNode = assureNode(awaited);\n            comment.replaceWith(awaitedNode);\n            $mountFragmentAnchors(awaitedNode);\n          }\n        });\n      } else {\n        apdSingle(element, ci);\n      }\n    }\n  } else {\n    // & here is thened, so must be a simple elementj\n    apdSingle(element, c);\n  }\n}\n\nexport function applyContent(element: HTMLElement | SVGElement | MathMLElement, content: KTRawContent): void {\n  if ($isArray(content)) {\n    for (let i = 0; i < content.length; i++) {\n      apd(element, content[i]);\n    }\n  } else {\n    apd(element, content as KTAvailableContent);\n  }\n}\n","import type { InputElementTag } from '@ktjs/shared';\nimport type { KTRefLike } from '../reactable/ref.js';\n\nimport { static_cast } from 'type-narrow';\nimport { isRefLike } from '../reactable/common.js';\nimport { $addNodeCleanup } from '../jsx/anchor.js';\n\nexport function applyKModel(element: HTMLElementTagNameMap[InputElementTag], valueRef: KTRefLike<any>) {\n  if (!isRefLike(valueRef)) {\n    $throw('k-model value must be a KTRefLike.');\n  }\n\n  if (element.tagName === 'INPUT') {\n    static_cast<HTMLInputElement>(element);\n    if (element.type === 'radio' || element.type === 'checkbox') {\n      element.checked = Boolean(valueRef.value);\n      const onChange = () => (valueRef.value = element.checked);\n      const onValueChange = (newValue: boolean) => (element.checked = newValue);\n      element.addEventListener('change', onChange);\n      valueRef.addOnChange(onValueChange, onValueChange);\n      $addNodeCleanup(element, () => element.removeEventListener('change', onChange));\n      $addNodeCleanup(element, () => valueRef.removeOnChange(onValueChange));\n    } else {\n      element.value = valueRef.value ?? '';\n      const onInput = () => (valueRef.value = element.value);\n      const onValueChange = (newValue: string) => (element.value = newValue);\n      element.addEventListener('input', onInput);\n      valueRef.addOnChange(onValueChange, onValueChange);\n      $addNodeCleanup(element, () => element.removeEventListener('input', onInput));\n      $addNodeCleanup(element, () => valueRef.removeOnChange(onValueChange));\n    }\n    return;\n  }\n\n  if (element.tagName === 'SELECT' || element.tagName === 'TEXTAREA') {\n    element.value = valueRef.value ?? '';\n    const onChange = () => (valueRef.value = element.value);\n    const onValueChange = (newValue: string) => (element.value = newValue);\n    element.addEventListener('change', onChange);\n    valueRef.addOnChange(onValueChange, onValueChange);\n    $addNodeCleanup(element, () => element.removeEventListener('change', onChange));\n    $addNodeCleanup(element, () => valueRef.removeOnChange(onValueChange));\n    return;\n  }\n\n  $warn('not supported element for k-model:');\n}\n","import type { HTMLTag, MathMLTag, SVGTag } from '@ktjs/shared';\nimport type { KTRawAttr, KTRawContent, HTML } from '../types/h.js';\n\nimport { applyAttr } from './attr.js';\nimport { applyContent } from './content.js';\nimport { applyKModel } from './model.js';\n\n/**\n * Create an enhanced HTMLElement.\n * - Only supports HTMLElements, **NOT** SVGElements or other Elements.\n * @param tag tag of an `HTMLElement`\n * @param attr attribute object or className\n * @param content a string or an array of HTMLEnhancedElement as child nodes\n *\n * __PKG_INFO__\n */\nexport const h = <T extends HTMLTag | SVGTag | MathMLTag>(\n  tag: T,\n  attr?: KTRawAttr,\n  content?: KTRawContent,\n): HTML<T> => {\n  if (typeof tag !== 'string') {\n    $throw('tagName must be a string.');\n  }\n\n  // * start creating the element\n  const element = document.createElement(tag) as HTML<T>;\n  if (typeof attr === 'object' && attr !== null && 'k-model' in attr) {\n    applyKModel(element as any, attr['k-model'] as any);\n  }\n\n  // * Handle content\n  applyAttr(element, attr);\n  applyContent(element, content);\n\n  return element;\n};\n\nexport const svg = <T extends SVGTag>(tag: T, attr?: KTRawAttr, content?: KTRawContent): HTML<T> => {\n  if (typeof tag !== 'string') {\n    $throw('tagName must be a string.');\n  }\n\n  // * start creating the element\n  const element = document.createElementNS('http://www.w3.org/2000/svg', tag) as HTML<T>;\n\n  // * Handle content\n  applyAttr(element, attr);\n  applyContent(element, content);\n\n  if (typeof attr === 'object' && attr !== null && 'k-model' in attr) {\n    applyKModel(element as any, attr['k-model'] as any);\n  }\n\n  return element;\n};\n\nexport const mathml = <T extends MathMLTag>(tag: T, attr?: KTRawAttr, content?: KTRawContent): HTML<T> => {\n  if (typeof tag !== 'string') {\n    $throw('tagName must be a string.');\n  }\n\n  // * start creating the element\n  const element = document.createElementNS('http://www.w3.org/1998/Math/MathML', tag) as HTML<T>;\n\n  // * Handle content\n  applyAttr(element, attr);\n  applyContent(element, content);\n\n  if (typeof attr === 'object' && attr !== null && 'k-model' in attr) {\n    applyKModel(element as any, attr['k-model'] as any);\n  }\n\n  return element;\n};\n","// Use microqueue to schedule the flush of pending reactions\n\nimport type { KTRef } from './ref.js';\n\nconst reactiveToOldValue = new Map<KTRef<any>, any>();\n\nlet scheduled = false;\n\nexport const $markMutation = (reactive: KTRef<any>) => {\n  if (!reactiveToOldValue.has(reactive)) {\n    // @ts-expect-error accessing protected property\n    reactiveToOldValue.set(reactive, reactive._value);\n\n    // # schedule by microqueue\n    if (scheduled) {\n      return;\n    }\n\n    scheduled = true;\n    Promise.resolve().then(() => {\n      scheduled = false;\n      reactiveToOldValue.forEach((oldValue, reactive) => {\n        try {\n          // @ts-expect-error accessing protected property\n          reactive._changeHandlers.forEach((handler) => handler(reactive.value, oldValue));\n        } catch (error) {\n          $error('KTScheduler:', error);\n        }\n      });\n      reactiveToOldValue.clear();\n    });\n  }\n};\n","import { $emptyFn, $is } from '@ktjs/shared';\nimport { $createSubGetter, $createSubSetter, isRefLike } from './common.js';\nimport { KTReactive, KTReactiveType, KTSubReactive } from './reactive.js';\nimport { $markMutation } from './scheduler.js';\n\nexport class KTRef<T> extends KTReactive<T> {\n  readonly ktype = KTReactiveType.Ref;\n\n  constructor(_value: T) {\n    super(_value);\n  }\n\n  // ! Cannot be omitted, otherwise this will override `KTReactive` with only setter. And getter will return undefined.\n  get value() {\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    if ($is(newValue, this._value)) {\n      return;\n    }\n    const oldValue = this._value;\n    this._value = newValue;\n    this._emit(newValue, oldValue);\n  }\n\n  /**\n   * Used to mutate the value in-place.\n   * - internal value is changed instantly, but the change handlers will be called in the next microtask.\n   */\n  get draft() {\n    $markMutation(this);\n    return this._value;\n  }\n\n  notify(): this {\n    return this._emit(this._value, this._value);\n  }\n\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<\n    K0 extends keyof T,\n    K1 extends keyof T[K0],\n    K2 extends keyof T[K0][K1],\n    K3 extends keyof T[K0][K1][K2],\n    K4 extends keyof T[K0][K1][K2][K3],\n  >(key0: K0, key1: K1, key2: K2, key3: K3, key4: K4): KTSubRef<T[K0][K1][K2][K3][K4]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1], K3 extends keyof T[K0][K1][K2]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n    key3: K3,\n  ): KTSubRef<T[K0][K1][K2][K3]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n  ): KTSubRef<T[K0][K1][K2]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T, K1 extends keyof T[K0]>(key0: K0, key1: K1): KTSubRef<T[K0][K1]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T>(key0: K0): KTSubRef<T[K0]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref(...keys: Array<string | number>): KTSubRef<any> {\n    if (keys.length === 0) {\n      $throw('At least one key is required to get a sub-ref.');\n    }\n    return new KTSubRef(this, $createSubGetter(keys), $createSubSetter(keys));\n  }\n\n  dispose(): void {\n    this._changeHandlers.clear();\n  }\n}\n\n/**\n * Create a reactive reference to a value. The returned object has a single property `value` that holds the internal value.\n * @param value listened value\n */\nexport const ref = <T>(value?: T): KTRef<T> => new KTRef(value as any);\n\n/**\n * Assert `k-model` to be a ref-like object\n */\nexport const assertModel = <T = any>(props: any, defaultValue?: T): KTRefLike<T> => {\n  // & props is an object. Won't use it in any other place\n  if ('k-model' in props) {\n    const kmodel = props['k-model'];\n    if (isRefLike(kmodel)) {\n      return kmodel;\n    } else {\n      $throw(`k-model data must be a KTRef object, please use 'ref(...)' to wrap it.`);\n    }\n  }\n  return ref(defaultValue) as KTRef<T>;\n};\n\nconst $refSetter = <T>(props: { ref?: KTRef<T> }, node: T) => (props.ref!.value = node);\ntype RefSetter<T> = (props: { ref?: KTRef<T> }, node: T) => void;\n\nexport type KTRefLike<T> = KTRef<T> | KTSubRef<T>;\n\n/**\n * Whether `props.ref` is a `KTRef` only needs to be checked in the initial render\n */\nexport const $initRef = <T extends Node>(props: { ref?: KTRefLike<T> }, node: T): RefSetter<T> => {\n  if (!('ref' in props)) {\n    return $emptyFn;\n  }\n\n  const r = props.ref;\n  if (isRefLike(r)) {\n    r.value = node;\n    return $refSetter;\n  } else {\n    $throw('Fragment: ref must be a KTRef');\n  }\n};\n\n// # SubRef\n\nexport class KTSubRef<T> extends KTSubReactive<T> {\n  readonly ktype = KTReactiveType.SubRef;\n  declare readonly source: KTRef<any>;\n\n  /**\n   * @internal\n   */\n  protected readonly _setter: (s: object, newValue: T) => void;\n\n  constructor(\n    source: KTRef<any>,\n    getter: (sv: KTReactive<any>['value']) => T,\n    setter: (s: object, newValue: T) => void,\n  ) {\n    super(source, getter);\n    this._setter = setter;\n  }\n\n  get value() {\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    this._value = newValue;\n    // @ts-expect-error _value is private\n    this._setter(this.source._value, newValue);\n    this.source.notify();\n  }\n\n  /**\n   * Only use it for object's nested properties.\n   */\n  get draft() {\n    // Same implementation as `draft` in `KTRef`\n    $markMutation(this.source);\n    return this._value;\n  }\n}\n","import { $deepMatch, $is } from '@ktjs/shared';\nimport { KTReactive, KTReactiveLike, KTReactiveType, KTSubReactive, nextHandlerId } from './reactive.js';\nimport { $createSubGetter, isReactive, isSubReactive } from './common.js';\n\nexport class KTComputed<T> extends KTReactive<T> {\n  readonly ktype = KTReactiveType.Computed;\n\n  /**\n   * @internal\n   */\n  private readonly _calculator: () => T;\n  /**\n   * @internal\n   */\n  private readonly _dependencies: Array<KTReactiveLike<any>>;\n  /**\n   * @internal\n   */\n  private readonly _handler: () => void;\n  /**\n   * @internal\n   */\n  protected readonly _handlerKeys: string[];\n  private _disposed = false;\n\n  private _recalculate(forced: boolean = false): this {\n    const newValue = this._calculator();\n    const oldValue = this._value;\n    if (!$is(oldValue, newValue) || forced) {\n      this._value = newValue;\n      this._emit(newValue, oldValue);\n    }\n    return this;\n  }\n\n  constructor(calculator: () => T, dependencies: Array<KTReactiveLike<any>>) {\n    super(calculator());\n    this._calculator = calculator;\n    this._dependencies = dependencies;\n    this._handler = () => this._recalculate();\n    this._handlerKeys = dependencies.map(() => nextHandlerId(this.kid));\n\n    const uniqueSources = new Set<KTReactive<any>>();\n    for (let i = 0; i < dependencies.length; i++) {\n      const dep = dependencies[i];\n      if (isSubReactive(dep)) {\n        if (uniqueSources.has(dep.source)) {\n          continue;\n        } else {\n          uniqueSources.add(dep.source);\n        }\n      }\n      dep.addOnChange(this._handler, this._handlerKeys[i]);\n    }\n    uniqueSources.clear();\n  }\n\n  notify(): this {\n    return this._recalculate(true);\n  }\n\n  dispose(): void {\n    if (this._disposed) {\n      return;\n    }\n\n    this._disposed = true;\n    for (let i = 0; i < this._dependencies.length; i++) {\n      this._dependencies[i].removeOnChange(this._handlerKeys[i]);\n    }\n\n    this._dependencies.length = 0;\n    this._changeHandlers.clear();\n  }\n}\n\nKTReactive.prototype.map = function <U>(\n  this: KTReactive<unknown>,\n  c: (value: unknown) => U,\n  dep?: Array<KTReactive<any>>,\n) {\n  return new KTComputed(() => c(this.value), dep ? [this, ...dep] : [this]);\n};\n\nKTReactive.prototype.is = function (this: KTReactive<unknown>, o: unknown) {\n  if (isReactive(o)) {\n    return new KTSubComputed(this, (v) => $is(v, o.value), o);\n  } else {\n    return new KTSubComputed(this, (v) => $is(v, o));\n  }\n};\n\nKTReactive.prototype.match = function (this: KTReactive<object>, o: object) {\n  if (isReactive(o)) {\n    return new KTSubComputed(this, (v) => $deepMatch(v, o.value), o);\n  } else {\n    return new KTSubComputed(this, (v) => $deepMatch(v, o));\n  }\n};\n\nKTReactive.prototype.get = function <T>(this: KTReactive<T>, ...keys: Array<string | number>) {\n  if (keys.length === 0) {\n    $throw('At least one key is required to get a sub-computed.');\n  }\n  return new KTSubComputed(this, $createSubGetter(keys));\n};\n\n/**\n * Create a computed value that automatically updates when its dependencies change.\n * @param calculator synchronous function that calculates the value of the computed. It should not have side effects.\n * @param dependencies an array of reactive dependencies that the computed value depends on. The computed value will automatically update when any of these dependencies change.\n */\nexport const computed = <T>(calculator: () => T, dependencies: Array<KTReactiveLike<any>>): KTComputed<T> =>\n  new KTComputed(calculator, dependencies);\n\n// # SubComputed\n\nexport class KTSubComputed<T> extends KTSubReactive<T> {\n  readonly ktype = KTReactiveType.SubComputed;\n\n  /**\n   * Used for `reactive.is` and `reactive.match` to track the single dependency.\n   * @internal\n   */\n  private readonly _dependency?: KTReactive<any>;\n\n  constructor(source: KTReactive<any>, getter: (sv: KTReactive<any>['value']) => T, dependency?: KTReactive<any>) {\n    super(source, getter);\n    this._dependency = dependency;\n\n    if (dependency) {\n      this._handlerKeys.push(nextHandlerId(this.kid));\n      dependency.addOnChange(this._handler, this._handlerKeys[1]);\n    }\n  }\n\n  get value() {\n    return this._value;\n  }\n\n  dispose(): void {\n    this._handlerKeys.forEach((key) => this.source.removeOnChange(key));\n    this._dependency?.removeOnChange(this._handlerKeys[1]);\n  }\n}\n\nexport type KTComputedLike<T> = KTComputed<T> | KTSubComputed<T>;\n","import { $emptyFn } from '@ktjs/shared';\nimport type { KTReactiveLike } from './reactive.js';\nimport { isSubReactive } from './common.js';\n\ninterface KTEffectOptions {\n  lazy: boolean;\n  onCleanup: () => void;\n  debugName: string;\n}\n\n/**\n * Register a reactive effect with options.\n * @param effectFn The effect function to run when dependencies change\n * @param reactives The reactive dependencies\n * @param options Effect options: lazy, onCleanup, debugName\n * @returns stop function to remove all listeners\n */\nexport function effect(\n  effectFn: () => void,\n  reactives: Array<KTReactiveLike<any>>,\n  options?: Partial<KTEffectOptions>,\n) {\n  const { lazy = false, onCleanup = $emptyFn, debugName = '' } = Object(options);\n  const listenerKeys: Array<string | number> = [];\n\n  let active = true;\n\n  const run = () => {\n    if (!active) {\n      return;\n    }\n\n    // cleanup before rerun\n    onCleanup();\n\n    try {\n      effectFn();\n    } catch (err) {\n      $debug('effect error:', debugName, err);\n    }\n  };\n\n  // subscribe to dependencies\n  for (let i = 0; i < reactives.length; i++) {\n    listenerKeys[i] = i;\n    const r = reactives[i];\n    if (isSubReactive(r)) {\n      // @ts-expect-error _changeHandlers is protected\n      r.source._changeHandlers.set(listenerKeys[i], run);\n    } else {\n      r.addOnChange(run, effectFn);\n    }\n  }\n\n  // auto run unless lazy\n  if (!lazy) {\n    run();\n  }\n\n  // stop function\n  return () => {\n    if (!active) {\n      return;\n    }\n    active = false;\n\n    for (let i = 0; i < reactives.length; i++) {\n      reactives[i].removeOnChange(effectFn);\n    }\n\n    // final cleanup\n    onCleanup();\n  };\n}\n","import type { KTReactive, KTReactiveLike } from './reactive.js';\nimport { isKT } from './common.js';\nimport { ref } from './ref.js';\n\n/**\n * Ensure a value is reactive. If it's already `KTReactiveLike`, return it as is; otherwise, wrap it in a `ref`.\n */\nexport const toReactive = <T>(o: T | KTReactiveLike<T>): KTReactiveLike<T> =>\n  isKT(o) ? o : (ref(o as T) as KTReactive<T>);\n\n/**\n * Extracts the value from a KTReactive, or returns the value directly if it's not reactive.\n */\nexport const dereactive = <T>(value: T | KTReactiveLike<T>): T => (isKT<T>(value) ? value.value : value);\n\nexport type { KTRef, KTSubRef, KTRefLike } from './ref.js';\nexport { ref, assertModel } from './ref.js';\nexport type { KTComputed, KTSubComputed, KTComputedLike } from './computed.js';\nexport { computed } from './computed.js';\nexport { KTReactiveType } from './reactive.js';\nexport type * from './reactive.js';\n\nexport {\n  isKT,\n  isReactiveLike,\n  isRef,\n  isSubRef,\n  isRefLike,\n  isComputed,\n  isSubComputed,\n  isComputedLike,\n  isReactive,\n} from './common.js';\nexport { effect } from './effect.js';\nexport type * from './types.js';\n","import type { KTReactiveLike } from '../reactable/reactive.js';\nimport type { KTRawContent } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\nimport { $initRef, type KTRefLike } from '../reactable/ref.js';\n\nimport { $forEach, $isArray } from '@ktjs/shared';\nimport { isKT, toReactive } from '../reactable/index.js';\nimport { $addNodeCleanup, AnchorType, KTAnchor } from './anchor.js';\n\nexport class FragmentAnchor extends KTAnchor<Node> {\n  readonly type = AnchorType.Fragment;\n\n  constructor() {\n    super(AnchorType.Fragment);\n  }\n\n  /**\n   * Remove elements in the list\n   */\n  removeElements() {\n    const list = this.list.slice();\n    this.list.length = 0;\n    for (let i = 0; i < list.length; i++) {\n      const node = list[i] as ChildNode;\n      if (node.parentNode) {\n        node.remove();\n      }\n    }\n  }\n}\n\nexport interface FragmentProps<T extends Node = Node> {\n  /** Array of child elements, supports reactive arrays */\n  children: T[] | KTReactiveLike<T[]>;\n\n  /** element key function for optimization (future enhancement) */\n  key?: (element: T, index: number, array: T[]) => any;\n\n  /** ref to get the anchor node */\n  ref?: KTRefLike<JSX.Element>;\n}\n\n/**\n * Fragment - Container component for managing arrays of child elements\n *\n * Features:\n * 1. Returns a comment anchor node, child elements are inserted after the anchor\n * 2. Supports reactive arrays, automatically updates DOM when array changes\n * 3. Basic version uses simple replacement algorithm (remove all old elements, insert all new elements)\n * 4. Future enhancement: key-based optimization\n *\n * Usage example:\n * ```tsx\n * const children = ref([<div>A</div>, <div>B</div>]);\n * const fragment = <Fragment children={children} />;\n * document.body.appendChild(fragment);\n *\n * // Automatic update\n * children.value = [<div>C</div>, <div>D</div>];\n * ```\n */\nexport function Fragment<T extends Node = Node>(props: FragmentProps<T>): JSX.Element & FragmentAnchor {\n  const anchor = new FragmentAnchor();\n  const elements = anchor.list as T[];\n  const childrenRef = toReactive(props.children);\n\n  const redraw = () => {\n    const newElements = childrenRef.value;\n    const parent = anchor.parentNode;\n\n    if (!parent) {\n      elements.length = 0;\n      for (let i = 0; i < newElements.length; i++) {\n        elements.push(newElements[i]);\n      }\n      return;\n    }\n\n    anchor.removeElements();\n    elements.length = 0;\n\n    const fragment = document.createDocumentFragment();\n    for (let i = 0; i < newElements.length; i++) {\n      const element = newElements[i];\n      elements.push(element);\n      fragment.appendChild(element);\n    }\n\n    parent.insertBefore(fragment, anchor.nextSibling);\n  };\n\n  childrenRef.addOnChange(redraw, redraw);\n  $addNodeCleanup(anchor, () => childrenRef.removeOnChange(redraw));\n  anchor.mountCallback = redraw;\n  redraw();\n\n  $initRef(props as { ref?: KTRefLike<Node> }, anchor);\n\n  return anchor as unknown as JSX.Element & FragmentAnchor;\n}\n\n/**\n * Convert KTRawContent to HTMLElement array\n */\nexport function convertChildrenToElements(children: KTRawContent): Element[] {\n  const elements: Element[] = [];\n\n  const processChild = (child: any): void => {\n    if (child === undefined || child === null || child === false || child === true) {\n      // Ignore null, undefined, false, true\n      return;\n    }\n\n    if ($isArray(child)) {\n      // Recursively process array\n      $forEach(child, processChild);\n      return;\n    }\n\n    if (typeof child === 'string' || typeof child === 'number') {\n      const span = document.createElement('span');\n      span.textContent = String(child);\n      elements.push(span);\n      return;\n    }\n\n    if (child instanceof Element) {\n      elements.push(child);\n      return;\n    }\n\n    if (isKT(child)) {\n      processChild(child.value);\n      return;\n    }\n\n    $warn('Fragment: unsupported child type', child);\n    if (process.env.IS_DEV) {\n      throw new Error(`Fragment: unsupported child type`);\n    }\n  };\n\n  processChild(children);\n  return elements;\n}\n","import type { JSXTag } from '@ktjs/shared';\nimport type { KTAttribute } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\nimport { h } from '../h/index';\n\nexport const jsxh = (tag: JSXTag, props: KTAttribute): JSX.Element =>\n  (typeof tag === 'function' ? tag(props) : h(tag, props, props.children)) as JSX.Element;\n\nexport const placeholder = (data: string): JSX.Element => document.createComment(data) as unknown as JSX.Element;\n","import type { JSXTag, MathMLTag, SVGTag } from '@ktjs/shared';\nimport type { KTAttribute, KTRawContent } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\n\nimport { h, mathml as _mathml, svg as _svg } from '../h/index.js';\nimport { $initRef } from '../reactable/ref.js';\nimport { isComputedLike } from '../reactable/common.js';\n\nimport { convertChildrenToElements, Fragment as FragmentArray } from './fragment.js';\nimport { jsxh, placeholder } from './common.js';\n\nfunction create(\n  creator: (tag: any, props: KTAttribute, content?: KTRawContent) => JSX.Element,\n  tag: any,\n  props: KTAttribute,\n) {\n  if (props.ref && isComputedLike(props.ref)) {\n    $throw('Cannot assign a computed value to an element.');\n  }\n  const el = creator(tag, props, props.children);\n  $initRef(props, el);\n  return el;\n}\n\nexport const jsx = (tag: JSXTag, props: KTAttribute): JSX.Element => create(jsxh, tag, props);\nexport const svg = (tag: SVGTag, props: KTAttribute): JSX.Element => create(_svg, tag, props);\nexport const mathml = (tag: MathMLTag, props: KTAttribute): JSX.Element => create(_mathml, tag, props);\nexport { svg as svgRuntime, mathml as mathmlRuntime };\n\n/**\n * Fragment support - returns an array of children\n * Enhanced Fragment component that manages arrays of elements\n */\nexport function Fragment(props: { children?: KTRawContent }): JSX.Element {\n  const { children } = props ?? {};\n\n  if (!children) {\n    return placeholder('kt-fragment-empty');\n  }\n\n  const elements = convertChildrenToElements(children);\n\n  return FragmentArray({ children: elements });\n}\n\n/**\n * JSX Development runtime - same as jsx but with additional dev checks\n */\nexport const jsxDEV: typeof jsx = (...args) => {\n  // console.log('JSX DEV called:', ...args);\n  // console.log('children', (args[1] as any)?.children);\n  return jsx(...args);\n};\n\n/**\n * JSX runtime for React 17+ automatic runtime\n * This is called when using jsx: \"react-jsx\" or \"react-jsxdev\"\n */\nexport const jsxs = jsx;\n\n// Export h as the classic JSX factory for backward compatibility\nexport { h, h as createElement };\n","import { $isThenable } from '@ktjs/shared';\nimport type { KTComponent, KTRawContent } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\nimport type { KTRef } from '../reactable/ref.js';\nimport { $mountFragmentAnchors } from './anchor.js';\n\n/**\n * Extract component props type (excluding ref and children)\n */\ntype ExtractComponentProps<T> = T extends (props: infer P) => any ? Omit<P, 'ref' | 'children'> : {};\n\nexport function KTAsync<T extends KTComponent>(\n  props: {\n    ref?: KTRef<JSX.Element>;\n    skeleton?: JSX.Element;\n    component: T;\n    children?: KTRawContent;\n  } & ExtractComponentProps<T>,\n): JSX.Element {\n  const raw = props.component(props);\n  let comp: JSX.Element =\n    props.skeleton ?? (document.createComment('ktjs-suspense-placeholder') as unknown as JSX.Element);\n\n  if ($isThenable(raw)) {\n    raw.then((resolved) => {\n      comp.replaceWith(resolved);\n      $mountFragmentAnchors(resolved);\n    });\n  } else {\n    comp = raw as JSX.Element;\n  }\n\n  return comp;\n}\n","import type { JSX } from '../types/jsx.js';\nimport type { KTRefLike } from '../reactable/ref.js';\nimport type { KTReactiveLike } from '../reactable/reactive.js';\n\nimport { $identity } from '@ktjs/shared';\nimport { toReactive } from '../reactable/index.js';\nimport { $initRef } from '../reactable/ref.js';\nimport { $addNodeCleanup } from './anchor.js';\nimport { AnchorType, KTAnchor } from './anchor.js';\n\nexport class KTForAnchor extends KTAnchor<JSX.Element> {\n  readonly type = AnchorType.For;\n\n  constructor() {\n    super(AnchorType.For);\n  }\n}\n\nexport type KTForElement = JSX.Element & KTForAnchor;\n\nexport interface KTForProps<T> {\n  ref?: KTRefLike<KTForElement>;\n  list: T[] | KTReactiveLike<T[]>;\n  key?: (item: T, index: number, array: T[]) => any;\n  map?: (item: T, index: number, array: T[]) => JSX.Element;\n}\n\nconst setForNodeMap = (nodeMap: Map<any, JSX.Element>, key: any, node: JSX.Element, index: number) => {\n  if (nodeMap.has(key)) {\n    $error(`[KTFor] Duplicate key detected at index ${index}. Later items override earlier ones. key=${String(key)}`);\n  }\n  nodeMap.set(key, node);\n};\n\n// TASK 对于template标签的for和if，会编译为fragment，可特殊处理，让它们保持原样\n/**\n * KTFor - List rendering component with key-based optimization\n * Returns a Comment anchor node with rendered elements in anchor.list\n */\nexport function KTFor<T>(props: KTForProps<T>): KTForElement {\n  const redraw = () => {\n    const newList = listRef.value;\n    const parent = anchor.parentNode;\n\n    if (!parent) {\n      anchor.list.length = 0;\n      nodeMap.clear();\n      for (let index = 0; index < newList.length; index++) {\n        const item = newList[index];\n        const itemKey = currentKey(item, index, newList);\n        const node = currentMap(item, index, newList);\n        setForNodeMap(nodeMap, itemKey, node, index);\n        anchor.list.push(node);\n      }\n      return anchor;\n    }\n\n    const oldLength = anchor.list.length;\n    const newLength = newList.length;\n\n    if (newLength === 0) {\n      nodeMap.forEach((node) => node.remove());\n      nodeMap.clear();\n      anchor.list.length = 0;\n      return anchor;\n    }\n\n    if (oldLength === 0) {\n      anchor.list.length = 0;\n      const fragment = document.createDocumentFragment();\n      for (let i = 0; i < newLength; i++) {\n        const item = newList[i];\n        const itemKey = currentKey(item, i, newList);\n        const node = currentMap(item, i, newList);\n        setForNodeMap(nodeMap, itemKey, node, i);\n        anchor.list.push(node);\n        fragment.appendChild(node);\n      }\n      parent.insertBefore(fragment, anchor.nextSibling);\n      return anchor;\n    }\n\n    const newKeyToNewIndex = new Map<any, number>();\n    const newElements: JSX.Element[] = new Array(newLength);\n    for (let i = 0; i < newLength; i++) {\n      const item = newList[i];\n      const itemKey = currentKey(item, i, newList);\n      newKeyToNewIndex.set(itemKey, i);\n      newElements[i] = nodeMap.has(itemKey) ? nodeMap.get(itemKey)! : currentMap(item, i, newList);\n    }\n\n    const toRemove: JSX.Element[] = [];\n    nodeMap.forEach((node, key) => {\n      if (!newKeyToNewIndex.has(key)) {\n        toRemove.push(node);\n      }\n    });\n    for (let i = 0; i < toRemove.length; i++) {\n      toRemove[i].remove();\n    }\n\n    let currentNode = anchor.nextSibling;\n    for (let i = 0; i < newLength; i++) {\n      const node = newElements[i];\n      if (currentNode !== node) {\n        parent.insertBefore(node, currentNode);\n      } else {\n        currentNode = currentNode.nextSibling;\n      }\n    }\n\n    nodeMap.clear();\n    anchor.list.length = 0;\n    for (let i = 0; i < newLength; i++) {\n      const itemKey = currentKey(newList[i], i, newList);\n      const node = newElements[i];\n      setForNodeMap(nodeMap, itemKey, node, i);\n      anchor.list.push(node);\n    }\n    return anchor;\n  };\n\n  const currentKey: NonNullable<KTForProps<T>['key']> = props.key ?? ((item: T) => item);\n  const currentMap: NonNullable<KTForProps<T>['map']> =\n    props.map ?? ((item: T) => $identity(item) as unknown as JSX.Element);\n  const listRef = toReactive(props.list);\n  const anchor = new KTForAnchor() as KTForElement;\n  const nodeMap = new Map<any, JSX.Element>();\n\n  for (let index = 0; index < listRef.value.length; index++) {\n    const item = listRef.value[index];\n    const itemKey = currentKey(item, index, listRef.value);\n    const node = currentMap(item, index, listRef.value);\n    setForNodeMap(nodeMap, itemKey, node, index);\n    anchor.list.push(node);\n  }\n\n  listRef.addOnChange(redraw, redraw);\n  $addNodeCleanup(anchor, () => listRef.removeOnChange(redraw));\n  anchor.mountCallback = redraw;\n  $initRef(props, anchor);\n\n  return anchor;\n}\n","import type { JSXTag } from '@ktjs/shared';\nimport type { KTAttribute } from '../types/h.js';\nimport type { KTReactiveLike } from '../reactable/reactive.js';\n\nimport { isKT } from '../reactable/index.js';\nimport { $addNodeCleanup, $mountFragmentAnchors, $removeNodeCleanup } from './anchor.js';\nimport { jsxh, placeholder } from './common.js';\n\nexport function KTConditional(\n  condition: any | KTReactiveLike<any>,\n  tagIf: JSXTag,\n  propsIf: KTAttribute,\n  tagElse?: JSXTag,\n  propsElse?: KTAttribute,\n) {\n  if (!isKT(condition)) {\n    return condition ? jsxh(tagIf, propsIf) : tagElse ? jsxh(tagElse, propsElse!) : placeholder('kt-conditional');\n  }\n\n  if (tagElse) {\n    let current = condition.value ? jsxh(tagIf, propsIf) : jsxh(tagElse!, propsElse!);\n    const cleanup = () => condition.removeOnChange(onChange);\n    const onChange = (newValue: any) => {\n      const old = current;\n      current = newValue ? jsxh(tagIf, propsIf) : jsxh(tagElse!, propsElse!);\n      $removeNodeCleanup(old, cleanup);\n      $addNodeCleanup(current, cleanup);\n      old.replaceWith(current);\n      $mountFragmentAnchors(current);\n    };\n    condition.addOnChange(onChange, onChange);\n    $addNodeCleanup(current, cleanup);\n    return current;\n  } else {\n    const dummy = placeholder('kt-conditional') as HTMLElement;\n    let current = condition.value ? jsxh(tagIf, propsIf) : dummy;\n    const cleanup = () => condition.removeOnChange(onChange);\n    const onChange = (newValue: any) => {\n      const old = current;\n      current = newValue ? jsxh(tagIf, propsIf) : dummy;\n      $removeNodeCleanup(old, cleanup);\n      $addNodeCleanup(current, cleanup);\n      old.replaceWith(current);\n      $mountFragmentAnchors(current);\n    };\n    condition.addOnChange(onChange, onChange);\n    $addNodeCleanup(current, cleanup);\n    return current;\n  }\n}\n"],"names":["isKT","obj","kid","isReactiveLike","ktype","isRef","isSubRef","isRefLike","isComputed","isSubComputed","isComputedLike","isReactive","isSubReactive","$createSubGetter","path","length","s","r","i","handlerId","nextHandlerId","KTReactiveLike","nextKid","KTReactive","_value","_changeHandlers","Map","constructor","value","super","this","_newValue","console","warn","_emit","newValue","oldValue","forEach","handler","addOnChange","key","has","Error","$stringify","set","removeOnChange","delete","clearOnChange","clear","notify","map","calculator","dependencies","is","o","match","get","_keys","KTSubReactive","source","_getter","_handler","_handlerKeys","getter","push","dispose","KTAnchor","Comment","isKTAnchor","list","mountCallback","data","$ensureAnchorObserver","mount","parent","parentNode","appendChild","CANNOT_MOUNT","document","Node","CANNOT_OBSERVE","MutationObserver","COMMENT_FILTER","NodeFilter","SHOW_COMMENT","nodeToCleanups","WeakMap","anchorObserver","$cleanupRemovedNode","node","nodeType","children","Array","from","childNodes","anchor","slice","listNode","remove","$runNodeCleanups","body","records","disconnect","undefined","addedNodes","j","$mountFragmentAnchors","removedNodes","observe","childList","subtree","$mountIfFragmentAnchor","cleanups","error","$addNodeCleanup","cleanup","$removeNodeCleanup","index","indexOf","splice","nodeObj","walker","createTreeWalker","current","nextNode","booleanHandler","element","setAttribute","valueHandler","handlers","checked","selected","valueAsDate","valueAsNumber","defaultValue","defaultChecked","defaultSelected","disabled","readOnly","multiple","required","autofocus","open","controls","autoplay","loop","muted","defer","async","hidden","_key","defaultHandler","setElementStyle","style","cssText","addReactiveCleanup","reactive","applyAttr","attr","classValue","class","className","v","html","innerHTML","startsWith","eventName","addEventListener","removeEventListener","attrIsObject","assureNode","$isNode","createTextNode","apdSingle","c","onChange","newNode","oldNode","replaceWith","type","apd","$isThenable","then","$isArray","ci","comment","createComment","awaited","awaitedNode","applyContent","content","applyKModel","valueRef","tagName","onValueChange","Boolean","onInput","h","tag","createElement","svg","createElementNS","mathml","reactiveToOldValue","scheduled","$markMutation","Promise","resolve","KTRef","$is","draft","subref","keys","KTSubRef","$createSubSetter","ref","assertModel","props","kmodel","$refSetter","$initRef","$emptyFn","_setter","setter","KTComputed","_calculator","_dependencies","_disposed","_recalculate","forced","uniqueSources","Set","dep","add","prototype","KTSubComputed","$deepMatch","computed","_dependency","dependency","effect","effectFn","reactives","options","lazy","onCleanup","debugName","Object","listenerKeys","active","run","err","debug","toReactive","dereactive","FragmentAnchor","removeElements","jsxh","placeholder","create","creator","el","jsx","_svg","_mathml","Fragment","elements","processChild","child","$forEach","span","textContent","String","Element","convertChildrenToElements","childrenRef","redraw","newElements","fragment","createDocumentFragment","insertBefore","nextSibling","FragmentArray","jsxDEV","args","jsxs","KTAsync","raw","component","comp","skeleton","resolved","KTForAnchor","setForNodeMap","nodeMap","KTFor","newList","listRef","item","itemKey","currentKey","currentMap","oldLength","newLength","newKeyToNewIndex","toRemove","currentNode","$identity","KTConditional","condition","tagIf","propsIf","tagElse","propsElse","old","dummy"],"mappings":";;AAKM,SAAUA,KAAcC;IAC5B,OAA2B,mBAAbA,KAAKC;AACrB;;AAEM,SAAUC,eAAwBF;IACtC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAEM,SAAUC,MAAeJ;IAC7B,OAA0B,mBAAfA,KAAKG,SACE,MAATH,IAAIG;AAIf;;AAEM,SAAUE,SAAkBL;IAChC,OAA0B,mBAAfA,KAAKG,SACE,MAATH,IAAIG;AAIf;;AAEM,SAAUG,UAAmBN;IACjC,OAA0B,mBAAfA,KAAKG,gBACNH,IAAIG;AAIhB;;AAEM,SAAUI,WAAoBP;IAClC,OAA0B,mBAAfA,KAAKG,SACE,MAATH,IAAIG;AAIf;;AAEM,SAAUK,cAAuBR;IACrC,OAA0B,mBAAfA,KAAKG,SACE,OAATH,IAAIG;AAIf;;AAEM,SAAUM,eAAwBT;IACtC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAEM,SAAUO,WAAoBV;IAClC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAEM,SAAUQ,cAAuBX;IACrC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAUO,MAAMS,mBAAoBC;IAE/B,QAAQA,KAAKC;MAIX,KAAK;QACH,OAAQC,KAAMA,EAAEF,KAAK;;MACvB,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK;;MAChC,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK;;MACzC,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;;MAClD,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;;MAC3D;QACE,OAAQE;YACN,IAAIC,IAAID,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;YACnD,KAAK,IAAII,IAAI,GAAGA,IAAIJ,KAAKC,QAAQG,KAC/BD,IAAIA,EAAEH,KAAKI;YAEb,OAAOD;;;;;AC5Ff,IAAIf,MAAM,GACNiB,YAAY;;AAET,MACMC,gBAAiBlB,OAAgB,eAAeA,OAAOiB;;MAE9CE;IACXnB,IAJY,OAAMA,MAIZoB;;;AAYX,MAAgBC,mBAAsBF;IAIhCG;IAKSC,gBAAkB,IAAIC;IAEzC,WAAAC,CAAYC;QACVC,SACAC,KAAKN,SAASI;AAChB;IAEA,SAAIA;QACF,OAAOE,KAAKN;AACd;IAEA,SAAII,CAAMG;QACRC,QAAAC,KAAA,gBAAM;AACR;IAKU,KAAAC,CAAMC,UAAaC;QAE3B,OADAN,KAAKL,gBAAgBY,QAASC,WAAYA,QAAQH,UAAUC,YACrDN;AACT;IAEA,WAAAS,CAAYD,SAA2BE,MAAWpB,cAAcU,KAAK5B;QACnE,IAAI4B,KAAKL,gBAAgBgB,IAAID,MAC3B,MAAA,IAAAE,MAAA,6DAAsDC,WAAWH;QAGnE,OADAV,KAAKL,gBAAgBmB,IAAIJ,KAAKF,UACvBR;AACT;IAEA,cAAAe,CAAeL;QAEb,OADAV,KAAKL,gBAAgBqB,OAAON,MACrBV;AACT;IAEA,aAAAiB;QAEE,OADAjB,KAAKL,gBAAgBuB,SACdlB;AACT;IAEA,MAAAmB;QACE,OAAOnB,KAAKI,MAAMJ,KAAKN,QAAQM,KAAKN;AACtC;IAQA,GAAA0B,CAAOC,YAA6BC;QAClC,OAAO;AACT;IAOA,EAAAC,CAAGC;QACD,OAAO;AACT;IAOA,KAAAC,CAAMD;QACJ,OAAO;AACT;IAoDA,GAAAE,IAAOC;QAEL,OAAO;AACT;;;AAGI,MAAgBC,sBAAyBrC;IACpCsC;IAKCnC;IAKSoC;IAKAC;IAKAC;IAEnB,WAAAnC,CAAYgC,QAAyBI;QACnClC,SACAC,KAAK6B,SAASA,QACd7B,KAAK8B,UAAUG,QACfjC,KAAKgC,eAAe,IAGpBhC,KAAKN,SAASM,KAAK8B,QAAQD,OAAOnC;QAElCM,KAAK+B,WAAW,MAAO/B,KAAKN,SAASuC,OAAOJ,OAAOnC,SAEnDM,KAAKgC,aAAaE,KAAK5C,cAAcU,KAAK5B;QAC1CyD,OAAOpB,YAAYT,KAAK+B,UAAU/B,KAAKgC,aAAa;AACtD;IAEA,WAAAvB,CAAYD,SAA2BE,MAAWpB,cAAcU,KAAK5B;QAGnE,OAFA4B,KAAKgC,aAAaE,KAAKxB,MACvBV,KAAK6B,OAAOpB,YAAY,CAACJ,UAAUC,aAAaE,QAAQR,KAAK8B,QAAQzB,WAAWL,KAAK8B,QAAQxB,YAAYI;QAClGV;AACT;IAEA,cAAAe,CAAeL;QAEb,OADAV,KAAK6B,OAAOd,eAAeL,MACpBV;AACT;IAEA,OAAAmC;QACEnC,KAAKgC,aAAazB,QAASG,OAAQV,KAAK6B,OAAOd,eAAeL;AAChE;;;AC9NI,MAAgB0B,iBAAwCC;IACnDC,YAAmB;IACnBC,KAAY;IAErBC;IAEA,WAAA3C,CAAY4C;QACV1C,MAAM0C,OACNC;AACF;IAEA,KAAAC,CAAMC;QACAA,UAAU5C,KAAK6C,eAAeD,UAChCA,OAAOE,YAAY9C,OAEjBA,KAAK6C,cACP7C,KAAKwC;AAET;;;AASF,MAAMO,eAAmC,sBAAbC,YAA4C,sBAATC,MACzDC,iBAAiBH,gBAA4C,sBAArBI,kBACxCC,iBAAuC,sBAAfC,aAA6B,MAAOA,WAAWC,cAGvEC,iBAAiB,IAAIC;;AAC3B,IAAIC;;AAEJ,MAAMC,sBAAuBC;IAC3B,IANmB,MAMfA,KAAKC,YALoB,OAKSD,KAAKC,UAAqC;QAC9E,MAAMC,WAAWC,MAAMC,KAAKJ,KAAKK;QACjC,KAAK,IAAI5E,IAAI,GAAGA,IAAIyE,SAAS5E,QAAQG,KACnCsE,oBAAoBG,SAASzE;AAEjC;IAEA,MAAM6E,SAASN;IACf,KAA0B,MAAtBM,OAAO3B,YAAqB;QAC9B,MAAMC,OAAO0B,OAAO1B,KAAK2B;QACzBD,OAAO1B,KAAKtD,SAAS;QACrB,KAAK,IAAIG,IAAI,GAAGA,IAAImD,KAAKtD,QAAQG,KAAK;YACpC,MAAM+E,WAAW5B,KAAKnD;YAClB+E,SAAStB,cACXsB,SAASC,UAEXV,oBAAoBS;AACtB;AACF;IAEAE,iBAAiBV;GAGbjB,wBAAwB;IACxBQ,kBAAkBO,mBAAmBT,SAASsB,SAIlDb,iBAAiB,IAAIN,iBAAkBoB;QACrC,IAAwB,sBAAbvB,UAGT,OAFAS,gBAAgBe,oBAChBf,sBAAiBgB;QAInB,KAAK,IAAIrF,IAAI,GAAGA,IAAImF,QAAQtF,QAAQG,KAAK;YACvC,MAAMsF,aAAaH,QAAQnF,GAAGsF;YAC9B,KAAK,IAAIC,IAAI,GAAGA,IAAID,WAAWzF,QAAQ0F,KACrCC,sBAAsBF,WAAWC;YAGnC,MAAME,eAAeN,QAAQnF,GAAGyF;YAChC,KAAK,IAAIF,IAAI,GAAGA,IAAIE,aAAa5F,QAAQ0F,KACvCjB,oBAAoBmB,aAAaF;AAErC;QAEFlB,eAAeqB,QAAQ9B,SAASsB,MAAM;QAAES,YAAW;QAAMC,UAAS;;GAG9DC,yBAA0BtB;IAC9B,MAAMM,SAASN;KACW,MAAtBM,OAAO3B,cAA+C,qBAAjB2B,OAAOtB,SAC9CsB,OAAOtB;GAIL0B,mBAAoBV;IACxB,MAAMuB,WAAW3B,eAAe7B,IAAIiC;IACpC,IAAKuB,UAAL;QAIA3B,eAAevC,OAAO2C;QACtB,KAAK,IAAIvE,IAAI8F,SAASjG,SAAS,GAAGG,KAAK,GAAGA,KACxC;YACE8F,SAAS9F;AACX,UAAE,OAAO+F;YACPjF,QAAAiF,MAAA,iBAAO,kBAAkBA;AAC3B;AARF;GAYWC,kBAAkB,CAACzB,MAAY0B;IAC1C3C;IACA,MAAMwC,WAAW3B,eAAe7B,IAAIiC;IAMpC,OALIuB,WACFA,SAAShD,KAAKmD,WAEd9B,eAAezC,IAAI6C,MAAM,EAAC0B;IAErBA;GAGIC,qBAAqB,CAAC3B,MAAY0B;IAC7C,MAAMH,WAAW3B,eAAe7B,IAAIiC;IACpC,KAAKuB,UACH;IAGF,MAAMK,QAAQL,SAASM,QAAQH;KACjB,MAAVE,UAIJL,SAASO,OAAOF,OAAO,IACC,MAApBL,SAASjG,UACXsE,eAAevC,OAAO2C;GAIbiB,wBAAyBjB;IACpC,IAAIZ,gBAAoC,sBAAbC,aAA6BW,QAA0C,mBAA1BA,KAAaC,UACnF;IAGF,MAAM8B,UAAU/B;IAGhB,IAFAsB,uBAAuBS,UAjHJ,MAmHfA,QAAQ9B,YAlHiB,OAkHY8B,QAAQ9B,UAC/C;IAGF,MAAM+B,SAAS3C,SAAS4C,iBAAiBF,SAAStC;IAClD,IAAIyC,UAAUF,OAAOG;IACrB,MAAOD,WACLZ,uBAAuBY,UACvBA,UAAUF,OAAOG;GC9JfC,iBAAiB,CAACC,SAAmDtF,KAAaZ;IAClFY,OAAOsF,UACRA,QAAgBtF,SAASZ,QAE1BkG,QAAQC,aAAavF,KAAKZ;GAIxBoG,eAAe,CAACF,SAAmDtF,KAAaZ;IAChFY,OAAOsF,UACRA,QAAgBtF,OAAOZ,QAExBkG,QAAQC,aAAavF,KAAKZ;GAKjBqG,WAGT;IACFC,SAASL;IACTM,UAAUN;IACVjG,OAAOoG;IACPI,aAAaJ;IACbK,eAAeL;IACfM,cAAcN;IACdO,gBAAgBV;IAChBW,iBAAiBX;IACjBY,UAAUZ;IACVa,UAAUb;IACVc,UAAUd;IACVe,UAAUf;IACVgB,WAAWhB;IACXiB,MAAMjB;IACNkB,UAAUlB;IACVmB,UAAUnB;IACVoB,MAAMpB;IACNqB,OAAOrB;IACPsB,OAAOtB;IACPuB,OAAOvB;IACPwB,QAAQ,CAACvB,SAASwB,MAAM1H,UAAYkG,QAAwBuB,WAAWzH;GClCnE2H,iBAAiB,CAACzB,SAAmDtF,KAAaZ,UACtFkG,QAAQC,aAAavF,KAAKZ,QAEtB4H,kBAAkB,CACtB1B,SACA2B;IAEA,IAAqB,mBAAVA,OAKX,KAAK,MAAMjH,OAAOiH,OACf3B,QAAgB2B,MAAMjH,OAAciH,MAAMjH,WAL1CsF,QAAwB2B,MAAMC,UAAUD;GASvCE,qBAAqB,CACzB7B,SACA8B,UAIAtH;IAEAsH,SAASrH,YAAYD,SAASA,UAC9B4E,gBAAgBY,SAAS,MAAM8B,SAAS/G,eAAeP;;;AAsFnD,SAAUuH,UAAU/B,SAAmDgC;IAC3E,IAAKA,MAAL;QAGA,IAAoB,mBAATA,QAA8B,SAATA,MAG9B,MAAA,IAAApH,MAAA;SA1FJ,SAAsBoF,SAAmDgC;YACvE,MAAMC,aAAaD,KAAKE,SAASF,KAAKG;iBACnB1D,MAAfwD,eACE/J,KAAa+J,eACfjC,QAAQC,aAAa,SAASgC,WAAWnI;YACzC+H,mBAAmB7B,SAASiC,YAAaG,KAAMpC,QAAQC,aAAa,SAASmC,OAE7EpC,QAAQC,aAAa,SAASgC;YAIlC,MAAMN,QAAQK,KAAKL;YAenB,IAdIA,UACmB,mBAAVA,QACT3B,QAAQC,aAAa,SAAS0B,SACJ,mBAAVA,UACZzJ,KAAKyJ,UACPD,gBAAgB1B,SAAS2B,MAAM7H;YAC/B+H,mBAAmB7B,SAAS2B,OAAQS,KAA6CV,gBAAgB1B,SAASoC,OAE1GV,gBAAgB1B,SAAS2B;YAM3B,YAAYK,MAAM;gBACpB,MAAMK,OAAOL,KAAK;gBAElB,IAAI9J,KAAKmK,OAAO;oBACdrC,QAAQsC,YAAYD,KAAKvI;oBACzB,MAAMY,MAAMpB,cAAc+I,KAAKjK;oBAC/BiK,KAAK5H,YAAa2H,KAAOpC,QAAQsC,YAAYF,GAAI1H,MACjD0E,gBAAgBY,SAAS,MAAMqC,KAAKtH,eAAeL;AACrD,uBACEsF,QAAQsC,YAAYD;AAExB;YAEA,KAAK,MAAM3H,OAAOsH,MAAM;gBAEtB,IAGU,cAARtH,OACQ,YAARA,OACQ,YAARA,OACQ,UAARA,OACQ,YAARA,OACQ,gBAARA,OACQ,YAARA,OACQ,eAARA,OACQ,aAARA,KAEA;gBAGF,MAAMc,IAAIwG,KAAKtH;gBAGf,IAAIA,IAAI6H,WAAW,QAAQ;oBACzB,IAAI/G,GAAG;wBACL,MAAMgH,YAAY9H,IAAIwD,MAAM;wBAC5B8B,QAAQyC,iBAAiBD,WAAWhH,IACpC4D,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoBF,WAAWhH;AACxE;oBACA;AACF;gBAMA,MAAMhB,UAAU2F,SAASzF,QAAQ+G;gBAC7BvJ,KAAKsD,MACPhB,QAAQwF,SAAStF,KAAKc,EAAE1B,QACxB+H,mBAAmB7B,SAASxE,GAAI4G,KAAM5H,QAAQwF,SAAStF,KAAK0H,OAE5D5H,QAAQwF,SAAStF,KAAKc;AAE1B;AACF,SAOImH,CAAa3C,SAASgC;AAFxB;AAMF;;AC1HA,MAAMY,aAAcpH,KAAYqH,QAAQrH,KAAKA,IAAIwB,SAAS8F,eAAetH;;AAEzE,SAASuH,UAAU/C,SAAsEgD;IAEvF,IAAIA,cAAuC,MAANA,GAIrC,IAAI9K,KAAK8K,IAAI;QACX,IAAIrF,OAAOiF,WAAWI,EAAElJ;QACxBkG,QAAQlD,YAAYa;QACpB,MAAMsF,WAAY5I;YAChB,MAAM6I,UAAUN,WAAWvI,WACrB8I,UAAUxF;YAChBA,OAAOuF,SACPC,QAAQC,YAAYF,UACpBtE,sBAAsBsE;;QAExBF,EAAEvI,YAAYwI,UAAUA,WACxB7D,gBAAgBY,SAAS,MAAMgD,EAAEjI,eAAekI;AAClD,WAAO;QACL,MAAMtF,OAAOiF,WAAWI;QACxBhD,QAAQlD,YAAYa;QACpB,MAAMM,SAASN;QACA,aAAXM,OAAOoF,QACTC,IAAItD,SAAS/B,OAAO1B;AAExB;AACF;;AAEA,SAAS+G,IAAItD,SAAsEgD;IACjF,IAAIO,YAAYP,IACdA,EAAEQ,KAAMrK,KAAMmK,IAAItD,SAAS7G,UACtB,IAAIsK,SAAST,IAClB,KAAK,IAAI5J,IAAI,GAAGA,IAAI4J,EAAE/J,QAAQG,KAAK;QAEjC,MAAMsK,KAAKV,EAAE5J;QACb,IAAImK,YAAYG,KAAK;YACnB,MAAMC,UAAU3G,SAAS4G,cAAc;YACvC5D,QAAQlD,YAAY6G,UACpBD,GAAGF,KAAMK;gBACP,IAAIhB,QAAQgB,UAEVF,QAAQP,YAAYS,UACpBjF,sBAAsBiF,eACjB;oBACL,MAAMC,cAAclB,WAAWiB;oBAC/BF,QAAQP,YAAYU,cACpBlF,sBAAsBkF;AACxB;;AAEJ,eACEf,UAAU/C,SAAS0D;AAEvB,WAGAX,UAAU/C,SAASgD;AAEvB;;AAEM,SAAUe,aAAa/D,SAAmDgE;IAC9E,IAAIP,SAASO,UACX,KAAK,IAAI5K,IAAI,GAAGA,IAAI4K,QAAQ/K,QAAQG,KAClCkK,IAAItD,SAASgE,QAAQ5K,UAGvBkK,IAAItD,SAASgE;AAEjB;;ACpEM,SAAUC,YAAYjE,SAAiDkE;IAC3E,KAAKzL,UAAUyL,WACb,MAAA,IAAAtJ,MAAA;IAGF,IAAwB,YAApBoF,QAAQmE,SAAZ;QAsBA,IAAwB,aAApBnE,QAAQmE,WAA4C,eAApBnE,QAAQmE,SAAwB;YAClEnE,QAAQlG,QAAQoK,SAASpK,SAAS;YAClC,MAAMmJ,WAAW,MAAOiB,SAASpK,QAAQkG,QAAQlG,OAC3CsK,gBAAiB/J,YAAsB2F,QAAQlG,QAAQO;YAK7D,OAJA2F,QAAQyC,iBAAiB,UAAUQ,WACnCiB,SAASzJ,YAAY2J,eAAeA;YACpChF,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoB,UAAUO;iBACrE7D,gBAAgBY,SAAS,MAAMkE,SAASnJ,eAAeqJ;AAEzD;QAEAlK,6BAAM;AAbN,WAlBE,IAAqB,YAAjB8F,QAAQqD,QAAqC,eAAjBrD,QAAQqD,MAAqB;QAC3DrD,QAAQI,UAAUiE,QAAQH,SAASpK;QACnC,MAAMmJ,WAAW,MAAOiB,SAASpK,QAAQkG,QAAQI,SAC3CgE,gBAAiB/J,YAAuB2F,QAAQI,UAAU/F;QAChE2F,QAAQyC,iBAAiB,UAAUQ,WACnCiB,SAASzJ,YAAY2J,eAAeA;QACpChF,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoB,UAAUO;QACrE7D,gBAAgBY,SAAS,MAAMkE,SAASnJ,eAAeqJ;AACzD,WAAO;QACLpE,QAAQlG,QAAQoK,SAASpK,SAAS;QAClC,MAAMwK,UAAU,MAAOJ,SAASpK,QAAQkG,QAAQlG,OAC1CsK,gBAAiB/J,YAAsB2F,QAAQlG,QAAQO;QAC7D2F,QAAQyC,iBAAiB,SAAS6B,UAClCJ,SAASzJ,YAAY2J,eAAeA;QACpChF,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoB,SAAS4B,WACpElF,gBAAgBY,SAAS,MAAMkE,SAASnJ,eAAeqJ;AACzD;AAgBJ;;;;;;;;;;;;;;;;;;GC9BO,OAAMG,IAAI,CACfC,KACAxC,MACAgC;IAEA,IAAmB,mBAARQ,KACT,MAAA,IAAA5J,MAAA;IAIF,MAAMoF,UAAUhD,SAASyH,cAAcD;IASvC,OARoB,mBAATxC,QAA8B,SAATA,QAAiB,aAAaA,QAC5DiC,YAAYjE,SAAgBgC,KAAK;IAInCD,UAAU/B,SAASgC,OACnB+B,aAAa/D,SAASgE,UAEfhE;GAGI0E,QAAM,CAAmBF,KAAQxC,MAAkBgC;IAC9D,IAAmB,mBAARQ,KACT,MAAA,IAAA5J,MAAA;IAIF,MAAMoF,UAAUhD,SAAS2H,gBAAgB,8BAA8BH;IAUvE,OAPAzC,UAAU/B,SAASgC,OACnB+B,aAAa/D,SAASgE,UAEF,mBAAThC,QAA8B,SAATA,QAAiB,aAAaA,QAC5DiC,YAAYjE,SAAgBgC,KAAK;IAG5BhC;GAGI4E,WAAS,CAAsBJ,KAAQxC,MAAkBgC;IACpE,IAAmB,mBAARQ,KACT,MAAA,IAAA5J,MAAA;IAIF,MAAMoF,UAAUhD,SAAS2H,gBAAgB,sCAAsCH;IAU/E,OAPAzC,UAAU/B,SAASgC,OACnB+B,aAAa/D,SAASgE,UAEF,mBAAThC,QAA8B,SAATA,QAAiB,aAAaA,QAC5DiC,YAAYjE,SAAgBgC,KAAK;IAG5BhC;GCrEH6E,qBAAqB,IAAIjL;;AAE/B,IAAIkL,aAAY;;AAET,MAAMC,gBAAiBjD;IAC5B,KAAK+C,mBAAmBlK,IAAImH,WAAW;QAKrC,IAHA+C,mBAAmB/J,IAAIgH,UAAUA,SAASpI,SAGtCoL,WACF;QAGFA,aAAY,GACZE,QAAQC,UAAUzB,KAAK;YACrBsB,aAAY,GACZD,mBAAmBtK,QAAQ,CAACD,UAAUwH;gBACpC;oBAEEA,SAASnI,gBAAgBY,QAASC,WAAYA,QAAQsH,SAAShI,OAAOQ;AACxE,kBAAE,OAAO6E;oBACPjF,QAAAiF,MAAA,iBAAO,gBAAgBA;AACzB;gBAEF0F,mBAAmB3J;;AAEvB;;;AC1BI,MAAOgK,cAAiBzL;IACnBnB,MAAK;IAEd,WAAAuB,CAAYH;QACVK,MAAML;AACR;IAGA,SAAII;QACF,OAAOE,KAAKN;AACd;IAEA,SAAII,CAAMO;QACR,IAAI8K,IAAI9K,UAAUL,KAAKN,SACrB;QAEF,MAAMY,WAAWN,KAAKN;QACtBM,KAAKN,SAASW,UACdL,KAAKI,MAAMC,UAAUC;AACvB;IAMA,SAAI8K;QAEF,OADAL,cAAc/K,OACPA,KAAKN;AACd;IAEA,MAAAyB;QACE,OAAOnB,KAAKI,MAAMJ,KAAKN,QAAQM,KAAKN;AACtC;IAoDA,MAAA2L,IAAUC;QACR,IAAoB,MAAhBA,KAAKrM,QACP,MAAA,IAAA2B,MAAA;QAEF,OAAO,IAAI2K,SAASvL,MAAMjB,iBAAiBuM,OT0Bf,CAACtM;YAC/B,QAAQA,KAAKC;cACX,KAAK;gBACH,OAAO,CAACC,GAAGmB,aAAcnB,EAAEF,KAAK,MAAMqB;;cACxC,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,MAAMqB;;cACjD,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,MAAMqB;;cAC1D,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,MAAMqB;;cACnE,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,MAAMqB;;cAC5E;gBACE,OAAO,CAACnB,GAAGmB;oBACT,IAAIlB,IAAID,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;oBACnD,KAAK,IAAII,IAAI,GAAGA,IAAIJ,KAAKC,SAAS,GAAGG,KACnCD,IAAIA,EAAEH,KAAKI;oBAEbD,EAAEH,KAAKA,KAAKC,SAAS,MAAMoB;;;US5CmBmL,CAAiBF;AACrE;IAEA,OAAAnJ;QACEnC,KAAKL,gBAAgBuB;AACvB;;;AAOK,MAAMuK,MAAU3L,SAAwB,IAAIoL,MAAMpL,QAK5C4L,cAAc,CAAUC,OAAYnF;IAE/C,IAAI,aAAamF,OAAO;QACtB,MAAMC,SAASD,MAAM;QACrB,IAAIlN,UAAUmN,SACZ,OAAOA;QAEP,MAAA,IAAAhL,MAAA;AAEJ;IACA,OAAO6K,IAAIjF;GAGPqF,aAAa,CAAIF,OAA2BhI,SAAagI,MAAMF,IAAK3L,QAAQ6D,MAQrEmI,WAAW,CAAiBH,OAA+BhI;IACtE,MAAM,SAASgI,QACb,OAAOI;IAGT,MAAM5M,IAAIwM,MAAMF;IAChB,IAAIhN,UAAUU,IAEZ,OADAA,EAAEW,QAAQ6D,MACHkI;IAEP,MAAA,IAAAjL,MAAA;;;AAME,MAAO2K,iBAAoB3J;IACtBtD,MAAK;IAMK0N;IAEnB,WAAAnM,CACEgC,QACAI,QACAgK;QAEAlM,MAAM8B,QAAQI,SACdjC,KAAKgM,UAAUC;AACjB;IAEA,SAAInM;QACF,OAAOE,KAAKN;AACd;IAEA,SAAII,CAAMO;QACRL,KAAKN,SAASW,UAEdL,KAAKgM,QAAQhM,KAAK6B,OAAOnC,QAAQW,WACjCL,KAAK6B,OAAOV;AACd;IAKA,SAAIiK;QAGF,OADAL,cAAc/K,KAAK6B,SACZ7B,KAAKN;AACd;;;ACnLI,MAAOwM,mBAAsBzM;IACxBnB,MAAK;IAKG6N;IAIAC;IAIArK;IAIEC;IACXqK,WAAY;IAEZ,YAAAC,CAAaC,UAAkB;QACrC,MAAMlM,WAAWL,KAAKmM,eAChB7L,WAAWN,KAAKN;QAKtB,OAJKyL,IAAI7K,UAAUD,cAAakM,WAC9BvM,KAAKN,SAASW,UACdL,KAAKI,MAAMC,UAAUC;QAEhBN;AACT;IAEA,WAAAH,CAAYwB,YAAqBC;QAC/BvB,MAAMsB,eACNrB,KAAKmM,cAAc9K,YACnBrB,KAAKoM,gBAAgB9K;QACrBtB,KAAK+B,WAAW,MAAM/B,KAAKsM,gBAC3BtM,KAAKgC,eAAeV,aAAaF,IAAI,MAAM9B,cAAcU,KAAK5B;QAE9D,MAAMoO,gBAAgB,IAAIC;QAC1B,KAAK,IAAIrN,IAAI,GAAGA,IAAIkC,aAAarC,QAAQG,KAAK;YAC5C,MAAMsN,MAAMpL,aAAalC;YACzB,IAAIN,cAAc4N,MAAM;gBACtB,IAAIF,cAAc7L,IAAI+L,IAAI7K,SACxB;gBAEA2K,cAAcG,IAAID,IAAI7K;AAE1B;YACA6K,IAAIjM,YAAYT,KAAK+B,UAAU/B,KAAKgC,aAAa5C;AACnD;QACAoN,cAActL;AAChB;IAEA,MAAAC;QACE,OAAOnB,KAAKsM,cAAa;AAC3B;IAEA,OAAAnK;QACE,KAAInC,KAAKqM,WAAT;YAIArM,KAAKqM,aAAY;YACjB,KAAK,IAAIjN,IAAI,GAAGA,IAAIY,KAAKoM,cAAcnN,QAAQG,KAC7CY,KAAKoM,cAAchN,GAAG2B,eAAef,KAAKgC,aAAa5C;YAGzDY,KAAKoM,cAAcnN,SAAS,GAC5Be,KAAKL,gBAAgBuB;AARrB;AASF;;;AAGFzB,WAAWmN,UAAUxL,MAAM,SAEzB4H,GACA0D;IAEA,OAAO,IAAIR,WAAW,MAAMlD,EAAEhJ,KAAKF,QAAQ4M,MAAM,EAAC1M,SAAS0M,QAAO,EAAC1M;AACrE,GAEAP,WAAWmN,UAAUrL,KAAK,SAAqCC;IAC7D,OAAI3C,WAAW2C,KACN,IAAIqL,cAAc7M,MAAOoI,KAAM+C,IAAI/C,GAAG5G,EAAE1B,QAAQ0B,KAEhD,IAAIqL,cAAc7M,MAAOoI,KAAM+C,IAAI/C,GAAG5G;AAEjD,GAEA/B,WAAWmN,UAAUnL,QAAQ,SAAoCD;IAC/D,OAAI3C,WAAW2C,KACN,IAAIqL,cAAc7M,MAAOoI,KAAM0E,WAAW1E,GAAG5G,EAAE1B,QAAQ0B,KAEvD,IAAIqL,cAAc7M,MAAOoI,KAAM0E,WAAW1E,GAAG5G;AAExD,GAEA/B,WAAWmN,UAAUlL,MAAM,YAAqC4J;IAC9D,IAAoB,MAAhBA,KAAKrM,QACP,MAAA,IAAA2B,MAAA;IAEF,OAAO,IAAIiM,cAAc7M,MAAMjB,iBAAiBuM;AAClD;;AAOO,MAAMyB,WAAW,CAAI1L,YAAqBC,iBAC/C,IAAI4K,WAAW7K,YAAYC;;AAIvB,MAAOuL,sBAAyBjL;IAC3BtD,MAAK;IAMG0O;IAEjB,WAAAnN,CAAYgC,QAAyBI,QAA6CgL;QAChFlN,MAAM8B,QAAQI,SACdjC,KAAKgN,cAAcC,YAEfA,eACFjN,KAAKgC,aAAaE,KAAK5C,cAAcU,KAAK5B;QAC1C6O,WAAWxM,YAAYT,KAAK+B,UAAU/B,KAAKgC,aAAa;AAE5D;IAEA,SAAIlC;QACF,OAAOE,KAAKN;AACd;IAEA,OAAAyC;QACEnC,KAAKgC,aAAazB,QAASG,OAAQV,KAAK6B,OAAOd,eAAeL,OAC9DV,KAAKgN,aAAajM,eAAef,KAAKgC,aAAa;AACrD;;;SC9HckL,OACdC,UACAC,WACAC;IAEA,OAAMC,MAAEA,QAAO,GAAKC,WAAEA,YAAYxB,UAAQyB,WAAEA,YAAY,MAAOC,OAAOJ,UAChEK,eAAuC;IAE7C,IAAIC,UAAS;IAEb,MAAMC,MAAM;QACV,IAAKD,QAAL;YAKAJ;YAEA;gBACEJ;AACF,cAAE,OAAOU;gBACP3N,QAAA4N,MAAA,iBAAO,iBAAiBN,WAAWK;AACrC;AATA;;IAaF,KAAK,IAAIzO,IAAI,GAAGA,IAAIgO,UAAUnO,QAAQG,KAAK;QACzCsO,aAAatO,KAAKA;QAClB,MAAMD,IAAIiO,UAAUhO;QAChBN,cAAcK,KAEhBA,EAAE0C,OAAOlC,gBAAgBmB,IAAI4M,aAAatO,IAAIwO,OAE9CzO,EAAEsB,YAAYmN,KAAKT;AAEvB;IAQA,OALKG,QACHM,OAIK;QACL,IAAKD,QAAL;YAGAA,UAAS;YAET,KAAK,IAAIvO,IAAI,GAAGA,IAAIgO,UAAUnO,QAAQG,KACpCgO,UAAUhO,GAAG2B,eAAeoM;YAI9BI;AARA;;AAUJ;;AClEO,MAAMQ,aAAiBvM,KAC5BtD,KAAKsD,KAAKA,IAAKiK,IAAIjK,IAKRwM,aAAiBlO,SAAqC5B,KAAQ4B,SAASA,MAAMA,QAAQA;;ACJ5F,MAAOmO,uBAAuB7L;IACzBiH,KAAI;IAEb,WAAAxJ;QACEE;AACF;IAKA,cAAAmO;QACE,MAAM3L,OAAOvC,KAAKuC,KAAK2B;QACvBlE,KAAKuC,KAAKtD,SAAS;QACnB,KAAK,IAAIG,IAAI,GAAGA,IAAImD,KAAKtD,QAAQG,KAAK;YACpC,MAAMuE,OAAOpB,KAAKnD;YACduE,KAAKd,cACPc,KAAKS;AAET;AACF;;;ACvBK,MAAM+J,OAAO,CAAC3D,KAAamB,UAChB,qBAARnB,MAAqBA,IAAImB,SAASpB,EAAEC,KAAKmB,OAAOA,MAAM9H,WAEnDuK,cAAe3L,QAA8BO,SAAS4G,cAAcnH;;ACGjF,SAAS4L,OACPC,SACA9D,KACAmB;IAEA,IAAIA,MAAMF,OAAO7M,eAAe+M,MAAMF,MACpC,MAAA,IAAA7K,MAAA;IAEF,MAAM2N,KAAKD,QAAQ9D,KAAKmB,OAAOA,MAAM9H;IAErC,OADAiI,SAASH,OAAO4C,KACTA;AACT;;AAEO,MAAMC,MAAM,CAAChE,KAAamB,UAAoC0C,OAAOF,MAAM3D,KAAKmB,QAC1EjB,MAAM,CAACF,KAAamB,UAAoC0C,OAAOI,OAAMjE,KAAKmB,QAC1Ef,SAAS,CAACJ,KAAgBmB,UAAoC0C,OAAOK,UAASlE,KAAKmB;;AAO1F,SAAUgD,SAAShD;IACvB,OAAM9H,UAAEA,YAAa8H,SAAS,CAAA;IAE9B,KAAK9H,UACH,OAAOuK,YAAY;IAGrB,MAAMQ,WFgEF,SAAoC/K;QACxC,MAAM+K,WAAsB,IAEtBC,eAAgBC;YACpB,IAAIA,kBAAmD,MAAVA,UAA6B,MAAVA,OAKhE,IAAIrF,SAASqF,QAEXC,SAASD,OAAOD,oBAFlB;gBAMA,IAAqB,mBAAVC,SAAuC,mBAAVA,OAAoB;oBAC1D,MAAME,OAAOhM,SAASyH,cAAc;oBAGpC,OAFAuE,KAAKC,cAAcC,OAAOJ,aAC1BF,SAAS1M,KAAK8M;AAEhB;gBAEA,IAAIF,iBAAiBK,SACnBP,SAAS1M,KAAK4M,aADhB;oBAKA,KAAI5Q,KAAK4Q,QAOP,MAFF5O,QAAAC,KAAA,gBAAM,oCAAoC2O;oBAElC,IAAIlO,MAAM;oBANhBiO,aAAaC,MAAMhP;AAHrB;AAZA;;QA0BF,OADA+O,aAAahL,WACN+K;AACT,KExGmBQ,CAA0BvL;IAE3C,OFmBI,SAA0C8H;QAC9C,MAAM1H,SAAS,IAAIgK,gBACbW,WAAW3K,OAAO1B,MAClB8M,cAActB,WAAWpC,MAAM9H,WAE/ByL,SAAS;YACb,MAAMC,cAAcF,YAAYvP,OAC1B8C,SAASqB,OAAOpB;YAEtB,KAAKD,QAAQ;gBACXgM,SAAS3P,SAAS;gBAClB,KAAK,IAAIG,IAAI,GAAGA,IAAImQ,YAAYtQ,QAAQG,KACtCwP,SAAS1M,KAAKqN,YAAYnQ;gBAE5B;AACF;YAEA6E,OAAOiK,kBACPU,SAAS3P,SAAS;YAElB,MAAMuQ,WAAWxM,SAASyM;YAC1B,KAAK,IAAIrQ,IAAI,GAAGA,IAAImQ,YAAYtQ,QAAQG,KAAK;gBAC3C,MAAM4G,UAAUuJ,YAAYnQ;gBAC5BwP,SAAS1M,KAAK8D,UACdwJ,SAAS1M,YAAYkD;AACvB;YAEApD,OAAO8M,aAAaF,UAAUvL,OAAO0L;;QAUvC,OAPAN,YAAY5O,YAAY6O,QAAQA,SAChClK,gBAAgBnB,QAAQ,MAAMoL,YAAYtO,eAAeuO;QACzDrL,OAAOzB,gBAAgB8M,QACvBA,UAEAxD,SAASH,OAAoC1H,SAEtCA;AACT,KEzDS2L,CAAc;QAAE/L,UAAU+K;;AACnC;;MAKaiB,SAAqB,IAAIC,SAG7BtB,OAAOsB,OAOHC,OAAOvB;;AC/Cd,SAAUwB,QACdrE;IAOA,MAAMsE,MAAMtE,MAAMuE,UAAUvE;IAC5B,IAAIwE,OACFxE,MAAMyE,YAAapN,SAAS4G,cAAc;IAW5C,OATIL,YAAY0G,OACdA,IAAIzG,KAAM6G;QACRF,KAAK/G,YAAYiH,WACjBzL,sBAAsByL;SAGxBF,OAAOF,KAGFE;AACT;;ACvBM,MAAOG,oBAAoBlO;IACtBiH,KAAI;IAEb,WAAAxJ;QACEE;AACF;;;AAYF,MAAMwQ,gBAAgB,CAACC,SAAgC9P,KAAUiD,MAAmB4B;IAC9EiL,QAAQ7P,IAAID,QACdR,QAAAiF,MAAA,iBAAO,2CAA2CI,iDAAiD2J,OAAOxO;IAE5G8P,QAAQ1P,IAAIJ,KAAKiD;;;AAQb,SAAU8M,MAAS9E;IACvB,MAAM2D,SAAS;QACb,MAAMoB,UAAUC,QAAQ7Q,OAClB8C,SAASqB,OAAOpB;QAEtB,KAAKD,QAAQ;YACXqB,OAAO1B,KAAKtD,SAAS,GACrBuR,QAAQtP;YACR,KAAK,IAAIqE,QAAQ,GAAGA,QAAQmL,QAAQzR,QAAQsG,SAAS;gBACnD,MAAMqL,OAAOF,QAAQnL,QACfsL,UAAUC,WAAWF,MAAMrL,OAAOmL,UAClC/M,OAAOoN,WAAWH,MAAMrL,OAAOmL;gBACrCH,cAAcC,SAASK,SAASlN,MAAM4B,QACtCtB,OAAO1B,KAAKL,KAAKyB;AACnB;YACA,OAAOM;AACT;QAEA,MAAM+M,YAAY/M,OAAO1B,KAAKtD,QACxBgS,YAAYP,QAAQzR;QAE1B,IAAkB,MAAdgS,WAIF,OAHAT,QAAQjQ,QAASoD,QAASA,KAAKS,WAC/BoM,QAAQtP;QACR+C,OAAO1B,KAAKtD,SAAS,GACdgF;QAGT,IAAkB,MAAd+M,WAAiB;YACnB/M,OAAO1B,KAAKtD,SAAS;YACrB,MAAMuQ,WAAWxM,SAASyM;YAC1B,KAAK,IAAIrQ,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;gBAClC,MAAMwR,OAAOF,QAAQtR,IACfyR,UAAUC,WAAWF,MAAMxR,GAAGsR,UAC9B/M,OAAOoN,WAAWH,MAAMxR,GAAGsR;gBACjCH,cAAcC,SAASK,SAASlN,MAAMvE,IACtC6E,OAAO1B,KAAKL,KAAKyB,OACjB6L,SAAS1M,YAAYa;AACvB;YAEA,OADAf,OAAO8M,aAAaF,UAAUvL,OAAO0L,cAC9B1L;AACT;QAEA,MAAMiN,mBAAmB,IAAItR,KACvB2P,cAA6B,IAAIzL,MAAMmN;QAC7C,KAAK,IAAI7R,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;YAClC,MAAMwR,OAAOF,QAAQtR,IACfyR,UAAUC,WAAWF,MAAMxR,GAAGsR;YACpCQ,iBAAiBpQ,IAAI+P,SAASzR,IAC9BmQ,YAAYnQ,KAAKoR,QAAQ7P,IAAIkQ,WAAWL,QAAQ9O,IAAImP,WAAYE,WAAWH,MAAMxR,GAAGsR;AACtF;QAEA,MAAMS,WAA0B;QAChCX,QAAQjQ,QAAQ,CAACoD,MAAMjD;YAChBwQ,iBAAiBvQ,IAAID,QACxByQ,SAASjP,KAAKyB;;QAGlB,KAAK,IAAIvE,IAAI,GAAGA,IAAI+R,SAASlS,QAAQG,KACnC+R,SAAS/R,GAAGgF;QAGd,IAAIgN,cAAcnN,OAAO0L;QACzB,KAAK,IAAIvQ,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;YAClC,MAAMuE,OAAO4L,YAAYnQ;YACrBgS,gBAAgBzN,OAClBf,OAAO8M,aAAa/L,MAAMyN,eAE1BA,cAAcA,YAAYzB;AAE9B;QAEAa,QAAQtP,SACR+C,OAAO1B,KAAKtD,SAAS;QACrB,KAAK,IAAIG,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;YAClC,MAAMyR,UAAUC,WAAWJ,QAAQtR,IAAIA,GAAGsR,UACpC/M,OAAO4L,YAAYnQ;YACzBmR,cAAcC,SAASK,SAASlN,MAAMvE,IACtC6E,OAAO1B,KAAKL,KAAKyB;AACnB;QACA,OAAOM;OAGH6M,aAAgDnF,MAAMjL,OAAG,CAAMkQ,QAAYA,OAC3EG,aACJpF,MAAMvK,OAAG,CAAMwP,QAAYS,UAAUT,QACjCD,UAAU5C,WAAWpC,MAAMpJ,OAC3B0B,SAAS,IAAIqM,aACbE,UAAU,IAAI5Q;IAEpB,KAAK,IAAI2F,QAAQ,GAAGA,QAAQoL,QAAQ7Q,MAAMb,QAAQsG,SAAS;QACzD,MAAMqL,OAAOD,QAAQ7Q,MAAMyF,QACrBsL,UAAUC,WAAWF,MAAMrL,OAAOoL,QAAQ7Q,QAC1C6D,OAAOoN,WAAWH,MAAMrL,OAAOoL,QAAQ7Q;QAC7CyQ,cAAcC,SAASK,SAASlN,MAAM4B,QACtCtB,OAAO1B,KAAKL,KAAKyB;AACnB;IAOA,OALAgN,QAAQlQ,YAAY6O,QAAQA,SAC5BlK,gBAAgBnB,QAAQ,MAAM0M,QAAQ5P,eAAeuO;IACrDrL,OAAOzB,gBAAgB8M,QACvBxD,SAASH,OAAO1H,SAETA;AACT;;ACvIM,SAAUqN,cACdC,WACAC,OACAC,SACAC,SACAC;IAEA,KAAKzT,KAAKqT,YACR,OAAOA,YAAYpD,KAAKqD,OAAOC,WAAWC,UAAUvD,KAAKuD,SAASC,aAAcvD,YAAY;IAG9F,IAAIsD,SAAS;QACX,IAAI7L,UAAU0L,UAAUzR,QAAQqO,KAAKqD,OAAOC,WAAWtD,KAAKuD,SAAUC;QACtE,MAAMtM,UAAU,MAAMkM,UAAUxQ,eAAekI,WACzCA,WAAY5I;YAChB,MAAMuR,MAAM/L;YACZA,UAAUxF,WAAW8N,KAAKqD,OAAOC,WAAWtD,KAAKuD,SAAUC,YAC3DrM,mBAAmBsM,KAAKvM;YACxBD,gBAAgBS,SAASR,UACzBuM,IAAIxI,YAAYvD,UAChBjB,sBAAsBiB;;QAIxB,OAFA0L,UAAU9Q,YAAYwI,UAAUA,WAChC7D,gBAAgBS,SAASR;QAClBQ;AACT;IAAO;QACL,MAAMgM,QAAQzD,YAAY;QAC1B,IAAIvI,UAAU0L,UAAUzR,QAAQqO,KAAKqD,OAAOC,WAAWI;QACvD,MAAMxM,UAAU,MAAMkM,UAAUxQ,eAAekI,WACzCA,WAAY5I;YAChB,MAAMuR,MAAM/L;YACZA,UAAUxF,WAAW8N,KAAKqD,OAAOC,WAAWI,OAC5CvM,mBAAmBsM,KAAKvM;YACxBD,gBAAgBS,SAASR,UACzBuM,IAAIxI,YAAYvD,UAChBjB,sBAAsBiB;;QAIxB,OAFA0L,UAAU9Q,YAAYwI,UAAUA,WAChC7D,gBAAgBS,SAASR;QAClBQ;AACT;AACF;;"}
+{"version":3,"file":"index.mjs","sources":["../src/reactable/common.ts","../src/reactable/reactive.ts","../src/jsx/anchor.ts","../src/h/attr-helpers.ts","../src/h/attr.ts","../src/h/content.ts","../src/h/model.ts","../src/h/index.ts","../src/reactable/scheduler.ts","../src/reactable/ref.ts","../src/reactable/computed.ts","../src/reactable/effect.ts","../src/reactable/index.ts","../src/jsx/fragment.ts","../src/jsx/common.ts","../src/jsx/jsx-runtime.ts","../src/jsx/async.ts","../src/jsx/for.ts","../src/jsx/if.ts"],"sourcesContent":["import { KTReactiveLike, KTReactiveType, type KTReactive } from './reactive.js';\nimport type { KTRef, KTRefLike, KTSubRef } from './ref.js';\nimport type { KTComputed, KTComputedLike, KTSubComputed } from './computed.js';\n\n// # type guards\nexport function isKT<T = any>(obj: any): obj is KTReactiveLike<T> {\n  return typeof obj?.kid === 'number';\n}\n\nexport function isReactiveLike<T = any>(obj: any): obj is KTReactiveLike<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.ReactiveLike) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isRef<T = any>(obj: any): obj is KTRef<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.Ref;\n  } else {\n    return false;\n  }\n}\n\nexport function isSubRef<T = any>(obj: any): obj is KTSubRef<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.SubRef;\n  } else {\n    return false;\n  }\n}\n\nexport function isRefLike<T = any>(obj: any): obj is KTRefLike<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.RefLike) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isComputed<T = any>(obj: any): obj is KTComputed<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.Computed;\n  } else {\n    return false;\n  }\n}\n\nexport function isSubComputed<T = any>(obj: any): obj is KTSubComputed<T> {\n  if (typeof obj?.ktype === 'number') {\n    return obj.ktype === KTReactiveType.SubComputed;\n  } else {\n    return false;\n  }\n}\n\nexport function isComputedLike<T = any>(obj: any): obj is KTComputedLike<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.ComputedLike) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isReactive<T = any>(obj: any): obj is KTReactive<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.Reactive) !== 0;\n  } else {\n    return false;\n  }\n}\n\nexport function isSubReactive<T = any>(obj: any): obj is KTSubComputed<T> {\n  if (typeof obj?.ktype === 'number') {\n    return (obj.ktype & KTReactiveType.SubReactive) !== 0;\n  } else {\n    return false;\n  }\n}\n\n// # sub getter/setter factory\n\ntype SubGetter = (s: any) => any;\ntype SubSetter = (s: any, newValue: any) => void;\n\n/**\n * Create a value getter which params is `reactive.value`(or `ref.draft`)\n */\nexport const $createSubGetter = (path: Array<string | number>): SubGetter => {\n  // & path.length is guaranteed to be greater than 0 in `KTReactive.get` and `KTRef.get`\n  switch (path.length) {\n    // ? Does it use less memory if we write this:\n    // const [k2_0, k2_1] = path;\n    // return (s) => s[k2_0][k2_1];\n    case 1:\n      return (s) => s[path[0]];\n    case 2:\n      return (s) => s[path[0]][path[1]];\n    case 3:\n      return (s) => s[path[0]][path[1]][path[2]];\n    case 4:\n      return (s) => s[path[0]][path[1]][path[2]][path[3]];\n    case 5:\n      return (s) => s[path[0]][path[1]][path[2]][path[3]][path[4]];\n    default:\n      return (s) => {\n        let r = s[path[0]][path[1]][path[2]][path[3]][path[4]];\n        for (let i = 5; i < path.length; i++) {\n          r = r[path[i]];\n        }\n        return r;\n      };\n  }\n};\n\n/**\n * Create a value setter which params is `reactive.value`(or `ref.draft`)\n */\nexport const $createSubSetter = (path: Array<string | number>): SubSetter => {\n  switch (path.length) {\n    case 1:\n      return (s, newValue) => (s[path[0]] = newValue);\n    case 2:\n      return (s, newValue) => (s[path[0]][path[1]] = newValue);\n    case 3:\n      return (s, newValue) => (s[path[0]][path[1]][path[2]] = newValue);\n    case 4:\n      return (s, newValue) => (s[path[0]][path[1]][path[2]][path[3]] = newValue);\n    case 5:\n      return (s, newValue) => (s[path[0]][path[1]][path[2]][path[3]][path[4]] = newValue);\n    default:\n      return (s, newValue) => {\n        let r = s[path[0]][path[1]][path[2]][path[3]][path[4]];\n        for (let i = 5; i < path.length - 1; i++) {\n          r = r[path[i]];\n        }\n        r[path[path.length - 1]] = newValue;\n      };\n  }\n};\n","import type { KTComputed, KTSubComputed } from './computed.js';\n\nimport { $stringify } from '@ktjs/shared';\n\nexport type ChangeHandler<T> = (newValue: T, oldValue: T) => void;\n\nexport const enum KTReactiveType {\n  Pseudo = 0b000001,\n  Ref = 0b000010,\n  SubRef = 0b000100,\n  RefLike = Ref | SubRef,\n  Computed = 0b001000,\n  SubComputed = 0b010000,\n  ComputedLike = Computed | SubComputed,\n  Reactive = Ref | Computed,\n  SubReactive = SubRef | SubComputed,\n  ReactiveLike = RefLike | ComputedLike | Pseudo,\n}\n\nlet kid = 1;\nlet handlerId = 1;\n\nexport const nextKid = () => kid++;\nexport const nextHandlerId = (kid: number) => `@@k-handler-${kid}-${handlerId++}`;\n\nexport abstract class KTReactiveLike<T> {\n  readonly kid = nextKid();\n\n  abstract readonly ktype: KTReactiveType;\n\n  abstract get value(): T;\n\n  abstract addOnChange(handler: ChangeHandler<T>, key?: any): this;\n  abstract removeOnChange(key: any): this;\n\n  abstract dispose(): void;\n}\n\nexport abstract class KTReactive<T> extends KTReactiveLike<T> {\n  /**\n   * @internal\n   */\n  protected _value: T;\n\n  /**\n   * @internal\n   */\n  protected readonly _changeHandlers = new Map<any, ChangeHandler<any>>();\n\n  constructor(value: T) {\n    super();\n    this._value = value;\n  }\n\n  get value() {\n    return this._value;\n  }\n\n  set value(_newValue: T) {\n    $warn('Setting value to a non-ref instance takes no effect.');\n  }\n\n  /**\n   * @internal\n   */\n  protected _emit(newValue: T, oldValue: T): this {\n    this._changeHandlers.forEach((handler) => handler(newValue, oldValue));\n    return this;\n  }\n\n  addOnChange(handler: ChangeHandler<T>, key: any = nextHandlerId(this.kid)): this {\n    if (this._changeHandlers.has(key)) {\n      $throw(`Overriding existing change handler with key ${$stringify(key)}.`);\n    }\n    this._changeHandlers.set(key, handler);\n    return this;\n  }\n\n  removeOnChange(key: any): this {\n    this._changeHandlers.delete(key);\n    return this;\n  }\n\n  clearOnChange(): this {\n    this._changeHandlers.clear();\n    return this;\n  }\n\n  notify(): this {\n    return this._emit(this._value, this._value);\n  }\n\n  /**\n   * Create a computed value via current reactive value.\n   * - No matter `this` is added to `dependencies` or not, it is always listened.\n   * @param calculator A function that generates a new value based on current value.\n   * @param dependencies optional other dependencies that the computed value depends on.\n   */\n  map<U>(calculator: (value: T) => U, dependencies?: Array<KTReactiveLike<any>>): KTComputed<U> {\n    return null as any; // & implemented in computed.ts to avoid circular dependency\n  }\n\n  /**\n   * Make a computed value that checks if the reactive value is strictly equal to a specific value.\n   * - Use `Object.is` for comparison.\n   * - if `o` is reactive-like, it will be added to dependencies\n   */\n  is(o: T | KTReactiveLike<T>): KTSubComputed<boolean> {\n    return null as any; // & implemented in computed.ts to avoid circular dependency\n  }\n\n  /**\n   * Make a computed value that checks if the reactive value matches a specific object structure.\n   * - Deeply match.\n   * - if `o` is reactive-like, it will be added to dependencies\n   */\n  match(o: object | KTReactiveLike<object>): KTSubComputed<boolean> {\n    return null as any; // & implemented in computed.ts to avoid circular dependency\n  }\n\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<\n    K0 extends keyof T,\n    K1 extends keyof T[K0],\n    K2 extends keyof T[K0][K1],\n    K3 extends keyof T[K0][K1][K2],\n    K4 extends keyof T[K0][K1][K2][K3],\n  >(key0: K0, key1: K1, key2: K2, key3: K3, key4: K4): KTSubComputed<T[K0][K1][K2][K3][K4]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1], K3 extends keyof T[K0][K1][K2]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n    key3: K3,\n  ): KTSubComputed<T[K0][K1][K2][K3]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n  ): KTSubComputed<T[K0][K1][K2]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T, K1 extends keyof T[K0]>(key0: K0, key1: K1): KTSubComputed<T[K0][K1]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get<K0 extends keyof T>(key0: K0): KTSubComputed<T[K0]>;\n  /**\n   * Generate a sub-computed value based on this reactive, using keys to access nested properties.\n   * - `reactive.get('a', 'b')` means a sub-computed value to `this.value.a.b`.\n   * - `KTSubComputed` is lighter than `KTComputed` because it only listens to changes on the source reactive, while `KTComputed` listens to all its dependencies. So it's better to use `get` when you only need to access nested properties without doing any calculation.\n   */\n  get(..._keys: Array<string | number>): KTSubComputed<any> {\n    // & Will be implemented in computed.ts to avoid circular dependency\n    return null as any;\n  }\n}\n\nexport abstract class KTSubReactive<T> extends KTReactiveLike<T> {\n  readonly source: KTReactive<any>;\n\n  /**\n   * @internal\n   */\n  protected _value: T;\n\n  /**\n   * @internal\n   */\n  protected readonly _getter: (sv: KTReactive<any>['value']) => T;\n\n  /**\n   * @internal\n   */\n  protected readonly _handler: ChangeHandler<any>;\n\n  /**\n   * @internal\n   */\n  protected readonly _handlerKeys: string[];\n\n  constructor(source: KTReactive<any>, getter: (sv: KTReactive<any>['value']) => T) {\n    super();\n    this.source = source;\n    this._getter = getter;\n    this._handlerKeys = [];\n\n    // @ts-expect-error _value is protected\n    this._value = this._getter(source._value);\n    // @ts-expect-error _value is protected\n    this._handler = () => (this._value = getter(source._value));\n\n    this._handlerKeys.push(nextHandlerId(this.kid));\n    source.addOnChange(this._handler, this._handlerKeys[0]);\n  }\n\n  addOnChange(handler: ChangeHandler<T>, key: any = nextHandlerId(this.kid)): this {\n    this._handlerKeys.push(key);\n    this.source.addOnChange((newValue, oldValue) => handler(this._getter(newValue), this._getter(oldValue)), key);\n    return this;\n  }\n\n  removeOnChange(key: any): this {\n    this.source.removeOnChange(key);\n    return this;\n  }\n\n  dispose(): void {\n    this._handlerKeys.forEach((key) => this.source.removeOnChange(key));\n  }\n}\n","export const enum AnchorType {\n  Fragment = 'kt-fragment',\n  For = 'kt-for',\n}\n\nexport abstract class KTAnchor<T extends Node = Node> extends Comment {\n  readonly isKTAnchor: true = true;\n  readonly list: T[] = [];\n  abstract readonly type: AnchorType;\n  mountCallback?: () => void;\n\n  constructor(data: AnchorType) {\n    super(data);\n    $ensureAnchorObserver();\n  }\n\n  mount(parent?: Node) {\n    if (parent && this.parentNode !== parent) {\n      parent.appendChild(this);\n    }\n    if (this.parentNode) {\n      this.mountCallback?.();\n    }\n  }\n}\n\ntype MountableKTAnchor = Node & {\n  isKTAnchor?: true;\n  mount?: (parent?: Node) => void;\n};\ntype NodeCleanup = () => void;\n\nconst CANNOT_MOUNT = typeof document === 'undefined' || typeof Node === 'undefined';\nconst CANNOT_OBSERVE = CANNOT_MOUNT || typeof MutationObserver === 'undefined';\nconst COMMENT_FILTER = typeof NodeFilter === 'undefined' ? 0x80 : NodeFilter.SHOW_COMMENT;\nconst ELEMENT_NODE = 1;\nconst DOCUMENT_FRAGMENT_NODE = 11;\nconst nodeToCleanups = new WeakMap<Node, NodeCleanup[]>();\nlet anchorObserver: MutationObserver | undefined;\n\nconst $cleanupRemovedNode = (node: Node) => {\n  if (node.nodeType === ELEMENT_NODE || node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n    const children = Array.from(node.childNodes);\n    for (let i = 0; i < children.length; i++) {\n      $cleanupRemovedNode(children[i]);\n    }\n  }\n\n  const anchor = node as KTAnchor<Node>;\n  if (anchor.isKTAnchor === true) {\n    const list = anchor.list.slice();\n    anchor.list.length = 0;\n    for (let i = 0; i < list.length; i++) {\n      const listNode = list[i] as ChildNode;\n      if (listNode.parentNode) {\n        listNode.remove();\n      }\n      $cleanupRemovedNode(listNode);\n    }\n  }\n\n  $runNodeCleanups(node);\n};\n\nconst $ensureAnchorObserver = () => {\n  if (CANNOT_OBSERVE || anchorObserver || !document.body) {\n    return;\n  }\n\n  anchorObserver = new MutationObserver((records) => {\n    if (typeof document === 'undefined') {\n      anchorObserver?.disconnect();\n      anchorObserver = undefined;\n      return;\n    }\n\n    for (let i = 0; i < records.length; i++) {\n      const addedNodes = records[i].addedNodes;\n      for (let j = 0; j < addedNodes.length; j++) {\n        $mountFragmentAnchors(addedNodes[j]);\n      }\n\n      const removedNodes = records[i].removedNodes;\n      for (let j = 0; j < removedNodes.length; j++) {\n        $cleanupRemovedNode(removedNodes[j]);\n      }\n    }\n  });\n  anchorObserver.observe(document.body, { childList: true, subtree: true });\n};\n\nconst $mountIfFragmentAnchor = (node: Node) => {\n  const anchor = node as MountableKTAnchor;\n  if (anchor.isKTAnchor === true && typeof anchor.mount === 'function') {\n    anchor.mount();\n  }\n};\n\nconst $runNodeCleanups = (node: Node) => {\n  const cleanups = nodeToCleanups.get(node);\n  if (!cleanups) {\n    return;\n  }\n\n  nodeToCleanups.delete(node);\n  for (let i = cleanups.length - 1; i >= 0; i--) {\n    try {\n      cleanups[i]();\n    } catch (error) {\n      $error('KTNodeCleanup:', error);\n    }\n  }\n};\n\nexport const $addNodeCleanup = (node: Node, cleanup: NodeCleanup) => {\n  $ensureAnchorObserver();\n  const cleanups = nodeToCleanups.get(node);\n  if (cleanups) {\n    cleanups.push(cleanup);\n  } else {\n    nodeToCleanups.set(node, [cleanup]);\n  }\n  return cleanup;\n};\n\nexport const $removeNodeCleanup = (node: Node, cleanup: NodeCleanup) => {\n  const cleanups = nodeToCleanups.get(node);\n  if (!cleanups) {\n    return;\n  }\n\n  const index = cleanups.indexOf(cleanup);\n  if (index === -1) {\n    return;\n  }\n\n  cleanups.splice(index, 1);\n  if (cleanups.length === 0) {\n    nodeToCleanups.delete(node);\n  }\n};\n\nexport const $mountFragmentAnchors = (node: unknown) => {\n  if (CANNOT_MOUNT || typeof document === 'undefined' || !node || typeof (node as any).nodeType !== 'number') {\n    return;\n  }\n\n  const nodeObj = node as Node;\n  $mountIfFragmentAnchor(nodeObj);\n\n  if (nodeObj.nodeType !== ELEMENT_NODE && nodeObj.nodeType !== DOCUMENT_FRAGMENT_NODE) {\n    return;\n  }\n\n  const walker = document.createTreeWalker(nodeObj, COMMENT_FILTER);\n  let current = walker.nextNode();\n  while (current) {\n    $mountIfFragmentAnchor(current);\n    current = walker.nextNode();\n  }\n};\n","const booleanHandler = (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) => {\n  if (key in element) {\n    (element as any)[key] = !!value;\n  } else {\n    element.setAttribute(key, value);\n  }\n};\n\nconst valueHandler = (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) => {\n  if (key in element) {\n    (element as any)[key] = value;\n  } else {\n    element.setAttribute(key, value);\n  }\n};\n\n// Attribute handlers map for optimized lookup\nexport const handlers: Record<\n  string,\n  (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) => void\n> = {\n  checked: booleanHandler,\n  selected: booleanHandler,\n  value: valueHandler,\n  valueAsDate: valueHandler,\n  valueAsNumber: valueHandler,\n  defaultValue: valueHandler,\n  defaultChecked: booleanHandler,\n  defaultSelected: booleanHandler,\n  disabled: booleanHandler,\n  readOnly: booleanHandler,\n  multiple: booleanHandler,\n  required: booleanHandler,\n  autofocus: booleanHandler,\n  open: booleanHandler,\n  controls: booleanHandler,\n  autoplay: booleanHandler,\n  loop: booleanHandler,\n  muted: booleanHandler,\n  defer: booleanHandler,\n  async: booleanHandler,\n  hidden: (element, _key, value) => ((element as HTMLElement).hidden = !!value),\n};\n","import type { KTReactifyProps } from '../reactable/types.js';\nimport type { KTRawAttr, KTAttribute } from '../types/h.js';\nimport { isKT } from '../reactable/common.js';\nimport { nextHandlerId } from '../reactable/reactive.js';\nimport { $addNodeCleanup } from '../jsx/anchor.js';\nimport { handlers } from './attr-helpers.js';\n\nconst defaultHandler = (element: HTMLElement | SVGElement | MathMLElement, key: string, value: any) =>\n  element.setAttribute(key, value);\n\nconst setElementStyle = (\n  element: HTMLElement | SVGElement | MathMLElement,\n  style: Partial<CSSStyleDeclaration> | string,\n) => {\n  if (typeof style === 'string') {\n    (element as HTMLElement).style.cssText = style;\n    return;\n  }\n\n  for (const key in style) {\n    (element as any).style[key as any] = style[key];\n  }\n};\n\nconst addReactiveCleanup = (\n  element: HTMLElement | SVGElement | MathMLElement,\n  reactive: {\n    addOnChange: (handler: (value: any) => void, key?: any) => unknown;\n    removeOnChange: (key: any) => unknown;\n  },\n  handler: (value: any) => void,\n) => {\n  reactive.addOnChange(handler, handler);\n  $addNodeCleanup(element, () => reactive.removeOnChange(handler));\n};\n\nfunction attrIsObject(element: HTMLElement | SVGElement | MathMLElement, attr: KTReactifyProps<KTAttribute>) {\n  const classValue = attr.class || attr.className;\n  if (classValue !== undefined) {\n    if (isKT<string>(classValue)) {\n      element.setAttribute('class', classValue.value);\n      addReactiveCleanup(element, classValue, (v) => element.setAttribute('class', v));\n    } else {\n      element.setAttribute('class', classValue);\n    }\n  }\n\n  const style = attr.style;\n  if (style) {\n    if (typeof style === 'string') {\n      element.setAttribute('style', style);\n    } else if (typeof style === 'object') {\n      if (isKT(style)) {\n        setElementStyle(element, style.value);\n        addReactiveCleanup(element, style, (v: Partial<CSSStyleDeclaration> | string) => setElementStyle(element, v));\n      } else {\n        setElementStyle(element, style as Partial<CSSStyleDeclaration>);\n      }\n    }\n  }\n\n  // ! Security: `k-html` is an explicit raw HTML escape hatch. kt.js intentionally does not sanitize here; callers must pass only trusted HTML.\n  if ('k-html' in attr) {\n    const html = attr['k-html'];\n    // ?? 如何在元素消失后自动消除html的onChangeHandler呢\n    if (isKT(html)) {\n      element.innerHTML = html.value;\n      const key = nextHandlerId(html.kid);\n      html.addOnChange((v) => (element.innerHTML = v), key);\n      $addNodeCleanup(element, () => html.removeOnChange(key));\n    } else {\n      element.innerHTML = html;\n    }\n  }\n\n  for (const key in attr) {\n    // & Arranged in order of usage frequency\n    if (\n      // key === 'k-if' ||\n      // key === 'k-else' ||\n      key === 'k-model' ||\n      key === 'k-for' ||\n      key === 'k-key' ||\n      key === 'ref' ||\n      key === 'class' ||\n      key === 'className' ||\n      key === 'style' ||\n      key === 'children' ||\n      key === 'k-html'\n    ) {\n      continue;\n    }\n\n    const o = attr[key];\n\n    // normal event handler\n    if (key.startsWith('on:')) {\n      if (o) {\n        const eventName = key.slice(3);\n        element.addEventListener(eventName, o); // chop off the `on:`\n        $addNodeCleanup(element, () => element.removeEventListener(eventName, o));\n      }\n      continue;\n    }\n\n    // normal attributes\n    // Security: all non-`on:` attributes are forwarded as-is.\n    // Dangerous values such as raw `on*`, `href`, `src`, `srcdoc`, SVG href, etc.\n    // remain the caller's responsibility.\n    const handler = handlers[key] || defaultHandler;\n    if (isKT(o)) {\n      handler(element, key, o.value);\n      addReactiveCleanup(element, o, (v) => handler(element, key, v));\n    } else {\n      handler(element, key, o);\n    }\n  }\n}\n\nexport function applyAttr(element: HTMLElement | SVGElement | MathMLElement, attr: KTRawAttr) {\n  if (!attr) {\n    return;\n  }\n  if (typeof attr === 'object' && attr !== null) {\n    attrIsObject(element, attr as KTAttribute);\n  } else {\n    $throw('attr must be an object.');\n  }\n}\n","import { $isArray, $isNode, $isThenable } from '@ktjs/shared';\nimport type { KTAvailableContent, KTRawContent } from '../types/h.js';\nimport { isKT } from '../reactable/common.js';\nimport { AnchorType } from '../jsx/anchor.js';\nimport { $addNodeCleanup, $mountFragmentAnchors } from '../jsx/anchor.js';\n\nconst assureNode = (o: any) => ($isNode(o) ? o : document.createTextNode(o));\n\nfunction apdSingle(element: HTMLElement | DocumentFragment | SVGElement | MathMLElement, c: KTAvailableContent) {\n  // & Ignores falsy values, consistent with React's behavior\n  if (c === undefined || c === null || c === false) {\n    return;\n  }\n\n  if (isKT(c)) {\n    let node = assureNode(c.value);\n    element.appendChild(node);\n    const onChange = (newValue: KTAvailableContent) => {\n      const newNode = assureNode(newValue);\n      const oldNode = node;\n      node = newNode;\n      oldNode.replaceWith(newNode);\n      $mountFragmentAnchors(newNode);\n    };\n    c.addOnChange(onChange, onChange);\n    $addNodeCleanup(element, () => c.removeOnChange(onChange));\n  } else {\n    const node = assureNode(c);\n    element.appendChild(node);\n    const anchor = node as { type?: AnchorType; list?: any[] };\n    if (anchor.type === AnchorType.For) {\n      apd(element, anchor.list);\n    }\n  }\n}\n\nfunction apd(element: HTMLElement | DocumentFragment | SVGElement | MathMLElement, c: KTAvailableContent) {\n  if ($isThenable(c)) {\n    c.then((r) => apd(element, r));\n  } else if ($isArray(c)) {\n    for (let i = 0; i < c.length; i++) {\n      // & might be thenable here too\n      const ci = c[i];\n      if ($isThenable(ci)) {\n        const comment = document.createComment('ktjs-promise-placeholder');\n        element.appendChild(comment);\n        ci.then((awaited) => {\n          if ($isNode(awaited)) {\n            // ?? 难道不能都在observer回调里做吗\n            comment.replaceWith(awaited);\n            $mountFragmentAnchors(awaited);\n          } else {\n            const awaitedNode = assureNode(awaited);\n            comment.replaceWith(awaitedNode);\n            $mountFragmentAnchors(awaitedNode);\n          }\n        });\n      } else {\n        apdSingle(element, ci);\n      }\n    }\n  } else {\n    // & here is thened, so must be a simple elementj\n    apdSingle(element, c);\n  }\n}\n\nexport function applyContent(element: HTMLElement | SVGElement | MathMLElement, content: KTRawContent): void {\n  if ($isArray(content)) {\n    for (let i = 0; i < content.length; i++) {\n      apd(element, content[i]);\n    }\n  } else {\n    apd(element, content as KTAvailableContent);\n  }\n}\n","import type { InputElementTag } from '@ktjs/shared';\nimport type { KTRefLike } from '../reactable/ref.js';\n\nimport { static_cast } from 'type-narrow';\nimport { isRefLike } from '../reactable/common.js';\nimport { $addNodeCleanup } from '../jsx/anchor.js';\n\nexport function applyKModel(element: HTMLElementTagNameMap[InputElementTag], valueRef: KTRefLike<any>) {\n  if (!isRefLike(valueRef)) {\n    $throw('k-model value must be a KTRefLike.');\n  }\n\n  if (element.tagName === 'INPUT') {\n    static_cast<HTMLInputElement>(element);\n    if (element.type === 'radio' || element.type === 'checkbox') {\n      element.checked = Boolean(valueRef.value);\n      const onChange = () => (valueRef.value = element.checked);\n      const onValueChange = (newValue: boolean) => (element.checked = newValue);\n      element.addEventListener('change', onChange);\n      valueRef.addOnChange(onValueChange, onValueChange);\n      $addNodeCleanup(element, () => element.removeEventListener('change', onChange));\n      $addNodeCleanup(element, () => valueRef.removeOnChange(onValueChange));\n    } else {\n      element.value = valueRef.value ?? '';\n      const onInput = () => (valueRef.value = element.value);\n      const onValueChange = (newValue: string) => (element.value = newValue);\n      element.addEventListener('input', onInput);\n      valueRef.addOnChange(onValueChange, onValueChange);\n      $addNodeCleanup(element, () => element.removeEventListener('input', onInput));\n      $addNodeCleanup(element, () => valueRef.removeOnChange(onValueChange));\n    }\n    return;\n  }\n\n  if (element.tagName === 'SELECT' || element.tagName === 'TEXTAREA') {\n    element.value = valueRef.value ?? '';\n    const onChange = () => (valueRef.value = element.value);\n    const onValueChange = (newValue: string) => (element.value = newValue);\n    element.addEventListener('change', onChange);\n    valueRef.addOnChange(onValueChange, onValueChange);\n    $addNodeCleanup(element, () => element.removeEventListener('change', onChange));\n    $addNodeCleanup(element, () => valueRef.removeOnChange(onValueChange));\n    return;\n  }\n\n  $warn('not supported element for k-model:');\n}\n","import type { HTMLTag, MathMLTag, SVGTag } from '@ktjs/shared';\nimport type { KTRawAttr, KTRawContent, HTML } from '../types/h.js';\n\nimport { applyAttr } from './attr.js';\nimport { applyContent } from './content.js';\nimport { applyKModel } from './model.js';\n\n/**\n * Create an enhanced HTMLElement.\n * - Only supports HTMLElements, **NOT** SVGElements or other Elements.\n * @param tag tag of an `HTMLElement`\n * @param attr attribute object or className\n * @param content a string or an array of HTMLEnhancedElement as child nodes\n *\n * __PKG_INFO__\n */\nexport const h = <T extends HTMLTag | SVGTag | MathMLTag>(\n  tag: T,\n  attr?: KTRawAttr,\n  content?: KTRawContent,\n): HTML<T> => {\n  if (typeof tag !== 'string') {\n    $throw('tagName must be a string.');\n  }\n\n  // * start creating the element\n  const element = document.createElement(tag) as HTML<T>;\n  if (typeof attr === 'object' && attr !== null && 'k-model' in attr) {\n    applyKModel(element as any, attr['k-model'] as any);\n  }\n\n  // * Handle content\n  applyAttr(element, attr);\n  applyContent(element, content);\n\n  return element;\n};\n\nexport const svg = <T extends SVGTag>(tag: T, attr?: KTRawAttr, content?: KTRawContent): HTML<T> => {\n  if (typeof tag !== 'string') {\n    $throw('tagName must be a string.');\n  }\n\n  // * start creating the element\n  const element = document.createElementNS('http://www.w3.org/2000/svg', tag) as HTML<T>;\n\n  // * Handle content\n  applyAttr(element, attr);\n  applyContent(element, content);\n\n  if (typeof attr === 'object' && attr !== null && 'k-model' in attr) {\n    applyKModel(element as any, attr['k-model'] as any);\n  }\n\n  return element;\n};\n\nexport const mathml = <T extends MathMLTag>(tag: T, attr?: KTRawAttr, content?: KTRawContent): HTML<T> => {\n  if (typeof tag !== 'string') {\n    $throw('tagName must be a string.');\n  }\n\n  // * start creating the element\n  const element = document.createElementNS('http://www.w3.org/1998/Math/MathML', tag) as HTML<T>;\n\n  // * Handle content\n  applyAttr(element, attr);\n  applyContent(element, content);\n\n  if (typeof attr === 'object' && attr !== null && 'k-model' in attr) {\n    applyKModel(element as any, attr['k-model'] as any);\n  }\n\n  return element;\n};\n","// Use microqueue to schedule the flush of pending reactions\n\nimport type { KTRef } from './ref.js';\n\nconst reactiveToOldValue = new Map<KTRef<any>, any>();\n\nlet scheduled = false;\n\nexport const $markMutation = (reactive: KTRef<any>) => {\n  if (!reactiveToOldValue.has(reactive)) {\n    // @ts-expect-error accessing protected property\n    reactiveToOldValue.set(reactive, reactive._value);\n\n    // # schedule by microqueue\n    if (scheduled) {\n      return;\n    }\n\n    scheduled = true;\n    Promise.resolve().then(() => {\n      scheduled = false;\n      reactiveToOldValue.forEach((oldValue, reactive) => {\n        try {\n          // @ts-expect-error accessing protected property\n          reactive._changeHandlers.forEach((handler) => handler(reactive.value, oldValue));\n        } catch (error) {\n          $error('KTScheduler:', error);\n        }\n      });\n      reactiveToOldValue.clear();\n    });\n  }\n};\n","import { $emptyFn, $is } from '@ktjs/shared';\nimport { $createSubGetter, $createSubSetter, isRefLike } from './common.js';\nimport { KTReactive, KTReactiveType, KTSubReactive } from './reactive.js';\nimport { $markMutation } from './scheduler.js';\n\nexport class KTRef<T> extends KTReactive<T> {\n  readonly ktype = KTReactiveType.Ref;\n\n  constructor(_value: T) {\n    super(_value);\n  }\n\n  // ! Cannot be omitted, otherwise this will override `KTReactive` with only setter. And getter will return undefined.\n  get value() {\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    if ($is(newValue, this._value)) {\n      return;\n    }\n    const oldValue = this._value;\n    this._value = newValue;\n    this._emit(newValue, oldValue);\n  }\n\n  /**\n   * Used to mutate the value in-place.\n   * - internal value is changed instantly, but the change handlers will be called in the next microtask.\n   */\n  get draft() {\n    $markMutation(this);\n    return this._value;\n  }\n\n  notify(): this {\n    return this._emit(this._value, this._value);\n  }\n\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<\n    K0 extends keyof T,\n    K1 extends keyof T[K0],\n    K2 extends keyof T[K0][K1],\n    K3 extends keyof T[K0][K1][K2],\n    K4 extends keyof T[K0][K1][K2][K3],\n  >(key0: K0, key1: K1, key2: K2, key3: K3, key4: K4): KTSubRef<T[K0][K1][K2][K3][K4]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1], K3 extends keyof T[K0][K1][K2]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n    key3: K3,\n  ): KTSubRef<T[K0][K1][K2][K3]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T, K1 extends keyof T[K0], K2 extends keyof T[K0][K1]>(\n    key0: K0,\n    key1: K1,\n    key2: K2,\n  ): KTSubRef<T[K0][K1][K2]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T, K1 extends keyof T[K0]>(key0: K0, key1: K1): KTSubRef<T[K0][K1]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref<K0 extends keyof T>(key0: K0): KTSubRef<T[K0]>;\n  /**\n   * Derive a lighter sub-ref from this ref, using keys to access nested properties.\n   * - `ref.subref('a', 'b')` means a sub-ref to `this.value.a.b`. Change it will also change `this.value` and trigger the handlers.\n   * - `KTSubRef` is lighter than `KTRef`.\n   */\n  subref(...keys: Array<string | number>): KTSubRef<any> {\n    if (keys.length === 0) {\n      $throw('At least one key is required to get a sub-ref.');\n    }\n    return new KTSubRef(this, $createSubGetter(keys), $createSubSetter(keys));\n  }\n\n  dispose(): void {\n    this._changeHandlers.clear();\n  }\n}\n\n/**\n * Create a reactive reference to a value. The returned object has a single property `value` that holds the internal value.\n * @param value listened value\n */\nexport const ref = <T>(value?: T): KTRef<T> => new KTRef(value as any);\n\n/**\n * Assert `k-model` to be a ref-like object\n */\nexport const assertModel = <T = any>(props: any, defaultValue?: T): KTRefLike<T> => {\n  // & props is an object. Won't use it in any other place\n  if ('k-model' in props) {\n    const kmodel = props['k-model'];\n    if (isRefLike(kmodel)) {\n      return kmodel;\n    } else {\n      $throw(`k-model data must be a KTRef object, please use 'ref(...)' to wrap it.`);\n    }\n  }\n  return ref(defaultValue) as KTRef<T>;\n};\n\nconst $refSetter = <T>(props: { ref?: KTRef<T> }, node: T) => (props.ref!.value = node);\ntype RefSetter<T> = (props: { ref?: KTRef<T> }, node: T) => void;\n\nexport type KTRefLike<T> = KTRef<T> | KTSubRef<T>;\n\n/**\n * Whether `props.ref` is a `KTRef` only needs to be checked in the initial render\n */\nexport const $initRef = <T extends Node>(props: { ref?: KTRefLike<T> }, node: T): RefSetter<T> => {\n  if (!('ref' in props)) {\n    return $emptyFn;\n  }\n\n  const r = props.ref;\n  if (isRefLike(r)) {\n    r.value = node;\n    return $refSetter;\n  } else {\n    $throw('Fragment: ref must be a KTRef');\n  }\n};\n\n// # SubRef\n\nexport class KTSubRef<T> extends KTSubReactive<T> {\n  readonly ktype = KTReactiveType.SubRef;\n  declare readonly source: KTRef<any>;\n\n  /**\n   * @internal\n   */\n  protected readonly _setter: (s: object, newValue: T) => void;\n\n  constructor(\n    source: KTRef<any>,\n    getter: (sv: KTReactive<any>['value']) => T,\n    setter: (s: object, newValue: T) => void,\n  ) {\n    super(source, getter);\n    this._setter = setter;\n  }\n\n  get value() {\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    this._value = newValue;\n    // @ts-expect-error _value is private\n    this._setter(this.source._value, newValue);\n    this.source.notify();\n  }\n\n  /**\n   * Only use it for object's nested properties.\n   */\n  get draft() {\n    // Same implementation as `draft` in `KTRef`\n    $markMutation(this.source);\n    return this._value;\n  }\n}\n","import { $deepMatch, $is } from '@ktjs/shared';\nimport { KTReactive, KTReactiveLike, KTReactiveType, KTSubReactive, nextHandlerId } from './reactive.js';\nimport { $createSubGetter, isReactive, isSubReactive } from './common.js';\n\nexport class KTComputed<T> extends KTReactive<T> {\n  readonly ktype = KTReactiveType.Computed;\n\n  /**\n   * @internal\n   */\n  private readonly _calculator: () => T;\n  /**\n   * @internal\n   */\n  private readonly _dependencies: Array<KTReactiveLike<any>>;\n  /**\n   * @internal\n   */\n  private readonly _handler: () => void;\n  /**\n   * @internal\n   */\n  protected readonly _handlerKeys: string[];\n  private _disposed = false;\n\n  private _recalculate(forced: boolean = false): this {\n    const newValue = this._calculator();\n    const oldValue = this._value;\n    if (!$is(oldValue, newValue) || forced) {\n      this._value = newValue;\n      this._emit(newValue, oldValue);\n    }\n    return this;\n  }\n\n  constructor(calculator: () => T, dependencies: Array<KTReactiveLike<any>>) {\n    super(calculator());\n    this._calculator = calculator;\n    this._dependencies = dependencies;\n    this._handler = () => this._recalculate();\n    this._handlerKeys = dependencies.map(() => nextHandlerId(this.kid));\n\n    const uniqueSources = new Set<KTReactive<any>>();\n    for (let i = 0; i < dependencies.length; i++) {\n      const dep = dependencies[i];\n      if (isSubReactive(dep)) {\n        if (uniqueSources.has(dep.source)) {\n          continue;\n        } else {\n          uniqueSources.add(dep.source);\n        }\n      }\n      dep.addOnChange(this._handler, this._handlerKeys[i]);\n    }\n    uniqueSources.clear();\n  }\n\n  notify(): this {\n    return this._recalculate(true);\n  }\n\n  dispose(): void {\n    if (this._disposed) {\n      return;\n    }\n\n    this._disposed = true;\n    for (let i = 0; i < this._dependencies.length; i++) {\n      this._dependencies[i].removeOnChange(this._handlerKeys[i]);\n    }\n\n    this._dependencies.length = 0;\n    this._changeHandlers.clear();\n  }\n}\n\nKTReactive.prototype.map = function <U>(\n  this: KTReactive<unknown>,\n  c: (value: unknown) => U,\n  dep?: Array<KTReactive<any>>,\n) {\n  return new KTComputed(() => c(this.value), dep ? [this, ...dep] : [this]);\n};\n\nKTReactive.prototype.is = function (this: KTReactive<unknown>, o: unknown) {\n  if (isReactive(o)) {\n    return new KTSubComputed(this, (v) => $is(v, o.value), o);\n  } else {\n    return new KTSubComputed(this, (v) => $is(v, o));\n  }\n};\n\nKTReactive.prototype.match = function (this: KTReactive<object>, o: object) {\n  if (isReactive(o)) {\n    return new KTSubComputed(this, (v) => $deepMatch(v, o.value), o);\n  } else {\n    return new KTSubComputed(this, (v) => $deepMatch(v, o));\n  }\n};\n\nKTReactive.prototype.get = function <T>(this: KTReactive<T>, ...keys: Array<string | number>) {\n  if (keys.length === 0) {\n    $throw('At least one key is required to get a sub-computed.');\n  }\n  return new KTSubComputed(this, $createSubGetter(keys));\n};\n\n/**\n * Create a computed value that automatically updates when its dependencies change.\n * @param calculator synchronous function that calculates the value of the computed. It should not have side effects.\n * @param dependencies an array of reactive dependencies that the computed value depends on. The computed value will automatically update when any of these dependencies change.\n */\nexport const computed = <T>(calculator: () => T, dependencies: Array<KTReactiveLike<any>>): KTComputed<T> =>\n  new KTComputed(calculator, dependencies);\n\n// # SubComputed\n\nexport class KTSubComputed<T> extends KTSubReactive<T> {\n  readonly ktype = KTReactiveType.SubComputed;\n\n  /**\n   * Used for `reactive.is` and `reactive.match` to track the single dependency.\n   * @internal\n   */\n  private readonly _dependency?: KTReactive<any>;\n\n  constructor(source: KTReactive<any>, getter: (sv: KTReactive<any>['value']) => T, dependency?: KTReactive<any>) {\n    super(source, getter);\n    this._dependency = dependency;\n\n    if (dependency) {\n      this._handlerKeys.push(nextHandlerId(this.kid));\n      dependency.addOnChange(this._handler, this._handlerKeys[1]);\n    }\n  }\n\n  get value() {\n    return this._value;\n  }\n\n  dispose(): void {\n    this._handlerKeys.forEach((key) => this.source.removeOnChange(key));\n    this._dependency?.removeOnChange(this._handlerKeys[1]);\n  }\n}\n\nexport type KTComputedLike<T> = KTComputed<T> | KTSubComputed<T>;\n","import { $emptyFn } from '@ktjs/shared';\nimport type { KTReactiveLike } from './reactive.js';\nimport { isSubReactive } from './common.js';\n\ninterface KTEffectOptions {\n  lazy: boolean;\n  onCleanup: () => void;\n  debugName: string;\n}\n\n/**\n * Register a reactive effect with options.\n * @param effectFn The effect function to run when dependencies change\n * @param reactives The reactive dependencies\n * @param options Effect options: lazy, onCleanup, debugName\n * @returns stop function to remove all listeners\n */\nexport function effect(\n  effectFn: () => void,\n  reactives: Array<KTReactiveLike<any>>,\n  options?: Partial<KTEffectOptions>,\n) {\n  const { lazy = false, onCleanup = $emptyFn, debugName = '' } = Object(options);\n  const listenerKeys: Array<string | number> = [];\n\n  let active = true;\n\n  const run = () => {\n    if (!active) {\n      return;\n    }\n\n    // cleanup before rerun\n    onCleanup();\n\n    try {\n      effectFn();\n    } catch (err) {\n      $debug('effect error:', debugName, err);\n    }\n  };\n\n  // subscribe to dependencies\n  for (let i = 0; i < reactives.length; i++) {\n    listenerKeys[i] = i;\n    const r = reactives[i];\n    if (isSubReactive(r)) {\n      // @ts-expect-error _changeHandlers is protected\n      r.source._changeHandlers.set(listenerKeys[i], run);\n    } else {\n      r.addOnChange(run, effectFn);\n    }\n  }\n\n  // auto run unless lazy\n  if (!lazy) {\n    run();\n  }\n\n  // stop function\n  return () => {\n    if (!active) {\n      return;\n    }\n    active = false;\n\n    for (let i = 0; i < reactives.length; i++) {\n      reactives[i].removeOnChange(effectFn);\n    }\n\n    // final cleanup\n    onCleanup();\n  };\n}\n","import type { KTReactive, KTReactiveLike } from './reactive.js';\nimport { isKT } from './common.js';\nimport { ref } from './ref.js';\n\n/**\n * Ensure a value is reactive. If it's already `KTReactiveLike`, return it as is; otherwise, wrap it in a `ref`.\n */\nexport const toReactive = <T>(o: T | KTReactiveLike<T>): KTReactiveLike<T> =>\n  isKT(o) ? o : (ref(o as T) as KTReactive<T>);\n\n/**\n * Extracts the value from a KTReactive, or returns the value directly if it's not reactive.\n */\nexport const dereactive = <T>(value: T | KTReactiveLike<T>): T => (isKT<T>(value) ? value.value : value);\n\nexport type { KTRef, KTSubRef, KTRefLike } from './ref.js';\nexport { ref, assertModel } from './ref.js';\nexport type { KTComputed, KTSubComputed, KTComputedLike } from './computed.js';\nexport { computed } from './computed.js';\nexport { KTReactiveType } from './reactive.js';\nexport type * from './reactive.js';\n\nexport {\n  isKT,\n  isReactiveLike,\n  isRef,\n  isSubRef,\n  isRefLike,\n  isComputed,\n  isSubComputed,\n  isComputedLike,\n  isReactive,\n} from './common.js';\nexport { effect } from './effect.js';\nexport type * from './types.js';\n","import type { KTReactiveLike } from '../reactable/reactive.js';\nimport type { KTRawContent } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\nimport { $initRef, type KTRefLike } from '../reactable/ref.js';\n\nimport { $forEach, $isArray } from '@ktjs/shared';\nimport { isKT, toReactive } from '../reactable/index.js';\nimport { $addNodeCleanup, AnchorType, KTAnchor } from './anchor.js';\n\nexport class FragmentAnchor extends KTAnchor<Node> {\n  readonly type = AnchorType.Fragment;\n\n  constructor() {\n    super(AnchorType.Fragment);\n  }\n\n  /**\n   * Remove elements in the list\n   */\n  removeElements() {\n    const list = this.list.slice();\n    this.list.length = 0;\n    for (let i = 0; i < list.length; i++) {\n      const node = list[i] as ChildNode;\n      if (node.parentNode) {\n        node.remove();\n      }\n    }\n  }\n}\n\nexport interface FragmentProps<T extends Node = Node> {\n  /** Array of child elements, supports reactive arrays */\n  children: T[] | KTReactiveLike<T[]>;\n\n  /** element key function for optimization (future enhancement) */\n  key?: (element: T, index: number, array: T[]) => any;\n\n  /** ref to get the anchor node */\n  ref?: KTRefLike<JSX.Element>;\n}\n\n/**\n * Fragment - Container component for managing arrays of child elements\n *\n * Features:\n * 1. Returns a comment anchor node, child elements are inserted after the anchor\n * 2. Supports reactive arrays, automatically updates DOM when array changes\n * 3. Basic version uses simple replacement algorithm (remove all old elements, insert all new elements)\n * 4. Future enhancement: key-based optimization\n *\n * Usage example:\n * ```tsx\n * const children = ref([<div>A</div>, <div>B</div>]);\n * const fragment = <Fragment children={children} />;\n * document.body.appendChild(fragment);\n *\n * // Automatic update\n * children.value = [<div>C</div>, <div>D</div>];\n * ```\n */\nexport function Fragment<T extends Node = Node>(props: FragmentProps<T>): JSX.Element & FragmentAnchor {\n  const anchor = new FragmentAnchor();\n  const elements = anchor.list as T[];\n  const childrenRef = toReactive(props.children);\n\n  const redraw = () => {\n    const newElements = childrenRef.value;\n    const parent = anchor.parentNode;\n\n    if (!parent) {\n      elements.length = 0;\n      for (let i = 0; i < newElements.length; i++) {\n        elements.push(newElements[i]);\n      }\n      return;\n    }\n\n    anchor.removeElements();\n    elements.length = 0;\n\n    const fragment = document.createDocumentFragment();\n    for (let i = 0; i < newElements.length; i++) {\n      const element = newElements[i];\n      elements.push(element);\n      fragment.appendChild(element);\n    }\n\n    parent.insertBefore(fragment, anchor.nextSibling);\n  };\n\n  childrenRef.addOnChange(redraw, redraw);\n  $addNodeCleanup(anchor, () => childrenRef.removeOnChange(redraw));\n  anchor.mountCallback = redraw;\n  redraw();\n\n  $initRef(props as { ref?: KTRefLike<Node> }, anchor);\n\n  return anchor as unknown as JSX.Element & FragmentAnchor;\n}\n\n/**\n * Convert KTRawContent to HTMLElement array\n */\nexport function convertChildrenToElements(children: KTRawContent): Element[] {\n  const elements: Element[] = [];\n\n  const processChild = (child: any): void => {\n    if (child === undefined || child === null || child === false || child === true) {\n      // Ignore null, undefined, false, true\n      return;\n    }\n\n    if ($isArray(child)) {\n      // Recursively process array\n      $forEach(child, processChild);\n      return;\n    }\n\n    if (typeof child === 'string' || typeof child === 'number') {\n      const span = document.createElement('span');\n      span.textContent = String(child);\n      elements.push(span);\n      return;\n    }\n\n    if (child instanceof Element) {\n      elements.push(child);\n      return;\n    }\n\n    if (isKT(child)) {\n      processChild(child.value);\n      return;\n    }\n\n    $warn('Fragment: unsupported child type', child);\n    if (process.env.IS_DEV) {\n      throw new Error(`Fragment: unsupported child type`);\n    }\n  };\n\n  processChild(children);\n  return elements;\n}\n","import type { JSXTag } from '@ktjs/shared';\nimport type { KTAttribute } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\nimport { h } from '../h/index';\n\nexport const jsxh = (tag: JSXTag, props: KTAttribute): JSX.Element =>\n  (typeof tag === 'function' ? tag(props) : h(tag, props, props.children)) as JSX.Element;\n\nexport const placeholder = (data: string): JSX.Element => document.createComment(data) as unknown as JSX.Element;\n","import type { JSXTag, MathMLTag, SVGTag } from '@ktjs/shared';\nimport type { KTAttribute, KTRawContent } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\n\nimport { h, mathml as _mathml, svg as _svg } from '../h/index.js';\nimport { $initRef } from '../reactable/ref.js';\nimport { isComputedLike } from '../reactable/common.js';\n\nimport { convertChildrenToElements, Fragment as FragmentArray } from './fragment.js';\nimport { jsxh, placeholder } from './common.js';\n\nfunction create(\n  creator: (tag: any, props: KTAttribute, content?: KTRawContent) => JSX.Element,\n  tag: any,\n  props: KTAttribute,\n) {\n  if (props.ref && isComputedLike(props.ref)) {\n    $throw('Cannot assign a computed value to an element.');\n  }\n  const el = creator(tag, props, props.children);\n  $initRef(props, el);\n  return el;\n}\n\nexport const jsx = (tag: JSXTag, props: KTAttribute): JSX.Element => create(jsxh, tag, props);\nexport const svg = (tag: SVGTag, props: KTAttribute): JSX.Element => create(_svg, tag, props);\nexport const mathml = (tag: MathMLTag, props: KTAttribute): JSX.Element => create(_mathml, tag, props);\nexport { svg as svgRuntime, mathml as mathmlRuntime };\n\n/**\n * Fragment support - returns an array of children\n * Enhanced Fragment component that manages arrays of elements\n */\nexport function Fragment(props: { children?: KTRawContent }): JSX.Element {\n  const { children } = props ?? {};\n\n  if (!children) {\n    return placeholder('kt-fragment-empty');\n  }\n\n  const elements = convertChildrenToElements(children);\n\n  return FragmentArray({ children: elements });\n}\n\n/**\n * JSX Development runtime - same as jsx but with additional dev checks\n */\nexport const jsxDEV: typeof jsx = (...args) => {\n  // console.log('JSX DEV called:', ...args);\n  // console.log('children', (args[1] as any)?.children);\n  return jsx(...args);\n};\n\n/**\n * JSX runtime for React 17+ automatic runtime\n * This is called when using jsx: \"react-jsx\" or \"react-jsxdev\"\n */\nexport const jsxs = jsx;\n\n// Export h as the classic JSX factory for backward compatibility\nexport { h, h as createElement };\n","import { $isThenable } from '@ktjs/shared';\nimport type { KTComponent, KTRawContent } from '../types/h.js';\nimport type { JSX } from '../types/jsx.js';\nimport type { KTRef } from '../reactable/ref.js';\nimport { $mountFragmentAnchors } from './anchor.js';\n\n/**\n * Extract component props type (excluding ref and children)\n */\ntype ExtractComponentProps<T> = T extends (props: infer P) => any ? Omit<P, 'ref' | 'children'> : {};\n\nexport function KTAsync<T extends KTComponent>(\n  props: {\n    ref?: KTRef<JSX.Element>;\n    skeleton?: JSX.Element;\n    component: T;\n    children?: KTRawContent;\n  } & ExtractComponentProps<T>,\n): JSX.Element {\n  const raw = props.component(props);\n  let comp: JSX.Element =\n    props.skeleton ?? (document.createComment('ktjs-suspense-placeholder') as unknown as JSX.Element);\n\n  if ($isThenable(raw)) {\n    raw.then((resolved) => {\n      comp.replaceWith(resolved);\n      $mountFragmentAnchors(resolved);\n    });\n  } else {\n    comp = raw as JSX.Element;\n  }\n\n  return comp;\n}\n","import type { JSX } from '../types/jsx.js';\nimport type { KTRefLike } from '../reactable/ref.js';\nimport type { KTReactiveLike } from '../reactable/reactive.js';\n\nimport { $identity } from '@ktjs/shared';\nimport { toReactive } from '../reactable/index.js';\nimport { $initRef } from '../reactable/ref.js';\nimport { $addNodeCleanup } from './anchor.js';\nimport { AnchorType, KTAnchor } from './anchor.js';\n\nexport class KTForAnchor extends KTAnchor<JSX.Element> {\n  readonly type = AnchorType.For;\n\n  constructor() {\n    super(AnchorType.For);\n  }\n}\n\nexport type KTForElement = JSX.Element & KTForAnchor;\n\nexport interface KTForProps<T> {\n  ref?: KTRefLike<KTForElement>;\n  list: T[] | KTReactiveLike<T[]>;\n  key?: (item: T, index: number, array: T[]) => any;\n  map?: (item: T, index: number, array: T[]) => JSX.Element;\n}\n\nconst setForNodeMap = (nodeMap: Map<any, JSX.Element>, key: any, node: JSX.Element, index: number) => {\n  if (nodeMap.has(key)) {\n    $error(`[KTFor] Duplicate key detected at index ${index}. Later items override earlier ones. key=${String(key)}`);\n  }\n  nodeMap.set(key, node);\n};\n\n// TASK 对于template标签的for和if，会编译为fragment，可特殊处理，让它们保持原样\n/**\n * KTFor - List rendering component with key-based optimization\n * Returns a Comment anchor node with rendered elements in anchor.list\n */\nexport function KTFor<T>(props: KTForProps<T>): KTForElement {\n  const redraw = () => {\n    const newList = listRef.value;\n    const parent = anchor.parentNode;\n\n    if (!parent) {\n      anchor.list.length = 0;\n      nodeMap.clear();\n      for (let index = 0; index < newList.length; index++) {\n        const item = newList[index];\n        const itemKey = currentKey(item, index, newList);\n        const node = currentMap(item, index, newList);\n        setForNodeMap(nodeMap, itemKey, node, index);\n        anchor.list.push(node);\n      }\n      return anchor;\n    }\n\n    const oldLength = anchor.list.length;\n    const newLength = newList.length;\n\n    if (newLength === 0) {\n      nodeMap.forEach((node) => node.remove());\n      nodeMap.clear();\n      anchor.list.length = 0;\n      return anchor;\n    }\n\n    if (oldLength === 0) {\n      anchor.list.length = 0;\n      nodeMap.clear();\n      const fragment = document.createDocumentFragment();\n      for (let i = 0; i < newLength; i++) {\n        const item = newList[i];\n        const itemKey = currentKey(item, i, newList);\n        const node = currentMap(item, i, newList);\n        setForNodeMap(nodeMap, itemKey, node, i);\n        anchor.list.push(node);\n        fragment.appendChild(node);\n      }\n      parent.insertBefore(fragment, anchor.nextSibling);\n      return anchor;\n    }\n\n    const newKeyToNewIndex = new Map<any, number>();\n    const newElements: JSX.Element[] = new Array(newLength);\n    for (let i = 0; i < newLength; i++) {\n      const item = newList[i];\n      const itemKey = currentKey(item, i, newList);\n      newKeyToNewIndex.set(itemKey, i);\n      newElements[i] = nodeMap.has(itemKey) ? nodeMap.get(itemKey)! : currentMap(item, i, newList);\n    }\n\n    const toRemove: JSX.Element[] = [];\n    nodeMap.forEach((node, key) => {\n      if (!newKeyToNewIndex.has(key)) {\n        toRemove.push(node);\n      }\n    });\n    for (let i = 0; i < toRemove.length; i++) {\n      toRemove[i].remove();\n    }\n\n    let currentNode = anchor.nextSibling;\n    for (let i = 0; i < newLength; i++) {\n      const node = newElements[i];\n      if (currentNode !== node) {\n        parent.insertBefore(node, currentNode);\n      } else {\n        currentNode = currentNode.nextSibling;\n      }\n    }\n\n    nodeMap.clear();\n    anchor.list.length = 0;\n    for (let i = 0; i < newLength; i++) {\n      const itemKey = currentKey(newList[i], i, newList);\n      const node = newElements[i];\n      setForNodeMap(nodeMap, itemKey, node, i);\n      anchor.list.push(node);\n    }\n    return anchor;\n  };\n\n  const currentKey: NonNullable<KTForProps<T>['key']> = props.key ?? ((item: T) => item);\n  const currentMap: NonNullable<KTForProps<T>['map']> =\n    props.map ?? ((item: T) => $identity(item) as unknown as JSX.Element);\n  const listRef = toReactive(props.list);\n  const anchor = new KTForAnchor() as KTForElement;\n  const nodeMap = new Map<any, JSX.Element>();\n\n  for (let index = 0; index < listRef.value.length; index++) {\n    const item = listRef.value[index];\n    const itemKey = currentKey(item, index, listRef.value);\n    const node = currentMap(item, index, listRef.value);\n    setForNodeMap(nodeMap, itemKey, node, index);\n    anchor.list.push(node);\n  }\n\n  listRef.addOnChange(redraw, redraw);\n  $addNodeCleanup(anchor, () => listRef.removeOnChange(redraw));\n  anchor.mountCallback = redraw;\n  $initRef(props, anchor);\n\n  return anchor;\n}\n","import type { JSXTag } from '@ktjs/shared';\nimport type { KTAttribute } from '../types/h.js';\nimport type { KTReactiveLike } from '../reactable/reactive.js';\n\nimport { isKT } from '../reactable/index.js';\nimport { $addNodeCleanup, $mountFragmentAnchors, $removeNodeCleanup } from './anchor.js';\nimport { jsxh, placeholder } from './common.js';\n\nexport function KTConditional(\n  condition: any | KTReactiveLike<any>,\n  tagIf: JSXTag,\n  propsIf: KTAttribute,\n  tagElse?: JSXTag,\n  propsElse?: KTAttribute,\n) {\n  if (!isKT(condition)) {\n    return condition ? jsxh(tagIf, propsIf) : tagElse ? jsxh(tagElse, propsElse!) : placeholder('kt-conditional');\n  }\n\n  if (tagElse) {\n    let current = condition.value ? jsxh(tagIf, propsIf) : jsxh(tagElse!, propsElse!);\n    const cleanup = () => condition.removeOnChange(onChange);\n    const onChange = (newValue: any) => {\n      const old = current;\n      current = newValue ? jsxh(tagIf, propsIf) : jsxh(tagElse!, propsElse!);\n      $removeNodeCleanup(old, cleanup);\n      $addNodeCleanup(current, cleanup);\n      old.replaceWith(current);\n      $mountFragmentAnchors(current);\n    };\n    condition.addOnChange(onChange, onChange);\n    $addNodeCleanup(current, cleanup);\n    return current;\n  } else {\n    const dummy = placeholder('kt-conditional') as HTMLElement;\n    let current = condition.value ? jsxh(tagIf, propsIf) : dummy;\n    const cleanup = () => condition.removeOnChange(onChange);\n    const onChange = (newValue: any) => {\n      const old = current;\n      current = newValue ? jsxh(tagIf, propsIf) : dummy;\n      $removeNodeCleanup(old, cleanup);\n      $addNodeCleanup(current, cleanup);\n      old.replaceWith(current);\n      $mountFragmentAnchors(current);\n    };\n    condition.addOnChange(onChange, onChange);\n    $addNodeCleanup(current, cleanup);\n    return current;\n  }\n}\n"],"names":["isKT","obj","kid","isReactiveLike","ktype","isRef","isSubRef","isRefLike","isComputed","isSubComputed","isComputedLike","isReactive","isSubReactive","$createSubGetter","path","length","s","r","i","handlerId","nextHandlerId","KTReactiveLike","nextKid","KTReactive","_value","_changeHandlers","Map","constructor","value","super","this","_newValue","console","warn","_emit","newValue","oldValue","forEach","handler","addOnChange","key","has","Error","$stringify","set","removeOnChange","delete","clearOnChange","clear","notify","map","calculator","dependencies","is","o","match","get","_keys","KTSubReactive","source","_getter","_handler","_handlerKeys","getter","push","dispose","KTAnchor","Comment","isKTAnchor","list","mountCallback","data","$ensureAnchorObserver","mount","parent","parentNode","appendChild","CANNOT_MOUNT","document","Node","CANNOT_OBSERVE","MutationObserver","COMMENT_FILTER","NodeFilter","SHOW_COMMENT","nodeToCleanups","WeakMap","anchorObserver","$cleanupRemovedNode","node","nodeType","children","Array","from","childNodes","anchor","slice","listNode","remove","$runNodeCleanups","body","records","disconnect","undefined","addedNodes","j","$mountFragmentAnchors","removedNodes","observe","childList","subtree","$mountIfFragmentAnchor","cleanups","error","$addNodeCleanup","cleanup","$removeNodeCleanup","index","indexOf","splice","nodeObj","walker","createTreeWalker","current","nextNode","booleanHandler","element","setAttribute","valueHandler","handlers","checked","selected","valueAsDate","valueAsNumber","defaultValue","defaultChecked","defaultSelected","disabled","readOnly","multiple","required","autofocus","open","controls","autoplay","loop","muted","defer","async","hidden","_key","defaultHandler","setElementStyle","style","cssText","addReactiveCleanup","reactive","applyAttr","attr","classValue","class","className","v","html","innerHTML","startsWith","eventName","addEventListener","removeEventListener","attrIsObject","assureNode","$isNode","createTextNode","apdSingle","c","onChange","newNode","oldNode","replaceWith","type","apd","$isThenable","then","$isArray","ci","comment","createComment","awaited","awaitedNode","applyContent","content","applyKModel","valueRef","tagName","onValueChange","Boolean","onInput","h","tag","createElement","svg","createElementNS","mathml","reactiveToOldValue","scheduled","$markMutation","Promise","resolve","KTRef","$is","draft","subref","keys","KTSubRef","$createSubSetter","ref","assertModel","props","kmodel","$refSetter","$initRef","$emptyFn","_setter","setter","KTComputed","_calculator","_dependencies","_disposed","_recalculate","forced","uniqueSources","Set","dep","add","prototype","KTSubComputed","$deepMatch","computed","_dependency","dependency","effect","effectFn","reactives","options","lazy","onCleanup","debugName","Object","listenerKeys","active","run","err","debug","toReactive","dereactive","FragmentAnchor","removeElements","jsxh","placeholder","create","creator","el","jsx","_svg","_mathml","Fragment","elements","processChild","child","$forEach","span","textContent","String","Element","convertChildrenToElements","childrenRef","redraw","newElements","fragment","createDocumentFragment","insertBefore","nextSibling","FragmentArray","jsxDEV","args","jsxs","KTAsync","raw","component","comp","skeleton","resolved","KTForAnchor","setForNodeMap","nodeMap","KTFor","newList","listRef","item","itemKey","currentKey","currentMap","oldLength","newLength","newKeyToNewIndex","toRemove","currentNode","$identity","KTConditional","condition","tagIf","propsIf","tagElse","propsElse","old","dummy"],"mappings":";;AAKM,SAAUA,KAAcC;IAC5B,OAA2B,mBAAbA,KAAKC;AACrB;;AAEM,SAAUC,eAAwBF;IACtC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAEM,SAAUC,MAAeJ;IAC7B,OAA0B,mBAAfA,KAAKG,SACE,MAATH,IAAIG;AAIf;;AAEM,SAAUE,SAAkBL;IAChC,OAA0B,mBAAfA,KAAKG,SACE,MAATH,IAAIG;AAIf;;AAEM,SAAUG,UAAmBN;IACjC,OAA0B,mBAAfA,KAAKG,gBACNH,IAAIG;AAIhB;;AAEM,SAAUI,WAAoBP;IAClC,OAA0B,mBAAfA,KAAKG,SACE,MAATH,IAAIG;AAIf;;AAEM,SAAUK,cAAuBR;IACrC,OAA0B,mBAAfA,KAAKG,SACE,OAATH,IAAIG;AAIf;;AAEM,SAAUM,eAAwBT;IACtC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAEM,SAAUO,WAAoBV;IAClC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAEM,SAAUQ,cAAuBX;IACrC,OAA0B,mBAAfA,KAAKG,iBACNH,IAAIG;AAIhB;;AAUO,MAAMS,mBAAoBC;IAE/B,QAAQA,KAAKC;MAIX,KAAK;QACH,OAAQC,KAAMA,EAAEF,KAAK;;MACvB,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK;;MAChC,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK;;MACzC,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;;MAClD,KAAK;QACH,OAAQE,KAAMA,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;;MAC3D;QACE,OAAQE;YACN,IAAIC,IAAID,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;YACnD,KAAK,IAAII,IAAI,GAAGA,IAAIJ,KAAKC,QAAQG,KAC/BD,IAAIA,EAAEH,KAAKI;YAEb,OAAOD;;;;;AC5Ff,IAAIf,MAAM,GACNiB,YAAY;;AAET,MACMC,gBAAiBlB,OAAgB,eAAeA,OAAOiB;;MAE9CE;IACXnB,IAJY,OAAMA,MAIZoB;;;AAYX,MAAgBC,mBAAsBF;IAIhCG;IAKSC,gBAAkB,IAAIC;IAEzC,WAAAC,CAAYC;QACVC,SACAC,KAAKN,SAASI;AAChB;IAEA,SAAIA;QACF,OAAOE,KAAKN;AACd;IAEA,SAAII,CAAMG;QACRC,QAAAC,KAAA,gBAAM;AACR;IAKU,KAAAC,CAAMC,UAAaC;QAE3B,OADAN,KAAKL,gBAAgBY,QAASC,WAAYA,QAAQH,UAAUC,YACrDN;AACT;IAEA,WAAAS,CAAYD,SAA2BE,MAAWpB,cAAcU,KAAK5B;QACnE,IAAI4B,KAAKL,gBAAgBgB,IAAID,MAC3B,MAAA,IAAAE,MAAA,6DAAsDC,WAAWH;QAGnE,OADAV,KAAKL,gBAAgBmB,IAAIJ,KAAKF,UACvBR;AACT;IAEA,cAAAe,CAAeL;QAEb,OADAV,KAAKL,gBAAgBqB,OAAON,MACrBV;AACT;IAEA,aAAAiB;QAEE,OADAjB,KAAKL,gBAAgBuB,SACdlB;AACT;IAEA,MAAAmB;QACE,OAAOnB,KAAKI,MAAMJ,KAAKN,QAAQM,KAAKN;AACtC;IAQA,GAAA0B,CAAOC,YAA6BC;QAClC,OAAO;AACT;IAOA,EAAAC,CAAGC;QACD,OAAO;AACT;IAOA,KAAAC,CAAMD;QACJ,OAAO;AACT;IAoDA,GAAAE,IAAOC;QAEL,OAAO;AACT;;;AAGI,MAAgBC,sBAAyBrC;IACpCsC;IAKCnC;IAKSoC;IAKAC;IAKAC;IAEnB,WAAAnC,CAAYgC,QAAyBI;QACnClC,SACAC,KAAK6B,SAASA,QACd7B,KAAK8B,UAAUG,QACfjC,KAAKgC,eAAe,IAGpBhC,KAAKN,SAASM,KAAK8B,QAAQD,OAAOnC;QAElCM,KAAK+B,WAAW,MAAO/B,KAAKN,SAASuC,OAAOJ,OAAOnC,SAEnDM,KAAKgC,aAAaE,KAAK5C,cAAcU,KAAK5B;QAC1CyD,OAAOpB,YAAYT,KAAK+B,UAAU/B,KAAKgC,aAAa;AACtD;IAEA,WAAAvB,CAAYD,SAA2BE,MAAWpB,cAAcU,KAAK5B;QAGnE,OAFA4B,KAAKgC,aAAaE,KAAKxB,MACvBV,KAAK6B,OAAOpB,YAAY,CAACJ,UAAUC,aAAaE,QAAQR,KAAK8B,QAAQzB,WAAWL,KAAK8B,QAAQxB,YAAYI;QAClGV;AACT;IAEA,cAAAe,CAAeL;QAEb,OADAV,KAAK6B,OAAOd,eAAeL,MACpBV;AACT;IAEA,OAAAmC;QACEnC,KAAKgC,aAAazB,QAASG,OAAQV,KAAK6B,OAAOd,eAAeL;AAChE;;;AC9NI,MAAgB0B,iBAAwCC;IACnDC,YAAmB;IACnBC,KAAY;IAErBC;IAEA,WAAA3C,CAAY4C;QACV1C,MAAM0C,OACNC;AACF;IAEA,KAAAC,CAAMC;QACAA,UAAU5C,KAAK6C,eAAeD,UAChCA,OAAOE,YAAY9C,OAEjBA,KAAK6C,cACP7C,KAAKwC;AAET;;;AASF,MAAMO,eAAmC,sBAAbC,YAA4C,sBAATC,MACzDC,iBAAiBH,gBAA4C,sBAArBI,kBACxCC,iBAAuC,sBAAfC,aAA6B,MAAOA,WAAWC,cAGvEC,iBAAiB,IAAIC;;AAC3B,IAAIC;;AAEJ,MAAMC,sBAAuBC;IAC3B,IANmB,MAMfA,KAAKC,YALoB,OAKSD,KAAKC,UAAqC;QAC9E,MAAMC,WAAWC,MAAMC,KAAKJ,KAAKK;QACjC,KAAK,IAAI5E,IAAI,GAAGA,IAAIyE,SAAS5E,QAAQG,KACnCsE,oBAAoBG,SAASzE;AAEjC;IAEA,MAAM6E,SAASN;IACf,KAA0B,MAAtBM,OAAO3B,YAAqB;QAC9B,MAAMC,OAAO0B,OAAO1B,KAAK2B;QACzBD,OAAO1B,KAAKtD,SAAS;QACrB,KAAK,IAAIG,IAAI,GAAGA,IAAImD,KAAKtD,QAAQG,KAAK;YACpC,MAAM+E,WAAW5B,KAAKnD;YAClB+E,SAAStB,cACXsB,SAASC,UAEXV,oBAAoBS;AACtB;AACF;IAEAE,iBAAiBV;GAGbjB,wBAAwB;IACxBQ,kBAAkBO,mBAAmBT,SAASsB,SAIlDb,iBAAiB,IAAIN,iBAAkBoB;QACrC,IAAwB,sBAAbvB,UAGT,OAFAS,gBAAgBe,oBAChBf,sBAAiBgB;QAInB,KAAK,IAAIrF,IAAI,GAAGA,IAAImF,QAAQtF,QAAQG,KAAK;YACvC,MAAMsF,aAAaH,QAAQnF,GAAGsF;YAC9B,KAAK,IAAIC,IAAI,GAAGA,IAAID,WAAWzF,QAAQ0F,KACrCC,sBAAsBF,WAAWC;YAGnC,MAAME,eAAeN,QAAQnF,GAAGyF;YAChC,KAAK,IAAIF,IAAI,GAAGA,IAAIE,aAAa5F,QAAQ0F,KACvCjB,oBAAoBmB,aAAaF;AAErC;QAEFlB,eAAeqB,QAAQ9B,SAASsB,MAAM;QAAES,YAAW;QAAMC,UAAS;;GAG9DC,yBAA0BtB;IAC9B,MAAMM,SAASN;KACW,MAAtBM,OAAO3B,cAA+C,qBAAjB2B,OAAOtB,SAC9CsB,OAAOtB;GAIL0B,mBAAoBV;IACxB,MAAMuB,WAAW3B,eAAe7B,IAAIiC;IACpC,IAAKuB,UAAL;QAIA3B,eAAevC,OAAO2C;QACtB,KAAK,IAAIvE,IAAI8F,SAASjG,SAAS,GAAGG,KAAK,GAAGA,KACxC;YACE8F,SAAS9F;AACX,UAAE,OAAO+F;YACPjF,QAAAiF,MAAA,iBAAO,kBAAkBA;AAC3B;AARF;GAYWC,kBAAkB,CAACzB,MAAY0B;IAC1C3C;IACA,MAAMwC,WAAW3B,eAAe7B,IAAIiC;IAMpC,OALIuB,WACFA,SAAShD,KAAKmD,WAEd9B,eAAezC,IAAI6C,MAAM,EAAC0B;IAErBA;GAGIC,qBAAqB,CAAC3B,MAAY0B;IAC7C,MAAMH,WAAW3B,eAAe7B,IAAIiC;IACpC,KAAKuB,UACH;IAGF,MAAMK,QAAQL,SAASM,QAAQH;KACjB,MAAVE,UAIJL,SAASO,OAAOF,OAAO,IACC,MAApBL,SAASjG,UACXsE,eAAevC,OAAO2C;GAIbiB,wBAAyBjB;IACpC,IAAIZ,gBAAoC,sBAAbC,aAA6BW,QAA0C,mBAA1BA,KAAaC,UACnF;IAGF,MAAM8B,UAAU/B;IAGhB,IAFAsB,uBAAuBS,UAjHJ,MAmHfA,QAAQ9B,YAlHiB,OAkHY8B,QAAQ9B,UAC/C;IAGF,MAAM+B,SAAS3C,SAAS4C,iBAAiBF,SAAStC;IAClD,IAAIyC,UAAUF,OAAOG;IACrB,MAAOD,WACLZ,uBAAuBY,UACvBA,UAAUF,OAAOG;GC9JfC,iBAAiB,CAACC,SAAmDtF,KAAaZ;IAClFY,OAAOsF,UACRA,QAAgBtF,SAASZ,QAE1BkG,QAAQC,aAAavF,KAAKZ;GAIxBoG,eAAe,CAACF,SAAmDtF,KAAaZ;IAChFY,OAAOsF,UACRA,QAAgBtF,OAAOZ,QAExBkG,QAAQC,aAAavF,KAAKZ;GAKjBqG,WAGT;IACFC,SAASL;IACTM,UAAUN;IACVjG,OAAOoG;IACPI,aAAaJ;IACbK,eAAeL;IACfM,cAAcN;IACdO,gBAAgBV;IAChBW,iBAAiBX;IACjBY,UAAUZ;IACVa,UAAUb;IACVc,UAAUd;IACVe,UAAUf;IACVgB,WAAWhB;IACXiB,MAAMjB;IACNkB,UAAUlB;IACVmB,UAAUnB;IACVoB,MAAMpB;IACNqB,OAAOrB;IACPsB,OAAOtB;IACPuB,OAAOvB;IACPwB,QAAQ,CAACvB,SAASwB,MAAM1H,UAAYkG,QAAwBuB,WAAWzH;GClCnE2H,iBAAiB,CAACzB,SAAmDtF,KAAaZ,UACtFkG,QAAQC,aAAavF,KAAKZ,QAEtB4H,kBAAkB,CACtB1B,SACA2B;IAEA,IAAqB,mBAAVA,OAKX,KAAK,MAAMjH,OAAOiH,OACf3B,QAAgB2B,MAAMjH,OAAciH,MAAMjH,WAL1CsF,QAAwB2B,MAAMC,UAAUD;GASvCE,qBAAqB,CACzB7B,SACA8B,UAIAtH;IAEAsH,SAASrH,YAAYD,SAASA,UAC9B4E,gBAAgBY,SAAS,MAAM8B,SAAS/G,eAAeP;;;AAsFnD,SAAUuH,UAAU/B,SAAmDgC;IAC3E,IAAKA,MAAL;QAGA,IAAoB,mBAATA,QAA8B,SAATA,MAG9B,MAAA,IAAApH,MAAA;SA1FJ,SAAsBoF,SAAmDgC;YACvE,MAAMC,aAAaD,KAAKE,SAASF,KAAKG;iBACnB1D,MAAfwD,eACE/J,KAAa+J,eACfjC,QAAQC,aAAa,SAASgC,WAAWnI;YACzC+H,mBAAmB7B,SAASiC,YAAaG,KAAMpC,QAAQC,aAAa,SAASmC,OAE7EpC,QAAQC,aAAa,SAASgC;YAIlC,MAAMN,QAAQK,KAAKL;YAenB,IAdIA,UACmB,mBAAVA,QACT3B,QAAQC,aAAa,SAAS0B,SACJ,mBAAVA,UACZzJ,KAAKyJ,UACPD,gBAAgB1B,SAAS2B,MAAM7H;YAC/B+H,mBAAmB7B,SAAS2B,OAAQS,KAA6CV,gBAAgB1B,SAASoC,OAE1GV,gBAAgB1B,SAAS2B;YAM3B,YAAYK,MAAM;gBACpB,MAAMK,OAAOL,KAAK;gBAElB,IAAI9J,KAAKmK,OAAO;oBACdrC,QAAQsC,YAAYD,KAAKvI;oBACzB,MAAMY,MAAMpB,cAAc+I,KAAKjK;oBAC/BiK,KAAK5H,YAAa2H,KAAOpC,QAAQsC,YAAYF,GAAI1H,MACjD0E,gBAAgBY,SAAS,MAAMqC,KAAKtH,eAAeL;AACrD,uBACEsF,QAAQsC,YAAYD;AAExB;YAEA,KAAK,MAAM3H,OAAOsH,MAAM;gBAEtB,IAGU,cAARtH,OACQ,YAARA,OACQ,YAARA,OACQ,UAARA,OACQ,YAARA,OACQ,gBAARA,OACQ,YAARA,OACQ,eAARA,OACQ,aAARA,KAEA;gBAGF,MAAMc,IAAIwG,KAAKtH;gBAGf,IAAIA,IAAI6H,WAAW,QAAQ;oBACzB,IAAI/G,GAAG;wBACL,MAAMgH,YAAY9H,IAAIwD,MAAM;wBAC5B8B,QAAQyC,iBAAiBD,WAAWhH,IACpC4D,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoBF,WAAWhH;AACxE;oBACA;AACF;gBAMA,MAAMhB,UAAU2F,SAASzF,QAAQ+G;gBAC7BvJ,KAAKsD,MACPhB,QAAQwF,SAAStF,KAAKc,EAAE1B,QACxB+H,mBAAmB7B,SAASxE,GAAI4G,KAAM5H,QAAQwF,SAAStF,KAAK0H,OAE5D5H,QAAQwF,SAAStF,KAAKc;AAE1B;AACF,SAOImH,CAAa3C,SAASgC;AAFxB;AAMF;;AC1HA,MAAMY,aAAcpH,KAAYqH,QAAQrH,KAAKA,IAAIwB,SAAS8F,eAAetH;;AAEzE,SAASuH,UAAU/C,SAAsEgD;IAEvF,IAAIA,cAAuC,MAANA,GAIrC,IAAI9K,KAAK8K,IAAI;QACX,IAAIrF,OAAOiF,WAAWI,EAAElJ;QACxBkG,QAAQlD,YAAYa;QACpB,MAAMsF,WAAY5I;YAChB,MAAM6I,UAAUN,WAAWvI,WACrB8I,UAAUxF;YAChBA,OAAOuF,SACPC,QAAQC,YAAYF,UACpBtE,sBAAsBsE;;QAExBF,EAAEvI,YAAYwI,UAAUA,WACxB7D,gBAAgBY,SAAS,MAAMgD,EAAEjI,eAAekI;AAClD,WAAO;QACL,MAAMtF,OAAOiF,WAAWI;QACxBhD,QAAQlD,YAAYa;QACpB,MAAMM,SAASN;QACA,aAAXM,OAAOoF,QACTC,IAAItD,SAAS/B,OAAO1B;AAExB;AACF;;AAEA,SAAS+G,IAAItD,SAAsEgD;IACjF,IAAIO,YAAYP,IACdA,EAAEQ,KAAMrK,KAAMmK,IAAItD,SAAS7G,UACtB,IAAIsK,SAAST,IAClB,KAAK,IAAI5J,IAAI,GAAGA,IAAI4J,EAAE/J,QAAQG,KAAK;QAEjC,MAAMsK,KAAKV,EAAE5J;QACb,IAAImK,YAAYG,KAAK;YACnB,MAAMC,UAAU3G,SAAS4G,cAAc;YACvC5D,QAAQlD,YAAY6G,UACpBD,GAAGF,KAAMK;gBACP,IAAIhB,QAAQgB,UAEVF,QAAQP,YAAYS,UACpBjF,sBAAsBiF,eACjB;oBACL,MAAMC,cAAclB,WAAWiB;oBAC/BF,QAAQP,YAAYU,cACpBlF,sBAAsBkF;AACxB;;AAEJ,eACEf,UAAU/C,SAAS0D;AAEvB,WAGAX,UAAU/C,SAASgD;AAEvB;;AAEM,SAAUe,aAAa/D,SAAmDgE;IAC9E,IAAIP,SAASO,UACX,KAAK,IAAI5K,IAAI,GAAGA,IAAI4K,QAAQ/K,QAAQG,KAClCkK,IAAItD,SAASgE,QAAQ5K,UAGvBkK,IAAItD,SAASgE;AAEjB;;ACpEM,SAAUC,YAAYjE,SAAiDkE;IAC3E,KAAKzL,UAAUyL,WACb,MAAA,IAAAtJ,MAAA;IAGF,IAAwB,YAApBoF,QAAQmE,SAAZ;QAsBA,IAAwB,aAApBnE,QAAQmE,WAA4C,eAApBnE,QAAQmE,SAAwB;YAClEnE,QAAQlG,QAAQoK,SAASpK,SAAS;YAClC,MAAMmJ,WAAW,MAAOiB,SAASpK,QAAQkG,QAAQlG,OAC3CsK,gBAAiB/J,YAAsB2F,QAAQlG,QAAQO;YAK7D,OAJA2F,QAAQyC,iBAAiB,UAAUQ,WACnCiB,SAASzJ,YAAY2J,eAAeA;YACpChF,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoB,UAAUO;iBACrE7D,gBAAgBY,SAAS,MAAMkE,SAASnJ,eAAeqJ;AAEzD;QAEAlK,6BAAM;AAbN,WAlBE,IAAqB,YAAjB8F,QAAQqD,QAAqC,eAAjBrD,QAAQqD,MAAqB;QAC3DrD,QAAQI,UAAUiE,QAAQH,SAASpK;QACnC,MAAMmJ,WAAW,MAAOiB,SAASpK,QAAQkG,QAAQI,SAC3CgE,gBAAiB/J,YAAuB2F,QAAQI,UAAU/F;QAChE2F,QAAQyC,iBAAiB,UAAUQ,WACnCiB,SAASzJ,YAAY2J,eAAeA;QACpChF,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoB,UAAUO;QACrE7D,gBAAgBY,SAAS,MAAMkE,SAASnJ,eAAeqJ;AACzD,WAAO;QACLpE,QAAQlG,QAAQoK,SAASpK,SAAS;QAClC,MAAMwK,UAAU,MAAOJ,SAASpK,QAAQkG,QAAQlG,OAC1CsK,gBAAiB/J,YAAsB2F,QAAQlG,QAAQO;QAC7D2F,QAAQyC,iBAAiB,SAAS6B,UAClCJ,SAASzJ,YAAY2J,eAAeA;QACpChF,gBAAgBY,SAAS,MAAMA,QAAQ0C,oBAAoB,SAAS4B,WACpElF,gBAAgBY,SAAS,MAAMkE,SAASnJ,eAAeqJ;AACzD;AAgBJ;;;;;;;;;;;;;;;;;;GC9BO,OAAMG,IAAI,CACfC,KACAxC,MACAgC;IAEA,IAAmB,mBAARQ,KACT,MAAA,IAAA5J,MAAA;IAIF,MAAMoF,UAAUhD,SAASyH,cAAcD;IASvC,OARoB,mBAATxC,QAA8B,SAATA,QAAiB,aAAaA,QAC5DiC,YAAYjE,SAAgBgC,KAAK;IAInCD,UAAU/B,SAASgC,OACnB+B,aAAa/D,SAASgE,UAEfhE;GAGI0E,QAAM,CAAmBF,KAAQxC,MAAkBgC;IAC9D,IAAmB,mBAARQ,KACT,MAAA,IAAA5J,MAAA;IAIF,MAAMoF,UAAUhD,SAAS2H,gBAAgB,8BAA8BH;IAUvE,OAPAzC,UAAU/B,SAASgC,OACnB+B,aAAa/D,SAASgE,UAEF,mBAAThC,QAA8B,SAATA,QAAiB,aAAaA,QAC5DiC,YAAYjE,SAAgBgC,KAAK;IAG5BhC;GAGI4E,WAAS,CAAsBJ,KAAQxC,MAAkBgC;IACpE,IAAmB,mBAARQ,KACT,MAAA,IAAA5J,MAAA;IAIF,MAAMoF,UAAUhD,SAAS2H,gBAAgB,sCAAsCH;IAU/E,OAPAzC,UAAU/B,SAASgC,OACnB+B,aAAa/D,SAASgE,UAEF,mBAAThC,QAA8B,SAATA,QAAiB,aAAaA,QAC5DiC,YAAYjE,SAAgBgC,KAAK;IAG5BhC;GCrEH6E,qBAAqB,IAAIjL;;AAE/B,IAAIkL,aAAY;;AAET,MAAMC,gBAAiBjD;IAC5B,KAAK+C,mBAAmBlK,IAAImH,WAAW;QAKrC,IAHA+C,mBAAmB/J,IAAIgH,UAAUA,SAASpI,SAGtCoL,WACF;QAGFA,aAAY,GACZE,QAAQC,UAAUzB,KAAK;YACrBsB,aAAY,GACZD,mBAAmBtK,QAAQ,CAACD,UAAUwH;gBACpC;oBAEEA,SAASnI,gBAAgBY,QAASC,WAAYA,QAAQsH,SAAShI,OAAOQ;AACxE,kBAAE,OAAO6E;oBACPjF,QAAAiF,MAAA,iBAAO,gBAAgBA;AACzB;gBAEF0F,mBAAmB3J;;AAEvB;;;AC1BI,MAAOgK,cAAiBzL;IACnBnB,MAAK;IAEd,WAAAuB,CAAYH;QACVK,MAAML;AACR;IAGA,SAAII;QACF,OAAOE,KAAKN;AACd;IAEA,SAAII,CAAMO;QACR,IAAI8K,IAAI9K,UAAUL,KAAKN,SACrB;QAEF,MAAMY,WAAWN,KAAKN;QACtBM,KAAKN,SAASW,UACdL,KAAKI,MAAMC,UAAUC;AACvB;IAMA,SAAI8K;QAEF,OADAL,cAAc/K,OACPA,KAAKN;AACd;IAEA,MAAAyB;QACE,OAAOnB,KAAKI,MAAMJ,KAAKN,QAAQM,KAAKN;AACtC;IAoDA,MAAA2L,IAAUC;QACR,IAAoB,MAAhBA,KAAKrM,QACP,MAAA,IAAA2B,MAAA;QAEF,OAAO,IAAI2K,SAASvL,MAAMjB,iBAAiBuM,OT0Bf,CAACtM;YAC/B,QAAQA,KAAKC;cACX,KAAK;gBACH,OAAO,CAACC,GAAGmB,aAAcnB,EAAEF,KAAK,MAAMqB;;cACxC,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,MAAMqB;;cACjD,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,MAAMqB;;cAC1D,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,MAAMqB;;cACnE,KAAK;gBACH,OAAO,CAACnB,GAAGmB,aAAcnB,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,MAAMqB;;cAC5E;gBACE,OAAO,CAACnB,GAAGmB;oBACT,IAAIlB,IAAID,EAAEF,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK,IAAIA,KAAK;oBACnD,KAAK,IAAII,IAAI,GAAGA,IAAIJ,KAAKC,SAAS,GAAGG,KACnCD,IAAIA,EAAEH,KAAKI;oBAEbD,EAAEH,KAAKA,KAAKC,SAAS,MAAMoB;;;US5CmBmL,CAAiBF;AACrE;IAEA,OAAAnJ;QACEnC,KAAKL,gBAAgBuB;AACvB;;;AAOK,MAAMuK,MAAU3L,SAAwB,IAAIoL,MAAMpL,QAK5C4L,cAAc,CAAUC,OAAYnF;IAE/C,IAAI,aAAamF,OAAO;QACtB,MAAMC,SAASD,MAAM;QACrB,IAAIlN,UAAUmN,SACZ,OAAOA;QAEP,MAAA,IAAAhL,MAAA;AAEJ;IACA,OAAO6K,IAAIjF;GAGPqF,aAAa,CAAIF,OAA2BhI,SAAagI,MAAMF,IAAK3L,QAAQ6D,MAQrEmI,WAAW,CAAiBH,OAA+BhI;IACtE,MAAM,SAASgI,QACb,OAAOI;IAGT,MAAM5M,IAAIwM,MAAMF;IAChB,IAAIhN,UAAUU,IAEZ,OADAA,EAAEW,QAAQ6D,MACHkI;IAEP,MAAA,IAAAjL,MAAA;;;AAME,MAAO2K,iBAAoB3J;IACtBtD,MAAK;IAMK0N;IAEnB,WAAAnM,CACEgC,QACAI,QACAgK;QAEAlM,MAAM8B,QAAQI,SACdjC,KAAKgM,UAAUC;AACjB;IAEA,SAAInM;QACF,OAAOE,KAAKN;AACd;IAEA,SAAII,CAAMO;QACRL,KAAKN,SAASW,UAEdL,KAAKgM,QAAQhM,KAAK6B,OAAOnC,QAAQW,WACjCL,KAAK6B,OAAOV;AACd;IAKA,SAAIiK;QAGF,OADAL,cAAc/K,KAAK6B,SACZ7B,KAAKN;AACd;;;ACnLI,MAAOwM,mBAAsBzM;IACxBnB,MAAK;IAKG6N;IAIAC;IAIArK;IAIEC;IACXqK,WAAY;IAEZ,YAAAC,CAAaC,UAAkB;QACrC,MAAMlM,WAAWL,KAAKmM,eAChB7L,WAAWN,KAAKN;QAKtB,OAJKyL,IAAI7K,UAAUD,cAAakM,WAC9BvM,KAAKN,SAASW,UACdL,KAAKI,MAAMC,UAAUC;QAEhBN;AACT;IAEA,WAAAH,CAAYwB,YAAqBC;QAC/BvB,MAAMsB,eACNrB,KAAKmM,cAAc9K,YACnBrB,KAAKoM,gBAAgB9K;QACrBtB,KAAK+B,WAAW,MAAM/B,KAAKsM,gBAC3BtM,KAAKgC,eAAeV,aAAaF,IAAI,MAAM9B,cAAcU,KAAK5B;QAE9D,MAAMoO,gBAAgB,IAAIC;QAC1B,KAAK,IAAIrN,IAAI,GAAGA,IAAIkC,aAAarC,QAAQG,KAAK;YAC5C,MAAMsN,MAAMpL,aAAalC;YACzB,IAAIN,cAAc4N,MAAM;gBACtB,IAAIF,cAAc7L,IAAI+L,IAAI7K,SACxB;gBAEA2K,cAAcG,IAAID,IAAI7K;AAE1B;YACA6K,IAAIjM,YAAYT,KAAK+B,UAAU/B,KAAKgC,aAAa5C;AACnD;QACAoN,cAActL;AAChB;IAEA,MAAAC;QACE,OAAOnB,KAAKsM,cAAa;AAC3B;IAEA,OAAAnK;QACE,KAAInC,KAAKqM,WAAT;YAIArM,KAAKqM,aAAY;YACjB,KAAK,IAAIjN,IAAI,GAAGA,IAAIY,KAAKoM,cAAcnN,QAAQG,KAC7CY,KAAKoM,cAAchN,GAAG2B,eAAef,KAAKgC,aAAa5C;YAGzDY,KAAKoM,cAAcnN,SAAS,GAC5Be,KAAKL,gBAAgBuB;AARrB;AASF;;;AAGFzB,WAAWmN,UAAUxL,MAAM,SAEzB4H,GACA0D;IAEA,OAAO,IAAIR,WAAW,MAAMlD,EAAEhJ,KAAKF,QAAQ4M,MAAM,EAAC1M,SAAS0M,QAAO,EAAC1M;AACrE,GAEAP,WAAWmN,UAAUrL,KAAK,SAAqCC;IAC7D,OAAI3C,WAAW2C,KACN,IAAIqL,cAAc7M,MAAOoI,KAAM+C,IAAI/C,GAAG5G,EAAE1B,QAAQ0B,KAEhD,IAAIqL,cAAc7M,MAAOoI,KAAM+C,IAAI/C,GAAG5G;AAEjD,GAEA/B,WAAWmN,UAAUnL,QAAQ,SAAoCD;IAC/D,OAAI3C,WAAW2C,KACN,IAAIqL,cAAc7M,MAAOoI,KAAM0E,WAAW1E,GAAG5G,EAAE1B,QAAQ0B,KAEvD,IAAIqL,cAAc7M,MAAOoI,KAAM0E,WAAW1E,GAAG5G;AAExD,GAEA/B,WAAWmN,UAAUlL,MAAM,YAAqC4J;IAC9D,IAAoB,MAAhBA,KAAKrM,QACP,MAAA,IAAA2B,MAAA;IAEF,OAAO,IAAIiM,cAAc7M,MAAMjB,iBAAiBuM;AAClD;;AAOO,MAAMyB,WAAW,CAAI1L,YAAqBC,iBAC/C,IAAI4K,WAAW7K,YAAYC;;AAIvB,MAAOuL,sBAAyBjL;IAC3BtD,MAAK;IAMG0O;IAEjB,WAAAnN,CAAYgC,QAAyBI,QAA6CgL;QAChFlN,MAAM8B,QAAQI,SACdjC,KAAKgN,cAAcC,YAEfA,eACFjN,KAAKgC,aAAaE,KAAK5C,cAAcU,KAAK5B;QAC1C6O,WAAWxM,YAAYT,KAAK+B,UAAU/B,KAAKgC,aAAa;AAE5D;IAEA,SAAIlC;QACF,OAAOE,KAAKN;AACd;IAEA,OAAAyC;QACEnC,KAAKgC,aAAazB,QAASG,OAAQV,KAAK6B,OAAOd,eAAeL,OAC9DV,KAAKgN,aAAajM,eAAef,KAAKgC,aAAa;AACrD;;;SC9HckL,OACdC,UACAC,WACAC;IAEA,OAAMC,MAAEA,QAAO,GAAKC,WAAEA,YAAYxB,UAAQyB,WAAEA,YAAY,MAAOC,OAAOJ,UAChEK,eAAuC;IAE7C,IAAIC,UAAS;IAEb,MAAMC,MAAM;QACV,IAAKD,QAAL;YAKAJ;YAEA;gBACEJ;AACF,cAAE,OAAOU;gBACP3N,QAAA4N,MAAA,iBAAO,iBAAiBN,WAAWK;AACrC;AATA;;IAaF,KAAK,IAAIzO,IAAI,GAAGA,IAAIgO,UAAUnO,QAAQG,KAAK;QACzCsO,aAAatO,KAAKA;QAClB,MAAMD,IAAIiO,UAAUhO;QAChBN,cAAcK,KAEhBA,EAAE0C,OAAOlC,gBAAgBmB,IAAI4M,aAAatO,IAAIwO,OAE9CzO,EAAEsB,YAAYmN,KAAKT;AAEvB;IAQA,OALKG,QACHM,OAIK;QACL,IAAKD,QAAL;YAGAA,UAAS;YAET,KAAK,IAAIvO,IAAI,GAAGA,IAAIgO,UAAUnO,QAAQG,KACpCgO,UAAUhO,GAAG2B,eAAeoM;YAI9BI;AARA;;AAUJ;;AClEO,MAAMQ,aAAiBvM,KAC5BtD,KAAKsD,KAAKA,IAAKiK,IAAIjK,IAKRwM,aAAiBlO,SAAqC5B,KAAQ4B,SAASA,MAAMA,QAAQA;;ACJ5F,MAAOmO,uBAAuB7L;IACzBiH,KAAI;IAEb,WAAAxJ;QACEE;AACF;IAKA,cAAAmO;QACE,MAAM3L,OAAOvC,KAAKuC,KAAK2B;QACvBlE,KAAKuC,KAAKtD,SAAS;QACnB,KAAK,IAAIG,IAAI,GAAGA,IAAImD,KAAKtD,QAAQG,KAAK;YACpC,MAAMuE,OAAOpB,KAAKnD;YACduE,KAAKd,cACPc,KAAKS;AAET;AACF;;;ACvBK,MAAM+J,OAAO,CAAC3D,KAAamB,UAChB,qBAARnB,MAAqBA,IAAImB,SAASpB,EAAEC,KAAKmB,OAAOA,MAAM9H,WAEnDuK,cAAe3L,QAA8BO,SAAS4G,cAAcnH;;ACGjF,SAAS4L,OACPC,SACA9D,KACAmB;IAEA,IAAIA,MAAMF,OAAO7M,eAAe+M,MAAMF,MACpC,MAAA,IAAA7K,MAAA;IAEF,MAAM2N,KAAKD,QAAQ9D,KAAKmB,OAAOA,MAAM9H;IAErC,OADAiI,SAASH,OAAO4C,KACTA;AACT;;AAEO,MAAMC,MAAM,CAAChE,KAAamB,UAAoC0C,OAAOF,MAAM3D,KAAKmB,QAC1EjB,MAAM,CAACF,KAAamB,UAAoC0C,OAAOI,OAAMjE,KAAKmB,QAC1Ef,SAAS,CAACJ,KAAgBmB,UAAoC0C,OAAOK,UAASlE,KAAKmB;;AAO1F,SAAUgD,SAAShD;IACvB,OAAM9H,UAAEA,YAAa8H,SAAS,CAAA;IAE9B,KAAK9H,UACH,OAAOuK,YAAY;IAGrB,MAAMQ,WFgEF,SAAoC/K;QACxC,MAAM+K,WAAsB,IAEtBC,eAAgBC;YACpB,IAAIA,kBAAmD,MAAVA,UAA6B,MAAVA,OAKhE,IAAIrF,SAASqF,QAEXC,SAASD,OAAOD,oBAFlB;gBAMA,IAAqB,mBAAVC,SAAuC,mBAAVA,OAAoB;oBAC1D,MAAME,OAAOhM,SAASyH,cAAc;oBAGpC,OAFAuE,KAAKC,cAAcC,OAAOJ,aAC1BF,SAAS1M,KAAK8M;AAEhB;gBAEA,IAAIF,iBAAiBK,SACnBP,SAAS1M,KAAK4M,aADhB;oBAKA,KAAI5Q,KAAK4Q,QAOP,MAFF5O,QAAAC,KAAA,gBAAM,oCAAoC2O;oBAElC,IAAIlO,MAAM;oBANhBiO,aAAaC,MAAMhP;AAHrB;AAZA;;QA0BF,OADA+O,aAAahL,WACN+K;AACT,KExGmBQ,CAA0BvL;IAE3C,OFmBI,SAA0C8H;QAC9C,MAAM1H,SAAS,IAAIgK,gBACbW,WAAW3K,OAAO1B,MAClB8M,cAActB,WAAWpC,MAAM9H,WAE/ByL,SAAS;YACb,MAAMC,cAAcF,YAAYvP,OAC1B8C,SAASqB,OAAOpB;YAEtB,KAAKD,QAAQ;gBACXgM,SAAS3P,SAAS;gBAClB,KAAK,IAAIG,IAAI,GAAGA,IAAImQ,YAAYtQ,QAAQG,KACtCwP,SAAS1M,KAAKqN,YAAYnQ;gBAE5B;AACF;YAEA6E,OAAOiK,kBACPU,SAAS3P,SAAS;YAElB,MAAMuQ,WAAWxM,SAASyM;YAC1B,KAAK,IAAIrQ,IAAI,GAAGA,IAAImQ,YAAYtQ,QAAQG,KAAK;gBAC3C,MAAM4G,UAAUuJ,YAAYnQ;gBAC5BwP,SAAS1M,KAAK8D,UACdwJ,SAAS1M,YAAYkD;AACvB;YAEApD,OAAO8M,aAAaF,UAAUvL,OAAO0L;;QAUvC,OAPAN,YAAY5O,YAAY6O,QAAQA,SAChClK,gBAAgBnB,QAAQ,MAAMoL,YAAYtO,eAAeuO;QACzDrL,OAAOzB,gBAAgB8M,QACvBA,UAEAxD,SAASH,OAAoC1H,SAEtCA;AACT,KEzDS2L,CAAc;QAAE/L,UAAU+K;;AACnC;;MAKaiB,SAAqB,IAAIC,SAG7BtB,OAAOsB,OAOHC,OAAOvB;;AC/Cd,SAAUwB,QACdrE;IAOA,MAAMsE,MAAMtE,MAAMuE,UAAUvE;IAC5B,IAAIwE,OACFxE,MAAMyE,YAAapN,SAAS4G,cAAc;IAW5C,OATIL,YAAY0G,OACdA,IAAIzG,KAAM6G;QACRF,KAAK/G,YAAYiH,WACjBzL,sBAAsByL;SAGxBF,OAAOF,KAGFE;AACT;;ACvBM,MAAOG,oBAAoBlO;IACtBiH,KAAI;IAEb,WAAAxJ;QACEE;AACF;;;AAYF,MAAMwQ,gBAAgB,CAACC,SAAgC9P,KAAUiD,MAAmB4B;IAC9EiL,QAAQ7P,IAAID,QACdR,QAAAiF,MAAA,iBAAO,2CAA2CI,iDAAiD2J,OAAOxO;IAE5G8P,QAAQ1P,IAAIJ,KAAKiD;;;AAQb,SAAU8M,MAAS9E;IACvB,MAAM2D,SAAS;QACb,MAAMoB,UAAUC,QAAQ7Q,OAClB8C,SAASqB,OAAOpB;QAEtB,KAAKD,QAAQ;YACXqB,OAAO1B,KAAKtD,SAAS,GACrBuR,QAAQtP;YACR,KAAK,IAAIqE,QAAQ,GAAGA,QAAQmL,QAAQzR,QAAQsG,SAAS;gBACnD,MAAMqL,OAAOF,QAAQnL,QACfsL,UAAUC,WAAWF,MAAMrL,OAAOmL,UAClC/M,OAAOoN,WAAWH,MAAMrL,OAAOmL;gBACrCH,cAAcC,SAASK,SAASlN,MAAM4B,QACtCtB,OAAO1B,KAAKL,KAAKyB;AACnB;YACA,OAAOM;AACT;QAEA,MAAM+M,YAAY/M,OAAO1B,KAAKtD,QACxBgS,YAAYP,QAAQzR;QAE1B,IAAkB,MAAdgS,WAIF,OAHAT,QAAQjQ,QAASoD,QAASA,KAAKS,WAC/BoM,QAAQtP;QACR+C,OAAO1B,KAAKtD,SAAS,GACdgF;QAGT,IAAkB,MAAd+M,WAAiB;YACnB/M,OAAO1B,KAAKtD,SAAS,GACrBuR,QAAQtP;YACR,MAAMsO,WAAWxM,SAASyM;YAC1B,KAAK,IAAIrQ,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;gBAClC,MAAMwR,OAAOF,QAAQtR,IACfyR,UAAUC,WAAWF,MAAMxR,GAAGsR,UAC9B/M,OAAOoN,WAAWH,MAAMxR,GAAGsR;gBACjCH,cAAcC,SAASK,SAASlN,MAAMvE,IACtC6E,OAAO1B,KAAKL,KAAKyB,OACjB6L,SAAS1M,YAAYa;AACvB;YAEA,OADAf,OAAO8M,aAAaF,UAAUvL,OAAO0L,cAC9B1L;AACT;QAEA,MAAMiN,mBAAmB,IAAItR,KACvB2P,cAA6B,IAAIzL,MAAMmN;QAC7C,KAAK,IAAI7R,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;YAClC,MAAMwR,OAAOF,QAAQtR,IACfyR,UAAUC,WAAWF,MAAMxR,GAAGsR;YACpCQ,iBAAiBpQ,IAAI+P,SAASzR,IAC9BmQ,YAAYnQ,KAAKoR,QAAQ7P,IAAIkQ,WAAWL,QAAQ9O,IAAImP,WAAYE,WAAWH,MAAMxR,GAAGsR;AACtF;QAEA,MAAMS,WAA0B;QAChCX,QAAQjQ,QAAQ,CAACoD,MAAMjD;YAChBwQ,iBAAiBvQ,IAAID,QACxByQ,SAASjP,KAAKyB;;QAGlB,KAAK,IAAIvE,IAAI,GAAGA,IAAI+R,SAASlS,QAAQG,KACnC+R,SAAS/R,GAAGgF;QAGd,IAAIgN,cAAcnN,OAAO0L;QACzB,KAAK,IAAIvQ,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;YAClC,MAAMuE,OAAO4L,YAAYnQ;YACrBgS,gBAAgBzN,OAClBf,OAAO8M,aAAa/L,MAAMyN,eAE1BA,cAAcA,YAAYzB;AAE9B;QAEAa,QAAQtP,SACR+C,OAAO1B,KAAKtD,SAAS;QACrB,KAAK,IAAIG,IAAI,GAAGA,IAAI6R,WAAW7R,KAAK;YAClC,MAAMyR,UAAUC,WAAWJ,QAAQtR,IAAIA,GAAGsR,UACpC/M,OAAO4L,YAAYnQ;YACzBmR,cAAcC,SAASK,SAASlN,MAAMvE,IACtC6E,OAAO1B,KAAKL,KAAKyB;AACnB;QACA,OAAOM;OAGH6M,aAAgDnF,MAAMjL,OAAG,CAAMkQ,QAAYA,OAC3EG,aACJpF,MAAMvK,OAAG,CAAMwP,QAAYS,UAAUT,QACjCD,UAAU5C,WAAWpC,MAAMpJ,OAC3B0B,SAAS,IAAIqM,aACbE,UAAU,IAAI5Q;IAEpB,KAAK,IAAI2F,QAAQ,GAAGA,QAAQoL,QAAQ7Q,MAAMb,QAAQsG,SAAS;QACzD,MAAMqL,OAAOD,QAAQ7Q,MAAMyF,QACrBsL,UAAUC,WAAWF,MAAMrL,OAAOoL,QAAQ7Q,QAC1C6D,OAAOoN,WAAWH,MAAMrL,OAAOoL,QAAQ7Q;QAC7CyQ,cAAcC,SAASK,SAASlN,MAAM4B,QACtCtB,OAAO1B,KAAKL,KAAKyB;AACnB;IAOA,OALAgN,QAAQlQ,YAAY6O,QAAQA,SAC5BlK,gBAAgBnB,QAAQ,MAAM0M,QAAQ5P,eAAeuO;IACrDrL,OAAOzB,gBAAgB8M,QACvBxD,SAASH,OAAO1H,SAETA;AACT;;ACxIM,SAAUqN,cACdC,WACAC,OACAC,SACAC,SACAC;IAEA,KAAKzT,KAAKqT,YACR,OAAOA,YAAYpD,KAAKqD,OAAOC,WAAWC,UAAUvD,KAAKuD,SAASC,aAAcvD,YAAY;IAG9F,IAAIsD,SAAS;QACX,IAAI7L,UAAU0L,UAAUzR,QAAQqO,KAAKqD,OAAOC,WAAWtD,KAAKuD,SAAUC;QACtE,MAAMtM,UAAU,MAAMkM,UAAUxQ,eAAekI,WACzCA,WAAY5I;YAChB,MAAMuR,MAAM/L;YACZA,UAAUxF,WAAW8N,KAAKqD,OAAOC,WAAWtD,KAAKuD,SAAUC,YAC3DrM,mBAAmBsM,KAAKvM;YACxBD,gBAAgBS,SAASR,UACzBuM,IAAIxI,YAAYvD,UAChBjB,sBAAsBiB;;QAIxB,OAFA0L,UAAU9Q,YAAYwI,UAAUA,WAChC7D,gBAAgBS,SAASR;QAClBQ;AACT;IAAO;QACL,MAAMgM,QAAQzD,YAAY;QAC1B,IAAIvI,UAAU0L,UAAUzR,QAAQqO,KAAKqD,OAAOC,WAAWI;QACvD,MAAMxM,UAAU,MAAMkM,UAAUxQ,eAAekI,WACzCA,WAAY5I;YAChB,MAAMuR,MAAM/L;YACZA,UAAUxF,WAAW8N,KAAKqD,OAAOC,WAAWI,OAC5CvM,mBAAmBsM,KAAKvM;YACxBD,gBAAgBS,SAASR,UACzBuM,IAAIxI,YAAYvD,UAChBjB,sBAAsBiB;;QAIxB,OAFA0L,UAAU9Q,YAAYwI,UAAUA,WAChC7D,gBAAgBS,SAASR;QAClBQ;AACT;AACF;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ktjs/core",
-  "version": "0.38.7",
+  "version": "0.38.8",
   "description": "Core functionality for kt.js - DOM manipulation utilities with JSX/TSX support",
   "description_zh": "kt.js 的核心功能，提供支持 JSX/TSX 的 DOM 操作工具。",
   "type": "module",