mutts 1.0.12 → 1.0.13

package/dist/mutts.umd.min.js.map

@@ -1 +1 @@
-{"version":3,"file":"mutts.umd.min.js","sources":["../src/async/index.ts","../src/async/browser.ts","../src/utils.ts","../src/decorator.ts","../src/destroyable.ts","../src/diff.ts","../src/eventful.ts","../src/flavored.ts","../src/indexable.ts","../src/iterableWeak.ts","../src/mixins.ts","../src/promiseChain.ts","../src/reactive/debug-hooks.ts","../src/zone.ts","../src/reactive/registry.ts","../src/reactive/effect-context.ts","../src/reactive/types.ts","../src/reactive/tracking.ts","../src/reactive/effects.ts","../src/reactive/deep-watch-state.ts","../src/reactive/change.ts","../src/reactive/non-reactive.ts","../src/reactive/deep-touch.ts","../src/reactive/proxy.ts","../src/reactive/buffer.ts","../src/reactive/deep-watch.ts","../src/reactive/memoize.ts","../src/reactive/satellite.ts","../src/reactive/iterator-helpers.ts","../src/reactive/array.ts","../src/reactive/map.ts","../src/reactive/set.ts","../src/reactive/index.ts","../src/std-decorators.ts","../src/index.ts","../src/reactive/record.ts"],"sourcesContent":["export type Restorer = () => () => void\nexport type Hook = () => Restorer\n\n// Queue for hooks registered before the environment is ready (circular dependency fix)\nexport const hooks = new Set<Hook>()\n\nexport const asyncHooks = {\n\taddHook(hook: Hook): () => void {\n\t\thooks.add(hook)\n\t\treturn () => hooks.delete(hook)\n\t},\n\t/**\n\t * [Hack] Sanitize a promise (or value) to prevent context leaks.\n\t * Default: Identity function.\n\t * Browser: Uses Macrotask wrapping to break microtask chains.\n\t */\n\tsanitizePromise(p: any): any {\n\t\treturn p\n\t},\n}\n\n/**\n * Register a hook that will be called whenever an asynchronous operation is initiated.\n * The hook should return a restorer function which will be called just before the async callback runs.\n * That restorer should in turn return an undoer function which will be called just after the async callback finishes.\n */\nexport const asyncHook = (hook: Hook) => asyncHooks.addHook(hook)\n","import { asyncHooks, hooks, type Restorer } from '.'\n\nconst promiseContexts = new WeakMap<Promise<any>, Set<Restorer>>()\n\n// [HACK]: Sanitization\n// If a Promise is created inside the zone, it carries the \"Sticky\" zone context.\n// If returned to the outer scope, that context leaks. We wrap it in a new Promise\n// created here (in the outer scope) to break the chain and sanitize the return value.\n// See BROWSER_ASYNC_POLYFILL.md for full details.\nasyncHooks.sanitizePromise = (res: any) => {\n\tif (res && typeof (res as any).then === 'function') {\n\t\treturn new Promise((resolve, reject) => {\n\t\t\tsetTimeout(() => {\n\t\t\t\t;(res as any).then(resolve, reject)\n\t\t\t}, 0)\n\t\t})\n\t}\n\treturn res\n}\n\nfunction captureRestorers() {\n\tconst restorers = new Set<Restorer>()\n\tfor (const hook of hooks) {\n\t\tconst restorer = hook()\n\t\tif (restorer) restorers.add(restorer)\n\t}\n\treturn restorers\n}\n\nfunction wrap<Args extends any[], R>(\n\tfn: ((...args: Args) => R) | null | undefined,\n\tcapturedRestorers?: Set<Restorer>\n) {\n\tif (typeof fn !== 'function') return fn\n\tconst restorers = capturedRestorers || captureRestorers()\n\treturn function (this: any, ...args: Args) {\n\t\tconst undoers: (() => void)[] = []\n\t\tfor (const restore of restorers) undoers.push(restore())\n\t\ttry {\n\t\t\treturn fn.apply(this, args)\n\t\t} finally {\n\t\t\t/* cf BROWSER_ASYNC_POLYFILL.md\n\t\t\t// Note: my fear about this code: in between 2~3~4 microtask waits, some other microtasks might have started, stopped, ...\n\t\t\t// We might be in the middle of another promise hook trying to setup the zone\n\t\t\t// TODO We might wish to have a flag :asyncZone.acquired - like a semaphore - that we falsify here and set back when we setup the zone\n\t\t\t// - but this might perhaps be an overkill creating more problems than it solves\n\t\t\tif (originals.queueMicrotask) {\n\t\t\t\t// Double microtask ensures we run after the first await resumption microtask\n\t\t\t\toriginals.queueMicrotask.call(globalThis, () => {\n\t\t\t\t\toriginals.queueMicrotask.call(globalThis, () => {\n\t\t\t\t\t\toriginals.queueMicrotask.call(globalThis, () => {\n\t\t\t\t\t\t\tfor (let i = undoers.length - 1; i >= 0; i--) undoers[i]()\n\t\t\t\t\t\t})\n\t\t\t\t\t})\n\t\t\t\t})\n\t\t\t} else {\n\t\t\t\tfor (let i = undoers.length - 1; i >= 0; i--) undoers[i]()\n\t\t\t}*/\n\t\t}\n\t}\n}\n\nconst GLOBAL_ORIGINALS = Symbol.for('mutts.originals')\nconst GLOBAL_PROMISE = Symbol.for('mutts.OriginalPromise')\n\nlet originals: any\nlet OriginalPromise: any\n\nif ((globalThis as any)[GLOBAL_ORIGINALS]) {\n\toriginals = (globalThis as any)[GLOBAL_ORIGINALS]\n\tOriginalPromise = (globalThis as any)[GLOBAL_PROMISE]\n} else {\n\tOriginalPromise = globalThis.Promise\n\toriginals = {\n\t\t// biome-ignore lint/suspicious/noThenProperty: Intentional Promise.prototype patching\n\t\tthen: OriginalPromise.prototype.then,\n\t\tcatch: OriginalPromise.prototype.catch,\n\t\tfinally: OriginalPromise.prototype.finally,\n\t\tresolve: OriginalPromise.resolve,\n\t\treject: OriginalPromise.reject,\n\t\tall: OriginalPromise.all,\n\t\tallSettled: (OriginalPromise as any).allSettled,\n\t\trace: OriginalPromise.race,\n\t\tany: (OriginalPromise as any).any,\n\t\tsetTimeout: globalThis.setTimeout,\n\t\tsetInterval: globalThis.setInterval,\n\t\tsetImmediate: (globalThis as any).setImmediate,\n\t\trequestAnimationFrame: (globalThis as any).requestAnimationFrame,\n\t\tqueueMicrotask: globalThis.queueMicrotask,\n\t}\n\t;(globalThis as any)[GLOBAL_ORIGINALS] = originals\n\t;(globalThis as any)[GLOBAL_PROMISE] = OriginalPromise\n}\n\n// Ensure modern statics are captured even if originals was cached from an older version\nif (!originals.allSettled) originals.allSettled = (OriginalPromise as any).allSettled\nif (!originals.any) originals.any = (OriginalPromise as any).any\nif (!originals.race) originals.race = OriginalPromise.race\n\nfunction patchedThen(this: any, onFulfilled: any, onRejected: any) {\n\tconst context = promiseContexts.get(this) || captureRestorers()\n\tconst nextPromise = originals.then.call(\n\t\tthis,\n\t\twrap(onFulfilled, context),\n\t\twrap(onRejected, context)\n\t)\n\tif (context.size > 0) promiseContexts.set(nextPromise, context)\n\treturn nextPromise\n}\n\nfunction patchedCatch(this: any, onRejected: any) {\n\tconst context = promiseContexts.get(this) || captureRestorers()\n\tconst nextPromise = originals.catch.call(this, wrap(onRejected, context))\n\tif (context.size > 0) promiseContexts.set(nextPromise, context)\n\treturn nextPromise\n}\n\nfunction patchedFinally(this: any, onFinally: any) {\n\tconst context = promiseContexts.get(this) || captureRestorers()\n\tconst nextPromise = originals.finally.call(this, wrap(onFinally, context))\n\tif (context.size > 0) promiseContexts.set(nextPromise, context)\n\treturn nextPromise\n}\n\nfunction PatchedPromise<T>(\n\tthis: any,\n\texecutor: (resolve: (value: T | PromiseLike<T>) => void, reject: (reason?: any) => void) => void\n) {\n\tif (typeof executor === 'function') {\n\t\tconst p = new OriginalPromise((resolve, reject) => {\n\t\t\tconst wrappedResolve = wrap(resolve)\n\t\t\tconst wrappedReject = wrap(reject)\n\t\t\texecutor(wrappedResolve, wrappedReject)\n\t\t})\n\t\tconst context = captureRestorers()\n\t\tpromiseContexts.set(p, context) // Always set, even if empty (Sticky Root)\n\t\treturn p\n\t}\n\treturn new OriginalPromise(executor)\n}\n\n// Copy statics\nObject.assign(PatchedPromise, OriginalPromise as any)\n\n// Inherit prototype for instanceof checks\nPatchedPromise.prototype = OriginalPromise.prototype\n\nPatchedPromise.resolve = (<T>(value?: T | PromiseLike<T>): Promise<T> => {\n\tconst p = originals.resolve.call(OriginalPromise, value) as Promise<T>\n\tconst context = captureRestorers()\n\t// Ensure we don't overwrite if it already has context (e.g. from constructor)\n\tif (context.size > 0 && !promiseContexts.has(p)) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.reject = (<T = never>(reason?: any): Promise<T> => {\n\tconst p = originals.reject.call(OriginalPromise, reason) as Promise<T>\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.all = (<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>[]> => {\n\tconst p = originals.all.call(OriginalPromise, values) as Promise<Awaited<T>[]>\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.allSettled = (<T>(\n\tvalues: Iterable<T | PromiseLike<T>>\n): Promise<PromiseSettledResult<Awaited<T>>[]> => {\n\tconst p = (originals.allSettled as any).call(OriginalPromise, values)\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.race = (<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>> => {\n\tconst p = originals.race.call(OriginalPromise, values) as Promise<Awaited<T>>\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.any = (<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>> => {\n\tconst p = (originals.any as any).call(OriginalPromise, values)\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\n// Only apply patches if not already applied (or re-apply safely)\n// Note: OriginalPromise.prototype might be shared if we used the global one.\n// We must ensure we don't patch it twice if it's the SAME object.\nif (OriginalPromise.prototype.then !== patchedThen) {\n\t// biome-ignore lint/suspicious/noThenProperty: Intentional Promise.prototype patching\n\tOriginalPromise.prototype.then = patchedThen as any\n\tOriginalPromise.prototype.catch = patchedCatch as any\n\tOriginalPromise.prototype.finally = patchedFinally as any\n}\n\ntry {\n\tObject.defineProperty(OriginalPromise, Symbol.species, {\n\t\tget: () => PatchedPromise,\n\t\tconfigurable: true,\n\t})\n} catch (_e) {}\n\n;(globalThis as any).Promise = PatchedPromise\n\nglobalThis.setTimeout = ((callback: Function, ...args: any[]) => {\n\treturn originals.setTimeout.call(globalThis, wrap(callback as any), ...args)\n}) as any\n\nglobalThis.setInterval = ((callback: Function, ...args: any[]) => {\n\treturn originals.setInterval.call(globalThis, wrap(callback as any), ...args)\n}) as any\n\nif (originals.setImmediate) {\n\t;(globalThis as any).setImmediate = ((callback: Function, ...args: any[]) => {\n\t\treturn originals.setImmediate.call(globalThis, wrap(callback as any), ...args)\n\t}) as any\n}\n\nif (originals.requestAnimationFrame) {\n\tglobalThis.requestAnimationFrame = (callback: FrameRequestCallback) => {\n\t\treturn originals.requestAnimationFrame.call(globalThis, wrap(callback))\n\t}\n}\n\nif (originals.queueMicrotask) {\n\tglobalThis.queueMicrotask = (callback: VoidFunction): void => {\n\t\toriginals.queueMicrotask.call(globalThis, wrap(callback))\n\t}\n}\n","type ElementTypes<T extends readonly unknown[]> = {\n\t[K in keyof T]: T[K] extends readonly (infer U)[] ? U : T[K]\n}\n\n/**\n * Yields tuples containing elements from each input array, stopping at the longest array length\n * @param args - Arrays to zip together\n * @returns Generator yielding tuples containing elements from each input array\n */\nexport function* zip<T extends (readonly unknown[])[]>(...args: T): Generator<ElementTypes<T>> {\n\tif (!args.length) return []\n\tconst maxLength = Math.max(...args.map((arr) => arr.length))\n\n\tfor (let i = 0; i < maxLength; i++) {\n\t\tconst tuple = args.map((arr) => arr[i]) as ElementTypes<T>\n\t\tyield tuple\n\t}\n}\n\n/**\n * Checks if two arrays are strictly equal (shallow comparison)\n * @param a - First value\n * @param b - Second value\n * @returns True if arrays are equal or values are strictly equal\n */\nexport function arrayEquals(a: any, b: any): boolean {\n\tif (!Array.isArray(a) || !Array.isArray(b)) return false\n\tif (a === b) return true\n\tif (a.length !== b.length) return false\n\tfor (let i = 0; i < a.length; i++) {\n\t\tif (a[i] !== b[i]) return false\n\t}\n\treturn true\n}\n\nconst nativeConstructors = new Set<Function>([\n\tObject,\n\tArray,\n\tDate,\n\tFunction,\n\tSet,\n\tMap,\n\tWeakMap,\n\tWeakSet,\n\tPromise,\n\tError,\n\tTypeError,\n\tReferenceError,\n\tSyntaxError,\n\tRangeError,\n\tURIError,\n\tEvalError,\n\tReflect,\n\tProxy,\n\tRegExp,\n\tString,\n\tNumber,\n\tBoolean,\n] as Function[])\n/**\n * Checks if a function is a constructor (class or constructor function)\n * @param fn - The function to check\n * @returns True if the function is a constructor\n */\nexport function isConstructor(fn: Function): boolean {\n\treturn (\n\t\tfn &&\n\t\ttypeof fn === 'function' &&\n\t\t(nativeConstructors.has(fn) || fn.toString?.().startsWith('class '))\n\t)\n}\n\n/**\n * Checks if a value is an object\n * @param value - The value to check\n * @returns True if the value is an object\n */\nexport function isObject(value: any): value is object {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t!Array.isArray(value) &&\n\t\t!(\n\t\t\tvalue instanceof Date ||\n\t\t\tvalue instanceof RegExp ||\n\t\t\tvalue instanceof Error ||\n\t\t\tvalue instanceof Set ||\n\t\t\tvalue instanceof Map ||\n\t\t\tvalue instanceof WeakSet ||\n\t\t\tvalue instanceof WeakMap ||\n\t\t\tvalue instanceof Promise ||\n\t\t\tvalue instanceof Function\n\t\t)\n\t)\n}\n\nconst hasNode = typeof Node !== 'undefined'\nexport const FoolProof = {\n\tget(obj: any, prop: any, receiver: any) {\n\t\tif (hasNode && obj instanceof Node) return (obj as any)[prop]\n\t\treturn Reflect.get(obj, prop, receiver)\n\t},\n\tset(obj: any, prop: any, value: any, receiver: any) {\n\t\tif (hasNode && obj instanceof Node) {\n\t\t\t;(obj as any)[prop] = value\n\t\t\treturn true\n\t\t} /*\n\t\tif (!(obj instanceof Object) && !Object.hasOwn(obj, prop)) {\n\t\t\tObject.defineProperty(obj, prop, {\n\t\t\t\tvalue,\n\t\t\t\tconfigurable: true,\n\t\t\t\twritable: true,\n\t\t\t\tenumerable: true,\n\t\t\t})\n\t\t\treturn true\n\t\t}*/\n\t\treturn Reflect.set(obj, prop, value, receiver)\n\t},\n}\n\nexport function isOwnAccessor(obj: any, prop: any) {\n\tconst opd = Object.getOwnPropertyDescriptor(obj, prop)\n\treturn !!(opd?.get || opd?.set)\n}\n\n/**\n * Deeply compares two values.\n * For objects, compares prototypes with === and then own properties recursively.\n * Uses a cache to handle circular references.\n * @param a - First value\n * @param b - Second value\n * @param cache - Map for circular reference protection (internal use)\n * @returns True if values are deeply equal\n */\nexport function deepCompare(a: any, b: any, cache = new Map<object, Set<object>>()): boolean {\n\tif (a === b) return true\n\n\tif (typeof a !== 'object' || a === null || typeof b !== 'object' || b === null) {\n\t\treturn a === b\n\t}\n\n\t// Prototype check\n\tif (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b)) return false\n\n\t// Circular reference protection\n\tlet compared = cache.get(a)\n\tif (compared?.has(b)) return true\n\tif (!compared) {\n\t\tcompared = new Set()\n\t\tcache.set(a, compared)\n\t}\n\tcompared.add(b)\n\n\t// Handle specific object types\n\tif (Array.isArray(a)) {\n\t\tif (!Array.isArray(b) || a.length !== b.length) return false\n\t\tfor (let i = 0; i < a.length; i++) {\n\t\t\tif (!deepCompare(a[i], b[i], cache)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Date) return b instanceof Date && a.getTime() === b.getTime()\n\tif (a instanceof RegExp) return b instanceof RegExp && a.toString() === b.toString()\n\n\tif (a instanceof Set) {\n\t\tif (!(b instanceof Set) || a.size !== b.size) return false\n\t\tfor (const val of a) {\n\t\t\tlet found = false\n\t\t\tfor (const bVal of b) {\n\t\t\t\tif (deepCompare(val, bVal, cache)) {\n\t\t\t\t\tfound = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!found) return false\n\t\t}\n\t\treturn true\n\t}\n\tif (a instanceof Map) {\n\t\tif (!(b instanceof Map) || a.size !== b.size) return false\n\t\tfor (const [key, val] of a) {\n\t\t\tif (!b.has(key)) {\n\t\t\t\tlet foundMatch = false\n\t\t\t\tfor (const [bKey, bVal] of b) {\n\t\t\t\t\tif (deepCompare(key, bKey, cache) && deepCompare(val, bVal, cache)) {\n\t\t\t\t\t\tfoundMatch = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!foundMatch) return false\n\t\t\t} else if (!deepCompare(val, b.get(key), cache)) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\n\t// Compare own properties\n\tconst keysA = Object.keys(a)\n\tconst keysB = Object.keys(b)\n\tif (keysA.length !== keysB.length) return false\n\n\tfor (const key of keysA) {\n\t\tif (!Object.hasOwn(b, key) || !deepCompare(a[key], b[key], cache)) return false\n\t}\n\n\treturn true\n}\n\n// Internal use: Used for reactive sets/maps to differentiate between different reactive containers: `x.get('aKey')` vs. `x['aKey']`\nconst contentRefs = new WeakMap<object, any>()\nexport function contentRef(container: object) {\n\tif (!contentRefs.has(container))\n\t\tcontentRefs.set(\n\t\t\tcontainer,\n\t\t\tObject.seal(\n\t\t\t\tObject.create(null, {\n\t\t\t\t\tcontentOf: { value: container, writable: false, configurable: false },\n\t\t\t\t})\n\t\t\t)\n\t\t)\n\treturn contentRefs.get(container)\n}\n\n/**\n * Tags an object with a name\n * @param name - The name to tag the object with\n * @param obj - The object to tag\n * @returns The object with the tag\n */\nexport function tag<T extends object>(name: string, obj: T): T {\n\tObject.defineProperties(obj, {\n\t\t[Symbol.toStringTag]: {\n\t\t\tvalue: name,\n\t\t\twritable: false,\n\t\t\tconfigurable: true,\n\t\t},\n\t\ttoString: {\n\t\t\tvalue: () => name,\n\t\t\twritable: false,\n\t\t\tconfigurable: true,\n\t\t},\n\t})\n\treturn obj\n}\n\n/**\n * Renames a function with a new name\n * @param name - The new name for the function\n * @param fn - The function to rename\n * @returns The function with the new name\n */\nexport function named<T extends Function>(name: string, fn: T): T {\n\tObject.defineProperty(fn, 'name', {\n\t\tvalue: fn.name ? `${fn.name}::${name}` : name,\n\t\twritable: false,\n\t\tconfigurable: true,\n\t})\n\treturn fn\n}\n\nexport function* stringKeys(o: object) {\n\tfor (const key in o) yield key\n}\n\nconst _mode: string =\n\t(typeof process !== 'undefined' && process.env?.NODE_ENV) ||\n\t(typeof import.meta !== 'undefined' && (import.meta as any).env?.MODE) ||\n\t'production'\n\nexport const isDev = _mode === 'development'\nexport const isProd = _mode === 'production'\nexport const isTest = _mode === 'test'\n","// biome-ignore-all lint/suspicious/noConfusingVoidType: We *love* voids\n// Standardized decorator system that works with both Legacy and Modern decorators\n\nimport { isConstructor } from './utils'\n\n/**\n * Error thrown when decorator operations fail\n */\nexport class DecoratorError extends Error {\n\tconstructor(message: string) {\n\t\tsuper(message)\n\t\tthis.name = 'DecoratorException'\n\t}\n}\n//#region all decorator types\n\n// Used for get/set and method decorators\n/**\n * Legacy property decorator type for methods, getters, and setters\n */\nexport type LegacyPropertyDecorator<T> = (\n\ttarget: T,\n\tname: string | symbol,\n\tdescriptor: PropertyDescriptor\n) => any\n\n/**\n * Legacy class decorator type\n */\nexport type LegacyClassDecorator<T> = (target: T) => any\n\n/**\n * Modern method decorator type\n */\nexport type ModernMethodDecorator<T> = (target: T, context: ClassMethodDecoratorContext) => any\n\n/**\n * Modern getter decorator type\n */\nexport type ModernGetterDecorator<T> = (target: T, context: ClassGetterDecoratorContext) => any\n\n/**\n * Modern setter decorator type\n */\nexport type ModernSetterDecorator<T> = (target: T, context: ClassSetterDecoratorContext) => any\n\n/**\n * Modern accessor decorator type\n */\nexport type ModernAccessorDecorator<T> = (target: T, context: ClassAccessorDecoratorContext) => any\n\n/**\n * Modern class decorator type\n */\nexport type ModernClassDecorator<T> = (target: T, context: ClassDecoratorContext) => any\n\n//#endregion\n\ntype DDMethod<T> = (\n\toriginal: (this: T, ...args: any[]) => any,\n\ttarget: any,\n\tname: PropertyKey\n) => ((this: T, ...args: any[]) => any) | void\n\ntype DDGetter<T> = (\n\toriginal: (this: T) => any,\n\ttarget: any,\n\tname: PropertyKey\n) => ((this: T) => any) | void\n\ntype DDSetter<T> = (\n\toriginal: (this: T, value: any) => void,\n\ttarget: any,\n\tname: PropertyKey\n) => ((this: T, value: any) => void) | void\n\ntype DDClass<T> = <Ctor extends new (...args: any[]) => T = new (...args: any[]) => T>(\n\ttarget: Ctor\n) => Ctor | void\n/**\n * Description object for creating decorators that work with both Legacy and Modern decorator proposals\n */\nexport interface DecoratorDescription<T> {\n\t/** Handler for method decorators */\n\tmethod?: DDMethod<T>\n\t/** Handler for class decorators */\n\tclass?: DDClass<T>\n\t/** Handler for getter decorators */\n\tgetter?: DDGetter<T>\n\t/** Handler for setter decorators */\n\tsetter?: DDSetter<T>\n\t/** Default handler for any decorator type not explicitly defined */\n\tdefault?: (...args: any[]) => any\n}\n\n/**\n * Type for decorators that work with both Legacy and Modern decorator proposals\n * Automatically infers the correct decorator type based on the description\n */\nexport type Decorator<T, Description extends DecoratorDescription<T>> = (Description extends {\n\tmethod: DDMethod<T>\n}\n\t? LegacyPropertyDecorator<T> & ModernMethodDecorator<T>\n\t: unknown) &\n\t(Description extends { class: DDClass<new (...args: any[]) => T> }\n\t\t? LegacyClassDecorator<new (...args: any[]) => T> &\n\t\t\t\tModernClassDecorator<new (...args: any[]) => T>\n\t\t: unknown) &\n\t(Description extends { getter: DDGetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernGetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { setter: DDSetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernSetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { default: infer Signature } ? Signature : unknown)\n\n/**\n * Factory type for creating decorators that work with both Legacy and Modern decorator proposals\n */\nexport type DecoratorFactory<T> = <Description extends DecoratorDescription<T>>(\n\tdescription: Description\n) => (Description extends { method: DDMethod<T> }\n\t? LegacyPropertyDecorator<T> & ModernMethodDecorator<T>\n\t: unknown) &\n\t(Description extends { class: DDClass<new (...args: any[]) => T> }\n\t\t? LegacyClassDecorator<new (...args: any[]) => T> &\n\t\t\t\tModernClassDecorator<new (...args: any[]) => T>\n\t\t: unknown) &\n\t(Description extends { getter: DDGetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernGetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { setter: DDSetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernSetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { default: infer Signature } ? Signature : unknown)\n\n/**\n * Creates a decorator that works with Legacy decorator proposals\n * @param description - The decorator description object\n * @returns A decorator function compatible with Legacy decorators\n */\nexport function legacyDecorator<T = any>(description: DecoratorDescription<T>): any {\n\treturn function (\n\t\tthis: any,\n\t\ttarget: any,\n\t\tpropertyKey?: PropertyKey,\n\t\tdescriptor?: PropertyDescriptor,\n\t\t...args: any[]\n\t) {\n\t\tif (propertyKey === undefined) {\n\t\t\tif (isConstructor(target)) {\n\t\t\t\tif (!('class' in description)) throw new Error('Decorator cannot be applied to a class')\n\t\t\t\treturn description.class!(target)\n\t\t\t}\n\t\t} else if (typeof target === 'object' && ['string', 'symbol'].includes(typeof propertyKey)) {\n\t\t\tif (!descriptor) throw new Error('Decorator cannot be applied to a field')\n\t\t\telse if (typeof descriptor === 'object' && 'configurable' in descriptor) {\n\t\t\t\tif ('get' in descriptor || 'set' in descriptor) {\n\t\t\t\t\tif (!('getter' in description || 'setter' in description))\n\t\t\t\t\t\tthrow new Error('Decorator cannot be applied to a getter or setter')\n\t\t\t\t\tif ('getter' in description) {\n\t\t\t\t\t\tconst newGetter = description.getter!(descriptor.get as any, target, propertyKey)\n\t\t\t\t\t\tif (newGetter) descriptor.get = newGetter\n\t\t\t\t\t}\n\t\t\t\t\tif ('setter' in description) {\n\t\t\t\t\t\tconst newSetter = description.setter!(descriptor.set as any, target, propertyKey)\n\t\t\t\t\t\tif (newSetter) descriptor.set = newSetter\n\t\t\t\t\t}\n\t\t\t\t\treturn descriptor\n\t\t\t\t} else if (typeof descriptor.value === 'function') {\n\t\t\t\t\tif (!('method' in description)) throw new Error('Decorator cannot be applied to a method')\n\t\t\t\t\tconst newMethod = description.method!(descriptor.value, target, propertyKey)\n\t\t\t\t\tif (newMethod) descriptor.value = newMethod\n\t\t\t\t\treturn descriptor\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!('default' in description))\n\t\t\tthrow new Error('Decorator do not have a default implementation')\n\t\treturn description.default!.call(this, target, propertyKey, descriptor, ...args)\n\t}\n}\n\n/**\n * Creates a decorator that works with Modern decorator proposals\n * @param description - The decorator description object\n * @returns A decorator function compatible with Modern decorators\n */\nexport function modernDecorator<T = any>(description: DecoratorDescription<T>): any {\n\t/*return function (target: any, context?: DecoratorContext, ...args: any[]) {*/\n\treturn function (this: any, target: any, context?: DecoratorContext, ...args: any[]) {\n\t\tif (!context?.kind || typeof context.kind !== 'string') {\n\t\t\tif (!('default' in description))\n\t\t\t\tthrow new Error('Decorator do not have a default implementation')\n\t\t\treturn description.default!.call(this, target, context, ...args)\n\t\t}\n\t\tswitch (context.kind) {\n\t\t\tcase 'class':\n\t\t\t\tif (!('class' in description)) throw new Error('Decorator cannot be applied to a class')\n\t\t\t\treturn description.class!(target)\n\t\t\tcase 'field':\n\t\t\t\tthrow new Error('Decorator cannot be applied to a field')\n\t\t\tcase 'getter':\n\t\t\t\tif (!('getter' in description)) throw new Error('Decorator cannot be applied to a getter')\n\t\t\t\treturn description.getter!(target, target, context.name)\n\t\t\tcase 'setter':\n\t\t\t\tif (!('setter' in description)) throw new Error('Decorator cannot be applied to a setter')\n\t\t\t\treturn description.setter!(target, target, context.name)\n\t\t\tcase 'method':\n\t\t\t\tif (!('method' in description)) throw new Error('Decorator cannot be applied to a method')\n\t\t\t\treturn description.method!(target, target, context.name)\n\t\t\tcase 'accessor': {\n\t\t\t\tif (!('getter' in description || 'setter' in description))\n\t\t\t\t\tthrow new Error('Decorator cannot be applied to a getter or setter')\n\t\t\t\tconst rv: Partial<ClassAccessorDecoratorResult<any, any>> = {}\n\t\t\t\tif ('getter' in description) {\n\t\t\t\t\tconst newGetter = description.getter!(target.get, target, context.name)\n\t\t\t\t\tif (newGetter) rv.get = newGetter\n\t\t\t\t}\n\t\t\t\tif ('setter' in description) {\n\t\t\t\t\tconst newSetter = description.setter!(target.set, target, context.name)\n\t\t\t\t\tif (newSetter) rv.set = newSetter\n\t\t\t\t}\n\t\t\t\treturn rv\n\t\t\t}\n\t\t\t//return description.accessor?.(target, context.name, target)\n\t\t}\n\t}\n}\n\n/**\n * Detects if the decorator is being called in modern (Modern) or legacy (Legacy) mode\n * based on the arguments passed to the decorator function\n */\nfunction detectDecoratorMode(\n\t_target: any,\n\tcontextOrKey?: any,\n\t_descriptor?: any\n): 'modern' | 'legacy' {\n\t// Modern decorators have a context object as the second parameter\n\t// Legacy decorators have a string/symbol key as the second parameter\n\tif (\n\t\ttypeof contextOrKey === 'object' &&\n\t\tcontextOrKey !== null &&\n\t\ttypeof contextOrKey.kind === 'string'\n\t) {\n\t\treturn 'modern'\n\t}\n\treturn 'legacy'\n}\n\n/**\n * Main decorator factory that automatically detects and works with both Legacy and Modern decorator proposals\n * @param description - The decorator description object\n * @returns A decorator that works in both Legacy and Modern environments\n */\nexport const decorator: DecoratorFactory<any> = (description: DecoratorDescription<any>) => {\n\tconst modern = modernDecorator(description)\n\tconst legacy = legacyDecorator(description)\n\treturn ((target: any, contextOrKey?: any, ...args: any[]) => {\n\t\tconst mode = detectDecoratorMode(target, contextOrKey, args[0])\n\t\treturn mode === 'modern'\n\t\t\t? modern(target, contextOrKey, ...args)\n\t\t\t: legacy(target, contextOrKey, ...args)\n\t}) as any\n}\n\n/**\n * Generic class decorator type that works with both Legacy and Modern decorator proposals\n */\nexport type GenericClassDecorator<T> = LegacyClassDecorator<abstract new (...args: any[]) => T> &\n\tModernClassDecorator<abstract new (...args: any[]) => T>\n","import { decorator } from './decorator'\n\n// Integrated with `using` statement via Symbol.dispose\nconst fr = new FinalizationRegistry<() => void>((f) => f())\n/**\n * Symbol for marking destructor methods\n */\nexport const destructor = Symbol('destructor')\n/**\n * Symbol for accessing allocated values in destroyable objects\n */\nexport const allocatedValues = Symbol('allocated')\n/**\n * Error thrown when attempting to access a destroyed object\n */\nexport class DestructionError extends Error {\n\tstatic throw<_T = void>(msg: string) {\n\t\treturn () => {\n\t\t\tthrow new DestructionError(msg)\n\t\t}\n\t}\n\tconstructor(msg: string) {\n\t\tsuper(`Object is destroyed. ${msg}`)\n\t\tthis.name = 'DestroyedAccessError'\n\t}\n}\nconst destroyedHandler = {\n\t[Symbol.toStringTag]: 'MutTs Destroyable',\n\tget: DestructionError.throw('Cannot access destroyed object'),\n\tset: DestructionError.throw('Cannot access destroyed object'),\n} as const\n\nabstract class AbstractDestroyable<Allocated> {\n\tabstract [destructor](allocated: Allocated): void\n\t[Symbol.dispose](): void {\n\t\tthis[destructor](this as unknown as Allocated)\n\t}\n}\n\ninterface Destructor<Allocated> {\n\tdestructor(allocated: Allocated): void\n}\n\n/**\n * Creates a destroyable class with a base class and destructor object\n * @param base - The base class to extend\n * @param destructorObj - Object containing the destructor method\n * @returns A destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Partial<InstanceType<T>>,\n>(\n\tbase: T,\n\tdestructorObj: Destructor<Allocated>\n): (new (\n\t...args: ConstructorParameters<T>\n) => InstanceType<T> & { [allocatedValues]: Allocated }) & {\n\tdestroy(obj: InstanceType<T>): boolean\n\tisDestroyable(obj: InstanceType<T>): boolean\n}\n\n/**\n * Creates a destroyable class with only a destructor object (no base class)\n * @param destructorObj - Object containing the destructor method\n * @returns A destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<Allocated extends Record<PropertyKey, any> = Record<PropertyKey, any>>(\n\tdestructorObj: Destructor<Allocated>\n): (new () => { [allocatedValues]: Allocated }) & {\n\tdestroy(obj: any): boolean\n\tisDestroyable(obj: any): boolean\n}\n\n/**\n * Creates a destroyable class with a base class (requires [destructor] method)\n * @param base - The base class to extend\n * @returns A destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Record<PropertyKey, any> = Record<PropertyKey, any>,\n>(\n\tbase: T\n): (new (\n\t...args: ConstructorParameters<T>\n) => AbstractDestroyable<Allocated> & InstanceType<T> & { [allocatedValues]: Allocated }) & {\n\tdestroy(obj: InstanceType<T>): boolean\n\tisDestroyable(obj: InstanceType<T>): boolean\n}\n\n/**\n * Creates an abstract destroyable base class\n * @returns An abstract destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<\n\tAllocated extends Record<PropertyKey, any> = Record<PropertyKey, any>,\n>(): abstract new () => (AbstractDestroyable<Allocated> & {\n\t[allocatedValues]: Allocated\n}) & {\n\tdestroy(obj: any): boolean\n\tisDestroyable(obj: any): boolean\n}\n\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Record<PropertyKey, any> = Record<PropertyKey, any>,\n>(base?: T | Destructor<Allocated>, destructorObj?: Destructor<Allocated>) {\n\tif (base && typeof base !== 'function') {\n\t\tdestructorObj = base as Destructor<Allocated>\n\t\tbase = undefined\n\t}\n\tif (!base) {\n\t\tbase = class {} as T\n\t}\n\n\treturn class Destroyable extends (base as T) {\n\t\tstatic readonly destructors = new WeakMap<any, () => void>()\n\t\tstatic destroy(obj: Destroyable) {\n\t\t\tconst destructor = Destroyable.destructors.get(obj)\n\t\t\tif (!destructor) return false\n\t\t\tfr.unregister(obj[allocatedValues])\n\t\t\tDestroyable.destructors.delete(obj)\n\t\t\tObject.setPrototypeOf(obj, new Proxy({}, destroyedHandler))\n\t\t\t// Clear all own properties\n\t\t\tfor (const key of Object.getOwnPropertyNames(obj)) {\n\t\t\t\tdelete (obj as any)[key]\n\t\t\t}\n\t\t\tdestructor()\n\t\t\treturn true\n\t\t}\n\t\tstatic isDestroyable(obj: Destroyable) {\n\t\t\treturn Destroyable.destructors.has(obj)\n\t\t}\n\n\t\t[forwardProperties]!: PropertyKey[]\n\t\treadonly [allocatedValues]: Allocated\n\t\tconstructor(...args: any[]) {\n\t\t\tsuper(...args)\n\t\t\tconst allocated = {} as Allocated\n\t\t\tthis[allocatedValues] = allocated\n\t\t\t// @ts-expect-error `this` is an AbstractDestroyable\n\t\t\tconst myDestructor = destructorObj?.destructor ?? this[destructor]\n\t\t\tif (!myDestructor) {\n\t\t\t\tthrow new DestructionError('Destructor is not defined')\n\t\t\t}\n\t\t\tfunction destruction() {\n\t\t\t\tmyDestructor(allocated)\n\t\t\t}\n\t\t\tDestroyable.destructors.set(this, destruction)\n\t\t\tfr.register(this, destruction, allocated)\n\t\t}\n\t}\n}\n\nconst forwardProperties = Symbol('forwardProperties')\n/**\n * Decorator that marks properties to be stored in the allocated object and passed to the destructor\n * Use with accessor properties or explicit get/set pairs\n */\nexport const allocated = decorator({\n\tsetter(original, _target, propertyKey) {\n\t\treturn function (value) {\n\t\t\tthis[allocatedValues][propertyKey] = value\n\t\t\treturn original.call(this, value)\n\t\t}\n\t},\n})\n\n/**\n * Registers a callback to be called when an object is garbage collected\n * @param cb - The callback function to execute on garbage collection\n * @returns The object whose reference can be collected\n */\nexport function callOnGC(cb: () => void) {\n\tlet called = false\n\tconst forward = () => {\n\t\tif (called) return\n\t\tcalled = true\n\t\tcb()\n\t}\n\tfr.register(forward, cb, cb)\n\treturn forward\n}\n\n/**\n * Context Manager Protocol for `using` statement integration\n * Provides automatic resource cleanup when used with the `using` statement\n */\nexport interface ContextManager<T = any> {\n\t[Symbol.dispose](): void\n\tvalue?: T\n}\n","export interface ArrayDiffResult<T> {\n\tindexA: number\n\tindexB: number\n\tsliceA: T[]\n\tsliceB: T[]\n}\n\n/** Max edit distance before bailing out to a single \"replace all\" patch */\nconst BAILOUT_D = 256\n\n/**\n * Myers' diff producing grouped patches: `{indexA, indexB, sliceA, sliceB}[]`.\n * - O(N) for identical or prefix/suffix-only differences\n * - O(ND) for small D, with a hard bailout at D=BAILOUT_D → single replacement patch\n */\nexport function arrayDiff<T>(A: readonly T[], B: readonly T[]): ArrayDiffResult<T>[] {\n\tlet start = 0\n\tlet endA = A.length\n\tlet endB = B.length\n\n\t// Trim common prefix\n\twhile (start < endA && start < endB && A[start] === B[start]) start++\n\t// Trim common suffix\n\twhile (endA > start && endB > start && A[endA - 1] === B[endB - 1]) {\n\t\tendA--\n\t\tendB--\n\t}\n\n\tconst lenA = endA - start\n\tconst lenB = endB - start\n\n\tif (lenA === 0 && lenB === 0) return []\n\tif (lenA === 0)\n\t\treturn [{ indexA: start, indexB: start, sliceA: [], sliceB: B.slice(start, endB) }]\n\tif (lenB === 0)\n\t\treturn [{ indexA: start, indexB: start, sliceA: A.slice(start, endA), sliceB: [] }]\n\n\t// Myers with bailout\n\tconst maxD = Math.min(lenA + lenB, BAILOUT_D)\n\tconst vSize = 2 * maxD + 1\n\tconst vOffset = maxD\n\tconst V = new Int32Array(vSize)\n\tV[vOffset + 1] = 0\n\tconst history: Int32Array[] = []\n\n\tfor (let d = 0; d <= maxD; d++) {\n\t\tfor (let k = -d; k <= d; k += 2) {\n\t\t\tlet x: number\n\t\t\tif (k === -d || (k !== d && V[vOffset + k - 1] < V[vOffset + k + 1])) {\n\t\t\t\tx = V[vOffset + k + 1]\n\t\t\t} else {\n\t\t\t\tx = V[vOffset + k - 1] + 1\n\t\t\t}\n\t\t\tlet y = x - k\n\t\t\twhile (x < lenA && y < lenB && A[start + x] === B[start + y]) {\n\t\t\t\tx++\n\t\t\t\ty++\n\t\t\t}\n\t\t\tV[vOffset + k] = x\n\t\t\tif (x >= lenA && y >= lenB) return buildPatches(history, A, B, start, x, y, d, k, vOffset)\n\t\t}\n\t\thistory.push(new Int32Array(V))\n\t}\n\n\t// Bailout: too many differences\n\treturn [\n\t\t{ indexA: start, indexB: start, sliceA: A.slice(start, endA), sliceB: B.slice(start, endB) },\n\t]\n}\n\nfunction buildPatches<T>(\n\thistory: Int32Array[],\n\tA: readonly T[],\n\tB: readonly T[],\n\toffset: number,\n\tfinalX: number,\n\tfinalY: number,\n\tfinalD: number,\n\tfinalK: number,\n\tvOffset: number\n): ArrayDiffResult<T>[] {\n\t// Backtrack from (finalX, finalY) at step finalD to step 0, collecting ops in reverse\n\tconst ops: (0 | 1 | 2)[] = [] // 0=eq, 1=ins, 2=del\n\tlet x = finalX\n\tlet y = finalY\n\tlet k = finalK\n\n\tfor (let d = finalD; d > 0; d--) {\n\t\tconst prev = history[d - 1]\n\t\tlet prevK: number\n\t\tlet down: boolean\n\t\tif (k === -d) {\n\t\t\tprevK = k + 1\n\t\t\tdown = true\n\t\t} else if (k === d) {\n\t\t\tprevK = k - 1\n\t\t\tdown = false\n\t\t} else if (prev[vOffset + k - 1] < prev[vOffset + k + 1]) {\n\t\t\tprevK = k + 1\n\t\t\tdown = true\n\t\t} else {\n\t\t\tprevK = k - 1\n\t\t\tdown = false\n\t\t}\n\n\t\tconst prevXEnd = prev[vOffset + prevK]\n\t\tconst prevYEnd = prevXEnd - prevK\n\t\tconst xStart = down ? prevXEnd : prevXEnd + 1\n\t\tconst yStart = down ? prevYEnd + 1 : prevXEnd + 1 - k\n\n\t\t// Diagonal matches (pushed in reverse)\n\t\twhile (x > xStart && y > yStart) {\n\t\t\tops.push(0)\n\t\t\tx--\n\t\t\ty--\n\t\t}\n\t\t// The edit step\n\t\tif (down) {\n\t\t\tops.push(1) // ins\n\t\t\ty--\n\t\t} else {\n\t\t\tops.push(2) // del\n\t\t\tx--\n\t\t}\n\t\tk = prevK\n\t}\n\n\t// Walk ops forward (they were pushed in reverse), grouping contiguous edits\n\tconst patches: ArrayDiffResult<T>[] = []\n\tlet currA = offset\n\tlet currB = offset\n\tlet sliceA: T[] = []\n\tlet sliceB: T[] = []\n\tlet patchA = -1\n\tlet patchB = -1\n\n\tconst flush = () => {\n\t\tif (patchA !== -1) {\n\t\t\tpatches.push({ indexA: patchA, indexB: patchB, sliceA, sliceB })\n\t\t\tsliceA = []\n\t\t\tsliceB = []\n\t\t\tpatchA = -1\n\t\t}\n\t}\n\n\tfor (let i = ops.length - 1; i >= 0; i--) {\n\t\tconst op = ops[i]\n\t\tif (op === 0) {\n\t\t\tflush()\n\t\t\tcurrA++\n\t\t\tcurrB++\n\t\t} else if (op === 1) {\n\t\t\tif (patchA === -1) {\n\t\t\t\tpatchA = currA\n\t\t\t\tpatchB = currB\n\t\t\t}\n\t\t\tsliceB.push(B[currB++])\n\t\t} else {\n\t\t\tif (patchA === -1) {\n\t\t\t\tpatchA = currA\n\t\t\t\tpatchB = currB\n\t\t\t}\n\t\t\tsliceA.push(A[currA++])\n\t\t}\n\t}\n\tflush()\n\treturn patches\n}\n","/**\n * Base type for event maps - all event handlers must be functions\n */\nexport type EventsBase = Record<string, (...args: any[]) => void>\n\nconst events = Symbol('events')\nconst hooks = Symbol('hooks')\n\nconst eventBehavior = {\n\ton<EventType extends keyof EventsBase>(\n\t\teventOrEvents: EventType | Partial<EventsBase>,\n\t\tcb?: EventsBase[EventType]\n\t): (this: Eventful<any>) => void {\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof EventsBase)[]) {\n\t\t\t\tthis.on(e, eventOrEvents[e]!)\n\t\t\t}\n\t\t} else if (cb !== undefined) {\n\t\t\tconst callbacks = this[events].get(eventOrEvents) ?? new Set<EventsBase[EventType]>()\n\t\t\tif (!callbacks.has(cb)) callbacks.add(cb)\n\t\t\tthis[events].set(eventOrEvents, callbacks)\n\t\t}\n\t\treturn () => this.off(eventOrEvents, cb)\n\t},\n\toff<EventType extends keyof EventsBase>(\n\t\teventOrEvents: EventType | Partial<EventsBase>,\n\t\tcb?: EventsBase[EventType]\n\t): void {\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof EventsBase)[]) {\n\t\t\t\tthis.off(e, eventOrEvents[e])\n\t\t\t}\n\t\t} else if (cb !== null && cb !== undefined) {\n\t\t\tconst callbacks = this[events].get(eventOrEvents)\n\t\t\tif (callbacks) {\n\t\t\t\tcallbacks.delete(cb)\n\t\t\t\tif (!callbacks.size) this[events].delete(eventOrEvents)\n\t\t\t}\n\t\t} else {\n\t\t\t// Remove all listeners for this event\n\t\t\tthis[events].delete(eventOrEvents)\n\t\t}\n\t},\n\temit<EventType extends keyof EventsBase>(\n\t\tevent: EventType,\n\t\t...args: Parameters<EventsBase[EventType]>\n\t) {\n\t\tconst callbacks = this[events].get(event)\n\t\tif (callbacks) for (const cb of callbacks) cb.apply(this, args)\n\t\tfor (const cb of this[hooks]) cb.call(this, event, ...args)\n\t},\n}\n\nfunction perEvent(\n\teventful: Eventful<any>,\n\tfct: (event: string, ...args: any[]) => void,\n\tuse?: 'use'\n) {\n\tconst cache = new Map<string, (...args: any[]) => any>()\n\treturn new Proxy(fct, {\n\t\tget(target, prop: PropertyKey) {\n\t\t\tif (typeof prop !== 'string') return target[prop]\n\t\t\tif (use && !eventful[events].has(prop) && !eventful[hooks].size) return () => {}\n\n\t\t\t// Return cached function or create and cache\n\t\t\tlet cached = cache.get(prop)\n\t\t\tif (!cached) {\n\t\t\t\tcached = (...args: any[]) => fct.apply(eventful, [prop, ...args])\n\t\t\t\tcache.set(prop, cached)\n\t\t\t}\n\t\t\treturn cached\n\t\t},\n\t})\n}\n\n/**\n * A type-safe event system that provides a clean API for event handling\n * @template Events - The event map defining event names and their handler signatures\n */\nexport class Eventful<Events extends EventsBase> {\n\tprivate readonly [events] = new Map<keyof Events, Set<(...args: any[]) => void>>()\n\tprivate readonly [hooks] = new Set<(...args: any[]) => void>()\n\n\tpublic hook(\n\t\tcb: <EventType extends keyof Events>(\n\t\t\tevent: EventType,\n\t\t\t...args: Parameters<Events[EventType]>\n\t\t) => void\n\t): () => void {\n\t\tthis[hooks].add(cb)\n\t\treturn () => {\n\t\t\tthis[hooks].delete(cb)\n\t\t}\n\t}\n\n\tpublic on = perEvent(this, eventBehavior.on) as ((events: Partial<Events>) => void) &\n\t\t(<EventType extends keyof Events>(event: EventType, cb: Events[EventType]) => () => void) & {\n\t\t\t[event in keyof Events]: (cb: Events[event]) => () => void\n\t\t}\n\tpublic off = perEvent(this, eventBehavior.off) as ((events: Partial<Events>) => void) &\n\t\t(<EventType extends keyof Events>(event: EventType, cb?: Events[EventType]) => void) & {\n\t\t\t[event in keyof Events]: (cb?: Events[event]) => void\n\t\t}\n\n\tpublic emit = perEvent(this, eventBehavior.emit, 'use') as (<EventType extends keyof Events>(\n\t\tevent: EventType,\n\t\t...args: Parameters<Events[EventType]>\n\t) => void) &\n\t\tEvents\n}\n","/**\n * Creates a flavored (extensible) version of a function with chainable property modifiers.\n *\n * Each property defined in `flavors` returns a new flavored function that transforms\n * how the original function is called. This enables a fluent API where properties\n * create specialized variants of the base function.\n *\n * @param fn - The base function to flavor\n * @param flavors - Object defining the flavor properties (getters or methods)\n * @returns A proxy of the function with the flavor properties attached\n *\n * @example\n * ```typescript\n * function greet(name: string, options?: { loud?: boolean }) {\n *   const greeting = `Hello, ${name}!`\n *   return options?.loud ? greeting.toUpperCase() : greeting\n * }\n *\n * const flavoredGreet = flavored(greet, {\n *   get loud() {\n *     return createFlavor(this, (name, opts) => [name, { ...opts, loud: true }])\n *   }\n * })\n *\n * flavoredGreet('World') // \"Hello, World!\"\n * flavoredGreet.loud('World') // \"HELLO, WORLD!\"\n * ```\n */\nimport { named } from './utils'\n\n/**\n * Creates a flavored (extensible) version of a function with chainable property modifiers.\n */\nexport function flavored<T extends (...args: any[]) => any, F>(\n\tfn: T,\n\tflavors: F & ThisType<T & F>\n): T & F {\n\t// Store flavors for recursive flavoring\n\t;(fn as any).flavors = flavors\n\n\treturn new Proxy(fn, {\n\t\tget(target, prop, receiver) {\n\t\t\tif (prop in flavors) {\n\t\t\t\treturn Reflect.get(flavors, prop, receiver)\n\t\t\t}\n\t\t\treturn (target as any)[prop]\n\t\t},\n\t}) as T & F\n}\n\n/**\n * Creates a new flavored function that transforms arguments before calling the base.\n *\n * @param fn - The base flavored function\n * @param transform - Function that receives the original arguments and returns transformed arguments\n * @returns A new flavored function with the transformation applied\n *\n * @example\n * ```typescript\n * const loudGreet = createFlavor(greet, (name, opts) => [name, { ...opts, loud: true }])\n * ```\n */\nexport function createFlavor<T extends (...args: any[]) => any>(\n\tfn: T,\n\ttransform: (...args: Parameters<T>) => Parameters<T>,\n\tname?: string\n): T {\n\tconst fct = function flavorWrapper(this: any, ...args: Parameters<T>) {\n\t\treturn fn.apply(this, transform(...args))\n\t}\n\tif (name) named(name, fct)\n\n\treturn flavored(fct as T, (fn as any).flavors || {})\n}\n\n/**\n * Creates a new flavored function that merges options objects at a specific index.\n * By default, uses the function's arity (length) as the index for options.\n *\n * @param fn - The base flavored function\n * @param defaultOptions - Options to merge\n * @param optionsIndex - Optional explicit index for options (defaults to fn.length)\n * @param name - Optional name for the wrapper\n * @returns A new flavored function\n */\nexport function flavorOptions<T extends (...args: any[]) => any>(\n\tfn: T,\n\tdefaultOptions: Record<string, any>,\n\topts: {\n\t\toptionsIndex?: number\n\t\tname?: string\n\t} = {}\n): T {\n\t// If the function is already flavorOptions-wrapped, it might have an index stored\n\tconst targetIndex = opts.optionsIndex ?? (fn as any).optionsIndex ?? fn.length\n\n\tconst fct = function flavorOptionsWrapper(this: any, ...args: any[]) {\n\t\tconst newArgs = [...args]\n\n\t\t// Ensure we have enough arguments to reach the options index\n\t\twhile (newArgs.length <= targetIndex) {\n\t\t\tnewArgs.push(undefined)\n\t\t}\n\n\t\tconst currentOptions = newArgs[targetIndex]\n\t\tconst isObject =\n\t\t\tcurrentOptions !== null &&\n\t\t\ttypeof currentOptions === 'object' &&\n\t\t\t!Array.isArray(currentOptions)\n\n\t\tnewArgs[targetIndex] = isObject ? { ...defaultOptions, ...currentOptions } : defaultOptions\n\n\t\treturn fn.apply(this, newArgs)\n\t}\n\n\tif (opts.name) named(`${fn.name}.${opts.name}`, fct)\n\n\t// Preserve arity and options track\n\tObject.defineProperty(fct, 'length', { value: fn.length })\n\t;(fct as any).optionsIndex = targetIndex\n\n\treturn flavored(fct as T, (fn as any).flavors || {})\n}\n","/**\n * Symbol for defining custom getter logic for numeric index access\n */\nexport const getAt = Symbol('getAt')\n/**\n * Symbol for defining custom setter logic for numeric index access\n */\nexport const setAt = Symbol('setAt')\n\ninterface IndexingAt<Items = any> {\n\t[getAt](index: number): Items\n}\n\ninterface Accessor<T, Items> {\n\tget(this: T, index: number): Items\n\tset?(this: T, index: number, value: Items): void\n\tgetLength?(this: T): number\n\tsetLength?(this: T, value: number): void\n}\n\nabstract class AbstractGetAt<Items = any> {\n\tabstract [getAt](index: number): Items\n}\n\n/**\n * Creates an indexable class with a base class and accessor object\n * @param base - The base class to extend\n * @param accessor - Object containing get/set methods for numeric index access\n * @returns A class that supports numeric index access\n */\nexport function Indexable<Items, Base extends abstract new (...args: any[]) => any>(\n\tbase: Base,\n\taccessor: Accessor<InstanceType<Base>, Items>\n): new (\n\t...args: ConstructorParameters<Base>\n) => InstanceType<Base> & { [x: number]: Items }\n\n/**\n * Creates an indexable class with only an accessor object (no base class)\n * @param accessor - Object containing get/set methods for numeric index access\n * @returns A class that supports numeric index access\n */\nexport function Indexable<Items>(accessor: Accessor<any, Items>): new () => { [x: number]: Items }\n\n/**\n * Creates an indexable class with a base class that has [getAt] method\n * @param base - The base class that implements [getAt] method\n * @returns A class that supports numeric index access using the base class's [getAt] method\n */\nexport function Indexable<Base extends new (...args: any[]) => IndexingAt>(\n\tbase: Base\n): new (\n\t...args: ConstructorParameters<Base>\n) => InstanceType<Base> & { [x: number]: AtReturnType<InstanceType<Base>> }\n\n/**\n * Creates an abstract indexable base class\n * @returns An abstract class that supports numeric index access\n */\nexport function Indexable<Items>(): abstract new (\n\t...args: any[]\n) => AbstractGetAt & { [x: number]: Items }\n\nexport function Indexable<Items, Base extends abstract new (...args: any[]) => any>(\n\tbase?: Base | Accessor<Base, Items>,\n\taccessor?: Accessor<Base, Items>\n) {\n\tif (base && typeof base !== 'function') {\n\t\taccessor = base as Accessor<Base, Items>\n\t\tbase = undefined\n\t}\n\tif (!base) {\n\t\t//@ts-expect-error\n\t\tbase = class {} as Base\n\t}\n\tif (!accessor) {\n\t\taccessor = {\n\t\t\tget(this: any, index: number) {\n\t\t\t\tif (typeof this[getAt] !== 'function') {\n\t\t\t\t\tthrow new Error('Indexable class must have an [getAt] method')\n\t\t\t\t}\n\t\t\t\treturn this[getAt](index)\n\t\t\t},\n\t\t\tset(this: any, index: number, value: Items) {\n\t\t\t\tif (typeof this[setAt] !== 'function') {\n\t\t\t\t\tthrow new Error('Indexable class has read-only numeric index access')\n\t\t\t\t}\n\t\t\t\tthis[setAt](index, value)\n\t\t\t},\n\t\t}\n\t}\n\n\tabstract class Indexable extends (base as Base) {\n\t\t[x: number]: Items\n\t}\n\n\tObject.setPrototypeOf(\n\t\tIndexable.prototype,\n\t\tnew Proxy((base as Base).prototype, {\n\t\t\t//@ts-expect-error\n\t\t\t[Symbol.toStringTag]: 'MutTs Indexable',\n\t\t\tget(target, prop, receiver) {\n\t\t\t\tif (prop in target) {\n\t\t\t\t\tconst getter = Object.getOwnPropertyDescriptor(target, prop)?.get\n\t\t\t\t\treturn getter ? getter.call(receiver) : target[prop]\n\t\t\t\t}\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.getLength) return accessor.getLength.call(receiver)\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) {\n\t\t\t\t\t\treturn accessor.get!.call(receiver, numProp) as Items\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn undefined\n\t\t\t},\n\t\t\tset(target, prop, value, receiver) {\n\t\t\t\tif (prop in target) {\n\t\t\t\t\tconst setter = Object.getOwnPropertyDescriptor(target, prop)?.set\n\t\t\t\t\tif (setter) setter.call(receiver, value)\n\t\t\t\t\telse target[prop] = value\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.setLength) {\n\t\t\t\t\t\taccessor.setLength.call(receiver, value)\n\t\t\t\t\t\treturn true\n\t\t\t\t\t}\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) {\n\t\t\t\t\t\tif (!accessor.set) throw new Error('Indexable class has read-only numeric index access')\n\t\t\t\t\t\taccessor.set!.call(receiver, numProp, value)\n\t\t\t\t\t\treturn true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tObject.defineProperty(receiver, prop, {\n\t\t\t\t\tvalue,\n\t\t\t\t\twritable: true,\n\t\t\t\t\tenumerable: true,\n\t\t\t\t\tconfigurable: true,\n\t\t\t\t})\n\t\t\t\treturn true\n\t\t\t},\n\t\t\thas(target, prop) {\n\t\t\t\tif (prop in target) return true\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.getLength) return true\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) return true\n\t\t\t\t}\n\t\t\t\treturn false\n\t\t\t},\n\t\t\townKeys(target) {\n\t\t\t\tconst keys = Reflect.ownKeys(target)\n\t\t\t\tif (accessor.getLength) {\n\t\t\t\t\tkeys.push('length')\n\t\t\t\t\tconst len = accessor.getLength.call(this as any)\n\t\t\t\t\tfor (let i = 0; i < len; i++) keys.push(String(i))\n\t\t\t\t}\n\t\t\t\treturn keys\n\t\t\t},\n\t\t\tgetOwnPropertyDescriptor(target, prop) {\n\t\t\t\tif (prop in target) return Object.getOwnPropertyDescriptor(target, prop)\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.getLength) {\n\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\tenumerable: false,\n\t\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\t\tget: () => accessor.getLength!.call(this as any),\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) {\n\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\tenumerable: true,\n\t\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\t\tget: () => accessor.get!.call(this as any, numProp),\n\t\t\t\t\t\t\tset: accessor.set\n\t\t\t\t\t\t\t\t? (v: any) => accessor.set!.call(this as any, numProp, v)\n\t\t\t\t\t\t\t\t: undefined,\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn undefined\n\t\t\t},\n\t\t})\n\t)\n\treturn Indexable\n}\n\ntype AtReturnType<T> = T extends { [getAt](index: number): infer R } ? R : never\n\n/**\n * Symbol for accessing the forwarded array in ArrayReadForward\n */\nexport const forwardArray = Symbol('forwardArray')\n\n/**\n * A read-only array forwarder that implements all reading/iterating methods of Array\n * but does not implement modification methods.\n *\n * The constructor takes a callback that returns an array, and all methods forward\n * their behavior to the result of that callback.\n */\nexport class ArrayReadForward<T> {\n\tprotected get [forwardArray](): readonly T[] {\n\t\tthrow new Error('ArrayReadForward is not implemented')\n\t}\n\n\t/**\n\t * Get the length of the array\n\t */\n\tget length(): number {\n\t\treturn this[forwardArray].length\n\t}\n\n\t/**\n\t * Get an element at a specific index\n\t */\n\t[index: number]: T | undefined\n\n\t/**\n\t * Iterator protocol support\n\t */\n\t[Symbol.iterator](): Iterator<T> {\n\t\treturn this[forwardArray][Symbol.iterator]()\n\t}\n\n\t// Reading/Iterating methods\n\n\t/**\n\t * Creates a new array with the results of calling a provided function on every element\n\t */\n\tmap<U>(callbackfn: (value: T, index: number, array: readonly T[]) => U, thisArg?: any): U[] {\n\t\treturn this[forwardArray].map(callbackfn, thisArg)\n\t}\n\n\t/**\n\t * Creates a new array with all elements that pass the test implemented by the provided function\n\t */\n\tfilter<S extends T>(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => value is S,\n\t\tthisArg?: any\n\t): S[]\n\tfilter(predicate: (value: T, index: number, array: readonly T[]) => unknown, thisArg?: any): T[]\n\tfilter(predicate: (value: T, index: number, array: readonly T[]) => unknown, thisArg?: any): T[] {\n\t\treturn this[forwardArray].filter(predicate, thisArg)\n\t}\n\n\t/**\n\t * Executes a reducer function on each element of the array, resulting in a single output value\n\t */\n\treduce(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T\n\t): T\n\treduce(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T,\n\t\tinitialValue: T\n\t): T\n\treduce<U>(\n\t\tcallbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: readonly T[]) => U,\n\t\tinitialValue: U\n\t): U\n\treduce(\n\t\tcallbackfn: (\n\t\t\tpreviousValue: any,\n\t\t\tcurrentValue: T,\n\t\t\tcurrentIndex: number,\n\t\t\tarray: readonly T[]\n\t\t) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn initialValue !== undefined\n\t\t\t? this[forwardArray].reduce(callbackfn, initialValue)\n\t\t\t: this[forwardArray].reduce(callbackfn)\n\t}\n\n\t/**\n\t * Executes a reducer function on each element of the array (right-to-left), resulting in a single output value\n\t */\n\treduceRight(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T\n\t): T\n\treduceRight(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T,\n\t\tinitialValue: T\n\t): T\n\treduceRight<U>(\n\t\tcallbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: readonly T[]) => U,\n\t\tinitialValue: U\n\t): U\n\treduceRight(\n\t\tcallbackfn: (\n\t\t\tpreviousValue: any,\n\t\t\tcurrentValue: T,\n\t\t\tcurrentIndex: number,\n\t\t\tarray: readonly T[]\n\t\t) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn initialValue !== undefined\n\t\t\t? this[forwardArray].reduceRight(callbackfn, initialValue)\n\t\t\t: this[forwardArray].reduceRight(callbackfn)\n\t}\n\n\t/**\n\t * Executes a provided function once for each array element\n\t */\n\tforEach(callbackfn: (value: T, index: number, array: readonly T[]) => void, thisArg?: any): void {\n\t\tthis[forwardArray].forEach(callbackfn, thisArg)\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array that satisfies the provided testing function\n\t */\n\tfind<S extends T>(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfind(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined\n\tfind(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined {\n\t\treturn this[forwardArray].find(predicate, thisArg)\n\t}\n\n\t/**\n\t * Returns the index of the first element in the array that satisfies the provided testing function\n\t */\n\tfindIndex(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn this[forwardArray].findIndex(predicate, thisArg)\n\t}\n\n\t/**\n\t * Returns the value of the last element in the array that satisfies the provided testing function\n\t */\n\tfindLast<S extends T>(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfindLast(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined\n\tfindLast(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined {\n\t\treturn this[forwardArray].findLast(predicate, thisArg)\n\t}\n\n\t/**\n\t * Returns the index of the last element in the array that satisfies the provided testing function\n\t */\n\tfindLastIndex(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn this[forwardArray].findLastIndex(predicate, thisArg)\n\t}\n\n\t/**\n\t * Determines whether an array includes a certain value among its entries\n\t */\n\tincludes(searchElement: T, fromIndex?: number): boolean {\n\t\treturn this[forwardArray].includes(searchElement, fromIndex)\n\t}\n\n\t/**\n\t * Returns the first index at which a given element can be found in the array\n\t */\n\tindexOf(searchElement: T, fromIndex?: number): number {\n\t\treturn this[forwardArray].indexOf(searchElement, fromIndex)\n\t}\n\n\t/**\n\t * Returns the last index at which a given element can be found in the array\n\t */\n\tlastIndexOf(searchElement: T, fromIndex?: number): number {\n\t\treturn this[forwardArray].lastIndexOf(searchElement, fromIndex)\n\t}\n\n\t/**\n\t * Returns a shallow copy of a portion of an array into a new array object\n\t */\n\tslice(start?: number, end?: number): T[] {\n\t\treturn this[forwardArray].slice(start, end)\n\t}\n\n\t/**\n\t * Returns a new array comprised of this array joined with other array(s) and/or value(s)\n\t */\n\tconcat(...items: ConcatArray<T>[]): T[]\n\tconcat(...items: (T | ConcatArray<T>)[]): T[]\n\tconcat(...items: (T | ConcatArray<T>)[]): T[] {\n\t\treturn this[forwardArray].concat(...items)\n\t}\n\n\t/**\n\t * Tests whether all elements in the array pass the test implemented by the provided function\n\t */\n\tevery(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): boolean {\n\t\treturn this[forwardArray].every(predicate, thisArg)\n\t}\n\n\t/**\n\t * Tests whether at least one element in the array passes the test implemented by the provided function\n\t */\n\tsome(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): boolean {\n\t\treturn this[forwardArray].some(predicate, thisArg)\n\t}\n\n\t/**\n\t * Joins all elements of an array into a string\n\t */\n\tjoin(separator?: string): string {\n\t\treturn this[forwardArray].join(separator)\n\t}\n\n\t/**\n\t * Returns a new array iterator that contains the keys for each index in the array\n\t */\n\tkeys(): IterableIterator<number> {\n\t\treturn this[forwardArray].keys()\n\t}\n\n\t/**\n\t * Returns a new array iterator that contains the values for each index in the array\n\t */\n\tvalues(): IterableIterator<T> {\n\t\treturn this[forwardArray].values()\n\t}\n\n\t/**\n\t * Returns a new array iterator that contains the key/value pairs for each index in the array\n\t */\n\tentries(): IterableIterator<[number, T]> {\n\t\treturn this[forwardArray].entries()\n\t}\n\n\t/**\n\t * Returns a string representation of the array\n\t */\n\ttoString(): string {\n\t\treturn this[forwardArray].toString()\n\t}\n\n\t/**\n\t * Returns a localized string representing the array\n\t */\n\ttoLocaleString(\n\t\tlocales?: string | string[],\n\t\toptions?: Intl.NumberFormatOptions | Intl.DateTimeFormatOptions\n\t): string {\n\t\treturn this[forwardArray].toLocaleString(locales as string | string[], options)\n\t}\n\n\t/**\n\t * Returns the element at the specified index, or undefined if the index is out of bounds\n\t */\n\tat(index: number): T | undefined {\n\t\treturn this[forwardArray].at(index)\n\t}\n\n\t/**\n\t * Returns a new array with all sub-array elements concatenated into it recursively up to the specified depth\n\t */\n\tflat(depth?: number): T[] {\n\t\treturn this[forwardArray].flat(depth) as T[]\n\t}\n\n\t/**\n\t * Returns a new array formed by applying a given callback function to each element of the array,\n\t * and then flattening the result by one level\n\t */\n\tflatMap<U, This = undefined>(\n\t\tcallback: (this: This, value: T, index: number, array: readonly T[]) => U | ReadonlyArray<U>,\n\t\tthisArg?: This\n\t): U[] {\n\t\treturn this[forwardArray].flatMap(callback as any, thisArg)\n\t}\n\n\t/**\n\t * Returns a new array with elements in reversed order (ES2023)\n\t */\n\ttoReversed(): T[] {\n\t\treturn this[forwardArray].toReversed?.() ?? [...this[forwardArray]].reverse()\n\t}\n\n\t/**\n\t * Returns a new array with elements sorted (ES2023)\n\t */\n\ttoSorted(compareFn?: ((a: T, b: T) => number) | undefined): T[] {\n\t\treturn this[forwardArray].toSorted?.(compareFn) ?? [...this[forwardArray]].sort(compareFn)\n\t}\n\n\t/**\n\t * Returns a new array with some elements removed and/or replaced at a given index (ES2023)\n\t */\n\ttoSpliced(start: number, deleteCount?: number, ...items: T[]): T[] {\n\t\tif (deleteCount === undefined) return this[forwardArray].toSpliced(start)\n\t\treturn this[forwardArray].toSpliced(start, deleteCount, ...items)\n\t}\n\n\t/**\n\t * Returns a new array with the element at the given index replaced with the given value (ES2023)\n\t */\n\twith(index: number, value: T): T[] {\n\t\treturn this[forwardArray].with(index, value)\n\t}\n\tget [Symbol.unscopables]() {\n\t\treturn this[forwardArray][Symbol.unscopables]\n\t}\n}\n","/// <reference lib=\"esnext.collection\" />\n\n/**\n * Uses weak references but still may iterate through them\n * Note: The behavior is highly dependant on the garbage collector - some entries are perhaps deemed to be collected: don't resuscitate them\n */\nexport class IterableWeakMap<K extends WeakKey, V> implements Map<K, V> {\n\tprivate uuids = new WeakMap<K, string>()\n\tprivate refs: Record<string, [WeakRef<K>, any]> = {}\n\tprivate readonly registry: FinalizationRegistry<string>\n\n\tconstructor(entries?: Iterable<[K, V]>) {\n\t\t// Create a FinalizationRegistry to clean up refs when keys are garbage collected\n\t\tthis.registry = new FinalizationRegistry((uuid: string) => {\n\t\t\tdelete this.refs[uuid]\n\t\t})\n\t\tif (entries) for (const [k, v] of entries) this.set(k, v)\n\t}\n\tprivate createIterator<I>(cb: (key: K, value: V) => I): MapIterator<I> {\n\t\tconst { refs } = this\n\t\treturn (function* () {\n\t\t\tfor (const uuid of Object.keys(refs)) {\n\t\t\t\tconst [keyRef, value] = refs[uuid]\n\t\t\t\tconst key = keyRef.deref()\n\t\t\t\tif (key) yield cb(key, value)\n\t\t\t\telse delete refs[uuid]\n\t\t\t}\n\t\t\treturn undefined\n\t\t})()\n\t}\n\tclear(): void {\n\t\t// Unregister all keys from the FinalizationRegistry\n\t\tfor (const uuid of Object.keys(this.refs)) {\n\t\t\tconst key = this.refs[uuid][0].deref()\n\t\t\tif (key) this.registry.unregister(key)\n\t\t}\n\t\tthis.uuids = new WeakMap<K, string>()\n\t\tthis.refs = {}\n\t}\n\tdelete(key: K): boolean {\n\t\tconst uuid = this.uuids.get(key)\n\t\tif (!uuid) return false\n\t\tdelete this.refs[uuid]\n\t\tthis.uuids.delete(key)\n\t\tthis.registry.unregister(key)\n\t\treturn true\n\t}\n\tforEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tfor (const [k, v] of this) callbackfn.call(thisArg ?? this, v, k, thisArg ?? this)\n\t}\n\tget(key: K): V | undefined {\n\t\tconst uuid = this.uuids.get(key)\n\t\tif (!uuid) return undefined\n\t\treturn this.refs[uuid][1]\n\t}\n\thas(key: K): boolean {\n\t\treturn this.uuids.has(key)\n\t}\n\tset(key: K, value: V): this {\n\t\tlet uuid = this.uuids.get(key)\n\t\tif (uuid) {\n\t\t\tthis.refs[uuid][1] = value\n\t\t} else {\n\t\t\tuuid = crypto.randomUUID()\n\t\t\tthis.uuids.set(key, uuid)\n\t\t\tthis.refs[uuid] = [new WeakRef(key), value]\n\t\t\t// Register key for cleanup when garbage collected\n\t\t\tthis.registry.register(key, uuid, key)\n\t\t}\n\t\treturn this\n\t}\n\tget size(): number {\n\t\treturn [...this].length\n\t}\n\tentries(): MapIterator<[K, V]> {\n\t\treturn this.createIterator((key, value) => [key, value] as [K, V])\n\t}\n\tkeys(): MapIterator<K> {\n\t\treturn this.createIterator((key, _value) => key)\n\t}\n\tvalues(): MapIterator<V> {\n\t\treturn this.createIterator((_key, value) => value)\n\t}\n\t[Symbol.iterator](): MapIterator<[K, V]> {\n\t\treturn this.entries()\n\t}\n\treadonly [Symbol.toStringTag]: string = 'IterableWeakMap'\n}\n\n/**\n * Uses weak references but still may iterate through them\n * Note: The behavior is highly dependant on the garbage collector - some entries are perhaps deemed to be collected: don't resuscitate them\n */\nexport class IterableWeakSet<K extends WeakKey> implements Set<K> {\n\tprivate uuids = new WeakMap<K, string>()\n\tprivate refs: Record<string, WeakRef<K>> = {}\n\tprivate readonly registry: FinalizationRegistry<string>\n\n\tconstructor(entries?: Iterable<K>) {\n\t\t// Create a FinalizationRegistry to clean up refs when values are garbage collected\n\t\tthis.registry = new FinalizationRegistry((uuid: string) => {\n\t\t\tdelete this.refs[uuid]\n\t\t})\n\t\tif (entries) for (const k of entries) this.add(k)\n\t}\n\tprivate createIterator<I>(cb: (key: K) => I): MapIterator<I> {\n\t\tconst { refs } = this\n\t\treturn (function* () {\n\t\t\tfor (const uuid of Object.keys(refs)) {\n\t\t\t\tconst key = refs[uuid].deref()\n\t\t\t\tif (key) yield cb(key)\n\t\t\t\telse delete refs[uuid]\n\t\t\t}\n\t\t\treturn undefined\n\t\t})()\n\t}\n\n\tclear(): void {\n\t\t// Unregister all values from the FinalizationRegistry\n\t\tfor (const uuid of Object.keys(this.refs)) {\n\t\t\tconst value = this.refs[uuid].deref()\n\t\t\tif (value) this.registry.unregister(value)\n\t\t}\n\t\tthis.uuids = new WeakMap<K, string>()\n\t\tthis.refs = {}\n\t}\n\n\tadd(value: K): this {\n\t\tlet uuid = this.uuids.get(value)\n\t\tif (!uuid) {\n\t\t\tuuid = crypto.randomUUID()\n\t\t\tthis.uuids.set(value, uuid)\n\t\t\tthis.refs[uuid] = new WeakRef(value)\n\t\t\t// Register value for cleanup when garbage collected\n\t\t\tthis.registry.register(value, uuid, value)\n\t\t}\n\t\treturn this\n\t}\n\tdelete(value: K): boolean {\n\t\tconst uuid = this.uuids.get(value)\n\t\tif (!uuid) return false\n\t\tdelete this.refs[uuid]\n\t\tthis.uuids.delete(value)\n\t\tthis.registry.unregister(value)\n\t\treturn true\n\t}\n\n\tforEach(callbackfn: (value: K, value2: K, set: Set<K>) => void, thisArg?: any): void {\n\t\tfor (const value of this) callbackfn.call(thisArg ?? this, value, value, thisArg ?? this)\n\t}\n\n\thas(value: K): boolean {\n\t\treturn this.uuids.has(value)\n\t}\n\tget size(): number {\n\t\treturn [...this].length\n\t}\n\tentries(): SetIterator<[K, K]> {\n\t\treturn this.createIterator((key) => [key, key] as [K, K])\n\t}\n\tkeys(): SetIterator<K> {\n\t\treturn this.createIterator((key) => key)\n\t}\n\tvalues(): SetIterator<K> {\n\t\treturn this.createIterator((key) => key)\n\t}\n\t[Symbol.iterator](): SetIterator<K> {\n\t\treturn this.keys()\n\t}\n\treadonly [Symbol.toStringTag]: string = 'IterableWeakSet'\n\n\tunion<U>(other: ReadonlySetLike<U>): Set<K | U> {\n\t\tconst others = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn other.keys()\n\t\t\t},\n\t\t}\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tyield* that\n\t\t\t\tfor (const value of others) if (!that.has(<K>(<unknown>value))) yield value\n\t\t\t})()\n\t\t)\n\t}\n\tintersection<U /**/>(other: ReadonlySetLike<U>): Set<K & U> {\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tfor (const value of that) if (other.has(<U>(<unknown>value))) yield <K & U>value\n\t\t\t})()\n\t\t)\n\t}\n\tdifference<U>(other: ReadonlySetLike<U>): Set<K> {\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tfor (const value of that) if (!other.has(<U>(<unknown>value))) yield <K>value\n\t\t\t})()\n\t\t)\n\t}\n\tsymmetricDifference<U>(other: ReadonlySetLike<U>): Set<K | U> {\n\t\tconst others = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn other.keys()\n\t\t\t},\n\t\t}\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tfor (const value of that) if (!other.has(<U>(<unknown>value))) yield <K | U>value\n\t\t\t\tfor (const value of others) if (!that.has(<K>(<unknown>value))) yield <K | U>value\n\t\t\t})()\n\t\t)\n\t}\n\tisSubsetOf(other: ReadonlySetLike<unknown>): boolean {\n\t\tfor (const value of this) if (!other.has(value)) return false\n\t\treturn true\n\t}\n\tisSupersetOf(other: ReadonlySetLike<unknown>): boolean {\n\t\tconst others = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn other.keys()\n\t\t\t},\n\t\t}\n\t\tfor (const value of others) if (!this.has(<K>value)) return false\n\t\treturn true\n\t}\n\tisDisjointFrom(other: ReadonlySetLike<unknown>): boolean {\n\t\tfor (const value of this) if (other.has(value)) return false\n\t\treturn true\n\t}\n}\n","import { FoolProof, isConstructor } from './utils'\n\n/**\n * A mixin function that takes a base class and returns a new class with mixed-in functionality\n * @template Mixed - The functionality to be mixed in\n */\nexport type MixinFunction<Mixed> = <Base>(\n\tbase: new (...args: any[]) => Base\n) => new (\n\t...args: any[]\n) => Base & Mixed\n\n/**\n * A mixin class that can be used both as a base class and as a mixin function\n * @template Mixed - The functionality to be mixed in\n */\nexport type MixinClass<Mixed> = new (...args: any[]) => Mixed\n\n/**\n * Creates a mixin that can be used both as a class (extends) and as a function (mixin)\n *\n * This function supports:\n * - Using mixins as base classes: `class MyClass extends MyMixin`\n * - Using mixins as functions: `class MyClass extends MyMixin(SomeBase)`\n * - Composing mixins: `const Composed = MixinA(MixinB)`\n * - Type-safe property inference for all patterns\n *\n * @param mixinFunction - The function that creates the mixin\n * @param unwrapFunction - Optional function to unwrap reactive objects for method calls\n * @returns A mixin that can be used both as a class and as a function\n */\nexport function mixin<MixinFn extends (base: any) => new (...args: any[]) => any>(\n\tmixinFunction: MixinFn,\n\tunwrapFunction?: (obj: any) => any\n): (new (\n\t...args: any[]\n) => InstanceType<ReturnType<MixinFn>>) &\n\t(<Base>(\n\t\tbase: abstract new (...args: any[]) => Base\n\t) => new (\n\t\t...args: any[]\n\t) => InstanceType<ReturnType<MixinFn>> & Base) {\n\t/**\n\t * Cache for mixin results to ensure the same base class always returns the same mixed class\n\t */\n\tconst mixinCache = new WeakMap<new (...args: any[]) => any, new (...args: any[]) => any>()\n\n\t// Apply the mixin to Object as the base class\n\tconst MixedBase = mixinFunction(Object)\n\tmixinCache.set(Object, MixedBase)\n\n\t// Create the proxy that handles both constructor and function calls\n\treturn new Proxy(MixedBase, {\n\t\t// Handle `MixinClass(SomeBase)` - use as mixin function\n\t\tapply(_target, _thisArg, args) {\n\t\t\tif (args.length === 0) {\n\t\t\t\tthrow new Error('Mixin requires a base class')\n\t\t\t}\n\n\t\t\tconst baseClass = args[0]\n\t\t\tif (typeof baseClass !== 'function') {\n\t\t\t\tthrow new Error('Mixin requires a constructor function')\n\t\t\t}\n\n\t\t\t// Check if it's a valid constructor or a mixin\n\t\t\tif (\n\t\t\t\t!isConstructor(baseClass) &&\n\t\t\t\t!(baseClass && typeof baseClass === 'function' && baseClass.prototype)\n\t\t\t) {\n\t\t\t\tthrow new Error('Mixin requires a valid constructor')\n\t\t\t}\n\n\t\t\t// Check cache first\n\t\t\tconst cached = mixinCache.get(baseClass)\n\t\t\tif (cached) {\n\t\t\t\treturn cached\n\t\t\t}\n\n\t\t\tlet usedBase = baseClass\n\t\t\tif (unwrapFunction) {\n\t\t\t\t// Create a proxied base class that handles method unwrapping\n\t\t\t\tconst ProxiedBaseClass = class extends baseClass {}\n\n\t\t\t\t// Proxy the prototype methods to handle unwrapping\n\t\t\t\tconst originalPrototype = baseClass.prototype\n\t\t\t\tconst proxiedPrototype = new Proxy(originalPrototype, {\n\t\t\t\t\tget(target, prop, receiver) {\n\t\t\t\t\t\tconst value = FoolProof.get(target, prop, receiver)\n\n\t\t\t\t\t\t// Only wrap methods that are likely to access private fields\n\t\t\t\t\t\t// Skip symbols and special properties that the reactive system needs\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\ttypeof value === 'function' &&\n\t\t\t\t\t\t\ttypeof prop === 'string' &&\n\t\t\t\t\t\t\t!['constructor', 'toString', 'valueOf'].includes(prop)\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t// Return a wrapped version that uses unwrapped context\n\t\t\t\t\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\t\t\t\t\t// Use the unwrapping function if provided, otherwise use this\n\t\t\t\t\t\t\t\tconst context = unwrapFunction(this as any)\n\t\t\t\t\t\t\t\treturn value.apply(context, args)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn value\n\t\t\t\t\t},\n\t\t\t\t})\n\n\t\t\t\t// Set the proxied prototype\n\t\t\t\tObject.setPrototypeOf(ProxiedBaseClass.prototype, proxiedPrototype)\n\t\t\t\tusedBase = ProxiedBaseClass\n\t\t\t}\n\n\t\t\t// Create the mixed class using the proxied base class\n\t\t\tconst mixedClass = mixinFunction(usedBase)\n\n\t\t\t// Cache the result\n\t\t\tmixinCache.set(baseClass, mixedClass)\n\n\t\t\treturn mixedClass\n\t\t},\n\t}) as MixinFn & (new (...args: any[]) => InstanceType<ReturnType<MixinFn>>)\n}\n","type Resolved<T> =\n\tT extends Promise<infer U>\n\t\t? Resolved<U>\n\t\t: T extends (...args: infer Args) => infer R\n\t\t\t? (...args: Args) => Resolved<R>\n\t\t\t: T extends object\n\t\t\t\t? {\n\t\t\t\t\t\t[k in keyof T]: k extends 'then' | 'catch' | 'finally' ? T[k] : Resolved<T[k]>\n\t\t\t\t\t}\n\t\t\t\t: T\ntype PromiseAnd<T> = Resolved<T> & Promise<Resolved<T>>\n/**\n * Type that transforms promises into chainable objects\n * Allows calling methods directly on promise results without awaiting them first\n */\nexport type PromiseChain<T> = T extends (...args: infer Args) => infer R\n\t? PromiseAnd<(...args: Args) => PromiseChain<Resolved<R>>>\n\t: T extends object\n\t\t? PromiseAnd<{\n\t\t\t\t[k in keyof T]: k extends 'then' | 'catch' | 'finally' ? T[k] : PromiseChain<Resolved<T[k]>>\n\t\t\t}>\n\t\t: Promise<Resolved<T>>\n\nconst forward =\n\t(name: string, target: any) =>\n\t(...args: any[]) => {\n\t\treturn target[name](...args)\n\t}\n\nconst alreadyChained = new WeakMap<any, PromiseChain<any>>()\nconst originals = new WeakMap<Promise<any>, any>()\n\nfunction cache(target: any, rv: PromiseChain<any>) {\n\toriginals.set(rv, target)\n\talreadyChained.set(target, rv)\n}\n\ntype ChainedFunction<T> = ((...args: any[]) => PromiseChain<T>) & {\n\tthen: Promise<T>['then']\n\tcatch: Promise<T>['catch']\n\tfinally: Promise<T>['finally']\n}\n\nconst promiseProxyHandler: ProxyHandler<ChainedFunction<any>> = {\n\t//@ts-expect-error\n\t[Symbol.toStringTag]: 'MutTs PromiseChain function',\n\tget(target, prop) {\n\t\tif (prop === Symbol.toStringTag) return 'PromiseProxy'\n\t\tif (typeof prop === 'string' && ['then', 'catch', 'finally'].includes(prop))\n\t\t\treturn target[prop as keyof typeof target]\n\t\treturn chainPromise(target.then((r) => r[prop as keyof typeof r]))\n\t},\n}\nconst promiseForward = (target: any) => ({\n\t// biome-ignore lint/suspicious/noThenProperty: This one is the whole point\n\tthen: forward('then', target),\n\tcatch: forward('catch', target),\n\tfinally: forward('finally', target),\n})\nconst objectProxyHandler: ProxyHandler<any> = {\n\t//@ts-expect-error\n\t[Symbol.toStringTag]: 'MutTs PromiseChain object',\n\tget(target, prop, receiver) {\n\t\tconst getter = Object.getOwnPropertyDescriptor(target, prop)?.get\n\t\tconst rv = getter ? getter.call(receiver) : target[prop]\n\t\t// Allows fct.call or fct.apply to bypass the chain system\n\t\tif (typeof target === 'function') return rv\n\t\treturn chainPromise(rv)\n\t},\n\tapply(target, thisArg, args) {\n\t\treturn chainPromise(target.apply(thisArg, args))\n\t},\n}\nfunction chainObject<T extends object | Function>(given: T): PromiseChain<T> {\n\tconst rv = new Proxy(given, objectProxyHandler) as PromiseChain<T>\n\tcache(given, rv)\n\treturn rv\n}\n\nfunction chainable(x: any): x is object | Function {\n\treturn x && ['function', 'object'].includes(typeof x)\n}\n/**\n * Transforms a promise or value into a chainable object\n * Allows calling methods directly on promise results without awaiting them first\n * @param given - The promise or value to make chainable\n * @returns A chainable version of the input\n */\nexport function chainPromise<T>(given: Promise<T> | T): PromiseChain<T> {\n\tif (!chainable(given)) return given as PromiseChain<T>\n\tif (alreadyChained.has(given)) return alreadyChained.get(given) as PromiseChain<T>\n\tif (!(given instanceof Promise)) return chainObject(given)\n\t// @ts-expect-error It's ok as we check if it's an object above\n\tgiven = given.then((r) => (chainable(r) ? chainObject(r) : r))\n\tconst target = Object.assign(function (this: any, ...args: any[]) {\n\t\treturn chainPromise(\n\t\t\tgiven.then((r) => {\n\t\t\t\treturn this?.then\n\t\t\t\t\t? this.then((t: any) => (r as any).apply(t, args))\n\t\t\t\t\t: (r as any).apply(this, args)\n\t\t\t})\n\t\t)\n\t}, promiseForward(given)) as ChainedFunction<T>\n\tconst chained = new Proxy(\n\t\ttarget,\n\t\tpromiseProxyHandler as ProxyHandler<ChainedFunction<T>>\n\t) as PromiseChain<T>\n\tcache(given, chained as PromiseChain<any>)\n\treturn chained\n}\n","import type { EffectTrigger, Evolution } from './types'\n\nexport interface DebugHooks {\n\tisDevtoolsEnabled: () => boolean\n\tregisterEffect: (effect: EffectTrigger) => void\n\tgetTriggerChain: (effect: EffectTrigger) => string[]\n\tcaptureStack: (error?: unknown) => unknown\n\tcaptureLineage: (effect?: EffectTrigger, stack?: unknown) => unknown\n\tformatStack: (stack: unknown) => unknown[]\n\trecordTriggerLink: (\n\t\tsource: EffectTrigger | undefined,\n\t\ttarget: EffectTrigger,\n\t\tobj: object,\n\t\tprop: any,\n\t\tevolution: Evolution\n\t) => void\n\tdecorateError: (error: unknown, trigger: EffectTrigger) => void\n}\n\nexport const debugHooks: DebugHooks = {\n\tisDevtoolsEnabled: () => false,\n\tregisterEffect: () => {},\n\tgetTriggerChain: () => [],\n\tcaptureStack: () => [],\n\tcaptureLineage: () => new Error().stack,\n\tformatStack: (stack: unknown) => [stack],\n\trecordTriggerLink: () => {},\n\tdecorateError: () => {},\n}\n\nexport function setDebugHooks(hooks: Partial<DebugHooks>) {\n\tObject.assign(debugHooks, hooks)\n}\n","import { asyncHooks } from './async'\nimport { named, tag } from './utils'\n\ninterface InternalZoneUse<T> {\n\tenter(value?: T): unknown\n\tleave(entered: unknown): void\n}\nfunction isu<T>(z: AZone<T> | InternalZoneUse<T>): InternalZoneUse<T> {\n\treturn z as InternalZoneUse<T>\n}\nexport abstract class AZone<T> {\n\tabstract active?: T\n\tprotected enter(value?: T): unknown {\n\t\tconst prev = this.active\n\t\tthis.active = value\n\t\treturn prev\n\t}\n\tprotected leave(entered: unknown): void {\n\t\tthis.active = entered as T | undefined\n\t}\n\twith<R>(value: T | undefined, fn: () => R): R {\n\t\tconst entered = this.enter(value)\n\t\tlet res: R\n\t\ttry {\n\t\t\tres = fn()\n\t\t} finally {\n\t\t\tthis.leave(entered)\n\t\t}\n\t\t// [HACK]: Sanitization\n\t\t// See BROWSER_ASYNC_POLYFILL.md\n\t\treturn asyncHooks.sanitizePromise(res) as R\n\t}\n\troot<R>(fn: () => R): R {\n\t\tconst prev = this.enter()\n\t\ttry {\n\t\t\treturn fn()\n\t\t} finally {\n\t\t\tthis.leave(prev)\n\t\t}\n\t}\n\tget zoned(): GetterWrapper {\n\t\tconst active = this.active\n\t\treturn named(`${this}@${active}`, (fn) => this.with(active, fn))\n\t}\n}\n\nexport type GetterWrapper = <R>(fn: () => R) => R\n\nexport class Zone<T> extends AZone<T> {\n\tactive: T | undefined\n}\n\nexport type HistoryValue<T> = { present: T | undefined; history: Set<T> }\nexport class ZoneHistory<T> extends AZone<HistoryValue<T>> {\n\tprivate history = new Set<T>()\n\tpublic readonly present: AZone<T>\n\tpublic has(value: T): boolean {\n\t\treturn this.history.has(value)\n\t}\n\tpublic some(predicate: (value: T) => boolean): boolean {\n\t\tfor (const value of this.history) if (predicate(value)) return true\n\t\treturn false\n\t}\n\tconstructor(private controlled: AZone<T> = new Zone<T>()) {\n\t\tsuper()\n\t\tconst self = this\n\t\tthis.present = Object.create(\n\t\t\tcontrolled,\n\t\t\tObject.getOwnPropertyDescriptors({\n\t\t\t\tget active() {\n\t\t\t\t\treturn controlled.active\n\t\t\t\t},\n\t\t\t\tset active(value: T | undefined) {\n\t\t\t\t\tcontrolled.active = value\n\t\t\t\t},\n\t\t\t\tenter(value?: T) {\n\t\t\t\t\tif (value && self.history.has(value))\n\t\t\t\t\t\tthrow new Error('ZoneHistory: re-entering historical zone')\n\t\t\t\t\tif (value !== undefined) self.history.add(value)\n\t\t\t\t\treturn { added: value, entered: isu(controlled).enter(value) }\n\t\t\t\t},\n\t\t\t\tleave(entered: { added: T | undefined; entered: unknown }) {\n\t\t\t\t\tif (entered.added !== undefined) self.history.delete(entered.added)\n\t\t\t\t\treturn isu(controlled).leave(entered.entered)\n\t\t\t\t},\n\t\t\t})\n\t\t)\n\t}\n\tget active() {\n\t\treturn { present: this.controlled.active, history: new Set(this.history) }\n\t}\n\tset active(value: HistoryValue<T> | undefined) {\n\t\tthis.history = value?.history ? new Set(value.history) : new Set()\n\t\tthis.controlled.active = value?.present\n\t}\n}\n\nexport class ZoneAggregator extends AZone<Map<AZone<unknown>, unknown>> {\n\t#zones = new Set<AZone<unknown>>()\n\tconstructor(...zones: AZone<unknown>[]) {\n\t\tsuper()\n\t\tfor (const z of zones) this.#zones.add(z)\n\t}\n\tget active(): Map<AZone<unknown>, unknown> | undefined {\n\t\tconst rv = new Map<AZone<unknown>, unknown>()\n\t\tfor (const z of this.#zones) if (z.active !== undefined) rv.set(z, z.active)\n\t\treturn rv\n\t}\n\tset active(value: Map<AZone<unknown>, unknown> | undefined) {\n\t\tfor (const z of this.#zones) z.active = value?.get(z)\n\t}\n\tenter(value?: Map<AZone<unknown>, unknown> | undefined) {\n\t\tconst entered = new Map<AZone<unknown>, unknown>()\n\t\tfor (const z of this.#zones) {\n\t\t\tconst v = value?.get(z)\n\t\t\tentered.set(z, isu(z).enter(v))\n\t\t}\n\t\treturn entered\n\t}\n\tleave(entered: Map<AZone<unknown>, unknown>): void {\n\t\tfor (const z of this.#zones) isu(z).leave(entered.get(z))\n\t}\n\tadd(z: AZone<unknown>) {\n\t\tthis.#zones.add(z)\n\t}\n\tdelete(z: AZone<unknown>) {\n\t\tthis.#zones.delete(z)\n\t}\n\tclear() {\n\t\tthis.#zones.clear()\n\t}\n}\n\n/**\n * Aggregator of zones that should be preserved across async boundaries.\n * If you add a zone here, it will be preserved across async boundaries.\n *\n * @example\n * ```ts\n * import { Zone, asyncZone } from 'mutts'\n * const userZone = new Zone<User>()\n * asyncZone.add(userZone)\n * ```\n */\nexport const asyncZone = tag('async', new ZoneAggregator())\nasyncHooks.addHook(() => {\n\t// capture state before async boundary\n\tconst zone = asyncZone.active\n\treturn () => {\n\t\t// restore state after async boundary, temporarily\n\t\tconst prev = asyncZone.active\n\t\tasyncZone.active = zone\n\t\treturn () => {\n\t\t\t// restore previous state from before our restore\n\t\t\tasyncZone.active = prev\n\t\t}\n\t}\n})\n","import type { EffectNode, EffectTrigger } from './types'\n\n// Symbol for storing root function on the function itself\nexport const rootFunctionSymbol = Symbol('root-function')\n\n// Track which effects are watching which reactive objects for cleanup\nexport let effectToReactiveObjects = new WeakMap<EffectTrigger, Set<object>>()\n\n// Track effects per reactive object and property\nexport let watchers = new WeakMap<object, Map<any, Set<EffectTrigger>>>()\n\n// Track effect metadata and relationships\nexport let effectNodes = new WeakMap<EffectTrigger, EffectNode>()\n\nexport function getEffectNode(effect: EffectTrigger): EffectNode {\n\tlet node = effectNodes.get(effect)\n\tif (!node) {\n\t\tnode = {}\n\t\teffectNodes.set(effect, node)\n\t}\n\treturn node\n}\n\n// Track reverse mapping to ensure unicity: One Root -> One Function\nlet reverseRoots = new WeakMap<any, WeakRef<Function>>()\n\nexport function resetRegistry() {\n\teffectToReactiveObjects = new WeakMap()\n\twatchers = new WeakMap()\n\teffectNodes = new WeakMap()\n\treverseRoots = new WeakMap()\n}\n\n/**\n * Marks a function with its root function for effect tracking\n * Enforces strict unicity: A root function can only identify ONE function.\n * @param fn - The function to mark\n * @param root - The root function\n * @returns The marked function\n */\nexport function markWithRoot<T extends Function>(fn: T, root: any): T {\n\t// Check for collision\n\tconst existingRef = reverseRoots.get(root)\n\tconst existing = existingRef?.deref()\n\n\tif (existing && existing !== fn) {\n\t\tconst rootName = root.name || 'anonymous'\n\t\tconst existingName = existing.name || 'anonymous'\n\t\tconst fnName = fn.name || 'anonymous'\n\t\tthrow new Error(\n\t\t\t`[reactive] Abusive Shared Root detected: Root '${rootName}' is already identifying function '${existingName}'. ` +\n\t\t\t\t`Cannot reuse it for '${fnName}'. Shared roots cause lost updates and broken identity logic.`\n\t\t)\n\t}\n\n\t// Always update the map so subsequent checks find this one\n\t// (Last writer wins for the check)\n\treverseRoots.set(root, new WeakRef(fn))\n\n\t// Store root mapping as symbol property on the function\n\tfn[rootFunctionSymbol] = getRoot(root)\n\treturn fn\n}\n\n/**\n * Gets the root function of a function for effect tracking\n * @param fn - The function to get the root of\n * @returns The root function\n */\nexport function getRoot<T extends Function | undefined>(fn: T): T {\n\twhile (fn) {\n\t\tconst r = fn[rootFunctionSymbol]\n\t\tif (!r) break\n\t\tfn = r as T\n\t}\n\treturn fn\n}\n","import { tag } from '../utils'\nimport { asyncZone, ZoneAggregator, ZoneHistory } from '../zone'\nimport { getRoot } from './registry'\nimport type { CleanupReason, EffectTrigger, ScopedCallback } from './types'\n\nexport const effectHistory = tag('effectHistory', new ZoneHistory<EffectTrigger>())\ntag('effectHistory.present', effectHistory.present)\nasyncZone.add(effectHistory)\n\n/**\n * Aggregator for zones that need to be tracked along effects.\n * ie. in each effect, the active zone of the given zoning will be the one active at effect's definition\n */\nexport const effectAggregator = tag('effectAggregator', new ZoneAggregator(effectHistory.present))\n\nexport function isRunning(effect: EffectTrigger): boolean {\n\tconst root = getRoot(effect)\n\treturn effectHistory.some((e) => getRoot(e) === root)\n}\n\nexport function getActiveEffect() {\n\treturn effectHistory.present.active\n}\n\nconst cleanups = new WeakMap<object, Set<ScopedCallback | object>>()\n\n/**\n * Attach cleanup dependencies to an object. When `unlink(obj)` is called,\n * each dependency is disposed: functions are invoked with the cleanup reason,\n * objects are recursively `unlink`ed. This forms a cleanup tree.\n *\n * @param obj - The owner object\n * @param cleanupFns - Cleanup callbacks and/or child objects to unlink recursively\n * @returns The owner object (for chaining)\n *\n * @example\n * ```ts\n * // Functions are called with CleanupReason\n * link(parent, () => console.log('disposed'))\n *\n * // Objects are recursively unlinked\n * link(parent, childA, childB)\n *\n * // Mixed\n * link(parent, childObj, () => timer.clear())\n *\n * unlink(parent) // disposes childA, childB, calls the function\n * ```\n */\nexport function link<T extends object>(\n\tobj: T,\n\t...cleanupFns: (ScopedCallback | object | undefined)[]\n): T {\n\tconst set = cleanups.get(obj)\n\tif (!set) cleanups.set(obj, new Set(cleanupFns.filter(Boolean)))\n\telse for (const fn of cleanupFns) if (fn) set.add(fn)\n\treturn obj\n}\n\n/**\n * Dispose an object's cleanup dependencies. Functions are called with the\n * reason; linked objects are recursively unlinked. The cleanup set is removed\n * so calling `unlink` twice is safe (second call is a no-op).\n *\n * @param obj - The object to dispose\n * @param reason - Optional cleanup reason propagated to callbacks\n */\nexport function unlink(obj: object, reason?: CleanupReason): void {\n\tconst set = cleanups.get(obj)\n\tif (set) {\n\t\tcleanups.delete(obj)\n\t\tfor (const fn of set)\n\t\t\tif (typeof fn === 'function') fn(reason)\n\t\t\telse unlink(fn, reason)\n\t}\n}\n","import type { GetterWrapper } from '../zone'\nimport { debugHooks } from './debug-hooks'\n\nexport type EffectAccessEvents = {\n\ttriggered(event: string, ...args: any[]): void\n}\n\n/**\n * Effect access passed to user callbacks within effects/watch\n * Provides functions to track dependencies and information about the effect execution\n */\nexport interface EffectAccess {\n\t/**\n\t * Tracks dependencies in the current effect context\n\t * Use this for normal dependency tracking within the effect\n\t * @example\n\t * ```typescript\n\t * effect(({ tracked }) => {\n\t *   // In async context, use tracked to restore dependency tracking\n\t *   await someAsyncOperation()\n\t *   const value = tracked(() => state.count) // Tracks state.count in this effect\n\t * })\n\t * ```\n\t */\n\ttracked: GetterWrapper\n\t/**\n\t * Tracks dependencies in the parent effect context\n\t * Use this when child effects should track dependencies in the parent,\n\t * allowing parent cleanup to manage child effects while dependencies trigger the parent\n\t * @example\n\t * ```typescript\n\t * effect(({ ascend }) => {\n\t *   const length = inputs.length\n\t *   if (length > 0) {\n\t *     ascend(() => {\n\t *       // Dependencies here are tracked in the parent effect\n\t *       inputs.forEach(item => console.log(item))\n\t *     })\n\t *   }\n\t * })\n\t * ```\n\t */\n\tascend: GetterWrapper\n\t/**\n\t * `false` on the first execution, `true` or `CleanupReason` on subsequent runs.\n\t * `true` means this is a re-run but detailed reason gathering is disabled or unavailable.\n\t * A `CleanupReason` describes *why* the previous run was torn down.\n\t * @example\n\t * ```typescript\n\t * effect(({ reaction }) => {\n\t *   if (!reaction) {\n\t *     // First run — setup\n\t *   } else if (reaction !== true && reaction.type === 'propChange') {\n\t *     // Re-run due to dependency change (with details)\n\t *     for (const { evolution } of reaction.triggers)\n\t *       console.log(`${'prop' in evolution ? evolution.prop : evolution.method}: ${evolution.type}`)\n\t *   }\n\t * })\n\t * ```\n\t */\n\treaction: boolean | CleanupReason\n\t/**\n\t * AbortSignal that is aborted when the effect is cleaned up or re-runs.\n\t * Use this to cancel async operations (like fetch) when the effect is no longer valid.\n\t */\n\tsignal: AbortSignal\n}\n// Zone-based async context preservation is implemented in zone.ts\n// It automatically preserves effect context across Promise boundaries (.then, .catch, .finally)\n\n/**\n * Base type for effect callbacks - simple function without additional properties\n */\nexport type ScopedCallback = (reason?: CleanupReason) => void\n\nexport const effectMarker = {\n\tenter: 'effect:enter',\n\tleave: 'effect:leave',\n}\n\nexport type PropTrigger = {\n\tobj: object\n\tevolution: Evolution\n\tdependency?: unknown // Stack from when dependency was created\n\ttouch?: unknown // Stack from when touch occurred\n}\n\n/**\n * Reason for an effect cleanup/reaction\n */\nexport type CleanupReason =\n\t| { type: 'propChange'; triggers: PropTrigger[] }\n\t| { type: 'invalidate'; cause: CleanupReason }\n\t| { type: 'stopped'; detail?: string } // explicit stop() call\n\t| { type: 'gc' } // FinalizationRegistry collected the holder\n\t| { type: 'lineage'; parent: CleanupReason } // parent effect cleaned up (recursive)\n\t| { type: 'error'; error: unknown } // error handler chain (reactionCleanup called with error)\n\t| { type: 'multiple'; reasons: CleanupReason[] }\n\nfunction formatTrigger({ obj, evolution, dependency, touch }: PropTrigger): unknown[] {\n\tconst detail = evolution.type === 'bunch' ? evolution.method : String(evolution.prop)\n\tconst parts: unknown[] = [`${evolution.type} ${detail} on`, obj]\n\n\tif (dependency) {\n\t\tparts.push('\\n  Dependency created at:')\n\t\tparts.push(...debugHooks.formatStack(dependency))\n\t}\n\n\tif (touch) {\n\t\tparts.push('\\n  Touched from:')\n\t\tparts.push(...debugHooks.formatStack(touch))\n\t}\n\n\treturn parts\n}\n\n/**\n * Console-friendly description of a `CleanupReason`.\n * Returns an array of arguments to spread into `console.log` / `console.warn`,\n * mixing strings and raw object references so the console can render them as inspectable values.\n *\n * @example\n * ```typescript\n * effect(({ reaction }) => {\n *   if (reaction !== true) console.log(...formatCleanupReason(reaction))\n * })\n * ```\n */\nexport function formatCleanupReason(reason: CleanupReason, depth = 0): unknown[] {\n\tconst indent = depth ? '  '.repeat(depth) : ''\n\tswitch (reason.type) {\n\t\tcase 'propChange': {\n\t\t\tconst parts: unknown[] = [`${indent}propChange:`]\n\t\t\tfor (let i = 0; i < reason.triggers.length; i++) {\n\t\t\t\tif (i > 0) parts.push(',')\n\t\t\t\tparts.push(...formatTrigger(reason.triggers[i]))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'stopped':\n\t\t\treturn [`${indent}stopped`]\n\t\tcase 'gc':\n\t\t\treturn [`${indent}gc`]\n\t\tcase 'error':\n\t\t\treturn [`${indent}error:`, reason.error]\n\t\tcase 'lineage':\n\t\t\treturn [`${indent}lineage ←\\n`, ...formatCleanupReason(reason.parent, depth + 1)]\n\t\tcase 'invalidate':\n\t\t\treturn [`${indent}invalidate ←\\n`, ...formatCleanupReason(reason.cause, depth + 1)]\n\t\tcase 'multiple': {\n\t\t\tconst parts: unknown[] = []\n\t\t\tfor (let i = 0; i < reason.reasons.length; i++) {\n\t\t\t\tif (i > 0) parts.push('\\n')\n\t\t\t\tparts.push(...formatCleanupReason(reason.reasons[i], depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t}\n}\n\n/**\n * Type for effect cleanup functions.\n */\nexport type EffectCleanup = ScopedCallback\n\n/**\n * Centralized node for all effect metadata and relationships\n */\nexport interface EffectNode {\n\t// Graph relationships\n\tparent?: EffectTrigger\n\tchildren?: Set<EffectCleanup>\n\n\t// Lifecycle\n\tcleanup?: ScopedCallback\n\tstopped?: boolean\n\t/** The reason why the effect is (re-)executing */\n\tnextReason?: CleanupReason\n\n\t// Error handling\n\tforwardThrow?: CatchFunction\n\tcatchers?: CatchFunction[]\n\n\t// Debug / Metadata\n\tcreationStack?: unknown\n\tdependencyHook?: (obj: any, prop: any) => void\n\n\t// Configuration\n\tisOpaque?: boolean\n\n\t// Pending triggers to be batched into CleanupReason\n\tpendingTriggers?: PropTrigger[]\n}\n\n/**\n * Type for the `runEffect` function of an effect - argument-less function to call to trigger the effect\n */\nexport type EffectTrigger = ScopedCallback\n\n/**\n * Async execution mode for effects\n * - `cancel`: Cancel previous async execution when dependencies change (default)\n * - `queue`: Queue next execution to run after current completes\n * - `ignore`: Ignore new executions while async work is running\n */\nexport type AsyncExecutionMode = 'cancel' | 'queue' | 'ignore'\n\n/**\n * Options for effect creation\n */\nexport interface EffectOptions {\n\t/**\n\t * How to handle async effect executions when dependencies change\n\t * @default 'cancel'\n\t */\n\tasyncMode?: AsyncExecutionMode\n\t/**\n\t * If true, this effect is \"opaque\" to deep optimizations: it sees the object reference itself\n\t * and must be notified when it changes, regardless of deep content similarity.\n\t * Use this for effects that depend on object identity (like memoize).\n\t */\n\topaque?: boolean\n\t/**\n\t * Used for debugging purpose. Provides a callback to be called every time a dependency is created.\n\t */\n\tdependencyHook?: (obj: any, prop: any) => void\n\t/**\n\t * Used for debugging purpose. Provides a name for the effect.\n\t */\n\tname?: string\n}\n\n/**\n * Type for property evolution events\n */\nexport type PropEvolution = {\n\ttype: 'set' | 'del' | 'add' | 'invalidate'\n\tprop: any\n}\n\n/**\n * Type for collection operation evolution events\n */\nexport type BunchEvolution = {\n\ttype: 'bunch'\n\tmethod: string\n}\nexport type Evolution = PropEvolution | BunchEvolution\n\nexport type State =\n\t| {\n\t\t\tevolution: Evolution\n\t\t\tnext: State\n\t  }\n\t| {}\n\n// Track native reactivity\n\n/**\n * Symbol to mark class properties as non-reactive\n */\nexport const unreactiveProperties = Symbol('unreactive-properties')\n\n/**\n * Symbol representing all properties in reactive tracking\n */\nexport const allProps = Symbol('all-props')\n\n/**\n * Symbol for structure-only tracking (triggered on key add/delete, not value changes).\n * Used by ownKeys proxy trap — Object.keys(), for..in, Map.keys() depend on this.\n */\nexport const keysOf = Symbol('keys-of')\n\n/**\n * Symbol for accessing projection information on reactive objects\n */\nexport const projectionInfo = Symbol('projection-info')\n\nexport const forwardThrow = Symbol('throw')\n\nexport type EffectCloser = (reason?: CleanupReason) => void\nexport type CatchFunction = (error: unknown) => EffectCloser | undefined | void\n\n/**\n * Context for a running projection item effect\n */\nexport interface ProjectionContext {\n\tsource: any\n\tkey?: any\n\ttarget: any\n\tdepth: number\n\tparent?: ProjectionContext\n}\n\n/**\n * Structured error codes for machine-readable diagnosis\n */\nexport enum ReactiveErrorCode {\n\tCycleDetected = 'Cycle detected',\n\tMaxDepthExceeded = 'Max depth exceeded',\n\tMaxReactionExceeded = 'Max reaction exceeded',\n\tWriteInComputed = 'Write in computed',\n\tTrackingError = 'Tracking error',\n\tBrokenEffects = 'Broken effects',\n}\n\nexport type CycleDebugInfo = {\n\tcode: ReactiveErrorCode.CycleDetected\n\tcycle: string[]\n\tdetails?: string\n\tcausalChain?: string[]\n\tlineage?: unknown\n}\n\nexport type MaxDepthDebugInfo = {\n\tcode: ReactiveErrorCode.MaxDepthExceeded\n\teffectuatedRoots: any[]\n\tcycle: any[] | null\n\ttrace: string\n\tmaxEffectChain: number\n\tqueued: string[]\n\tqueuedCount: number\n\tcausalChain?: string[]\n\tlineage?: unknown\n}\n\nexport type MaxReactionDebugInfo = {\n\tcode: ReactiveErrorCode.MaxReactionExceeded\n\tcount: number\n\teffect: string\n\tcausalChain?: string[]\n\tlineage?: unknown\n}\n\nexport type GenericDebugInfo = {\n\tcode: ReactiveErrorCode\n\tcausalChain?: string[]\n\tlineage?: unknown\n\t[key: string]: any\n}\n\nexport type ReactiveDebugInfo =\n\t| CycleDebugInfo\n\t| MaxDepthDebugInfo\n\t| MaxReactionDebugInfo\n\t| GenericDebugInfo\n\n/**\n * Error class for reactive system errors\n */\nexport class ReactiveError extends Error {\n\tconstructor(\n\t\tmessage: string,\n\t\tpublic debugInfo?: ReactiveDebugInfo\n\t) {\n\t\tsuper(message)\n\t\tthis.name = 'ReactiveError'\n\t}\n\n\tget code(): ReactiveErrorCode | undefined {\n\t\treturn this.debugInfo?.code\n\t}\n\n\tget cause(): any {\n\t\treturn (this.debugInfo as any)?.cause\n\t}\n}\n\n// biome-ignore-start lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n/**\n * Global options for the reactive system\n */\nexport const options = {\n\t/**\n\t * Debug purpose: called when an effect is entered\n\t * @param effect - The effect that is entered\n\t */\n\tenter: (_effect: Function) => {},\n\t/**\n\t * Debug purpose: called when an effect is left\n\t * @param effect - The effect that is left\n\t */\n\tleave: (_effect: Function) => {},\n\t/**\n\t * Debug purpose: called when an effect is chained\n\t * @param target - The effect that is being triggered\n\t * @param caller - The effect that is calling the target\n\t */\n\tchain: (_targets: Function[], _caller?: Function) => {},\n\t/**\n\t * Debug purpose: called when an effect chain is started\n\t * @param target - The effect that is being triggered\n\t */\n\tbeginChain: (_targets: Function[]) => {},\n\t/**\n\t * Debug purpose: called when an effect chain is ended\n\t */\n\tendChain: () => {},\n\tgarbageCollected: (_fn: Function) => {},\n\t/**\n\t * Debug purpose: called when an object is touched\n\t * @param obj - The object that is touched\n\t * @param evolution - The type of change\n\t * @param props - The properties that changed\n\t * @param deps - The dependencies that changed\n\t */\n\ttouched: (_obj: any, _evolution: Evolution, _props?: any[], _deps?: EffectTrigger[]) => {},\n\t/**\n\t * Debug purpose: called when an effect is skipped because it's already running\n\t * @param effect - The effect that is already running\n\t * @param runningChain - The array of effects from the detected one to the currently running one\n\t */\n\tskipRunningEffect: (_effect: EffectTrigger) => {},\n\t/**\n\t * Debug purpose: called when an effect starts executing.\n\t * @param effect - The effect being executed (root function)\n\t * @param reaction - false for initial creation, true/CleanupReason for subsequent runs\n\t */\n\teffectRun: (_effect: Function, _reaction: boolean | CleanupReason) => {},\n\t/**\n\t * Debug purpose: maximum effect chain (like call stack max depth)\n\t * Used to prevent infinite loops\n\t * @default 100\n\t */\n\tmaxEffectChain: 100,\n\t/**\n\t * Maximum number of times an effect can be triggered by the same cause in a single batch\n\t * Used to detect aggressive re-computation or infinite loops\n\t * @default 10\n\t */\n\tmaxTriggerPerBatch: 10,\n\t/**\n\t * Debug purpose: maximum effect reaction (like call stack max depth)\n\t * Used to prevent infinite loops\n\t * @default 'throw'\n\t */\n\tmaxEffectReaction: 'throw' as 'throw' | 'debug' | 'warn',\n\t/**\n\t * Callback called when a memoization discrepancy is detected (debug only)\n\t * When defined, memoized functions will run a second time (untracked) to verify consistency.\n\t * If the untracked run returns a different value than the cached one, this callback is triggered.\n\t *\n\t * This is the primary tool for detecting missing reactive dependencies in computed values.\n\t *\n\t * @param cached - The value currently in the memoization cache\n\t * @param fresh - The value obtained by re-running the function untracked\n\t * @param fn - The memoized function itself\n\t * @param args - Arguments passed to the function\n\t *\n\t * @example\n\t * ```typescript\n\t * reactiveOptions.onMemoizationDiscrepancy = (cached, fresh, fn, args) => {\n\t *   throw new Error(`Memoization discrepancy in ${fn.name}!`);\n\t * };\n\t * ```\n\t */\n\tonMemoizationDiscrepancy: undefined as\n\t\t| ((\n\t\t\t\tcached: any,\n\t\t\t\tfresh: any,\n\t\t\t\tfn: Function,\n\t\t\t\targs: any[],\n\t\t\t\tcause: 'calculation' | 'comparison'\n\t\t  ) => void)\n\t\t| undefined,\n\t/**\n\t * How to handle cycles detected in effect batches.\n\t *\n\t * - `'production'` (Default): High-performance mode. Disables dependency graph maintenance and\n\t *   Topological Sorting in favor of a simple FIFO queue. Use this for trustworthy, acyclic UI code.\n\t *   Cycle detection is heuristic (uses maxEffectChain execution counts).\n\t *\n\t * - `'development'`: Maintains direct dependency graph for early cycle detection during edge creation.\n\t *   Catches cycles before effects execute via DFS check when adding edges. Throws immediately with\n\t *   basic path information. Good balance of debugging help with moderate overhead.\n\t *\n\t * - `'debug'`: Full diagnostic mode with transitive closures and topological sorting.\n\t *   Provides detailed cycle path reporting. Highest overhead but most informative for bug hunting.\n\t *\n\t * @default 'production'\n\t */\n\tcycleHandling: 'development' as 'production' | 'development' | 'debug',\n\t/**\n\t * Internal flag used by memoization discrepancy detector to avoid counting calls in tests\n\t * @warning Do not modify this flag manually, this flag is given by the engine\n\t */\n\tisVerificationRun: false,\n\t/**\n\t * Maximum depth for deep watching traversal\n\t * Used to prevent infinite recursion in circular references\n\t * @default 100\n\t */\n\tmaxDeepWatchDepth: 100,\n\t/**\n\t * Only react on instance members modification (not inherited properties)\n\t * For instance, do not track class methods\n\t * @default true\n\t */\n\tinstanceMembers: true,\n\t/**\n\t * Ignore accessors (getters and setters) and only track direct properties\n\t * @default true\n\t */\n\tignoreAccessors: true,\n\t/**\n\t * Enable recursive touching when objects with the same prototype are replaced\n\t * When enabled, replacing an object with another of the same prototype triggers\n\t * recursive diffing instead of notifying parent effects\n\t * @default true\n\t */\n\trecursiveTouching: true,\n\t/**\n\t * Default async execution mode for effects that return Promises\n\t * - 'cancel': Cancel previous async execution when dependencies change (default, enables async zone)\n\t * - 'queue': Queue next execution to run after current completes (enables async zone)\n\t * - 'ignore': Ignore new executions while async work is running (enables async zone)\n\t * - false: Disable async zone and async mode handling (effects run concurrently)\n\t *\n\t * **When truthy:** Enables async zone (Promise.prototype wrapping) for automatic context\n\t * preservation in Promise callbacks. Warning: This modifies Promise.prototype globally.\n\t * Only enable if no other library modifies Promise.prototype.\n\t *\n\t * **When false:** Async zone is disabled. Use `tracked()` manually in Promise callbacks.\n\t *\n\t * Can be overridden per-effect via EffectOptions\n\t * @default 'cancel'\n\t */\n\tasyncMode: 'cancel' as AsyncExecutionMode | false,\n\t// biome-ignore lint/suspicious/noConsole: This is the whole point here\n\twarn: (...args: any[]) => console.warn(...args),\n\n\t/**\n\t * Introspection and debug aids. Set to `null` to disable all debug overhead in production.\n\t *\n\t * - `gatherReasons`: collect `PropTrigger[]` for `CleanupReason` on effect re-runs (default `true`)\n\t *   - `lineages`: what lineages to capture in PropTrigger (default `'touch'`)\n\t * - `logErrors`: log errors with detailed context (default `true`)\n\t * - `enableHistory`: keep a history of mutations (default `true`)\n\t * - `historySize`: number of mutations to keep in history (default `50`)\n\t *\n\t * `enableDevTools()` sets `logErrors` to `true` automatically.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Production: disable all introspection\n\t * reactiveOptions.introspection = null\n\t * ```\n\t */\n\tintrospection: {\n\t\tgatherReasons: { lineages: 'touch' },\n\t\tlogErrors: true,\n\t\tenableHistory: true,\n\t\thistorySize: 50,\n\t} as {\n\t\tgatherReasons: { lineages: 'none' | 'touch' | 'dependency' | 'both' }\n\t\tlogErrors: boolean\n\t\tenableHistory: boolean\n\t\thistorySize: number\n\t} | null,\n}\n// biome-ignore-end lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n\ntype CallableOption = {\n\t[K in keyof typeof options]: (typeof options)[K] extends ((...args: any[]) => any) | undefined\n\t\t? K\n\t\t: never\n}[keyof typeof options]\n\nexport function optionCall<K extends CallableOption>(\n\tname: K,\n\t...args: NonNullable<(typeof options)[K]> extends (...a: infer A) => unknown ? A : never\n): void {\n\tconst fn = options[name]\n\tif (typeof fn !== 'function') return\n\ttry {\n\t\t;(fn as Function)(...args)\n\t} catch (error) {\n\t\toptions.warn(`options.${name} threw`, error)\n\t}\n}\n\n/** Production preset: no introspection, heuristic cycle detection, minimal overhead */\nexport const prodPreset: Partial<typeof options> = {\n\tmaxEffectReaction: 'throw',\n\tcycleHandling: 'production',\n\tintrospection: null,\n\tonMemoizationDiscrepancy: undefined,\n}\n\n/** Development preset (default): introspection on, early cycle detection, warnings */\nexport const devPreset: Partial<typeof options> = {\n\tmaxEffectReaction: 'warn',\n\tcycleHandling: 'development',\n\tintrospection: {\n\t\tgatherReasons: { lineages: 'touch' },\n\t\tlogErrors: true,\n\t\tenableHistory: true,\n\t\thistorySize: 50,\n\t},\n\tonMemoizationDiscrepancy: undefined,\n}\n\n/** Debug preset: full diagnostics, throws on violations, rich lineage capture */\nexport const debugPreset: Partial<typeof options> = {\n\tmaxEffectReaction: 'debug',\n\tcycleHandling: 'debug',\n\tintrospection: {\n\t\tgatherReasons: { lineages: 'both' },\n\t\tlogErrors: true,\n\t\tenableHistory: true,\n\t\thistorySize: 200,\n\t},\n}\n\n// --- Proxy State (Merged from proxy-state.ts) ---\n\nexport const objectToProxy = new WeakMap<object, object>()\nexport const proxyToObject = new WeakMap<object, object>()\n\nexport function storeProxyRelationship(target: object, proxy: object) {\n\tobjectToProxy.set(target, proxy)\n\tproxyToObject.set(proxy, target)\n}\n\nexport function getExistingProxy<T extends object>(target: T): T | undefined {\n\treturn objectToProxy.get(target) as T | undefined\n}\n\nexport function trackProxyObject(proxy: object, target: object) {\n\tproxyToObject.set(proxy, target)\n}\n\nexport function unwrap<T>(obj: T): T {\n\tif (!obj || typeof obj !== 'object') return obj\n\treturn (proxyToObject.get(obj as object) as T) || obj\n}\n\nexport function isReactive(obj: any): boolean {\n\treturn proxyToObject.has(obj)\n}\n","import { debugHooks } from './debug-hooks'\nimport { getActiveEffect } from './effect-context'\nimport { effectToReactiveObjects, getEffectNode, watchers } from './registry'\nimport { allProps, type EffectTrigger, keysOf, options, unwrap } from './types'\n\n// Track dependency stacks per (obj, prop, effect)\nlet dependencyStacks = new WeakMap<object, Map<any, Map<EffectTrigger, unknown>>>()\nlet assertUntrackedFlag = false\n\nexport function resetTracking() {\n\tdependencyStacks = new WeakMap()\n}\n\n/**\n * Executes a function and throws if any reactive dependencies are tracked during execution.\n * Used to assert that code runs in an untracked context.\n */\nexport function assertUntracked<T>(fn: () => T): T {\n\tif (assertUntrackedFlag) {\n\t\tthrow new Error('assertUntracked: nested calls are not supported')\n\t}\n\tassertUntrackedFlag = true\n\ttry {\n\t\treturn fn()\n\t} finally {\n\t\tassertUntrackedFlag = false\n\t}\n}\n\nfunction getDependencyStack(effect: EffectTrigger, obj: object, prop: any): unknown | undefined {\n\tconst objStacks = dependencyStacks.get(obj)\n\tif (!objStacks) return undefined\n\treturn objStacks.get(prop)?.get(effect) ?? objStacks.get(allProps)?.get(effect)\n}\n\nexport { getDependencyStack }\n\n/**\n * Marks a property as a dependency of the current effect\n * @param obj - The object containing the property\n * @param prop - The property name (defaults to allProps)\n */\nexport function dependant(obj: any, prop: any = allProps) {\n\tif (assertUntrackedFlag) {\n\t\tthrow new Error(\n\t\t\t`Reactive dependency tracking detected in assertUntracked context: ${String(prop)} on ${obj}`\n\t\t)\n\t}\n\tobj = unwrap(obj)\n\tconst currentActiveEffect = getActiveEffect()\n\n\t// Early return if no active effect, tracking disabled, or invalid prop\n\tif (!currentActiveEffect || (typeof prop === 'symbol' && prop !== allProps && prop !== keysOf))\n\t\treturn\n\n\tconst node = getEffectNode(currentActiveEffect)\n\tif ('dependencyHook' in node) {\n\t\tnode.dependencyHook(obj, prop)\n\t}\n\tlet objectWatchers = watchers.get(obj)\n\tif (!objectWatchers) {\n\t\tobjectWatchers = new Map<PropertyKey, Set<EffectTrigger>>()\n\t\twatchers.set(obj, objectWatchers)\n\t}\n\tlet deps = objectWatchers.get(prop)\n\tif (!deps) {\n\t\tdeps = new Set<EffectTrigger>()\n\t\tobjectWatchers.set(prop, deps)\n\t}\n\tdeps.add(currentActiveEffect)\n\n\t// Track which reactive objects this effect is watching\n\tconst effectObjects = effectToReactiveObjects.get(currentActiveEffect)\n\tif (effectObjects) {\n\t\teffectObjects.add(obj)\n\t} else {\n\t\teffectToReactiveObjects.set(currentActiveEffect, new Set([obj]))\n\t}\n\n\t// Store dependency stack if introspection is enabled\n\tconst gatherReasons = options.introspection?.gatherReasons\n\tif (gatherReasons) {\n\t\tconst lineageConfig = gatherReasons.lineages\n\t\tif (lineageConfig === 'dependency' || lineageConfig === 'both') {\n\t\t\tlet objStacks = dependencyStacks.get(obj)\n\t\t\tif (!objStacks) {\n\t\t\t\tobjStacks = new Map()\n\t\t\t\tdependencyStacks.set(obj, objStacks)\n\t\t\t}\n\t\t\tlet propStacks = objStacks.get(prop)\n\t\t\tif (!propStacks) {\n\t\t\t\tpropStacks = new Map()\n\t\t\t\tobjStacks.set(prop, propStacks)\n\t\t\t}\n\t\t\tpropStacks.set(currentActiveEffect, debugHooks.captureLineage())\n\t\t}\n\t}\n}\n","import { decorator } from '../decorator'\nimport { flavored, flavorOptions } from '../flavored'\nimport { IterableWeakSet } from '../iterableWeak'\nimport { named } from '../utils'\nimport type { HistoryValue } from '../zone'\nimport { debugHooks } from './debug-hooks'\nimport { effectAggregator, effectHistory, getActiveEffect } from './effect-context'\nimport {\n\teffectToReactiveObjects,\n\tgetEffectNode,\n\tgetRoot,\n\tmarkWithRoot,\n\tresetRegistry,\n\twatchers,\n} from './registry'\nimport { resetTracking } from './tracking'\nimport {\n\ttype CatchFunction,\n\ttype CleanupReason,\n\ttype EffectAccess,\n\ttype EffectCleanup,\n\ttype EffectCloser,\n\ttype EffectOptions,\n\ttype EffectTrigger,\n\ttype Evolution,\n\teffectMarker,\n\toptionCall,\n\toptions,\n\t// type AsyncExecutionMode,\n\ttype PropTrigger,\n\tReactiveError,\n\tReactiveErrorCode,\n\ttype ScopedCallback,\n\tunwrap,\n} from './types'\n\n/**\n * Finds a cycle in a sequence of functions by looking for the first repetition\n */\nfunction findCycleInChain(roots: Function[]): Function[] | null {\n\tconst seen = new Map<Function, number>()\n\tfor (let i = 0; i < roots.length; i++) {\n\t\tconst root = roots[i]\n\t\tif (seen.has(root)) {\n\t\t\treturn roots.slice(seen.get(root)!)\n\t\t}\n\t\tseen.set(root, i)\n\t}\n\treturn null\n}\n\n/**\n * Formats a list of function roots into a readable trace\n */\nfunction formatRoots(roots: Function[], limit = 20): string {\n\tconst names = roots.map((r) => r.name || '<anonymous>')\n\tif (names.length <= limit) return names.join(' → ')\n\tconst start = names.slice(0, 5)\n\tconst end = names.slice(-10)\n\treturn `${start.join(' → ')} ... (${names.length - 15} more) ... ${end.join(' → ')}`\n}\n\nexport interface ActivationRecord {\n\teffect: EffectTrigger\n\tobj: any\n\tevolution: Evolution\n\tprop: any\n\tbatchId: number\n}\n\n// Nested map structure for efficient counting and batch cleanup\n// batchId -> effect root -> obj -> prop -> count\nlet activationRegistry: Map<Function, Map<any, Map<any, number>>> | undefined\n\nexport const activationLog: Omit<ActivationRecord, 'batchId'>[] = new Array(100)\n\n/**\n * Returns the activation log containing recent effect activations for debugging.\n * The log is a circular buffer of the last 100 activations.\n *\n * @returns Array of activation records\n */\nexport function getActivationLog() {\n\treturn activationLog\n}\n\nexport function recordActivation(effect: EffectTrigger, obj: any, evolution: Evolution, prop: any) {\n\tconst root = getRoot(effect)\n\n\tif (!activationRegistry) return\n\tlet effectData = activationRegistry.get(root)\n\tif (!effectData) {\n\t\teffectData = new Map()\n\t\tactivationRegistry.set(root, effectData)\n\t}\n\tlet objData = effectData.get(obj)\n\tif (!objData) {\n\t\tobjData = new Map()\n\t\teffectData.set(obj, objData)\n\t}\n\tconst count = (objData.get(prop) ?? 0) + 1\n\tobjData.set(prop, count)\n\n\t// Keep a limited history for diagnostics\n\tactivationLog.unshift({\n\t\teffect,\n\t\tobj,\n\t\tevolution,\n\t\tprop,\n\t})\n\tactivationLog.pop()\n\n\tif (count >= options.maxTriggerPerBatch) {\n\t\tconst effectName = root.name\n\t\tconst message = `Aggressive trigger detected: effect \"${effectName}\" triggered ${count} times in the batch by the same cause.`\n\t\tif (options.maxEffectReaction === 'throw') {\n\t\t\tthrow new ReactiveError(message, {\n\t\t\t\tcode: ReactiveErrorCode.MaxReactionExceeded,\n\t\t\t\tcount,\n\t\t\t\teffect: root,\n\t\t\t})\n\t\t}\n\t\toptions.warn(`[reactive] ${message}`)\n\t}\n}\n\nexport function caught(onThrow: CatchFunction, effect?: EffectTrigger) {\n\teffect ??= getActiveEffect()\n\tif (!effect) throw new Error('Tracking an effect throw while not in an effect')\n\tconst node = getEffectNode(effect)\n\tif (!node.catchers) node.catchers = [onThrow]\n\telse node.catchers.push(onThrow)\n}\n/** @deprecated Use `caught` instead */\nexport const onEffectThrow = caught\n\n// Dependency graph: tracks which effects trigger which other effects\n// Uses roots (Function) as keys for consistency\nlet effectTriggers = new WeakMap<Function, IterableWeakSet<Function>>()\nlet effectTriggeredBy = new WeakMap<Function, IterableWeakSet<Function>>()\n\n// Transitive closures: track all indirect relationships\n// causesClosure: for each effect, all effects that trigger it (directly or indirectly)\n// consequencesClosure: for each effect, all effects that it triggers (directly or indirectly)\nlet causesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\nlet consequencesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\n\n// Batch re-entrance depth and broken state\nlet broken = false\n\n// Debug: Capture where an effect was created\nexport const effectCreationStacks = new WeakMap<Function, unknown[]>()\n\n/**\n * Gets or creates an IterableWeakSet for a closure map\n */\nfunction getOrCreateClosure(\n\tclosure: WeakMap<Function, IterableWeakSet<Function>>,\n\troot: Function\n): IterableWeakSet<Function> {\n\tlet set = closure.get(root)\n\tif (!set) {\n\t\tset = new IterableWeakSet()\n\t\tclosure.set(root, set)\n\t}\n\treturn set\n}\n\n/**\n * Adds an edge to the dependency graph: callerRoot → targetRoot\n * Also maintains transitive closures\n * @param callerRoot - Root function of the effect that triggers\n * @param targetRoot - Root function of the effect being triggered\n */\nfunction addGraphEdge(callerRoot: Function, targetRoot: Function) {\n\tif (options.cycleHandling === 'production') return\n\t// Add to forward graph: callerRoot → targetRoot\n\tconst triggers = effectTriggers.get(callerRoot)\n\n\tif (!triggers) {\n\t\tconst newTriggers = new IterableWeakSet<Function>()\n\t\tnewTriggers.add(targetRoot)\n\t\teffectTriggers.set(callerRoot, newTriggers)\n\t} else {\n\t\ttriggers.add(targetRoot)\n\t}\n\n\t// Add to reverse graph: targetRoot ← callerRoot\n\tlet triggeredBy = effectTriggeredBy.get(targetRoot)\n\tif (!triggeredBy) {\n\t\ttriggeredBy = new IterableWeakSet()\n\t\teffectTriggeredBy.set(targetRoot, triggeredBy)\n\t}\n\ttriggeredBy.add(callerRoot)\n\n\t// Update transitive closures\n\t// When U→V is added, we need to propagate the relationship:\n\t// 1. Add U to causesClosure(V) and V to consequencesClosure(U) (direct relationship)\n\t// 2. For each X in causesClosure(U): add V to consequencesClosure(X) and X to causesClosure(V)\n\t// 3. For each Y in consequencesClosure(V): add U to causesClosure(Y) and Y to consequencesClosure(U)\n\t// Note: Self-loops (U→U) are not added to closures - if an effect appears in its own closure,\n\t// it means there's an indirect cycle that should be detected\n\n\t// Self-loops are explicitly ignored - an effect reading and writing the same property\n\t// (e.g., obj.prop++) should not create a dependency relationship or appear in closures\n\tif (callerRoot === targetRoot) {\n\t\treturn\n\t}\n\n\tconst uConsequences = getOrCreateClosure(consequencesClosure, callerRoot)\n\tconst vCauses = getOrCreateClosure(causesClosure, targetRoot)\n\n\t// 1. Add direct relationship\n\tuConsequences.add(targetRoot)\n\tvCauses.add(callerRoot)\n\n\t// 2. For each X in causesClosure(U): X→U→V means X→V\n\tconst uCausesSet = causesClosure.get(callerRoot)\n\tif (uCausesSet) {\n\t\tfor (const x of uCausesSet) {\n\t\t\t// Skip if this would create a self-loop\n\t\t\tif (x === targetRoot) continue\n\t\t\tconst xConsequences = getOrCreateClosure(consequencesClosure, x)\n\t\t\txConsequences.add(targetRoot)\n\t\t\tvCauses.add(x)\n\t\t}\n\t}\n\n\t// 3. For each Y in consequencesClosure(V): U→V→Y means U→Y\n\tconst vConsequencesSet = consequencesClosure.get(targetRoot)\n\tif (vConsequencesSet) {\n\t\tfor (const y of vConsequencesSet) {\n\t\t\t// Skip if this would create a self-loop\n\t\t\tif (y === callerRoot) continue\n\t\t\tconst yCauses = getOrCreateClosure(causesClosure, y)\n\t\t\tyCauses.add(callerRoot)\n\t\t\tuConsequences.add(y)\n\t\t}\n\t}\n\n\t// 4. Cross-product: for each X in causesClosure(U) and Y in consequencesClosure(V): X→Y\n\tif (uCausesSet?.size && vConsequencesSet?.size) {\n\t\tfor (const x of uCausesSet) {\n\t\t\tconst xConsequences = getOrCreateClosure(consequencesClosure, x)\n\t\t\tfor (const y of vConsequencesSet) {\n\t\t\t\t// Skip if this would create a self-loop\n\t\t\t\tif (x === y) continue\n\t\t\t\txConsequences.add(y)\n\t\t\t\tconst yCauses = getOrCreateClosure(causesClosure, y)\n\t\t\t\tyCauses.add(x)\n\t\t\t}\n\t\t}\n\t}\n}\n\n/**\n * Checks if there's a path from start to end in the dependency graph, excluding a specific node\n * Uses BFS to find any path that doesn't go through the excluded node\n * @param start - Starting node\n * @param end - Target node\n * @param exclude - Node to exclude from the path\n * @returns true if a path exists without going through the excluded node\n */\nfunction hasPathExcluding(start: Function, end: Function, exclude: Function): boolean {\n\tif (start === end) return true\n\tif (start === exclude) return false\n\n\tconst visited = new Set<Function>()\n\tconst queue: Function[] = [start]\n\tvisited.add(start)\n\tvisited.add(exclude) // Pre-mark excluded node as visited to skip it\n\n\twhile (queue.length > 0) {\n\t\tconst current = queue.shift()!\n\t\tconst triggers = effectTriggers.get(current)\n\t\tif (!triggers) continue\n\n\t\tfor (const next of triggers) {\n\t\t\tif (next === end) return true\n\t\t\tif (!visited.has(next)) {\n\t\t\t\tvisited.add(next)\n\t\t\t\tqueue.push(next)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false\n}\n\n/**\n * Removes all edges involving the given effect from the dependency graph\n * Also cleans up transitive closures by propagating cleanup to all affected effects\n * Called when an effect is stopped/cleaned up\n * @param effect - The effect being cleaned up\n */\nfunction cleanupEffectFromGraph(effect: EffectTrigger) {\n\tif (options.cycleHandling === 'production') return\n\tconst root = getRoot(effect)\n\n\t// Get closures before removing direct edges (needed for propagation)\n\tconst rootCauses = causesClosure.get(root)\n\tconst rootConsequences = consequencesClosure.get(root)\n\n\t// Remove from effectTriggers (outgoing edges)\n\tconst triggers = effectTriggers.get(root)\n\tif (triggers) {\n\t\t// Remove this root from all targets' effectTriggeredBy sets\n\t\tfor (const targetRoot of triggers) {\n\t\t\tconst triggeredBy = effectTriggeredBy.get(targetRoot)\n\t\t\ttriggeredBy?.delete(root)\n\t\t}\n\t\teffectTriggers.delete(root)\n\t}\n\n\t// Remove from effectTriggeredBy (incoming edges)\n\tconst triggeredBy = effectTriggeredBy.get(root)\n\tif (triggeredBy) {\n\t\t// Remove this root from all sources' effectTriggers sets\n\t\tfor (const sourceRoot of triggeredBy) {\n\t\t\tconst triggers = effectTriggers.get(sourceRoot)\n\t\t\ttriggers?.delete(root)\n\t\t}\n\t\teffectTriggeredBy.delete(root)\n\t}\n\n\t// Propagate closure cleanup to all affected effects\n\t// When removing B from A → B → C:\n\t// - Remove B from causesClosure(C) and consequencesClosure(A)\n\t// - For each X in causesClosure(B): remove C from consequencesClosure(X) if B was the only path\n\t// - For each Y in consequencesClosure(B): remove A from causesClosure(Y) if B was the only path\n\t// - Remove transitive relationships that depended on B\n\n\tif (rootCauses) {\n\t\t// For each X that triggers root: remove root from X's consequences\n\t\t// Only remove root's consequences if no alternate path exists\n\t\tfor (const causeRoot of rootCauses) {\n\t\t\tconst causeConsequences = consequencesClosure.get(causeRoot)\n\t\t\tif (causeConsequences) {\n\t\t\t\t// Remove root itself (it's being cleaned up)\n\t\t\t\tcauseConsequences.delete(root)\n\t\t\t\t// Only remove consequences of root if there's no alternate path from causeRoot to them\n\t\t\t\tif (rootConsequences) {\n\t\t\t\t\tfor (const consequence of rootConsequences) {\n\t\t\t\t\t\t// Check if causeRoot can still reach consequence without going through root\n\t\t\t\t\t\tif (!hasPathExcluding(causeRoot, consequence, root)) {\n\t\t\t\t\t\t\tcauseConsequences.delete(consequence)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (rootConsequences) {\n\t\t// For each Y that root triggers: remove root from Y's causes\n\t\t// Only remove root's causes if no alternate path exists\n\t\tfor (const consequenceRoot of rootConsequences) {\n\t\t\tconst consequenceCauses = causesClosure.get(consequenceRoot)\n\t\t\tif (consequenceCauses) {\n\t\t\t\t// Remove root itself (it's being cleaned up)\n\t\t\t\tconsequenceCauses.delete(root)\n\t\t\t\t// Only remove causes of root if there's no alternate path from them to consequenceRoot\n\t\t\t\tif (rootCauses) {\n\t\t\t\t\tfor (const cause of rootCauses) {\n\t\t\t\t\t\t// Check if cause can still reach consequenceRoot without going through root\n\t\t\t\t\t\tif (!hasPathExcluding(cause, consequenceRoot, root)) {\n\t\t\t\t\t\t\tconsequenceCauses.delete(cause)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Cross-product cleanup: for each X in causesClosure(B) and Y in consequencesClosure(B),\n\t// remove X→Y if B was the only path connecting them\n\tif (rootCauses && rootConsequences) {\n\t\tfor (const x of rootCauses) {\n\t\t\tconst xConsequences = consequencesClosure.get(x)\n\t\t\tif (xConsequences) {\n\t\t\t\tfor (const y of rootConsequences) {\n\t\t\t\t\t// Check if there's still a path from X to Y without going through root\n\t\t\t\t\t// Use BFS to find any path that doesn't include root\n\t\t\t\t\tif (!hasPathExcluding(x, y, root)) {\n\t\t\t\t\t\txConsequences.delete(y)\n\t\t\t\t\t\tconst yCauses = causesClosure.get(y)\n\t\t\t\t\t\tyCauses?.delete(x)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Finally, delete the closures for this effect\n\tcausesClosure.delete(root)\n\tconsequencesClosure.delete(root)\n}\n\n// Batch queue structure - optimized with cached in-degrees\ninterface BatchQueue {\n\t// All effects in the current batch that still need to be executed (todos)\n\tall: Map<Function, EffectTrigger> // root → effect\n\t// Cached in-degrees for each effect in the batch (number of causes in batch)\n\tinDegrees: Map<Function, number> // root → in-degree count\n\t// Deferred callbacks to run after this batch completes (populated by defer())\n\tdeferreds: Set<ScopedCallback>\n}\n\n// Track currently executing effects to prevent re-execution\n// These are all the effects triggered under `activeEffect`\n// Batch stack - handles nested batches by giving each its own queue\nconst batchStack: BatchQueue[] = []\nexport function hasBatched(effect: EffectTrigger) {\n\tconst root = getRoot(effect)\n\treturn batchStack.some((bs) => bs.all.has(root))\n}\n// DEV: stack of currently-executing effects (push on enter, pop on leave)\nconst executingStack: EffectTrigger[] = []\nexport function getExecutingStack(): readonly EffectTrigger[] {\n\treturn executingStack\n}\n\n/**\n * Computes and caches in-degrees for all effects in the batch\n * Called once when batch starts or when new effects are added\n */\nfunction computeAllInDegrees(batch: BatchQueue): void {\n\tif (options.cycleHandling === 'production') return\n\tconst activeEffect = getActiveEffect()\n\tconst activeRoot = activeEffect ? getRoot(activeEffect) : null\n\n\t// Reset all in-degrees\n\tbatch.inDegrees.clear()\n\n\tfor (const [root] of batch.all) {\n\t\tlet inDegree = 0\n\t\tconst causes = causesClosure.get(root)\n\t\tif (causes) {\n\t\t\tfor (const causeRoot of causes) {\n\t\t\t\t// Only count if it's in the batch and not the active/self effect\n\t\t\t\tif (batch.all.has(causeRoot) && causeRoot !== activeRoot && causeRoot !== root) {\n\t\t\t\t\tinDegree++\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbatch.inDegrees.set(root, inDegree)\n\t}\n}\n\n/**\n * Decrements in-degrees of all effects that depend on the executed effect\n * Called after an effect is executed to update the cached in-degrees\n */\nfunction decrementInDegreesForExecuted(batch: BatchQueue, executedRoot: Function): void {\n\t// Get all effects that this executed effect triggers\n\tconst consequences = consequencesClosure.get(executedRoot)\n\tif (!consequences) return\n\n\tfor (const consequenceRoot of consequences) {\n\t\t// Only update if it's still in the batch\n\t\tif (batch.all.has(consequenceRoot)) {\n\t\t\tconst currentDegree = batch.inDegrees.get(consequenceRoot) ?? 0\n\t\t\tif (currentDegree > 0) {\n\t\t\t\tbatch.inDegrees.set(consequenceRoot, currentDegree - 1)\n\t\t\t}\n\t\t}\n\t}\n}\n\n/**\n * Finds a path from startRoot to endRoot in the dependency graph\n * Uses DFS to find the path through direct edges\n * @param startRoot - Starting effect root\n * @param endRoot - Target effect root\n * @param visited - Set of visited nodes (for recursion)\n * @param path - Current path being explored\n * @returns Path from startRoot to endRoot, or empty array if no path exists\n */\nfunction findPath(\n\tstartRoot: Function,\n\tendRoot: Function,\n\tvisited: Set<Function> = new Set(),\n\tpath: Function[] = []\n): Function[] {\n\tif (startRoot === endRoot) {\n\t\treturn [...path, endRoot]\n\t}\n\n\tif (visited.has(startRoot)) {\n\t\treturn []\n\t}\n\n\tvisited.add(startRoot)\n\tconst newPath = [...path, startRoot]\n\n\tconst triggers = effectTriggers.get(startRoot)\n\tif (triggers) {\n\t\tfor (const targetRoot of triggers) {\n\t\t\tconst result = findPath(targetRoot, endRoot, visited, newPath)\n\t\t\tif (result.length > 0) {\n\t\t\t\treturn result\n\t\t\t}\n\t\t}\n\t}\n\n\treturn []\n}\n\n/**\n * Gets the cycle path when adding an edge would create a cycle\n * @param callerRoot - Root of the effect that triggers\n * @param targetRoot - Root of the effect being triggered\n * @returns Array of effect roots forming the cycle, or empty array if no cycle\n */\nfunction getCyclePathForEdge(callerRoot: Function, targetRoot: Function): Function[] {\n\t// Find path from targetRoot back to callerRoot (this is the existing path)\n\t// Then adding callerRoot -> targetRoot completes the cycle\n\tconst path = findPath(targetRoot, callerRoot)\n\tif (path.length > 0) {\n\t\t// The cycle is: callerRoot -> targetRoot -> ... -> callerRoot\n\t\treturn [callerRoot, ...path]\n\t}\n\treturn []\n}\n\n/**\n * Checks if adding an edge would create a cycle\n * Uses causesClosure to check if callerRoot is already a cause of targetRoot\n * Self-loops (callerRoot === targetRoot) are explicitly ignored and return false\n *\n * **Note**: This is the primary optimization benefit of the transitive closure system.\n * It allows detecting cycles in O(1) time before they are executed.\n *\n * @param callerRoot - Root of the effect that triggers\n * @param targetRoot - Root of the effect being triggered\n * @returns true if adding this edge would create a cycle\n */\nfunction wouldCreateCycle(callerRoot: Function, targetRoot: Function): boolean {\n\t// Self-loops are explicitly ignored - an effect reading and writing the same property\n\t// (e.g., obj.prop++) should not create a dependency relationship\n\tif (callerRoot === targetRoot) {\n\t\treturn false\n\t}\n\n\t// Check if targetRoot already triggers callerRoot (directly or indirectly)\n\t// This would create a cycle: callerRoot -> targetRoot -> ... -> callerRoot\n\t// Using consequencesClosure: if targetRoot triggers callerRoot, then callerRoot is in consequencesClosure(targetRoot)\n\tconst targetConsequences = consequencesClosure.get(targetRoot)\n\tif (targetConsequences?.has(callerRoot)) {\n\t\treturn true // Cycle detected: targetRoot -> ... -> callerRoot, and we're adding callerRoot -> targetRoot\n\t}\n\n\treturn false\n}\n\n/**\n * Adds an effect to the batch queue\n * @param effect - The effect to add\n * @param caller - The active effect that triggered this one (optional)\n * @param immediate - If true, don't create edges in the dependency graph\n */\nfunction addToBatch(\n\teffect: EffectTrigger,\n\tcaller?: EffectTrigger,\n\timmediate?: boolean,\n\treason?: CleanupReason\n) {\n\tconst node = getEffectNode(effect)\n\tconst currentBatch = batchStack[batchStack.length - 1]\n\n\tif (!currentBatch) {\n\t\treturn\n\t}\n\n\tconst root = getRoot(effect)\n\n\t// Build reason from pending triggers if not provided\n\tif (!reason && node.pendingTriggers) {\n\t\treason = { type: 'propChange', triggers: node.pendingTriggers }\n\t}\n\tnode.pendingTriggers = undefined\n\n\tif (reason) {\n\t\tconst existing = node.nextReason\n\t\tif (!existing) {\n\t\t\tnode.nextReason = reason\n\t\t} else {\n\t\t\tconst mergePropChange = (\n\t\t\t\tinto: CleanupReason,\n\t\t\t\tfrom: { type: 'propChange'; triggers: PropTrigger[] }\n\t\t\t): boolean => {\n\t\t\t\tif (into.type === 'propChange') {\n\t\t\t\t\tinto.triggers.push(...from.triggers)\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t\tif (into.type === 'multiple') {\n\t\t\t\t\tconst target = into.reasons.find((r) => r.type === 'propChange') as\n\t\t\t\t\t\t| { type: 'propChange'; triggers: PropTrigger[] }\n\t\t\t\t\t\t| undefined\n\t\t\t\t\tif (target) {\n\t\t\t\t\t\ttarget.triggers.push(...from.triggers)\n\t\t\t\t\t\treturn true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\tif (reason.type === 'propChange') {\n\t\t\t\tif (!mergePropChange(existing, reason)) {\n\t\t\t\t\tif (existing.type === 'multiple') {\n\t\t\t\t\t\texisting.reasons.push(reason)\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnode.nextReason = { type: 'multiple', reasons: [existing, reason] }\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (existing.type === 'multiple') {\n\t\t\t\texisting.reasons.push(reason)\n\t\t\t} else {\n\t\t\t\tnode.nextReason = { type: 'multiple', reasons: [existing, reason] }\n\t\t\t}\n\t\t}\n\t}\n\n\t// 1. Add to batch first (needed for cycle detection)\n\t// TODO: Check if it's the correct way to do (these different behavior in function of dev/production)\n\tif (options.cycleHandling === 'production') {\n\t\t// Production mode: FIFO (delete and re-add to move to end)\n\t\tif (currentBatch.all.has(root)) {\n\t\t\tcurrentBatch.all.delete(root)\n\t\t}\n\t} else {\n\t\t// Dev mode: skip if already queued — the existing entry will re-run\n\t\tif (currentBatch.all.has(root)) {\n\t\t\treturn\n\t\t}\n\t}\n\n\t// If the effect was stopped during cleanup (e.g. lazy memoization), don't add it to the batch\n\tif (node.stopped) return\n\n\tcurrentBatch.all.set(root, effect)\n\n\tif (caller && !immediate && options.cycleHandling !== 'production') {\n\t\tconst callerRoot = getRoot(caller)\n\t\t// const root = getRoot(effect) // Already have root\n\n\t\t// Check for cycle BEFORE adding edge\n\t\tif (wouldCreateCycle(callerRoot, root)) {\n\t\t\tconst cyclePath = getCyclePathForEdge(callerRoot, root)\n\t\t\tconst cycleMessage =\n\t\t\t\tcyclePath.length > 0\n\t\t\t\t\t? `Cycle detected: ${cyclePath.map((r) => r.name || r.toString()).join(' → ')}`\n\t\t\t\t\t: `Cycle detected: ${callerRoot.name || callerRoot.toString()} → ${root.name || root.toString()} (and back)`\n\n\t\t\tcurrentBatch.all.delete(root)\n\t\t\tconst causalChain = debugHooks.getTriggerChain(effect)\n\t\t\tconst lineage = getEffectNode(effect).creationStack\n\n\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`, {\n\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\tcycle: cyclePath.map((r) => r.name || r.toString()),\n\t\t\t\tdetails: cycleMessage,\n\t\t\t\tcausalChain,\n\t\t\t\tlineage,\n\t\t\t})\n\t\t}\n\n\t\taddGraphEdge(callerRoot, root)\n\t}\n}\n\n/**\n * Adds a cleanup function to be called when the current batch of effects completes\n * @param cleanup - The cleanup function to add\n */\nexport function addBatchCleanup(cleanup: EffectCleanup) {\n\tconst currentBatch = batchStack[batchStack.length - 1]\n\tif (!currentBatch) cleanup()\n\telse currentBatch.deferreds.add(cleanup)\n}\n\n/**\n * Semantic alias for `addBatchCleanup` - defers work to the end of the current reactive batch.\n *\n * Use this when an effect needs to perform an action that would modify state the effect depends on,\n * which would create a reactive cycle. The deferred callback runs after all effects complete.\n *\n * @param callback - The callback to defer until after the current batch completes\n *\n * @example\n * ```typescript\n * effect(() => {\n *   processData()\n *\n *   // Defer to avoid cycle (createMovement modifies state this effect reads)\n *   defer(() => {\n *     createMovement(data)\n *   })\n * })\n * ```\n */\nexport const defer = addBatchCleanup\n\n/**\n * Gets a cycle path for debugging\n * Uses DFS to find cycles in the batch\n * @param batch - The batch queue\n * @returns Array of effect roots forming a cycle\n */\nfunction getCyclePath(batch: BatchQueue): Function[] {\n\t// If all effects have in-degree > 0, there must be a cycle\n\t// Use DFS to find it\n\tconst visited = new Set<Function>()\n\tconst recursionStack = new Set<Function>()\n\tconst path: Function[] = []\n\n\tfor (const [root] of batch.all) {\n\t\tif (visited.has(root)) continue\n\t\tconst cycle = findCycle(root, visited, recursionStack, path, batch)\n\t\tif (cycle.length > 0) {\n\t\t\treturn cycle\n\t\t}\n\t}\n\n\treturn []\n}\n\nfunction findCycle(\n\troot: Function,\n\tvisited: Set<Function>,\n\trecursionStack: Set<Function>,\n\tpath: Function[],\n\tbatch: BatchQueue\n): Function[] {\n\tif (recursionStack.has(root)) {\n\t\t// Found a cycle! Return the path from the cycle start to root\n\t\tconst cycleStart = path.indexOf(root)\n\t\treturn path.slice(cycleStart).concat([root])\n\t}\n\n\tif (visited.has(root)) {\n\t\treturn []\n\t}\n\n\tvisited.add(root)\n\trecursionStack.add(root)\n\tpath.push(root)\n\n\t// Follow edges to effects in the batch\n\t// Use direct edges (effectTriggers) for cycle detection\n\tconst triggers = effectTriggers.get(root)\n\tif (triggers) {\n\t\tfor (const targetRoot of triggers) {\n\t\t\tif (batch.all.has(targetRoot)) {\n\t\t\t\tconst cycle = findCycle(targetRoot, visited, recursionStack, path, batch)\n\t\t\t\tif (cycle.length > 0) {\n\t\t\t\t\treturn cycle\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tpath.pop()\n\trecursionStack.delete(root)\n\treturn []\n}\n\n/**\n * Executes the next effect in dependency order (using cached in-degrees)\n * Finds an effect with in-degree 0 and executes it\n * @returns The return value of the executed effect, or null if batch is complete\n */\nfunction executeNext(effectuatedRoots: Function[]): any {\n\tconst currentBatch = batchStack[batchStack.length - 1]\n\tif (!currentBatch) return null\n\n\t// Find an effect with in-degree 0 using cached values\n\tlet nextEffect: EffectTrigger | null = null\n\tlet nextRoot: Function | null = null\n\n\tif (options.cycleHandling === 'production') {\n\t\t// In flat mode, we just take the first effect in the queue (FIFO)\n\t\tconst first = currentBatch.all.entries().next().value\n\t\tif (first) {\n\t\t\t;[nextRoot, nextEffect] = first\n\t\t}\n\t} else {\n\t\t// Find an effect with in-degree 0 (no dependencies in batch that still need execution)\n\t\t// Using cached in-degrees for O(n) lookup instead of O(n²)\n\t\tfor (const [root, effect] of currentBatch.all) {\n\t\t\tconst inDegree = currentBatch.inDegrees.get(root) ?? 0\n\t\t\tif (inDegree === 0) {\n\t\t\t\tnextEffect = effect\n\t\t\t\tnextRoot = root\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!nextEffect) {\n\t\t// No effect with in-degree 0 - there must be a cycle\n\t\t// If all effects have dependencies, it means there's a circular dependency\n\t\tif (currentBatch.all.size > 0) {\n\t\t\tlet cycle = getCyclePath(currentBatch)\n\t\t\t// If we couldn't find a cycle path using direct edges, try using closures\n\t\t\t// (transitive relationships) - if all effects have in-degree > 0, there must be a cycle\n\t\t\tif (cycle.length === 0) {\n\t\t\t\t// Try to find a cycle using consequencesClosure (transitive relationships)\n\t\t\t\t// Note: Self-loops are ignored - we only look for cycles between different effects\n\t\t\t\tfor (const [root] of currentBatch.all) {\n\t\t\t\t\tconst consequences = consequencesClosure.get(root)\n\t\t\t\t\tif (consequences) {\n\t\t\t\t\t\t// Check if any consequence in the batch also has root as a consequence\n\t\t\t\t\t\tfor (const consequence of consequences) {\n\t\t\t\t\t\t\t// Skip self-loops - they are ignored\n\t\t\t\t\t\t\tif (consequence === root) continue\n\t\t\t\t\t\t\tif (currentBatch.all.has(consequence)) {\n\t\t\t\t\t\t\t\tconst consequenceConsequences = consequencesClosure.get(consequence)\n\t\t\t\t\t\t\t\tif (consequenceConsequences?.has(root)) {\n\t\t\t\t\t\t\t\t\t// Found cycle: root -> consequence -> root\n\t\t\t\t\t\t\t\t\tcycle = [root, consequence, root]\n\t\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cycle.length > 0) break\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst cycleMessage =\n\t\t\t\tcycle.length > 0\n\t\t\t\t\t? `Cycle detected: ${cycle.map((r) => r.name || '<anonymous>').join(' → ')}`\n\t\t\t\t\t: 'Cycle detected in effect batch - all effects have dependencies that prevent execution'\n\n\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`, {\n\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\tcycle: cycle.map((r) => r.name || r.toString()),\n\t\t\t\tdetails: cycleMessage,\n\t\t\t})\n\t\t}\n\t\treturn null // Batch complete\n\t}\n\n\teffectuatedRoots.push(getRoot(nextEffect))\n\t// Execute the effect\n\texecutingStack.push(nextEffect)\n\tlet result: any\n\ttry {\n\t\tconst node = getEffectNode(nextEffect)\n\t\tconst reason = node.nextReason\n\t\tif (node.cleanup) {\n\t\t\tconst cleanup = node.cleanup\n\t\t\tnode.cleanup = undefined\n\t\t\tcleanup(reason)\n\t\t}\n\t\tresult = nextEffect()\n\t} finally {\n\t\texecutingStack.pop()\n\t}\n\n\t// Remove from ALL batches in the stack and update in-degrees of dependents\n\tfor (let i = batchStack.length - 1; i >= 0; i--) {\n\t\tconst batch = batchStack[i]\n\t\tif (batch.all.has(nextRoot!)) {\n\t\t\tbatch.all.delete(nextRoot!)\n\t\t\tbatch.inDegrees.delete(nextRoot!)\n\t\t\tdecrementInDegreesForExecuted(batch, nextRoot!)\n\t\t}\n\t}\n\n\treturn result\n}\n\n// Track which sub-effects have been executed to prevent infinite loops\n// These are all the effects triggered under `activeEffect` and all their sub-effects\nexport function batch(effect: EffectTrigger | EffectTrigger[], immediate?: 'immediate') {\n\tif (broken) {\n\t\tthrow new ReactiveError(\n\t\t\t'[reactive] Reactive system is broken after an unrecoverable error. Call reset() to recover.',\n\t\t\t{ code: ReactiveErrorCode.BrokenEffects }\n\t\t)\n\t}\n\tif (!Array.isArray(effect)) effect = [effect]\n\tconst roots = effect.map(getRoot)\n\n\tconst isNewBatch = batchStack.length === 0\n\tif (isNewBatch) {\n\t\tif (!activationRegistry) activationRegistry = new Map()\n\t\telse throw new Error('Activation registry already exists')\n\t\toptionCall('beginChain', roots)\n\t}\n\n\t// TODO: Consider this has been produced but was useless - it might be more correct ?const caller = executingStack.length > 0 ? getActiveEffect() : undefined\n\tconst caller = getActiveEffect()\n\n\t// Optimization: If nested and NOT immediate, just join the existing batch\n\tif (!isNewBatch && !immediate) {\n\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\taddToBatch(effect[i], caller, false)\n\t\t}\n\t\treturn\n\t}\n\n\tconst currentBatch: BatchQueue = {\n\t\tall: new Map(),\n\t\tinDegrees: new Map(),\n\t\tdeferreds: new Set(),\n\t}\n\tbatchStack.push(currentBatch)\n\n\tlet success = false\n\ttry {\n\t\tconst effectuatedRoots: Function[] = []\n\t\tconst firstReturn: { value?: any } = {}\n\n\t\tif (immediate) {\n\t\t\t// Execute initial effects in providing order\n\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\texecutingStack.push(effect[i])\n\t\t\t\ttry {\n\t\t\t\t\tconst node = getEffectNode(effect[i])\n\t\t\t\t\tconst reason = node.nextReason\n\t\t\t\t\tif (node.cleanup) {\n\t\t\t\t\t\tconst cleanup = node.cleanup\n\t\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\t\tcleanup(reason)\n\t\t\t\t\t}\n\t\t\t\t\tconst rv = effect[i]()\n\t\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\t} finally {\n\t\t\t\t\texecutingStack.pop()\n\t\t\t\t\tcurrentBatch.all.delete(getRoot(effect[i]))\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\t// Add initial effects to batch and compute dependencies\n\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\taddToBatch(effect[i], caller, false)\n\t\t\t}\n\t\t\tcomputeAllInDegrees(currentBatch)\n\t\t}\n\n\t\t// Process the current batch queue\n\t\twhile (currentBatch.all.size > 0 || currentBatch.deferreds.size > 0) {\n\t\t\tif (currentBatch.all.size > 0) {\n\t\t\t\tif (effectuatedRoots.length > options.maxEffectChain) {\n\t\t\t\t\tconst cycle = findCycleInChain(effectuatedRoots as any)\n\t\t\t\t\tconst trace = formatRoots(effectuatedRoots as any)\n\t\t\t\t\tconst message = cycle\n\t\t\t\t\t\t? `Max effect chain reached (cycle detected: ${formatRoots(cycle)})`\n\t\t\t\t\t\t: `Max effect chain reached (trace: ${trace})`\n\n\t\t\t\t\tconst queuedRoots = Array.from(currentBatch.all.keys())\n\t\t\t\t\tconst queued = queuedRoots.map((r) => r.name || '<anonymous>')\n\t\t\t\t\tconst debugInfo = {\n\t\t\t\t\t\tcode: ReactiveErrorCode.MaxDepthExceeded,\n\t\t\t\t\t\teffectuatedRoots,\n\t\t\t\t\t\tcycle,\n\t\t\t\t\t\ttrace,\n\t\t\t\t\t\tmaxEffectChain: options.maxEffectChain,\n\t\t\t\t\t\tqueued: queued.slice(0, 50),\n\t\t\t\t\t\tqueuedCount: queued.length,\n\t\t\t\t\t\tcausalChain:\n\t\t\t\t\t\t\teffectuatedRoots.length > 0\n\t\t\t\t\t\t\t\t? debugHooks.getTriggerChain(\n\t\t\t\t\t\t\t\t\t\tcurrentBatch.all.get(effectuatedRoots[effectuatedRoots.length - 1])!\n\t\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t: [],\n\t\t\t\t\t}\n\t\t\t\t\tswitch (options.maxEffectReaction) {\n\t\t\t\t\t\tcase 'throw':\n\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\tcase 'debug':\n\t\t\t\t\t\t\t// biome-ignore lint/suspicious/noDebugger: This is the whole point here\n\t\t\t\t\t\t\tdebugger\n\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\tcase 'warn':\n\t\t\t\t\t\t\toptions.warn(\n\t\t\t\t\t\t\t\t`[reactive] ${message} (queued: ${queued.slice(0, 10).join(', ')}${queued.length > 10 ? ', …' : ''})`\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tconst rv = executeNext(effectuatedRoots)\n\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t} else {\n\t\t\t\t// Process deferreds for this batch.\n\t\t\t\tconst deferreds = Array.from(currentBatch.deferreds)\n\t\t\t\tcurrentBatch.deferreds.clear()\n\t\t\t\tfor (const deferred of deferreds) deferred()\n\t\t\t}\n\t\t}\n\t\tsuccess = true\n\t\treturn firstReturn.value\n\t} finally {\n\t\tif (!success && batchStack.length === 1) {\n\t\t\tbroken = true\n\t\t}\n\t\tbatchStack.pop()\n\t\tif (batchStack.length === 0) {\n\t\t\tactivationRegistry = undefined\n\t\t\toptionCall('endChain')\n\t\t}\n\t}\n}\n\n/**\n * Resets the reactive system to a consistent state.\n * Call this after an unrecoverable error has set the system to \"broken\".\n * This clears all batch state, effect dependency graphs, and watcher registrations.\n * All existing effects become orphaned and must be recreated.\n */\nexport function reset() {\n\tbroken = false\n\tactivationRegistry = undefined\n\tbatchStack.length = 0\n\teffectTriggers = new WeakMap()\n\teffectTriggeredBy = new WeakMap()\n\tcausesClosure = new WeakMap()\n\tconsequencesClosure = new WeakMap()\n\tresetRegistry()\n\tresetTracking()\n\teffectHistory.present.active = undefined\n}\n\nexport { reset as resetBatchQueueForTest }\n\n// Inject batch function to allow atomic game loops in requestAnimationFrame/setTimeout/...\n// Note: Automatic batching of async callbacks (setTimeout, Promise.then, etc.) is NOT implemented.\n// Rationale: (1) asyncHooks.addHook API doesn't support knowing when callbacks complete (needed for batching),\n// (2) hooking all callback-creating functions adds overhead without guaranteed benefit,\n// (3) incomplete coverage in Node (async_hooks misses user-land patterns).\n// Solution: Use explicit @atomic decorator or manual batch() calls where optimization is needed.\n\n/**\n * Decorator that makes methods atomic - batches all effects triggered within the method\n */\nexport const atomic = decorator({\n\tmethod(original) {\n\t\treturn function (this: any, ...args: any[]) {\n\t\t\tconst atomicEffect = () => original.apply(this, args)\n\t\t\t// Debug: helpful to have a name\n\t\t\tObject.defineProperty(atomicEffect, 'name', { value: `atomic(${original.name})` })\n\t\t\treturn batch(atomicEffect as EffectTrigger, 'immediate')\n\t\t}\n\t},\n\tdefault<Args extends any[], Return>(\n\t\toriginal: (...args: Args) => Return\n\t): (...args: Args) => Return {\n\t\treturn function (this: any, ...args: Args) {\n\t\t\tconst atomicEffect = () => original.apply(this, args)\n\t\t\t// Debug: helpful to have a name\n\t\t\tObject.defineProperty(atomicEffect, 'name', { value: `atomic(${original.name})` })\n\t\t\treturn batch(atomicEffect as EffectTrigger, 'immediate')\n\t\t}\n\t},\n})\n\n/**\n * Wraps `fn` so it runs within `effect`'s zone context when invoked later.\n *\n * Useful for deferred callbacks (event listeners, `DOMContentLoaded`, etc.)\n * that need sub-effects parented to the original effect.\n *\n * @param prev - The effect whose context should be restored, or `undefined` for root context\n * @param fn - The function to wrap\n * @returns A function with the same signature that restores the effect context before calling `fn`\n */\nexport function captured<Args extends any[], Return>(\n\tprev: HistoryValue<EffectTrigger> | undefined,\n\tfn: (...args: Args) => Return\n): (...args: Args) => Return {\n\tprev ??= effectHistory.active\n\treturn named(effectMarker.leave, (...args: Args) => {\n\t\treturn effectHistory.with(prev, () => fn(...args))\n\t})\n}\n\n/**\n * Runs `fn` atomically and **always immediately**, batching all reactive effects\n * triggered inside it so they fire only once after `fn` completes.\n *\n * Unlike `atomic(fn)` which **wraps** a function for later invocation,\n * `atom(fn)` **executes** the function right away.\n *\n * @example\n * ```ts\n * const state = reactive({ a: 0, b: 0 })\n * effect(() => console.log(state.a, state.b)) // logs once after atom completes\n *\n * atom(() => {\n *   state.a = 1\n *   state.b = 2\n * })\n * ```\n */\nexport function atom<T>(fn: () => T) {\n\treturn batch(fn, 'immediate')\n}\n\nconst fr = new FinalizationRegistry<() => void>((f) => f())\n\n/**\n * @param fn - The effect function to run - provides the cleaner\n * @returns The cleanup function\n */\n/**\n * Reactive effect function with chainable flavor modifiers.\n */\nexport interface Effect {\n\t(\n\t\tfn: (access: EffectAccess) => EffectCloser | undefined | void | Promise<any>,\n\t\teffectOptions?: EffectOptions\n\t): EffectCleanup\n\t/** Opaque flavor: bypasses deep-touch optimizations */\n\treadonly opaque: Effect\n\t/** Named flavor: assigns a debug name */\n\tnamed(name: string): Effect\n}\n\n/**\n * Creates a reactive effect that automatically re-runs when dependencies change\n * @param fn - The effect function that provides dependencies and may return a cleanup function or Promise\n * @param options - Options for effect execution\n * @returns A cleanup function to stop the effect\n */\nexport const effect: Effect = named(\n\teffectMarker.leave,\n\tflavored(\n\t\tfunction effect(\n\t\t\tfn: (access: EffectAccess) => EffectCloser | undefined | void | Promise<any>,\n\t\t\teffectOptions: EffectOptions = {}\n\t\t): EffectCleanup {\n\t\t\tif (effectOptions?.name) Object.defineProperty(fn, 'name', { value: effectOptions.name })\n\t\t\t// Use per-effect asyncMode or fall back to global option\n\t\t\tconst asyncMode = effectOptions?.asyncMode ?? options.asyncMode ?? 'cancel'\n\n\t\t\t// Create the effect function - naming it for debug\n\t\t\tconst runEffect: EffectTrigger = () => {\n\t\t\t\tconst node = getEffectNode(runEffect)\n\t\t\t\t// Clear previous dependencies\n\t\t\t\tif (node.cleanup) {\n\t\t\t\t\tconst prevCleanup = node.cleanup\n\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\ttry {\n\t\t\t\t\t\tuntracked(() => prevCleanup(node.nextReason || { type: 'stopped' }))\n\t\t\t\t\t} catch (error) {\n\t\t\t\t\t\t// If we want to report them, we could use options.warn or similar\n\t\t\t\t\t\toptions.warn('Error during effect cleanup', error)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Handle async modes when effect is retriggered\n\t\t\t\tif (runningPromise) {\n\t\t\t\t\tif (asyncMode === 'cancel' && cancelPrevious) {\n\t\t\t\t\t\t// Cancel previous execution\n\t\t\t\t\t\tabort()\n\t\t\t\t\t\tcancelPrevious()\n\t\t\t\t\t\tcancelPrevious = null\n\t\t\t\t\t\trunningPromise = null\n\t\t\t\t\t} else if (asyncMode === 'ignore') {\n\t\t\t\t\t\t// Ignore new execution while async work is running\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\t// Note: 'queue' mode not yet implemented\n\t\t\t\t}\n\n\t\t\t\t// The effect has been stopped after having been planned\n\t\t\t\tif (effectStopped) return\n\n\t\t\t\tlet reactionCleanup: EffectCloser | undefined\n\t\t\t\tfunction cleanupReaction(reason?: CleanupReason) {\n\t\t\t\t\tconst toCleanup = reactionCleanup\n\t\t\t\t\treactionCleanup = undefined\n\t\t\t\t\ttoCleanup?.(reason)\n\t\t\t\t}\n\t\t\t\t// Set reaction reason for the upcoming run\n\t\t\t\taccess.reaction = node.nextReason || access.reaction\n\t\t\t\tnode.nextReason = undefined\n\n\t\t\t\toptionCall('enter', getRoot(fn))\n\t\t\t\toptionCall('effectRun', getRoot(fn), access.reaction)\n\t\t\t\tlet result: any\n\t\t\t\tlet caught = 0\n\n\t\t\t\t// Define bubbling thrower\n\t\t\t\tconst thrower: CatchFunction = (error: any) => {\n\t\t\t\t\tconst catches = node.catchers\n\t\t\t\t\tconst reason: CleanupReason = { type: 'error', error }\n\t\t\t\t\tif (catches)\n\t\t\t\t\t\twhile (caught < catches.length) {\n\t\t\t\t\t\t\tcleanupReaction(reason)\n\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\treactionCleanup = catches[caught](error) as EffectCloser\n\t\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t\t} catch (_e) {\n\t\t\t\t\t\t\t\tcaught++\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\tif (parent) {\n\t\t\t\t\t\tconst parentNode = getEffectNode(parent)\n\t\t\t\t\t\tif (parentNode.forwardThrow) parentNode.forwardThrow(error)\n\t\t\t\t\t\telse throw error\n\t\t\t\t\t} else throw error\n\t\t\t\t}\n\t\t\t\tnode.forwardThrow = thrower\n\n\t\t\t\tlet errorToThrow: Error | undefined\n\t\t\t\ttry {\n\t\t\t\t\tresult = tracked(named(effectMarker.enter, () => fn.call(null, access)))\n\t\t\t\t\taccess.reaction = true\n\t\t\t\t\toptionCall('leave', fn)\n\t\t\t\t\tif (\n\t\t\t\t\t\tresult &&\n\t\t\t\t\t\ttypeof result !== 'function' &&\n\t\t\t\t\t\t(typeof result !== 'object' || !('then' in result))\n\t\t\t\t\t)\n\t\t\t\t\t\tthrow new ReactiveError(`[reactive] Effect returned a non-function value: ${result}`)\n\t\t\t\t\t// Check if result is a Promise (async effect)\n\t\t\t\t\tif (result && typeof result === 'object' && typeof result.then === 'function') {\n\t\t\t\t\t\tconst originalPromise = result as Promise<any>\n\n\t\t\t\t\t\t// Create a cancellation promise that we can reject\n\t\t\t\t\t\tlet cancelReject: ((reason: any) => void) | null = null\n\t\t\t\t\t\tconst cancelPromise = new Promise<never>((_, reject) => {\n\t\t\t\t\t\t\tcancelReject = reject\n\t\t\t\t\t\t})\n\n\t\t\t\t\t\tconst cancelError = new ReactiveError(\n\t\t\t\t\t\t\t'[reactive] Effect canceled due to dependency change'\n\t\t\t\t\t\t)\n\n\t\t\t\t\t\t// Race between the actual promise and cancellation\n\t\t\t\t\t\t// If canceled, the race rejects, which will propagate through any promise chain\n\t\t\t\t\t\trunningPromise = Promise.race([originalPromise, cancelPromise])\n\n\t\t\t\t\t\t// Store the cancellation function\n\t\t\t\t\t\tcancelPrevious = () => {\n\t\t\t\t\t\t\tif (cancelReject) {\n\t\t\t\t\t\t\t\tcancelReject(cancelError)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Wrap the original promise chain so cancellation propagates\n\t\t\t\t\t\t// This ensures that when we cancel, the original promise's .catch() handlers are triggered\n\t\t\t\t\t\t// We do this by rejecting the race promise, which makes the original promise chain see the rejection\n\t\t\t\t\t\t// through the zone-wrapped .then()/.catch() handlers\n\t\t\t\t\t\trunningPromise = runningPromise.catch((error) => {\n\t\t\t\t\t\t\t// Propagate async errors to the effect's error handler\n\t\t\t\t\t\t\t// This ensures onEffectThrow handlers are triggered for async errors\n\t\t\t\t\t\t\tif (error !== cancelError) {\n\t\t\t\t\t\t\t\tthrower(error)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// If thrower didn't throw (handled), we absorb the error.\n\t\t\t\t\t\t\t// If thrower threw (unhandled), it propagates as a new unhandled rejection, which is correct.\n\t\t\t\t\t\t})\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Synchronous result - treat as cleanup function\n\t\t\t\t\t\treactionCleanup = result as undefined | EffectCloser\n\t\t\t\t\t}\n\t\t\t\t} catch (error) {\n\t\t\t\t\tdebugHooks.decorateError(error, runEffect)\n\t\t\t\t\t// catcher:self`\n\t\t\t\t\terrorToThrow = error\n\t\t\t\t}\n\n\t\t\t\t// Create cleanup function for next run\n\t\t\t\tnode.cleanup = (reason?: CleanupReason) => {\n\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\tabort()\n\t\t\t\t\tcleanupReaction(reason)\n\t\t\t\t\tdelete node.catchers\n\t\t\t\t\t// Remove this effect from all reactive objects it's watching\n\t\t\t\t\tconst effectObjects = effectToReactiveObjects.get(runEffect)\n\t\t\t\t\tif (effectObjects) {\n\t\t\t\t\t\tfor (const reactiveObj of effectObjects) {\n\t\t\t\t\t\t\tconst objectWatchers = watchers.get(reactiveObj)\n\t\t\t\t\t\t\tif (objectWatchers) {\n\t\t\t\t\t\t\t\tfor (const [prop, deps] of objectWatchers.entries()) {\n\t\t\t\t\t\t\t\t\tdeps.delete(runEffect)\n\t\t\t\t\t\t\t\t\tif (deps.size === 0) objectWatchers.delete(prop)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (objectWatchers.size === 0) watchers.delete(reactiveObj)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\teffectToReactiveObjects.delete(runEffect)\n\t\t\t\t\t}\n\t\t\t\t\t// Invoke all child stops (recursive via subEffectCleanup calling its own mainCleanup)\n\t\t\t\t\tconst children = node.children\n\t\t\t\t\tif (children) {\n\t\t\t\t\t\tconst childReason: CleanupReason = reason\n\t\t\t\t\t\t\t? reason.type === 'lineage'\n\t\t\t\t\t\t\t\t? reason\n\t\t\t\t\t\t\t\t: { type: 'lineage', parent: reason }\n\t\t\t\t\t\t\t: { type: 'stopped' }\n\t\t\t\t\t\tfor (const childCleanup of children) childCleanup(childReason)\n\t\t\t\t\t\tdelete node.children\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (errorToThrow) thrower(errorToThrow)\n\t\t\t}\n\n\t\t\t// Initialize metadata node\n\t\t\tconst node = getEffectNode(runEffect)\n\n\t\t\tif (debugHooks.isDevtoolsEnabled()) {\n\t\t\t\tconst stack = debugHooks.captureStack() // Robustly skips internal mutts frames\n\t\t\t\tif (Array.isArray(stack) && stack.length > 0) {\n\t\t\t\t\tnode.creationStack = stack\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst tracked = effectHistory.present.with(runEffect, () =>\n\t\t\t\tnamed(effectMarker.leave, effectAggregator.zoned)\n\t\t\t)\n\t\t\tconst ascended = named(effectMarker.leave, effectHistory.zoned)\n\t\t\tconst parent = effectHistory.present.active\n\t\t\t// Set parent relationship in node\n\t\t\tnode.parent = parent\n\n\t\t\t// let thrower: CatchFunction | undefined // Moved inside runEffect\n\t\t\tlet effectStopped = false\n\t\t\tlet abortController: AbortController | undefined\n\n\t\t\tconst access: EffectAccess = {\n\t\t\t\ttracked,\n\t\t\t\tascend: named(effectMarker.leave, (fn) =>\n\t\t\t\t\tascended(named(effectMarker.enter, () => fn.call(null)))\n\t\t\t\t),\n\t\t\t\t//named(effectMarker.enter, (fn) => ascended(fn)),\n\t\t\t\treaction: false,\n\t\t\t\tget signal() {\n\t\t\t\t\tif (!abortController) {\n\t\t\t\t\t\tabortController = new AbortController()\n\t\t\t\t\t}\n\t\t\t\t\treturn abortController.signal\n\t\t\t\t},\n\t\t\t}\n\t\t\tlet runningPromise: Promise<any> | null = null\n\t\t\tlet cancelPrevious: (() => void) | null = null\n\t\t\tif (effectOptions?.dependencyHook) node.dependencyHook = effectOptions.dependencyHook\n\t\t\t// Mark the runEffect callback with the original function as its root\n\t\t\tmarkWithRoot(runEffect, fn)\n\n\t\t\t// Register strict mode if enabled\n\t\t\tif (effectOptions?.opaque) {\n\t\t\t\tnode.isOpaque = true\n\t\t\t}\n\n\t\t\tif (debugHooks.isDevtoolsEnabled()) {\n\t\t\t\tdebugHooks.registerEffect(runEffect)\n\t\t\t}\n\n\t\t\t// Store parent relationship for hierarchy traversal - ALREADY DONE ABOVE via getEffectNode\n\n\t\t\tconst abort = () => {\n\t\t\t\tif (abortController) {\n\t\t\t\t\tabortController.abort(\n\t\t\t\t\t\tnew ReactiveError('[reactive] Effect aborted due to dependency change or stop')\n\t\t\t\t\t)\n\t\t\t\t\tabortController = undefined\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbatch(runEffect, 'immediate')\n\t\t\t// Only ROOT effects are registered for GC cleanup and zone tracking\n\t\t\tconst isRootEffect = !parent\n\n\t\t\tconst stopEffect = (reason?: CleanupReason): void => {\n\t\t\t\tif (effectStopped) return\n\t\t\t\teffectStopped = true\n\t\t\t\tnode.stopped = true\n\t\t\t\t// Cancel any running async work\n\t\t\t\tabort()\n\t\t\t\tif (cancelPrevious) {\n\t\t\t\t\tcancelPrevious()\n\t\t\t\t\tcancelPrevious = null\n\t\t\t\t\trunningPromise = null\n\t\t\t\t}\n\t\t\t\ttry {\n\t\t\t\t\tnode.cleanup?.(reason || { type: 'stopped' })\n\t\t\t\t} catch (error) {\n\t\t\t\t\t// Cleanup errors should basically be ignored or at least not stop the world\n\t\t\t\t\t// If we want to report them, we could use options.warn or similar\n\t\t\t\t\toptions.warn('Error during effect cleanup', error)\n\t\t\t\t}\n\t\t\t\t// Clean up dependency graph edges\n\t\t\t\tcleanupEffectFromGraph(runEffect)\n\t\t\t\tfr.unregister(stopEffect)\n\t\t\t}\n\t\t\tif (isRootEffect) {\n\t\t\t\tconst callIfCollected = (reason) => stopEffect(reason)\n\t\t\t\tfr.register(\n\t\t\t\t\tcallIfCollected,\n\t\t\t\t\t() => {\n\t\t\t\t\t\tstopEffect({ type: 'gc' })\n\t\t\t\t\t\toptionCall('garbageCollected', fn)\n\t\t\t\t\t},\n\t\t\t\t\tstopEffect\n\t\t\t\t)\n\t\t\t\treturn callIfCollected\n\t\t\t}\n\t\t\t// Register this effect to be stopped when the parent effect is cleaned up\n\t\t\tif (parent) {\n\t\t\t\tconst parentNode = getEffectNode(parent)\n\t\t\t\tif (!parentNode.children) {\n\t\t\t\t\tparentNode.children = new Set()\n\t\t\t\t}\n\t\t\t\tconst children = parentNode.children\n\n\t\t\t\tconst subEffectCleanup = (reason) => {\n\t\t\t\t\tchildren.delete(subEffectCleanup)\n\t\t\t\t\t// Execute this child effect cleanup (which triggers its own mainCleanup)\n\t\t\t\t\tstopEffect(reason)\n\t\t\t\t}\n\t\t\t\tchildren.add(subEffectCleanup)\n\t\t\t\treturn subEffectCleanup\n\t\t\t}\n\t\t\t// Should not be reachable given isRootEffect check, but for type safety\n\t\t\treturn (reason) => stopEffect(reason)\n\t\t},\n\t\t{\n\t\t\tget opaque() {\n\t\t\t\treturn flavorOptions(this, { opaque: true }, { name: 'opaque' })\n\t\t\t},\n\t\t\tnamed(name: string) {\n\t\t\t\treturn flavorOptions(this, { name }, { name: 'named' })\n\t\t\t},\n\t\t}\n\t)\n) as Effect\n\n/**\n * Executes a function without tracking dependencies but maintains parent cleanup relationship\n * Effects created inside will still be cleaned up when the parent effect is destroyed\n * @param fn - The function to execute\n */\nexport function untracked<T>(fn: () => T): T {\n\treturn effectHistory.present.root(fn)\n}\n\n/**\n * Executes a function from a virgin/root context - no parent effect, no tracking\n * Creates completely independent effects that won't be cleaned up by any parent\n * @param fn - The function to execute\n */\nexport function root<T>(fn: () => T): T {\n\treturn effectHistory.root(fn)\n}\n\n/**\n * Creates a bidirectional binding between a reactive value and a non-reactive external value\n * Prevents infinite loops by automatically suppressing circular notifications\n *\n * @param received - Function called when the reactive value changes (external setter)\n * @param get - Getter for the reactive value OR an object with `{ get, set }` properties\n * @param set - Setter for the reactive value (required if `get` is a function)\n * @returns A function to manually provide updates from the external side\n *\n * @example\n * ```typescript\n * const model = reactive({ value: '' })\n * const input = { value: '' }\n *\n * // Bidirectional binding\n * const provide = biDi(\n *   (v) => input.value = v,  // external setter\n *   () => model.value,        // reactive getter\n *   (v) => model.value = v    // reactive setter\n * )\n *\n * // External notification (e.g., from input event)\n * provide('new value')  // Updates model.value, doesn't trigger circular loop\n * ```\n *\n * @example Using object syntax\n * ```typescript\n * const provide = biDi(\n *   (v) => setHTMLValue(v),\n *   { get: () => reactiveObj.value, set: (v) => reactiveObj.value = v }\n * )\n * ```\n */\nexport function biDi<T>(\n\treceived: (value: T) => void,\n\tvalue: { get: () => T; set: (value: T) => void }\n): (value: T) => void\nexport function biDi<T>(\n\treceived: (value: T) => void,\n\tget: () => T,\n\tset: (value: T) => void\n): (value: T) => void\nexport function biDi<T>(\n\treceived: (value: T) => void,\n\tget: (() => T) | { get: () => T; set: (value: T) => void },\n\tset?: (value: T) => void\n): (value: T) => void {\n\tif (typeof get !== 'function') {\n\t\tset = get.set\n\t\tget = get.get\n\t}\n\tlet programmaticallySetValue: any = Symbol()\n\teffect.named('biDi')(\n\t\tmarkWithRoot(() => {\n\t\t\tconst newValue = get()\n\t\t\tconst pValue = programmaticallySetValue\n\t\t\tprogrammaticallySetValue = Symbol()\n\t\t\tif (unwrap(newValue) !== pValue) received(newValue)\n\t\t}, received)\n\t)\n\treturn set\n\t\t? atomic((value: T) => {\n\t\t\t\tprogrammaticallySetValue = unwrap(value)\n\t\t\t\tset(value)\n\t\t\t})\n\t\t: () => {}\n}\n","import { debugHooks } from './debug-hooks'\nimport { batch } from './effects'\nimport { getEffectNode } from './registry'\nimport { getDependencyStack } from './tracking'\nimport { allProps, type EffectTrigger, type Evolution, options } from './types'\n\n// Track which objects contain which other objects (back-references)\nexport const objectParents = new WeakMap<object, Set<{ parent: object; prop: PropertyKey }>>()\n\n// Track which objects have deep watchers\nexport const objectsWithDeepWatchers = new WeakSet<object>()\nlet deepWatcherCount = 0\nexport function registerDeepWatcher() {\n\tdeepWatcherCount++\n}\n\n// Track deep watchers per object\nexport const deepWatchers = new WeakMap<object, Set<EffectTrigger>>()\n\n// Track which effects are doing deep watching\nexport const effectToDeepWatchedObjects = new WeakMap<EffectTrigger, Set<object>>()\n\n/**\n * Add a back-reference from child to parent\n */\nexport function addBackReference(child: object, parent: object, prop: any) {\n\tlet parents = objectParents.get(child)\n\tif (!parents) {\n\t\tparents = new Set()\n\t\tobjectParents.set(child, parents)\n\t}\n\tparents.add({ parent, prop })\n}\n\n/**\n * Remove a back-reference from child to parent\n */\nexport function removeBackReference(child: object, parent: object, prop: any) {\n\tconst parents = objectParents.get(child)\n\tif (parents) {\n\t\tfor (const entry of parents) {\n\t\t\tif (entry.parent === parent && entry.prop === prop) {\n\t\t\t\tparents.delete(entry)\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif (parents.size === 0) {\n\t\t\tobjectParents.delete(child)\n\t\t}\n\t}\n}\n\n/**\n * Check if an object needs back-references (has deep watchers or parents with deep watchers)\n */\nexport function needsBackReferences(obj: object): boolean {\n\t// Fast path: if no deep watchers exist anywhere, skip entirely\n\tif (!deepWatcherCount) return false // fast path: no deep watchers anywhere\n\t// Check if object itself has deep watchers\n\tif (objectsWithDeepWatchers.has(obj)) return true\n\t// Slow path: check if any parent has deep watchers (recursive)\n\treturn hasParentWithDeepWatchers(obj)\n}\n\n/**\n * Bubble up changes through the back-reference chain\n */\nexport function bubbleUpChange(changedObject: object, evolution: Evolution) {\n\tconst parents = objectParents.get(changedObject)\n\tif (!parents) return\n\n\tfor (const { parent } of parents) {\n\t\t// Trigger deep watchers on parent\n\t\tconst parentDeepWatchers = deepWatchers.get(parent)\n\t\tif (parentDeepWatchers) {\n\t\t\tif (options.introspection?.gatherReasons) {\n\t\t\t\tconst gatherReasons = options.introspection.gatherReasons\n\t\t\t\tconst lineageConfig = gatherReasons.lineages\n\n\t\t\t\tlet touchLineage: unknown | undefined\n\t\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t\t}\n\n\t\t\t\tfor (const watcher of parentDeepWatchers) {\n\t\t\t\t\tconst dependencyStack =\n\t\t\t\t\t\tlineageConfig === 'dependency' || lineageConfig === 'both'\n\t\t\t\t\t\t\t? getDependencyStack(watcher, parent, allProps)\n\t\t\t\t\t\t\t: undefined\n\n\t\t\t\t\tconst node = getEffectNode(watcher)\n\t\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\t\tobj: parent,\n\t\t\t\t\t\tevolution,\n\t\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const watcher of parentDeepWatchers) batch(watcher)\n\t\t}\n\n\t\t// Continue bubbling up\n\t\tbubbleUpChange(parent, evolution)\n\t}\n}\n\nfunction hasParentWithDeepWatchers(obj: object): boolean {\n\tconst parents = objectParents.get(obj)\n\tif (!parents) return false\n\n\tfor (const { parent } of parents) {\n\t\tif (objectsWithDeepWatchers.has(parent)) return true\n\t\tif (hasParentWithDeepWatchers(parent)) return true\n\t}\n\treturn false\n}\n","import { debugHooks } from './debug-hooks'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { getActiveEffect, isRunning } from './effect-context'\nimport { batch, hasBatched, recordActivation } from './effects'\nimport { getEffectNode, watchers } from './registry'\nimport { getDependencyStack } from './tracking'\nimport {\n\tallProps,\n\ttype EffectTrigger,\n\ttype Evolution,\n\tkeysOf,\n\toptionCall,\n\toptions,\n\ttype State,\n\tunwrap,\n} from './types'\n\nconst states = new WeakMap<object, State>()\n\nexport function addState(obj: any, evolution: Evolution) {\n\tobj = unwrap(obj)\n\tconst next = {}\n\tconst state = getState(obj)\n\tif (state) Object.assign(state, { evolution, next })\n\tstates.set(obj, next)\n}\n\n/**\n * Gets the current state of a reactive object for evolution tracking\n * @param obj - The reactive object\n * @returns The current state object\n */\nexport function getState(obj: any) {\n\tobj = unwrap(obj)\n\tlet state = states.get(obj)\n\tif (!state) {\n\t\tstate = {}\n\t\tstates.set(obj, state)\n\t}\n\treturn state\n}\n\nexport function collectEffects(\n\tobj: any,\n\tevolution: Evolution,\n\teffects: Map<EffectTrigger, unknown>,\n\tobjectWatchers: Map<any, Set<EffectTrigger>>,\n\t...keyChains: Iterable<any>[]\n) {\n\tconst sourceEffect = getActiveEffect()\n\tfor (const keys of keyChains)\n\t\tfor (const key of keys) {\n\t\t\tconst deps = objectWatchers.get(key)\n\t\t\tif (deps) {\n\t\t\t\t// Make sure `some.prop++` does not keep a dependency to `some.props`\n\t\t\t\tdeps.delete(sourceEffect)\n\t\t\t\tfor (const effect of deps) {\n\t\t\t\t\tconst runningChain = isRunning(effect)\n\t\t\t\t\tif (runningChain) {\n\t\t\t\t\t\toptionCall('skipRunningEffect', effect)\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif (!effects.has(effect)) {\n\t\t\t\t\t\teffects.set(effect, getDependencyStack(effect, obj, key))\n\t\t\t\t\t\tif (!hasBatched(effect)) recordActivation(effect, obj, evolution, key)\n\t\t\t\t\t}\n\t\t\t\t\tdebugHooks.recordTriggerLink(sourceEffect, effect, obj, key, evolution)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n}\n\n/**\n * Triggers effects for a single property change\n * @param obj - The object that changed\n * @param evolution - The type of change\n * @param prop - The property that changed\n */\nexport function touched1(obj: any, evolution: Evolution, prop: any) {\n\ttouched(obj, evolution, [prop])\n}\n\n/**\n * Triggers effects for property changes\n * @param obj - The object that changed\n * @param evolution - The type of change\n * @param props - The properties that changed\n */\nexport function touched(obj: any, evolution: Evolution, props?: Iterable<any>) {\n\tobj = unwrap(obj)\n\taddState(obj, evolution)\n\tconst objectWatchers = watchers.get(obj)\n\tif (objectWatchers) {\n\t\t// Note: we have to collect effects to remove duplicates in the specific case when no batch is running\n\t\tconst effects = new Map<EffectTrigger, unknown>()\n\t\tconst structural = !['set', 'invalidate'].includes(evolution.type)\n\t\tconst broad = structural ? [allProps, keysOf] : [allProps]\n\t\tif (props) collectEffects(obj, evolution, effects, objectWatchers, broad, props)\n\t\telse collectEffects(obj, evolution, effects, objectWatchers, objectWatchers.keys())\n\t\tconst triggers = Array.from(effects.keys())\n\t\toptionCall('touched', obj, evolution, props as any[] | undefined, triggers)\n\t\t// Store pending triggers for CleanupReason before batching\n\t\tif (options.introspection?.gatherReasons) {\n\t\t\tconst gatherReasons = options.introspection.gatherReasons\n\t\t\tconst lineageConfig = gatherReasons.lineages\n\n\t\t\tlet touchLineage: unknown | undefined\n\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t}\n\n\t\t\tfor (const [effect, dependencyStack] of effects) {\n\t\t\t\tconst node = getEffectNode(effect)\n\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\tobj,\n\t\t\t\t\tevolution,\n\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t})\n\t\t\t}\n\t\t}\n\t\tbatch(triggers)\n\t}\n\n\t// Bubble up changes if this object has deep watchers\n\tif (objectsWithDeepWatchers.has(obj)) {\n\t\tbubbleUpChange(obj, evolution)\n\t}\n}\n\n/**\n * Triggers only opaque effects for property changes\n * Used by deep-touch to ensure opaque listeners are notified even when deep optimization is active\n */\nexport function touchedOpaque(obj: any, evolution: Evolution, prop: any) {\n\tobj = unwrap(obj)\n\tconst objectWatchers = watchers.get(obj)\n\tif (!objectWatchers) return\n\n\tconst deps = objectWatchers.get(prop)\n\tif (!deps) return\n\n\tconst effects = new Set<EffectTrigger>()\n\tconst sourceEffect = getActiveEffect()\n\n\tconst gather = options.introspection?.gatherReasons\n\n\tif (gather) {\n\t\tconst lineageConfig = gather.lineages\n\n\t\tfor (const effect of deps) {\n\t\t\tconst node = getEffectNode(effect)\n\t\t\tif (!node.isOpaque) continue\n\n\t\t\tconst runningChain = isRunning(effect)\n\t\t\tif (runningChain) {\n\t\t\t\toptionCall('skipRunningEffect', effect)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\teffects.add(effect)\n\t\t\tif (gather) {\n\t\t\t\tlet touchLineage: unknown | undefined\n\t\t\t\tlet dependencyStack: unknown | undefined\n\n\t\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t\t}\n\t\t\t\tif (lineageConfig === 'dependency' || lineageConfig === 'both') {\n\t\t\t\t\tdependencyStack = getDependencyStack(effect, obj, prop)\n\t\t\t\t}\n\n\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\tobj,\n\t\t\t\t\tevolution,\n\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t})\n\t\t\t}\n\t\t\trecordActivation(effect, obj, evolution, prop)\n\t\t\tdebugHooks.recordTriggerLink(sourceEffect, effect, obj, prop, evolution)\n\t\t}\n\t} else {\n\t\t// When not gathering reasons, process effects normally\n\t\tfor (const effect of deps) {\n\t\t\tconst node = getEffectNode(effect)\n\t\t\tif (!node.isOpaque) continue\n\n\t\t\tconst runningChain = isRunning(effect)\n\t\t\tif (runningChain) {\n\t\t\t\toptionCall('skipRunningEffect', effect)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\teffects.add(effect)\n\t\t\trecordActivation(effect, obj, evolution, prop)\n\t\t\tdebugHooks.recordTriggerLink(sourceEffect, effect, obj, prop, evolution)\n\t\t}\n\t}\n\n\tif (effects.size > 0) {\n\t\toptionCall('touched', obj, evolution, [prop], Array.from(effects))\n\t\tbatch(Array.from(effects))\n\t}\n}\n","import { unreactiveProperties } from './types'\nexport const absent = Symbol('absent')\n\n/**\n * Add unreactive properties to a prototype.\n * If no set is provided, marks the entire object/prototype as non-reactive (sets [unreactiveProperties] = true).\n * If a set is provided, merges with existing unreactive properties (never overrides true).\n */\nexport function addUnreactiveProps<T extends object>(proto: T, set?: Iterable<PropertyKey>): T {\n\tif (unreactiveProperties in proto) {\n\t\tconst existing = (proto as any)[unreactiveProperties]\n\t\t// If already fully unreactive, don't change\n\t\tif (existing === true) return proto\n\t\t// If no set provided, upgrade to fully unreactive\n\t\tif (!set) {\n\t\t\t;(proto as any)[unreactiveProperties] = true\n\t\t\treturn proto\n\t\t}\n\t\t// Merge sets\n\t\tset = (proto as any)[unreactiveProperties] = new Set<PropertyKey>(\n\t\t\t(proto as any)[unreactiveProperties]\n\t\t)\n\t\tfor (const p of set) existing.add(p)\n\t}\n\t// If no set, mark as fully unreactive, otherwise create set\n\telse proto[unreactiveProperties] = set ? new Set<PropertyKey>(set) : true\n\treturn proto\n}\n\n/** Check if a property is marked unreactive on obj or any of its prototypes (trap-free) */\nexport function isUnreactiveProp(obj: object, prop: PropertyKey): boolean {\n\tif (typeof prop === 'symbol' || prop === 'constructor') return true\n\tconst marker = obj[unreactiveProperties]\n\treturn (\n\t\tmarker === true || // Fully unreactive\n\t\tmarker?.has?.(prop) || // Property is unreactive\n\t\tfalse\n\t)\n}\n\nexport function nonReactive<T extends object[]>(...obj: T): T[0] {\n\tfor (const o of obj) {\n\t\t;(o as any)[unreactiveProperties] = true\n\t}\n\treturn obj[0]\n}\n\nexport function nonReactiveClass<T extends (new (...args: any[]) => any)[]>(...cls: T): T[0] {\n\tfor (const c of cls) if (c) (c.prototype as any)[unreactiveProperties] = true\n\treturn cls[0]\n}\n\nexport function isNonReactive(obj: any): boolean {\n\treturn !obj || obj[unreactiveProperties] === true\n}\n\nnonReactiveClass(Date, RegExp, Error, Promise, Function)\nif (typeof window !== 'undefined') {\n\tnonReactive(window, document)\n\tnonReactiveClass(Node, Element, HTMLElement, EventTarget, HTMLCollection, NodeList)\n}\n","import { addState, collectEffects, touched1, touchedOpaque } from './change'\nimport { debugHooks } from './debug-hooks'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { batch, untracked } from './effects'\nimport { isNonReactive } from './non-reactive'\nimport { effectToReactiveObjects, getEffectNode, watchers } from './registry'\nimport { getDependencyStack } from './tracking'\nimport {\n\tallProps,\n\ttype EffectCleanup,\n\ttype EffectTrigger,\n\ttype Evolution,\n\tkeysOf,\n\toptionCall,\n\toptions,\n\tunwrap,\n} from './types'\n\nfunction getPrototypeToken(value: any): object | null | undefined {\n\tif (Array.isArray(value)) return Array.prototype\n\tif (typeof value !== 'object') return undefined\n\ttry {\n\t\treturn value.constructor\n\t} catch {\n\t\treturn undefined\n\t}\n}\n\nexport function shouldRecurseTouch(oldValue: any, newValue: any): boolean {\n\tif (oldValue === newValue) return false\n\tif (\n\t\t(typeof oldValue !== 'object' && !Array.isArray(oldValue)) ||\n\t\t(typeof newValue !== 'object' && !Array.isArray(newValue))\n\t)\n\t\treturn false\n\tif (isNonReactive(oldValue) /*|| isNonReactive(newValue)*/) return false\n\treturn getPrototypeToken(oldValue) === getPrototypeToken(newValue)\n}\n\n/**\n * Migrate all watcher registrations from oldRef to newRef.\n * Called when deep touch replaces an object identity without any child value differences,\n * to prevent watcher orphaning (effects still pointing at the discarded old object).\n */\nfunction migrateWatchers(oldRef: object, newRef: object) {\n\tconst oldMap = watchers.get(oldRef)\n\tif (!oldMap) return\n\t// Move the entire watcher map\n\twatchers.set(newRef, oldMap)\n\twatchers.delete(oldRef)\n\t// Update the reverse map (effect → objects it watches)\n\tfor (const deps of oldMap.values()) {\n\t\tfor (const effect of deps) {\n\t\t\tconst objects = effectToReactiveObjects.get(effect)\n\t\t\tif (objects) {\n\t\t\t\tobjects.delete(oldRef)\n\t\t\t\tobjects.add(newRef)\n\t\t\t}\n\t\t}\n\t}\n}\n\n/**\n * Centralized function to handle property change notifications with optional recursive touch\n * @param targetObj - The object whose property changed\n * @param prop - The property that changed\n * @param oldValue - The old value (before change)\n * @param newValue - The new value (after change)\n * @param hadProperty - Whether the property existed before (for add vs set)\n */\nexport function notifyPropertyChange(\n\ttargetObj: any,\n\tprop: any,\n\toldValue: any,\n\tnewValue: any,\n\thadProperty: boolean\n) {\n\tconst evolution: Evolution = { type: hadProperty ? 'set' : 'add', prop }\n\n\tif (\n\t\toptions.recursiveTouching &&\n\t\toldValue !== undefined &&\n\t\tshouldRecurseTouch(oldValue, newValue)\n\t) {\n\t\tconst unwrappedObj = unwrap(targetObj)\n\t\tconst origin = { obj: unwrappedObj, prop }\n\t\t// Deep touch: only notify nested property changes with origin filtering\n\t\t// Don't notify direct property change - the whole point is to avoid parent effects re-running\n\n\t\tconst changes = untracked(() => recursiveTouch(oldValue, newValue, new WeakMap(), [], origin))\n\n\t\t// When deep touch found no child differences, the object identity still changed.\n\t\t// Migrate watchers from old → new so the dependency chain is preserved.\n\t\tif (changes.length === 0) {\n\t\t\tmigrateWatchers(unwrap(oldValue), unwrap(newValue))\n\t\t} else {\n\t\t\tdispatchNotifications(changes)\n\t\t}\n\n\t\t// Notify opaque listeners (like memoize) that always want to know about identity changes\n\t\ttouchedOpaque(targetObj, evolution, prop)\n\t} else {\n\t\ttouched1(targetObj, evolution, prop)\n\t}\n}\n\ntype VisitedPairs = WeakMap<object, WeakSet<object>>\ntype PendingNotification = {\n\ttarget: any\n\tevolution: Evolution\n\tprop: any\n\torigin?: { obj: object; prop: PropertyKey } // The property access that triggered this deep touch\n}\n\nfunction hasVisitedPair(visited: VisitedPairs, oldObj: object, newObj: object): boolean {\n\tlet mapped = visited.get(oldObj)\n\tif (!mapped) {\n\t\tmapped = new WeakSet<object>()\n\t\tvisited.set(oldObj, mapped)\n\t}\n\tif (mapped.has(newObj)) return true\n\tmapped.add(newObj)\n\treturn false\n}\n\nfunction collectObjectKeys(obj: any): Set<PropertyKey> {\n\tconst keys = new Set<PropertyKey>(Reflect.ownKeys(obj))\n\tlet proto = Object.getPrototypeOf(obj)\n\t// Continue walking while prototype exists and doesn't have its own constructor\n\t// This stops at Object.prototype (has own constructor) and class prototypes (have own constructor)\n\t// but continues for data prototypes (Object.create({}), Object.create(instance), etc.)\n\twhile (proto && !Object.hasOwn(proto, 'constructor')) {\n\t\tfor (const key of Reflect.ownKeys(proto)) keys.add(key)\n\t\tproto = Object.getPrototypeOf(proto)\n\t}\n\treturn keys\n}\n\nexport function recursiveTouch(\n\toldValue: any,\n\tnewValue: any,\n\tvisited: VisitedPairs = new WeakMap(),\n\tnotifications: PendingNotification[] = [],\n\torigin?: { obj: object; prop: PropertyKey }\n): PendingNotification[] {\n\tif (!shouldRecurseTouch(oldValue, newValue)) return notifications\n\tif (\n\t\t(typeof oldValue !== 'object' && !Array.isArray(oldValue)) ||\n\t\t(typeof newValue !== 'object' && !Array.isArray(newValue))\n\t)\n\t\treturn notifications\n\tif (hasVisitedPair(visited, oldValue, newValue)) return notifications\n\n\tif (Array.isArray(oldValue) && Array.isArray(newValue)) {\n\t\tdiffArrayElements(oldValue, newValue, visited, notifications, origin)\n\t\treturn notifications\n\t}\n\n\tdiffObjectProperties(oldValue, newValue, visited, notifications, origin)\n\treturn notifications\n}\n\nfunction diffArrayElements(\n\toldArray: any[] | readonly any[],\n\tnewArray: any[] | readonly any[],\n\t_visited: VisitedPairs,\n\tnotifications: PendingNotification[],\n\torigin?: { obj: object; prop: PropertyKey }\n) {\n\tconst local: PendingNotification[] = []\n\tconst oldLength = oldArray.length\n\tconst newLength = newArray.length\n\tconst max = Math.max(oldLength, newLength)\n\n\tfor (let index = 0; index < max; index++) {\n\t\tconst hasOld = index < oldLength\n\t\tconst hasNew = index < newLength\n\t\tif (hasOld && !hasNew) {\n\t\t\tlocal.push({ target: oldArray, evolution: { type: 'del', prop: index }, prop: index, origin })\n\t\t\tcontinue\n\t\t}\n\t\tif (!hasOld && hasNew) {\n\t\t\tlocal.push({ target: oldArray, evolution: { type: 'add', prop: index }, prop: index, origin })\n\t\t\tcontinue\n\t\t}\n\t\tif (!hasOld || !hasNew) continue\n\t\tconst oldEntry = unwrap(oldArray[index])\n\t\tconst newEntry = unwrap(newArray[index])\n\t\tif (!Object.is(oldEntry, newEntry)) {\n\t\t\tlocal.push({ target: oldArray, evolution: { type: 'set', prop: index }, prop: index, origin })\n\t\t}\n\t}\n\n\tif (oldLength !== newLength)\n\t\tlocal.push({\n\t\t\ttarget: oldArray,\n\t\t\tevolution: { type: 'set', prop: 'length' },\n\t\t\tprop: 'length',\n\t\t\torigin,\n\t\t})\n\n\tnotifications.push(...local)\n}\n\nfunction diffObjectProperties(\n\toldObj: any,\n\tnewObj: any,\n\tvisited: VisitedPairs,\n\tnotifications: PendingNotification[],\n\torigin?: { obj: object; prop: PropertyKey }\n) {\n\tconst oldKeys = collectObjectKeys(oldObj)\n\tconst newKeys = collectObjectKeys(newObj)\n\tconst local: PendingNotification[] = []\n\n\tfor (const key of oldKeys)\n\t\tif (!newKeys.has(key))\n\t\t\tlocal.push({ target: oldObj, evolution: { type: 'del', prop: key }, prop: key, origin })\n\n\tfor (const key of newKeys) {\n\t\tif (!oldKeys.has(key)) {\n\t\t\tlocal.push({ target: oldObj, evolution: { type: 'add', prop: key }, prop: key, origin })\n\t\t\tcontinue\n\t\t}\n\t\tconst oldEntry = unwrap((oldObj as any)[key])\n\t\tconst newEntry = unwrap((newObj as any)[key])\n\t\tif (shouldRecurseTouch(oldEntry, newEntry)) {\n\t\t\trecursiveTouch(oldEntry, newEntry, visited, notifications, origin)\n\t\t} else if (!Object.is(oldEntry, newEntry)) {\n\t\t\tlocal.push({ target: oldObj, evolution: { type: 'set', prop: key }, prop: key, origin })\n\t\t}\n\t}\n\n\tnotifications.push(...local)\n}\n\n/**\n * Checks if an effect or any of its ancestors is in the allowed set\n */\nfunction hasAncestorInSet(\n\teffect: EffectTrigger | EffectCleanup,\n\tallowedSet: Set<EffectTrigger | EffectCleanup>\n): boolean {\n\tlet current: EffectTrigger | EffectCleanup | undefined = effect\n\tconst visited = new WeakSet<EffectTrigger | EffectCleanup>()\n\twhile (current && !visited.has(current)) {\n\t\tvisited.add(current)\n\t\tif (allowedSet.has(current)) return true\n\t\tconst node = getEffectNode(current as EffectTrigger)\n\t\tcurrent = node.parent\n\t}\n\treturn false\n}\n\nexport function dispatchNotifications(notifications: PendingNotification[]) {\n\tif (!notifications.length) return\n\tconst combinedEffects = new Set<EffectTrigger>()\n\tconst effectCauses = new Map<EffectTrigger, PendingNotification[]>()\n\n\t// Extract origin from first notification (all should have the same origin from a single deep touch)\n\tconst origin = notifications[0]?.origin\n\tlet allowedEffects: Set<EffectTrigger> | undefined\n\n\t// If origin exists, compute allowed effects (those that depend on origin.obj[origin.prop])\n\tif (origin) {\n\t\tallowedEffects = new Set<EffectTrigger>()\n\t\tconst originWatchers = watchers.get(origin.obj)\n\t\tif (originWatchers) {\n\t\t\tconst originEffects = new Map<EffectTrigger, unknown>()\n\t\t\tcollectEffects(\n\t\t\t\torigin.obj,\n\t\t\t\t{ type: 'set', prop: origin.prop },\n\t\t\t\toriginEffects,\n\t\t\t\toriginWatchers,\n\t\t\t\t[allProps],\n\t\t\t\t[origin.prop]\n\t\t\t)\n\t\t\tallowedEffects = new Set(originEffects.keys())\n\t\t}\n\t\t// If no allowed effects, skip all notifications (no one should be notified)\n\t\tif (!allowedEffects?.size) return\n\t}\n\n\tfor (const notification of notifications) {\n\t\tconst { target, evolution, prop } = notification\n\t\tif (typeof target !== 'object' && !Array.isArray(target)) continue\n\t\tconst obj = unwrap(target)\n\t\taddState(obj, evolution)\n\t\tconst objectWatchers = watchers.get(obj)\n\t\tlet currentEffects: Map<EffectTrigger, unknown> | undefined\n\t\tconst propsArray = [prop]\n\t\tif (objectWatchers) {\n\t\t\tcurrentEffects = new Map<EffectTrigger, unknown>()\n\t\t\tconst broad = evolution.type !== 'set' ? [allProps, keysOf] : [allProps]\n\t\t\tcollectEffects(obj, evolution, currentEffects, objectWatchers, broad, propsArray)\n\n\t\t\t// Filter effects by ancestor chain if origin exists\n\t\t\t// Include effects that either directly depend on origin or have an ancestor that does\n\t\t\tif (origin && allowedEffects) {\n\t\t\t\tconst filteredEffects = new Map<EffectTrigger, unknown>()\n\t\t\t\tfor (const [effect, associated] of currentEffects) {\n\t\t\t\t\t// Check if effect itself is allowed OR has an ancestor that is allowed\n\t\t\t\t\tif (allowedEffects.has(effect) || hasAncestorInSet(effect, allowedEffects)) {\n\t\t\t\t\t\tfilteredEffects.set(effect, associated)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcurrentEffects = filteredEffects\n\t\t\t}\n\n\t\t\tfor (const effect of currentEffects.keys()) {\n\t\t\t\tcombinedEffects.add(effect)\n\t\t\t\tlet causes = effectCauses.get(effect)\n\t\t\t\tif (!causes) {\n\t\t\t\t\tcauses = []\n\t\t\t\t\teffectCauses.set(effect, causes)\n\t\t\t\t}\n\t\t\t\tcauses.push(notification)\n\t\t\t}\n\t\t}\n\t\tif (currentEffects) {\n\t\t\toptionCall('touched', obj, evolution, propsArray, Array.from(currentEffects.keys()))\n\t\t}\n\t\tif (objectsWithDeepWatchers.has(obj)) bubbleUpChange(obj, evolution)\n\t}\n\tif (combinedEffects.size) {\n\t\tif (options.introspection?.gatherReasons) {\n\t\t\tconst gatherReasons = options.introspection.gatherReasons\n\t\t\tconst lineageConfig = gatherReasons.lineages\n\n\t\t\tlet touchLineage: unknown | undefined\n\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t}\n\n\t\t\tfor (const effect of combinedEffects) {\n\t\t\t\tconst node = getEffectNode(effect)\n\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\tfor (const { target, evolution, prop } of effectCauses.get(effect)!) {\n\t\t\t\t\tconst dependencyStack =\n\t\t\t\t\t\tlineageConfig === 'dependency' || lineageConfig === 'both'\n\t\t\t\t\t\t\t? getDependencyStack(effect, unwrap(target), prop ?? allProps)\n\t\t\t\t\t\t\t: undefined\n\t\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\t\tobj: unwrap(target),\n\t\t\t\t\t\tevolution,\n\t\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbatch([...combinedEffects])\n\t}\n}\n","import { decorator } from '../decorator'\nimport { mixin } from '../mixins'\nimport { FoolProof, isOwnAccessor } from '../utils'\nimport { touched1 } from './change'\nimport { notifyPropertyChange } from './deep-touch'\nimport {\n\taddBackReference,\n\tbubbleUpChange,\n\tneedsBackReferences,\n\tobjectsWithDeepWatchers,\n\tremoveBackReference,\n} from './deep-watch-state'\nimport { absent, isNonReactive, isUnreactiveProp } from './non-reactive'\nimport { dependant } from './tracking'\nimport {\n\tgetExistingProxy,\n\tisReactive,\n\tkeysOf,\n\toptions,\n\tproxyToObject,\n\tReactiveError,\n\tReactiveErrorCode,\n\tstoreProxyRelationship,\n\tunwrap,\n} from './types'\nexport const metaProtos = new WeakMap()\nexport const wrapProtos = new WeakMap()\nconst arrayLengths = new WeakMap<unknown[], number>()\nconst hasReentry = new Set<PropertyKey>()\nexport type SubProxy = {\n\tget?(obj: any, prop: PropertyKey, receiver: any): any\n\thas?(obj: any, prop: PropertyKey): boolean\n\townKeys?(obj: any): ArrayLike<string | symbol>\n\tgetOwnPropertyDescriptor?(obj: any, prop: PropertyKey): PropertyDescriptor | undefined\n}\n// Sub-proxy registration for custom reactive behaviors\nconst subsRegister = new WeakMap<any, SubProxy>()\n// Internal untracked flag for setter/getter operations - only used when testing oldValue while setting a value\n// TODO: `touched` trigger also compares to old value and should use the internalUntracked flag\nlet internalUntracked = false\n\nconst reactiveHandlers: ProxyHandler<any> & Record<symbol, unknown> = {\n\t[Symbol.toStringTag]: 'MutTs Reactive',\n\tget(obj, prop, receiver) {\n\t\tif (internalUntracked) return FoolProof.get(obj, prop, receiver)\n\t\tif (obj && typeof obj === 'object' && prop !== Symbol.toStringTag) {\n\t\t\tconst metaProto = metaProtos.get(obj.constructor)\n\t\t\tif (metaProto && Object.hasOwn(metaProto, prop)) {\n\t\t\t\tconst desc = Object.getOwnPropertyDescriptor(metaProto, prop)!\n\t\t\t\tif (desc.get) {\n\t\t\t\t\tif (!Object.hasOwn(obj, prop)) return desc.get.call(obj)\n\t\t\t\t\t// For own properties (e.g., array length): only override if writable/configurable\n\t\t\t\t\tconst ownDesc = Object.getOwnPropertyDescriptor(obj, prop)!\n\t\t\t\t\tif (ownDesc.configurable || ownDesc.writable || ownDesc.get) return desc.get.call(obj)\n\t\t\t\t} else if (!Object.hasOwn(obj, prop)) return (...args: any[]) => desc.value.apply(obj, args)\n\t\t\t}\n\t\t\tconst wrapProto = wrapProtos.get(obj.constructor)\n\t\t\tif (wrapProto && Object.hasOwn(wrapProto, prop)) return wrapProto[prop]\n\t\t}\n\t\t// Symbols: fast-path — no reactivity tracking\n\t\tif (typeof prop === 'symbol' || prop === 'constructor' || isUnreactiveProp(obj, prop))\n\t\t\treturn FoolProof.get(obj, prop, receiver)\n\n\t\t// Check if property exists using a trap-free walk to avoid triggering\n\t\t// the has-trap cascade on prototype chains of reactive proxies.\n\t\tconst isOwnProp = Object.hasOwn(obj, prop)\n\n\t\t// For accessor properties, check the unwrapped object to see if it's an accessor\n\t\t// This ensures ignoreAccessors works correctly even after operations like Object.setPrototypeOf\n\t\t// Skip for null-proto objects (pounce scopes) — they never have accessors\n\t\tconst shouldIgnoreAccessor =\n\t\t\toptions.ignoreAccessors &&\n\t\t\tisOwnProp &&\n\t\t\tObject.getPrototypeOf(obj) !== null &&\n\t\t\t(isOwnAccessor(receiver, prop) || isOwnAccessor(obj, prop))\n\n\t\t// Check if property exists using a trap-free walk to avoid triggering\n\t\t// the has-trap cascade on prototype chains of reactive proxies.\n\t\tlet hasProp = isOwnProp\n\t\tlet owner: any = isOwnProp ? obj : undefined\n\t\tif (!isOwnProp) {\n\t\t\tlet raw = Object.getPrototypeOf(obj)\n\t\t\twhile (raw && raw !== Object.prototype) {\n\t\t\t\tif (Object.hasOwn(raw, prop)) {\n\t\t\t\t\thasProp = true\n\t\t\t\t\towner = raw\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\traw = Object.getPrototypeOf(raw)\n\t\t\t}\n\t\t}\n\t\tconst isInheritedAccess = hasProp && !isOwnProp\n\n\t\t// Depend if...\n\t\tif (\n\t\t\t!hasProp ||\n\t\t\t(!(options.instanceMembers && isInheritedAccess && obj instanceof Object) &&\n\t\t\t\t!shouldIgnoreAccessor)\n\t\t)\n\t\t\tdependant(obj, prop)\n\n\t\t// Two-Point Tracking: for inherited access on null-proto chains, also track\n\t\t// the owning ancestor so that writing directly to it triggers dependent effects.\n\t\tif (isInheritedAccess && owner && (!options.instanceMembers || !(obj instanceof Object))) {\n\t\t\tdependant(owner, prop)\n\t\t}\n\t\t// For arrays, use FoolProof.get (Indexer path) for numeric index reactivity.\n\t\t// For all other objects, inline Reflect.get directly (skips 3 function calls).\n\t\tconst value = (subsRegister.get(obj)?.get || FoolProof.get)(obj, prop, receiver)\n\t\tif (!isReactive(value) && typeof value === 'object' && value !== null) {\n\t\t\tconst reactiveValue = reactiveObject(value)\n\n\t\t\t// Only create back-references if this object needs them\n\t\t\tif (needsBackReferences(obj)) {\n\t\t\t\taddBackReference(reactiveValue, obj, prop)\n\t\t\t}\n\n\t\t\treturn reactiveValue\n\t\t}\n\t\treturn value\n\t},\n\tset(obj, prop, value, receiver) {\n\t\tconst unwrapped = unwrap(receiver)\n\t\tif (obj !== unwrapped)\n\t\t\treturn Object.defineProperty(unwrapped, prop, {\n\t\t\t\tvalue,\n\t\t\t\tconfigurable: true,\n\t\t\t\twritable: true,\n\t\t\t\tenumerable: true,\n\t\t\t})\n\t\tif (internalUntracked)\n\t\t\tthrow new Error('Internal untracked: setting a value in an getter in a set operation')\n\t\t//return FoolProof.set(obj, prop, value, receiver)\n\n\t\t// Check if this property is marked as unreactive\n\t\tif (isUnreactiveProp(obj, prop)) return FoolProof.set(obj, prop, value, receiver)\n\t\tconst newValue = unwrap(value)\n\t\t// metaProto setter dispatch (e.g., reactive array length)\n\t\tif (obj && typeof obj === 'object' && prop !== Symbol.toStringTag) {\n\t\t\tconst metaProto = obj.constructor && metaProtos.get(obj.constructor)\n\t\t\tif (metaProto && Object.hasOwn(metaProto, prop)) {\n\t\t\t\tconst desc = Object.getOwnPropertyDescriptor(metaProto, prop)!\n\t\t\t\tif (desc.set) {\n\t\t\t\t\tdesc.set.call(obj, newValue)\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Read old value, using withEffect(undefined, ...) for getter-only accessors to avoid\n\t\t// breaking memoization dependency tracking during SET operations\n\t\tlet oldVal = absent\n\t\tconst isArrayLength = prop === 'length' && Array.isArray(obj)\n\t\tinternalUntracked = true\n\t\ttry {\n\t\t\tif (Reflect.has(obj, prop)) {\n\t\t\t\toldVal = isArrayLength\n\t\t\t\t\t? arrayLengths.get(obj) === newValue\n\t\t\t\t\t\t? newValue\n\t\t\t\t\t\t: absent\n\t\t\t\t\t: Reflect.get(obj, prop, receiver)\n\t\t\t}\n\t\t} finally {\n\t\t\tinternalUntracked = false\n\t\t}\n\t\tif (objectsWithDeepWatchers.has(obj)) {\n\t\t\tif (typeof oldVal === 'object' && oldVal !== null) {\n\t\t\t\tremoveBackReference(oldVal, obj, prop)\n\t\t\t}\n\t\t\tif (typeof newValue === 'object' && newValue !== null) {\n\t\t\t\tconst reactiveValue = reactiveObject(newValue)\n\t\t\t\taddBackReference(reactiveValue, obj, prop)\n\t\t\t}\n\t\t}\n\t\tif (oldVal !== newValue) {\n\t\t\t// For getter-only accessors, Reflect.set() may fail, but we still return true\n\t\t\t// to avoid throwing errors. Only proceed with change notifications if set succeeded.\n\t\t\tif (FoolProof.set(obj, prop, newValue, receiver)) {\n\t\t\t\tif (isArrayLength) arrayLengths.set(obj, newValue)\n\t\t\t\tnotifyPropertyChange(obj, prop, oldVal, newValue, oldVal !== absent)\n\t\t\t}\n\t\t}\n\t\treturn true\n\t},\n\thas(obj, prop) {\n\t\tif (hasReentry.has(obj))\n\t\t\tthrow new ReactiveError(\n\t\t\t\t`[reactive] Circular dependency detected in 'has' check for property '${String(prop)}'`,\n\t\t\t\t{\n\t\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\t\tcycle: [], // We don't have the full cycle here, but we know it involves obj\n\t\t\t\t}\n\t\t\t)\n\t\thasReentry.add(obj)\n\t\tif (!internalUntracked && !isUnreactiveProp(obj, prop)) dependant(obj, prop)\n\t\tconst rv = (subsRegister.get(obj)?.has || Reflect.has)(obj, prop)\n\t\thasReentry.delete(obj)\n\t\treturn rv\n\t},\n\tdeleteProperty(obj, prop) {\n\t\tif (!Object.hasOwn(obj, prop)) return false\n\n\t\tconst oldVal = (obj as any)[prop]\n\n\t\t// Remove back-references if this object has deep watchers\n\t\tif (objectsWithDeepWatchers.has(obj) && typeof oldVal === 'object' && oldVal !== null) {\n\t\t\tremoveBackReference(oldVal, obj, prop)\n\t\t}\n\n\t\tdelete (obj as any)[prop]\n\t\ttouched1(obj, { type: 'del', prop }, prop)\n\n\t\t// Bubble up changes if this object has deep watchers\n\t\tif (objectsWithDeepWatchers.has(obj)) {\n\t\t\tbubbleUpChange(obj, { type: 'del', prop })\n\t\t}\n\n\t\treturn true\n\t},\n\townKeys(obj) {\n\t\tdependant(obj, keysOf)\n\t\treturn subsRegister.get(obj)?.ownKeys?.(obj) || Reflect.ownKeys(obj)\n\t},\n\tgetOwnPropertyDescriptor(obj, prop) {\n\t\treturn (\n\t\t\tsubsRegister.get(obj)?.getOwnPropertyDescriptor?.(obj, prop) ||\n\t\t\tReflect.getOwnPropertyDescriptor(obj, prop)\n\t\t)\n\t},\n}\n\nconst reactiveClasses = new WeakSet<Function>()\n\n// Create the ReactiveBase mixin\n/**\n * Base mixin for reactive classes that provides proper constructor reactivity\n * Solves constructor reactivity issues in complex inheritance trees\n */\nexport const ReactiveBase = mixin((base) => {\n\tclass ReactiveMixin extends base {\n\t\tconstructor(...args: any[]) {\n\t\t\tsuper(...args)\n\t\t\t// Only apply reactive transformation if the class is marked with @reactive\n\t\t\t// This allows the mixin to work properly with method inheritance\n\t\t\t// biome-ignore lint/correctness/noConstructorReturn: This is the whole point here\n\t\t\treturn reactiveClasses.has(new.target) ? reactive(this) : this\n\t\t}\n\t}\n\treturn ReactiveMixin\n})\nfunction reactiveObject<T>(anyTarget: T, subProxy?: SubProxy): T {\n\tif (!anyTarget || typeof anyTarget !== 'object') return anyTarget\n\tconst target = anyTarget as any\n\t// If target is already a proxy, return it\n\tif (isNonReactive(target)) return target as T\n\tconst isProxy = proxyToObject.has(target)\n\tif (isProxy) return target as T\n\n\t// If we already have a proxy for this object, return it (optimized: get returns undefined if not found)\n\tconst existing = getExistingProxy(target)\n\tif (existing !== undefined) return existing as T\n\n\tif (subProxy) subsRegister.set(target, subProxy)\n\tconst proxy = new Proxy(target, reactiveHandlers)\n\tif (Array.isArray(target)) arrayLengths.set(target, target.length)\n\t// Store the relationships\n\tstoreProxyRelationship(target, proxy)\n\treturn proxy as T\n}\n\n/**\n * Main decorator for making classes reactive\n * Automatically makes class instances reactive when created\n */\nexport const reactive = decorator({\n\tclass(original) {\n\t\tif (original.prototype instanceof ReactiveBase) {\n\t\t\treactiveClasses.add(original)\n\t\t\treturn original\n\t\t}\n\n\t\tclass Reactive extends original {\n\t\t\tconstructor(...args: any[]) {\n\t\t\t\tsuper(...args)\n\t\t\t\tif (new.target !== Reactive && !reactiveClasses.has(new.target))\n\t\t\t\t\toptions.warn(\n\t\t\t\t\t\t`${(original as any).name} has been inherited by ${this.constructor.name} that is not reactive.\n@reactive decorator must be applied to the leaf class OR classes have to extend ReactiveBase.`\n\t\t\t\t\t)\n\t\t\t\t// biome-ignore lint/correctness/noConstructorReturn: This is the whole point here\n\t\t\t\treturn reactive(this)\n\t\t\t}\n\t\t}\n\t\tObject.defineProperty(Reactive, 'name', {\n\t\t\tvalue: `Reactive<${original.name}>`,\n\t\t})\n\t\treturn Reactive as any\n\t},\n\tget(original: any) {\n\t\treturn reactiveObject(original)\n\t},\n\tdefault: reactiveObject,\n})\n","import { arrayDiff } from '../diff'\nimport { flavored } from '../flavored'\nimport type { GetterWrapper } from '../zone'\nimport { getState, touched, touched1 } from './change'\nimport { link } from './effect-context'\nimport { effect } from './effects'\nimport { reactive } from './proxy'\nimport { markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport {\n\ttype CleanupReason,\n\ttype EffectAccess,\n\ttype EffectCloser,\n\tisReactive,\n\tkeysOf,\n\ttype ScopedCallback,\n\ttype State,\n} from './types'\n\n/**\n * Reactively attends to each entry of a collection or each key yielded by an\n * enumeration callback. For each key, an inner effect runs the callback. When a\n * key disappears, its inner effect is disposed. The callback may return a cleanup\n * (like a regular effect closer).\n *\n * Accepts arrays, records, Maps, Sets, or a raw `() => Iterable<Key>` callback.\n *\n * @example\n * ```typescript\n * // Record shorthand\n * attend(record, (key) => { console.log(key, record[key]) })\n *\n * // Array shorthand\n * attend(array, (index) => { console.log(index, array[index]) })\n *\n * // Raw enumeration callback\n * attend(() => Object.keys(record), (key) => { ... })\n * ```\n */\nexport function attend<T>(\n\tsource: readonly T[],\n\tcallback: (index: number, access: EffectAccess) => EffectCloser | void\n): ScopedCallback\nexport function attend<K, V>(\n\tsource: Map<K, V>,\n\tcallback: (key: K, access: EffectAccess) => EffectCloser | void\n): ScopedCallback\nexport function attend<T>(\n\tsource: Set<T>,\n\tcallback: (value: T, access: EffectAccess) => EffectCloser | void\n): ScopedCallback\nexport function attend<S extends object>(\n\tsource: S,\n\tcallback: (key: keyof S & string, access: EffectAccess) => EffectCloser | void\n): ScopedCallback\nexport function attend<Key>(\n\tenumerate: () => Iterable<Key>,\n\tcallback: (key: Key, access: EffectAccess) => EffectCloser | void\n): ScopedCallback\nexport function attend(\n\tsource: any,\n\tcallback: (key: any, access: EffectAccess) => EffectCloser | void\n): ScopedCallback {\n\tconst enumerate: () => Iterable<any> =\n\t\ttypeof source === 'function'\n\t\t\t? source\n\t\t\t: Array.isArray(source)\n\t\t\t\t? () => Array.from({ length: source.length }, (_, i) => i)\n\t\t\t\t: source instanceof Map\n\t\t\t\t\t? () => source.keys()\n\t\t\t\t\t: source instanceof Set\n\t\t\t\t\t\t? () => source.values()\n\t\t\t\t\t\t: () => Object.keys(source)\n\n\tconst keyEffects = new Map<any, ScopedCallback>()\n\n\tconst outer = effect.named('attend')(({ ascend }) => {\n\t\tconst keys = new Set<any>()\n\t\tfor (const key of enumerate()) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tkeyEffects.set(\n\t\t\t\tkey,\n\t\t\t\tascend(() => effect.named(`attend:${key}`)((access) => callback(key, access)))\n\t\t\t)\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) {\n\t\t\tif (!keys.has(key)) {\n\t\t\t\tkeyEffects.get(key)!()\n\t\t\t\tkeyEffects.delete(key)\n\t\t\t}\n\t\t}\n\t})\n\n\treturn (reason?: CleanupReason) => {\n\t\touter(reason)\n\t\tfor (const stop of keyEffects.values()) stop(reason)\n\t\tkeyEffects.clear()\n\t}\n}\n\n/**\n * Lifts a callback that returns an array into a reactive array that automatically\n * synchronizes with the source array returned by the callback.\n *\n * The returned reactive array will update whenever the callback's dependencies change,\n * efficiently syncing only the elements that differ from the previous result.\n *\n * @example\n * ```typescript\n * const items = reactive([1, 2, 3])\n * const doubled = lift(() => items.map(x => x * 2))\n *\n * console.log([...doubled]) // [2, 4, 6]\n *\n * items.push(4)\n * console.log([...doubled]) // [2, 4, 6, 8]\n * ```\n *\n * @param cb Callback function that returns an array\n * @returns A reactive array synchronized with the callback's result, with a [cleanup] property to stop tracking\n */\nexport function lift<Output extends any[]>(cb: (access: EffectAccess) => Output): Output\n\n/**\n * Lifts a callback that returns an object into a reactive object that automatically\n * synchronizes with the source object returned by the callback.\n *\n * The returned reactive object will update whenever the callback's dependencies change,\n * efficiently syncing only the properties that differ from the previous result using\n * Object.assign(). Properties that no longer exist in the source are automatically removed.\n *\n * @example\n * ```typescript\n * const user = reactive({ name: 'John', age: 30 })\n * const profile = lift(() => ({\n *   displayName: user.name.toUpperCase(),\n *   isAdult: user.age >= 18,\n *   description: `${user.name} is ${user.age} years old`\n * }))\n *\n * console.log(profile.displayName) // JOHN\n * console.log(profile.isAdult) // true\n *\n * user.name = 'Jane'\n * console.log(profile.displayName) // JANE\n * console.log(profile.description) // Jane is 30 years old\n * ```\n *\n * @param cb Callback function that returns an object\n * @returns A reactive object synchronized with the callback's result, with a [cleanup] property to stop tracking\n */\nexport function lift<Output extends object>(cb: (access: EffectAccess) => Output): Output\nexport function lift<Output extends any[] | object>(cb: (access: EffectAccess) => Output): Output {\n\tlet result!: Output\n\tlet rawResult!: Output\n\tconst liftCleanup = effect.named(`lift:${cb.name}`)(\n\t\tmarkWithRoot((access) => {\n\t\t\tconst source = cb(access)\n\t\t\tif (!source || typeof source !== 'object')\n\t\t\t\tthrow new Error('lift callback must return an array or object')\n\t\t\tconst sourceProto = Object.getPrototypeOf(source)\n\t\t\tif (!result) {\n\t\t\t\trawResult = Array.isArray(source) ? [] : Object.create(sourceProto)\n\t\t\t\tresult = reactive(rawResult)\n\t\t\t}\n\t\t\tif (sourceProto !== Object.getPrototypeOf(result))\n\t\t\t\tthrow new Error('lift callback must return the same type as the previous result')\n\n\t\t\tif (Array.isArray(source)) {\n\t\t\t\tconst res = result as unknown[]\n\t\t\t\tfor (const { indexA, sliceA, sliceB } of arrayDiff(res, source).sort(\n\t\t\t\t\t(a, b) => a.indexA - b.indexA\n\t\t\t\t))\n\t\t\t\t\tres.splice(indexA, sliceA.length, ...sliceB)\n\t\t\t} else {\n\t\t\t\tfor (const key of Object.keys(source)) {\n\t\t\t\t\tconst had = key in rawResult\n\t\t\t\t\tconst newDesc = Object.getOwnPropertyDescriptor(source, key)!\n\t\t\t\t\tif (had) {\n\t\t\t\t\t\tconst oldDesc = Object.getOwnPropertyDescriptor(rawResult, key)\n\t\t\t\t\t\tconst sameAccessor = oldDesc && newDesc.get && oldDesc.get === newDesc.get\n\t\t\t\t\t\tObject.defineProperty(rawResult, key, newDesc)\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t!sameAccessor &&\n\t\t\t\t\t\t\trawResult[key] !==\n\t\t\t\t\t\t\t\t(oldDesc ? (oldDesc.get ? oldDesc.get() : oldDesc.value) : undefined)\n\t\t\t\t\t\t)\n\t\t\t\t\t\t\ttouched1(rawResult, { type: 'set', prop: key }, key)\n\t\t\t\t\t} else {\n\t\t\t\t\t\tObject.defineProperty(rawResult, key, newDesc)\n\t\t\t\t\t\ttouched1(rawResult, { type: 'add', prop: key }, key)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (const key of Object.keys(rawResult))\n\t\t\t\t\tif (!(key in source)) {\n\t\t\t\t\t\tdelete rawResult[key]\n\t\t\t\t\t\ttouched1(rawResult, { type: 'del', prop: key }, key)\n\t\t\t\t\t}\n\t\t\t}\n\t\t}, cb)\n\t)\n\treturn link(result, liftCleanup)\n}\n\n/**\n * Options for `morph` and its variants.\n *\n * @property pure - When `true`, the mapping function is assumed pure (no reactive reads inside `fn`).\n *   Per-item effects are skipped and items are computed eagerly. When a predicate `(i) => boolean`,\n *   purity is evaluated per item — pure items skip the effect wrapper, non-pure items get their own.\n */\nexport type MorphOptions<I> = { pure?: boolean | ((i: I) => boolean) }\n\n/**\n * Reactively maps an array source through `fn`, producing a lazy reactive output array.\n *\n * Each source item gets its own isolated effect (via `root()`) so that changes to one item\n * only recompute that item's projection. Structural changes (push, splice, reorder) are detected\n * via `arrayDiff` and surgically applied to the output cache.\n *\n * The source can be a reactive array or a function returning an array. When a function is provided,\n * the function is re-evaluated inside an effect whenever its dependencies change.\n *\n * Output elements are computed lazily — accessing `result[i]` triggers computation if not yet cached.\n *\n * @param source - A reactive array or a function returning an array\n * @param fn - Mapping function applied to each element\n * @param options - Optional purity hints to skip per-item effects\n * @returns A readonly reactive array with a `[cleanup]` method to dispose all effects\n */\nexport function morphArray<I, O>(\n\tsource: readonly I[] | (() => readonly I[]),\n\tfn: (arg: I, access?: EffectAccess) => O,\n\toptions?: MorphOptions<I>\n): readonly O[] {\n\tif (typeof source !== 'function' && !isReactive(source) && options?.pure === true) {\n\t\treturn source.map((i) => fn(i)) as any\n\t}\n\n\tlet track!: GetterWrapper\n\tconst itemEffects = new Map<any, { stop: ScopedCallback; index: { value: number } }>()\n\tconst cache = [] as O[]\n\tlet input: readonly I[] = []\n\n\tfunction stopItem(key: any) {\n\t\tconst entry = itemEffects.get(key)\n\t\tif (entry) {\n\t\t\tentry.stop({ type: 'stopped' })\n\t\t\titemEffects.delete(key)\n\t\t}\n\t}\n\n\tfunction computeItem(key: number, input: I) {\n\t\tconst isPure =\n\t\t\toptions?.pure === true || (typeof options?.pure === 'function' && options.pure(input))\n\t\tif (isPure) {\n\t\t\ttrack(() => {\n\t\t\t\tcache[key] = fn(input)\n\t\t\t})\n\t\t} else {\n\t\t\tconst indexRef = { value: key }\n\t\t\tconst stop = track(() =>\n\t\t\t\teffect.named(`morph:${fn.name}:${key}`).opaque((access) => {\n\t\t\t\t\tcache[indexRef.value] = fn(input, access)\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\tdelete cache[indexRef.value]\n\t\t\t\t\t\ttouched1(cache, { type: 'invalidate', prop: 'morph' }, String(key))\n\t\t\t\t\t\tstop?.({ type: 'invalidate', cause: reason })\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t)\n\t\t\titemEffects.set(key, { stop, index: indexRef })\n\t\t}\n\t}\n\n\tconst proxy = reactive(cache, {\n\t\tget(cache, prop) {\n\t\t\tconst n = typeof prop === 'string' ? Number(prop) : NaN\n\t\t\tif (Number.isNaN(n)) return cache[prop]\n\t\t\tif (!(n in cache)) computeItem(n, input[n])\n\t\t\treturn cache[n]\n\t\t},\n\t\thas(_cache, prop) {\n\t\t\treturn Reflect.has(input, prop)\n\t\t},\n\t})\n\n\tconst stopMain = effect.named(`morph:${fn.name}`)(({ ascend }) => {\n\t\ttrack = ascend\n\t\tconst newInput = [...(typeof source === 'function' ? source() : source)]\n\t\tconst diffs = arrayDiff(input, newInput).toSorted((a, b) => b.indexA - a.indexA)\n\n\t\tif (diffs.length > 0) {\n\t\t\tfor (const diff of diffs) {\n\t\t\t\t// Stop items in removed range\n\t\t\t\tfor (let i = diff.indexA; i < diff.indexA + diff.sliceA.length; i++) stopItem(i)\n\n\t\t\t\t// Shift existing itemEffects in the Map to match the new indices\n\t\t\t\tconst shift = diff.sliceB.length - diff.sliceA.length\n\t\t\t\tif (shift !== 0) {\n\t\t\t\t\t// We need to move entries in the Map.\n\t\t\t\t\tconst entries = Array.from(itemEffects.entries()).sort((a, b) => a[0] - b[0])\n\t\t\t\t\t// Remove entries that will be shifted\n\t\t\t\t\tfor (const [idx, _entry] of entries) {\n\t\t\t\t\t\tif (idx >= diff.indexA + diff.sliceA.length) {\n\t\t\t\t\t\t\titemEffects.delete(idx)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t// Re-add them with shifted indices\n\t\t\t\t\tfor (const [idx, entry] of entries) {\n\t\t\t\t\t\tif (idx >= diff.indexA + diff.sliceA.length) {\n\t\t\t\t\t\t\tconst newIdx = idx + shift\n\t\t\t\t\t\t\tentry.index.value = newIdx\n\t\t\t\t\t\t\titemEffects.set(newIdx, entry)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Splice the cache\n\t\t\t\tcache.splice(\n\t\t\t\t\tdiff.indexA,\n\t\t\t\t\tdiff.sliceA.length,\n\t\t\t\t\t...new Array(diff.sliceB.length).fill(undefined)\n\t\t\t\t)\n\n\t\t\t\t// Make holes for lazy computation\n\t\t\t\tfor (let i = diff.indexA; i < diff.indexA + diff.sliceB.length; i++) delete cache[i]\n\t\t\t}\n\n\t\t\tconst invalidates = new Set<PropertyKey>([keysOf])\n\t\t\tif (input.length !== newInput.length) invalidates.add('length')\n\t\t\tfor (const diff of diffs) {\n\t\t\t\tconst max = Math.max(diff.sliceA.length, diff.sliceB.length)\n\t\t\t\tfor (let i = 0; i < max; i++) invalidates.add(String(diff.indexA + i))\n\t\t\t}\n\t\t\ttouched(cache, { type: 'bunch', method: 'morph-input' }, invalidates)\n\t\t}\n\n\t\tinput = newInput\n\t})\n\n\treturn link(proxy, (reason) => {\n\t\tstopMain(reason)\n\t\tfor (const entry of itemEffects.values()) entry.stop(reason)\n\t\titemEffects.clear()\n\t})\n}\n\n/**\n * Reactively maps a `Map` source through `fn`, producing a reactive output Map.\n *\n * Each key gets its own isolated effect so that value changes for one key only recompute\n * that key's projection. Key additions and removals are tracked via `keysOf` dependency.\n *\n * @param source - A reactive Map\n * @param fn - Mapping function applied to each value\n * @param options - Optional purity hints to skip per-key effects\n * @returns A reactive Map with a `[cleanup]` method to dispose all effects\n */\nexport function morphMap<K, V, O>(\n\tsource: Map<K, V>,\n\tfn: (arg: V, key: K, access?: EffectAccess) => O,\n\toptions?: MorphOptions<V>\n): Map<K, O> {\n\tif (!isReactive(source) && options?.pure === true) {\n\t\tconst res = new Map<K, O>()\n\t\tfor (const [k, v] of source) res.set(k, fn(v, k))\n\t\treturn res as any\n\t}\n\n\tlet track!: GetterWrapper\n\tconst itemEffects = new Map<any, ScopedCallback>()\n\tconst cache = new Map<K, O>()\n\tObject.defineProperty(cache, 'constructor', { value: Object, enumerable: false })\n\n\tfunction stopItem(key: any) {\n\t\tconst stop = itemEffects.get(key)\n\t\tif (stop) {\n\t\t\tstop({ type: 'stopped' })\n\t\t\titemEffects.delete(key)\n\t\t}\n\t}\n\n\tfunction computeItem(key: any, val: any) {\n\t\tconst isPure =\n\t\t\toptions?.pure === true || (typeof options?.pure === 'function' && options.pure(val))\n\t\tif (isPure) {\n\t\t\tcache.set(\n\t\t\t\tkey,\n\t\t\t\ttrack(() => fn(val, key))\n\t\t\t)\n\t\t} else {\n\t\t\tconst stop = track(() =>\n\t\t\t\teffect.named(`morph:${fn.name}:${key}`).opaque((access) => {\n\t\t\t\t\tcache.set(key, fn(source.get(key), key, access))\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\tcache.delete(key)\n\t\t\t\t\t\ttouched1(cache, { type: 'invalidate', prop: 'morph' }, String(key))\n\t\t\t\t\t\tstop?.({ type: 'invalidate', cause: reason })\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t)\n\t\t\titemEffects.set(key, stop)\n\t\t}\n\t}\n\n\tconst proxy = reactive(cache, {\n\t\tget(cache, prop) {\n\t\t\tif (prop === 'get')\n\t\t\t\treturn (key: any) => {\n\t\t\t\t\tif (!cache.has(key) && source.has(key)) computeItem(key, source.get(key))\n\t\t\t\t\treturn cache.get(key)\n\t\t\t\t}\n\t\t\tif (prop === 'has')\n\t\t\t\treturn (key: any) => {\n\t\t\t\t\treturn source.has(key)\n\t\t\t\t}\n\t\t\tif (prop === 'keys')\n\t\t\t\treturn () => {\n\t\t\t\t\treturn source.keys()\n\t\t\t\t}\n\t\t\tif (prop === 'values')\n\t\t\t\treturn function* () {\n\t\t\t\t\tfor (const key of source.keys()) {\n\t\t\t\t\t\tyield proxy.get(key)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tif (prop === 'entries')\n\t\t\t\treturn function* () {\n\t\t\t\t\tfor (const key of source.keys()) {\n\t\t\t\t\t\tyield [key, proxy.get(key)]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tif (prop === Symbol.iterator)\n\t\t\t\treturn function* () {\n\t\t\t\t\tfor (const key of source.keys()) {\n\t\t\t\t\t\tyield [key, proxy.get(key)]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\treturn (cache as any)[prop]\n\t\t},\n\t}) as any\n\n\tlet stateSnapshot: State = getState(source)\n\tconst stopMain = effect.named(`morph:${fn.name}`)(({ ascend }) => {\n\t\ttrack = ascend\n\t\tdependant(source, keysOf)\n\t\twhile ('evolution' in stateSnapshot) {\n\t\t\tconst { evolution } = stateSnapshot\n\t\t\tstateSnapshot = stateSnapshot.next\n\t\t\tif (evolution.type === 'add') {\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t} else if (evolution.type === 'del') {\n\t\t\t\tstopItem(evolution.prop)\n\t\t\t\tcache.delete(evolution.prop)\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t}\n\t\t}\n\t})\n\n\treturn link(proxy, (reason) => {\n\t\tstopMain(reason)\n\t\tfor (const stop of itemEffects.values()) stop(reason)\n\t\titemEffects.clear()\n\t})\n}\n\n/**\n * Reactively maps a record/object source through `fn`, producing a reactive output record.\n *\n * Each key gets its own isolated effect so that value changes for one key only recompute\n * that key's projection. Key additions and removals are tracked automatically.\n *\n * @param source - A reactive record\n * @param fn - Mapping function applied to each value\n * @param options - Optional purity hints to skip per-key effects\n * @returns A reactive record with a `[cleanup]` method to dispose all effects\n */\nexport function morphRecord<S extends Record<PropertyKey, any>, O>(\n\tsource: S,\n\tfn: (arg: S[keyof S], key: keyof S, access?: EffectAccess) => O,\n\toptions?: MorphOptions<S[keyof S]>\n): { [K in keyof S]: O } {\n\tif (!isReactive(source) && options?.pure === true) {\n\t\tconst res = {} as any\n\t\tfor (const k of Object.keys(source)) res[k] = fn(source[k], k)\n\t\treturn res\n\t}\n\n\tlet track!: GetterWrapper\n\tconst itemEffects = new Map<any, ScopedCallback>()\n\tconst cache = {} as any\n\n\tfunction stopItem(key: any) {\n\t\tconst stop = itemEffects.get(key)\n\t\tif (stop) {\n\t\t\tstop({ type: 'stopped' })\n\t\t\titemEffects.delete(key)\n\t\t}\n\t}\n\n\tfunction computeItem(key: any, val: any) {\n\t\tconst isPure =\n\t\t\toptions?.pure === true || (typeof options?.pure === 'function' && options.pure(val))\n\t\tif (isPure) {\n\t\t\tcache[key] = track(() => fn(val, key))\n\t\t} else {\n\t\t\tconst stop = track(() =>\n\t\t\t\teffect.named(`morph:${fn.name}:${key}`).opaque((access) => {\n\t\t\t\t\tcache[key] = fn(source[key], key, access)\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\tdelete cache[key]\n\t\t\t\t\t\ttouched1(cache, { type: 'invalidate', prop: 'morph' }, String(key))\n\t\t\t\t\t\tstop?.({ type: 'invalidate', cause: reason })\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t)\n\t\t\titemEffects.set(key, stop)\n\t\t}\n\t}\n\tfunction get(prop: PropertyKey) {\n\t\tif (!(prop in cache) && prop in source) computeItem(prop, source[prop])\n\t\treturn cache[prop]\n\t}\n\tconst proxy = reactive(cache, {\n\t\tget(_, prop) {\n\t\t\treturn get(prop)\n\t\t},\n\t\thas(_, prop) {\n\t\t\treturn prop in source\n\t\t},\n\t\townKeys() {\n\t\t\treturn Reflect.ownKeys(source)\n\t\t},\n\t\tgetOwnPropertyDescriptor(_cache, prop) {\n\t\t\tif (prop in source) return { configurable: true, enumerable: true, get: () => get(prop) }\n\t\t},\n\t})\n\n\tlet stateSnapshot: State = getState(source)\n\tconst stopMain = effect.named(`morph:${fn.name}`)(({ ascend }) => {\n\t\ttrack = ascend\n\t\t// Track only structural changes on source\n\t\tdependant(source, keysOf)\n\t\twhile ('evolution' in stateSnapshot) {\n\t\t\tconst { evolution } = stateSnapshot\n\t\t\tstateSnapshot = stateSnapshot.next\n\t\t\tif (evolution.type === 'add') {\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t} else if (evolution.type === 'del') {\n\t\t\t\tstopItem(evolution.prop)\n\t\t\t\tdelete cache[evolution.prop]\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t}\n\t\t}\n\t})\n\n\treturn link(proxy, (reason) => {\n\t\tstopMain(reason)\n\t\tfor (const stop of itemEffects.values()) stop(reason)\n\t\titemEffects.clear()\n\t})\n}\n\n/**\n * Unified reactive collection mapper. Dispatches to `morphArray`, `morphMap`, or `morphRecord`\n * based on the source type. Access `morph.pure(source, fn)` for the `{ pure: true }` shorthand.\n *\n * @see morphArray\n * @see morphMap\n * @see morphRecord\n */\nexport type Morph = {\n\t<I, O>(\n\t\tsource: readonly I[] | (() => readonly I[]),\n\t\tfn: (arg: I, access?: EffectAccess) => O,\n\t\toptions?: MorphOptions<I>\n\t): readonly O[]\n\n\t<K, V, O>(\n\t\tsource: Map<K, V>,\n\t\tfn: (arg: V, key: K, access?: EffectAccess) => O,\n\t\toptions?: MorphOptions<V>\n\t): Map<K, O>\n\n\t<S extends Record<PropertyKey, any>, O>(\n\t\tsource: S,\n\t\tfn: (arg: S[keyof S], key: keyof S, access?: EffectAccess) => O,\n\t\toptions?: MorphOptions<S[keyof S]>\n\t): { [K in keyof S]: O }\n\n\tpure: Morph\n}\n\n/**\n * Reactively maps a collection (array, Map, or record) through a per-entry function.\n *\n * Each entry in the source gets its own reactive context — when only one entry's dependencies\n * change, only that entry's projection recomputes. Structural changes (additions, removals,\n * reorders) are detected via diffing and applied surgically.\n *\n * Use `morph.pure(source, fn)` when `fn` has no reactive reads (skips per-item effects).\n *\n * @example\n * ```ts\n * const users = reactive([{ name: 'John' }, { name: 'Jane' }])\n * const names = morph(users, u => u.name.toUpperCase())\n * // names[0] = 'JOHN', names[1] = 'JANE'\n * // Changing users[0].name only recomputes names[0]\n * ```\n */\nexport const morph = flavored(\n\tfunction morph(source: any, fn: any, options?: any): any {\n\t\tif (Array.isArray(source) || typeof source === 'function')\n\t\t\treturn morphArray(source, fn, options)\n\t\tif (source instanceof Map) return morphMap(source, fn, options)\n\t\treturn morphRecord(source, fn, options)\n\t},\n\t{\n\t\tget pure() {\n\t\t\treturn (source: any, fn: any, _opt) => this(source, fn, { pure: true })\n\t\t},\n\t}\n) as Morph\n","import {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectsWithDeepWatchers,\n\tregisterDeepWatcher,\n} from './deep-watch-state'\nimport { effect, untracked } from './effects'\nimport { isNonReactive } from './non-reactive'\nimport { reactive } from './proxy'\nimport { markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport { type EffectCleanup, type EffectTrigger, options, unwrap } from './types'\n\n/**\n * Deep watch an object and all its nested properties\n * @param target - The object to watch deeply\n * @param callback - The callback to call when any nested property changes\n * @param options - Options for the deep watch\n * @returns A cleanup function to stop watching\n */\n/**\n * Sets up deep watching for an object, tracking all nested property changes\n * @param target - The object to watch\n * @param callback - The callback to call when changes occur\n * @param options - Options for deep watching\n * @returns A cleanup function to stop deep watching\n */\nexport function deepWatch<T extends object>(\n\ttarget: T,\n\tcallback: (value: T) => void,\n\t{ immediate = false } = {}\n): EffectCleanup | undefined {\n\tif (target === null || target === undefined) return undefined\n\tif (typeof target !== 'object') throw new Error('Target of deep watching must be an object')\n\t// Create a wrapper callback that matches EffectTrigger signature\n\tconst wrappedCallback: EffectTrigger = markWithRoot(\n\t\t(() => callback(target)) as EffectTrigger,\n\t\tcallback\n\t)\n\n\tregisterDeepWatcher()\n\n\t// Use the existing effect system to register dependencies\n\treturn effect.named('deepWatch')(() => {\n\t\t// Mark the target object as having deep watchers\n\t\tobjectsWithDeepWatchers.add(target)\n\n\t\t// Track which objects this effect is watching for cleanup\n\t\tlet effectObjects = effectToDeepWatchedObjects.get(wrappedCallback)\n\t\tif (!effectObjects) {\n\t\t\teffectObjects = new Set()\n\t\t\teffectToDeepWatchedObjects.set(wrappedCallback, effectObjects)\n\t\t}\n\t\teffectObjects!.add(target)\n\n\t\t// Traverse the object graph and register dependencies\n\t\t// This will re-run every time the effect runs, ensuring we catch all changes\n\t\tconst visited = new WeakSet()\n\t\tfunction traverseAndTrack(obj: any, depth = 0) {\n\t\t\t// Prevent infinite recursion and excessive depth\n\t\t\tif (!obj || visited.has(obj) || typeof obj !== 'object' || depth > options.maxDeepWatchDepth)\n\t\t\t\treturn\n\t\t\t// Do not traverse into unreactive objects\n\t\t\tif (isNonReactive(obj)) return\n\t\t\tvisited.add(obj)\n\n\t\t\t// Mark this object as having deep watchers\n\t\t\tobjectsWithDeepWatchers.add(obj)\n\t\t\teffectObjects!.add(obj)\n\n\t\t\t// Traverse all properties to register dependencies\n\t\t\t// unwrap to avoid kicking dependency\n\t\t\tfor (const key in unwrap(obj)) {\n\t\t\t\tif (Object.hasOwn(obj, key)) {\n\t\t\t\t\t// Access the property to register dependency\n\t\t\t\t\tconst value = (obj as any)[key]\n\t\t\t\t\t// Make the value reactive if it's an object\n\t\t\t\t\tconst reactiveValue =\n\t\t\t\t\t\ttypeof value === 'object' && value !== null ? reactive(value) : value\n\t\t\t\t\ttraverseAndTrack(reactiveValue, depth + 1)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Also handle array indices and length\n\t\t\t// Handle arrays and collections using iterators to ensure proxy tracking is triggered\n\t\t\tif (typeof obj[Symbol.iterator] === 'function') {\n\t\t\t\t// Access the iterator to track additions/removals/collection changes\n\t\t\t\tfor (const value of obj) {\n\t\t\t\t\t// Make the value reactive if it's an object\n\t\t\t\t\tconst reactiveValue =\n\t\t\t\t\t\ttypeof value === 'object' && value !== null ? reactive(value) : value\n\t\t\t\t\ttraverseAndTrack(reactiveValue, depth + 1)\n\t\t\t\t}\n\n\t\t\t\t// Explicitly depend on length so array mutations changing count trigger re-evaluation\n\t\t\t\tif ('length' in obj) {\n\t\t\t\t\tdependant(obj, 'length')\n\t\t\t\t}\n\n\t\t\t\t// For Maps, also ensure we track values explicitly if the iterator yields entries\n\t\t\t\tif (obj instanceof Map) {\n\t\t\t\t\tfor (const value of obj.values()) {\n\t\t\t\t\t\tconst reactiveValue =\n\t\t\t\t\t\t\ttypeof value === 'object' && value !== null ? reactive(value) : value\n\t\t\t\t\t\ttraverseAndTrack(reactiveValue, depth + 1)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Note: WeakSet and WeakMap cannot be iterated, so we can't deep watch their contents\n\t\t\t// They will only trigger when the collection itself is replaced\n\t\t}\n\n\t\t// Traverse the target object to register all dependencies\n\t\t// This will register dependencies on all current properties and array elements\n\t\ttraverseAndTrack(target)\n\n\t\t// Only call the callback if immediate is true or if it's not the first run\n\t\tif (immediate) {\n\t\t\tuntracked(() => callback(target))\n\t\t}\n\t\timmediate = true\n\n\t\t// Return a cleanup function that properly removes deep watcher tracking\n\t\treturn () => {\n\t\t\t// Get the objects this effect was watching\n\t\t\tconst effectObjects = effectToDeepWatchedObjects.get(wrappedCallback)\n\t\t\tif (effectObjects) {\n\t\t\t\t// Remove deep watcher tracking from all objects this effect was watching\n\t\t\t\tfor (const obj of effectObjects) {\n\t\t\t\t\t// Check if this object still has other deep watchers\n\t\t\t\t\tconst watchers = deepWatchers.get(obj)\n\t\t\t\t\tif (watchers) {\n\t\t\t\t\t\t// Remove this effect's callback from the watchers\n\t\t\t\t\t\twatchers.delete(wrappedCallback)\n\n\t\t\t\t\t\t// If no more watchers, remove the object from deep watchers tracking\n\t\t\t\t\t\tif (watchers.size === 0) {\n\t\t\t\t\t\t\tdeepWatchers.delete(obj)\n\t\t\t\t\t\t\tobjectsWithDeepWatchers.delete(obj)\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// No watchers found, remove from deep watchers tracking\n\t\t\t\t\t\tobjectsWithDeepWatchers.delete(obj)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Clean up the tracking data\n\t\t\t\teffectToDeepWatchedObjects.delete(wrappedCallback)\n\t\t\t}\n\t\t}\n\t})\n}\n","import { decorator } from '../decorator'\nimport { flavored } from '../flavored'\nimport { deepCompare, named } from '../utils'\nimport { touched1 } from './change'\nimport { effect, root, untracked } from './effects'\nimport { getRoot, markWithRoot, rootFunctionSymbol } from './registry'\nimport { dependant } from './tracking'\nimport { type CleanupReason, optionCall, options, proxyToObject } from './types'\n\nexport type MemoizableArgument = object | any[] | ((...args: any[]) => any)\nexport type Memoizable = ((...args: MemoizableArgument[]) => unknown) | Record<string, any>\n\ntype MemoCacheTree<Result> = {\n\tresult?: Result\n\tcleanup?: (reason?: CleanupReason) => void\n\tbranches?: WeakMap<MemoizableArgument, MemoCacheTree<Result>>\n}\n\nconst memoizedRegistry = new WeakMap<any, Memoizable>()\nconst wrapperRegistry = new WeakMap<Function, (that: object) => unknown>()\n\nfunction getBranch<Result>(\n\ttree: MemoCacheTree<Result>,\n\tkey: MemoizableArgument\n): MemoCacheTree<Result> {\n\ttree.branches ??= new WeakMap()\n\tlet branch = tree.branches.get(key)\n\tif (!branch) {\n\t\tbranch = {}\n\t\ttree.branches.set(key, branch)\n\t}\n\treturn branch\n}\n\nfunction memoizeFunction<Result, Args extends MemoizableArgument[]>(\n\tfn: (...args: Args) => Result,\n\topts?: {\n\t\tlenient?: boolean\n\t}\n): (...args: Args) => Result {\n\tconst fnRoot = getRoot(fn)\n\tconst existing = memoizedRegistry.get(fnRoot)\n\tif (existing) return existing as (...args: Args) => Result\n\n\tconst cacheRoot: MemoCacheTree<Result> = {}\n\tconst memoized = markWithRoot(function memoized(...args: Args): Result {\n\t\tif (args.some((arg) => !(arg && ['object', 'symbol', 'function'].includes(typeof arg)))) {\n\t\t\tif (opts?.lenient) return fn.apply(this, args)\n\t\t\tthrow new Error('memoize expects non-null object arguments')\n\t\t}\n\n\t\tlet node: MemoCacheTree<Result> = cacheRoot\n\t\t// Note: decorators add `this` as first argument\n\t\tfor (const arg of args) {\n\t\t\tnode = getBranch(node, arg)\n\t\t}\n\n\t\tdependant(node, 'memoize')\n\t\tif ('result' in node) {\n\t\t\tif (options.onMemoizationDiscrepancy) {\n\t\t\t\tconst wasVerification = options.isVerificationRun\n\t\t\t\toptions.isVerificationRun = true\n\t\t\t\ttry {\n\t\t\t\t\tconst fresh = untracked(() => fn.apply(this, args))\n\t\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\t\toptionCall('onMemoizationDiscrepancy', node.result, fresh, fn, args, 'calculation')\n\t\t\t\t\t}\n\t\t\t\t} finally {\n\t\t\t\t\toptions.isVerificationRun = wasVerification\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn node.result!\n\t\t}\n\n\t\t// Create memoize internal effect to track dependencies and invalidate cache\n\t\t// Use untracked to prevent the effect creation from being affected by parent effects\n\t\tnode.cleanup = root(() =>\n\t\t\teffect.named('memoize')(\n\t\t\t\t() => {\n\t\t\t\t\t// Execute the function and track its dependencies\n\t\t\t\t\t// The function execution will automatically track dependencies on reactive objects\n\t\t\t\t\tnode.result = fn.apply(this, args)\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\t// When dependencies change, clear the cache and notify consumers\n\t\t\t\t\t\tdelete node.result\n\t\t\t\t\t\ttouched1(node, { type: 'invalidate', prop: args }, 'memoize')\n\t\t\t\t\t\t// Lazy memoization: stop the effect so it doesn't re-run immediately.\n\t\t\t\t\t\t// It will be re-created on next access.\n\t\t\t\t\t\tif (node.cleanup) {\n\t\t\t\t\t\t\tnode.cleanup({ type: 'invalidate', cause: reason })\n\t\t\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t{ opaque: true }\n\t\t\t)\n\t\t)\n\n\t\tif (options.onMemoizationDiscrepancy) {\n\t\t\tconst wasVerification = options.isVerificationRun\n\t\t\toptions.isVerificationRun = true\n\t\t\ttry {\n\t\t\t\tconst fresh = untracked(() => fn.apply(this, args))\n\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\toptionCall('onMemoizationDiscrepancy', node.result, fresh, fn, args, 'comparison')\n\t\t\t\t}\n\t\t\t} finally {\n\t\t\t\toptions.isVerificationRun = wasVerification\n\t\t\t}\n\t\t}\n\n\t\treturn node.result!\n\t}, fn)\n\n\tmemoizedRegistry.set(fnRoot, memoized)\n\tmemoizedRegistry.set(memoized, memoized)\n\treturn memoized as (...args: Args) => Result\n}\n\nfunction memoizeObject<T extends Record<string, any>>(target: T, opts?: { lenient?: boolean }): T {\n\tconst existing = memoizedRegistry.get(target)\n\tif (existing) return existing as T\n\n\tconst proxy = new Proxy(target, {\n\t\tget(source, prop, receiver) {\n\t\t\t// 1. Walk prototype chain to find descriptor\n\t\t\tlet current = source\n\t\t\tlet desc: PropertyDescriptor | undefined\n\t\t\twhile (current) {\n\t\t\t\tdesc = Object.getOwnPropertyDescriptor(current, prop)\n\t\t\t\tif (desc) break\n\t\t\t\tcurrent = Object.getPrototypeOf(current)\n\t\t\t}\n\t\t\tif (!desc) return Reflect.get(source, prop, receiver)\n\t\t\t// 2. If getter, memoize\n\t\t\tif (desc.get) {\n\t\t\t\tconst originalGetter = desc.get\n\t\t\t\tlet wrapper = wrapperRegistry.get(originalGetter)\n\t\t\t\tif (!wrapper) {\n\t\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\t\tnamed(\n\t\t\t\t\t\t\t`${String(source?.constructor?.name ?? 'Object')}.${String(prop)}`,\n\t\t\t\t\t\t\t(that: any) => {\n\t\t\t\t\t\t\t\treturn originalGetter.call(that)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpropertyKey: prop,\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t\tconst origRoot = originalGetter[rootFunctionSymbol]\n\t\t\t\t\tif (origRoot) wrapper[rootFunctionSymbol] = origRoot\n\t\t\t\t\twrapperRegistry.set(originalGetter, wrapper)\n\t\t\t\t}\n\t\t\t\tconst memoized = memoizeFunction(wrapper, opts)\n\t\t\t\treturn memoized(receiver)\n\t\t\t}\n\n\t\t\t// 3. Otherwise forward\n\t\t\treturn Reflect.get(source, prop, receiver)\n\t\t},\n\t\t// Forward set to the target (source) to ensure it acts as the receiver for reactivity notifications\n\t\tset(source, prop, value, _receiver) {\n\t\t\t// By strictly passing `source` as receiver, we ensure that if `source` is a reactive proxy,\n\t\t\t// it recognizes itself and triggers change notifications.\n\t\t\treturn Reflect.set(source, prop, value, source)\n\t\t},\n\t})\n\n\tproxyToObject.set(proxy, target)\n\tmemoizedRegistry.set(target, proxy)\n\treturn proxy\n}\n\n/**\n * Decorator and function wrapper for memoizing computed values based on reactive dependencies.\n *\n * When used as a decorator on getters or methods, it caches the result and automatically\n * invalidates the cache when reactive dependencies change.\n *\n * When used as a function wrapper, it memoizes based on object arguments (WeakMap-based cache).\n *\n * @example\n * ```typescript\n * class User {\n *   @memoize\n *   get fullName() {\n *     return `${this.firstName} ${this.lastName}`\n *   }\n * }\n *\n * // Or as a function wrapper\n * const expensive = memoize((obj: SomeObject) => {\n *   return heavyComputation(obj)\n * })\n * ```\n */\nfunction makeMemoizeDecorator(memoizeOpts?: { lenient?: boolean }) {\n\treturn decorator({\n\t\tgetter(original, target, propertyKey) {\n\t\t\treturn function (this: any) {\n\t\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\t\tif (!wrapper) {\n\t\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\t\tnamed(\n\t\t\t\t\t\t\t`${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(propertyKey)}`,\n\t\t\t\t\t\t\t(that: object) => {\n\t\t\t\t\t\t\t\treturn original.call(that)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\t\tpropertyKey,\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t\tconst origRoot = original[rootFunctionSymbol]\n\t\t\t\t\tif (origRoot) wrapper[rootFunctionSymbol] = origRoot\n\t\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t\t}\n\t\t\t\tconst memoized = memoizeFunction(wrapper as any, memoizeOpts)\n\t\t\t\treturn memoized(this)\n\t\t\t}\n\t\t},\n\t\tmethod(original, target, name) {\n\t\t\treturn function (this: any, ...args: object[]) {\n\t\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\t\tif (!wrapper) {\n\t\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\t\tnamed(\n\t\t\t\t\t\t\t`${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(name)}`,\n\t\t\t\t\t\t\t(that: object, ...args: object[]) => {\n\t\t\t\t\t\t\t\treturn original.call(that, ...args)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\t\tpropertyKey: name,\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t\tconst origRoot = original[rootFunctionSymbol]\n\t\t\t\t\tif (origRoot) wrapper[rootFunctionSymbol] = origRoot\n\t\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t\t}\n\t\t\t\tconst memoized = memoizeFunction(wrapper as any, memoizeOpts) as (\n\t\t\t\t\t...args: object[]\n\t\t\t\t) => unknown\n\t\t\t\treturn memoized(this, ...args)\n\t\t\t}\n\t\t},\n\t\tdefault: <T extends Memoizable>(target: T): T =>\n\t\t\ttypeof target === 'object'\n\t\t\t\t? (memoizeObject(target, memoizeOpts) as T)\n\t\t\t\t: (memoizeFunction(target, memoizeOpts) as T),\n\t})\n}\n\nexport const memoize: ReturnType<typeof makeMemoizeDecorator> & {\n\treadonly lenient: ReturnType<typeof makeMemoizeDecorator>\n} = flavored(makeMemoizeDecorator(), {\n\tget lenient() {\n\t\treturn makeMemoizeDecorator({ lenient: true })\n\t},\n})\n","import { decorator, type GenericClassDecorator } from '../decorator'\nimport { flavored, flavorOptions } from '../flavored'\nimport { deepWatch } from './deep-watch'\nimport { effectHistory, link } from './effect-context'\nimport { captured, effect, untracked } from './effects'\nimport { addUnreactiveProps, isNonReactive } from './non-reactive'\nimport { reactive } from './proxy'\nimport { markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport {\n\ttype EffectAccess,\n\ttype EffectCleanup,\n\ttype ScopedCallback,\n\tunreactiveProperties,\n\tunwrap,\n} from './types'\n\n//#region watch\n\nconst unsetYet = Symbol('unset-yet')\n/**\n * Options for the watch function\n */\nexport interface WatchOptions {\n\t/** Whether to call the callback immediately */\n\timmediate?: boolean\n\t/** Whether to watch nested properties */\n\tdeep?: boolean\n}\n\n/**\n * Watches a reactive value and calls a callback when it changes\n */\nexport interface Watch {\n\t<T>(\n\t\tvalue: (dep: EffectAccess) => T,\n\t\tchanged: (value: T, oldValue?: T) => void,\n\t\toptions?: Omit<WatchOptions, 'deep'> & { deep?: false }\n\t): EffectCleanup\n\t/**\n\t * Watches a reactive value with deep watching enabled\n\t */\n\t<T extends object | any[]>(\n\t\tvalue: (dep: EffectAccess) => T,\n\t\tchanged: (value: T, oldValue?: T) => void,\n\t\toptions?: Omit<WatchOptions, 'deep'> & { deep: true }\n\t): EffectCleanup\n\t/**\n\t * Watches a reactive object directly\n\t */\n\t<T extends object | any[]>(\n\t\tvalue: T,\n\t\tchanged: (value: T) => void,\n\t\toptions?: WatchOptions\n\t): EffectCleanup\n\n\t/** Deep watch flavor */\n\tget deep(): Watch\n\t/** Immediate watch flavor */\n\tget immediate(): Watch\n}\n\nexport const watch = flavored(\n\tfunction watch(\n\t\tvalue: any, //object | ((dep: DependencyAccess) => object),\n\t\tchanged: (value?: object, oldValue?: object) => void,\n\t\toptions: any = {}\n\t) {\n\t\treturn typeof value === 'function'\n\t\t\t? watchCallBack(value, changed, options)\n\t\t\t: typeof value === 'object' && value !== null\n\t\t\t\t? watchObject(value, changed, options)\n\t\t\t\t: (() => {\n\t\t\t\t\t\tthrow new Error('watch: value must be a function or an object')\n\t\t\t\t\t})()\n\t},\n\t{\n\t\tget deep() {\n\t\t\treturn flavorOptions(this, { deep: true })\n\t\t},\n\t\tget immediate() {\n\t\t\treturn flavorOptions(this, { immediate: true })\n\t\t},\n\t}\n) as Watch\n\nfunction watchObject(\n\tvalue: object,\n\tchanged: (value: object) => void,\n\t{ immediate = false, deep = false } = {}\n): EffectCleanup {\n\tif (deep) return deepWatch(value, changed, { immediate })!\n\treturn effect.named('watch:object')(() => {\n\t\tdependant(value)\n\t\tif (immediate) changed(value)\n\t\timmediate = true\n\t})\n}\n\nfunction watchCallBack<T>(\n\tvalue: (dep: EffectAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\t{ immediate = false, deep = false } = {}\n): EffectCleanup {\n\tlet oldValue: T | typeof unsetYet = unsetYet\n\tlet deepCleanup: EffectCleanup | undefined\n\tconst cbCleanup = effect.named('watch:callback')(\n\t\tmarkWithRoot((access) => {\n\t\t\tconst newValue = value(access)\n\t\t\tif (oldValue !== newValue) {\n\t\t\t\tconst old = oldValue\n\t\t\t\tif (old === unsetYet) {\n\t\t\t\t\tif (immediate) untracked(() => changed(newValue))\n\t\t\t\t} else untracked(() => changed(newValue, old as T))\n\t\t\t}\n\t\t\toldValue = newValue\n\t\t\tif (deep) {\n\t\t\t\tif (deepCleanup) deepCleanup()\n\t\t\t\tdeepCleanup = deepWatch(newValue as object, (value) => changed(value as T, value as T))\n\t\t\t}\n\t\t}, value)\n\t)\n\treturn (() => {\n\t\tcbCleanup()\n\t\tif (deepCleanup) deepCleanup()\n\t}) as EffectCleanup\n}\n\n//#endregion\n\n//#region when\n\n/**\n * Returns a promise that resolves when the predicate returns a truthy value.\n * The predicate is evaluated reactively — it re-runs whenever its dependencies change.\n * @param predicate - Reactive function that returns a value; resolves when truthy\n * @param timeout - Optional timeout in milliseconds — rejects if condition is not met within this duration\n * @returns Promise that resolves with the first truthy return value\n */\nexport function when<T>(predicate: (dep: EffectAccess) => T, timeout?: number): Promise<T> {\n\treturn new Promise<T>((resolve, reject) => {\n\t\tlet timer: ReturnType<typeof setTimeout> | undefined\n\t\tconst stop = effect.named('watch:when')((access) => {\n\t\t\ttry {\n\t\t\t\tconst value = predicate(access)\n\t\t\t\tif (value) {\n\t\t\t\t\tif (timer !== undefined) clearTimeout(timer)\n\t\t\t\t\ttimer = undefined\n\t\t\t\t\tqueueMicrotask(() => stop())\n\t\t\t\t\tresolve(value)\n\t\t\t\t}\n\t\t\t} catch (error) {\n\t\t\t\tif (timer !== undefined) clearTimeout(timer)\n\t\t\t\ttimer = undefined\n\t\t\t\treject(error)\n\t\t\t}\n\t\t})\n\t\tif (timeout !== undefined) {\n\t\t\ttimer = setTimeout(() => {\n\t\t\t\tstop()\n\t\t\t\ttimer = undefined\n\t\t\t\treject(new Error(`when: timed out after ${timeout}ms`))\n\t\t\t}, timeout)\n\t\t}\n\t})\n}\n\n//#endregion\n\n//#region nonReactive\n\n/**\n * Mark an object as non-reactive. This object and all its properties will never be made reactive.\n * @param obj - The object to mark as non-reactive\n */\nfunction shallowNonReactive<T>(obj: T): T {\n\tobj = unwrap(obj)\n\tif (isNonReactive(obj)) return obj\n\t;(obj as any)[unreactiveProperties] = true\n\treturn obj\n}\nfunction unreactiveApplication<T extends object>(...args: (keyof T)[]): GenericClassDecorator<T>\nfunction unreactiveApplication<T extends object>(obj: T): T\nfunction unreactiveApplication<T extends object>(\n\targ1: T | keyof T,\n\t...args: (keyof T)[]\n): GenericClassDecorator<T> | T {\n\treturn typeof arg1 === 'object'\n\t\t? shallowNonReactive(arg1)\n\t\t: (((original) => {\n\t\t\t\t// Copy the parent's unreactive properties if they exist\n\t\t\t\tconst parentMarker = (original.prototype as any)[unreactiveProperties]\n\t\t\t\t// If parent is fully unreactive, child is too\n\t\t\t\tif (parentMarker === true) {\n\t\t\t\t\t;(original.prototype as any)[unreactiveProperties] = true\n\t\t\t\t} else {\n\t\t\t\t\tconst set = new Set<PropertyKey>(parentMarker || [])\n\t\t\t\t\t// Add all arguments (including the first one)\n\t\t\t\t\tset.add(arg1)\n\t\t\t\t\tfor (const arg of args) set.add(arg)\n\t\t\t\t\taddUnreactiveProps(original.prototype, set)\n\t\t\t\t}\n\t\t\t\treturn original // Return the class\n\t\t\t}) as GenericClassDecorator<T>)\n}\n/**\n * Decorator that marks classes or properties as non-reactive\n * Prevents objects from being made reactive\n */\nexport const unreactive = decorator({\n\tclass(original) {\n\t\t// Called without arguments, mark entire class as non-reactive\n\t\t;(original.prototype as any)[unreactiveProperties] = true\n\t},\n\tdefault: unreactiveApplication,\n})\n\n//#endregion\n\n//#region resource\n\nexport function lazyInit<T extends object>(resource: T, load: ScopedCallback) {\n\tconst creation = effectHistory.active\n\tlet fresh = true\n\treturn new Proxy(resource, {\n\t\t[Symbol.toStringTag]: 'LazyInit',\n\t\tget(target, prop) {\n\t\t\tif (fresh) {\n\t\t\t\tcaptured(creation, load)()\n\t\t\t\tfresh = false\n\t\t\t}\n\t\t\treturn target[prop]\n\t\t},\n\t} as ProxyHandler<T>)\n}\n\nexport interface Resource<T> {\n\tvalue: T | undefined\n\tloading: boolean\n\terror: any\n\tlatest: T | undefined\n\treload(): void\n\tpromise: Promise<void>\n}\n\n/**\n * Creates a reactive resource that automatically tracks async state.\n * @param fetcher - Async function that returns the value. Reactive dependencies are tracked.\n * @param options - Resource options (initialValue)\n * @returns Reactive Resource object with value, loading, error, latest properties\n */\nexport function resource<T>(\n\tfetcher: (access: EffectAccess) => Promise<T> | T,\n\toptions: { initialValue?: T } = {}\n): Resource<T> {\n\tconst resource: Partial<Resource<T>> = reactive({\n\t\tvalue: options.initialValue,\n\t\tloading: true,\n\t\terror: undefined as any,\n\t\tlatest: options.initialValue,\n\t\treload() {\n\t\t\treloadSignal.value++\n\t\t},\n\t})\n\n\tconst reloadSignal = reactive({ value: 0 })\n\t// Solve race conditions: make sure a new fast request is not overloaded by a slow old one\n\tlet counter = 0\n\n\treturn lazyInit(resource as Resource<T>, () => {\n\t\tlink(\n\t\t\tresource,\n\t\t\teffect.named('watch:resource')((access) => {\n\t\t\t\t// Track reload signal to enable manual reloading\n\t\t\t\tvoid reloadSignal.value\n\n\t\t\t\tconst id = ++counter\n\t\t\t\tresource.loading = true\n\t\t\t\tresource.error = undefined\n\n\t\t\t\ttry {\n\t\t\t\t\tconst result = fetcher(access)\n\n\t\t\t\t\tif (result instanceof Promise) {\n\t\t\t\t\t\tresource.promise = result\n\t\t\t\t\t\t\t.then((val) => {\n\t\t\t\t\t\t\t\tif (id === counter) {\n\t\t\t\t\t\t\t\t\tresource.value = val\n\t\t\t\t\t\t\t\t\tresource.latest = val\n\t\t\t\t\t\t\t\t\tresource.loading = false\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t.catch((err) => {\n\t\t\t\t\t\t\t\tif (id === counter) {\n\t\t\t\t\t\t\t\t\tresource.error = err\n\t\t\t\t\t\t\t\t\tresource.loading = false\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t})\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresource.promise = Promise.resolve()\n\t\t\t\t\t\tresource.value = result\n\t\t\t\t\t\tresource.latest = result\n\t\t\t\t\t\tresource.loading = false\n\t\t\t\t\t}\n\t\t\t\t} catch (err) {\n\t\t\t\t\tresource.promise = Promise.reject(err)\n\t\t\t\t\tresource.error = err\n\t\t\t\t\tresource.loading = false\n\t\t\t\t}\n\t\t\t})\n\t\t) as Resource<T>\n\t})\n}\n\n//#endregion\n","import { reactive } from './proxy'\n\n/**\n * Converts an iterator to a generator that yields reactive values\n */\nexport function* makeReactiveIterator<T>(iterator: Iterator<T>): Generator<T> {\n\tlet result = iterator.next()\n\twhile (!result.done) {\n\t\tyield reactive(result.value)\n\t\tresult = iterator.next()\n\t}\n}\n\n/**\n * Converts an iterator of key-value pairs to a generator that yields reactive key-value pairs\n */\nexport function* makeReactiveEntriesIterator<K, V>(iterator: Iterator<[K, V]>): Generator<[K, V]> {\n\tlet result = iterator.next()\n\twhile (!result.done) {\n\t\tconst [key, value] = result.value\n\t\tyield [reactive(key), reactive(value)]\n\t\tresult = iterator.next()\n\t}\n}\n","import { FoolProof } from '../utils'\nimport { touched } from './change'\nimport { atomic } from './effects'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './iterator-helpers'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\nimport { keysOf, unwrap } from './types'\n\nfunction* index(i: number, { length = true } = {}): IterableIterator<number | 'length'> {\n\tif (length) yield 'length'\n\tyield i\n}\nexport abstract class Indexer extends Array {\n\tget(i: number): any {\n\t\tdependant(this, i)\n\t\treturn reactive(this[i])\n\t}\n\t// Returns undefined intentionally: signals the proxy handler that notifications\n\t// were already dispatched via touched(), preventing double notification\n\tset(i: number, value: any) {\n\t\tconst added = i >= this.length\n\t\tthis[i] = value\n\t\ttouched(this, { type: 'set', prop: i }, index(i, { length: added }))\n\t}\n}\nconst indexLess = { get: FoolProof.get, set: FoolProof.set }\n// Fast numeric-string check: first char is a digit (0-9)\nfunction asIndex(prop: string): number {\n\tconst c = prop.charCodeAt(0)\n\tif (c < 48 || c > 57) return -1 // not 0-9\n\tconst n = +prop // coerce — faster than parseInt, handles \"0\", \"12\", etc.\n\treturn n === (n | 0) && n >= 0 ? n : -1\n}\nObject.assign(FoolProof, {\n\tget(obj: any, prop: any, receiver: any) {\n\t\tif (Array.isArray(obj) && typeof prop === 'string') {\n\t\t\tconst i = asIndex(prop)\n\t\t\tif (i >= 0) return Indexer.prototype.get.call(obj, i)\n\t\t}\n\t\treturn indexLess.get(obj, prop, receiver)\n\t},\n\tset(obj: any, prop: any, value: any, receiver: any) {\n\t\tif (Array.isArray(obj) && typeof prop === 'string') {\n\t\t\tconst i = asIndex(prop)\n\t\t\tif (i >= 0) return Indexer.prototype.set.call(obj, i, value)\n\t\t}\n\t\treturn indexLess.set(obj, prop, value, receiver)\n\t},\n})\n\nexport abstract class ReactiveArray extends Array {\n\ttoJSON() {\n\t\treturn this\n\t}\n}\n/**\n * This is a wrapper class for Array that adds reactive behavior.\n * It extends Array and overrides methods to add reactive behavior, while making sure that the internal representation is not reactive.\n */\nexport abstract class ReactiveArrayWrapper extends Array {\n\tat(index: number): any {\n\t\treturn reactive(super.at(index))\n\t}\n\n\tconcat(...items: any[]): any[] {\n\t\treturn reactive(super.concat(...items.map(unwrap)))\n\t}\n\n\tentries(): any {\n\t\tdependant(this, keysOf)\n\t\treturn makeReactiveEntriesIterator(super.entries())\n\t}\n\n\tevery<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): this is S[]\n\tevery(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): boolean\n\tevery(predicate: (value: any, index: number, array: any[]) => any, thisArg?: any): any {\n\t\treturn super.every((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\t@atomic\n\tfill(value: any, start?: number, end?: number): this {\n\t\treturn super.fill(unwrap(value), start, end) as this\n\t}\n\n\t@atomic\n\tcopyWithin(target: number, start: number, end?: number): this {\n\t\treturn super.copyWithin(target, start, end) as this\n\t}\n\n\tfilter<S>(predicate: (value: any, index: number, array: any[]) => value is S, thisArg?: any): S[]\n\tfilter(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any[]\n\tfilter(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any {\n\t\treturn reactive(super.filter((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg))\n\t}\n\n\tfind<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfind(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): any | undefined\n\tfind(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any {\n\t\treturn reactive(super.find((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg))\n\t}\n\n\tfindIndex(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn super.findIndex((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\tfindLast<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfindLast(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): any | undefined\n\tfindLast(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any {\n\t\treturn reactive(\n\t\t\tsuper.findLast((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t\t)\n\t}\n\n\tfindLastIndex(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn super.findLastIndex((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\tflat(depth?: number): any[] {\n\t\treturn reactive(super.flat(depth))\n\t}\n\n\tflatMap(callbackfn: (value: any, index: number, array: any[]) => any, thisArg?: any): any[] {\n\t\treturn reactive(\n\t\t\tsuper.flatMap((v, i, a) => unwrap(callbackfn.call(thisArg, reactive(v), i, a)), thisArg)\n\t\t)\n\t}\n\n\tforEach(callbackfn: (value: any, index: number, array: any[]) => void, thisArg?: any): void {\n\t\tsuper.forEach((v, i, a) => {\n\t\t\tcallbackfn.call(thisArg, reactive(v), i, a)\n\t\t}, thisArg)\n\t}\n\n\tincludes(searchElement: any, fromIndex?: number): boolean {\n\t\treturn arguments.length > 1\n\t\t\t? super.includes(unwrap(searchElement), fromIndex)\n\t\t\t: super.includes(unwrap(searchElement))\n\t}\n\n\tindexOf(searchElement: any, fromIndex?: number): number {\n\t\treturn arguments.length > 1\n\t\t\t? super.indexOf(unwrap(searchElement), fromIndex)\n\t\t\t: super.indexOf(unwrap(searchElement))\n\t}\n\n\tjoin(separator?: string): string {\n\t\treturn super.join(separator)\n\t}\n\n\tkeys(): any {\n\t\tdependant(this, 'length')\n\t\treturn super.keys()\n\t}\n\n\tlastIndexOf(searchElement: any, fromIndex?: number): number {\n\t\treturn arguments.length > 1\n\t\t\t? super.lastIndexOf(unwrap(searchElement), fromIndex)\n\t\t\t: super.lastIndexOf(unwrap(searchElement))\n\t}\n\n\tmap<U>(callbackfn: (value: any, index: number, array: any[]) => U, thisArg?: any): U[] {\n\t\treturn reactive(\n\t\t\tsuper.map((v, i, a) => unwrap(callbackfn.call(thisArg, reactive(v), i, a)), thisArg)\n\t\t)\n\t}\n\n\t@atomic\n\tpop(): any {\n\t\treturn reactive(super.pop())\n\t}\n\n\t@atomic\n\tpush(...items: any[]): number {\n\t\treturn super.push(...items.map(unwrap))\n\t}\n\n\treduce(\n\t\tcallbackfn: (acc: any, value: any, index: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn reactive(\n\t\t\targuments.length > 1\n\t\t\t\t? super.reduce((acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)), initialValue)\n\t\t\t\t: super.reduce((acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)))\n\t\t)\n\t}\n\n\treduceRight(\n\t\tcallbackfn: (acc: any, value: any, index: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn reactive(\n\t\t\targuments.length > 1\n\t\t\t\t? super.reduceRight(\n\t\t\t\t\t\t(acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)),\n\t\t\t\t\t\tinitialValue\n\t\t\t\t\t)\n\t\t\t\t: super.reduceRight((acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)))\n\t\t)\n\t}\n\n\t@atomic\n\treverse(): any[] {\n\t\treturn reactive(super.reverse())\n\t}\n\n\t@atomic\n\tshift(): any {\n\t\treturn reactive(super.shift())\n\t}\n\n\tslice(start?: number, end?: number): any[] {\n\t\treturn reactive(super.slice(start, end))\n\t}\n\n\tsome<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): this is S[]\n\tsome(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): boolean\n\tsome(predicate: (value: any, index: number, array: any[]) => any, thisArg?: any): any {\n\t\treturn super.some((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\t@atomic\n\tsort(compareFn?: (a: any, b: any) => number): this {\n\t\tconst wrappedCompare = compareFn\n\t\t\t? (a: any, b: any) => compareFn(reactive(a), reactive(b))\n\t\t\t: undefined\n\t\treturn super.sort(wrappedCompare) as this\n\t}\n\n\t@atomic\n\tsplice(start: number, deleteCount?: number, ...items: any[]): any {\n\t\tif (arguments.length > 2)\n\t\t\treturn reactive(super.splice(start, deleteCount!, ...items.map(unwrap)))\n\t\tif (arguments.length === 2) return reactive(super.splice(start, deleteCount!))\n\t\tif (arguments.length === 1) return reactive(super.splice(start))\n\t\treturn reactive([])\n\t}\n\n\t@atomic\n\tunshift(...items: any[]): number {\n\t\treturn super.unshift(...items.map(unwrap))\n\t}\n\n\tvalues(): any {\n\t\tdependant(this, keysOf)\n\t\treturn makeReactiveIterator(super.values())\n\t}\n\n\t[Symbol.iterator](): any {\n\t\tdependant(this, keysOf)\n\t\treturn makeReactiveIterator(super[Symbol.iterator]())\n\t}\n\n\ttoReversed(): any[] {\n\t\treturn reactive(super.toReversed())\n\t}\n\n\ttoSorted(compareFn?: (a: any, b: any) => number): any[] {\n\t\tconst wrappedCompare = compareFn\n\t\t\t? (a: any, b: any) => compareFn(reactive(a), reactive(b))\n\t\t\t: undefined\n\t\treturn reactive(super.toSorted(wrappedCompare))\n\t}\n\n\ttoSpliced(start: number, deleteCount?: number, ...items: any[]): any {\n\t\tif (arguments.length > 2)\n\t\t\treturn reactive(super.toSpliced(start, deleteCount!, ...items.map(unwrap)))\n\t\tif (arguments.length === 2) return reactive(super.toSpliced(start, deleteCount!))\n\t\tif (arguments.length === 1) return reactive(super.toSpliced(start))\n\t\treturn reactive([...this])\n\t}\n\n\twith(index: number, value: any): any[] {\n\t\treturn reactive(super.with(index, unwrap(value)))\n\t}\n}\n","import { contentRef } from '../utils'\nimport { touched, touched1 } from './change'\nimport { notifyPropertyChange } from './deep-touch'\nimport { batch } from './effects'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './iterator-helpers'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\nimport { keysOf } from './types'\n\n/**\n * Reactive wrapper around JavaScript's WeakMap class\n * Only tracks individual key operations, no size tracking (WeakMap limitation)\n */\nexport abstract class ReactiveWeakMap<K extends object, V> extends WeakMap<K, V> {\n\t// Implement WeakMap interface methods with reactivity\n\tdelete(key: K): boolean {\n\t\tconst hadKey = this.has(key)\n\t\tconst result = super.delete(key)\n\n\t\tif (hadKey) touched1(contentRef(this), { type: 'del', prop: key }, key)\n\n\t\treturn result\n\t}\n\n\tget(key: K): V | undefined {\n\t\tdependant(contentRef(this), key)\n\t\treturn reactive(super.get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(contentRef(this), key)\n\t\treturn super.has(key)\n\t}\n\n\tset(key: K, value: V): this {\n\t\tconst hadKey = this.has(key)\n\t\tconst oldValue = this.get(key)\n\t\tconst reactiveValue = reactive(value)\n\t\tthis.set(key, reactiveValue)\n\n\t\tif (!hadKey || oldValue !== reactiveValue) {\n\t\t\tnotifyPropertyChange(contentRef(this), key, oldValue, reactiveValue, hadKey)\n\t\t}\n\n\t\treturn this\n\t}\n}\n\n/**\n * Reactive wrapper around JavaScript's Map class\n * Tracks size changes, individual key operations, and collection-wide operations\n */\nexport abstract class ReactiveMap<K, V> extends Map<K, V> {\n\t// Implement Map interface methods with reactivity\n\tget size(): number {\n\t\tdependant(this, 'size') // The ReactiveMap instance still goes through proxy\n\t\treturn super.size\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this.size > 0\n\t\tsuper.clear()\n\n\t\tif (hadEntries) {\n\t\t\tconst evolution = { type: 'bunch', method: 'clear' } as const\n\t\t\t// Clear triggers all effects since all keys are affected\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t\ttouched(contentRef(this), evolution)\n\t\t\t})\n\t\t}\n\t}\n\n\tentries(): Generator<[K, V]> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveEntriesIterator(this.entries())\n\t}\n\n\tforEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tdependant(contentRef(this))\n\t\tthis.forEach(callbackfn, thisArg)\n\t}\n\n\tkeys(): MapIterator<K> {\n\t\tdependant(contentRef(this), keysOf)\n\t\treturn this.keys()\n\t}\n\n\tvalues(): Generator<V> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveIterator(this.values())\n\t}\n\n\t[Symbol.iterator](): MapIterator<[K, V]> {\n\t\tdependant(contentRef(this))\n\t\tconst it: MapIterator<[K, V]> = Map.prototype[Symbol.iterator].call(this)\n\t\tconst nativeNext = it.next.bind(it)\n\t\tit.next = () => {\n\t\t\tconst result = nativeNext()\n\t\t\tif (result.done) return result\n\t\t\tconst [key, value] = result.value\n\t\t\treturn { value: [reactive(key), reactive(value)], done: false }\n\t\t}\n\t\treturn it\n\t}\n\n\t// Implement Map methods with reactivity\n\tdelete(key: K): boolean {\n\t\tconst hadKey = this.has(key)\n\t\tconst result = super.delete(key)\n\n\t\tif (hadKey) {\n\t\t\tconst evolution = { type: 'del', prop: key } as const\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(contentRef(this), evolution, key)\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\n\t\treturn result\n\t}\n\n\tget(key: K): V | undefined {\n\t\tdependant(contentRef(this), key)\n\t\treturn reactive(super.get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(contentRef(this), key)\n\t\treturn super.has(key)\n\t}\n\n\tset(key: K, value: V): this {\n\t\tconst hadKey = this.has(key)\n\t\tconst oldValue = this.get(key)\n\t\tconst reactiveValue = reactive(value)\n\t\tsuper.set(key, reactiveValue)\n\n\t\tif (!hadKey || oldValue !== reactiveValue) {\n\t\t\tbatch(() => {\n\t\t\t\tnotifyPropertyChange(contentRef(this), key, oldValue, reactiveValue, hadKey)\n\t\t\t\t// Also notify size change for Map (WeakMap doesn't track size)\n\t\t\t\tconst evolution = { type: hadKey ? 'set' : 'add', prop: key } as const\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\n\t\treturn this\n\t}\n}\n","import { contentRef } from '../utils'\nimport { touched, touched1 } from './change'\nimport { batch } from './effects'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './iterator-helpers'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\n\n/**\n * Reactive wrapper around JavaScript's WeakSet class\n * Only tracks individual value operations, no size tracking (WeakSet limitation)\n */\nexport abstract class ReactiveWeakSet<T extends object> extends WeakSet<T> {\n\tadd(value: T): this {\n\t\tconst had = this.has(value)\n\t\tsuper.add(value)\n\t\tif (!had) {\n\t\t\t// touch the specific value and the collection view\n\t\t\ttouched1(contentRef(this), { type: 'add', prop: value }, value)\n\t\t\t// no size/allProps for WeakSet\n\t\t}\n\t\treturn this\n\t}\n\n\tdelete(value: T): boolean {\n\t\tconst had = this.has(value)\n\t\tconst res = super.delete(value)\n\t\tif (had) touched1(contentRef(this), { type: 'del', prop: value }, value)\n\t\treturn res\n\t}\n\n\thas(value: T): boolean {\n\t\tdependant(contentRef(this), value)\n\t\treturn super.has(value)\n\t}\n}\n\n/**\n * Reactive wrapper around JavaScript's Set class\n * Tracks size changes, individual value operations, and collection-wide operations\n */\nexport abstract class ReactiveSet<T> extends Set<T> {\n\tget size(): number {\n\t\t// size depends on the wrapper instance, like Map counterpart\n\t\tdependant(this, 'size')\n\t\treturn this.size\n\t}\n\n\tadd(value: T): this {\n\t\tconst had = this.has(value)\n\t\tconst reactiveValue = reactive(value)\n\t\tsuper.add(reactiveValue)\n\t\tif (!had) {\n\t\t\tconst evolution = { type: 'add', prop: reactiveValue } as const\n\t\t\t// touch for value-specific and aggregate dependencies\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(contentRef(this), evolution, reactiveValue)\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\t\treturn this\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this.size > 0\n\t\tsuper.clear()\n\t\tif (hadEntries) {\n\t\t\tconst evolution = { type: 'bunch', method: 'clear' } as const\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t\ttouched(contentRef(this), evolution)\n\t\t\t})\n\t\t}\n\t}\n\n\tdelete(value: T): boolean {\n\t\tconst had = this.has(value)\n\t\tconst res = super.delete(value)\n\t\tif (had) {\n\t\t\tconst evolution = { type: 'del', prop: value } as const\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(contentRef(this), evolution, value)\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\t\treturn res\n\t}\n\n\thas(value: T): boolean {\n\t\tdependant(contentRef(this), value)\n\t\treturn this.has(value)\n\t}\n\n\tentries(): Generator<[T, T]> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveEntriesIterator(this.entries())\n\t}\n\n\tforEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void {\n\t\tdependant(contentRef(this))\n\t\tthis.forEach(callbackfn, thisArg)\n\t}\n\n\tkeys(): Generator<T> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveIterator(this.keys())\n\t}\n\n\tvalues(): Generator<T> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveIterator(this.values())\n\t}\n\n\t[Symbol.iterator](): SetIterator<T> {\n\t\tdependant(contentRef(this))\n\t\tconst it: SetIterator<T> = Set.prototype[Symbol.iterator].call(this)\n\t\tconst nativeNext = it.next.bind(it)\n\t\tit.next = () => {\n\t\t\tconst result = nativeNext()\n\t\t\tif (result.done) return result\n\t\t\treturn { value: reactive(result.value), done: false }\n\t\t}\n\t\treturn it\n\t}\n}\n","export { attend, lift, morph, morph as project } from './buffer'\nexport { getState, touched, touched1 } from './change'\nexport { deepWatch } from './deep-watch'\nexport { effectAggregator, getActiveEffect, link, unlink } from './effect-context'\nexport {\n\taddBatchCleanup,\n\tatom,\n\tatomic,\n\t//batch, - NEVER export batch, it deals with EffectTriggers who are internal types - mutts consumers use `atomic` or `atom`\n\tbiDi,\n\tcaptured,\n\tcaught,\n\tdefer,\n\teffect,\n\tgetActivationLog,\n\tonEffectThrow,\n\treset,\n\troot,\n\tuntracked,\n} from './effects'\nexport { type Memoizable, type MemoizableArgument, memoize } from './memoize'\nexport { addUnreactiveProps, isNonReactive } from './non-reactive'\nexport { ReactiveBase, reactive } from './proxy'\nexport { organize, organized } from './record'\nexport { type Resource, resource, unreactive, watch, when } from './satellite'\nexport { assertUntracked } from './tracking'\nexport {\n\ttype CleanupReason,\n\tdebugPreset,\n\tdevPreset,\n\ttype EffectAccess,\n\ttype EffectCleanup,\n\ttype EffectCloser,\n\ttype EffectOptions,\n\ttype EffectTrigger,\n\ttype Evolution,\n\tformatCleanupReason,\n\tisReactive,\n\tobjectToProxy,\n\toptions as reactiveOptions,\n\ttype PropTrigger,\n\tprodPreset,\n\tproxyToObject,\n\tReactiveError,\n\tReactiveErrorCode,\n\ttype ScopedCallback,\n\tunwrap,\n} from './types'\n\nimport { ReactiveArray, ReactiveArrayWrapper } from './array'\nimport {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n} from './deep-watch-state'\nimport { ReactiveMap, ReactiveWeakMap } from './map'\nimport { metaProtos, wrapProtos } from './proxy'\nimport { effectToReactiveObjects, watchers } from './registry'\nimport { ReactiveSet, ReactiveWeakSet } from './set'\nimport { objectToProxy, proxyToObject } from './types'\n\n// Register native collection types to use specialized reactive wrappers\nmetaProtos.set(Array, ReactiveArray.prototype)\nmetaProtos.set(Set, ReactiveSet.prototype)\nmetaProtos.set(WeakSet, ReactiveWeakSet.prototype)\nmetaProtos.set(Map, ReactiveMap.prototype)\nmetaProtos.set(WeakMap, ReactiveWeakMap.prototype)\nwrapProtos.set(Array, ReactiveArrayWrapper.prototype)\n\n/**\n * Object containing internal reactive system state for debugging and profiling\n */\nexport const profileInfo: any = {\n\tobjectToProxy,\n\tproxyToObject,\n\teffectToReactiveObjects,\n\twatchers,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n}\n","import { decorator, type GenericClassDecorator } from './decorator'\nimport { flavored } from './flavored'\nimport { options } from './reactive/types'\n\n// In order to avoid async re-entrance, we could use zone.js or something like that.\nconst syncCalculating: { object: object; prop: PropertyKey }[] = []\n/**\n * Decorator that caches the result of a getter method and only recomputes when dependencies change\n * Prevents circular dependencies and provides automatic cache invalidation\n */\nexport const cached = decorator({\n\tgetter(original, _target, propertyKey) {\n\t\treturn function (this: any) {\n\t\t\tconst alreadyCalculating = syncCalculating.findIndex(\n\t\t\t\t(c) => c.object === this && c.prop === propertyKey\n\t\t\t)\n\t\t\tif (alreadyCalculating > -1)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Circular dependency detected: ${syncCalculating\n\t\t\t\t\t\t.slice(alreadyCalculating)\n\t\t\t\t\t\t.map((c) => `${c.object.constructor.name}.${String(c.prop)}`)\n\t\t\t\t\t\t.join(' -> ')} -> again`\n\t\t\t\t)\n\t\t\tsyncCalculating.push({ object: this, prop: propertyKey })\n\t\t\ttry {\n\t\t\t\tconst rv = original.call(this)\n\t\t\t\tcache(this, propertyKey, rv)\n\t\t\t\treturn rv\n\t\t\t} finally {\n\t\t\t\tsyncCalculating.pop()\n\t\t\t}\n\t\t}\n\t},\n})\n\n/**\n * Checks if a property is cached (has a cached value)\n * @param object - The object to check\n * @param propertyKey - The property key to check\n * @returns True if the property has a cached value\n */\nexport function isCached(object: Object, propertyKey: PropertyKey) {\n\treturn !!Object.getOwnPropertyDescriptor(object, propertyKey)\n}\n\n/**\n * Caches a value for a property on an object\n * @param object - The object to cache the value on\n * @param propertyKey - The property key to cache\n * @param value - The value to cache\n */\nexport function cache(object: Object, propertyKey: PropertyKey, value: any) {\n\tObject.defineProperty(object, propertyKey, { value })\n}\n\n/**\n * Creates a decorator that modifies property descriptors for specified properties\n * @param descriptor - The descriptor properties to apply\n * @returns A class decorator that applies the descriptor to specified properties\n */\nexport const descriptor = flavored(\n\tfunction descriptor(descriptor: {\n\t\tenumerable?: boolean\n\t\tconfigurable?: boolean // Not modifiable once the property has been defined\n\t\twritable?: boolean\n\t}) {\n\t\treturn <T>(...properties: (keyof T)[]): GenericClassDecorator<T> =>\n\t\t\t(Base) => {\n\t\t\t\treturn class extends Base {\n\t\t\t\t\tconstructor(...args: any[]) {\n\t\t\t\t\t\tsuper(...args)\n\t\t\t\t\t\tfor (const key of properties) {\n\t\t\t\t\t\t\tconst existing = Object.getOwnPropertyDescriptor(this, key)\n\t\t\t\t\t\t\tObject.defineProperty(this, key, Object.assign(existing || {}, descriptor))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t},\n\t{\n\t\t/**\n\t\t * enumerable: true\n\t\t */\n\t\tget enumerable() {\n\t\t\treturn descriptor({ enumerable: true })\n\t\t},\n\t\t/**\n\t\t * enumerable: false\n\t\t */\n\t\tget hidden() {\n\t\t\treturn descriptor({ enumerable: false })\n\t\t},\n\t\t/**\n\t\t * configurable: true\n\t\t */\n\t\tget configurable() {\n\t\t\treturn descriptor({ configurable: true })\n\t\t},\n\t\t/**\n\t\t * configurable: false\n\t\t */\n\t\tget frozen() {\n\t\t\treturn descriptor({ configurable: false })\n\t\t},\n\t\t/**\n\t\t * writable: true\n\t\t */\n\t\tget writable() {\n\t\t\treturn descriptor({ writable: true })\n\t\t},\n\t\t/**\n\t\t * writable: false\n\t\t */\n\t\tget readonly() {\n\t\t\treturn descriptor({ writable: false })\n\t\t},\n\t}\n)\n\n/**\n * Decorator that marks methods, properties, or classes as deprecated\n * Provides warning messages when deprecated items are used\n */\nexport const deprecated = Object.assign(\n\tdecorator({\n\t\tmethod(original, _target, propertyKey) {\n\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\tdeprecated.warn(this, propertyKey)\n\t\t\t\treturn original.apply(this, args)\n\t\t\t}\n\t\t},\n\t\tgetter(original, _target, propertyKey) {\n\t\t\treturn function (this: any) {\n\t\t\t\tdeprecated.warn(this, propertyKey)\n\t\t\t\treturn original.call(this)\n\t\t\t}\n\t\t},\n\t\tsetter(original, _target, propertyKey) {\n\t\t\treturn function (this: any, value: any) {\n\t\t\t\tdeprecated.warn(this, propertyKey)\n\t\t\t\treturn original.call(this, value)\n\t\t\t}\n\t\t},\n\t\tclass(original) {\n\t\t\treturn class extends original {\n\t\t\t\tconstructor(...args: any[]) {\n\t\t\t\t\tsuper(...args)\n\t\t\t\t\tdeprecated.warn(this, 'constructor')\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\tdefault(message: string) {\n\t\t\treturn decorator({\n\t\t\t\tmethod(original, _target, propertyKey) {\n\t\t\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\t\t\tdeprecated.warn(this, propertyKey, message)\n\t\t\t\t\t\treturn original.apply(this, args)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tgetter(original, _target, propertyKey) {\n\t\t\t\t\treturn function (this: any) {\n\t\t\t\t\t\tdeprecated.warn(this, propertyKey, message)\n\t\t\t\t\t\treturn original.call(this)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tsetter(original, _target, propertyKey) {\n\t\t\t\t\treturn function (this: any, value: any) {\n\t\t\t\t\t\tdeprecated.warn(this, propertyKey, message)\n\t\t\t\t\t\treturn original.call(this, value)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tclass(original) {\n\t\t\t\t\treturn class extends original {\n\t\t\t\t\t\tconstructor(...args: any[]) {\n\t\t\t\t\t\t\tsuper(...args)\n\t\t\t\t\t\t\tdeprecated.warn(this, 'constructor', message)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\t\t},\n\t}),\n\t{\n\t\twarn: (target: any, propertyKey: PropertyKey, message?: string) => {\n\t\t\toptions.warn(\n\t\t\t\t`${target.constructor.name}.${String(propertyKey)} is deprecated${message ? `: ${message}` : ''}`\n\t\t\t)\n\t\t},\n\t}\n)\n\n/**\n * Creates a debounced method decorator that delays execution until after the delay period has passed\n * @param delay - The delay in milliseconds\n * @returns A method decorator that debounces method calls\n */\nexport function debounce(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _target, _propertyKey) {\n\t\t\tlet timeoutId: ReturnType<typeof setTimeout> | null = null\n\n\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\t// Clear existing timeout\n\t\t\t\tif (timeoutId) {\n\t\t\t\t\tclearTimeout(timeoutId)\n\t\t\t\t}\n\n\t\t\t\t// Set new timeout\n\t\t\t\ttimeoutId = setTimeout(() => {\n\t\t\t\t\toriginal.apply(this, args)\n\t\t\t\t\ttimeoutId = null\n\t\t\t\t}, delay)\n\t\t\t}\n\t\t},\n\t})\n}\n\n/**\n * Creates a throttled method decorator that limits execution to once per delay period\n * @param delay - The delay in milliseconds\n * @returns A method decorator that throttles method calls\n */\nexport function throttle(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _target, _propertyKey) {\n\t\t\tlet lastCallTime = 0\n\t\t\tlet timeoutId: ReturnType<typeof setTimeout> | null = null\n\n\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\tconst now = Date.now()\n\n\t\t\t\t// If enough time has passed since last call, execute immediately\n\t\t\t\tif (now - lastCallTime >= delay) {\n\t\t\t\t\t// Clear any pending timeout since we're executing now\n\t\t\t\t\tif (timeoutId) {\n\t\t\t\t\t\tclearTimeout(timeoutId)\n\t\t\t\t\t\ttimeoutId = null\n\t\t\t\t\t}\n\t\t\t\t\tlastCallTime = now\n\t\t\t\t\treturn original.apply(this, args)\n\t\t\t\t}\n\n\t\t\t\t// Otherwise, schedule execution for when the delay period ends\n\t\t\t\tif (!timeoutId) {\n\t\t\t\t\tconst remainingTime = delay - (now - lastCallTime)\n\t\t\t\t\tconst scheduledArgs = [...args] // Capture args at scheduling time\n\t\t\t\t\ttimeoutId = setTimeout(() => {\n\t\t\t\t\t\tlastCallTime = Date.now()\n\t\t\t\t\t\toriginal.apply(this, scheduledArgs)\n\t\t\t\t\t\ttimeoutId = null\n\t\t\t\t\t}, remainingTime)\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t})\n}\n","export * from './async'\nexport * from './decorator'\nexport * from './destroyable'\nexport * from './diff'\nexport * from './eventful'\nexport * from './flavored'\nexport * from './indexable'\nexport * from './iterableWeak'\nexport * from './mixins'\nexport * from './promiseChain'\nexport * from './reactive'\nexport * from './std-decorators'\nexport {\n\tarrayEquals,\n\tdeepCompare,\n\tisConstructor,\n\tisDev,\n\tisObject,\n\tisProd,\n\tisTest,\n\tnamed,\n\ttag,\n\tzip,\n} from './utils'\nexport * from './zone'\n\n// Important: let it here!\nimport pkg from '../package.json'\n\nconst { version } = pkg\n\nconst GLOBAL_MUTTS_KEY = '__MUTTS_INSTANCE__'\nconst globalScope = (\n\ttypeof globalThis !== 'undefined'\n\t\t? globalThis\n\t\t: typeof window !== 'undefined'\n\t\t\t? window\n\t\t\t: typeof global !== 'undefined'\n\t\t\t\t? global\n\t\t\t\t: false\n) as any\nif (globalScope) {\n\tlet source = 'mutts/index'\n\ttry {\n\t\tif (typeof __filename !== 'undefined') source = __filename\n\t\telse if (typeof import.meta !== 'undefined' && import.meta.url) {\n\t\t\tsource = import.meta.url\n\t\t}\n\t} catch (_e) {}\n\n\tconst currentSourceInfo = { version, source, timestamp: Date.now() }\n\n\tif (globalScope[GLOBAL_MUTTS_KEY]) {\n\t\tconst existing = globalScope[GLOBAL_MUTTS_KEY]\n\t\tthrow new Error(\n\t\t\t`[Mutts] Multiple instances detected!\\n` +\n\t\t\t\t`Existing instance: ${JSON.stringify(existing, null, 2)}\\n` +\n\t\t\t\t`New instance: ${JSON.stringify(currentSourceInfo, null, 2)}\\n` +\n\t\t\t\t`This usually happens when 'mutts' is both installed as a dependency and bundled, ` +\n\t\t\t\t`or when different versions are loaded. ` +\n\t\t\t\t`Please check your build configuration (aliases, externals) to ensure a single source of truth.`\n\t\t)\n\t}\n\tglobalScope[GLOBAL_MUTTS_KEY] = currentSourceInfo\n}\n","import { FoolProof } from '../utils'\nimport { attend } from './buffer'\nimport { touched1 } from './change'\nimport { link } from './effect-context'\nimport { reactive } from './proxy'\nimport type { CleanupReason, EffectCloser } from './types'\n\n/**\n * Provides type-safe access to a source object's property within the organized callback.\n * @template Source - The type of the source object\n * @template Key - The type of the property key in the source object\n */\nexport type OrganizedAccess<Source extends Record<PropertyKey, any>, Key extends keyof Source> = {\n\t/** The property key being accessed */\n\treadonly key: Key\n\n\t/**\n\t * Gets the current value of the property from the source object\n\t * @returns The current value of the property\n\t */\n\tget(): Source[Key]\n\n\t/**\n\t * Updates the property value in the source object\n\t * @param value - The new value to set\n\t * @returns {boolean} True if the update was successful\n\t */\n\tset(value: Source[Key]): boolean\n\n\t/**\n\t * The current value of the property (equivalent to using get()/set() directly)\n\t */\n\tvalue: Source[Key]\n}\n\n/**\n * Callback function type for the organized function that processes each source property.\n * @template Source - The type of the source object\n * @template Target - The type of the target object\n */\nexport type OrganizedCallback<Source extends Record<PropertyKey, any>, Target extends object> = <\n\tKey extends keyof Source,\n>(\n\t/**\n\t * Accessor object for the current source property\n\t */\n\taccess: OrganizedAccess<Source, Key>,\n\n\t/**\n\t * The target object where organized data will be stored\n\t */\n\ttarget: Target\n) => EffectCloser | undefined\n\n/**\n * The result type of the organized function, combining the target object with cleanup capability.\n * @template Target - The type of the target object\n */\nexport type OrganizedResult<Target extends object> = Target\n\n/**\n * Organizes a source object's properties into a target object using a callback function.\n * This creates a reactive mapping between source properties and a target object,\n * automatically handling property additions, updates, and removals.\n *\n * @template Source - The type of the source object\n * @template Target - The type of the target object (defaults to Record<PropertyKey, any>)\n *\n * @param {Source} source - The source object to organize\n * @param {OrganizedCallback<Source, Target>} apply - Callback function that defines how each source property is mapped to the target\n * @param {Target} [baseTarget={}] - Optional base target object to use (will be made reactive if not already)\n *\n * @returns {OrganizedResult<Target>} The target object with cleanup capability\n *\n * @example\n * // Organize user permissions into role-based access\n * const user = reactive({ isAdmin: true, canEdit: false });\n * const permissions = organized(\n *   user,\n *   (access, target) => {\n *     if (access.key === 'isAdmin') {\n *       target.hasFullAccess = access.value;\n *     }\n *     target[`can${access.key.charAt(0).toUpperCase() + access.key.slice(1)}`] = access.value;\n *   }\n * );\n *\n * @example\n * // Transform object structure with cleanup\n * const source = reactive({ firstName: 'John', lastName: 'Doe' });\n * const formatted = organized(\n *   source,\n *   (access, target) => {\n *     if (access.key === 'firstName' || access.key === 'lastName') {\n *       target.fullName = `${source.firstName} ${source.lastName}`.trim();\n *     }\n *   }\n * );\n *\n * @example\n * // Using with cleanup in a component\n * effect(() => {\n *   const data = fetchData();\n *   const organizedData = organized(data, (access, target) => {\n *     // Transform data\n *   });\n *\n *   // The cleanup will be called automatically when the effect is disposed\n *   return () => organizedData[cleanup]();\n * });\n */\nexport function organized<\n\tSource extends Record<PropertyKey, any>,\n\tTarget extends object = Record<PropertyKey, any>,\n>(\n\tsource: Source,\n\tapply: OrganizedCallback<Source, Target>,\n\tbaseTarget: Target = {} as Target\n): OrganizedResult<Target> {\n\tconst observedSource = reactive(source) as Source\n\tconst target = reactive(baseTarget) as Target\n\n\tconst stop = attend(\n\t\t() => {\n\t\t\tconst keys: PropertyKey[] = []\n\t\t\tfor (const key in observedSource) keys.push(key)\n\t\t\treturn keys\n\t\t},\n\t\t(key) => {\n\t\t\tconst sourceKey = key as keyof Source\n\t\t\tconst accessBase = {\n\t\t\t\tkey: sourceKey,\n\t\t\t\tget: () => FoolProof.get(observedSource, sourceKey, observedSource),\n\t\t\t\tset: (value: Source[typeof sourceKey]) =>\n\t\t\t\t\tFoolProof.set(observedSource, sourceKey, value, observedSource),\n\t\t\t}\n\t\t\tObject.defineProperty(accessBase, 'value', {\n\t\t\t\tget: accessBase.get,\n\t\t\t\tset: accessBase.set,\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t})\n\t\t\treturn apply(accessBase as OrganizedAccess<Source, typeof sourceKey>, target)\n\t\t}\n\t)\n\n\treturn link(target, (reason?: CleanupReason) => stop(reason)) as OrganizedResult<Target>\n}\n\n/**\n * Organizes a property on a target object\n * Shortcut for defineProperty/delete with touched signal\n * @param target - The target object\n * @param property - The property to organize\n * @param access - The access object\n * @returns The property descriptor\n */\nexport function organize<T>(\n\ttarget: object,\n\tproperty: PropertyKey,\n\taccess: { get?(): T; set?(value: T): boolean }\n) {\n\tObject.defineProperty(target, property, {\n\t\tget: access.get,\n\t\tset: access.set,\n\t\tconfigurable: true,\n\t\tenumerable: true,\n\t})\n\ttouched1(target, { type: 'set', prop: property }, property)\n\treturn () => delete (target as any)[property]\n}\n"],"names":["hooks","Set","asyncHooks","addHook","hook","add","delete","sanitizePromise","p","promiseContexts","WeakMap","captureRestorers","restorers","restorer","wrap","fn","capturedRestorers","args","undoers","restore","push","apply","this","res","then","Promise","resolve","reject","setTimeout","GLOBAL_ORIGINALS","Symbol","for","GLOBAL_PROMISE","originals","OriginalPromise","patchedThen","onFulfilled","onRejected","context","get","nextPromise","call","size","set","PatchedPromise","executor","wrappedResolve","wrappedReject","globalThis","prototype","catch","finally","all","allSettled","race","any","setInterval","setImmediate","requestAnimationFrame","queueMicrotask","Object","assign","value","has","reason","values","onFinally","defineProperty","species","configurable","_e","callback","nativeConstructors","Array","Date","Function","Map","WeakSet","Error","TypeError","ReferenceError","SyntaxError","RangeError","URIError","EvalError","Reflect","Proxy","RegExp","String","Number","Boolean","isConstructor","toString","startsWith","hasNode","Node","FoolProof","obj","prop","receiver","isOwnAccessor","opd","getOwnPropertyDescriptor","deepCompare","a","b","cache","getPrototypeOf","compared","isArray","length","i","getTime","val","found","bVal","key","foundMatch","bKey","keysA","keys","keysB","hasOwn","contentRefs","contentRef","container","seal","create","contentOf","writable","tag","name","defineProperties","toStringTag","named","_mode","process","env","NODE_ENV","undefined","isDev","isProd","isTest","DecoratorError","constructor","message","super","legacyDecorator","description","target","propertyKey","descriptor","class","includes","newGetter","getter","newSetter","setter","newMethod","method","default","modernDecorator","kind","rv","decorator","modern","legacy","contextOrKey","mode","_target","detectDecoratorMode","fr","FinalizationRegistry","f","destructor","allocatedValues","DestructionError","msg","destroyedHandler","throw","allocated","original","arrayDiff","A","B","start","endA","endB","lenA","lenB","indexA","indexB","sliceA","sliceB","slice","maxD","Math","min","vOffset","V","Int32Array","history","d","k","x","y","buildPatches","offset","finalX","finalY","finalD","finalK","ops","prev","prevK","down","prevXEnd","xStart","yStart","patches","currA","currB","patchA","patchB","flush","op","events","eventBehavior","on","eventOrEvents","cb","e","callbacks","off","emit","event","perEvent","eventful","fct","use","cached","flavored","flavors","flavorOptions","defaultOptions","opts","targetIndex","optionsIndex","newArgs","currentOptions","isObject","_a","getAt","setAt","forwardArray","ArrayReadForward","iterator","map","callbackfn","thisArg","filter","predicate","reduce","initialValue","reduceRight","forEach","find","findIndex","findLast","findLastIndex","searchElement","fromIndex","indexOf","lastIndexOf","end","concat","items","every","some","join","separator","entries","toLocaleString","locales","options","at","index","flat","depth","flatMap","toReversed","reverse","toSorted","compareFn","sort","toSpliced","deleteCount","with","unscopables","IterableWeakMap","uuids","refs","registry","uuid","v","createIterator","keyRef","deref","clear","unregister","crypto","randomUUID","WeakRef","register","_value","_key","IterableWeakSet","_b","union","other","others","that","intersection","difference","symmetricDifference","isSubsetOf","isSupersetOf","isDisjointFrom","mixin","mixinFunction","unwrapFunction","mixinCache","MixedBase","_thisArg","baseClass","usedBase","ProxiedBaseClass","originalPrototype","proxiedPrototype","setPrototypeOf","mixedClass","forward","alreadyChained","promiseProxyHandler","chainPromise","r","promiseForward","objectProxyHandler","chainObject","given","chainable","t","chained","debugHooks","stack","isu","z","AZone","enter","active","leave","entered","root","zoned","Zone","ZoneHistory","controlled","self","present","getOwnPropertyDescriptors","added","ZoneAggregator","zones","_ZoneAggregator_zones","__classPrivateFieldGet","asyncZone","zone","rootFunctionSymbol","effectToReactiveObjects","watchers","effectNodes","getEffectNode","effect","node","reverseRoots","markWithRoot","existingRef","existing","rootName","existingName","fnName","getRoot","effectHistory","effectAggregator","isRunning","getActiveEffect","cleanups","link","cleanupFns","effectMarker","formatTrigger","evolution","dependency","touch","detail","type","parts","unreactiveProperties","allProps","keysOf","ReactiveErrorCode","ReactiveError","debugInfo","code","cause","_effect","chain","_targets","_caller","beginChain","endChain","garbageCollected","_fn","touched","_obj","_evolution","_props","_deps","skipRunningEffect","effectRun","_reaction","maxEffectChain","maxTriggerPerBatch","maxEffectReaction","onMemoizationDiscrepancy","cycleHandling","isVerificationRun","maxDeepWatchDepth","instanceMembers","ignoreAccessors","recursiveTouching","asyncMode","warn","introspection","gatherReasons","lineages","logErrors","enableHistory","historySize","optionCall","error","prodPreset","devPreset","objectToProxy","proxyToObject","unwrap","isReactive","activationRegistry","dependencyStacks","assertUntrackedFlag","getDependencyStack","objStacks","dependant","currentActiveEffect","dependencyHook","objectWatchers","deps","effectObjects","lineageConfig","propStacks","findCycleInChain","roots","seen","formatRoots","limit","names","activationLog","recordActivation","effectData","objData","count","unshift","pop","MaxReactionExceeded","caught","onThrow","catchers","onEffectThrow","effectTriggers","effectTriggeredBy","causesClosure","consequencesClosure","broken","getOrCreateClosure","closure","hasPathExcluding","exclude","visited","queue","current","shift","triggers","next","batchStack","hasBatched","bs","executingStack","decrementInDegreesForExecuted","batch","executedRoot","consequences","consequenceRoot","currentDegree","inDegrees","findPath","startRoot","endRoot","path","newPath","targetRoot","result","getCyclePathForEdge","callerRoot","addToBatch","caller","immediate","currentBatch","pendingTriggers","nextReason","mergePropChange","into","from","reasons","stopped","targetConsequences","wouldCreateCycle","cyclePath","cycleMessage","causalChain","lineage","creationStack","CycleDetected","cycle","details","newTriggers","triggeredBy","uConsequences","vCauses","uCausesSet","vConsequencesSet","xConsequences","addGraphEdge","addBatchCleanup","cleanup","deferreds","defer","findCycle","recursionStack","cycleStart","executeNext","effectuatedRoots","nextEffect","nextRoot","first","getCyclePath","consequence","consequenceConsequences","BrokenEffects","isNewBatch","success","firstReturn","activeEffect","activeRoot","inDegree","causes","causeRoot","computeAllInDegrees","trace","queued","MaxDepthExceeded","queuedCount","deferred","atomic","atomicEffect","captured","effectOptions","runEffect","prevCleanup","untracked","runningPromise","cancelPrevious","abort","effectStopped","reactionCleanup","cleanupReaction","toCleanup","access","reaction","thrower","catches","parent","parentNode","forwardThrow","errorToThrow","tracked","originalPromise","cancelReject","cancelPromise","_","cancelError","reactiveObj","children","childReason","childCleanup","ascended","abortController","ascend","signal","AbortController","opaque","isOpaque","stopEffect","rootCauses","rootConsequences","sourceRoot","causeConsequences","consequenceCauses","yCauses","cleanupEffectFromGraph","callIfCollected","subEffectCleanup","objectParents","objectsWithDeepWatchers","deepWatcherCount","deepWatchers","effectToDeepWatchedObjects","addBackReference","child","parents","removeBackReference","entry","needsBackReferences","hasParentWithDeepWatchers","bubbleUpChange","changedObject","parentDeepWatchers","touchLineage","watcher","dependencyStack","states","addState","state","getState","collectEffects","effects","keyChains","sourceEffect","touched1","props","structural","absent","addUnreactiveProps","proto","isUnreactiveProp","marker","nonReactiveClass","cls","c","isNonReactive","getPrototypeToken","shouldRecurseTouch","oldValue","newValue","notifyPropertyChange","targetObj","hadProperty","origin","changes","recursiveTouch","oldRef","newRef","oldMap","objects","migrateWatchers","notifications","combinedEffects","effectCauses","allowedEffects","originWatchers","originEffects","notification","currentEffects","propsArray","filteredEffects","associated","hasAncestorInSet","dispatchNotifications","gather","touchedOpaque","collectObjectKeys","ownKeys","oldObj","newObj","mapped","hasVisitedPair","oldArray","newArray","_visited","local","oldLength","newLength","max","hasOld","hasNew","oldEntry","newEntry","is","diffArrayElements","oldKeys","newKeys","diffObjectProperties","allowedSet","window","o","nonReactive","document","Element","HTMLElement","EventTarget","HTMLCollection","NodeList","metaProtos","wrapProtos","arrayLengths","hasReentry","subsRegister","internalUntracked","reactiveHandlers","metaProto","desc","ownDesc","wrapProto","isOwnProp","shouldIgnoreAccessor","hasProp","owner","raw","isInheritedAccess","reactiveValue","reactiveObject","unwrapped","enumerable","oldVal","isArrayLength","deleteProperty","reactiveClasses","ReactiveBase","base","reactive","anyTarget","subProxy","getExistingProxy","proxy","storeProxyRelationship","Reactive","attend","source","enumerate","keyEffects","outer","stop","morphRecord","pure","track","itemEffects","stopItem","computeItem","_cache","stateSnapshot","stopMain","morph","input","indexRef","n","NaN","isNaN","newInput","diffs","diff","idx","_entry","newIdx","splice","fill","invalidates","morphArray","morphMap","_opt","deepWatch","wrappedCallback","traverseAndTrack","memoizedRegistry","wrapperRegistry","getBranch","tree","branches","branch","memoizeFunction","fnRoot","cacheRoot","memoized","arg","lenient","wasVerification","fresh","makeMemoizeDecorator","memoizeOpts","wrapper","origRoot","originalGetter","_receiver","memoizeObject","memoize","unsetYet","watch","changed","deep","deepCleanup","cbCleanup","old","watchCallBack","watchObject","unreactive","arg1","parentMarker","makeReactiveIterator","done","makeReactiveEntriesIterator","Indexer","indexLess","asIndex","charCodeAt","ReactiveArrayWrapper","_classSuper","copyWithin","arguments","acc","wrappedCompare","_fill_decorators","_pop_decorators","_push_decorators","_shift_decorators","_sort_decorators","_unshift_decorators","__runInitializers","_instanceExtraInitializers","__esDecorate","static","private","metadata","_metadata","_copyWithin_decorators","_reverse_decorators","_splice_decorators","ReactiveWeakMap","hadKey","ReactiveMap","hadEntries","it","nativeNext","bind","ReactiveWeakSet","had","ReactiveSet","toJSON","profileInfo","syncCalculating","alreadyCalculating","object","properties","Base","hidden","frozen","readonly","deprecated","version","pkg","GLOBAL_MUTTS_KEY","globalScope","global","__filename","url","location","require","pathToFileURL","href","_documentCurrentScript","tagName","toUpperCase","src","URL","baseURI","currentSourceInfo","timestamp","now","JSON","stringify","destructorObj","destroy","destructors","getOwnPropertyNames","isDestroyable","myDestructor","destruction","accessor","Indexable","getLength","numProp","setLength","len","received","programmaticallySetValue","pValue","called","transform","delay","_propertyKey","timeoutId","clearTimeout","formatCleanupReason","indent","repeat","rawResult","liftCleanup","sourceProto","newDesc","oldDesc","sameAccessor","property","baseTarget","observedSource","sourceKey","accessBase","fetcher","resource","loading","latest","reload","reloadSignal","counter","load","creation","lazyInit","id","promise","err","lastCallTime","remainingTime","scheduledArgs","unlink","timeout","timer","maxLength","arr","tuple"],"mappings":"2SAIO,MAAMA,EAAQ,IAAIC,IAEZC,EAAa,CACzBC,QAAQC,IACPJ,EAAMK,IAAID,GACH,IAAMJ,EAAMM,OAAOF,IAO3BG,gBAAgBC,GACRA,GCfHC,EAAkB,IAAIC,QAkB5B,SAASC,IACR,MAAMC,EAAY,IAAIX,IACtB,IAAK,MAAMG,KAAQJ,EAAO,CACzB,MAAMa,EAAWT,IACbS,GAAUD,EAAUP,IAAIQ,EAC7B,CACA,OAAOD,CACR,CAEA,SAASE,EACRC,EACAC,GAEA,GAAkB,mBAAPD,EAAmB,OAAOA,EACrC,MAAMH,EAAYI,GAAqBL,IACvC,OAAO,YAAwBM,GAC9B,MAAMC,EAA0B,GAChC,IAAK,MAAMC,KAAWP,EAAWM,EAAQE,KAAKD,KAC9C,IACC,OAAOJ,EAAGM,MAAMC,KAAML,EACvB,SAkBA,CACD,CACD,CAnDAf,EAAWK,gBAAmBgB,GACzBA,GAAoC,mBAArBA,EAAYC,KACvB,IAAIC,QAAQ,CAACC,EAASC,KAC5BC,WAAW,KACRL,EAAYC,KAAKE,EAASC,IAC1B,KAGEJ,EA6CR,MAAMM,EAAmBC,OAAOC,IAAI,mBAC9BC,EAAiBF,OAAOC,IAAI,yBAElC,IAAIE,EACAC,EAiCJ,SAASC,EAAuBC,EAAkBC,GACjD,MAAMC,EAAU7B,EAAgB8B,IAAIjB,OAASX,IACvC6B,EAAcP,EAAUT,KAAKiB,KAClCnB,KACAR,EAAKsB,EAAaE,GAClBxB,EAAKuB,EAAYC,IAGlB,OADIA,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAIH,EAAaF,GAChDE,CACR,CAgBA,SAASI,EAERC,GAEA,GAAwB,mBAAbA,EAAyB,CACnC,MAAMrC,EAAI,IAAI0B,EAAgB,CAACR,EAASC,KACvC,MAAMmB,EAAiBhC,EAAKY,GACtBqB,EAAgBjC,EAAKa,GAC3BkB,EAASC,EAAgBC,KAEpBT,EAAU3B,IAEhB,OADAF,EAAgBkC,IAAInC,EAAG8B,GAChB9B,CACR,CACA,OAAO,IAAI0B,EAAgBW,EAC5B,CAvEKG,WAAmBnB,IACvBI,EAAae,WAAmBnB,GAChCK,EAAmBc,WAAmBhB,KAEtCE,EAAkBc,WAAWvB,QAC7BQ,EAAY,CAEXT,KAAMU,EAAgBe,UAAUzB,KAChC0B,MAAOhB,EAAgBe,UAAUC,MACjCC,QAASjB,EAAgBe,UAAUE,QACnCzB,QAASQ,EAAgBR,QACzBC,OAAQO,EAAgBP,OACxByB,IAAKlB,EAAgBkB,IACrBC,WAAanB,EAAwBmB,WACrCC,KAAMpB,EAAgBoB,KACtBC,IAAMrB,EAAwBqB,IAC9B3B,WAAYoB,WAAWpB,WACvB4B,YAAaR,WAAWQ,YACxBC,aAAeT,WAAmBS,aAClCC,sBAAwBV,WAAmBU,sBAC3CC,eAAgBX,WAAWW,gBAE1BX,WAAmBnB,GAAoBI,EACvCe,WAAmBhB,GAAkBE,GAInCD,EAAUoB,aAAYpB,EAAUoB,WAAcnB,EAAwBmB,YACtEpB,EAAUsB,MAAKtB,EAAUsB,IAAOrB,EAAwBqB,KACxDtB,EAAUqB,OAAMrB,EAAUqB,KAAOpB,EAAgBoB,MA6CtDM,OAAOC,OAAOjB,EAAgBV,GAG9BU,EAAeK,UAAYf,EAAgBe,UAE3CL,EAAelB,QAAeoC,IAC7B,MAAMtD,EAAIyB,EAAUP,QAAQe,KAAKP,EAAiB4B,GAC5CxB,EAAU3B,IAGhB,OADI2B,EAAQI,KAAO,IAAMjC,EAAgBsD,IAAIvD,IAAIC,EAAgBkC,IAAInC,EAAG8B,GACjE9B,CACP,EAEDoC,EAAejB,OAAsBqC,IACpC,MAAMxD,EAAIyB,EAAUN,OAAOc,KAAKP,EAAiB8B,GAC3C1B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeQ,IAAWa,IACzB,MAAMzD,EAAIyB,EAAUmB,IAAIX,KAAKP,EAAiB+B,GACxC3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeS,WACdY,IAEA,MAAMzD,EAAKyB,EAAUoB,WAAmBZ,KAAKP,EAAiB+B,GACxD3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeU,KAAYW,IAC1B,MAAMzD,EAAIyB,EAAUqB,KAAKb,KAAKP,EAAiB+B,GACzC3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeW,IAAWU,IACzB,MAAMzD,EAAKyB,EAAUsB,IAAYd,KAAKP,EAAiB+B,GACjD3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAKG0B,EAAgBe,UAAUzB,OAASW,IAEtCD,EAAgBe,UAAUzB,KAAOW,EACjCD,EAAgBe,UAAUC,MAxF3B,SAAiCb,GAChC,MAAMC,EAAU7B,EAAgB8B,IAAIjB,OAASX,IACvC6B,EAAcP,EAAUiB,MAAMT,KAAKnB,KAAMR,EAAKuB,EAAYC,IAEhE,OADIA,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAIH,EAAaF,GAChDE,CACR,EAoFCN,EAAgBe,UAAUE,QAlF3B,SAAmCe,GAClC,MAAM5B,EAAU7B,EAAgB8B,IAAIjB,OAASX,IACvC6B,EAAcP,EAAUkB,QAAQV,KAAKnB,KAAMR,EAAKoD,EAAW5B,IAEjE,OADIA,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAIH,EAAaF,GAChDE,CACR,GAgFA,IACCoB,OAAOO,eAAejC,EAAiBJ,OAAOsC,QAAS,CACtD7B,IAAK,IAAMK,EACXyB,cAAc,GAEhB,CAAE,MAAOC,GAAK,CAEZtB,WAAmBvB,QAAUmB,EAE/BI,WAAWpB,WAAU,CAAK2C,KAAuBtD,IACzCgB,EAAUL,WAAWa,KAAKO,WAAYlC,EAAKyD,MAAqBtD,GAGxE+B,WAAWQ,YAAW,CAAKe,KAAuBtD,IAC1CgB,EAAUuB,YAAYf,KAAKO,WAAYlC,EAAKyD,MAAqBtD,GAGrEgB,EAAUwB,eACXT,WAAmBS,aAAY,CAAKc,KAAuBtD,IACrDgB,EAAUwB,aAAahB,KAAKO,WAAYlC,EAAKyD,MAAqBtD,IAIvEgB,EAAUyB,wBACbV,WAAWU,sBAAyBa,GAC5BtC,EAAUyB,sBAAsBjB,KAAKO,WAAYlC,EAAKyD,KAI3DtC,EAAU0B,iBACbX,WAAWW,eAAkBY,IAC5BtC,EAAU0B,eAAelB,KAAKO,WAAYlC,EAAKyD,MCtMjD,MAAMC,EAAqB,IAAIvE,IAAc,CAC5C2D,OACAa,MACAC,KACAC,SACA1E,IACA2E,IACAlE,QACAmE,QACApD,QACAqD,MACAC,UACAC,eACAC,YACAC,WACAC,SACAC,UACAC,QACAC,MACAC,OACAC,OACAC,OACAC,UAOK,SAAUC,EAAc5E,GAC7B,OACCA,GACc,mBAAPA,IACNyD,EAAmBT,IAAIhD,IAAOA,EAAG6E,aAAaC,WAAW,UAE5D,CA0BA,MAAMC,EAA0B,oBAATC,KACVC,EAAY,CACxBzD,IAAG,CAAC0D,EAAUC,EAAWC,IACpBL,GAAWG,aAAeF,KAAcE,EAAYC,GACjDb,QAAQ9C,IAAI0D,EAAKC,EAAMC,GAE/BxD,IAAG,CAACsD,EAAUC,EAAWpC,EAAYqC,IAChCL,GAAWG,aAAeF,MAC3BE,EAAYC,GAAQpC,GACf,GAWDuB,QAAQ1C,IAAIsD,EAAKC,EAAMpC,EAAOqC,IAIjC,SAAUC,EAAcH,EAAUC,GACvC,MAAMG,EAAMzC,OAAO0C,yBAAyBL,EAAKC,GACjD,SAAUG,GAAK9D,MAAO8D,GAAK1D,IAC5B,CAWM,SAAU4D,EAAYC,EAAQC,EAAQC,EAAQ,IAAI9B,KACvD,GAAI4B,IAAMC,EAAG,OAAO,EAEpB,GAAiB,iBAAND,GAAwB,OAANA,GAA2B,iBAANC,GAAwB,OAANA,EACnE,OAAOD,IAAMC,EAId,GAAI7C,OAAO+C,eAAeH,KAAO5C,OAAO+C,eAAeF,GAAI,OAAO,EAGlE,IAAIG,EAAWF,EAAMnE,IAAIiE,GACzB,GAAII,GAAU7C,IAAI0C,GAAI,OAAO,EAQ7B,GAPKG,IACJA,EAAW,IAAI3G,IACfyG,EAAM/D,IAAI6D,EAAGI,IAEdA,EAASvG,IAAIoG,GAGThC,MAAMoC,QAAQL,GAAI,CACrB,IAAK/B,MAAMoC,QAAQJ,IAAMD,EAAEM,SAAWL,EAAEK,OAAQ,OAAO,EACvD,IAAK,IAAIC,EAAI,EAAGA,EAAIP,EAAEM,OAAQC,IAC7B,IAAKR,EAAYC,EAAEO,GAAIN,EAAEM,GAAIL,GAAQ,OAAO,EAE7C,OAAO,CACR,CAEA,GAAIF,aAAa9B,KAAM,OAAO+B,aAAa/B,MAAQ8B,EAAEQ,YAAcP,EAAEO,UACrE,GAAIR,aAAajB,OAAQ,OAAOkB,aAAalB,QAAUiB,EAAEZ,aAAea,EAAEb,WAE1E,GAAIY,aAAavG,IAAK,CACrB,KAAMwG,aAAaxG,MAAQuG,EAAE9D,OAAS+D,EAAE/D,KAAM,OAAO,EACrD,IAAK,MAAMuE,KAAOT,EAAG,CACpB,IAAIU,GAAQ,EACZ,IAAK,MAAMC,KAAQV,EAClB,GAAIF,EAAYU,EAAKE,EAAMT,GAAQ,CAClCQ,GAAQ,EACR,KACD,CAED,IAAKA,EAAO,OAAO,CACpB,CACA,OAAO,CACR,CACA,GAAIV,aAAa5B,IAAK,CACrB,KAAM6B,aAAa7B,MAAQ4B,EAAE9D,OAAS+D,EAAE/D,KAAM,OAAO,EACrD,IAAK,MAAO0E,EAAKH,KAAQT,EACxB,GAAKC,EAAE1C,IAAIqD,IASJ,IAAKb,EAAYU,EAAKR,EAAElE,IAAI6E,GAAMV,GACxC,OAAO,MAVS,CAChB,IAAIW,GAAa,EACjB,IAAK,MAAOC,EAAMH,KAASV,EAC1B,GAAIF,EAAYa,EAAKE,EAAMZ,IAAUH,EAAYU,EAAKE,EAAMT,GAAQ,CACnEW,GAAa,EACb,KACD,CAED,IAAKA,EAAY,OAAO,CACzB,CAID,OAAO,CACR,CAGA,MAAME,EAAQ3D,OAAO4D,KAAKhB,GACpBiB,EAAQ7D,OAAO4D,KAAKf,GAC1B,GAAIc,EAAMT,SAAWW,EAAMX,OAAQ,OAAO,EAE1C,IAAK,MAAMM,KAAOG,EACjB,IAAK3D,OAAO8D,OAAOjB,EAAGW,KAASb,EAAYC,EAAEY,GAAMX,EAAEW,GAAMV,GAAQ,OAAO,EAG3E,OAAO,CACR,CAGA,MAAMiB,EAAc,IAAIjH,QAClB,SAAUkH,EAAWC,GAU1B,OATKF,EAAY5D,IAAI8D,IACpBF,EAAYhF,IACXkF,EACAjE,OAAOkE,KACNlE,OAAOmE,OAAO,KAAM,CACnBC,UAAW,CAAElE,MAAO+D,EAAWI,UAAU,EAAO5D,cAAc,OAI3DsD,EAAYpF,IAAIsF,EACxB,CAQM,SAAUK,EAAsBC,EAAclC,GAanD,OAZArC,OAAOwE,iBAAiBnC,EAAK,CAC5B,CAACnE,OAAOuG,aAAc,CACrBvE,MAAOqE,EACPF,UAAU,EACV5D,cAAc,GAEfuB,SAAU,CACT9B,MAAO,IAAMqE,EACbF,UAAU,EACV5D,cAAc,KAGT4B,CACR,CAQM,SAAUqC,EAA0BH,EAAcpH,GAMvD,OALA6C,OAAOO,eAAepD,EAAI,OAAQ,CACjC+C,MAAO/C,EAAGoH,KAAO,GAAGpH,EAAGoH,SAASA,IAASA,EACzCF,UAAU,EACV5D,cAAc,IAERtD,CACR,CAMA,MAAMwH,EACe,oBAAZC,SAA2BA,QAAQC,KAAKC,eACxB,IAAhB,gQAAgCC,GACxC,aAEYC,EAAkB,gBAAVL,EACRM,EAAmB,eAAVN,EACTO,EAAmB,SAAVP,ECzQhB,MAAOQ,UAAuBjE,MACnC,WAAAkE,CAAYC,GACXC,MAAMD,GACN3H,KAAK6G,KAAO,oBACb,EAiIK,SAAUgB,EAAyBC,GACxC,OAAO,SAENC,EACAC,EACAC,KACGtI,GAEH,QAAoB0H,IAAhBW,GACH,GAAI3D,EAAc0D,GAAS,CAC1B,KAAM,UAAWD,GAAc,MAAM,IAAItE,MAAM,0CAC/C,OAAOsE,EAAYI,MAAOH,EAC3B,OACM,GAAsB,iBAAXA,GAAuB,CAAC,SAAU,UAAUI,gBAAgBH,GAAc,CAC3F,IAAKC,EAAY,MAAM,IAAIzE,MAAM,0CAC5B,GAA0B,iBAAfyE,GAA2B,iBAAkBA,EAAY,CACxE,GAAI,QAASA,GAAc,QAASA,EAAY,CAC/C,KAAM,WAAYH,MAAe,WAAYA,GAC5C,MAAM,IAAItE,MAAM,qDACjB,GAAI,WAAYsE,EAAa,CAC5B,MAAMM,EAAYN,EAAYO,OAAQJ,EAAWhH,IAAY8G,EAAQC,GACjEI,IAAWH,EAAWhH,IAAMmH,EACjC,CACA,GAAI,WAAYN,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,OAAQN,EAAW5G,IAAY0G,EAAQC,GACjEM,IAAWL,EAAW5G,IAAMiH,EACjC,CACA,OAAOL,CACR,CAAO,GAAgC,mBAArBA,EAAWzF,MAAsB,CAClD,KAAM,WAAYsF,GAAc,MAAM,IAAItE,MAAM,2CAChD,MAAMgF,EAAYV,EAAYW,OAAQR,EAAWzF,MAAOuF,EAAQC,GAEhE,OADIQ,IAAWP,EAAWzF,MAAQgG,GAC3BP,CACR,CACD,CACD,CACA,KAAM,YAAaH,GAClB,MAAM,IAAItE,MAAM,kDACjB,OAAOsE,EAAYY,QAASvH,KAAKnB,KAAM+H,EAAQC,EAAaC,KAAetI,EAC5E,CACD,CAOM,SAAUgJ,EAAyBb,GAExC,OAAO,SAAqBC,EAAa/G,KAA+BrB,GACvE,IAAKqB,GAAS4H,MAAgC,iBAAjB5H,EAAQ4H,KAAmB,CACvD,KAAM,YAAad,GAClB,MAAM,IAAItE,MAAM,kDACjB,OAAOsE,EAAYY,QAASvH,KAAKnB,KAAM+H,EAAQ/G,KAAYrB,EAC5D,CACA,OAAQqB,EAAQ4H,MACf,IAAK,QACJ,KAAM,UAAWd,GAAc,MAAM,IAAItE,MAAM,0CAC/C,OAAOsE,EAAYI,MAAOH,GAC3B,IAAK,QACJ,MAAM,IAAIvE,MAAM,0CACjB,IAAK,SACJ,KAAM,WAAYsE,GAAc,MAAM,IAAItE,MAAM,2CAChD,OAAOsE,EAAYO,OAAQN,EAAQA,EAAQ/G,EAAQ6F,MACpD,IAAK,SACJ,KAAM,WAAYiB,GAAc,MAAM,IAAItE,MAAM,2CAChD,OAAOsE,EAAYS,OAAQR,EAAQA,EAAQ/G,EAAQ6F,MACpD,IAAK,SACJ,KAAM,WAAYiB,GAAc,MAAM,IAAItE,MAAM,2CAChD,OAAOsE,EAAYW,OAAQV,EAAQA,EAAQ/G,EAAQ6F,MACpD,IAAK,WAAY,CAChB,KAAM,WAAYiB,MAAe,WAAYA,GAC5C,MAAM,IAAItE,MAAM,qDACjB,MAAMqF,EAAsD,CAAA,EAC5D,GAAI,WAAYf,EAAa,CAC5B,MAAMM,EAAYN,EAAYO,OAAQN,EAAO9G,IAAK8G,EAAQ/G,EAAQ6F,MAC9DuB,IAAWS,EAAG5H,IAAMmH,EACzB,CACA,GAAI,WAAYN,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,OAAQR,EAAO1G,IAAK0G,EAAQ/G,EAAQ6F,MAC9DyB,IAAWO,EAAGxH,IAAMiH,EACzB,CACA,OAAOO,CACR,EAGF,CACD,CA4BO,MAAMC,EAAoChB,IAChD,MAAMiB,EAASJ,EAAgBb,GACzBkB,EAASnB,EAAgBC,GAC/B,MAAA,CAASC,EAAakB,KAAuBtJ,KAC5C,MAAMuJ,EA1BR,SACCC,EACAF,GAKA,MACyB,iBAAjBA,GACU,OAAjBA,GAC6B,iBAAtBA,EAAaL,KAEb,SAED,QACR,CAWeQ,CAAoBrB,EAAQkB,EAActJ,EAAK,IAC5D,MAAgB,WAATuJ,EACJH,EAAOhB,EAAQkB,KAAiBtJ,GAChCqJ,EAAOjB,EAAQkB,KAAiBtJ,EACnC,GCrQI0J,EAAK,IAAIC,qBAAkCC,GAAMA,KAI1CC,EAAahJ,OAAO,cAIpBiJ,EAAkBjJ,OAAO,aAIhC,MAAOkJ,UAAyBlG,MACrC,YAAO,CAAiBmG,GACvB,MAAO,KACN,MAAM,IAAID,EAAiBC,GAE7B,CACA,WAAAjC,CAAYiC,GACX/B,MAAM,wBAAwB+B,KAC9B3J,KAAK6G,KAAO,sBACb,EAED,MAAM+C,EAAmB,CACxB,CAACpJ,OAAOuG,aAAc,oBACtB9F,IAAKyI,EAAiBG,MAAM,kCAC5BxI,IAAKqI,EAAiBG,MAAM,mCAyItB,MAAMC,EAAYhB,EAAU,CAClCP,OAAM,CAACwB,EAAUZ,EAASnB,IAClB,SAAUxF,GAEhB,OADAxC,KAAKyJ,GAAiBzB,GAAexF,EAC9BuH,EAAS5I,KAAKnB,KAAMwC,EAC5B,IC5JI,SAAUwH,EAAaC,EAAiBC,GAC7C,IAAIC,EAAQ,EACRC,EAAOH,EAAEzE,OACT6E,EAAOH,EAAE1E,OAGb,KAAO2E,EAAQC,GAAQD,EAAQE,GAAQJ,EAAEE,KAAWD,EAAEC,IAAQA,IAE9D,KAAOC,EAAOD,GAASE,EAAOF,GAASF,EAAEG,EAAO,KAAOF,EAAEG,EAAO,IAC/DD,IACAC,IAGD,MAAMC,EAAOF,EAAOD,EACdI,EAAOF,EAAOF,EAEpB,GAAa,IAATG,GAAuB,IAATC,EAAY,MAAO,GACrC,GAAa,IAATD,EACH,MAAO,CAAC,CAAEE,OAAQL,EAAOM,OAAQN,EAAOO,OAAQ,GAAIC,OAAQT,EAAEU,MAAMT,EAAOE,KAC5E,GAAa,IAATE,EACH,MAAO,CAAC,CAAEC,OAAQL,EAAOM,OAAQN,EAAOO,OAAQT,EAAEW,MAAMT,EAAOC,GAAOO,OAAQ,KAG/E,MAAME,EAAOC,KAAKC,IAAIT,EAAOC,EA9BZ,KAgCXS,EAAUH,EACVI,EAAI,IAAIC,WAFA,EAAIL,EAAO,GAGzBI,EAAED,EAAU,GAAK,EACjB,MAAMG,EAAwB,GAE9B,IAAK,IAAIC,EAAI,EAAGA,GAAKP,EAAMO,IAAK,CAC/B,IAAK,IAAIC,GAAKD,EAAGC,GAAKD,EAAGC,GAAK,EAAG,CAChC,IAAIC,EAEHA,EADGD,KAAOD,GAAMC,IAAMD,GAAKH,EAAED,EAAUK,EAAI,GAAKJ,EAAED,EAAUK,EAAI,GAC5DJ,EAAED,EAAUK,EAAI,GAEhBJ,EAAED,EAAUK,EAAI,GAAK,EAE1B,IAAIE,EAAID,EAAID,EACZ,KAAOC,EAAIhB,GAAQiB,EAAIhB,GAAQN,EAAEE,EAAQmB,KAAOpB,EAAEC,EAAQoB,IACzDD,IACAC,IAGD,GADAN,EAAED,EAAUK,GAAKC,EACbA,GAAKhB,GAAQiB,GAAKhB,EAAM,OAAOiB,EAAaL,EAASlB,EAAGC,EAAGC,EAAOmB,EAAGC,EAAGH,EAAGC,EAAGL,EACnF,CACAG,EAAQrL,KAAK,IAAIoL,WAAWD,GAC7B,CAGA,MAAO,CACN,CAAET,OAAQL,EAAOM,OAAQN,EAAOO,OAAQT,EAAEW,MAAMT,EAAOC,GAAOO,OAAQT,EAAEU,MAAMT,EAAOE,IAEvF,CAEA,SAASmB,EACRL,EACAlB,EACAC,EACAuB,EACAC,EACAC,EACAC,EACAC,EACAb,GAGA,MAAMc,EAAqB,GAC3B,IAAIR,EAAII,EACJH,EAAII,EACJN,EAAIQ,EAER,IAAK,IAAIT,EAAIQ,EAAQR,EAAI,EAAGA,IAAK,CAChC,MAAMW,EAAOZ,EAAQC,EAAI,GACzB,IAAIY,EACAC,EACAZ,KAAOD,GACVY,EAAQX,EAAI,EACZY,GAAO,GACGZ,IAAMD,GAChBY,EAAQX,EAAI,EACZY,GAAO,GACGF,EAAKf,EAAUK,EAAI,GAAKU,EAAKf,EAAUK,EAAI,IACrDW,EAAQX,EAAI,EACZY,GAAO,IAEPD,EAAQX,EAAI,EACZY,GAAO,GAGR,MAAMC,EAAWH,EAAKf,EAAUgB,GAE1BG,EAASF,EAAOC,EAAWA,EAAW,EACtCE,EAASH,EAFEC,EAAWF,EAEK,EAAIE,EAAW,EAAIb,EAGpD,KAAOC,EAAIa,GAAUZ,EAAIa,GACxBN,EAAIhM,KAAK,GACTwL,IACAC,IAGGU,GACHH,EAAIhM,KAAK,GACTyL,MAEAO,EAAIhM,KAAK,GACTwL,KAEDD,EAAIW,CACL,CAGA,MAAMK,EAAgC,GACtC,IAAIC,EAAQb,EACRc,EAAQd,EACRf,EAAc,GACdC,EAAc,GACd6B,GAAS,EACTC,GAAS,EAEb,MAAMC,EAAQ,MACE,IAAXF,IACHH,EAAQvM,KAAK,CAAE0K,OAAQgC,EAAQ/B,OAAQgC,EAAQ/B,SAAQC,WACvDD,EAAS,GACTC,EAAS,GACT6B,GAAS,IAIX,IAAK,IAAI/G,EAAIqG,EAAItG,OAAS,EAAGC,GAAK,EAAGA,IAAK,CACzC,MAAMkH,EAAKb,EAAIrG,GACJ,IAAPkH,GACHD,IACAJ,IACAC,KACiB,IAAPI,IACK,IAAXH,IACHA,EAASF,EACTG,EAASF,GAEV5B,EAAO7K,KAAKoK,EAAEqC,SAEC,IAAXC,IACHA,EAASF,EACTG,EAASF,GAEV7B,EAAO5K,KAAKmK,EAAEqC,MAEhB,CAEA,OADAI,IACOL,CACR,SClKA,MAAMO,EAASpM,OAAO,UAChB9B,EAAQ8B,OAAO,SAEfqM,EAAgB,CACrB,EAAAC,CACCC,EACAC,GAEA,GAA6B,iBAAlBD,EACV,IAAK,MAAME,KAAK3K,OAAO4D,KAAK6G,GAC3B/M,KAAK8M,GAAGG,EAAGF,EAAcE,SAEpB,QAAW5F,IAAP2F,EAAkB,CAC5B,MAAME,EAAYlN,KAAK4M,GAAQ3L,IAAI8L,IAAkB,IAAIpO,IACpDuO,EAAUzK,IAAIuK,IAAKE,EAAUnO,IAAIiO,GACtChN,KAAK4M,GAAQvL,IAAI0L,EAAeG,EACjC,CACA,MAAO,IAAMlN,KAAKmN,IAAIJ,EAAeC,EACtC,EACA,GAAAG,CACCJ,EACAC,GAEA,GAA6B,iBAAlBD,EACV,IAAK,MAAME,KAAK3K,OAAO4D,KAAK6G,GAC3B/M,KAAKmN,IAAIF,EAAGF,EAAcE,SAErB,GAAID,QAAiC,CAC3C,MAAME,EAAYlN,KAAK4M,GAAQ3L,IAAI8L,GAC/BG,IACHA,EAAUlO,OAAOgO,GACZE,EAAU9L,MAAMpB,KAAK4M,GAAQ5N,OAAO+N,GAE3C,MAEC/M,KAAK4M,GAAQ5N,OAAO+N,EAEtB,EACA,IAAAK,CACCC,KACG1N,GAEH,MAAMuN,EAAYlN,KAAK4M,GAAQ3L,IAAIoM,GACnC,GAAIH,EAAW,IAAK,MAAMF,KAAME,EAAWF,EAAGjN,MAAMC,KAAML,GAC1D,IAAK,MAAMqN,KAAMhN,KAAKtB,GAAQsO,EAAG7L,KAAKnB,KAAMqN,KAAU1N,EACvD,GAGD,SAAS2N,EACRC,EACAC,EACAC,GAEA,MAAMrI,EAAQ,IAAI9B,IAClB,OAAO,IAAIU,MAAMwJ,EAAK,CACrB,GAAAvM,CAAI8G,EAAQnD,GACX,GAAoB,iBAATA,EAAmB,OAAOmD,EAAOnD,GAC5C,GAAI6I,IAAQF,EAASX,GAAQnK,IAAImC,KAAU2I,EAAS7O,GAAO0C,KAAM,MAAO,OAGxE,IAAIsM,EAAStI,EAAMnE,IAAI2D,GAKvB,OAJK8I,IACJA,EAAS,IAAI/N,IAAgB6N,EAAIzN,MAAMwN,EAAU,CAAC3I,KAASjF,IAC3DyF,EAAM/D,IAAIuD,EAAM8I,IAEVA,CACR,GAEF,CCxCM,SAAUC,EACflO,EACAmO,GAKA,OAFEnO,EAAWmO,QAAUA,EAEhB,IAAI5J,MAAMvE,EAAI,CACpBwB,IAAG,CAAC8G,EAAQnD,EAAMC,IACbD,KAAQgJ,EACJ7J,QAAQ9C,IAAI2M,EAAShJ,EAAMC,GAE3BkD,EAAenD,IAG1B,CAqCM,SAAUiJ,EACfpO,EACAqO,EACAC,EAGI,CAAA,GAGJ,MAAMC,EAAcD,EAAKE,cAAiBxO,EAAWwO,cAAgBxO,EAAG+F,OAElEgI,EAAM,YAA4C7N,GACvD,MAAMuO,EAAU,IAAIvO,GAGpB,KAAOuO,EAAQ1I,QAAUwI,GACxBE,EAAQpO,UAAKuH,GAGd,MAAM8G,EAAiBD,EAAQF,GACzBI,EACc,OAAnBD,GAC0B,iBAAnBA,IACNhL,MAAMoC,QAAQ4I,GAIhB,OAFAD,EAAQF,GAAeI,EAAW,IAAKN,KAAmBK,GAAmBL,EAEtErO,EAAGM,MAAMC,KAAMkO,EACvB,EAQA,OANIH,EAAKlH,MAAMG,EAAM,GAAGvH,EAAGoH,QAAQkH,EAAKlH,OAAQ2G,GAGhDlL,OAAOO,eAAe2K,EAAK,SAAU,CAAEhL,MAAO/C,EAAG+F,SAC/CgI,EAAYS,aAAeD,EAEtBL,EAASH,EAAW/N,EAAWmO,SAAW,CAAA,EAClD,CD1CmBS,EAAAzB,IACAlO,QE9EN4P,EAAQ9N,OAAO,SAIf+N,EAAQ/N,OAAO,eA2LfgO,EAAehO,OAAO,sBAStBiO,EACZ,IAAeD,KACd,MAAM,IAAIhL,MAAM,sCACjB,CAKA,UAAIgC,GACH,OAAOxF,KAAKwO,GAAchJ,MAC3B,CAUA,CAAChF,OAAOkO,YACP,OAAO1O,KAAKwO,GAAchO,OAAOkO,WAClC,CAOA,GAAAC,CAAOC,EAAiEC,GACvE,OAAO7O,KAAKwO,GAAcG,IAAIC,EAAYC,EAC3C,CAUA,MAAAC,CAAOC,EAAsEF,GAC5E,OAAO7O,KAAKwO,GAAcM,OAAOC,EAAWF,EAC7C,CAgBA,MAAAG,CACCJ,EAMAK,GAEA,YAAwB5H,IAAjB4H,EACJjP,KAAKwO,GAAcQ,OAAOJ,EAAYK,GACtCjP,KAAKwO,GAAcQ,OAAOJ,EAC9B,CAgBA,WAAAM,CACCN,EAMAK,GAEA,YAAwB5H,IAAjB4H,EACJjP,KAAKwO,GAAcU,YAAYN,EAAYK,GAC3CjP,KAAKwO,GAAcU,YAAYN,EACnC,CAKA,OAAAO,CAAQP,EAAoEC,GAC3E7O,KAAKwO,GAAcW,QAAQP,EAAYC,EACxC,CAaA,IAAAO,CACCL,EACAF,GAEA,OAAO7O,KAAKwO,GAAcY,KAAKL,EAAWF,EAC3C,CAKA,SAAAQ,CACCN,EACAF,GAEA,OAAO7O,KAAKwO,GAAca,UAAUN,EAAWF,EAChD,CAaA,QAAAS,CACCP,EACAF,GAEA,OAAO7O,KAAKwO,GAAcc,SAASP,EAAWF,EAC/C,CAKA,aAAAU,CACCR,EACAF,GAEA,OAAO7O,KAAKwO,GAAce,cAAcR,EAAWF,EACpD,CAKA,QAAA1G,CAASqH,EAAkBC,GAC1B,OAAOzP,KAAKwO,GAAcrG,SAASqH,EAAeC,EACnD,CAKA,OAAAC,CAAQF,EAAkBC,GACzB,OAAOzP,KAAKwO,GAAckB,QAAQF,EAAeC,EAClD,CAKA,WAAAE,CAAYH,EAAkBC,GAC7B,OAAOzP,KAAKwO,GAAcmB,YAAYH,EAAeC,EACtD,CAKA,KAAA7E,CAAMT,EAAgByF,GACrB,OAAO5P,KAAKwO,GAAc5D,MAAMT,EAAOyF,EACxC,CAOA,MAAAC,IAAUC,GACT,OAAO9P,KAAKwO,GAAcqB,UAAUC,EACrC,CAKA,KAAAC,CACChB,EACAF,GAEA,OAAO7O,KAAKwO,GAAcuB,MAAMhB,EAAWF,EAC5C,CAKA,IAAAmB,CACCjB,EACAF,GAEA,OAAO7O,KAAKwO,GAAcwB,KAAKjB,EAAWF,EAC3C,CAKA,IAAAoB,CAAKC,GACJ,OAAOlQ,KAAKwO,GAAcyB,KAAKC,EAChC,CAKA,IAAAhK,GACC,OAAOlG,KAAKwO,GAActI,MAC3B,CAKA,MAAAvD,GACC,OAAO3C,KAAKwO,GAAc7L,QAC3B,CAKA,OAAAwN,GACC,OAAOnQ,KAAKwO,GAAc2B,SAC3B,CAKA,QAAA7L,GACC,OAAOtE,KAAKwO,GAAclK,UAC3B,CAKA,cAAA8L,CACCC,EACAC,GAEA,OAAOtQ,KAAKwO,GAAc4B,eAAeC,EAA8BC,EACxE,CAKA,EAAAC,CAAGC,GACF,OAAOxQ,KAAKwO,GAAc+B,GAAGC,EAC9B,CAKA,IAAAC,CAAKC,GACJ,OAAO1Q,KAAKwO,GAAciC,KAAKC,EAChC,CAMA,OAAAC,CACC1N,EACA4L,GAEA,OAAO7O,KAAKwO,GAAcmC,QAAQ1N,EAAiB4L,EACpD,CAKA,UAAA+B,GACC,OAAO5Q,KAAKwO,GAAcoC,gBAAkB,IAAI5Q,KAAKwO,IAAeqC,SACrE,CAKA,QAAAC,CAASC,GACR,OAAO/Q,KAAKwO,GAAcsC,WAAWC,IAAc,IAAI/Q,KAAKwO,IAAewC,KAAKD,EACjF,CAKA,SAAAE,CAAU9G,EAAe+G,KAAyBpB,GACjD,YAAoBzI,IAAhB6J,EAAkClR,KAAKwO,GAAcyC,UAAU9G,GAC5DnK,KAAKwO,GAAcyC,UAAU9G,EAAO+G,KAAgBpB,EAC5D,CAKA,KAAKU,EAAehO,GACnB,OAAOxC,KAAKwO,GAAc2C,KAAKX,EAAOhO,EACvC,CACA,IAAKhC,OAAO4Q,eACX,OAAOpR,KAAKwO,GAAchO,OAAO4Q,YAClC,gBCtgBYC,EAKZ,WAAA3J,CAAYyI,GAKX,GATOnQ,KAAAsR,MAAQ,IAAIlS,QACZY,KAAAuR,KAA0C,CAAA,EA8EzCvR,KAAAqO,GAA+B,kBAzEvCrO,KAAKwR,SAAW,IAAIlI,qBAAsBmI,WAClCzR,KAAKuR,KAAKE,KAEdtB,EAAS,IAAK,MAAO9E,EAAGqG,KAAMvB,EAASnQ,KAAKqB,IAAIgK,EAAGqG,EACxD,CACQ,cAAAC,CAAkB3E,GACzB,MAAMuE,KAAEA,GAASvR,KACjB,OAAO,YACN,IAAK,MAAMyR,KAAQnP,OAAO4D,KAAKqL,GAAO,CACrC,MAAOK,EAAQpP,GAAS+O,EAAKE,GACvB3L,EAAM8L,EAAOC,QACf/L,QAAWkH,EAAGlH,EAAKtD,UACX+O,EAAKE,EAClB,CAEA,CARM,EASR,CACA,KAAAK,GAEC,IAAK,MAAML,KAAQnP,OAAO4D,KAAKlG,KAAKuR,MAAO,CAC1C,MAAMzL,EAAM9F,KAAKuR,KAAKE,GAAM,GAAGI,QAC3B/L,GAAK9F,KAAKwR,SAASO,WAAWjM,EACnC,CACA9F,KAAKsR,MAAQ,IAAIlS,QACjBY,KAAKuR,KAAO,CAAA,CACb,CACA,OAAOzL,GACN,MAAM2L,EAAOzR,KAAKsR,MAAMrQ,IAAI6E,GAC5B,QAAK2L,WACEzR,KAAKuR,KAAKE,GACjBzR,KAAKsR,MAAMtS,OAAO8G,GAClB9F,KAAKwR,SAASO,WAAWjM,IAClB,EACR,CACA,OAAAqJ,CAAQP,EAAwDC,GAC/D,IAAK,MAAOxD,EAAGqG,KAAM1R,KAAM4O,EAAWzN,KAAK0N,GAAW7O,KAAM0R,EAAGrG,EAAGwD,GAAW7O,KAC9E,CACA,GAAAiB,CAAI6E,GACH,MAAM2L,EAAOzR,KAAKsR,MAAMrQ,IAAI6E,GAC5B,GAAK2L,EACL,OAAOzR,KAAKuR,KAAKE,GAAM,EACxB,CACA,GAAAhP,CAAIqD,GACH,OAAO9F,KAAKsR,MAAM7O,IAAIqD,EACvB,CACA,GAAAzE,CAAIyE,EAAQtD,GACX,IAAIiP,EAAOzR,KAAKsR,MAAMrQ,IAAI6E,GAU1B,OATI2L,EACHzR,KAAKuR,KAAKE,GAAM,GAAKjP,GAErBiP,EAAOO,OAAOC,aACdjS,KAAKsR,MAAMjQ,IAAIyE,EAAK2L,GACpBzR,KAAKuR,KAAKE,GAAQ,CAAC,IAAIS,QAAQpM,GAAMtD,GAErCxC,KAAKwR,SAASW,SAASrM,EAAK2L,EAAM3L,IAE5B9F,IACR,CACA,QAAIoB,GACH,MAAO,IAAIpB,MAAMwF,MAClB,CACA,OAAA2K,GACC,OAAOnQ,KAAK2R,eAAe,CAAC7L,EAAKtD,IAAU,CAACsD,EAAKtD,GAClD,CACA,IAAA0D,GACC,OAAOlG,KAAK2R,eAAe,CAAC7L,EAAKsM,IAAWtM,EAC7C,CACA,MAAAnD,GACC,OAAO3C,KAAK2R,eAAe,CAACU,EAAM7P,IAAUA,EAC7C,CACA,CAAChC,OAAOkO,YACP,OAAO1O,KAAKmQ,SACb,EACU9B,EAAA7N,OAAOuG,kBAOLuL,GAKZ,WAAA5K,CAAYyI,GAKX,GATOnQ,KAAAsR,MAAQ,IAAIlS,QACZY,KAAAuR,KAAmC,CAAA,EA0ElCvR,KAAAuS,GAA+B,kBArEvCvS,KAAKwR,SAAW,IAAIlI,qBAAsBmI,WAClCzR,KAAKuR,KAAKE,KAEdtB,EAAS,IAAK,MAAM9E,KAAK8E,EAASnQ,KAAKjB,IAAIsM,EAChD,CACQ,cAAAsG,CAAkB3E,GACzB,MAAMuE,KAAEA,GAASvR,KACjB,OAAO,YACN,IAAK,MAAMyR,KAAQnP,OAAO4D,KAAKqL,GAAO,CACrC,MAAMzL,EAAMyL,EAAKE,GAAMI,QACnB/L,QAAWkH,EAAGlH,UACNyL,EAAKE,EAClB,CAEA,CAPM,EAQR,CAEA,KAAAK,GAEC,IAAK,MAAML,KAAQnP,OAAO4D,KAAKlG,KAAKuR,MAAO,CAC1C,MAAM/O,EAAQxC,KAAKuR,KAAKE,GAAMI,QAC1BrP,GAAOxC,KAAKwR,SAASO,WAAWvP,EACrC,CACAxC,KAAKsR,MAAQ,IAAIlS,QACjBY,KAAKuR,KAAO,CAAA,CACb,CAEA,GAAAxS,CAAIyD,GACH,IAAIiP,EAAOzR,KAAKsR,MAAMrQ,IAAIuB,GAQ1B,OAPKiP,IACJA,EAAOO,OAAOC,aACdjS,KAAKsR,MAAMjQ,IAAImB,EAAOiP,GACtBzR,KAAKuR,KAAKE,GAAQ,IAAIS,QAAQ1P,GAE9BxC,KAAKwR,SAASW,SAAS3P,EAAOiP,EAAMjP,IAE9BxC,IACR,CACA,OAAOwC,GACN,MAAMiP,EAAOzR,KAAKsR,MAAMrQ,IAAIuB,GAC5B,QAAKiP,WACEzR,KAAKuR,KAAKE,GACjBzR,KAAKsR,MAAMtS,OAAOwD,GAClBxC,KAAKwR,SAASO,WAAWvP,IAClB,EACR,CAEA,OAAA2M,CAAQP,EAAwDC,GAC/D,IAAK,MAAMrM,KAASxC,KAAM4O,EAAWzN,KAAK0N,GAAW7O,KAAMwC,EAAOA,EAAOqM,GAAW7O,KACrF,CAEA,GAAAyC,CAAID,GACH,OAAOxC,KAAKsR,MAAM7O,IAAID,EACvB,CACA,QAAIpB,GACH,MAAO,IAAIpB,MAAMwF,MAClB,CACA,OAAA2K,GACC,OAAOnQ,KAAK2R,eAAgB7L,GAAQ,CAACA,EAAKA,GAC3C,CACA,IAAAI,GACC,OAAOlG,KAAK2R,eAAgB7L,GAAQA,EACrC,CACA,MAAAnD,GACC,OAAO3C,KAAK2R,eAAgB7L,GAAQA,EACrC,CACA,CAACtF,OAAOkO,YACP,OAAO1O,KAAKkG,MACb,CAGA,KAAAsM,CAASC,GACR,MAAMC,EAAS,CACd,CAAClS,OAAOkO,UAAS,IACT+D,EAAMvM,QAGTyM,EAAO3S,KACb,OAAO,IAAIrB,IACV,kBACQgU,EACP,IAAK,MAAMnQ,KAASkQ,EAAaC,EAAKlQ,IAAiBD,WAAeA,EACtE,CAHD,GAKF,CACA,YAAAoQ,CAAqBH,GACpB,MAAME,EAAO3S,KACb,OAAO,IAAIrB,IACV,YACC,IAAK,MAAM6D,KAASmQ,EAAUF,EAAMhQ,IAAiBD,WAAsBA,EAC3E,CAFD,GAIF,CACA,UAAAqQ,CAAcJ,GACb,MAAME,EAAO3S,KACb,OAAO,IAAIrB,IACV,YACC,IAAK,MAAM6D,KAASmQ,EAAWF,EAAMhQ,IAAiBD,WAAkBA,EACxE,CAFD,GAIF,CACA,mBAAAsQ,CAAuBL,GACtB,MAAMC,EAAS,CACd,CAAClS,OAAOkO,UAAS,IACT+D,EAAMvM,QAGTyM,EAAO3S,KACb,OAAO,IAAIrB,IACV,YACC,IAAK,MAAM6D,KAASmQ,EAAWF,EAAMhQ,IAAiBD,WAAsBA,GAC5E,IAAK,MAAMA,KAASkQ,EAAaC,EAAKlQ,IAAiBD,WAAsBA,EAC7E,CAHD,GAKF,CACA,UAAAuQ,CAAWN,GACV,IAAK,MAAMjQ,KAASxC,KAAM,IAAKyS,EAAMhQ,IAAID,GAAQ,OAAO,EACxD,OAAO,CACR,CACA,YAAAwQ,CAAaP,GACZ,MAAMC,EAAS,CACd,CAAClS,OAAOkO,UAAS,IACT+D,EAAMvM,QAGf,IAAK,MAAM1D,KAASkQ,EAAQ,IAAK1S,KAAKyC,IAAOD,GAAQ,OAAO,EAC5D,OAAO,CACR,CACA,cAAAyQ,CAAeR,GACd,IAAK,MAAMjQ,KAASxC,KAAM,GAAIyS,EAAMhQ,IAAID,GAAQ,OAAO,EACvD,OAAO,CACR,ECxMK,SAAU0Q,GACfC,EACAC,GAYA,MAAMC,EAAa,IAAIjU,QAGjBkU,EAAYH,EAAc7Q,QAIhC,OAHA+Q,EAAWhS,IAAIiB,OAAQgR,GAGhB,IAAItP,MAAMsP,EAAW,CAE3B,KAAAvT,CAAMoJ,EAASoK,EAAU5T,GACxB,GAAoB,IAAhBA,EAAK6F,OACR,MAAM,IAAIhC,MAAM,+BAGjB,MAAMgQ,EAAY7T,EAAK,GACvB,GAAyB,mBAAd6T,EACV,MAAM,IAAIhQ,MAAM,yCAIjB,KACEa,EAAcmP,IACbA,GAAkC,mBAAdA,GAA4BA,EAAU7R,WAE5D,MAAM,IAAI6B,MAAM,sCAIjB,MAAMkK,EAAS2F,EAAWpS,IAAIuS,GAC9B,GAAI9F,EACH,OAAOA,EAGR,IAAI+F,EAAWD,EACf,GAAIJ,EAAgB,CAEnB,MAAMM,EAAmB,cAAcF,IAGjCG,EAAoBH,EAAU7R,UAC9BiS,EAAmB,IAAI5P,MAAM2P,EAAmB,CACrD,GAAA1S,CAAI8G,EAAQnD,EAAMC,GACjB,MAAMrC,EAAQkC,EAAUzD,IAAI8G,EAAQnD,EAAMC,GAI1C,MACkB,mBAAVrC,GACS,iBAAToC,GACN,CAAC,cAAe,WAAY,WAAWuD,SAASvD,GAU3CpC,EAPC,YAAwB7C,GAE9B,MAAMqB,EAAUoS,EAAepT,MAC/B,OAAOwC,EAAMzC,MAAMiB,EAASrB,EAC7B,CAIF,IAID2C,OAAOuR,eAAeH,EAAiB/R,UAAWiS,GAClDH,EAAWC,CACZ,CAGA,MAAMI,EAAaX,EAAcM,GAKjC,OAFAJ,EAAWhS,IAAImS,EAAWM,GAEnBA,CACR,GAEF,CD+CWvB,EAAA/R,OAAOuG,YElJlB,MAAMgN,GACL,CAAClN,EAAckB,IACf,IAAIpI,IACIoI,EAAOlB,MAASlH,GAGnBqU,GAAiB,IAAI5U,QACrBuB,GAAY,IAAIvB,QAEtB,SAASgG,GAAM2C,EAAac,GAC3BlI,GAAUU,IAAIwH,EAAId,GAClBiM,GAAe3S,IAAI0G,EAAQc,EAC5B,CAQA,MAAMoL,GAA0D,CAE/D,CAACzT,OAAOuG,aAAc,8BACtB9F,IAAG,CAAC8G,EAAQnD,IACPA,IAASpE,OAAOuG,YAAoB,eACpB,iBAATnC,GAAqB,CAAC,OAAQ,QAAS,WAAWuD,SAASvD,GAC9DmD,EAAOnD,GACRsP,GAAanM,EAAO7H,KAAMiU,GAAMA,EAAEvP,MAGrCwP,GAAkBrM,IAAW,CAElC7H,KAAM6T,GAAQ,OAAQhM,GACtBnG,MAAOmS,GAAQ,QAAShM,GACxBlG,QAASkS,GAAQ,UAAWhM,KAEvBsM,GAAwC,CAE7C,CAAC7T,OAAOuG,aAAc,4BACtB,GAAA9F,CAAI8G,EAAQnD,EAAMC,GACjB,MAAMwD,EAAS/F,OAAO0C,yBAAyB+C,EAAQnD,IAAO3D,IACxD4H,EAAKR,EAASA,EAAOlH,KAAK0D,GAAYkD,EAAOnD,GAEnD,MAAsB,mBAAXmD,EAA8Bc,EAClCqL,GAAarL,EACrB,EACA9I,MAAK,CAACgI,EAAQ8G,EAASlP,IACfuU,GAAanM,EAAOhI,MAAM8O,EAASlP,KAG5C,SAAS2U,GAAyCC,GACjD,MAAM1L,EAAK,IAAI7E,MAAMuQ,EAAOF,IAE5B,OADAjP,GAAMmP,EAAO1L,GACNA,CACR,CAEA,SAAS2L,GAAUlJ,GAClB,OAAOA,GAAK,CAAC,WAAY,UAAUnD,gBAAgBmD,EACpD,CAOM,SAAU4I,GAAgBK,GAC/B,IAAKC,GAAUD,GAAQ,OAAOA,EAC9B,GAAIP,GAAevR,IAAI8R,GAAQ,OAAOP,GAAe/S,IAAIsT,GACzD,KAAMA,aAAiBpU,SAAU,OAAOmU,GAAYC,GAEpDA,EAAQA,EAAMrU,KAAMiU,GAAOK,GAAUL,GAAKG,GAAYH,GAAKA,GAC3D,MAAMpM,EAASzF,OAAOC,OAAO,YAAwB5C,GACpD,OAAOuU,GACNK,EAAMrU,KAAMiU,GACJnU,MAAME,KACVF,KAAKE,KAAMuU,GAAYN,EAAUpU,MAAM0U,EAAG9U,IACzCwU,EAAUpU,MAAMC,KAAML,IAG7B,EAAGyU,GAAeG,IACZG,EAAU,IAAI1Q,MACnB+D,EACAkM,IAGD,OADA7O,GAAMmP,EAAOG,GACNA,CACR,CC1FO,MAAMC,GAGK,IAAM,GAHXA,GAKI,KAAM,IAAInR,OAAQoR,MALtBD,GAMEC,GAAmB,CAACA,iqCClBnC,SAASC,GAAOC,GACf,OAAOA,CACR,2DACsBC,GAEX,KAAAC,CAAMxS,GACf,MAAMuJ,EAAO/L,KAAKiV,OAElB,OADAjV,KAAKiV,OAASzS,EACPuJ,CACR,CACU,KAAAmJ,CAAMC,GACfnV,KAAKiV,OAASE,CACf,CACA,KAAQ3S,EAAsB/C,GAC7B,MAAM0V,EAAUnV,KAAKgV,MAAMxS,GAC3B,IAAIvC,EACJ,IACCA,EAAMR,GACP,SACCO,KAAKkV,MAAMC,EACZ,CAGA,OAAOvW,EAAWK,gBAAgBgB,EACnC,CACA,IAAAmV,CAAQ3V,GACP,MAAMsM,EAAO/L,KAAKgV,QAClB,IACC,OAAOvV,GACR,SACCO,KAAKkV,MAAMnJ,EACZ,CACD,CACA,SAAIsJ,GACH,MAAMJ,EAASjV,KAAKiV,OACpB,OAAOjO,EAAM,GAAGhH,QAAQiV,IAAWxV,GAAOO,KAAKmR,KAAK8D,EAAQxV,GAC7D,EAKK,MAAO6V,WAAgBP,IAKvB,MAAOQ,WAAuBR,GAG5B,GAAAtS,CAAID,GACV,OAAOxC,KAAKmL,QAAQ1I,IAAID,EACzB,CACO,IAAAwN,CAAKjB,GACX,IAAK,MAAMvM,KAASxC,KAAKmL,QAAS,GAAI4D,EAAUvM,GAAQ,OAAO,EAC/D,OAAO,CACR,CACA,WAAAkF,CAAoB8N,EAAuB,IAAIF,IAC9C1N,QADmB5H,KAAAwV,WAAAA,EATZxV,KAAAmL,QAAU,IAAIxM,IAWrB,MAAM8W,EAAOzV,KACbA,KAAK0V,QAAUpT,OAAOmE,OACrB+O,EACAlT,OAAOqT,0BAA0B,CAChC,UAAIV,GACH,OAAOO,EAAWP,MACnB,EACA,UAAIA,CAAOzS,GACVgT,EAAWP,OAASzS,CACrB,EACA,KAAAwS,CAAMxS,GACL,GAAIA,GAASiT,EAAKtK,QAAQ1I,IAAID,GAC7B,MAAM,IAAIgB,MAAM,4CAEjB,YADc6D,IAAV7E,GAAqBiT,EAAKtK,QAAQpM,IAAIyD,GACnC,CAAEoT,MAAOpT,EAAO2S,QAAaK,EAAYR,MAAMxS,GACvD,EACA0S,MAAMC,SACiB9N,IAAlB8N,EAAQS,OAAqBH,EAAKtK,QAAQnM,OAAOmW,EAAQS,OAClDJ,EAAYN,MAAMC,EAAQA,YAIzC,CACA,UAAIF,GACH,MAAO,CAAES,QAAS1V,KAAKwV,WAAWP,OAAQ9J,QAAS,IAAIxM,IAAIqB,KAAKmL,SACjE,CACA,UAAI8J,CAAOzS,GACVxC,KAAKmL,QAAU3I,GAAO2I,QAAU,IAAIxM,IAAI6D,EAAM2I,SAAW,IAAIxM,IAC7DqB,KAAKwV,WAAWP,OAASzS,GAAOkT,OACjC,EAGK,MAAOG,WAAuBd,GAEnC,WAAArN,IAAeoO,GACdlO,QAFDmO,GAAA1U,IAAArB,KAAS,IAAIrB,KAGZ,IAAK,MAAMmW,KAAKgB,EAAOE,GAAAhW,KAAI+V,GAAA,KAAQhX,IAAI+V,EACxC,CACA,UAAIG,GACH,MAAMpM,EAAK,IAAIvF,IACf,IAAK,MAAMwR,KAAKkB,GAAAhW,KAAI+V,GAAA,UAA0B1O,IAAbyN,EAAEG,QAAsBpM,EAAGxH,IAAIyT,EAAGA,EAAEG,QACrE,OAAOpM,CACR,CACA,UAAIoM,CAAOzS,GACV,IAAK,MAAMsS,KAAKkB,GAAAhW,KAAI+V,GAAA,KAASjB,EAAEG,OAASzS,GAAOvB,IAAI6T,EACpD,CACA,KAAAE,CAAMxS,GACL,MAAM2S,EAAU,IAAI7R,IACpB,IAAK,MAAMwR,KAAKkB,GAAAhW,KAAI+V,GAAA,KAAS,CAC5B,MAAMrE,EAAIlP,GAAOvB,IAAI6T,GACrBK,EAAQ9T,IAAIyT,EAAGD,GAAIC,GAAGE,MAAMtD,GAC7B,CACA,OAAOyD,CACR,CACA,KAAAD,CAAMC,GACL,IAAK,MAAML,KAAKkB,GAAAhW,KAAI+V,GAAA,KAASlB,GAAIC,GAAGI,MAAMC,EAAQlU,IAAI6T,GACvD,CACA,GAAA/V,CAAI+V,GACHkB,GAAAhW,KAAI+V,GAAA,KAAQhX,IAAI+V,EACjB,CACA,OAAOA,GACNkB,GAAAhW,KAAI+V,GAAA,KAAQ/W,OAAO8V,EACpB,CACA,KAAAhD,GACCkE,GAAAhW,KAAI+V,GAAA,KAAQjE,OACb,iBAcM,MAAMmE,GAAYrP,EAAI,QAAS,IAAIiP,IAC1CjX,EAAWC,QAAQ,KAElB,MAAMqX,EAAOD,GAAUhB,OACvB,MAAO,KAEN,MAAMlJ,EAAOkK,GAAUhB,OAEvB,OADAgB,GAAUhB,OAASiB,EACZ,KAEND,GAAUhB,OAASlJ,MCvJf,MAAMoK,GAAqB3V,OAAO,iBAGlC,IAAI4V,GAA0B,IAAIhX,QAG9BiX,GAAW,IAAIjX,QAGfkX,GAAc,IAAIlX,QAEvB,SAAUmX,GAAcC,GAC7B,IAAIC,EAAOH,GAAYrV,IAAIuV,GAK3B,OAJKC,IACJA,EAAO,CAAA,EACPH,GAAYjV,IAAImV,EAAQC,IAElBA,CACR,CAGA,IAAIC,GAAe,IAAItX,QAgBjB,SAAUuX,GAAiClX,EAAO2V,GAEvD,MAAMwB,EAAcF,GAAazV,IAAImU,GAC/ByB,EAAWD,GAAa/E,QAE9B,GAAIgF,GAAYA,IAAapX,EAAI,CAChC,MAAMqX,EAAW1B,EAAKvO,MAAQ,YACxBkQ,EAAeF,EAAShQ,MAAQ,YAChCmQ,EAASvX,EAAGoH,MAAQ,YAC1B,MAAM,IAAIrD,MACT,kDAAkDsT,uCAA8CC,4BACvEC,iEAE3B,CAQA,OAJAN,GAAarV,IAAI+T,EAAM,IAAIlD,QAAQzS,IAGnCA,EAAG0W,IAAsBc,GAAQ7B,GAC1B3V,CACR,CAOM,SAAUwX,GAAwCxX,GACvD,KAAOA,GAAI,CACV,MAAM0U,EAAI1U,EAAG0W,IACb,IAAKhC,EAAG,MACR1U,EAAK0U,CACN,CACA,OAAO1U,CACR,CCvEO,MAAMyX,GAAgBtQ,EAAI,gBAAiB,IAAI2O,IACtD3O,EAAI,wBAAyBsQ,GAAcxB,SAC3CO,GAAUlX,IAAImY,IAMP,MAAMC,GAAmBvQ,EAAI,mBAAoB,IAAIiP,GAAeqB,GAAcxB,UAEnF,SAAU0B,GAAUZ,GACzB,MAAMpB,EAAO6B,GAAQT,GACrB,OAAOU,GAAclH,KAAM/C,GAAMgK,GAAQhK,KAAOmI,EACjD,UAEgBiC,KACf,OAAOH,GAAcxB,QAAQT,MAC9B,CAEA,MAAMqC,GAAW,IAAIlY,iBAyBLmY,GACf5S,KACG6S,GAEH,MAAMnW,EAAMiW,GAASrW,IAAI0D,GACzB,GAAKtD,EACA,IAAK,MAAM5B,KAAM+X,EAAgB/X,GAAI4B,EAAItC,IAAIU,QADxC6X,GAASjW,IAAIsD,EAAK,IAAIhG,IAAI6Y,EAAW1I,OAAO1K,WAEtD,OAAOO,CACR,CCkBO,MAAM8S,GACL,eADKA,GAEL,eAsBR,SAASC,IAAc/S,IAAEA,EAAGgT,UAAEA,EAASC,WAAEA,EAAUC,MAAEA,IACpD,MAAMC,EAA4B,UAAnBH,EAAUI,KAAmBJ,EAAUlP,OAASvE,OAAOyT,EAAU/S,MAC1EoT,EAAmB,CAAC,GAAGL,EAAUI,QAAQD,OAAanT,GAY5D,OAVIiT,IACHI,EAAMlY,KAAK,8BACXkY,EAAMlY,QAAQ6U,GAAuBiD,KAGlCC,IACHG,EAAMlY,KAAK,qBACXkY,EAAMlY,QAAQ6U,GAAuBkD,KAG/BG,CACR,CAmJO,MAAMC,GAAuBzX,OAAO,yBAK9B0X,GAAW1X,OAAO,aAMlB2X,GAAS3X,OAAO,WA0B7B,IAAY4X,GAAAA,EAAAA,uBAAAA,GAAAA,GAAAA,EAAAA,oBAAAA,oBAAiB,CAAA,IAC5B,cAAA,iBACAA,GAAA,iBAAA,qBACAA,GAAA,oBAAA,wBACAA,GAAA,gBAAA,oBACAA,GAAA,cAAA,iBACAA,GAAA,cAAA,iBA+CK,MAAOC,WAAsB7U,MAClC,WAAAkE,CACCC,EACO2Q,GAEP1Q,MAAMD,GAFC3H,KAAAsY,UAAAA,EAGPtY,KAAK6G,KAAO,eACb,CAEA,QAAI0R,GACH,OAAOvY,KAAKsY,WAAWC,IACxB,CAEA,SAAIC,GACH,OAAQxY,KAAKsY,WAAmBE,KACjC,EAOM,MAAMlI,GAAU,CAKtB0E,MAAQyD,MAKRvD,MAAQuD,MAMRC,MAAO,CAACC,EAAsBC,OAK9BC,WAAaF,MAIbG,SAAU,OACVC,iBAAmBC,MAQnBC,QAAS,CAACC,EAAWC,EAAuBC,EAAgBC,OAM5DC,kBAAoBb,MAMpBc,UAAW,CAACd,EAAmBe,OAM/BC,eAAgB,IAMhBC,mBAAoB,GAMpBC,kBAAmB,QAoBnBC,8BAA0BvS,EAyB1BwS,cAAe,cAKfC,mBAAmB,EAMnBC,kBAAmB,IAMnBC,iBAAiB,EAKjBC,iBAAiB,EAOjBC,mBAAmB,EAiBnBC,UAAW,SAEXC,KAAM,IAAIza,OAmBV0a,cAAe,CACdC,cAAe,CAAEC,SAAU,SAC3BC,WAAW,EACXC,eAAe,EACfC,YAAa,cAgBCC,GACf9T,KACGlH,GAEH,MAAMF,EAAK6Q,GAAQzJ,GACnB,GAAkB,mBAAPpH,EACX,IACGA,KAAmBE,EACtB,CAAE,MAAOib,GACRtK,GAAQ8J,KAAK,WAAWvT,UAAc+T,EACvC,CACD,CAGO,MAAMC,GAAsC,CAClDlB,kBAAmB,QACnBE,cAAe,aACfQ,cAAe,KACfT,8BAA0BvS,GAIdyT,GAAqC,CACjDnB,kBAAmB,OACnBE,cAAe,cACfQ,cAAe,CACdC,cAAe,CAAEC,SAAU,SAC3BC,WAAW,EACXC,eAAe,EACfC,YAAa,IAEdd,8BAA0BvS,GAiBd0T,GAAgB,IAAI3b,QACpB4b,GAAgB,IAAI5b,QAe3B,SAAU6b,GAAUtW,GACzB,OAAKA,GAAsB,iBAARA,GACXqW,GAAc/Z,IAAI0D,IADkBA,CAE7C,CAEM,SAAUuW,GAAWvW,GAC1B,OAAOqW,GAAcvY,IAAIkC,EAC1B,CC1nBA,ICkEIwW,GDlEAC,GAAmB,IAAIhc,QACvBic,IAAsB,EAsB1B,SAASC,GAAmB9E,EAAuB7R,EAAaC,GAC/D,MAAM2W,EAAYH,GAAiBna,IAAI0D,GACvC,GAAK4W,EACL,OAAOA,EAAUta,IAAI2D,IAAO3D,IAAIuV,IAAW+E,EAAUta,IAAIiX,KAAWjX,IAAIuV,EACzE,UASgBgF,GAAU7W,EAAUC,EAAYsT,IAC/C,GAAImD,GACH,MAAM,IAAI7X,MACT,qEAAqEU,OAAOU,SAAYD,KAG1FA,EAAMsW,GAAOtW,GACb,MAAM8W,EAAsBpE,KAG5B,IAAKoE,GAAwC,iBAAT7W,GAAqBA,IAASsT,IAAYtT,IAASuT,GACtF,OAED,MAAM1B,EAAOF,GAAckF,GACvB,mBAAoBhF,GACvBA,EAAKiF,eAAe/W,EAAKC,GAE1B,IAAI+W,EAAiBtF,GAASpV,IAAI0D,GAC7BgX,IACJA,EAAiB,IAAIrY,IACrB+S,GAAShV,IAAIsD,EAAKgX,IAEnB,IAAIC,EAAOD,EAAe1a,IAAI2D,GACzBgX,IACJA,EAAO,IAAIjd,IACXgd,EAAeta,IAAIuD,EAAMgX,IAE1BA,EAAK7c,IAAI0c,GAGT,MAAMI,EAAgBzF,GAAwBnV,IAAIwa,GAC9CI,EACHA,EAAc9c,IAAI4F,GAElByR,GAAwB/U,IAAIoa,EAAqB,IAAI9c,IAAI,CAACgG,KAI3D,MAAM2V,EAAgBhK,GAAQ+J,eAAeC,cAC7C,GAAIA,EAAe,CAClB,MAAMwB,EAAgBxB,EAAcC,SACpC,GAAsB,eAAlBuB,GAAoD,SAAlBA,EAA0B,CAC/D,IAAIP,EAAYH,GAAiBna,IAAI0D,GAChC4W,IACJA,EAAY,IAAIjY,IAChB8X,GAAiB/Z,IAAIsD,EAAK4W,IAE3B,IAAIQ,EAAaR,EAAUta,IAAI2D,GAC1BmX,IACJA,EAAa,IAAIzY,IACjBiY,EAAUla,IAAIuD,EAAMmX,IAErBA,EAAW1a,IAAIoa,EAAqB9G,KACrC,CACD,CACD,CC1DA,SAASqH,GAAiBC,GACzB,MAAMC,EAAO,IAAI5Y,IACjB,IAAK,IAAImC,EAAI,EAAGA,EAAIwW,EAAMzW,OAAQC,IAAK,CACtC,MAAM2P,EAAO6G,EAAMxW,GACnB,GAAIyW,EAAKzZ,IAAI2S,GACZ,OAAO6G,EAAMrR,MAAMsR,EAAKjb,IAAImU,IAE7B8G,EAAK7a,IAAI+T,EAAM3P,EAChB,CACA,OAAO,IACR,CAKA,SAAS0W,GAAYF,EAAmBG,EAAQ,IAC/C,MAAMC,EAAQJ,EAAMtN,IAAKwF,GAAMA,EAAEtN,MAAQ,eACzC,GAAIwV,EAAM7W,QAAU4W,EAAO,OAAOC,EAAMpM,KAAK,OAC7C,MAAM9F,EAAQkS,EAAMzR,MAAM,EAAG,GACvBgF,EAAMyM,EAAMzR,WAClB,MAAO,GAAGT,EAAM8F,KAAK,eAAeoM,EAAM7W,OAAS,gBAAgBoK,EAAIK,KAAK,QAC7E,CAcO,MAAMqM,GAAqD,IAAInZ,MAAM,KAYtE,SAAUoZ,GAAiB/F,EAAuB7R,EAAUgT,EAAsB/S,GACvF,MAAMwQ,EAAO6B,GAAQT,GAErB,IAAK2E,GAAoB,OACzB,IAAIqB,EAAarB,GAAmBla,IAAImU,GACnCoH,IACJA,EAAa,IAAIlZ,IACjB6X,GAAmB9Z,IAAI+T,EAAMoH,IAE9B,IAAIC,EAAUD,EAAWvb,IAAI0D,GACxB8X,IACJA,EAAU,IAAInZ,IACdkZ,EAAWnb,IAAIsD,EAAK8X,IAErB,MAAMC,GAASD,EAAQxb,IAAI2D,IAAS,GAAK,EAYzC,GAXA6X,EAAQpb,IAAIuD,EAAM8X,GAGlBJ,GAAcK,QAAQ,CACrBnG,SACA7R,MACAgT,YACA/S,SAED0X,GAAcM,MAEVF,GAASpM,GAAQoJ,mBAAoB,CACxC,MACM/R,EAAU,wCADGyN,EAAKvO,mBACyD6V,0CACjF,GAAkC,UAA9BpM,GAAQqJ,kBACX,MAAM,IAAItB,GAAc1Q,EAAS,CAChC4Q,KAAMH,EAAAA,kBAAkByE,oBACxBH,QACAlG,OAAQpB,IAGV9E,GAAQ8J,KAAK,cAAczS,IAC5B,CACD,CAEM,SAAUmV,GAAOC,EAAwBvG,GAE9C,GADAA,IAAAA,EAAWa,OACNb,EAAQ,MAAM,IAAIhT,MAAM,mDAC7B,MAAMiT,EAAOF,GAAcC,GACtBC,EAAKuG,SACLvG,EAAKuG,SAASld,KAAKid,GADJtG,EAAKuG,SAAW,CAACD,EAEtC,CAEO,MAAME,GAAgBH,GAI7B,IAAII,GAAiB,IAAI9d,QACrB+d,GAAoB,IAAI/d,QAKxBge,GAAgB,IAAIhe,QACpBie,GAAsB,IAAIje,QAG1Bke,IAAS,EAQb,SAASC,GACRC,EACApI,GAEA,IAAI/T,EAAMmc,EAAQvc,IAAImU,GAKtB,OAJK/T,IACJA,EAAM,IAAIiR,GACVkL,EAAQnc,IAAI+T,EAAM/T,IAEZA,CACR,CAiGA,SAASoc,GAAiBtT,EAAiByF,EAAe8N,GACzD,GAAIvT,IAAUyF,EAAK,OAAO,EAC1B,GAAIzF,IAAUuT,EAAS,OAAO,EAE9B,MAAMC,EAAU,IAAIhf,IACdif,EAAoB,CAACzT,GAI3B,IAHAwT,EAAQ5e,IAAIoL,GACZwT,EAAQ5e,IAAI2e,GAELE,EAAMpY,OAAS,GAAG,CACxB,MAAMqY,EAAUD,EAAME,QAChBC,EAAWb,GAAejc,IAAI4c,GACpC,GAAKE,EAEL,IAAK,MAAMC,KAAQD,EAAU,CAC5B,GAAIC,IAASpO,EAAK,OAAO,EACpB+N,EAAQlb,IAAIub,KAChBL,EAAQ5e,IAAIif,GACZJ,EAAM9d,KAAKke,GAEb,CACD,CAEA,OAAO,CACR,CA4HA,MAAMC,GAA2B,GAC3B,SAAUC,GAAW1H,GAC1B,MAAMpB,EAAO6B,GAAQT,GACrB,OAAOyH,GAAWjO,KAAMmO,GAAOA,EAAGrc,IAAIW,IAAI2S,GAC3C,CAEA,MAAMgJ,GAAkC,GAoCxC,SAASC,GAA8BC,EAAmBC,GAEzD,MAAMC,EAAenB,GAAoBpc,IAAIsd,GAC7C,GAAKC,EAEL,IAAK,MAAMC,KAAmBD,EAE7B,GAAIF,EAAMxc,IAAIW,IAAIgc,GAAkB,CACnC,MAAMC,EAAgBJ,EAAMK,UAAU1d,IAAIwd,IAAoB,EAC1DC,EAAgB,GACnBJ,EAAMK,UAAUtd,IAAIod,EAAiBC,EAAgB,EAEvD,CAEF,CAWA,SAASE,GACRC,EACAC,EACAnB,EAAyB,IAAIhf,IAC7BogB,EAAmB,IAEnB,GAAIF,IAAcC,EACjB,MAAO,IAAIC,EAAMD,GAGlB,GAAInB,EAAQlb,IAAIoc,GACf,MAAO,GAGRlB,EAAQ5e,IAAI8f,GACZ,MAAMG,EAAU,IAAID,EAAMF,GAEpBd,EAAWb,GAAejc,IAAI4d,GACpC,GAAId,EACH,IAAK,MAAMkB,KAAclB,EAAU,CAClC,MAAMmB,EAASN,GAASK,EAAYH,EAASnB,EAASqB,GACtD,GAAIE,EAAO1Z,OAAS,EACnB,OAAO0Z,CAET,CAGD,MAAO,EACR,CAQA,SAASC,GAAoBC,EAAsBH,GAGlD,MAAMF,EAAOH,GAASK,EAAYG,GAClC,OAAIL,EAAKvZ,OAAS,EAEV,CAAC4Z,KAAeL,GAEjB,EACR,CAsCA,SAASM,GACR7I,EACA8I,EACAC,EACA7c,GAEA,MAAM+T,EAAOF,GAAcC,GACrBgJ,EAAevB,GAAWA,GAAWzY,OAAS,GAEpD,IAAKga,EACJ,OAGD,MAAMpK,EAAO6B,GAAQT,GAQrB,IALK9T,GAAU+T,EAAKgJ,kBACnB/c,EAAS,CAAEqV,KAAM,aAAcgG,SAAUtH,EAAKgJ,kBAE/ChJ,EAAKgJ,qBAAkBpY,EAEnB3E,EAAQ,CACX,MAAMmU,EAAWJ,EAAKiJ,WACtB,GAAK7I,EAEE,CACN,MAAM8I,EAAkB,CACvBC,EACAC,KAEA,GAAkB,eAAdD,EAAK7H,KAER,OADA6H,EAAK7B,SAASje,QAAQ+f,EAAK9B,WACpB,EAER,GAAkB,aAAd6B,EAAK7H,KAAqB,CAC7B,MAAMhQ,EAAS6X,EAAKE,QAAQ1Q,KAAM+E,GAAiB,eAAXA,EAAE4D,MAG1C,GAAIhQ,EAEH,OADAA,EAAOgW,SAASje,QAAQ+f,EAAK9B,WACtB,CAET,CACA,OAAO,GAGY,eAAhBrb,EAAOqV,MACL4H,EAAgB9I,EAAUnU,KAOH,aAAlBmU,EAASkB,KACnBlB,EAASiJ,QAAQhgB,KAAK4C,GAEtB+T,EAAKiJ,WAAa,CAAE3H,KAAM,WAAY+H,QAAS,CAACjJ,EAAUnU,IAE5D,MAnCC+T,EAAKiJ,WAAahd,CAoCpB,CAIA,GAA8B,eAA1B4N,GAAQuJ,cAEP2F,EAAa1d,IAAIW,IAAI2S,IACxBoK,EAAa1d,IAAI9C,OAAOoW,QAIzB,GAAIoK,EAAa1d,IAAIW,IAAI2S,GACxB,OAKF,IAAIqB,EAAKsJ,UAETP,EAAa1d,IAAIT,IAAI+T,EAAMoB,GAEvB8I,GAAkD,eAA1BhP,GAAQuJ,eAAgC,CACnE,MAAMuF,EAAanI,GAAQqI,GAI3B,GA9GF,SAA0BF,EAAsBH,GAG/C,GAAIG,IAAeH,EAClB,OAAO,EAMR,MAAMe,EAAqB3C,GAAoBpc,IAAIge,GACnD,QAAIe,GAAoBvd,IAAI2c,EAK7B,CA8FMa,CAAiBb,EAAYhK,GAAO,CACvC,MAAM8K,EAAYf,GAAoBC,EAAYhK,GAC5C+K,EACLD,EAAU1a,OAAS,EAChB,mBAAmB0a,EAAUvR,IAAKwF,GAAMA,EAAEtN,MAAQsN,EAAE7P,YAAY2L,KAAK,SACrE,mBAAmBmP,EAAWvY,MAAQuY,EAAW9a,gBAAgB8Q,EAAKvO,MAAQuO,EAAK9Q,wBAEvFkb,EAAa1d,IAAI9C,OAAOoW,GACxB,MAAMgL,EAAczL,GAA2B6B,GACzC6J,EAAU9J,GAAcC,GAAQ8J,cAEtC,MAAM,IAAIjI,GAAc,cAAc8H,IAAgB,CACrD5H,KAAMH,EAAAA,kBAAkBmI,cACxBC,MAAON,EAAUvR,IAAKwF,GAAMA,EAAEtN,MAAQsN,EAAE7P,YACxCmc,QAASN,EACTC,cACAC,WAEF,EA3eF,SAAsBjB,EAAsBH,GAC3C,GAA8B,eAA1B3O,GAAQuJ,cAAgC,OAE5C,MAAMkE,EAAWb,GAAejc,IAAIme,GAEpC,GAAKrB,EAKJA,EAAShf,IAAIkgB,OALC,CACd,MAAMyB,EAAc,IAAIpO,GACxBoO,EAAY3hB,IAAIkgB,GAChB/B,GAAe7b,IAAI+d,EAAYsB,EAChC,CAKA,IAAIC,EAAcxD,GAAkBlc,IAAIge,GAiBxC,GAhBK0B,IACJA,EAAc,IAAIrO,GAClB6K,GAAkB9b,IAAI4d,EAAY0B,IAEnCA,EAAY5hB,IAAIqgB,GAYZA,IAAeH,EAClB,OAGD,MAAM2B,EAAgBrD,GAAmBF,GAAqB+B,GACxDyB,EAAUtD,GAAmBH,GAAe6B,GAGlD2B,EAAc7hB,IAAIkgB,GAClB4B,EAAQ9hB,IAAIqgB,GAGZ,MAAM0B,EAAa1D,GAAcnc,IAAIme,GACrC,GAAI0B,EACH,IAAK,MAAMxV,KAAKwV,EAEXxV,IAAM2T,IACY1B,GAAmBF,GAAqB/R,GAChDvM,IAAIkgB,GAClB4B,EAAQ9hB,IAAIuM,IAKd,MAAMyV,EAAmB1D,GAAoBpc,IAAIge,GACjD,GAAI8B,EACH,IAAK,MAAMxV,KAAKwV,EAEXxV,IAAM6T,IACM7B,GAAmBH,GAAe7R,GAC1CxM,IAAIqgB,GACZwB,EAAc7hB,IAAIwM,IAKpB,GAAIuV,GAAY1f,MAAQ2f,GAAkB3f,KACzC,IAAK,MAAMkK,KAAKwV,EAAY,CAC3B,MAAME,EAAgBzD,GAAmBF,GAAqB/R,GAC9D,IAAK,MAAMC,KAAKwV,EAEXzV,IAAMC,IACVyV,EAAcjiB,IAAIwM,GACFgS,GAAmBH,GAAe7R,GAC1CxM,IAAIuM,GAEd,CAEF,CA8ZE2V,CAAa7B,EAAYhK,EAC1B,CACD,CAMM,SAAU8L,GAAgBC,GAC/B,MAAM3B,EAAevB,GAAWA,GAAWzY,OAAS,GAC/Cga,EACAA,EAAa4B,UAAUriB,IAAIoiB,GADbA,GAEpB,CAsBO,MAAME,GAAQH,GA0BrB,SAASI,GACRlM,EACAuI,EACA4D,EACAxC,EACAT,GAEA,GAAIiD,EAAe9e,IAAI2S,GAAO,CAE7B,MAAMoM,EAAazC,EAAKrP,QAAQ0F,GAChC,OAAO2J,EAAKnU,MAAM4W,GAAY3R,OAAO,CAACuF,GACvC,CAEA,GAAIuI,EAAQlb,IAAI2S,GACf,MAAO,GAGRuI,EAAQ5e,IAAIqW,GACZmM,EAAexiB,IAAIqW,GACnB2J,EAAKjf,KAAKsV,GAIV,MAAM2I,EAAWb,GAAejc,IAAImU,GACpC,GAAI2I,EACH,IAAK,MAAMkB,KAAclB,EACxB,GAAIO,EAAMxc,IAAIW,IAAIwc,GAAa,CAC9B,MAAMuB,EAAQc,GAAUrC,EAAYtB,EAAS4D,EAAgBxC,EAAMT,GACnE,GAAIkC,EAAMhb,OAAS,EAClB,OAAOgb,CAET,CAMF,OAFAzB,EAAKnC,MACL2E,EAAeviB,OAAOoW,GACf,EACR,CAOA,SAASqM,GAAYC,GACpB,MAAMlC,EAAevB,GAAWA,GAAWzY,OAAS,GACpD,IAAKga,EAAc,OAAO,KAG1B,IAqEIN,EArEAyC,EAAmC,KACnCC,EAA4B,KAEhC,GAA8B,eAA1BtR,GAAQuJ,cAAgC,CAE3C,MAAMgI,EAAQrC,EAAa1d,IAAIqO,UAAU6N,OAAOxb,MAC5Cqf,KACDD,EAAUD,GAAcE,EAE5B,MAGC,IAAK,MAAOzM,EAAMoB,KAAWgJ,EAAa1d,IAAK,CAE9C,GAAiB,KADA0d,EAAab,UAAU1d,IAAImU,IAAS,GACjC,CACnBuM,EAAanL,EACboL,EAAWxM,EACX,KACD,CACD,CAGD,IAAKuM,EAAY,CAGhB,GAAInC,EAAa1d,IAAIV,KAAO,EAAG,CAC9B,IAAIof,EA9FP,SAAsBlC,GAGrB,MAAMX,EAAU,IAAIhf,IACd4iB,EAAiB,IAAI5iB,IACrBogB,EAAmB,GAEzB,IAAK,MAAO3J,KAASkJ,EAAMxc,IAAK,CAC/B,GAAI6b,EAAQlb,IAAI2S,GAAO,SACvB,MAAMoL,EAAQc,GAAUlM,EAAMuI,EAAS4D,EAAgBxC,EAAMT,GAC7D,GAAIkC,EAAMhb,OAAS,EAClB,OAAOgb,CAET,CAEA,MAAO,EACR,CA8EesB,CAAatC,GAGzB,GAAqB,IAAjBgB,EAAMhb,OAGT,IAAK,MAAO4P,KAASoK,EAAa1d,IAAK,CACtC,MAAM0c,EAAenB,GAAoBpc,IAAImU,GAC7C,GAAIoJ,EAAc,CAEjB,IAAK,MAAMuD,KAAevD,EAEzB,GAAIuD,IAAgB3M,GAChBoK,EAAa1d,IAAIW,IAAIsf,GAAc,CACtC,MAAMC,EAA0B3E,GAAoBpc,IAAI8gB,GACxD,GAAIC,GAAyBvf,IAAI2S,GAAO,CAEvCoL,EAAQ,CAACpL,EAAM2M,EAAa3M,GAC5B,KACD,CACD,CAED,GAAIoL,EAAMhb,OAAS,EAAG,KACvB,CACD,CAED,MAAM2a,EACLK,EAAMhb,OAAS,EACZ,mBAAmBgb,EAAM7R,IAAKwF,GAAMA,EAAEtN,MAAQ,eAAeoJ,KAAK,SAClE,wFAEJ,MAAM,IAAIoI,GAAc,cAAc8H,IAAgB,CACrD5H,KAAMH,EAAAA,kBAAkBmI,cACxBC,MAAOA,EAAM7R,IAAKwF,GAAMA,EAAEtN,MAAQsN,EAAE7P,YACpCmc,QAASN,GAEX,CACA,OAAO,IACR,CAEAuB,EAAiB5hB,KAAKmX,GAAQ0K,IAE9BvD,GAAete,KAAK6hB,GAEpB,IACC,MAAMlL,EAAOF,GAAcoL,GACrBjf,EAAS+T,EAAKiJ,WACpB,GAAIjJ,EAAK0K,QAAS,CACjB,MAAMA,EAAU1K,EAAK0K,QACrB1K,EAAK0K,aAAU9Z,EACf8Z,EAAQze,EACT,CACAwc,EAASyC,GACV,SACCvD,GAAexB,KAChB,CAGA,IAAK,IAAInX,EAAIwY,GAAWzY,OAAS,EAAGC,GAAK,EAAGA,IAAK,CAChD,MAAM6Y,EAAQL,GAAWxY,GACrB6Y,EAAMxc,IAAIW,IAAImf,KACjBtD,EAAMxc,IAAI9C,OAAO4iB,GACjBtD,EAAMK,UAAU3f,OAAO4iB,GACvBvD,GAA8BC,EAAOsD,GAEvC,CAEA,OAAO1C,CACR,CAIM,SAAUZ,GAAM9H,EAAyC+I,GAC9D,GAAIjC,GACH,MAAM,IAAIjF,GACT,8FACA,CAAEE,KAAMH,EAAAA,kBAAkB6J,gBAGvB9e,MAAMoC,QAAQiR,KAASA,EAAS,CAACA,IACtC,MAAMyF,EAAQzF,EAAO7H,IAAIsI,IAEnBiL,EAAmC,IAAtBjE,GAAWzY,OAC9B,GAAI0c,EAAY,CACf,GAAK/G,GACA,MAAM,IAAI3X,MAAM,sCADI2X,GAAqB,IAAI7X,IAElDqX,GAAW,aAAcsB,EAC1B,CAGA,MAAMqD,EAASjI,KAGf,IAAK6K,IAAe3C,EAAW,CAC9B,IAAK,IAAI9Z,EAAI,EAAGA,EAAI+Q,EAAOhR,OAAQC,IAClC4Z,GAAW7I,EAAO/Q,GAAI6Z,GAEvB,MACD,CAEA,MAAME,EAA2B,CAChC1d,IAAK,IAAIwB,IACTqb,UAAW,IAAIrb,IACf8d,UAAW,IAAIziB,KAEhBsf,GAAWne,KAAK0f,GAEhB,IAAI2C,GAAU,EACd,IACC,MAAMT,EAA+B,GAC/BU,EAA+B,CAAA,EAErC,GAAI7C,EAEH,IAAK,IAAI9Z,EAAI,EAAGA,EAAI+Q,EAAOhR,OAAQC,IAAK,CACvC2Y,GAAete,KAAK0W,EAAO/Q,IAC3B,IACC,MAAMgR,EAAOF,GAAcC,EAAO/Q,IAC5B/C,EAAS+T,EAAKiJ,WACpB,GAAIjJ,EAAK0K,QAAS,CACjB,MAAMA,EAAU1K,EAAK0K,QACrB1K,EAAK0K,aAAU9Z,EACf8Z,EAAQze,EACT,CACA,MAAMmG,EAAK2N,EAAO/Q,UACP4B,IAAPwB,GAAsB,UAAWuZ,IAAcA,EAAY5f,MAAQqG,EACxE,SACCuV,GAAexB,MACf4C,EAAa1d,IAAI9C,OAAOiY,GAAQT,EAAO/Q,IACxC,CACD,KACM,CAEN,IAAK,IAAIA,EAAI,EAAGA,EAAI+Q,EAAOhR,OAAQC,IAClC4Z,GAAW7I,EAAO/Q,GAAI6Z,IA/f1B,SAA6BhB,GAC5B,GAA8B,eAA1BhO,GAAQuJ,cAAgC,OAC5C,MAAMwI,EAAehL,KACfiL,EAAaD,EAAepL,GAAQoL,GAAgB,KAG1D/D,EAAMK,UAAU7M,QAEhB,IAAK,MAAOsD,KAASkJ,EAAMxc,IAAK,CAC/B,IAAIygB,EAAW,EACf,MAAMC,EAASpF,GAAcnc,IAAImU,GACjC,GAAIoN,EACH,IAAK,MAAMC,KAAaD,EAEnBlE,EAAMxc,IAAIW,IAAIggB,IAAcA,IAAcH,GAAcG,IAAcrN,GACzEmN,IAIHjE,EAAMK,UAAUtd,IAAI+T,EAAMmN,EAC3B,CACD,CA4eGG,CAAoBlD,EACrB,CAGA,KAAOA,EAAa1d,IAAIV,KAAO,GAAKoe,EAAa4B,UAAUhgB,KAAO,GACjE,GAAIoe,EAAa1d,IAAIV,KAAO,EAAG,CAC9B,GAAIsgB,EAAiBlc,OAAS8K,GAAQmJ,eAAgB,CACrD,MAAM+G,EAAQxE,GAAiB0F,GACzBiB,EAAQxG,GAAYuF,GACpB/Z,EAAU6Y,EACb,6CAA6CrE,GAAYqE,MACzD,oCAAoCmC,KAGjCC,EADczf,MAAM0c,KAAKL,EAAa1d,IAAIoE,QACrByI,IAAKwF,GAAMA,EAAEtN,MAAQ,eAC1CyR,EAAY,CACjBC,KAAMH,EAAAA,kBAAkByK,iBACxBnB,mBACAlB,QACAmC,QACAlJ,eAAgBnJ,GAAQmJ,eACxBmJ,OAAQA,EAAOhY,MAAM,EAAG,IACxBkY,YAAaF,EAAOpd,OACpB4a,YACCsB,EAAiBlc,OAAS,EACvBmP,GACA6K,EAAa1d,IAAIb,IAAIygB,EAAiBA,EAAiBlc,OAAS,KAEhE,IAEL,OAAQ8K,GAAQqJ,mBACf,IAAK,QAEL,IAAK,QAGJ,MAAM,IAAItB,GAAc,cAAc1Q,IAAW2Q,GAClD,IAAK,OACJhI,GAAQ8J,KACP,cAAczS,cAAoBib,EAAOhY,MAAM,EAAG,IAAIqF,KAAK,QAAQ2S,EAAOpd,OAAS,GAAK,MAAQ,OAIpG,CACA,MAAMqD,EAAK4Y,GAAYC,QACZra,IAAPwB,GAAsB,UAAWuZ,IAAcA,EAAY5f,MAAQqG,EACxE,KAAO,CAEN,MAAMuY,EAAYje,MAAM0c,KAAKL,EAAa4B,WAC1C5B,EAAa4B,UAAUtP,QACvB,IAAK,MAAMiR,KAAY3B,EAAW2B,GACnC,CAGD,OADAZ,GAAU,EACHC,EAAY5f,KACpB,SACM2f,GAAiC,IAAtBlE,GAAWzY,SAC1B8X,IAAS,GAEVW,GAAWrB,MACe,IAAtBqB,GAAWzY,SACd2V,QAAqB9T,EACrBsT,GAAW,YAEb,CACD,CAiCO,MAAMqI,GAASla,EAAU,CAC/BL,OAAOsB,GACC,YAAwBpK,GAC9B,MAAMsjB,EAAe,IAAMlZ,EAAShK,MAAMC,KAAML,GAGhD,OADA2C,OAAOO,eAAeogB,EAAc,OAAQ,CAAEzgB,MAAO,UAAUuH,EAASlD,UACjEyX,GAAM2E,EAA+B,YAC7C,EAEDva,QACCqB,GAEO,YAAwBpK,GAC9B,MAAMsjB,EAAe,IAAMlZ,EAAShK,MAAMC,KAAML,GAGhD,OADA2C,OAAOO,eAAeogB,EAAc,OAAQ,CAAEzgB,MAAO,UAAUuH,EAASlD,UACjEyX,GAAM2E,EAA+B,YAC7C,IAcI,SAAUC,GACfnX,EACAtM,GAGA,OADAsM,IAAAA,EAASmL,GAAcjC,QAChBjO,EAAMyQ,GAAoB,IAAI9X,IAC7BuX,GAAc/F,KAAKpF,EAAM,IAAMtM,KAAME,IAE9C,CAwBA,MAAM0J,GAAK,IAAIC,qBAAkCC,GAAMA,KA0B1CiN,GAAiBxP,EAC7ByQ,GACA9J,EACC,SACClO,EACA0jB,EAA+B,IAE3BA,GAAetc,MAAMvE,OAAOO,eAAepD,EAAI,OAAQ,CAAE+C,MAAO2gB,EAActc,OAElF,MAAMsT,EAAYgJ,GAAehJ,WAAa7J,GAAQ6J,WAAa,SAG7DiJ,EAA2B,KAChC,MAAM3M,EAAOF,GAAc6M,GAE3B,GAAI3M,EAAK0K,QAAS,CACjB,MAAMkC,EAAc5M,EAAK0K,QACzB1K,EAAK0K,aAAU9Z,EACf,IACCic,GAAU,IAAMD,EAAY5M,EAAKiJ,YAAc,CAAE3H,KAAM,YACxD,CAAE,MAAO6C,GAERtK,GAAQ8J,KAAK,8BAA+BQ,EAC7C,CACD,CAGA,GAAI2I,EACH,GAAkB,WAAdpJ,GAA0BqJ,EAE7BC,IACAD,IACAA,EAAiB,KACjBD,EAAiB,UACX,GAAkB,WAAdpJ,EAEV,OAMF,GAAIuJ,EAAe,OAEnB,IAAIC,EAYAzE,EAXJ,SAAS0E,EAAgBlhB,GACxB,MAAMmhB,EAAYF,EAClBA,OAAkBtc,EAClBwc,IAAYnhB,EACb,CAEAohB,EAAOC,SAAWtN,EAAKiJ,YAAcoE,EAAOC,SAC5CtN,EAAKiJ,gBAAarY,EAElBsT,GAAW,QAAS1D,GAAQxX,IAC5Bkb,GAAW,YAAa1D,GAAQxX,GAAKqkB,EAAOC,UAE5C,IAAIjH,EAAS,EAGb,MAAMkH,EAA0BpJ,IAC/B,MAAMqJ,EAAUxN,EAAKuG,SACfta,EAAwB,CAAEqV,KAAM,QAAS6C,SAC/C,GAAIqJ,EACH,KAAOnH,EAASmH,EAAQze,QAAQ,CAC/Boe,EAAgBlhB,GAChB,IAEC,YADAihB,EAAkBM,EAAQnH,GAAQlC,GAEnC,CAAE,MAAO5X,GACR8Z,GACD,CACD,CACD,IAAIoH,EAIG,MAAMtJ,EAJD,CACX,MAAMuJ,EAAa5N,GAAc2N,GACjC,IAAIC,EAAWC,aACV,MAAMxJ,EADkBuJ,EAAWC,aAAaxJ,EAEtD,GAID,IAAIyJ,EAFJ5N,EAAK2N,aAAeJ,EAGpB,IAIC,GAHA9E,EAASoF,EAAQtd,EAAMyQ,GAAoB,IAAMhY,EAAG0B,KAAK,KAAM2iB,KAC/DA,EAAOC,UAAW,EAClBpJ,GAAW,QAASlb,GAEnByf,GACkB,mBAAXA,IACY,iBAAXA,KAAyB,SAAUA,IAE3C,MAAM,IAAI7G,GAAc,oDAAoD6G,KAE7E,GAAIA,GAA4B,iBAAXA,GAA8C,mBAAhBA,EAAOhf,KAAqB,CAC9E,MAAMqkB,EAAkBrF,EAGxB,IAAIsF,EAA+C,KACnD,MAAMC,EAAgB,IAAItkB,QAAe,CAACukB,EAAGrkB,KAC5CmkB,EAAenkB,IAGVskB,EAAc,IAAItM,GACvB,uDAKDkL,EAAiBpjB,QAAQ6B,KAAK,CAACuiB,EAAiBE,IAGhDjB,EAAiB,KACZgB,GACHA,EAAaG,IAQfpB,EAAiBA,EAAe3hB,MAAOgZ,IAGlCA,IAAU+J,GACbX,EAAQpJ,IAKX,MAEC+I,EAAkBzE,CAEpB,CAAE,MAAOtE,GAGRyJ,EAAezJ,CAChB,CAGAnE,EAAK0K,QAAWze,IACf+T,EAAK0K,aAAU9Z,EACfoc,IACAG,EAAgBlhB,UACT+T,EAAKuG,SAEZ,MAAMnB,EAAgBzF,GAAwBnV,IAAImiB,GAClD,GAAIvH,EAAe,CAClB,IAAK,MAAM+I,KAAe/I,EAAe,CACxC,MAAMF,EAAiBtF,GAASpV,IAAI2jB,GACpC,GAAIjJ,EAAgB,CACnB,IAAK,MAAO/W,EAAMgX,KAASD,EAAexL,UACzCyL,EAAK5c,OAAOokB,GACM,IAAdxH,EAAKxa,MAAYua,EAAe3c,OAAO4F,GAEhB,IAAxB+W,EAAeva,MAAYiV,GAASrX,OAAO4lB,EAChD,CACD,CACAxO,GAAwBpX,OAAOokB,EAChC,CAEA,MAAMyB,EAAWpO,EAAKoO,SACtB,GAAIA,EAAU,CACb,MAAMC,EAA6BpiB,EAChB,YAAhBA,EAAOqV,KACNrV,EACA,CAAEqV,KAAM,UAAWmM,OAAQxhB,GAC5B,CAAEqV,KAAM,WACX,IAAK,MAAMgN,KAAgBF,EAAUE,EAAaD,UAC3CrO,EAAKoO,QACb,GAGGR,GAAcL,EAAQK,IAIrB5N,EAAOF,GAAc6M,GASrBkB,EAAUpN,GAAcxB,QAAQvE,KAAKiS,EAAW,IACrDpc,EAAMyQ,GAAoBN,GAAiB9B,QAEtC2P,EAAWhe,EAAMyQ,GAAoBP,GAAc7B,OACnD6O,EAAShN,GAAcxB,QAAQT,OAErCwB,EAAKyN,OAASA,EAGd,IACIe,EADAvB,GAAgB,EAGpB,MAAMI,EAAuB,CAC5BQ,UACAY,OAAQle,EAAMyQ,GAAqBhY,GAClCulB,EAAShe,EAAMyQ,GAAoB,IAAMhY,EAAG0B,KAAK,SAGlD4iB,UAAU,EACV,UAAIoB,GAIH,OAHKF,IACJA,EAAkB,IAAIG,iBAEhBH,EAAgBE,MACxB,GAED,IAAI5B,EAAsC,KACtCC,EAAsC,KACtCL,GAAezH,iBAAgBjF,EAAKiF,eAAiByH,EAAczH,gBAEvE/E,GAAayM,EAAW3jB,GAGpB0jB,GAAekC,SAClB5O,EAAK6O,UAAW,GASjB,MAAM7B,EAAQ,KACTwB,IACHA,EAAgBxB,MACf,IAAIpL,GAAc,+DAEnB4M,OAAkB5d,IAIpBiX,GAAM8E,EAAW,aAEjB,MAEMmC,EAAc7iB,IACnB,IAAIghB,EAAJ,CACAA,GAAgB,EAChBjN,EAAKsJ,SAAU,EAEf0D,IACID,IACHA,IACAA,EAAiB,KACjBD,EAAiB,MAElB,IACC9M,EAAK0K,UAAUze,GAAU,CAAEqV,KAAM,WAClC,CAAE,MAAO6C,GAGRtK,GAAQ8J,KAAK,8BAA+BQ,EAC7C,EAnkCJ,SAAgCpE,GAC/B,GAA8B,eAA1BlG,GAAQuJ,cAAgC,OAC5C,MAAMzE,EAAO6B,GAAQT,GAGfgP,EAAapI,GAAcnc,IAAImU,GAC/BqQ,EAAmBpI,GAAoBpc,IAAImU,GAG3C2I,EAAWb,GAAejc,IAAImU,GACpC,GAAI2I,EAAU,CAEb,IAAK,MAAMkB,KAAclB,EAAU,CAClC,MAAM4C,EAAcxD,GAAkBlc,IAAIge,GAC1C0B,GAAa3hB,OAAOoW,EACrB,CACA8H,GAAele,OAAOoW,EACvB,CAGA,MAAMuL,EAAcxD,GAAkBlc,IAAImU,GAC1C,GAAIuL,EAAa,CAEhB,IAAK,MAAM+E,KAAc/E,EAAa,CACrC,MAAM5C,EAAWb,GAAejc,IAAIykB,GACpC3H,GAAU/e,OAAOoW,EAClB,CACA+H,GAAkBne,OAAOoW,EAC1B,CASA,GAAIoQ,EAGH,IAAK,MAAM/C,KAAa+C,EAAY,CACnC,MAAMG,EAAoBtI,GAAoBpc,IAAIwhB,GAClD,GAAIkD,IAEHA,EAAkB3mB,OAAOoW,GAErBqQ,GACH,IAAK,MAAM1D,KAAe0D,EAEpBhI,GAAiBgF,EAAWV,EAAa3M,IAC7CuQ,EAAkB3mB,OAAO+iB,EAK9B,CAGD,GAAI0D,EAGH,IAAK,MAAMhH,KAAmBgH,EAAkB,CAC/C,MAAMG,EAAoBxI,GAAcnc,IAAIwd,GAC5C,GAAImH,IAEHA,EAAkB5mB,OAAOoW,GAErBoQ,GACH,IAAK,MAAMhN,KAASgN,EAEd/H,GAAiBjF,EAAOiG,EAAiBrJ,IAC7CwQ,EAAkB5mB,OAAOwZ,EAK9B,CAKD,GAAIgN,GAAcC,EACjB,IAAK,MAAMna,KAAKka,EAAY,CAC3B,MAAMxE,EAAgB3D,GAAoBpc,IAAIqK,GAC9C,GAAI0V,EACH,IAAK,MAAMzV,KAAKka,EAGf,IAAKhI,GAAiBnS,EAAGC,EAAG6J,GAAO,CAClC4L,EAAchiB,OAAOuM,GACrB,MAAMsa,EAAUzI,GAAcnc,IAAIsK,GAClCsa,GAAS7mB,OAAOsM,EACjB,CAGH,CAID8R,GAAcpe,OAAOoW,GACrBiI,GAAoBre,OAAOoW,EAC5B,CAg+BI0Q,CAAuB1C,GACvB/Z,GAAG0I,WAAWwT,EAnBK,GAqBpB,IAxBsBrB,EAwBJ,CACjB,MAAM6B,EAAmBrjB,GAAW6iB,EAAW7iB,GAS/C,OARA2G,GAAG8I,SACF4T,EACA,KACCR,EAAW,CAAExN,KAAM,OACnB4C,GAAW,mBAAoBlb,IAEhC8lB,GAEMQ,CACR,CAEA,GAAI7B,EAAQ,CACX,MAAMC,EAAa5N,GAAc2N,GAC5BC,EAAWU,WACfV,EAAWU,SAAW,IAAIlmB,KAE3B,MAAMkmB,EAAWV,EAAWU,SAEtBmB,EAAoBtjB,IACzBmiB,EAAS7lB,OAAOgnB,GAEhBT,EAAW7iB,IAGZ,OADAmiB,EAAS9lB,IAAIinB,GACNA,CACR,CAEA,OAAQtjB,GAAW6iB,EAAW7iB,EAC/B,EACA,CACC,UAAI2iB,GACH,OAAOxX,EAAc7N,KAAM,CAAEqlB,QAAQ,GAAQ,CAAExe,KAAM,UACtD,EACA,KAAAG,CAAMH,GACL,OAAOgH,EAAc7N,KAAM,CAAE6G,QAAQ,CAAEA,KAAM,SAC9C,KAUG,SAAUyc,GAAa7jB,GAC5B,OAAOyX,GAAcxB,QAAQN,KAAK3V,EACnC,CAOM,SAAU2V,GAAQ3V,GACvB,OAAOyX,GAAc9B,KAAK3V,EAC3B,CCl6CO,MAAMwmB,GAAgB,IAAI7mB,QAGpB8mB,GAA0B,IAAI3iB,QAC3C,IAAI4iB,GAAmB,EAMhB,MAAMC,GAAe,IAAIhnB,QAGnBinB,GAA6B,IAAIjnB,iBAK9BknB,GAAiBC,EAAerC,EAAgBtf,GAC/D,IAAI4hB,EAAUP,GAAchlB,IAAIslB,GAC3BC,IACJA,EAAU,IAAI7nB,IACdsnB,GAAc5kB,IAAIklB,EAAOC,IAE1BA,EAAQznB,IAAI,CAAEmlB,SAAQtf,QACvB,UAKgB6hB,GAAoBF,EAAerC,EAAgBtf,GAClE,MAAM4hB,EAAUP,GAAchlB,IAAIslB,GAClC,GAAIC,EAAS,CACZ,IAAK,MAAME,KAASF,EACnB,GAAIE,EAAMxC,SAAWA,GAAUwC,EAAM9hB,OAASA,EAAM,CACnD4hB,EAAQxnB,OAAO0nB,GACf,KACD,CAEoB,IAAjBF,EAAQplB,MACX6kB,GAAcjnB,OAAOunB,EAEvB,CACD,CAKM,SAAUI,GAAoBhiB,GAEnC,QAAKwhB,OAEDD,GAAwBzjB,IAAIkC,IAEzBiiB,GAA0BjiB,GAClC,CAKM,SAAUkiB,GAAeC,EAAuBnP,GACrD,MAAM6O,EAAUP,GAAchlB,IAAI6lB,GAClC,GAAKN,EAEL,IAAK,MAAMtC,OAAEA,KAAYsC,EAAS,CAEjC,MAAMO,EAAqBX,GAAanlB,IAAIijB,GAC5C,GAAI6C,EAAoB,CACvB,GAAIzW,GAAQ+J,eAAeC,cAAe,CACzC,MACMwB,EADgBxL,GAAQ+J,cAAcC,cACRC,SAEpC,IAAIyM,EACkB,UAAlBlL,GAA+C,SAAlBA,IAChCkL,EAAerS,MAGhB,IAAK,MAAMsS,KAAWF,EAAoB,CACzC,MAAMG,EACa,eAAlBpL,GAAoD,SAAlBA,EAC/BR,GAAmB2L,EAAS/C,EAAQhM,SACpC7Q,EAEEoP,EAAOF,GAAc0Q,GACtBxQ,EAAKgJ,kBAAiBhJ,EAAKgJ,gBAAkB,IAClDhJ,EAAKgJ,gBAAgB3f,KAAK,CACzB6E,IAAKuf,EACLvM,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACD,CACA,IAAK,MAAMC,KAAWF,EAAoBzI,GAAM2I,EACjD,CAGAJ,GAAe3C,EAAQvM,EACxB,CACD,CAEA,SAASiP,GAA0BjiB,GAClC,MAAM6hB,EAAUP,GAAchlB,IAAI0D,GAClC,IAAK6hB,EAAS,OAAO,EAErB,IAAK,MAAMtC,OAAEA,KAAYsC,EAAS,CACjC,GAAIN,GAAwBzjB,IAAIyhB,GAAS,OAAO,EAChD,GAAI0C,GAA0B1C,GAAS,OAAO,CAC/C,CACA,OAAO,CACR,CCpGA,MAAMiD,GAAS,IAAI/nB,QAEb,SAAUgoB,GAASziB,EAAUgT,GAElC,MAAMqG,EAAO,CAAA,EACPqJ,EAAQC,GAFd3iB,EAAMsW,GAAOtW,IAGT0iB,GAAO/kB,OAAOC,OAAO8kB,EAAO,CAAE1P,YAAWqG,SAC7CmJ,GAAO9lB,IAAIsD,EAAKqZ,EACjB,CAOM,SAAUsJ,GAAS3iB,GACxBA,EAAMsW,GAAOtW,GACb,IAAI0iB,EAAQF,GAAOlmB,IAAI0D,GAKvB,OAJK0iB,IACJA,EAAQ,CAAA,EACRF,GAAO9lB,IAAIsD,EAAK0iB,IAEVA,CACR,CAEM,SAAUE,GACf5iB,EACAgT,EACA6P,EACA7L,KACG8L,GAEH,MAAMC,EAAerQ,KACrB,IAAK,MAAMnR,KAAQuhB,EAClB,IAAK,MAAM3hB,KAAOI,EAAM,CACvB,MAAM0V,EAAOD,EAAe1a,IAAI6E,GAChC,GAAI8V,EAAM,CAETA,EAAK5c,OAAO0oB,GACZ,IAAK,MAAMlR,KAAUoF,EAAM,CACLxE,GAAUZ,GAE9BmE,GAAW,oBAAqBnE,GAG5BgR,EAAQ/kB,IAAI+T,KAChBgR,EAAQnmB,IAAImV,EAAQ8E,GAAmB9E,EAAQ7R,EAAKmB,IAC/CoY,GAAW1H,IAAS+F,GAAiB/F,EAAQ7R,EAAKgT,EAAW7R,GAGpE,CACD,CACD,CACF,UAQgB6hB,GAAShjB,EAAUgT,EAAsB/S,GACxDqU,GAAQtU,EAAKgT,EAAW,CAAC/S,GAC1B,UAQgBqU,GAAQtU,EAAUgT,EAAsBiQ,GAEvDR,GADAziB,EAAMsW,GAAOtW,GACCgT,GACd,MAAMgE,EAAiBtF,GAASpV,IAAI0D,GACpC,GAAIgX,EAAgB,CAEnB,MAAM6L,EAAU,IAAIlkB,IACdukB,GAAc,CAAC,MAAO,cAAc1f,SAASwP,EAAUI,MAEzD6P,EAAOL,GAAe5iB,EAAKgT,EAAW6P,EAAS7L,EADrCkM,EAAa,CAAC3P,GAAUC,IAAU,CAACD,IACyB0P,GACrEL,GAAe5iB,EAAKgT,EAAW6P,EAAS7L,EAAgBA,EAAezV,QAC5E,MAAM6X,EAAW5a,MAAM0c,KAAK2H,EAAQthB,QAGpC,GAFAyU,GAAW,UAAWhW,EAAKgT,EAAWiQ,EAA4B7J,GAE9DzN,GAAQ+J,eAAeC,cAAe,CACzC,MACMwB,EADgBxL,GAAQ+J,cAAcC,cACRC,SAEpC,IAAIyM,EACkB,UAAlBlL,GAA+C,SAAlBA,IAChCkL,EAAerS,MAGhB,IAAK,MAAO6B,EAAQ0Q,KAAoBM,EAAS,CAChD,MAAM/Q,EAAOF,GAAcC,GACtBC,EAAKgJ,kBAAiBhJ,EAAKgJ,gBAAkB,IAClDhJ,EAAKgJ,gBAAgB3f,KAAK,CACzB6E,MACAgT,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACD,CACA1I,GAAMP,EACP,CAGImI,GAAwBzjB,IAAIkC,IAC/BkiB,GAAeliB,EAAKgT,EAEtB,CChIO,MAAMmQ,GAAStnB,OAAO,UAOvB,SAAUunB,GAAqCC,EAAU3mB,GAC9D,GAAI4W,MAAwB+P,EAAO,CAClC,MAAMnR,EAAYmR,EAAc/P,IAEhC,IAAiB,IAAbpB,EAAmB,OAAOmR,EAE9B,IAAK3mB,EAEJ,OADE2mB,EAAc/P,KAAwB,EACjC+P,EAGR3mB,EAAO2mB,EAAc/P,IAAwB,IAAItZ,IAC/CqpB,EAAc/P,KAEhB,IAAK,MAAM/Y,KAAKmC,EAAKwV,EAAS9X,IAAIG,EACnC,MAEK8oB,EAAM/P,KAAwB5W,GAAM,IAAI1C,IAAiB0C,GAC9D,OAAO2mB,CACR,CAGM,SAAUC,GAAiBtjB,EAAaC,GAC7C,GAAoB,iBAATA,GAA8B,gBAATA,EAAwB,OAAO,EAC/D,MAAMsjB,EAASvjB,EAAIsT,IACnB,OACY,IAAXiQ,GACAA,GAAQzlB,MAAMmC,KACd,CAEF,CASM,SAAUujB,MAA+DC,GAC9E,IAAK,MAAMC,KAAKD,EAASC,IAAIA,EAAE1mB,UAAkBsW,KAAwB,GACzE,OAAOmQ,EAAI,EACZ,CAEM,SAAUE,GAAc3jB,GAC7B,OAAQA,IAAqC,IAA9BA,EAAIsT,GACpB,CCpCA,SAASsQ,GAAkB/lB,GAC1B,GAAIW,MAAMoC,QAAQ/C,GAAQ,OAAOW,MAAMxB,UACvC,GAAqB,iBAAVa,EACX,IACC,OAAOA,EAAMkF,WACd,CAAE,MACD,MACD,CACD,CAEM,SAAU8gB,GAAmBC,EAAeC,GACjD,OAAID,IAAaC,MAEK,iBAAbD,IAA0BtlB,MAAMoC,QAAQkjB,IAC3B,iBAAbC,IAA0BvlB,MAAMoC,QAAQmjB,OAG7CJ,GAAcG,IACXF,GAAkBE,KAAcF,GAAkBG,IAC1D,CAiCM,SAAUC,GACfC,EACAhkB,EACA6jB,EACAC,EACAG,GAEA,MAAMlR,EAAuB,CAAEI,KAAM8Q,EAAc,MAAQ,MAAOjkB,QAElE,GACC0L,GAAQ4J,wBACK7S,IAAbohB,GACAD,GAAmBC,EAAUC,GAC5B,CACD,MACMI,EAAS,CAAEnkB,IADIsW,GAAO2N,GACQhkB,QAI9BmkB,EAAUzF,GAAU,IAAM0F,GAAeP,EAAUC,EAAU,IAAItpB,QAAW,GAAI0pB,IAI/D,IAAnBC,EAAQvjB,OAjDd,SAAyByjB,EAAgBC,GACxC,MAAMC,EAAS9S,GAASpV,IAAIgoB,GAC5B,GAAKE,EAAL,CAEA9S,GAAShV,IAAI6nB,EAAQC,GACrB9S,GAASrX,OAAOiqB,GAEhB,IAAK,MAAMrN,KAAQuN,EAAOxmB,SACzB,IAAK,MAAM6T,KAAUoF,EAAM,CAC1B,MAAMwN,EAAUhT,GAAwBnV,IAAIuV,GACxC4S,IACHA,EAAQpqB,OAAOiqB,GACfG,EAAQrqB,IAAImqB,GAEd,CAZY,CAcd,CAkCGG,CAAgBpO,GAAOwN,GAAWxN,GAAOyN,IAgKtC,SAAgCY,GACrC,IAAKA,EAAc9jB,OAAQ,OAC3B,MAAM+jB,EAAkB,IAAI5qB,IACtB6qB,EAAe,IAAIlmB,IAGnBwlB,EAASQ,EAAc,IAAIR,OACjC,IAAIW,EAGJ,GAAIX,EAAQ,CACXW,EAAiB,IAAI9qB,IACrB,MAAM+qB,EAAiBrT,GAASpV,IAAI6nB,EAAOnkB,KAC3C,GAAI+kB,EAAgB,CACnB,MAAMC,EAAgB,IAAIrmB,IAC1BikB,GACCuB,EAAOnkB,IACP,CAAEoT,KAAM,MAAOnT,KAAMkkB,EAAOlkB,MAC5B+kB,EACAD,EACA,CAACxR,IACD,CAAC4Q,EAAOlkB,OAET6kB,EAAiB,IAAI9qB,IAAIgrB,EAAczjB,OACxC,CAEA,IAAKujB,GAAgBroB,KAAM,MAC5B,CAEA,IAAK,MAAMwoB,KAAgBN,EAAe,CACzC,MAAMvhB,OAAEA,EAAM4P,UAAEA,EAAS/S,KAAEA,GAASglB,EACpC,GAAsB,iBAAX7hB,IAAwB5E,MAAMoC,QAAQwC,GAAS,SAC1D,MAAMpD,EAAMsW,GAAOlT,GACnBqf,GAASziB,EAAKgT,GACd,MAAMgE,EAAiBtF,GAASpV,IAAI0D,GACpC,IAAIklB,EACJ,MAAMC,EAAa,CAACllB,GACpB,GAAI+W,EAAgB,CACnBkO,EAAiB,IAAIvmB,IAMrB,GAJAikB,GAAe5iB,EAAKgT,EAAWkS,EAAgBlO,EADd,QAAnBhE,EAAUI,KAAiB,CAACG,GAAUC,IAAU,CAACD,IACO4R,GAIlEhB,GAAUW,EAAgB,CAC7B,MAAMM,EAAkB,IAAIzmB,IAC5B,IAAK,MAAOkT,EAAQwT,KAAeH,GAE9BJ,EAAehnB,IAAI+T,IAAWyT,GAAiBzT,EAAQiT,KAC1DM,EAAgB1oB,IAAImV,EAAQwT,GAG9BH,EAAiBE,CAClB,CAEA,IAAK,MAAMvT,KAAUqT,EAAe3jB,OAAQ,CAC3CqjB,EAAgBxqB,IAAIyX,GACpB,IAAIgM,EAASgH,EAAavoB,IAAIuV,GACzBgM,IACJA,EAAS,GACTgH,EAAanoB,IAAImV,EAAQgM,IAE1BA,EAAO1iB,KAAK8pB,EACb,CACD,CACIC,GACHlP,GAAW,UAAWhW,EAAKgT,EAAWmS,EAAY3mB,MAAM0c,KAAKgK,EAAe3jB,SAEzEggB,GAAwBzjB,IAAIkC,IAAMkiB,GAAeliB,EAAKgT,EAC3D,CACA,GAAI4R,EAAgBnoB,KAAM,CACzB,GAAIkP,GAAQ+J,eAAeC,cAAe,CACzC,MACMwB,EADgBxL,GAAQ+J,cAAcC,cACRC,SAEpC,IAAIyM,EACkB,UAAlBlL,GAA+C,SAAlBA,IAChCkL,EAAerS,MAGhB,IAAK,MAAM6B,KAAU+S,EAAiB,CACrC,MAAM9S,EAAOF,GAAcC,GACtBC,EAAKgJ,kBAAiBhJ,EAAKgJ,gBAAkB,IAClD,IAAK,MAAM1X,OAAEA,EAAM4P,UAAEA,EAAS/S,KAAEA,KAAU4kB,EAAavoB,IAAIuV,GAAU,CACpE,MAAM0Q,EACa,eAAlBpL,GAAoD,SAAlBA,EAC/BR,GAAmB9E,EAAQyE,GAAOlT,GAASnD,GAAQsT,SACnD7Q,EACJoP,EAAKgJ,gBAAgB3f,KAAK,CACzB6E,IAAKsW,GAAOlT,GACZ4P,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACD,CACD,CACA1I,GAAM,IAAIiL,GACX,CACD,CAjQGW,CAAsBnB,YFuCKpkB,EAAUgT,EAAsB/S,GAC7DD,EAAMsW,GAAOtW,GACb,MAAMgX,EAAiBtF,GAASpV,IAAI0D,GACpC,IAAKgX,EAAgB,OAErB,MAAMC,EAAOD,EAAe1a,IAAI2D,GAChC,IAAKgX,EAAM,OAEX,MAAM4L,EAAU,IAAI7oB,IACC0Y,KAErB,MAAM8S,EAAS7Z,GAAQ+J,eAAeC,cAEtC,GAAI6P,EAAQ,CACX,MAAMrO,EAAgBqO,EAAO5P,SAE7B,IAAK,MAAM/D,KAAUoF,EAAM,CAC1B,MAAMnF,EAAOF,GAAcC,GAC3B,GAAKC,EAAK6O,SAGV,GADqBlO,GAAUZ,GAE9BmE,GAAW,oBAAqBnE,OADjC,CAKA,GADAgR,EAAQzoB,IAAIyX,GACR2T,EAAQ,CACX,IAAInD,EACAE,EAEkB,UAAlBpL,GAA+C,SAAlBA,IAChCkL,EAAerS,MAEM,eAAlBmH,GAAoD,SAAlBA,IACrCoL,EAAkB5L,GAAmB9E,EAAQ7R,EAAKC,IAG9C6R,EAAKgJ,kBAAiBhJ,EAAKgJ,gBAAkB,IAClDhJ,EAAKgJ,gBAAgB3f,KAAK,CACzB6E,MACAgT,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACAzK,GAAiB/F,EAAQ7R,EAAKgT,EAAW/S,EArBzC,CAuBD,CACD,MAEC,IAAK,MAAM4R,KAAUoF,EACPrF,GAAcC,GACjB8O,WAEWlO,GAAUZ,GAE9BmE,GAAW,oBAAqBnE,IAGjCgR,EAAQzoB,IAAIyX,GACZ+F,GAAiB/F,EAAQ7R,EAAKgT,EAAW/S,KAKvC4iB,EAAQpmB,KAAO,IAClBuZ,GAAW,UAAWhW,EAAKgT,EAAW,CAAC/S,GAAOzB,MAAM0c,KAAK2H,IACzDlJ,GAAMnb,MAAM0c,KAAK2H,IAEnB,CExGE4C,CAAcxB,EAAWjR,EAAW/S,EACrC,MACC+iB,GAASiB,EAAWjR,EAAW/S,EAEjC,CAqBA,SAASylB,GAAkB1lB,GAC1B,MAAMuB,EAAO,IAAIvH,IAAiBoF,QAAQumB,QAAQ3lB,IAClD,IAAIqjB,EAAQ1lB,OAAO+C,eAAeV,GAIlC,KAAOqjB,IAAU1lB,OAAO8D,OAAO4hB,EAAO,gBAAgB,CACrD,IAAK,MAAMliB,KAAO/B,QAAQumB,QAAQtC,GAAQ9hB,EAAKnH,IAAI+G,GACnDkiB,EAAQ1lB,OAAO+C,eAAe2iB,EAC/B,CACA,OAAO9hB,CACR,CAEM,SAAU8iB,GACfP,EACAC,EACA/K,EAAwB,IAAIve,QAC5BkqB,EAAuC,GACvCR,GAEA,OAAKN,GAAmBC,EAAUC,GAEZ,iBAAbD,IAA0BtlB,MAAMoC,QAAQkjB,IAC3B,iBAAbC,IAA0BvlB,MAAMoC,QAAQmjB,IAlClD,SAAwB/K,EAAuB4M,EAAgBC,GAC9D,IAAIC,EAAS9M,EAAQ1c,IAAIspB,GAKzB,OAJKE,IACJA,EAAS,IAAIlnB,QACboa,EAAQtc,IAAIkpB,EAAQE,MAEjBA,EAAOhoB,IAAI+nB,KACfC,EAAO1rB,IAAIyrB,IACJ,EACR,CA4BKE,CAAe/M,EAAS8K,EAAUC,GAD9BY,EAGJnmB,MAAMoC,QAAQkjB,IAAatlB,MAAMoC,QAAQmjB,IAS9C,SACCiC,EACAC,EACAC,EACAvB,EACAR,GAEA,MAAMgC,EAA+B,GAC/BC,EAAYJ,EAASnlB,OACrBwlB,EAAYJ,EAASplB,OACrBylB,EAAMngB,KAAKmgB,IAAIF,EAAWC,GAEhC,IAAK,IAAIxa,EAAQ,EAAGA,EAAQya,EAAKza,IAAS,CACzC,MAAM0a,EAAS1a,EAAQua,EACjBI,EAAS3a,EAAQwa,EACvB,GAAIE,IAAWC,EAAQ,CACtBL,EAAMhrB,KAAK,CAAEiI,OAAQ4iB,EAAUhT,UAAW,CAAEI,KAAM,MAAOnT,KAAM4L,GAAS5L,KAAM4L,EAAOsY,WACrF,QACD,CACA,IAAKoC,GAAUC,EAAQ,CACtBL,EAAMhrB,KAAK,CAAEiI,OAAQ4iB,EAAUhT,UAAW,CAAEI,KAAM,MAAOnT,KAAM4L,GAAS5L,KAAM4L,EAAOsY,WACrF,QACD,CACA,IAAKoC,IAAWC,EAAQ,SACxB,MAAMC,EAAWnQ,GAAO0P,EAASna,IAC3B6a,EAAWpQ,GAAO2P,EAASpa,IAC5BlO,OAAOgpB,GAAGF,EAAUC,IACxBP,EAAMhrB,KAAK,CAAEiI,OAAQ4iB,EAAUhT,UAAW,CAAEI,KAAM,MAAOnT,KAAM4L,GAAS5L,KAAM4L,EAAOsY,UAEvF,CAEIiC,IAAcC,GACjBF,EAAMhrB,KAAK,CACViI,OAAQ4iB,EACRhT,UAAW,CAAEI,KAAM,MAAOnT,KAAM,UAChCA,KAAM,SACNkkB,WAGFQ,EAAcxpB,QAAQgrB,EACvB,CAhDES,CAAkB9C,EAAUC,EAAU/K,EAAS2L,EAAeR,GACvDQ,IAiDT,SACCiB,EACAC,EACA7M,EACA2L,EACAR,GAEA,MAAM0C,EAAUnB,GAAkBE,GAC5BkB,EAAUpB,GAAkBG,GAC5BM,EAA+B,GAErC,IAAK,MAAMhlB,KAAO0lB,EACZC,EAAQhpB,IAAIqD,IAChBglB,EAAMhrB,KAAK,CAAEiI,OAAQwiB,EAAQ5S,UAAW,CAAEI,KAAM,MAAOnT,KAAMkB,GAAOlB,KAAMkB,EAAKgjB,WAEjF,IAAK,MAAMhjB,KAAO2lB,EAAS,CAC1B,IAAKD,EAAQ/oB,IAAIqD,GAAM,CACtBglB,EAAMhrB,KAAK,CAAEiI,OAAQwiB,EAAQ5S,UAAW,CAAEI,KAAM,MAAOnT,KAAMkB,GAAOlB,KAAMkB,EAAKgjB,WAC/E,QACD,CACA,MAAMsC,EAAWnQ,GAAQsP,EAAezkB,IAClCulB,EAAWpQ,GAAQuP,EAAe1kB,IACpC0iB,GAAmB4C,EAAUC,GAChCrC,GAAeoC,EAAUC,EAAU1N,EAAS2L,EAAeR,GAChDxmB,OAAOgpB,GAAGF,EAAUC,IAC/BP,EAAMhrB,KAAK,CAAEiI,OAAQwiB,EAAQ5S,UAAW,CAAEI,KAAM,MAAOnT,KAAMkB,GAAOlB,KAAMkB,EAAKgjB,UAEjF,CAEAQ,EAAcxpB,QAAQgrB,EACvB,CA5ECY,CAAqBjD,EAAUC,EAAU/K,EAAS2L,EAAeR,GAC1DQ,GAd6CA,CAerD,CA+EA,SAASW,GACRzT,EACAmV,GAEA,IAAI9N,EAAqDrH,EACzD,MAAMmH,EAAU,IAAIpa,QACpB,KAAOsa,IAAYF,EAAQlb,IAAIob,IAAU,CAExC,GADAF,EAAQ5e,IAAI8e,GACR8N,EAAWlpB,IAAIob,GAAU,OAAO,EAEpCA,EADatH,GAAcsH,GACZqG,MAChB,CACA,OAAO,CACR,CDpMAiE,GAAiB/kB,KAAMa,OAAQT,MAAOrD,QAASkD,UACzB,oBAAXuoB,UAjBL,YAA6CjnB,GAClD,IAAK,MAAMknB,KAAKlnB,EACbknB,EAAU5T,KAAwB,EAE9BtT,EAAI,EACZ,CAaCmnB,CAAYF,OAAQG,UACpB5D,GAAiB1jB,KAAMunB,QAASC,YAAaC,YAAaC,eAAgBC,WElCpE,MAAMC,GAAa,IAAIjtB,QACjBktB,GAAa,IAAIltB,QACxBmtB,GAAe,IAAIntB,QACnBotB,GAAa,IAAI7tB,IAQjB8tB,GAAe,IAAIrtB,QAGzB,IAAIstB,IAAoB,EAExB,MAAMC,GAAgE,CACrE,CAACnsB,OAAOuG,aAAc,iBACtB,GAAA9F,CAAI0D,EAAKC,EAAMC,GACd,GAAI6nB,GAAmB,OAAOhoB,EAAUzD,IAAI0D,EAAKC,EAAMC,GACvD,GAAIF,GAAsB,iBAARA,GAAoBC,IAASpE,OAAOuG,YAAa,CAClE,MAAM6lB,EAAYP,GAAWprB,IAAI0D,EAAI+C,aACrC,GAAIklB,GAAatqB,OAAO8D,OAAOwmB,EAAWhoB,GAAO,CAChD,MAAMioB,EAAOvqB,OAAO0C,yBAAyB4nB,EAAWhoB,GACxD,GAAIioB,EAAK5rB,IAAK,CACb,IAAKqB,OAAO8D,OAAOzB,EAAKC,GAAO,OAAOioB,EAAK5rB,IAAIE,KAAKwD,GAEpD,MAAMmoB,EAAUxqB,OAAO0C,yBAAyBL,EAAKC,GACrD,GAAIkoB,EAAQ/pB,cAAgB+pB,EAAQnmB,UAAYmmB,EAAQ7rB,IAAK,OAAO4rB,EAAK5rB,IAAIE,KAAKwD,EACnF,MAAO,IAAKrC,OAAO8D,OAAOzB,EAAKC,GAAO,MAAO,IAAIjF,IAAgBktB,EAAKrqB,MAAMzC,MAAM4E,EAAKhF,EACxF,CACA,MAAMotB,EAAYT,GAAWrrB,IAAI0D,EAAI+C,aACrC,GAAIqlB,GAAazqB,OAAO8D,OAAO2mB,EAAWnoB,GAAO,OAAOmoB,EAAUnoB,EACnE,CAEA,GAAoB,iBAATA,GAA8B,gBAATA,GAA0BqjB,GAAiBtjB,EAAKC,GAC/E,OAAOF,EAAUzD,IAAI0D,EAAKC,EAAMC,GAIjC,MAAMmoB,EAAY1qB,OAAO8D,OAAOzB,EAAKC,GAK/BqoB,EACL3c,GAAQ2J,iBACR+S,GAC+B,OAA/B1qB,OAAO+C,eAAeV,KACrBG,EAAcD,EAAUD,IAASE,EAAcH,EAAKC,IAItD,IAAIsoB,EAAUF,EACVG,EAAaH,EAAYroB,OAAM0C,EACnC,IAAK2lB,EAAW,CACf,IAAII,EAAM9qB,OAAO+C,eAAeV,GAChC,KAAOyoB,GAAOA,IAAQ9qB,OAAOX,WAAW,CACvC,GAAIW,OAAO8D,OAAOgnB,EAAKxoB,GAAO,CAC7BsoB,GAAU,EACVC,EAAQC,EACR,KACD,CACAA,EAAM9qB,OAAO+C,eAAe+nB,EAC7B,CACD,CACA,MAAMC,EAAoBH,IAAYF,EAIpCE,IACE5c,GAAQ0J,iBAAmBqT,GAAqB1oB,aAAerC,QAChE2qB,IAEFzR,GAAU7W,EAAKC,IAIZyoB,IAAqBF,GAAW7c,GAAQ0J,iBAAqBrV,aAAerC,QAC/EkZ,GAAU2R,EAAOvoB,GAIlB,MAAMpC,GAASiqB,GAAaxrB,IAAI0D,IAAM1D,KAAOyD,EAAUzD,KAAK0D,EAAKC,EAAMC,GACvE,IAAKqW,GAAW1Y,IAA2B,iBAAVA,GAAgC,OAAVA,EAAgB,CACtE,MAAM8qB,EAAgBC,GAAe/qB,GAOrC,OAJImkB,GAAoBhiB,IACvB2hB,GAAiBgH,EAAe3oB,EAAKC,GAG/B0oB,CACR,CACA,OAAO9qB,CACR,EACA,GAAAnB,CAAIsD,EAAKC,EAAMpC,EAAOqC,GACrB,MAAM2oB,EAAYvS,GAAOpW,GACzB,GAAIF,IAAQ6oB,EACX,OAAOlrB,OAAOO,eAAe2qB,EAAW5oB,EAAM,CAC7CpC,QACAO,cAAc,EACd4D,UAAU,EACV8mB,YAAY,IAEd,GAAIf,GACH,MAAM,IAAIlpB,MAAM,uEAIjB,GAAIykB,GAAiBtjB,EAAKC,GAAO,OAAOF,EAAUrD,IAAIsD,EAAKC,EAAMpC,EAAOqC,GACxE,MAAM6jB,EAAWzN,GAAOzY,GAExB,GAAImC,GAAsB,iBAARA,GAAoBC,IAASpE,OAAOuG,YAAa,CAClE,MAAM6lB,EAAYjoB,EAAI+C,aAAe2kB,GAAWprB,IAAI0D,EAAI+C,aACxD,GAAIklB,GAAatqB,OAAO8D,OAAOwmB,EAAWhoB,GAAO,CAChD,MAAMioB,EAAOvqB,OAAO0C,yBAAyB4nB,EAAWhoB,GACxD,GAAIioB,EAAKxrB,IAER,OADAwrB,EAAKxrB,IAAIF,KAAKwD,EAAK+jB,IACZ,CAET,CACD,CAGA,IAAIgF,EAAS5F,GACb,MAAM6F,EAAyB,WAAT/oB,GAAqBzB,MAAMoC,QAAQZ,GACzD+nB,IAAoB,EACpB,IACK3oB,QAAQtB,IAAIkC,EAAKC,KACpB8oB,EAASC,EACNpB,GAAatrB,IAAI0D,KAAS+jB,EACzBA,EACAZ,GACD/jB,QAAQ9C,IAAI0D,EAAKC,EAAMC,GAE5B,SACC6nB,IAAoB,CACrB,CACA,GAAIxG,GAAwBzjB,IAAIkC,KACT,iBAAX+oB,GAAkC,OAAXA,GACjCjH,GAAoBiH,EAAQ/oB,EAAKC,GAEV,iBAAb8jB,GAAsC,OAAbA,GAAmB,CAEtDpC,GADsBiH,GAAe7E,GACL/jB,EAAKC,EACtC,CAUD,OARI8oB,IAAWhF,GAGVhkB,EAAUrD,IAAIsD,EAAKC,EAAM8jB,EAAU7jB,KAClC8oB,GAAepB,GAAalrB,IAAIsD,EAAK+jB,GACzCC,GAAqBhkB,EAAKC,EAAM8oB,EAAQhF,EAAUgF,IAAW5F,MAGxD,CACR,EACA,GAAArlB,CAAIkC,EAAKC,GACR,GAAI4nB,GAAW/pB,IAAIkC,GAClB,MAAM,IAAI0T,GACT,wEAAwEnU,OAAOU,MAC/E,CACC2T,KAAMH,EAAAA,kBAAkBmI,cACxBC,MAAO,KAGVgM,GAAWztB,IAAI4F,GACV+nB,IAAsBzE,GAAiBtjB,EAAKC,IAAO4W,GAAU7W,EAAKC,GACvE,MAAMiE,GAAM4jB,GAAaxrB,IAAI0D,IAAMlC,KAAOsB,QAAQtB,KAAKkC,EAAKC,GAE5D,OADA4nB,GAAWxtB,OAAO2F,GACXkE,CACR,EACA,cAAA+kB,CAAejpB,EAAKC,GACnB,IAAKtC,OAAO8D,OAAOzB,EAAKC,GAAO,OAAO,EAEtC,MAAM8oB,EAAU/oB,EAAYC,GAe5B,OAZIshB,GAAwBzjB,IAAIkC,IAA0B,iBAAX+oB,GAAkC,OAAXA,GACrEjH,GAAoBiH,EAAQ/oB,EAAKC,UAG1BD,EAAYC,GACpB+iB,GAAShjB,EAAK,CAAEoT,KAAM,MAAOnT,QAAQA,GAGjCshB,GAAwBzjB,IAAIkC,IAC/BkiB,GAAeliB,EAAK,CAAEoT,KAAM,MAAOnT,UAG7B,CACR,EACA0lB,QAAQ3lB,IACP6W,GAAU7W,EAAKwT,IACRsU,GAAaxrB,IAAI0D,IAAM2lB,UAAU3lB,IAAQZ,QAAQumB,QAAQ3lB,IAEjEK,yBAAwB,CAACL,EAAKC,IAE5B6nB,GAAaxrB,IAAI0D,IAAMK,2BAA2BL,EAAKC,IACvDb,QAAQiB,yBAAyBL,EAAKC,IAKnCipB,GAAkB,IAAItqB,QAOfuqB,GAAe5a,GAAO6a,GAClC,cAA4BA,EAC3B,WAAArmB,IAAe/H,GAKd,OAJAiI,SAASjI,GAIFkuB,GAAgBprB,gBAAkBurB,GAAShuB,MAAQA,IAC3D,IAIF,SAASutB,GAAkBU,EAAcC,GACxC,IAAKD,GAAkC,iBAAdA,EAAwB,OAAOA,EACxD,MAAMlmB,EAASkmB,EAEf,GAAI3F,GAAcvgB,GAAS,OAAOA,EAElC,GADgBiT,GAAcvY,IAAIsF,GACrB,OAAOA,EAGpB,MAAM8O,EP+WD,SAA6C9O,GAClD,OAAOgT,GAAc9Z,IAAI8G,EAC1B,COjXkBomB,CAAiBpmB,GAClC,QAAiBV,IAAbwP,EAAwB,OAAOA,EAE/BqX,GAAUzB,GAAaprB,IAAI0G,EAAQmmB,GACvC,MAAME,EAAQ,IAAIpqB,MAAM+D,EAAQ4kB,IAIhC,OAHIxpB,MAAMoC,QAAQwC,IAASwkB,GAAalrB,IAAI0G,EAAQA,EAAOvC,QPqWtD,SAAiCuC,EAAgBqmB,GACtDrT,GAAc1Z,IAAI0G,EAAQqmB,GAC1BpT,GAAc3Z,IAAI+sB,EAAOrmB,EAC1B,COtWCsmB,CAAuBtmB,EAAQqmB,GACxBA,CACR,CAMO,MAAMJ,GAAWllB,EAAU,CACjC,MAAMiB,GACL,GAAIA,EAASpI,qBAAqBmsB,GAEjC,OADAD,GAAgB9uB,IAAIgL,GACbA,EAGR,MAAMukB,UAAiBvkB,EACtB,WAAArC,IAAe/H,GAQd,OAPAiI,SAASjI,gBACU2uB,GAAaT,GAAgBprB,iBAC/C6N,GAAQ8J,KACP,GAAIrQ,EAAiBlD,8BAA8B7G,KAAK0H,YAAYb,6HAI/DmnB,GAAShuB,KACjB,EAKD,OAHAsC,OAAOO,eAAeyrB,EAAU,OAAQ,CACvC9rB,MAAO,YAAYuH,EAASlD,UAEtBynB,CACR,EACArtB,IAAI8I,GACIwjB,GAAexjB,GAEvBrB,QAAS6kB,KCjPJ,SAAUgB,GACfC,EACAvrB,GAEA,MAAMwrB,EACa,mBAAXD,EACJA,EACArrB,MAAMoC,QAAQipB,GACb,IAAMrrB,MAAM0c,KAAK,CAAEra,OAAQgpB,EAAOhpB,QAAU,CAACkf,EAAGjf,IAAMA,GACtD+oB,aAAkBlrB,IACjB,IAAMkrB,EAAOtoB,OACbsoB,aAAkB7vB,IACjB,IAAM6vB,EAAO7rB,SACb,IAAML,OAAO4D,KAAKsoB,GAEnBE,EAAa,IAAIprB,IAEjBqrB,EAAQnY,GAAOxP,MAAM,SAAbwP,CAAuB,EAAG0O,aACvC,MAAMhf,EAAO,IAAIvH,IACjB,IAAK,MAAMmH,KAAO2oB,IAAavoB,EAAKnH,IAAI+G,GAExC,IAAK,MAAMA,KAAOI,EACbwoB,EAAWjsB,IAAIqD,IACnB4oB,EAAWrtB,IACVyE,EACAof,EAAO,IAAM1O,GAAOxP,MAAM,UAAUlB,IAAvB0Q,CAA+BsN,GAAW7gB,EAAS6C,EAAKge,MAIvE,IAAK,MAAMhe,KAAO3C,MAAM0c,KAAK6O,EAAWxoB,QAClCA,EAAKzD,IAAIqD,KACb4oB,EAAWztB,IAAI6E,EAAf4oB,GACAA,EAAW1vB,OAAO8G,MAKrB,OAAQpD,IACPisB,EAAMjsB,GACN,IAAK,MAAMksB,KAAQF,EAAW/rB,SAAUisB,EAAKlsB,GAC7CgsB,EAAW5c,QAEb,UA4XgB+c,GACfL,EACA/uB,EACA6Q,GAEA,IAAK4K,GAAWsT,KAA6B,IAAlBle,GAASwe,KAAe,CAClD,MAAM7uB,EAAM,CAAA,EACZ,IAAK,MAAMoL,KAAK/I,OAAO4D,KAAKsoB,GAASvuB,EAAIoL,GAAK5L,EAAG+uB,EAAOnjB,GAAIA,GAC5D,OAAOpL,CACR,CAEA,IAAI8uB,EACJ,MAAMC,EAAc,IAAI1rB,IAClB8B,EAAQ,CAAA,EAEd,SAAS6pB,EAASnpB,GACjB,MAAM8oB,EAAOI,EAAY/tB,IAAI6E,GACzB8oB,IACHA,EAAK,CAAE7W,KAAM,YACbiX,EAAYhwB,OAAO8G,GAErB,CAqBA,SAAS7E,EAAI2D,GAEZ,QADMA,KAAQQ,IAAUR,KAAQ4pB,GApBjC,SAAqB1oB,EAAUH,GAG9B,IADmB,IAAlB2K,GAASwe,MAA2C,mBAAlBxe,GAASwe,MAAuBxe,EAAQwe,KAAKnpB,GAE/EP,EAAMU,GAAOipB,EAAM,IAAMtvB,EAAGkG,EAAKG,QAC3B,CACN,MAAM8oB,EAAOG,EAAM,IAClBvY,GAAOxP,MAAM,SAASvH,EAAGoH,QAAQf,KAAOuf,OAAQvB,IAC/C1e,EAAMU,GAAOrG,EAAG+uB,EAAO1oB,GAAMA,EAAKge,GAC1BphB,WACA0C,EAAMU,GACb6hB,GAASviB,EAAO,CAAE2S,KAAM,aAAcnT,KAAM,SAAWV,OAAO4B,IAC9D8oB,IAAO,CAAE7W,KAAM,aAAcS,MAAO9V,QAIvCssB,EAAY3tB,IAAIyE,EAAK8oB,EACtB,CACD,CAEyCM,CAAYtqB,EAAM4pB,EAAO5pB,IAC1DQ,EAAMR,EACd,CACA,MAAMwpB,EAAQJ,GAAS5oB,EAAO,CAC7BnE,IAAG,CAACyjB,EAAG9f,IACC3D,EAAI2D,GAEZnC,IAAG,CAACiiB,EAAG9f,IACCA,KAAQ4pB,EAEhBlE,QAAO,IACCvmB,QAAQumB,QAAQkE,GAExB,wBAAAxpB,CAAyBmqB,EAAQvqB,GAChC,GAAIA,KAAQ4pB,EAAQ,MAAO,CAAEzrB,cAAc,EAAM0qB,YAAY,EAAMxsB,IAAK,IAAMA,EAAI2D,GACnF,IAGD,IAAIwqB,EAAuB9H,GAASkH,GACpC,MAAMa,EAAW7Y,GAAOxP,MAAM,SAASvH,EAAGoH,OAAzB2P,CAAiC,EAAG0O,aAIpD,IAHA6J,EAAQ7J,EAER1J,GAAUgT,EAAQrW,IACX,cAAeiX,GAAe,CACpC,MAAMzX,UAAEA,GAAcyX,EACtBA,EAAgBA,EAAcpR,KACP,QAAnBrG,EAAUI,KACb4P,GAASviB,EAAOuS,EAAWA,EAAU/S,MACR,QAAnB+S,EAAUI,OACpBkX,EAAStX,EAAU/S,aACZQ,EAAMuS,EAAU/S,MACvB+iB,GAASviB,EAAOuS,EAAWA,EAAU/S,MAEvC,IAGD,OAAO2S,GAAK6W,EAAQ1rB,IACnB2sB,EAAS3sB,GACT,IAAK,MAAMksB,KAAQI,EAAYrsB,SAAUisB,EAAKlsB,GAC9CssB,EAAYld,SAEd,CAiDO,MAAMwd,GAAQ3hB,EACpB,SAAe6gB,EAAa/uB,EAAS6Q,GACpC,OAAInN,MAAMoC,QAAQipB,IAA6B,mBAAXA,WA9XrCA,EACA/uB,EACA6Q,GAEA,GAAsB,mBAAXke,IAA0BtT,GAAWsT,KAA6B,IAAlBle,GAASwe,KACnE,OAAON,EAAO7f,IAAKlJ,GAAMhG,EAAGgG,IAG7B,IAAIspB,EACJ,MAAMC,EAAc,IAAI1rB,IAClB8B,EAAQ,GACd,IAAImqB,EAAsB,GAE1B,SAASN,EAASnpB,GACjB,MAAM4gB,EAAQsI,EAAY/tB,IAAI6E,GAC1B4gB,IACHA,EAAMkI,KAAK,CAAE7W,KAAM,YACnBiX,EAAYhwB,OAAO8G,GAErB,CAEA,SAASopB,EAAYppB,EAAaypB,GAGjC,IADmB,IAAlBjf,GAASwe,MAA2C,mBAAlBxe,GAASwe,MAAuBxe,EAAQwe,KAAKS,GAE/ER,EAAM,KACL3pB,EAAMU,GAAOrG,EAAG8vB,SAEX,CACN,MAAMC,EAAW,CAAEhtB,MAAOsD,GACpB8oB,EAAOG,EAAM,IAClBvY,GAAOxP,MAAM,SAASvH,EAAGoH,QAAQf,KAAOuf,OAAQvB,IAC/C1e,EAAMoqB,EAAShtB,OAAS/C,EAAG8vB,EAAOzL,GAC1BphB,WACA0C,EAAMoqB,EAAShtB,OACtBmlB,GAASviB,EAAO,CAAE2S,KAAM,aAAcnT,KAAM,SAAWV,OAAO4B,IAC9D8oB,IAAO,CAAE7W,KAAM,aAAcS,MAAO9V,QAIvCssB,EAAY3tB,IAAIyE,EAAK,CAAE8oB,OAAMpe,MAAOgf,GACrC,CACD,CAEA,MAAMpB,EAAQJ,GAAS5oB,EAAO,CAC7B,GAAAnE,CAAImE,EAAOR,GACV,MAAM6qB,EAAoB,iBAAT7qB,EAAoBT,OAAOS,GAAQ8qB,IACpD,OAAIvrB,OAAOwrB,MAAMF,GAAWrqB,EAAMR,IAC5B6qB,KAAKrqB,GAAQ8pB,EAAYO,EAAGF,EAAME,IACjCrqB,EAAMqqB,GACd,EACAhtB,IAAG,CAAC0sB,EAAQvqB,IACJb,QAAQtB,IAAI8sB,EAAO3qB,KAItByqB,EAAW7Y,GAAOxP,MAAM,SAASvH,EAAGoH,OAAzB2P,CAAiC,EAAG0O,aACpD6J,EAAQ7J,EACR,MAAM0K,EAAW,IAAuB,mBAAXpB,EAAwBA,IAAWA,GAC1DqB,EAAQ7lB,EAAUulB,EAAOK,GAAU9e,SAAS,CAAC5L,EAAGC,IAAMA,EAAEqF,OAAStF,EAAEsF,QAEzE,GAAIqlB,EAAMrqB,OAAS,EAAG,CACrB,IAAK,MAAMsqB,KAAQD,EAAO,CAEzB,IAAK,IAAIpqB,EAAIqqB,EAAKtlB,OAAQ/E,EAAIqqB,EAAKtlB,OAASslB,EAAKplB,OAAOlF,OAAQC,IAAKwpB,EAASxpB,GAG9E,MAAMqY,EAAQgS,EAAKnlB,OAAOnF,OAASsqB,EAAKplB,OAAOlF,OAC/C,GAAc,IAAVsY,EAAa,CAEhB,MAAM3N,EAAUhN,MAAM0c,KAAKmP,EAAY7e,WAAWa,KAAK,CAAC9L,EAAGC,IAAMD,EAAE,GAAKC,EAAE,IAE1E,IAAK,MAAO4qB,EAAKC,KAAW7f,EACvB4f,GAAOD,EAAKtlB,OAASslB,EAAKplB,OAAOlF,QACpCwpB,EAAYhwB,OAAO+wB,GAIrB,IAAK,MAAOA,EAAKrJ,KAAUvW,EAC1B,GAAI4f,GAAOD,EAAKtlB,OAASslB,EAAKplB,OAAOlF,OAAQ,CAC5C,MAAMyqB,EAASF,EAAMjS,EACrB4I,EAAMlW,MAAMhO,MAAQytB,EACpBjB,EAAY3tB,IAAI4uB,EAAQvJ,EACzB,CAEF,CAGAthB,EAAM8qB,OACLJ,EAAKtlB,OACLslB,EAAKplB,OAAOlF,UACT,IAAIrC,MAAM2sB,EAAKnlB,OAAOnF,QAAQ2qB,UAAK9oB,IAIvC,IAAK,IAAI5B,EAAIqqB,EAAKtlB,OAAQ/E,EAAIqqB,EAAKtlB,OAASslB,EAAKnlB,OAAOnF,OAAQC,WAAYL,EAAMK,EACnF,CAEA,MAAM2qB,EAAc,IAAIzxB,IAAiB,CAACwZ,KACtCoX,EAAM/pB,SAAWoqB,EAASpqB,QAAQ4qB,EAAYrxB,IAAI,UACtD,IAAK,MAAM+wB,KAAQD,EAAO,CACzB,MAAM5E,EAAMngB,KAAKmgB,IAAI6E,EAAKplB,OAAOlF,OAAQsqB,EAAKnlB,OAAOnF,QACrD,IAAK,IAAIC,EAAI,EAAGA,EAAIwlB,EAAKxlB,IAAK2qB,EAAYrxB,IAAImF,OAAO4rB,EAAKtlB,OAAS/E,GACpE,CACAwT,GAAQ7T,EAAO,CAAE2S,KAAM,QAAStP,OAAQ,eAAiB2nB,EAC1D,CAEAb,EAAQK,IAGT,OAAOrY,GAAK6W,EAAQ1rB,IACnB2sB,EAAS3sB,GACT,IAAK,MAAMgkB,KAASsI,EAAYrsB,SAAU+jB,EAAMkI,KAAKlsB,GACrDssB,EAAYld,SAEd,CA4QUue,CAAW7B,EAAQ/uB,EAAI6Q,GAC3Bke,aAAkBlrB,aA/PvBkrB,EACA/uB,EACA6Q,GAEA,IAAK4K,GAAWsT,KAA6B,IAAlBle,GAASwe,KAAe,CAClD,MAAM7uB,EAAM,IAAIqD,IAChB,IAAK,MAAO+H,EAAGqG,KAAM8c,EAAQvuB,EAAIoB,IAAIgK,EAAG5L,EAAGiS,EAAGrG,IAC9C,OAAOpL,CACR,CAEA,IAAI8uB,EACJ,MAAMC,EAAc,IAAI1rB,IAClB8B,EAAQ,IAAI9B,IAGlB,SAAS2rB,EAASnpB,GACjB,MAAM8oB,EAAOI,EAAY/tB,IAAI6E,GACzB8oB,IACHA,EAAK,CAAE7W,KAAM,YACbiX,EAAYhwB,OAAO8G,GAErB,CAEA,SAASopB,EAAYppB,EAAUH,GAG9B,IADmB,IAAlB2K,GAASwe,MAA2C,mBAAlBxe,GAASwe,MAAuBxe,EAAQwe,KAAKnpB,GAE/EP,EAAM/D,IACLyE,EACAipB,EAAM,IAAMtvB,EAAGkG,EAAKG,SAEf,CACN,MAAM8oB,EAAOG,EAAM,IAClBvY,GAAOxP,MAAM,SAASvH,EAAGoH,QAAQf,KAAOuf,OAAQvB,IAC/C1e,EAAM/D,IAAIyE,EAAKrG,EAAG+uB,EAAOvtB,IAAI6E,GAAMA,EAAKge,IAChCphB,IACP0C,EAAMpG,OAAO8G,GACb6hB,GAASviB,EAAO,CAAE2S,KAAM,aAAcnT,KAAM,SAAWV,OAAO4B,IAC9D8oB,IAAO,CAAE7W,KAAM,aAAcS,MAAO9V,QAIvCssB,EAAY3tB,IAAIyE,EAAK8oB,EACtB,CACD,CA/BAtsB,OAAOO,eAAeuC,EAAO,cAAe,CAAE5C,MAAOF,OAAQmrB,YAAY,IAiCzE,MAAMW,EAAQJ,GAAS5oB,EAAO,CAC7BnE,IAAG,CAACmE,EAAOR,IACG,QAATA,EACKkB,KACFV,EAAM3C,IAAIqD,IAAQ0oB,EAAO/rB,IAAIqD,IAAMopB,EAAYppB,EAAK0oB,EAAOvtB,IAAI6E,IAC7DV,EAAMnE,IAAI6E,IAEN,QAATlB,EACKkB,GACA0oB,EAAO/rB,IAAIqD,GAEP,SAATlB,EACI,IACC4pB,EAAOtoB,OAEH,WAATtB,EACI,YACN,IAAK,MAAMkB,KAAO0oB,EAAOtoB,aAClBkoB,EAAMntB,IAAI6E,EAElB,EACY,YAATlB,GAMAA,IAASpE,OAAOkO,SALZ,YACN,IAAK,MAAM5I,KAAO0oB,EAAOtoB,YAClB,CAACJ,EAAKsoB,EAAMntB,IAAI6E,GAExB,EAOOV,EAAcR,KAIxB,IAAIwqB,EAAuB9H,GAASkH,GACpC,MAAMa,EAAW7Y,GAAOxP,MAAM,SAASvH,EAAGoH,OAAzB2P,CAAiC,EAAG0O,aAGpD,IAFA6J,EAAQ7J,EACR1J,GAAUgT,EAAQrW,IACX,cAAeiX,GAAe,CACpC,MAAMzX,UAAEA,GAAcyX,EACtBA,EAAgBA,EAAcpR,KACP,QAAnBrG,EAAUI,KACb4P,GAASviB,EAAOuS,EAAWA,EAAU/S,MACR,QAAnB+S,EAAUI,OACpBkX,EAAStX,EAAU/S,MACnBQ,EAAMpG,OAAO2Y,EAAU/S,MACvB+iB,GAASviB,EAAOuS,EAAWA,EAAU/S,MAEvC,IAGD,OAAO2S,GAAK6W,EAAQ1rB,IACnB2sB,EAAS3sB,GACT,IAAK,MAAMksB,KAAQI,EAAYrsB,SAAUisB,EAAKlsB,GAC9CssB,EAAYld,SAEd,CAsJoCwe,CAAS9B,EAAQ/uB,EAAI6Q,GAChDue,GAAYL,EAAQ/uB,EAAI6Q,EAChC,EACA,CACC,QAAIwe,GACH,MAAO,CAACN,EAAa/uB,EAAS8wB,IAASvwB,KAAKwuB,EAAQ/uB,EAAI,CAAEqvB,MAAM,GACjE,ICrlBI,SAAU0B,GACfzoB,EACA9E,GACAsc,UAAEA,GAAY,GAAU,IAExB,GAAIxX,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,MAAM,IAAIvE,MAAM,6CAEhD,MAAMitB,EAAiC9Z,GAAY,IAC3C1T,EAAS8E,GAChB9E,GAMD,ON9BAkjB,KM8BO3P,GAAOxP,MAAM,YAAbwP,CAA0B,KAEhC0P,GAAwBnnB,IAAIgJ,GAG5B,IAAI8T,EAAgBwK,GAA2BplB,IAAIwvB,GAC9C5U,IACJA,EAAgB,IAAIld,IACpB0nB,GAA2BhlB,IAAIovB,EAAiB5U,IAEjDA,EAAe9c,IAAIgJ,GAInB,MAAM4V,EAAU,IAAIpa,QAkEpB,OAjEA,SAASmtB,EAAiB/rB,EAAU+L,EAAQ,GAE3C,MAAK/L,GAAOgZ,EAAQlb,IAAIkC,IAAuB,iBAARA,GAAoB+L,EAAQJ,GAAQyJ,mBAGvEuO,GAAc3jB,IAAlB,CACAgZ,EAAQ5e,IAAI4F,GAGZuhB,GAAwBnnB,IAAI4F,GAC5BkX,EAAe9c,IAAI4F,GAInB,IAAK,MAAMmB,KAAOmV,GAAOtW,GACxB,GAAIrC,OAAO8D,OAAOzB,EAAKmB,GAAM,CAE5B,MAAMtD,EAASmC,EAAYmB,GAI3B4qB,EADkB,iBAAVluB,GAAgC,OAAVA,EAAiBwrB,GAASxrB,GAASA,EACjCkO,EAAQ,EACzC,CAKD,GAAoC,mBAAzB/L,EAAInE,OAAOkO,UAA0B,CAE/C,IAAK,MAAMlM,KAASmC,EAAK,CAIxB+rB,EADkB,iBAAVluB,GAAgC,OAAVA,EAAiBwrB,GAASxrB,GAASA,EACjCkO,EAAQ,EACzC,CAQA,GALI,WAAY/L,GACf6W,GAAU7W,EAAK,UAIZA,aAAerB,IAClB,IAAK,MAAMd,KAASmC,EAAIhC,SAAU,CAGjC+tB,EADkB,iBAAVluB,GAAgC,OAAVA,EAAiBwrB,GAASxrB,GAASA,EACjCkO,EAAQ,EACzC,CAEF,CA5CwB,CA+CzB,CAIAggB,CAAiB3oB,GAGbwX,GACH+D,GAAU,IAAMrgB,EAAS8E,IAE1BwX,GAAY,EAGL,KAEN,MAAM1D,EAAgBwK,GAA2BplB,IAAIwvB,GACrD,GAAI5U,EAAe,CAElB,IAAK,MAAMlX,KAAOkX,EAAe,CAEhC,MAAMxF,EAAW+P,GAAanlB,IAAI0D,GAC9B0R,GAEHA,EAASrX,OAAOyxB,GAGM,IAAlBpa,EAASjV,OACZglB,GAAapnB,OAAO2F,GACpBuhB,GAAwBlnB,OAAO2F,KAIhCuhB,GAAwBlnB,OAAO2F,EAEjC,CAGA0hB,GAA2BrnB,OAAOyxB,EACnC,IAGH,CCrIA,MAAME,GAAmB,IAAIvxB,QACvBwxB,GAAkB,IAAIxxB,QAE5B,SAASyxB,GACRC,EACAhrB,GAEAgrB,EAAKC,WAALD,EAAKC,SAAa,IAAI3xB,SACtB,IAAI4xB,EAASF,EAAKC,SAAS9vB,IAAI6E,GAK/B,OAJKkrB,IACJA,EAAS,CAAA,EACTF,EAAKC,SAAS1vB,IAAIyE,EAAKkrB,IAEjBA,CACR,CAEA,SAASC,GACRxxB,EACAsO,GAIA,MAAMmjB,EAASja,GAAQxX,GACjBoX,EAAW8Z,GAAiB1vB,IAAIiwB,GACtC,GAAIra,EAAU,OAAOA,EAErB,MAAMsa,EAAmC,CAAA,EACnCC,EAAWza,GAAa,YAAqBhX,GAClD,GAAIA,EAAKqQ,KAAMqhB,KAAUA,GAAO,CAAC,SAAU,SAAU,YAAYlpB,gBAAgBkpB,KAAQ,CACxF,GAAItjB,GAAMujB,QAAS,OAAO7xB,EAAGM,MAAMC,KAAML,GACzC,MAAM,IAAI6D,MAAM,4CACjB,CAEA,IAAIiT,EAA8B0a,EAElC,IAAK,MAAME,KAAO1xB,EACjB8W,EAAOoa,GAAUpa,EAAM4a,GAIxB,GADA7V,GAAU/E,EAAM,WACZ,WAAYA,EAAM,CACrB,GAAInG,GAAQsJ,yBAA0B,CACrC,MAAM2X,EAAkBjhB,GAAQwJ,kBAChCxJ,GAAQwJ,mBAAoB,EAC5B,IACC,MAAM0X,EAAQlO,GAAU,IAAM7jB,EAAGM,MAAMC,KAAML,IACxCsF,EAAYwR,EAAKyI,OAAQsS,IAC7B7W,GAAW,2BAA4BlE,EAAKyI,OAAQsS,EAAO/xB,EAAIE,EAAM,cAEvE,SACC2Q,GAAQwJ,kBAAoByX,CAC7B,CACD,CACA,OAAO9a,EAAKyI,MACb,CA0BA,GAtBAzI,EAAK0K,QAAU/L,GAAK,IACnBoB,GAAOxP,MAAM,UAAbwP,CACC,KAGCC,EAAKyI,OAASzf,EAAGM,MAAMC,KAAML,GACrB+C,WAEA+T,EAAKyI,OACZyI,GAASlR,EAAM,CAAEsB,KAAM,aAAcnT,KAAMjF,GAAQ,WAG/C8W,EAAK0K,UACR1K,EAAK0K,QAAQ,CAAEpJ,KAAM,aAAcS,MAAO9V,IAC1C+T,EAAK0K,aAAU9Z,KAIlB,CAAEge,QAAQ,KAIR/U,GAAQsJ,yBAA0B,CACrC,MAAM2X,EAAkBjhB,GAAQwJ,kBAChCxJ,GAAQwJ,mBAAoB,EAC5B,IACC,MAAM0X,EAAQlO,GAAU,IAAM7jB,EAAGM,MAAMC,KAAML,IACxCsF,EAAYwR,EAAKyI,OAAQsS,IAC7B7W,GAAW,2BAA4BlE,EAAKyI,OAAQsS,EAAO/xB,EAAIE,EAAM,aAEvE,SACC2Q,GAAQwJ,kBAAoByX,CAC7B,CACD,CAEA,OAAO9a,EAAKyI,MACb,EAAGzf,GAIH,OAFAkxB,GAAiBtvB,IAAI6vB,EAAQE,GAC7BT,GAAiBtvB,IAAI+vB,EAAUA,GACxBA,CACR,CAgFA,SAASK,GAAqBC,GAC7B,OAAO5oB,EAAU,CAChBT,OAAM,CAAC0B,EAAUhC,EAAQC,IACjB,WACN,IAAI2pB,EAAUf,GAAgB3vB,IAAI8I,GAClC,IAAK4nB,EAAS,CACbA,EAAUhb,GACT3P,EACC,GAAG9C,OAAO6D,GAAQL,aAAab,MAAQkB,GAAQlB,MAAQ,aAAa3C,OAAO8D,KAC1E2K,GACO5I,EAAS5I,KAAKwR,IAGvB,CACClK,OAAQsB,EACR/B,gBAGF,MAAM4pB,EAAW7nB,EAASoM,IACtByb,IAAUD,EAAQxb,IAAsByb,GAC5ChB,GAAgBvvB,IAAI0I,EAAU4nB,EAC/B,CAEA,OADiBV,GAAgBU,EAAgBD,EAC1CN,CAASpxB,KACjB,EAEDyI,OAAM,CAACsB,EAAUhC,EAAQlB,IACjB,YAAwBlH,GAC9B,IAAIgyB,EAAUf,GAAgB3vB,IAAI8I,GAClC,IAAK4nB,EAAS,CACbA,EAAUhb,GACT3P,EACC,GAAG9C,OAAO6D,GAAQL,aAAab,MAAQkB,GAAQlB,MAAQ,aAAa3C,OAAO2C,KAC3E,CAAC8L,KAAiBhT,IACVoK,EAAS5I,KAAKwR,KAAShT,IAGhC,CACC8I,OAAQsB,EACR/B,YAAanB,IAGf,MAAM+qB,EAAW7nB,EAASoM,IACtByb,IAAUD,EAAQxb,IAAsByb,GAC5ChB,GAAgBvvB,IAAI0I,EAAU4nB,EAC/B,CAIA,OAHiBV,GAAgBU,EAAgBD,EAG1CN,CAASpxB,QAASL,EAC1B,EAED+I,QAAgCX,GACb,iBAAXA,EAnIV,SAAsDA,EAAWgG,GAChE,MAAM8I,EAAW8Z,GAAiB1vB,IAAI8G,GACtC,GAAI8O,EAAU,OAAOA,EAErB,MAAMuX,EAAQ,IAAIpqB,MAAM+D,EAAQ,CAC/B,GAAA9G,CAAIutB,EAAQ5pB,EAAMC,GAEjB,IACIgoB,EADAhP,EAAU2Q,EAEd,KAAO3Q,IACNgP,EAAOvqB,OAAO0C,yBAAyB6Y,EAASjZ,IAC5CioB,IACJhP,EAAUvb,OAAO+C,eAAewY,GAEjC,IAAKgP,EAAM,OAAO9oB,QAAQ9C,IAAIutB,EAAQ5pB,EAAMC,GAE5C,GAAIgoB,EAAK5rB,IAAK,CACb,MAAM4wB,EAAiBhF,EAAK5rB,IAC5B,IAAI0wB,EAAUf,GAAgB3vB,IAAI4wB,GAClC,IAAKF,EAAS,CACbA,EAAUhb,GACT3P,EACC,GAAG9C,OAAOsqB,GAAQ9mB,aAAab,MAAQ,aAAa3C,OAAOU,KAC1D+N,GACOkf,EAAe1wB,KAAKwR,IAG7B,CACC3K,YAAapD,IAGf,MAAMgtB,EAAWC,EAAe1b,IAC5Byb,IAAUD,EAAQxb,IAAsByb,GAC5ChB,GAAgBvvB,IAAIwwB,EAAgBF,EACrC,CAEA,OADiBV,GAAgBU,EAAS5jB,EACnCqjB,CAASvsB,EACjB,CAGA,OAAOd,QAAQ9C,IAAIutB,EAAQ5pB,EAAMC,EAClC,EAEAxD,IAAG,CAACmtB,EAAQ5pB,EAAMpC,EAAOsvB,IAGjB/tB,QAAQ1C,IAAImtB,EAAQ5pB,EAAMpC,EAAOgsB,KAM1C,OAFAxT,GAAc3Z,IAAI+sB,EAAOrmB,GACzB4oB,GAAiBtvB,IAAI0G,EAAQqmB,GACtBA,CACR,CA+EO2D,CAAchqB,EAAQ2pB,GACtBT,GAAgBlpB,EAAQ2pB,IAE/B,OAEaM,GAETrkB,EAAS8jB,KAAwB,CACpC,WAAIH,GACH,OAAOG,GAAqB,CAAEH,SAAS,GACxC,IClPD,MAAMW,GAAWzxB,OAAO,aA2CX0xB,GAAQvkB,EACpB,SACCnL,EACA2vB,EACA7hB,EAAe,CAAA,GAEf,MAAwB,mBAAV9N,EA+BhB,SACCA,EACA2vB,GACA5S,UAAEA,GAAY,EAAK6S,KAAEA,GAAO,GAAU,IAEtC,IACIC,EADA5J,EAAgCwJ,GAEpC,MAAMK,EAAY9b,GAAOxP,MAAM,iBAAbwP,CACjBG,GAAcmN,IACb,MAAM4E,EAAWlmB,EAAMshB,GACvB,GAAI2E,IAAaC,EAAU,CAC1B,MAAM6J,EAAM9J,EACR8J,IAAQN,GACP1S,GAAW+D,GAAU,IAAM6O,EAAQzJ,IACjCpF,GAAU,IAAM6O,EAAQzJ,EAAU6J,GAC1C,CACA9J,EAAWC,EACP0J,IACCC,GAAaA,IACjBA,EAAc7B,GAAU9H,EAAqBlmB,GAAU2vB,EAAQ3vB,EAAYA,MAE1EA,IAEJ,WACC8vB,IACID,GAAaA,GACjB,CACF,CAzDKG,CAAchwB,EAAO2vB,EAAS7hB,GACb,iBAAV9N,GAAgC,OAAVA,EAgBlC,SACCA,EACA2vB,GACA5S,UAAEA,GAAY,EAAK6S,KAAEA,GAAO,GAAU,IAEtC,OAAIA,EAAa5B,GAAUhuB,EAAO2vB,EAAS,CAAE5S,cACtC/I,GAAOxP,MAAM,eAAbwP,CAA6B,KACnCgF,GAAUhZ,GACN+c,GAAW4S,EAAQ3vB,GACvB+c,GAAY,GAEd,CA1BMkT,CAAYjwB,EAAO2vB,EAAS7hB,GAC5B,MACA,MAAM,IAAI9M,MAAM,+CAChB,EAFA,EAGL,EACA,CACC,QAAI4uB,GACH,OAAOvkB,EAAc7N,KAAM,CAAEoyB,MAAM,GACpC,EACA,aAAI7S,GACH,OAAO1R,EAAc7N,KAAM,CAAEuf,WAAW,GACzC,IA+HK,MAAMmT,GAAa5pB,EAAU,CACnC,MAAMiB,GAEHA,EAASpI,UAAkBsW,KAAwB,CACtD,EACAvP,QA/BD,SACCiqB,KACGhzB,GAEH,MAAuB,iBAATgzB,GAVVrK,GADJ3jB,EAAMsW,GADwBtW,EAaRguB,MAVpBhuB,EAAYsT,KAAwB,GADPtT,GAYzBoF,IAEH,MAAM6oB,EAAgB7oB,EAASpI,UAAkBsW,IAEjD,IAAqB,IAAjB2a,EACD7oB,EAASpI,UAAkBsW,KAAwB,MAC/C,CACN,MAAM5W,EAAM,IAAI1C,IAAiBi0B,GAAgB,IAEjDvxB,EAAItC,IAAI4zB,GACR,IAAK,MAAMtB,KAAO1xB,EAAM0B,EAAItC,IAAIsyB,GAChCtJ,GAAmBhe,EAASpI,UAAWN,EACxC,CACA,OAAO0I,CACP,EA5BJ,IAA+BpF,CA6B/B,ICvMM,SAAWkuB,GAAwBnkB,GACxC,IAAIwQ,EAASxQ,EAASsP,OACtB,MAAQkB,EAAO4T,YACR9E,GAAS9O,EAAO1c,OACtB0c,EAASxQ,EAASsP,MAEpB,CAKM,SAAW+U,GAAkCrkB,GAClD,IAAIwQ,EAASxQ,EAASsP,OACtB,MAAQkB,EAAO4T,MAAM,CACpB,MAAOhtB,EAAKtD,GAAS0c,EAAO1c,WACtB,CAACwrB,GAASloB,GAAMkoB,GAASxrB,IAC/B0c,EAASxQ,EAASsP,MACnB,CACD,CCXM,MAAgBgV,WAAgB7vB,MACrC,GAAAlC,CAAIwE,GAEH,OADA+V,GAAUxb,KAAMyF,GACTuoB,GAAShuB,KAAKyF,GACtB,CAGA,GAAApE,CAAIoE,EAAWjD,GACd,MAAMoT,EAAQnQ,GAAKzF,KAAKwF,OACxBxF,KAAKyF,GAAKjD,EACVyW,GAAQjZ,KAAM,CAAE+X,KAAM,MAAOnT,KAAMa,GAdrC,UAAgBA,GAAWD,OAAEA,GAAS,GAAS,CAAA,GAC1CA,SAAc,gBACZC,CACP,CAW0C+K,CAAM/K,EAAG,CAAED,OAAQoQ,IAC5D,EAED,MAAMqd,GAAY,CAAEhyB,IAAKyD,EAAUzD,IAAKI,IAAKqD,EAAUrD,KAEvD,SAAS6xB,GAAQtuB,GAChB,MAAMyjB,EAAIzjB,EAAKuuB,WAAW,GAC1B,GAAI9K,EAAI,IAAMA,EAAI,GAAI,SACtB,MAAMoH,GAAK7qB,EACX,OAAO6qB,KAAW,EAAJA,IAAUA,GAAK,EAAIA,GAAI,CACtC,CACAntB,OAAOC,OAAOmC,EAAW,CACxB,GAAAzD,CAAI0D,EAAUC,EAAWC,GACxB,GAAI1B,MAAMoC,QAAQZ,IAAwB,iBAATC,EAAmB,CACnD,MAAMa,EAAIytB,GAAQtuB,GAClB,GAAIa,GAAK,EAAG,OAAOutB,GAAQrxB,UAAUV,IAAIE,KAAKwD,EAAKc,EACpD,CACA,OAAOwtB,GAAUhyB,IAAI0D,EAAKC,EAAMC,EACjC,EACA,GAAAxD,CAAIsD,EAAUC,EAAWpC,EAAYqC,GACpC,GAAI1B,MAAMoC,QAAQZ,IAAwB,iBAATC,EAAmB,CACnD,MAAMa,EAAIytB,GAAQtuB,GAClB,GAAIa,GAAK,EAAG,OAAOutB,GAAQrxB,UAAUN,IAAIF,KAAKwD,EAAKc,EAAGjD,EACvD,CACA,OAAOywB,GAAU5xB,IAAIsD,EAAKC,EAAMpC,EAAOqC,EACxC,QAYqBuuB,GAAoB,oCAASjwB,WAA7B,OAAAkL,EAAA,cAA6BglB,EAClD,EAAA9iB,CAAGC,GACF,OAAOwd,GAASpmB,MAAM2I,GAAGC,GAC1B,CAEA,MAAAX,IAAUC,GACT,OAAOke,GAASpmB,MAAMiI,UAAUC,EAAMnB,IAAIsM,KAC3C,CAEA,OAAA9K,GAEC,OADAqL,GAAUxb,KAAMmY,IACT4a,GAA4BnrB,MAAMuI,UAC1C,CAOA,KAAAJ,CAAMhB,EAA6DF,GAClE,OAAOjH,MAAMmI,MAAM,CAAC2B,EAAGjM,EAAGP,IAAM6J,EAAU5N,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,GAAI2J,EAC7E,CAGA,IAAAshB,CAAK3tB,EAAY2H,EAAgByF,GAChC,OAAOhI,MAAMuoB,KAAKlV,GAAOzY,GAAQ2H,EAAOyF,EACzC,CAGA,UAAA0jB,CAAWvrB,EAAgBoC,EAAeyF,GACzC,OAAOhI,MAAM0rB,WAAWvrB,EAAQoC,EAAOyF,EACxC,CAIA,MAAAd,CAAOC,EAAiEF,GACvE,OAAOmf,GAASpmB,MAAMkH,OAAO,CAAC4C,EAAGjM,EAAGP,IAAM6J,EAAU5N,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,GAAI2J,GACvF,CAUA,IAAAO,CAAKL,EAAiEF,GACrE,OAAOmf,GAASpmB,MAAMwH,KAAK,CAACsC,EAAGjM,EAAGP,IAAM6J,EAAU5N,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,GAAI2J,GACrF,CAEA,SAAAQ,CACCN,EACAF,GAEA,OAAOjH,MAAMyH,UAAU,CAACqC,EAAGjM,EAAGP,IAAM6J,EAAU5N,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,GAAI2J,EACjF,CAUA,QAAAS,CAASP,EAAiEF,GACzE,OAAOmf,GACNpmB,MAAM0H,SAAS,CAACoC,EAAGjM,EAAGP,IAAM6J,EAAU5N,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,GAAI2J,GAE1E,CAEA,aAAAU,CACCR,EACAF,GAEA,OAAOjH,MAAM2H,cAAc,CAACmC,EAAGjM,EAAGP,IAAM6J,EAAU5N,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,GAAI2J,EACrF,CAEA,IAAA4B,CAAKC,GACJ,OAAOsd,GAASpmB,MAAM6I,KAAKC,GAC5B,CAEA,OAAAC,CAAQ/B,EAA8DC,GACrE,OAAOmf,GACNpmB,MAAM+I,QAAQ,CAACe,EAAGjM,EAAGP,IAAM+V,GAAOrM,EAAWzN,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,IAAK2J,GAElF,CAEA,OAAAM,CAAQP,EAA+DC,GACtEjH,MAAMuH,QAAQ,CAACuC,EAAGjM,EAAGP,KACpB0J,EAAWzN,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,IACvC2J,EACJ,CAEA,QAAA1G,CAASqH,EAAoBC,GAC5B,OAAO8jB,UAAU/tB,OAAS,EACvBoC,MAAMO,SAAS8S,GAAOzL,GAAgBC,GACtC7H,MAAMO,SAAS8S,GAAOzL,GAC1B,CAEA,OAAAE,CAAQF,EAAoBC,GAC3B,OAAO8jB,UAAU/tB,OAAS,EACvBoC,MAAM8H,QAAQuL,GAAOzL,GAAgBC,GACrC7H,MAAM8H,QAAQuL,GAAOzL,GACzB,CAEA,IAAAS,CAAKC,GACJ,OAAOtI,MAAMqI,KAAKC,EACnB,CAEA,IAAAhK,GAEC,OADAsV,GAAUxb,KAAM,UACT4H,MAAM1B,MACd,CAEA,WAAAyJ,CAAYH,EAAoBC,GAC/B,OAAO8jB,UAAU/tB,OAAS,EACvBoC,MAAM+H,YAAYsL,GAAOzL,GAAgBC,GACzC7H,MAAM+H,YAAYsL,GAAOzL,GAC7B,CAEA,GAAAb,CAAOC,EAA4DC,GAClE,OAAOmf,GACNpmB,MAAM+G,IAAI,CAAC+C,EAAGjM,EAAGP,IAAM+V,GAAOrM,EAAWzN,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,IAAK2J,GAE9E,CAGA,GAAA+N,GACC,OAAOoR,GAASpmB,MAAMgV,MACvB,CAGA,IAAA9c,IAAQgQ,GACP,OAAOlI,MAAM9H,QAAQgQ,EAAMnB,IAAIsM,IAChC,CAEA,MAAAjM,CACCJ,EACAK,GAEA,OAAO+e,GACNuF,UAAU/tB,OAAS,EAChBoC,MAAMoH,OAAO,CAACwkB,EAAK9hB,EAAGjM,EAAGP,IAAM+V,GAAOrM,EAAW4kB,EAAKxF,GAAStc,GAAIjM,EAAGP,IAAK+J,GAC3ErH,MAAMoH,OAAO,CAACwkB,EAAK9hB,EAAGjM,EAAGP,IAAM+V,GAAOrM,EAAW4kB,EAAKxF,GAAStc,GAAIjM,EAAGP,KAE3E,CAEA,WAAAgK,CACCN,EACAK,GAEA,OAAO+e,GACNuF,UAAU/tB,OAAS,EAChBoC,MAAMsH,YACN,CAACskB,EAAK9hB,EAAGjM,EAAGP,IAAM+V,GAAOrM,EAAW4kB,EAAKxF,GAAStc,GAAIjM,EAAGP,IACzD+J,GAEArH,MAAMsH,YAAY,CAACskB,EAAK9hB,EAAGjM,EAAGP,IAAM+V,GAAOrM,EAAW4kB,EAAKxF,GAAStc,GAAIjM,EAAGP,KAEhF,CAGA,OAAA2L,GACC,OAAOmd,GAASpmB,MAAMiJ,UACvB,CAGA,KAAAiN,GACC,OAAOkQ,GAASpmB,MAAMkW,QACvB,CAEA,KAAAlT,CAAMT,EAAgByF,GACrB,OAAOoe,GAASpmB,MAAMgD,MAAMT,EAAOyF,GACpC,CAOA,IAAAI,CAAKjB,EAA6DF,GACjE,OAAOjH,MAAMoI,KAAK,CAAC0B,EAAGjM,EAAGP,IAAM6J,EAAU5N,KAAK0N,EAASmf,GAAStc,GAAIjM,EAAGP,GAAI2J,EAC5E,CAGA,IAAAmC,CAAKD,GACJ,MAAM0iB,EAAiB1iB,EACpB,CAAC7L,EAAQC,IAAW4L,EAAUid,GAAS9oB,GAAI8oB,GAAS7oB,SACpDkC,EACH,OAAOO,MAAMoJ,KAAKyiB,EACnB,CAGA,MAAAvD,CAAO/lB,EAAe+G,KAAyBpB,GAC9C,OACQke,GADJuF,UAAU/tB,OAAS,EACNoC,MAAMsoB,OAAO/lB,EAAO+G,KAAiBpB,EAAMnB,IAAIsM,KACvC,IAArBsY,UAAU/tB,OAA8BoC,MAAMsoB,OAAO/lB,EAAO+G,GACvC,IAArBqiB,UAAU/tB,OAA8BoC,MAAMsoB,OAAO/lB,GACzC,GACjB,CAGA,OAAAwS,IAAW7M,GACV,OAAOlI,MAAM+U,WAAW7M,EAAMnB,IAAIsM,IACnC,CAEA,MAAAtY,GAEC,OADA6Y,GAAUxb,KAAMmY,IACT0a,GAAqBjrB,MAAMjF,SACnC,CAEA,EAAA+wB,EAAA,CA9LC1Q,OAKAA,IAAM2Q,EAAA,CAoGN3Q,IAAM4Q,EAAA,CAKN5Q,OA8BAA,IAAM6Q,EAAA,CAKN7Q,IAAM8Q,EAAA,CAkBN9Q,OAQAA,IAAM+Q,EAAA,CASN/Q,IAUAxiB,OAAOkO,aAEP,OADA8M,GAAUxb,KAAMmY,IACT0a,GAAqBjrB,MAAMpH,OAAOkO,YAC1C,CAEA,UAAAkC,GACC,OAAOod,GAASpmB,MAAMgJ,aACvB,CAEA,QAAAE,CAASC,GACR,MAAM0iB,EAAiB1iB,EACpB,CAAC7L,EAAQC,IAAW4L,EAAUid,GAAS9oB,GAAI8oB,GAAS7oB,SACpDkC,EACH,OAAO2mB,GAASpmB,MAAMkJ,SAAS2iB,GAChC,CAEA,SAAAxiB,CAAU9G,EAAe+G,KAAyBpB,GACjD,OACQke,GADJuF,UAAU/tB,OAAS,EACNoC,MAAMqJ,UAAU9G,EAAO+G,KAAiBpB,EAAMnB,IAAIsM,KAC1C,IAArBsY,UAAU/tB,OAA8BoC,MAAMqJ,UAAU9G,EAAO+G,GAC1C,IAArBqiB,UAAU/tB,OAA8BoC,MAAMqJ,UAAU9G,GAC5C,IAAInK,MACrB,CAEA,KAAKwQ,EAAehO,GACnB,OAAOwrB,GAASpmB,MAAMuJ,KAAKX,EAAOyK,GAAOzY,IAC1C,mIA/OqBwxB,CAAAh0B,KAAAi0B,6GAwBrBC,GAAA7lB,EAAA,KAAAqlB,EAAA,CAAA9qB,KAAA,SAAA/B,KAAA,OAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,SAAAA,EAAA1D,IAAA0D,GAAAA,EAAAwrB,MAAIkE,SAAAC,GAAA,KAAAL,GAKJC,GAAA7lB,EAAA,KAAAkmB,EAAA,CAAA3rB,KAAA,SAAA/B,KAAA,aAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,eAAAA,EAAA1D,IAAA0D,GAAAA,EAAA2uB,YAAUe,SAAAC,GAAA,KAAAL,GAoGVC,GAAA7lB,EAAA,KAAAslB,EAAA,CAAA/qB,KAAA,SAAA/B,KAAA,MAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,QAAAA,EAAA1D,IAAA0D,GAAAA,EAAAiY,KAAGyX,SAAAC,GAAA,KAAAL,GAKHC,GAAA7lB,EAAA,KAAAulB,EAAA,CAAAhrB,KAAA,SAAA/B,KAAA,OAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,SAAAA,EAAA1D,IAAA0D,GAAAA,EAAA7E,MAAIu0B,SAAAC,GAAA,KAAAL,GA8BJC,GAAA7lB,EAAA,KAAAmmB,EAAA,CAAA5rB,KAAA,SAAA/B,KAAA,UAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,YAAAA,EAAA1D,IAAA0D,GAAAA,EAAAkM,SAAOwjB,SAAAC,GAAA,KAAAL,GAKPC,GAAA7lB,EAAA,KAAAwlB,EAAA,CAAAjrB,KAAA,SAAA/B,KAAA,QAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,UAAAA,EAAA1D,IAAA0D,GAAAA,EAAAmZ,OAAKuW,SAAAC,GAAA,KAAAL,GAkBLC,GAAA7lB,EAAA,KAAAylB,EAAA,CAAAlrB,KAAA,SAAA/B,KAAA,OAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,SAAAA,EAAA1D,IAAA0D,GAAAA,EAAAqM,MAAIqjB,SAAAC,GAAA,KAAAL,GAQJC,GAAA7lB,EAAA,KAAAomB,EAAA,CAAA7rB,KAAA,SAAA/B,KAAA,SAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,WAAAA,EAAA1D,IAAA0D,GAAAA,EAAAurB,QAAMmE,SAAAC,GAAA,KAAAL,GASNC,GAAA7lB,EAAA,KAAA0lB,EAAA,CAAAnrB,KAAA,SAAA/B,KAAA,UAAAstB,QAAA,EAAAC,SAAA,EAAAtQ,OAAA,CAAArhB,IAAAkC,GAAA,YAAAA,EAAA1D,IAAA0D,GAAAA,EAAAgY,SAAO0X,SAAAC,GAAA,KAAAL,0GA5MkC,GC9CpC,MAAgBS,WAA6Ct1B,QAElE,OAAO0G,GACN,MAAM6uB,EAAS30B,KAAKyC,IAAIqD,GAClBoZ,EAAStX,MAAM5I,OAAO8G,GAI5B,OAFI6uB,GAAQhN,GAASrhB,EAAWtG,MAAO,CAAE+X,KAAM,MAAOnT,KAAMkB,GAAOA,GAE5DoZ,CACR,CAEA,GAAAje,CAAI6E,GAEH,OADA0V,GAAUlV,EAAWtG,MAAO8F,GACrBkoB,GAASpmB,MAAM3G,IAAI6E,GAC3B,CAEA,GAAArD,CAAIqD,GAEH,OADA0V,GAAUlV,EAAWtG,MAAO8F,GACrB8B,MAAMnF,IAAIqD,EAClB,CAEA,GAAAzE,CAAIyE,EAAQtD,GACX,MAAMmyB,EAAS30B,KAAKyC,IAAIqD,GAClB2iB,EAAWzoB,KAAKiB,IAAI6E,GACpBwnB,EAAgBU,GAASxrB,GAO/B,OANAxC,KAAKqB,IAAIyE,EAAKwnB,GAETqH,GAAUlM,IAAa6E,GAC3B3E,GAAqBriB,EAAWtG,MAAO8F,EAAK2iB,EAAU6E,EAAeqH,GAG/D30B,IACR,EAOK,MAAgB40B,WAA0BtxB,IAE/C,QAAIlC,GAEH,OADAoa,GAAUxb,KAAM,QACT4H,MAAMxG,IACd,CAEA,KAAA0Q,GACC,MAAM+iB,EAAa70B,KAAKoB,KAAO,EAG/B,GAFAwG,MAAMkK,QAEF+iB,EAAY,CACf,MAAMld,EAAY,CAAEI,KAAM,QAAStP,OAAQ,SAE3C6V,GAAM,KACLqJ,GAAS3nB,KAAM2X,EAAW,QAC1BsB,GAAQ3S,EAAWtG,MAAO2X,IAE5B,CACD,CAEA,OAAAxH,GAEC,OADAqL,GAAUlV,EAAWtG,OACd+yB,GAA4B/yB,KAAKmQ,UACzC,CAEA,OAAAhB,CAAQP,EAAwDC,GAC/D2M,GAAUlV,EAAWtG,OACrBA,KAAKmP,QAAQP,EAAYC,EAC1B,CAEA,IAAA3I,GAEC,OADAsV,GAAUlV,EAAWtG,MAAOmY,IACrBnY,KAAKkG,MACb,CAEA,MAAAvD,GAEC,OADA6Y,GAAUlV,EAAWtG,OACd6yB,GAAqB7yB,KAAK2C,SAClC,CAEA,CAACnC,OAAOkO,YACP8M,GAAUlV,EAAWtG,OACrB,MAAM80B,EAA0BxxB,IAAI3B,UAAUnB,OAAOkO,UAAUvN,KAAKnB,MAC9D+0B,EAAaD,EAAG9W,KAAKgX,KAAKF,GAOhC,OANAA,EAAG9W,KAAO,KACT,MAAMkB,EAAS6V,IACf,GAAI7V,EAAO4T,KAAM,OAAO5T,EACxB,MAAOpZ,EAAKtD,GAAS0c,EAAO1c,MAC5B,MAAO,CAAEA,MAAO,CAACwrB,GAASloB,GAAMkoB,GAASxrB,IAASswB,MAAM,IAElDgC,CACR,CAGA,OAAOhvB,GACN,MAAM6uB,EAAS30B,KAAKyC,IAAIqD,GAClBoZ,EAAStX,MAAM5I,OAAO8G,GAE5B,GAAI6uB,EAAQ,CACX,MAAMhd,EAAY,CAAEI,KAAM,MAAOnT,KAAMkB,GACvCwY,GAAM,KACLqJ,GAASrhB,EAAWtG,MAAO2X,EAAW7R,GACtC6hB,GAAS3nB,KAAM2X,EAAW,SAE5B,CAEA,OAAOuH,CACR,CAEA,GAAAje,CAAI6E,GAEH,OADA0V,GAAUlV,EAAWtG,MAAO8F,GACrBkoB,GAASpmB,MAAM3G,IAAI6E,GAC3B,CAEA,GAAArD,CAAIqD,GAEH,OADA0V,GAAUlV,EAAWtG,MAAO8F,GACrB8B,MAAMnF,IAAIqD,EAClB,CAEA,GAAAzE,CAAIyE,EAAQtD,GACX,MAAMmyB,EAAS30B,KAAKyC,IAAIqD,GAClB2iB,EAAWzoB,KAAKiB,IAAI6E,GACpBwnB,EAAgBU,GAASxrB,GAY/B,OAXAoF,MAAMvG,IAAIyE,EAAKwnB,GAEVqH,GAAUlM,IAAa6E,GAC3BhP,GAAM,KACLqK,GAAqBriB,EAAWtG,MAAO8F,EAAK2iB,EAAU6E,EAAeqH,GAGrEhN,GAAS3nB,KADS,CAAE+X,KAAM4c,EAAS,MAAQ,MAAO/vB,KAAMkB,GAC9B,UAIrB9F,IACR,ECzIK,MAAgBi1B,WAA0C1xB,QAC/D,GAAAxE,CAAIyD,GACH,MAAM0yB,EAAMl1B,KAAKyC,IAAID,GAOrB,OANAoF,MAAM7I,IAAIyD,GACL0yB,GAEJvN,GAASrhB,EAAWtG,MAAO,CAAE+X,KAAM,MAAOnT,KAAMpC,GAASA,GAGnDxC,IACR,CAEA,OAAOwC,GACN,MAAM0yB,EAAMl1B,KAAKyC,IAAID,GACfvC,EAAM2H,MAAM5I,OAAOwD,GAEzB,OADI0yB,GAAKvN,GAASrhB,EAAWtG,MAAO,CAAE+X,KAAM,MAAOnT,KAAMpC,GAASA,GAC3DvC,CACR,CAEA,GAAAwC,CAAID,GAEH,OADAgZ,GAAUlV,EAAWtG,MAAOwC,GACrBoF,MAAMnF,IAAID,EAClB,EAOK,MAAgB2yB,WAAuBx2B,IAC5C,QAAIyC,GAGH,OADAoa,GAAUxb,KAAM,QACTA,KAAKoB,IACb,CAEA,GAAArC,CAAIyD,GACH,MAAM0yB,EAAMl1B,KAAKyC,IAAID,GACf8qB,EAAgBU,GAASxrB,GAE/B,GADAoF,MAAM7I,IAAIuuB,IACL4H,EAAK,CACT,MAAMvd,EAAY,CAAEI,KAAM,MAAOnT,KAAM0oB,GAEvChP,GAAM,KACLqJ,GAASrhB,EAAWtG,MAAO2X,EAAW2V,GACtC3F,GAAS3nB,KAAM2X,EAAW,SAE5B,CACA,OAAO3X,IACR,CAEA,KAAA8R,GACC,MAAM+iB,EAAa70B,KAAKoB,KAAO,EAE/B,GADAwG,MAAMkK,QACF+iB,EAAY,CACf,MAAMld,EAAY,CAAEI,KAAM,QAAStP,OAAQ,SAC3C6V,GAAM,KACLqJ,GAAS3nB,KAAM2X,EAAW,QAC1BsB,GAAQ3S,EAAWtG,MAAO2X,IAE5B,CACD,CAEA,OAAOnV,GACN,MAAM0yB,EAAMl1B,KAAKyC,IAAID,GACfvC,EAAM2H,MAAM5I,OAAOwD,GACzB,GAAI0yB,EAAK,CACR,MAAMvd,EAAY,CAAEI,KAAM,MAAOnT,KAAMpC,GACvC8b,GAAM,KACLqJ,GAASrhB,EAAWtG,MAAO2X,EAAWnV,GACtCmlB,GAAS3nB,KAAM2X,EAAW,SAE5B,CACA,OAAO1X,CACR,CAEA,GAAAwC,CAAID,GAEH,OADAgZ,GAAUlV,EAAWtG,MAAOwC,GACrBxC,KAAKyC,IAAID,EACjB,CAEA,OAAA2N,GAEC,OADAqL,GAAUlV,EAAWtG,OACd+yB,GAA4B/yB,KAAKmQ,UACzC,CAEA,OAAAhB,CAAQP,EAAwDC,GAC/D2M,GAAUlV,EAAWtG,OACrBA,KAAKmP,QAAQP,EAAYC,EAC1B,CAEA,IAAA3I,GAEC,OADAsV,GAAUlV,EAAWtG,OACd6yB,GAAqB7yB,KAAKkG,OAClC,CAEA,MAAAvD,GAEC,OADA6Y,GAAUlV,EAAWtG,OACd6yB,GAAqB7yB,KAAK2C,SAClC,CAEA,CAACnC,OAAOkO,YACP8M,GAAUlV,EAAWtG,OACrB,MAAM80B,EAAqBn2B,IAAIgD,UAAUnB,OAAOkO,UAAUvN,KAAKnB,MACzD+0B,EAAaD,EAAG9W,KAAKgX,KAAKF,GAMhC,OALAA,EAAG9W,KAAO,KACT,MAAMkB,EAAS6V,IACf,OAAI7V,EAAO4T,KAAa5T,EACjB,CAAE1c,MAAOwrB,GAAS9O,EAAO1c,OAAQswB,MAAM,IAExCgC,CACR,EC3DDzI,GAAWhrB,IAAI8B,MHbT,cAAsCA,MAC3C,MAAAiyB,GACC,OAAOp1B,IACR,GGUmC2B,WACpC0qB,GAAWhrB,IAAI1C,IAAKw2B,GAAYxzB,WAChC0qB,GAAWhrB,IAAIkC,QAAS0xB,GAAgBtzB,WACxC0qB,GAAWhrB,IAAIiC,IAAKsxB,GAAYjzB,WAChC0qB,GAAWhrB,IAAIjC,QAASs1B,GAAgB/yB,WACxC2qB,GAAWjrB,IAAI8B,MAAOiwB,GAAqBzxB,WAKpC,MAAM0zB,GAAmB,CAC/Bta,iBACAC,iBACA5E,2BACAC,YACA4P,iBACAC,2BACAE,gBACAC,+BC5EKiP,GAA2D,GAKpD5nB,GAAS5E,EAAU,CAC/BT,OAAM,CAAC0B,EAAUZ,EAASnB,IAClB,WACN,MAAMutB,EAAqBD,GAAgBjmB,UACzCgZ,GAAMA,EAAEmN,SAAWx1B,MAAQqoB,EAAEzjB,OAASoD,GAExC,GAAIutB,GAAqB,EACxB,MAAM,IAAI/xB,MACT,iCAAiC8xB,GAC/B1qB,MAAM2qB,GACN5mB,IAAK0Z,GAAM,GAAGA,EAAEmN,OAAO9tB,YAAYb,QAAQ3C,OAAOmkB,EAAEzjB,SACpDqL,KAAK,oBAETqlB,GAAgBx1B,KAAK,CAAE01B,OAAQx1B,KAAM4E,KAAMoD,IAC3C,IACC,MAAMa,EAAKkB,EAAS5I,KAAKnB,MAEzB,OADAoF,GAAMpF,KAAMgI,EAAaa,GAClBA,CACR,SACCysB,GAAgB1Y,KACjB,CACD,aAoBcxX,GAAMowB,EAAgBxtB,EAA0BxF,GAC/DF,OAAOO,eAAe2yB,EAAQxtB,EAAa,CAAExF,SAC9C,OAOayF,GAAa0F,EACzB,SAAoB1F,GAKnB,MAAO,IAAOwtB,IACZC,GACO,cAAcA,EACpB,WAAAhuB,IAAe/H,GACdiI,SAASjI,GACT,IAAK,MAAMmG,KAAO2vB,EAAY,CAC7B,MAAM5e,EAAWvU,OAAO0C,yBAAyBhF,KAAM8F,GACvDxD,OAAOO,eAAe7C,KAAM8F,EAAKxD,OAAOC,OAAOsU,GAAY,GAAI5O,GAChE,CACD,EAGJ,EACA,CAIC,cAAIwlB,GACH,OAAOxlB,GAAW,CAAEwlB,YAAY,GACjC,EAIA,UAAIkI,GACH,OAAO1tB,GAAW,CAAEwlB,YAAY,GACjC,EAIA,gBAAI1qB,GACH,OAAOkF,GAAW,CAAElF,cAAc,GACnC,EAIA,UAAI6yB,GACH,OAAO3tB,GAAW,CAAElF,cAAc,GACnC,EAIA,YAAI4D,GACH,OAAOsB,GAAW,CAAEtB,UAAU,GAC/B,EAIA,YAAIkvB,GACH,OAAO5tB,GAAW,CAAEtB,UAAU,GAC/B,IAQWmvB,GAAaxzB,OAAOC,OAChCuG,EAAU,CACTL,OAAM,CAACsB,EAAUZ,EAASnB,IAClB,YAAwBrI,GAE9B,OADAm2B,GAAW1b,KAAKpa,KAAMgI,GACf+B,EAAShK,MAAMC,KAAML,EAC7B,EAED0I,OAAM,CAAC0B,EAAUZ,EAASnB,IAClB,WAEN,OADA8tB,GAAW1b,KAAKpa,KAAMgI,GACf+B,EAAS5I,KAAKnB,KACtB,EAEDuI,OAAM,CAACwB,EAAUZ,EAASnB,IAClB,SAAqBxF,GAE3B,OADAszB,GAAW1b,KAAKpa,KAAMgI,GACf+B,EAAS5I,KAAKnB,KAAMwC,EAC5B,EAED0F,MAAM6B,GACE,cAAcA,EACpB,WAAArC,IAAe/H,GACdiI,SAASjI,GACTm2B,GAAW1b,KAAKpa,KAAM,cACvB,GAGF0I,QAAQf,GACAmB,EAAU,CAChBL,OAAM,CAACsB,EAAUZ,EAASnB,IAClB,YAAwBrI,GAE9B,OADAm2B,GAAW1b,KAAKpa,KAAMgI,EAAaL,GAC5BoC,EAAShK,MAAMC,KAAML,EAC7B,EAED0I,OAAM,CAAC0B,EAAUZ,EAASnB,IAClB,WAEN,OADA8tB,GAAW1b,KAAKpa,KAAMgI,EAAaL,GAC5BoC,EAAS5I,KAAKnB,KACtB,EAEDuI,OAAM,CAACwB,EAAUZ,EAASnB,IAClB,SAAqBxF,GAE3B,OADAszB,GAAW1b,KAAKpa,KAAMgI,EAAaL,GAC5BoC,EAAS5I,KAAKnB,KAAMwC,EAC5B,EAED0F,MAAM6B,GACE,cAAcA,EACpB,WAAArC,IAAe/H,GACdiI,SAASjI,GACTm2B,GAAW1b,KAAKpa,KAAM,cAAe2H,EACtC,OAML,CACCyS,KAAM,CAACrS,EAAaC,EAA0BL,KAC7C2I,GAAQ8J,KACP,GAAGrS,EAAOL,YAAYb,QAAQ3C,OAAO8D,mBAA6BL,EAAU,KAAKA,IAAY,mCC5JjG,MAAMouB,QAAEA,IAAYC,GAEdC,GAAmB,qBACnBC,GACiB,oBAAfx0B,WACJA,WACkB,oBAAXkqB,OACNA,OACkB,oBAAXuK,QACNA,OAGN,GAAID,GAAa,CAChB,IAAI1H,EAAS,cACb,IAC2B,oBAAf4H,WAA4B5H,EAAS4H,gBAChB,IAAhB,CAAAC,IAAA,oBAAAtK,UAAA,oBAAAuK,SAAAC,QAAA,OAAAC,cAAAJ,YAAAK,KAAA,oBAAA1K,SAAAuK,SAAAG,KAAAC,GAAA,WAAAA,EAAAC,QAAAC,eAAAF,EAAAG,KAAA,IAAAC,IAAA,mBAAA/K,SAAAgL,SAAAN,+PACfjI,EAAS,oBAAAzC,UAAA,oBAAAuK,SAAAC,QAAA,OAAAC,cAAAJ,YAAAK,KAAA,oBAAA1K,SAAAuK,SAAAG,KAAAC,GAAA,WAAAA,EAAAC,QAAAC,eAAAF,EAAAG,KAAA,IAAAC,IAAA,mBAAA/K,SAAAgL,SAAAN,KAEX,CAAE,MAAOzzB,GAAK,CAEd,MAAMg0B,EAAoB,CAAEjB,WAASvH,SAAQyI,UAAW7zB,KAAK8zB,OAE7D,GAAIhB,GAAYD,IAAmB,CAClC,MAAMpf,EAAWqf,GAAYD,IAC7B,MAAM,IAAIzyB,MAER,4DAAsB2zB,KAAKC,UAAUvgB,EAAU,KAAM,qBACpCsgB,KAAKC,UAAUJ,EAAmB,KAAM,6NAK5D,CACAd,GAAYD,IAAoBe,CACjC,kE9B4CM,SAKJjJ,EAAkCsJ,SASnC,OARItJ,GAAwB,mBAATA,IAClBsJ,EAAgBtJ,EAChBA,OAAO1mB,GAEH0mB,IACJA,EAAO,SAGR1f,EAAO,cAA2B0f,EAEjC,cAAOuJ,CAAQ3yB,GACd,MAAM6E,EAAa6E,EAAYkpB,YAAYt2B,IAAI0D,GAC/C,IAAK6E,EAAY,OAAO,EACxBH,EAAG0I,WAAWpN,EAAI8E,IAClB4E,EAAYkpB,YAAYv4B,OAAO2F,GAC/BrC,OAAOuR,eAAelP,EAAK,IAAIX,MAAM,CAAA,EAAI4F,IAEzC,IAAK,MAAM9D,KAAOxD,OAAOk1B,oBAAoB7yB,UACpCA,EAAYmB,GAGrB,OADA0D,KACO,CACR,CACA,oBAAOiuB,CAAc9yB,GACpB,OAAO0J,EAAYkpB,YAAY90B,IAAIkC,EACpC,CAIA,WAAA+C,IAAe/H,GACdiI,SAASjI,GACT,MAAMmK,EAAY,CAAA,EAClB9J,KAAKyJ,GAAmBK,EAExB,MAAM4tB,EAAeL,GAAe7tB,YAAcxJ,KAAKwJ,GACvD,IAAKkuB,EACJ,MAAM,IAAIhuB,EAAiB,6BAE5B,SAASiuB,IACRD,EAAa5tB,EACd,CACAuE,EAAYkpB,YAAYl2B,IAAIrB,KAAM23B,GAClCtuB,EAAG8I,SAASnS,KAAM23B,EAAa7tB,EAChC,GAlCgBuE,EAAAkpB,YAAc,IAAIn4B,QAmClCiP,CACF,wCEhFA,WAAA3G,GACkB1H,KAAAqO,GAAW,IAAI/K,IACftD,KAAAuS,GAAU,IAAI5T,IAcxBqB,KAAA8M,GAAKQ,EAAStN,KAAM6M,EAAcC,IAIlC9M,KAAAmN,IAAMG,EAAStN,KAAM6M,EAAcM,KAKnCnN,KAAAoN,KAAOE,EAAStN,KAAM6M,EAAcO,KAAM,MAKlD,CA1BQ,IAAAtO,CACNkO,GAMA,OADAhN,KAAKtB,GAAOK,IAAIiO,GACT,KACNhN,KAAKtB,GAAOM,OAAOgO,GAErB,eE9BK,SACL+gB,EACA6J,GAEI7J,GAAwB,mBAATA,IAClB6J,EAAW7J,EACXA,OAAO1mB,GAEH0mB,IAEJA,EAAO,SAEH6J,IACJA,EAAW,CACV,GAAA32B,CAAeuP,GACd,GAA2B,mBAAhBxQ,KAAKsO,GACf,MAAM,IAAI9K,MAAM,+CAEjB,OAAOxD,KAAKsO,GAAOkC,EACpB,EACA,GAAAnP,CAAemP,EAAehO,GAC7B,GAA2B,mBAAhBxC,KAAKuO,GACf,MAAM,IAAI/K,MAAM,sDAEjBxD,KAAKuO,GAAOiC,EAAOhO,EACpB,IAIF,MAAeq1B,UAAmB9J,GA8FlC,OA1FAzrB,OAAOuR,eACNgkB,EAAUl2B,UACV,IAAIqC,MAAO+pB,EAAcpsB,UAAW,CAEnC,CAACnB,OAAOuG,aAAc,kBACtB,GAAA9F,CAAI8G,EAAQnD,EAAMC,GACjB,GAAID,KAAQmD,EAAQ,CACnB,MAAMM,EAAS/F,OAAO0C,yBAAyB+C,EAAQnD,IAAO3D,IAC9D,OAAOoH,EAASA,EAAOlH,KAAK0D,GAAYkD,EAAOnD,EAChD,CACA,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqBgzB,EAASE,UAAW,OAAOF,EAASE,UAAU32B,KAAK0D,GAC5E,MAAMkzB,EAAU5zB,OAAOS,GACvB,IAAKT,OAAOwrB,MAAMoI,GACjB,OAAOH,EAAS32B,IAAKE,KAAK0D,EAAUkzB,EAEtC,CAED,EACA,GAAA12B,CAAI0G,EAAQnD,EAAMpC,EAAOqC,GACxB,GAAID,KAAQmD,EAAQ,CACnB,MAAMQ,EAASjG,OAAO0C,yBAAyB+C,EAAQnD,IAAOvD,IAG9D,OAFIkH,EAAQA,EAAOpH,KAAK0D,EAAUrC,GAC7BuF,EAAOnD,GAAQpC,GACb,CACR,CACA,GAAoB,iBAAToC,EAAmB,CAC7B,GAAa,WAATA,GAAqBgzB,EAASI,UAEjC,OADAJ,EAASI,UAAU72B,KAAK0D,EAAUrC,IAC3B,EAER,MAAMu1B,EAAU5zB,OAAOS,GACvB,IAAKT,OAAOwrB,MAAMoI,GAAU,CAC3B,IAAKH,EAASv2B,IAAK,MAAM,IAAImC,MAAM,sDAEnC,OADAo0B,EAASv2B,IAAKF,KAAK0D,EAAUkzB,EAASv1B,IAC/B,CACR,CACD,CAOA,OANAF,OAAOO,eAAegC,EAAUD,EAAM,CACrCpC,QACAmE,UAAU,EACV8mB,YAAY,EACZ1qB,cAAc,KAER,CACR,EACA,GAAAN,CAAIsF,EAAQnD,GACX,GAAIA,KAAQmD,EAAQ,OAAO,EAC3B,GAAoB,iBAATnD,EAAmB,CAC7B,GAAa,WAATA,GAAqBgzB,EAASE,UAAW,OAAO,EACpD,MAAMC,EAAU5zB,OAAOS,GACvB,IAAKT,OAAOwrB,MAAMoI,GAAU,OAAO,CACpC,CACA,OAAO,CACR,EACA,OAAAzN,CAAQviB,GACP,MAAM7B,EAAOnC,QAAQumB,QAAQviB,GAC7B,GAAI6vB,EAASE,UAAW,CACvB5xB,EAAKpG,KAAK,UACV,MAAMm4B,EAAML,EAASE,UAAU32B,KAAKnB,MACpC,IAAK,IAAIyF,EAAI,EAAGA,EAAIwyB,EAAKxyB,IAAKS,EAAKpG,KAAKoE,OAAOuB,GAChD,CACA,OAAOS,CACR,EACA,wBAAAlB,CAAyB+C,EAAQnD,GAChC,GAAIA,KAAQmD,EAAQ,OAAOzF,OAAO0C,yBAAyB+C,EAAQnD,GACnE,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqBgzB,EAASE,UACjC,MAAO,CACNrK,YAAY,EACZ1qB,cAAc,EACd9B,IAAK,IAAM22B,EAASE,UAAW32B,KAAKnB,OAGtC,MAAM+3B,EAAU5zB,OAAOS,GACvB,IAAKT,OAAOwrB,MAAMoI,GACjB,MAAO,CACNtK,YAAY,EACZ1qB,cAAc,EACd9B,IAAK,IAAM22B,EAAS32B,IAAKE,KAAKnB,KAAa+3B,GAC3C12B,IAAKu2B,EAASv2B,IACVqQ,GAAWkmB,EAASv2B,IAAKF,KAAKnB,KAAa+3B,EAASrmB,QACrDrK,EAGN,CAED,KAGKwwB,CACR,0ONlKM,SAAsB3yB,EAAQC,GACnC,IAAKhC,MAAMoC,QAAQL,KAAO/B,MAAMoC,QAAQJ,GAAI,OAAO,EACnD,GAAID,IAAMC,EAAG,OAAO,EACpB,GAAID,EAAEM,SAAWL,EAAEK,OAAQ,OAAO,EAClC,IAAK,IAAIC,EAAI,EAAGA,EAAIP,EAAEM,OAAQC,IAC7B,GAAIP,EAAEO,KAAON,EAAEM,GAAI,OAAO,EAE3B,OAAO,CACR,oBehBM,SAA6BhG,GAClC,GAAI4b,GACH,MAAM,IAAI7X,MAAM,mDAEjB6X,IAAsB,EACtB,IACC,OAAO5b,GACR,SACC4b,IAAsB,CACvB,CACD,cjBD0Bvc,GAAeF,EAAWC,QAAQC,wCkB8iCtD,SAAkBW,GACvB,OAAO6e,GAAM7e,EAAI,YAClB,0CA4YCy4B,EACAj3B,EACAI,GAEmB,mBAARJ,IACVI,EAAMJ,EAAII,IACVJ,EAAMA,EAAIA,KAEX,IAAIk3B,EAAgC33B,SASpC,OARAgW,GAAOxP,MAAM,OAAbwP,CACCG,GAAa,KACZ,MAAM+R,EAAWznB,IACXm3B,EAASD,EACfA,EAA2B33B,SACvBya,GAAOyN,KAAc0P,GAAQF,EAASxP,IACxCwP,IAEG72B,EACJ2hB,GAAQxgB,IACR21B,EAA2Bld,GAAOzY,GAClCnB,EAAImB,KAEJ,MACJ,oCdzzCM,SAAmBwK,GACxB,IAAIqrB,GAAS,EACb,MAAMtkB,EAAU,KACXskB,IACJA,GAAS,EACTrrB,MAGD,OADA3D,EAAG8I,SAAS4B,EAAS/G,EAAIA,GAClB+G,CACR,sEG9HCtU,EACA64B,EACAzxB,GAEA,MAAM2G,EAAM,YAAqC7N,GAChD,OAAOF,EAAGM,MAAMC,KAAMs4B,KAAa34B,GACpC,EAGA,OAFIkH,GAAMG,EAAMH,EAAM2G,GAEfG,EAASH,EAAW/N,EAAWmO,SAAW,CAAA,EAClD,a0B2HM,SAAmB2qB,GACxB,OAAOzvB,EAAU,CAChB,MAAAL,CAAOsB,EAAUZ,EAASqvB,GACzB,IAAIC,EAAkD,KAEtD,OAAO,YAAwB94B,GAE1B84B,GACHC,aAAaD,GAIdA,EAAYn4B,WAAW,KACtByJ,EAAShK,MAAMC,KAAML,GACrB84B,EAAY,MACVF,EACJ,CACD,GAEF,gBjBqYoD,CACnD5e,kBAAmB,QACnBE,cAAe,QACfQ,cAAe,CACdC,cAAe,CAAEC,SAAU,QAC3BC,WAAW,EACXC,eAAe,EACfC,YAAa,4NAneCie,EAAoBj2B,EAAuBgO,EAAQ,GAClE,MAAMkoB,EAASloB,EAAQ,KAAKmoB,OAAOnoB,GAAS,GAC5C,OAAQhO,EAAOqV,MACd,IAAK,aAAc,CAClB,MAAMC,EAAmB,CAAC,GAAG4gB,gBAC7B,IAAK,IAAInzB,EAAI,EAAGA,EAAI/C,EAAOqb,SAASvY,OAAQC,IACvCA,EAAI,GAAGuS,EAAMlY,KAAK,KACtBkY,EAAMlY,QAAQ4X,GAAchV,EAAOqb,SAAStY,KAE7C,OAAOuS,CACR,CACA,IAAK,UACJ,MAAO,CAAC,GAAG4gB,YACZ,IAAK,KACJ,MAAO,CAAC,GAAGA,OACZ,IAAK,QACJ,MAAO,CAAC,GAAGA,UAAgBl2B,EAAOkY,OACnC,IAAK,UACJ,MAAO,CAAC,GAAGge,kBAAwBD,EAAoBj2B,EAAOwhB,OAAQxT,EAAQ,IAC/E,IAAK,aACJ,MAAO,CAAC,GAAGkoB,qBAA2BD,EAAoBj2B,EAAO8V,MAAO9H,EAAQ,IACjF,IAAK,WAAY,CAChB,MAAMsH,EAAmB,GACzB,IAAK,IAAIvS,EAAI,EAAGA,EAAI/C,EAAOod,QAAQta,OAAQC,IACtCA,EAAI,GAAGuS,EAAMlY,KAAK,MACtBkY,EAAMlY,QAAQ64B,EAAoBj2B,EAAOod,QAAQra,GAAIiL,IAEtD,OAAOsH,CACR,EAEF,iDE3EC,OAAOsE,EACR,oEe3CM,SAAmBkZ,EAAgBxtB,GACxC,QAAS1F,OAAO0C,yBAAyBwwB,EAAQxtB,EAClD,4D/BkCM,SAAmBxF,GACxB,MACkB,iBAAVA,GACG,OAAVA,IACCW,MAAMoC,QAAQ/C,MAEdA,aAAiBY,MACjBZ,aAAiByB,QACjBzB,aAAiBgB,OACjBhB,aAAiB7D,KACjB6D,aAAiBc,KACjBd,aAAiBe,SACjBf,aAAiBpD,SACjBoD,aAAiBrC,SACjBqC,aAAiBa,SAGpB,mEsB6DM,SAA8C2J,GACnD,IAAIkS,EACA4Z,EACJ,MAAMC,EAAcviB,GAAOxP,MAAM,QAAQgG,EAAGnG,OAAxB2P,CACnBG,GAAcmN,IACb,MAAM0K,EAASxhB,EAAG8W,GAClB,IAAK0K,GAA4B,iBAAXA,EACrB,MAAM,IAAIhrB,MAAM,gDACjB,MAAMw1B,EAAc12B,OAAO+C,eAAempB,GAK1C,GAJKtP,IACJ4Z,EAAY31B,MAAMoC,QAAQipB,GAAU,GAAKlsB,OAAOmE,OAAOuyB,GACvD9Z,EAAS8O,GAAS8K,IAEfE,IAAgB12B,OAAO+C,eAAe6Z,GACzC,MAAM,IAAI1b,MAAM,kEAEjB,GAAIL,MAAMoC,QAAQipB,GAAS,CAC1B,MAAMvuB,EAAMif,EACZ,IAAK,MAAM1U,OAAEA,EAAME,OAAEA,EAAMC,OAAEA,KAAYX,EAAU/J,EAAKuuB,GAAQxd,KAC/D,CAAC9L,EAAGC,IAAMD,EAAEsF,OAASrF,EAAEqF,QAEvBvK,EAAIiwB,OAAO1lB,EAAQE,EAAOlF,UAAWmF,EACvC,KAAO,CACN,IAAK,MAAM7E,KAAOxD,OAAO4D,KAAKsoB,GAAS,CACtC,MAAM0G,EAAMpvB,KAAOgzB,EACbG,EAAU32B,OAAO0C,yBAAyBwpB,EAAQ1oB,GACxD,GAAIovB,EAAK,CACR,MAAMgE,EAAU52B,OAAO0C,yBAAyB8zB,EAAWhzB,GACrDqzB,EAAeD,GAAWD,EAAQh4B,KAAOi4B,EAAQj4B,MAAQg4B,EAAQh4B,IACvEqB,OAAOO,eAAei2B,EAAWhzB,EAAKmzB,GAEpCE,GACDL,EAAUhzB,MACRozB,EAAWA,EAAQj4B,IAAMi4B,EAAQj4B,MAAQi4B,EAAQ12B,WAAS6E,IAE5DsgB,GAASmR,EAAW,CAAE/gB,KAAM,MAAOnT,KAAMkB,GAAOA,EAClD,MACCxD,OAAOO,eAAei2B,EAAWhzB,EAAKmzB,GACtCtR,GAASmR,EAAW,CAAE/gB,KAAM,MAAOnT,KAAMkB,GAAOA,EAElD,CACA,IAAK,MAAMA,KAAOxD,OAAO4D,KAAK4yB,GACvBhzB,KAAO0oB,WACLsK,EAAUhzB,GACjB6hB,GAASmR,EAAW,CAAE/gB,KAAM,MAAOnT,KAAMkB,GAAOA,GAEnD,GACEkH,IAEJ,OAAOuK,GAAK2H,EAAQ6Z,EACrB,uIW/CChxB,EACAqxB,EACAtV,GASA,OAPAxhB,OAAOO,eAAekF,EAAQqxB,EAAU,CACvCn4B,IAAK6iB,EAAO7iB,IACZI,IAAKyiB,EAAOziB,IACZ0B,cAAc,EACd0qB,YAAY,IAEb9F,GAAS5f,EAAQ,CAAEgQ,KAAM,MAAOnT,KAAMw0B,GAAYA,GAC3C,WAAcrxB,EAAeqxB,EACrC,cA3DM,SAIL5K,EACAzuB,EACAs5B,EAAqB,CAAA,GAErB,MAAMC,EAAiBtL,GAASQ,GAC1BzmB,EAASimB,GAASqL,GAElBzK,EAAOL,GACZ,KACC,MAAMroB,EAAsB,GAC5B,IAAK,MAAMJ,KAAOwzB,EAAgBpzB,EAAKpG,KAAKgG,GAC5C,OAAOI,GAEPJ,IACA,MAAMyzB,EAAYzzB,EACZ0zB,EAAa,CAClB1zB,IAAKyzB,EACLt4B,IAAK,IAAMyD,EAAUzD,IAAIq4B,EAAgBC,EAAWD,GACpDj4B,IAAMmB,GACLkC,EAAUrD,IAAIi4B,EAAgBC,EAAW/2B,EAAO82B,IAQlD,OANAh3B,OAAOO,eAAe22B,EAAY,QAAS,CAC1Cv4B,IAAKu4B,EAAWv4B,IAChBI,IAAKm4B,EAAWn4B,IAChB0B,cAAc,EACd0qB,YAAY,IAEN1tB,EAAMy5B,EAAyDzxB,KAIxE,OAAOwP,GAAKxP,EAASrF,GAA2BksB,EAAKlsB,GACtD,yHjBk2BC4a,IAAS,EACTnC,QAAqB9T,EACrB4W,GAAWzY,OAAS,EACpB0X,GAAiB,IAAI9d,QACrB+d,GAAoB,IAAI/d,QACxBge,GAAgB,IAAIhe,QACpBie,GAAsB,IAAIje,QJh+B1BgX,GAA0B,IAAIhX,QAC9BiX,GAAW,IAAIjX,QACfkX,GAAc,IAAIlX,QAClBsX,GAAe,IAAItX,QGpBnBgc,GAAmB,IAAIhc,QCo/BvB8X,GAAcxB,QAAQT,YAAS5N,CAChC,sBSnwBCoyB,EACAnpB,EAAgC,IAEhC,MAAMopB,EAAiC1L,GAAS,CAC/CxrB,MAAO8N,EAAQrB,aACf0qB,SAAS,EACT/e,WAAOvT,EACPuyB,OAAQtpB,EAAQrB,aAChB,MAAA4qB,GACCC,EAAat3B,OACd,IAGKs3B,EAAe9L,GAAS,CAAExrB,MAAO,IAEvC,IAAIu3B,EAAU,EAEd,OAhDK,SAAqCL,EAAaM,GACvD,MAAMC,EAAW/iB,GAAcjC,OAC/B,IAAIuc,GAAQ,EACZ,OAAO,IAAIxtB,MAAM01B,EAAU,CAC1B,CAACl5B,OAAOuG,aAAc,WACtB9F,IAAG,CAAC8G,EAAQnD,KACP4sB,IACHtO,GAAS+W,EAAUD,EAAnB9W,GACAsO,GAAQ,GAEFzpB,EAAOnD,KAGjB,CAmCQs1B,CAASR,EAAyB,KACxCniB,GACCmiB,EACAljB,GAAOxP,MAAM,iBAAbwP,CAAgCsN,IAE1BgW,EAAat3B,MAElB,MAAM23B,IAAOJ,EACbL,EAASC,SAAU,EACnBD,EAAS9e,WAAQvT,EAEjB,IACC,MAAM6X,EAASua,EAAQ3V,GAEnB5E,aAAkB/e,QACrBu5B,EAASU,QAAUlb,EACjBhf,KAAMyF,IACFw0B,IAAOJ,IACVL,EAASl3B,MAAQmD,EACjB+zB,EAASE,OAASj0B,EAClB+zB,EAASC,SAAU,KAGpB/3B,MAAOy4B,IACHF,IAAOJ,IACVL,EAAS9e,MAAQyf,EACjBX,EAASC,SAAU,MAItBD,EAASU,QAAUj6B,QAAQC,UAC3Bs5B,EAASl3B,MAAQ0c,EACjBwa,EAASE,OAAS1a,EAClBwa,EAASC,SAAU,EAErB,CAAE,MAAOU,GACRX,EAASU,QAAUj6B,QAAQE,OAAOg6B,GAClCX,EAAS9e,MAAQyf,EACjBX,EAASC,SAAU,CACpB,MAIJ,yCM1FM,SAAmBpB,GACxB,OAAOzvB,EAAU,CAChB,MAAAL,CAAOsB,EAAUZ,EAASqvB,GACzB,IAAI8B,EAAe,EACf7B,EAAkD,KAEtD,OAAO,YAAwB94B,GAC9B,MAAMu3B,EAAM9zB,KAAK8zB,MAGjB,GAAIA,EAAMoD,GAAgB/B,EAOzB,OALIE,IACHC,aAAaD,GACbA,EAAY,MAEb6B,EAAepD,EACRntB,EAAShK,MAAMC,KAAML,GAI7B,IAAK84B,EAAW,CACf,MAAM8B,EAAgBhC,GAASrB,EAAMoD,GAC/BE,EAAgB,IAAI76B,GAC1B84B,EAAYn4B,WAAW,KACtBg6B,EAAel3B,KAAK8zB,MACpBntB,EAAShK,MAAMC,KAAMw6B,GACrB/B,EAAY,MACV8B,EACJ,CACD,CACD,GAEF,sClB5LM,SAAUE,EAAO91B,EAAajC,GACnC,MAAMrB,EAAMiW,GAASrW,IAAI0D,GACzB,GAAItD,EAAK,CACRiW,GAAStY,OAAO2F,GAChB,IAAK,MAAMlF,KAAM4B,EACE,mBAAP5B,EAAmBA,EAAGiD,GAC5B+3B,EAAOh7B,EAAIiD,EAClB,CACD,+DYgEM,SAAkBqM,EAAqC2rB,GAC5D,OAAO,IAAIv6B,QAAW,CAACC,EAASC,KAC/B,IAAIs6B,EACJ,MAAM/L,EAAOpY,GAAOxP,MAAM,aAAbwP,CAA4BsN,IACxC,IACC,MAAMthB,EAAQuM,EAAU+U,GACpBthB,SACW6E,IAAVszB,GAAqBjC,aAAaiC,GACtCA,OAAQtzB,EACRhF,eAAe,IAAMusB,KACrBxuB,EAAQoC,GAEV,CAAE,MAAOoY,QACMvT,IAAVszB,GAAqBjC,aAAaiC,GACtCA,OAAQtzB,EACRhH,EAAOua,EACR,SAEevT,IAAZqzB,IACHC,EAAQr6B,WAAW,KAClBsuB,IACA+L,OAAQtzB,EACRhH,EAAO,IAAImD,MAAM,yBAAyBk3B,SACxCA,KAGN,qBzB5J0D/6B,GACzD,IAAKA,EAAK6F,OAAQ,MAAO,GACzB,MAAMo1B,EAAY9vB,KAAKmgB,OAAOtrB,EAAKgP,IAAKksB,GAAQA,EAAIr1B,SAEpD,IAAK,IAAIC,EAAI,EAAGA,EAAIm1B,EAAWn1B,IAAK,CACnC,MAAMq1B,EAAQn7B,EAAKgP,IAAKksB,GAAQA,EAAIp1B,UAC9Bq1B,CACP,CACD"}
+{"version":3,"file":"mutts.umd.min.js","sources":["../src/async/index.ts","../src/async/browser.ts","../src/utils.ts","../src/decorator.ts","../src/destroyable.ts","../src/diff.ts","../src/eventful.ts","../src/flavored.ts","../src/indexable.ts","../src/iterableWeak.ts","../src/mixins.ts","../src/promiseChain.ts","../src/reactive/debug-hooks.ts","../src/zone.ts","../src/reactive/registry.ts","../src/reactive/effect-context.ts","../src/reactive/types.ts","../src/reactive/tracking.ts","../src/reactive/effects.ts","../src/reactive/deep-watch-state.ts","../src/reactive/change.ts","../src/reactive/non-reactive.ts","../src/reactive/deep-touch.ts","../src/reactive/proxy.ts","../src/reactive/buffer.ts","../src/reactive/deep-watch.ts","../src/reactive/memoize.ts","../src/reactive/satellite.ts","../src/reactive/iterator-helpers.ts","../src/reactive/array.ts","../src/reactive/map.ts","../src/reactive/set.ts","../src/reactive/index.ts","../src/std-decorators.ts","../src/index.ts","../src/reactive/record.ts"],"sourcesContent":["export type Restorer = () => () => void\nexport type Hook = () => Restorer\n\n// Queue for hooks registered before the environment is ready (circular dependency fix)\nexport const hooks = new Set<Hook>()\n\nexport const asyncHooks = {\n\taddHook(hook: Hook): () => void {\n\t\thooks.add(hook)\n\t\treturn () => hooks.delete(hook)\n\t},\n\t/**\n\t * [Hack] Sanitize a promise (or value) to prevent context leaks.\n\t * Default: Identity function.\n\t * Browser: Uses Macrotask wrapping to break microtask chains.\n\t */\n\tsanitizePromise(p: any): any {\n\t\treturn p\n\t},\n}\n\n/**\n * Register a hook that will be called whenever an asynchronous operation is initiated.\n * The hook should return a restorer function which will be called just before the async callback runs.\n * That restorer should in turn return an undoer function which will be called just after the async callback finishes.\n */\nexport const asyncHook = (hook: Hook) => asyncHooks.addHook(hook)\n","import { asyncHooks, hooks, type Restorer } from '.'\n\nconst promiseContexts = new WeakMap<Promise<any>, Set<Restorer>>()\n\n// [HACK]: Sanitization\n// If a Promise is created inside the zone, it carries the \"Sticky\" zone context.\n// If returned to the outer scope, that context leaks. We wrap it in a new Promise\n// created here (in the outer scope) to break the chain and sanitize the return value.\n// See BROWSER_ASYNC_POLYFILL.md for full details.\nasyncHooks.sanitizePromise = (res: any) => {\n\tif (res && typeof (res as any).then === 'function') {\n\t\treturn new Promise((resolve, reject) => {\n\t\t\tsetTimeout(() => {\n\t\t\t\t;(res as any).then(resolve, reject)\n\t\t\t}, 0)\n\t\t})\n\t}\n\treturn res\n}\n\nfunction captureRestorers() {\n\tconst restorers = new Set<Restorer>()\n\tfor (const hook of hooks) {\n\t\tconst restorer = hook()\n\t\tif (restorer) restorers.add(restorer)\n\t}\n\treturn restorers\n}\n\nfunction wrap<Args extends any[], R>(\n\tfn: ((...args: Args) => R) | null | undefined,\n\tcapturedRestorers?: Set<Restorer>\n) {\n\tif (typeof fn !== 'function') return fn\n\tconst restorers = capturedRestorers || captureRestorers()\n\treturn function (this: any, ...args: Args) {\n\t\tconst undoers: (() => void)[] = []\n\t\tfor (const restore of restorers) undoers.push(restore())\n\t\ttry {\n\t\t\treturn fn.apply(this, args)\n\t\t} finally {\n\t\t\t/* cf BROWSER_ASYNC_POLYFILL.md\n\t\t\t// Note: my fear about this code: in between 2~3~4 microtask waits, some other microtasks might have started, stopped, ...\n\t\t\t// We might be in the middle of another promise hook trying to setup the zone\n\t\t\t// TODO We might wish to have a flag :asyncZone.acquired - like a semaphore - that we falsify here and set back when we setup the zone\n\t\t\t// - but this might perhaps be an overkill creating more problems than it solves\n\t\t\tif (originals.queueMicrotask) {\n\t\t\t\t// Double microtask ensures we run after the first await resumption microtask\n\t\t\t\toriginals.queueMicrotask.call(globalThis, () => {\n\t\t\t\t\toriginals.queueMicrotask.call(globalThis, () => {\n\t\t\t\t\t\toriginals.queueMicrotask.call(globalThis, () => {\n\t\t\t\t\t\t\tfor (let i = undoers.length - 1; i >= 0; i--) undoers[i]()\n\t\t\t\t\t\t})\n\t\t\t\t\t})\n\t\t\t\t})\n\t\t\t} else {\n\t\t\t\tfor (let i = undoers.length - 1; i >= 0; i--) undoers[i]()\n\t\t\t}*/\n\t\t}\n\t}\n}\n\nconst GLOBAL_ORIGINALS = Symbol.for('mutts.originals')\nconst GLOBAL_PROMISE = Symbol.for('mutts.OriginalPromise')\n\nlet originals: any\nlet OriginalPromise: any\n\nif ((globalThis as any)[GLOBAL_ORIGINALS]) {\n\toriginals = (globalThis as any)[GLOBAL_ORIGINALS]\n\tOriginalPromise = (globalThis as any)[GLOBAL_PROMISE]\n} else {\n\tOriginalPromise = globalThis.Promise\n\toriginals = {\n\t\t// biome-ignore lint/suspicious/noThenProperty: Intentional Promise.prototype patching\n\t\tthen: OriginalPromise.prototype.then,\n\t\tcatch: OriginalPromise.prototype.catch,\n\t\tfinally: OriginalPromise.prototype.finally,\n\t\tresolve: OriginalPromise.resolve,\n\t\treject: OriginalPromise.reject,\n\t\tall: OriginalPromise.all,\n\t\tallSettled: (OriginalPromise as any).allSettled,\n\t\trace: OriginalPromise.race,\n\t\tany: (OriginalPromise as any).any,\n\t\tsetTimeout: globalThis.setTimeout,\n\t\tsetInterval: globalThis.setInterval,\n\t\tsetImmediate: (globalThis as any).setImmediate,\n\t\trequestAnimationFrame: (globalThis as any).requestAnimationFrame,\n\t\tqueueMicrotask: globalThis.queueMicrotask,\n\t}\n\t;(globalThis as any)[GLOBAL_ORIGINALS] = originals\n\t;(globalThis as any)[GLOBAL_PROMISE] = OriginalPromise\n}\n\n// Ensure modern statics are captured even if originals was cached from an older version\nif (!originals.allSettled) originals.allSettled = (OriginalPromise as any).allSettled\nif (!originals.any) originals.any = (OriginalPromise as any).any\nif (!originals.race) originals.race = OriginalPromise.race\n\nfunction patchedThen(this: any, onFulfilled: any, onRejected: any) {\n\tconst context = promiseContexts.get(this) || captureRestorers()\n\tconst nextPromise = originals.then.call(\n\t\tthis,\n\t\twrap(onFulfilled, context),\n\t\twrap(onRejected, context)\n\t)\n\tif (context.size > 0) promiseContexts.set(nextPromise, context)\n\treturn nextPromise\n}\n\nfunction patchedCatch(this: any, onRejected: any) {\n\tconst context = promiseContexts.get(this) || captureRestorers()\n\tconst nextPromise = originals.catch.call(this, wrap(onRejected, context))\n\tif (context.size > 0) promiseContexts.set(nextPromise, context)\n\treturn nextPromise\n}\n\nfunction patchedFinally(this: any, onFinally: any) {\n\tconst context = promiseContexts.get(this) || captureRestorers()\n\tconst nextPromise = originals.finally.call(this, wrap(onFinally, context))\n\tif (context.size > 0) promiseContexts.set(nextPromise, context)\n\treturn nextPromise\n}\n\nfunction PatchedPromise<T>(\n\tthis: any,\n\texecutor: (resolve: (value: T | PromiseLike<T>) => void, reject: (reason?: any) => void) => void\n) {\n\tif (typeof executor === 'function') {\n\t\tconst p = new OriginalPromise((resolve, reject) => {\n\t\t\tconst wrappedResolve = wrap(resolve)\n\t\t\tconst wrappedReject = wrap(reject)\n\t\t\texecutor(wrappedResolve, wrappedReject)\n\t\t})\n\t\tconst context = captureRestorers()\n\t\tpromiseContexts.set(p, context) // Always set, even if empty (Sticky Root)\n\t\treturn p\n\t}\n\treturn new OriginalPromise(executor)\n}\n\n// Copy statics\nObject.assign(PatchedPromise, OriginalPromise as any)\n\n// Inherit prototype for instanceof checks\nPatchedPromise.prototype = OriginalPromise.prototype\n\nPatchedPromise.resolve = (<T>(value?: T | PromiseLike<T>): Promise<T> => {\n\tconst p = originals.resolve.call(OriginalPromise, value) as Promise<T>\n\tconst context = captureRestorers()\n\t// Ensure we don't overwrite if it already has context (e.g. from constructor)\n\tif (context.size > 0 && !promiseContexts.has(p)) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.reject = (<T = never>(reason?: any): Promise<T> => {\n\tconst p = originals.reject.call(OriginalPromise, reason) as Promise<T>\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.all = (<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>[]> => {\n\tconst p = originals.all.call(OriginalPromise, values) as Promise<Awaited<T>[]>\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.allSettled = (<T>(\n\tvalues: Iterable<T | PromiseLike<T>>\n): Promise<PromiseSettledResult<Awaited<T>>[]> => {\n\tconst p = (originals.allSettled as any).call(OriginalPromise, values)\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.race = (<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>> => {\n\tconst p = originals.race.call(OriginalPromise, values) as Promise<Awaited<T>>\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\nPatchedPromise.any = (<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>> => {\n\tconst p = (originals.any as any).call(OriginalPromise, values)\n\tconst context = captureRestorers()\n\tif (context.size > 0) promiseContexts.set(p, context)\n\treturn p\n}) as any\n\n// Only apply patches if not already applied (or re-apply safely)\n// Note: OriginalPromise.prototype might be shared if we used the global one.\n// We must ensure we don't patch it twice if it's the SAME object.\nif (OriginalPromise.prototype.then !== patchedThen) {\n\t// biome-ignore lint/suspicious/noThenProperty: Intentional Promise.prototype patching\n\tOriginalPromise.prototype.then = patchedThen as any\n\tOriginalPromise.prototype.catch = patchedCatch as any\n\tOriginalPromise.prototype.finally = patchedFinally as any\n}\n\ntry {\n\tObject.defineProperty(OriginalPromise, Symbol.species, {\n\t\tget: () => PatchedPromise,\n\t\tconfigurable: true,\n\t})\n} catch (_e) {}\n\n;(globalThis as any).Promise = PatchedPromise\n\nglobalThis.setTimeout = ((callback: Function, ...args: any[]) => {\n\treturn originals.setTimeout.call(globalThis, wrap(callback as any), ...args)\n}) as any\n\nglobalThis.setInterval = ((callback: Function, ...args: any[]) => {\n\treturn originals.setInterval.call(globalThis, wrap(callback as any), ...args)\n}) as any\n\nif (originals.setImmediate) {\n\t;(globalThis as any).setImmediate = ((callback: Function, ...args: any[]) => {\n\t\treturn originals.setImmediate.call(globalThis, wrap(callback as any), ...args)\n\t}) as any\n}\n\nif (originals.requestAnimationFrame) {\n\tglobalThis.requestAnimationFrame = (callback: FrameRequestCallback) => {\n\t\treturn originals.requestAnimationFrame.call(globalThis, wrap(callback))\n\t}\n}\n\nif (originals.queueMicrotask) {\n\tglobalThis.queueMicrotask = (callback: VoidFunction): void => {\n\t\toriginals.queueMicrotask.call(globalThis, wrap(callback))\n\t}\n}\n","type ElementTypes<T extends readonly unknown[]> = {\n\t[K in keyof T]: T[K] extends readonly (infer U)[] ? U : T[K]\n}\n\n/**\n * Yields tuples containing elements from each input array, stopping at the longest array length\n * @param args - Arrays to zip together\n * @returns Generator yielding tuples containing elements from each input array\n */\nexport function* zip<T extends (readonly unknown[])[]>(...args: T): Generator<ElementTypes<T>> {\n\tif (!args.length) return []\n\tconst maxLength = Math.max(...args.map((arr) => arr.length))\n\n\tfor (let i = 0; i < maxLength; i++) {\n\t\tconst tuple = args.map((arr) => arr[i]) as ElementTypes<T>\n\t\tyield tuple\n\t}\n}\n\n/**\n * Checks if two arrays are strictly equal (shallow comparison)\n * @param a - First value\n * @param b - Second value\n * @returns True if arrays are equal or values are strictly equal\n */\nexport function arrayEquals(a: any, b: any): boolean {\n\tif (!Array.isArray(a) || !Array.isArray(b)) return false\n\tif (a === b) return true\n\tif (a.length !== b.length) return false\n\tfor (let i = 0; i < a.length; i++) {\n\t\tif (a[i] !== b[i]) return false\n\t}\n\treturn true\n}\n\nconst nativeConstructors = new Set<Function>([\n\tObject,\n\tArray,\n\tDate,\n\tFunction,\n\tSet,\n\tMap,\n\tWeakMap,\n\tWeakSet,\n\tPromise,\n\tError,\n\tTypeError,\n\tReferenceError,\n\tSyntaxError,\n\tRangeError,\n\tURIError,\n\tEvalError,\n\tReflect,\n\tProxy,\n\tRegExp,\n\tString,\n\tNumber,\n\tBoolean,\n] as Function[])\n/**\n * Checks if a function is a constructor (class or constructor function)\n * @param fn - The function to check\n * @returns True if the function is a constructor\n */\nexport function isConstructor(fn: Function): boolean {\n\treturn (\n\t\tfn &&\n\t\ttypeof fn === 'function' &&\n\t\t(nativeConstructors.has(fn) || fn.toString?.().startsWith('class '))\n\t)\n}\n\n/**\n * Checks if a value is an object\n * @param value - The value to check\n * @returns True if the value is an object\n */\nexport function isObject(value: any): value is object {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t!Array.isArray(value) &&\n\t\t!(\n\t\t\tvalue instanceof Date ||\n\t\t\tvalue instanceof RegExp ||\n\t\t\tvalue instanceof Error ||\n\t\t\tvalue instanceof Set ||\n\t\t\tvalue instanceof Map ||\n\t\t\tvalue instanceof WeakSet ||\n\t\t\tvalue instanceof WeakMap ||\n\t\t\tvalue instanceof Promise ||\n\t\t\tvalue instanceof Function\n\t\t)\n\t)\n}\n\nconst hasNode = typeof Node !== 'undefined'\nexport const FoolProof = {\n\tget(obj: any, prop: any, receiver: any) {\n\t\tif (hasNode && obj instanceof Node) return (obj as any)[prop]\n\t\treturn Reflect.get(obj, prop, receiver)\n\t},\n\tset(obj: any, prop: any, value: any, receiver: any) {\n\t\tif (hasNode && obj instanceof Node) {\n\t\t\t;(obj as any)[prop] = value\n\t\t\treturn true\n\t\t} /*\n\t\tif (!(obj instanceof Object) && !Object.hasOwn(obj, prop)) {\n\t\t\tObject.defineProperty(obj, prop, {\n\t\t\t\tvalue,\n\t\t\t\tconfigurable: true,\n\t\t\t\twritable: true,\n\t\t\t\tenumerable: true,\n\t\t\t})\n\t\t\treturn true\n\t\t}*/\n\t\treturn Reflect.set(obj, prop, value, receiver)\n\t},\n}\n\nexport function isOwnAccessor(obj: any, prop: any) {\n\tconst opd = Object.getOwnPropertyDescriptor(obj, prop)\n\treturn !!(opd?.get || opd?.set)\n}\n\n/**\n * Symbol used to provide custom comparison logic for an object.\n */\nexport const CompareSymbol = Symbol.for('mutts.compare')\n\n/**\n */\nexport function deepCompare(a: any, b: any, cache = new Map<object, Set<object>>()): boolean {\n\tif (a === b) return true\n\n\tif (typeof a !== 'object' || a === null || typeof b !== 'object' || b === null) {\n\t\treturn a === b\n\t}\n\n\t// Custom comparison support\n\tif (typeof (a as any)[CompareSymbol] === 'function') {\n\t\treturn (a as any)[CompareSymbol](b, (x: any, y: any) => deepCompare(x, y, cache))\n\t}\n\tif (typeof (b as any)[CompareSymbol] === 'function') {\n\t\treturn (b as any)[CompareSymbol](a, (x: any, y: any) => deepCompare(x, y, cache))\n\t}\n\n\t// Prototype check\n\tif (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b)) return false\n\n\t// Circular reference protection\n\tlet compared = cache.get(a)\n\tif (compared?.has(b)) return true\n\tif (!compared) {\n\t\tcompared = new Set()\n\t\tcache.set(a, compared)\n\t}\n\tcompared.add(b)\n\n\t// Handle specific object types\n\tif (Array.isArray(a)) {\n\t\tif (!Array.isArray(b) || a.length !== b.length) return false\n\t\tfor (let i = 0; i < a.length; i++) {\n\t\t\tif (!deepCompare(a[i], b[i], cache)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Date) return b instanceof Date && a.getTime() === b.getTime()\n\tif (a instanceof RegExp) return b instanceof RegExp && a.toString() === b.toString()\n\n\tif (a instanceof Set) {\n\t\tif (!(b instanceof Set) || a.size !== b.size) return false\n\t\tfor (const val of a) {\n\t\t\tlet found = false\n\t\t\tfor (const bVal of b) {\n\t\t\t\tif (deepCompare(val, bVal, cache)) {\n\t\t\t\t\tfound = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!found) return false\n\t\t}\n\t\treturn true\n\t}\n\tif (a instanceof Map) {\n\t\tif (!(b instanceof Map) || a.size !== b.size) return false\n\t\tfor (const [key, val] of a) {\n\t\t\tif (!b.has(key)) {\n\t\t\t\tlet foundMatch = false\n\t\t\t\tfor (const [bKey, bVal] of b) {\n\t\t\t\t\tif (deepCompare(key, bKey, cache) && deepCompare(val, bVal, cache)) {\n\t\t\t\t\t\tfoundMatch = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!foundMatch) return false\n\t\t\t} else if (!deepCompare(val, b.get(key), cache)) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\n\t// Compare own properties\n\tconst keysA = Object.keys(a)\n\tconst keysB = Object.keys(b)\n\tif (keysA.length !== keysB.length) return false\n\n\tfor (const key of keysA) {\n\t\tif (!Object.hasOwn(b, key) || !deepCompare(a[key], b[key], cache)) return false\n\t}\n\n\treturn true\n}\n\n// Internal use: Used for reactive sets/maps to differentiate between different reactive containers: `x.get('aKey')` vs. `x['aKey']`\nconst contentRefs = new WeakMap<object, any>()\nexport function contentRef(container: object) {\n\tif (!contentRefs.has(container))\n\t\tcontentRefs.set(\n\t\t\tcontainer,\n\t\t\tObject.seal(\n\t\t\t\tObject.create(null, {\n\t\t\t\t\tcontentOf: { value: container, writable: false, configurable: false },\n\t\t\t\t})\n\t\t\t)\n\t\t)\n\treturn contentRefs.get(container)\n}\n\n/**\n * Tags an object with a name\n * @param name - The name to tag the object with\n * @param obj - The object to tag\n * @returns The object with the tag\n */\nexport function tag<T extends object>(name: string, obj: T): T {\n\tObject.defineProperties(obj, {\n\t\t[Symbol.toStringTag]: {\n\t\t\tvalue: name,\n\t\t\twritable: false,\n\t\t\tconfigurable: true,\n\t\t},\n\t\ttoString: {\n\t\t\tvalue: () => name,\n\t\t\twritable: false,\n\t\t\tconfigurable: true,\n\t\t},\n\t})\n\treturn obj\n}\n\n/**\n * Renames a function with a new name\n * @param name - The new name for the function\n * @param fn - The function to rename\n * @returns The function with the new name\n */\nexport function named<T extends Function>(name: string, fn: T): T {\n\tObject.defineProperty(fn, 'name', {\n\t\tvalue: fn.name ? `${fn.name}::${name}` : name,\n\t\twritable: false,\n\t\tconfigurable: true,\n\t})\n\treturn fn\n}\n\nexport function* stringKeys(o: object) {\n\tfor (const key in o) yield key\n}\n\nconst runtimeGlobals = globalThis as typeof globalThis & {\n\tprocess?: {\n\t\tenv?: {\n\t\t\tNODE_ENV?: string\n\t\t}\n\t}\n}\n\nconst _mode: string =\n\truntimeGlobals.process?.env?.NODE_ENV ||\n\t(typeof import.meta !== 'undefined' && (import.meta as any).env?.MODE) ||\n\t'production'\n\nexport const isDev = _mode === 'development'\nexport const isProd = _mode === 'production'\nexport const isTest = _mode === 'test'\n","// biome-ignore-all lint/suspicious/noConfusingVoidType: We *love* voids\n// Standardized decorator system that works with both Legacy and Modern decorators\n\nimport { isConstructor } from './utils'\n\n/**\n * Error thrown when decorator operations fail\n */\nexport class DecoratorError extends Error {\n\tconstructor(message: string) {\n\t\tsuper(message)\n\t\tthis.name = 'DecoratorException'\n\t}\n}\n//#region all decorator types\n\n// Used for get/set and method decorators\n/**\n * Legacy property decorator type for methods, getters, and setters\n */\nexport type LegacyPropertyDecorator<T> = (\n\ttarget: T,\n\tname: string | symbol,\n\tdescriptor: PropertyDescriptor\n) => any\n\n/**\n * Legacy class decorator type\n */\nexport type LegacyClassDecorator<T> = (target: T) => any\n\n/**\n * Modern method decorator type\n */\nexport type ModernMethodDecorator<T> = (target: T, context: ClassMethodDecoratorContext) => any\n\n/**\n * Modern getter decorator type\n */\nexport type ModernGetterDecorator<T> = (target: T, context: ClassGetterDecoratorContext) => any\n\n/**\n * Modern setter decorator type\n */\nexport type ModernSetterDecorator<T> = (target: T, context: ClassSetterDecoratorContext) => any\n\n/**\n * Modern accessor decorator type\n */\nexport type ModernAccessorDecorator<T> = (target: T, context: ClassAccessorDecoratorContext) => any\n\n/**\n * Modern class decorator type\n */\nexport type ModernClassDecorator<T> = (target: T, context: ClassDecoratorContext) => any\n\n//#endregion\n\ntype DDMethod<T> = (\n\toriginal: (this: T, ...args: any[]) => any,\n\ttarget: any,\n\tname: PropertyKey\n) => ((this: T, ...args: any[]) => any) | void\n\ntype DDGetter<T> = (\n\toriginal: (this: T) => any,\n\ttarget: any,\n\tname: PropertyKey\n) => ((this: T) => any) | void\n\ntype DDSetter<T> = (\n\toriginal: (this: T, value: any) => void,\n\ttarget: any,\n\tname: PropertyKey\n) => ((this: T, value: any) => void) | void\n\ntype DDClass<T> = <Ctor extends new (...args: any[]) => T = new (...args: any[]) => T>(\n\ttarget: Ctor\n) => Ctor | void\n/**\n * Description object for creating decorators that work with both Legacy and Modern decorator proposals\n */\nexport interface DecoratorDescription<T> {\n\t/** Handler for method decorators */\n\tmethod?: DDMethod<T>\n\t/** Handler for class decorators */\n\tclass?: DDClass<T>\n\t/** Handler for getter decorators */\n\tgetter?: DDGetter<T>\n\t/** Handler for setter decorators */\n\tsetter?: DDSetter<T>\n\t/** Default handler for any decorator type not explicitly defined */\n\tdefault?: (...args: any[]) => any\n}\n\n/**\n * Type for decorators that work with both Legacy and Modern decorator proposals\n * Automatically infers the correct decorator type based on the description\n */\nexport type Decorator<T, Description extends DecoratorDescription<T>> = (Description extends {\n\tmethod: DDMethod<T>\n}\n\t? LegacyPropertyDecorator<T> & ModernMethodDecorator<T>\n\t: unknown) &\n\t(Description extends { class: DDClass<new (...args: any[]) => T> }\n\t\t? LegacyClassDecorator<new (...args: any[]) => T> &\n\t\t\t\tModernClassDecorator<new (...args: any[]) => T>\n\t\t: unknown) &\n\t(Description extends { getter: DDGetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernGetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { setter: DDSetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernSetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { default: infer Signature } ? Signature : unknown)\n\n/**\n * Factory type for creating decorators that work with both Legacy and Modern decorator proposals\n */\nexport type DecoratorFactory<T> = <Description extends DecoratorDescription<T>>(\n\tdescription: Description\n) => (Description extends { method: DDMethod<T> }\n\t? LegacyPropertyDecorator<T> & ModernMethodDecorator<T>\n\t: unknown) &\n\t(Description extends { class: DDClass<new (...args: any[]) => T> }\n\t\t? LegacyClassDecorator<new (...args: any[]) => T> &\n\t\t\t\tModernClassDecorator<new (...args: any[]) => T>\n\t\t: unknown) &\n\t(Description extends { getter: DDGetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernGetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { setter: DDSetter<T> }\n\t\t? LegacyPropertyDecorator<T> & ModernSetterDecorator<T> & ModernAccessorDecorator<T>\n\t\t: unknown) &\n\t(Description extends { default: infer Signature } ? Signature : unknown)\n\n/**\n * Creates a decorator that works with Legacy decorator proposals\n * @param description - The decorator description object\n * @returns A decorator function compatible with Legacy decorators\n */\nexport function legacyDecorator<T = any>(description: DecoratorDescription<T>): any {\n\treturn function (\n\t\tthis: any,\n\t\ttarget: any,\n\t\tpropertyKey?: PropertyKey,\n\t\tdescriptor?: PropertyDescriptor,\n\t\t...args: any[]\n\t) {\n\t\tif (propertyKey === undefined) {\n\t\t\tif (isConstructor(target)) {\n\t\t\t\tif (!('class' in description)) throw new Error('Decorator cannot be applied to a class')\n\t\t\t\treturn description.class!(target)\n\t\t\t}\n\t\t} else if (typeof target === 'object' && ['string', 'symbol'].includes(typeof propertyKey)) {\n\t\t\tif (!descriptor) throw new Error('Decorator cannot be applied to a field')\n\t\t\telse if (typeof descriptor === 'object' && 'configurable' in descriptor) {\n\t\t\t\tif ('get' in descriptor || 'set' in descriptor) {\n\t\t\t\t\tif (!('getter' in description || 'setter' in description))\n\t\t\t\t\t\tthrow new Error('Decorator cannot be applied to a getter or setter')\n\t\t\t\t\tif ('getter' in description) {\n\t\t\t\t\t\tconst newGetter = description.getter!(descriptor.get as any, target, propertyKey)\n\t\t\t\t\t\tif (newGetter) descriptor.get = newGetter\n\t\t\t\t\t}\n\t\t\t\t\tif ('setter' in description) {\n\t\t\t\t\t\tconst newSetter = description.setter!(descriptor.set as any, target, propertyKey)\n\t\t\t\t\t\tif (newSetter) descriptor.set = newSetter\n\t\t\t\t\t}\n\t\t\t\t\treturn descriptor\n\t\t\t\t} else if (typeof descriptor.value === 'function') {\n\t\t\t\t\tif (!('method' in description)) throw new Error('Decorator cannot be applied to a method')\n\t\t\t\t\tconst newMethod = description.method!(descriptor.value, target, propertyKey)\n\t\t\t\t\tif (newMethod) descriptor.value = newMethod\n\t\t\t\t\treturn descriptor\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!('default' in description))\n\t\t\tthrow new Error('Decorator do not have a default implementation')\n\t\treturn description.default!.call(this, target, propertyKey, descriptor, ...args)\n\t}\n}\n\n/**\n * Creates a decorator that works with Modern decorator proposals\n * @param description - The decorator description object\n * @returns A decorator function compatible with Modern decorators\n */\nexport function modernDecorator<T = any>(description: DecoratorDescription<T>): any {\n\t/*return function (target: any, context?: DecoratorContext, ...args: any[]) {*/\n\treturn function (this: any, target: any, context?: DecoratorContext, ...args: any[]) {\n\t\tif (!context?.kind || typeof context.kind !== 'string') {\n\t\t\tif (!('default' in description))\n\t\t\t\tthrow new Error('Decorator do not have a default implementation')\n\t\t\treturn description.default!.call(this, target, context, ...args)\n\t\t}\n\t\tswitch (context.kind) {\n\t\t\tcase 'class':\n\t\t\t\tif (!('class' in description)) throw new Error('Decorator cannot be applied to a class')\n\t\t\t\treturn description.class!(target)\n\t\t\tcase 'field':\n\t\t\t\tthrow new Error('Decorator cannot be applied to a field')\n\t\t\tcase 'getter':\n\t\t\t\tif (!('getter' in description)) throw new Error('Decorator cannot be applied to a getter')\n\t\t\t\treturn description.getter!(target, target, context.name)\n\t\t\tcase 'setter':\n\t\t\t\tif (!('setter' in description)) throw new Error('Decorator cannot be applied to a setter')\n\t\t\t\treturn description.setter!(target, target, context.name)\n\t\t\tcase 'method':\n\t\t\t\tif (!('method' in description)) throw new Error('Decorator cannot be applied to a method')\n\t\t\t\treturn description.method!(target, target, context.name)\n\t\t\tcase 'accessor': {\n\t\t\t\tif (!('getter' in description || 'setter' in description))\n\t\t\t\t\tthrow new Error('Decorator cannot be applied to a getter or setter')\n\t\t\t\tconst rv: Partial<ClassAccessorDecoratorResult<any, any>> = {}\n\t\t\t\tif ('getter' in description) {\n\t\t\t\t\tconst newGetter = description.getter!(target.get, target, context.name)\n\t\t\t\t\tif (newGetter) rv.get = newGetter\n\t\t\t\t}\n\t\t\t\tif ('setter' in description) {\n\t\t\t\t\tconst newSetter = description.setter!(target.set, target, context.name)\n\t\t\t\t\tif (newSetter) rv.set = newSetter\n\t\t\t\t}\n\t\t\t\treturn rv\n\t\t\t}\n\t\t\t//return description.accessor?.(target, context.name, target)\n\t\t}\n\t}\n}\n\n/**\n * Detects if the decorator is being called in modern (Modern) or legacy (Legacy) mode\n * based on the arguments passed to the decorator function\n */\nfunction detectDecoratorMode(\n\t_target: any,\n\tcontextOrKey?: any,\n\t_descriptor?: any\n): 'modern' | 'legacy' {\n\t// Modern decorators have a context object as the second parameter\n\t// Legacy decorators have a string/symbol key as the second parameter\n\tif (\n\t\ttypeof contextOrKey === 'object' &&\n\t\tcontextOrKey !== null &&\n\t\ttypeof contextOrKey.kind === 'string'\n\t) {\n\t\treturn 'modern'\n\t}\n\treturn 'legacy'\n}\n\n/**\n * Main decorator factory that automatically detects and works with both Legacy and Modern decorator proposals\n * @param description - The decorator description object\n * @returns A decorator that works in both Legacy and Modern environments\n */\nexport const decorator: DecoratorFactory<any> = (description: DecoratorDescription<any>) => {\n\tconst modern = modernDecorator(description)\n\tconst legacy = legacyDecorator(description)\n\treturn ((target: any, contextOrKey?: any, ...args: any[]) => {\n\t\tconst mode = detectDecoratorMode(target, contextOrKey, args[0])\n\t\treturn mode === 'modern'\n\t\t\t? modern(target, contextOrKey, ...args)\n\t\t\t: legacy(target, contextOrKey, ...args)\n\t}) as any\n}\n\n/**\n * Generic class decorator type that works with both Legacy and Modern decorator proposals\n */\nexport type GenericClassDecorator<T> = LegacyClassDecorator<abstract new (...args: any[]) => T> &\n\tModernClassDecorator<abstract new (...args: any[]) => T>\n","import { decorator } from './decorator'\n\n// Integrated with `using` statement via Symbol.dispose\nconst fr = new FinalizationRegistry<() => void>((f) => f())\n/**\n * Symbol for marking destructor methods\n */\nexport const destructor = Symbol('destructor')\n/**\n * Symbol for accessing allocated values in destroyable objects\n */\nexport const allocatedValues = Symbol('allocated')\n/**\n * Error thrown when attempting to access a destroyed object\n */\nexport class DestructionError extends Error {\n\tstatic throw<_T = void>(msg: string) {\n\t\treturn () => {\n\t\t\tthrow new DestructionError(msg)\n\t\t}\n\t}\n\tconstructor(msg: string) {\n\t\tsuper(`Object is destroyed. ${msg}`)\n\t\tthis.name = 'DestroyedAccessError'\n\t}\n}\nconst destroyedHandler = {\n\t[Symbol.toStringTag]: 'MutTs Destroyable',\n\tget: DestructionError.throw('Cannot access destroyed object'),\n\tset: DestructionError.throw('Cannot access destroyed object'),\n} as const\n\nabstract class AbstractDestroyable<Allocated> {\n\tabstract [destructor](allocated: Allocated): void\n\t[Symbol.dispose](): void {\n\t\tthis[destructor](this as unknown as Allocated)\n\t}\n}\n\ninterface Destructor<Allocated> {\n\tdestructor(allocated: Allocated): void\n}\n\n/**\n * Creates a destroyable class with a base class and destructor object\n * @param base - The base class to extend\n * @param destructorObj - Object containing the destructor method\n * @returns A destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Partial<InstanceType<T>>,\n>(\n\tbase: T,\n\tdestructorObj: Destructor<Allocated>\n): (new (\n\t...args: ConstructorParameters<T>\n) => InstanceType<T> & { [allocatedValues]: Allocated }) & {\n\tdestroy(obj: InstanceType<T>): boolean\n\tisDestroyable(obj: InstanceType<T>): boolean\n}\n\n/**\n * Creates a destroyable class with only a destructor object (no base class)\n * @param destructorObj - Object containing the destructor method\n * @returns A destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<Allocated extends Record<PropertyKey, any> = Record<PropertyKey, any>>(\n\tdestructorObj: Destructor<Allocated>\n): (new () => { [allocatedValues]: Allocated }) & {\n\tdestroy(obj: any): boolean\n\tisDestroyable(obj: any): boolean\n}\n\n/**\n * Creates a destroyable class with a base class (requires [destructor] method)\n * @param base - The base class to extend\n * @returns A destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Record<PropertyKey, any> = Record<PropertyKey, any>,\n>(\n\tbase: T\n): (new (\n\t...args: ConstructorParameters<T>\n) => AbstractDestroyable<Allocated> & InstanceType<T> & { [allocatedValues]: Allocated }) & {\n\tdestroy(obj: InstanceType<T>): boolean\n\tisDestroyable(obj: InstanceType<T>): boolean\n}\n\n/**\n * Creates an abstract destroyable base class\n * @returns An abstract destroyable class with static destroy and isDestroyable methods\n */\nexport function Destroyable<\n\tAllocated extends Record<PropertyKey, any> = Record<PropertyKey, any>,\n>(): abstract new () => (AbstractDestroyable<Allocated> & {\n\t[allocatedValues]: Allocated\n}) & {\n\tdestroy(obj: any): boolean\n\tisDestroyable(obj: any): boolean\n}\n\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Record<PropertyKey, any> = Record<PropertyKey, any>,\n>(base?: T | Destructor<Allocated>, destructorObj?: Destructor<Allocated>) {\n\tif (base && typeof base !== 'function') {\n\t\tdestructorObj = base as Destructor<Allocated>\n\t\tbase = undefined\n\t}\n\tif (!base) {\n\t\tbase = class {} as T\n\t}\n\n\treturn class Destroyable extends (base as T) {\n\t\tstatic readonly destructors = new WeakMap<any, () => void>()\n\t\tstatic destroy(obj: Destroyable) {\n\t\t\tconst destructor = Destroyable.destructors.get(obj)\n\t\t\tif (!destructor) return false\n\t\t\tfr.unregister(obj[allocatedValues])\n\t\t\tDestroyable.destructors.delete(obj)\n\t\t\tObject.setPrototypeOf(obj, new Proxy({}, destroyedHandler))\n\t\t\t// Clear all own properties\n\t\t\tfor (const key of Object.getOwnPropertyNames(obj)) {\n\t\t\t\tdelete (obj as any)[key]\n\t\t\t}\n\t\t\tdestructor()\n\t\t\treturn true\n\t\t}\n\t\tstatic isDestroyable(obj: Destroyable) {\n\t\t\treturn Destroyable.destructors.has(obj)\n\t\t}\n\n\t\t[forwardProperties]!: PropertyKey[]\n\t\treadonly [allocatedValues]: Allocated\n\t\tconstructor(...args: any[]) {\n\t\t\tsuper(...args)\n\t\t\tconst allocated = {} as Allocated\n\t\t\tthis[allocatedValues] = allocated\n\t\t\t// @ts-expect-error `this` is an AbstractDestroyable\n\t\t\tconst myDestructor = destructorObj?.destructor ?? this[destructor]\n\t\t\tif (!myDestructor) {\n\t\t\t\tthrow new DestructionError('Destructor is not defined')\n\t\t\t}\n\t\t\tfunction destruction() {\n\t\t\t\tmyDestructor(allocated)\n\t\t\t}\n\t\t\tDestroyable.destructors.set(this, destruction)\n\t\t\tfr.register(this, destruction, allocated)\n\t\t}\n\t}\n}\n\nconst forwardProperties = Symbol('forwardProperties')\n/**\n * Decorator that marks properties to be stored in the allocated object and passed to the destructor\n * Use with accessor properties or explicit get/set pairs\n */\nexport const allocated = decorator({\n\tsetter(original, _target, propertyKey) {\n\t\treturn function (value) {\n\t\t\tthis[allocatedValues][propertyKey] = value\n\t\t\treturn original.call(this, value)\n\t\t}\n\t},\n})\n\n/**\n * Registers a callback to be called when an object is garbage collected\n * @param cb - The callback function to execute on garbage collection\n * @returns The object whose reference can be collected\n */\nexport function callOnGC(cb: () => void) {\n\tlet called = false\n\tconst forward = () => {\n\t\tif (called) return\n\t\tcalled = true\n\t\tcb()\n\t}\n\tfr.register(forward, cb, cb)\n\treturn forward\n}\n\n/**\n * Context Manager Protocol for `using` statement integration\n * Provides automatic resource cleanup when used with the `using` statement\n */\nexport interface ContextManager<T = any> {\n\t[Symbol.dispose](): void\n\tvalue?: T\n}\n","export interface ArrayDiffResult<T> {\n\tindexA: number\n\tindexB: number\n\tsliceA: T[]\n\tsliceB: T[]\n}\n\n/** Max edit distance before bailing out to a single \"replace all\" patch */\nconst BAILOUT_D = 256\n\n/**\n * Myers' diff producing grouped patches: `{indexA, indexB, sliceA, sliceB}[]`.\n * - O(N) for identical or prefix/suffix-only differences\n * - O(ND) for small D, with a hard bailout at D=BAILOUT_D → single replacement patch\n */\nexport function arrayDiff<T>(A: readonly T[], B: readonly T[]): ArrayDiffResult<T>[] {\n\tlet start = 0\n\tlet endA = A.length\n\tlet endB = B.length\n\n\t// Trim common prefix\n\twhile (start < endA && start < endB && A[start] === B[start]) start++\n\t// Trim common suffix\n\twhile (endA > start && endB > start && A[endA - 1] === B[endB - 1]) {\n\t\tendA--\n\t\tendB--\n\t}\n\n\tconst lenA = endA - start\n\tconst lenB = endB - start\n\n\tif (lenA === 0 && lenB === 0) return []\n\tif (lenA === 0)\n\t\treturn [{ indexA: start, indexB: start, sliceA: [], sliceB: B.slice(start, endB) }]\n\tif (lenB === 0)\n\t\treturn [{ indexA: start, indexB: start, sliceA: A.slice(start, endA), sliceB: [] }]\n\n\t// Myers with bailout\n\tconst maxD = Math.min(lenA + lenB, BAILOUT_D)\n\tconst vSize = 2 * maxD + 1\n\tconst vOffset = maxD\n\tconst V = new Int32Array(vSize)\n\tV[vOffset + 1] = 0\n\tconst history: Int32Array[] = []\n\n\tfor (let d = 0; d <= maxD; d++) {\n\t\tfor (let k = -d; k <= d; k += 2) {\n\t\t\tlet x: number\n\t\t\tif (k === -d || (k !== d && V[vOffset + k - 1] < V[vOffset + k + 1])) {\n\t\t\t\tx = V[vOffset + k + 1]\n\t\t\t} else {\n\t\t\t\tx = V[vOffset + k - 1] + 1\n\t\t\t}\n\t\t\tlet y = x - k\n\t\t\twhile (x < lenA && y < lenB && A[start + x] === B[start + y]) {\n\t\t\t\tx++\n\t\t\t\ty++\n\t\t\t}\n\t\t\tV[vOffset + k] = x\n\t\t\tif (x >= lenA && y >= lenB) return buildPatches(history, A, B, start, x, y, d, k, vOffset)\n\t\t}\n\t\thistory.push(new Int32Array(V))\n\t}\n\n\t// Bailout: too many differences\n\treturn [\n\t\t{ indexA: start, indexB: start, sliceA: A.slice(start, endA), sliceB: B.slice(start, endB) },\n\t]\n}\n\nfunction buildPatches<T>(\n\thistory: Int32Array[],\n\tA: readonly T[],\n\tB: readonly T[],\n\toffset: number,\n\tfinalX: number,\n\tfinalY: number,\n\tfinalD: number,\n\tfinalK: number,\n\tvOffset: number\n): ArrayDiffResult<T>[] {\n\t// Backtrack from (finalX, finalY) at step finalD to step 0, collecting ops in reverse\n\tconst ops: (0 | 1 | 2)[] = [] // 0=eq, 1=ins, 2=del\n\tlet x = finalX\n\tlet y = finalY\n\tlet k = finalK\n\n\tfor (let d = finalD; d > 0; d--) {\n\t\tconst prev = history[d - 1]\n\t\tlet prevK: number\n\t\tlet down: boolean\n\t\tif (k === -d) {\n\t\t\tprevK = k + 1\n\t\t\tdown = true\n\t\t} else if (k === d) {\n\t\t\tprevK = k - 1\n\t\t\tdown = false\n\t\t} else if (prev[vOffset + k - 1] < prev[vOffset + k + 1]) {\n\t\t\tprevK = k + 1\n\t\t\tdown = true\n\t\t} else {\n\t\t\tprevK = k - 1\n\t\t\tdown = false\n\t\t}\n\n\t\tconst prevXEnd = prev[vOffset + prevK]\n\t\tconst prevYEnd = prevXEnd - prevK\n\t\tconst xStart = down ? prevXEnd : prevXEnd + 1\n\t\tconst yStart = down ? prevYEnd + 1 : prevXEnd + 1 - k\n\n\t\t// Diagonal matches (pushed in reverse)\n\t\twhile (x > xStart && y > yStart) {\n\t\t\tops.push(0)\n\t\t\tx--\n\t\t\ty--\n\t\t}\n\t\t// The edit step\n\t\tif (down) {\n\t\t\tops.push(1) // ins\n\t\t\ty--\n\t\t} else {\n\t\t\tops.push(2) // del\n\t\t\tx--\n\t\t}\n\t\tk = prevK\n\t}\n\n\t// Walk ops forward (they were pushed in reverse), grouping contiguous edits\n\tconst patches: ArrayDiffResult<T>[] = []\n\tlet currA = offset\n\tlet currB = offset\n\tlet sliceA: T[] = []\n\tlet sliceB: T[] = []\n\tlet patchA = -1\n\tlet patchB = -1\n\n\tconst flush = () => {\n\t\tif (patchA !== -1) {\n\t\t\tpatches.push({ indexA: patchA, indexB: patchB, sliceA, sliceB })\n\t\t\tsliceA = []\n\t\t\tsliceB = []\n\t\t\tpatchA = -1\n\t\t}\n\t}\n\n\tfor (let i = ops.length - 1; i >= 0; i--) {\n\t\tconst op = ops[i]\n\t\tif (op === 0) {\n\t\t\tflush()\n\t\t\tcurrA++\n\t\t\tcurrB++\n\t\t} else if (op === 1) {\n\t\t\tif (patchA === -1) {\n\t\t\t\tpatchA = currA\n\t\t\t\tpatchB = currB\n\t\t\t}\n\t\t\tsliceB.push(B[currB++])\n\t\t} else {\n\t\t\tif (patchA === -1) {\n\t\t\t\tpatchA = currA\n\t\t\t\tpatchB = currB\n\t\t\t}\n\t\t\tsliceA.push(A[currA++])\n\t\t}\n\t}\n\tflush()\n\treturn patches\n}\n","/**\n * Base type for event maps - all event handlers must be functions\n */\nexport type EventsBase = Record<string, (...args: any[]) => void>\n\nconst events = Symbol('events')\nconst hooks = Symbol('hooks')\n\ntype EventfulStore = {\n\t[events]: Map<PropertyKey, Set<(...args: any[]) => void>>\n\t[hooks]: Set<(...args: any[]) => void>\n}\n\nfunction getEventMap(target: object): EventfulStore[typeof events] {\n\treturn (target as EventfulStore)[events]\n}\n\nfunction getHookSet(target: object): EventfulStore[typeof hooks] {\n\treturn (target as EventfulStore)[hooks]\n}\n\nconst eventBehavior = {\n\ton<EventType extends keyof EventsBase>(\n\t\teventOrEvents: EventType | Partial<EventsBase>,\n\t\tcb?: EventsBase[EventType]\n\t): (this: Eventful<any>) => void {\n\t\tconst self = this as Eventful<any>\n\t\tconst eventMap = getEventMap(self)\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof EventsBase)[]) {\n\t\t\t\tthis.on(e, eventOrEvents[e]!)\n\t\t\t}\n\t\t} else if (cb !== undefined) {\n\t\t\tconst callbacks = eventMap.get(eventOrEvents) ?? new Set<EventsBase[EventType]>()\n\t\t\tif (!callbacks.has(cb)) callbacks.add(cb)\n\t\t\teventMap.set(eventOrEvents, callbacks)\n\t\t}\n\t\treturn () => this.off(eventOrEvents, cb)\n\t},\n\toff<EventType extends keyof EventsBase>(\n\t\teventOrEvents: EventType | Partial<EventsBase>,\n\t\tcb?: EventsBase[EventType]\n\t): void {\n\t\tconst self = this as Eventful<any>\n\t\tconst eventMap = getEventMap(self)\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof EventsBase)[]) {\n\t\t\t\tthis.off(e, eventOrEvents[e])\n\t\t\t}\n\t\t} else if (cb !== null && cb !== undefined) {\n\t\t\tconst callbacks = eventMap.get(eventOrEvents)\n\t\t\tif (callbacks) {\n\t\t\t\tcallbacks.delete(cb)\n\t\t\t\tif (!callbacks.size) eventMap.delete(eventOrEvents)\n\t\t\t}\n\t\t} else {\n\t\t\t// Remove all listeners for this event\n\t\t\teventMap.delete(eventOrEvents)\n\t\t}\n\t},\n\temit<EventType extends keyof EventsBase>(\n\t\tevent: EventType,\n\t\t...args: Parameters<EventsBase[EventType]>\n\t) {\n\t\tconst self = this as Eventful<any>\n\t\tconst callbacks = getEventMap(self).get(event)\n\t\tif (callbacks) for (const cb of callbacks) cb.apply(this, args)\n\t\tfor (const cb of getHookSet(self)) cb.call(this, event, ...args)\n\t},\n}\n\nfunction perEvent(\n\teventful: Eventful<any>,\n\tfct: (event: string, ...args: any[]) => void,\n\tuse?: 'use'\n) {\n\tconst cache = new Map<string, (...args: any[]) => any>()\n\treturn new Proxy(fct, {\n\t\tget(target, prop: PropertyKey) {\n\t\t\tif (typeof prop !== 'string')\n\t\t\t\treturn (target as typeof target & Record<PropertyKey, unknown>)[prop]\n\t\t\tif (use && !getEventMap(eventful).has(prop) && !getHookSet(eventful).size) return () => {}\n\n\t\t\t// Return cached function or create and cache\n\t\t\tlet cached = cache.get(prop)\n\t\t\tif (!cached) {\n\t\t\t\tcached = (...args: any[]) => fct.apply(eventful, [prop, ...args])\n\t\t\t\tcache.set(prop, cached)\n\t\t\t}\n\t\t\treturn cached\n\t\t},\n\t})\n}\n\n/**\n * A type-safe event system that provides a clean API for event handling\n * @template Events - The event map defining event names and their handler signatures\n */\nexport class Eventful<Events extends EventsBase> {\n\tprivate readonly [events] = new Map<keyof Events, Set<(...args: any[]) => void>>()\n\tprivate readonly [hooks] = new Set<(...args: any[]) => void>()\n\n\tpublic hook(\n\t\tcb: <EventType extends keyof Events>(\n\t\t\tevent: EventType,\n\t\t\t...args: Parameters<Events[EventType]>\n\t\t) => void\n\t): () => void {\n\t\tthis[hooks].add(cb)\n\t\treturn () => {\n\t\t\tthis[hooks].delete(cb)\n\t\t}\n\t}\n\n\tpublic on = perEvent(this, eventBehavior.on) as ((events: Partial<Events>) => void) &\n\t\t(<EventType extends keyof Events>(event: EventType, cb: Events[EventType]) => () => void) & {\n\t\t\t[event in keyof Events]: (cb: Events[event]) => () => void\n\t\t}\n\tpublic off = perEvent(this, eventBehavior.off) as ((events: Partial<Events>) => void) &\n\t\t(<EventType extends keyof Events>(event: EventType, cb?: Events[EventType]) => void) & {\n\t\t\t[event in keyof Events]: (cb?: Events[event]) => void\n\t\t}\n\n\tpublic emit = perEvent(this, eventBehavior.emit, 'use') as (<EventType extends keyof Events>(\n\t\tevent: EventType,\n\t\t...args: Parameters<Events[EventType]>\n\t) => void) &\n\t\tEvents\n}\n","/**\n * Creates a flavored (extensible) version of a function with chainable property modifiers.\n *\n * Each property defined in `flavors` returns a new flavored function that transforms\n * how the original function is called. This enables a fluent API where properties\n * create specialized variants of the base function.\n *\n * @param fn - The base function to flavor\n * @param flavors - Object defining the flavor properties (getters or methods)\n * @returns A proxy of the function with the flavor properties attached\n *\n * @example\n * ```typescript\n * function greet(name: string, options?: { loud?: boolean }) {\n *   const greeting = `Hello, ${name}!`\n *   return options?.loud ? greeting.toUpperCase() : greeting\n * }\n *\n * const flavoredGreet = flavored(greet, {\n *   get loud() {\n *     return createFlavor(this, (name, opts) => [name, { ...opts, loud: true }])\n *   }\n * })\n *\n * flavoredGreet('World') // \"Hello, World!\"\n * flavoredGreet.loud('World') // \"HELLO, WORLD!\"\n * ```\n */\nimport { named } from './utils'\n\ntype AnyFunction = (...args: any[]) => any\ntype CaptionedOptions<T extends AnyFunction> = {\n\tcallbackIndex?: number\n\tname?: string\n\trename?: (caption: string, callback: Function) => unknown\n\twarn?: (message: string) => void\n\tshouldWarnAnonymous?: (callback: Function, args: Parameters<T>) => boolean\n}\ntype ResolvedCaptionedOptions<T extends AnyFunction> = {\n\tcallbackIndex: number\n\tname: string\n\trename: NonNullable<CaptionedOptions<T>['rename']>\n\twarn: NonNullable<CaptionedOptions<T>['warn']>\n\tshouldWarnAnonymous?: CaptionedOptions<T>['shouldWarnAnonymous']\n}\n\nconst captionedOptionsSymbol = Symbol('mutts.captioned.options')\n\nexport type Captioned<T extends AnyFunction> = T &\n\t((strings: TemplateStringsArray, ...values: readonly unknown[]) => T)\n\nfunction isTemplateStringsArray(value: unknown): value is TemplateStringsArray {\n\treturn (\n\t\tArray.isArray(value) &&\n\t\tObject.hasOwn(value, 'raw') &&\n\t\tArray.isArray((value as unknown as TemplateStringsArray).raw)\n\t)\n}\n\nfunction renderTemplate(strings: TemplateStringsArray, values: readonly unknown[]) {\n\tlet result = strings[0] ?? ''\n\tfor (let i = 0; i < values.length; i++) result += String(values[i]) + (strings[i + 1] ?? '')\n\treturn result\n}\n\nfunction renameCallback<T extends Function>(caption: string, callback: T): T {\n\tObject.defineProperty(callback, 'name', {\n\t\tvalue: caption,\n\t\twritable: false,\n\t\tconfigurable: true,\n\t})\n\treturn callback\n}\n\nfunction isAnonymousCallback(callback: Function) {\n\treturn !callback.name || callback.name === 'anonymous'\n}\n\n/**\n * Wraps a callback-first function so it also accepts a tagged-template call form.\n *\n * The template caption is applied to one callback argument before the base\n * function runs. By default, `captioned` targets the first argument, but\n * `callbackIndex` can point to any callback position.\n *\n * This is intended for APIs such as `effect`, `lift`, or `watch` where naming\n * is useful but should remain separate from the flavor system.\n *\n * Plain calls still work:\n * `run(callback)`\n *\n * Captioned calls add a runtime name to the first callback:\n * `` run`task:${id}`(callback) ``\n *\n * Anonymous uncaptioned callbacks may trigger a warning depending on\n * `shouldWarnAnonymous`.\n */\nexport function captioned<T extends AnyFunction>(\n\tfn: T,\n\toptions: CaptionedOptions<T> = {}\n): Captioned<T> {\n\tconst settings: ResolvedCaptionedOptions<T> = {\n\t\tcallbackIndex: options.callbackIndex ?? 0,\n\t\tname: options.name ?? (fn.name || 'callback'),\n\t\trename: options.rename ?? ((caption, callback) => renameCallback(caption, callback)),\n\t\t// biome-ignore lint/suspicious/noConsole: This is the whole point here\n\t\twarn: options.warn ?? ((message) => console.warn(message)),\n\t\tshouldWarnAnonymous: options.shouldWarnAnonymous,\n\t}\n\t;(fn as T & { [captionedOptionsSymbol]?: CaptionedOptions<T> })[captionedOptionsSymbol] = settings\n\n\treturn new Proxy(fn, {\n\t\tget(target, prop, receiver) {\n\t\t\tif (prop === captionedOptionsSymbol) return settings\n\t\t\treturn Reflect.get(target, prop, receiver)\n\t\t},\n\t\tapply(target, thisArg, args) {\n\t\t\tif (isTemplateStringsArray(args[0])) {\n\t\t\t\tconst caption = renderTemplate(args[0], args.slice(1))\n\t\t\t\treturn function captionedCall(this: unknown, ...callArgs: Parameters<T>) {\n\t\t\t\t\tconst callback = callArgs[settings.callbackIndex]\n\t\t\t\t\tif (typeof callback !== 'function')\n\t\t\t\t\t\tthrow new TypeError(\n\t\t\t\t\t\t\t`${settings.name} template calls require a callback at argument index ${settings.callbackIndex}`\n\t\t\t\t\t\t)\n\t\t\t\t\tconst nextArgs = [...callArgs] as Parameters<T>\n\t\t\t\t\tnextArgs[settings.callbackIndex] = settings.rename(\n\t\t\t\t\t\tcaption,\n\t\t\t\t\t\tcallback\n\t\t\t\t\t) as Parameters<T>[number]\n\t\t\t\t\treturn Reflect.apply(target, this, nextArgs)\n\t\t\t\t} as T\n\t\t\t}\n\t\t\tconst callback = args[settings.callbackIndex]\n\t\t\tif (typeof callback === 'function' && isAnonymousCallback(callback)) {\n\t\t\t\tconst shouldWarn = settings.shouldWarnAnonymous?.(callback, args as Parameters<T>) ?? true\n\t\t\t\tif (shouldWarn)\n\t\t\t\t\tsettings.warn(\n\t\t\t\t\t\t`${settings.name}: anonymous callback detected. Use template syntax for automatic naming:\\n` +\n\t\t\t\t\t\t\t`  Current: ${settings.name}(() => { ... })\\n` +\n\t\t\t\t\t\t\t`  Fix:     ${settings.name}\\`descriptive-name\\`(() => { ... })\\n` +\n\t\t\t\t\t\t\t`The captioned system uses the template literal as the effect name for better debugging.`\n\t\t\t\t\t)\n\t\t\t}\n\t\t\treturn Reflect.apply(target, thisArg, args)\n\t\t},\n\t}) as Captioned<T>\n}\n\nexport function inheritCaption<T extends AnyFunction>(source: AnyFunction, target: T): T {\n\tconst settings = (source as AnyFunction & { [captionedOptionsSymbol]?: CaptionedOptions<T> })[\n\t\tcaptionedOptionsSymbol\n\t]\n\treturn settings ? (captioned(target, settings) as T) : target\n}\n\n/**\n * Creates a flavored (extensible) version of a function with chainable property modifiers.\n */\nexport function flavored<T extends (...args: any[]) => any, F>(\n\tfn: T,\n\tflavors: F & ThisType<T & F>\n): T & F {\n\t// Store flavors for recursive flavoring\n\t;(fn as any).flavors = flavors\n\n\treturn new Proxy(fn, {\n\t\tget(target, prop, receiver) {\n\t\t\tif (prop in flavors) {\n\t\t\t\treturn Reflect.get(flavors, prop, receiver)\n\t\t\t}\n\t\t\treturn (target as any)[prop]\n\t\t},\n\t}) as T & F\n}\n\n/**\n * Creates a new flavored function that transforms arguments before calling the base.\n *\n * @param fn - The base flavored function\n * @param transform - Function that receives the original arguments and returns transformed arguments\n * @returns A new flavored function with the transformation applied\n *\n * @example\n * ```typescript\n * const loudGreet = createFlavor(greet, (name, opts) => [name, { ...opts, loud: true }])\n * ```\n */\nexport function createFlavor<T extends (...args: any[]) => any>(\n\tfn: T,\n\ttransform: (...args: Parameters<T>) => Parameters<T>,\n\tname?: string\n): T {\n\tconst fct = function flavorWrapper(this: any, ...args: Parameters<T>) {\n\t\treturn fn.apply(this, transform(...args))\n\t}\n\tif (name) named(name, fct)\n\n\treturn flavored(inheritCaption(fn, fct as T), (fn as any).flavors || {})\n}\n\n/**\n * Creates a new flavored function that merges options objects at a specific index.\n * By default, uses the function's arity (length) as the index for options.\n *\n * @param fn - The base flavored function\n * @param defaultOptions - Options to merge\n * @param optionsIndex - Optional explicit index for options (defaults to fn.length)\n * @param name - Optional name for the wrapper\n * @returns A new flavored function\n */\nexport function flavorOptions<T extends (...args: any[]) => any>(\n\tfn: T,\n\tdefaultOptions: Record<string, any>,\n\topts: {\n\t\toptionsIndex?: number\n\t\tname?: string\n\t} = {}\n): T {\n\t// If the function is already flavorOptions-wrapped, it might have an index stored\n\tconst targetIndex = opts.optionsIndex ?? (fn as any).optionsIndex ?? fn.length\n\n\tconst fct = function flavorOptionsWrapper(this: any, ...args: any[]) {\n\t\tconst newArgs = [...args]\n\n\t\t// Ensure we have enough arguments to reach the options index\n\t\twhile (newArgs.length <= targetIndex) {\n\t\t\tnewArgs.push(undefined)\n\t\t}\n\n\t\tconst currentOptions = newArgs[targetIndex]\n\t\tconst isObject =\n\t\t\tcurrentOptions !== null &&\n\t\t\ttypeof currentOptions === 'object' &&\n\t\t\t!Array.isArray(currentOptions)\n\n\t\tnewArgs[targetIndex] = isObject ? { ...defaultOptions, ...currentOptions } : defaultOptions\n\n\t\treturn fn.apply(this, newArgs)\n\t}\n\n\tif (opts.name) named(`${fn.name}.${opts.name}`, fct)\n\n\t// Preserve arity and options track\n\tObject.defineProperty(fct, 'length', { value: fn.length })\n\t;(fct as any).optionsIndex = targetIndex\n\n\treturn flavored(inheritCaption(fn, fct as T), (fn as any).flavors || {})\n}\n","/**\n * Symbol for defining custom getter logic for numeric index access\n */\nexport const getAt = Symbol('getAt')\n/**\n * Symbol for defining custom setter logic for numeric index access\n */\nexport const setAt = Symbol('setAt')\n\ninterface IndexingAt<Items = any> {\n\t[getAt](index: number): Items\n}\n\ninterface Accessor<T, Items> {\n\tget(this: T, index: number): Items\n\tset?(this: T, index: number, value: Items): void\n\tgetLength?(this: T): number\n\tsetLength?(this: T, value: number): void\n}\n\nabstract class AbstractGetAt<Items = any> {\n\tabstract [getAt](index: number): Items\n}\n\n/**\n * Creates an indexable class with a base class and accessor object\n * @param base - The base class to extend\n * @param accessor - Object containing get/set methods for numeric index access\n * @returns A class that supports numeric index access\n */\nexport function Indexable<Items, Base extends abstract new (...args: any[]) => any>(\n\tbase: Base,\n\taccessor: Accessor<InstanceType<Base>, Items>\n): new (\n\t...args: ConstructorParameters<Base>\n) => InstanceType<Base> & { [x: number]: Items }\n\n/**\n * Creates an indexable class with only an accessor object (no base class)\n * @param accessor - Object containing get/set methods for numeric index access\n * @returns A class that supports numeric index access\n */\nexport function Indexable<Items>(accessor: Accessor<any, Items>): new () => { [x: number]: Items }\n\n/**\n * Creates an indexable class with a base class that has [getAt] method\n * @param base - The base class that implements [getAt] method\n * @returns A class that supports numeric index access using the base class's [getAt] method\n */\nexport function Indexable<Base extends new (...args: any[]) => IndexingAt>(\n\tbase: Base\n): new (\n\t...args: ConstructorParameters<Base>\n) => InstanceType<Base> & { [x: number]: AtReturnType<InstanceType<Base>> }\n\n/**\n * Creates an abstract indexable base class\n * @returns An abstract class that supports numeric index access\n */\nexport function Indexable<Items>(): abstract new (\n\t...args: any[]\n) => AbstractGetAt & { [x: number]: Items }\n\nexport function Indexable<Items, Base extends abstract new (...args: any[]) => any>(\n\tbase?: Base | Accessor<Base, Items>,\n\taccessor?: Accessor<Base, Items>\n) {\n\tif (base && typeof base !== 'function') {\n\t\taccessor = base as Accessor<Base, Items>\n\t\tbase = undefined\n\t}\n\tif (!base) {\n\t\t//@ts-expect-error\n\t\tbase = class {} as Base\n\t}\n\tif (!accessor) {\n\t\taccessor = {\n\t\t\tget(this: any, index: number) {\n\t\t\t\tif (typeof this[getAt] !== 'function') {\n\t\t\t\t\tthrow new Error('Indexable class must have an [getAt] method')\n\t\t\t\t}\n\t\t\t\treturn this[getAt](index)\n\t\t\t},\n\t\t\tset(this: any, index: number, value: Items) {\n\t\t\t\tif (typeof this[setAt] !== 'function') {\n\t\t\t\t\tthrow new Error('Indexable class has read-only numeric index access')\n\t\t\t\t}\n\t\t\t\tthis[setAt](index, value)\n\t\t\t},\n\t\t}\n\t}\n\n\tabstract class Indexable extends (base as Base) {\n\t\t[x: number]: Items\n\t}\n\n\tObject.setPrototypeOf(\n\t\tIndexable.prototype,\n\t\tnew Proxy((base as Base).prototype, {\n\t\t\t//@ts-expect-error\n\t\t\t[Symbol.toStringTag]: 'MutTs Indexable',\n\t\t\tget(target, prop, receiver) {\n\t\t\t\tif (prop in target) {\n\t\t\t\t\tconst getter = Object.getOwnPropertyDescriptor(target, prop)?.get\n\t\t\t\t\treturn getter ? getter.call(receiver) : target[prop]\n\t\t\t\t}\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.getLength) return accessor.getLength.call(receiver)\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) {\n\t\t\t\t\t\treturn accessor.get!.call(receiver, numProp) as Items\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn undefined\n\t\t\t},\n\t\t\tset(target, prop, value, receiver) {\n\t\t\t\tif (prop in target) {\n\t\t\t\t\tconst setter = Object.getOwnPropertyDescriptor(target, prop)?.set\n\t\t\t\t\tif (setter) setter.call(receiver, value)\n\t\t\t\t\telse target[prop] = value\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.setLength) {\n\t\t\t\t\t\taccessor.setLength.call(receiver, value)\n\t\t\t\t\t\treturn true\n\t\t\t\t\t}\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) {\n\t\t\t\t\t\tif (!accessor.set) throw new Error('Indexable class has read-only numeric index access')\n\t\t\t\t\t\taccessor.set!.call(receiver, numProp, value)\n\t\t\t\t\t\treturn true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tObject.defineProperty(receiver, prop, {\n\t\t\t\t\tvalue,\n\t\t\t\t\twritable: true,\n\t\t\t\t\tenumerable: true,\n\t\t\t\t\tconfigurable: true,\n\t\t\t\t})\n\t\t\t\treturn true\n\t\t\t},\n\t\t\thas(target, prop) {\n\t\t\t\tif (prop in target) return true\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.getLength) return true\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) return true\n\t\t\t\t}\n\t\t\t\treturn false\n\t\t\t},\n\t\t\townKeys(target) {\n\t\t\t\tconst keys = Reflect.ownKeys(target)\n\t\t\t\tif (accessor.getLength) {\n\t\t\t\t\tkeys.push('length')\n\t\t\t\t\tconst len = accessor.getLength.call(this as any)\n\t\t\t\t\tfor (let i = 0; i < len; i++) keys.push(String(i))\n\t\t\t\t}\n\t\t\t\treturn keys\n\t\t\t},\n\t\t\tgetOwnPropertyDescriptor(target, prop) {\n\t\t\t\tif (prop in target) return Object.getOwnPropertyDescriptor(target, prop)\n\t\t\t\tif (typeof prop === 'string') {\n\t\t\t\t\tif (prop === 'length' && accessor.getLength) {\n\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\tenumerable: false,\n\t\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\t\tget: () => accessor.getLength!.call(this as any),\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tconst numProp = Number(prop)\n\t\t\t\t\tif (!Number.isNaN(numProp)) {\n\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\tenumerable: true,\n\t\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\t\tget: () => accessor.get!.call(this as any, numProp),\n\t\t\t\t\t\t\tset: accessor.set\n\t\t\t\t\t\t\t\t? (v: any) => accessor.set!.call(this as any, numProp, v)\n\t\t\t\t\t\t\t\t: undefined,\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn undefined\n\t\t\t},\n\t\t})\n\t)\n\treturn Indexable\n}\n\ntype AtReturnType<T> = T extends { [getAt](index: number): infer R } ? R : never\n\n/**\n * Symbol for accessing the forwarded array in ArrayReadForward\n */\nexport const forwardArray = Symbol('forwardArray')\n\n/**\n * A read-only array forwarder that implements all reading/iterating methods of Array\n * but does not implement modification methods.\n *\n * The constructor takes a callback that returns an array, and all methods forward\n * their behavior to the result of that callback.\n */\nexport class ArrayReadForward<T> {\n\tprotected get [forwardArray](): readonly T[] {\n\t\tthrow new Error('ArrayReadForward is not implemented')\n\t}\n\n\t/**\n\t * Get the length of the array\n\t */\n\tget length(): number {\n\t\treturn this[forwardArray].length\n\t}\n\n\t/**\n\t * Get an element at a specific index\n\t */\n\t[index: number]: T | undefined\n\n\t/**\n\t * Iterator protocol support\n\t */\n\t[Symbol.iterator](): Iterator<T> {\n\t\treturn this[forwardArray][Symbol.iterator]()\n\t}\n\n\t// Reading/Iterating methods\n\n\t/**\n\t * Creates a new array with the results of calling a provided function on every element\n\t */\n\tmap<U>(callbackfn: (value: T, index: number, array: readonly T[]) => U, thisArg?: any): U[] {\n\t\treturn this[forwardArray].map(callbackfn, thisArg)\n\t}\n\n\t/**\n\t * Creates a new array with all elements that pass the test implemented by the provided function\n\t */\n\tfilter<S extends T>(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => value is S,\n\t\tthisArg?: any\n\t): S[]\n\tfilter(predicate: (value: T, index: number, array: readonly T[]) => unknown, thisArg?: any): T[]\n\tfilter(predicate: (value: T, index: number, array: readonly T[]) => unknown, thisArg?: any): T[] {\n\t\treturn this[forwardArray].filter(predicate, thisArg)\n\t}\n\n\t/**\n\t * Executes a reducer function on each element of the array, resulting in a single output value\n\t */\n\treduce(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T\n\t): T\n\treduce(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T,\n\t\tinitialValue: T\n\t): T\n\treduce<U>(\n\t\tcallbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: readonly T[]) => U,\n\t\tinitialValue: U\n\t): U\n\treduce(\n\t\tcallbackfn: (\n\t\t\tpreviousValue: any,\n\t\t\tcurrentValue: T,\n\t\t\tcurrentIndex: number,\n\t\t\tarray: readonly T[]\n\t\t) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn initialValue !== undefined\n\t\t\t? this[forwardArray].reduce(callbackfn, initialValue)\n\t\t\t: this[forwardArray].reduce(callbackfn)\n\t}\n\n\t/**\n\t * Executes a reducer function on each element of the array (right-to-left), resulting in a single output value\n\t */\n\treduceRight(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T\n\t): T\n\treduceRight(\n\t\tcallbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: readonly T[]) => T,\n\t\tinitialValue: T\n\t): T\n\treduceRight<U>(\n\t\tcallbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: readonly T[]) => U,\n\t\tinitialValue: U\n\t): U\n\treduceRight(\n\t\tcallbackfn: (\n\t\t\tpreviousValue: any,\n\t\t\tcurrentValue: T,\n\t\t\tcurrentIndex: number,\n\t\t\tarray: readonly T[]\n\t\t) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn initialValue !== undefined\n\t\t\t? this[forwardArray].reduceRight(callbackfn, initialValue)\n\t\t\t: this[forwardArray].reduceRight(callbackfn)\n\t}\n\n\t/**\n\t * Executes a provided function once for each array element\n\t */\n\tforEach(callbackfn: (value: T, index: number, array: readonly T[]) => void, thisArg?: any): void {\n\t\tthis[forwardArray].forEach(callbackfn, thisArg)\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array that satisfies the provided testing function\n\t */\n\tfind<S extends T>(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfind(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined\n\tfind(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined {\n\t\treturn this[forwardArray].find(predicate, thisArg)\n\t}\n\n\t/**\n\t * Returns the index of the first element in the array that satisfies the provided testing function\n\t */\n\tfindIndex(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn this[forwardArray].findIndex(predicate, thisArg)\n\t}\n\n\t/**\n\t * Returns the value of the last element in the array that satisfies the provided testing function\n\t */\n\tfindLast<S extends T>(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfindLast(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined\n\tfindLast(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): T | undefined {\n\t\treturn this[forwardArray].findLast(predicate, thisArg)\n\t}\n\n\t/**\n\t * Returns the index of the last element in the array that satisfies the provided testing function\n\t */\n\tfindLastIndex(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn this[forwardArray].findLastIndex(predicate, thisArg)\n\t}\n\n\t/**\n\t * Determines whether an array includes a certain value among its entries\n\t */\n\tincludes(searchElement: T, fromIndex?: number): boolean {\n\t\treturn this[forwardArray].includes(searchElement, fromIndex)\n\t}\n\n\t/**\n\t * Returns the first index at which a given element can be found in the array\n\t */\n\tindexOf(searchElement: T, fromIndex?: number): number {\n\t\treturn this[forwardArray].indexOf(searchElement, fromIndex)\n\t}\n\n\t/**\n\t * Returns the last index at which a given element can be found in the array\n\t */\n\tlastIndexOf(searchElement: T, fromIndex?: number): number {\n\t\treturn this[forwardArray].lastIndexOf(searchElement, fromIndex)\n\t}\n\n\t/**\n\t * Returns a shallow copy of a portion of an array into a new array object\n\t */\n\tslice(start?: number, end?: number): T[] {\n\t\treturn this[forwardArray].slice(start, end)\n\t}\n\n\t/**\n\t * Returns a new array comprised of this array joined with other array(s) and/or value(s)\n\t */\n\tconcat(...items: ConcatArray<T>[]): T[]\n\tconcat(...items: (T | ConcatArray<T>)[]): T[]\n\tconcat(...items: (T | ConcatArray<T>)[]): T[] {\n\t\treturn this[forwardArray].concat(...items)\n\t}\n\n\t/**\n\t * Tests whether all elements in the array pass the test implemented by the provided function\n\t */\n\tevery(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): boolean {\n\t\treturn this[forwardArray].every(predicate, thisArg)\n\t}\n\n\t/**\n\t * Tests whether at least one element in the array passes the test implemented by the provided function\n\t */\n\tsome(\n\t\tpredicate: (value: T, index: number, array: readonly T[]) => unknown,\n\t\tthisArg?: any\n\t): boolean {\n\t\treturn this[forwardArray].some(predicate, thisArg)\n\t}\n\n\t/**\n\t * Joins all elements of an array into a string\n\t */\n\tjoin(separator?: string): string {\n\t\treturn this[forwardArray].join(separator)\n\t}\n\n\t/**\n\t * Returns a new array iterator that contains the keys for each index in the array\n\t */\n\tkeys(): IterableIterator<number> {\n\t\treturn this[forwardArray].keys()\n\t}\n\n\t/**\n\t * Returns a new array iterator that contains the values for each index in the array\n\t */\n\tvalues(): IterableIterator<T> {\n\t\treturn this[forwardArray].values()\n\t}\n\n\t/**\n\t * Returns a new array iterator that contains the key/value pairs for each index in the array\n\t */\n\tentries(): IterableIterator<[number, T]> {\n\t\treturn this[forwardArray].entries()\n\t}\n\n\t/**\n\t * Returns a string representation of the array\n\t */\n\ttoString(): string {\n\t\treturn this[forwardArray].toString()\n\t}\n\n\t/**\n\t * Returns a localized string representing the array\n\t */\n\ttoLocaleString(\n\t\tlocales?: string | string[],\n\t\toptions?: Intl.NumberFormatOptions | Intl.DateTimeFormatOptions\n\t): string {\n\t\treturn this[forwardArray].toLocaleString(locales as string | string[], options)\n\t}\n\n\t/**\n\t * Returns the element at the specified index, or undefined if the index is out of bounds\n\t */\n\tat(index: number): T | undefined {\n\t\treturn this[forwardArray].at(index)\n\t}\n\n\t/**\n\t * Returns a new array with all sub-array elements concatenated into it recursively up to the specified depth\n\t */\n\tflat(depth?: number): T[] {\n\t\treturn this[forwardArray].flat(depth) as T[]\n\t}\n\n\t/**\n\t * Returns a new array formed by applying a given callback function to each element of the array,\n\t * and then flattening the result by one level\n\t */\n\tflatMap<U, This = undefined>(\n\t\tcallback: (this: This, value: T, index: number, array: readonly T[]) => U | ReadonlyArray<U>,\n\t\tthisArg?: This\n\t): U[] {\n\t\treturn this[forwardArray].flatMap(callback as any, thisArg)\n\t}\n\n\t/**\n\t * Returns a new array with elements in reversed order (ES2023)\n\t */\n\ttoReversed(): T[] {\n\t\treturn this[forwardArray].toReversed?.() ?? [...this[forwardArray]].reverse()\n\t}\n\n\t/**\n\t * Returns a new array with elements sorted (ES2023)\n\t */\n\ttoSorted(compareFn?: ((a: T, b: T) => number) | undefined): T[] {\n\t\treturn this[forwardArray].toSorted?.(compareFn) ?? [...this[forwardArray]].sort(compareFn)\n\t}\n\n\t/**\n\t * Returns a new array with some elements removed and/or replaced at a given index (ES2023)\n\t */\n\ttoSpliced(start: number, deleteCount?: number, ...items: T[]): T[] {\n\t\tif (deleteCount === undefined) return this[forwardArray].toSpliced(start)\n\t\treturn this[forwardArray].toSpliced(start, deleteCount, ...items)\n\t}\n\n\t/**\n\t * Returns a new array with the element at the given index replaced with the given value (ES2023)\n\t */\n\twith(index: number, value: T): T[] {\n\t\treturn this[forwardArray].with(index, value)\n\t}\n\tget [Symbol.unscopables]() {\n\t\treturn this[forwardArray][Symbol.unscopables]\n\t}\n}\n","/// <reference lib=\"esnext.collection\" />\n\n/**\n * Uses weak references but still may iterate through them\n * Note: The behavior is highly dependant on the garbage collector - some entries are perhaps deemed to be collected: don't resuscitate them\n */\nexport class IterableWeakMap<K extends WeakKey, V> implements Map<K, V> {\n\tprivate uuids = new WeakMap<K, string>()\n\tprivate refs: Record<string, [WeakRef<K>, any]> = {}\n\tprivate readonly registry: FinalizationRegistry<string>\n\n\tconstructor(entries?: Iterable<[K, V]>) {\n\t\t// Create a FinalizationRegistry to clean up refs when keys are garbage collected\n\t\tthis.registry = new FinalizationRegistry((uuid: string) => {\n\t\t\tdelete this.refs[uuid]\n\t\t})\n\t\tif (entries) for (const [k, v] of entries) this.set(k, v)\n\t}\n\tprivate createIterator<I>(cb: (key: K, value: V) => I): MapIterator<I> {\n\t\tconst { refs } = this\n\t\treturn (function* () {\n\t\t\tfor (const uuid of Object.keys(refs)) {\n\t\t\t\tconst [keyRef, value] = refs[uuid]\n\t\t\t\tconst key = keyRef.deref()\n\t\t\t\tif (key) yield cb(key, value)\n\t\t\t\telse delete refs[uuid]\n\t\t\t}\n\t\t\treturn undefined\n\t\t})()\n\t}\n\tclear(): void {\n\t\t// Unregister all keys from the FinalizationRegistry\n\t\tfor (const uuid of Object.keys(this.refs)) {\n\t\t\tconst key = this.refs[uuid][0].deref()\n\t\t\tif (key) this.registry.unregister(key)\n\t\t}\n\t\tthis.uuids = new WeakMap<K, string>()\n\t\tthis.refs = {}\n\t}\n\tdelete(key: K): boolean {\n\t\tconst uuid = this.uuids.get(key)\n\t\tif (!uuid) return false\n\t\tdelete this.refs[uuid]\n\t\tthis.uuids.delete(key)\n\t\tthis.registry.unregister(key)\n\t\treturn true\n\t}\n\tforEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tfor (const [k, v] of this) callbackfn.call(thisArg ?? this, v, k, thisArg ?? this)\n\t}\n\tget(key: K): V | undefined {\n\t\tconst uuid = this.uuids.get(key)\n\t\tif (!uuid) return undefined\n\t\treturn this.refs[uuid][1]\n\t}\n\thas(key: K): boolean {\n\t\treturn this.uuids.has(key)\n\t}\n\tset(key: K, value: V): this {\n\t\tlet uuid = this.uuids.get(key)\n\t\tif (uuid) {\n\t\t\tthis.refs[uuid][1] = value\n\t\t} else {\n\t\t\tuuid = crypto.randomUUID()\n\t\t\tthis.uuids.set(key, uuid)\n\t\t\tthis.refs[uuid] = [new WeakRef(key), value]\n\t\t\t// Register key for cleanup when garbage collected\n\t\t\tthis.registry.register(key, uuid, key)\n\t\t}\n\t\treturn this\n\t}\n\tget size(): number {\n\t\treturn [...this].length\n\t}\n\tentries(): MapIterator<[K, V]> {\n\t\treturn this.createIterator((key, value) => [key, value] as [K, V])\n\t}\n\tkeys(): MapIterator<K> {\n\t\treturn this.createIterator((key, _value) => key)\n\t}\n\tvalues(): MapIterator<V> {\n\t\treturn this.createIterator((_key, value) => value)\n\t}\n\t[Symbol.iterator](): MapIterator<[K, V]> {\n\t\treturn this.entries()\n\t}\n\treadonly [Symbol.toStringTag]: string = 'IterableWeakMap'\n}\n\n/**\n * Uses weak references but still may iterate through them\n * Note: The behavior is highly dependant on the garbage collector - some entries are perhaps deemed to be collected: don't resuscitate them\n */\nexport class IterableWeakSet<K extends WeakKey> implements Set<K> {\n\tprivate uuids = new WeakMap<K, string>()\n\tprivate refs: Record<string, WeakRef<K>> = {}\n\tprivate readonly registry: FinalizationRegistry<string>\n\n\tconstructor(entries?: Iterable<K>) {\n\t\t// Create a FinalizationRegistry to clean up refs when values are garbage collected\n\t\tthis.registry = new FinalizationRegistry((uuid: string) => {\n\t\t\tdelete this.refs[uuid]\n\t\t})\n\t\tif (entries) for (const k of entries) this.add(k)\n\t}\n\tprivate createIterator<I>(cb: (key: K) => I): MapIterator<I> {\n\t\tconst { refs } = this\n\t\treturn (function* () {\n\t\t\tfor (const uuid of Object.keys(refs)) {\n\t\t\t\tconst key = refs[uuid].deref()\n\t\t\t\tif (key) yield cb(key)\n\t\t\t\telse delete refs[uuid]\n\t\t\t}\n\t\t\treturn undefined\n\t\t})()\n\t}\n\n\tclear(): void {\n\t\t// Unregister all values from the FinalizationRegistry\n\t\tfor (const uuid of Object.keys(this.refs)) {\n\t\t\tconst value = this.refs[uuid].deref()\n\t\t\tif (value) this.registry.unregister(value)\n\t\t}\n\t\tthis.uuids = new WeakMap<K, string>()\n\t\tthis.refs = {}\n\t}\n\n\tadd(value: K): this {\n\t\tlet uuid = this.uuids.get(value)\n\t\tif (!uuid) {\n\t\t\tuuid = crypto.randomUUID()\n\t\t\tthis.uuids.set(value, uuid)\n\t\t\tthis.refs[uuid] = new WeakRef(value)\n\t\t\t// Register value for cleanup when garbage collected\n\t\t\tthis.registry.register(value, uuid, value)\n\t\t}\n\t\treturn this\n\t}\n\tdelete(value: K): boolean {\n\t\tconst uuid = this.uuids.get(value)\n\t\tif (!uuid) return false\n\t\tdelete this.refs[uuid]\n\t\tthis.uuids.delete(value)\n\t\tthis.registry.unregister(value)\n\t\treturn true\n\t}\n\n\tforEach(callbackfn: (value: K, value2: K, set: Set<K>) => void, thisArg?: any): void {\n\t\tfor (const value of this) callbackfn.call(thisArg ?? this, value, value, thisArg ?? this)\n\t}\n\n\thas(value: K): boolean {\n\t\treturn this.uuids.has(value)\n\t}\n\tget size(): number {\n\t\treturn [...this].length\n\t}\n\tentries(): SetIterator<[K, K]> {\n\t\treturn this.createIterator((key) => [key, key] as [K, K])\n\t}\n\tkeys(): SetIterator<K> {\n\t\treturn this.createIterator((key) => key)\n\t}\n\tvalues(): SetIterator<K> {\n\t\treturn this.createIterator((key) => key)\n\t}\n\t[Symbol.iterator](): SetIterator<K> {\n\t\treturn this.keys()\n\t}\n\treadonly [Symbol.toStringTag]: string = 'IterableWeakSet'\n\n\tunion<U>(other: ReadonlySetLike<U>): Set<K | U> {\n\t\tconst others = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn other.keys()\n\t\t\t},\n\t\t}\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tyield* that\n\t\t\t\tfor (const value of others) if (!that.has(<K>(<unknown>value))) yield value\n\t\t\t})()\n\t\t)\n\t}\n\tintersection<U /**/>(other: ReadonlySetLike<U>): Set<K & U> {\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tfor (const value of that) if (other.has(<U>(<unknown>value))) yield <K & U>value\n\t\t\t})()\n\t\t)\n\t}\n\tdifference<U>(other: ReadonlySetLike<U>): Set<K> {\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tfor (const value of that) if (!other.has(<U>(<unknown>value))) yield <K>value\n\t\t\t})()\n\t\t)\n\t}\n\tsymmetricDifference<U>(other: ReadonlySetLike<U>): Set<K | U> {\n\t\tconst others = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn other.keys()\n\t\t\t},\n\t\t}\n\t\tconst that = this\n\t\treturn new Set(\n\t\t\t(function* () {\n\t\t\t\tfor (const value of that) if (!other.has(<U>(<unknown>value))) yield <K | U>value\n\t\t\t\tfor (const value of others) if (!that.has(<K>(<unknown>value))) yield <K | U>value\n\t\t\t})()\n\t\t)\n\t}\n\tisSubsetOf(other: ReadonlySetLike<unknown>): boolean {\n\t\tfor (const value of this) if (!other.has(value)) return false\n\t\treturn true\n\t}\n\tisSupersetOf(other: ReadonlySetLike<unknown>): boolean {\n\t\tconst others = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn other.keys()\n\t\t\t},\n\t\t}\n\t\tfor (const value of others) if (!this.has(<K>value)) return false\n\t\treturn true\n\t}\n\tisDisjointFrom(other: ReadonlySetLike<unknown>): boolean {\n\t\tfor (const value of this) if (other.has(value)) return false\n\t\treturn true\n\t}\n}\n","import { FoolProof, isConstructor } from './utils'\n\n/**\n * A mixin function that takes a base class and returns a new class with mixed-in functionality\n * @template Mixed - The functionality to be mixed in\n */\nexport type MixinFunction<Mixed> = <Base>(\n\tbase: new (...args: any[]) => Base\n) => new (\n\t...args: any[]\n) => Base & Mixed\n\n/**\n * A mixin class that can be used both as a base class and as a mixin function\n * @template Mixed - The functionality to be mixed in\n */\nexport type MixinClass<Mixed> = new (...args: any[]) => Mixed\n\n/**\n * Creates a mixin that can be used both as a class (extends) and as a function (mixin)\n *\n * This function supports:\n * - Using mixins as base classes: `class MyClass extends MyMixin`\n * - Using mixins as functions: `class MyClass extends MyMixin(SomeBase)`\n * - Composing mixins: `const Composed = MixinA(MixinB)`\n * - Type-safe property inference for all patterns\n *\n * @param mixinFunction - The function that creates the mixin\n * @param unwrapFunction - Optional function to unwrap reactive objects for method calls\n * @returns A mixin that can be used both as a class and as a function\n */\nexport function mixin<MixinFn extends (base: any) => new (...args: any[]) => any>(\n\tmixinFunction: MixinFn,\n\tunwrapFunction?: (obj: any) => any\n): (new (\n\t...args: any[]\n) => InstanceType<ReturnType<MixinFn>>) &\n\t(<Base>(\n\t\tbase: abstract new (...args: any[]) => Base\n\t) => new (\n\t\t...args: any[]\n\t) => InstanceType<ReturnType<MixinFn>> & Base) {\n\t/**\n\t * Cache for mixin results to ensure the same base class always returns the same mixed class\n\t */\n\tconst mixinCache = new WeakMap<new (...args: any[]) => any, new (...args: any[]) => any>()\n\n\t// Apply the mixin to Object as the base class\n\tconst MixedBase = mixinFunction(Object)\n\tmixinCache.set(Object, MixedBase)\n\n\t// Create the proxy that handles both constructor and function calls\n\treturn new Proxy(MixedBase, {\n\t\t// Handle `MixinClass(SomeBase)` - use as mixin function\n\t\tapply(_target, _thisArg, args) {\n\t\t\tif (args.length === 0) {\n\t\t\t\tthrow new Error('Mixin requires a base class')\n\t\t\t}\n\n\t\t\tconst baseClass = args[0]\n\t\t\tif (typeof baseClass !== 'function') {\n\t\t\t\tthrow new Error('Mixin requires a constructor function')\n\t\t\t}\n\n\t\t\t// Check if it's a valid constructor or a mixin\n\t\t\tif (\n\t\t\t\t!isConstructor(baseClass) &&\n\t\t\t\t!(baseClass && typeof baseClass === 'function' && baseClass.prototype)\n\t\t\t) {\n\t\t\t\tthrow new Error('Mixin requires a valid constructor')\n\t\t\t}\n\n\t\t\t// Check cache first\n\t\t\tconst cached = mixinCache.get(baseClass)\n\t\t\tif (cached) {\n\t\t\t\treturn cached\n\t\t\t}\n\n\t\t\tlet usedBase = baseClass\n\t\t\tif (unwrapFunction) {\n\t\t\t\t// Create a proxied base class that handles method unwrapping\n\t\t\t\tconst ProxiedBaseClass = class extends baseClass {}\n\n\t\t\t\t// Proxy the prototype methods to handle unwrapping\n\t\t\t\tconst originalPrototype = baseClass.prototype\n\t\t\t\tconst proxiedPrototype = new Proxy(originalPrototype, {\n\t\t\t\t\tget(target, prop, receiver) {\n\t\t\t\t\t\tconst value = FoolProof.get(target, prop, receiver)\n\n\t\t\t\t\t\t// Only wrap methods that are likely to access private fields\n\t\t\t\t\t\t// Skip symbols and special properties that the reactive system needs\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\ttypeof value === 'function' &&\n\t\t\t\t\t\t\ttypeof prop === 'string' &&\n\t\t\t\t\t\t\t!['constructor', 'toString', 'valueOf'].includes(prop)\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t// Return a wrapped version that uses unwrapped context\n\t\t\t\t\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\t\t\t\t\t// Use the unwrapping function if provided, otherwise use this\n\t\t\t\t\t\t\t\tconst context = unwrapFunction(this as any)\n\t\t\t\t\t\t\t\treturn value.apply(context, args)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn value\n\t\t\t\t\t},\n\t\t\t\t})\n\n\t\t\t\t// Set the proxied prototype\n\t\t\t\tObject.setPrototypeOf(ProxiedBaseClass.prototype, proxiedPrototype)\n\t\t\t\tusedBase = ProxiedBaseClass\n\t\t\t}\n\n\t\t\t// Create the mixed class using the proxied base class\n\t\t\tconst mixedClass = mixinFunction(usedBase)\n\n\t\t\t// Cache the result\n\t\t\tmixinCache.set(baseClass, mixedClass)\n\n\t\t\treturn mixedClass\n\t\t},\n\t}) as MixinFn & (new (...args: any[]) => InstanceType<ReturnType<MixinFn>>)\n}\n","type Resolved<T> =\n\tT extends Promise<infer U>\n\t\t? Resolved<U>\n\t\t: T extends (...args: infer Args) => infer R\n\t\t\t? (...args: Args) => Resolved<R>\n\t\t\t: T extends object\n\t\t\t\t? {\n\t\t\t\t\t\t[k in keyof T]: k extends 'then' | 'catch' | 'finally' ? T[k] : Resolved<T[k]>\n\t\t\t\t\t}\n\t\t\t\t: T\ntype PromiseAnd<T> = Resolved<T> & Promise<Resolved<T>>\n/**\n * Type that transforms promises into chainable objects\n * Allows calling methods directly on promise results without awaiting them first\n */\nexport type PromiseChain<T> = T extends (...args: infer Args) => infer R\n\t? PromiseAnd<(...args: Args) => PromiseChain<Resolved<R>>>\n\t: T extends object\n\t\t? PromiseAnd<{\n\t\t\t\t[k in keyof T]: k extends 'then' | 'catch' | 'finally' ? T[k] : PromiseChain<Resolved<T[k]>>\n\t\t\t}>\n\t\t: Promise<Resolved<T>>\n\nconst forward =\n\t(name: string, target: any) =>\n\t(...args: any[]) => {\n\t\treturn target[name](...args)\n\t}\n\nconst alreadyChained = new WeakMap<any, PromiseChain<any>>()\nconst originals = new WeakMap<Promise<any>, any>()\n\nfunction cache(target: any, rv: PromiseChain<any>) {\n\toriginals.set(rv, target)\n\talreadyChained.set(target, rv)\n}\n\ntype ChainedFunction<T> = ((...args: any[]) => PromiseChain<T>) & {\n\tthen: Promise<T>['then']\n\tcatch: Promise<T>['catch']\n\tfinally: Promise<T>['finally']\n}\n\nconst promiseProxyHandler: ProxyHandler<ChainedFunction<any>> = {\n\t//@ts-expect-error\n\t[Symbol.toStringTag]: 'MutTs PromiseChain function',\n\tget(target, prop) {\n\t\tif (prop === Symbol.toStringTag) return 'PromiseProxy'\n\t\tif (typeof prop === 'string' && ['then', 'catch', 'finally'].includes(prop))\n\t\t\treturn target[prop as keyof typeof target]\n\t\treturn chainPromise(target.then((r) => r[prop as keyof typeof r]))\n\t},\n}\nconst promiseForward = (target: any) => ({\n\t// biome-ignore lint/suspicious/noThenProperty: This one is the whole point\n\tthen: forward('then', target),\n\tcatch: forward('catch', target),\n\tfinally: forward('finally', target),\n})\nconst objectProxyHandler: ProxyHandler<any> = {\n\t//@ts-expect-error\n\t[Symbol.toStringTag]: 'MutTs PromiseChain object',\n\tget(target, prop, receiver) {\n\t\tconst getter = Object.getOwnPropertyDescriptor(target, prop)?.get\n\t\tconst rv = getter ? getter.call(receiver) : target[prop]\n\t\t// Allows fct.call or fct.apply to bypass the chain system\n\t\tif (typeof target === 'function') return rv\n\t\treturn chainPromise(rv)\n\t},\n\tapply(target, thisArg, args) {\n\t\treturn chainPromise(target.apply(thisArg, args))\n\t},\n}\nfunction chainObject<T extends object | Function>(given: T): PromiseChain<T> {\n\tconst rv = new Proxy(given, objectProxyHandler) as PromiseChain<T>\n\tcache(given, rv)\n\treturn rv\n}\n\nfunction chainable(x: any): x is object | Function {\n\treturn x && ['function', 'object'].includes(typeof x)\n}\n/**\n * Transforms a promise or value into a chainable object\n * Allows calling methods directly on promise results without awaiting them first\n * @param given - The promise or value to make chainable\n * @returns A chainable version of the input\n */\nexport function chainPromise<T>(given: Promise<T> | T): PromiseChain<T> {\n\tif (!chainable(given)) return given as PromiseChain<T>\n\tif (alreadyChained.has(given)) return alreadyChained.get(given) as PromiseChain<T>\n\tif (!(given instanceof Promise)) return chainObject(given)\n\t// @ts-expect-error It's ok as we check if it's an object above\n\tgiven = given.then((r) => (chainable(r) ? chainObject(r) : r))\n\tconst target = Object.assign(function (this: any, ...args: any[]) {\n\t\treturn chainPromise(\n\t\t\tgiven.then((r) => {\n\t\t\t\treturn this?.then\n\t\t\t\t\t? this.then((t: any) => (r as any).apply(t, args))\n\t\t\t\t\t: (r as any).apply(this, args)\n\t\t\t})\n\t\t)\n\t}, promiseForward(given)) as ChainedFunction<T>\n\tconst chained = new Proxy(\n\t\ttarget,\n\t\tpromiseProxyHandler as ProxyHandler<ChainedFunction<T>>\n\t) as PromiseChain<T>\n\tcache(given, chained as PromiseChain<any>)\n\treturn chained\n}\n","import type { EffectTrigger, Evolution } from './types'\n\nexport interface DebugHooks {\n\tisDevtoolsEnabled: () => boolean\n\tregisterEffect: (effect: EffectTrigger) => void\n\tgetTriggerChain: (effect: EffectTrigger) => string[]\n\tcaptureStack: (error?: unknown) => unknown\n\tcaptureLineage: (effect?: EffectTrigger, stack?: unknown) => unknown\n\tformatStack: (stack: unknown) => unknown[]\n\trecordTriggerLink: (\n\t\tsource: EffectTrigger | undefined,\n\t\ttarget: EffectTrigger,\n\t\tobj: object,\n\t\tprop: any,\n\t\tevolution: Evolution\n\t) => void\n\tdecorateError: (error: unknown, trigger: EffectTrigger) => void\n}\n\nexport const debugHooks: DebugHooks = {\n\tisDevtoolsEnabled: () => false,\n\tregisterEffect: () => {},\n\tgetTriggerChain: () => [],\n\tcaptureStack: () => [],\n\tcaptureLineage: () => new Error().stack,\n\tformatStack: (stack: unknown) => [stack],\n\trecordTriggerLink: () => {},\n\tdecorateError: () => {},\n}\n\nexport function setDebugHooks(hooks: Partial<DebugHooks>) {\n\tObject.assign(debugHooks, hooks)\n}\n","import { asyncHooks } from './async'\nimport { named, tag } from './utils'\n\ninterface InternalZoneUse<T> {\n\tenter(value?: T): unknown\n\tleave(entered: unknown): void\n}\nfunction isu<T>(z: AZone<T> | InternalZoneUse<T>): InternalZoneUse<T> {\n\treturn z as InternalZoneUse<T>\n}\nexport abstract class AZone<T> {\n\tabstract active?: T\n\tprotected enter(value?: T): unknown {\n\t\tconst prev = this.active\n\t\tthis.active = value\n\t\treturn prev\n\t}\n\tprotected leave(entered: unknown): void {\n\t\tthis.active = entered as T | undefined\n\t}\n\twith<R>(value: T | undefined, fn: () => R): R {\n\t\tconst entered = this.enter(value)\n\t\tlet res: R\n\t\ttry {\n\t\t\tres = fn()\n\t\t} finally {\n\t\t\tthis.leave(entered)\n\t\t}\n\t\t// [HACK]: Sanitization\n\t\t// See BROWSER_ASYNC_POLYFILL.md\n\t\treturn asyncHooks.sanitizePromise(res) as R\n\t}\n\troot<R>(fn: () => R): R {\n\t\tconst prev = this.enter()\n\t\ttry {\n\t\t\treturn fn()\n\t\t} finally {\n\t\t\tthis.leave(prev)\n\t\t}\n\t}\n\tget zoned(): GetterWrapper {\n\t\tconst active = this.active\n\t\treturn named(`${this}@${active}`, (fn) => this.with(active, fn))\n\t}\n}\n\nexport type GetterWrapper = <R>(fn: () => R) => R\n\nexport class Zone<T> extends AZone<T> {\n\tactive: T | undefined\n}\n\nexport type HistoryValue<T> = { present: T | undefined; history: Set<T> }\nexport class ZoneHistory<T> extends AZone<HistoryValue<T>> {\n\tprivate history = new Set<T>()\n\tpublic readonly present: AZone<T>\n\tpublic has(value: T): boolean {\n\t\treturn this.history.has(value)\n\t}\n\tpublic some(predicate: (value: T) => boolean): boolean {\n\t\tfor (const value of this.history) if (predicate(value)) return true\n\t\treturn false\n\t}\n\tconstructor(private controlled: AZone<T> = new Zone<T>()) {\n\t\tsuper()\n\t\tconst self = this\n\t\tthis.present = Object.create(\n\t\t\tcontrolled,\n\t\t\tObject.getOwnPropertyDescriptors({\n\t\t\t\tget active() {\n\t\t\t\t\treturn controlled.active\n\t\t\t\t},\n\t\t\t\tset active(value: T | undefined) {\n\t\t\t\t\tcontrolled.active = value\n\t\t\t\t},\n\t\t\t\tenter(value?: T) {\n\t\t\t\t\tif (value && self.history.has(value))\n\t\t\t\t\t\tthrow new Error('ZoneHistory: re-entering historical zone')\n\t\t\t\t\tif (value !== undefined) self.history.add(value)\n\t\t\t\t\treturn { added: value, entered: isu(controlled).enter(value) }\n\t\t\t\t},\n\t\t\t\tleave(entered: { added: T | undefined; entered: unknown }) {\n\t\t\t\t\tif (entered.added !== undefined) self.history.delete(entered.added)\n\t\t\t\t\treturn isu(controlled).leave(entered.entered)\n\t\t\t\t},\n\t\t\t})\n\t\t)\n\t}\n\tget active() {\n\t\treturn { present: this.controlled.active, history: new Set(this.history) }\n\t}\n\tset active(value: HistoryValue<T> | undefined) {\n\t\tthis.history = value?.history ? new Set(value.history) : new Set()\n\t\tthis.controlled.active = value?.present\n\t}\n}\n\nexport class ZoneAggregator extends AZone<Map<AZone<unknown>, unknown>> {\n\t#zones = new Set<AZone<unknown>>()\n\tconstructor(...zones: AZone<unknown>[]) {\n\t\tsuper()\n\t\tfor (const z of zones) this.#zones.add(z)\n\t}\n\tget active(): Map<AZone<unknown>, unknown> | undefined {\n\t\tconst rv = new Map<AZone<unknown>, unknown>()\n\t\tfor (const z of this.#zones) if (z.active !== undefined) rv.set(z, z.active)\n\t\treturn rv\n\t}\n\tset active(value: Map<AZone<unknown>, unknown> | undefined) {\n\t\tfor (const z of this.#zones) z.active = value?.get(z)\n\t}\n\tenter(value?: Map<AZone<unknown>, unknown> | undefined) {\n\t\tconst entered = new Map<AZone<unknown>, unknown>()\n\t\tfor (const z of this.#zones) {\n\t\t\tconst v = value?.get(z)\n\t\t\tentered.set(z, isu(z).enter(v))\n\t\t}\n\t\treturn entered\n\t}\n\tleave(entered: Map<AZone<unknown>, unknown>): void {\n\t\tfor (const z of this.#zones) isu(z).leave(entered.get(z))\n\t}\n\tadd(z: AZone<unknown>) {\n\t\tthis.#zones.add(z)\n\t}\n\tdelete(z: AZone<unknown>) {\n\t\tthis.#zones.delete(z)\n\t}\n\tclear() {\n\t\tthis.#zones.clear()\n\t}\n}\n\n/**\n * Aggregator of zones that should be preserved across async boundaries.\n * If you add a zone here, it will be preserved across async boundaries.\n *\n * @example\n * ```ts\n * import { Zone, asyncZone } from 'mutts'\n * const userZone = new Zone<User>()\n * asyncZone.add(userZone)\n * ```\n */\nexport const asyncZone = tag('async', new ZoneAggregator())\nasyncHooks.addHook(() => {\n\t// capture state before async boundary\n\tconst zone = asyncZone.active\n\treturn () => {\n\t\t// restore state after async boundary, temporarily\n\t\tconst prev = asyncZone.active\n\t\tasyncZone.active = zone\n\t\treturn () => {\n\t\t\t// restore previous state from before our restore\n\t\t\tasyncZone.active = prev\n\t\t}\n\t}\n})\n","import type { EffectNode, EffectTrigger } from './types'\n\n// Symbol for storing root function on the function itself\nexport const rootFunctionSymbol = Symbol('root-function')\n\nexport type RootMarkedFunction = Function & {\n\t[rootFunctionSymbol]?: Function\n}\n\n// Track which effects are watching which reactive objects for cleanup\nexport let effectToReactiveObjects = new WeakMap<EffectTrigger, Set<object>>()\n\n// Track effects per reactive object and property\nexport let watchers = new WeakMap<object, Map<any, Set<EffectTrigger>>>()\n\n// Track effect metadata and relationships\nexport let effectNodes = new WeakMap<EffectTrigger, EffectNode>()\n\nexport function getEffectNode(effect: EffectTrigger): EffectNode {\n\tlet node = effectNodes.get(effect)\n\tif (!node) {\n\t\tnode = {}\n\t\teffectNodes.set(effect, node)\n\t}\n\treturn node\n}\n\n// Track reverse mapping to ensure unicity: One Root -> One Function\nlet reverseRoots = new WeakMap<any, WeakRef<Function>>()\n\nexport function resetRegistry() {\n\teffectToReactiveObjects = new WeakMap()\n\twatchers = new WeakMap()\n\teffectNodes = new WeakMap()\n\treverseRoots = new WeakMap()\n}\n\n/**\n * Marks a function with its root function for effect tracking\n * Enforces strict unicity: A root function can only identify ONE function.\n * @param fn - The function to mark\n * @param root - The root function\n * @returns The marked function\n */\nexport function markWithRoot<T extends Function>(fn: T, root: any): T {\n\tconst marked = fn as T & RootMarkedFunction\n\t// Check for collision\n\tconst existingRef = reverseRoots.get(root)\n\tconst existing = existingRef?.deref()\n\n\tif (existing && existing !== fn) {\n\t\tconst rootName = root.name || 'anonymous'\n\t\tconst existingName = existing.name || 'anonymous'\n\t\tconst fnName = fn.name || 'anonymous'\n\t\tthrow new Error(\n\t\t\t`[reactive] Abusive Shared Root detected: Root '${rootName}' is already identifying function '${existingName}'. ` +\n\t\t\t\t`Cannot reuse it for '${fnName}'. Shared roots cause lost updates and broken identity logic.`\n\t\t)\n\t}\n\n\t// Always update the map so subsequent checks find this one\n\t// (Last writer wins for the check)\n\treverseRoots.set(root, new WeakRef(fn))\n\n\t// Store root mapping as symbol property on the function\n\tmarked[rootFunctionSymbol] = getRoot(root)\n\treturn marked\n}\n\n/**\n * Gets the root function of a function for effect tracking\n * @param fn - The function to get the root of\n * @returns The root function\n */\nexport function getRoot<T extends Function | undefined>(fn: T): T {\n\twhile (fn) {\n\t\tconst r = (fn as RootMarkedFunction)[rootFunctionSymbol]\n\t\tif (!r) break\n\t\tfn = r as T\n\t}\n\treturn fn\n}\n","import { tag } from '../utils'\nimport { asyncZone, Zone, ZoneAggregator, ZoneHistory } from '../zone'\nimport { getRoot } from './registry'\nimport type { CleanupReason, EffectTrigger, ScopedCallback } from './types'\n\nexport const effectHistory = tag('effectHistory', new ZoneHistory<EffectTrigger>())\ntag('effectHistory.present', effectHistory.present)\nasyncZone.add(effectHistory)\nexport const externalReason = tag('externalReason', new Zone<CleanupReason>())\nasyncZone.add(externalReason)\n\n/**\n * Aggregator for zones that need to be tracked along effects.\n * ie. in each effect, the active zone of the given zoning will be the one active at effect's definition\n */\nexport const effectAggregator = tag('effectAggregator', new ZoneAggregator(effectHistory.present))\neffectAggregator.add(externalReason)\n\nexport function chainExternalReason(reason?: CleanupReason): CleanupReason | undefined {\n\tconst external = externalReason.active\n\tif (!external) return reason\n\tif (!reason) return external\n\tlet current: CleanupReason | undefined = reason\n\twhile (current) {\n\t\tif (\n\t\t\tcurrent.type === 'external' &&\n\t\t\texternal.type === 'external' &&\n\t\t\tcurrent.detail === external.detail\n\t\t)\n\t\t\treturn reason\n\t\tcurrent = current.chain\n\t}\n\treturn { ...reason, chain: chainExternalReason(reason.chain) }\n}\n\nexport function isRunning(effect: EffectTrigger): boolean {\n\tconst root = getRoot(effect)\n\treturn effectHistory.some((e) => getRoot(e) === root)\n}\n\nexport function getActiveEffect() {\n\treturn effectHistory.present.active\n}\n\n/**\n * Opaque token representing a captured effect context.\n * Obtained via `effectContext()`, consumed by `withEffectContext()`.\n */\nexport type EffectContext = { readonly __brand: unique symbol }\n\n/**\n * Captures the current effect context so that deferred code can later\n * create child effects parented to this point in the effect tree.\n *\n * @returns An opaque token to pass to `withEffectContext()`\n *\n * @example\n * ```ts\n * const ctx = effectContext() // inside an effect or root()\n * // later, in a deferred callback:\n * withEffectContext(ctx, () => {\n *   effect(() => { /* child of the captured context *​/ })\n * })\n * ```\n */\nexport function effectContext(): EffectContext | undefined {\n\treturn effectHistory.active as unknown as EffectContext | undefined\n}\n\n/**\n * Runs `fn` within a previously captured effect context.\n * Any effects created inside `fn` become children of the captured parent.\n *\n * @param ctx - The context token from `effectContext()`, or `undefined` for root context\n * @param fn - The function to execute within the restored context\n * @returns The return value of `fn`\n */\nexport function withEffectContext<R>(ctx: EffectContext | undefined, fn: () => R): R {\n\treturn effectHistory.with(ctx as any, fn)\n}\n\nconst cleanups = new WeakMap<object, Set<ScopedCallback | object>>()\n\n/**\n * Attach cleanup dependencies to an object. When `unlink(obj)` is called,\n * each dependency is disposed: functions are invoked with the cleanup reason,\n * objects are recursively `unlink`ed. This forms a cleanup tree.\n *\n * @param obj - The owner object\n * @param cleanupFns - Cleanup callbacks and/or child objects to unlink recursively\n * @returns The owner object (for chaining)\n *\n * @example\n * ```ts\n * // Functions are called with CleanupReason\n * link(parent, () => console.log('disposed'))\n *\n * // Objects are recursively unlinked\n * link(parent, childA, childB)\n *\n * // Mixed\n * link(parent, childObj, () => timer.clear())\n *\n * unlink(parent) // disposes childA, childB, calls the function\n * ```\n */\nexport function link<T extends object>(\n\tobj: T,\n\t...cleanupFns: (ScopedCallback | object | undefined)[]\n): T {\n\tconst set = cleanups.get(obj)\n\tif (!set)\n\t\tcleanups.set(\n\t\t\tobj,\n\t\t\tnew Set(cleanupFns.filter((fn): fn is ScopedCallback | object => fn !== undefined))\n\t\t)\n\telse for (const fn of cleanupFns) if (fn) set.add(fn)\n\treturn obj\n}\n\n/**\n * Dispose an object's cleanup dependencies. Functions are called with the\n * reason; linked objects are recursively unlinked. The cleanup set is removed\n * so calling `unlink` twice is safe (second call is a no-op).\n *\n * @param obj - The object to dispose\n * @param reason - Optional cleanup reason propagated to callbacks\n */\nexport function unlink(obj: object, reason?: CleanupReason): void {\n\tconst set = cleanups.get(obj)\n\tif (set) {\n\t\tcleanups.delete(obj)\n\t\tfor (const fn of set)\n\t\t\tif (typeof fn === 'function') fn(reason)\n\t\t\telse unlink(fn, reason)\n\t}\n}\n","import type { GetterWrapper } from '../zone'\nimport { debugHooks } from './debug-hooks'\n\nexport type EffectAccessEvents = {\n\ttriggered(event: string, ...args: any[]): void\n}\n\n/**\n * Effect access passed to user callbacks within effects/watch\n * Provides functions to track dependencies and information about the effect execution\n */\nexport interface EffectAccess {\n\t/**\n\t * Tracks dependencies in the current effect context\n\t * Use this for normal dependency tracking within the effect\n\t * @example\n\t * ```typescript\n\t * effect(({ tracked }) => {\n\t *   // In async context, use tracked to restore dependency tracking\n\t *   await someAsyncOperation()\n\t *   const value = tracked(() => state.count) // Tracks state.count in this effect\n\t * })\n\t * ```\n\t */\n\ttracked: GetterWrapper\n\t/**\n\t * Tracks dependencies in the parent effect context\n\t * Use this when child effects should track dependencies in the parent,\n\t * allowing parent cleanup to manage child effects while dependencies trigger the parent\n\t * @example\n\t * ```typescript\n\t * effect(({ ascend }) => {\n\t *   const length = inputs.length\n\t *   if (length > 0) {\n\t *     ascend(() => {\n\t *       // Dependencies here are tracked in the parent effect\n\t *       inputs.forEach(item => console.log(item))\n\t *     })\n\t *   }\n\t * })\n\t * ```\n\t */\n\tascend: GetterWrapper\n\t/**\n\t * `false` on the first execution, `true` or `CleanupReason` on subsequent runs.\n\t * `true` means this is a re-run but detailed reason gathering is disabled or unavailable.\n\t * A `CleanupReason` describes *why* the previous run was torn down.\n\t * @example\n\t * ```typescript\n\t * effect(({ reaction }) => {\n\t *   if (!reaction) {\n\t *     // First run — setup\n\t *   } else if (reaction !== true && reaction.type === 'propChange') {\n\t *     // Re-run due to dependency change (with details)\n\t *     for (const { evolution } of reaction.triggers)\n\t *       console.log(`${'prop' in evolution ? evolution.prop : evolution.method}: ${evolution.type}`)\n\t *   }\n\t * })\n\t * ```\n\t */\n\treaction: boolean | CleanupReason\n\t/**\n\t * AbortSignal that is aborted when the effect is cleaned up or re-runs.\n\t * Use this to cancel async operations (like fetch) when the effect is no longer valid.\n\t */\n\tsignal: AbortSignal\n}\n// Zone-based async context preservation is implemented in zone.ts\n// It automatically preserves effect context across Promise boundaries (.then, .catch, .finally)\n\n/**\n * Base type for effect callbacks - simple function without additional properties\n */\nexport type ScopedCallback = (reason?: CleanupReason) => void\n\nexport const effectMarker = {\n\tenter: 'effect:enter',\n\tleave: 'effect:leave',\n}\n\nexport type PropTrigger = {\n\tobj: object\n\tevolution: Evolution\n\tdependency?: unknown // Stack from when dependency was created\n\ttouch?: unknown // Stack from when touch occurred\n}\n\n/**\n * Reason for an effect cleanup/reaction\n */\nexport type CleanupReason =\n\t| { type: 'propChange'; triggers: PropTrigger[]; chain?: CleanupReason }\n\t| { type: 'invalidate'; cause: CleanupReason; chain?: CleanupReason }\n\t| { type: 'external'; detail: string; chain?: CleanupReason }\n\t| { type: 'stopped'; detail?: string; chain?: CleanupReason } // explicit stop() call\n\t| { type: 'gc'; chain?: CleanupReason } // FinalizationRegistry collected the holder\n\t| { type: 'lineage'; parent: CleanupReason; chain?: CleanupReason } // parent effect cleaned up (recursive)\n\t| { type: 'error'; error: unknown; chain?: CleanupReason } // error handler chain (reactionCleanup called with error)\n\t| { type: 'multiple'; reasons: CleanupReason[]; chain?: CleanupReason }\n\nfunction formatTrigger({ obj, evolution, dependency, touch }: PropTrigger): unknown[] {\n\tconst detail = evolution.type === 'bunch' ? evolution.method : String(evolution.prop)\n\tconst parts: unknown[] = [`${evolution.type} ${detail} on`, obj]\n\n\tif (dependency) {\n\t\tparts.push('\\n  Dependency created at:')\n\t\tparts.push(...debugHooks.formatStack(dependency))\n\t}\n\n\tif (touch) {\n\t\tparts.push('\\n  Touched from:')\n\t\tparts.push(...debugHooks.formatStack(touch))\n\t}\n\n\treturn parts\n}\n\n/**\n * Console-friendly description of a `CleanupReason`.\n * Returns an array of arguments to spread into `console.log` / `console.warn`,\n * mixing strings and raw object references so the console can render them as inspectable values.\n *\n * @example\n * ```typescript\n * effect(({ reaction }) => {\n *   if (reaction !== true) console.log(...formatCleanupReason(reaction))\n * })\n * ```\n */\nexport function formatCleanupReason(reason: CleanupReason, depth = 0): unknown[] {\n\tconst indent = depth ? '  '.repeat(depth) : ''\n\tswitch (reason.type) {\n\t\tcase 'propChange': {\n\t\t\tconst parts: unknown[] = [`${indent}propChange:`]\n\t\t\tfor (let i = 0; i < reason.triggers.length; i++) {\n\t\t\t\tif (i > 0) parts.push(',')\n\t\t\t\tparts.push(...formatTrigger(reason.triggers[i]))\n\t\t\t}\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'stopped': {\n\t\t\tconst parts: unknown[] = [`${indent}stopped`]\n\t\t\tif (reason.detail) parts.push(`(${reason.detail})`)\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'external': {\n\t\t\tconst parts: unknown[] = [`${indent}external:`, reason.detail]\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'gc': {\n\t\t\tconst parts: unknown[] = [`${indent}gc`]\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'error': {\n\t\t\tconst parts: unknown[] = [`${indent}error:`, reason.error]\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'lineage': {\n\t\t\tconst parts: unknown[] = [\n\t\t\t\t`${indent}lineage ←\\n`,\n\t\t\t\t...formatCleanupReason(reason.parent, depth + 1),\n\t\t\t]\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'invalidate': {\n\t\t\tconst parts: unknown[] = [\n\t\t\t\t`${indent}invalidate ←\\n`,\n\t\t\t\t...formatCleanupReason(reason.cause, depth + 1),\n\t\t\t]\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t\tcase 'multiple': {\n\t\t\tconst parts: unknown[] = []\n\t\t\tfor (let i = 0; i < reason.reasons.length; i++) {\n\t\t\t\tif (i > 0) parts.push('\\n')\n\t\t\t\tparts.push(...formatCleanupReason(reason.reasons[i], depth))\n\t\t\t}\n\t\t\tif (reason.chain) {\n\t\t\t\tparts.push('\\n', ...formatCleanupReason(reason.chain, depth))\n\t\t\t}\n\t\t\treturn parts\n\t\t}\n\t}\n}\n\n/**\n * Type for effect cleanup functions.\n */\nexport type EffectCleanup = ScopedCallback\n\n/**\n * Centralized node for all effect metadata and relationships\n */\nexport interface EffectNode {\n\t// Graph relationships\n\tparent?: EffectTrigger\n\tchildren?: Set<EffectCleanup>\n\n\t// Lifecycle\n\tcleanup?: ScopedCallback\n\tstopped?: boolean\n\t/** The reason why the effect is (re-)executing */\n\tnextReason?: CleanupReason\n\t/** The reason for the current execution (only available during effect run) */\n\tcurrentReason?: CleanupReason\n\n\t// Error handling\n\tforwardThrow?: CatchFunction\n\tcatchers?: CatchFunction[]\n\n\t// Debug / Metadata\n\tcreationStack?: unknown\n\tdependencyHook?: (obj: any, prop: any) => void\n\n\t// Configuration\n\tisOpaque?: boolean\n\n\t// Pending triggers to be batched into CleanupReason\n\tpendingTriggers?: PropTrigger[]\n}\n\n/**\n * Type for the `runEffect` function of an effect - argument-less function to call to trigger the effect\n */\nexport type EffectTrigger = ScopedCallback\n\n/**\n * Async execution mode for effects\n * - `cancel`: Cancel previous async execution when dependencies change (default)\n * - `queue`: Queue next execution to run after current completes\n * - `ignore`: Ignore new executions while async work is running\n */\nexport type AsyncExecutionMode = 'cancel' | 'queue' | 'ignore'\n\n/**\n * Options for effect creation\n */\nexport interface EffectOptions {\n\t/**\n\t * How to handle async effect executions when dependencies change\n\t * @default 'cancel'\n\t */\n\tasyncMode?: AsyncExecutionMode\n\t/**\n\t * If true, this effect is \"opaque\" to deep optimizations: it sees the object reference itself\n\t * and must be notified when it changes, regardless of deep content similarity.\n\t * Use this for effects that depend on object identity (like memoize).\n\t */\n\topaque?: boolean\n\t/**\n\t * Used for debugging purpose. Provides a callback to be called every time a dependency is created.\n\t */\n\tdependencyHook?: (obj: any, prop: any) => void\n\t/**\n\t * Used for debugging purpose. Provides a name for the effect.\n\t */\n\tname?: string\n}\n\n/**\n * Type for property evolution events\n */\nexport type PropEvolution = {\n\ttype: 'set' | 'del' | 'add' | 'invalidate'\n\tprop: any\n}\n\n/**\n * Type for collection operation evolution events\n */\nexport type BunchEvolution = {\n\ttype: 'bunch'\n\tmethod: string\n}\nexport type Evolution = PropEvolution | BunchEvolution\n\nexport type State =\n\t| {\n\t\t\tevolution: Evolution\n\t\t\tnext: State\n\t  }\n\t| {}\n\n// Track native reactivity\n\n/**\n * Symbol to mark class properties as non-reactive\n */\nexport const unreactiveProperties = Symbol('unreactive-properties')\n\n/**\n * Symbol representing all properties in reactive tracking\n */\nexport const allProps = Symbol('all-props')\n\n/**\n * Symbol for structure-only tracking (triggered on key add/delete, not value changes).\n * Used by ownKeys proxy trap — Object.keys(), for..in, Map.keys() depend on this.\n */\nexport const keysOf = Symbol('keys-of')\n\n/**\n * Symbol for accessing projection information on reactive objects\n */\nexport const projectionInfo = Symbol('projection-info')\n\nexport const forwardThrow = Symbol('throw')\n\nexport type EffectCloser = (reason?: CleanupReason) => void\nexport type CatchFunction = (error: unknown) => EffectCloser | undefined | void\n\n/**\n * Context for a running projection item effect\n */\nexport interface ProjectionContext {\n\tsource: any\n\tkey?: any\n\ttarget: any\n\tdepth: number\n\tparent?: ProjectionContext\n}\n\n/**\n * Structured error codes for machine-readable diagnosis\n */\nexport enum ReactiveErrorCode {\n\tCycleDetected = 'Cycle detected',\n\tMaxDepthExceeded = 'Max depth exceeded',\n\tMaxReactionExceeded = 'Max reaction exceeded',\n\tWriteInComputed = 'Write in computed',\n\tTrackingError = 'Tracking error',\n\tBrokenEffects = 'Broken effects',\n}\n\nexport type CycleDebugInfo = {\n\tcode: ReactiveErrorCode.CycleDetected\n\tcycle: string[]\n\tdetails?: string\n\tcausalChain?: string[]\n\tlineage?: unknown\n}\n\nexport type MaxDepthDebugInfo = {\n\tcode: ReactiveErrorCode.MaxDepthExceeded\n\teffectuatedRoots: any[]\n\tcycle: any[] | null\n\ttrace: string\n\tmaxEffectChain: number\n\tqueued: string[]\n\tqueuedCount: number\n\tcausalChain?: string[]\n\tlineage?: unknown\n}\n\nexport type MaxReactionDebugInfo = {\n\tcode: ReactiveErrorCode.MaxReactionExceeded\n\tcount: number\n\teffect: string\n\tcausalChain?: string[]\n\tlineage?: unknown\n}\n\nexport type GenericDebugInfo = {\n\tcode: ReactiveErrorCode\n\tcausalChain?: string[]\n\tlineage?: unknown\n\t[key: string]: any\n}\n\nexport type ReactiveDebugInfo =\n\t| CycleDebugInfo\n\t| MaxDepthDebugInfo\n\t| MaxReactionDebugInfo\n\t| GenericDebugInfo\n\n/**\n * Error class for reactive system errors\n */\nexport class ReactiveError extends Error {\n\tconstructor(\n\t\tmessage: string,\n\t\tpublic debugInfo?: ReactiveDebugInfo\n\t) {\n\t\tsuper(message)\n\t\tthis.name = 'ReactiveError'\n\t}\n\n\tget code(): ReactiveErrorCode | undefined {\n\t\treturn this.debugInfo?.code\n\t}\n\n\tget cause(): any {\n\t\treturn (this.debugInfo as any)?.cause\n\t}\n}\n\n// biome-ignore-start lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n/**\n * Global options for the reactive system\n */\nexport const options = {\n\t/**\n\t * Debug purpose: called when an effect is entered\n\t * @param effect - The effect that is entered\n\t */\n\tenter: (_effect: Function) => {},\n\t/**\n\t * Debug purpose: called when an effect is left\n\t * @param effect - The effect that is left\n\t */\n\tleave: (_effect: Function) => {},\n\t/**\n\t * Debug purpose: called when an effect is chained\n\t * @param target - The effect that is being triggered\n\t * @param caller - The effect that is calling the target\n\t */\n\tchain: (_targets: Function[], _caller?: Function) => {},\n\t/**\n\t * Debug purpose: called when an effect chain is started\n\t * @param target - The effect that is being triggered\n\t */\n\tbeginChain: (_targets: Function[]) => {},\n\t/**\n\t * Debug purpose: called when an effect chain is ended\n\t */\n\tendChain: () => {},\n\tgarbageCollected: (_fn: Function) => {},\n\t/**\n\t * Debug purpose: called when an object is touched\n\t * @param obj - The object that is touched\n\t * @param evolution - The type of change\n\t * @param props - The properties that changed\n\t * @param deps - The dependencies that changed\n\t */\n\ttouched: (_obj: any, _evolution: Evolution, _props?: any[], _deps?: EffectTrigger[]) => {},\n\t/**\n\t * Debug purpose: called when an effect is skipped because it's already running\n\t * @param effect - The effect that is already running\n\t * @param runningChain - The array of effects from the detected one to the currently running one\n\t */\n\tskipRunningEffect: (_effect: EffectTrigger) => {},\n\t/**\n\t * Debug purpose: called when an effect starts executing.\n\t * @param effect - The effect being executed (root function)\n\t * @param reaction - false for initial creation, true/CleanupReason for subsequent runs\n\t */\n\teffectRun: (_effect: Function, _reaction: boolean | CleanupReason) => {},\n\t/**\n\t * Debug purpose: maximum effect chain (like call stack max depth)\n\t * Used to prevent infinite loops\n\t * @default 100\n\t */\n\tmaxEffectChain: 100,\n\t/**\n\t * Maximum number of times an effect can be triggered by the same cause in a single batch\n\t * Used to detect aggressive re-computation or infinite loops\n\t * @default 10\n\t */\n\tmaxTriggerPerBatch: 10,\n\t/**\n\t * Debug purpose: maximum effect reaction (like call stack max depth)\n\t * Used to prevent infinite loops\n\t * @default 'throw'\n\t */\n\tmaxEffectReaction: 'throw' as 'throw' | 'debug' | 'warn',\n\t/**\n\t * Callback called when a memoization discrepancy is detected (debug only)\n\t * When defined, memoized functions will run a second time (untracked) to verify consistency.\n\t * If the untracked run returns a different value than the cached one, this callback is triggered.\n\t *\n\t * This is the primary tool for detecting missing reactive dependencies in computed values.\n\t *\n\t * @param cached - The value currently in the memoization cache\n\t * @param fresh - The value obtained by re-running the function untracked\n\t * @param fn - The memoized function itself\n\t * @param args - Arguments passed to the function\n\t *\n\t * @example\n\t * ```typescript\n\t * reactiveOptions.onMemoizationDiscrepancy = (cached, fresh, fn, args) => {\n\t *   throw new Error(`Memoization discrepancy in ${fn.name}!`);\n\t * };\n\t * ```\n\t */\n\tonMemoizationDiscrepancy: undefined as\n\t\t| ((\n\t\t\t\tcached: any,\n\t\t\t\tfresh: any,\n\t\t\t\tfn: Function,\n\t\t\t\targs: any[],\n\t\t\t\tcause: 'calculation' | 'comparison'\n\t\t  ) => void)\n\t\t| undefined,\n\t/**\n\t * How to handle cycles detected in effect batches.\n\t *\n\t * - `'production'` (Default): High-performance mode. Disables dependency graph maintenance and\n\t *   Topological Sorting in favor of a simple FIFO queue. Use this for trustworthy, acyclic UI code.\n\t *   Cycle detection is heuristic (uses maxEffectChain execution counts).\n\t *\n\t * - `'development'`: Maintains direct dependency graph for early cycle detection during edge creation.\n\t *   Catches cycles before effects execute via DFS check when adding edges. Throws immediately with\n\t *   basic path information. Good balance of debugging help with moderate overhead.\n\t *\n\t * - `'debug'`: Full diagnostic mode with transitive closures and topological sorting.\n\t *   Provides detailed cycle path reporting. Highest overhead but most informative for bug hunting.\n\t *\n\t * @default 'production'\n\t */\n\tcycleHandling: 'development' as 'production' | 'development' | 'debug',\n\t/**\n\t * Internal flag used by memoization discrepancy detector to avoid counting calls in tests\n\t * @warning Do not modify this flag manually, this flag is given by the engine\n\t */\n\tisVerificationRun: false,\n\t/**\n\t * Maximum depth for deep watching traversal\n\t * Used to prevent infinite recursion in circular references\n\t * @default 100\n\t */\n\tmaxDeepWatchDepth: 100,\n\t/**\n\t * Only react on instance members modification (not inherited properties)\n\t * For instance, do not track class methods\n\t * @default true\n\t */\n\tinstanceMembers: true,\n\t/**\n\t * Ignore accessors (getters and setters) and only track direct properties\n\t * @default true\n\t */\n\tignoreAccessors: true,\n\t/**\n\t * Enable recursive touching when objects with the same prototype are replaced\n\t * When enabled, replacing an object with another of the same prototype triggers\n\t * recursive diffing instead of notifying parent effects\n\t * @default true\n\t */\n\trecursiveTouching: true,\n\t/**\n\t * Default async execution mode for effects that return Promises\n\t * - 'cancel': Cancel previous async execution when dependencies change (default, enables async zone)\n\t * - 'queue': Queue next execution to run after current completes (enables async zone)\n\t * - 'ignore': Ignore new executions while async work is running (enables async zone)\n\t * - false: Disable async zone and async mode handling (effects run concurrently)\n\t *\n\t * **When truthy:** Enables async zone (Promise.prototype wrapping) for automatic context\n\t * preservation in Promise callbacks. Warning: This modifies Promise.prototype globally.\n\t * Only enable if no other library modifies Promise.prototype.\n\t *\n\t * **When false:** Async zone is disabled. Use `tracked()` manually in Promise callbacks.\n\t *\n\t * Can be overridden per-effect via EffectOptions\n\t * @default 'cancel'\n\t */\n\tasyncMode: 'cancel' as AsyncExecutionMode | false,\n\t// biome-ignore lint/suspicious/noConsole: This is the whole point here\n\twarn: (...args: any[]) => console.warn(...args),\n\t// biome-ignore lint/suspicious/noConsole: This is the whole point here\n\terror: (...args: any[]) => console.error(...args),\n\n\t/**\n\t * Introspection and debug aids. Set to `null` to disable all debug overhead in production.\n\t *\n\t * - `gatherReasons`: collect `PropTrigger[]` for `CleanupReason` on effect re-runs (default `true`)\n\t *   - `lineages`: what lineages to capture in PropTrigger (default `'touch'`)\n\t * - `logErrors`: log errors with detailed context (default `true`)\n\t * - `enableHistory`: keep a history of mutations (default `true`)\n\t * - `historySize`: number of mutations to keep in history (default `50`)\n\t *\n\t * `enableDevTools()` sets `logErrors` to `true` automatically.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Production: disable all introspection\n\t * reactiveOptions.introspection = null\n\t * ```\n\t */\n\tintrospection: {\n\t\tgatherReasons: { lineages: 'touch' },\n\t\tlogErrors: true,\n\t\tenableHistory: true,\n\t\thistorySize: 50,\n\t} as {\n\t\tgatherReasons: { lineages: 'none' | 'touch' | 'dependency' | 'both' }\n\t\tlogErrors: boolean\n\t\tenableHistory: boolean\n\t\thistorySize: number\n\t} | null,\n}\n// biome-ignore-end lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n\ntype CallableOption = {\n\t[K in keyof typeof options]: (typeof options)[K] extends ((...args: any[]) => any) | undefined\n\t\t? K\n\t\t: never\n}[keyof typeof options]\n\nexport function optionCall<K extends CallableOption>(\n\tname: K,\n\t...args: NonNullable<(typeof options)[K]> extends (...a: infer A) => unknown ? A : never\n): void {\n\tconst fn = options[name]\n\tif (typeof fn !== 'function') return\n\ttry {\n\t\t;(fn as Function)(...args)\n\t} catch (error) {\n\t\toptions.warn(`options.${name} threw`, error)\n\t}\n}\n\n/** Production preset: no introspection, heuristic cycle detection, minimal overhead */\nexport const prodPreset: Partial<typeof options> = {\n\tmaxEffectReaction: 'throw',\n\tcycleHandling: 'production',\n\tintrospection: null,\n\tonMemoizationDiscrepancy: undefined,\n}\n\n/** Development preset (default): introspection on, early cycle detection, warnings */\nexport const devPreset: Partial<typeof options> = {\n\tmaxEffectReaction: 'warn',\n\tcycleHandling: 'development',\n\tintrospection: {\n\t\tgatherReasons: { lineages: 'touch' },\n\t\tlogErrors: true,\n\t\tenableHistory: true,\n\t\thistorySize: 50,\n\t},\n\tonMemoizationDiscrepancy: undefined,\n}\n\n/** Debug preset: full diagnostics, throws on violations, rich lineage capture */\nexport const debugPreset: Partial<typeof options> = {\n\tmaxEffectReaction: 'debug',\n\tcycleHandling: 'debug',\n\tintrospection: {\n\t\tgatherReasons: { lineages: 'both' },\n\t\tlogErrors: true,\n\t\tenableHistory: true,\n\t\thistorySize: 200,\n\t},\n}\n\n// --- Proxy State (Merged from proxy-state.ts) ---\n\nexport const objectToProxy = new WeakMap<object, object>()\nexport const proxyToObject = new WeakMap<object, object>()\n\nexport function storeProxyRelationship(target: object, proxy: object) {\n\tobjectToProxy.set(target, proxy)\n\tproxyToObject.set(proxy, target)\n}\n\nexport function getExistingProxy<T extends object>(target: T): T | undefined {\n\treturn objectToProxy.get(target) as T | undefined\n}\n\nexport function trackProxyObject(proxy: object, target: object) {\n\tproxyToObject.set(proxy, target)\n}\n\nexport function unwrap<T>(obj: T): T {\n\tif (!obj || typeof obj !== 'object') return obj\n\treturn (proxyToObject.get(obj as object) as T) || obj\n}\n\nexport function isReactive(obj: any): boolean {\n\treturn proxyToObject.has(obj)\n}\n","import { debugHooks } from './debug-hooks'\nimport { getActiveEffect } from './effect-context'\nimport { effectToReactiveObjects, getEffectNode, watchers } from './registry'\nimport { allProps, type EffectTrigger, keysOf, options, unwrap } from './types'\n\n// Track dependency stacks per (obj, prop, effect)\nlet dependencyStacks = new WeakMap<object, Map<any, Map<EffectTrigger, unknown>>>()\nlet assertUntrackedFlag = false\n\nexport function resetTracking() {\n\tdependencyStacks = new WeakMap()\n}\n\n/**\n * Executes a function and throws if any reactive dependencies are tracked during execution.\n * Used to assert that code runs in an untracked context.\n */\nexport function assertUntracked<T>(fn: () => T): T {\n\tif (assertUntrackedFlag) {\n\t\tthrow new Error('assertUntracked: nested calls are not supported')\n\t}\n\tassertUntrackedFlag = true\n\ttry {\n\t\treturn fn()\n\t} finally {\n\t\tassertUntrackedFlag = false\n\t}\n}\n\nfunction getDependencyStack(effect: EffectTrigger, obj: object, prop: any): unknown | undefined {\n\tconst objStacks = dependencyStacks.get(obj)\n\tif (!objStacks) return undefined\n\treturn objStacks.get(prop)?.get(effect) ?? objStacks.get(allProps)?.get(effect)\n}\n\nexport { getDependencyStack }\n\n/**\n * Marks a property as a dependency of the current effect\n * @param obj - The object containing the property\n * @param prop - The property name (defaults to allProps)\n */\nexport function dependant(obj: any, prop: any = allProps) {\n\tif (assertUntrackedFlag) {\n\t\tthrow new Error(\n\t\t\t`Reactive dependency tracking detected in assertUntracked context: ${String(prop)} on ${obj}`\n\t\t)\n\t}\n\tobj = unwrap(obj)\n\tconst currentActiveEffect = getActiveEffect()\n\n\t// Early return if no active effect, tracking disabled, or invalid prop\n\tif (!currentActiveEffect || (typeof prop === 'symbol' && prop !== allProps && prop !== keysOf))\n\t\treturn\n\n\tconst node = getEffectNode(currentActiveEffect)\n\tif ('dependencyHook' in node) {\n\t\tnode.dependencyHook?.(obj, prop)\n\t}\n\tlet objectWatchers = watchers.get(obj)\n\tif (!objectWatchers) {\n\t\tobjectWatchers = new Map<PropertyKey, Set<EffectTrigger>>()\n\t\twatchers.set(obj, objectWatchers)\n\t}\n\tlet deps = objectWatchers.get(prop)\n\tif (!deps) {\n\t\tdeps = new Set<EffectTrigger>()\n\t\tobjectWatchers.set(prop, deps)\n\t}\n\tdeps.add(currentActiveEffect)\n\n\t// Track which reactive objects this effect is watching\n\tconst effectObjects = effectToReactiveObjects.get(currentActiveEffect)\n\tif (effectObjects) {\n\t\teffectObjects.add(obj)\n\t} else {\n\t\teffectToReactiveObjects.set(currentActiveEffect, new Set([obj]))\n\t}\n\n\t// Store dependency stack if introspection is enabled\n\tconst gatherReasons = options.introspection?.gatherReasons\n\tif (gatherReasons) {\n\t\tconst lineageConfig = gatherReasons.lineages\n\t\tif (lineageConfig === 'dependency' || lineageConfig === 'both') {\n\t\t\tlet objStacks = dependencyStacks.get(obj)\n\t\t\tif (!objStacks) {\n\t\t\t\tobjStacks = new Map()\n\t\t\t\tdependencyStacks.set(obj, objStacks)\n\t\t\t}\n\t\t\tlet propStacks = objStacks.get(prop)\n\t\t\tif (!propStacks) {\n\t\t\t\tpropStacks = new Map()\n\t\t\t\tobjStacks.set(prop, propStacks)\n\t\t\t}\n\t\t\tpropStacks.set(currentActiveEffect, debugHooks.captureLineage())\n\t\t}\n\t}\n}\n","import { decorator } from '../decorator'\nimport { type Captioned, captioned, flavored, flavorOptions } from '../flavored'\nimport { IterableWeakSet } from '../iterableWeak'\nimport { named } from '../utils'\nimport type { HistoryValue } from '../zone'\nimport { debugHooks } from './debug-hooks'\nimport {\n\tchainExternalReason,\n\teffectAggregator,\n\teffectHistory,\n\texternalReason,\n\tgetActiveEffect,\n} from './effect-context'\nimport {\n\teffectToReactiveObjects,\n\tgetEffectNode,\n\tgetRoot,\n\tmarkWithRoot,\n\tresetRegistry,\n\twatchers,\n} from './registry'\nimport { resetTracking } from './tracking'\nimport {\n\ttype CatchFunction,\n\ttype CleanupReason,\n\ttype EffectAccess,\n\ttype EffectCleanup,\n\ttype EffectCloser,\n\ttype EffectOptions,\n\ttype EffectTrigger,\n\ttype Evolution,\n\teffectMarker,\n\toptionCall,\n\toptions,\n\t// type AsyncExecutionMode,\n\ttype PropTrigger,\n\tReactiveError,\n\tReactiveErrorCode,\n\ttype ScopedCallback,\n\tunwrap,\n} from './types'\n\n/**\n * Finds a cycle in a sequence of functions by looking for the first repetition\n */\nfunction findCycleInChain(roots: Function[]): Function[] | null {\n\tconst seen = new Map<Function, number>()\n\tfor (let i = 0; i < roots.length; i++) {\n\t\tconst root = roots[i]\n\t\tif (seen.has(root)) {\n\t\t\treturn roots.slice(seen.get(root)!)\n\t\t}\n\t\tseen.set(root, i)\n\t}\n\treturn null\n}\n\n/**\n * Formats a list of function roots into a readable trace\n */\nfunction formatRoots(roots: Function[], limit = 20): string {\n\tconst names = roots.map((r) => r.name || '<anonymous>')\n\tif (names.length <= limit) return names.join(' → ')\n\tconst start = names.slice(0, 5)\n\tconst end = names.slice(-10)\n\treturn `${start.join(' → ')} ... (${names.length - 15} more) ... ${end.join(' → ')}`\n}\n\nfunction externalReasonFrom(fn: Function): CleanupReason | undefined {\n\treturn fn.name ? { type: 'external', detail: fn.name } : undefined\n}\n\nexport interface ActivationRecord {\n\teffect: EffectTrigger\n\tobj: any\n\tevolution: Evolution\n\tprop: any\n\tbatchId: number\n}\n\n// Nested map structure for efficient counting and batch cleanup\n// batchId -> effect root -> obj -> prop -> count\nlet activationRegistry: Map<Function, Map<any, Map<any, number>>> | undefined\n\nexport const activationLog: Omit<ActivationRecord, 'batchId'>[] = new Array(100)\n\n/**\n * Returns the activation log containing recent effect activations for debugging.\n * The log is a circular buffer of the last 100 activations.\n *\n * @returns Array of activation records\n */\nexport function getActivationLog() {\n\treturn activationLog\n}\n\nexport function recordActivation(effect: EffectTrigger, obj: any, evolution: Evolution, prop: any) {\n\tconst root = getRoot(effect)\n\n\tif (!activationRegistry) return\n\tlet effectData = activationRegistry.get(root)\n\tif (!effectData) {\n\t\teffectData = new Map()\n\t\tactivationRegistry.set(root, effectData)\n\t}\n\tlet objData = effectData.get(obj)\n\tif (!objData) {\n\t\tobjData = new Map()\n\t\teffectData.set(obj, objData)\n\t}\n\tconst count = (objData.get(prop) ?? 0) + 1\n\tobjData.set(prop, count)\n\n\t// Keep a limited history for diagnostics\n\tactivationLog.unshift({\n\t\teffect,\n\t\tobj,\n\t\tevolution,\n\t\tprop,\n\t})\n\tactivationLog.pop()\n\n\tif (count >= options.maxTriggerPerBatch) {\n\t\tconst effectName = root.name\n\t\tconst message = `Aggressive trigger detected: effect \"${effectName}\" triggered ${count} times in the batch by the same cause.`\n\t\tif (options.maxEffectReaction === 'throw') {\n\t\t\tthrow new ReactiveError(message, {\n\t\t\t\tcode: ReactiveErrorCode.MaxReactionExceeded,\n\t\t\t\tcount,\n\t\t\t\teffect: root,\n\t\t\t})\n\t\t}\n\t\toptions.warn(`[reactive] ${message}`)\n\t}\n}\n\nexport function caught(onThrow: CatchFunction, effect?: EffectTrigger) {\n\teffect ??= getActiveEffect()\n\tif (!effect) throw new Error('Tracking an effect throw while not in an effect')\n\tconst node = getEffectNode(effect)\n\tif (!node.catchers) node.catchers = [onThrow]\n\telse node.catchers.push(onThrow)\n}\n/** @deprecated Use `caught` instead */\nexport const onEffectThrow = caught\n\n// Dependency graph: tracks which effects trigger which other effects\n// Uses roots (Function) as keys for consistency\nlet effectTriggers = new WeakMap<Function, IterableWeakSet<Function>>()\nlet effectTriggeredBy = new WeakMap<Function, IterableWeakSet<Function>>()\n\n// Transitive closures: track all indirect relationships\n// causesClosure: for each effect, all effects that trigger it (directly or indirectly)\n// consequencesClosure: for each effect, all effects that it triggers (directly or indirectly)\nlet causesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\nlet consequencesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\n\n// Batch re-entrance depth and broken state\nlet broken = false\n\n// Debug: Capture where an effect was created\nexport const effectCreationStacks = new WeakMap<Function, unknown[]>()\n\n/**\n * Gets or creates an IterableWeakSet for a closure map\n */\nfunction getOrCreateClosure(\n\tclosure: WeakMap<Function, IterableWeakSet<Function>>,\n\troot: Function\n): IterableWeakSet<Function> {\n\tlet set = closure.get(root)\n\tif (!set) {\n\t\tset = new IterableWeakSet()\n\t\tclosure.set(root, set)\n\t}\n\treturn set\n}\n\n/**\n * Adds an edge to the dependency graph: callerRoot → targetRoot\n * Also maintains transitive closures\n * @param callerRoot - Root function of the effect that triggers\n * @param targetRoot - Root function of the effect being triggered\n */\nfunction addGraphEdge(callerRoot: Function, targetRoot: Function) {\n\tif (options.cycleHandling === 'production') return\n\t// Add to forward graph: callerRoot → targetRoot\n\tconst triggers = effectTriggers.get(callerRoot)\n\n\tif (!triggers) {\n\t\tconst newTriggers = new IterableWeakSet<Function>()\n\t\tnewTriggers.add(targetRoot)\n\t\teffectTriggers.set(callerRoot, newTriggers)\n\t} else {\n\t\ttriggers.add(targetRoot)\n\t}\n\n\t// Add to reverse graph: targetRoot ← callerRoot\n\tlet triggeredBy = effectTriggeredBy.get(targetRoot)\n\tif (!triggeredBy) {\n\t\ttriggeredBy = new IterableWeakSet()\n\t\teffectTriggeredBy.set(targetRoot, triggeredBy)\n\t}\n\ttriggeredBy.add(callerRoot)\n\n\t// Update transitive closures\n\t// When U→V is added, we need to propagate the relationship:\n\t// 1. Add U to causesClosure(V) and V to consequencesClosure(U) (direct relationship)\n\t// 2. For each X in causesClosure(U): add V to consequencesClosure(X) and X to causesClosure(V)\n\t// 3. For each Y in consequencesClosure(V): add U to causesClosure(Y) and Y to consequencesClosure(U)\n\t// Note: Self-loops (U→U) are not added to closures - if an effect appears in its own closure,\n\t// it means there's an indirect cycle that should be detected\n\n\t// Self-loops are explicitly ignored - an effect reading and writing the same property\n\t// (e.g., obj.prop++) should not create a dependency relationship or appear in closures\n\tif (callerRoot === targetRoot) {\n\t\treturn\n\t}\n\n\tconst uConsequences = getOrCreateClosure(consequencesClosure, callerRoot)\n\tconst vCauses = getOrCreateClosure(causesClosure, targetRoot)\n\n\t// 1. Add direct relationship\n\tuConsequences.add(targetRoot)\n\tvCauses.add(callerRoot)\n\n\t// 2. For each X in causesClosure(U): X→U→V means X→V\n\tconst uCausesSet = causesClosure.get(callerRoot)\n\tif (uCausesSet) {\n\t\tfor (const x of uCausesSet) {\n\t\t\t// Skip if this would create a self-loop\n\t\t\tif (x === targetRoot) continue\n\t\t\tconst xConsequences = getOrCreateClosure(consequencesClosure, x)\n\t\t\txConsequences.add(targetRoot)\n\t\t\tvCauses.add(x)\n\t\t}\n\t}\n\n\t// 3. For each Y in consequencesClosure(V): U→V→Y means U→Y\n\tconst vConsequencesSet = consequencesClosure.get(targetRoot)\n\tif (vConsequencesSet) {\n\t\tfor (const y of vConsequencesSet) {\n\t\t\t// Skip if this would create a self-loop\n\t\t\tif (y === callerRoot) continue\n\t\t\tconst yCauses = getOrCreateClosure(causesClosure, y)\n\t\t\tyCauses.add(callerRoot)\n\t\t\tuConsequences.add(y)\n\t\t}\n\t}\n\n\t// 4. Cross-product: for each X in causesClosure(U) and Y in consequencesClosure(V): X→Y\n\tif (uCausesSet?.size && vConsequencesSet?.size) {\n\t\tfor (const x of uCausesSet) {\n\t\t\tconst xConsequences = getOrCreateClosure(consequencesClosure, x)\n\t\t\tfor (const y of vConsequencesSet) {\n\t\t\t\t// Skip if this would create a self-loop\n\t\t\t\tif (x === y) continue\n\t\t\t\txConsequences.add(y)\n\t\t\t\tconst yCauses = getOrCreateClosure(causesClosure, y)\n\t\t\t\tyCauses.add(x)\n\t\t\t}\n\t\t}\n\t}\n}\n\n/**\n * Checks if there's a path from start to end in the dependency graph, excluding a specific node\n * Uses BFS to find any path that doesn't go through the excluded node\n * @param start - Starting node\n * @param end - Target node\n * @param exclude - Node to exclude from the path\n * @returns true if a path exists without going through the excluded node\n */\nfunction hasPathExcluding(start: Function, end: Function, exclude: Function): boolean {\n\tif (start === end) return true\n\tif (start === exclude) return false\n\n\tconst visited = new Set<Function>()\n\tconst queue: Function[] = [start]\n\tvisited.add(start)\n\tvisited.add(exclude) // Pre-mark excluded node as visited to skip it\n\n\twhile (queue.length > 0) {\n\t\tconst current = queue.shift()!\n\t\tconst triggers = effectTriggers.get(current)\n\t\tif (!triggers) continue\n\n\t\tfor (const next of triggers) {\n\t\t\tif (next === end) return true\n\t\t\tif (!visited.has(next)) {\n\t\t\t\tvisited.add(next)\n\t\t\t\tqueue.push(next)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false\n}\n\n/**\n * Removes all edges involving the given effect from the dependency graph\n * Also cleans up transitive closures by propagating cleanup to all affected effects\n * Called when an effect is stopped/cleaned up\n * @param effect - The effect being cleaned up\n */\nfunction cleanupEffectFromGraph(effect: EffectTrigger) {\n\tif (options.cycleHandling === 'production') return\n\tconst root = getRoot(effect)\n\n\t// Get closures before removing direct edges (needed for propagation)\n\tconst rootCauses = causesClosure.get(root)\n\tconst rootConsequences = consequencesClosure.get(root)\n\n\t// Remove from effectTriggers (outgoing edges)\n\tconst triggers = effectTriggers.get(root)\n\tif (triggers) {\n\t\t// Remove this root from all targets' effectTriggeredBy sets\n\t\tfor (const targetRoot of triggers) {\n\t\t\tconst triggeredBy = effectTriggeredBy.get(targetRoot)\n\t\t\ttriggeredBy?.delete(root)\n\t\t}\n\t\teffectTriggers.delete(root)\n\t}\n\n\t// Remove from effectTriggeredBy (incoming edges)\n\tconst triggeredBy = effectTriggeredBy.get(root)\n\tif (triggeredBy) {\n\t\t// Remove this root from all sources' effectTriggers sets\n\t\tfor (const sourceRoot of triggeredBy) {\n\t\t\tconst triggers = effectTriggers.get(sourceRoot)\n\t\t\ttriggers?.delete(root)\n\t\t}\n\t\teffectTriggeredBy.delete(root)\n\t}\n\n\t// Propagate closure cleanup to all affected effects\n\t// When removing B from A → B → C:\n\t// - Remove B from causesClosure(C) and consequencesClosure(A)\n\t// - For each X in causesClosure(B): remove C from consequencesClosure(X) if B was the only path\n\t// - For each Y in consequencesClosure(B): remove A from causesClosure(Y) if B was the only path\n\t// - Remove transitive relationships that depended on B\n\n\tif (rootCauses) {\n\t\t// For each X that triggers root: remove root from X's consequences\n\t\t// Only remove root's consequences if no alternate path exists\n\t\tfor (const causeRoot of rootCauses) {\n\t\t\tconst causeConsequences = consequencesClosure.get(causeRoot)\n\t\t\tif (causeConsequences) {\n\t\t\t\t// Remove root itself (it's being cleaned up)\n\t\t\t\tcauseConsequences.delete(root)\n\t\t\t\t// Only remove consequences of root if there's no alternate path from causeRoot to them\n\t\t\t\tif (rootConsequences) {\n\t\t\t\t\tfor (const consequence of rootConsequences) {\n\t\t\t\t\t\t// Check if causeRoot can still reach consequence without going through root\n\t\t\t\t\t\tif (!hasPathExcluding(causeRoot, consequence, root)) {\n\t\t\t\t\t\t\tcauseConsequences.delete(consequence)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (rootConsequences) {\n\t\t// For each Y that root triggers: remove root from Y's causes\n\t\t// Only remove root's causes if no alternate path exists\n\t\tfor (const consequenceRoot of rootConsequences) {\n\t\t\tconst consequenceCauses = causesClosure.get(consequenceRoot)\n\t\t\tif (consequenceCauses) {\n\t\t\t\t// Remove root itself (it's being cleaned up)\n\t\t\t\tconsequenceCauses.delete(root)\n\t\t\t\t// Only remove causes of root if there's no alternate path from them to consequenceRoot\n\t\t\t\tif (rootCauses) {\n\t\t\t\t\tfor (const cause of rootCauses) {\n\t\t\t\t\t\t// Check if cause can still reach consequenceRoot without going through root\n\t\t\t\t\t\tif (!hasPathExcluding(cause, consequenceRoot, root)) {\n\t\t\t\t\t\t\tconsequenceCauses.delete(cause)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Cross-product cleanup: for each X in causesClosure(B) and Y in consequencesClosure(B),\n\t// remove X→Y if B was the only path connecting them\n\tif (rootCauses && rootConsequences) {\n\t\tfor (const x of rootCauses) {\n\t\t\tconst xConsequences = consequencesClosure.get(x)\n\t\t\tif (xConsequences) {\n\t\t\t\tfor (const y of rootConsequences) {\n\t\t\t\t\t// Check if there's still a path from X to Y without going through root\n\t\t\t\t\t// Use BFS to find any path that doesn't include root\n\t\t\t\t\tif (!hasPathExcluding(x, y, root)) {\n\t\t\t\t\t\txConsequences.delete(y)\n\t\t\t\t\t\tconst yCauses = causesClosure.get(y)\n\t\t\t\t\t\tyCauses?.delete(x)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Finally, delete the closures for this effect\n\tcausesClosure.delete(root)\n\tconsequencesClosure.delete(root)\n}\n\n// Batch queue structure - optimized with cached in-degrees\ninterface BatchQueue {\n\t// All effects in the current batch that still need to be executed (todos)\n\tall: Map<Function, EffectTrigger> // root → effect\n\t// Cached in-degrees for each effect in the batch (number of causes in batch)\n\tinDegrees: Map<Function, number> // root → in-degree count\n\t// Deferred callbacks to run after this batch completes (populated by defer())\n\tdeferreds: Set<ScopedCallback>\n}\n\n// Track currently executing effects to prevent re-execution\n// These are all the effects triggered under `activeEffect`\n// Batch stack - handles nested batches by giving each its own queue\nconst batchStack: BatchQueue[] = []\nexport function hasBatched(effect: EffectTrigger) {\n\tconst root = getRoot(effect)\n\treturn batchStack.some((bs) => bs.all.has(root))\n}\n// DEV: stack of currently-executing effects (push on enter, pop on leave)\nconst executingStack: EffectTrigger[] = []\nexport function getExecutingStack(): readonly EffectTrigger[] {\n\treturn executingStack\n}\n\n/**\n * Computes and caches in-degrees for all effects in the batch\n * Called once when batch starts or when new effects are added\n */\nfunction computeAllInDegrees(batch: BatchQueue): void {\n\tif (options.cycleHandling === 'production') return\n\tconst activeEffect = getActiveEffect()\n\tconst activeRoot = activeEffect ? getRoot(activeEffect) : null\n\n\t// Reset all in-degrees\n\tbatch.inDegrees.clear()\n\n\tfor (const [root] of batch.all) {\n\t\tlet inDegree = 0\n\t\tconst causes = causesClosure.get(root)\n\t\tif (causes) {\n\t\t\tfor (const causeRoot of causes) {\n\t\t\t\t// Only count if it's in the batch and not the active/self effect\n\t\t\t\tif (batch.all.has(causeRoot) && causeRoot !== activeRoot && causeRoot !== root) {\n\t\t\t\t\tinDegree++\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbatch.inDegrees.set(root, inDegree)\n\t}\n}\n\n/**\n * Decrements in-degrees of all effects that depend on the executed effect\n * Called after an effect is executed to update the cached in-degrees\n */\nfunction decrementInDegreesForExecuted(batch: BatchQueue, executedRoot: Function): void {\n\t// Get all effects that this executed effect triggers\n\tconst consequences = consequencesClosure.get(executedRoot)\n\tif (!consequences) return\n\n\tfor (const consequenceRoot of consequences) {\n\t\t// Only update if it's still in the batch\n\t\tif (batch.all.has(consequenceRoot)) {\n\t\t\tconst currentDegree = batch.inDegrees.get(consequenceRoot) ?? 0\n\t\t\tif (currentDegree > 0) {\n\t\t\t\tbatch.inDegrees.set(consequenceRoot, currentDegree - 1)\n\t\t\t}\n\t\t}\n\t}\n}\n\n/**\n * Finds a path from startRoot to endRoot in the dependency graph\n * Uses DFS to find the path through direct edges\n * @param startRoot - Starting effect root\n * @param endRoot - Target effect root\n * @param visited - Set of visited nodes (for recursion)\n * @param path - Current path being explored\n * @returns Path from startRoot to endRoot, or empty array if no path exists\n */\nfunction findPath(\n\tstartRoot: Function,\n\tendRoot: Function,\n\tvisited: Set<Function> = new Set(),\n\tpath: Function[] = []\n): Function[] {\n\tif (startRoot === endRoot) {\n\t\treturn [...path, endRoot]\n\t}\n\n\tif (visited.has(startRoot)) {\n\t\treturn []\n\t}\n\n\tvisited.add(startRoot)\n\tconst newPath = [...path, startRoot]\n\n\tconst triggers = effectTriggers.get(startRoot)\n\tif (triggers) {\n\t\tfor (const targetRoot of triggers) {\n\t\t\tconst result = findPath(targetRoot, endRoot, visited, newPath)\n\t\t\tif (result.length > 0) {\n\t\t\t\treturn result\n\t\t\t}\n\t\t}\n\t}\n\n\treturn []\n}\n\n/**\n * Gets the cycle path when adding an edge would create a cycle\n * @param callerRoot - Root of the effect that triggers\n * @param targetRoot - Root of the effect being triggered\n * @returns Array of effect roots forming the cycle, or empty array if no cycle\n */\nfunction getCyclePathForEdge(callerRoot: Function, targetRoot: Function): Function[] {\n\t// Find path from targetRoot back to callerRoot (this is the existing path)\n\t// Then adding callerRoot -> targetRoot completes the cycle\n\tconst path = findPath(targetRoot, callerRoot)\n\tif (path.length > 0) {\n\t\t// The cycle is: callerRoot -> targetRoot -> ... -> callerRoot\n\t\treturn [callerRoot, ...path]\n\t}\n\treturn []\n}\n\n/**\n * Checks if adding an edge would create a cycle\n * Uses causesClosure to check if callerRoot is already a cause of targetRoot\n * Self-loops (callerRoot === targetRoot) are explicitly ignored and return false\n *\n * **Note**: This is the primary optimization benefit of the transitive closure system.\n * It allows detecting cycles in O(1) time before they are executed.\n *\n * @param callerRoot - Root of the effect that triggers\n * @param targetRoot - Root of the effect being triggered\n * @returns true if adding this edge would create a cycle\n */\nfunction wouldCreateCycle(callerRoot: Function, targetRoot: Function): boolean {\n\t// Self-loops are explicitly ignored - an effect reading and writing the same property\n\t// (e.g., obj.prop++) should not create a dependency relationship\n\tif (callerRoot === targetRoot) {\n\t\treturn false\n\t}\n\n\t// Check if targetRoot already triggers callerRoot (directly or indirectly)\n\t// This would create a cycle: callerRoot -> targetRoot -> ... -> callerRoot\n\t// Using consequencesClosure: if targetRoot triggers callerRoot, then callerRoot is in consequencesClosure(targetRoot)\n\tconst targetConsequences = consequencesClosure.get(targetRoot)\n\tif (targetConsequences?.has(callerRoot)) {\n\t\treturn true // Cycle detected: targetRoot -> ... -> callerRoot, and we're adding callerRoot -> targetRoot\n\t}\n\n\treturn false\n}\n\n/**\n * Adds an effect to the batch queue\n * @param effect - The effect to add\n * @param caller - The active effect that triggered this one (optional)\n * @param immediate - If true, don't create edges in the dependency graph\n */\nfunction addToBatch(\n\teffect: EffectTrigger,\n\tcaller?: EffectTrigger,\n\timmediate?: boolean,\n\treason?: CleanupReason\n) {\n\tconst node = getEffectNode(effect)\n\tconst currentBatch = batchStack[batchStack.length - 1]\n\n\tif (!currentBatch) {\n\t\treturn\n\t}\n\n\tconst root = getRoot(effect)\n\n\t// Build reason from pending triggers if not provided\n\tif (!reason && node.pendingTriggers) {\n\t\treason = { type: 'propChange', triggers: node.pendingTriggers }\n\t\t// Add chain: if this is being triggered from another effect, get its reason\n\t\tif (caller) {\n\t\t\tconst callerNode = getEffectNode(caller)\n\t\t\tif (callerNode.currentReason) {\n\t\t\t\treason.chain = callerNode.currentReason\n\t\t\t}\n\t\t}\n\t\treason = chainExternalReason(reason)\n\t}\n\tnode.pendingTriggers = undefined\n\n\tif (reason) {\n\t\tconst existing = node.nextReason\n\t\tif (!existing) {\n\t\t\tnode.nextReason = reason\n\t\t} else {\n\t\t\tconst mergePropChange = (\n\t\t\t\tinto: CleanupReason,\n\t\t\t\tfrom: { type: 'propChange'; triggers: PropTrigger[] }\n\t\t\t): boolean => {\n\t\t\t\tif (into.type === 'propChange') {\n\t\t\t\t\tinto.triggers.push(...from.triggers)\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t\tif (into.type === 'multiple') {\n\t\t\t\t\tconst target = into.reasons.find((r) => r.type === 'propChange') as\n\t\t\t\t\t\t| { type: 'propChange'; triggers: PropTrigger[] }\n\t\t\t\t\t\t| undefined\n\t\t\t\t\tif (target) {\n\t\t\t\t\t\ttarget.triggers.push(...from.triggers)\n\t\t\t\t\t\treturn true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\tif (reason.type === 'propChange') {\n\t\t\t\tif (!mergePropChange(existing, reason)) {\n\t\t\t\t\tif (existing.type === 'multiple') {\n\t\t\t\t\t\texisting.reasons.push(reason)\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnode.nextReason = { type: 'multiple', reasons: [existing, reason] }\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (existing.type === 'multiple') {\n\t\t\t\texisting.reasons.push(reason)\n\t\t\t} else {\n\t\t\t\tnode.nextReason = { type: 'multiple', reasons: [existing, reason] }\n\t\t\t}\n\t\t}\n\t}\n\n\t// 1. Add to batch first (needed for cycle detection)\n\t// TODO: Check if it's the correct way to do (these different behavior in function of dev/production)\n\tif (options.cycleHandling === 'production') {\n\t\t// Production mode: FIFO (delete and re-add to move to end)\n\t\tif (currentBatch.all.has(root)) {\n\t\t\tcurrentBatch.all.delete(root)\n\t\t}\n\t} else {\n\t\t// Dev mode: skip if already queued — the existing entry will re-run\n\t\tif (currentBatch.all.has(root)) {\n\t\t\treturn\n\t\t}\n\t}\n\n\t// If the effect was stopped during cleanup (e.g. lazy memoization), don't add it to the batch\n\tif (node.stopped) return\n\n\tcurrentBatch.all.set(root, effect)\n\n\tif (caller && !immediate && options.cycleHandling !== 'production') {\n\t\tconst callerRoot = getRoot(caller)\n\t\t// const root = getRoot(effect) // Already have root\n\n\t\t// Check for cycle BEFORE adding edge\n\t\tif (wouldCreateCycle(callerRoot, root)) {\n\t\t\tconst cyclePath = getCyclePathForEdge(callerRoot, root)\n\t\t\tconst cycleMessage =\n\t\t\t\tcyclePath.length > 0\n\t\t\t\t\t? `Cycle detected: ${cyclePath.map((r) => r.name || r.toString()).join(' → ')}`\n\t\t\t\t\t: `Cycle detected: ${callerRoot.name || callerRoot.toString()} → ${root.name || root.toString()} (and back)`\n\n\t\t\tcurrentBatch.all.delete(root)\n\t\t\tconst causalChain = debugHooks.getTriggerChain(effect)\n\t\t\tconst lineage = getEffectNode(effect).creationStack\n\n\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`, {\n\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\tcycle: cyclePath.map((r) => r.name || r.toString()),\n\t\t\t\tdetails: cycleMessage,\n\t\t\t\tcausalChain,\n\t\t\t\tlineage,\n\t\t\t})\n\t\t}\n\n\t\taddGraphEdge(callerRoot, root)\n\t}\n}\n\n/**\n * Adds a cleanup function to be called when the current batch of effects completes\n * @param cleanup - The cleanup function to add\n */\nexport function addBatchCleanup(cleanup: EffectCleanup) {\n\tconst currentBatch = batchStack[batchStack.length - 1]\n\tif (!currentBatch) cleanup()\n\telse currentBatch.deferreds.add(cleanup)\n}\n\n/**\n * Semantic alias for `addBatchCleanup` - defers work to the end of the current reactive batch.\n *\n * Use this when an effect needs to perform an action that would modify state the effect depends on,\n * which would create a reactive cycle. The deferred callback runs after all effects complete.\n *\n * @param callback - The callback to defer until after the current batch completes\n *\n * @example\n * ```typescript\n * effect(() => {\n *   processData()\n *\n *   // Defer to avoid cycle (createMovement modifies state this effect reads)\n *   defer(() => {\n *     createMovement(data)\n *   })\n * })\n * ```\n */\nexport const defer = addBatchCleanup\n\n/**\n * Gets a cycle path for debugging\n * Uses DFS to find cycles in the batch\n * @param batch - The batch queue\n * @returns Array of effect roots forming a cycle\n */\nfunction getCyclePath(batch: BatchQueue): Function[] {\n\t// If all effects have in-degree > 0, there must be a cycle\n\t// Use DFS to find it\n\tconst visited = new Set<Function>()\n\tconst recursionStack = new Set<Function>()\n\tconst path: Function[] = []\n\n\tfor (const [root] of batch.all) {\n\t\tif (visited.has(root)) continue\n\t\tconst cycle = findCycle(root, visited, recursionStack, path, batch)\n\t\tif (cycle.length > 0) {\n\t\t\treturn cycle\n\t\t}\n\t}\n\n\treturn []\n}\n\nfunction findCycle(\n\troot: Function,\n\tvisited: Set<Function>,\n\trecursionStack: Set<Function>,\n\tpath: Function[],\n\tbatch: BatchQueue\n): Function[] {\n\tif (recursionStack.has(root)) {\n\t\t// Found a cycle! Return the path from the cycle start to root\n\t\tconst cycleStart = path.indexOf(root)\n\t\treturn path.slice(cycleStart).concat([root])\n\t}\n\n\tif (visited.has(root)) {\n\t\treturn []\n\t}\n\n\tvisited.add(root)\n\trecursionStack.add(root)\n\tpath.push(root)\n\n\t// Follow edges to effects in the batch\n\t// Use direct edges (effectTriggers) for cycle detection\n\tconst triggers = effectTriggers.get(root)\n\tif (triggers) {\n\t\tfor (const targetRoot of triggers) {\n\t\t\tif (batch.all.has(targetRoot)) {\n\t\t\t\tconst cycle = findCycle(targetRoot, visited, recursionStack, path, batch)\n\t\t\t\tif (cycle.length > 0) {\n\t\t\t\t\treturn cycle\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tpath.pop()\n\trecursionStack.delete(root)\n\treturn []\n}\n\n/**\n * Executes the next effect in dependency order (using cached in-degrees)\n * Finds an effect with in-degree 0 and executes it\n * @returns The return value of the executed effect, or null if batch is complete\n */\nfunction executeNext(effectuatedRoots: Function[]): any {\n\tconst currentBatch = batchStack[batchStack.length - 1]\n\tif (!currentBatch) return null\n\n\t// Find an effect with in-degree 0 using cached values\n\tlet nextEffect: EffectTrigger | null = null\n\tlet nextRoot: Function | null = null\n\n\tif (options.cycleHandling === 'production') {\n\t\t// In flat mode, we just take the first effect in the queue (FIFO)\n\t\tconst first = currentBatch.all.entries().next().value\n\t\tif (first) {\n\t\t\t;[nextRoot, nextEffect] = first\n\t\t}\n\t} else {\n\t\t// Find an effect with in-degree 0 (no dependencies in batch that still need execution)\n\t\t// Using cached in-degrees for O(n) lookup instead of O(n²)\n\t\tfor (const [root, effect] of currentBatch.all) {\n\t\t\tconst inDegree = currentBatch.inDegrees.get(root) ?? 0\n\t\t\tif (inDegree === 0) {\n\t\t\t\tnextEffect = effect\n\t\t\t\tnextRoot = root\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!nextEffect) {\n\t\t// No effect with in-degree 0 - there must be a cycle\n\t\t// If all effects have dependencies, it means there's a circular dependency\n\t\tif (currentBatch.all.size > 0) {\n\t\t\tlet cycle = getCyclePath(currentBatch)\n\t\t\t// If we couldn't find a cycle path using direct edges, try using closures\n\t\t\t// (transitive relationships) - if all effects have in-degree > 0, there must be a cycle\n\t\t\tif (cycle.length === 0) {\n\t\t\t\t// Try to find a cycle using consequencesClosure (transitive relationships)\n\t\t\t\t// Note: Self-loops are ignored - we only look for cycles between different effects\n\t\t\t\tfor (const [root] of currentBatch.all) {\n\t\t\t\t\tconst consequences = consequencesClosure.get(root)\n\t\t\t\t\tif (consequences) {\n\t\t\t\t\t\t// Check if any consequence in the batch also has root as a consequence\n\t\t\t\t\t\tfor (const consequence of consequences) {\n\t\t\t\t\t\t\t// Skip self-loops - they are ignored\n\t\t\t\t\t\t\tif (consequence === root) continue\n\t\t\t\t\t\t\tif (currentBatch.all.has(consequence)) {\n\t\t\t\t\t\t\t\tconst consequenceConsequences = consequencesClosure.get(consequence)\n\t\t\t\t\t\t\t\tif (consequenceConsequences?.has(root)) {\n\t\t\t\t\t\t\t\t\t// Found cycle: root -> consequence -> root\n\t\t\t\t\t\t\t\t\tcycle = [root, consequence, root]\n\t\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cycle.length > 0) break\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst cycleMessage =\n\t\t\t\tcycle.length > 0\n\t\t\t\t\t? `Cycle detected: ${cycle.map((r) => r.name || '<anonymous>').join(' → ')}`\n\t\t\t\t\t: 'Cycle detected in effect batch - all effects have dependencies that prevent execution'\n\n\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`, {\n\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\tcycle: cycle.map((r) => r.name || r.toString()),\n\t\t\t\tdetails: cycleMessage,\n\t\t\t})\n\t\t}\n\t\treturn null // Batch complete\n\t}\n\n\teffectuatedRoots.push(getRoot(nextEffect))\n\t// Execute the effect\n\texecutingStack.push(nextEffect)\n\tlet result: any\n\ttry {\n\t\tconst node = getEffectNode(nextEffect)\n\t\tconst reason = node.nextReason\n\t\tif (node.cleanup) {\n\t\t\tconst cleanup = node.cleanup\n\t\t\tnode.cleanup = undefined\n\t\t\tcleanup(reason)\n\t\t}\n\t\tresult = nextEffect()\n\t} finally {\n\t\texecutingStack.pop()\n\t}\n\n\t// Remove from ALL batches in the stack and update in-degrees of dependents\n\tfor (let i = batchStack.length - 1; i >= 0; i--) {\n\t\tconst batch = batchStack[i]\n\t\tif (batch.all.has(nextRoot!)) {\n\t\t\tbatch.all.delete(nextRoot!)\n\t\t\tbatch.inDegrees.delete(nextRoot!)\n\t\t\tdecrementInDegreesForExecuted(batch, nextRoot!)\n\t\t}\n\t}\n\n\treturn result\n}\n\n// Track which sub-effects have been executed to prevent infinite loops\n// These are all the effects triggered under `activeEffect` and all their sub-effects\nexport function batch(\n\teffect: EffectTrigger | EffectTrigger[],\n\timmediate?: 'immediate',\n\tcaller?: EffectTrigger\n) {\n\tif (broken) {\n\t\tthrow new ReactiveError(\n\t\t\t'[reactive] Reactive system is broken after an unrecoverable error. Call reset() to recover.',\n\t\t\t{ code: ReactiveErrorCode.BrokenEffects }\n\t\t)\n\t}\n\tif (!Array.isArray(effect)) effect = [effect]\n\tconst roots = effect.map(getRoot)\n\n\tconst isNewBatch = batchStack.length === 0\n\tif (isNewBatch) {\n\t\tif (!activationRegistry) activationRegistry = new Map()\n\t\telse throw new Error('Activation registry already exists')\n\t\toptionCall('beginChain', roots)\n\t}\n\n\t// TODO: Consider this has been produced but was useless - it might be more correct ?const caller = executingStack.length > 0 ? getActiveEffect() : undefined\n\tconst activeCaller = getActiveEffect()\n\tconst callerToUse = caller || activeCaller\n\n\t// Optimization: If nested and NOT immediate, just join the existing batch\n\tif (!isNewBatch && !immediate) {\n\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\taddToBatch(effect[i], callerToUse, false)\n\t\t}\n\t\treturn\n\t}\n\n\tconst currentBatch: BatchQueue = {\n\t\tall: new Map(),\n\t\tinDegrees: new Map(),\n\t\tdeferreds: new Set(),\n\t}\n\tbatchStack.push(currentBatch)\n\n\tlet success = false\n\ttry {\n\t\tconst effectuatedRoots: Function[] = []\n\t\tconst firstReturn: { value?: any } = {}\n\n\t\tif (immediate) {\n\t\t\t// Execute initial effects in providing order\n\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\texecutingStack.push(effect[i])\n\t\t\t\ttry {\n\t\t\t\t\tconst node = getEffectNode(effect[i])\n\t\t\t\t\tconst reason = node.nextReason\n\t\t\t\t\tif (node.cleanup) {\n\t\t\t\t\t\tconst cleanup = node.cleanup\n\t\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\t\tcleanup(reason)\n\t\t\t\t\t}\n\t\t\t\t\tconst rv = effect[i]()\n\t\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\t} finally {\n\t\t\t\t\texecutingStack.pop()\n\t\t\t\t\tcurrentBatch.all.delete(getRoot(effect[i]))\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\t// Add initial effects to batch and compute dependencies\n\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\taddToBatch(effect[i], callerToUse, false)\n\t\t\t}\n\t\t\tcomputeAllInDegrees(currentBatch)\n\t\t}\n\n\t\t// Process the current batch queue\n\t\twhile (currentBatch.all.size > 0 || currentBatch.deferreds.size > 0) {\n\t\t\tif (currentBatch.all.size > 0) {\n\t\t\t\tif (effectuatedRoots.length > options.maxEffectChain) {\n\t\t\t\t\tconst cycle = findCycleInChain(effectuatedRoots as any)\n\t\t\t\t\tconst trace = formatRoots(effectuatedRoots as any)\n\t\t\t\t\tconst message = cycle\n\t\t\t\t\t\t? `Max effect chain reached (cycle detected: ${formatRoots(cycle)})`\n\t\t\t\t\t\t: `Max effect chain reached (trace: ${trace})`\n\n\t\t\t\t\tconst queuedRoots = Array.from(currentBatch.all.keys())\n\t\t\t\t\tconst queued = queuedRoots.map((r) => r.name || '<anonymous>')\n\t\t\t\t\tconst debugInfo = {\n\t\t\t\t\t\tcode: ReactiveErrorCode.MaxDepthExceeded,\n\t\t\t\t\t\teffectuatedRoots,\n\t\t\t\t\t\tcycle,\n\t\t\t\t\t\ttrace,\n\t\t\t\t\t\tmaxEffectChain: options.maxEffectChain,\n\t\t\t\t\t\tqueued: queued.slice(0, 50),\n\t\t\t\t\t\tqueuedCount: queued.length,\n\t\t\t\t\t\tcausalChain:\n\t\t\t\t\t\t\teffectuatedRoots.length > 0\n\t\t\t\t\t\t\t\t? debugHooks.getTriggerChain(\n\t\t\t\t\t\t\t\t\t\tcurrentBatch.all.get(effectuatedRoots[effectuatedRoots.length - 1])!\n\t\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t: [],\n\t\t\t\t\t}\n\t\t\t\t\tswitch (options.maxEffectReaction) {\n\t\t\t\t\t\tcase 'throw':\n\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\tcase 'debug':\n\t\t\t\t\t\t\t// biome-ignore lint/suspicious/noDebugger: This is the whole point here\n\t\t\t\t\t\t\tdebugger\n\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\tcase 'warn':\n\t\t\t\t\t\t\toptions.warn(\n\t\t\t\t\t\t\t\t`[reactive] ${message} (queued: ${queued.slice(0, 10).join(', ')}${queued.length > 10 ? ', …' : ''})`\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tconst rv = executeNext(effectuatedRoots)\n\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t} else {\n\t\t\t\t// Process deferreds for this batch.\n\t\t\t\tconst deferreds = Array.from(currentBatch.deferreds)\n\t\t\t\tcurrentBatch.deferreds.clear()\n\t\t\t\tfor (const deferred of deferreds) deferred()\n\t\t\t}\n\t\t}\n\t\tsuccess = true\n\t\treturn firstReturn.value\n\t} catch (error) {\n\t\tif (batchStack.length === 1)\n\t\t\toptionCall('error', '[reactive] Root batch failure before broken state:', error)\n\t\tthrow error\n\t} finally {\n\t\tif (!success && batchStack.length === 1) {\n\t\t\tbroken = true\n\t\t}\n\t\tbatchStack.pop()\n\t\tif (batchStack.length === 0) {\n\t\t\tactivationRegistry = undefined\n\t\t\toptionCall('endChain')\n\t\t}\n\t}\n}\n\n/**\n * Resets the reactive system to a consistent state.\n * Call this after an unrecoverable error has set the system to \"broken\".\n * This clears all batch state, effect dependency graphs, and watcher registrations.\n * All existing effects become orphaned and must be recreated.\n */\nexport function reset() {\n\tbroken = false\n\tactivationRegistry = undefined\n\tbatchStack.length = 0\n\teffectTriggers = new WeakMap()\n\teffectTriggeredBy = new WeakMap()\n\tcausesClosure = new WeakMap()\n\tconsequencesClosure = new WeakMap()\n\tresetRegistry()\n\tresetTracking()\n\teffectHistory.present.active = undefined\n}\n\nexport { reset as resetBatchQueueForTest }\n\n// Inject batch function to allow atomic game loops in requestAnimationFrame/setTimeout/...\n// Note: Automatic batching of async callbacks (setTimeout, Promise.then, etc.) is NOT implemented.\n// Rationale: (1) asyncHooks.addHook API doesn't support knowing when callbacks complete (needed for batching),\n// (2) hooking all callback-creating functions adds overhead without guaranteed benefit,\n// (3) incomplete coverage in Node (async_hooks misses user-land patterns).\n// Solution: Use explicit @atomic decorator or manual batch() calls where optimization is needed.\n\n/**\n * Decorator that makes methods atomic - batches all effects triggered within the method\n */\nexport const atomic = decorator({\n\tmethod(original) {\n\t\treturn function (this: any, ...args: any[]) {\n\t\t\tconst atomicEffect = () => original.apply(this, args)\n\t\t\t// Debug: helpful to have a name\n\t\t\tObject.defineProperty(atomicEffect, 'name', { value: `atomic(${original.name})` })\n\t\t\treturn batch(atomicEffect as EffectTrigger, 'immediate')\n\t\t}\n\t},\n\tdefault<Args extends any[], Return>(\n\t\toriginal: (...args: Args) => Return\n\t): (...args: Args) => Return {\n\t\treturn function (this: any, ...args: Args) {\n\t\t\tconst atomicEffect = () => original.apply(this, args)\n\t\t\t// Debug: helpful to have a name\n\t\t\tObject.defineProperty(atomicEffect, 'name', { value: `atomic(${original.name})` })\n\t\t\treturn batch(atomicEffect as EffectTrigger, 'immediate')\n\t\t}\n\t},\n})\n\n/**\n * Wraps `fn` so it runs within `effect`'s zone context when invoked later.\n *\n * Useful for deferred callbacks (event listeners, `DOMContentLoaded`, etc.)\n * that need sub-effects parented to the original effect.\n *\n * @param prev - The effect whose context should be restored, or `undefined` for root context\n * @param fn - The function to wrap\n * @returns A function with the same signature that restores the effect context before calling `fn`\n */\nexport function captured<Args extends any[], Return>(\n\tprev: HistoryValue<EffectTrigger> | undefined,\n\tfn: (...args: Args) => Return\n): (...args: Args) => Return {\n\tprev ??= effectHistory.active\n\treturn named(effectMarker.leave, (...args: Args) => {\n\t\treturn effectHistory.with(prev, () => fn(...args))\n\t})\n}\n\n/**\n * Runs `fn` atomically and **always immediately**, batching all reactive effects\n * triggered inside it so they fire only once after `fn` completes.\n *\n * Unlike `atomic(fn)` which **wraps** a function for later invocation,\n * `atom(fn)` **executes** the function right away.\n *\n * @example\n * ```ts\n * const state = reactive({ a: 0, b: 0 })\n * effect(() => console.log(state.a, state.b)) // logs once after atom completes\n *\n * atom(() => {\n *   state.a = 1\n *   state.b = 2\n * })\n * ```\n */\nexport function atom<T>(fn: () => T) {\n\treturn batch(fn, 'immediate')\n}\n\nconst fr = new FinalizationRegistry<() => void>((f) => f())\n\n/**\n * @param fn - The effect function to run - provides the cleaner\n * @returns The cleanup function\n */\n/**\n * Reactive effect function with chainable flavor modifiers.\n */\ntype EffectCallback = (access: EffectAccess) => EffectCloser | undefined | void | Promise<any>\ntype EffectApplication = (fn: EffectCallback, effectOptions?: EffectOptions) => EffectCleanup\n\nexport interface Effect extends Captioned<EffectApplication> {\n\t(fn: EffectCallback, effectOptions?: EffectOptions): EffectCleanup\n\t/** Opaque flavor: bypasses deep-touch optimizations */\n\treadonly opaque: Effect\n\t/** @deprecated Use `effect\\`name\\`(fn)` instead. */\n\tnamed(name: string): Effect\n}\n\n/**\n * Creates a reactive effect that automatically re-runs when dependencies change\n * @param fn - The effect function that provides dependencies and may return a cleanup function or Promise\n * @param options - Options for effect execution\n * @returns A cleanup function to stop the effect\n */\nexport const effect: Effect = captioned(\n\tnamed(\n\t\teffectMarker.leave,\n\t\tflavored(\n\t\t\tfunction effect(fn: EffectCallback, effectOptions: EffectOptions = {}): EffectCleanup {\n\t\t\t\tif (effectOptions?.name) Object.defineProperty(fn, 'name', { value: effectOptions.name })\n\t\t\t\t// Use per-effect asyncMode or fall back to global option\n\t\t\t\tconst asyncMode = effectOptions?.asyncMode ?? options.asyncMode ?? 'cancel'\n\n\t\t\t\t// Create the effect function - naming it for debug\n\t\t\t\tconst runEffect: EffectTrigger = () => {\n\t\t\t\t\tconst node = getEffectNode(runEffect)\n\t\t\t\t\t// Clear previous dependencies\n\t\t\t\t\tif (node.cleanup) {\n\t\t\t\t\t\tconst prevCleanup = node.cleanup\n\t\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\tuntracked`effect:cleanup`(() =>\n\t\t\t\t\t\t\t\tprevCleanup(\n\t\t\t\t\t\t\t\t\tchainExternalReason(\n\t\t\t\t\t\t\t\t\t\tnode.nextReason || {\n\t\t\t\t\t\t\t\t\t\t\ttype: 'stopped',\n\t\t\t\t\t\t\t\t\t\t\tchain: node.currentReason,\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t} catch (error) {\n\t\t\t\t\t\t\t// If we want to report them, we could use options.warn or similar\n\t\t\t\t\t\t\toptions.warn('Error during effect cleanup', error)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// Handle async modes when effect is retriggered\n\t\t\t\t\tif (runningPromise) {\n\t\t\t\t\t\tif (asyncMode === 'cancel' && cancelPrevious) {\n\t\t\t\t\t\t\t// Cancel previous execution\n\t\t\t\t\t\t\tabort()\n\t\t\t\t\t\t\tcancelPrevious()\n\t\t\t\t\t\t\tcancelPrevious = null\n\t\t\t\t\t\t\trunningPromise = null\n\t\t\t\t\t\t} else if (asyncMode === 'ignore') {\n\t\t\t\t\t\t\t// Ignore new execution while async work is running\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Note: 'queue' mode not yet implemented\n\t\t\t\t\t}\n\n\t\t\t\t\t// The effect has been stopped after having been planned\n\t\t\t\t\tif (effectStopped) return\n\n\t\t\t\t\tlet reactionCleanup: EffectCloser | undefined\n\t\t\t\t\tfunction cleanupReaction(reason?: CleanupReason) {\n\t\t\t\t\t\tconst toCleanup = reactionCleanup\n\t\t\t\t\t\treactionCleanup = undefined\n\t\t\t\t\t\ttoCleanup?.(reason)\n\t\t\t\t\t}\n\t\t\t\t\t// Set reaction reason for the upcoming run\n\t\t\t\t\taccess.reaction = node.nextReason || access.reaction\n\t\t\t\t\tnode.currentReason =\n\t\t\t\t\t\tnode.nextReason ||\n\t\t\t\t\t\t(access.reaction && access.reaction !== true ? access.reaction : undefined)\n\t\t\t\t\tnode.nextReason = undefined\n\n\t\t\t\t\toptionCall('enter', getRoot(fn))\n\t\t\t\t\toptionCall('effectRun', getRoot(fn), access.reaction)\n\t\t\t\t\tlet result: any\n\t\t\t\t\tlet caught = 0\n\n\t\t\t\t\t// Define bubbling thrower\n\t\t\t\t\tconst thrower: CatchFunction = (error: any) => {\n\t\t\t\t\t\tconst catches = node.catchers\n\t\t\t\t\t\tconst reason: CleanupReason = { type: 'error', error }\n\t\t\t\t\t\tif (catches)\n\t\t\t\t\t\t\twhile (caught < catches.length) {\n\t\t\t\t\t\t\t\tcleanupReaction(reason)\n\t\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\t\treactionCleanup = catches[caught](error) as EffectCloser\n\t\t\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t\t\t} catch (_e) {\n\t\t\t\t\t\t\t\t\tcaught++\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\tif (parent) {\n\t\t\t\t\t\t\tconst parentNode = getEffectNode(parent)\n\t\t\t\t\t\t\tif (parentNode.forwardThrow) parentNode.forwardThrow(error)\n\t\t\t\t\t\t\telse throw error\n\t\t\t\t\t\t} else throw error\n\t\t\t\t\t}\n\t\t\t\t\tnode.forwardThrow = thrower\n\n\t\t\t\t\tlet errorToThrow: Error | undefined\n\t\t\t\t\ttry {\n\t\t\t\t\t\tresult = tracked(named(effectMarker.enter, () => fn.call(null, access)))\n\t\t\t\t\t\taccess.reaction = true\n\t\t\t\t\t\toptionCall('leave', fn)\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\tresult &&\n\t\t\t\t\t\t\ttypeof result !== 'function' &&\n\t\t\t\t\t\t\t(typeof result !== 'object' || !('then' in result))\n\t\t\t\t\t\t)\n\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] Effect returned a non-function value: ${result}`)\n\t\t\t\t\t\t// Check if result is a Promise (async effect)\n\t\t\t\t\t\tif (result && typeof result === 'object' && typeof result.then === 'function') {\n\t\t\t\t\t\t\tconst originalPromise = result as Promise<any>\n\n\t\t\t\t\t\t\t// Create a cancellation promise that we can reject\n\t\t\t\t\t\t\tlet cancelReject: ((reason: any) => void) | null = null\n\t\t\t\t\t\t\tconst cancelPromise = new Promise<never>((_, reject) => {\n\t\t\t\t\t\t\t\tcancelReject = reject\n\t\t\t\t\t\t\t})\n\n\t\t\t\t\t\t\tconst cancelError = new ReactiveError(\n\t\t\t\t\t\t\t\t'[reactive] Effect canceled due to dependency change'\n\t\t\t\t\t\t\t)\n\n\t\t\t\t\t\t\t// Race between the actual promise and cancellation\n\t\t\t\t\t\t\t// If canceled, the race rejects, which will propagate through any promise chain\n\t\t\t\t\t\t\trunningPromise = Promise.race([originalPromise, cancelPromise])\n\n\t\t\t\t\t\t\t// Store the cancellation function\n\t\t\t\t\t\t\tcancelPrevious = () => {\n\t\t\t\t\t\t\t\tif (cancelReject) {\n\t\t\t\t\t\t\t\t\tcancelReject(cancelError)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Wrap the original promise chain so cancellation propagates\n\t\t\t\t\t\t\t// This ensures that when we cancel, the original promise's .catch() handlers are triggered\n\t\t\t\t\t\t\t// We do this by rejecting the race promise, which makes the original promise chain see the rejection\n\t\t\t\t\t\t\t// through the zone-wrapped .then()/.catch() handlers\n\t\t\t\t\t\t\trunningPromise = runningPromise\n\t\t\t\t\t\t\t\t.catch((error) => {\n\t\t\t\t\t\t\t\t\t// Propagate async errors to the effect's error handler\n\t\t\t\t\t\t\t\t\t// This ensures onEffectThrow handlers are triggered for async errors\n\t\t\t\t\t\t\t\t\tif (error !== cancelError) {\n\t\t\t\t\t\t\t\t\t\tthrower(error)\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// If thrower didn't throw (handled), we absorb the error.\n\t\t\t\t\t\t\t\t\t// If thrower threw (unhandled), it propagates as a new unhandled rejection, which is correct.\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t\t.finally(() => {\n\t\t\t\t\t\t\t\t\t// Clear currentReason when async effect completes\n\t\t\t\t\t\t\t\t\tnode.currentReason = undefined\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Synchronous result - treat as cleanup function\n\t\t\t\t\t\t\treactionCleanup = result as undefined | EffectCloser\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (error) {\n\t\t\t\t\t\tdebugHooks.decorateError(error, runEffect)\n\t\t\t\t\t\t// catcher:self`\n\t\t\t\t\t\terrorToThrow = error instanceof Error ? error : new Error(String(error))\n\t\t\t\t\t} finally {\n\t\t\t\t\t\t// Clear currentReason for synchronous effects\n\t\t\t\t\t\tif (!runningPromise) {\n\t\t\t\t\t\t\tnode.currentReason = undefined\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// Create cleanup function for next run\n\t\t\t\t\tnode.cleanup = (reason?: CleanupReason) => {\n\t\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\t\tabort()\n\t\t\t\t\t\tcleanupReaction(reason)\n\t\t\t\t\t\tdelete node.catchers\n\t\t\t\t\t\t// Remove this effect from all reactive objects it's watching\n\t\t\t\t\t\tconst effectObjects = effectToReactiveObjects.get(runEffect)\n\t\t\t\t\t\tif (effectObjects) {\n\t\t\t\t\t\t\tfor (const reactiveObj of effectObjects) {\n\t\t\t\t\t\t\t\tconst objectWatchers = watchers.get(reactiveObj)\n\t\t\t\t\t\t\t\tif (objectWatchers) {\n\t\t\t\t\t\t\t\t\tfor (const [prop, deps] of objectWatchers.entries()) {\n\t\t\t\t\t\t\t\t\t\tdeps.delete(runEffect)\n\t\t\t\t\t\t\t\t\t\tif (deps.size === 0) objectWatchers.delete(prop)\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (objectWatchers.size === 0) watchers.delete(reactiveObj)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\teffectToReactiveObjects.delete(runEffect)\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Invoke all child stops (recursive via subEffectCleanup calling its own mainCleanup)\n\t\t\t\t\t\tconst children = node.children\n\t\t\t\t\t\tif (children) {\n\t\t\t\t\t\t\tconst childReason: CleanupReason = reason\n\t\t\t\t\t\t\t\t? reason.type === 'lineage'\n\t\t\t\t\t\t\t\t\t? reason\n\t\t\t\t\t\t\t\t\t: { type: 'lineage', parent: reason, chain: node.currentReason }\n\t\t\t\t\t\t\t\t: (chainExternalReason({ type: 'stopped', chain: node.currentReason }) ?? {\n\t\t\t\t\t\t\t\t\t\ttype: 'stopped',\n\t\t\t\t\t\t\t\t\t\tchain: node.currentReason,\n\t\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\tfor (const childCleanup of children) childCleanup(childReason)\n\t\t\t\t\t\t\tdelete node.children\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif (errorToThrow) thrower(errorToThrow)\n\t\t\t\t}\n\n\t\t\t\t// Initialize metadata node\n\t\t\t\tconst node = getEffectNode(runEffect)\n\n\t\t\t\tif (debugHooks.isDevtoolsEnabled()) {\n\t\t\t\t\tconst stack = debugHooks.captureStack() // Robustly skips internal mutts frames\n\t\t\t\t\tif (stack) {\n\t\t\t\t\t\tnode.creationStack = stack\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tconst tracked = effectHistory.present.with(runEffect, () =>\n\t\t\t\t\tnamed(effectMarker.leave, effectAggregator.zoned)\n\t\t\t\t)\n\t\t\t\tconst ascended = named(effectMarker.leave, effectHistory.zoned)\n\t\t\t\tconst parent = effectHistory.present.active\n\t\t\t\t// Set parent relationship in node\n\t\t\t\tnode.parent = parent\n\n\t\t\t\t// let thrower: CatchFunction | undefined // Moved inside runEffect\n\t\t\t\tlet effectStopped = false\n\t\t\t\tlet abortController: AbortController | undefined\n\n\t\t\t\tconst access: EffectAccess = {\n\t\t\t\t\ttracked,\n\t\t\t\t\tascend: named(effectMarker.leave, (fn) =>\n\t\t\t\t\t\tascended(named(effectMarker.enter, () => fn.call(null)))\n\t\t\t\t\t),\n\t\t\t\t\t//named(effectMarker.enter, (fn) => ascended(fn)),\n\t\t\t\t\treaction: false,\n\t\t\t\t\tget signal() {\n\t\t\t\t\t\tif (!abortController) {\n\t\t\t\t\t\t\tabortController = new AbortController()\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn abortController.signal\n\t\t\t\t\t},\n\t\t\t\t}\n\t\t\t\tlet runningPromise: Promise<any> | null = null\n\t\t\t\tlet cancelPrevious: (() => void) | null = null\n\t\t\t\tif (effectOptions?.dependencyHook) node.dependencyHook = effectOptions.dependencyHook\n\t\t\t\t// Mark the runEffect callback with the original function as its root\n\t\t\t\tmarkWithRoot(runEffect, fn)\n\n\t\t\t\t// Register strict mode if enabled\n\t\t\t\tif (effectOptions?.opaque) {\n\t\t\t\t\tnode.isOpaque = true\n\t\t\t\t}\n\n\t\t\t\tif (debugHooks.isDevtoolsEnabled()) {\n\t\t\t\t\tdebugHooks.registerEffect(runEffect)\n\t\t\t\t}\n\n\t\t\t\t// Store parent relationship for hierarchy traversal - ALREADY DONE ABOVE via getEffectNode\n\n\t\t\t\tconst abort = () => {\n\t\t\t\t\tif (abortController) {\n\t\t\t\t\t\tabortController.abort(\n\t\t\t\t\t\t\tnew ReactiveError('[reactive] Effect aborted due to dependency change or stop')\n\t\t\t\t\t\t)\n\t\t\t\t\t\tabortController = undefined\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbatch(runEffect, 'immediate')\n\t\t\t\t// Only ROOT effects are registered for GC cleanup and zone tracking\n\t\t\t\tconst isRootEffect = !parent\n\n\t\t\t\tconst stopEffect = (reason?: CleanupReason): void => {\n\t\t\t\t\tif (effectStopped) return\n\t\t\t\t\teffectStopped = true\n\t\t\t\t\tnode.stopped = true\n\t\t\t\t\t// Cancel any running async work\n\t\t\t\t\tabort()\n\t\t\t\t\tif (cancelPrevious) {\n\t\t\t\t\t\tcancelPrevious()\n\t\t\t\t\t\tcancelPrevious = null\n\t\t\t\t\t\trunningPromise = null\n\t\t\t\t\t}\n\t\t\t\t\ttry {\n\t\t\t\t\t\tnode.cleanup?.(\n\t\t\t\t\t\t\tchainExternalReason(reason || { type: 'stopped', chain: node.currentReason })\n\t\t\t\t\t\t)\n\t\t\t\t\t} catch (error) {\n\t\t\t\t\t\t// Cleanup errors should basically be ignored or at least not stop the world\n\t\t\t\t\t\t// If we want to report them, we could use options.warn or similar\n\t\t\t\t\t\toptions.warn('Error during effect cleanup', error)\n\t\t\t\t\t}\n\t\t\t\t\t// Clean up dependency graph edges\n\t\t\t\t\tcleanupEffectFromGraph(runEffect)\n\t\t\t\t\tfr.unregister(stopEffect)\n\t\t\t\t}\n\t\t\t\tif (isRootEffect) {\n\t\t\t\t\tconst callIfCollected = (reason?: CleanupReason) => stopEffect(reason)\n\t\t\t\t\tfr.register(\n\t\t\t\t\t\tcallIfCollected,\n\t\t\t\t\t\t() => {\n\t\t\t\t\t\t\tstopEffect({ type: 'gc' })\n\t\t\t\t\t\t\toptionCall('garbageCollected', fn)\n\t\t\t\t\t\t},\n\t\t\t\t\t\tstopEffect\n\t\t\t\t\t)\n\t\t\t\t\treturn callIfCollected\n\t\t\t\t}\n\t\t\t\t// Register this effect to be stopped when the parent effect is cleaned up\n\t\t\t\tif (parent) {\n\t\t\t\t\tconst parentNode = getEffectNode(parent)\n\t\t\t\t\tif (!parentNode.children) {\n\t\t\t\t\t\tparentNode.children = new Set()\n\t\t\t\t\t}\n\t\t\t\t\tconst children = parentNode.children\n\n\t\t\t\t\tconst subEffectCleanup = (reason?: CleanupReason) => {\n\t\t\t\t\t\tchildren.delete(subEffectCleanup)\n\t\t\t\t\t\t// Execute this child effect cleanup (which triggers its own mainCleanup)\n\t\t\t\t\t\tstopEffect(reason)\n\t\t\t\t\t}\n\t\t\t\t\tchildren.add(subEffectCleanup)\n\t\t\t\t\treturn subEffectCleanup\n\t\t\t\t}\n\t\t\t\t// Should not be reachable given isRootEffect check, but for type safety\n\t\t\t\treturn (reason) => stopEffect(reason)\n\t\t\t},\n\t\t\t{\n\t\t\t\tget opaque() {\n\t\t\t\t\treturn flavorOptions(this, { opaque: true }, { name: 'opaque' }) as Effect\n\t\t\t\t},\n\t\t\t\tnamed(name: string) {\n\t\t\t\t\treturn flavorOptions(this, { name }, { name: 'named' }) as Effect\n\t\t\t\t},\n\t\t\t}\n\t\t)\n\t),\n\t{\n\t\tname: 'effect',\n\t\twarn: (message) => options.warn(`[reactive] ${message}`),\n\t\tshouldWarnAnonymous: (_callback, args) =>\n\t\t\t!(args[1] && typeof args[1] === 'object' && 'name' in args[1]),\n\t}\n) as Effect\n\n/**\n * Executes a function without tracking dependencies but maintains parent cleanup relationship\n * Effects created inside will still be cleaned up when the parent effect is destroyed\n * @param fn - The function to execute\n */\ntype RootRunner = <T>(fn: () => T) => T\n\nexport const untracked: Captioned<RootRunner> = captioned(function untracked<T>(fn: () => T): T {\n\tconst external = externalReasonFrom(fn)\n\treturn external\n\t\t? externalReason.with(external, () => effectHistory.present.root(fn))\n\t\t: effectHistory.present.root(fn)\n})\n\n/**\n * Executes a function from a virgin/root context - no parent effect, no tracking\n * Creates completely independent effects that won't be cleaned up by any parent\n * @param fn - The function to execute\n */\nexport const root: Captioned<RootRunner> = captioned(function root<T>(fn: () => T): T {\n\tconst external = externalReasonFrom(fn)\n\treturn external\n\t\t? externalReason.with(external, () => effectHistory.root(fn))\n\t\t: effectHistory.root(fn)\n})\n\n/**\n * Creates a bidirectional binding between a reactive value and a non-reactive external value\n * Prevents infinite loops by automatically suppressing circular notifications\n *\n * @param received - Function called when the reactive value changes (external setter)\n * @param get - Getter for the reactive value OR an object with `{ get, set }` properties\n * @param set - Setter for the reactive value (required if `get` is a function)\n * @returns A function to manually provide updates from the external side\n *\n * @example\n * ```typescript\n * const model = reactive({ value: '' })\n * const input = { value: '' }\n *\n * // Bidirectional binding\n * const provide = biDi(\n *   (v) => input.value = v,  // external setter\n *   () => model.value,        // reactive getter\n *   (v) => model.value = v    // reactive setter\n * )\n *\n * // External notification (e.g., from input event)\n * provide('new value')  // Updates model.value, doesn't trigger circular loop\n * ```\n *\n * @example Using object syntax\n * ```typescript\n * const provide = biDi(\n *   (v) => setHTMLValue(v),\n *   { get: () => reactiveObj.value, set: (v) => reactiveObj.value = v }\n * )\n * ```\n */\nexport function biDi<T>(\n\treceived: (value: T) => void,\n\tvalue: { get: () => T; set: (value: T) => void }\n): (value: T) => void\nexport function biDi<T>(\n\treceived: (value: T) => void,\n\tget: () => T,\n\tset: (value: T) => void\n): (value: T) => void\nexport function biDi<T>(\n\treceived: (value: T) => void,\n\tget: (() => T) | { get: () => T; set: (value: T) => void },\n\tset?: (value: T) => void\n): (value: T) => void {\n\tif (typeof get !== 'function') {\n\t\tset = get.set\n\t\tget = get.get\n\t}\n\tlet programmaticallySetValue: any = Symbol()\n\teffect`biDi`(\n\t\tmarkWithRoot(() => {\n\t\t\tconst newValue = get()\n\t\t\tconst pValue = programmaticallySetValue\n\t\t\tprogrammaticallySetValue = Symbol()\n\t\t\tif (unwrap(newValue) !== pValue) received(newValue)\n\t\t}, received)\n\t)\n\treturn set\n\t\t? atomic((value: T) => {\n\t\t\t\tprogrammaticallySetValue = unwrap(value)\n\t\t\t\tset(value)\n\t\t\t})\n\t\t: () => {}\n}\n","import { debugHooks } from './debug-hooks'\nimport { batch } from './effects'\nimport { getEffectNode } from './registry'\nimport { getDependencyStack } from './tracking'\nimport { allProps, type EffectTrigger, type Evolution, options } from './types'\n\n// Track which objects contain which other objects (back-references)\nexport const objectParents = new WeakMap<object, Set<{ parent: object; prop: PropertyKey }>>()\n\n// Track which objects have deep watchers\nexport const objectsWithDeepWatchers = new WeakSet<object>()\nlet deepWatcherCount = 0\nexport function registerDeepWatcher() {\n\tdeepWatcherCount++\n}\n\n// Track deep watchers per object\nexport const deepWatchers = new WeakMap<object, Set<EffectTrigger>>()\n\n// Track which effects are doing deep watching\nexport const effectToDeepWatchedObjects = new WeakMap<EffectTrigger, Set<object>>()\n\n/**\n * Add a back-reference from child to parent\n */\nexport function addBackReference(child: object, parent: object, prop: any) {\n\tlet parents = objectParents.get(child)\n\tif (!parents) {\n\t\tparents = new Set()\n\t\tobjectParents.set(child, parents)\n\t}\n\tparents.add({ parent, prop })\n}\n\n/**\n * Remove a back-reference from child to parent\n */\nexport function removeBackReference(child: object, parent: object, prop: any) {\n\tconst parents = objectParents.get(child)\n\tif (parents) {\n\t\tfor (const entry of parents) {\n\t\t\tif (entry.parent === parent && entry.prop === prop) {\n\t\t\t\tparents.delete(entry)\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif (parents.size === 0) {\n\t\t\tobjectParents.delete(child)\n\t\t}\n\t}\n}\n\n/**\n * Check if an object needs back-references (has deep watchers or parents with deep watchers)\n */\nexport function needsBackReferences(obj: object): boolean {\n\t// Fast path: if no deep watchers exist anywhere, skip entirely\n\tif (!deepWatcherCount) return false // fast path: no deep watchers anywhere\n\t// Check if object itself has deep watchers\n\tif (objectsWithDeepWatchers.has(obj)) return true\n\t// Slow path: check if any parent has deep watchers (recursive)\n\treturn hasParentWithDeepWatchers(obj)\n}\n\n/**\n * Bubble up changes through the back-reference chain\n */\nexport function bubbleUpChange(changedObject: object, evolution: Evolution) {\n\tconst parents = objectParents.get(changedObject)\n\tif (!parents) return\n\n\tfor (const { parent } of parents) {\n\t\t// Trigger deep watchers on parent\n\t\tconst parentDeepWatchers = deepWatchers.get(parent)\n\t\tif (parentDeepWatchers) {\n\t\t\tif (options.introspection?.gatherReasons) {\n\t\t\t\tconst gatherReasons = options.introspection.gatherReasons\n\t\t\t\tconst lineageConfig = gatherReasons.lineages\n\n\t\t\t\tlet touchLineage: unknown | undefined\n\t\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t\t}\n\n\t\t\t\tfor (const watcher of parentDeepWatchers) {\n\t\t\t\t\tconst dependencyStack =\n\t\t\t\t\t\tlineageConfig === 'dependency' || lineageConfig === 'both'\n\t\t\t\t\t\t\t? getDependencyStack(watcher, parent, allProps)\n\t\t\t\t\t\t\t: undefined\n\n\t\t\t\t\tconst node = getEffectNode(watcher)\n\t\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\t\tobj: parent,\n\t\t\t\t\t\tevolution,\n\t\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const watcher of parentDeepWatchers) batch(watcher)\n\t\t}\n\n\t\t// Continue bubbling up\n\t\tbubbleUpChange(parent, evolution)\n\t}\n}\n\nfunction hasParentWithDeepWatchers(obj: object): boolean {\n\tconst parents = objectParents.get(obj)\n\tif (!parents) return false\n\n\tfor (const { parent } of parents) {\n\t\tif (objectsWithDeepWatchers.has(parent)) return true\n\t\tif (hasParentWithDeepWatchers(parent)) return true\n\t}\n\treturn false\n}\n","import { debugHooks } from './debug-hooks'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { getActiveEffect, isRunning } from './effect-context'\nimport { batch, hasBatched, recordActivation } from './effects'\nimport { getEffectNode, watchers } from './registry'\nimport { getDependencyStack } from './tracking'\nimport {\n\tallProps,\n\ttype EffectTrigger,\n\ttype Evolution,\n\tkeysOf,\n\toptionCall,\n\toptions,\n\ttype State,\n\tunwrap,\n} from './types'\n\nconst states = new WeakMap<object, State>()\n\nexport function addState(obj: any, evolution: Evolution) {\n\tobj = unwrap(obj)\n\tconst next = {}\n\tconst state = getState(obj)\n\tif (state) Object.assign(state, { evolution, next })\n\tstates.set(obj, next)\n}\n\n/**\n * Gets the current state of a reactive object for evolution tracking\n * @param obj - The reactive object\n * @returns The current state object\n */\nexport function getState(obj: any) {\n\tobj = unwrap(obj)\n\tlet state = states.get(obj)\n\tif (!state) {\n\t\tstate = {}\n\t\tstates.set(obj, state)\n\t}\n\treturn state\n}\n\nexport function collectEffects(\n\tobj: any,\n\tevolution: Evolution,\n\teffects: Map<EffectTrigger, unknown>,\n\tobjectWatchers: Map<any, Set<EffectTrigger>>,\n\t...keyChains: Iterable<any>[]\n) {\n\tconst sourceEffect = getActiveEffect()\n\tfor (const keys of keyChains)\n\t\tfor (const key of keys) {\n\t\t\tconst deps = objectWatchers.get(key)\n\t\t\tif (deps) {\n\t\t\t\t// Make sure `some.prop++` does not keep a dependency to `some.props`\n\t\t\t\tif (sourceEffect) deps.delete(sourceEffect)\n\t\t\t\tfor (const effect of deps) {\n\t\t\t\t\tconst runningChain = isRunning(effect)\n\t\t\t\t\tif (runningChain) {\n\t\t\t\t\t\toptionCall('skipRunningEffect', effect)\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif (!effects.has(effect)) {\n\t\t\t\t\t\teffects.set(effect, getDependencyStack(effect, obj, key))\n\t\t\t\t\t\tif (!hasBatched(effect)) recordActivation(effect, obj, evolution, key)\n\t\t\t\t\t}\n\t\t\t\t\tdebugHooks.recordTriggerLink(sourceEffect, effect, obj, key, evolution)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n}\n\n/**\n * Triggers effects for a single property change\n * @param obj - The object that changed\n * @param evolution - The type of change\n * @param prop - The property that changed\n */\nexport function touched1(obj: any, evolution: Evolution, prop: any) {\n\ttouched(obj, evolution, [prop])\n}\n\n/**\n * Triggers effects for property changes\n * @param obj - The object that changed\n * @param evolution - The type of change\n * @param props - The properties that changed\n */\nexport function touched(obj: any, evolution: Evolution, props?: Iterable<any>) {\n\tobj = unwrap(obj)\n\taddState(obj, evolution)\n\tconst objectWatchers = watchers.get(obj)\n\tif (objectWatchers) {\n\t\t// Note: we have to collect effects to remove duplicates in the specific case when no batch is running\n\t\tconst effects = new Map<EffectTrigger, unknown>()\n\t\tconst structural = !['set', 'invalidate'].includes(evolution.type)\n\t\tconst broad = structural ? [allProps, keysOf] : [allProps]\n\t\tif (props) collectEffects(obj, evolution, effects, objectWatchers, broad, props)\n\t\telse collectEffects(obj, evolution, effects, objectWatchers, objectWatchers.keys())\n\t\tconst triggers = Array.from(effects.keys())\n\t\tconst sourceEffect = getActiveEffect()\n\t\toptionCall('touched', obj, evolution, props as any[] | undefined, triggers)\n\t\t// Store pending triggers for CleanupReason before batching\n\t\tif (options.introspection?.gatherReasons) {\n\t\t\tconst gatherReasons = options.introspection.gatherReasons\n\t\t\tconst lineageConfig = gatherReasons.lineages\n\n\t\t\tlet touchLineage: unknown | undefined\n\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t}\n\n\t\t\tfor (const [effect, dependencyStack] of effects) {\n\t\t\t\tconst node = getEffectNode(effect)\n\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\tobj,\n\t\t\t\t\tevolution,\n\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t})\n\t\t\t}\n\t\t}\n\t\tbatch(triggers, undefined, sourceEffect)\n\t}\n\n\t// Bubble up changes if this object has deep watchers\n\tif (objectsWithDeepWatchers.has(obj)) {\n\t\tbubbleUpChange(obj, evolution)\n\t}\n}\n\n/**\n * Triggers only opaque effects for property changes\n * Used by deep-touch to ensure opaque listeners are notified even when deep optimization is active\n */\nexport function touchedOpaque(obj: any, evolution: Evolution, prop: any) {\n\tobj = unwrap(obj)\n\tconst objectWatchers = watchers.get(obj)\n\tif (!objectWatchers) return\n\n\tconst deps = objectWatchers.get(prop)\n\tif (!deps) return\n\n\tconst effects = new Set<EffectTrigger>()\n\tconst sourceEffect = getActiveEffect()\n\n\tconst gather = options.introspection?.gatherReasons\n\n\tif (gather) {\n\t\tconst lineageConfig = gather.lineages\n\n\t\tfor (const effect of deps) {\n\t\t\tconst node = getEffectNode(effect)\n\t\t\tif (!node.isOpaque) continue\n\n\t\t\tconst runningChain = isRunning(effect)\n\t\t\tif (runningChain) {\n\t\t\t\toptionCall('skipRunningEffect', effect)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\teffects.add(effect)\n\t\t\tif (gather) {\n\t\t\t\tlet touchLineage: unknown | undefined\n\t\t\t\tlet dependencyStack: unknown | undefined\n\n\t\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t\t}\n\t\t\t\tif (lineageConfig === 'dependency' || lineageConfig === 'both') {\n\t\t\t\t\tdependencyStack = getDependencyStack(effect, obj, prop)\n\t\t\t\t}\n\n\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\tobj,\n\t\t\t\t\tevolution,\n\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t})\n\t\t\t}\n\t\t\trecordActivation(effect, obj, evolution, prop)\n\t\t\tdebugHooks.recordTriggerLink(sourceEffect, effect, obj, prop, evolution)\n\t\t}\n\t} else {\n\t\t// When not gathering reasons, process effects normally\n\t\tfor (const effect of deps) {\n\t\t\tconst node = getEffectNode(effect)\n\t\t\tif (!node.isOpaque) continue\n\n\t\t\tconst runningChain = isRunning(effect)\n\t\t\tif (runningChain) {\n\t\t\t\toptionCall('skipRunningEffect', effect)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\teffects.add(effect)\n\t\t\trecordActivation(effect, obj, evolution, prop)\n\t\t\tdebugHooks.recordTriggerLink(sourceEffect, effect, obj, prop, evolution)\n\t\t}\n\t}\n\n\tif (effects.size > 0) {\n\t\toptionCall('touched', obj, evolution, [prop], Array.from(effects))\n\t\tbatch(Array.from(effects), undefined, sourceEffect)\n\t}\n}\n","import { unreactiveProperties } from './types'\nexport const absent = Symbol('absent')\n\ntype UnreactiveMarker = true | Set<PropertyKey>\ntype UnreactiveHost = {\n\t[unreactiveProperties]?: UnreactiveMarker\n}\n\n/**\n * Add unreactive properties to a prototype.\n * If no set is provided, marks the entire object/prototype as non-reactive (sets [unreactiveProperties] = true).\n * If a set is provided, merges with existing unreactive properties (never overrides true).\n */\nexport function addUnreactiveProps<T extends object>(proto: T, set?: Iterable<PropertyKey>): T {\n\tif (unreactiveProperties in proto) {\n\t\tconst existing = (proto as UnreactiveHost)[unreactiveProperties]\n\t\t// If already fully unreactive, don't change\n\t\tif (existing === true) return proto\n\t\t// If no set provided, upgrade to fully unreactive\n\t\tif (!set) {\n\t\t\t;(proto as UnreactiveHost)[unreactiveProperties] = true\n\t\t\treturn proto\n\t\t}\n\t\t// Merge sets\n\t\tconst merged = new Set<PropertyKey>(existing)\n\t\t;(proto as UnreactiveHost)[unreactiveProperties] = merged\n\t\tfor (const p of set) merged.add(p)\n\t}\n\t// If no set, mark as fully unreactive, otherwise create set\n\telse (proto as UnreactiveHost)[unreactiveProperties] = set ? new Set<PropertyKey>(set) : true\n\treturn proto\n}\n\n/** Check if a property is marked unreactive on obj or any of its prototypes (trap-free) */\nexport function isUnreactiveProp(obj: object, prop: PropertyKey): boolean {\n\tif (typeof prop === 'symbol' || prop === 'constructor') return true\n\tconst marker = (obj as UnreactiveHost)[unreactiveProperties]\n\treturn (\n\t\tmarker === true || // Fully unreactive\n\t\tmarker?.has?.(prop) || // Property is unreactive\n\t\tfalse\n\t)\n}\n\nexport function nonReactive<T extends object[]>(...obj: T): T[0] {\n\tfor (const o of obj) {\n\t\t;(o as UnreactiveHost)[unreactiveProperties] = true\n\t}\n\treturn obj[0]\n}\n\nexport function nonReactiveClass<T extends (new (...args: any[]) => any)[]>(...cls: T): T[0] {\n\tfor (const c of cls) if (c) (c.prototype as UnreactiveHost)[unreactiveProperties] = true\n\treturn cls[0]\n}\n\nexport function isNonReactive(obj: any): boolean {\n\treturn !obj || (obj as UnreactiveHost)[unreactiveProperties] === true\n}\n\nnonReactiveClass(Date, RegExp, Error, Promise, Function)\nif (typeof window !== 'undefined') {\n\tnonReactive(window, document)\n\tnonReactiveClass(Node, Element, HTMLElement, EventTarget, HTMLCollection, NodeList)\n}\n","import { addState, collectEffects, touched1, touchedOpaque } from './change'\nimport { debugHooks } from './debug-hooks'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { batch, untracked } from './effects'\nimport { isNonReactive } from './non-reactive'\nimport { effectToReactiveObjects, getEffectNode, watchers } from './registry'\nimport { getDependencyStack } from './tracking'\nimport {\n\tallProps,\n\ttype EffectCleanup,\n\ttype EffectTrigger,\n\ttype Evolution,\n\tkeysOf,\n\toptionCall,\n\toptions,\n\tunwrap,\n} from './types'\n\nfunction getPrototypeToken(value: any): object | null | undefined {\n\tif (Array.isArray(value)) return Array.prototype\n\tif (typeof value !== 'object') return undefined\n\ttry {\n\t\treturn value.constructor\n\t} catch {\n\t\treturn undefined\n\t}\n}\n\nexport function shouldRecurseTouch(oldValue: any, newValue: any): boolean {\n\tif (oldValue === newValue) return false\n\tif (\n\t\t(typeof oldValue !== 'object' && !Array.isArray(oldValue)) ||\n\t\t(typeof newValue !== 'object' && !Array.isArray(newValue))\n\t)\n\t\treturn false\n\tif (isNonReactive(oldValue) /*|| isNonReactive(newValue)*/) return false\n\treturn getPrototypeToken(oldValue) === getPrototypeToken(newValue)\n}\n\n/**\n * Migrate all watcher registrations from oldRef to newRef.\n * Called when deep touch replaces an object identity without any child value differences,\n * to prevent watcher orphaning (effects still pointing at the discarded old object).\n */\nfunction migrateWatchers(oldRef: object, newRef: object) {\n\tconst oldMap = watchers.get(oldRef)\n\tif (!oldMap) return\n\t// Move the entire watcher map\n\twatchers.set(newRef, oldMap)\n\twatchers.delete(oldRef)\n\t// Update the reverse map (effect → objects it watches)\n\tfor (const deps of oldMap.values()) {\n\t\tfor (const effect of deps) {\n\t\t\tconst objects = effectToReactiveObjects.get(effect)\n\t\t\tif (objects) {\n\t\t\t\tobjects.delete(oldRef)\n\t\t\t\tobjects.add(newRef)\n\t\t\t}\n\t\t}\n\t}\n}\n\n/**\n * Centralized function to handle property change notifications with optional recursive touch\n * @param targetObj - The object whose property changed\n * @param prop - The property that changed\n * @param oldValue - The old value (before change)\n * @param newValue - The new value (after change)\n * @param hadProperty - Whether the property existed before (for add vs set)\n */\nexport function notifyPropertyChange(\n\ttargetObj: any,\n\tprop: any,\n\toldValue: any,\n\tnewValue: any,\n\thadProperty: boolean\n) {\n\tconst evolution: Evolution = { type: hadProperty ? 'set' : 'add', prop }\n\n\tif (\n\t\toptions.recursiveTouching &&\n\t\toldValue !== undefined &&\n\t\tshouldRecurseTouch(oldValue, newValue)\n\t) {\n\t\tconst unwrappedObj = unwrap(targetObj)\n\t\tconst origin = { obj: unwrappedObj, prop }\n\t\t// Deep touch: only notify nested property changes with origin filtering\n\t\t// Don't notify direct property change - the whole point is to avoid parent effects re-running\n\n\t\tconst changes = untracked`deepTouch:recursive`(() =>\n\t\t\trecursiveTouch(oldValue, newValue, new WeakMap(), [], origin)\n\t\t)\n\n\t\t// When deep touch found no child differences, the object identity still changed.\n\t\t// Migrate watchers from old → new so the dependency chain is preserved.\n\t\tif (changes.length === 0) {\n\t\t\tmigrateWatchers(unwrap(oldValue), unwrap(newValue))\n\t\t} else {\n\t\t\tdispatchNotifications(changes)\n\t\t}\n\n\t\t// Notify opaque listeners (like memoize) that always want to know about identity changes\n\t\ttouchedOpaque(targetObj, evolution, prop)\n\t} else {\n\t\ttouched1(targetObj, evolution, prop)\n\t}\n}\n\ntype VisitedPairs = WeakMap<object, WeakSet<object>>\ntype PendingNotification = {\n\ttarget: any\n\tevolution: Evolution\n\tprop: any\n\torigin?: { obj: object; prop: PropertyKey } // The property access that triggered this deep touch\n}\n\nfunction hasVisitedPair(visited: VisitedPairs, oldObj: object, newObj: object): boolean {\n\tlet mapped = visited.get(oldObj)\n\tif (!mapped) {\n\t\tmapped = new WeakSet<object>()\n\t\tvisited.set(oldObj, mapped)\n\t}\n\tif (mapped.has(newObj)) return true\n\tmapped.add(newObj)\n\treturn false\n}\n\nfunction collectObjectKeys(obj: any): Set<PropertyKey> {\n\tconst keys = new Set<PropertyKey>(Reflect.ownKeys(obj))\n\tlet proto = Object.getPrototypeOf(obj)\n\t// Continue walking while prototype exists and doesn't have its own constructor\n\t// This stops at Object.prototype (has own constructor) and class prototypes (have own constructor)\n\t// but continues for data prototypes (Object.create({}), Object.create(instance), etc.)\n\twhile (proto && !Object.hasOwn(proto, 'constructor')) {\n\t\tfor (const key of Reflect.ownKeys(proto)) keys.add(key)\n\t\tproto = Object.getPrototypeOf(proto)\n\t}\n\treturn keys\n}\n\nexport function recursiveTouch(\n\toldValue: any,\n\tnewValue: any,\n\tvisited: VisitedPairs = new WeakMap(),\n\tnotifications: PendingNotification[] = [],\n\torigin?: { obj: object; prop: PropertyKey }\n): PendingNotification[] {\n\tif (!shouldRecurseTouch(oldValue, newValue)) return notifications\n\tif (\n\t\t(typeof oldValue !== 'object' && !Array.isArray(oldValue)) ||\n\t\t(typeof newValue !== 'object' && !Array.isArray(newValue))\n\t)\n\t\treturn notifications\n\tif (hasVisitedPair(visited, oldValue, newValue)) return notifications\n\n\tif (Array.isArray(oldValue) && Array.isArray(newValue)) {\n\t\tdiffArrayElements(oldValue, newValue, visited, notifications, origin)\n\t\treturn notifications\n\t}\n\n\tdiffObjectProperties(oldValue, newValue, visited, notifications, origin)\n\treturn notifications\n}\n\nfunction diffArrayElements(\n\toldArray: any[] | readonly any[],\n\tnewArray: any[] | readonly any[],\n\t_visited: VisitedPairs,\n\tnotifications: PendingNotification[],\n\torigin?: { obj: object; prop: PropertyKey }\n) {\n\tconst local: PendingNotification[] = []\n\tconst oldLength = oldArray.length\n\tconst newLength = newArray.length\n\tconst max = Math.max(oldLength, newLength)\n\n\tfor (let index = 0; index < max; index++) {\n\t\tconst hasOld = index < oldLength\n\t\tconst hasNew = index < newLength\n\t\tif (hasOld && !hasNew) {\n\t\t\tlocal.push({ target: oldArray, evolution: { type: 'del', prop: index }, prop: index, origin })\n\t\t\tcontinue\n\t\t}\n\t\tif (!hasOld && hasNew) {\n\t\t\tlocal.push({ target: oldArray, evolution: { type: 'add', prop: index }, prop: index, origin })\n\t\t\tcontinue\n\t\t}\n\t\tif (!hasOld || !hasNew) continue\n\t\tconst oldEntry = unwrap(oldArray[index])\n\t\tconst newEntry = unwrap(newArray[index])\n\t\tif (!Object.is(oldEntry, newEntry)) {\n\t\t\tlocal.push({ target: oldArray, evolution: { type: 'set', prop: index }, prop: index, origin })\n\t\t}\n\t}\n\n\tif (oldLength !== newLength)\n\t\tlocal.push({\n\t\t\ttarget: oldArray,\n\t\t\tevolution: { type: 'set', prop: 'length' },\n\t\t\tprop: 'length',\n\t\t\torigin,\n\t\t})\n\n\tnotifications.push(...local)\n}\n\nfunction diffObjectProperties(\n\toldObj: any,\n\tnewObj: any,\n\tvisited: VisitedPairs,\n\tnotifications: PendingNotification[],\n\torigin?: { obj: object; prop: PropertyKey }\n) {\n\tconst oldKeys = collectObjectKeys(oldObj)\n\tconst newKeys = collectObjectKeys(newObj)\n\tconst local: PendingNotification[] = []\n\n\tfor (const key of oldKeys)\n\t\tif (!newKeys.has(key))\n\t\t\tlocal.push({ target: oldObj, evolution: { type: 'del', prop: key }, prop: key, origin })\n\n\tfor (const key of newKeys) {\n\t\tif (!oldKeys.has(key)) {\n\t\t\tlocal.push({ target: oldObj, evolution: { type: 'add', prop: key }, prop: key, origin })\n\t\t\tcontinue\n\t\t}\n\t\tconst oldEntry = unwrap((oldObj as any)[key])\n\t\tconst newEntry = unwrap((newObj as any)[key])\n\t\tif (shouldRecurseTouch(oldEntry, newEntry)) {\n\t\t\trecursiveTouch(oldEntry, newEntry, visited, notifications, origin)\n\t\t} else if (!Object.is(oldEntry, newEntry)) {\n\t\t\tlocal.push({ target: oldObj, evolution: { type: 'set', prop: key }, prop: key, origin })\n\t\t}\n\t}\n\n\tnotifications.push(...local)\n}\n\n/**\n * Checks if an effect or any of its ancestors is in the allowed set\n */\nfunction hasAncestorInSet(\n\teffect: EffectTrigger | EffectCleanup,\n\tallowedSet: Set<EffectTrigger | EffectCleanup>\n): boolean {\n\tlet current: EffectTrigger | EffectCleanup | undefined = effect\n\tconst visited = new WeakSet<EffectTrigger | EffectCleanup>()\n\twhile (current && !visited.has(current)) {\n\t\tvisited.add(current)\n\t\tif (allowedSet.has(current)) return true\n\t\tconst node = getEffectNode(current as EffectTrigger)\n\t\tcurrent = node.parent\n\t}\n\treturn false\n}\n\nexport function dispatchNotifications(notifications: PendingNotification[]) {\n\tif (!notifications.length) return\n\tconst combinedEffects = new Set<EffectTrigger>()\n\tconst effectCauses = new Map<EffectTrigger, PendingNotification[]>()\n\n\t// Extract origin from first notification (all should have the same origin from a single deep touch)\n\tconst origin = notifications[0]?.origin\n\tlet allowedEffects: Set<EffectTrigger> | undefined\n\n\t// If origin exists, compute allowed effects (those that depend on origin.obj[origin.prop])\n\tif (origin) {\n\t\tallowedEffects = new Set<EffectTrigger>()\n\t\tconst originWatchers = watchers.get(origin.obj)\n\t\tif (originWatchers) {\n\t\t\tconst originEffects = new Map<EffectTrigger, unknown>()\n\t\t\tcollectEffects(\n\t\t\t\torigin.obj,\n\t\t\t\t{ type: 'set', prop: origin.prop },\n\t\t\t\toriginEffects,\n\t\t\t\toriginWatchers,\n\t\t\t\t[allProps],\n\t\t\t\t[origin.prop]\n\t\t\t)\n\t\t\tallowedEffects = new Set(originEffects.keys())\n\t\t}\n\t\t// If no allowed effects, skip all notifications (no one should be notified)\n\t\tif (!allowedEffects?.size) return\n\t}\n\n\tfor (const notification of notifications) {\n\t\tconst { target, evolution, prop } = notification\n\t\tif (typeof target !== 'object' && !Array.isArray(target)) continue\n\t\tconst obj = unwrap(target)\n\t\taddState(obj, evolution)\n\t\tconst objectWatchers = watchers.get(obj)\n\t\tlet currentEffects: Map<EffectTrigger, unknown> | undefined\n\t\tconst propsArray = [prop]\n\t\tif (objectWatchers) {\n\t\t\tcurrentEffects = new Map<EffectTrigger, unknown>()\n\t\t\tconst broad = evolution.type !== 'set' ? [allProps, keysOf] : [allProps]\n\t\t\tcollectEffects(obj, evolution, currentEffects, objectWatchers, broad, propsArray)\n\n\t\t\t// Filter effects by ancestor chain if origin exists\n\t\t\t// Include effects that either directly depend on origin or have an ancestor that does\n\t\t\tif (origin && allowedEffects) {\n\t\t\t\tconst filteredEffects = new Map<EffectTrigger, unknown>()\n\t\t\t\tfor (const [effect, associated] of currentEffects) {\n\t\t\t\t\t// Check if effect itself is allowed OR has an ancestor that is allowed\n\t\t\t\t\tif (allowedEffects.has(effect) || hasAncestorInSet(effect, allowedEffects)) {\n\t\t\t\t\t\tfilteredEffects.set(effect, associated)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcurrentEffects = filteredEffects\n\t\t\t}\n\n\t\t\tfor (const effect of currentEffects.keys()) {\n\t\t\t\tcombinedEffects.add(effect)\n\t\t\t\tlet causes = effectCauses.get(effect)\n\t\t\t\tif (!causes) {\n\t\t\t\t\tcauses = []\n\t\t\t\t\teffectCauses.set(effect, causes)\n\t\t\t\t}\n\t\t\t\tcauses.push(notification)\n\t\t\t}\n\t\t}\n\t\tif (currentEffects) {\n\t\t\toptionCall('touched', obj, evolution, propsArray, Array.from(currentEffects.keys()))\n\t\t}\n\t\tif (objectsWithDeepWatchers.has(obj)) bubbleUpChange(obj, evolution)\n\t}\n\tif (combinedEffects.size) {\n\t\tif (options.introspection?.gatherReasons) {\n\t\t\tconst gatherReasons = options.introspection.gatherReasons\n\t\t\tconst lineageConfig = gatherReasons.lineages\n\n\t\t\tlet touchLineage: unknown | undefined\n\t\t\tif (lineageConfig === 'touch' || lineageConfig === 'both') {\n\t\t\t\ttouchLineage = debugHooks.captureLineage()\n\t\t\t}\n\n\t\t\tfor (const effect of combinedEffects) {\n\t\t\t\tconst node = getEffectNode(effect)\n\t\t\t\tif (!node.pendingTriggers) node.pendingTriggers = []\n\t\t\t\tfor (const { target, evolution, prop } of effectCauses.get(effect)!) {\n\t\t\t\t\tconst dependencyStack =\n\t\t\t\t\t\tlineageConfig === 'dependency' || lineageConfig === 'both'\n\t\t\t\t\t\t\t? getDependencyStack(effect, unwrap(target), prop ?? allProps)\n\t\t\t\t\t\t\t: undefined\n\t\t\t\t\tnode.pendingTriggers.push({\n\t\t\t\t\t\tobj: unwrap(target),\n\t\t\t\t\t\tevolution,\n\t\t\t\t\t\tdependency: dependencyStack,\n\t\t\t\t\t\ttouch: touchLineage,\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbatch([...combinedEffects])\n\t}\n}\n","import { decorator } from '../decorator'\nimport { mixin } from '../mixins'\nimport { FoolProof, isOwnAccessor } from '../utils'\nimport { touched1 } from './change'\nimport { notifyPropertyChange } from './deep-touch'\nimport {\n\taddBackReference,\n\tbubbleUpChange,\n\tneedsBackReferences,\n\tobjectsWithDeepWatchers,\n\tremoveBackReference,\n} from './deep-watch-state'\nimport { getActiveEffect } from './effect-context'\nimport { absent, isNonReactive, isUnreactiveProp } from './non-reactive'\nimport { dependant } from './tracking'\nimport {\n\tgetExistingProxy,\n\tisReactive,\n\tkeysOf,\n\toptions,\n\tproxyToObject,\n\tReactiveError,\n\tReactiveErrorCode,\n\tstoreProxyRelationship,\n\tunwrap,\n} from './types'\nexport const metaProtos = new WeakMap()\nexport const wrapProtos = new WeakMap()\nconst arrayLengths = new WeakMap<unknown[], number>()\nconst hasReentry = new Set<PropertyKey>()\nexport type SubProxy = {\n\tget?(obj: any, prop: PropertyKey, receiver: any): any\n\thas?(obj: any, prop: PropertyKey): boolean\n\townKeys?(obj: any): ArrayLike<string | symbol>\n\tgetOwnPropertyDescriptor?(obj: any, prop: PropertyKey): PropertyDescriptor | undefined\n}\n// Sub-proxy registration for custom reactive behaviors\nconst subsRegister = new WeakMap<any, SubProxy>()\n// Internal untracked flag for setter/getter operations - only used when testing oldValue while setting a value\n// TODO: `touched` trigger also compares to old value and should use the internalUntracked flag\nlet internalUntracked = false\n\nfunction wrapReactiveValue(obj: any, prop: PropertyKey, value: any) {\n\tif (!isReactive(value) && typeof value === 'object' && value !== null) {\n\t\tconst reactiveValue = reactiveObject(value)\n\n\t\t// Only create back-references if this object needs them\n\t\tif (needsBackReferences(obj)) {\n\t\t\taddBackReference(reactiveValue, obj, prop)\n\t\t}\n\n\t\treturn reactiveValue\n\t}\n\treturn value\n}\n\nconst reactiveHandlers: ProxyHandler<any> & Record<symbol, unknown> = {\n\t[Symbol.toStringTag]: 'MutTs Reactive',\n\tget(obj, prop, receiver) {\n\t\tif (internalUntracked) return FoolProof.get(obj, prop, receiver)\n\t\tif (obj && typeof obj === 'object' && prop !== Symbol.toStringTag) {\n\t\t\tconst metaProto = metaProtos.get(obj.constructor)\n\t\t\tif (metaProto && Object.hasOwn(metaProto, prop)) {\n\t\t\t\tconst desc = Object.getOwnPropertyDescriptor(metaProto, prop)!\n\t\t\t\tif (desc.get) {\n\t\t\t\t\tif (!Object.hasOwn(obj, prop)) return desc.get.call(obj)\n\t\t\t\t\t// For own properties (e.g., array length): only override if writable/configurable\n\t\t\t\t\tconst ownDesc = Object.getOwnPropertyDescriptor(obj, prop)!\n\t\t\t\t\tif (ownDesc.configurable || ownDesc.writable || ownDesc.get) return desc.get.call(obj)\n\t\t\t\t} else if (!Object.hasOwn(obj, prop)) return (...args: any[]) => desc.value.apply(obj, args)\n\t\t\t}\n\t\t\tconst wrapProto = wrapProtos.get(obj.constructor)\n\t\t\tif (wrapProto && Object.hasOwn(wrapProto, prop)) return wrapProto[prop]\n\t\t}\n\t\t// Symbols: fast-path — no reactivity tracking\n\t\tif (typeof prop === 'symbol' || prop === 'constructor' || isUnreactiveProp(obj, prop))\n\t\t\treturn FoolProof.get(obj, prop, receiver)\n\n\t\tif (!getActiveEffect()) {\n\t\t\tconst value = (subsRegister.get(obj)?.get || FoolProof.get)(obj, prop, receiver)\n\t\t\treturn wrapReactiveValue(obj, prop, value)\n\t\t}\n\n\t\t// Check if property exists using a trap-free walk to avoid triggering\n\t\t// the has-trap cascade on prototype chains of reactive proxies.\n\t\tconst isOwnProp = Object.hasOwn(obj, prop)\n\n\t\t// For accessor properties, check the unwrapped object to see if it's an accessor\n\t\t// This ensures ignoreAccessors works correctly even after operations like Object.setPrototypeOf\n\t\t// Skip for null-proto objects (pounce scopes) — they never have accessors\n\t\tconst shouldIgnoreAccessor =\n\t\t\toptions.ignoreAccessors &&\n\t\t\tisOwnProp &&\n\t\t\tObject.getPrototypeOf(obj) !== null &&\n\t\t\t(isOwnAccessor(receiver, prop) || isOwnAccessor(obj, prop))\n\n\t\t// Check if property exists using a trap-free walk to avoid triggering\n\t\t// the has-trap cascade on prototype chains of reactive proxies.\n\t\tlet hasProp = isOwnProp\n\t\tlet owner: any = isOwnProp ? obj : undefined\n\t\tif (!isOwnProp) {\n\t\t\tlet raw = Object.getPrototypeOf(obj)\n\t\t\twhile (raw && raw !== Object.prototype) {\n\t\t\t\tif (Object.hasOwn(raw, prop)) {\n\t\t\t\t\thasProp = true\n\t\t\t\t\towner = raw\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\traw = Object.getPrototypeOf(raw)\n\t\t\t}\n\t\t}\n\t\tconst isInheritedAccess = hasProp && !isOwnProp\n\n\t\t// Depend if...\n\t\tif (\n\t\t\t!hasProp ||\n\t\t\t(!(options.instanceMembers && isInheritedAccess && obj instanceof Object) &&\n\t\t\t\t!shouldIgnoreAccessor)\n\t\t)\n\t\t\tdependant(obj, prop)\n\n\t\t// Two-Point Tracking: for inherited access on null-proto chains, also track\n\t\t// the owning ancestor so that writing directly to it triggers dependent effects.\n\t\tif (isInheritedAccess && owner && (!options.instanceMembers || !(obj instanceof Object))) {\n\t\t\tdependant(owner, prop)\n\t\t}\n\t\t// For arrays, use FoolProof.get (Indexer path) for numeric index reactivity.\n\t\t// For all other objects, inline Reflect.get directly (skips 3 function calls).\n\t\tconst value = (subsRegister.get(obj)?.get || FoolProof.get)(obj, prop, receiver)\n\t\treturn wrapReactiveValue(obj, prop, value)\n\t},\n\tset(obj, prop, value, receiver) {\n\t\tconst unwrapped = unwrap(receiver)\n\t\tif (obj !== unwrapped)\n\t\t\treturn Object.defineProperty(unwrapped, prop, {\n\t\t\t\tvalue,\n\t\t\t\tconfigurable: true,\n\t\t\t\twritable: true,\n\t\t\t\tenumerable: true,\n\t\t\t})\n\t\tif (internalUntracked)\n\t\t\tthrow new Error('Internal untracked: setting a value in an getter in a set operation')\n\t\t//return FoolProof.set(obj, prop, value, receiver)\n\n\t\t// Check if this property is marked as unreactive\n\t\tif (isUnreactiveProp(obj, prop)) return FoolProof.set(obj, prop, value, receiver)\n\t\tconst newValue = unwrap(value)\n\t\t// metaProto setter dispatch (e.g., reactive array length)\n\t\tif (obj && typeof obj === 'object' && prop !== Symbol.toStringTag) {\n\t\t\tconst metaProto = obj.constructor && metaProtos.get(obj.constructor)\n\t\t\tif (metaProto && Object.hasOwn(metaProto, prop)) {\n\t\t\t\tconst desc = Object.getOwnPropertyDescriptor(metaProto, prop)!\n\t\t\t\tif (desc.set) {\n\t\t\t\t\tdesc.set.call(obj, newValue)\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Read old value, using withEffect(undefined, ...) for getter-only accessors to avoid\n\t\t// breaking memoization dependency tracking during SET operations\n\t\tlet oldVal = absent\n\t\tconst isArrayLength = prop === 'length' && Array.isArray(obj)\n\t\tinternalUntracked = true\n\t\ttry {\n\t\t\tif (Reflect.has(obj, prop)) {\n\t\t\t\toldVal = isArrayLength\n\t\t\t\t\t? arrayLengths.get(obj) === newValue\n\t\t\t\t\t\t? newValue\n\t\t\t\t\t\t: absent\n\t\t\t\t\t: Reflect.get(obj, prop, receiver)\n\t\t\t}\n\t\t} finally {\n\t\t\tinternalUntracked = false\n\t\t}\n\t\tif (objectsWithDeepWatchers.has(obj)) {\n\t\t\tif (typeof oldVal === 'object' && oldVal !== null) {\n\t\t\t\tremoveBackReference(oldVal, obj, prop)\n\t\t\t}\n\t\t\tif (typeof newValue === 'object' && newValue !== null) {\n\t\t\t\tconst reactiveValue = reactiveObject(newValue)\n\t\t\t\taddBackReference(reactiveValue, obj, prop)\n\t\t\t}\n\t\t}\n\t\tif (oldVal !== newValue) {\n\t\t\t// For getter-only accessors, Reflect.set() may fail, but we still return true\n\t\t\t// to avoid throwing errors. Only proceed with change notifications if set succeeded.\n\t\t\tif (FoolProof.set(obj, prop, newValue, receiver)) {\n\t\t\t\tif (isArrayLength) arrayLengths.set(obj, newValue)\n\t\t\t\tnotifyPropertyChange(obj, prop, oldVal, newValue, oldVal !== absent)\n\t\t\t}\n\t\t}\n\t\treturn true\n\t},\n\thas(obj, prop) {\n\t\tif (hasReentry.has(obj))\n\t\t\tthrow new ReactiveError(\n\t\t\t\t`[reactive] Circular dependency detected in 'has' check for property '${String(prop)}'`,\n\t\t\t\t{\n\t\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\t\tcycle: [], // We don't have the full cycle here, but we know it involves obj\n\t\t\t\t}\n\t\t\t)\n\t\thasReentry.add(obj)\n\t\tif (!internalUntracked && !isUnreactiveProp(obj, prop)) dependant(obj, prop)\n\t\tconst rv = (subsRegister.get(obj)?.has || Reflect.has)(obj, prop)\n\t\thasReentry.delete(obj)\n\t\treturn rv\n\t},\n\tdeleteProperty(obj, prop) {\n\t\tif (!Object.hasOwn(obj, prop)) return false\n\n\t\tconst oldVal = (obj as any)[prop]\n\n\t\t// Remove back-references if this object has deep watchers\n\t\tif (objectsWithDeepWatchers.has(obj) && typeof oldVal === 'object' && oldVal !== null) {\n\t\t\tremoveBackReference(oldVal, obj, prop)\n\t\t}\n\n\t\tdelete (obj as any)[prop]\n\t\ttouched1(obj, { type: 'del', prop }, prop)\n\n\t\t// Bubble up changes if this object has deep watchers\n\t\tif (objectsWithDeepWatchers.has(obj)) {\n\t\t\tbubbleUpChange(obj, { type: 'del', prop })\n\t\t}\n\n\t\treturn true\n\t},\n\townKeys(obj) {\n\t\tdependant(obj, keysOf)\n\t\treturn subsRegister.get(obj)?.ownKeys?.(obj) || Reflect.ownKeys(obj)\n\t},\n\tgetOwnPropertyDescriptor(obj, prop) {\n\t\treturn (\n\t\t\tsubsRegister.get(obj)?.getOwnPropertyDescriptor?.(obj, prop) ||\n\t\t\tReflect.getOwnPropertyDescriptor(obj, prop)\n\t\t)\n\t},\n}\n\nconst reactiveClasses = new WeakSet<Function>()\n\n// Create the ReactiveBase mixin\n/**\n * Base mixin for reactive classes that provides proper constructor reactivity\n * Solves constructor reactivity issues in complex inheritance trees\n */\nexport const ReactiveBase = mixin((base) => {\n\tclass ReactiveMixin extends base {\n\t\tconstructor(...args: any[]) {\n\t\t\tsuper(...args)\n\t\t\t// Only apply reactive transformation if the class is marked with @reactive\n\t\t\t// This allows the mixin to work properly with method inheritance\n\t\t\t// biome-ignore lint/correctness/noConstructorReturn: This is the whole point here\n\t\t\treturn reactiveClasses.has(new.target) ? reactive(this) : this\n\t\t}\n\t}\n\treturn ReactiveMixin\n})\nfunction reactiveObject<T>(anyTarget: T, subProxy?: SubProxy): T {\n\tif (!anyTarget || typeof anyTarget !== 'object') return anyTarget\n\tconst target = anyTarget as any\n\t// If target is already a proxy, return it\n\tif (isNonReactive(target)) return target as T\n\tconst isProxy = proxyToObject.has(target)\n\tif (isProxy) return target as T\n\n\t// If we already have a proxy for this object, return it (optimized: get returns undefined if not found)\n\tconst existing = getExistingProxy(target)\n\tif (existing !== undefined) return existing as T\n\n\tif (subProxy) subsRegister.set(target, subProxy)\n\tconst proxy = new Proxy(target, reactiveHandlers)\n\tif (Array.isArray(target)) arrayLengths.set(target, target.length)\n\t// Store the relationships\n\tstoreProxyRelationship(target, proxy)\n\treturn proxy as T\n}\n\n/**\n * Main decorator for making classes reactive\n * Automatically makes class instances reactive when created\n */\nexport const reactive = decorator({\n\tclass(original) {\n\t\tif (original.prototype instanceof ReactiveBase) {\n\t\t\treactiveClasses.add(original)\n\t\t\treturn original\n\t\t}\n\n\t\tclass Reactive extends original {\n\t\t\tconstructor(...args: any[]) {\n\t\t\t\tsuper(...args)\n\t\t\t\tif (new.target !== Reactive && !reactiveClasses.has(new.target))\n\t\t\t\t\toptions.warn(\n\t\t\t\t\t\t`${(original as any).name} has been inherited by ${this.constructor.name} that is not reactive.\n@reactive decorator must be applied to the leaf class OR classes have to extend ReactiveBase.`\n\t\t\t\t\t)\n\t\t\t\t// biome-ignore lint/correctness/noConstructorReturn: This is the whole point here\n\t\t\t\treturn reactive(this)\n\t\t\t}\n\t\t}\n\t\tObject.defineProperty(Reactive, 'name', {\n\t\t\tvalue: `Reactive<${original.name}>`,\n\t\t})\n\t\treturn Reactive as any\n\t},\n\tget(original: any) {\n\t\treturn reactiveObject(original)\n\t},\n\tdefault: reactiveObject,\n})\n","import { arrayDiff } from '../diff'\nimport { type Captioned, captioned, flavored } from '../flavored'\nimport { tag } from '../utils'\nimport type { GetterWrapper } from '../zone'\nimport { getState, touched, touched1 } from './change'\nimport { chainExternalReason, getActiveEffect, link } from './effect-context'\nimport { effect } from './effects'\nimport { reactive } from './proxy'\nimport { getEffectNode, markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport {\n\ttype CleanupReason,\n\ttype EffectAccess,\n\ttype EffectCloser,\n\tisReactive,\n\tkeysOf,\n\toptions,\n\ttype ScopedCallback,\n\ttype State,\n} from './types'\n\n/**\n * Reactively attends to each entry of a collection or each key yielded by an\n * enumeration callback. For each key, an inner effect runs the callback. When a\n * key disappears, its inner effect is disposed. The callback may return a cleanup\n * (like a regular effect closer).\n *\n * Accepts arrays, records, Maps, Sets, or a raw `() => Iterable<Key>` callback.\n *\n * @example\n * ```typescript\n * // Record shorthand\n * attend(record, (key) => { console.log(key, record[key]) })\n *\n * // Array shorthand\n * attend(array, (index) => { console.log(index, array[index]) })\n *\n * // Raw enumeration callback\n * attend(() => Object.keys(record), (key) => { ... })\n * ```\n */\nexport interface Attend\n\textends Captioned<\n\t\t(\n\t\t\tsource: any,\n\t\t\tcallback: (key: any, access: EffectAccess) => EffectCloser | void\n\t\t) => ScopedCallback\n\t> {\n\t<T>(\n\t\tsource: readonly T[],\n\t\tcallback: (index: number, access: EffectAccess) => EffectCloser | void\n\t): ScopedCallback\n\t<K, V>(\n\t\tsource: Map<K, V>,\n\t\tcallback: (key: K, access: EffectAccess) => EffectCloser | void\n\t): ScopedCallback\n\t<T>(\n\t\tsource: Set<T>,\n\t\tcallback: (value: T, access: EffectAccess) => EffectCloser | void\n\t): ScopedCallback\n\t<S extends object>(\n\t\tsource: S,\n\t\tcallback: (key: keyof S & string, access: EffectAccess) => EffectCloser | void\n\t): ScopedCallback\n\t<Key>(\n\t\tenumerate: () => Iterable<Key>,\n\t\tcallback: (key: Key, access: EffectAccess) => EffectCloser | void\n\t): ScopedCallback\n}\n\nexport const attend: Attend = captioned(\n\tfunction attend(\n\t\tsource: any,\n\t\tcallback: (key: any, access: EffectAccess) => EffectCloser | void\n\t): ScopedCallback {\n\t\tconst enumerate: () => Iterable<any> =\n\t\t\ttypeof source === 'function'\n\t\t\t\t? source\n\t\t\t\t: Array.isArray(source)\n\t\t\t\t\t? () => Array.from({ length: source.length }, (_, i) => i)\n\t\t\t\t\t: source instanceof Map\n\t\t\t\t\t\t? () => source.keys()\n\t\t\t\t\t\t: source instanceof Set\n\t\t\t\t\t\t\t? () => source.values()\n\t\t\t\t\t\t\t: () => Object.keys(source)\n\n\t\tconst keyEffects = new Map<any, ScopedCallback>()\n\t\tconst callbackLabel = callback.name ? callback.name : ''\n\n\t\tconst outer = effect`attend`(({ ascend }) => {\n\t\t\tconst keys = new Set<any>()\n\t\t\tfor (const key of enumerate()) keys.add(key)\n\n\t\t\tfor (const key of keys) {\n\t\t\t\tif (keyEffects.has(key)) continue\n\t\t\t\tconst indexRef = { value: key }\n\t\t\t\tkeyEffects.set(\n\t\t\t\t\tkey,\n\t\t\t\t\tascend(() =>\n\t\t\t\t\t\teffect`attend${callbackLabel ? `:${callbackLabel}` : ''}:${key}`(\n\t\t\t\t\t\t\t(access) => callback(indexRef.value, access)\n\t\t\t\t\t\t)\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t}\n\n\t\t\tfor (const key of Array.from(keyEffects.keys())) {\n\t\t\t\tif (!keys.has(key)) {\n\t\t\t\t\tkeyEffects.get(key)!()\n\t\t\t\t\tkeyEffects.delete(key)\n\t\t\t\t}\n\t\t\t}\n\t\t})\n\n\t\treturn (reason?: CleanupReason) => {\n\t\t\touter(reason)\n\t\t\tfor (const stop of keyEffects.values()) stop(reason)\n\t\t\tkeyEffects.clear()\n\t\t}\n\t},\n\t{\n\t\tname: 'attend',\n\t\tcallbackIndex: 1,\n\t\twarn: (message) => options.warn(`[reactive] ${message}`),\n\t}\n) as Attend\n\n/**\n * Lifts a callback that returns an array into a reactive array that automatically\n * synchronizes with the source array returned by the callback.\n *\n * The returned reactive array will update whenever the callback's dependencies change,\n * efficiently syncing only the elements that differ from the previous result.\n *\n * @example\n * ```typescript\n * const items = reactive([1, 2, 3])\n * const doubled = lift(() => items.map(x => x * 2))\n *\n * console.log([...doubled]) // [2, 4, 6]\n *\n * items.push(4)\n * console.log([...doubled]) // [2, 4, 6, 8]\n * ```\n *\n * @param cb Callback function that returns an array\n * @returns A reactive array synchronized with the callback's result, with a [cleanup] property to stop tracking\n */\nexport interface Lift {\n\t<Output extends any[]>(cb: (access: EffectAccess) => Output): Output\n\t<Output extends object>(cb: (access: EffectAccess) => Output): Output\n\t(strings: TemplateStringsArray, ...values: readonly unknown[]): Lift\n}\n\n/**\n * Lifts a callback that returns an object into a reactive object that automatically\n * synchronizes with the source object returned by the callback.\n *\n * The returned reactive object will update whenever the callback's dependencies change,\n * efficiently syncing only the properties that differ from the previous result using\n * Object.assign(). Properties that no longer exist in the source are automatically removed.\n *\n * @example\n * ```typescript\n * const user = reactive({ name: 'John', age: 30 })\n * const profile = lift(() => ({\n *   displayName: user.name.toUpperCase(),\n *   isAdult: user.age >= 18,\n *   description: `${user.name} is ${user.age} years old`\n * }))\n *\n * console.log(profile.displayName) // JOHN\n * console.log(profile.isAdult) // true\n *\n * user.name = 'Jane'\n * console.log(profile.displayName) // JANE\n * console.log(profile.description) // Jane is 30 years old\n * ```\n *\n * @param cb Callback function that returns an object\n * @returns A reactive object synchronized with the callback's result, with a [cleanup] property to stop tracking\n */\nexport const lift: Lift = captioned(\n\tfunction lift<Output extends any[] | object>(cb: (access: EffectAccess) => Output): Output {\n\t\tlet result!: Output\n\t\tlet rawResult!: Output\n\t\tconst resultName = `lift:${cb.name || 'anonymous'}`\n\t\tconst liftCleanup = effect`lift:${cb.name}`(\n\t\t\tmarkWithRoot((access) => {\n\t\t\t\tconst source = cb(access)\n\t\t\t\tif (!source || typeof source !== 'object')\n\t\t\t\t\tthrow new Error('lift callback must return an array or object')\n\t\t\t\tconst sourceProto = Object.getPrototypeOf(source)\n\t\t\t\tif (!result) {\n\t\t\t\t\trawResult = tag(resultName, Array.isArray(source) ? [] : Object.create(sourceProto))\n\t\t\t\t\tresult = reactive(rawResult)\n\t\t\t\t}\n\t\t\t\tif (sourceProto !== Object.getPrototypeOf(result))\n\t\t\t\t\tthrow new Error('lift callback must return the same type as the previous result')\n\n\t\t\t\tif (Array.isArray(source)) {\n\t\t\t\t\tconst res = result as unknown[]\n\t\t\t\t\tfor (const { indexA, sliceA, sliceB } of arrayDiff(res, source).sort(\n\t\t\t\t\t\t(a, b) => a.indexA - b.indexA\n\t\t\t\t\t))\n\t\t\t\t\t\tres.splice(indexA, sliceA.length, ...sliceB)\n\t\t\t\t} else {\n\t\t\t\t\tconst recordResult = rawResult as Record<string, unknown>\n\t\t\t\t\tfor (const key of Object.keys(source)) {\n\t\t\t\t\t\tconst had = key in rawResult\n\t\t\t\t\t\tconst newDesc = Object.getOwnPropertyDescriptor(source, key)!\n\t\t\t\t\t\tif (had) {\n\t\t\t\t\t\t\tconst oldDesc = Object.getOwnPropertyDescriptor(rawResult, key)\n\t\t\t\t\t\t\tconst sameAccessor = oldDesc && newDesc.get && oldDesc.get === newDesc.get\n\t\t\t\t\t\t\tObject.defineProperty(rawResult, key, newDesc)\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\t!sameAccessor &&\n\t\t\t\t\t\t\t\trecordResult[key] !==\n\t\t\t\t\t\t\t\t\t(oldDesc ? (oldDesc.get ? oldDesc.get() : oldDesc.value) : undefined)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\ttouched1(rawResult, { type: 'set', prop: key }, key)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tObject.defineProperty(rawResult, key, newDesc)\n\t\t\t\t\t\t\ttouched1(rawResult, { type: 'add', prop: key }, key)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor (const key of Object.keys(rawResult))\n\t\t\t\t\t\tif (!(key in source)) {\n\t\t\t\t\t\t\tdelete recordResult[key]\n\t\t\t\t\t\t\ttouched1(rawResult, { type: 'del', prop: key }, key)\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}, cb)\n\t\t)\n\t\treturn link(result, liftCleanup)\n\t},\n\t{\n\t\tname: 'lift',\n\t\twarn: (message) => options.warn(`[reactive] ${message}`),\n\t}\n) as Lift\n\n/**\n * Options for `morph` and its variants.\n *\n * @property pure - When `true`, the mapping function is assumed pure (no reactive reads inside `fn`).\n *   Per-item effects are skipped and items are computed eagerly. When a predicate `(i) => boolean`,\n *   purity is evaluated per item — pure items skip the effect wrapper, non-pure items get their own.\n */\nexport type MorphOptions<I> = { pure?: boolean | ((i: I) => boolean) }\n\n/**\n * Reactively maps an array source through `fn`, producing a lazy reactive output array.\n *\n * Each source item gets its own isolated effect (via `root()`) so that changes to one item\n * only recompute that item's projection. Structural changes (push, splice, reorder) are detected\n * via `arrayDiff` and surgically applied to the output cache.\n *\n * The source can be a reactive array or a function returning an array. When a function is provided,\n * the function is re-evaluated inside an effect whenever its dependencies change.\n *\n * Output elements are computed lazily — accessing `result[i]` triggers computation if not yet cached.\n *\n * @param source - A reactive array or a function returning an array\n * @param fn - Mapping function applied to each element\n * @param options - Optional purity hints to skip per-item effects\n * @returns A readonly reactive array with a `[cleanup]` method to dispose all effects\n */\nexport function morphArray<I, O>(\n\tsource: readonly I[] | (() => readonly I[]),\n\tfn: (arg: I, access?: EffectAccess) => O,\n\toptions?: MorphOptions<I>\n): readonly O[] {\n\tif (typeof source !== 'function' && !isReactive(source) && options?.pure === true) {\n\t\treturn source.map((i) => fn(i)) as any\n\t}\n\n\tlet track!: GetterWrapper\n\tconst itemEffects = new Map<any, { stop: ScopedCallback; index: { value: number } }>()\n\tconst cache = tag(`morph:${fn.name || 'anonymous'}`, [] as O[])\n\tlet input: readonly I[] = []\n\n\tfunction stopItem(key: any) {\n\t\tconst entry = itemEffects.get(key)\n\t\tif (entry) {\n\t\t\tconst activeEffect = getActiveEffect()\n\t\t\tlet chain: CleanupReason | undefined\n\t\t\tif (activeEffect) {\n\t\t\t\tconst node = getEffectNode(activeEffect)\n\t\t\t\tchain = node.currentReason\n\t\t\t}\n\t\t\tentry.stop(chainExternalReason({ type: 'stopped', chain }))\n\t\t\titemEffects.delete(key)\n\t\t}\n\t}\n\n\tfunction computeItem(key: number, input: I) {\n\t\tconst isPure =\n\t\t\toptions?.pure === true || (typeof options?.pure === 'function' && options.pure(input))\n\t\tif (isPure) {\n\t\t\ttrack(() => {\n\t\t\t\tcache[key] = fn(input)\n\t\t\t})\n\t\t} else {\n\t\t\tconst indexRef = { value: key }\n\t\t\tconst stop = track(() =>\n\t\t\t\teffect.opaque`morph:${fn.name}:${key}`((access) => {\n\t\t\t\t\tcache[indexRef.value] = fn(input, access)\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\tdelete cache[indexRef.value]\n\t\t\t\t\t\ttouched1(cache, { type: 'invalidate', prop: 'morph' }, String(key))\n\t\t\t\t\t\tconst activeEffect = getActiveEffect()\n\t\t\t\t\t\tlet chain: CleanupReason | undefined\n\t\t\t\t\t\tif (activeEffect) {\n\t\t\t\t\t\t\tconst node = getEffectNode(activeEffect)\n\t\t\t\t\t\t\tchain = node.currentReason\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstop?.({\n\t\t\t\t\t\t\ttype: 'invalidate',\n\t\t\t\t\t\t\tcause: chainExternalReason(reason ?? { type: 'stopped', chain })!,\n\t\t\t\t\t\t\tchain: chainExternalReason(chain),\n\t\t\t\t\t\t})\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t)\n\t\t\titemEffects.set(key, { stop, index: indexRef })\n\t\t}\n\t}\n\n\tconst proxy = reactive(cache, {\n\t\tget(cache, prop) {\n\t\t\tconst n = typeof prop === 'string' ? Number(prop) : NaN\n\t\t\tif (Number.isNaN(n)) return cache[prop]\n\t\t\tif (!(n in cache)) computeItem(n, input[n])\n\t\t\treturn cache[n]\n\t\t},\n\t\thas(_cache, prop) {\n\t\t\treturn Reflect.has(input, prop)\n\t\t},\n\t})\n\n\tconst stopMain = effect`morph:${fn.name}`(({ ascend }) => {\n\t\ttrack = ascend\n\t\tconst newInput = [...(typeof source === 'function' ? source() : source)]\n\t\tconst diffs = arrayDiff(input, newInput).toSorted((a, b) => b.indexA - a.indexA)\n\n\t\tif (diffs.length > 0) {\n\t\t\tfor (const diff of diffs) {\n\t\t\t\t// Stop items in removed range\n\t\t\t\tfor (let i = diff.indexA; i < diff.indexA + diff.sliceA.length; i++) stopItem(i)\n\n\t\t\t\t// Shift existing itemEffects in the Map to match the new indices\n\t\t\t\tconst shift = diff.sliceB.length - diff.sliceA.length\n\t\t\t\tif (shift !== 0) {\n\t\t\t\t\t// We need to move entries in the Map.\n\t\t\t\t\tconst entries = Array.from(itemEffects.entries()).sort((a, b) => a[0] - b[0])\n\t\t\t\t\t// Remove entries that will be shifted\n\t\t\t\t\tfor (const [idx, _entry] of entries) {\n\t\t\t\t\t\tif (idx >= diff.indexA + diff.sliceA.length) {\n\t\t\t\t\t\t\titemEffects.delete(idx)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t// Re-add them with shifted indices\n\t\t\t\t\tfor (const [idx, entry] of entries) {\n\t\t\t\t\t\tif (idx >= diff.indexA + diff.sliceA.length) {\n\t\t\t\t\t\t\tconst newIdx = idx + shift\n\t\t\t\t\t\t\tentry.index.value = newIdx\n\t\t\t\t\t\t\titemEffects.set(newIdx, entry)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Splice the cache\n\t\t\t\tcache.splice(\n\t\t\t\t\tdiff.indexA,\n\t\t\t\t\tdiff.sliceA.length,\n\t\t\t\t\t...new Array(diff.sliceB.length).fill(undefined)\n\t\t\t\t)\n\n\t\t\t\t// Make holes for lazy computation\n\t\t\t\tfor (let i = diff.indexA; i < diff.indexA + diff.sliceB.length; i++) delete cache[i]\n\t\t\t}\n\n\t\t\tconst invalidates = new Set<PropertyKey>([keysOf])\n\t\t\tif (input.length !== newInput.length) invalidates.add('length')\n\t\t\tfor (const diff of diffs) {\n\t\t\t\tconst max = Math.max(diff.sliceA.length, diff.sliceB.length)\n\t\t\t\tfor (let i = 0; i < max; i++) invalidates.add(String(diff.indexA + i))\n\t\t\t}\n\t\t\ttouched(cache, { type: 'bunch', method: 'morph-input' }, invalidates)\n\t\t}\n\n\t\tinput = newInput\n\t})\n\n\treturn link(proxy, (reason) => {\n\t\tstopMain(reason)\n\t\tfor (const entry of itemEffects.values()) entry.stop(reason)\n\t\titemEffects.clear()\n\t})\n}\n\n/**\n * Reactively maps a `Map` source through `fn`, producing a reactive output Map.\n *\n * Each key gets its own isolated effect so that value changes for one key only recompute\n * that key's projection. Key additions and removals are tracked via `keysOf` dependency.\n *\n * @param source - A reactive Map\n * @param fn - Mapping function applied to each value\n * @param options - Optional purity hints to skip per-key effects\n * @returns A reactive Map with a `[cleanup]` method to dispose all effects\n */\nexport function morphMap<K, V, O>(\n\tsource: Map<K, V>,\n\tfn: (arg: V, key: K, access?: EffectAccess) => O,\n\toptions?: MorphOptions<V>\n): Map<K, O> {\n\tif (!isReactive(source) && options?.pure === true) {\n\t\tconst res = new Map<K, O>()\n\t\tfor (const [k, v] of source) res.set(k, fn(v, k))\n\t\treturn res as any\n\t}\n\n\tlet track!: GetterWrapper\n\tconst itemEffects = new Map<any, ScopedCallback>()\n\tconst cache = tag(`morph:${fn.name || 'anonymous'}`, new Map<K, O>())\n\tObject.defineProperty(cache, 'constructor', { value: Object, enumerable: false })\n\n\tfunction stopItem(key: any) {\n\t\tconst stop = itemEffects.get(key)\n\t\tif (stop) {\n\t\t\tconst activeEffect = getActiveEffect()\n\t\t\tlet chain: CleanupReason | undefined\n\t\t\tif (activeEffect) {\n\t\t\t\tconst node = getEffectNode(activeEffect)\n\t\t\t\tchain = node.currentReason\n\t\t\t}\n\t\t\tstop({ type: 'stopped', chain })\n\t\t\titemEffects.delete(key)\n\t\t}\n\t}\n\n\tfunction computeItem(key: any, val: any) {\n\t\tconst isPure =\n\t\t\toptions?.pure === true || (typeof options?.pure === 'function' && options.pure(val))\n\t\tif (isPure) {\n\t\t\tcache.set(\n\t\t\t\tkey,\n\t\t\t\ttrack(() => fn(val, key))\n\t\t\t)\n\t\t} else {\n\t\t\tconst stop = track(() =>\n\t\t\t\teffect.opaque`morph:${fn.name}:${key}`((access) => {\n\t\t\t\t\tconst next = source.get(key)\n\t\t\t\t\tif (next === undefined && !source.has(key)) return\n\t\t\t\t\tcache.set(key, fn(next as V, key, access))\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\tcache.delete(key)\n\t\t\t\t\t\ttouched1(cache, { type: 'invalidate', prop: 'morph' }, String(key))\n\t\t\t\t\t\tconst activeEffect = getActiveEffect()\n\t\t\t\t\t\tlet chain: CleanupReason | undefined\n\t\t\t\t\t\tif (activeEffect) {\n\t\t\t\t\t\t\tconst node = getEffectNode(activeEffect)\n\t\t\t\t\t\t\tchain = node.currentReason\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstop?.({\n\t\t\t\t\t\t\ttype: 'invalidate',\n\t\t\t\t\t\t\tcause: chainExternalReason(reason ?? { type: 'stopped', chain })!,\n\t\t\t\t\t\t\tchain: chainExternalReason(chain),\n\t\t\t\t\t\t})\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t)\n\t\t\titemEffects.set(key, stop)\n\t\t}\n\t}\n\n\tconst proxy = reactive(cache, {\n\t\tget(cache, prop) {\n\t\t\tif (prop === 'get')\n\t\t\t\treturn (key: any) => {\n\t\t\t\t\tif (!cache.has(key) && source.has(key)) computeItem(key, source.get(key))\n\t\t\t\t\treturn cache.get(key)\n\t\t\t\t}\n\t\t\tif (prop === 'has')\n\t\t\t\treturn (key: any) => {\n\t\t\t\t\treturn source.has(key)\n\t\t\t\t}\n\t\t\tif (prop === 'keys')\n\t\t\t\treturn () => {\n\t\t\t\t\treturn source.keys()\n\t\t\t\t}\n\t\t\tif (prop === 'values')\n\t\t\t\treturn function* () {\n\t\t\t\t\tfor (const key of source.keys()) {\n\t\t\t\t\t\tyield proxy.get(key)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tif (prop === 'entries')\n\t\t\t\treturn function* () {\n\t\t\t\t\tfor (const key of source.keys()) {\n\t\t\t\t\t\tyield [key, proxy.get(key)]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tif (prop === Symbol.iterator)\n\t\t\t\treturn function* () {\n\t\t\t\t\tfor (const key of source.keys()) {\n\t\t\t\t\t\tyield [key, proxy.get(key)]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\treturn (cache as any)[prop]\n\t\t},\n\t}) as any\n\n\tlet stateSnapshot: State = getState(source)\n\tconst stopMain = effect`morph:${fn.name}`(({ ascend }) => {\n\t\ttrack = ascend\n\t\tdependant(source, keysOf)\n\t\twhile ('evolution' in stateSnapshot) {\n\t\t\tconst { evolution } = stateSnapshot\n\t\t\tstateSnapshot = stateSnapshot.next\n\t\t\tif (evolution.type === 'add') {\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t} else if (evolution.type === 'del') {\n\t\t\t\tstopItem(evolution.prop)\n\t\t\t\tcache.delete(evolution.prop)\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t}\n\t\t}\n\t})\n\n\treturn link(proxy, (reason) => {\n\t\tstopMain(reason)\n\t\tfor (const stop of itemEffects.values()) stop(reason)\n\t\titemEffects.clear()\n\t})\n}\n\n/**\n * Reactively maps a record/object source through `fn`, producing a reactive output record.\n *\n * Each key gets its own isolated effect so that value changes for one key only recompute\n * that key's projection. Key additions and removals are tracked automatically.\n *\n * @param source - A reactive record\n * @param fn - Mapping function applied to each value\n * @param options - Optional purity hints to skip per-key effects\n * @returns A reactive record with a `[cleanup]` method to dispose all effects\n */\nexport function morphRecord<S extends Record<PropertyKey, any>, O>(\n\tsource: S,\n\tfn: (arg: S[keyof S], key: keyof S, access?: EffectAccess) => O,\n\toptions?: MorphOptions<S[keyof S]>\n): { [K in keyof S]: O } {\n\tif (!isReactive(source) && options?.pure === true) {\n\t\tconst res = {} as any\n\t\tfor (const k of Object.keys(source)) res[k] = fn(source[k], k)\n\t\treturn res\n\t}\n\n\tlet track!: GetterWrapper\n\tconst itemEffects = new Map<any, ScopedCallback>()\n\tconst cache = {} as any\n\n\tfunction stopItem(key: any) {\n\t\tconst stop = itemEffects.get(key)\n\t\tif (stop) {\n\t\t\tconst activeEffect = getActiveEffect()\n\t\t\tlet chain: CleanupReason | undefined\n\t\t\tif (activeEffect) {\n\t\t\t\tconst node = getEffectNode(activeEffect)\n\t\t\t\tchain = node.currentReason\n\t\t\t}\n\t\t\tstop({ type: 'stopped', chain })\n\t\t\titemEffects.delete(key)\n\t\t}\n\t}\n\n\tfunction computeItem(key: any, val: any) {\n\t\tconst isPure =\n\t\t\toptions?.pure === true || (typeof options?.pure === 'function' && options.pure(val))\n\t\tif (isPure) {\n\t\t\tcache[key] = track(() => fn(val, key))\n\t\t} else {\n\t\t\tconst stop = track(() =>\n\t\t\t\teffect.opaque`morph:${fn.name}:${key}`((access) => {\n\t\t\t\t\tcache[key] = fn(source[key], key, access)\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\tdelete cache[key]\n\t\t\t\t\t\ttouched1(cache, { type: 'invalidate', prop: 'morph' }, String(key))\n\t\t\t\t\t\tconst activeEffect = getActiveEffect()\n\t\t\t\t\t\tlet chain: CleanupReason | undefined\n\t\t\t\t\t\tif (activeEffect) {\n\t\t\t\t\t\t\tconst node = getEffectNode(activeEffect)\n\t\t\t\t\t\t\tchain = node.currentReason\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstop?.({\n\t\t\t\t\t\t\ttype: 'invalidate',\n\t\t\t\t\t\t\tcause: chainExternalReason(reason ?? { type: 'stopped', chain })!,\n\t\t\t\t\t\t\tchain: chainExternalReason(chain),\n\t\t\t\t\t\t})\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t)\n\t\t\titemEffects.set(key, stop)\n\t\t}\n\t}\n\tfunction get(prop: PropertyKey) {\n\t\tif (!(prop in cache) && prop in source) computeItem(prop, source[prop])\n\t\treturn cache[prop]\n\t}\n\tconst proxy = reactive(cache, {\n\t\tget(_, prop) {\n\t\t\treturn get(prop)\n\t\t},\n\t\thas(_, prop) {\n\t\t\treturn prop in source\n\t\t},\n\t\townKeys() {\n\t\t\treturn Reflect.ownKeys(source)\n\t\t},\n\t\tgetOwnPropertyDescriptor(_cache, prop) {\n\t\t\tif (prop in source) return { configurable: true, enumerable: true, get: () => get(prop) }\n\t\t},\n\t})\n\n\tlet stateSnapshot: State = getState(source)\n\tconst stopMain = effect`morph:${fn.name}`(({ ascend }) => {\n\t\ttrack = ascend\n\t\t// Track only structural changes on source\n\t\tdependant(source, keysOf)\n\t\twhile ('evolution' in stateSnapshot) {\n\t\t\tconst { evolution } = stateSnapshot\n\t\t\tstateSnapshot = stateSnapshot.next\n\t\t\tif (evolution.type === 'add') {\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t} else if (evolution.type === 'del') {\n\t\t\t\tstopItem(evolution.prop)\n\t\t\t\tdelete cache[evolution.prop]\n\t\t\t\ttouched1(cache, evolution, evolution.prop)\n\t\t\t}\n\t\t}\n\t})\n\n\treturn link(proxy, (reason) => {\n\t\tstopMain(reason)\n\t\tfor (const stop of itemEffects.values()) stop(reason)\n\t\titemEffects.clear()\n\t})\n}\n\n/**\n * Unified reactive collection mapper. Dispatches to `morphArray`, `morphMap`, or `morphRecord`\n * based on the source type. Access `morph.pure(source, fn)` for the `{ pure: true }` shorthand.\n *\n * @see morphArray\n * @see morphMap\n * @see morphRecord\n */\nexport type Morph = {\n\t<I, O>(\n\t\tsource: readonly I[] | (() => readonly I[]),\n\t\tfn: (arg: I, access?: EffectAccess) => O,\n\t\toptions?: MorphOptions<I>\n\t): readonly O[]\n\n\t<K, V, O>(\n\t\tsource: Map<K, V>,\n\t\tfn: (arg: V, key: K, access?: EffectAccess) => O,\n\t\toptions?: MorphOptions<V>\n\t): Map<K, O>\n\n\t<S extends Record<PropertyKey, any>, O>(\n\t\tsource: S,\n\t\tfn: (arg: S[keyof S], key: keyof S, access?: EffectAccess) => O,\n\t\toptions?: MorphOptions<S[keyof S]>\n\t): { [K in keyof S]: O }\n\n\t(strings: TemplateStringsArray, ...values: readonly unknown[]): Morph\n\tpure: Morph\n}\n\n/**\n * Reactively maps a collection (array, Map, or record) through a per-entry function.\n *\n * Each entry in the source gets its own reactive context — when only one entry's dependencies\n * change, only that entry's projection recomputes. Structural changes (additions, removals,\n * reorders) are detected via diffing and applied surgically.\n *\n * Use `morph.pure(source, fn)` when `fn` has no reactive reads (skips per-item effects).\n *\n * @example\n * ```ts\n * const users = reactive([{ name: 'John' }, { name: 'Jane' }])\n * const names = morph(users, u => u.name.toUpperCase())\n * // names[0] = 'JOHN', names[1] = 'JANE'\n * // Changing users[0].name only recomputes names[0]\n * ```\n */\nexport const morph = captioned(\n\tflavored(\n\t\tfunction morph(source: any, fn: any, options?: any): any {\n\t\t\tif (Array.isArray(source) || typeof source === 'function')\n\t\t\t\treturn morphArray(source, fn, options)\n\t\t\tif (source instanceof Map) return morphMap(source, fn, options)\n\t\t\treturn morphRecord(source, fn, options)\n\t\t},\n\t\t{\n\t\t\tget pure() {\n\t\t\t\treturn (source: any, fn: any, _opt: unknown) => this(source, fn, { pure: true })\n\t\t\t},\n\t\t}\n\t),\n\t{\n\t\tname: 'morph',\n\t\tcallbackIndex: 1,\n\t\twarn: (message) => options.warn(`[reactive] ${message}`),\n\t}\n) as Morph\n","import {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectsWithDeepWatchers,\n\tregisterDeepWatcher,\n} from './deep-watch-state'\nimport { effect, untracked } from './effects'\nimport { isNonReactive } from './non-reactive'\nimport { reactive } from './proxy'\nimport { markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport { type EffectCleanup, type EffectTrigger, options, unwrap } from './types'\n\n/**\n * Deep watch an object and all its nested properties\n * @param target - The object to watch deeply\n * @param callback - The callback to call when any nested property changes\n * @param options - Options for the deep watch\n * @returns A cleanup function to stop watching\n */\n/**\n * Sets up deep watching for an object, tracking all nested property changes\n * @param target - The object to watch\n * @param callback - The callback to call when changes occur\n * @param options - Options for deep watching\n * @returns A cleanup function to stop deep watching\n */\nexport function deepWatch<T extends object>(\n\ttarget: T,\n\tcallback: (value: T) => void,\n\t{ immediate = false } = {}\n): EffectCleanup | undefined {\n\tif (target === null || target === undefined) return undefined\n\tif (typeof target !== 'object') throw new Error('Target of deep watching must be an object')\n\t// Create a wrapper callback that matches EffectTrigger signature\n\tconst wrappedCallback: EffectTrigger = markWithRoot(\n\t\t(() => callback(target)) as EffectTrigger,\n\t\tcallback\n\t)\n\n\tregisterDeepWatcher()\n\n\t// Use the existing effect system to register dependencies\n\treturn effect`deepWatch`(() => {\n\t\t// Mark the target object as having deep watchers\n\t\tobjectsWithDeepWatchers.add(target)\n\n\t\t// Track which objects this effect is watching for cleanup\n\t\tlet effectObjects = effectToDeepWatchedObjects.get(wrappedCallback)\n\t\tif (!effectObjects) {\n\t\t\teffectObjects = new Set()\n\t\t\teffectToDeepWatchedObjects.set(wrappedCallback, effectObjects)\n\t\t}\n\t\teffectObjects!.add(target)\n\n\t\t// Traverse the object graph and register dependencies\n\t\t// This will re-run every time the effect runs, ensuring we catch all changes\n\t\tconst visited = new WeakSet()\n\t\tfunction traverseAndTrack(obj: any, depth = 0) {\n\t\t\t// Prevent infinite recursion and excessive depth\n\t\t\tif (!obj || visited.has(obj) || typeof obj !== 'object' || depth > options.maxDeepWatchDepth)\n\t\t\t\treturn\n\t\t\t// Do not traverse into unreactive objects\n\t\t\tif (isNonReactive(obj)) return\n\t\t\tvisited.add(obj)\n\n\t\t\t// Mark this object as having deep watchers\n\t\t\tobjectsWithDeepWatchers.add(obj)\n\t\t\teffectObjects!.add(obj)\n\n\t\t\t// Traverse all properties to register dependencies\n\t\t\t// unwrap to avoid kicking dependency\n\t\t\tfor (const key in unwrap(obj)) {\n\t\t\t\tif (Object.hasOwn(obj, key)) {\n\t\t\t\t\t// Access the property to register dependency\n\t\t\t\t\tconst value = (obj as any)[key]\n\t\t\t\t\t// Make the value reactive if it's an object\n\t\t\t\t\tconst reactiveValue =\n\t\t\t\t\t\ttypeof value === 'object' && value !== null ? reactive(value) : value\n\t\t\t\t\ttraverseAndTrack(reactiveValue, depth + 1)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Also handle array indices and length\n\t\t\t// Handle arrays and collections using iterators to ensure proxy tracking is triggered\n\t\t\tif (typeof obj[Symbol.iterator] === 'function') {\n\t\t\t\t// Access the iterator to track additions/removals/collection changes\n\t\t\t\tfor (const value of obj) {\n\t\t\t\t\t// Make the value reactive if it's an object\n\t\t\t\t\tconst reactiveValue =\n\t\t\t\t\t\ttypeof value === 'object' && value !== null ? reactive(value) : value\n\t\t\t\t\ttraverseAndTrack(reactiveValue, depth + 1)\n\t\t\t\t}\n\n\t\t\t\t// Explicitly depend on length so array mutations changing count trigger re-evaluation\n\t\t\t\tif ('length' in obj) {\n\t\t\t\t\tdependant(obj, 'length')\n\t\t\t\t}\n\n\t\t\t\t// For Maps, also ensure we track values explicitly if the iterator yields entries\n\t\t\t\tif (obj instanceof Map) {\n\t\t\t\t\tfor (const value of obj.values()) {\n\t\t\t\t\t\tconst reactiveValue =\n\t\t\t\t\t\t\ttypeof value === 'object' && value !== null ? reactive(value) : value\n\t\t\t\t\t\ttraverseAndTrack(reactiveValue, depth + 1)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Note: WeakSet and WeakMap cannot be iterated, so we can't deep watch their contents\n\t\t\t// They will only trigger when the collection itself is replaced\n\t\t}\n\n\t\t// Traverse the target object to register all dependencies\n\t\t// This will register dependencies on all current properties and array elements\n\t\ttraverseAndTrack(target)\n\n\t\t// Only call the callback if immediate is true or if it's not the first run\n\t\tif (immediate) {\n\t\t\tuntracked`deepWatch:callback`(() => callback(target))\n\t\t}\n\t\timmediate = true\n\n\t\t// Return a cleanup function that properly removes deep watcher tracking\n\t\treturn () => {\n\t\t\t// Get the objects this effect was watching\n\t\t\tconst effectObjects = effectToDeepWatchedObjects.get(wrappedCallback)\n\t\t\tif (effectObjects) {\n\t\t\t\t// Remove deep watcher tracking from all objects this effect was watching\n\t\t\t\tfor (const obj of effectObjects) {\n\t\t\t\t\t// Check if this object still has other deep watchers\n\t\t\t\t\tconst watchers = deepWatchers.get(obj)\n\t\t\t\t\tif (watchers) {\n\t\t\t\t\t\t// Remove this effect's callback from the watchers\n\t\t\t\t\t\twatchers.delete(wrappedCallback)\n\n\t\t\t\t\t\t// If no more watchers, remove the object from deep watchers tracking\n\t\t\t\t\t\tif (watchers.size === 0) {\n\t\t\t\t\t\t\tdeepWatchers.delete(obj)\n\t\t\t\t\t\t\tobjectsWithDeepWatchers.delete(obj)\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// No watchers found, remove from deep watchers tracking\n\t\t\t\t\t\tobjectsWithDeepWatchers.delete(obj)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Clean up the tracking data\n\t\t\t\teffectToDeepWatchedObjects.delete(wrappedCallback)\n\t\t\t}\n\t\t}\n\t})\n}\n","import { decorator } from '../decorator'\nimport { flavored } from '../flavored'\nimport { deepCompare, named } from '../utils'\nimport { touched1 } from './change'\nimport { chainExternalReason, getActiveEffect } from './effect-context'\nimport { effect, root, untracked } from './effects'\nimport {\n\tgetEffectNode,\n\tgetRoot,\n\tmarkWithRoot,\n\ttype RootMarkedFunction,\n\trootFunctionSymbol,\n} from './registry'\nimport { dependant } from './tracking'\nimport { type CleanupReason, optionCall, options, proxyToObject } from './types'\n\nexport type MemoizableArgument = object | any[] | ((...args: any[]) => any)\nexport type Memoizable = ((...args: MemoizableArgument[]) => unknown) | Record<string, any>\n\ntype MemoCacheTree<Result> = {\n\tresult?: Result\n\tcleanup?: (reason?: CleanupReason) => void\n\tbranches?: WeakMap<MemoizableArgument, MemoCacheTree<Result>>\n}\n\nconst memoizedRegistry = new WeakMap<any, Memoizable>()\nconst wrapperRegistry = new WeakMap<Function, (that: object) => unknown>()\n\nfunction getBranch<Result>(\n\ttree: MemoCacheTree<Result>,\n\tkey: MemoizableArgument\n): MemoCacheTree<Result> {\n\ttree.branches ??= new WeakMap()\n\tlet branch = tree.branches.get(key)\n\tif (!branch) {\n\t\tbranch = {}\n\t\ttree.branches.set(key, branch)\n\t}\n\treturn branch\n}\n\nfunction memoizeFunction<Result, Args extends MemoizableArgument[]>(\n\tfn: (...args: Args) => Result,\n\topts?: {\n\t\tlenient?: boolean\n\t}\n): (...args: Args) => Result {\n\tconst fnRoot = getRoot(fn)\n\tconst existing = memoizedRegistry.get(fnRoot)\n\tif (existing) return existing as (...args: Args) => Result\n\n\tconst cacheRoot: MemoCacheTree<Result> = {}\n\tconst memoized = markWithRoot(function memoized(this: unknown, ...args: Args): Result {\n\t\tif (args.some((arg) => !(arg && ['object', 'symbol', 'function'].includes(typeof arg)))) {\n\t\t\tif (opts?.lenient) return fn.apply(this, args)\n\t\t\tthrow new Error('memoize expects non-null object arguments')\n\t\t}\n\n\t\tlet node: MemoCacheTree<Result> = cacheRoot\n\t\t// Note: decorators add `this` as first argument\n\t\tfor (const arg of args) {\n\t\t\tnode = getBranch(node, arg)\n\t\t}\n\n\t\tdependant(node, 'memoize')\n\t\tif ('result' in node) {\n\t\t\tif (options.onMemoizationDiscrepancy) {\n\t\t\t\tconst wasVerification = options.isVerificationRun\n\t\t\t\toptions.isVerificationRun = true\n\t\t\t\ttry {\n\t\t\t\t\tconst fresh = untracked`memoize:verify-calculation`(() => fn.apply(this, args))\n\t\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\t\toptionCall('onMemoizationDiscrepancy', node.result, fresh, fn, args, 'calculation')\n\t\t\t\t\t}\n\t\t\t\t} finally {\n\t\t\t\t\toptions.isVerificationRun = wasVerification\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn node.result!\n\t\t}\n\n\t\t// Create memoize internal effect to track dependencies and invalidate cache\n\t\t// Use untracked to prevent the effect creation from being affected by parent effects\n\t\tnode.cleanup = root`memoize:root`(() =>\n\t\t\teffect`memoize`(\n\t\t\t\t() => {\n\t\t\t\t\t// Execute the function and track its dependencies\n\t\t\t\t\t// The function execution will automatically track dependencies on reactive objects\n\t\t\t\t\tnode.result = fn.apply(this, args)\n\t\t\t\t\treturn (reason) => {\n\t\t\t\t\t\t// When dependencies change, clear the cache and notify consumers\n\t\t\t\t\t\tdelete node.result\n\t\t\t\t\t\ttouched1(node, { type: 'invalidate', prop: args }, 'memoize')\n\t\t\t\t\t\t// Lazy memoization: stop the effect so it doesn't re-run immediately.\n\t\t\t\t\t\t// It will be re-created on next access.\n\t\t\t\t\t\tif (node.cleanup) {\n\t\t\t\t\t\t\tconst activeEffect = getActiveEffect()\n\t\t\t\t\t\t\tlet chain: CleanupReason | undefined\n\t\t\t\t\t\t\tif (activeEffect) {\n\t\t\t\t\t\t\t\tconst effectNode = getEffectNode(activeEffect)\n\t\t\t\t\t\t\t\tchain = effectNode.currentReason\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tnode.cleanup({\n\t\t\t\t\t\t\t\ttype: 'invalidate',\n\t\t\t\t\t\t\t\tcause: chainExternalReason(reason ?? { type: 'stopped', chain })!,\n\t\t\t\t\t\t\t\tchain: chainExternalReason(chain),\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\tnode.cleanup = undefined\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t{ opaque: true }\n\t\t\t)\n\t\t)\n\n\t\tif (options.onMemoizationDiscrepancy) {\n\t\t\tconst wasVerification = options.isVerificationRun\n\t\t\toptions.isVerificationRun = true\n\t\t\ttry {\n\t\t\t\tconst fresh = untracked`memoize:verify-comparison`(() => fn.apply(this, args))\n\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\toptionCall('onMemoizationDiscrepancy', node.result, fresh, fn, args, 'comparison')\n\t\t\t\t}\n\t\t\t} finally {\n\t\t\t\toptions.isVerificationRun = wasVerification\n\t\t\t}\n\t\t}\n\n\t\treturn node.result!\n\t}, fn)\n\n\tmemoizedRegistry.set(fnRoot, memoized)\n\tmemoizedRegistry.set(memoized, memoized)\n\treturn memoized as (...args: Args) => Result\n}\n\nfunction memoizeObject<T extends Record<string, any>>(target: T, opts?: { lenient?: boolean }): T {\n\tconst existing = memoizedRegistry.get(target)\n\tif (existing) return existing as T\n\n\tconst proxy = new Proxy(target, {\n\t\tget(source, prop, receiver) {\n\t\t\t// 1. Walk prototype chain to find descriptor\n\t\t\tlet current = source\n\t\t\tlet desc: PropertyDescriptor | undefined\n\t\t\twhile (current) {\n\t\t\t\tdesc = Object.getOwnPropertyDescriptor(current, prop)\n\t\t\t\tif (desc) break\n\t\t\t\tcurrent = Object.getPrototypeOf(current)\n\t\t\t}\n\t\t\tif (!desc) return Reflect.get(source, prop, receiver)\n\t\t\t// 2. If getter, memoize\n\t\t\tif (desc.get) {\n\t\t\t\tconst originalGetter = desc.get\n\t\t\t\tlet wrapper = wrapperRegistry.get(originalGetter)\n\t\t\t\tif (!wrapper) {\n\t\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\t\tnamed(\n\t\t\t\t\t\t\t`${String(source?.constructor?.name ?? 'Object')}.${String(prop)}`,\n\t\t\t\t\t\t\t(that: any) => {\n\t\t\t\t\t\t\t\treturn originalGetter.call(that)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpropertyKey: prop,\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t\tconst origRoot = (originalGetter as RootMarkedFunction)[rootFunctionSymbol]\n\t\t\t\t\tif (origRoot) (wrapper as RootMarkedFunction)[rootFunctionSymbol] = origRoot\n\t\t\t\t\twrapperRegistry.set(originalGetter, wrapper)\n\t\t\t\t}\n\t\t\t\tconst memoized = memoizeFunction(wrapper, opts)\n\t\t\t\treturn memoized(receiver)\n\t\t\t}\n\n\t\t\t// 3. Otherwise forward\n\t\t\treturn Reflect.get(source, prop, receiver)\n\t\t},\n\t\t// Forward set to the target (source) to ensure it acts as the receiver for reactivity notifications\n\t\tset(source, prop, value, _receiver) {\n\t\t\t// By strictly passing `source` as receiver, we ensure that if `source` is a reactive proxy,\n\t\t\t// it recognizes itself and triggers change notifications.\n\t\t\treturn Reflect.set(source, prop, value, source)\n\t\t},\n\t})\n\n\tproxyToObject.set(proxy, target)\n\tmemoizedRegistry.set(target, proxy)\n\treturn proxy\n}\n\n/**\n * Decorator and function wrapper for memoizing computed values based on reactive dependencies.\n *\n * When used as a decorator on getters or methods, it caches the result and automatically\n * invalidates the cache when reactive dependencies change.\n *\n * When used as a function wrapper, it memoizes based on object arguments (WeakMap-based cache).\n *\n * @example\n * ```typescript\n * class User {\n *   @memoize\n *   get fullName() {\n *     return `${this.firstName} ${this.lastName}`\n *   }\n * }\n *\n * // Or as a function wrapper\n * const expensive = memoize((obj: SomeObject) => {\n *   return heavyComputation(obj)\n * })\n * ```\n */\nfunction makeMemoizeDecorator(memoizeOpts?: { lenient?: boolean }) {\n\treturn decorator({\n\t\tgetter(original, target, propertyKey) {\n\t\t\treturn function (this: any) {\n\t\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\t\tif (!wrapper) {\n\t\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\t\tnamed(\n\t\t\t\t\t\t\t`${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(propertyKey)}`,\n\t\t\t\t\t\t\t(that: object) => {\n\t\t\t\t\t\t\t\treturn original.call(that)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\t\tpropertyKey,\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t\tconst origRoot = (original as RootMarkedFunction)[rootFunctionSymbol]\n\t\t\t\t\tif (origRoot) (wrapper as RootMarkedFunction)[rootFunctionSymbol] = origRoot\n\t\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t\t}\n\t\t\t\tconst memoized = memoizeFunction(wrapper as any, memoizeOpts)\n\t\t\t\treturn memoized(this)\n\t\t\t}\n\t\t},\n\t\tmethod(original, target, name) {\n\t\t\treturn function (this: any, ...args: object[]) {\n\t\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\t\tif (!wrapper) {\n\t\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\t\tnamed(\n\t\t\t\t\t\t\t`${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(name)}`,\n\t\t\t\t\t\t\t(that: object, ...args: object[]) => {\n\t\t\t\t\t\t\t\treturn original.call(that, ...args)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t),\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\t\tpropertyKey: name,\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t\tconst origRoot = (original as RootMarkedFunction)[rootFunctionSymbol]\n\t\t\t\t\tif (origRoot) (wrapper as RootMarkedFunction)[rootFunctionSymbol] = origRoot\n\t\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t\t}\n\t\t\t\tconst memoized = memoizeFunction(wrapper as any, memoizeOpts) as (\n\t\t\t\t\t...args: object[]\n\t\t\t\t) => unknown\n\t\t\t\treturn memoized(this, ...args)\n\t\t\t}\n\t\t},\n\t\tdefault: <T extends Memoizable>(target: T): T =>\n\t\t\ttypeof target === 'object'\n\t\t\t\t? (memoizeObject(target, memoizeOpts) as T)\n\t\t\t\t: (memoizeFunction(target, memoizeOpts) as T),\n\t})\n}\n\nexport const memoize: ReturnType<typeof makeMemoizeDecorator> & {\n\treadonly lenient: ReturnType<typeof makeMemoizeDecorator>\n} = flavored(makeMemoizeDecorator(), {\n\tget lenient() {\n\t\treturn makeMemoizeDecorator({ lenient: true })\n\t},\n})\n","import { decorator, type GenericClassDecorator } from '../decorator'\nimport { captioned, flavored, flavorOptions } from '../flavored'\nimport { deepWatch } from './deep-watch'\nimport { effectHistory, link } from './effect-context'\nimport { captured, effect, untracked } from './effects'\nimport { addUnreactiveProps, isNonReactive } from './non-reactive'\nimport { reactive } from './proxy'\nimport { markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport {\n\ttype EffectAccess,\n\ttype EffectCleanup,\n\toptions,\n\ttype ScopedCallback,\n\tunreactiveProperties,\n\tunwrap,\n} from './types'\n\n//#region watch\n\nconst unsetYet = Symbol('unset-yet')\n/**\n * Options for the watch function\n */\nexport interface WatchOptions {\n\t/** Whether to call the callback immediately */\n\timmediate?: boolean\n\t/** Whether to watch nested properties */\n\tdeep?: boolean\n}\n\n/**\n * Watches a reactive value and calls a callback when it changes\n */\nexport interface Watch {\n\t<T>(\n\t\tvalue: (dep: EffectAccess) => T,\n\t\tchanged: (value: T, oldValue?: T) => void,\n\t\toptions?: Omit<WatchOptions, 'deep'> & { deep?: false }\n\t): EffectCleanup\n\t/**\n\t * Watches a reactive value with deep watching enabled\n\t */\n\t<T extends object | any[]>(\n\t\tvalue: (dep: EffectAccess) => T,\n\t\tchanged: (value: T, oldValue?: T) => void,\n\t\toptions?: Omit<WatchOptions, 'deep'> & { deep: true }\n\t): EffectCleanup\n\t/**\n\t * Watches a reactive object directly\n\t */\n\t<T extends object | any[]>(\n\t\tvalue: T,\n\t\tchanged: (value: T) => void,\n\t\toptions?: WatchOptions\n\t): EffectCleanup\n\t(strings: TemplateStringsArray, ...values: readonly unknown[]): Watch\n\n\t/** Deep watch flavor */\n\tget deep(): Watch\n\t/** Immediate watch flavor */\n\tget immediate(): Watch\n}\n\nexport const watch = captioned(\n\tflavored(\n\t\tfunction watch(\n\t\t\tvalue: any, //object | ((dep: DependencyAccess) => object),\n\t\t\tchanged: (value?: object, oldValue?: object) => void,\n\t\t\toptions: any = {}\n\t\t) {\n\t\t\treturn typeof value === 'function'\n\t\t\t\t? watchCallBack(value, changed, options)\n\t\t\t\t: typeof value === 'object' && value !== null\n\t\t\t\t\t? watchObject(value, changed, options)\n\t\t\t\t\t: (() => {\n\t\t\t\t\t\t\tthrow new Error('watch: value must be a function or an object')\n\t\t\t\t\t\t})()\n\t\t},\n\t\t{\n\t\t\tget deep() {\n\t\t\t\treturn flavorOptions(this, { deep: true })\n\t\t\t},\n\t\t\tget immediate() {\n\t\t\t\treturn flavorOptions(this, { immediate: true })\n\t\t\t},\n\t\t}\n\t),\n\t{\n\t\tname: 'watch',\n\t\twarn: (message) => options.warn(`[reactive] ${message}`),\n\t}\n) as Watch\n\nfunction watchObject(\n\tvalue: object,\n\tchanged: (value: object) => void,\n\t{ immediate = false, deep = false } = {}\n): EffectCleanup {\n\tif (deep) return deepWatch(value, changed, { immediate })!\n\treturn effect`watch:object`(() => {\n\t\tdependant(value)\n\t\tif (immediate) changed(value)\n\t\timmediate = true\n\t})\n}\n\nfunction watchCallBack<T>(\n\tvalue: (dep: EffectAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\t{ immediate = false, deep = false } = {}\n): EffectCleanup {\n\tlet oldValue: T | typeof unsetYet = unsetYet\n\tlet deepCleanup: EffectCleanup | undefined\n\tconst cbCleanup = effect`watch:callback`(\n\t\tmarkWithRoot((access) => {\n\t\t\tconst newValue = value(access)\n\t\t\tif (oldValue !== newValue) {\n\t\t\t\tconst old = oldValue\n\t\t\t\tif (old === unsetYet) {\n\t\t\t\t\tif (immediate) untracked`watch:changed`(() => changed(newValue))\n\t\t\t\t} else untracked`watch:changed`(() => changed(newValue, old as T))\n\t\t\t}\n\t\t\toldValue = newValue\n\t\t\tif (deep) {\n\t\t\t\tif (deepCleanup) deepCleanup()\n\t\t\t\tdeepCleanup = deepWatch(newValue as object, (value) => changed(value as T, value as T))\n\t\t\t}\n\t\t}, value)\n\t)\n\treturn (() => {\n\t\tcbCleanup()\n\t\tif (deepCleanup) deepCleanup()\n\t}) as EffectCleanup\n}\n\n//#endregion\n\n//#region when\n\n/**\n * Returns a promise that resolves when the predicate returns a truthy value.\n * The predicate is evaluated reactively — it re-runs whenever its dependencies change.\n * @param predicate - Reactive function that returns a value; resolves when truthy\n * @param timeout - Optional timeout in milliseconds — rejects if condition is not met within this duration\n * @returns Promise that resolves with the first truthy return value\n */\nexport function when<T>(predicate: (dep: EffectAccess) => T, timeout?: number): Promise<T> {\n\treturn new Promise<T>((resolve, reject) => {\n\t\tlet timer: ReturnType<typeof setTimeout> | undefined\n\t\tconst stop = effect`watch:when`((access) => {\n\t\t\ttry {\n\t\t\t\tconst value = predicate(access)\n\t\t\t\tif (value) {\n\t\t\t\t\tif (timer !== undefined) clearTimeout(timer)\n\t\t\t\t\ttimer = undefined\n\t\t\t\t\tqueueMicrotask(() => stop())\n\t\t\t\t\tresolve(value)\n\t\t\t\t}\n\t\t\t} catch (error) {\n\t\t\t\tif (timer !== undefined) clearTimeout(timer)\n\t\t\t\ttimer = undefined\n\t\t\t\treject(error)\n\t\t\t}\n\t\t})\n\t\tif (timeout !== undefined) {\n\t\t\ttimer = setTimeout(() => {\n\t\t\t\tstop()\n\t\t\t\ttimer = undefined\n\t\t\t\treject(new Error(`when: timed out after ${timeout}ms`))\n\t\t\t}, timeout)\n\t\t}\n\t})\n}\n\n//#endregion\n\n//#region nonReactive\n\n/**\n * Mark an object as non-reactive. This object and all its properties will never be made reactive.\n * @param obj - The object to mark as non-reactive\n */\nfunction shallowNonReactive<T>(obj: T): T {\n\tobj = unwrap(obj)\n\tif (isNonReactive(obj)) return obj\n\t;(obj as any)[unreactiveProperties] = true\n\treturn obj\n}\nfunction unreactiveApplication<T extends object>(...args: (keyof T)[]): GenericClassDecorator<T>\nfunction unreactiveApplication<T extends object>(obj: T): T\nfunction unreactiveApplication<T extends object>(\n\targ1: T | keyof T,\n\t...args: (keyof T)[]\n): GenericClassDecorator<T> | T {\n\treturn typeof arg1 === 'object'\n\t\t? shallowNonReactive(arg1)\n\t\t: (((original) => {\n\t\t\t\t// Copy the parent's unreactive properties if they exist\n\t\t\t\tconst parentMarker = (original.prototype as any)[unreactiveProperties]\n\t\t\t\t// If parent is fully unreactive, child is too\n\t\t\t\tif (parentMarker === true) {\n\t\t\t\t\t;(original.prototype as any)[unreactiveProperties] = true\n\t\t\t\t} else {\n\t\t\t\t\tconst set = new Set<PropertyKey>(parentMarker || [])\n\t\t\t\t\t// Add all arguments (including the first one)\n\t\t\t\t\tset.add(arg1)\n\t\t\t\t\tfor (const arg of args) set.add(arg)\n\t\t\t\t\taddUnreactiveProps(original.prototype, set)\n\t\t\t\t}\n\t\t\t\treturn original // Return the class\n\t\t\t}) as GenericClassDecorator<T>)\n}\n/**\n * Decorator that marks classes or properties as non-reactive\n * Prevents objects from being made reactive\n */\nexport const unreactive = decorator({\n\tclass(original) {\n\t\t// Called without arguments, mark entire class as non-reactive\n\t\t;(original.prototype as any)[unreactiveProperties] = true\n\t},\n\tdefault: unreactiveApplication,\n})\n\n//#endregion\n\n//#region resource\n\nexport function lazyInit<T extends object>(resource: T, load: ScopedCallback) {\n\tconst creation = effectHistory.active\n\tlet fresh = true\n\tconst target = resource as T & Record<PropertyKey, unknown>\n\treturn new Proxy(resource, {\n\t\t[Symbol.toStringTag]: 'LazyInit',\n\t\tget(target, prop) {\n\t\t\tif (fresh) {\n\t\t\t\tcaptured(creation, load)()\n\t\t\t\tfresh = false\n\t\t\t}\n\t\t\treturn (target as typeof target & Record<PropertyKey, unknown>)[prop]\n\t\t},\n\t} as ProxyHandler<T>)\n}\n\nexport interface Resource<T> {\n\tvalue: T | undefined\n\tloading: boolean\n\terror: any\n\tlatest: T | undefined\n\treload(): void\n\tpromise: Promise<void>\n}\n\n/**\n * Creates a reactive resource that automatically tracks async state.\n * @param fetcher - Async function that returns the value. Reactive dependencies are tracked.\n * @param options - Resource options (initialValue)\n * @returns Reactive Resource object with value, loading, error, latest properties\n */\nexport function resource<T>(\n\tfetcher: (access: EffectAccess) => Promise<T> | T,\n\toptions: { initialValue?: T } = {}\n): Resource<T> {\n\tconst resource: Partial<Resource<T>> = reactive({\n\t\tvalue: options.initialValue,\n\t\tloading: true,\n\t\terror: undefined as any,\n\t\tlatest: options.initialValue,\n\t\treload() {\n\t\t\treloadSignal.value++\n\t\t},\n\t})\n\n\tconst reloadSignal = reactive({ value: 0 })\n\t// Solve race conditions: make sure a new fast request is not overloaded by a slow old one\n\tlet counter = 0\n\n\treturn lazyInit(resource as Resource<T>, () => {\n\t\tlink(\n\t\t\tresource,\n\t\t\teffect`watch:resource`((access) => {\n\t\t\t\t// Track reload signal to enable manual reloading\n\t\t\t\tvoid reloadSignal.value\n\n\t\t\t\tconst id = ++counter\n\t\t\t\tresource.loading = true\n\t\t\t\tresource.error = undefined\n\n\t\t\t\ttry {\n\t\t\t\t\tconst result = fetcher(access)\n\n\t\t\t\t\tif (result instanceof Promise) {\n\t\t\t\t\t\tresource.promise = result\n\t\t\t\t\t\t\t.then((val) => {\n\t\t\t\t\t\t\t\tif (id === counter) {\n\t\t\t\t\t\t\t\t\tresource.value = val\n\t\t\t\t\t\t\t\t\tresource.latest = val\n\t\t\t\t\t\t\t\t\tresource.loading = false\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t.catch((err) => {\n\t\t\t\t\t\t\t\tif (id === counter) {\n\t\t\t\t\t\t\t\t\tresource.error = err\n\t\t\t\t\t\t\t\t\tresource.loading = false\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t})\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresource.promise = Promise.resolve()\n\t\t\t\t\t\tresource.value = result\n\t\t\t\t\t\tresource.latest = result\n\t\t\t\t\t\tresource.loading = false\n\t\t\t\t\t}\n\t\t\t\t} catch (err) {\n\t\t\t\t\tresource.promise = Promise.reject(err)\n\t\t\t\t\tresource.error = err\n\t\t\t\t\tresource.loading = false\n\t\t\t\t}\n\t\t\t})\n\t\t) as Resource<T>\n\t})\n}\n\n//#endregion\n","import { reactive } from './proxy'\n\n/**\n * Converts an iterator to a generator that yields reactive values\n */\nexport function* makeReactiveIterator<T>(iterator: Iterator<T>): Generator<T> {\n\tlet result = iterator.next()\n\twhile (!result.done) {\n\t\tyield reactive(result.value)\n\t\tresult = iterator.next()\n\t}\n}\n\n/**\n * Converts an iterator of key-value pairs to a generator that yields reactive key-value pairs\n */\nexport function* makeReactiveEntriesIterator<K, V>(iterator: Iterator<[K, V]>): Generator<[K, V]> {\n\tlet result = iterator.next()\n\twhile (!result.done) {\n\t\tconst [key, value] = result.value\n\t\tyield [reactive(key), reactive(value)]\n\t\tresult = iterator.next()\n\t}\n}\n","import { FoolProof } from '../utils'\nimport { touched } from './change'\nimport { atomic } from './effects'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './iterator-helpers'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\nimport { keysOf, unwrap } from './types'\n\nfunction* index(i: number, { length = true } = {}): IterableIterator<number | 'length'> {\n\tif (length) yield 'length'\n\tyield i\n}\nexport abstract class Indexer extends Array {\n\tget(i: number): any {\n\t\tdependant(this, i)\n\t\treturn reactive(this[i])\n\t}\n\t// Returns undefined intentionally: signals the proxy handler that notifications\n\t// were already dispatched via touched(), preventing double notification\n\tset(i: number, value: any) {\n\t\tconst added = i >= this.length\n\t\tthis[i] = value\n\t\ttouched(this, { type: 'set', prop: i }, index(i, { length: added }))\n\t}\n}\nconst indexLess = { get: FoolProof.get, set: FoolProof.set }\n// Fast numeric-string check: first char is a digit (0-9)\nfunction asIndex(prop: string): number {\n\tconst c = prop.charCodeAt(0)\n\tif (c < 48 || c > 57) return -1 // not 0-9\n\tconst n = +prop // coerce — faster than parseInt, handles \"0\", \"12\", etc.\n\treturn n === (n | 0) && n >= 0 ? n : -1\n}\nObject.assign(FoolProof, {\n\tget(obj: any, prop: any, receiver: any) {\n\t\tif (Array.isArray(obj) && typeof prop === 'string') {\n\t\t\tconst i = asIndex(prop)\n\t\t\tif (i >= 0) return Indexer.prototype.get.call(obj, i)\n\t\t}\n\t\treturn indexLess.get(obj, prop, receiver)\n\t},\n\tset(obj: any, prop: any, value: any, receiver: any) {\n\t\tif (Array.isArray(obj) && typeof prop === 'string') {\n\t\t\tconst i = asIndex(prop)\n\t\t\tif (i >= 0) return Indexer.prototype.set.call(obj, i, value)\n\t\t}\n\t\treturn indexLess.set(obj, prop, value, receiver)\n\t},\n})\n\nexport abstract class ReactiveArray extends Array {\n\ttoJSON() {\n\t\treturn this\n\t}\n}\n/**\n * This is a wrapper class for Array that adds reactive behavior.\n * It extends Array and overrides methods to add reactive behavior, while making sure that the internal representation is not reactive.\n */\nexport abstract class ReactiveArrayWrapper extends Array {\n\tat(index: number): any {\n\t\treturn reactive(super.at(index))\n\t}\n\n\tconcat(...items: any[]): any[] {\n\t\treturn reactive(super.concat(...items.map(unwrap)))\n\t}\n\n\tentries(): any {\n\t\tdependant(this, keysOf)\n\t\treturn makeReactiveEntriesIterator(super.entries())\n\t}\n\n\tevery<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): this is S[]\n\tevery(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): boolean\n\tevery(predicate: (value: any, index: number, array: any[]) => any, thisArg?: any): any {\n\t\treturn super.every((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\t@atomic\n\tfill(value: any, start?: number, end?: number): this {\n\t\treturn super.fill(unwrap(value), start, end) as this\n\t}\n\n\t@atomic\n\tcopyWithin(target: number, start: number, end?: number): this {\n\t\treturn super.copyWithin(target, start, end) as this\n\t}\n\n\tfilter<S>(predicate: (value: any, index: number, array: any[]) => value is S, thisArg?: any): S[]\n\tfilter(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any[]\n\tfilter(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any {\n\t\treturn reactive(super.filter((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg))\n\t}\n\n\tfind<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfind(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): any | undefined\n\tfind(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any {\n\t\treturn reactive(super.find((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg))\n\t}\n\n\tfindIndex(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn super.findIndex((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\tfindLast<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): S | undefined\n\tfindLast(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): any | undefined\n\tfindLast(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): any {\n\t\treturn reactive(\n\t\t\tsuper.findLast((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t\t)\n\t}\n\n\tfindLastIndex(\n\t\tpredicate: (value: any, index: number, array: any[]) => unknown,\n\t\tthisArg?: any\n\t): number {\n\t\treturn super.findLastIndex((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\tflat(depth?: number): any[] {\n\t\tdependant(this, keysOf)\n\t\treturn reactive(super.flat(depth))\n\t}\n\n\tflatMap(callbackfn: (value: any, index: number, array: any[]) => any, thisArg?: any): any[] {\n\t\treturn reactive(\n\t\t\tsuper.flatMap((v, i, a) => unwrap(callbackfn.call(thisArg, reactive(v), i, a)), thisArg)\n\t\t)\n\t}\n\n\tforEach(callbackfn: (value: any, index: number, array: any[]) => void, thisArg?: any): void {\n\t\tsuper.forEach((v, i, a) => {\n\t\t\tcallbackfn.call(thisArg, reactive(v), i, a)\n\t\t}, thisArg)\n\t}\n\n\tincludes(searchElement: any, fromIndex?: number): boolean {\n\t\treturn arguments.length > 1\n\t\t\t? super.includes(unwrap(searchElement), fromIndex)\n\t\t\t: super.includes(unwrap(searchElement))\n\t}\n\n\tindexOf(searchElement: any, fromIndex?: number): number {\n\t\treturn arguments.length > 1\n\t\t\t? super.indexOf(unwrap(searchElement), fromIndex)\n\t\t\t: super.indexOf(unwrap(searchElement))\n\t}\n\n\tjoin(separator?: string): string {\n\t\treturn super.join(separator)\n\t}\n\n\tkeys(): any {\n\t\tdependant(this, 'length')\n\t\treturn super.keys()\n\t}\n\n\tlastIndexOf(searchElement: any, fromIndex?: number): number {\n\t\treturn arguments.length > 1\n\t\t\t? super.lastIndexOf(unwrap(searchElement), fromIndex)\n\t\t\t: super.lastIndexOf(unwrap(searchElement))\n\t}\n\n\tmap<U>(callbackfn: (value: any, index: number, array: any[]) => U, thisArg?: any): U[] {\n\t\treturn reactive(\n\t\t\tsuper.map((v, i, a) => unwrap(callbackfn.call(thisArg, reactive(v), i, a)), thisArg)\n\t\t)\n\t}\n\n\t@atomic\n\tpop(): any {\n\t\treturn reactive(super.pop())\n\t}\n\n\t@atomic\n\tpush(...items: any[]): number {\n\t\treturn super.push(...items.map(unwrap))\n\t}\n\n\treduce(\n\t\tcallbackfn: (acc: any, value: any, index: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn reactive(\n\t\t\targuments.length > 1\n\t\t\t\t? super.reduce((acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)), initialValue)\n\t\t\t\t: super.reduce((acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)))\n\t\t)\n\t}\n\n\treduceRight(\n\t\tcallbackfn: (acc: any, value: any, index: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\treturn reactive(\n\t\t\targuments.length > 1\n\t\t\t\t? super.reduceRight(\n\t\t\t\t\t\t(acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)),\n\t\t\t\t\t\tinitialValue\n\t\t\t\t\t)\n\t\t\t\t: super.reduceRight((acc, v, i, a) => unwrap(callbackfn(acc, reactive(v), i, a)))\n\t\t)\n\t}\n\n\t@atomic\n\treverse(): any[] {\n\t\treturn reactive(super.reverse())\n\t}\n\n\t@atomic\n\tshift(): any {\n\t\treturn reactive(super.shift())\n\t}\n\n\tslice(start?: number, end?: number): any[] {\n\t\treturn reactive(super.slice(start, end))\n\t}\n\n\tsome<S>(\n\t\tpredicate: (value: any, index: number, array: any[]) => value is S,\n\t\tthisArg?: any\n\t): this is S[]\n\tsome(predicate: (value: any, index: number, array: any[]) => unknown, thisArg?: any): boolean\n\tsome(predicate: (value: any, index: number, array: any[]) => any, thisArg?: any): any {\n\t\treturn super.some((v, i, a) => predicate.call(thisArg, reactive(v), i, a), thisArg)\n\t}\n\n\t@atomic\n\tsort(compareFn?: (a: any, b: any) => number): this {\n\t\tconst wrappedCompare = compareFn\n\t\t\t? (a: any, b: any) => compareFn(reactive(a), reactive(b))\n\t\t\t: undefined\n\t\treturn super.sort(wrappedCompare) as this\n\t}\n\n\t@atomic\n\tsplice(start: number, deleteCount?: number, ...items: any[]): any {\n\t\tif (arguments.length > 2)\n\t\t\treturn reactive(super.splice(start, deleteCount!, ...items.map(unwrap)))\n\t\tif (arguments.length === 2) return reactive(super.splice(start, deleteCount!))\n\t\tif (arguments.length === 1) return reactive(super.splice(start))\n\t\treturn reactive([])\n\t}\n\n\t@atomic\n\tunshift(...items: any[]): number {\n\t\treturn super.unshift(...items.map(unwrap))\n\t}\n\n\tvalues(): any {\n\t\tdependant(this, keysOf)\n\t\treturn makeReactiveIterator(super.values())\n\t}\n\n\t[Symbol.iterator](): any {\n\t\tdependant(this, keysOf)\n\t\treturn makeReactiveIterator(super[Symbol.iterator]())\n\t}\n\n\ttoReversed(): any[] {\n\t\treturn reactive(super.toReversed())\n\t}\n\n\ttoSorted(compareFn?: (a: any, b: any) => number): any[] {\n\t\tconst wrappedCompare = compareFn\n\t\t\t? (a: any, b: any) => compareFn(reactive(a), reactive(b))\n\t\t\t: undefined\n\t\treturn reactive(super.toSorted(wrappedCompare))\n\t}\n\n\ttoSpliced(start: number, deleteCount?: number, ...items: any[]): any {\n\t\tif (arguments.length > 2)\n\t\t\treturn reactive(super.toSpliced(start, deleteCount!, ...items.map(unwrap)))\n\t\tif (arguments.length === 2) return reactive(super.toSpliced(start, deleteCount!))\n\t\tif (arguments.length === 1) return reactive(super.toSpliced(start))\n\t\treturn reactive([...this])\n\t}\n\n\twith(index: number, value: any): any[] {\n\t\treturn reactive(super.with(index, unwrap(value)))\n\t}\n}\n","import { contentRef } from '../utils'\nimport { touched, touched1 } from './change'\nimport { notifyPropertyChange } from './deep-touch'\nimport { batch } from './effects'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './iterator-helpers'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\nimport { keysOf } from './types'\n\n/**\n * Reactive wrapper around JavaScript's WeakMap class\n * Only tracks individual key operations, no size tracking (WeakMap limitation)\n */\nexport abstract class ReactiveWeakMap<K extends object, V> extends WeakMap<K, V> {\n\t// Implement WeakMap interface methods with reactivity\n\tdelete(key: K): boolean {\n\t\tconst hadKey = this.has(key)\n\t\tconst result = super.delete(key)\n\n\t\tif (hadKey) touched1(contentRef(this), { type: 'del', prop: key }, key)\n\n\t\treturn result\n\t}\n\n\tget(key: K): V | undefined {\n\t\tdependant(contentRef(this), key)\n\t\treturn reactive(super.get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(contentRef(this), key)\n\t\treturn super.has(key)\n\t}\n\n\tset(key: K, value: V): this {\n\t\tconst hadKey = this.has(key)\n\t\tconst oldValue = this.get(key)\n\t\tconst reactiveValue = reactive(value)\n\t\tthis.set(key, reactiveValue)\n\n\t\tif (!hadKey || oldValue !== reactiveValue) {\n\t\t\tnotifyPropertyChange(contentRef(this), key, oldValue, reactiveValue, hadKey)\n\t\t}\n\n\t\treturn this\n\t}\n}\n\n/**\n * Reactive wrapper around JavaScript's Map class\n * Tracks size changes, individual key operations, and collection-wide operations\n */\nexport abstract class ReactiveMap<K, V> extends Map<K, V> {\n\t// Implement Map interface methods with reactivity\n\tget size(): number {\n\t\tdependant(this, 'size') // The ReactiveMap instance still goes through proxy\n\t\treturn super.size\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this.size > 0\n\t\tsuper.clear()\n\n\t\tif (hadEntries) {\n\t\t\tconst evolution = { type: 'bunch', method: 'clear' } as const\n\t\t\t// Clear triggers all effects since all keys are affected\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t\ttouched(contentRef(this), evolution)\n\t\t\t})\n\t\t}\n\t}\n\n\tentries(): Generator<[K, V]> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveEntriesIterator(this.entries())\n\t}\n\n\tforEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tdependant(contentRef(this))\n\t\tthis.forEach(callbackfn, thisArg)\n\t}\n\n\tkeys(): MapIterator<K> {\n\t\tdependant(contentRef(this), keysOf)\n\t\treturn this.keys()\n\t}\n\n\tvalues(): Generator<V> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveIterator(this.values())\n\t}\n\n\t[Symbol.iterator](): MapIterator<[K, V]> {\n\t\tdependant(contentRef(this))\n\t\tconst it: MapIterator<[K, V]> = Map.prototype[Symbol.iterator].call(this)\n\t\tconst nativeNext = it.next.bind(it)\n\t\tit.next = () => {\n\t\t\tconst result = nativeNext()\n\t\t\tif (result.done) return result\n\t\t\tconst [key, value] = result.value\n\t\t\treturn { value: [reactive(key), reactive(value)], done: false }\n\t\t}\n\t\treturn it\n\t}\n\n\t// Implement Map methods with reactivity\n\tdelete(key: K): boolean {\n\t\tconst hadKey = this.has(key)\n\t\tconst result = super.delete(key)\n\n\t\tif (hadKey) {\n\t\t\tconst evolution = { type: 'del', prop: key } as const\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(contentRef(this), evolution, key)\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\n\t\treturn result\n\t}\n\n\tget(key: K): V | undefined {\n\t\tdependant(contentRef(this), key)\n\t\treturn reactive(super.get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(contentRef(this), key)\n\t\treturn super.has(key)\n\t}\n\n\tset(key: K, value: V): this {\n\t\tconst hadKey = this.has(key)\n\t\tconst oldValue = this.get(key)\n\t\tconst reactiveValue = reactive(value)\n\t\tsuper.set(key, reactiveValue)\n\n\t\tif (!hadKey || oldValue !== reactiveValue) {\n\t\t\tbatch(() => {\n\t\t\t\tnotifyPropertyChange(contentRef(this), key, oldValue, reactiveValue, hadKey)\n\t\t\t\t// Also notify size change for Map (WeakMap doesn't track size)\n\t\t\t\tconst evolution = { type: hadKey ? 'set' : 'add', prop: key } as const\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\n\t\treturn this\n\t}\n}\n","import { contentRef } from '../utils'\nimport { touched, touched1 } from './change'\nimport { batch } from './effects'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './iterator-helpers'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\n\n/**\n * Reactive wrapper around JavaScript's WeakSet class\n * Only tracks individual value operations, no size tracking (WeakSet limitation)\n */\nexport abstract class ReactiveWeakSet<T extends object> extends WeakSet<T> {\n\tadd(value: T): this {\n\t\tconst had = this.has(value)\n\t\tsuper.add(value)\n\t\tif (!had) {\n\t\t\t// touch the specific value and the collection view\n\t\t\ttouched1(contentRef(this), { type: 'add', prop: value }, value)\n\t\t\t// no size/allProps for WeakSet\n\t\t}\n\t\treturn this\n\t}\n\n\tdelete(value: T): boolean {\n\t\tconst had = this.has(value)\n\t\tconst res = super.delete(value)\n\t\tif (had) touched1(contentRef(this), { type: 'del', prop: value }, value)\n\t\treturn res\n\t}\n\n\thas(value: T): boolean {\n\t\tdependant(contentRef(this), value)\n\t\treturn super.has(value)\n\t}\n}\n\n/**\n * Reactive wrapper around JavaScript's Set class\n * Tracks size changes, individual value operations, and collection-wide operations\n */\nexport abstract class ReactiveSet<T> extends Set<T> {\n\tget size(): number {\n\t\t// size depends on the wrapper instance, like Map counterpart\n\t\tdependant(this, 'size')\n\t\treturn this.size\n\t}\n\n\tadd(value: T): this {\n\t\tconst had = this.has(value)\n\t\tconst reactiveValue = reactive(value)\n\t\tsuper.add(reactiveValue)\n\t\tif (!had) {\n\t\t\tconst evolution = { type: 'add', prop: reactiveValue } as const\n\t\t\t// touch for value-specific and aggregate dependencies\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(contentRef(this), evolution, reactiveValue)\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\t\treturn this\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this.size > 0\n\t\tsuper.clear()\n\t\tif (hadEntries) {\n\t\t\tconst evolution = { type: 'bunch', method: 'clear' } as const\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t\ttouched(contentRef(this), evolution)\n\t\t\t})\n\t\t}\n\t}\n\n\tdelete(value: T): boolean {\n\t\tconst had = this.has(value)\n\t\tconst res = super.delete(value)\n\t\tif (had) {\n\t\t\tconst evolution = { type: 'del', prop: value } as const\n\t\t\tbatch(() => {\n\t\t\t\ttouched1(contentRef(this), evolution, value)\n\t\t\t\ttouched1(this, evolution, 'size')\n\t\t\t})\n\t\t}\n\t\treturn res\n\t}\n\n\thas(value: T): boolean {\n\t\tdependant(contentRef(this), value)\n\t\treturn this.has(value)\n\t}\n\n\tentries(): Generator<[T, T]> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveEntriesIterator(this.entries())\n\t}\n\n\tforEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void {\n\t\tdependant(contentRef(this))\n\t\tthis.forEach(callbackfn, thisArg)\n\t}\n\n\tkeys(): Generator<T> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveIterator(this.keys())\n\t}\n\n\tvalues(): Generator<T> {\n\t\tdependant(contentRef(this))\n\t\treturn makeReactiveIterator(this.values())\n\t}\n\n\t[Symbol.iterator](): SetIterator<T> {\n\t\tdependant(contentRef(this))\n\t\tconst it: SetIterator<T> = Set.prototype[Symbol.iterator].call(this)\n\t\tconst nativeNext = it.next.bind(it)\n\t\tit.next = () => {\n\t\t\tconst result = nativeNext()\n\t\t\tif (result.done) return result\n\t\t\treturn { value: reactive(result.value), done: false }\n\t\t}\n\t\treturn it\n\t}\n}\n","export { attend, lift, morph } from './buffer'\nexport { getState, touched, touched1 } from './change'\nexport { deepWatch } from './deep-watch'\nexport {\n\ttype EffectContext,\n\teffectAggregator,\n\teffectContext,\n\tgetActiveEffect,\n\tlink,\n\tunlink,\n\twithEffectContext,\n} from './effect-context'\nexport {\n\taddBatchCleanup,\n\tatom,\n\tatomic,\n\t//batch, - NEVER export batch, it deals with EffectTriggers who are internal types - mutts consumers use `atomic` or `atom`\n\tbiDi,\n\tcaptured,\n\tcaught,\n\tdefer,\n\teffect,\n\tgetActivationLog,\n\tonEffectThrow,\n\treset,\n\troot,\n\tuntracked,\n} from './effects'\nexport { type Memoizable, type MemoizableArgument, memoize } from './memoize'\nexport { addUnreactiveProps, isNonReactive } from './non-reactive'\nexport { ReactiveBase, reactive } from './proxy'\nexport { organize, organized } from './record'\nexport { type Resource, resource, unreactive, watch, when } from './satellite'\nexport { assertUntracked } from './tracking'\nexport {\n\ttype CleanupReason,\n\tdebugPreset,\n\tdevPreset,\n\ttype EffectAccess,\n\ttype EffectCleanup,\n\ttype EffectCloser,\n\ttype EffectOptions,\n\ttype EffectTrigger,\n\ttype Evolution,\n\tformatCleanupReason,\n\tisReactive,\n\tobjectToProxy,\n\toptions as reactiveOptions,\n\ttype PropTrigger,\n\tprodPreset,\n\tproxyToObject,\n\tReactiveError,\n\tReactiveErrorCode,\n\ttype ScopedCallback,\n\tunwrap,\n} from './types'\n\nimport { ReactiveArray, ReactiveArrayWrapper } from './array'\nimport {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n} from './deep-watch-state'\nimport { ReactiveMap, ReactiveWeakMap } from './map'\nimport { metaProtos, wrapProtos } from './proxy'\nimport { effectToReactiveObjects, watchers } from './registry'\nimport { ReactiveSet, ReactiveWeakSet } from './set'\nimport { objectToProxy, proxyToObject } from './types'\n\n// Register native collection types to use specialized reactive wrappers\nmetaProtos.set(Array, ReactiveArray.prototype)\nmetaProtos.set(Set, ReactiveSet.prototype)\nmetaProtos.set(WeakSet, ReactiveWeakSet.prototype)\nmetaProtos.set(Map, ReactiveMap.prototype)\nmetaProtos.set(WeakMap, ReactiveWeakMap.prototype)\nwrapProtos.set(Array, ReactiveArrayWrapper.prototype)\n\n/**\n * Object containing internal reactive system state for debugging and profiling\n */\nexport const profileInfo: any = {\n\tobjectToProxy,\n\tproxyToObject,\n\teffectToReactiveObjects,\n\twatchers,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n}\n","import { decorator, type GenericClassDecorator } from './decorator'\nimport { options } from './reactive/types'\n\n// In order to avoid async re-entrance, we could use zone.js or something like that.\nconst syncCalculating: { object: object; prop: PropertyKey }[] = []\n/**\n * Decorator that caches the result of a getter method and only recomputes when dependencies change\n * Prevents circular dependencies and provides automatic cache invalidation\n */\nexport const cached = decorator({\n\tgetter(original, _target, propertyKey) {\n\t\treturn function (this: any) {\n\t\t\tconst alreadyCalculating = syncCalculating.findIndex(\n\t\t\t\t(c) => c.object === this && c.prop === propertyKey\n\t\t\t)\n\t\t\tif (alreadyCalculating > -1)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Circular dependency detected: ${syncCalculating\n\t\t\t\t\t\t.slice(alreadyCalculating)\n\t\t\t\t\t\t.map((c) => `${c.object.constructor.name}.${String(c.prop)}`)\n\t\t\t\t\t\t.join(' -> ')} -> again`\n\t\t\t\t)\n\t\t\tsyncCalculating.push({ object: this, prop: propertyKey })\n\t\t\ttry {\n\t\t\t\tconst rv = original.call(this)\n\t\t\t\tcache(this, propertyKey, rv)\n\t\t\t\treturn rv\n\t\t\t} finally {\n\t\t\t\tsyncCalculating.pop()\n\t\t\t}\n\t\t}\n\t},\n})\n\n/**\n * Checks if a property is cached (has a cached value)\n * @param object - The object to check\n * @param propertyKey - The property key to check\n * @returns True if the property has a cached value\n */\nexport function isCached(object: Object, propertyKey: PropertyKey) {\n\treturn !!Object.getOwnPropertyDescriptor(object, propertyKey)\n}\n\n/**\n * Caches a value for a property on an object\n * @param object - The object to cache the value on\n * @param propertyKey - The property key to cache\n * @param value - The value to cache\n */\nexport function cache(object: Object, propertyKey: PropertyKey, value: any) {\n\tObject.defineProperty(object, propertyKey, { value })\n}\n\ntype DescriptorShape = {\n\tenumerable?: boolean\n\tconfigurable?: boolean\n\twritable?: boolean\n}\n\ntype DescriptorDecorator = <T>(...properties: (keyof T)[]) => GenericClassDecorator<T>\n\ntype DescriptorBuilder = ((descriptor: DescriptorShape) => DescriptorDecorator) & {\n\treadonly enumerable: DescriptorDecorator\n\treadonly hidden: DescriptorDecorator\n\treadonly configurable: DescriptorDecorator\n\treadonly frozen: DescriptorDecorator\n\treadonly writable: DescriptorDecorator\n\treadonly readonly: DescriptorDecorator\n}\n\nfunction descriptorBase(descriptor: DescriptorShape): DescriptorDecorator {\n\treturn function descriptorDecorator<T>(...properties: (keyof T)[]): GenericClassDecorator<T> {\n\t\treturn (Base) => {\n\t\t\treturn class extends Base {\n\t\t\t\tconstructor(...args: any[]) {\n\t\t\t\t\tsuper(...args)\n\t\t\t\t\tfor (const key of properties) {\n\t\t\t\t\t\tconst existing = Object.getOwnPropertyDescriptor(this, key)\n\t\t\t\t\t\tObject.defineProperty(this, key, Object.assign(existing || {}, descriptor))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n/**\n * Creates a decorator that modifies property descriptors for specified properties\n * @param descriptor - The descriptor properties to apply\n * @returns A class decorator that applies the descriptor to specified properties\n */\nexport const descriptor: DescriptorBuilder = Object.assign(descriptorBase, {\n\t/**\n\t * enumerable: true\n\t */\n\tget enumerable(): DescriptorDecorator {\n\t\treturn descriptorBase({ enumerable: true })\n\t},\n\t/**\n\t * enumerable: false\n\t */\n\tget hidden(): DescriptorDecorator {\n\t\treturn descriptorBase({ enumerable: false })\n\t},\n\t/**\n\t * configurable: true\n\t */\n\tget configurable(): DescriptorDecorator {\n\t\treturn descriptorBase({ configurable: true })\n\t},\n\t/**\n\t * configurable: false\n\t */\n\tget frozen(): DescriptorDecorator {\n\t\treturn descriptorBase({ configurable: false })\n\t},\n\t/**\n\t * writable: true\n\t */\n\tget writable(): DescriptorDecorator {\n\t\treturn descriptorBase({ writable: true })\n\t},\n\t/**\n\t * writable: false\n\t */\n\tget readonly(): DescriptorDecorator {\n\t\treturn descriptorBase({ writable: false })\n\t},\n})\n\n/**\n * Decorator that marks methods, properties, or classes as deprecated\n * Provides warning messages when deprecated items are used\n */\nexport const deprecated = Object.assign(\n\tdecorator({\n\t\tmethod(original, _target, propertyKey) {\n\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\tdeprecated.warn(this, propertyKey)\n\t\t\t\treturn original.apply(this, args)\n\t\t\t}\n\t\t},\n\t\tgetter(original, _target, propertyKey) {\n\t\t\treturn function (this: any) {\n\t\t\t\tdeprecated.warn(this, propertyKey)\n\t\t\t\treturn original.call(this)\n\t\t\t}\n\t\t},\n\t\tsetter(original, _target, propertyKey) {\n\t\t\treturn function (this: any, value: any) {\n\t\t\t\tdeprecated.warn(this, propertyKey)\n\t\t\t\treturn original.call(this, value)\n\t\t\t}\n\t\t},\n\t\tclass(original) {\n\t\t\treturn class extends original {\n\t\t\t\tconstructor(...args: any[]) {\n\t\t\t\t\tsuper(...args)\n\t\t\t\t\tdeprecated.warn(this, 'constructor')\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\tdefault(message: string) {\n\t\t\treturn decorator({\n\t\t\t\tmethod(original, _target, propertyKey) {\n\t\t\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\t\t\tdeprecated.warn(this, propertyKey, message)\n\t\t\t\t\t\treturn original.apply(this, args)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tgetter(original, _target, propertyKey) {\n\t\t\t\t\treturn function (this: any) {\n\t\t\t\t\t\tdeprecated.warn(this, propertyKey, message)\n\t\t\t\t\t\treturn original.call(this)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tsetter(original, _target, propertyKey) {\n\t\t\t\t\treturn function (this: any, value: any) {\n\t\t\t\t\t\tdeprecated.warn(this, propertyKey, message)\n\t\t\t\t\t\treturn original.call(this, value)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tclass(original) {\n\t\t\t\t\treturn class extends original {\n\t\t\t\t\t\tconstructor(...args: any[]) {\n\t\t\t\t\t\t\tsuper(...args)\n\t\t\t\t\t\t\tdeprecated.warn(this, 'constructor', message)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\t\t},\n\t}),\n\t{\n\t\twarn: (target: any, propertyKey: PropertyKey, message?: string) => {\n\t\t\toptions.warn(\n\t\t\t\t`${target.constructor.name}.${String(propertyKey)} is deprecated${message ? `: ${message}` : ''}`\n\t\t\t)\n\t\t},\n\t}\n)\n\n/**\n * Creates a debounced method decorator that delays execution until after the delay period has passed\n * @param delay - The delay in milliseconds\n * @returns A method decorator that debounces method calls\n */\nexport function debounce(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _target, _propertyKey) {\n\t\t\tlet timeoutId: ReturnType<typeof setTimeout> | null = null\n\n\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\t// Clear existing timeout\n\t\t\t\tif (timeoutId) {\n\t\t\t\t\tclearTimeout(timeoutId)\n\t\t\t\t}\n\n\t\t\t\t// Set new timeout\n\t\t\t\ttimeoutId = setTimeout(() => {\n\t\t\t\t\toriginal.apply(this, args)\n\t\t\t\t\ttimeoutId = null\n\t\t\t\t}, delay)\n\t\t\t}\n\t\t},\n\t})\n}\n\n/**\n * Creates a throttled method decorator that limits execution to once per delay period\n * @param delay - The delay in milliseconds\n * @returns A method decorator that throttles method calls\n */\nexport function throttle(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _target, _propertyKey) {\n\t\t\tlet lastCallTime = 0\n\t\t\tlet timeoutId: ReturnType<typeof setTimeout> | null = null\n\n\t\t\treturn function (this: any, ...args: any[]) {\n\t\t\t\tconst now = Date.now()\n\n\t\t\t\t// If enough time has passed since last call, execute immediately\n\t\t\t\tif (now - lastCallTime >= delay) {\n\t\t\t\t\t// Clear any pending timeout since we're executing now\n\t\t\t\t\tif (timeoutId) {\n\t\t\t\t\t\tclearTimeout(timeoutId)\n\t\t\t\t\t\ttimeoutId = null\n\t\t\t\t\t}\n\t\t\t\t\tlastCallTime = now\n\t\t\t\t\treturn original.apply(this, args)\n\t\t\t\t}\n\n\t\t\t\t// Otherwise, schedule execution for when the delay period ends\n\t\t\t\tif (!timeoutId) {\n\t\t\t\t\tconst remainingTime = delay - (now - lastCallTime)\n\t\t\t\t\tconst scheduledArgs = [...args] // Capture args at scheduling time\n\t\t\t\t\ttimeoutId = setTimeout(() => {\n\t\t\t\t\t\tlastCallTime = Date.now()\n\t\t\t\t\t\toriginal.apply(this, scheduledArgs)\n\t\t\t\t\t\ttimeoutId = null\n\t\t\t\t\t}, remainingTime)\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t})\n}\n","export * from './async'\nexport * from './decorator'\nexport * from './destroyable'\nexport * from './diff'\nexport * from './eventful'\nexport * from './flavored'\nexport * from './indexable'\nexport * from './iterableWeak'\nexport * from './mixins'\nexport * from './promiseChain'\nexport * from './reactive'\nexport * from './std-decorators'\nexport {\n\tarrayEquals,\n\tCompareSymbol,\n\tdeepCompare,\n\tisConstructor,\n\tisDev,\n\tisObject,\n\tisProd,\n\tisTest,\n\tnamed,\n\ttag,\n\tzip,\n} from './utils'\nexport * from './zone'\n\n// Important: let it here!\nimport pkg from '../package.json'\n\nconst { version } = pkg\n\nconst GLOBAL_MUTTS_KEY = '__MUTTS_INSTANCE__'\nconst runtimeGlobals = globalThis as typeof globalThis & {\n\twindow?: typeof window\n\tglobal?: typeof globalThis\n\t__filename?: string\n\t[GLOBAL_MUTTS_KEY]?: unknown\n}\nconst globalScope = (\n\ttypeof globalThis !== 'undefined'\n\t\t? globalThis\n\t\t: runtimeGlobals.window\n\t\t\t? runtimeGlobals.window\n\t\t\t: runtimeGlobals.global\n\t\t\t\t? runtimeGlobals.global\n\t\t\t\t: false\n) as any\nif (globalScope) {\n\tlet source = 'mutts/index'\n\ttry {\n\t\tif (runtimeGlobals.__filename) source = runtimeGlobals.__filename\n\t\telse if (typeof import.meta !== 'undefined' && import.meta.url) {\n\t\t\tsource = import.meta.url\n\t\t}\n\t} catch (_e) {}\n\n\tconst currentSourceInfo = { version, source, timestamp: Date.now() }\n\n\tif (globalScope[GLOBAL_MUTTS_KEY]) {\n\t\tconst existing = globalScope[GLOBAL_MUTTS_KEY]\n\t\tthrow new Error(\n\t\t\t`[Mutts] Multiple instances detected!\\n` +\n\t\t\t\t`Existing instance: ${JSON.stringify(existing, null, 2)}\\n` +\n\t\t\t\t`New instance: ${JSON.stringify(currentSourceInfo, null, 2)}\\n` +\n\t\t\t\t`This usually happens when 'mutts' is both installed as a dependency and bundled, ` +\n\t\t\t\t`or when different versions are loaded. ` +\n\t\t\t\t`Please check your build configuration (aliases, externals) to ensure a single source of truth.`\n\t\t)\n\t}\n\tglobalScope[GLOBAL_MUTTS_KEY] = currentSourceInfo\n}\n","import { FoolProof } from '../utils'\nimport { attend } from './buffer'\nimport { touched1 } from './change'\nimport { link } from './effect-context'\nimport { reactive } from './proxy'\nimport type { CleanupReason, EffectCloser } from './types'\n\n/**\n * Provides type-safe access to a source object's property within the organized callback.\n * @template Source - The type of the source object\n * @template Key - The type of the property key in the source object\n */\nexport type OrganizedAccess<Source extends Record<PropertyKey, any>, Key extends keyof Source> = {\n\t/** The property key being accessed */\n\treadonly key: Key\n\n\t/**\n\t * Gets the current value of the property from the source object\n\t * @returns The current value of the property\n\t */\n\tget(): Source[Key]\n\n\t/**\n\t * Updates the property value in the source object\n\t * @param value - The new value to set\n\t * @returns {boolean} True if the update was successful\n\t */\n\tset(value: Source[Key]): boolean\n\n\t/**\n\t * The current value of the property (equivalent to using get()/set() directly)\n\t */\n\tvalue: Source[Key]\n}\n\n/**\n * Callback function type for the organized function that processes each source property.\n * @template Source - The type of the source object\n * @template Target - The type of the target object\n */\nexport type OrganizedCallback<Source extends Record<PropertyKey, any>, Target extends object> = <\n\tKey extends keyof Source,\n>(\n\t/**\n\t * Accessor object for the current source property\n\t */\n\taccess: OrganizedAccess<Source, Key>,\n\n\t/**\n\t * The target object where organized data will be stored\n\t */\n\ttarget: Target\n) => EffectCloser | undefined\n\n/**\n * The result type of the organized function, combining the target object with cleanup capability.\n * @template Target - The type of the target object\n */\nexport type OrganizedResult<Target extends object> = Target\n\n/**\n * Organizes a source object's properties into a target object using a callback function.\n * This creates a reactive mapping between source properties and a target object,\n * automatically handling property additions, updates, and removals.\n *\n * @template Source - The type of the source object\n * @template Target - The type of the target object (defaults to Record<PropertyKey, any>)\n *\n * @param {Source} source - The source object to organize\n * @param {OrganizedCallback<Source, Target>} apply - Callback function that defines how each source property is mapped to the target\n * @param {Target} [baseTarget={}] - Optional base target object to use (will be made reactive if not already)\n *\n * @returns {OrganizedResult<Target>} The target object with cleanup capability\n *\n * @example\n * // Organize user permissions into role-based access\n * const user = reactive({ isAdmin: true, canEdit: false });\n * const permissions = organized(\n *   user,\n *   (access, target) => {\n *     if (access.key === 'isAdmin') {\n *       target.hasFullAccess = access.value;\n *     }\n *     target[`can${access.key.charAt(0).toUpperCase() + access.key.slice(1)}`] = access.value;\n *   }\n * );\n *\n * @example\n * // Transform object structure with cleanup\n * const source = reactive({ firstName: 'John', lastName: 'Doe' });\n * const formatted = organized(\n *   source,\n *   (access, target) => {\n *     if (access.key === 'firstName' || access.key === 'lastName') {\n *       target.fullName = `${source.firstName} ${source.lastName}`.trim();\n *     }\n *   }\n * );\n *\n * @example\n * // Using with cleanup in a component\n * effect(() => {\n *   const data = fetchData();\n *   const organizedData = organized(data, (access, target) => {\n *     // Transform data\n *   });\n *\n *   // The cleanup will be called automatically when the effect is disposed\n *   return () => organizedData[cleanup]();\n * });\n */\nexport function organized<\n\tSource extends Record<PropertyKey, any>,\n\tTarget extends object = Record<PropertyKey, any>,\n>(\n\tsource: Source,\n\tapply: OrganizedCallback<Source, Target>,\n\tbaseTarget: Target = {} as Target\n): OrganizedResult<Target> {\n\tconst observedSource = reactive(source) as Source\n\tconst target = reactive(baseTarget) as Target\n\n\tconst stop = attend`organized:entries`(\n\t\tfunction enumerateObservedSourceKeys() {\n\t\t\tconst keys: PropertyKey[] = []\n\t\t\tfor (const key in observedSource) keys.push(key)\n\t\t\treturn keys\n\t\t},\n\t\tfunction applyObservedSourceKey(key) {\n\t\t\tconst sourceKey = key as keyof Source\n\t\t\tconst accessBase = {\n\t\t\t\tkey: sourceKey,\n\t\t\t\tget: () => FoolProof.get(observedSource, sourceKey, observedSource),\n\t\t\t\tset: (value: Source[typeof sourceKey]) =>\n\t\t\t\t\tFoolProof.set(observedSource, sourceKey, value, observedSource),\n\t\t\t}\n\t\t\tObject.defineProperty(accessBase, 'value', {\n\t\t\t\tget: accessBase.get,\n\t\t\t\tset: accessBase.set,\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t})\n\t\t\treturn apply(accessBase as OrganizedAccess<Source, typeof sourceKey>, target)\n\t\t}\n\t)\n\n\treturn link(target, (reason?: CleanupReason) => stop(reason)) as OrganizedResult<Target>\n}\n\n/**\n * Organizes a property on a target object\n * Shortcut for defineProperty/delete with touched signal\n * @param target - The target object\n * @param property - The property to organize\n * @param access - The access object\n * @returns The property descriptor\n */\nexport function organize<T>(\n\ttarget: object,\n\tproperty: PropertyKey,\n\taccess: { get?(): T; set?(value: T): boolean }\n) {\n\tObject.defineProperty(target, property, {\n\t\tget: access.get,\n\t\tset: access.set,\n\t\tconfigurable: true,\n\t\tenumerable: true,\n\t})\n\ttouched1(target, { type: 'set', prop: property }, property)\n\treturn () => delete (target as any)[property]\n}\n"],"names":["hooks","Set","asyncHooks","addHook","hook","add","delete","sanitizePromise","p","promiseContexts","WeakMap","captureRestorers","restorers","restorer","wrap","fn","capturedRestorers","args","undoers","restore","push","apply","this","res","then","Promise","resolve","reject","setTimeout","GLOBAL_ORIGINALS","Symbol","for","GLOBAL_PROMISE","originals","OriginalPromise","patchedThen","onFulfilled","onRejected","context","get","nextPromise","call","size","set","PatchedPromise","executor","wrappedResolve","wrappedReject","globalThis","prototype","catch","finally","all","allSettled","race","any","setInterval","setImmediate","requestAnimationFrame","queueMicrotask","Object","assign","value","has","reason","values","onFinally","defineProperty","species","configurable","_e","callback","nativeConstructors","Array","Date","Function","Map","WeakSet","Error","TypeError","ReferenceError","SyntaxError","RangeError","URIError","EvalError","Reflect","Proxy","RegExp","String","Number","Boolean","isConstructor","toString","startsWith","hasNode","Node","FoolProof","obj","prop","receiver","isOwnAccessor","opd","getOwnPropertyDescriptor","CompareSymbol","deepCompare","a","b","cache","x","y","getPrototypeOf","compared","isArray","length","i","getTime","val","found","bVal","key","foundMatch","bKey","keysA","keys","keysB","hasOwn","contentRefs","contentRef","container","seal","create","contentOf","writable","tag","name","defineProperties","toStringTag","named","runtimeGlobals","_mode","process","env","NODE_ENV","undefined","isDev","isProd","isTest","DecoratorError","constructor","message","super","legacyDecorator","description","target","propertyKey","descriptor","class","includes","newGetter","getter","newSetter","setter","newMethod","method","default","modernDecorator","kind","rv","decorator","modern","legacy","contextOrKey","mode","_target","detectDecoratorMode","fr","FinalizationRegistry","f","destructor","allocatedValues","DestructionError","msg","destroyedHandler","throw","allocated","original","arrayDiff","A","B","start","endA","endB","lenA","lenB","indexA","indexB","sliceA","sliceB","slice","maxD","Math","min","vOffset","V","Int32Array","history","d","k","buildPatches","offset","finalX","finalY","finalD","finalK","ops","prev","prevK","down","prevXEnd","xStart","yStart","patches","currA","currB","patchA","patchB","flush","op","events","getEventMap","getHookSet","eventBehavior","on","eventOrEvents","cb","eventMap","e","callbacks","off","emit","event","self","perEvent","eventful","fct","use","cached","_a","captionedOptionsSymbol","captioned","options","settings","callbackIndex","rename","caption","renameCallback","warn","shouldWarnAnonymous","thisArg","raw","strings","result","renderTemplate","callArgs","nextArgs","isAnonymousCallback","inheritCaption","source","flavored","flavors","flavorOptions","defaultOptions","opts","targetIndex","optionsIndex","newArgs","currentOptions","isObject","getAt","setAt","forwardArray","ArrayReadForward","iterator","map","callbackfn","filter","predicate","reduce","initialValue","reduceRight","forEach","find","findIndex","findLast","findLastIndex","searchElement","fromIndex","indexOf","lastIndexOf","end","concat","items","every","some","join","separator","entries","toLocaleString","locales","at","index","flat","depth","flatMap","toReversed","reverse","toSorted","compareFn","sort","toSpliced","deleteCount","with","unscopables","IterableWeakMap","uuids","refs","registry","uuid","v","createIterator","keyRef","deref","clear","unregister","crypto","randomUUID","WeakRef","register","_value","_key","IterableWeakSet","_b","union","other","others","that","intersection","difference","symmetricDifference","isSubsetOf","isSupersetOf","isDisjointFrom","mixin","mixinFunction","unwrapFunction","mixinCache","MixedBase","_thisArg","baseClass","usedBase","ProxiedBaseClass","originalPrototype","proxiedPrototype","setPrototypeOf","mixedClass","forward","alreadyChained","promiseProxyHandler","chainPromise","r","promiseForward","objectProxyHandler","chainObject","given","chainable","t","chained","debugHooks","stack","isu","z","AZone","enter","active","leave","entered","root","zoned","Zone","ZoneHistory","controlled","present","getOwnPropertyDescriptors","added","ZoneAggregator","zones","_ZoneAggregator_zones","__classPrivateFieldGet","asyncZone","zone","rootFunctionSymbol","effectToReactiveObjects","watchers","effectNodes","getEffectNode","effect","node","reverseRoots","markWithRoot","marked","existingRef","existing","rootName","existingName","fnName","getRoot","effectHistory","externalReason","effectAggregator","chainExternalReason","external","current","type","detail","chain","isRunning","getActiveEffect","cleanups","link","cleanupFns","effectMarker","formatTrigger","evolution","dependency","touch","parts","unreactiveProperties","allProps","keysOf","ReactiveErrorCode","ReactiveError","debugInfo","code","cause","_effect","_targets","_caller","beginChain","endChain","garbageCollected","_fn","touched","_obj","_evolution","_props","_deps","skipRunningEffect","effectRun","_reaction","maxEffectChain","maxTriggerPerBatch","maxEffectReaction","onMemoizationDiscrepancy","cycleHandling","isVerificationRun","maxDeepWatchDepth","instanceMembers","ignoreAccessors","recursiveTouching","asyncMode","error","introspection","gatherReasons","lineages","logErrors","enableHistory","historySize","optionCall","prodPreset","devPreset","objectToProxy","proxyToObject","unwrap","isReactive","activationRegistry","dependencyStacks","assertUntrackedFlag","getDependencyStack","objStacks","dependant","currentActiveEffect","dependencyHook","objectWatchers","deps","effectObjects","lineageConfig","propStacks","findCycleInChain","roots","seen","formatRoots","limit","names","externalReasonFrom","activationLog","recordActivation","effectData","objData","count","unshift","pop","MaxReactionExceeded","caught","onThrow","catchers","onEffectThrow","effectTriggers","effectTriggeredBy","causesClosure","consequencesClosure","broken","getOrCreateClosure","closure","hasPathExcluding","exclude","visited","queue","shift","triggers","next","batchStack","hasBatched","bs","executingStack","decrementInDegreesForExecuted","batch","executedRoot","consequences","consequenceRoot","currentDegree","inDegrees","findPath","startRoot","endRoot","path","newPath","targetRoot","getCyclePathForEdge","callerRoot","addToBatch","caller","immediate","currentBatch","pendingTriggers","callerNode","currentReason","nextReason","mergePropChange","into","from","reasons","stopped","targetConsequences","wouldCreateCycle","cyclePath","cycleMessage","causalChain","lineage","creationStack","CycleDetected","cycle","details","newTriggers","triggeredBy","uConsequences","vCauses","uCausesSet","vConsequencesSet","xConsequences","addGraphEdge","addBatchCleanup","cleanup","deferreds","defer","findCycle","recursionStack","cycleStart","executeNext","effectuatedRoots","nextEffect","nextRoot","first","getCyclePath","consequence","consequenceConsequences","BrokenEffects","isNewBatch","activeCaller","callerToUse","success","firstReturn","activeEffect","activeRoot","inDegree","causes","causeRoot","computeAllInDegrees","trace","queued","MaxDepthExceeded","queuedCount","deferred","atomic","atomicEffect","captured","effectOptions","runEffect","prevCleanup","untracked","runningPromise","cancelPrevious","abort","effectStopped","reactionCleanup","cleanupReaction","toCleanup","access","reaction","thrower","catches","parent","parentNode","forwardThrow","errorToThrow","tracked","originalPromise","cancelReject","cancelPromise","_","cancelError","reactiveObj","children","childReason","childCleanup","ascended","abortController","ascend","signal","AbortController","opaque","isOpaque","stopEffect","rootCauses","rootConsequences","sourceRoot","causeConsequences","consequenceCauses","yCauses","cleanupEffectFromGraph","callIfCollected","subEffectCleanup","_callback","objectParents","objectsWithDeepWatchers","deepWatcherCount","deepWatchers","effectToDeepWatchedObjects","addBackReference","child","parents","removeBackReference","entry","needsBackReferences","hasParentWithDeepWatchers","bubbleUpChange","changedObject","parentDeepWatchers","touchLineage","watcher","dependencyStack","states","addState","state","getState","collectEffects","effects","keyChains","sourceEffect","touched1","props","structural","absent","addUnreactiveProps","proto","merged","isUnreactiveProp","marker","nonReactiveClass","cls","c","isNonReactive","getPrototypeToken","shouldRecurseTouch","oldValue","newValue","notifyPropertyChange","targetObj","hadProperty","origin","changes","recursiveTouch","oldRef","newRef","oldMap","objects","migrateWatchers","notifications","combinedEffects","effectCauses","allowedEffects","originWatchers","originEffects","notification","currentEffects","propsArray","filteredEffects","associated","hasAncestorInSet","dispatchNotifications","gather","touchedOpaque","collectObjectKeys","ownKeys","oldObj","newObj","mapped","hasVisitedPair","oldArray","newArray","_visited","local","oldLength","newLength","max","hasOld","hasNew","oldEntry","newEntry","is","diffArrayElements","oldKeys","newKeys","diffObjectProperties","allowedSet","window","o","nonReactive","document","Element","HTMLElement","EventTarget","HTMLCollection","NodeList","metaProtos","wrapProtos","arrayLengths","hasReentry","subsRegister","internalUntracked","wrapReactiveValue","reactiveValue","reactiveObject","reactiveHandlers","metaProto","desc","ownDesc","wrapProto","isOwnProp","shouldIgnoreAccessor","hasProp","owner","isInheritedAccess","unwrapped","enumerable","oldVal","isArrayLength","deleteProperty","reactiveClasses","ReactiveBase","base","reactive","anyTarget","subProxy","getExistingProxy","proxy","storeProxyRelationship","Reactive","attend","enumerate","keyEffects","callbackLabel","outer","indexRef","stop","lift","rawResult","resultName","liftCleanup","sourceProto","splice","recordResult","had","newDesc","oldDesc","sameAccessor","morphRecord","pure","track","itemEffects","stopItem","computeItem","_cache","stateSnapshot","stopMain","morph","input","n","NaN","isNaN","newInput","diffs","diff","idx","_entry","newIdx","fill","invalidates","morphArray","morphMap","_opt","deepWatch","wrappedCallback","traverseAndTrack","memoizedRegistry","wrapperRegistry","getBranch","tree","branches","branch","memoizeFunction","fnRoot","cacheRoot","memoized","arg","lenient","wasVerification","fresh","makeMemoizeDecorator","memoizeOpts","wrapper","origRoot","originalGetter","_receiver","memoizeObject","memoize","unsetYet","watch","changed","deep","deepCleanup","cbCleanup","old","watchCallBack","watchObject","unreactive","arg1","parentMarker","makeReactiveIterator","done","makeReactiveEntriesIterator","Indexer","indexLess","asIndex","charCodeAt","ReactiveArrayWrapper","_classSuper","copyWithin","arguments","acc","wrappedCompare","_fill_decorators","_pop_decorators","_push_decorators","_shift_decorators","_sort_decorators","_unshift_decorators","__runInitializers","_instanceExtraInitializers","__esDecorate","static","private","metadata","_metadata","_copyWithin_decorators","_reverse_decorators","_splice_decorators","ReactiveWeakMap","hadKey","ReactiveMap","hadEntries","it","nativeNext","bind","ReactiveWeakSet","ReactiveSet","toJSON","profileInfo","syncCalculating","alreadyCalculating","object","descriptorBase","properties","Base","hidden","frozen","readonly","deprecated","version","pkg","GLOBAL_MUTTS_KEY","globalScope","global","__filename","url","location","require","pathToFileURL","href","_documentCurrentScript","tagName","toUpperCase","src","URL","baseURI","currentSourceInfo","timestamp","now","JSON","stringify","destructorObj","destroy","destructors","getOwnPropertyNames","isDestroyable","myDestructor","destruction","accessor","Indexable","getLength","numProp","setLength","len","received","programmaticallySetValue","pValue","called","transform","delay","_propertyKey","timeoutId","clearTimeout","formatCleanupReason","indent","repeat","property","baseTarget","observedSource","sourceKey","accessBase","fetcher","resource","loading","latest","reload","reloadSignal","counter","load","creation","lazyInit","id","promise","err","lastCallTime","remainingTime","scheduledArgs","unlink","timeout","timer","ctx","maxLength","arr","tuple"],"mappings":"2SAIO,MAAMA,EAAQ,IAAIC,IAEZC,EAAa,CACzBC,QAAQC,IACPJ,EAAMK,IAAID,GACH,IAAMJ,EAAMM,OAAOF,IAO3BG,gBAAgBC,GACRA,GCfHC,EAAkB,IAAIC,QAkB5B,SAASC,IACR,MAAMC,EAAY,IAAIX,IACtB,IAAK,MAAMG,KAAQJ,EAAO,CACzB,MAAMa,EAAWT,IACbS,GAAUD,EAAUP,IAAIQ,EAC7B,CACA,OAAOD,CACR,CAEA,SAASE,EACRC,EACAC,GAEA,GAAkB,mBAAPD,EAAmB,OAAOA,EACrC,MAAMH,EAAYI,GAAqBL,IACvC,OAAO,YAAwBM,GAC9B,MAAMC,EAA0B,GAChC,IAAK,MAAMC,KAAWP,EAAWM,EAAQE,KAAKD,KAC9C,IACC,OAAOJ,EAAGM,MAAMC,KAAML,EACvB,SAkBA,CACD,CACD,CAnDAf,EAAWK,gBAAmBgB,GACzBA,GAAoC,mBAArBA,EAAYC,KACvB,IAAIC,QAAQ,CAACC,EAASC,KAC5BC,WAAW,KACRL,EAAYC,KAAKE,EAASC,IAC1B,KAGEJ,EA6CR,MAAMM,EAAmBC,OAAOC,IAAI,mBAC9BC,EAAiBF,OAAOC,IAAI,yBAElC,IAAIE,EACAC,EAiCJ,SAASC,EAAuBC,EAAkBC,GACjD,MAAMC,EAAU7B,EAAgB8B,IAAIjB,OAASX,IACvC6B,EAAcP,EAAUT,KAAKiB,KAClCnB,KACAR,EAAKsB,EAAaE,GAClBxB,EAAKuB,EAAYC,IAGlB,OADIA,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAIH,EAAaF,GAChDE,CACR,CAgBA,SAASI,EAERC,GAEA,GAAwB,mBAAbA,EAAyB,CACnC,MAAMrC,EAAI,IAAI0B,EAAgB,CAACR,EAASC,KACvC,MAAMmB,EAAiBhC,EAAKY,GACtBqB,EAAgBjC,EAAKa,GAC3BkB,EAASC,EAAgBC,KAEpBT,EAAU3B,IAEhB,OADAF,EAAgBkC,IAAInC,EAAG8B,GAChB9B,CACR,CACA,OAAO,IAAI0B,EAAgBW,EAC5B,CAvEKG,WAAmBnB,IACvBI,EAAae,WAAmBnB,GAChCK,EAAmBc,WAAmBhB,KAEtCE,EAAkBc,WAAWvB,QAC7BQ,EAAY,CAEXT,KAAMU,EAAgBe,UAAUzB,KAChC0B,MAAOhB,EAAgBe,UAAUC,MACjCC,QAASjB,EAAgBe,UAAUE,QACnCzB,QAASQ,EAAgBR,QACzBC,OAAQO,EAAgBP,OACxByB,IAAKlB,EAAgBkB,IACrBC,WAAanB,EAAwBmB,WACrCC,KAAMpB,EAAgBoB,KACtBC,IAAMrB,EAAwBqB,IAC9B3B,WAAYoB,WAAWpB,WACvB4B,YAAaR,WAAWQ,YACxBC,aAAeT,WAAmBS,aAClCC,sBAAwBV,WAAmBU,sBAC3CC,eAAgBX,WAAWW,gBAE1BX,WAAmBnB,GAAoBI,EACvCe,WAAmBhB,GAAkBE,GAInCD,EAAUoB,aAAYpB,EAAUoB,WAAcnB,EAAwBmB,YACtEpB,EAAUsB,MAAKtB,EAAUsB,IAAOrB,EAAwBqB,KACxDtB,EAAUqB,OAAMrB,EAAUqB,KAAOpB,EAAgBoB,MA6CtDM,OAAOC,OAAOjB,EAAgBV,GAG9BU,EAAeK,UAAYf,EAAgBe,UAE3CL,EAAelB,QAAeoC,IAC7B,MAAMtD,EAAIyB,EAAUP,QAAQe,KAAKP,EAAiB4B,GAC5CxB,EAAU3B,IAGhB,OADI2B,EAAQI,KAAO,IAAMjC,EAAgBsD,IAAIvD,IAAIC,EAAgBkC,IAAInC,EAAG8B,GACjE9B,CACP,EAEDoC,EAAejB,OAAsBqC,IACpC,MAAMxD,EAAIyB,EAAUN,OAAOc,KAAKP,EAAiB8B,GAC3C1B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeQ,IAAWa,IACzB,MAAMzD,EAAIyB,EAAUmB,IAAIX,KAAKP,EAAiB+B,GACxC3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeS,WACdY,IAEA,MAAMzD,EAAKyB,EAAUoB,WAAmBZ,KAAKP,EAAiB+B,GACxD3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeU,KAAYW,IAC1B,MAAMzD,EAAIyB,EAAUqB,KAAKb,KAAKP,EAAiB+B,GACzC3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAEDoC,EAAeW,IAAWU,IACzB,MAAMzD,EAAKyB,EAAUsB,IAAYd,KAAKP,EAAiB+B,GACjD3B,EAAU3B,IAEhB,OADI2B,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAInC,EAAG8B,GACtC9B,CACP,EAKG0B,EAAgBe,UAAUzB,OAASW,IAEtCD,EAAgBe,UAAUzB,KAAOW,EACjCD,EAAgBe,UAAUC,MAxF3B,SAAiCb,GAChC,MAAMC,EAAU7B,EAAgB8B,IAAIjB,OAASX,IACvC6B,EAAcP,EAAUiB,MAAMT,KAAKnB,KAAMR,EAAKuB,EAAYC,IAEhE,OADIA,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAIH,EAAaF,GAChDE,CACR,EAoFCN,EAAgBe,UAAUE,QAlF3B,SAAmCe,GAClC,MAAM5B,EAAU7B,EAAgB8B,IAAIjB,OAASX,IACvC6B,EAAcP,EAAUkB,QAAQV,KAAKnB,KAAMR,EAAKoD,EAAW5B,IAEjE,OADIA,EAAQI,KAAO,GAAGjC,EAAgBkC,IAAIH,EAAaF,GAChDE,CACR,GAgFA,IACCoB,OAAOO,eAAejC,EAAiBJ,OAAOsC,QAAS,CACtD7B,IAAK,IAAMK,EACXyB,cAAc,GAEhB,CAAE,MAAOC,GAAK,CAEZtB,WAAmBvB,QAAUmB,EAE/BI,WAAWpB,WAAU,CAAK2C,KAAuBtD,IACzCgB,EAAUL,WAAWa,KAAKO,WAAYlC,EAAKyD,MAAqBtD,GAGxE+B,WAAWQ,YAAW,CAAKe,KAAuBtD,IAC1CgB,EAAUuB,YAAYf,KAAKO,WAAYlC,EAAKyD,MAAqBtD,GAGrEgB,EAAUwB,eACXT,WAAmBS,aAAY,CAAKc,KAAuBtD,IACrDgB,EAAUwB,aAAahB,KAAKO,WAAYlC,EAAKyD,MAAqBtD,IAIvEgB,EAAUyB,wBACbV,WAAWU,sBAAyBa,GAC5BtC,EAAUyB,sBAAsBjB,KAAKO,WAAYlC,EAAKyD,KAI3DtC,EAAU0B,iBACbX,WAAWW,eAAkBY,IAC5BtC,EAAU0B,eAAelB,KAAKO,WAAYlC,EAAKyD,MCtMjD,MAAMC,EAAqB,IAAIvE,IAAc,CAC5C2D,OACAa,MACAC,KACAC,SACA1E,IACA2E,IACAlE,QACAmE,QACApD,QACAqD,MACAC,UACAC,eACAC,YACAC,WACAC,SACAC,UACAC,QACAC,MACAC,OACAC,OACAC,OACAC,UAOK,SAAUC,EAAc5E,GAC7B,OACCA,GACc,mBAAPA,IACNyD,EAAmBT,IAAIhD,IAAOA,EAAG6E,aAAaC,WAAW,UAE5D,CA0BA,MAAMC,EAA0B,oBAATC,KACVC,EAAY,CACxBzD,IAAG,CAAC0D,EAAUC,EAAWC,IACpBL,GAAWG,aAAeF,KAAcE,EAAYC,GACjDb,QAAQ9C,IAAI0D,EAAKC,EAAMC,GAE/BxD,IAAG,CAACsD,EAAUC,EAAWpC,EAAYqC,IAChCL,GAAWG,aAAeF,MAC3BE,EAAYC,GAAQpC,GACf,GAWDuB,QAAQ1C,IAAIsD,EAAKC,EAAMpC,EAAOqC,IAIjC,SAAUC,EAAcH,EAAUC,GACvC,MAAMG,EAAMzC,OAAO0C,yBAAyBL,EAAKC,GACjD,SAAUG,GAAK9D,MAAO8D,GAAK1D,IAC5B,CAKO,MAAM4D,EAAgBzE,OAAOC,IAAI,iBAIlC,SAAUyE,EAAYC,EAAQC,EAAQC,EAAQ,IAAI/B,KACvD,GAAI6B,IAAMC,EAAG,OAAO,EAEpB,GAAiB,iBAAND,GAAwB,OAANA,GAA2B,iBAANC,GAAwB,OAANA,EACnE,OAAOD,IAAMC,EAId,GAAyC,mBAA7BD,EAAUF,GACrB,OAAQE,EAAUF,GAAeG,EAAG,CAACE,EAAQC,IAAWL,EAAYI,EAAGC,EAAGF,IAE3E,GAAyC,mBAA7BD,EAAUH,GACrB,OAAQG,EAAUH,GAAeE,EAAG,CAACG,EAAQC,IAAWL,EAAYI,EAAGC,EAAGF,IAI3E,GAAI/C,OAAOkD,eAAeL,KAAO7C,OAAOkD,eAAeJ,GAAI,OAAO,EAGlE,IAAIK,EAAWJ,EAAMpE,IAAIkE,GACzB,GAAIM,GAAUhD,IAAI2C,GAAI,OAAO,EAQ7B,GAPKK,IACJA,EAAW,IAAI9G,IACf0G,EAAMhE,IAAI8D,EAAGM,IAEdA,EAAS1G,IAAIqG,GAGTjC,MAAMuC,QAAQP,GAAI,CACrB,IAAKhC,MAAMuC,QAAQN,IAAMD,EAAEQ,SAAWP,EAAEO,OAAQ,OAAO,EACvD,IAAK,IAAIC,EAAI,EAAGA,EAAIT,EAAEQ,OAAQC,IAC7B,IAAKV,EAAYC,EAAES,GAAIR,EAAEQ,GAAIP,GAAQ,OAAO,EAE7C,OAAO,CACR,CAEA,GAAIF,aAAa/B,KAAM,OAAOgC,aAAahC,MAAQ+B,EAAEU,YAAcT,EAAES,UACrE,GAAIV,aAAalB,OAAQ,OAAOmB,aAAanB,QAAUkB,EAAEb,aAAec,EAAEd,WAE1E,GAAIa,aAAaxG,IAAK,CACrB,KAAMyG,aAAazG,MAAQwG,EAAE/D,OAASgE,EAAEhE,KAAM,OAAO,EACrD,IAAK,MAAM0E,KAAOX,EAAG,CACpB,IAAIY,GAAQ,EACZ,IAAK,MAAMC,KAAQZ,EAClB,GAAIF,EAAYY,EAAKE,EAAMX,GAAQ,CAClCU,GAAQ,EACR,KACD,CAED,IAAKA,EAAO,OAAO,CACpB,CACA,OAAO,CACR,CACA,GAAIZ,aAAa7B,IAAK,CACrB,KAAM8B,aAAa9B,MAAQ6B,EAAE/D,OAASgE,EAAEhE,KAAM,OAAO,EACrD,IAAK,MAAO6E,EAAKH,KAAQX,EACxB,GAAKC,EAAE3C,IAAIwD,IASJ,IAAKf,EAAYY,EAAKV,EAAEnE,IAAIgF,GAAMZ,GACxC,OAAO,MAVS,CAChB,IAAIa,GAAa,EACjB,IAAK,MAAOC,EAAMH,KAASZ,EAC1B,GAAIF,EAAYe,EAAKE,EAAMd,IAAUH,EAAYY,EAAKE,EAAMX,GAAQ,CACnEa,GAAa,EACb,KACD,CAED,IAAKA,EAAY,OAAO,CACzB,CAID,OAAO,CACR,CAGA,MAAME,EAAQ9D,OAAO+D,KAAKlB,GACpBmB,EAAQhE,OAAO+D,KAAKjB,GAC1B,GAAIgB,EAAMT,SAAWW,EAAMX,OAAQ,OAAO,EAE1C,IAAK,MAAMM,KAAOG,EACjB,IAAK9D,OAAOiE,OAAOnB,EAAGa,KAASf,EAAYC,EAAEc,GAAMb,EAAEa,GAAMZ,GAAQ,OAAO,EAG3E,OAAO,CACR,CAGA,MAAMmB,EAAc,IAAIpH,QAClB,SAAUqH,EAAWC,GAU1B,OATKF,EAAY/D,IAAIiE,IACpBF,EAAYnF,IACXqF,EACApE,OAAOqE,KACNrE,OAAOsE,OAAO,KAAM,CACnBC,UAAW,CAAErE,MAAOkE,EAAWI,UAAU,EAAO/D,cAAc,OAI3DyD,EAAYvF,IAAIyF,EACxB,CAQM,SAAUK,EAAsBC,EAAcrC,GAanD,OAZArC,OAAO2E,iBAAiBtC,EAAK,CAC5B,CAACnE,OAAO0G,aAAc,CACrB1E,MAAOwE,EACPF,UAAU,EACV/D,cAAc,GAEfuB,SAAU,CACT9B,MAAO,IAAMwE,EACbF,UAAU,EACV/D,cAAc,KAGT4B,CACR,CAQM,SAAUwC,EAA0BH,EAAcvH,GAMvD,OALA6C,OAAOO,eAAepD,EAAI,OAAQ,CACjC+C,MAAO/C,EAAGuH,KAAO,GAAGvH,EAAGuH,SAASA,IAASA,EACzCF,UAAU,EACV/D,cAAc,IAERtD,CACR,CAMA,MAAM2H,EAAiB1F,WAQjB2F,EACLD,EAAeE,SAASC,KAAKC,eACL,IAAhB,gQAAgCC,GACxC,aAEYC,EAAkB,gBAAVL,EACRM,EAAmB,eAAVN,EACTO,EAAmB,SAAVP,ECvRhB,MAAOQ,UAAuBrE,MACnC,WAAAsE,CAAYC,GACXC,MAAMD,GACN/H,KAAKgH,KAAO,oBACb,EAiIK,SAAUiB,EAAyBC,GACxC,OAAO,SAENC,EACAC,EACAC,KACG1I,GAEH,QAAoB8H,IAAhBW,GACH,GAAI/D,EAAc8D,GAAS,CAC1B,KAAM,UAAWD,GAAc,MAAM,IAAI1E,MAAM,0CAC/C,OAAO0E,EAAYI,MAAOH,EAC3B,OACM,GAAsB,iBAAXA,GAAuB,CAAC,SAAU,UAAUI,gBAAgBH,GAAc,CAC3F,IAAKC,EAAY,MAAM,IAAI7E,MAAM,0CAC5B,GAA0B,iBAAf6E,GAA2B,iBAAkBA,EAAY,CACxE,GAAI,QAASA,GAAc,QAASA,EAAY,CAC/C,KAAM,WAAYH,MAAe,WAAYA,GAC5C,MAAM,IAAI1E,MAAM,qDACjB,GAAI,WAAY0E,EAAa,CAC5B,MAAMM,EAAYN,EAAYO,OAAQJ,EAAWpH,IAAYkH,EAAQC,GACjEI,IAAWH,EAAWpH,IAAMuH,EACjC,CACA,GAAI,WAAYN,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,OAAQN,EAAWhH,IAAY8G,EAAQC,GACjEM,IAAWL,EAAWhH,IAAMqH,EACjC,CACA,OAAOL,CACR,CAAO,GAAgC,mBAArBA,EAAW7F,MAAsB,CAClD,KAAM,WAAY0F,GAAc,MAAM,IAAI1E,MAAM,2CAChD,MAAMoF,EAAYV,EAAYW,OAAQR,EAAW7F,MAAO2F,EAAQC,GAEhE,OADIQ,IAAWP,EAAW7F,MAAQoG,GAC3BP,CACR,CACD,CACD,CACA,KAAM,YAAaH,GAClB,MAAM,IAAI1E,MAAM,kDACjB,OAAO0E,EAAYY,QAAS3H,KAAKnB,KAAMmI,EAAQC,EAAaC,KAAe1I,EAC5E,CACD,CAOM,SAAUoJ,EAAyBb,GAExC,OAAO,SAAqBC,EAAanH,KAA+BrB,GACvE,IAAKqB,GAASgI,MAAgC,iBAAjBhI,EAAQgI,KAAmB,CACvD,KAAM,YAAad,GAClB,MAAM,IAAI1E,MAAM,kDACjB,OAAO0E,EAAYY,QAAS3H,KAAKnB,KAAMmI,EAAQnH,KAAYrB,EAC5D,CACA,OAAQqB,EAAQgI,MACf,IAAK,QACJ,KAAM,UAAWd,GAAc,MAAM,IAAI1E,MAAM,0CAC/C,OAAO0E,EAAYI,MAAOH,GAC3B,IAAK,QACJ,MAAM,IAAI3E,MAAM,0CACjB,IAAK,SACJ,KAAM,WAAY0E,GAAc,MAAM,IAAI1E,MAAM,2CAChD,OAAO0E,EAAYO,OAAQN,EAAQA,EAAQnH,EAAQgG,MACpD,IAAK,SACJ,KAAM,WAAYkB,GAAc,MAAM,IAAI1E,MAAM,2CAChD,OAAO0E,EAAYS,OAAQR,EAAQA,EAAQnH,EAAQgG,MACpD,IAAK,SACJ,KAAM,WAAYkB,GAAc,MAAM,IAAI1E,MAAM,2CAChD,OAAO0E,EAAYW,OAAQV,EAAQA,EAAQnH,EAAQgG,MACpD,IAAK,WAAY,CAChB,KAAM,WAAYkB,MAAe,WAAYA,GAC5C,MAAM,IAAI1E,MAAM,qDACjB,MAAMyF,EAAsD,CAAA,EAC5D,GAAI,WAAYf,EAAa,CAC5B,MAAMM,EAAYN,EAAYO,OAAQN,EAAOlH,IAAKkH,EAAQnH,EAAQgG,MAC9DwB,IAAWS,EAAGhI,IAAMuH,EACzB,CACA,GAAI,WAAYN,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,OAAQR,EAAO9G,IAAK8G,EAAQnH,EAAQgG,MAC9D0B,IAAWO,EAAG5H,IAAMqH,EACzB,CACA,OAAOO,CACR,EAGF,CACD,CA4BO,MAAMC,EAAoChB,IAChD,MAAMiB,EAASJ,EAAgBb,GACzBkB,EAASnB,EAAgBC,GAC/B,MAAA,CAASC,EAAakB,KAAuB1J,KAC5C,MAAM2J,EA1BR,SACCC,EACAF,GAKA,MACyB,iBAAjBA,GACU,OAAjBA,GAC6B,iBAAtBA,EAAaL,KAEb,SAED,QACR,CAWeQ,CAAoBrB,EAAQkB,EAAc1J,EAAK,IAC5D,MAAgB,WAAT2J,EACJH,EAAOhB,EAAQkB,KAAiB1J,GAChCyJ,EAAOjB,EAAQkB,KAAiB1J,EACnC,GCrQI8J,EAAK,IAAIC,qBAAkCC,GAAMA,KAI1CC,EAAapJ,OAAO,cAIpBqJ,EAAkBrJ,OAAO,aAIhC,MAAOsJ,UAAyBtG,MACrC,YAAO,CAAiBuG,GACvB,MAAO,KACN,MAAM,IAAID,EAAiBC,GAE7B,CACA,WAAAjC,CAAYiC,GACX/B,MAAM,wBAAwB+B,KAC9B/J,KAAKgH,KAAO,sBACb,EAED,MAAMgD,EAAmB,CACxB,CAACxJ,OAAO0G,aAAc,oBACtBjG,IAAK6I,EAAiBG,MAAM,kCAC5B5I,IAAKyI,EAAiBG,MAAM,mCAyItB,MAAMC,EAAYhB,EAAU,CAClCP,OAAM,CAACwB,EAAUZ,EAASnB,IAClB,SAAU5F,GAEhB,OADAxC,KAAK6J,GAAiBzB,GAAe5F,EAC9B2H,EAAShJ,KAAKnB,KAAMwC,EAC5B,IC5JI,SAAU4H,EAAaC,EAAiBC,GAC7C,IAAIC,EAAQ,EACRC,EAAOH,EAAE1E,OACT8E,EAAOH,EAAE3E,OAGb,KAAO4E,EAAQC,GAAQD,EAAQE,GAAQJ,EAAEE,KAAWD,EAAEC,IAAQA,IAE9D,KAAOC,EAAOD,GAASE,EAAOF,GAASF,EAAEG,EAAO,KAAOF,EAAEG,EAAO,IAC/DD,IACAC,IAGD,MAAMC,EAAOF,EAAOD,EACdI,EAAOF,EAAOF,EAEpB,GAAa,IAATG,GAAuB,IAATC,EAAY,MAAO,GACrC,GAAa,IAATD,EACH,MAAO,CAAC,CAAEE,OAAQL,EAAOM,OAAQN,EAAOO,OAAQ,GAAIC,OAAQT,EAAEU,MAAMT,EAAOE,KAC5E,GAAa,IAATE,EACH,MAAO,CAAC,CAAEC,OAAQL,EAAOM,OAAQN,EAAOO,OAAQT,EAAEW,MAAMT,EAAOC,GAAOO,OAAQ,KAG/E,MAAME,EAAOC,KAAKC,IAAIT,EAAOC,EA9BZ,KAgCXS,EAAUH,EACVI,EAAI,IAAIC,WAFA,EAAIL,EAAO,GAGzBI,EAAED,EAAU,GAAK,EACjB,MAAMG,EAAwB,GAE9B,IAAK,IAAIC,EAAI,EAAGA,GAAKP,EAAMO,IAAK,CAC/B,IAAK,IAAIC,GAAKD,EAAGC,GAAKD,EAAGC,GAAK,EAAG,CAChC,IAAInG,EAEHA,EADGmG,KAAOD,GAAMC,IAAMD,GAAKH,EAAED,EAAUK,EAAI,GAAKJ,EAAED,EAAUK,EAAI,GAC5DJ,EAAED,EAAUK,EAAI,GAEhBJ,EAAED,EAAUK,EAAI,GAAK,EAE1B,IAAIlG,EAAID,EAAImG,EACZ,KAAOnG,EAAIoF,GAAQnF,EAAIoF,GAAQN,EAAEE,EAAQjF,KAAOgF,EAAEC,EAAQhF,IACzDD,IACAC,IAGD,GADA8F,EAAED,EAAUK,GAAKnG,EACbA,GAAKoF,GAAQnF,GAAKoF,EAAM,OAAOe,EAAaH,EAASlB,EAAGC,EAAGC,EAAOjF,EAAGC,EAAGiG,EAAGC,EAAGL,EACnF,CACAG,EAAQzL,KAAK,IAAIwL,WAAWD,GAC7B,CAGA,MAAO,CACN,CAAET,OAAQL,EAAOM,OAAQN,EAAOO,OAAQT,EAAEW,MAAMT,EAAOC,GAAOO,OAAQT,EAAEU,MAAMT,EAAOE,IAEvF,CAEA,SAASiB,EACRH,EACAlB,EACAC,EACAqB,EACAC,EACAC,EACAC,EACAC,EACAX,GAGA,MAAMY,EAAqB,GAC3B,IAAI1G,EAAIsG,EACJrG,EAAIsG,EACJJ,EAAIM,EAER,IAAK,IAAIP,EAAIM,EAAQN,EAAI,EAAGA,IAAK,CAChC,MAAMS,EAAOV,EAAQC,EAAI,GACzB,IAAIU,EACAC,EACAV,KAAOD,GACVU,EAAQT,EAAI,EACZU,GAAO,GACGV,IAAMD,GAChBU,EAAQT,EAAI,EACZU,GAAO,GACGF,EAAKb,EAAUK,EAAI,GAAKQ,EAAKb,EAAUK,EAAI,IACrDS,EAAQT,EAAI,EACZU,GAAO,IAEPD,EAAQT,EAAI,EACZU,GAAO,GAGR,MAAMC,EAAWH,EAAKb,EAAUc,GAE1BG,EAASF,EAAOC,EAAWA,EAAW,EACtCE,EAASH,EAFEC,EAAWF,EAEK,EAAIE,EAAW,EAAIX,EAGpD,KAAOnG,EAAI+G,GAAU9G,EAAI+G,GACxBN,EAAIlM,KAAK,GACTwF,IACAC,IAGG4G,GACHH,EAAIlM,KAAK,GACTyF,MAEAyG,EAAIlM,KAAK,GACTwF,KAEDmG,EAAIS,CACL,CAGA,MAAMK,EAAgC,GACtC,IAAIC,EAAQb,EACRc,EAAQd,EACRb,EAAc,GACdC,EAAc,GACd2B,GAAS,EACTC,GAAS,EAEb,MAAMC,EAAQ,MACE,IAAXF,IACHH,EAAQzM,KAAK,CAAE8K,OAAQ8B,EAAQ7B,OAAQ8B,EAAQ7B,SAAQC,WACvDD,EAAS,GACTC,EAAS,GACT2B,GAAS,IAIX,IAAK,IAAI9G,EAAIoG,EAAIrG,OAAS,EAAGC,GAAK,EAAGA,IAAK,CACzC,MAAMiH,EAAKb,EAAIpG,GACJ,IAAPiH,GACHD,IACAJ,IACAC,KACiB,IAAPI,IACK,IAAXH,IACHA,EAASF,EACTG,EAASF,GAEV1B,EAAOjL,KAAKwK,EAAEmC,SAEC,IAAXC,IACHA,EAASF,EACTG,EAASF,GAEV3B,EAAOhL,KAAKuK,EAAEmC,MAEhB,CAEA,OADAI,IACOL,CACR,SClKA,MAAMO,EAAStM,OAAO,UAChB9B,EAAQ8B,OAAO,SAOrB,SAASuM,EAAY5E,GACpB,OAAQA,EAAyB2E,EAClC,CAEA,SAASE,EAAW7E,GACnB,OAAQA,EAAyBzJ,EAClC,CAEA,MAAMuO,EAAgB,CACrB,EAAAC,CACCC,EACAC,GAEA,MACMC,EAAWN,EADJ/M,MAEb,GAA6B,iBAAlBmN,EACV,IAAK,MAAMG,KAAKhL,OAAO+D,KAAK8G,GAC3BnN,KAAKkN,GAAGI,EAAGH,EAAcG,SAEpB,QAAW7F,IAAP2F,EAAkB,CAC5B,MAAMG,EAAYF,EAASpM,IAAIkM,IAAkB,IAAIxO,IAChD4O,EAAU9K,IAAI2K,IAAKG,EAAUxO,IAAIqO,GACtCC,EAAShM,IAAI8L,EAAeI,EAC7B,CACA,MAAO,IAAMvN,KAAKwN,IAAIL,EAAeC,EACtC,EACA,GAAAI,CACCL,EACAC,GAEA,MACMC,EAAWN,EADJ/M,MAEb,GAA6B,iBAAlBmN,EACV,IAAK,MAAMG,KAAKhL,OAAO+D,KAAK8G,GAC3BnN,KAAKwN,IAAIF,EAAGH,EAAcG,SAErB,GAAIF,QAAiC,CAC3C,MAAMG,EAAYF,EAASpM,IAAIkM,GAC3BI,IACHA,EAAUvO,OAAOoO,GACZG,EAAUnM,MAAMiM,EAASrO,OAAOmO,GAEvC,MAECE,EAASrO,OAAOmO,EAElB,EACA,IAAAM,CACCC,KACG/N,GAEH,MAAMgO,EAAO3N,KACPuN,EAAYR,EAAYY,GAAM1M,IAAIyM,GACxC,GAAIH,EAAW,IAAK,MAAMH,KAAMG,EAAWH,EAAGrN,MAAMC,KAAML,GAC1D,IAAK,MAAMyN,KAAMJ,EAAWW,GAAOP,EAAGjM,KAAKnB,KAAM0N,KAAU/N,EAC5D,GAGD,SAASiO,EACRC,EACAC,EACAC,GAEA,MAAM1I,EAAQ,IAAI/B,IAClB,OAAO,IAAIU,MAAM8J,EAAK,CACrB,GAAA7M,CAAIkH,EAAQvD,GACX,GAAoB,iBAATA,EACV,OAAQuD,EAAwDvD,GACjE,GAAImJ,IAAQhB,EAAYc,GAAUpL,IAAImC,KAAUoI,EAAWa,GAAUzM,KAAM,MAAO,OAGlF,IAAI4M,EAAS3I,EAAMpE,IAAI2D,GAKvB,OAJKoJ,IACJA,EAAS,IAAIrO,IAAgBmO,EAAI/N,MAAM8N,EAAU,CAACjJ,KAASjF,IAC3D0F,EAAMhE,IAAIuD,EAAMoJ,IAEVA,CACR,GAEF,CAOmBC,EAAAnB,IACApO,ECtDnB,MAAMwP,EAAyB1N,OAAO,oCAmDtB2N,EACf1O,EACA2O,EAA+B,IAE/B,MAAMC,EAAwC,CAC7CC,cAAeF,EAAQE,eAAiB,EACxCtH,KAAMoH,EAAQpH,OAASvH,EAAGuH,MAAQ,YAClCuH,OAAQH,EAAQG,UAAYC,EAASvL,IAvCvC,SAA4CuL,EAAiBvL,GAM5D,OALAX,OAAOO,eAAeI,EAAU,OAAQ,CACvCT,MAAOgM,EACP1H,UAAU,EACV/D,cAAc,IAERE,CACR,CAgCoDwL,CAAeD,EAASvL,IAE1EyL,KAAMN,EAAQM,MAAI,CAAM3G,IAAiC,GACzD4G,oBAAqBP,EAAQO,qBAI9B,OAFElP,EAA8DyO,GAA0BG,EAEnF,IAAIrK,MAAMvE,EAAI,CACpBwB,IAAG,CAACkH,EAAQvD,EAAMC,IACbD,IAASsJ,EAA+BG,EACrCtK,QAAQ9C,IAAIkH,EAAQvD,EAAMC,GAElC,KAAA9E,CAAMoI,EAAQyG,EAASjP,GACtB,GAlE6B6C,EAkEF7C,EAAK,GAhEjCwD,MAAMuC,QAAQlD,IACdF,OAAOiE,OAAO/D,EAAO,QACrBW,MAAMuC,QAASlD,EAA0CqM,KA8DnB,CACpC,MAAML,EA3DV,SAAwBM,EAA+BnM,GACtD,IAAIoM,EAASD,EAAQ,IAAM,GAC3B,IAAK,IAAIlJ,EAAI,EAAGA,EAAIjD,EAAOgD,OAAQC,IAAKmJ,GAAU7K,OAAOvB,EAAOiD,KAAOkJ,EAAQlJ,EAAI,IAAM,IACzF,OAAOmJ,CACR,CAuDoBC,CAAerP,EAAK,GAAIA,EAAKqL,MAAM,IACnD,OAAO,YAAyCiE,GAC/C,MAAMhM,EAAWgM,EAASZ,EAASC,eACnC,GAAwB,mBAAbrL,EACV,MAAM,IAAIQ,UACT,GAAG4K,EAASrH,4DAA4DqH,EAASC,iBAEnF,MAAMY,EAAW,IAAID,GAKrB,OAJAC,EAASb,EAASC,eAAiBD,EAASE,OAC3CC,EACAvL,GAEMc,QAAQhE,MAAMoI,EAAQnI,KAAMkP,EACpC,CACD,CAjFH,IAAgC1M,EAkF7B,MAAMS,EAAWtD,EAAK0O,EAASC,eAC/B,GAAwB,mBAAbrL,GA5Dd,SAA6BA,GAC5B,OAAQA,EAAS+D,MAA0B,cAAlB/D,EAAS+D,IACnC,CA0DyCmI,CAAoBlM,GAAW,EACjDoL,EAASM,sBAAsB1L,EAAUtD,KAA0B,IAErF0O,EAASK,KACR,GAAGL,EAASrH,4FACGqH,EAASrH,mCACTqH,EAASrH,mIAG3B,CACA,OAAOjD,QAAQhE,MAAMoI,EAAQyG,EAASjP,EACvC,GAEF,CAEM,SAAUyP,EAAsCC,EAAqBlH,GAC1E,MAAMkG,EAAYgB,EACjBnB,GAED,OAAOG,EAAYF,EAAUhG,EAAQkG,GAAkBlG,CACxD,CAKM,SAAUmH,EACf7P,EACA8P,GAKA,OAFE9P,EAAW8P,QAAUA,EAEhB,IAAIvL,MAAMvE,EAAI,CACpBwB,IAAG,CAACkH,EAAQvD,EAAMC,IACbD,KAAQ2K,EACJxL,QAAQ9C,IAAIsO,EAAS3K,EAAMC,GAE3BsD,EAAevD,IAG1B,CAqCM,SAAU4K,EACf/P,EACAgQ,EACAC,EAGI,CAAA,GAGJ,MAAMC,EAAcD,EAAKE,cAAiBnQ,EAAWmQ,cAAgBnQ,EAAGkG,OAElEmI,EAAM,YAA4CnO,GACvD,MAAMkQ,EAAU,IAAIlQ,GAGpB,KAAOkQ,EAAQlK,QAAUgK,GACxBE,EAAQ/P,UAAK2H,GAGd,MAAMqI,EAAiBD,EAAQF,GACzBI,EACc,OAAnBD,GAC0B,iBAAnBA,IACN3M,MAAMuC,QAAQoK,GAIhB,OAFAD,EAAQF,GAAeI,EAAW,IAAKN,KAAmBK,GAAmBL,EAEtEhQ,EAAGM,MAAMC,KAAM6P,EACvB,EAQA,OANIH,EAAK1I,MAAMG,EAAM,GAAG1H,EAAGuH,QAAQ0I,EAAK1I,OAAQ8G,GAGhDxL,OAAOO,eAAeiL,EAAK,SAAU,CAAEtL,MAAO/C,EAAGkG,SAC/CmI,EAAY8B,aAAeD,EAEtBL,EAASF,EAAe3P,EAAIqO,GAAYrO,EAAW8P,SAAW,GACtE,OCrPaS,GAAQxP,OAAO,SAIfyP,GAAQzP,OAAO,eA2Lf0P,GAAe1P,OAAO,sBAStB2P,GACZ,IAAeD,MACd,MAAM,IAAI1M,MAAM,sCACjB,CAKA,UAAImC,GACH,OAAO3F,KAAKkQ,IAAcvK,MAC3B,CAUA,CAACnF,OAAO4P,YACP,OAAOpQ,KAAKkQ,IAAc1P,OAAO4P,WAClC,CAOA,GAAAC,CAAOC,EAAiE1B,GACvE,OAAO5O,KAAKkQ,IAAcG,IAAIC,EAAY1B,EAC3C,CAUA,MAAA2B,CAAOC,EAAsE5B,GAC5E,OAAO5O,KAAKkQ,IAAcK,OAAOC,EAAW5B,EAC7C,CAgBA,MAAA6B,CACCH,EAMAI,GAEA,YAAwBjJ,IAAjBiJ,EACJ1Q,KAAKkQ,IAAcO,OAAOH,EAAYI,GACtC1Q,KAAKkQ,IAAcO,OAAOH,EAC9B,CAgBA,WAAAK,CACCL,EAMAI,GAEA,YAAwBjJ,IAAjBiJ,EACJ1Q,KAAKkQ,IAAcS,YAAYL,EAAYI,GAC3C1Q,KAAKkQ,IAAcS,YAAYL,EACnC,CAKA,OAAAM,CAAQN,EAAoE1B,GAC3E5O,KAAKkQ,IAAcU,QAAQN,EAAY1B,EACxC,CAaA,IAAAiC,CACCL,EACA5B,GAEA,OAAO5O,KAAKkQ,IAAcW,KAAKL,EAAW5B,EAC3C,CAKA,SAAAkC,CACCN,EACA5B,GAEA,OAAO5O,KAAKkQ,IAAcY,UAAUN,EAAW5B,EAChD,CAaA,QAAAmC,CACCP,EACA5B,GAEA,OAAO5O,KAAKkQ,IAAca,SAASP,EAAW5B,EAC/C,CAKA,aAAAoC,CACCR,EACA5B,GAEA,OAAO5O,KAAKkQ,IAAcc,cAAcR,EAAW5B,EACpD,CAKA,QAAArG,CAAS0I,EAAkBC,GAC1B,OAAOlR,KAAKkQ,IAAc3H,SAAS0I,EAAeC,EACnD,CAKA,OAAAC,CAAQF,EAAkBC,GACzB,OAAOlR,KAAKkQ,IAAciB,QAAQF,EAAeC,EAClD,CAKA,WAAAE,CAAYH,EAAkBC,GAC7B,OAAOlR,KAAKkQ,IAAckB,YAAYH,EAAeC,EACtD,CAKA,KAAAlG,CAAMT,EAAgB8G,GACrB,OAAOrR,KAAKkQ,IAAclF,MAAMT,EAAO8G,EACxC,CAOA,MAAAC,IAAUC,GACT,OAAOvR,KAAKkQ,IAAcoB,UAAUC,EACrC,CAKA,KAAAC,CACChB,EACA5B,GAEA,OAAO5O,KAAKkQ,IAAcsB,MAAMhB,EAAW5B,EAC5C,CAKA,IAAA6C,CACCjB,EACA5B,GAEA,OAAO5O,KAAKkQ,IAAcuB,KAAKjB,EAAW5B,EAC3C,CAKA,IAAA8C,CAAKC,GACJ,OAAO3R,KAAKkQ,IAAcwB,KAAKC,EAChC,CAKA,IAAAtL,GACC,OAAOrG,KAAKkQ,IAAc7J,MAC3B,CAKA,MAAA1D,GACC,OAAO3C,KAAKkQ,IAAcvN,QAC3B,CAKA,OAAAiP,GACC,OAAO5R,KAAKkQ,IAAc0B,SAC3B,CAKA,QAAAtN,GACC,OAAOtE,KAAKkQ,IAAc5L,UAC3B,CAKA,cAAAuN,CACCC,EACA1D,GAEA,OAAOpO,KAAKkQ,IAAc2B,eAAeC,EAA8B1D,EACxE,CAKA,EAAA2D,CAAGC,GACF,OAAOhS,KAAKkQ,IAAc6B,GAAGC,EAC9B,CAKA,IAAAC,CAAKC,GACJ,OAAOlS,KAAKkQ,IAAc+B,KAAKC,EAChC,CAMA,OAAAC,CACClP,EACA2L,GAEA,OAAO5O,KAAKkQ,IAAciC,QAAQlP,EAAiB2L,EACpD,CAKA,UAAAwD,GACC,OAAOpS,KAAKkQ,IAAckC,gBAAkB,IAAIpS,KAAKkQ,KAAemC,SACrE,CAKA,QAAAC,CAASC,GACR,OAAOvS,KAAKkQ,IAAcoC,WAAWC,IAAc,IAAIvS,KAAKkQ,KAAesC,KAAKD,EACjF,CAKA,SAAAE,CAAUlI,EAAemI,KAAyBnB,GACjD,YAAoB9J,IAAhBiL,EAAkC1S,KAAKkQ,IAAcuC,UAAUlI,GAC5DvK,KAAKkQ,IAAcuC,UAAUlI,EAAOmI,KAAgBnB,EAC5D,CAKA,KAAKS,EAAexP,GACnB,OAAOxC,KAAKkQ,IAAcyC,KAAKX,EAAOxP,EACvC,CACA,IAAKhC,OAAOoS,eACX,OAAO5S,KAAKkQ,IAAc1P,OAAOoS,YAClC,kBCtgBYC,GAKZ,WAAA/K,CAAY8J,GAKX,GATO5R,KAAA8S,MAAQ,IAAI1T,QACZY,KAAA+S,KAA0C,CAAA,EA8EzC/S,KAAAiO,IAA+B,kBAzEvCjO,KAAKgT,SAAW,IAAItJ,qBAAsBuJ,WAClCjT,KAAK+S,KAAKE,KAEdrB,EAAS,IAAK,MAAOnG,EAAGyH,KAAMtB,EAAS5R,KAAKqB,IAAIoK,EAAGyH,EACxD,CACQ,cAAAC,CAAkB/F,GACzB,MAAM2F,KAAEA,GAAS/S,KACjB,OAAO,YACN,IAAK,MAAMiT,KAAQ3Q,OAAO+D,KAAK0M,GAAO,CACrC,MAAOK,EAAQ5Q,GAASuQ,EAAKE,GACvBhN,EAAMmN,EAAOC,QACfpN,QAAWmH,EAAGnH,EAAKzD,UACXuQ,EAAKE,EAClB,CAEA,CARM,EASR,CACA,KAAAK,GAEC,IAAK,MAAML,KAAQ3Q,OAAO+D,KAAKrG,KAAK+S,MAAO,CAC1C,MAAM9M,EAAMjG,KAAK+S,KAAKE,GAAM,GAAGI,QAC3BpN,GAAKjG,KAAKgT,SAASO,WAAWtN,EACnC,CACAjG,KAAK8S,MAAQ,IAAI1T,QACjBY,KAAK+S,KAAO,CAAA,CACb,CACA,OAAO9M,GACN,MAAMgN,EAAOjT,KAAK8S,MAAM7R,IAAIgF,GAC5B,QAAKgN,WACEjT,KAAK+S,KAAKE,GACjBjT,KAAK8S,MAAM9T,OAAOiH,GAClBjG,KAAKgT,SAASO,WAAWtN,IAClB,EACR,CACA,OAAA2K,CAAQN,EAAwD1B,GAC/D,IAAK,MAAOnD,EAAGyH,KAAMlT,KAAMsQ,EAAWnP,KAAKyN,GAAW5O,KAAMkT,EAAGzH,EAAGmD,GAAW5O,KAC9E,CACA,GAAAiB,CAAIgF,GACH,MAAMgN,EAAOjT,KAAK8S,MAAM7R,IAAIgF,GAC5B,GAAKgN,EACL,OAAOjT,KAAK+S,KAAKE,GAAM,EACxB,CACA,GAAAxQ,CAAIwD,GACH,OAAOjG,KAAK8S,MAAMrQ,IAAIwD,EACvB,CACA,GAAA5E,CAAI4E,EAAQzD,GACX,IAAIyQ,EAAOjT,KAAK8S,MAAM7R,IAAIgF,GAU1B,OATIgN,EACHjT,KAAK+S,KAAKE,GAAM,GAAKzQ,GAErByQ,EAAOO,OAAOC,aACdzT,KAAK8S,MAAMzR,IAAI4E,EAAKgN,GACpBjT,KAAK+S,KAAKE,GAAQ,CAAC,IAAIS,QAAQzN,GAAMzD,GAErCxC,KAAKgT,SAASW,SAAS1N,EAAKgN,EAAMhN,IAE5BjG,IACR,CACA,QAAIoB,GACH,MAAO,IAAIpB,MAAM2F,MAClB,CACA,OAAAiM,GACC,OAAO5R,KAAKmT,eAAe,CAAClN,EAAKzD,IAAU,CAACyD,EAAKzD,GAClD,CACA,IAAA6D,GACC,OAAOrG,KAAKmT,eAAe,CAAClN,EAAK2N,IAAW3N,EAC7C,CACA,MAAAtD,GACC,OAAO3C,KAAKmT,eAAe,CAACU,EAAMrR,IAAUA,EAC7C,CACA,CAAChC,OAAO4P,YACP,OAAOpQ,KAAK4R,SACb,EACU3D,GAAAzN,OAAO0G,kBAOL4M,GAKZ,WAAAhM,CAAY8J,GAKX,GATO5R,KAAA8S,MAAQ,IAAI1T,QACZY,KAAA+S,KAAmC,CAAA,EA0ElC/S,KAAA+T,IAA+B,kBArEvC/T,KAAKgT,SAAW,IAAItJ,qBAAsBuJ,WAClCjT,KAAK+S,KAAKE,KAEdrB,EAAS,IAAK,MAAMnG,KAAKmG,EAAS5R,KAAKjB,IAAI0M,EAChD,CACQ,cAAA0H,CAAkB/F,GACzB,MAAM2F,KAAEA,GAAS/S,KACjB,OAAO,YACN,IAAK,MAAMiT,KAAQ3Q,OAAO+D,KAAK0M,GAAO,CACrC,MAAM9M,EAAM8M,EAAKE,GAAMI,QACnBpN,QAAWmH,EAAGnH,UACN8M,EAAKE,EAClB,CAEA,CAPM,EAQR,CAEA,KAAAK,GAEC,IAAK,MAAML,KAAQ3Q,OAAO+D,KAAKrG,KAAK+S,MAAO,CAC1C,MAAMvQ,EAAQxC,KAAK+S,KAAKE,GAAMI,QAC1B7Q,GAAOxC,KAAKgT,SAASO,WAAW/Q,EACrC,CACAxC,KAAK8S,MAAQ,IAAI1T,QACjBY,KAAK+S,KAAO,CAAA,CACb,CAEA,GAAAhU,CAAIyD,GACH,IAAIyQ,EAAOjT,KAAK8S,MAAM7R,IAAIuB,GAQ1B,OAPKyQ,IACJA,EAAOO,OAAOC,aACdzT,KAAK8S,MAAMzR,IAAImB,EAAOyQ,GACtBjT,KAAK+S,KAAKE,GAAQ,IAAIS,QAAQlR,GAE9BxC,KAAKgT,SAASW,SAASnR,EAAOyQ,EAAMzQ,IAE9BxC,IACR,CACA,OAAOwC,GACN,MAAMyQ,EAAOjT,KAAK8S,MAAM7R,IAAIuB,GAC5B,QAAKyQ,WACEjT,KAAK+S,KAAKE,GACjBjT,KAAK8S,MAAM9T,OAAOwD,GAClBxC,KAAKgT,SAASO,WAAW/Q,IAClB,EACR,CAEA,OAAAoO,CAAQN,EAAwD1B,GAC/D,IAAK,MAAMpM,KAASxC,KAAMsQ,EAAWnP,KAAKyN,GAAW5O,KAAMwC,EAAOA,EAAOoM,GAAW5O,KACrF,CAEA,GAAAyC,CAAID,GACH,OAAOxC,KAAK8S,MAAMrQ,IAAID,EACvB,CACA,QAAIpB,GACH,MAAO,IAAIpB,MAAM2F,MAClB,CACA,OAAAiM,GACC,OAAO5R,KAAKmT,eAAgBlN,GAAQ,CAACA,EAAKA,GAC3C,CACA,IAAAI,GACC,OAAOrG,KAAKmT,eAAgBlN,GAAQA,EACrC,CACA,MAAAtD,GACC,OAAO3C,KAAKmT,eAAgBlN,GAAQA,EACrC,CACA,CAACzF,OAAO4P,YACP,OAAOpQ,KAAKqG,MACb,CAGA,KAAA2N,CAASC,GACR,MAAMC,EAAS,CACd,CAAC1T,OAAO4P,UAAS,IACT6D,EAAM5N,QAGT8N,EAAOnU,KACb,OAAO,IAAIrB,IACV,kBACQwV,EACP,IAAK,MAAM3R,KAAS0R,EAAaC,EAAK1R,IAAiBD,WAAeA,EACtE,CAHD,GAKF,CACA,YAAA4R,CAAqBH,GACpB,MAAME,EAAOnU,KACb,OAAO,IAAIrB,IACV,YACC,IAAK,MAAM6D,KAAS2R,EAAUF,EAAMxR,IAAiBD,WAAsBA,EAC3E,CAFD,GAIF,CACA,UAAA6R,CAAcJ,GACb,MAAME,EAAOnU,KACb,OAAO,IAAIrB,IACV,YACC,IAAK,MAAM6D,KAAS2R,EAAWF,EAAMxR,IAAiBD,WAAkBA,EACxE,CAFD,GAIF,CACA,mBAAA8R,CAAuBL,GACtB,MAAMC,EAAS,CACd,CAAC1T,OAAO4P,UAAS,IACT6D,EAAM5N,QAGT8N,EAAOnU,KACb,OAAO,IAAIrB,IACV,YACC,IAAK,MAAM6D,KAAS2R,EAAWF,EAAMxR,IAAiBD,WAAsBA,GAC5E,IAAK,MAAMA,KAAS0R,EAAaC,EAAK1R,IAAiBD,WAAsBA,EAC7E,CAHD,GAKF,CACA,UAAA+R,CAAWN,GACV,IAAK,MAAMzR,KAASxC,KAAM,IAAKiU,EAAMxR,IAAID,GAAQ,OAAO,EACxD,OAAO,CACR,CACA,YAAAgS,CAAaP,GACZ,MAAMC,EAAS,CACd,CAAC1T,OAAO4P,UAAS,IACT6D,EAAM5N,QAGf,IAAK,MAAM7D,KAAS0R,EAAQ,IAAKlU,KAAKyC,IAAOD,GAAQ,OAAO,EAC5D,OAAO,CACR,CACA,cAAAiS,CAAeR,GACd,IAAK,MAAMzR,KAASxC,KAAM,GAAIiU,EAAMxR,IAAID,GAAQ,OAAO,EACvD,OAAO,CACR,ECxMK,SAAUkS,GACfC,EACAC,GAYA,MAAMC,EAAa,IAAIzV,QAGjB0V,EAAYH,EAAcrS,QAIhC,OAHAuS,EAAWxT,IAAIiB,OAAQwS,GAGhB,IAAI9Q,MAAM8Q,EAAW,CAE3B,KAAA/U,CAAMwJ,EAASwL,EAAUpV,GACxB,GAAoB,IAAhBA,EAAKgG,OACR,MAAM,IAAInC,MAAM,+BAGjB,MAAMwR,EAAYrV,EAAK,GACvB,GAAyB,mBAAdqV,EACV,MAAM,IAAIxR,MAAM,yCAIjB,KACEa,EAAc2Q,IACbA,GAAkC,mBAAdA,GAA4BA,EAAUrT,WAE5D,MAAM,IAAI6B,MAAM,sCAIjB,MAAMwK,EAAS6G,EAAW5T,IAAI+T,GAC9B,GAAIhH,EACH,OAAOA,EAGR,IAAIiH,EAAWD,EACf,GAAIJ,EAAgB,CAEnB,MAAMM,EAAmB,cAAcF,IAGjCG,EAAoBH,EAAUrT,UAC9ByT,EAAmB,IAAIpR,MAAMmR,EAAmB,CACrD,GAAAlU,CAAIkH,EAAQvD,EAAMC,GACjB,MAAMrC,EAAQkC,EAAUzD,IAAIkH,EAAQvD,EAAMC,GAI1C,MACkB,mBAAVrC,GACS,iBAAToC,GACN,CAAC,cAAe,WAAY,WAAW2D,SAAS3D,GAU3CpC,EAPC,YAAwB7C,GAE9B,MAAMqB,EAAU4T,EAAe5U,MAC/B,OAAOwC,EAAMzC,MAAMiB,EAASrB,EAC7B,CAIF,IAID2C,OAAO+S,eAAeH,EAAiBvT,UAAWyT,GAClDH,EAAWC,CACZ,CAGA,MAAMI,EAAaX,EAAcM,GAKjC,OAFAJ,EAAWxT,IAAI2T,EAAWM,GAEnBA,CACR,GAEF,CD+CWvB,GAAAvT,OAAO0G,YElJlB,MAAMqO,GACL,CAACvO,EAAcmB,IACf,IAAIxI,IACIwI,EAAOnB,MAASrH,GAGnB6V,GAAiB,IAAIpW,QACrBuB,GAAY,IAAIvB,QAEtB,SAASiG,GAAM8C,EAAac,GAC3BtI,GAAUU,IAAI4H,EAAId,GAClBqN,GAAenU,IAAI8G,EAAQc,EAC5B,CAQA,MAAMwM,GAA0D,CAE/D,CAACjV,OAAO0G,aAAc,8BACtBjG,IAAG,CAACkH,EAAQvD,IACPA,IAASpE,OAAO0G,YAAoB,eACpB,iBAATtC,GAAqB,CAAC,OAAQ,QAAS,WAAW2D,SAAS3D,GAC9DuD,EAAOvD,GACR8Q,GAAavN,EAAOjI,KAAMyV,GAAMA,EAAE/Q,MAGrCgR,GAAkBzN,IAAW,CAElCjI,KAAMqV,GAAQ,OAAQpN,GACtBvG,MAAO2T,GAAQ,QAASpN,GACxBtG,QAAS0T,GAAQ,UAAWpN,KAEvB0N,GAAwC,CAE7C,CAACrV,OAAO0G,aAAc,4BACtB,GAAAjG,CAAIkH,EAAQvD,EAAMC,GACjB,MAAM4D,EAASnG,OAAO0C,yBAAyBmD,EAAQvD,IAAO3D,IACxDgI,EAAKR,EAASA,EAAOtH,KAAK0D,GAAYsD,EAAOvD,GAEnD,MAAsB,mBAAXuD,EAA8Bc,EAClCyM,GAAazM,EACrB,EACAlJ,MAAK,CAACoI,EAAQyG,EAASjP,IACf+V,GAAavN,EAAOpI,MAAM6O,EAASjP,KAG5C,SAASmW,GAAyCC,GACjD,MAAM9M,EAAK,IAAIjF,MAAM+R,EAAOF,IAE5B,OADAxQ,GAAM0Q,EAAO9M,GACNA,CACR,CAEA,SAAS+M,GAAU1Q,GAClB,OAAOA,GAAK,CAAC,WAAY,UAAUiD,gBAAgBjD,EACpD,CAOM,SAAUoQ,GAAgBK,GAC/B,IAAKC,GAAUD,GAAQ,OAAOA,EAC9B,GAAIP,GAAe/S,IAAIsT,GAAQ,OAAOP,GAAevU,IAAI8U,GACzD,KAAMA,aAAiB5V,SAAU,OAAO2V,GAAYC,GAEpDA,EAAQA,EAAM7V,KAAMyV,GAAOK,GAAUL,GAAKG,GAAYH,GAAKA,GAC3D,MAAMxN,EAAS7F,OAAOC,OAAO,YAAwB5C,GACpD,OAAO+V,GACNK,EAAM7V,KAAMyV,GACJ3V,MAAME,KACVF,KAAKE,KAAM+V,GAAYN,EAAU5V,MAAMkW,EAAGtW,IACzCgW,EAAU5V,MAAMC,KAAML,IAG7B,EAAGiW,GAAeG,IACZG,EAAU,IAAIlS,MACnBmE,EACAsN,IAGD,OADApQ,GAAM0Q,EAAOG,GACNA,CACR,CC1FO,MAAMC,GAGK,IAAM,GAHXA,GAKI,KAAM,IAAI3S,OAAQ4S,MALtBD,GAMEC,GAAmB,CAACA,iqCClBnC,SAASC,GAAOC,GACf,OAAOA,CACR,2DACsBC,GAEX,KAAAC,CAAMhU,GACf,MAAMyJ,EAAOjM,KAAKyW,OAElB,OADAzW,KAAKyW,OAASjU,EACPyJ,CACR,CACU,KAAAyK,CAAMC,GACf3W,KAAKyW,OAASE,CACf,CACA,KAAQnU,EAAsB/C,GAC7B,MAAMkX,EAAU3W,KAAKwW,MAAMhU,GAC3B,IAAIvC,EACJ,IACCA,EAAMR,GACP,SACCO,KAAK0W,MAAMC,EACZ,CAGA,OAAO/X,EAAWK,gBAAgBgB,EACnC,CACA,IAAA2W,CAAQnX,GACP,MAAMwM,EAAOjM,KAAKwW,QAClB,IACC,OAAO/W,GACR,SACCO,KAAK0W,MAAMzK,EACZ,CACD,CACA,SAAI4K,GACH,MAAMJ,EAASzW,KAAKyW,OACpB,OAAOtP,EAAM,GAAGnH,QAAQyW,IAAWhX,GAAOO,KAAK2S,KAAK8D,EAAQhX,GAC7D,EAKK,MAAOqX,WAAgBP,IAKvB,MAAOQ,WAAuBR,GAG5B,GAAA9T,CAAID,GACV,OAAOxC,KAAKuL,QAAQ9I,IAAID,EACzB,CACO,IAAAiP,CAAKjB,GACX,IAAK,MAAMhO,KAASxC,KAAKuL,QAAS,GAAIiF,EAAUhO,GAAQ,OAAO,EAC/D,OAAO,CACR,CACA,WAAAsF,CAAoBkP,EAAuB,IAAIF,IAC9C9O,QADmBhI,KAAAgX,WAAAA,EATZhX,KAAAuL,QAAU,IAAI5M,IAWrB,MAAMgP,EAAO3N,KACbA,KAAKiX,QAAU3U,OAAOsE,OACrBoQ,EACA1U,OAAO4U,0BAA0B,CAChC,UAAIT,GACH,OAAOO,EAAWP,MACnB,EACA,UAAIA,CAAOjU,GACVwU,EAAWP,OAASjU,CACrB,EACA,KAAAgU,CAAMhU,GACL,GAAIA,GAASmL,EAAKpC,QAAQ9I,IAAID,GAC7B,MAAM,IAAIgB,MAAM,4CAEjB,YADciE,IAAVjF,GAAqBmL,EAAKpC,QAAQxM,IAAIyD,GACnC,CAAE2U,MAAO3U,EAAOmU,QAAaK,EAAYR,MAAMhU,GACvD,EACAkU,MAAMC,SACiBlP,IAAlBkP,EAAQQ,OAAqBxJ,EAAKpC,QAAQvM,OAAO2X,EAAQQ,OAClDH,EAAYN,MAAMC,EAAQA,YAIzC,CACA,UAAIF,GACH,MAAO,CAAEQ,QAASjX,KAAKgX,WAAWP,OAAQlL,QAAS,IAAI5M,IAAIqB,KAAKuL,SACjE,CACA,UAAIkL,CAAOjU,GACVxC,KAAKuL,QAAU/I,GAAO+I,QAAU,IAAI5M,IAAI6D,EAAM+I,SAAW,IAAI5M,IAC7DqB,KAAKgX,WAAWP,OAASjU,GAAOyU,OACjC,EAGK,MAAOG,WAAuBb,GAEnC,WAAAzO,IAAeuP,GACdrP,QAFDsP,GAAAjW,IAAArB,KAAS,IAAIrB,KAGZ,IAAK,MAAM2X,KAAKe,EAAOE,GAAAvX,KAAIsX,GAAA,KAAQvY,IAAIuX,EACxC,CACA,UAAIG,GACH,MAAMxN,EAAK,IAAI3F,IACf,IAAK,MAAMgT,KAAKiB,GAAAvX,KAAIsX,GAAA,UAA0B7P,IAAb6O,EAAEG,QAAsBxN,EAAG5H,IAAIiV,EAAGA,EAAEG,QACrE,OAAOxN,CACR,CACA,UAAIwN,CAAOjU,GACV,IAAK,MAAM8T,KAAKiB,GAAAvX,KAAIsX,GAAA,KAAShB,EAAEG,OAASjU,GAAOvB,IAAIqV,EACpD,CACA,KAAAE,CAAMhU,GACL,MAAMmU,EAAU,IAAIrT,IACpB,IAAK,MAAMgT,KAAKiB,GAAAvX,KAAIsX,GAAA,KAAS,CAC5B,MAAMpE,EAAI1Q,GAAOvB,IAAIqV,GACrBK,EAAQtV,IAAIiV,EAAGD,GAAIC,GAAGE,MAAMtD,GAC7B,CACA,OAAOyD,CACR,CACA,KAAAD,CAAMC,GACL,IAAK,MAAML,KAAKiB,GAAAvX,KAAIsX,GAAA,KAASjB,GAAIC,GAAGI,MAAMC,EAAQ1V,IAAIqV,GACvD,CACA,GAAAvX,CAAIuX,GACHiB,GAAAvX,KAAIsX,GAAA,KAAQvY,IAAIuX,EACjB,CACA,OAAOA,GACNiB,GAAAvX,KAAIsX,GAAA,KAAQtY,OAAOsX,EACpB,CACA,KAAAhD,GACCiE,GAAAvX,KAAIsX,GAAA,KAAQhE,OACb,iBAcM,MAAMkE,GAAYzQ,EAAI,QAAS,IAAIqQ,IAC1CxY,EAAWC,QAAQ,KAElB,MAAM4Y,EAAOD,GAAUf,OACvB,MAAO,KAEN,MAAMxK,EAAOuL,GAAUf,OAEvB,OADAe,GAAUf,OAASgB,EACZ,KAEND,GAAUf,OAASxK,MCvJf,MAAMyL,GAAqBlX,OAAO,iBAOlC,IAAImX,GAA0B,IAAIvY,QAG9BwY,GAAW,IAAIxY,QAGfyY,GAAc,IAAIzY,QAEvB,SAAU0Y,GAAcC,GAC7B,IAAIC,EAAOH,GAAY5W,IAAI8W,GAK3B,OAJKC,IACJA,EAAO,CAAA,EACPH,GAAYxW,IAAI0W,EAAQC,IAElBA,CACR,CAGA,IAAIC,GAAe,IAAI7Y,QAgBjB,SAAU8Y,GAAiCzY,EAAOmX,GACvD,MAAMuB,EAAS1Y,EAET2Y,EAAcH,GAAahX,IAAI2V,GAC/ByB,EAAWD,GAAa/E,QAE9B,GAAIgF,GAAYA,IAAa5Y,EAAI,CAChC,MAAM6Y,EAAW1B,EAAK5P,MAAQ,YACxBuR,EAAeF,EAASrR,MAAQ,YAChCwR,EAAS/Y,EAAGuH,MAAQ,YAC1B,MAAM,IAAIxD,MACT,kDAAkD8U,uCAA8CC,4BACvEC,iEAE3B,CAQA,OAJAP,GAAa5W,IAAIuV,EAAM,IAAIlD,QAAQjU,IAGnC0Y,EAAOT,IAAsBe,GAAQ7B,GAC9BuB,CACR,CAOM,SAAUM,GAAwChZ,GACvD,KAAOA,GAAI,CACV,MAAMkW,EAAKlW,EAA0BiY,IACrC,IAAK/B,EAAG,MACRlW,EAAKkW,CACN,CACA,OAAOlW,CACR,CC5EO,MAAMiZ,GAAgB3R,EAAI,gBAAiB,IAAIgQ,IACtDhQ,EAAI,wBAAyB2R,GAAczB,SAC3CO,GAAUzY,IAAI2Z,IACP,MAAMC,GAAiB5R,EAAI,iBAAkB,IAAI+P,IACxDU,GAAUzY,IAAI4Z,IAMP,MAAMC,GAAmB7R,EAAI,mBAAoB,IAAIqQ,GAAesB,GAAczB,UAGnF,SAAU4B,GAAoBnW,GACnC,MAAMoW,EAAWH,GAAelC,OAChC,IAAKqC,EAAU,OAAOpW,EACtB,IAAKA,EAAQ,OAAOoW,EACpB,IAAIC,EAAqCrW,EACzC,KAAOqW,GAAS,CACf,GACkB,aAAjBA,EAAQC,MACU,aAAlBF,EAASE,MACTD,EAAQE,SAAWH,EAASG,OAE5B,OAAOvW,EACRqW,EAAUA,EAAQG,KACnB,CACA,MAAO,IAAKxW,EAAQwW,MAAOL,GAAoBnW,EAAOwW,OACvD,CAEM,SAAUC,GAAUpB,GACzB,MAAMnB,EAAO6B,GAAQV,GACrB,OAAOW,GAAcjH,KAAMnE,GAAMmL,GAAQnL,KAAOsJ,EACjD,UAEgBwC,KACf,OAAOV,GAAczB,QAAQR,MAC9B,CA1BAmC,GAAiB7Z,IAAI4Z,IAiErB,MAAMU,GAAW,IAAIja,iBAyBLka,GACf3U,KACG4U,GAEH,MAAMlY,EAAMgY,GAASpY,IAAI0D,GACzB,GAAKtD,EAKA,IAAK,MAAM5B,KAAM8Z,EAAgB9Z,GAAI4B,EAAItC,IAAIU,QAJjD4Z,GAAShY,IACRsD,EACA,IAAIhG,IAAI4a,EAAWhJ,OAAQ9Q,QAA6CgI,IAAPhI,KAGnE,OAAOkF,CACR,CC3CO,MAAM6U,GACL,eADKA,GAEL,eAuBR,SAASC,IAAc9U,IAAEA,EAAG+U,UAAEA,EAASC,WAAEA,EAAUC,MAAEA,IACpD,MAAMX,EAA4B,UAAnBS,EAAUV,KAAmBU,EAAU7Q,OAAS3E,OAAOwV,EAAU9U,MAC1EiV,EAAmB,CAAC,GAAGH,EAAUV,QAAQC,OAAatU,GAY5D,OAVIgV,IACHE,EAAM/Z,KAAK,8BACX+Z,EAAM/Z,QAAQqW,GAAuBwD,KAGlCC,IACHC,EAAM/Z,KAAK,qBACX+Z,EAAM/Z,QAAQqW,GAAuByD,KAG/BC,CACR,CAkMO,MAAMC,GAAuBtZ,OAAO,yBAK9BuZ,GAAWvZ,OAAO,aAMlBwZ,GAASxZ,OAAO,WA0B7B,IAAYyZ,GAAAA,EAAAA,uBAAAA,GAAAA,GAAAA,EAAAA,oBAAAA,oBAAiB,CAAA,IAC5B,cAAA,iBACAA,GAAA,iBAAA,qBACAA,GAAA,oBAAA,wBACAA,GAAA,gBAAA,oBACAA,GAAA,cAAA,iBACAA,GAAA,cAAA,iBA+CK,MAAOC,WAAsB1W,MAClC,WAAAsE,CACCC,EACOoS,GAEPnS,MAAMD,GAFC/H,KAAAma,UAAAA,EAGPna,KAAKgH,KAAO,eACb,CAEA,QAAIoT,GACH,OAAOpa,KAAKma,WAAWC,IACxB,CAEA,SAAIC,GACH,OAAQra,KAAKma,WAAmBE,KACjC,EAOM,MAAMjM,GAAU,CAKtBoI,MAAQ8D,MAKR5D,MAAQ4D,MAMRpB,MAAO,CAACqB,EAAsBC,OAK9BC,WAAaF,MAIbG,SAAU,OACVC,iBAAmBC,MAQnBC,QAAS,CAACC,EAAWC,EAAuBC,EAAgBC,OAM5DC,kBAAoBZ,MAMpBa,UAAW,CAACb,EAAmBc,OAM/BC,eAAgB,IAMhBC,mBAAoB,GAMpBC,kBAAmB,QAoBnBC,8BAA0B/T,EAyB1BgU,cAAe,cAKfC,mBAAmB,EAMnBC,kBAAmB,IAMnBC,iBAAiB,EAKjBC,iBAAiB,EAOjBC,mBAAmB,EAiBnBC,UAAW,SAEXrN,KAAM,IAAI/O,OAEVqc,MAAO,IAAIrc,OAmBXsc,cAAe,CACdC,cAAe,CAAEC,SAAU,SAC3BC,WAAW,EACXC,eAAe,EACfC,YAAa,cAgBCC,GACfvV,KACGrH,GAEH,MAAMF,EAAK2O,GAAQpH,GACnB,GAAkB,mBAAPvH,EACX,IACGA,KAAmBE,EACtB,CAAE,MAAOqc,GACR5N,GAAQM,KAAK,WAAW1H,UAAcgV,EACvC,CACD,CAGO,MAAMQ,GAAsC,CAClDjB,kBAAmB,QACnBE,cAAe,aACfQ,cAAe,KACfT,8BAA0B/T,GAIdgV,GAAqC,CACjDlB,kBAAmB,OACnBE,cAAe,cACfQ,cAAe,CACdC,cAAe,CAAEC,SAAU,SAC3BC,WAAW,EACXC,eAAe,EACfC,YAAa,IAEdd,8BAA0B/T,GAiBdiV,GAAgB,IAAItd,QACpBud,GAAgB,IAAIvd,QAe3B,SAAUwd,GAAUjY,GACzB,OAAKA,GAAsB,iBAARA,GACXgY,GAAc1b,IAAI0D,IADkBA,CAE7C,CAEM,SAAUkY,GAAWlY,GAC1B,OAAOgY,GAAcla,IAAIkC,EAC1B,CC5qBA,IC4EImY,GD5EAC,GAAmB,IAAI3d,QACvB4d,IAAsB,EAsB1B,SAASC,GAAmBlF,EAAuBpT,EAAaC,GAC/D,MAAMsY,EAAYH,GAAiB9b,IAAI0D,GACvC,GAAKuY,EACL,OAAOA,EAAUjc,IAAI2D,IAAO3D,IAAI8W,IAAWmF,EAAUjc,IAAI8Y,KAAW9Y,IAAI8W,EACzE,UASgBoF,GAAUxY,EAAUC,EAAYmV,IAC/C,GAAIiD,GACH,MAAM,IAAIxZ,MACT,qEAAqEU,OAAOU,SAAYD,KAG1FA,EAAMiY,GAAOjY,GACb,MAAMyY,EAAsBhE,KAG5B,IAAKgE,GAAwC,iBAATxY,GAAqBA,IAASmV,IAAYnV,IAASoV,GACtF,OAED,MAAMhC,EAAOF,GAAcsF,GACvB,mBAAoBpF,GACvBA,EAAKqF,iBAAiB1Y,EAAKC,GAE5B,IAAI0Y,EAAiB1F,GAAS3W,IAAI0D,GAC7B2Y,IACJA,EAAiB,IAAIha,IACrBsU,GAASvW,IAAIsD,EAAK2Y,IAEnB,IAAIC,EAAOD,EAAerc,IAAI2D,GACzB2Y,IACJA,EAAO,IAAI5e,IACX2e,EAAejc,IAAIuD,EAAM2Y,IAE1BA,EAAKxe,IAAIqe,GAGT,MAAMI,EAAgB7F,GAAwB1W,IAAImc,GAC9CI,EACHA,EAAcze,IAAI4F,GAElBgT,GAAwBtW,IAAI+b,EAAqB,IAAIze,IAAI,CAACgG,KAI3D,MAAMuX,EAAgB9N,GAAQ6N,eAAeC,cAC7C,GAAIA,EAAe,CAClB,MAAMuB,EAAgBvB,EAAcC,SACpC,GAAsB,eAAlBsB,GAAoD,SAAlBA,EAA0B,CAC/D,IAAIP,EAAYH,GAAiB9b,IAAI0D,GAChCuY,IACJA,EAAY,IAAI5Z,IAChByZ,GAAiB1b,IAAIsD,EAAKuY,IAE3B,IAAIQ,EAAaR,EAAUjc,IAAI2D,GAC1B8Y,IACJA,EAAa,IAAIpa,IACjB4Z,EAAU7b,IAAIuD,EAAM8Y,IAErBA,EAAWrc,IAAI+b,EAAqBjH,KACrC,CACD,CACD,CCpDA,SAASwH,GAAiBC,GACzB,MAAMC,EAAO,IAAIva,IACjB,IAAK,IAAIsC,EAAI,EAAGA,EAAIgY,EAAMjY,OAAQC,IAAK,CACtC,MAAMgR,EAAOgH,EAAMhY,GACnB,GAAIiY,EAAKpb,IAAImU,GACZ,OAAOgH,EAAM5S,MAAM6S,EAAK5c,IAAI2V,IAE7BiH,EAAKxc,IAAIuV,EAAMhR,EAChB,CACA,OAAO,IACR,CAKA,SAASkY,GAAYF,EAAmBG,EAAQ,IAC/C,MAAMC,EAAQJ,EAAMvN,IAAKsF,GAAMA,EAAE3O,MAAQ,eACzC,GAAIgX,EAAMrY,QAAUoY,EAAO,OAAOC,EAAMtM,KAAK,OAC7C,MAAMnH,EAAQyT,EAAMhT,MAAM,EAAG,GACvBqG,EAAM2M,EAAMhT,WAClB,MAAO,GAAGT,EAAMmH,KAAK,eAAesM,EAAMrY,OAAS,gBAAgB0L,EAAIK,KAAK,QAC7E,CAEA,SAASuM,GAAmBxe,GAC3B,OAAOA,EAAGuH,KAAO,CAAEgS,KAAM,WAAYC,OAAQxZ,EAAGuH,WAASS,CAC1D,CAcO,MAAMyW,GAAqD,IAAI/a,MAAM,KAYtE,SAAUgb,GAAiBpG,EAAuBpT,EAAU+U,EAAsB9U,GACvF,MAAMgS,EAAO6B,GAAQV,GAErB,IAAK+E,GAAoB,OACzB,IAAIsB,EAAatB,GAAmB7b,IAAI2V,GACnCwH,IACJA,EAAa,IAAI9a,IACjBwZ,GAAmBzb,IAAIuV,EAAMwH,IAE9B,IAAIC,EAAUD,EAAWnd,IAAI0D,GACxB0Z,IACJA,EAAU,IAAI/a,IACd8a,EAAW/c,IAAIsD,EAAK0Z,IAErB,MAAMC,GAASD,EAAQpd,IAAI2D,IAAS,GAAK,EAYzC,GAXAyZ,EAAQhd,IAAIuD,EAAM0Z,GAGlBJ,GAAcK,QAAQ,CACrBxG,SACApT,MACA+U,YACA9U,SAEDsZ,GAAcM,MAEVF,GAASlQ,GAAQkN,mBAAoB,CACxC,MACMvT,EAAU,wCADG6O,EAAK5P,mBACyDsX,0CACjF,GAAkC,UAA9BlQ,GAAQmN,kBACX,MAAM,IAAIrB,GAAcnS,EAAS,CAChCqS,KAAMH,EAAAA,kBAAkBwE,oBACxBH,QACAvG,OAAQnB,IAGVxI,GAAQM,KAAK,cAAc3G,IAC5B,CACD,CAEM,SAAU2W,GAAOC,EAAwB5G,GAE9C,GADAA,IAAAA,EAAWqB,OACNrB,EAAQ,MAAM,IAAIvU,MAAM,mDAC7B,MAAMwU,EAAOF,GAAcC,GACtBC,EAAK4G,SACL5G,EAAK4G,SAAS9e,KAAK6e,GADJ3G,EAAK4G,SAAW,CAACD,EAEtC,CAEO,MAAME,GAAgBH,GAI7B,IAAII,GAAiB,IAAI1f,QACrB2f,GAAoB,IAAI3f,QAKxB4f,GAAgB,IAAI5f,QACpB6f,GAAsB,IAAI7f,QAG1B8f,IAAS,EAQb,SAASC,GACRC,EACAxI,GAEA,IAAIvV,EAAM+d,EAAQne,IAAI2V,GAKtB,OAJKvV,IACJA,EAAM,IAAIyS,GACVsL,EAAQ/d,IAAIuV,EAAMvV,IAEZA,CACR,CAiGA,SAASge,GAAiB9U,EAAiB8G,EAAeiO,GACzD,GAAI/U,IAAU8G,EAAK,OAAO,EAC1B,GAAI9G,IAAU+U,EAAS,OAAO,EAE9B,MAAMC,EAAU,IAAI5gB,IACd6gB,EAAoB,CAACjV,GAI3B,IAHAgV,EAAQxgB,IAAIwL,GACZgV,EAAQxgB,IAAIugB,GAELE,EAAM7Z,OAAS,GAAG,CACxB,MAAMoT,EAAUyG,EAAMC,QAChBC,EAAWZ,GAAe7d,IAAI8X,GACpC,GAAK2G,EAEL,IAAK,MAAMC,KAAQD,EAAU,CAC5B,GAAIC,IAAStO,EAAK,OAAO,EACpBkO,EAAQ9c,IAAIkd,KAChBJ,EAAQxgB,IAAI4gB,GACZH,EAAM1f,KAAK6f,GAEb,CACD,CAEA,OAAO,CACR,CA4HA,MAAMC,GAA2B,GAC3B,SAAUC,GAAW9H,GAC1B,MAAMnB,EAAO6B,GAAQV,GACrB,OAAO6H,GAAWnO,KAAMqO,GAAOA,EAAGhe,IAAIW,IAAImU,GAC3C,CAEA,MAAMmJ,GAAkC,GAoCxC,SAASC,GAA8BC,EAAmBC,GAEzD,MAAMC,EAAelB,GAAoBhe,IAAIif,GAC7C,GAAKC,EAEL,IAAK,MAAMC,KAAmBD,EAE7B,GAAIF,EAAMne,IAAIW,IAAI2d,GAAkB,CACnC,MAAMC,EAAgBJ,EAAMK,UAAUrf,IAAImf,IAAoB,EAC1DC,EAAgB,GACnBJ,EAAMK,UAAUjf,IAAI+e,EAAiBC,EAAgB,EAEvD,CAEF,CAWA,SAASE,GACRC,EACAC,EACAlB,EAAyB,IAAI5gB,IAC7B+hB,EAAmB,IAEnB,GAAIF,IAAcC,EACjB,MAAO,IAAIC,EAAMD,GAGlB,GAAIlB,EAAQ9c,IAAI+d,GACf,MAAO,GAGRjB,EAAQxgB,IAAIyhB,GACZ,MAAMG,EAAU,IAAID,EAAMF,GAEpBd,EAAWZ,GAAe7d,IAAIuf,GACpC,GAAId,EACH,IAAK,MAAMkB,KAAclB,EAAU,CAClC,MAAM3Q,EAASwR,GAASK,EAAYH,EAASlB,EAASoB,GACtD,GAAI5R,EAAOpJ,OAAS,EACnB,OAAOoJ,CAET,CAGD,MAAO,EACR,CAQA,SAAS8R,GAAoBC,EAAsBF,GAGlD,MAAMF,EAAOH,GAASK,EAAYE,GAClC,OAAIJ,EAAK/a,OAAS,EAEV,CAACmb,KAAeJ,GAEjB,EACR,CAsCA,SAASK,GACRhJ,EACAiJ,EACAC,EACAve,GAEA,MAAMsV,EAAOF,GAAcC,GACrBmJ,EAAetB,GAAWA,GAAWja,OAAS,GAEpD,IAAKub,EACJ,OAGD,MAAMtK,EAAO6B,GAAQV,GAGrB,IAAKrV,GAAUsV,EAAKmJ,gBAAiB,CAGpC,GAFAze,EAAS,CAAEsW,KAAM,aAAc0G,SAAU1H,EAAKmJ,iBAE1CH,EAAQ,CACX,MAAMI,EAAatJ,GAAckJ,GAC7BI,EAAWC,gBACd3e,EAAOwW,MAAQkI,EAAWC,cAE5B,CACA3e,EAASmW,GAAoBnW,EAC9B,CAGA,GAFAsV,EAAKmJ,qBAAkB1Z,EAEnB/E,EAAQ,CACX,MAAM2V,EAAWL,EAAKsJ,WACtB,GAAKjJ,EAEE,CACN,MAAMkJ,EAAkB,CACvBC,EACAC,KAEA,GAAkB,eAAdD,EAAKxI,KAER,OADAwI,EAAK9B,SAAS5f,QAAQ2hB,EAAK/B,WACpB,EAER,GAAkB,aAAd8B,EAAKxI,KAAqB,CAC7B,MAAM7Q,EAASqZ,EAAKE,QAAQ7Q,KAAM8E,GAAiB,eAAXA,EAAEqD,MAG1C,GAAI7Q,EAEH,OADAA,EAAOuX,SAAS5f,QAAQ2hB,EAAK/B,WACtB,CAET,CACA,OAAO,GAGY,eAAhBhd,EAAOsW,MACLuI,EAAgBlJ,EAAU3V,KAOH,aAAlB2V,EAASW,KACnBX,EAASqJ,QAAQ5hB,KAAK4C,GAEtBsV,EAAKsJ,WAAa,CAAEtI,KAAM,WAAY0I,QAAS,CAACrJ,EAAU3V,IAE5D,MAnCCsV,EAAKsJ,WAAa5e,CAoCpB,CAIA,GAA8B,eAA1B0L,GAAQqN,cAEPyF,EAAapf,IAAIW,IAAImU,IACxBsK,EAAapf,IAAI9C,OAAO4X,QAIzB,GAAIsK,EAAapf,IAAIW,IAAImU,GACxB,OAKF,IAAIoB,EAAK2J,UAETT,EAAapf,IAAIT,IAAIuV,EAAMmB,GAEvBiJ,GAAkD,eAA1B5S,GAAQqN,eAAgC,CACnE,MAAMqF,EAAarI,GAAQuI,GAI3B,GAtHF,SAA0BF,EAAsBF,GAG/C,GAAIE,IAAeF,EAClB,OAAO,EAMR,MAAMgB,EAAqB3C,GAAoBhe,IAAI2f,GACnD,QAAIgB,GAAoBnf,IAAIqe,EAK7B,CAsGMe,CAAiBf,EAAYlK,GAAO,CACvC,MAAMkL,EAAYjB,GAAoBC,EAAYlK,GAC5CmL,EACLD,EAAUnc,OAAS,EAChB,mBAAmBmc,EAAUzR,IAAKsF,GAAMA,EAAE3O,MAAQ2O,EAAErR,YAAYoN,KAAK,SACrE,mBAAmBoP,EAAW9Z,MAAQ8Z,EAAWxc,gBAAgBsS,EAAK5P,MAAQ4P,EAAKtS,wBAEvF4c,EAAapf,IAAI9C,OAAO4X,GACxB,MAAMoL,EAAc7L,GAA2B4B,GACzCkK,EAAUnK,GAAcC,GAAQmK,cAEtC,MAAM,IAAIhI,GAAc,cAAc6H,IAAgB,CACrD3H,KAAMH,EAAAA,kBAAkBkI,cACxBC,MAAON,EAAUzR,IAAKsF,GAAMA,EAAE3O,MAAQ2O,EAAErR,YACxC+d,QAASN,EACTC,cACAC,WAEF,EAnfF,SAAsBnB,EAAsBF,GAC3C,GAA8B,eAA1BxS,GAAQqN,cAAgC,OAE5C,MAAMiE,EAAWZ,GAAe7d,IAAI6f,GAEpC,GAAKpB,EAKJA,EAAS3gB,IAAI6hB,OALC,CACd,MAAM0B,EAAc,IAAIxO,GACxBwO,EAAYvjB,IAAI6hB,GAChB9B,GAAezd,IAAIyf,EAAYwB,EAChC,CAKA,IAAIC,EAAcxD,GAAkB9d,IAAI2f,GAiBxC,GAhBK2B,IACJA,EAAc,IAAIzO,GAClBiL,GAAkB1d,IAAIuf,EAAY2B,IAEnCA,EAAYxjB,IAAI+hB,GAYZA,IAAeF,EAClB,OAGD,MAAM4B,EAAgBrD,GAAmBF,GAAqB6B,GACxD2B,EAAUtD,GAAmBH,GAAe4B,GAGlD4B,EAAczjB,IAAI6hB,GAClB6B,EAAQ1jB,IAAI+hB,GAGZ,MAAM4B,EAAa1D,GAAc/d,IAAI6f,GACrC,GAAI4B,EACH,IAAK,MAAMpd,KAAKod,EAEXpd,IAAMsb,IACYzB,GAAmBF,GAAqB3Z,GAChDvG,IAAI6hB,GAClB6B,EAAQ1jB,IAAIuG,IAKd,MAAMqd,EAAmB1D,GAAoBhe,IAAI2f,GACjD,GAAI+B,EACH,IAAK,MAAMpd,KAAKod,EAEXpd,IAAMub,IACM3B,GAAmBH,GAAezZ,GAC1CxG,IAAI+hB,GACZ0B,EAAczjB,IAAIwG,IAKpB,GAAImd,GAAYthB,MAAQuhB,GAAkBvhB,KACzC,IAAK,MAAMkE,KAAKod,EAAY,CAC3B,MAAME,EAAgBzD,GAAmBF,GAAqB3Z,GAC9D,IAAK,MAAMC,KAAKod,EAEXrd,IAAMC,IACVqd,EAAc7jB,IAAIwG,GACF4Z,GAAmBH,GAAezZ,GAC1CxG,IAAIuG,GAEd,CAEF,CAsaEud,CAAa/B,EAAYlK,EAC1B,CACD,CAMM,SAAUkM,GAAgBC,GAC/B,MAAM7B,EAAetB,GAAWA,GAAWja,OAAS,GAC/Cub,EACAA,EAAa8B,UAAUjkB,IAAIgkB,GADbA,GAEpB,CAsBO,MAAME,GAAQH,GA0BrB,SAASI,GACRtM,EACA2I,EACA4D,EACAzC,EACAT,GAEA,GAAIkD,EAAe1gB,IAAImU,GAAO,CAE7B,MAAMwM,EAAa1C,EAAKvP,QAAQyF,GAChC,OAAO8J,EAAK1V,MAAMoY,GAAY9R,OAAO,CAACsF,GACvC,CAEA,GAAI2I,EAAQ9c,IAAImU,GACf,MAAO,GAGR2I,EAAQxgB,IAAI6X,GACZuM,EAAepkB,IAAI6X,GACnB8J,EAAK5gB,KAAK8W,GAIV,MAAM8I,EAAWZ,GAAe7d,IAAI2V,GACpC,GAAI8I,EACH,IAAK,MAAMkB,KAAclB,EACxB,GAAIO,EAAMne,IAAIW,IAAIme,GAAa,CAC9B,MAAMwB,EAAQc,GAAUtC,EAAYrB,EAAS4D,EAAgBzC,EAAMT,GACnE,GAAImC,EAAMzc,OAAS,EAClB,OAAOyc,CAET,CAMF,OAFA1B,EAAKlC,MACL2E,EAAenkB,OAAO4X,GACf,EACR,CAOA,SAASyM,GAAYC,GACpB,MAAMpC,EAAetB,GAAWA,GAAWja,OAAS,GACpD,IAAKub,EAAc,OAAO,KAG1B,IAqEInS,EArEAwU,EAAmC,KACnCC,EAA4B,KAEhC,GAA8B,eAA1BpV,GAAQqN,cAAgC,CAE3C,MAAMgI,EAAQvC,EAAapf,IAAI8P,UAAU+N,OAAOnd,MAC5CihB,KACDD,EAAUD,GAAcE,EAE5B,MAGC,IAAK,MAAO7M,EAAMmB,KAAWmJ,EAAapf,IAAK,CAE9C,GAAiB,KADAof,EAAaZ,UAAUrf,IAAI2V,IAAS,GACjC,CACnB2M,EAAaxL,EACbyL,EAAW5M,EACX,KACD,CACD,CAGD,IAAK2M,EAAY,CAGhB,GAAIrC,EAAapf,IAAIV,KAAO,EAAG,CAC9B,IAAIghB,EA9FP,SAAsBnC,GAGrB,MAAMV,EAAU,IAAI5gB,IACdwkB,EAAiB,IAAIxkB,IACrB+hB,EAAmB,GAEzB,IAAK,MAAO9J,KAASqJ,EAAMne,IAAK,CAC/B,GAAIyd,EAAQ9c,IAAImU,GAAO,SACvB,MAAMwL,EAAQc,GAAUtM,EAAM2I,EAAS4D,EAAgBzC,EAAMT,GAC7D,GAAImC,EAAMzc,OAAS,EAClB,OAAOyc,CAET,CAEA,MAAO,EACR,CA8EesB,CAAaxC,GAGzB,GAAqB,IAAjBkB,EAAMzc,OAGT,IAAK,MAAOiR,KAASsK,EAAapf,IAAK,CACtC,MAAMqe,EAAelB,GAAoBhe,IAAI2V,GAC7C,GAAIuJ,EAAc,CAEjB,IAAK,MAAMwD,KAAexD,EAEzB,GAAIwD,IAAgB/M,GAChBsK,EAAapf,IAAIW,IAAIkhB,GAAc,CACtC,MAAMC,EAA0B3E,GAAoBhe,IAAI0iB,GACxD,GAAIC,GAAyBnhB,IAAImU,GAAO,CAEvCwL,EAAQ,CAACxL,EAAM+M,EAAa/M,GAC5B,KACD,CACD,CAED,GAAIwL,EAAMzc,OAAS,EAAG,KACvB,CACD,CAED,MAAMoc,EACLK,EAAMzc,OAAS,EACZ,mBAAmByc,EAAM/R,IAAKsF,GAAMA,EAAE3O,MAAQ,eAAe0K,KAAK,SAClE,wFAEJ,MAAM,IAAIwI,GAAc,cAAc6H,IAAgB,CACrD3H,KAAMH,EAAAA,kBAAkBkI,cACxBC,MAAOA,EAAM/R,IAAKsF,GAAMA,EAAE3O,MAAQ2O,EAAErR,YACpC+d,QAASN,GAEX,CACA,OAAO,IACR,CAEAuB,EAAiBxjB,KAAK2Y,GAAQ8K,IAE9BxD,GAAejgB,KAAKyjB,GAEpB,IACC,MAAMvL,EAAOF,GAAcyL,GACrB7gB,EAASsV,EAAKsJ,WACpB,GAAItJ,EAAK+K,QAAS,CACjB,MAAMA,EAAU/K,EAAK+K,QACrB/K,EAAK+K,aAAUtb,EACfsb,EAAQrgB,EACT,CACAqM,EAASwU,GACV,SACCxD,GAAevB,KAChB,CAGA,IAAK,IAAI5Y,EAAIga,GAAWja,OAAS,EAAGC,GAAK,EAAGA,IAAK,CAChD,MAAMqa,EAAQL,GAAWha,GACrBqa,EAAMne,IAAIW,IAAI+gB,KACjBvD,EAAMne,IAAI9C,OAAOwkB,GACjBvD,EAAMK,UAAUthB,OAAOwkB,GACvBxD,GAA8BC,EAAOuD,GAEvC,CAEA,OAAOzU,CACR,UAIgBkR,GACflI,EACAkJ,EACAD,GAEA,GAAI9B,GACH,MAAM,IAAIhF,GACT,8FACA,CAAEE,KAAMH,EAAAA,kBAAkB4J,gBAGvB1gB,MAAMuC,QAAQqS,KAASA,EAAS,CAACA,IACtC,MAAM6F,EAAQ7F,EAAO1H,IAAIoI,IAEnBqL,EAAmC,IAAtBlE,GAAWja,OAC9B,GAAIme,EAAY,CACf,GAAKhH,GACA,MAAM,IAAItZ,MAAM,sCADIsZ,GAAqB,IAAIxZ,IAElDiZ,GAAW,aAAcqB,EAC1B,CAGA,MAAMmG,EAAe3K,KACf4K,EAAchD,GAAU+C,EAG9B,IAAKD,IAAe7C,EAAW,CAC9B,IAAK,IAAIrb,EAAI,EAAGA,EAAImS,EAAOpS,OAAQC,IAClCmb,GAAWhJ,EAAOnS,GAAIoe,GAEvB,MACD,CAEA,MAAM9C,EAA2B,CAChCpf,IAAK,IAAIwB,IACTgd,UAAW,IAAIhd,IACf0f,UAAW,IAAIrkB,KAEhBihB,GAAW9f,KAAKohB,GAEhB,IAAI+C,GAAU,EACd,IACC,MAAMX,EAA+B,GAC/BY,EAA+B,CAAA,EAErC,GAAIjD,EAEH,IAAK,IAAIrb,EAAI,EAAGA,EAAImS,EAAOpS,OAAQC,IAAK,CACvCma,GAAejgB,KAAKiY,EAAOnS,IAC3B,IACC,MAAMoS,EAAOF,GAAcC,EAAOnS,IAC5BlD,EAASsV,EAAKsJ,WACpB,GAAItJ,EAAK+K,QAAS,CACjB,MAAMA,EAAU/K,EAAK+K,QACrB/K,EAAK+K,aAAUtb,EACfsb,EAAQrgB,EACT,CACA,MAAMuG,EAAK8O,EAAOnS,UACP6B,IAAPwB,GAAsB,UAAWib,IAAcA,EAAY1hB,MAAQyG,EACxE,SACC8W,GAAevB,MACf0C,EAAapf,IAAI9C,OAAOyZ,GAAQV,EAAOnS,IACxC,CACD,KACM,CAEN,IAAK,IAAIA,EAAI,EAAGA,EAAImS,EAAOpS,OAAQC,IAClCmb,GAAWhJ,EAAOnS,GAAIoe,IA5gB1B,SAA6B/D,GAC5B,GAA8B,eAA1B7R,GAAQqN,cAAgC,OAC5C,MAAM0I,EAAe/K,KACfgL,EAAaD,EAAe1L,GAAQ0L,GAAgB,KAG1DlE,EAAMK,UAAUhN,QAEhB,IAAK,MAAOsD,KAASqJ,EAAMne,IAAK,CAC/B,IAAIuiB,EAAW,EACf,MAAMC,EAAStF,GAAc/d,IAAI2V,GACjC,GAAI0N,EACH,IAAK,MAAMC,KAAaD,EAEnBrE,EAAMne,IAAIW,IAAI8hB,IAAcA,IAAcH,GAAcG,IAAc3N,GACzEyN,IAIHpE,EAAMK,UAAUjf,IAAIuV,EAAMyN,EAC3B,CACD,CAyfGG,CAAoBtD,EACrB,CAGA,KAAOA,EAAapf,IAAIV,KAAO,GAAK8f,EAAa8B,UAAU5hB,KAAO,GACjE,GAAI8f,EAAapf,IAAIV,KAAO,EAAG,CAC9B,GAAIkiB,EAAiB3d,OAASyI,GAAQiN,eAAgB,CACrD,MAAM+G,EAAQzE,GAAiB2F,GACzBmB,EAAQ3G,GAAYwF,GACpBvb,EAAUqa,EACb,6CAA6CtE,GAAYsE,MACzD,oCAAoCqC,KAGjCC,EADcvhB,MAAMse,KAAKP,EAAapf,IAAIuE,QACrBgK,IAAKsF,GAAMA,EAAE3O,MAAQ,eAC1CmT,EAAY,CACjBC,KAAMH,EAAAA,kBAAkB0K,iBACxBrB,mBACAlB,QACAqC,QACApJ,eAAgBjN,GAAQiN,eACxBqJ,OAAQA,EAAO1Z,MAAM,EAAG,IACxB4Z,YAAaF,EAAO/e,OACpBqc,YACCsB,EAAiB3d,OAAS,EACvBwQ,GACA+K,EAAapf,IAAIb,IAAIqiB,EAAiBA,EAAiB3d,OAAS,KAEhE,IAEL,OAAQyI,GAAQmN,mBACf,IAAK,QAEL,IAAK,QAGJ,MAAM,IAAIrB,GAAc,cAAcnS,IAAWoS,GAClD,IAAK,OACJ/L,GAAQM,KACP,cAAc3G,cAAoB2c,EAAO1Z,MAAM,EAAG,IAAI0G,KAAK,QAAQgT,EAAO/e,OAAS,GAAK,MAAQ,OAIpG,CACA,MAAMsD,EAAKoa,GAAYC,QACZ7b,IAAPwB,GAAsB,UAAWib,IAAcA,EAAY1hB,MAAQyG,EACxE,KAAO,CAEN,MAAM+Z,EAAY7f,MAAMse,KAAKP,EAAa8B,WAC1C9B,EAAa8B,UAAU1P,QACvB,IAAK,MAAMuR,KAAY7B,EAAW6B,GACnC,CAGD,OADAZ,GAAU,EACHC,EAAY1hB,KACpB,CAAE,MAAOwZ,GAGR,MAF0B,IAAtB4D,GAAWja,QACd4W,GAAW,QAAS,qDAAsDP,GACrEA,CACP,SACMiI,GAAiC,IAAtBrE,GAAWja,SAC1BuZ,IAAS,GAEVU,GAAWpB,MACe,IAAtBoB,GAAWja,SACdmX,QAAqBrV,EACrB8U,GAAW,YAEb,CACD,CAiCO,MAAMuI,GAAS5b,EAAU,CAC/BL,OAAOsB,GACC,YAAwBxK,GAC9B,MAAMolB,EAAe,IAAM5a,EAASpK,MAAMC,KAAML,GAGhD,OADA2C,OAAOO,eAAekiB,EAAc,OAAQ,CAAEviB,MAAO,UAAU2H,EAASnD,UACjEiZ,GAAM8E,EAA+B,YAC7C,EAEDjc,QACCqB,GAEO,YAAwBxK,GAC9B,MAAMolB,EAAe,IAAM5a,EAASpK,MAAMC,KAAML,GAGhD,OADA2C,OAAOO,eAAekiB,EAAc,OAAQ,CAAEviB,MAAO,UAAU2H,EAASnD,UACjEiZ,GAAM8E,EAA+B,YAC7C,IAcI,SAAUC,GACf/Y,EACAxM,GAGA,OADAwM,IAAAA,EAASyM,GAAcjC,QAChBtP,EAAMqS,GAAoB,IAAI7Z,IAC7B+Y,GAAc/F,KAAK1G,EAAM,IAAMxM,KAAME,IAE9C,CAwBA,MAAM8J,GAAK,IAAIC,qBAAkCC,GAAMA,KA0B1CoO,GAAiB5J,EAC7BhH,EACCqS,GACAlK,EACC,SAAgB7P,EAAoBwlB,EAA+B,IAC9DA,GAAeje,MAAM1E,OAAOO,eAAepD,EAAI,OAAQ,CAAE+C,MAAOyiB,EAAcje,OAElF,MAAM+U,EAAYkJ,GAAelJ,WAAa3N,GAAQ2N,WAAa,SAG7DmJ,EAA2B,KAChC,MAAMlN,EAAOF,GAAcoN,GAE3B,GAAIlN,EAAK+K,QAAS,CACjB,MAAMoC,EAAcnN,EAAK+K,QACzB/K,EAAK+K,aAAUtb,EACf,IACC2d,EAAS,iBAAiB,IACzBD,EACCtM,GACCb,EAAKsJ,YAAc,CAClBtI,KAAM,UACNE,MAAOlB,EAAKqJ,iBAKjB,CAAE,MAAOrF,GAER5N,GAAQM,KAAK,8BAA+BsN,EAC7C,CACD,CAGA,GAAIqJ,EACH,GAAkB,WAAdtJ,GAA0BuJ,EAE7BC,IACAD,IACAA,EAAiB,KACjBD,EAAiB,UACX,GAAkB,WAAdtJ,EAEV,OAMF,GAAIyJ,EAAe,OAEnB,IAAIC,EAeA1W,EAdJ,SAAS2W,EAAgBhjB,GACxB,MAAMijB,EAAYF,EAClBA,OAAkBhe,EAClBke,IAAYjjB,EACb,CAEAkjB,EAAOC,SAAW7N,EAAKsJ,YAAcsE,EAAOC,SAC5C7N,EAAKqJ,cACJrJ,EAAKsJ,aACJsE,EAAOC,WAAgC,IAApBD,EAAOC,SAAoBD,EAAOC,cAAWpe,GAClEuQ,EAAKsJ,gBAAa7Z,EAElB8U,GAAW,QAAS9D,GAAQhZ,IAC5B8c,GAAW,YAAa9D,GAAQhZ,GAAKmmB,EAAOC,UAE5C,IAAInH,EAAS,EAGb,MAAMoH,EAA0B9J,IAC/B,MAAM+J,EAAU/N,EAAK4G,SACflc,EAAwB,CAAEsW,KAAM,QAASgD,SAC/C,GAAI+J,EACH,KAAOrH,EAASqH,EAAQpgB,QAAQ,CAC/B+f,EAAgBhjB,GAChB,IAEC,YADA+iB,EAAkBM,EAAQrH,GAAQ1C,GAEnC,CAAE,MAAOhZ,GACR0b,GACD,CACD,CACD,IAAIsH,EAIG,MAAMhK,EAJD,CACX,MAAMiK,EAAanO,GAAckO,GACjC,IAAIC,EAAWC,aACV,MAAMlK,EADkBiK,EAAWC,aAAalK,EAEtD,GAID,IAAImK,EAFJnO,EAAKkO,aAAeJ,EAGpB,IAIC,GAHA/W,EAASqX,EAAQjf,EAAMqS,GAAoB,IAAM/Z,EAAG0B,KAAK,KAAMykB,KAC/DA,EAAOC,UAAW,EAClBtJ,GAAW,QAAS9c,GAEnBsP,GACkB,mBAAXA,IACY,iBAAXA,KAAyB,SAAUA,IAE3C,MAAM,IAAImL,GAAc,oDAAoDnL,KAE7E,GAAIA,GAA4B,iBAAXA,GAA8C,mBAAhBA,EAAO7O,KAAqB,CAC9E,MAAMmmB,EAAkBtX,EAGxB,IAAIuX,EAA+C,KACnD,MAAMC,EAAgB,IAAIpmB,QAAe,CAACqmB,EAAGnmB,KAC5CimB,EAAejmB,IAGVomB,EAAc,IAAIvM,GACvB,uDAKDmL,EAAiBllB,QAAQ6B,KAAK,CAACqkB,EAAiBE,IAGhDjB,EAAiB,KACZgB,GACHA,EAAaG,IAQfpB,EAAiBA,EACfzjB,MAAOoa,IAGHA,IAAUyK,GACbX,EAAQ9J,KAKTna,QAAQ,KAERmW,EAAKqJ,mBAAgB5Z,GAExB,MAECge,EAAkB1W,CAEpB,CAAE,MAAOiN,GAGRmK,EAAenK,aAAiBxY,MAAQwY,EAAQ,IAAIxY,MAAMU,OAAO8X,GAClE,SAEMqJ,IACJrN,EAAKqJ,mBAAgB5Z,EAEvB,CAGAuQ,EAAK+K,QAAWrgB,IACfsV,EAAK+K,aAAUtb,EACf8d,IACAG,EAAgBhjB,UACTsV,EAAK4G,SAEZ,MAAMpB,EAAgB7F,GAAwB1W,IAAIikB,GAClD,GAAI1H,EAAe,CAClB,IAAK,MAAMkJ,KAAelJ,EAAe,CACxC,MAAMF,EAAiB1F,GAAS3W,IAAIylB,GACpC,GAAIpJ,EAAgB,CACnB,IAAK,MAAO1Y,EAAM2Y,KAASD,EAAe1L,UACzC2L,EAAKve,OAAOkmB,GACM,IAAd3H,EAAKnc,MAAYkc,EAAete,OAAO4F,GAEhB,IAAxB0Y,EAAelc,MAAYwW,GAAS5Y,OAAO0nB,EAChD,CACD,CACA/O,GAAwB3Y,OAAOkmB,EAChC,CAEA,MAAMyB,EAAW3O,EAAK2O,SACtB,GAAIA,EAAU,CACb,MAAMC,EAA6BlkB,EAChB,YAAhBA,EAAOsW,KACNtW,EACA,CAAEsW,KAAM,UAAWgN,OAAQtjB,EAAQwW,MAAOlB,EAAKqJ,eAC/CxI,GAAoB,CAAEG,KAAM,UAAWE,MAAOlB,EAAKqJ,iBAAoB,CACxErI,KAAM,UACNE,MAAOlB,EAAKqJ,eAEf,IAAK,MAAMwF,KAAgBF,EAAUE,EAAaD,UAC3C5O,EAAK2O,QACb,GAGGR,GAAcL,EAAQK,IAIrBnO,EAAOF,GAAcoN,GASrBkB,EAAU1N,GAAczB,QAAQtE,KAAKuS,EAAW,IACrD/d,EAAMqS,GAAoBZ,GAAiB/B,QAEtCiQ,EAAW3f,EAAMqS,GAAoBd,GAAc7B,OACnDmP,EAAStN,GAAczB,QAAQR,OAErCuB,EAAKgO,OAASA,EAGd,IACIe,EADAvB,GAAgB,EAGpB,MAAMI,EAAuB,CAC5BQ,UACAY,OAAQ7f,EAAMqS,GAAqB/Z,GAClCqnB,EAAS3f,EAAMqS,GAAoB,IAAM/Z,EAAG0B,KAAK,SAGlD0kB,UAAU,EACV,UAAIoB,GAIH,OAHKF,IACJA,EAAkB,IAAIG,iBAEhBH,EAAgBE,MACxB,GAED,IAAI5B,EAAsC,KACtCC,EAAsC,KACtCL,GAAe5H,iBAAgBrF,EAAKqF,eAAiB4H,EAAc5H,gBAEvEnF,GAAagN,EAAWzlB,GAGpBwlB,GAAekC,SAClBnP,EAAKoP,UAAW,GASjB,MAAM7B,EAAQ,KACTwB,IACHA,EAAgBxB,MACf,IAAIrL,GAAc,+DAEnB6M,OAAkBtf,IAIpBwY,GAAMiF,EAAW,aAEjB,MAEMmC,EAAc3kB,IACnB,IAAI8iB,EAAJ,CACAA,GAAgB,EAChBxN,EAAK2J,SAAU,EAEf4D,IACID,IACHA,IACAA,EAAiB,KACjBD,EAAiB,MAElB,IACCrN,EAAK+K,UACJlK,GAAoBnW,GAAU,CAAEsW,KAAM,UAAWE,MAAOlB,EAAKqJ,gBAE/D,CAAE,MAAOrF,GAGR5N,GAAQM,KAAK,8BAA+BsN,EAC7C,EA7mCL,SAAgCjE,GAC/B,GAA8B,eAA1B3J,GAAQqN,cAAgC,OAC5C,MAAM7E,EAAO6B,GAAQV,GAGfuP,EAAatI,GAAc/d,IAAI2V,GAC/B2Q,EAAmBtI,GAAoBhe,IAAI2V,GAG3C8I,EAAWZ,GAAe7d,IAAI2V,GACpC,GAAI8I,EAAU,CAEb,IAAK,MAAMkB,KAAclB,EAAU,CAClC,MAAM6C,EAAcxD,GAAkB9d,IAAI2f,GAC1C2B,GAAavjB,OAAO4X,EACrB,CACAkI,GAAe9f,OAAO4X,EACvB,CAGA,MAAM2L,EAAcxD,GAAkB9d,IAAI2V,GAC1C,GAAI2L,EAAa,CAEhB,IAAK,MAAMiF,KAAcjF,EAAa,CACrC,MAAM7C,EAAWZ,GAAe7d,IAAIumB,GACpC9H,GAAU1gB,OAAO4X,EAClB,CACAmI,GAAkB/f,OAAO4X,EAC1B,CASA,GAAI0Q,EAGH,IAAK,MAAM/C,KAAa+C,EAAY,CACnC,MAAMG,EAAoBxI,GAAoBhe,IAAIsjB,GAClD,GAAIkD,IAEHA,EAAkBzoB,OAAO4X,GAErB2Q,GACH,IAAK,MAAM5D,KAAe4D,EAEpBlI,GAAiBkF,EAAWZ,EAAa/M,IAC7C6Q,EAAkBzoB,OAAO2kB,EAK9B,CAGD,GAAI4D,EAGH,IAAK,MAAMnH,KAAmBmH,EAAkB,CAC/C,MAAMG,EAAoB1I,GAAc/d,IAAImf,GAC5C,GAAIsH,IAEHA,EAAkB1oB,OAAO4X,GAErB0Q,GACH,IAAK,MAAMjN,KAASiN,EAEdjI,GAAiBhF,EAAO+F,EAAiBxJ,IAC7C8Q,EAAkB1oB,OAAOqb,EAK9B,CAKD,GAAIiN,GAAcC,EACjB,IAAK,MAAMjiB,KAAKgiB,EAAY,CAC3B,MAAM1E,EAAgB3D,GAAoBhe,IAAIqE,GAC9C,GAAIsd,EACH,IAAK,MAAMrd,KAAKgiB,EAGf,IAAKlI,GAAiB/Z,EAAGC,EAAGqR,GAAO,CAClCgM,EAAc5jB,OAAOuG,GACrB,MAAMoiB,EAAU3I,GAAc/d,IAAIsE,GAClCoiB,GAAS3oB,OAAOsG,EACjB,CAGH,CAID0Z,GAAchgB,OAAO4X,GACrBqI,GAAoBjgB,OAAO4X,EAC5B,CA0gCKgR,CAAuB1C,GACvBzb,GAAG8J,WAAW8T,EArBK,GAuBpB,IA1BsBrB,EA0BJ,CACjB,MAAM6B,EAAmBnlB,GAA2B2kB,EAAW3kB,GAS/D,OARA+G,GAAGkK,SACFkU,EACA,KACCR,EAAW,CAAErO,KAAM,OACnBuD,GAAW,mBAAoB9c,IAEhC4nB,GAEMQ,CACR,CAEA,GAAI7B,EAAQ,CACX,MAAMC,EAAanO,GAAckO,GAC5BC,EAAWU,WACfV,EAAWU,SAAW,IAAIhoB,KAE3B,MAAMgoB,EAAWV,EAAWU,SAEtBmB,EAAoBplB,IACzBikB,EAAS3nB,OAAO8oB,GAEhBT,EAAW3kB,IAGZ,OADAikB,EAAS5nB,IAAI+oB,GACNA,CACR,CAEA,OAAQplB,GAAW2kB,EAAW3kB,EAC/B,EACA,CACC,UAAIykB,GACH,OAAO3X,EAAcxP,KAAM,CAAEmnB,QAAQ,GAAQ,CAAEngB,KAAM,UACtD,EACA,KAAAG,CAAMH,GACL,OAAOwI,EAAcxP,KAAM,CAAEgH,QAAQ,CAAEA,KAAM,SAC9C,KAIH,CACCA,KAAM,SACN0H,KAAO3G,GAAYqG,GAAQM,KAAK,cAAc3G,KAC9C4G,oBAAqB,CAACoZ,EAAWpoB,MAC9BA,EAAK,IAAyB,iBAAZA,EAAK,IAAmB,SAAUA,EAAK,MAWjDylB,GAAmCjX,EAAU,SAAsB1O,GAC/E,MAAMqZ,EAAWmF,GAAmBxe,GACpC,OAAOqZ,EACJH,GAAehG,KAAKmG,EAAU,IAAMJ,GAAczB,QAAQL,KAAKnX,IAC/DiZ,GAAczB,QAAQL,KAAKnX,EAC/B,GAOamX,GAA8BzI,EAAU,SAAiB1O,GACrE,MAAMqZ,EAAWmF,GAAmBxe,GACpC,OAAOqZ,EACJH,GAAehG,KAAKmG,EAAU,IAAMJ,GAAc9B,KAAKnX,IACvDiZ,GAAc9B,KAAKnX,EACvB,GCr+CO,MAAMuoB,GAAgB,IAAI5oB,QAGpB6oB,GAA0B,IAAI1kB,QAC3C,IAAI2kB,GAAmB,EAMhB,MAAMC,GAAe,IAAI/oB,QAGnBgpB,GAA6B,IAAIhpB,iBAK9BipB,GAAiBC,EAAetC,EAAgBphB,GAC/D,IAAI2jB,EAAUP,GAAc/mB,IAAIqnB,GAC3BC,IACJA,EAAU,IAAI5pB,IACdqpB,GAAc3mB,IAAIinB,EAAOC,IAE1BA,EAAQxpB,IAAI,CAAEinB,SAAQphB,QACvB,UAKgB4jB,GAAoBF,EAAetC,EAAgBphB,GAClE,MAAM2jB,EAAUP,GAAc/mB,IAAIqnB,GAClC,GAAIC,EAAS,CACZ,IAAK,MAAME,KAASF,EACnB,GAAIE,EAAMzC,SAAWA,GAAUyC,EAAM7jB,OAASA,EAAM,CACnD2jB,EAAQvpB,OAAOypB,GACf,KACD,CAEoB,IAAjBF,EAAQnnB,MACX4mB,GAAchpB,OAAOspB,EAEvB,CACD,CAKM,SAAUI,GAAoB/jB,GAEnC,QAAKujB,OAEDD,GAAwBxlB,IAAIkC,IAEzBgkB,GAA0BhkB,GAClC,CAKM,SAAUikB,GAAeC,EAAuBnP,GACrD,MAAM6O,EAAUP,GAAc/mB,IAAI4nB,GAClC,GAAKN,EAEL,IAAK,MAAMvC,OAAEA,KAAYuC,EAAS,CAEjC,MAAMO,EAAqBX,GAAalnB,IAAI+kB,GAC5C,GAAI8C,EAAoB,CACvB,GAAI1a,GAAQ6N,eAAeC,cAAe,CACzC,MACMuB,EADgBrP,GAAQ6N,cAAcC,cACRC,SAEpC,IAAI4M,EACkB,UAAlBtL,GAA+C,SAAlBA,IAChCsL,EAAe5S,MAGhB,IAAK,MAAM6S,KAAWF,EAAoB,CACzC,MAAMG,EACa,eAAlBxL,GAAoD,SAAlBA,EAC/BR,GAAmB+L,EAAShD,EAAQjM,SACpCtS,EAEEuQ,EAAOF,GAAckR,GACtBhR,EAAKmJ,kBAAiBnJ,EAAKmJ,gBAAkB,IAClDnJ,EAAKmJ,gBAAgBrhB,KAAK,CACzB6E,IAAKqhB,EACLtM,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACD,CACA,IAAK,MAAMC,KAAWF,EAAoB7I,GAAM+I,EACjD,CAGAJ,GAAe5C,EAAQtM,EACxB,CACD,CAEA,SAASiP,GAA0BhkB,GAClC,MAAM4jB,EAAUP,GAAc/mB,IAAI0D,GAClC,IAAK4jB,EAAS,OAAO,EAErB,IAAK,MAAMvC,OAAEA,KAAYuC,EAAS,CACjC,GAAIN,GAAwBxlB,IAAIujB,GAAS,OAAO,EAChD,GAAI2C,GAA0B3C,GAAS,OAAO,CAC/C,CACA,OAAO,CACR,CCpGA,MAAMkD,GAAS,IAAI9pB,QAEb,SAAU+pB,GAASxkB,EAAU+U,GAElC,MAAMiG,EAAO,CAAA,EACPyJ,EAAQC,GAFd1kB,EAAMiY,GAAOjY,IAGTykB,GAAO9mB,OAAOC,OAAO6mB,EAAO,CAAE1P,YAAWiG,SAC7CuJ,GAAO7nB,IAAIsD,EAAKgb,EACjB,CAOM,SAAU0J,GAAS1kB,GACxBA,EAAMiY,GAAOjY,GACb,IAAIykB,EAAQF,GAAOjoB,IAAI0D,GAKvB,OAJKykB,IACJA,EAAQ,CAAA,EACRF,GAAO7nB,IAAIsD,EAAKykB,IAEVA,CACR,CAEM,SAAUE,GACf3kB,EACA+U,EACA6P,EACAjM,KACGkM,GAEH,MAAMC,EAAerQ,KACrB,IAAK,MAAM/S,KAAQmjB,EAClB,IAAK,MAAMvjB,KAAOI,EAAM,CACvB,MAAMkX,EAAOD,EAAerc,IAAIgF,GAChC,GAAIsX,EAAM,CAELkM,GAAclM,EAAKve,OAAOyqB,GAC9B,IAAK,MAAM1R,KAAUwF,EAAM,CACLpE,GAAUpB,GAE9BwE,GAAW,oBAAqBxE,GAG5BwR,EAAQ9mB,IAAIsV,KAChBwR,EAAQloB,IAAI0W,EAAQkF,GAAmBlF,EAAQpT,EAAKsB,IAC/C4Z,GAAW9H,IAASoG,GAAiBpG,EAAQpT,EAAK+U,EAAWzT,GAGpE,CACD,CACD,CACF,UAQgByjB,GAAS/kB,EAAU+U,EAAsB9U,GACxDiW,GAAQlW,EAAK+U,EAAW,CAAC9U,GAC1B,UAQgBiW,GAAQlW,EAAU+U,EAAsBiQ,GAEvDR,GADAxkB,EAAMiY,GAAOjY,GACC+U,GACd,MAAM4D,EAAiB1F,GAAS3W,IAAI0D,GACpC,GAAI2Y,EAAgB,CAEnB,MAAMiM,EAAU,IAAIjmB,IACdsmB,GAAc,CAAC,MAAO,cAAcrhB,SAASmR,EAAUV,MAEzD2Q,EAAOL,GAAe3kB,EAAK+U,EAAW6P,EAASjM,EADrCsM,EAAa,CAAC7P,GAAUC,IAAU,CAACD,IACyB4P,GACrEL,GAAe3kB,EAAK+U,EAAW6P,EAASjM,EAAgBA,EAAejX,QAC5E,MAAMqZ,EAAWvc,MAAMse,KAAK8H,EAAQljB,QAC9BojB,EAAerQ,KAGrB,GAFAmD,GAAW,UAAW5X,EAAK+U,EAAWiQ,EAA4BjK,GAE9DtR,GAAQ6N,eAAeC,cAAe,CACzC,MACMuB,EADgBrP,GAAQ6N,cAAcC,cACRC,SAEpC,IAAI4M,EACkB,UAAlBtL,GAA+C,SAAlBA,IAChCsL,EAAe5S,MAGhB,IAAK,MAAO4B,EAAQkR,KAAoBM,EAAS,CAChD,MAAMvR,EAAOF,GAAcC,GACtBC,EAAKmJ,kBAAiBnJ,EAAKmJ,gBAAkB,IAClDnJ,EAAKmJ,gBAAgBrhB,KAAK,CACzB6E,MACA+U,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACD,CACA9I,GAAMP,OAAUjY,EAAWgiB,EAC5B,CAGIxB,GAAwBxlB,IAAIkC,IAC/BikB,GAAejkB,EAAK+U,EAEtB,CCjIO,MAAMmQ,GAASrpB,OAAO,UAYvB,SAAUspB,GAAqCC,EAAU1oB,GAC9D,GAAIyY,MAAwBiQ,EAAO,CAClC,MAAM1R,EAAY0R,EAAyBjQ,IAE3C,IAAiB,IAAbzB,EAAmB,OAAO0R,EAE9B,IAAK1oB,EAEJ,OADE0oB,EAAyBjQ,KAAwB,EAC5CiQ,EAGR,MAAMC,EAAS,IAAIrrB,IAAiB0Z,GAClC0R,EAAyBjQ,IAAwBkQ,EACnD,IAAK,MAAM9qB,KAAKmC,EAAK2oB,EAAOjrB,IAAIG,EACjC,MAEM6qB,EAAyBjQ,KAAwBzY,GAAM,IAAI1C,IAAiB0C,GAClF,OAAO0oB,CACR,CAGM,SAAUE,GAAiBtlB,EAAaC,GAC7C,GAAoB,iBAATA,GAA8B,gBAATA,EAAwB,OAAO,EAC/D,MAAMslB,EAAUvlB,EAAuBmV,IACvC,OACY,IAAXoQ,GACAA,GAAQznB,MAAMmC,KACd,CAEF,CASM,SAAUulB,MAA+DC,GAC9E,IAAK,MAAMC,KAAKD,EAASC,IAAIA,EAAE1oB,UAA6BmY,KAAwB,GACpF,OAAOsQ,EAAI,EACZ,CAEM,SAAUE,GAAc3lB,GAC7B,OAAQA,IAAyD,IAAjDA,EAAuBmV,GACxC,CCxCA,SAASyQ,GAAkB/nB,GAC1B,GAAIW,MAAMuC,QAAQlD,GAAQ,OAAOW,MAAMxB,UACvC,GAAqB,iBAAVa,EACX,IACC,OAAOA,EAAMsF,WACd,CAAE,MACD,MACD,CACD,CAEM,SAAU0iB,GAAmBC,EAAeC,GACjD,OAAID,IAAaC,MAEK,iBAAbD,IAA0BtnB,MAAMuC,QAAQ+kB,IAC3B,iBAAbC,IAA0BvnB,MAAMuC,QAAQglB,OAG7CJ,GAAcG,IACXF,GAAkBE,KAAcF,GAAkBG,IAC1D,CAiCM,SAAUC,GACfC,EACAhmB,EACA6lB,EACAC,EACAG,GAEA,MAAMnR,EAAuB,CAAEV,KAAM6R,EAAc,MAAQ,MAAOjmB,QAElE,GACCwJ,GAAQ0N,wBACKrU,IAAbgjB,GACAD,GAAmBC,EAAUC,GAC5B,CACD,MACMI,EAAS,CAAEnmB,IADIiY,GAAOgO,GACQhmB,QAI9BmmB,EAAU3F,EAAS,sBAAsB,IAC9C4F,GAAeP,EAAUC,EAAU,IAAItrB,QAAW,GAAI0rB,IAKhC,IAAnBC,EAAQplB,OAnDd,SAAyBslB,EAAgBC,GACxC,MAAMC,EAASvT,GAAS3W,IAAIgqB,GAC5B,GAAKE,EAAL,CAEAvT,GAASvW,IAAI6pB,EAAQC,GACrBvT,GAAS5Y,OAAOisB,GAEhB,IAAK,MAAM1N,KAAQ4N,EAAOxoB,SACzB,IAAK,MAAMoV,KAAUwF,EAAM,CAC1B,MAAM6N,EAAUzT,GAAwB1W,IAAI8W,GACxCqT,IACHA,EAAQpsB,OAAOisB,GACfG,EAAQrsB,IAAImsB,GAEd,CAZY,CAcd,CAoCGG,CAAgBzO,GAAO6N,GAAW7N,GAAO8N,IAgKtC,SAAgCY,GACrC,IAAKA,EAAc3lB,OAAQ,OAC3B,MAAM4lB,EAAkB,IAAI5sB,IACtB6sB,EAAe,IAAIloB,IAGnBwnB,EAASQ,EAAc,IAAIR,OACjC,IAAIW,EAGJ,GAAIX,EAAQ,CACXW,EAAiB,IAAI9sB,IACrB,MAAM+sB,EAAiB9T,GAAS3W,IAAI6pB,EAAOnmB,KAC3C,GAAI+mB,EAAgB,CACnB,MAAMC,EAAgB,IAAIroB,IAC1BgmB,GACCwB,EAAOnmB,IACP,CAAEqU,KAAM,MAAOpU,KAAMkmB,EAAOlmB,MAC5B+mB,EACAD,EACA,CAAC3R,IACD,CAAC+Q,EAAOlmB,OAET6mB,EAAiB,IAAI9sB,IAAIgtB,EAActlB,OACxC,CAEA,IAAKolB,GAAgBrqB,KAAM,MAC5B,CAEA,IAAK,MAAMwqB,KAAgBN,EAAe,CACzC,MAAMnjB,OAAEA,EAAMuR,UAAEA,EAAS9U,KAAEA,GAASgnB,EACpC,GAAsB,iBAAXzjB,IAAwBhF,MAAMuC,QAAQyC,GAAS,SAC1D,MAAMxD,EAAMiY,GAAOzU,GACnBghB,GAASxkB,EAAK+U,GACd,MAAM4D,EAAiB1F,GAAS3W,IAAI0D,GACpC,IAAIknB,EACJ,MAAMC,EAAa,CAAClnB,GACpB,GAAI0Y,EAAgB,CACnBuO,EAAiB,IAAIvoB,IAMrB,GAJAgmB,GAAe3kB,EAAK+U,EAAWmS,EAAgBvO,EADd,QAAnB5D,EAAUV,KAAiB,CAACe,GAAUC,IAAU,CAACD,IACO+R,GAIlEhB,GAAUW,EAAgB,CAC7B,MAAMM,EAAkB,IAAIzoB,IAC5B,IAAK,MAAOyU,EAAQiU,KAAeH,GAE9BJ,EAAehpB,IAAIsV,IAAWkU,GAAiBlU,EAAQ0T,KAC1DM,EAAgB1qB,IAAI0W,EAAQiU,GAG9BH,EAAiBE,CAClB,CAEA,IAAK,MAAMhU,KAAU8T,EAAexlB,OAAQ,CAC3CklB,EAAgBxsB,IAAIgZ,GACpB,IAAIuM,EAASkH,EAAavqB,IAAI8W,GACzBuM,IACJA,EAAS,GACTkH,EAAanqB,IAAI0W,EAAQuM,IAE1BA,EAAOxkB,KAAK8rB,EACb,CACD,CACIC,GACHtP,GAAW,UAAW5X,EAAK+U,EAAWoS,EAAY3oB,MAAMse,KAAKoK,EAAexlB,SAEzE4hB,GAAwBxlB,IAAIkC,IAAMikB,GAAejkB,EAAK+U,EAC3D,CACA,GAAI6R,EAAgBnqB,KAAM,CACzB,GAAIgN,GAAQ6N,eAAeC,cAAe,CACzC,MACMuB,EADgBrP,GAAQ6N,cAAcC,cACRC,SAEpC,IAAI4M,EACkB,UAAlBtL,GAA+C,SAAlBA,IAChCsL,EAAe5S,MAGhB,IAAK,MAAM4B,KAAUwT,EAAiB,CACrC,MAAMvT,EAAOF,GAAcC,GACtBC,EAAKmJ,kBAAiBnJ,EAAKmJ,gBAAkB,IAClD,IAAK,MAAMhZ,OAAEA,EAAMuR,UAAEA,EAAS9U,KAAEA,KAAU4mB,EAAavqB,IAAI8W,GAAU,CACpE,MAAMkR,EACa,eAAlBxL,GAAoD,SAAlBA,EAC/BR,GAAmBlF,EAAQ6E,GAAOzU,GAASvD,GAAQmV,SACnDtS,EACJuQ,EAAKmJ,gBAAgBrhB,KAAK,CACzB6E,IAAKiY,GAAOzU,GACZuR,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACD,CACD,CACA9I,GAAM,IAAIsL,GACX,CACD,CAjQGW,CAAsBnB,YFsCKpmB,EAAU+U,EAAsB9U,GAC7DD,EAAMiY,GAAOjY,GACb,MAAM2Y,EAAiB1F,GAAS3W,IAAI0D,GACpC,IAAK2Y,EAAgB,OAErB,MAAMC,EAAOD,EAAerc,IAAI2D,GAChC,IAAK2Y,EAAM,OAEX,MAAMgM,EAAU,IAAI5qB,IACd8qB,EAAerQ,KAEf+S,EAAS/d,GAAQ6N,eAAeC,cAEtC,GAAIiQ,EAAQ,CACX,MAAM1O,EAAgB0O,EAAOhQ,SAE7B,IAAK,MAAMpE,KAAUwF,EAAM,CAC1B,MAAMvF,EAAOF,GAAcC,GAC3B,GAAKC,EAAKoP,SAGV,GADqBjO,GAAUpB,GAE9BwE,GAAW,oBAAqBxE,OADjC,CAKA,GADAwR,EAAQxqB,IAAIgZ,GACRoU,EAAQ,CACX,IAAIpD,EACAE,EAEkB,UAAlBxL,GAA+C,SAAlBA,IAChCsL,EAAe5S,MAEM,eAAlBsH,GAAoD,SAAlBA,IACrCwL,EAAkBhM,GAAmBlF,EAAQpT,EAAKC,IAG9CoT,EAAKmJ,kBAAiBnJ,EAAKmJ,gBAAkB,IAClDnJ,EAAKmJ,gBAAgBrhB,KAAK,CACzB6E,MACA+U,YACAC,WAAYsP,EACZrP,MAAOmP,GAET,CACA5K,GAAiBpG,EAAQpT,EAAK+U,EAAW9U,EArBzC,CAuBD,CACD,MAEC,IAAK,MAAMmT,KAAUwF,EACPzF,GAAcC,GACjBqP,WAEWjO,GAAUpB,GAE9BwE,GAAW,oBAAqBxE,IAGjCwR,EAAQxqB,IAAIgZ,GACZoG,GAAiBpG,EAAQpT,EAAK+U,EAAW9U,KAKvC2kB,EAAQnoB,KAAO,IAClBmb,GAAW,UAAW5X,EAAK+U,EAAW,CAAC9U,GAAOzB,MAAMse,KAAK8H,IACzDtJ,GAAM9c,MAAMse,KAAK8H,QAAU9hB,EAAWgiB,GAExC,CEvGE2C,CAAcxB,EAAWlR,EAAW9U,EACrC,MACC8kB,GAASkB,EAAWlR,EAAW9U,EAEjC,CAqBA,SAASynB,GAAkB1nB,GAC1B,MAAM0B,EAAO,IAAI1H,IAAiBoF,QAAQuoB,QAAQ3nB,IAClD,IAAIolB,EAAQznB,OAAOkD,eAAeb,GAIlC,KAAOolB,IAAUznB,OAAOiE,OAAOwjB,EAAO,gBAAgB,CACrD,IAAK,MAAM9jB,KAAOlC,QAAQuoB,QAAQvC,GAAQ1jB,EAAKtH,IAAIkH,GACnD8jB,EAAQznB,OAAOkD,eAAeukB,EAC/B,CACA,OAAO1jB,CACR,CAEM,SAAU2kB,GACfP,EACAC,EACAnL,EAAwB,IAAIngB,QAC5BksB,EAAuC,GACvCR,GAEA,OAAKN,GAAmBC,EAAUC,GAEZ,iBAAbD,IAA0BtnB,MAAMuC,QAAQ+kB,IAC3B,iBAAbC,IAA0BvnB,MAAMuC,QAAQglB,IAlClD,SAAwBnL,EAAuBgN,EAAgBC,GAC9D,IAAIC,EAASlN,EAAQte,IAAIsrB,GAKzB,OAJKE,IACJA,EAAS,IAAIlpB,QACbgc,EAAQle,IAAIkrB,EAAQE,MAEjBA,EAAOhqB,IAAI+pB,KACfC,EAAO1tB,IAAIytB,IACJ,EACR,CA4BKE,CAAenN,EAASkL,EAAUC,GAD9BY,EAGJnoB,MAAMuC,QAAQ+kB,IAAatnB,MAAMuC,QAAQglB,IAS9C,SACCiC,EACAC,EACAC,EACAvB,EACAR,GAEA,MAAMgC,EAA+B,GAC/BC,EAAYJ,EAAShnB,OACrBqnB,EAAYJ,EAASjnB,OACrBsnB,EAAM/hB,KAAK+hB,IAAIF,EAAWC,GAEhC,IAAK,IAAIhb,EAAQ,EAAGA,EAAQib,EAAKjb,IAAS,CACzC,MAAMkb,EAASlb,EAAQ+a,EACjBI,EAASnb,EAAQgb,EACvB,GAAIE,IAAWC,EAAQ,CACtBL,EAAMhtB,KAAK,CAAEqI,OAAQwkB,EAAUjT,UAAW,CAAEV,KAAM,MAAOpU,KAAMoN,GAASpN,KAAMoN,EAAO8Y,WACrF,QACD,CACA,IAAKoC,GAAUC,EAAQ,CACtBL,EAAMhtB,KAAK,CAAEqI,OAAQwkB,EAAUjT,UAAW,CAAEV,KAAM,MAAOpU,KAAMoN,GAASpN,KAAMoN,EAAO8Y,WACrF,QACD,CACA,IAAKoC,IAAWC,EAAQ,SACxB,MAAMC,EAAWxQ,GAAO+P,EAAS3a,IAC3Bqb,EAAWzQ,GAAOgQ,EAAS5a,IAC5B1P,OAAOgrB,GAAGF,EAAUC,IACxBP,EAAMhtB,KAAK,CAAEqI,OAAQwkB,EAAUjT,UAAW,CAAEV,KAAM,MAAOpU,KAAMoN,GAASpN,KAAMoN,EAAO8Y,UAEvF,CAEIiC,IAAcC,GACjBF,EAAMhtB,KAAK,CACVqI,OAAQwkB,EACRjT,UAAW,CAAEV,KAAM,MAAOpU,KAAM,UAChCA,KAAM,SACNkmB,WAGFQ,EAAcxrB,QAAQgtB,EACvB,CAhDES,CAAkB9C,EAAUC,EAAUnL,EAAS+L,EAAeR,GACvDQ,IAiDT,SACCiB,EACAC,EACAjN,EACA+L,EACAR,GAEA,MAAM0C,EAAUnB,GAAkBE,GAC5BkB,EAAUpB,GAAkBG,GAC5BM,EAA+B,GAErC,IAAK,MAAM7mB,KAAOunB,EACZC,EAAQhrB,IAAIwD,IAChB6mB,EAAMhtB,KAAK,CAAEqI,OAAQokB,EAAQ7S,UAAW,CAAEV,KAAM,MAAOpU,KAAMqB,GAAOrB,KAAMqB,EAAK6kB,WAEjF,IAAK,MAAM7kB,KAAOwnB,EAAS,CAC1B,IAAKD,EAAQ/qB,IAAIwD,GAAM,CACtB6mB,EAAMhtB,KAAK,CAAEqI,OAAQokB,EAAQ7S,UAAW,CAAEV,KAAM,MAAOpU,KAAMqB,GAAOrB,KAAMqB,EAAK6kB,WAC/E,QACD,CACA,MAAMsC,EAAWxQ,GAAQ2P,EAAetmB,IAClConB,EAAWzQ,GAAQ4P,EAAevmB,IACpCukB,GAAmB4C,EAAUC,GAChCrC,GAAeoC,EAAUC,EAAU9N,EAAS+L,EAAeR,GAChDxoB,OAAOgrB,GAAGF,EAAUC,IAC/BP,EAAMhtB,KAAK,CAAEqI,OAAQokB,EAAQ7S,UAAW,CAAEV,KAAM,MAAOpU,KAAMqB,GAAOrB,KAAMqB,EAAK6kB,UAEjF,CAEAQ,EAAcxrB,QAAQgtB,EACvB,CA5ECY,CAAqBjD,EAAUC,EAAUnL,EAAS+L,EAAeR,GAC1DQ,GAd6CA,CAerD,CA+EA,SAASW,GACRlU,EACA4V,GAEA,IAAI5U,EAAqDhB,EACzD,MAAMwH,EAAU,IAAIhc,QACpB,KAAOwV,IAAYwG,EAAQ9c,IAAIsW,IAAU,CAExC,GADAwG,EAAQxgB,IAAIga,GACR4U,EAAWlrB,IAAIsW,GAAU,OAAO,EAEpCA,EADajB,GAAciB,GACZiN,MAChB,CACA,OAAO,CACR,CDlMAmE,GAAiB/mB,KAAMa,OAAQT,MAAOrD,QAASkD,UACzB,oBAAXuqB,UAjBL,YAA6CjpB,GAClD,IAAK,MAAMkpB,KAAKlpB,EACbkpB,EAAqB/T,KAAwB,EAEzCnV,EAAI,EACZ,CAaCmpB,CAAYF,OAAQG,UACpB5D,GAAiB1lB,KAAMupB,QAASC,YAAaC,YAAaC,eAAgBC,WErCpE,MAAMC,GAAa,IAAIjvB,QACjBkvB,GAAa,IAAIlvB,QACxBmvB,GAAe,IAAInvB,QACnBovB,GAAa,IAAI7vB,IAQjB8vB,GAAe,IAAIrvB,QAGzB,IAAIsvB,IAAoB,EAExB,SAASC,GAAkBhqB,EAAUC,EAAmBpC,GACvD,IAAKqa,GAAWra,IAA2B,iBAAVA,GAAgC,OAAVA,EAAgB,CACtE,MAAMosB,EAAgBC,GAAersB,GAOrC,OAJIkmB,GAAoB/jB,IACvB0jB,GAAiBuG,EAAejqB,EAAKC,GAG/BgqB,CACR,CACA,OAAOpsB,CACR,CAEA,MAAMssB,GAAgE,CACrE,CAACtuB,OAAO0G,aAAc,iBACtB,GAAAjG,CAAI0D,EAAKC,EAAMC,GACd,GAAI6pB,GAAmB,OAAOhqB,EAAUzD,IAAI0D,EAAKC,EAAMC,GACvD,GAAIF,GAAsB,iBAARA,GAAoBC,IAASpE,OAAO0G,YAAa,CAClE,MAAM6nB,EAAYV,GAAWptB,IAAI0D,EAAImD,aACrC,GAAIinB,GAAazsB,OAAOiE,OAAOwoB,EAAWnqB,GAAO,CAChD,MAAMoqB,EAAO1sB,OAAO0C,yBAAyB+pB,EAAWnqB,GACxD,GAAIoqB,EAAK/tB,IAAK,CACb,IAAKqB,OAAOiE,OAAO5B,EAAKC,GAAO,OAAOoqB,EAAK/tB,IAAIE,KAAKwD,GAEpD,MAAMsqB,EAAU3sB,OAAO0C,yBAAyBL,EAAKC,GACrD,GAAIqqB,EAAQlsB,cAAgBksB,EAAQnoB,UAAYmoB,EAAQhuB,IAAK,OAAO+tB,EAAK/tB,IAAIE,KAAKwD,EACnF,MAAO,IAAKrC,OAAOiE,OAAO5B,EAAKC,GAAO,MAAO,IAAIjF,IAAgBqvB,EAAKxsB,MAAMzC,MAAM4E,EAAKhF,EACxF,CACA,MAAMuvB,EAAYZ,GAAWrtB,IAAI0D,EAAImD,aACrC,GAAIonB,GAAa5sB,OAAOiE,OAAO2oB,EAAWtqB,GAAO,OAAOsqB,EAAUtqB,EACnE,CAEA,GAAoB,iBAATA,GAA8B,gBAATA,GAA0BqlB,GAAiBtlB,EAAKC,GAC/E,OAAOF,EAAUzD,IAAI0D,EAAKC,EAAMC,GAEjC,IAAKuU,KAAmB,CACvB,MAAM5W,GAASisB,GAAaxtB,IAAI0D,IAAM1D,KAAOyD,EAAUzD,KAAK0D,EAAKC,EAAMC,GACvE,OAAO8pB,GAAkBhqB,EAAKC,EAAMpC,EACrC,CAIA,MAAM2sB,EAAY7sB,OAAOiE,OAAO5B,EAAKC,GAK/BwqB,EACLhhB,GAAQyN,iBACRsT,GAC+B,OAA/B7sB,OAAOkD,eAAeb,KACrBG,EAAcD,EAAUD,IAASE,EAAcH,EAAKC,IAItD,IAAIyqB,EAAUF,EACVG,EAAaH,EAAYxqB,OAAM8C,EACnC,IAAK0nB,EAAW,CACf,IAAItgB,EAAMvM,OAAOkD,eAAeb,GAChC,KAAOkK,GAAOA,IAAQvM,OAAOX,WAAW,CACvC,GAAIW,OAAOiE,OAAOsI,EAAKjK,GAAO,CAC7ByqB,GAAU,EACVC,EAAQzgB,EACR,KACD,CACAA,EAAMvM,OAAOkD,eAAeqJ,EAC7B,CACD,CACA,MAAM0gB,EAAoBF,IAAYF,EAIpCE,IACEjhB,GAAQwN,iBAAmB2T,GAAqB5qB,aAAerC,QAChE8sB,IAEFjS,GAAUxY,EAAKC,IAIZ2qB,IAAqBD,GAAWlhB,GAAQwN,iBAAqBjX,aAAerC,QAC/E6a,GAAUmS,EAAO1qB,GAIlB,MAAMpC,GAASisB,GAAaxtB,IAAI0D,IAAM1D,KAAOyD,EAAUzD,KAAK0D,EAAKC,EAAMC,GACvE,OAAO8pB,GAAkBhqB,EAAKC,EAAMpC,EACrC,EACA,GAAAnB,CAAIsD,EAAKC,EAAMpC,EAAOqC,GACrB,MAAM2qB,EAAY5S,GAAO/X,GACzB,GAAIF,IAAQ6qB,EACX,OAAOltB,OAAOO,eAAe2sB,EAAW5qB,EAAM,CAC7CpC,QACAO,cAAc,EACd+D,UAAU,EACV2oB,YAAY,IAEd,GAAIf,GACH,MAAM,IAAIlrB,MAAM,uEAIjB,GAAIymB,GAAiBtlB,EAAKC,GAAO,OAAOF,EAAUrD,IAAIsD,EAAKC,EAAMpC,EAAOqC,GACxE,MAAM6lB,EAAW9N,GAAOpa,GAExB,GAAImC,GAAsB,iBAARA,GAAoBC,IAASpE,OAAO0G,YAAa,CAClE,MAAM6nB,EAAYpqB,EAAImD,aAAeumB,GAAWptB,IAAI0D,EAAImD,aACxD,GAAIinB,GAAazsB,OAAOiE,OAAOwoB,EAAWnqB,GAAO,CAChD,MAAMoqB,EAAO1sB,OAAO0C,yBAAyB+pB,EAAWnqB,GACxD,GAAIoqB,EAAK3tB,IAER,OADA2tB,EAAK3tB,IAAIF,KAAKwD,EAAK+lB,IACZ,CAET,CACD,CAGA,IAAIgF,EAAS7F,GACb,MAAM8F,EAAyB,WAAT/qB,GAAqBzB,MAAMuC,QAAQf,GACzD+pB,IAAoB,EACpB,IACK3qB,QAAQtB,IAAIkC,EAAKC,KACpB8qB,EAASC,EACNpB,GAAattB,IAAI0D,KAAS+lB,EACzBA,EACAb,GACD9lB,QAAQ9C,IAAI0D,EAAKC,EAAMC,GAE5B,SACC6pB,IAAoB,CACrB,CACA,GAAIzG,GAAwBxlB,IAAIkC,KACT,iBAAX+qB,GAAkC,OAAXA,GACjClH,GAAoBkH,EAAQ/qB,EAAKC,GAEV,iBAAb8lB,GAAsC,OAAbA,GAAmB,CAEtDrC,GADsBwG,GAAenE,GACL/lB,EAAKC,EACtC,CAUD,OARI8qB,IAAWhF,GAGVhmB,EAAUrD,IAAIsD,EAAKC,EAAM8lB,EAAU7lB,KAClC8qB,GAAepB,GAAaltB,IAAIsD,EAAK+lB,GACzCC,GAAqBhmB,EAAKC,EAAM8qB,EAAQhF,EAAUgF,IAAW7F,MAGxD,CACR,EACA,GAAApnB,CAAIkC,EAAKC,GACR,GAAI4pB,GAAW/rB,IAAIkC,GAClB,MAAM,IAAIuV,GACT,wEAAwEhW,OAAOU,MAC/E,CACCwV,KAAMH,EAAAA,kBAAkBkI,cACxBC,MAAO,KAGVoM,GAAWzvB,IAAI4F,GACV+pB,IAAsBzE,GAAiBtlB,EAAKC,IAAOuY,GAAUxY,EAAKC,GACvE,MAAMqE,GAAMwlB,GAAaxtB,IAAI0D,IAAMlC,KAAOsB,QAAQtB,KAAKkC,EAAKC,GAE5D,OADA4pB,GAAWxvB,OAAO2F,GACXsE,CACR,EACA,cAAA2mB,CAAejrB,EAAKC,GACnB,IAAKtC,OAAOiE,OAAO5B,EAAKC,GAAO,OAAO,EAEtC,MAAM8qB,EAAU/qB,EAAYC,GAe5B,OAZIqjB,GAAwBxlB,IAAIkC,IAA0B,iBAAX+qB,GAAkC,OAAXA,GACrElH,GAAoBkH,EAAQ/qB,EAAKC,UAG1BD,EAAYC,GACpB8kB,GAAS/kB,EAAK,CAAEqU,KAAM,MAAOpU,QAAQA,GAGjCqjB,GAAwBxlB,IAAIkC,IAC/BikB,GAAejkB,EAAK,CAAEqU,KAAM,MAAOpU,UAG7B,CACR,EACA0nB,QAAQ3nB,IACPwY,GAAUxY,EAAKqV,IACRyU,GAAaxtB,IAAI0D,IAAM2nB,UAAU3nB,IAAQZ,QAAQuoB,QAAQ3nB,IAEjEK,yBAAwB,CAACL,EAAKC,IAE5B6pB,GAAaxtB,IAAI0D,IAAMK,2BAA2BL,EAAKC,IACvDb,QAAQiB,yBAAyBL,EAAKC,IAKnCirB,GAAkB,IAAItsB,QAOfusB,GAAepb,GAAOqb,GAClC,cAA4BA,EAC3B,WAAAjoB,IAAenI,GAKd,OAJAqI,SAASrI,GAIFkwB,GAAgBptB,gBAAkButB,GAAShwB,MAAQA,IAC3D,IAIF,SAAS6uB,GAAkBoB,EAAcC,GACxC,IAAKD,GAAkC,iBAAdA,EAAwB,OAAOA,EACxD,MAAM9nB,EAAS8nB,EAEf,GAAI3F,GAAcniB,GAAS,OAAOA,EAElC,GADgBwU,GAAcla,IAAI0F,GACrB,OAAOA,EAGpB,MAAMkQ,EPuZD,SAA6ClQ,GAClD,OAAOuU,GAAczb,IAAIkH,EAC1B,COzZkBgoB,CAAiBhoB,GAClC,QAAiBV,IAAb4Q,EAAwB,OAAOA,EAE/B6X,GAAUzB,GAAaptB,IAAI8G,EAAQ+nB,GACvC,MAAME,EAAQ,IAAIpsB,MAAMmE,EAAQ2mB,IAIhC,OAHI3rB,MAAMuC,QAAQyC,IAASomB,GAAaltB,IAAI8G,EAAQA,EAAOxC,QP6YtD,SAAiCwC,EAAgBioB,GACtD1T,GAAcrb,IAAI8G,EAAQioB,GAC1BzT,GAActb,IAAI+uB,EAAOjoB,EAC1B,CO9YCkoB,CAAuBloB,EAAQioB,GACxBA,CACR,CAMO,MAAMJ,GAAW9mB,EAAU,CACjC,MAAMiB,GACL,GAAIA,EAASxI,qBAAqBmuB,GAEjC,OADAD,GAAgB9wB,IAAIoL,GACbA,EAGR,MAAMmmB,UAAiBnmB,EACtB,WAAArC,IAAenI,GAQd,OAPAqI,SAASrI,gBACU2wB,GAAaT,GAAgBptB,iBAC/C2L,GAAQM,KACP,GAAIvE,EAAiBnD,8BAA8BhH,KAAK8H,YAAYd,6HAI/DgpB,GAAShwB,KACjB,EAKD,OAHAsC,OAAOO,eAAeytB,EAAU,OAAQ,CACvC9tB,MAAO,YAAY2H,EAASnD,UAEtBspB,CACR,EACArvB,IAAIkJ,GACI0kB,GAAe1kB,GAEvBrB,QAAS+lB,KChPG0B,GAAiBpiB,EAC7B,SACCkB,EACApM,GAEA,MAAMutB,EACa,mBAAXnhB,EACJA,EACAlM,MAAMuC,QAAQ2J,GACb,IAAMlM,MAAMse,KAAK,CAAE9b,OAAQ0J,EAAO1J,QAAU,CAAC6gB,EAAG5gB,IAAMA,GACtDyJ,aAAkB/L,IACjB,IAAM+L,EAAOhJ,OACbgJ,aAAkB1Q,IACjB,IAAM0Q,EAAO1M,SACb,IAAML,OAAO+D,KAAKgJ,GAEnBohB,EAAa,IAAIntB,IACjBotB,EAAgBztB,EAAS+D,KAAO/D,EAAS+D,KAAO,GAEhD2pB,EAAQ5Y,EAAM,SAAS,EAAGiP,aAC/B,MAAM3gB,EAAO,IAAI1H,IACjB,IAAK,MAAMsH,KAAOuqB,IAAanqB,EAAKtH,IAAIkH,GAExC,IAAK,MAAMA,KAAOI,EAAM,CACvB,GAAIoqB,EAAWhuB,IAAIwD,GAAM,SACzB,MAAM2qB,EAAW,CAAEpuB,MAAOyD,GAC1BwqB,EAAWpvB,IACV4E,EACA+gB,EAAO,IACNjP,EAAM,SAAS2Y,EAAgB,IAAIA,IAAkB,MAAMzqB,IACzD2f,GAAW3iB,EAAS2tB,EAASpuB,MAAOojB,KAIzC,CAEA,IAAK,MAAM3f,KAAO9C,MAAMse,KAAKgP,EAAWpqB,QAClCA,EAAK5D,IAAIwD,KACbwqB,EAAWxvB,IAAIgF,EAAfwqB,GACAA,EAAWzxB,OAAOiH,MAKrB,OAAQvD,IACPiuB,EAAMjuB,GACN,IAAK,MAAMmuB,KAAQJ,EAAW9tB,SAAUkuB,EAAKnuB,GAC7C+tB,EAAWnd,QAEb,EACA,CACCtM,KAAM,SACNsH,cAAe,EACfI,KAAO3G,GAAYqG,GAAQM,KAAK,cAAc3G,OA2DnC+oB,GAAa3iB,EACzB,SAA6Cf,GAC5C,IAAI2B,EACAgiB,EACJ,MAAMC,EAAa,QAAQ5jB,EAAGpG,MAAQ,cAChCiqB,EAAclZ,EAAM,QAAQ3K,EAAGpG,OACpCkR,GAAc0N,IACb,MAAMvW,EAASjC,EAAGwY,GAClB,IAAKvW,GAA4B,iBAAXA,EACrB,MAAM,IAAI7L,MAAM,gDACjB,MAAM0tB,EAAc5uB,OAAOkD,eAAe6J,GAK1C,GAJKN,IACJgiB,EAAYhqB,EAAIiqB,EAAY7tB,MAAMuC,QAAQ2J,GAAU,GAAK/M,OAAOsE,OAAOsqB,IACvEniB,EAASihB,GAASe,IAEfG,IAAgB5uB,OAAOkD,eAAeuJ,GACzC,MAAM,IAAIvL,MAAM,kEAEjB,GAAIL,MAAMuC,QAAQ2J,GAAS,CAC1B,MAAMpP,EAAM8O,EACZ,IAAK,MAAMnE,OAAEA,EAAME,OAAEA,EAAMC,OAAEA,KAAYX,EAAUnK,EAAKoP,GAAQmD,KAC/D,CAACrN,EAAGC,IAAMD,EAAEyF,OAASxF,EAAEwF,QAEvB3K,EAAIkxB,OAAOvmB,EAAQE,EAAOnF,UAAWoF,EACvC,KAAO,CACN,MAAMqmB,EAAeL,EACrB,IAAK,MAAM9qB,KAAO3D,OAAO+D,KAAKgJ,GAAS,CACtC,MAAMgiB,EAAMprB,KAAO8qB,EACbO,EAAUhvB,OAAO0C,yBAAyBqK,EAAQpJ,GACxD,GAAIorB,EAAK,CACR,MAAME,EAAUjvB,OAAO0C,yBAAyB+rB,EAAW9qB,GACrDurB,EAAeD,GAAWD,EAAQrwB,KAAOswB,EAAQtwB,MAAQqwB,EAAQrwB,IACvEqB,OAAOO,eAAekuB,EAAW9qB,EAAKqrB,GAEpCE,GACDJ,EAAanrB,MACXsrB,EAAWA,EAAQtwB,IAAMswB,EAAQtwB,MAAQswB,EAAQ/uB,WAASiF,IAE5DiiB,GAASqH,EAAW,CAAE/X,KAAM,MAAOpU,KAAMqB,GAAOA,EAClD,MACC3D,OAAOO,eAAekuB,EAAW9qB,EAAKqrB,GACtC5H,GAASqH,EAAW,CAAE/X,KAAM,MAAOpU,KAAMqB,GAAOA,EAElD,CACA,IAAK,MAAMA,KAAO3D,OAAO+D,KAAK0qB,GACvB9qB,KAAOoJ,WACL+hB,EAAanrB,GACpByjB,GAASqH,EAAW,CAAE/X,KAAM,MAAOpU,KAAMqB,GAAOA,GAEnD,GACEmH,IAEJ,OAAOkM,GAAKvK,EAAQkiB,EACrB,EACA,CACCjqB,KAAM,OACN0H,KAAO3G,GAAYqG,GAAQM,KAAK,cAAc3G,gBAwThC0pB,GACfpiB,EACA5P,EACA2O,GAEA,IAAKyO,GAAWxN,KAA6B,IAAlBjB,GAASsjB,KAAe,CAClD,MAAMzxB,EAAM,CAAA,EACZ,IAAK,MAAMwL,KAAKnJ,OAAO+D,KAAKgJ,GAASpP,EAAIwL,GAAKhM,EAAG4P,EAAO5D,GAAIA,GAC5D,OAAOxL,CACR,CAEA,IAAI0xB,EACJ,MAAMC,EAAc,IAAItuB,IAClB+B,EAAQ,CAAA,EAEd,SAASwsB,EAAS5rB,GACjB,MAAM4qB,EAAOe,EAAY3wB,IAAIgF,GAC7B,GAAI4qB,EAAM,CACT,MAAM1M,EAAe/K,KACrB,IAAIF,EACJ,GAAIiL,EAAc,CAEjBjL,EADapB,GAAcqM,GACd9C,aACd,CACAwP,EAAK,CAAE7X,KAAM,UAAWE,UACxB0Y,EAAY5yB,OAAOiH,EACpB,CACD,CA+BA,SAAShF,EAAI2D,GAEZ,QADMA,KAAQS,IAAUT,KAAQyK,GA9BjC,SAAqBpJ,EAAUH,GAG9B,IADmB,IAAlBsI,GAASsjB,MAA2C,mBAAlBtjB,GAASsjB,MAAuBtjB,EAAQsjB,KAAK5rB,GAE/ET,EAAMY,GAAO0rB,EAAM,IAAMlyB,EAAGqG,EAAKG,QAC3B,CACN,MAAM4qB,EAAOc,EAAM,IAClB5Z,GAAOoP,MAAM,SAAS1nB,EAAGuH,QAAQf,IAAO2f,IACvCvgB,EAAMY,GAAOxG,EAAG4P,EAAOpJ,GAAMA,EAAK2f,GAC1BljB,WACA2C,EAAMY,GACbyjB,GAASrkB,EAAO,CAAE2T,KAAM,aAAcpU,KAAM,SAAWV,OAAO+B,IAC9D,MAAMke,EAAe/K,KACrB,IAAIF,EACAiL,IAEHjL,EADapB,GAAcqM,GACd9C,eAEdwP,IAAO,CACN7X,KAAM,aACNqB,MAAOxB,GAAoBnW,GAAU,CAAEsW,KAAM,UAAWE,UACxDA,MAAOL,GAAoBK,SAK/B0Y,EAAYvwB,IAAI4E,EAAK4qB,EACtB,CACD,CAEyCiB,CAAYltB,EAAMyK,EAAOzK,IAC1DS,EAAMT,EACd,CACA,MAAMwrB,EAAQJ,GAAS3qB,EAAO,CAC7BpE,IAAG,CAACulB,EAAG5hB,IACC3D,EAAI2D,GAEZnC,IAAG,CAAC+jB,EAAG5hB,IACCA,KAAQyK,EAEhBid,QAAO,IACCvoB,QAAQuoB,QAAQjd,GAExB,wBAAArK,CAAyB+sB,EAAQntB,GAChC,GAAIA,KAAQyK,EAAQ,MAAO,CAAEtM,cAAc,EAAM0sB,YAAY,EAAMxuB,IAAK,IAAMA,EAAI2D,GACnF,IAGD,IAAIotB,EAAuB3I,GAASha,GACpC,MAAM4iB,EAAWla,EAAM,SAAStY,EAAGuH,OAAO,EAAGggB,aAI5C,IAHA2K,EAAQ3K,EAER7J,GAAU9N,EAAQ2K,IACX,cAAegY,GAAe,CACpC,MAAMtY,UAAEA,GAAcsY,EACtBA,EAAgBA,EAAcrS,KACP,QAAnBjG,EAAUV,KACb0Q,GAASrkB,EAAOqU,EAAWA,EAAU9U,MACR,QAAnB8U,EAAUV,OACpB6Y,EAASnY,EAAU9U,aACZS,EAAMqU,EAAU9U,MACvB8kB,GAASrkB,EAAOqU,EAAWA,EAAU9U,MAEvC,IAGD,OAAO0U,GAAK8W,EAAQ1tB,IACnBuvB,EAASvvB,GACT,IAAK,MAAMmuB,KAAQe,EAAYjvB,SAAUkuB,EAAKnuB,GAC9CkvB,EAAYte,SAEd,CAkDO,MAAM4e,GAAQ/jB,EACpBmB,EACC,SAAeD,EAAa5P,EAAS2O,GACpC,OAAIjL,MAAMuC,QAAQ2J,IAA6B,mBAAXA,WAlbtCA,EACA5P,EACA2O,GAEA,GAAsB,mBAAXiB,IAA0BwN,GAAWxN,KAA6B,IAAlBjB,GAASsjB,KACnE,OAAOriB,EAAOgB,IAAKzK,GAAMnG,EAAGmG,IAG7B,IAAI+rB,EACJ,MAAMC,EAAc,IAAItuB,IAClB+B,EAAQ0B,EAAI,SAAStH,EAAGuH,MAAQ,cAAe,IACrD,IAAImrB,EAAsB,GAE1B,SAASN,EAAS5rB,GACjB,MAAMwiB,EAAQmJ,EAAY3wB,IAAIgF,GAC9B,GAAIwiB,EAAO,CACV,MAAMtE,EAAe/K,KACrB,IAAIF,EACAiL,IAEHjL,EADapB,GAAcqM,GACd9C,eAEdoH,EAAMoI,KAAKhY,GAAoB,CAAEG,KAAM,UAAWE,WAClD0Y,EAAY5yB,OAAOiH,EACpB,CACD,CAEA,SAAS6rB,EAAY7rB,EAAaksB,GAGjC,IADmB,IAAlB/jB,GAASsjB,MAA2C,mBAAlBtjB,GAASsjB,MAAuBtjB,EAAQsjB,KAAKS,GAE/ER,EAAM,KACLtsB,EAAMY,GAAOxG,EAAG0yB,SAEX,CACN,MAAMvB,EAAW,CAAEpuB,MAAOyD,GACpB4qB,EAAOc,EAAM,IAClB5Z,GAAOoP,MAAM,SAAS1nB,EAAGuH,QAAQf,IAAO2f,IACvCvgB,EAAMurB,EAASpuB,OAAS/C,EAAG0yB,EAAOvM,GAC1BljB,WACA2C,EAAMurB,EAASpuB,OACtBknB,GAASrkB,EAAO,CAAE2T,KAAM,aAAcpU,KAAM,SAAWV,OAAO+B,IAC9D,MAAMke,EAAe/K,KACrB,IAAIF,EACAiL,IAEHjL,EADapB,GAAcqM,GACd9C,eAEdwP,IAAO,CACN7X,KAAM,aACNqB,MAAOxB,GAAoBnW,GAAU,CAAEsW,KAAM,UAAWE,UACxDA,MAAOL,GAAoBK,SAK/B0Y,EAAYvwB,IAAI4E,EAAK,CAAE4qB,OAAM7e,MAAO4e,GACrC,CACD,CAEA,MAAMR,EAAQJ,GAAS3qB,EAAO,CAC7B,GAAApE,CAAIoE,EAAOT,GACV,MAAMwtB,EAAoB,iBAATxtB,EAAoBT,OAAOS,GAAQytB,IACpD,OAAIluB,OAAOmuB,MAAMF,GAAW/sB,EAAMT,IAC5BwtB,KAAK/sB,GAAQysB,EAAYM,EAAGD,EAAMC,IACjC/sB,EAAM+sB,GACd,EACA3vB,IAAG,CAACsvB,EAAQntB,IACJb,QAAQtB,IAAI0vB,EAAOvtB,KAItBqtB,EAAWla,EAAM,SAAStY,EAAGuH,OAAO,EAAGggB,aAC5C2K,EAAQ3K,EACR,MAAMuL,EAAW,IAAuB,mBAAXljB,EAAwBA,IAAWA,GAC1DmjB,EAAQpoB,EAAU+nB,EAAOI,GAAUjgB,SAAS,CAACnN,EAAGC,IAAMA,EAAEwF,OAASzF,EAAEyF,QAEzE,GAAI4nB,EAAM7sB,OAAS,EAAG,CACrB,IAAK,MAAM8sB,KAAQD,EAAO,CAEzB,IAAK,IAAI5sB,EAAI6sB,EAAK7nB,OAAQhF,EAAI6sB,EAAK7nB,OAAS6nB,EAAK3nB,OAAOnF,OAAQC,IAAKisB,EAASjsB,GAG9E,MAAM6Z,EAAQgT,EAAK1nB,OAAOpF,OAAS8sB,EAAK3nB,OAAOnF,OAC/C,GAAc,IAAV8Z,EAAa,CAEhB,MAAM7N,EAAUzO,MAAMse,KAAKmQ,EAAYhgB,WAAWY,KAAK,CAACrN,EAAGC,IAAMD,EAAE,GAAKC,EAAE,IAE1E,IAAK,MAAOstB,EAAKC,KAAW/gB,EACvB8gB,GAAOD,EAAK7nB,OAAS6nB,EAAK3nB,OAAOnF,QACpCisB,EAAY5yB,OAAO0zB,GAIrB,IAAK,MAAOA,EAAKjK,KAAU7W,EAC1B,GAAI8gB,GAAOD,EAAK7nB,OAAS6nB,EAAK3nB,OAAOnF,OAAQ,CAC5C,MAAMitB,EAASF,EAAMjT,EACrBgJ,EAAMzW,MAAMxP,MAAQowB,EACpBhB,EAAYvwB,IAAIuxB,EAAQnK,EACzB,CAEF,CAGApjB,EAAM8rB,OACLsB,EAAK7nB,OACL6nB,EAAK3nB,OAAOnF,UACT,IAAIxC,MAAMsvB,EAAK1nB,OAAOpF,QAAQktB,UAAKprB,IAIvC,IAAK,IAAI7B,EAAI6sB,EAAK7nB,OAAQhF,EAAI6sB,EAAK7nB,OAAS6nB,EAAK1nB,OAAOpF,OAAQC,WAAYP,EAAMO,EACnF,CAEA,MAAMktB,EAAc,IAAIn0B,IAAiB,CAACqb,KACtCmY,EAAMxsB,SAAW4sB,EAAS5sB,QAAQmtB,EAAY/zB,IAAI,UACtD,IAAK,MAAM0zB,KAAQD,EAAO,CACzB,MAAMvF,EAAM/hB,KAAK+hB,IAAIwF,EAAK3nB,OAAOnF,OAAQ8sB,EAAK1nB,OAAOpF,QACrD,IAAK,IAAIC,EAAI,EAAGA,EAAIqnB,EAAKrnB,IAAKktB,EAAY/zB,IAAImF,OAAOuuB,EAAK7nB,OAAShF,GACpE,CACAiV,GAAQxV,EAAO,CAAE2T,KAAM,QAASnQ,OAAQ,eAAiBiqB,EAC1D,CAEAX,EAAQI,IAGT,OAAOjZ,GAAK8W,EAAQ1tB,IACnBuvB,EAASvvB,GACT,IAAK,MAAM+lB,KAASmJ,EAAYjvB,SAAU8lB,EAAMoI,KAAKnuB,GACrDkvB,EAAYte,SAEd,CAgTWyf,CAAW1jB,EAAQ5P,EAAI2O,GAC3BiB,aAAkB/L,aAnSxB+L,EACA5P,EACA2O,GAEA,IAAKyO,GAAWxN,KAA6B,IAAlBjB,GAASsjB,KAAe,CAClD,MAAMzxB,EAAM,IAAIqD,IAChB,IAAK,MAAOmI,EAAGyH,KAAM7D,EAAQpP,EAAIoB,IAAIoK,EAAGhM,EAAGyT,EAAGzH,IAC9C,OAAOxL,CACR,CAEA,IAAI0xB,EACJ,MAAMC,EAAc,IAAItuB,IAClB+B,EAAQ0B,EAAI,SAAStH,EAAGuH,MAAQ,cAAe,IAAI1D,KAGzD,SAASuuB,EAAS5rB,GACjB,MAAM4qB,EAAOe,EAAY3wB,IAAIgF,GAC7B,GAAI4qB,EAAM,CACT,MAAM1M,EAAe/K,KACrB,IAAIF,EACAiL,IAEHjL,EADapB,GAAcqM,GACd9C,eAEdwP,EAAK,CAAE7X,KAAM,UAAWE,UACxB0Y,EAAY5yB,OAAOiH,EACpB,CACD,CAEA,SAAS6rB,EAAY7rB,EAAUH,GAG9B,IADmB,IAAlBsI,GAASsjB,MAA2C,mBAAlBtjB,GAASsjB,MAAuBtjB,EAAQsjB,KAAK5rB,GAE/ET,EAAMhE,IACL4E,EACA0rB,EAAM,IAAMlyB,EAAGqG,EAAKG,SAEf,CACN,MAAM4qB,EAAOc,EAAM,IAClB5Z,GAAOoP,MAAM,SAAS1nB,EAAGuH,QAAQf,IAAO2f,IACvC,MAAMjG,EAAOtQ,EAAOpO,IAAIgF,GACxB,QAAawB,IAATkY,GAAuBtQ,EAAO5M,IAAIwD,GAEtC,OADAZ,EAAMhE,IAAI4E,EAAKxG,EAAGkgB,EAAW1Z,EAAK2f,IAC1BljB,IACP2C,EAAMrG,OAAOiH,GACbyjB,GAASrkB,EAAO,CAAE2T,KAAM,aAAcpU,KAAM,SAAWV,OAAO+B,IAC9D,MAAMke,EAAe/K,KACrB,IAAIF,EACAiL,IAEHjL,EADapB,GAAcqM,GACd9C,eAEdwP,IAAO,CACN7X,KAAM,aACNqB,MAAOxB,GAAoBnW,GAAU,CAAEsW,KAAM,UAAWE,UACxDA,MAAOL,GAAoBK,SAK/B0Y,EAAYvwB,IAAI4E,EAAK4qB,EACtB,CACD,CAjDAvuB,OAAOO,eAAewC,EAAO,cAAe,CAAE7C,MAAOF,OAAQmtB,YAAY,IAmDzE,MAAMW,EAAQJ,GAAS3qB,EAAO,CAC7BpE,IAAG,CAACoE,EAAOT,IACG,QAATA,EACKqB,KACFZ,EAAM5C,IAAIwD,IAAQoJ,EAAO5M,IAAIwD,IAAM6rB,EAAY7rB,EAAKoJ,EAAOpO,IAAIgF,IAC7DZ,EAAMpE,IAAIgF,IAEN,QAATrB,EACKqB,GACAoJ,EAAO5M,IAAIwD,GAEP,SAATrB,EACI,IACCyK,EAAOhJ,OAEH,WAATzB,EACI,YACN,IAAK,MAAMqB,KAAOoJ,EAAOhJ,aAClB+pB,EAAMnvB,IAAIgF,EAElB,EACY,YAATrB,GAMAA,IAASpE,OAAO4P,SALZ,YACN,IAAK,MAAMnK,KAAOoJ,EAAOhJ,YAClB,CAACJ,EAAKmqB,EAAMnvB,IAAIgF,GAExB,EAOOZ,EAAcT,KAIxB,IAAIotB,EAAuB3I,GAASha,GACpC,MAAM4iB,EAAWla,EAAM,SAAStY,EAAGuH,OAAO,EAAGggB,aAG5C,IAFA2K,EAAQ3K,EACR7J,GAAU9N,EAAQ2K,IACX,cAAegY,GAAe,CACpC,MAAMtY,UAAEA,GAAcsY,EACtBA,EAAgBA,EAAcrS,KACP,QAAnBjG,EAAUV,KACb0Q,GAASrkB,EAAOqU,EAAWA,EAAU9U,MACR,QAAnB8U,EAAUV,OACpB6Y,EAASnY,EAAU9U,MACnBS,EAAMrG,OAAO0a,EAAU9U,MACvB8kB,GAASrkB,EAAOqU,EAAWA,EAAU9U,MAEvC,IAGD,OAAO0U,GAAK8W,EAAQ1tB,IACnBuvB,EAASvvB,GACT,IAAK,MAAMmuB,KAAQe,EAAYjvB,SAAUkuB,EAAKnuB,GAC9CkvB,EAAYte,SAEd,CAwKqC0f,CAAS3jB,EAAQ5P,EAAI2O,GAChDqjB,GAAYpiB,EAAQ5P,EAAI2O,EAChC,EACA,CACC,QAAIsjB,GACH,MAAO,CAACriB,EAAa5P,EAASwzB,IAAkBjzB,KAAKqP,EAAQ5P,EAAI,CAAEiyB,MAAM,GAC1E,IAGF,CACC1qB,KAAM,QACNsH,cAAe,EACfI,KAAO3G,GAAYqG,GAAQM,KAAK,cAAc3G,OClrB1C,SAAUmrB,GACf/qB,EACAlF,GACAge,UAAEA,GAAY,GAAU,IAExB,GAAI9Y,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,MAAM,IAAI3E,MAAM,6CAEhD,MAAM2vB,EAAiCjb,GAAY,IAC3CjV,EAASkF,GAChBlF,GAMD,ON9BAilB,KM8BOnQ,EAAM,YAAY,KAExBkQ,GAAwBlpB,IAAIoJ,GAG5B,IAAIqV,EAAgB4K,GAA2BnnB,IAAIkyB,GAC9C3V,IACJA,EAAgB,IAAI7e,IACpBypB,GAA2B/mB,IAAI8xB,EAAiB3V,IAEjDA,EAAeze,IAAIoJ,GAInB,MAAMoX,EAAU,IAAIhc,QAkEpB,OAjEA,SAAS6vB,EAAiBzuB,EAAUuN,EAAQ,GAE3C,MAAKvN,GAAO4a,EAAQ9c,IAAIkC,IAAuB,iBAARA,GAAoBuN,EAAQ9D,GAAQuN,mBAGvE2O,GAAc3lB,IAAlB,CACA4a,EAAQxgB,IAAI4F,GAGZsjB,GAAwBlpB,IAAI4F,GAC5B6Y,EAAeze,IAAI4F,GAInB,IAAK,MAAMsB,KAAO2W,GAAOjY,GACxB,GAAIrC,OAAOiE,OAAO5B,EAAKsB,GAAM,CAE5B,MAAMzD,EAASmC,EAAYsB,GAI3BmtB,EADkB,iBAAV5wB,GAAgC,OAAVA,EAAiBwtB,GAASxtB,GAASA,EACjC0P,EAAQ,EACzC,CAKD,GAAoC,mBAAzBvN,EAAInE,OAAO4P,UAA0B,CAE/C,IAAK,MAAM5N,KAASmC,EAAK,CAIxByuB,EADkB,iBAAV5wB,GAAgC,OAAVA,EAAiBwtB,GAASxtB,GAASA,EACjC0P,EAAQ,EACzC,CAQA,GALI,WAAYvN,GACfwY,GAAUxY,EAAK,UAIZA,aAAerB,IAClB,IAAK,MAAMd,KAASmC,EAAIhC,SAAU,CAGjCywB,EADkB,iBAAV5wB,GAAgC,OAAVA,EAAiBwtB,GAASxtB,GAASA,EACjC0P,EAAQ,EACzC,CAEF,CA5CwB,CA+CzB,CAIAkhB,CAAiBjrB,GAGb8Y,GACHmE,EAAS,qBAAqB,IAAMniB,EAASkF,IAE9C8Y,GAAY,EAGL,KAEN,MAAMzD,EAAgB4K,GAA2BnnB,IAAIkyB,GACrD,GAAI3V,EAAe,CAElB,IAAK,MAAM7Y,KAAO6Y,EAAe,CAEhC,MAAM5F,EAAWuQ,GAAalnB,IAAI0D,GAC9BiT,GAEHA,EAAS5Y,OAAOm0B,GAGM,IAAlBvb,EAASxW,OACZ+mB,GAAanpB,OAAO2F,GACpBsjB,GAAwBjpB,OAAO2F,KAIhCsjB,GAAwBjpB,OAAO2F,EAEjC,CAGAyjB,GAA2BppB,OAAOm0B,EACnC,IAGH,CC9HA,MAAME,GAAmB,IAAIj0B,QACvBk0B,GAAkB,IAAIl0B,QAE5B,SAASm0B,GACRC,EACAvtB,GAEAutB,EAAKC,WAALD,EAAKC,SAAa,IAAIr0B,SACtB,IAAIs0B,EAASF,EAAKC,SAASxyB,IAAIgF,GAK/B,OAJKytB,IACJA,EAAS,CAAA,EACTF,EAAKC,SAASpyB,IAAI4E,EAAKytB,IAEjBA,CACR,CAEA,SAASC,GACRl0B,EACAiQ,GAIA,MAAMkkB,EAASnb,GAAQhZ,GACjB4Y,EAAWgb,GAAiBpyB,IAAI2yB,GACtC,GAAIvb,EAAU,OAAOA,EAErB,MAAMwb,EAAmC,CAAA,EACnCC,EAAW5b,GAAa,YAAoCvY,GACjE,GAAIA,EAAK8R,KAAMsiB,KAAUA,GAAO,CAAC,SAAU,SAAU,YAAYxrB,gBAAgBwrB,KAAQ,CACxF,GAAIrkB,GAAMskB,QAAS,OAAOv0B,EAAGM,MAAMC,KAAML,GACzC,MAAM,IAAI6D,MAAM,4CACjB,CAEA,IAAIwU,EAA8B6b,EAElC,IAAK,MAAME,KAAOp0B,EACjBqY,EAAOub,GAAUvb,EAAM+b,GAIxB,GADA5W,GAAUnF,EAAM,WACZ,WAAYA,EAAM,CACrB,GAAI5J,GAAQoN,yBAA0B,CACrC,MAAMyY,EAAkB7lB,GAAQsN,kBAChCtN,GAAQsN,mBAAoB,EAC5B,IACC,MAAMwY,EAAQ9O,EAAS,6BAA6B,IAAM3lB,EAAGM,MAAMC,KAAML,IACpEuF,EAAY8S,EAAKjJ,OAAQmlB,IAC7B3X,GAAW,2BAA4BvE,EAAKjJ,OAAQmlB,EAAOz0B,EAAIE,EAAM,cAEvE,SACCyO,GAAQsN,kBAAoBuY,CAC7B,CACD,CACA,OAAOjc,EAAKjJ,MACb,CAoCA,GAhCAiJ,EAAK+K,QAAUnM,EAAI,eAAe,IACjCmB,EAAM,UACL,KAGCC,EAAKjJ,OAAStP,EAAGM,MAAMC,KAAML,GACrB+C,IAMP,UAJOsV,EAAKjJ,OACZ2a,GAAS1R,EAAM,CAAEgB,KAAM,aAAcpU,KAAMjF,GAAQ,WAG/CqY,EAAK+K,QAAS,CACjB,MAAMoB,EAAe/K,KACrB,IAAIF,EACJ,GAAIiL,EAAc,CAEjBjL,EADmBpB,GAAcqM,GACd9C,aACpB,CACArJ,EAAK+K,QAAQ,CACZ/J,KAAM,aACNqB,MAAOxB,GAAoBnW,GAAU,CAAEsW,KAAM,UAAWE,UACxDA,MAAOL,GAAoBK,KAE5BlB,EAAK+K,aAAUtb,CAChB,IAGF,CAAE0f,QAAQ,KAIR/Y,GAAQoN,yBAA0B,CACrC,MAAMyY,EAAkB7lB,GAAQsN,kBAChCtN,GAAQsN,mBAAoB,EAC5B,IACC,MAAMwY,EAAQ9O,EAAS,4BAA4B,IAAM3lB,EAAGM,MAAMC,KAAML,IACnEuF,EAAY8S,EAAKjJ,OAAQmlB,IAC7B3X,GAAW,2BAA4BvE,EAAKjJ,OAAQmlB,EAAOz0B,EAAIE,EAAM,aAEvE,SACCyO,GAAQsN,kBAAoBuY,CAC7B,CACD,CAEA,OAAOjc,EAAKjJ,MACb,EAAGtP,GAIH,OAFA4zB,GAAiBhyB,IAAIuyB,EAAQE,GAC7BT,GAAiBhyB,IAAIyyB,EAAUA,GACxBA,CACR,CAgFA,SAASK,GAAqBC,GAC7B,OAAOlrB,EAAU,CAChBT,OAAM,CAAC0B,EAAUhC,EAAQC,IACjB,WACN,IAAIisB,EAAUf,GAAgBryB,IAAIkJ,GAClC,IAAKkqB,EAAS,CACbA,EAAUnc,GACT/Q,EACC,GAAGjD,OAAOiE,GAAQL,aAAad,MAAQmB,GAAQnB,MAAQ,aAAa9C,OAAOkE,KAC1E+L,GACOhK,EAAShJ,KAAKgT,IAGvB,CACCtL,OAAQsB,EACR/B,gBAGF,MAAMksB,EAAYnqB,EAAgCuN,IAC9C4c,IAAWD,EAA+B3c,IAAsB4c,GACpEhB,GAAgBjyB,IAAI8I,EAAUkqB,EAC/B,CAEA,OADiBV,GAAgBU,EAAgBD,EAC1CN,CAAS9zB,KACjB,EAED6I,OAAM,CAACsB,EAAUhC,EAAQnB,IACjB,YAAwBrH,GAC9B,IAAI00B,EAAUf,GAAgBryB,IAAIkJ,GAClC,IAAKkqB,EAAS,CACbA,EAAUnc,GACT/Q,EACC,GAAGjD,OAAOiE,GAAQL,aAAad,MAAQmB,GAAQnB,MAAQ,aAAa9C,OAAO8C,KAC3E,CAACmN,KAAiBxU,IACVwK,EAAShJ,KAAKgT,KAASxU,IAGhC,CACCkJ,OAAQsB,EACR/B,YAAapB,IAGf,MAAMstB,EAAYnqB,EAAgCuN,IAC9C4c,IAAWD,EAA+B3c,IAAsB4c,GACpEhB,GAAgBjyB,IAAI8I,EAAUkqB,EAC/B,CAIA,OAHiBV,GAAgBU,EAAgBD,EAG1CN,CAAS9zB,QAASL,EAC1B,EAEDmJ,QAAgCX,GACb,iBAAXA,EAnIV,SAAsDA,EAAWuH,GAChE,MAAM2I,EAAWgb,GAAiBpyB,IAAIkH,GACtC,GAAIkQ,EAAU,OAAOA,EAErB,MAAM+X,EAAQ,IAAIpsB,MAAMmE,EAAQ,CAC/B,GAAAlH,CAAIoO,EAAQzK,EAAMC,GAEjB,IACImqB,EADAjW,EAAU1J,EAEd,KAAO0J,IACNiW,EAAO1sB,OAAO0C,yBAAyB+T,EAASnU,IAC5CoqB,IACJjW,EAAUzW,OAAOkD,eAAeuT,GAEjC,IAAKiW,EAAM,OAAOjrB,QAAQ9C,IAAIoO,EAAQzK,EAAMC,GAE5C,GAAImqB,EAAK/tB,IAAK,CACb,MAAMszB,EAAiBvF,EAAK/tB,IAC5B,IAAIozB,EAAUf,GAAgBryB,IAAIszB,GAClC,IAAKF,EAAS,CACbA,EAAUnc,GACT/Q,EACC,GAAGjD,OAAOmL,GAAQvH,aAAad,MAAQ,aAAa9C,OAAOU,KAC1DuP,GACOogB,EAAepzB,KAAKgT,IAG7B,CACC/L,YAAaxD,IAGf,MAAM0vB,EAAYC,EAAsC7c,IACpD4c,IAAWD,EAA+B3c,IAAsB4c,GACpEhB,GAAgBjyB,IAAIkzB,EAAgBF,EACrC,CAEA,OADiBV,GAAgBU,EAAS3kB,EACnCokB,CAASjvB,EACjB,CAGA,OAAOd,QAAQ9C,IAAIoO,EAAQzK,EAAMC,EAClC,EAEAxD,IAAG,CAACgO,EAAQzK,EAAMpC,EAAOgyB,IAGjBzwB,QAAQ1C,IAAIgO,EAAQzK,EAAMpC,EAAO6M,KAM1C,OAFAsN,GAActb,IAAI+uB,EAAOjoB,GACzBkrB,GAAiBhyB,IAAI8G,EAAQioB,GACtBA,CACR,CA+EOqE,CAActsB,EAAQisB,GACtBT,GAAgBxrB,EAAQisB,IAE/B,OAEaM,GAETplB,EAAS6kB,KAAwB,CACpC,WAAIH,GACH,OAAOG,GAAqB,CAAEH,SAAS,GACxC,IClQD,MAAMW,GAAWn0B,OAAO,aA4CXo0B,GAAQzmB,EACpBmB,EACC,SACC9M,EACAqyB,EACAzmB,EAAe,CAAA,GAEf,MAAwB,mBAAV5L,EAoCjB,SACCA,EACAqyB,GACA5T,UAAEA,GAAY,EAAK6T,KAAEA,GAAO,GAAU,IAEtC,IACIC,EADAtK,EAAgCkK,GAEpC,MAAMK,EAAYjd,EAAM,iBACvBG,GAAc0N,IACb,MAAM8E,EAAWloB,EAAMojB,GACvB,GAAI6E,IAAaC,EAAU,CAC1B,MAAMuK,EAAMxK,EACRwK,IAAQN,GACP1T,GAAWmE,EAAS,gBAAgB,IAAMyP,EAAQnK,IAChDtF,EAAS,gBAAgB,IAAMyP,EAAQnK,EAAUuK,GACzD,CACAxK,EAAWC,EACPoK,IACCC,GAAaA,IACjBA,EAAc7B,GAAUxI,EAAqBloB,GAAUqyB,EAAQryB,EAAYA,MAE1EA,IAEJ,WACCwyB,IACID,GAAaA,GACjB,CACF,CA9DMG,CAAc1yB,EAAOqyB,EAASzmB,GACb,iBAAV5L,GAAgC,OAAVA,EAqBnC,SACCA,EACAqyB,GACA5T,UAAEA,GAAY,EAAK6T,KAAEA,GAAO,GAAU,IAEtC,OAAIA,EAAa5B,GAAU1wB,EAAOqyB,EAAS,CAAE5T,cACtClJ,EAAM,eAAe,KAC3BoF,GAAU3a,GACNye,GAAW4T,EAAQryB,GACvBye,GAAY,GAEd,CA/BOkU,CAAY3yB,EAAOqyB,EAASzmB,GAC5B,MACA,MAAM,IAAI5K,MAAM,+CAChB,EAFA,EAGL,EACA,CACC,QAAIsxB,GACH,OAAOtlB,EAAcxP,KAAM,CAAE80B,MAAM,GACpC,EACA,aAAI7T,GACH,OAAOzR,EAAcxP,KAAM,CAAEihB,WAAW,GACzC,IAGF,CACCja,KAAM,QACN0H,KAAO3G,GAAYqG,GAAQM,KAAK,cAAc3G,OA+HzC,MAAMqtB,GAAalsB,EAAU,CACnC,MAAMiB,GAEHA,EAASxI,UAAkBmY,KAAwB,CACtD,EACAhR,QA/BD,SACCusB,KACG11B,GAEH,MAAuB,iBAAT01B,GAVV/K,GADJ3lB,EAAMiY,GADwBjY,EAaR0wB,MAVpB1wB,EAAYmV,KAAwB,GADPnV,GAYzBwF,IAEH,MAAMmrB,EAAgBnrB,EAASxI,UAAkBmY,IAEjD,IAAqB,IAAjBwb,EACDnrB,EAASxI,UAAkBmY,KAAwB,MAC/C,CACN,MAAMzY,EAAM,IAAI1C,IAAiB22B,GAAgB,IAEjDj0B,EAAItC,IAAIs2B,GACR,IAAK,MAAMtB,KAAOp0B,EAAM0B,EAAItC,IAAIg1B,GAChCjK,GAAmB3f,EAASxI,UAAWN,EACxC,CACA,OAAO8I,CACP,EA5BJ,IAA+BxF,CA6B/B,IC/MM,SAAW4wB,GAAwBnlB,GACxC,IAAIrB,EAASqB,EAASuP,OACtB,MAAQ5Q,EAAOymB,YACRxF,GAASjhB,EAAOvM,OACtBuM,EAASqB,EAASuP,MAEpB,CAKM,SAAW8V,GAAkCrlB,GAClD,IAAIrB,EAASqB,EAASuP,OACtB,MAAQ5Q,EAAOymB,MAAM,CACpB,MAAOvvB,EAAKzD,GAASuM,EAAOvM,WACtB,CAACwtB,GAAS/pB,GAAM+pB,GAASxtB,IAC/BuM,EAASqB,EAASuP,MACnB,CACD,CCXM,MAAgB+V,WAAgBvyB,MACrC,GAAAlC,CAAI2E,GAEH,OADAuX,GAAUnd,KAAM4F,GACToqB,GAAShwB,KAAK4F,GACtB,CAGA,GAAAvE,CAAIuE,EAAWpD,GACd,MAAM2U,EAAQvR,GAAK5F,KAAK2F,OACxB3F,KAAK4F,GAAKpD,EACVqY,GAAQ7a,KAAM,CAAEgZ,KAAM,MAAOpU,KAAMgB,GAdrC,UAAgBA,GAAWD,OAAEA,GAAS,GAAS,CAAA,GAC1CA,SAAc,gBACZC,CACP,CAW0CoM,CAAMpM,EAAG,CAAED,OAAQwR,IAC5D,EAED,MAAMwe,GAAY,CAAE10B,IAAKyD,EAAUzD,IAAKI,IAAKqD,EAAUrD,KAEvD,SAASu0B,GAAQhxB,GAChB,MAAMylB,EAAIzlB,EAAKixB,WAAW,GAC1B,GAAIxL,EAAI,IAAMA,EAAI,GAAI,SACtB,MAAM+H,GAAKxtB,EACX,OAAOwtB,KAAW,EAAJA,IAAUA,GAAK,EAAIA,GAAI,CACtC,CACA9vB,OAAOC,OAAOmC,EAAW,CACxB,GAAAzD,CAAI0D,EAAUC,EAAWC,GACxB,GAAI1B,MAAMuC,QAAQf,IAAwB,iBAATC,EAAmB,CACnD,MAAMgB,EAAIgwB,GAAQhxB,GAClB,GAAIgB,GAAK,EAAG,OAAO8vB,GAAQ/zB,UAAUV,IAAIE,KAAKwD,EAAKiB,EACpD,CACA,OAAO+vB,GAAU10B,IAAI0D,EAAKC,EAAMC,EACjC,EACA,GAAAxD,CAAIsD,EAAUC,EAAWpC,EAAYqC,GACpC,GAAI1B,MAAMuC,QAAQf,IAAwB,iBAATC,EAAmB,CACnD,MAAMgB,EAAIgwB,GAAQhxB,GAClB,GAAIgB,GAAK,EAAG,OAAO8vB,GAAQ/zB,UAAUN,IAAIF,KAAKwD,EAAKiB,EAAGpD,EACvD,CACA,OAAOmzB,GAAUt0B,IAAIsD,EAAKC,EAAMpC,EAAOqC,EACxC,QAYqBixB,GAAoB,oCAAS3yB,WAA7B,OAAA8K,EAAA,cAA6B8nB,EAClD,EAAAhkB,CAAGC,GACF,OAAOge,GAAShoB,MAAM+J,GAAGC,GAC1B,CAEA,MAAAV,IAAUC,GACT,OAAOye,GAAShoB,MAAMsJ,UAAUC,EAAMlB,IAAIuM,KAC3C,CAEA,OAAAhL,GAEC,OADAuL,GAAUnd,KAAMga,IACTyb,GAA4BztB,MAAM4J,UAC1C,CAOA,KAAAJ,CAAMhB,EAA6D5B,GAClE,OAAO5G,MAAMwJ,MAAM,CAAC0B,EAAGtN,EAAGT,IAAMqL,EAAUrP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,GAAIyJ,EAC7E,CAGA,IAAAikB,CAAKrwB,EAAY+H,EAAgB8G,GAChC,OAAOrJ,MAAM6qB,KAAKjW,GAAOpa,GAAQ+H,EAAO8G,EACzC,CAGA,UAAA2kB,CAAW7tB,EAAgBoC,EAAe8G,GACzC,OAAOrJ,MAAMguB,WAAW7tB,EAAQoC,EAAO8G,EACxC,CAIA,MAAAd,CAAOC,EAAiE5B,GACvE,OAAOohB,GAAShoB,MAAMuI,OAAO,CAAC2C,EAAGtN,EAAGT,IAAMqL,EAAUrP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,GAAIyJ,GACvF,CAUA,IAAAiC,CAAKL,EAAiE5B,GACrE,OAAOohB,GAAShoB,MAAM6I,KAAK,CAACqC,EAAGtN,EAAGT,IAAMqL,EAAUrP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,GAAIyJ,GACrF,CAEA,SAAAkC,CACCN,EACA5B,GAEA,OAAO5G,MAAM8I,UAAU,CAACoC,EAAGtN,EAAGT,IAAMqL,EAAUrP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,GAAIyJ,EACjF,CAUA,QAAAmC,CAASP,EAAiE5B,GACzE,OAAOohB,GACNhoB,MAAM+I,SAAS,CAACmC,EAAGtN,EAAGT,IAAMqL,EAAUrP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,GAAIyJ,GAE1E,CAEA,aAAAoC,CACCR,EACA5B,GAEA,OAAO5G,MAAMgJ,cAAc,CAACkC,EAAGtN,EAAGT,IAAMqL,EAAUrP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,GAAIyJ,EACrF,CAEA,IAAAqD,CAAKC,GAEJ,OADAiL,GAAUnd,KAAMga,IACTgW,GAAShoB,MAAMiK,KAAKC,GAC5B,CAEA,OAAAC,CAAQ7B,EAA8D1B,GACrE,OAAOohB,GACNhoB,MAAMmK,QAAQ,CAACe,EAAGtN,EAAGT,IAAMyX,GAAOtM,EAAWnP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,IAAKyJ,GAElF,CAEA,OAAAgC,CAAQN,EAA+D1B,GACtE5G,MAAM4I,QAAQ,CAACsC,EAAGtN,EAAGT,KACpBmL,EAAWnP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,IACvCyJ,EACJ,CAEA,QAAArG,CAAS0I,EAAoBC,GAC5B,OAAO+kB,UAAUtwB,OAAS,EACvBqC,MAAMO,SAASqU,GAAO3L,GAAgBC,GACtClJ,MAAMO,SAASqU,GAAO3L,GAC1B,CAEA,OAAAE,CAAQF,EAAoBC,GAC3B,OAAO+kB,UAAUtwB,OAAS,EACvBqC,MAAMmJ,QAAQyL,GAAO3L,GAAgBC,GACrClJ,MAAMmJ,QAAQyL,GAAO3L,GACzB,CAEA,IAAAS,CAAKC,GACJ,OAAO3J,MAAM0J,KAAKC,EACnB,CAEA,IAAAtL,GAEC,OADA8W,GAAUnd,KAAM,UACTgI,MAAM3B,MACd,CAEA,WAAA+K,CAAYH,EAAoBC,GAC/B,OAAO+kB,UAAUtwB,OAAS,EACvBqC,MAAMoJ,YAAYwL,GAAO3L,GAAgBC,GACzClJ,MAAMoJ,YAAYwL,GAAO3L,GAC7B,CAEA,GAAAZ,CAAOC,EAA4D1B,GAClE,OAAOohB,GACNhoB,MAAMqI,IAAI,CAAC6C,EAAGtN,EAAGT,IAAMyX,GAAOtM,EAAWnP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,IAAKyJ,GAE9E,CAGA,GAAA4P,GACC,OAAOwR,GAAShoB,MAAMwW,MACvB,CAGA,IAAA1e,IAAQyR,GACP,OAAOvJ,MAAMlI,QAAQyR,EAAMlB,IAAIuM,IAChC,CAEA,MAAAnM,CACCH,EACAI,GAEA,OAAOsf,GACNiG,UAAUtwB,OAAS,EAChBqC,MAAMyI,OAAO,CAACylB,EAAKhjB,EAAGtN,EAAGT,IAAMyX,GAAOtM,EAAW4lB,EAAKlG,GAAS9c,GAAItN,EAAGT,IAAKuL,GAC3E1I,MAAMyI,OAAO,CAACylB,EAAKhjB,EAAGtN,EAAGT,IAAMyX,GAAOtM,EAAW4lB,EAAKlG,GAAS9c,GAAItN,EAAGT,KAE3E,CAEA,WAAAwL,CACCL,EACAI,GAEA,OAAOsf,GACNiG,UAAUtwB,OAAS,EAChBqC,MAAM2I,YACN,CAACulB,EAAKhjB,EAAGtN,EAAGT,IAAMyX,GAAOtM,EAAW4lB,EAAKlG,GAAS9c,GAAItN,EAAGT,IACzDuL,GAEA1I,MAAM2I,YAAY,CAACulB,EAAKhjB,EAAGtN,EAAGT,IAAMyX,GAAOtM,EAAW4lB,EAAKlG,GAAS9c,GAAItN,EAAGT,KAEhF,CAGA,OAAAkN,GACC,OAAO2d,GAAShoB,MAAMqK,UACvB,CAGA,KAAAoN,GACC,OAAOuQ,GAAShoB,MAAMyX,QACvB,CAEA,KAAAzU,CAAMT,EAAgB8G,GACrB,OAAO2e,GAAShoB,MAAMgD,MAAMT,EAAO8G,GACpC,CAOA,IAAAI,CAAKjB,EAA6D5B,GACjE,OAAO5G,MAAMyJ,KAAK,CAACyB,EAAGtN,EAAGT,IAAMqL,EAAUrP,KAAKyN,EAASohB,GAAS9c,GAAItN,EAAGT,GAAIyJ,EAC5E,CAGA,IAAA4D,CAAKD,GACJ,MAAM4jB,EAAiB5jB,EACpB,CAACpN,EAAQC,IAAWmN,EAAUyd,GAAS7qB,GAAI6qB,GAAS5qB,SACpDqC,EACH,OAAOO,MAAMwK,KAAK2jB,EACnB,CAGA,MAAAhF,CAAO5mB,EAAemI,KAAyBnB,GAC9C,OACQye,GADJiG,UAAUtwB,OAAS,EACNqC,MAAMmpB,OAAO5mB,EAAOmI,KAAiBnB,EAAMlB,IAAIuM,KACvC,IAArBqZ,UAAUtwB,OAA8BqC,MAAMmpB,OAAO5mB,EAAOmI,GACvC,IAArBujB,UAAUtwB,OAA8BqC,MAAMmpB,OAAO5mB,GACzC,GACjB,CAGA,OAAAgU,IAAWhN,GACV,OAAOvJ,MAAMuW,WAAWhN,EAAMlB,IAAIuM,IACnC,CAEA,MAAAja,GAEC,OADAwa,GAAUnd,KAAMga,IACTub,GAAqBvtB,MAAMrF,SACnC,CAEA,EAAAyzB,EAAA,CA/LCtR,OAKAA,IAAMuR,EAAA,CAqGNvR,IAAMwR,EAAA,CAKNxR,OA8BAA,IAAMyR,EAAA,CAKNzR,IAAM0R,EAAA,CAkBN1R,OAQAA,IAAM2R,EAAA,CASN3R,IAUAtkB,OAAO4P,aAEP,OADA+M,GAAUnd,KAAMga,IACTub,GAAqBvtB,MAAMxH,OAAO4P,YAC1C,CAEA,UAAAgC,GACC,OAAO4d,GAAShoB,MAAMoK,aACvB,CAEA,QAAAE,CAASC,GACR,MAAM4jB,EAAiB5jB,EACpB,CAACpN,EAAQC,IAAWmN,EAAUyd,GAAS7qB,GAAI6qB,GAAS5qB,SACpDqC,EACH,OAAOuoB,GAAShoB,MAAMsK,SAAS6jB,GAChC,CAEA,SAAA1jB,CAAUlI,EAAemI,KAAyBnB,GACjD,OACQye,GADJiG,UAAUtwB,OAAS,EACNqC,MAAMyK,UAAUlI,EAAOmI,KAAiBnB,EAAMlB,IAAIuM,KAC1C,IAArBqZ,UAAUtwB,OAA8BqC,MAAMyK,UAAUlI,EAAOmI,GAC1C,IAArBujB,UAAUtwB,OAA8BqC,MAAMyK,UAAUlI,GAC5C,IAAIvK,MACrB,CAEA,KAAKgS,EAAexP,GACnB,OAAOwtB,GAAShoB,MAAM2K,KAAKX,EAAO4K,GAAOpa,IAC1C,mIAhPqBk0B,CAAA12B,KAAA22B,6GAwBrBC,GAAA3oB,EAAA,KAAAmoB,EAAA,CAAAptB,KAAA,SAAAhC,KAAA,OAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,SAAAA,EAAA1D,IAAA0D,GAAAA,EAAAkuB,MAAIkE,SAAAC,GAAA,KAAAL,GAKJC,GAAA3oB,EAAA,KAAAgpB,EAAA,CAAAjuB,KAAA,SAAAhC,KAAA,aAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,eAAAA,EAAA1D,IAAA0D,GAAAA,EAAAqxB,YAAUe,SAAAC,GAAA,KAAAL,GAqGVC,GAAA3oB,EAAA,KAAAooB,EAAA,CAAArtB,KAAA,SAAAhC,KAAA,MAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,QAAAA,EAAA1D,IAAA0D,GAAAA,EAAA6Z,KAAGuY,SAAAC,GAAA,KAAAL,GAKHC,GAAA3oB,EAAA,KAAAqoB,EAAA,CAAAttB,KAAA,SAAAhC,KAAA,OAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,SAAAA,EAAA1D,IAAA0D,GAAAA,EAAA7E,MAAIi3B,SAAAC,GAAA,KAAAL,GA8BJC,GAAA3oB,EAAA,KAAAipB,EAAA,CAAAluB,KAAA,SAAAhC,KAAA,UAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,YAAAA,EAAA1D,IAAA0D,GAAAA,EAAA0N,SAAO0kB,SAAAC,GAAA,KAAAL,GAKPC,GAAA3oB,EAAA,KAAAsoB,EAAA,CAAAvtB,KAAA,SAAAhC,KAAA,QAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,UAAAA,EAAA1D,IAAA0D,GAAAA,EAAA8a,OAAKsX,SAAAC,GAAA,KAAAL,GAkBLC,GAAA3oB,EAAA,KAAAuoB,EAAA,CAAAxtB,KAAA,SAAAhC,KAAA,OAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,SAAAA,EAAA1D,IAAA0D,GAAAA,EAAA6N,MAAIukB,SAAAC,GAAA,KAAAL,GAQJC,GAAA3oB,EAAA,KAAAkpB,EAAA,CAAAnuB,KAAA,SAAAhC,KAAA,SAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,WAAAA,EAAA1D,IAAA0D,GAAAA,EAAAwsB,QAAM4F,SAAAC,GAAA,KAAAL,GASNC,GAAA3oB,EAAA,KAAAwoB,EAAA,CAAAztB,KAAA,SAAAhC,KAAA,UAAA6vB,QAAA,EAAAC,SAAA,EAAAlR,OAAA,CAAAnjB,IAAAkC,GAAA,YAAAA,EAAA1D,IAAA0D,GAAAA,EAAA4Z,SAAOwY,SAAAC,GAAA,KAAAL,0GA7MkC,GC9CpC,MAAgBS,WAA6Ch4B,QAElE,OAAO6G,GACN,MAAMoxB,EAASr3B,KAAKyC,IAAIwD,GAClB8I,EAAS/G,MAAMhJ,OAAOiH,GAI5B,OAFIoxB,GAAQ3N,GAASjjB,EAAWzG,MAAO,CAAEgZ,KAAM,MAAOpU,KAAMqB,GAAOA,GAE5D8I,CACR,CAEA,GAAA9N,CAAIgF,GAEH,OADAkX,GAAU1W,EAAWzG,MAAOiG,GACrB+pB,GAAShoB,MAAM/G,IAAIgF,GAC3B,CAEA,GAAAxD,CAAIwD,GAEH,OADAkX,GAAU1W,EAAWzG,MAAOiG,GACrB+B,MAAMvF,IAAIwD,EAClB,CAEA,GAAA5E,CAAI4E,EAAQzD,GACX,MAAM60B,EAASr3B,KAAKyC,IAAIwD,GAClBwkB,EAAWzqB,KAAKiB,IAAIgF,GACpB2oB,EAAgBoB,GAASxtB,GAO/B,OANAxC,KAAKqB,IAAI4E,EAAK2oB,GAETyI,GAAU5M,IAAamE,GAC3BjE,GAAqBlkB,EAAWzG,MAAOiG,EAAKwkB,EAAUmE,EAAeyI,GAG/Dr3B,IACR,EAOK,MAAgBs3B,WAA0Bh0B,IAE/C,QAAIlC,GAEH,OADA+b,GAAUnd,KAAM,QACTgI,MAAM5G,IACd,CAEA,KAAAkS,GACC,MAAMikB,EAAav3B,KAAKoB,KAAO,EAG/B,GAFA4G,MAAMsL,QAEFikB,EAAY,CACf,MAAM7d,EAAY,CAAEV,KAAM,QAASnQ,OAAQ,SAE3CoX,GAAM,KACLyJ,GAAS1pB,KAAM0Z,EAAW,QAC1BmB,GAAQpU,EAAWzG,MAAO0Z,IAE5B,CACD,CAEA,OAAA9H,GAEC,OADAuL,GAAU1W,EAAWzG,OACdy1B,GAA4Bz1B,KAAK4R,UACzC,CAEA,OAAAhB,CAAQN,EAAwD1B,GAC/DuO,GAAU1W,EAAWzG,OACrBA,KAAK4Q,QAAQN,EAAY1B,EAC1B,CAEA,IAAAvI,GAEC,OADA8W,GAAU1W,EAAWzG,MAAOga,IACrBha,KAAKqG,MACb,CAEA,MAAA1D,GAEC,OADAwa,GAAU1W,EAAWzG,OACdu1B,GAAqBv1B,KAAK2C,SAClC,CAEA,CAACnC,OAAO4P,YACP+M,GAAU1W,EAAWzG,OACrB,MAAMw3B,EAA0Bl0B,IAAI3B,UAAUnB,OAAO4P,UAAUjP,KAAKnB,MAC9Dy3B,EAAaD,EAAG7X,KAAK+X,KAAKF,GAOhC,OANAA,EAAG7X,KAAO,KACT,MAAM5Q,EAAS0oB,IACf,GAAI1oB,EAAOymB,KAAM,OAAOzmB,EACxB,MAAO9I,EAAKzD,GAASuM,EAAOvM,MAC5B,MAAO,CAAEA,MAAO,CAACwtB,GAAS/pB,GAAM+pB,GAASxtB,IAASgzB,MAAM,IAElDgC,CACR,CAGA,OAAOvxB,GACN,MAAMoxB,EAASr3B,KAAKyC,IAAIwD,GAClB8I,EAAS/G,MAAMhJ,OAAOiH,GAE5B,GAAIoxB,EAAQ,CACX,MAAM3d,EAAY,CAAEV,KAAM,MAAOpU,KAAMqB,GACvCga,GAAM,KACLyJ,GAASjjB,EAAWzG,MAAO0Z,EAAWzT,GACtCyjB,GAAS1pB,KAAM0Z,EAAW,SAE5B,CAEA,OAAO3K,CACR,CAEA,GAAA9N,CAAIgF,GAEH,OADAkX,GAAU1W,EAAWzG,MAAOiG,GACrB+pB,GAAShoB,MAAM/G,IAAIgF,GAC3B,CAEA,GAAAxD,CAAIwD,GAEH,OADAkX,GAAU1W,EAAWzG,MAAOiG,GACrB+B,MAAMvF,IAAIwD,EAClB,CAEA,GAAA5E,CAAI4E,EAAQzD,GACX,MAAM60B,EAASr3B,KAAKyC,IAAIwD,GAClBwkB,EAAWzqB,KAAKiB,IAAIgF,GACpB2oB,EAAgBoB,GAASxtB,GAY/B,OAXAwF,MAAM3G,IAAI4E,EAAK2oB,GAEVyI,GAAU5M,IAAamE,GAC3B3O,GAAM,KACL0K,GAAqBlkB,EAAWzG,MAAOiG,EAAKwkB,EAAUmE,EAAeyI,GAGrE3N,GAAS1pB,KADS,CAAEgZ,KAAMqe,EAAS,MAAQ,MAAOzyB,KAAMqB,GAC9B,UAIrBjG,IACR,ECzIK,MAAgB23B,WAA0Cp0B,QAC/D,GAAAxE,CAAIyD,GACH,MAAM6uB,EAAMrxB,KAAKyC,IAAID,GAOrB,OANAwF,MAAMjJ,IAAIyD,GACL6uB,GAEJ3H,GAASjjB,EAAWzG,MAAO,CAAEgZ,KAAM,MAAOpU,KAAMpC,GAASA,GAGnDxC,IACR,CAEA,OAAOwC,GACN,MAAM6uB,EAAMrxB,KAAKyC,IAAID,GACfvC,EAAM+H,MAAMhJ,OAAOwD,GAEzB,OADI6uB,GAAK3H,GAASjjB,EAAWzG,MAAO,CAAEgZ,KAAM,MAAOpU,KAAMpC,GAASA,GAC3DvC,CACR,CAEA,GAAAwC,CAAID,GAEH,OADA2a,GAAU1W,EAAWzG,MAAOwC,GACrBwF,MAAMvF,IAAID,EAClB,EAOK,MAAgBo1B,WAAuBj5B,IAC5C,QAAIyC,GAGH,OADA+b,GAAUnd,KAAM,QACTA,KAAKoB,IACb,CAEA,GAAArC,CAAIyD,GACH,MAAM6uB,EAAMrxB,KAAKyC,IAAID,GACfosB,EAAgBoB,GAASxtB,GAE/B,GADAwF,MAAMjJ,IAAI6vB,IACLyC,EAAK,CACT,MAAM3X,EAAY,CAAEV,KAAM,MAAOpU,KAAMgqB,GAEvC3O,GAAM,KACLyJ,GAASjjB,EAAWzG,MAAO0Z,EAAWkV,GACtClF,GAAS1pB,KAAM0Z,EAAW,SAE5B,CACA,OAAO1Z,IACR,CAEA,KAAAsT,GACC,MAAMikB,EAAav3B,KAAKoB,KAAO,EAE/B,GADA4G,MAAMsL,QACFikB,EAAY,CACf,MAAM7d,EAAY,CAAEV,KAAM,QAASnQ,OAAQ,SAC3CoX,GAAM,KACLyJ,GAAS1pB,KAAM0Z,EAAW,QAC1BmB,GAAQpU,EAAWzG,MAAO0Z,IAE5B,CACD,CAEA,OAAOlX,GACN,MAAM6uB,EAAMrxB,KAAKyC,IAAID,GACfvC,EAAM+H,MAAMhJ,OAAOwD,GACzB,GAAI6uB,EAAK,CACR,MAAM3X,EAAY,CAAEV,KAAM,MAAOpU,KAAMpC,GACvCyd,GAAM,KACLyJ,GAASjjB,EAAWzG,MAAO0Z,EAAWlX,GACtCknB,GAAS1pB,KAAM0Z,EAAW,SAE5B,CACA,OAAOzZ,CACR,CAEA,GAAAwC,CAAID,GAEH,OADA2a,GAAU1W,EAAWzG,MAAOwC,GACrBxC,KAAKyC,IAAID,EACjB,CAEA,OAAAoP,GAEC,OADAuL,GAAU1W,EAAWzG,OACdy1B,GAA4Bz1B,KAAK4R,UACzC,CAEA,OAAAhB,CAAQN,EAAwD1B,GAC/DuO,GAAU1W,EAAWzG,OACrBA,KAAK4Q,QAAQN,EAAY1B,EAC1B,CAEA,IAAAvI,GAEC,OADA8W,GAAU1W,EAAWzG,OACdu1B,GAAqBv1B,KAAKqG,OAClC,CAEA,MAAA1D,GAEC,OADAwa,GAAU1W,EAAWzG,OACdu1B,GAAqBv1B,KAAK2C,SAClC,CAEA,CAACnC,OAAO4P,YACP+M,GAAU1W,EAAWzG,OACrB,MAAMw3B,EAAqB74B,IAAIgD,UAAUnB,OAAO4P,UAAUjP,KAAKnB,MACzDy3B,EAAaD,EAAG7X,KAAK+X,KAAKF,GAMhC,OALAA,EAAG7X,KAAO,KACT,MAAM5Q,EAAS0oB,IACf,OAAI1oB,EAAOymB,KAAazmB,EACjB,CAAEvM,MAAOwtB,GAASjhB,EAAOvM,OAAQgzB,MAAM,IAExCgC,CACR,ECnDDnJ,GAAWhtB,IAAI8B,MHrBT,cAAsCA,MAC3C,MAAA00B,GACC,OAAO73B,IACR,GGkBmC2B,WACpC0sB,GAAWhtB,IAAI1C,IAAKi5B,GAAYj2B,WAChC0sB,GAAWhtB,IAAIkC,QAASo0B,GAAgBh2B,WACxC0sB,GAAWhtB,IAAIiC,IAAKg0B,GAAY31B,WAChC0sB,GAAWhtB,IAAIjC,QAASg4B,GAAgBz1B,WACxC2sB,GAAWjtB,IAAI8B,MAAO2yB,GAAqBn0B,WAKpC,MAAMm2B,GAAmB,CAC/Bpb,iBACAC,iBACAhF,2BACAC,YACAoQ,iBACAC,2BACAE,gBACAC,+BCrFK2P,GAA2D,GAKpD/pB,GAAS9E,EAAU,CAC/BT,OAAM,CAAC0B,EAAUZ,EAASnB,IAClB,WACN,MAAM4vB,EAAqBD,GAAgBjnB,UACzCuZ,GAAMA,EAAE4N,SAAWj4B,MAAQqqB,EAAEzlB,OAASwD,GAExC,GAAI4vB,GAAqB,EACxB,MAAM,IAAIx0B,MACT,iCAAiCu0B,GAC/B/sB,MAAMgtB,GACN3nB,IAAKga,GAAM,GAAGA,EAAE4N,OAAOnwB,YAAYd,QAAQ9C,OAAOmmB,EAAEzlB,SACpD8M,KAAK,oBAETqmB,GAAgBj4B,KAAK,CAAEm4B,OAAQj4B,KAAM4E,KAAMwD,IAC3C,IACC,MAAMa,EAAKkB,EAAShJ,KAAKnB,MAEzB,OADAqF,GAAMrF,KAAMoI,EAAaa,GAClBA,CACR,SACC8uB,GAAgBvZ,KACjB,CACD,aAoBcnZ,GAAM4yB,EAAgB7vB,EAA0B5F,GAC/DF,OAAOO,eAAeo1B,EAAQ7vB,EAAa,CAAE5F,SAC9C,CAmBA,SAAS01B,GAAe7vB,GACvB,OAAO,YAAmC8vB,GACzC,OAAQC,GACA,cAAcA,EACpB,WAAAtwB,IAAenI,GACdqI,SAASrI,GACT,IAAK,MAAMsG,KAAOkyB,EAAY,CAC7B,MAAM9f,EAAW/V,OAAO0C,yBAAyBhF,KAAMiG,GACvD3D,OAAOO,eAAe7C,KAAMiG,EAAK3D,OAAOC,OAAO8V,GAAY,GAAIhQ,GAChE,CACD,EAGH,CACD,OAOaA,GAAgC/F,OAAOC,OAAO21B,GAAgB,CAI1E,cAAIzI,GACH,OAAOyI,GAAe,CAAEzI,YAAY,GACrC,EAIA,UAAI4I,GACH,OAAOH,GAAe,CAAEzI,YAAY,GACrC,EAIA,gBAAI1sB,GACH,OAAOm1B,GAAe,CAAEn1B,cAAc,GACvC,EAIA,UAAIu1B,GACH,OAAOJ,GAAe,CAAEn1B,cAAc,GACvC,EAIA,YAAI+D,GACH,OAAOoxB,GAAe,CAAEpxB,UAAU,GACnC,EAIA,YAAIyxB,GACH,OAAOL,GAAe,CAAEpxB,UAAU,GACnC,IAOY0xB,GAAal2B,OAAOC,OAChC2G,EAAU,CACTL,OAAM,CAACsB,EAAUZ,EAASnB,IAClB,YAAwBzI,GAE9B,OADA64B,GAAW9pB,KAAK1O,KAAMoI,GACf+B,EAASpK,MAAMC,KAAML,EAC7B,EAED8I,OAAM,CAAC0B,EAAUZ,EAASnB,IAClB,WAEN,OADAowB,GAAW9pB,KAAK1O,KAAMoI,GACf+B,EAAShJ,KAAKnB,KACtB,EAED2I,OAAM,CAACwB,EAAUZ,EAASnB,IAClB,SAAqB5F,GAE3B,OADAg2B,GAAW9pB,KAAK1O,KAAMoI,GACf+B,EAAShJ,KAAKnB,KAAMwC,EAC5B,EAED8F,MAAM6B,GACE,cAAcA,EACpB,WAAArC,IAAenI,GACdqI,SAASrI,GACT64B,GAAW9pB,KAAK1O,KAAM,cACvB,GAGF8I,QAAQf,GACAmB,EAAU,CAChBL,OAAM,CAACsB,EAAUZ,EAASnB,IAClB,YAAwBzI,GAE9B,OADA64B,GAAW9pB,KAAK1O,KAAMoI,EAAaL,GAC5BoC,EAASpK,MAAMC,KAAML,EAC7B,EAED8I,OAAM,CAAC0B,EAAUZ,EAASnB,IAClB,WAEN,OADAowB,GAAW9pB,KAAK1O,KAAMoI,EAAaL,GAC5BoC,EAAShJ,KAAKnB,KACtB,EAED2I,OAAM,CAACwB,EAAUZ,EAASnB,IAClB,SAAqB5F,GAE3B,OADAg2B,GAAW9pB,KAAK1O,KAAMoI,EAAaL,GAC5BoC,EAAShJ,KAAKnB,KAAMwC,EAC5B,EAED8F,MAAM6B,GACE,cAAcA,EACpB,WAAArC,IAAenI,GACdqI,SAASrI,GACT64B,GAAW9pB,KAAK1O,KAAM,cAAe+H,EACtC,OAML,CACC2G,KAAM,CAACvG,EAAaC,EAA0BL,KAC7CqG,GAAQM,KACP,GAAGvG,EAAOL,YAAYd,QAAQ9C,OAAOkE,mBAA6BL,EAAU,KAAKA,IAAY,mCCvKjG,MAAM0wB,QAAEA,IAAYC,GAEdC,GAAmB,qBACnBvxB,GAAiB1F,WAMjBk3B,GACiB,oBAAfl3B,WACJA,WACA0F,GAAewmB,OACdxmB,GAAewmB,SACfxmB,GAAeyxB,QACdzxB,GAAeyxB,OAGrB,GAAID,GAAa,CAChB,IAAIvpB,EAAS,cACb,IACKjI,GAAe0xB,WAAYzpB,EAASjI,GAAe0xB,gBACvB,IAAhB,CAAAC,IAAA,oBAAAhL,UAAA,oBAAAiL,SAAAC,QAAA,OAAAC,cAAAJ,YAAAK,KAAA,oBAAApL,SAAAiL,SAAAG,KAAAC,GAAA,WAAAA,EAAAC,QAAAC,eAAAF,EAAAG,KAAA,IAAAC,IAAA,mBAAAzL,SAAA0L,SAAAN,+PACf9pB,EAAS,oBAAA0e,UAAA,oBAAAiL,SAAAC,QAAA,OAAAC,cAAAJ,YAAAK,KAAA,oBAAApL,SAAAiL,SAAAG,KAAAC,GAAA,WAAAA,EAAAC,QAAAC,eAAAF,EAAAG,KAAA,IAAAC,IAAA,mBAAAzL,SAAA0L,SAAAN,KAEX,CAAE,MAAOn2B,GAAK,CAEd,MAAM02B,EAAoB,CAAEjB,WAASppB,SAAQsqB,UAAWv2B,KAAKw2B,OAE7D,GAAIhB,GAAYD,IAAmB,CAClC,MAAMtgB,EAAWugB,GAAYD,IAC7B,MAAM,IAAIn1B,MAER,4DAAsBq2B,KAAKC,UAAUzhB,EAAU,KAAM,qBACpCwhB,KAAKC,UAAUJ,EAAmB,KAAM,6NAK5D,CACAd,GAAYD,IAAoBe,CACjC,qF9BqCM,SAKJ3J,EAAkCgK,SASnC,OARIhK,GAAwB,mBAATA,IAClBgK,EAAgBhK,EAChBA,OAAOtoB,GAEHsoB,IACJA,EAAO,SAGR9hB,EAAO,cAA2B8hB,EAEjC,cAAOiK,CAAQr1B,GACd,MAAMiF,EAAaqE,EAAYgsB,YAAYh5B,IAAI0D,GAC/C,IAAKiF,EAAY,OAAO,EACxBH,EAAG8J,WAAW5O,EAAIkF,IAClBoE,EAAYgsB,YAAYj7B,OAAO2F,GAC/BrC,OAAO+S,eAAe1Q,EAAK,IAAIX,MAAM,CAAA,EAAIgG,IAEzC,IAAK,MAAM/D,KAAO3D,OAAO43B,oBAAoBv1B,UACpCA,EAAYsB,GAGrB,OADA2D,KACO,CACR,CACA,oBAAOuwB,CAAcx1B,GACpB,OAAOsJ,EAAYgsB,YAAYx3B,IAAIkC,EACpC,CAIA,WAAAmD,IAAenI,GACdqI,SAASrI,GACT,MAAMuK,EAAY,CAAA,EAClBlK,KAAK6J,GAAmBK,EAExB,MAAMkwB,EAAeL,GAAenwB,YAAc5J,KAAK4J,GACvD,IAAKwwB,EACJ,MAAM,IAAItwB,EAAiB,6BAE5B,SAASuwB,IACRD,EAAalwB,EACd,CACA+D,EAAYgsB,YAAY54B,IAAIrB,KAAMq6B,GAClC5wB,EAAGkK,SAAS3T,KAAMq6B,EAAanwB,EAChC,GAlCgB+D,EAAAgsB,YAAc,IAAI76B,QAmClC6O,CACF,wCE7DA,WAAAnG,GACkB9H,KAAAiO,GAAW,IAAI3K,IACftD,KAAA+T,GAAU,IAAIpV,IAcxBqB,KAAAkN,GAAKU,EAAS5N,KAAMiN,EAAcC,IAIlClN,KAAAwN,IAAMI,EAAS5N,KAAMiN,EAAcO,KAKnCxN,KAAAyN,KAAOG,EAAS5N,KAAMiN,EAAcQ,KAAM,MAKlD,CA1BQ,IAAA3O,CACNsO,GAMA,OADApN,KAAKtB,GAAOK,IAAIqO,GACT,KACNpN,KAAKtB,GAAOM,OAAOoO,GAErB,eEjDK,SACL2iB,EACAuK,GAEIvK,GAAwB,mBAATA,IAClBuK,EAAWvK,EACXA,OAAOtoB,GAEHsoB,IAEJA,EAAO,SAEHuK,IACJA,EAAW,CACV,GAAAr5B,CAAe+Q,GACd,GAA2B,mBAAhBhS,KAAKgQ,IACf,MAAM,IAAIxM,MAAM,+CAEjB,OAAOxD,KAAKgQ,IAAOgC,EACpB,EACA,GAAA3Q,CAAe2Q,EAAexP,GAC7B,GAA2B,mBAAhBxC,KAAKiQ,IACf,MAAM,IAAIzM,MAAM,sDAEjBxD,KAAKiQ,IAAO+B,EAAOxP,EACpB,IAIF,MAAe+3B,UAAmBxK,GA8FlC,OA1FAztB,OAAO+S,eACNklB,EAAU54B,UACV,IAAIqC,MAAO+rB,EAAcpuB,UAAW,CAEnC,CAACnB,OAAO0G,aAAc,kBACtB,GAAAjG,CAAIkH,EAAQvD,EAAMC,GACjB,GAAID,KAAQuD,EAAQ,CACnB,MAAMM,EAASnG,OAAO0C,yBAAyBmD,EAAQvD,IAAO3D,IAC9D,OAAOwH,EAASA,EAAOtH,KAAK0D,GAAYsD,EAAOvD,EAChD,CACA,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqB01B,EAASE,UAAW,OAAOF,EAASE,UAAUr5B,KAAK0D,GAC5E,MAAM41B,EAAUt2B,OAAOS,GACvB,IAAKT,OAAOmuB,MAAMmI,GACjB,OAAOH,EAASr5B,IAAKE,KAAK0D,EAAU41B,EAEtC,CAED,EACA,GAAAp5B,CAAI8G,EAAQvD,EAAMpC,EAAOqC,GACxB,GAAID,KAAQuD,EAAQ,CACnB,MAAMQ,EAASrG,OAAO0C,yBAAyBmD,EAAQvD,IAAOvD,IAG9D,OAFIsH,EAAQA,EAAOxH,KAAK0D,EAAUrC,GAC7B2F,EAAOvD,GAAQpC,GACb,CACR,CACA,GAAoB,iBAAToC,EAAmB,CAC7B,GAAa,WAATA,GAAqB01B,EAASI,UAEjC,OADAJ,EAASI,UAAUv5B,KAAK0D,EAAUrC,IAC3B,EAER,MAAMi4B,EAAUt2B,OAAOS,GACvB,IAAKT,OAAOmuB,MAAMmI,GAAU,CAC3B,IAAKH,EAASj5B,IAAK,MAAM,IAAImC,MAAM,sDAEnC,OADA82B,EAASj5B,IAAKF,KAAK0D,EAAU41B,EAASj4B,IAC/B,CACR,CACD,CAOA,OANAF,OAAOO,eAAegC,EAAUD,EAAM,CACrCpC,QACAsE,UAAU,EACV2oB,YAAY,EACZ1sB,cAAc,KAER,CACR,EACA,GAAAN,CAAI0F,EAAQvD,GACX,GAAIA,KAAQuD,EAAQ,OAAO,EAC3B,GAAoB,iBAATvD,EAAmB,CAC7B,GAAa,WAATA,GAAqB01B,EAASE,UAAW,OAAO,EACpD,MAAMC,EAAUt2B,OAAOS,GACvB,IAAKT,OAAOmuB,MAAMmI,GAAU,OAAO,CACpC,CACA,OAAO,CACR,EACA,OAAAnO,CAAQnkB,GACP,MAAM9B,EAAOtC,QAAQuoB,QAAQnkB,GAC7B,GAAImyB,EAASE,UAAW,CACvBn0B,EAAKvG,KAAK,UACV,MAAM66B,EAAML,EAASE,UAAUr5B,KAAKnB,MACpC,IAAK,IAAI4F,EAAI,EAAGA,EAAI+0B,EAAK/0B,IAAKS,EAAKvG,KAAKoE,OAAO0B,GAChD,CACA,OAAOS,CACR,EACA,wBAAArB,CAAyBmD,EAAQvD,GAChC,GAAIA,KAAQuD,EAAQ,OAAO7F,OAAO0C,yBAAyBmD,EAAQvD,GACnE,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqB01B,EAASE,UACjC,MAAO,CACN/K,YAAY,EACZ1sB,cAAc,EACd9B,IAAK,IAAMq5B,EAASE,UAAWr5B,KAAKnB,OAGtC,MAAMy6B,EAAUt2B,OAAOS,GACvB,IAAKT,OAAOmuB,MAAMmI,GACjB,MAAO,CACNhL,YAAY,EACZ1sB,cAAc,EACd9B,IAAK,IAAMq5B,EAASr5B,IAAKE,KAAKnB,KAAay6B,GAC3Cp5B,IAAKi5B,EAASj5B,IACV6R,GAAWonB,EAASj5B,IAAKF,KAAKnB,KAAay6B,EAASvnB,QACrDzL,EAGN,CAED,KAGK8yB,CACR,2ONlKM,SAAsBp1B,EAAQC,GACnC,IAAKjC,MAAMuC,QAAQP,KAAOhC,MAAMuC,QAAQN,GAAI,OAAO,EACnD,GAAID,IAAMC,EAAG,OAAO,EACpB,GAAID,EAAEQ,SAAWP,EAAEO,OAAQ,OAAO,EAClC,IAAK,IAAIC,EAAI,EAAGA,EAAIT,EAAEQ,OAAQC,IAC7B,GAAIT,EAAES,KAAOR,EAAEQ,GAAI,OAAO,EAE3B,OAAO,CACR,oBehBM,SAA6BnG,GAClC,GAAIud,GACH,MAAM,IAAIxZ,MAAM,mDAEjBwZ,IAAsB,EACtB,IACC,OAAOvd,GACR,SACCud,IAAsB,CACvB,CACD,cjBD0Ble,GAAeF,EAAWC,QAAQC,wCkBykCtD,SAAkBW,GACvB,OAAOwgB,GAAMxgB,EAAI,YAClB,0CAobCm7B,EACA35B,EACAI,GAEmB,mBAARJ,IACVI,EAAMJ,EAAII,IACVJ,EAAMA,EAAIA,KAEX,IAAI45B,EAAgCr6B,SASpC,OARAuX,EAAM,OACLG,GAAa,KACZ,MAAMwS,EAAWzpB,IACX65B,EAASD,EACfA,EAA2Br6B,SACvBoc,GAAO8N,KAAcoQ,GAAQF,EAASlQ,IACxCkQ,IAEGv5B,EACJyjB,GAAQtiB,IACRq4B,EAA2Bje,GAAOpa,GAClCnB,EAAImB,KAEJ,MACJ,oCd53CM,SAAmB4K,GACxB,IAAI2tB,GAAS,EACb,MAAMxlB,EAAU,KACXwlB,IACJA,GAAS,EACT3tB,MAGD,OADA3D,EAAGkK,SAAS4B,EAASnI,EAAIA,GAClBmI,CACR,oFGAC9V,EACAu7B,EACAh0B,GAEA,MAAM8G,EAAM,YAAqCnO,GAChD,OAAOF,EAAGM,MAAMC,KAAMg7B,KAAar7B,GACpC,EAGA,OAFIqH,GAAMG,EAAMH,EAAM8G,GAEfwB,EAASF,EAAe3P,EAAIqO,GAAYrO,EAAW8P,SAAW,GACtE,a0BSM,SAAmB0rB,GACxB,OAAO/xB,EAAU,CAChB,MAAAL,CAAOsB,EAAUZ,EAAS2xB,GACzB,IAAIC,EAAkD,KAEtD,OAAO,YAAwBx7B,GAE1Bw7B,GACHC,aAAaD,GAIdA,EAAY76B,WAAW,KACtB6J,EAASpK,MAAMC,KAAML,GACrBw7B,EAAY,MACVF,EACJ,CACD,GAEF,gBjB2aoD,CACnD1f,kBAAmB,QACnBE,cAAe,QACfQ,cAAe,CACdC,cAAe,CAAEC,SAAU,QAC3BC,WAAW,EACXC,eAAe,EACfC,YAAa,yLDnlBd,OAAO5D,GAAcjC,MACtB,gEC8DgB4kB,EAAoB34B,EAAuBwP,EAAQ,GAClE,MAAMopB,EAASppB,EAAQ,KAAKqpB,OAAOrpB,GAAS,GAC5C,OAAQxP,EAAOsW,MACd,IAAK,aAAc,CAClB,MAAMa,EAAmB,CAAC,GAAGyhB,gBAC7B,IAAK,IAAI11B,EAAI,EAAGA,EAAIlD,EAAOgd,SAAS/Z,OAAQC,IACvCA,EAAI,GAAGiU,EAAM/Z,KAAK,KACtB+Z,EAAM/Z,QAAQ2Z,GAAc/W,EAAOgd,SAAS9Z,KAK7C,OAHIlD,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,CACA,IAAK,UAAW,CACf,MAAMA,EAAmB,CAAC,GAAGyhB,YAK7B,OAJI54B,EAAOuW,QAAQY,EAAM/Z,KAAK,IAAI4C,EAAOuW,WACrCvW,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,CACA,IAAK,WAAY,CAChB,MAAMA,EAAmB,CAAC,GAAGyhB,aAAmB54B,EAAOuW,QAIvD,OAHIvW,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,CACA,IAAK,KAAM,CACV,MAAMA,EAAmB,CAAC,GAAGyhB,OAI7B,OAHI54B,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,CACA,IAAK,QAAS,CACb,MAAMA,EAAmB,CAAC,GAAGyhB,UAAgB54B,EAAOsZ,OAIpD,OAHItZ,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,CACA,IAAK,UAAW,CACf,MAAMA,EAAmB,CACxB,GAAGyhB,kBACAD,EAAoB34B,EAAOsjB,OAAQ9T,EAAQ,IAK/C,OAHIxP,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,CACA,IAAK,aAAc,CAClB,MAAMA,EAAmB,CACxB,GAAGyhB,qBACAD,EAAoB34B,EAAO2X,MAAOnI,EAAQ,IAK9C,OAHIxP,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,CACA,IAAK,WAAY,CAChB,MAAMA,EAAmB,GACzB,IAAK,IAAIjU,EAAI,EAAGA,EAAIlD,EAAOgf,QAAQ/b,OAAQC,IACtCA,EAAI,GAAGiU,EAAM/Z,KAAK,MACtB+Z,EAAM/Z,QAAQu7B,EAAoB34B,EAAOgf,QAAQ9b,GAAIsM,IAKtD,OAHIxP,EAAOwW,OACVW,EAAM/Z,KAAK,QAASu7B,EAAoB34B,EAAOwW,MAAOhH,IAEhD2H,CACR,EAEF,kDE/GC,OAAOqE,EACR,wFetDM,SAAmB+Z,EAAgB7vB,GACxC,QAAS9F,OAAO0C,yBAAyBizB,EAAQ7vB,EAClD,4D/BmCM,SAAmB5F,GACxB,MACkB,iBAAVA,GACG,OAAVA,IACCW,MAAMuC,QAAQlD,MAEdA,aAAiBY,MACjBZ,aAAiByB,QACjBzB,aAAiBgB,OACjBhB,aAAiB7D,KACjB6D,aAAiBc,KACjBd,aAAiBe,SACjBf,aAAiBpD,SACjBoD,aAAiBrC,SACjBqC,aAAiBa,SAGpB,2MiCgEC8E,EACAqzB,EACA5V,GASA,OAPAtjB,OAAOO,eAAesF,EAAQqzB,EAAU,CACvCv6B,IAAK2kB,EAAO3kB,IACZI,IAAKukB,EAAOvkB,IACZ0B,cAAc,EACd0sB,YAAY,IAEb/F,GAASvhB,EAAQ,CAAE6Q,KAAM,MAAOpU,KAAM42B,GAAYA,GAC3C,WAAcrzB,EAAeqzB,EACrC,cA3DM,SAILnsB,EACAtP,EACA07B,EAAqB,CAAA,GAErB,MAAMC,EAAiB1L,GAAS3gB,GAC1BlH,EAAS6nB,GAASyL,GAElB5K,EAAON,EAAM,oBAClB,WACC,MAAMlqB,EAAsB,GAC5B,IAAK,MAAMJ,KAAOy1B,EAAgBr1B,EAAKvG,KAAKmG,GAC5C,OAAOI,CACR,EACA,SAAgCJ,GAC/B,MAAM01B,EAAY11B,EACZ21B,EAAa,CAClB31B,IAAK01B,EACL16B,IAAK,IAAMyD,EAAUzD,IAAIy6B,EAAgBC,EAAWD,GACpDr6B,IAAMmB,GACLkC,EAAUrD,IAAIq6B,EAAgBC,EAAWn5B,EAAOk5B,IAQlD,OANAp5B,OAAOO,eAAe+4B,EAAY,QAAS,CAC1C36B,IAAK26B,EAAW36B,IAChBI,IAAKu6B,EAAWv6B,IAChB0B,cAAc,EACd0sB,YAAY,IAEN1vB,EAAM67B,EAAyDzzB,EACvE,GAGD,OAAOmR,GAAKnR,EAASzF,GAA2BmuB,EAAKnuB,GACtD,4GjB63BCwc,IAAS,EACTpC,QAAqBrV,EACrBmY,GAAWja,OAAS,EACpBmZ,GAAiB,IAAI1f,QACrB2f,GAAoB,IAAI3f,QACxB4f,GAAgB,IAAI5f,QACpB6f,GAAsB,IAAI7f,QJv/B1BuY,GAA0B,IAAIvY,QAC9BwY,GAAW,IAAIxY,QACfyY,GAAc,IAAIzY,QAClB6Y,GAAe,IAAI7Y,QGxBnB2d,GAAmB,IAAI3d,QC+gCvBsZ,GAAczB,QAAQR,YAAShP,CAChC,sBSrxBCo0B,EACAztB,EAAgC,IAEhC,MAAM0tB,EAAiC9L,GAAS,CAC/CxtB,MAAO4L,EAAQsC,aACfqrB,SAAS,EACT/f,WAAOvU,EACPu0B,OAAQ5tB,EAAQsC,aAChB,MAAAurB,GACCC,EAAa15B,OACd,IAGK05B,EAAelM,GAAS,CAAExtB,MAAO,IAEvC,IAAI25B,EAAU,EAEd,OAjDK,SAAqCL,EAAaM,GACvD,MAAMC,EAAW3jB,GAAcjC,OAC/B,IAAIyd,GAAQ,EAEZ,OAAO,IAAIlwB,MAAM83B,EAAU,CAC1B,CAACt7B,OAAO0G,aAAc,WACtBjG,IAAG,CAACkH,EAAQvD,KACPsvB,IACHlP,GAASqX,EAAUD,EAAnBpX,GACAkP,GAAQ,GAED/rB,EAAwDvD,KAGnE,CAmCQ03B,CAASR,EAAyB,KACxCxiB,GACCwiB,EACA/jB,EAAM,iBAAkB6N,IAElBsW,EAAa15B,MAElB,MAAM+5B,IAAOJ,EACbL,EAASC,SAAU,EACnBD,EAAS9f,WAAQvU,EAEjB,IACC,MAAMsH,EAAS8sB,EAAQjW,GAEnB7W,aAAkB5O,QACrB27B,EAASU,QAAUztB,EACjB7O,KAAM4F,IACFy2B,IAAOJ,IACVL,EAASt5B,MAAQsD,EACjBg2B,EAASE,OAASl2B,EAClBg2B,EAASC,SAAU,KAGpBn6B,MAAO66B,IACHF,IAAOJ,IACVL,EAAS9f,MAAQygB,EACjBX,EAASC,SAAU,MAItBD,EAASU,QAAUr8B,QAAQC,UAC3B07B,EAASt5B,MAAQuM,EACjB+sB,EAASE,OAASjtB,EAClB+sB,EAASC,SAAU,EAErB,CAAE,MAAOU,GACRX,EAASU,QAAUr8B,QAAQE,OAAOo8B,GAClCX,EAAS9f,MAAQygB,EACjBX,EAASC,SAAU,CACpB,MAIJ,0CMvFM,SAAmBd,GACxB,OAAO/xB,EAAU,CAChB,MAAAL,CAAOsB,EAAUZ,EAAS2xB,GACzB,IAAIwB,EAAe,EACfvB,EAAkD,KAEtD,OAAO,YAAwBx7B,GAC9B,MAAMi6B,EAAMx2B,KAAKw2B,MAGjB,GAAIA,EAAM8C,GAAgBzB,EAOzB,OALIE,IACHC,aAAaD,GACbA,EAAY,MAEbuB,EAAe9C,EACRzvB,EAASpK,MAAMC,KAAML,GAI7B,IAAKw7B,EAAW,CACf,MAAMwB,EAAgB1B,GAASrB,EAAM8C,GAC/BE,EAAgB,IAAIj9B,GAC1Bw7B,EAAY76B,WAAW,KACtBo8B,EAAet5B,KAAKw2B,MACpBzvB,EAASpK,MAAMC,KAAM48B,GACrBzB,EAAY,MACVwB,EACJ,CACD,CACD,GAEF,sClB3IM,SAAUE,EAAOl4B,EAAajC,GACnC,MAAMrB,EAAMgY,GAASpY,IAAI0D,GACzB,GAAItD,EAAK,CACRgY,GAASra,OAAO2F,GAChB,IAAK,MAAMlF,KAAM4B,EACE,mBAAP5B,EAAmBA,EAAGiD,GAC5Bm6B,EAAOp9B,EAAIiD,EAClB,CACD,+DYWM,SAAkB8N,EAAqCssB,GAC5D,OAAO,IAAI38B,QAAW,CAACC,EAASC,KAC/B,IAAI08B,EACJ,MAAMlM,EAAO9Y,EAAM,aAAc6N,IAChC,IACC,MAAMpjB,EAAQgO,EAAUoV,GACpBpjB,SACWiF,IAAVs1B,GAAqB3B,aAAa2B,GACtCA,OAAQt1B,EACRpF,eAAe,IAAMwuB,KACrBzwB,EAAQoC,GAEV,CAAE,MAAOwZ,QACMvU,IAAVs1B,GAAqB3B,aAAa2B,GACtCA,OAAQt1B,EACRpH,EAAO2b,EACR,SAEevU,IAAZq1B,IACHC,EAAQz8B,WAAW,KAClBuwB,IACAkM,OAAQt1B,EACRpH,EAAO,IAAImD,MAAM,yBAAyBs5B,SACxCA,KAGN,sBZhGM,SAA+BE,EAAgCv9B,GACpE,OAAOiZ,GAAc/F,KAAKqqB,EAAYv9B,EACvC,qBbtE0DE,GACzD,IAAKA,EAAKgG,OAAQ,MAAO,GACzB,MAAMs3B,EAAY/xB,KAAK+hB,OAAOttB,EAAK0Q,IAAK6sB,GAAQA,EAAIv3B,SAEpD,IAAK,IAAIC,EAAI,EAAGA,EAAIq3B,EAAWr3B,IAAK,CACnC,MAAMu3B,EAAQx9B,EAAK0Q,IAAK6sB,GAAQA,EAAIt3B,UAC9Bu3B,CACP,CACD"}