mutts 1.0.6 → 1.0.8

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

@@ -1 +1 @@
-{"version":3,"file":"mutts.umd.min.js","sources":["../src/reactive/types.ts","../src/utils.ts","../src/decorator.ts","../src/destroyable.ts","../src/eventful.ts","../src/indexable.ts","../src/iterableWeak.ts","../src/mixins.ts","../src/reactive/registry.ts","../src/reactive/debug.ts","../src/reactive/effect-context.ts","../src/reactive/proxy-state.ts","../src/reactive/tracking.ts","../src/reactive/zone.ts","../src/reactive/effects.ts","../src/reactive/deep-watch-state.ts","../src/reactive/change.ts","../src/reactive/non-reactive-state.ts","../src/reactive/deep-touch.ts","../src/reactive/proxy.ts","../src/reactive/deep-watch.ts","../src/reactive/interface.ts","../src/reactive/non-reactive.ts","../src/reactive/array.ts","../src/reactive/mapped.ts","../src/reactive/memoize.ts","../src/reactive/register.ts","../src/reactive/project.ts","../src/reactive/record.ts","../src/reactive/map.ts","../src/reactive/set.ts","../src/reactive/index.ts","../src/std-decorators.ts","../src/index.ts"],"sourcesContent":["// biome-ignore-all lint/suspicious/noConfusingVoidType: Type 'void' is not assignable to type 'ScopedCallback | undefined'.\n// Argument of type '() => void' is not assignable to parameter of type '(dep: DependencyFunction) => ScopedCallback | undefined'.\n\n/**\n * Function type for dependency tracking in effects\n * Restores the active effect context for dependency tracking\n */\nexport type DependencyFunction = <T>(cb: () => T) => T\n/**\n * Dependency access passed to user callbacks within effects/watch\n * Provides functions to track dependencies and information about the effect execution\n */\nexport interface DependencyAccess {\n\t// TODO: remove tracked (async is managed)\n\t// TODO: remove ascend (make a global like `untracked` who  withEffect(parentEffect, () => {}))\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: DependencyFunction\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: DependencyFunction\n\t/**\n\t * Indicates whether the effect is running as a reaction (i.e. not the first call)\n\t * - `false`: First execution when the effect is created\n\t * - `true`: Subsequent executions triggered by dependency changes\n\t * @example\n\t * ```typescript\n\t * effect(({ reaction }) => {\n\t *   if (!reaction) {\n\t *     console.log('Effect initialized')\n\t *     // Setup code that should only run once\n\t *   } else {\n\t *     console.log('Effect re-ran due to dependency change')\n\t *     // Code that runs on every update\n\t *   }\n\t * })\n\t * ```\n\t */\n\treaction: boolean\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 * Type for effect cleanup functions\n */\nexport type ScopedCallback = () => void\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}\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\ntype State =\n\t| {\n\t\t\tevolution: Evolution\n\t\t\tnext: State\n\t  }\n\t| {}\n\n// Track native reactivity\nconst nativeReactive = Symbol('native-reactive')\n\n/**\n * Symbol to mark individual objects as non-reactive\n */\nexport const nonReactiveMark = Symbol('non-reactive')\n/**\n * Symbol to mark class properties as non-reactive\n */\nexport const unreactiveProperties = Symbol('unreactive-properties')\n/**\n * Symbol for prototype forwarding in reactive objects\n */\nexport const prototypeForwarding: unique symbol = Symbol('prototype-forwarding')\n\n/**\n * Symbol representing all properties in reactive tracking\n */\nexport const allProps = Symbol('all-props')\n\n/**\n * Symbol for accessing projection information on reactive objects\n */\nexport const projectionInfo = Symbol('projection-info')\n\n/**\n * Symbol to check if an effect is stopped\n */\nexport const stopped = Symbol('stopped')\n\n/**\n * Symbol to access effect cleanup function\n */\nexport const cleanup = Symbol('cleanup')\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// Symbol to mark functions with their root function\nconst rootFunction = Symbol('root-function')\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}\n\nexport type CycleDebugInfo = {\n\tcode: ReactiveErrorCode.CycleDetected\n\tcycle: string[]\n\tdetails?: string\n}\n\nexport type MaxDepthDebugInfo = {\n\tcode: ReactiveErrorCode.MaxDepthExceeded\n\tdepth: number\n\tchain: string[]\n}\n\nexport type MaxReactionDebugInfo = {\n\tcode: ReactiveErrorCode.MaxReactionExceeded\n\tcount: number\n\teffect: string\n}\n\nexport type GenericDebugInfo = {\n\tcode: ReactiveErrorCode\n\tcausalChain?: string[]\n\tcreationStack?: string\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\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?: Set<ScopedCallback>) => {},\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: ScopedCallback, _runningChain: ScopedCallback[]) => {},\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| ((cached: any, fresh: any, fn: Function, args: any[], cause: \"calculation\" | \"comparison\") => void)\n\t\t| undefined,\n\t/**\n\t * How to handle cycles detected in effect batches\n\t * - 'throw': Throw an error with cycle information (default, recommended for development)\n\t * - 'warn': Log a warning and break the cycle by executing one effect\n\t * - 'break': Silently break the cycle by executing one effect (recommended for production)\n\t * - 'strict': Prevent cycle creation by checking graph before execution (throws error)\n\t * @default 'throw'\n\t */\n\tcycleHandling: 'throw' as 'throw' | 'warn' | 'break' | 'strict',\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 * Configuration for the introspection system\n\t */\n\tintrospection: {\n\t\t/**\n\t\t * Whether to keep a history of mutations for debugging\n\t\t * @default false\n\t\t */\n\t\tenableHistory: false,\n\t\t/**\n\t\t * Number of mutations to keep in history\n\t\t * @default 50\n\t\t */\n\t\thistorySize: 50,\n\t},\n\n\t/**\n\t * Configuration for zone hooks - control which async APIs are hooked\n\t * Each option controls whether the corresponding async API is wrapped to preserve effect context\n\t * Only applies when asyncMode is enabled (truthy)\n\t */\n\tzones: {\n\t\t/**\n\t\t * Hook setTimeout to preserve effect context\n\t\t * @default true\n\t\t */\n\t\tsetTimeout: true,\n\t\t/**\n\t\t * Hook setInterval to preserve effect context\n\t\t * @default true\n\t\t */\n\t\tsetInterval: true,\n\t\t/**\n\t\t * Hook requestAnimationFrame (runs in untracked context when hooked)\n\t\t * @default true\n\t\t */\n\t\trequestAnimationFrame: true,\n\t\t/**\n\t\t * Hook queueMicrotask to preserve effect context\n\t\t * @default true\n\t\t */\n\t\tqueueMicrotask: true,\n\t},\n}\n// biome-ignore-end lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n\nexport { type State, nativeReactive, rootFunction }\n","import { prototypeForwarding } from './reactive/types'\n\ntype ElementTypes<T extends readonly unknown[]> = {\n\t[K in keyof T]: T[K] extends readonly (infer U)[] ? U : T[K]\n}\n\n/**\n * Combines multiple arrays into an array of tuples, stopping at the shortest array length\n * @param args - Arrays to zip together\n * @returns Array of tuples containing elements from each input array\n */\nexport function zip<T extends (readonly unknown[])[]>(...args: T): ElementTypes<T>[] {\n\tif (!args.length) return []\n\tconst minLength = Math.min(...args.map((arr) => arr.length))\n\tconst result: ElementTypes<T>[] = []\n\n\tfor (let i = 0; i < minLength; i++) {\n\t\tconst tuple = args.map((arr) => arr[i]) as ElementTypes<T>\n\t\tresult.push(tuple)\n\t}\n\n\treturn result\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 (a === b) return true\n\tif (!Array.isArray(a) || !Array.isArray(b)) return false\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 * Renames a function with a new name\n * @param fct - The function to rename\n * @param name - The new name for the function\n * @returns The function with the new name\n */\nexport function renamed<F extends Function>(fct: F, name: string): F {\n\treturn Object.defineProperties(fct, {\n\t\tname: {\n\t\t\tvalue: name,\n\t\t},\n\t})\n}\n\nexport function ReflectGet(obj: any, prop: any, receiver: any) {\n\t// Check if Node is available and obj is an instance of Node\n\tif (typeof Node !== 'undefined' && obj instanceof Node) return (obj as any)[prop]\n\treturn Reflect.get(obj, prop, receiver)\n}\n\nexport function ReflectSet(obj: any, prop: any, value: any, receiver: any) {\n\t// Check if Node is available and obj is an instance of Node\n\tif (typeof Node !== 'undefined' && obj instanceof Node) {\n\t\t;(obj as any)[prop] = value\n\t\treturn true\n\t}\n\tif (!(obj instanceof Object) && !Reflect.has(obj, prop)) {\n\t\tObject.defineProperty(obj, prop, {\n\t\t\tvalue,\n\t\t\tconfigurable: true,\n\t\t\twritable: true,\n\t\t\tenumerable: true,\n\t\t})\n\t\treturn true\n\t}\n\treturn Reflect.set(obj, prop, value, receiver)\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\t// Unwrap mutts proxies if present\n\twhile (a && typeof a === 'object' && prototypeForwarding in a) {\n\t\ta = (a as any)[prototypeForwarding]\n\t}\n\twhile (b && typeof b === 'object' && prototypeForwarding in b) {\n\t\tb = (b as any)[prototypeForwarding]\n\t}\n\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\tconst protoA = Object.getPrototypeOf(a)\n\tconst protoB = Object.getPrototypeOf(b)\n\tif (protoA !== protoB) {\n\t\tconsole.warn(`[deepCompare] prototype mismatch:`, { nameA: a?.constructor?.name, nameB: b?.constructor?.name })\n\t\treturn false\n\t}\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)) {\n\t\t\tconsole.warn(`[deepCompare] B is not an array`)\n\t\t\treturn false\n\t\t}\n\t\tif (a.length !== b.length) {\n\t\t\tconsole.warn(`[deepCompare] array length mismatch:`, { lenA: a.length, lenB: b.length })\n\t\t\treturn false\n\t\t}\n\t\tfor (let i = 0; i < a.length; i++) {\n\t\t\tif (!deepCompare(a[i], b[i], cache)) {\n\t\t\t\tconsole.warn(`[deepCompare] array element mismatch at index ${i}`)\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Date) {\n\t\tconst match = b instanceof Date && a.getTime() === b.getTime()\n\t\tif (!match) console.warn(`[deepCompare] Date mismatch`)\n\t\treturn match\n\t}\n\tif (a instanceof RegExp) {\n\t\tconst match = b instanceof RegExp && a.toString() === b.toString()\n\t\tif (!match) console.warn(`[deepCompare] RegExp mismatch`)\n\t\treturn match\n\t}\n\tif (a instanceof Set) {\n\t\tif (!(b instanceof Set) || a.size !== b.size) {\n\t\t\tconsole.warn(`[deepCompare] Set size mismatch`)\n\t\t\treturn false\n\t\t}\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) {\n\t\t\t\tconsole.warn(`[deepCompare] missing Set element`)\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\tif (a instanceof Map) {\n\t\tif (!(b instanceof Map) || a.size !== b.size) {\n\t\t\tconsole.warn(`[deepCompare] Map size mismatch`)\n\t\t\treturn false\n\t\t}\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) {\n\t\t\t\t\tconsole.warn(`[deepCompare] missing Map key`)\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (!deepCompare(val, b.get(key), cache)) {\n\t\t\t\t\tconsole.warn(`[deepCompare] Map value mismatch for key`)\n\t\t\t\t\treturn false\n\t\t\t\t}\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) {\n\t\tconsole.warn(`[deepCompare] keys length mismatch:`, { lenA: keysA.length, lenB: keysB.length, keysA, keysB, a, b })\n\t\treturn false\n\t}\n\n\tfor (const key of keysA) {\n\t\tif (!Object.prototype.hasOwnProperty.call(b, key)) {\n\t\t\tconsole.warn(`[deepCompare] missing key ${String(key)} in B`)\n\t\t\treturn false\n\t\t}\n\t\tif (!deepCompare(a[key], b[key], cache)) {\n\t\t\tconsole.warn(`[deepCompare] value mismatch for key ${String(key)}:`, { valA: a[key], valB: b[key] })\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\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> = (original: (this: T) => any, target: any, name: PropertyKey) => ((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","/**\n * Base type for event maps - all event handlers must be functions\n */\nexport type EventsBase = Record<string, (...args: any[]) => void>\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\treadonly #events = new Map<keyof Events, ((...args: any[]) => void)[]>()\n\treadonly #hooks = [] as ((...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\tif (!this.#hooks.includes(cb)) this.#hooks.push(cb)\n\t\treturn () => {\n\t\t\tthis.#hooks.splice(this.#hooks.indexOf(cb), 1)\n\t\t}\n\t}\n\n\tpublic on(events: Partial<Events>): void\n\tpublic on<EventType extends keyof Events>(event: EventType, cb: Events[EventType]): () => void\n\tpublic on<EventType extends keyof Events>(\n\t\teventOrEvents: EventType | Partial<Events>,\n\t\tcb?: Events[EventType]\n\t): () => void {\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof Events)[]) {\n\t\t\t\tthis.on(e, eventOrEvents[e]!)\n\t\t\t}\n\t\t} else if (cb !== undefined) {\n\t\t\tlet callbacks = this.#events.get(eventOrEvents)\n\t\t\tif (!callbacks) {\n\t\t\t\tcallbacks = []\n\t\t\t\tthis.#events.set(eventOrEvents, callbacks)\n\t\t\t}\n\t\t\tcallbacks.push(cb)\n\t\t}\n\t\t// @ts-expect-error Generic case leads to generic case\n\t\treturn () => this.off(eventOrEvents, cb)\n\t}\n\tpublic off(events: Partial<Events>): void\n\tpublic off<EventType extends keyof Events>(event: EventType, cb?: Events[EventType]): void\n\tpublic off<EventType extends keyof Events>(\n\t\teventOrEvents: EventType | Partial<Events>,\n\t\tcb?: Events[EventType]\n\t): void {\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof Events)[]) {\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\tthis.#events.set(\n\t\t\t\t\teventOrEvents,\n\t\t\t\t\tcallbacks.filter((c) => c !== cb)\n\t\t\t\t)\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\tpublic emit<EventType extends keyof Events>(\n\t\tevent: EventType,\n\t\t...args: Parameters<Events[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","/**\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})\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 { isConstructor, ReflectGet } 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 = ReflectGet(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","import { rootFunction, type ScopedCallback } from './types'\n\n// Track which effects are watching which reactive objects for cleanup\nexport const effectToReactiveObjects = new WeakMap<ScopedCallback, Set<object>>()\n\n// Track effects per reactive object and property\nexport const watchers = new WeakMap<object, Map<any, Set<ScopedCallback>>>()\n\n// runEffect -> set<stop>\nexport const effectChildren = new WeakMap<ScopedCallback, Set<ScopedCallback>>()\n\n// Track parent effect relationships for hierarchy traversal (used in deep touch filtering)\nexport const effectParent = new WeakMap<ScopedCallback, ScopedCallback | undefined>()\n\n// Track reverse mapping to ensure unicity: One Root -> One Function\nconst reverseRoots = new WeakMap<any, WeakRef<Function>>()\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 {\t\n\t// Check for collision\n\tconst existingRef = reverseRoots.get(root)\n\tconst existing = existingRef?.deref()\n\t\t\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`Cannot reuse it for '${fnName}'. Shared roots cause lost updates and broken identity logic.`\n\t\t)\n\t}\n\t\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// Mark fn with the new root\n\treturn Object.defineProperty(fn, rootFunction, {\n\t\tvalue: getRoot(root),\n\t\t\twritable: false,\n\t\t})\n\t}\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 && rootFunction in fn) fn = fn[rootFunction] as T\n\treturn fn\n}\n\n// Flag to disable dependency tracking for the current active effect (not globally)\nexport const trackingDisabledEffects = new WeakSet<ScopedCallback>()\nexport let globalTrackingDisabled = false\n\nexport function setGlobalTrackingDisabled(value: boolean): void {\n\tglobalTrackingDisabled = value\n}\n","/**\n * Debug utilities for the reactivity system\n * - Captures effect metadata (names, parent relationships)\n * - Records cause → consequence edges with object/prop labels\n * - Provides graph data for tooling (DevTools panel, etc.)\n */\n\nimport { effectParent, effectToReactiveObjects, getRoot } from './registry'\nimport { allProps, type Evolution, options, type ScopedCallback } from './types'\n\nconst EXTERNAL_SOURCE = Symbol('external-source')\ntype SourceEffect = ScopedCallback | typeof EXTERNAL_SOURCE\n\nlet devtoolsEnabled = false\n\n// Registry for debugging (populated lazily when DevTools are enabled)\nconst debugEffectRegistry = new Set<ScopedCallback>()\nconst debugObjectRegistry = new Set<object>()\n\n// Human-friendly names\nconst effectNames = new WeakMap<ScopedCallback, string>()\nconst objectNames = new WeakMap<object, string>()\nlet effectCounter = 0\nlet objectCounter = 0\n\n// Cause/consequence edges aggregated by (source, target, descriptor)\ninterface TriggerRecord {\n\tlabel: string\n\tobject: object\n\tprop: any\n\tevolution: Evolution\n\tcount: number\n\tlastTriggered: number\n}\n\nconst triggerGraph = new Map<SourceEffect, Map<ScopedCallback, Map<string, TriggerRecord>>>()\n\nexport type NodeKind = 'effect' | 'external' | 'state'\nexport type EdgeKind = 'cause' | 'dependency' | 'trigger'\n\nexport interface EffectNode {\n\tid: string\n\tlabel: string\n\ttype: NodeKind\n\tdepth: number\n\tparentId?: string\n\tdebugName?: string\n}\n\nexport interface ObjectNode {\n\tid: string\n\tlabel: string\n\ttype: NodeKind\n\tdebugName?: string\n}\n\nexport interface GraphEdge {\n\tid: string\n\tsource: string\n\ttarget: string\n\ttype: EdgeKind\n\tlabel: string\n\tcount?: number\n}\n\nexport interface ReactivityGraph {\n\tnodes: Array<EffectNode | ObjectNode>\n\tedges: GraphEdge[]\n\tmeta: {\n\t\tgeneratedAt: number\n\t\tdevtoolsEnabled: boolean\n\t}\n}\n\nfunction ensureEffectName(effect: ScopedCallback): string {\n\tlet name = effectNames.get(effect)\n\tif (!name) {\n\t\tconst root = getRoot(effect)\n\t\tname = root?.name?.trim() || `effect_${++effectCounter}`\n\t\teffectNames.set(effect, name)\n\t}\n\treturn name\n}\n\nfunction ensureObjectName(obj: object): string {\n\tlet name = objectNames.get(obj)\n\tif (!name) {\n\t\tconst ctorName = (obj as any)?.constructor?.name\n\t\tconst base = ctorName && ctorName !== 'Object' ? ctorName : 'object'\n\t\tname = `${base}_${++objectCounter}`\n\t\tobjectNames.set(obj, name)\n\t}\n\treturn name\n}\n\nfunction describeProp(obj: object, prop: any): string {\n\tconst objectName = ensureObjectName(obj)\n\tif (prop === allProps) return `${objectName}.*`\n\tif (typeof prop === 'symbol') return `${objectName}.${prop.description ?? prop.toString()}`\n\treturn `${objectName}.${String(prop)}`\n}\n\nfunction addEffectToRegistry(effect: ScopedCallback) {\n\tif (!effect || debugEffectRegistry.has(effect)) return\n\tdebugEffectRegistry.add(effect)\n\tconst deps = effectToReactiveObjects.get(effect)\n\tif (deps) {\n\t\tfor (const obj of deps) {\n\t\t\tdocumentObject(obj)\n\t\t}\n\t}\n}\n\nfunction documentObject(obj: object) {\n\tif (!debugObjectRegistry.has(obj)) {\n\t\tdbRegisterObject(obj)\n\t}\n}\n\nfunction dbRegisterObject(obj: object) {\n\tdebugObjectRegistry.add(obj)\n\tensureObjectName(obj)\n}\n\nfunction ensureParentChains(effects: Set<ScopedCallback>) {\n\tconst queue = Array.from(effects)\n\tfor (let i = 0; i < queue.length; i++) {\n\t\tconst effect = queue[i]\n\t\tconst parent = effectParent.get(effect)\n\t\tif (parent && !effects.has(parent)) {\n\t\t\teffects.add(parent)\n\t\t\tqueue.push(parent)\n\t\t}\n\t}\n}\n\nfunction ensureTriggerContainers(source: SourceEffect) {\n\tlet targetMap = triggerGraph.get(source)\n\tif (!targetMap) {\n\t\ttargetMap = new Map()\n\t\ttriggerGraph.set(source, targetMap)\n\t}\n\treturn targetMap\n}\n\nfunction ensureTriggerRecord(\n\tsource: SourceEffect,\n\ttarget: ScopedCallback,\n\tlabel: string,\n\tobj: object,\n\tprop: any,\n\tevolution: Evolution\n): TriggerRecord {\n\tconst targetMap = ensureTriggerContainers(source)\n\tlet labelMap = targetMap.get(target)\n\tif (!labelMap) {\n\t\tlabelMap = new Map()\n\t\ttargetMap.set(target, labelMap)\n\t}\n\tlet record = labelMap.get(label)\n\tif (!record) {\n\t\trecord = { label, object: obj, prop, evolution, count: 0, lastTriggered: Date.now() }\n\t\tlabelMap.set(label, record)\n\t}\n\treturn record\n}\n\n/**\n * Assign a debug-friendly name to an effect (shown in DevTools)\n */\nexport function setEffectName(effect: ScopedCallback, name: string) {\n\teffectNames.set(effect, name)\n}\n\n/**\n * Assign a debug-friendly name to a reactive object\n */\nexport function setObjectName(obj: object, name: string) {\n\tobjectNames.set(obj, name)\n\tdebugObjectRegistry.add(obj)\n}\n\n/**\n * Register an effect so it appears in the DevTools graph\n */\nexport function registerEffectForDebug(effect: ScopedCallback) {\n\tif (!effect || !devtoolsEnabled) return\n\taddEffectToRegistry(effect)\n}\n\n/**\n * Register a reactive object so it appears in the DevTools graph\n */\nexport function registerObjectForDebug(obj: object) {\n\tif (!devtoolsEnabled) return\n\tdocumentObject(obj)\n}\n\n/**\n * Records a cause → consequence relationship between effects.\n * @param source - The effect performing the write (undefined if external/user input)\n * @param target - The effect that re-ran because of the write\n * @param obj - The reactive object that changed\n * @param prop - The property that changed\n * @param evolution - The type of change (set/add/del/bunch)\n */\nexport function recordTriggerLink(\n\tsource: ScopedCallback | undefined,\n\ttarget: ScopedCallback,\n\tobj: object,\n\tprop: any,\n\tevolution: Evolution\n) {\n\tif (options.introspection.enableHistory) {\n\t\taddToMutationHistory(source, target, obj, prop, evolution)\n\t}\n\tif (!devtoolsEnabled) return\n\taddEffectToRegistry(target)\n\tif (source) addEffectToRegistry(source)\n\tconst descriptor = describeProp(obj, prop)\n\tconst record = ensureTriggerRecord(\n\t\tsource ?? EXTERNAL_SOURCE,\n\t\ttarget,\n\t\tdescriptor,\n\t\tobj,\n\t\tprop,\n\t\tevolution\n\t)\n\trecord.count += 1\n\trecord.lastTriggered = Date.now()\n\tdocumentObject(obj)\n}\n\n/**\n * Traces back the chain of triggers that led to a specific effect\n * @param effect The effect to trace back\n * @param limit Max depth\n */\nexport function getTriggerChain(effect: ScopedCallback, limit = 5): string[] {\n\tconst chain: string[] = []\n\tlet current = effect\n\tfor (let i = 0; i < limit; i++) {\n\t\t// Find who triggered 'current'\n\t\t// We need to reverse search the triggerGraph (source -> target)\n\t\t// This is expensive O(Edges) but okay for error reporting\n\t\tlet foundSource: ScopedCallback | undefined\n\t\tlet foundReason = ''\n\n\t\tsearch: for (const [source, targetMap] of triggerGraph) {\n\t\t\tfor (const [target, labelMap] of targetMap) {\n\t\t\t\tif (target === current) {\n\t\t\t\t\t// Found a source! Use the most recent trigger record\n\t\t\t\t\tlet lastTime = 0\n\t\t\t\t\tfor (const record of labelMap.values()) {\n\t\t\t\t\t\tif (record.lastTriggered > lastTime) {\n\t\t\t\t\t\t\tlastTime = record.lastTriggered\n\t\t\t\t\t\t\tfoundReason = record.label\n\t\t\t\t\t\t\tfoundSource = source === EXTERNAL_SOURCE ? undefined : (source as ScopedCallback)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (foundSource || foundReason) break search\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (foundSource) {\n\t\t\tchain.push(\n\t\t\t\t`${ensureEffectName(foundSource)} -> (${foundReason}) -> ${ensureEffectName(current)}`\n\t\t\t)\n\t\t\tcurrent = foundSource\n\t\t} else if (foundReason) {\n\t\t\tchain.push(`External -> (${foundReason}) -> ${ensureEffectName(current)}`)\n\t\t\tbreak\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn chain.reverse()\n}\n\nfunction buildEffectNodes(allEffects: Set<ScopedCallback>) {\n\tconst nodes: EffectNode[] = []\n\tconst nodeByEffect = new Map<ScopedCallback, EffectNode>()\n\n\tconst ordered = Array.from(allEffects)\n\tfor (const effect of ordered) {\n\t\tconst label = ensureEffectName(effect)\n\t\tconst node: EffectNode = {\n\t\t\tid: `effect_${nodes.length}`,\n\t\t\tlabel,\n\t\t\ttype: 'effect',\n\t\t\tdepth: 0,\n\t\t\tdebugName: label,\n\t\t}\n\t\tnodes.push(node)\n\t\tnodeByEffect.set(effect, node)\n\t}\n\n\tconst depthCache = new Map<ScopedCallback, number>()\n\tconst computeDepth = (effect: ScopedCallback | undefined): number => {\n\t\tif (!effect) return 0\n\t\tconst cached = depthCache.get(effect)\n\t\tif (cached !== undefined) return cached\n\t\tconst parent = effectParent.get(effect)\n\t\tconst depth = computeDepth(parent) + (parent ? 1 : 0)\n\t\tdepthCache.set(effect, depth)\n\t\treturn depth\n\t}\n\n\tfor (const [effect, node] of nodeByEffect) {\n\t\tnode.depth = computeDepth(effect)\n\t\tconst parent = effectParent.get(effect)\n\t\tif (parent) {\n\t\t\tconst parentNode = nodeByEffect.get(parent)\n\t\t\tif (parentNode) {\n\t\t\t\tnode.parentId = parentNode.id\n\t\t\t}\n\t\t}\n\t}\n\n\treturn { nodes, nodeByEffect }\n}\n\n/**\n * Builds a graph representing current reactive state (effects, objects, and trigger edges)\n */\nexport function buildReactivityGraph(): ReactivityGraph {\n\tconst nodes: Array<EffectNode | ObjectNode> = []\n\tconst edges: GraphEdge[] = []\n\tconst nodeIds = new Map<ScopedCallback | object | SourceEffect, string>()\n\n\tconst allEffects = new Set<ScopedCallback>(debugEffectRegistry)\n\tensureParentChains(allEffects)\n\tconst { nodes: effectNodes, nodeByEffect } = buildEffectNodes(allEffects)\n\tfor (const node of effectNodes) nodes.push(node)\n\tfor (const [effect, node] of nodeByEffect) {\n\t\tnodeIds.set(effect, node.id)\n\t}\n\n\t// Object nodes (optional, used for dependency inspection)\n\tfor (const obj of debugObjectRegistry) {\n\t\tconst id = `object_${nodes.length}`\n\t\tnodes.push({ id, label: ensureObjectName(obj), type: 'state', debugName: objectNames.get(obj) })\n\t\tnodeIds.set(obj, id)\n\t}\n\n\t// External source node (user/system outside of effects)\n\tif (triggerGraph.has(EXTERNAL_SOURCE)) {\n\t\tconst externalId = `effect_external`\n\t\tnodes.push({ id: externalId, label: 'External', type: 'external', depth: 0 })\n\t\tnodeIds.set(EXTERNAL_SOURCE, externalId)\n\t}\n\n\t// Dependency edges (effect → object)\n\tfor (const effect of allEffects) {\n\t\tconst effectId = nodeIds.get(effect)\n\t\tif (!effectId) continue\n\t\tconst deps = effectToReactiveObjects.get(effect)\n\t\tif (!deps) continue\n\t\tfor (const obj of deps) {\n\t\t\tconst objId = nodeIds.get(obj)\n\t\t\tif (!objId) continue\n\t\t\tedges.push({\n\t\t\t\tid: `${effectId}->${objId}`,\n\t\t\t\tsource: effectId,\n\t\t\t\ttarget: objId,\n\t\t\t\ttype: 'dependency',\n\t\t\t\tlabel: 'depends',\n\t\t\t})\n\t\t}\n\t}\n\n\t// Cause edges (effect/object/prop → effect)\n\tfor (const [source, targetMap] of triggerGraph) {\n\t\tfor (const [targetEffect, labelMap] of targetMap) {\n\t\t\tconst targetId = nodeIds.get(targetEffect)\n\t\t\tif (!targetId) continue\n\t\t\tconst sourceId = nodeIds.get(source)\n\t\t\tif (!sourceId) continue\n\t\t\tfor (const record of labelMap.values()) {\n\t\t\t\tedges.push({\n\t\t\t\t\tid: `${sourceId}->${targetId}:${record.label}`,\n\t\t\t\t\tsource: sourceId,\n\t\t\t\t\ttarget: targetId,\n\t\t\t\t\ttype: 'cause',\n\t\t\t\t\tlabel: record.count > 1 ? `${record.label} (${record.count})` : record.label,\n\t\t\t\t\tcount: record.count,\n\t\t\t\t})\n\t\t\t}\n\t\t}\n\t}\n\n\treturn {\n\t\tnodes,\n\t\tedges,\n\t\tmeta: {\n\t\t\tgeneratedAt: Date.now(),\n\t\t\tdevtoolsEnabled,\n\t\t},\n\t}\n}\n\n/**\n * Enables the DevTools bridge and exposes the debug API on window.\n * Call as early as possible in development builds.\n */\nexport function enableDevTools() {\n\tif (typeof window === 'undefined') return\n\tif (devtoolsEnabled) return\n\tdevtoolsEnabled = true\n\n\t// @ts-expect-error - global window extension\n\twindow.__MUTTS_DEVTOOLS__ = {\n\t\tgetGraph: buildReactivityGraph,\n\t\tsetEffectName,\n\t\tsetObjectName,\n\t\tregisterEffect: registerEffectForDebug,\n\t\tregisterObject: registerObjectForDebug,\n\t}\n}\n\nexport function forceEnableGraphTracking() {\n\tdevtoolsEnabled = true\n}\n\nexport function isDevtoolsEnabled() {\n\treturn devtoolsEnabled\n}\n\n// --- Introspection API ---\n\n/**\n * Returns the raw dependency graph data structure.\n * This is useful for programmatic analysis of the reactive system.\n */\nexport function getDependencyGraph() {\n\treturn {\n\t\tnodes: buildReactivityGraph().nodes,\n\t\tedges: buildReactivityGraph().edges,\n\t}\n}\n\n/**\n * Returns a list of effects that depend on the given object.\n */\nexport function getDependents(obj: object): ScopedCallback[] {\n\tconst dependents: ScopedCallback[] = []\n\t// Scan the trigger graph for effects triggered by this object\n\t// This is O(E) where E is the number of edges, might need optimization for large graphs\n\t// but acceptable for introspection\n\tfor (const [_source, targetMap] of triggerGraph) {\n\t\tfor (const [targetEffect, labelMap] of targetMap) {\n\t\t\tfor (const record of labelMap.values()) {\n\t\t\t\tif (record.object === obj) {\n\t\t\t\t\tdependents.push(targetEffect)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t// Also check direct dependencies (dependency graph)\n\t// We don't have a direct obj -> effect map without walking all effects\n\t// unless we use `watchers` from tracking.ts but that's internal\n\treturn [...new Set(dependents)]\n}\n\n/**\n * Returns a list of objects that the given effect depends on.\n */\nexport function getDependencies(effect: ScopedCallback): object[] {\n\tconst deps = effectToReactiveObjects.get(effect)\n\treturn deps ? Array.from(deps) : []\n}\n\n// --- Mutation History ---\n\nexport interface MutationRecord {\n\tid: number\n\ttimestamp: number\n\tsource: string\n\ttarget: string\n\tobjectName: string\n\tprop: string\n\ttype: string\n}\n\nconst mutationHistory: MutationRecord[] = []\nlet mutationCounter = 0\n\nfunction addToMutationHistory(\n\tsource: ScopedCallback | undefined,\n\ttarget: ScopedCallback,\n\tobj: object,\n\tprop: any,\n\tevolution: Evolution\n) {\n\tconst record: MutationRecord = {\n\t\tid: ++mutationCounter,\n\t\ttimestamp: Date.now(),\n\t\tsource: source ? ensureEffectName(source) : 'External',\n\t\ttarget: ensureEffectName(target),\n\t\tobjectName: ensureObjectName(obj),\n\t\tprop: String(prop),\n\t\ttype: evolution.type,\n\t}\n\n\tmutationHistory.push(record)\n\tif (mutationHistory.length > options.introspection.historySize) {\n\t\tmutationHistory.shift()\n\t}\n}\n\n/**\n * Get the recent mutation history\n */\nexport function getMutationHistory(): MutationRecord[] {\n\treturn [...mutationHistory]\n}\n","import { effectParent, getRoot } from './registry'\nimport { ReactiveError, type ScopedCallback } from './types'\n\n/**\n * Effect context stack for nested tracking (front = active, next = parent)\n */\nconst stack: (ScopedCallback | undefined)[] = []\nexport const effectStack = stack\n\nexport function captureEffectStack() {\n\treturn stack.slice()\n}\nexport function isRunning(effect: ScopedCallback): (ScopedCallback | undefined)[] | false {\n\tconst rootEffect = getRoot(effect)\n\n\t// Check if the effect is directly in the stack\n\tconst rootIndex = stack.indexOf(rootEffect)\n\tif (rootIndex !== -1) {\n\t\treturn stack.slice(0, rootIndex + 1).reverse()\n\t}\n\n\t// Check if any effect in the stack is a descendant of this effect\n\t// (i.e., walk up the parent chain from each stack effect to see if we reach this effect)\n\tfor (let i = 0; i < stack.length; i++) {\n\t\tconst stackEffect = stack[i]\n\t\tlet current: ScopedCallback | undefined = stackEffect\n\t\tconst visited = new WeakSet<ScopedCallback>()\n\t\tconst ancestorChain: ScopedCallback[] = []\n\t\t// TODO: That's perhaps a lot of computations for an `assert`\n\t\t// Walk up the parent chain to find if this effect is an ancestor\n\t\twhile (current && !visited.has(current)) {\n\t\t\tvisited.add(current)\n\t\t\tconst currentRoot = getRoot(current)\n\t\t\tancestorChain.push(currentRoot)\n\t\t\tif (currentRoot === rootEffect) {\n\t\t\t\t// Found a descendant - build the full chain from ancestor to active\n\t\t\t\t// The ancestorChain contains [descendant, parent, ..., ancestor] (walking up)\n\t\t\t\t// We need [ancestor (effect), ..., parent, descendant, ...stack from descendant to active]\n\t\t\t\tconst chainFromAncestor = ancestorChain.reverse() // [ancestor, ..., descendant]\n\t\t\t\t// Prepend the actual effect we're checking (in case current is a wrapper)\n\t\t\t\tif (chainFromAncestor[0] !== rootEffect) {\n\t\t\t\t\tchainFromAncestor.unshift(rootEffect)\n\t\t\t\t}\n\t\t\t\t// Append the rest of the stack from the descendant to the active effect\n\t\t\t\tconst stackFromDescendant = stack.slice(0, i + 1).reverse() // [descendant, ..., active]\n\t\t\t\t// Remove duplicate descendant (it's both at end of chainFromAncestor and start of stackFromDescendant)\n\t\t\t\tif (chainFromAncestor.length > 0 && stackFromDescendant.length > 0) {\n\t\t\t\t\tstackFromDescendant.shift() // Remove duplicate descendant\n\t\t\t\t}\n\t\t\t\treturn [...chainFromAncestor, ...stackFromDescendant]\n\t\t\t}\n\t\t\tcurrent = effectParent.get(current)\n\t\t}\n\t}\n\n\treturn false\n}\nexport function withEffectStack<T>(snapshot: (ScopedCallback | undefined)[], fn: () => T): T {\n\tconst previousStack = stack.slice()\n\tassignStack(snapshot)\n\ttry {\n\t\treturn fn()\n\t} finally {\n\t\tassignStack(previousStack)\n\t}\n}\n\nexport function getActiveEffect() {\n\treturn stack[0]\n}\n\n/**\n * Executes a function with a specific effect context\n * @param effect - The effect to use as context\n * @param fn - The function to execute\n * @param keepParent - Whether to keep the parent effect context\n * @returns The result of the function\n */\nexport function withEffect<T>(effect: ScopedCallback | undefined, fn: () => T): T {\n\n\tif (getRoot(effect) === getRoot(getActiveEffect())) return fn()\n\tstack.unshift(effect)\n\ttry {\n\t\treturn fn()\n\t} finally {\n\t\tconst recoveredEffect = stack.shift()\n\t\tif (recoveredEffect !== effect) throw new ReactiveError('[reactive] Effect stack mismatch')\n\t}\n}\n\nfunction assignStack(values: (ScopedCallback | undefined)[]) {\n\tstack.length = 0\n\tstack.push(...values)\n}\n","export 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\tlet current = obj\n\twhile (current && typeof current === 'object' && current !== null && proxyToObject.has(current)) {\n\t\tcurrent = proxyToObject.get(current) as T\n\t}\n\treturn current\n}\n\nexport function isReactive(obj: any): boolean {\n\treturn proxyToObject.has(obj)\n}\n","import { getActiveEffect } from './effect-context'\nimport {\n\teffectToReactiveObjects,\n\tgetRoot,\n\tglobalTrackingDisabled,\n\tsetGlobalTrackingDisabled,\n\ttrackingDisabledEffects,\n\twatchers,\n} from './registry'\nimport { unwrap } from './proxy-state'\nimport { allProps, type ScopedCallback } from './types'\n\nexport function getTrackingDisabled(): boolean {\n\tconst active = getActiveEffect()\n\tif (!active) return globalTrackingDisabled\n\treturn trackingDisabledEffects.has(getRoot(active))\n}\n\nexport function setTrackingDisabled(value: boolean): void {\n\tconst active = getActiveEffect()\n\tif (!active) {\n\t\tsetGlobalTrackingDisabled(value)\n\t\treturn\n\t}\n\tconst root = getRoot(active)\n\tif (value) trackingDisabledEffects.add(root)\n\telse trackingDisabledEffects.delete(root)\n}\n\n\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\tobj = unwrap(obj)\n\tconst currentActiveEffect = getActiveEffect()\n\n\t// Early return if no active effect, tracking disabled, or invalid prop\n\tif (\n\t\t!currentActiveEffect ||\n\t\tgetTrackingDisabled() ||\n\t\t(typeof prop === 'symbol' && prop !== allProps)\n\t)\n\t\treturn\n\n\tregisterDependency(obj, prop, currentActiveEffect)\n}\n\nfunction registerDependency(obj: any, prop: any, currentActiveEffect: ScopedCallback) {\n\tlet objectWatchers = watchers.get(obj)\n\tif (!objectWatchers) {\n\t\tobjectWatchers = new Map<PropertyKey, Set<ScopedCallback>>()\n\t\twatchers.set(obj, objectWatchers)\n\t}\n\tlet deps = objectWatchers.get(prop)\n\tif (!deps) {\n\t\tdeps = new Set<ScopedCallback>()\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","/**\n * Zone-like async context preservation for reactive effects\n *\n * Automatically preserves effect context across async boundaries:\n * - Promise methods: .then(), .catch(), .finally()\n * - Timers: setTimeout(), setInterval()\n * - Animation: requestAnimationFrame() (if available) - runs in untracked context\n * - Microtasks: queueMicrotask() (if available)\n *\n * **IMPORTANT:** This module is opt-in via `reactiveOptions.asyncMode` (truthy = enabled, false = disabled).\n * By default, async zone is ENABLED with 'cancel' mode.\n *\n * When disabled (asyncMode = false), use `tracked()` manually in async callbacks.\n * When enabled (asyncMode = 'cancel' | 'queue' | 'ignore'), async entry points are wrapped ONCE.\n */\n\nimport { captureEffectStack, withEffectStack } from './effect-context'\nimport { options, type ScopedCallback } from './types'\n\nlet zoneHooked = false\n\n// Store original Promise methods at module load time (before any wrapping)\n// This ensures we always have the true originals, even if wrapping happens multiple times\nconst originalPromiseThen =\n\tObject.getOwnPropertyDescriptor(Promise.prototype, 'then')?.value || Promise.prototype.then\nconst originalPromiseCatch =\n\tObject.getOwnPropertyDescriptor(Promise.prototype, 'catch')?.value || Promise.prototype.catch\nconst originalPromiseFinally =\n\tObject.getOwnPropertyDescriptor(Promise.prototype, 'finally')?.value || Promise.prototype.finally\n\n// Store original timer functions at module load time\nconst originalSetTimeout = globalThis.setTimeout\nconst originalSetInterval = globalThis.setInterval\nconst originalRequestAnimationFrame =\n\ttypeof globalThis.requestAnimationFrame !== 'undefined'\n\t\t? globalThis.requestAnimationFrame\n\t\t: undefined\nconst originalQueueMicrotask =\n\ttypeof globalThis.queueMicrotask !== 'undefined' ? globalThis.queueMicrotask : undefined\n\n// Store batch function to avoid circular dependency\nlet batchFn: ((cb: () => any, type: 'immediate') => any) | undefined\n\n/**\n * Check the asyncMode option and hook Promise.prototype once if enabled\n * Called lazily on first effect creation\n * asyncMode being truthy enables async zone, false disables it\n *\n * @param batch - Optional batch function injection from effects.ts to avoid circular dependency\n */\nexport function ensureZoneHooked(batch?: (cb: () => any, type: 'immediate') => any) {\n\tif (batch) batchFn = batch\n\tif (zoneHooked || !options.asyncMode) return\n\thookZone()\n\tzoneHooked = true\n}\n\n/**\n * Hook Promise.prototype methods to preserve effect context\n */\nfunction hookZone() {\n\t// biome-ignore lint/suspicious/noThenProperty: Intentional wrapping for zone functionality\n\tPromise.prototype.then = function <T, R1, R2>(\n\t\tthis: Promise<T>,\n\t\tonFulfilled?: ((value: T) => R1 | PromiseLike<R1>) | null,\n\t\tonRejected?: ((reason: any) => R2 | PromiseLike<R2>) | null\n\t): Promise<R1 | R2> {\n\t\tconst capturedStack = captureEffectStack()\n\t\treturn originalPromiseThen.call(\n\t\t\tthis,\n\t\t\twrapCallback(onFulfilled, capturedStack),\n\t\t\twrapCallback(onRejected, capturedStack)\n\t\t)\n\t}\n\n\tPromise.prototype.catch = function <T>(\n\t\tthis: Promise<T>,\n\t\tonRejected?: ((reason: any) => T | PromiseLike<T>) | null\n\t): Promise<T> {\n\t\tconst capturedStack = captureEffectStack()\n\t\treturn originalPromiseCatch.call(this, wrapCallback(onRejected, capturedStack))\n\t}\n\n\tPromise.prototype.finally = function <T>(\n\t\tthis: Promise<T>,\n\t\tonFinally?: (() => void) | null\n\t): Promise<T> {\n\t\tconst capturedStack = captureEffectStack()\n\t\treturn originalPromiseFinally.call(this, wrapCallback(onFinally, capturedStack))\n\t}\n\n\t// Hook setTimeout - preserve original function properties for Node.js compatibility\n\tconst wrappedSetTimeout = (<TArgs extends any[]>(\n\t\tcallback: (...args: TArgs) => void,\n\t\tdelay?: number,\n\t\t...args: TArgs\n\t): ReturnType<typeof originalSetTimeout> => {\n\t\tconst capturedStack = options.zones.setTimeout ? captureEffectStack() : undefined\n\t\treturn originalSetTimeout.apply(globalThis, [\n\t\t\twrapCallback(callback, capturedStack) as (...args: any[]) => void,\n\t\t\tdelay,\n\t\t\t...args,\n\t\t] as any)\n\t}) as typeof originalSetTimeout\n\tObject.assign(wrappedSetTimeout, originalSetTimeout)\n\tglobalThis.setTimeout = wrappedSetTimeout\n\n\t// Hook setInterval - preserve original function properties for Node.js compatibility\n\tconst wrappedSetInterval = (<TArgs extends any[]>(\n\t\tcallback: (...args: TArgs) => void,\n\t\tdelay?: number,\n\t\t...args: TArgs\n\t): ReturnType<typeof originalSetInterval> => {\n\t\tconst capturedStack = options.zones.setInterval ? captureEffectStack() : undefined\n\t\treturn originalSetInterval.apply(globalThis, [\n\t\t\twrapCallback(callback, capturedStack) as (...args: any[]) => void,\n\t\t\tdelay,\n\t\t\t...args,\n\t\t] as any)\n\t}) as typeof originalSetInterval\n\tObject.assign(wrappedSetInterval, originalSetInterval)\n\tglobalThis.setInterval = wrappedSetInterval\n\n\t// Hook requestAnimationFrame if available\n\tif (originalRequestAnimationFrame) {\n\t\tglobalThis.requestAnimationFrame = ((\n\t\t\tcallback: FrameRequestCallback\n\t\t): ReturnType<typeof originalRequestAnimationFrame> => {\n\t\t\tconst capturedStack = options.zones.requestAnimationFrame ? captureEffectStack() : undefined\n\t\t\treturn originalRequestAnimationFrame.call(\n\t\t\t\tglobalThis,\n\t\t\t\twrapCallback(callback as any, capturedStack) as FrameRequestCallback\n\t\t\t)\n\t\t}) as typeof originalRequestAnimationFrame\n\t}\n\n\t// Hook queueMicrotask if available\n\tif (originalQueueMicrotask) {\n\t\tglobalThis.queueMicrotask = ((callback: () => void): void => {\n\t\t\tconst capturedStack = options.zones.queueMicrotask ? captureEffectStack() : undefined\n\t\t\toriginalQueueMicrotask.call(globalThis, wrapCallback(callback, capturedStack) as () => void)\n\t\t}) as typeof originalQueueMicrotask\n\t}\n}\n\n/**\n * Wraps a callback to restore effect context and ensure batching\n */\nfunction wrapCallback<T extends (...args: any[]) => any>(\n\tcallback: T | null | undefined,\n\tcapturedStack: (ScopedCallback | undefined)[] | undefined\n): T | undefined {\n\tif (!callback) return undefined\n\n\t// If no stack to restore and no batch function, direct call (optimization)\n\tif ((!capturedStack || !capturedStack.length) && !batchFn) {\n\t\treturn callback\n\t}\n\n\treturn ((...args: any[]) => {\n\t\tconst execute = () => {\n\t\t\tif (capturedStack?.length) {\n\t\t\t\treturn withEffectStack(capturedStack, () => callback(...args))\n\t\t\t}\n\t\t\treturn callback(...args)\n\t\t}\n\n\t\tif (batchFn) {\n\t\t\treturn batchFn(execute, 'immediate')\n\t\t}\n\t\treturn execute()\n\t}) as T\n}\n\n/**\n * Manually enable/disable the zone (for testing)\n */\nexport function setZoneEnabled(enabled: boolean) {\n\tif (enabled && !zoneHooked) {\n\t\thookZone()\n\t\tzoneHooked = true\n\t} else if (!enabled && zoneHooked) {\n\t\t// Restore original Promise methods\n\t\t// biome-ignore lint/suspicious/noThenProperty: Restoring original methods\n\t\tPromise.prototype.then = originalPromiseThen\n\t\tPromise.prototype.catch = originalPromiseCatch\n\t\tPromise.prototype.finally = originalPromiseFinally\n\n\t\t// Restore original timer functions\n\t\tglobalThis.setTimeout = originalSetTimeout\n\t\tglobalThis.setInterval = originalSetInterval\n\t\tif (originalRequestAnimationFrame) {\n\t\t\tglobalThis.requestAnimationFrame = originalRequestAnimationFrame\n\t\t}\n\t\tif (originalQueueMicrotask) {\n\t\t\tglobalThis.queueMicrotask = originalQueueMicrotask\n\t\t}\n\n\t\tzoneHooked = false\n\t}\n}\n\n/**\n * Check if zone is currently hooked\n */\nexport function isZoneEnabled(): boolean {\n\treturn zoneHooked\n}\n","import { decorator } from '../decorator'\nimport { IterableWeakSet } from '../iterableWeak'\nimport { getTriggerChain, isDevtoolsEnabled, registerEffectForDebug } from './debug'\nimport {\n\tcaptureEffectStack,\n\teffectStack,\n\tgetActiveEffect,\n\twithEffect,\n\twithEffectStack,\n} from './effect-context'\nimport {\n\tgetTrackingDisabled,\n\tsetTrackingDisabled,\n} from './tracking'\nimport {\n\teffectChildren,\n\teffectParent,\n\teffectToReactiveObjects,\n\tgetRoot,\n\tmarkWithRoot,\n\twatchers,\n} from './registry'\nimport {\n\ttype DependencyAccess,\n\ttype EffectOptions,\n\ttype Evolution,\n\toptions,\n\tReactiveError,\n\tReactiveErrorCode,\n\t// type AsyncExecutionMode,\n\ttype ScopedCallback,\n\tcleanup as cleanupSymbol,\n\tstopped,\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\nimport { ensureZoneHooked } from './zone'\n\ntype EffectTracking = (obj: any, evolution: Evolution, prop: any) => void\n\nexport { captureEffectStack, withEffectStack, getActiveEffect, effectStack }\nexport interface ActivationRecord {\n\teffect: ScopedCallback\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\nexport function getActivationLog() {\n\treturn activationLog\n}\n\nexport function recordActivation(\n\teffect: ScopedCallback,\n\tobj: any,\n\tevolution: Evolution,\n\tprop: any\n) {\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 as any)?.name || 'anonymous'\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: effectName,\n\t\t\t})\n\t\t}\n\t\toptions.warn(`[reactive] ${message}`)\n\t}\n}\n\n/**\n * Registers a debug callback that is called when the current effect is triggered by a dependency change\n *\n * This function is useful for debugging purposes as it pin-points exactly which reactive property\n * change triggered the effect. The callback receives information about:\n * - The object that changed\n * - The type of change (evolution)\n * - The specific property that changed\n *\n * **Note:** The tracker callback is automatically removed after being called once. If you need\n * to track multiple triggers, call `trackEffect` again within the effect.\n *\n * @param onTouch - Callback function that receives (obj, evolution, prop) when the effect is triggered\n * @throws {Error} If called outside of an effect context\n *\n * @example\n * ```typescript\n * const state = reactive({ count: 0, name: 'John' })\n *\n * effect(() => {\n *   // Register a tracker to see what triggers this effect\n *   trackEffect((obj, evolution, prop) => {\n *     console.log(`Effect triggered by:`, {\n *       object: obj,\n *       change: evolution.type,\n *       property: prop\n *     })\n *   })\n *\n *   // Access reactive properties\n *   console.log(state.count, state.name)\n * })\n *\n * state.count = 5\n * // Logs: Effect triggered by: { object: state, change: 'set', property: 'count' }\n * ```\n */\nexport function trackEffect(onTouch: EffectTracking) {\n\tconst activeEffect = getActiveEffect()\n\tif (!activeEffect) throw new Error('Not in an effect')\n\tif (!effectTrackers.has(activeEffect)) effectTrackers.set(activeEffect, new Set([onTouch]))\n\telse effectTrackers.get(activeEffect)!.add(onTouch)\n}\n\nconst effectTrackers = new WeakMap<ScopedCallback, Set<EffectTracking>>()\n\nexport const opaqueEffects = new WeakSet<ScopedCallback>()\n\n// Dependency graph: tracks which effects trigger which other effects\n// Uses roots (Function) as keys for consistency\nconst effectTriggers = new WeakMap<Function, IterableWeakSet<Function>>()\nconst 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)\nconst causesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\nconst consequencesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\n\n// Debug: Capture where an effect was created\nexport const effectCreationStacks = new WeakMap<Function, string>()\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\t// Skip if edge already exists\n\tconst triggers = effectTriggers.get(callerRoot)\n\tif (triggers?.has(targetRoot)) {\n\t\treturn // Edge already exists\n\t}\n\n\t// Add to forward graph: callerRoot → targetRoot\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 && vConsequencesSet) {\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 * @todo Can be REALLY costly - optimise or make optional or ...\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: ScopedCallback) {\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, ScopedCallback> // 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}\n\n// Track currently executing effects to prevent re-execution\n// These are all the effects triggered under `activeEffect`\nlet batchQueue: BatchQueue | undefined\nexport function hasBatched(effect: ScopedCallback) {\n\treturn batchQueue?.all.has(getRoot(effect))\n}\nconst batchCleanups = new Set<ScopedCallback>()\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\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 * Computes the in-degree (number of dependencies) for an effect in the current batch\n * Uses causesClosure to count all effects (directly or indirectly) that trigger this effect\n * @param root - Root function of the effect\n * @param batchEffects - Map of all effects in current batch (todos - effects that still need execution)\n * @returns Number of effects in batch that trigger this effect (directly or indirectly)\n *\n * TODO: Optimization - For large graphs with small batches, iterating over all causes in the closure\n * can be expensive. Consider maintaining a separate \"batch causes\" set or caching in-degrees.\n */\n/* function computeInDegreeInBatch(\n\troot: Function,\n\tbatchEffects: Map<Function, ScopedCallback>\n): number {\n\tlet inDegree = 0\n\tconst activeEffect = getActiveEffect()\n\tconst activeRoot = activeEffect ? getRoot(activeEffect) : null\n\n\t// Count effects in batch that trigger this effect (directly or indirectly)\n\t// Using causesClosure which contains all transitive causes\n\t// Note: batchEffects only contains effects that still need execution (todos),\n\t// so we don't need to check if causes have been executed - they're not in the map if executed\n\tconst causes = causesClosure.get(root)\n\tif (causes) {\n\t\tfor (const causeRoot of causes) {\n\t\t\t// Only count if it's in the batch (still needs execution)\n\t\t\t// BUT: don't count the currently executing effect (active effect)\n\t\t\t// This handles the case where an effect is triggered during another effect's execution\n\t\t\t// Note: Self-loops are ignored - they should not appear in closures, but we check to be safe\n\t\t\tif (batchEffects.has(causeRoot) && causeRoot !== activeRoot && causeRoot !== root) {\n\t\t\t\tinDegree++\n\t\t\t}\n\t\t}\n\t}\n\n\treturn inDegree\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 * @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(effect: ScopedCallback, caller?: ScopedCallback, immediate?: boolean) {\n\tconst cleanupFn = (effect as any)[cleanupSymbol]\n\tif (cleanupFn) cleanupFn()\n\t// If the effect was stopped during cleanup (e.g. lazy memoization), don't add it to the batch\n\tif ((effect as any)[stopped]) return\n\n\tif (!batchQueue) return\n\n\tconst root = getRoot(effect)\n\n\t// 1. Add to batch first (needed for cycle detection)\n\tbatchQueue.all.set(root, effect)\n\n\t// 2. Add to global graph (if caller exists and not immediate) - USE ROOTS ONLY\n\t// When immediate is true, don't create edges - the effect is not considered as a consequence\n\tif (caller && !immediate) {\n\t\tconst callerRoot = getRoot(caller)\n\n\t\t// Check for cycle BEFORE adding edge\n\t\t// We check if adding callerRoot -> root would create a cycle\n\t\t// This means checking if root already triggers callerRoot (directly or transitively)\n\t\tif (wouldCreateCycle(callerRoot, root)) {\n\t\t\t// Cycle detected! Get the full cycle path for debugging\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\tconst cycleHandling = options.cycleHandling\n\n\t\t\t// In strict mode, we throw immediately on detection\n\t\t\tif (cycleHandling === 'strict') {\n\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\tconst causalChain = getTriggerChain(effect)\n\t\t\t\tconst creationStack = effectCreationStacks.get(root)\n\n\t\t\t\tthrow new ReactiveError(`[reactive] Strict Cycle Prevention: ${cycleMessage}`, {\n\t\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\t\tcycle: cyclePath.map((r) => r.name || r.toString()),\n\t\t\t\t\tdetails: cycleMessage,\n\t\t\t\t\tcausalChain,\n\t\t\t\t\tcreationStack,\n\t\t\t\t})\n\t\t\t}\n\n\t\t\tswitch (cycleHandling) {\n\t\t\t\tcase 'throw': {\n\t\t\t\t\t// Remove from batch before throwing\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t\tconst causalChain = getTriggerChain(effect)\n\t\t\t\t\tconst creationStack = effectCreationStacks.get(root)\n\n\t\t\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`, {\n\t\t\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\t\t\tcycle: cyclePath.map((r) => r.name || r.toString()),\n\t\t\t\t\t\tdetails: cycleMessage,\n\t\t\t\t\t\tcausalChain,\n\t\t\t\t\t\tcreationStack,\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t\tcase 'warn':\n\t\t\t\t\toptions.warn(`[reactive] ${cycleMessage}`)\n\t\t\t\t\t// Don't add the edge, break the cycle\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t\treturn\n\t\t\t\tcase 'break':\n\t\t\t\t\t// Silently break cycle, don't add the edge\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t\treturn\n\t\t\t}\n\t\t}\n\n\t\taddGraphEdge(callerRoot, root) // Add to persistent graph using roots\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: ScopedCallback) {\n\tif (!batchQueue) cleanup()\n\telse batchCleanups.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 batchQueue - The batch queue\n * @returns Array of effect roots forming a cycle\n */\nfunction getCyclePath(batchQueue: 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 batchQueue.all) {\n\t\tif (visited.has(root)) continue\n\t\tconst cycle = findCycle(root, visited, recursionStack, path, batchQueue)\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\tbatchQueue: 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 (batchQueue.all.has(targetRoot)) {\n\t\t\t\tconst cycle = findCycle(targetRoot, visited, recursionStack, path, batchQueue)\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\t// Find an effect with in-degree 0 using cached values\n\tlet nextEffect: ScopedCallback | null = null\n\tlet nextRoot: Function | null = null\n\n\t// Find an effect with in-degree 0 (no dependencies in batch that still need execution)\n\t// Using cached in-degrees for O(n) lookup instead of O(n²)\n\tfor (const [root, effect] of batchQueue!.all) {\n\t\tconst inDegree = batchQueue!.inDegrees.get(root) ?? 0\n\t\tif (inDegree === 0) {\n\t\t\tnextEffect = effect\n\t\t\tnextRoot = root\n\t\t\tbreak\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 (batchQueue!.all.size > 0) {\n\t\t\tlet cycle = getCyclePath(batchQueue!)\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 batchQueue!.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 (batchQueue!.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\tconst cycleHandling = options.cycleHandling\n\t\t\tswitch (cycleHandling) {\n\t\t\t\tcase 'throw':\n\t\t\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`)\n\t\t\t\tcase 'warn': {\n\t\t\t\t\toptions.warn(`[reactive] ${cycleMessage}`)\n\t\t\t\t\t// Break the cycle by executing one effect anyway\n\t\t\t\t\tconst firstEffect = batchQueue!.all.values().next().value\n\t\t\t\t\tif (firstEffect) {\n\t\t\t\t\t\tconst firstRoot = getRoot(firstEffect)\n\t\t\t\t\t\tbatchQueue!.all.delete(firstRoot)\n\t\t\t\t\t\tbatchQueue!.inDegrees.delete(firstRoot)\n\t\t\t\t\t\treturn firstEffect()\n\t\t\t\t\t}\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tcase 'break': {\n\t\t\t\t\t// Silently break cycle\n\t\t\t\t\tconst firstEffect2 = batchQueue!.all.values().next().value\n\t\t\t\t\tif (firstEffect2) {\n\t\t\t\t\t\tconst firstRoot2 = getRoot(firstEffect2)\n\t\t\t\t\t\tbatchQueue!.all.delete(firstRoot2)\n\t\t\t\t\t\tbatchQueue!.inDegrees.delete(firstRoot2)\n\t\t\t\t\t\treturn firstEffect2()\n\t\t\t\t\t}\n\t\t\t\t\tbreak\n\t\t\t\t}\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\tconst result = nextEffect()\n\n\t// Remove from batch and update in-degrees of dependents\n\tbatchQueue!.all.delete(nextRoot!)\n\tbatchQueue!.inDegrees.delete(nextRoot!)\n\tdecrementInDegreesForExecuted(batchQueue!, nextRoot!)\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: ScopedCallback | ScopedCallback[], immediate?: 'immediate') {\n\tif (!Array.isArray(effect)) effect = [effect]\n\tconst roots = effect.map(getRoot)\n\n\tif (batchQueue) {\n\t\t// Nested batch - add to existing\n\t\toptions?.chain(roots, getRoot(getActiveEffect()))\n\t\tconst caller = getActiveEffect()\n\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\taddToBatch(effect[i], caller, immediate === 'immediate')\n\t\t}\n\t\tif (immediate) {\n\t\t\tconst firstReturn: { value?: any } = {}\n\t\t\t// Execute immediately (before batch returns)\n\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\ttry {\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\tconst root = getRoot(effect[i])\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn firstReturn.value\n\t\t}\n\t\t// Otherwise, effects will be picked up in next executeNext() call\n\t} else {\n\t\t// New batch - initialize\n\t\tif (!activationRegistry) activationRegistry = new Map()\n\t\telse throw new Error('Batch already in progress')\n\t\toptions.beginChain(roots)\n\t\tbatchQueue = {\n\t\t\tall: new Map(),\n\t\t\tinDegrees: new Map(),\n\t\t}\n\n\t\t// Add initial effects\n\t\tconst caller = getActiveEffect()\n\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\taddToBatch(effect[i], caller, immediate === 'immediate')\n\t\t}\n\n\t\tconst effectuatedRoots: ScopedCallback[] = []\n\t\tcomputeAllInDegrees(batchQueue)\n\t\tif (immediate) {\n\t\t\t// Execute immediately (before batch returns)\n\t\t\tconst firstReturn: { value?: any } = {}\n\t\t\ttry {\n\t\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tconst rv = effect[i]()\n\t\t\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\t\t} finally {\n\t\t\t\t\t\tconst root = getRoot(effect[i])\n\t\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// After immediate execution, execute any effects that were triggered during execution\n\t\t\t\t// This is important for @atomic decorator - effects triggered inside should still run\n\t\t\t\twhile (batchQueue.all.size > 0) {\n\t\t\t\t\tif (effectuatedRoots.length > options.maxEffectChain) {\n\t\t\t\t\t\tconst cycle = findCycleInChain(effectuatedRoots as any)\n\t\t\t\t\t\tconst trace = formatRoots(effectuatedRoots as any)\n\t\t\t\t\t\tconst message = cycle\n\t\t\t\t\t\t\t? `Max effect chain reached (cycle detected: ${formatRoots(cycle)})`\n\t\t\t\t\t\t\t: `Max effect chain reached (trace: ${trace})`\n\n\t\t\t\t\t\tconst queuedRoots = batchQueue ? Array.from(batchQueue.all.keys()) : []\n\t\t\t\t\t\tconst queued = queuedRoots.map((r) => r.name || '<anonymous>')\n\t\t\t\t\t\tconst debugInfo = {\n\t\t\t\t\t\t\tcode: ReactiveErrorCode.MaxDepthExceeded,\n\t\t\t\t\t\t\teffectuatedRoots,\n\t\t\t\t\t\t\tcycle,\n\t\t\t\t\t\t\ttrace,\n\t\t\t\t\t\t\tmaxEffectChain: options.maxEffectChain,\n\t\t\t\t\t\t\tqueued: queued.slice(0, 50),\n\t\t\t\t\t\t\tqueuedCount: queued.length,\n\t\t\t\t\t\t\t// Try to get causation for the last effect\n\t\t\t\t\t\t\tcausalChain:\n\t\t\t\t\t\t\t\teffectuatedRoots.length > 0\n\t\t\t\t\t\t\t\t\t? getTriggerChain(\n\t\t\t\t\t\t\t\t\t\t\tbatchQueue.all.get(effectuatedRoots[effectuatedRoots.length - 1])!\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}\n\t\t\t\t\t\tswitch (options.maxEffectReaction) {\n\t\t\t\t\t\t\tcase 'throw':\n\t\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\t\tcase 'debug':\n\t\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\t\tdebugger\n\t\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\t\tcase 'warn':\n\t\t\t\t\t\t\t\toptions.warn(\n\t\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\t)\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (!batchQueue || batchQueue.all.size === 0) break\n\t\t\t\t\tconst rv = executeNext(effectuatedRoots)\n\t\t\t\t\t// If executeNext() returned null but batch is not empty, it means a cycle was detected\n\t\t\t\t\t// and an error was thrown, so we won't reach here\n\t\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\t}\n\t\t\t\tconst cleanups = Array.from(batchCleanups)\n\t\t\t\tbatchCleanups.clear()\n\t\t\t\tfor (const cleanup of cleanups) cleanup()\n\t\t\t\treturn firstReturn.value\n\t\t\t} finally {\n\t\t\t\tactivationRegistry = undefined\n\t\t\t\tbatchQueue = undefined\n\t\t\t\toptions.endChain()\n\t\t\t}\n\t\t} else {\n\t\t\t// Execute in dependency order\n\t\t\tconst firstReturn: { value?: any } = {}\n\t\t\ttry {\n\t\t\t\t// Outer loop: continue while there are effects OR cleanups pending.\n\t\t\t\t// This ensures effects triggered by cleanups are not lost.\n\t\t\t\twhile (batchQueue.all.size > 0 || batchCleanups.size > 0) {\n\t\t\t\t\t// Inner loop: execute all pending effects\n\t\t\t\t\twhile (batchQueue.all.size > 0) {\n\t\t\t\t\t\tif (effectuatedRoots.length > options.maxEffectChain) {\n\t\t\t\t\t\t\tconst cycle = findCycleInChain(effectuatedRoots as any)\n\t\t\t\t\t\t\tconst trace = formatRoots(effectuatedRoots as any)\n\t\t\t\t\t\t\tconst message = cycle\n\t\t\t\t\t\t\t\t? `Max effect chain reached (cycle detected: ${formatRoots(cycle)})`\n\t\t\t\t\t\t\t\t: `Max effect chain reached (trace: ${trace})`\n\n\t\t\t\t\t\t\tconst queuedRoots = batchQueue ? Array.from(batchQueue.all.keys()) : []\n\t\t\t\t\t\t\tconst queued = queuedRoots.map((r) => r.name || '<anonymous>')\n\t\t\t\t\t\t\tconst debugInfo = {\n\t\t\t\t\t\t\t\tcode: ReactiveErrorCode.MaxDepthExceeded,\n\t\t\t\t\t\t\t\teffectuatedRoots,\n\t\t\t\t\t\t\t\tcycle,\n\t\t\t\t\t\t\t\ttrace,\n\t\t\t\t\t\t\t\tmaxEffectChain: options.maxEffectChain,\n\t\t\t\t\t\t\t\tqueued: queued.slice(0, 50),\n\t\t\t\t\t\t\t\tqueuedCount: queued.length,\n\t\t\t\t\t\t\t\t// Try to get causation for the last effect\n\t\t\t\t\t\t\t\tcausalChain:\n\t\t\t\t\t\t\t\t\teffectuatedRoots.length > 0\n\t\t\t\t\t\t\t\t\t\t? getTriggerChain(\n\t\t\t\t\t\t\t\t\t\t\t\tbatchQueue.all.get(effectuatedRoots[effectuatedRoots.length - 1])!\n\t\t\t\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t\t\t: [],\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tswitch (options.maxEffectReaction) {\n\t\t\t\t\t\t\t\tcase 'throw':\n\t\t\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\t\t\tcase 'debug':\n\t\t\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\t\t\tdebugger\n\t\t\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\t\t\tcase 'warn':\n\t\t\t\t\t\t\t\t\toptions.warn(\n\t\t\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\t\t)\n\t\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tconst rv = executeNext(effectuatedRoots)\n\t\t\t\t\t\t// executeNext() returns null when batch is complete or cycle detected (throws error)\n\t\t\t\t\t\t// But functions can legitimately return null, so we check batchQueue.all.size instead\n\t\t\t\t\t\tif (batchQueue.all.size === 0) {\n\t\t\t\t\t\t\t// Batch complete\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// If executeNext() returned null but batch is not empty, it means a cycle was detected\n\t\t\t\t\t\t// and an error was thrown, so we won't reach here\n\t\t\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\t\t\t// Note: executeNext() already removed it from batchQueue, so we track by count\n\t\t\t\t\t}\n\t\t\t\t\t// Process cleanups. If they trigger new effects, the outer loop will catch them.\n\t\t\t\t\tif (batchCleanups.size > 0) {\n\t\t\t\t\t\tconst cleanups = Array.from(batchCleanups)\n\t\t\t\t\t\tbatchCleanups.clear()\n\t\t\t\t\t\tfor (const cleanup of cleanups) cleanup()\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn firstReturn.value\n\t\t\t} finally {\n\t\t\t\tactivationRegistry = undefined\n\t\t\t\tbatchQueue = undefined\n\t\t\t\toptions.endChain()\n\t\t\t}\n\t\t}\n\t}\n}\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, '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, 'immediate')\n\t\t}\n\t},\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 * 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 function effect(\n\t//biome-ignore lint/suspicious/noConfusingVoidType: We have to\n\tfn: (access: DependencyAccess) => ScopedCallback | undefined | void | Promise<any>,\n\teffectOptions?: EffectOptions\n): ScopedCallback {\n\t// Ensure zone is hooked if asyncZone option is enabled (lazy initialization)\n\t// Inject batch function to allow atomic game loops in requestAnimationFrame\n\tensureZoneHooked(batch)\n\n\t// Use per-effect asyncMode or fall back to global option\n\tconst asyncMode = effectOptions?.asyncMode ?? options.asyncMode ?? 'cancel'\n\tif (options.introspection.enableHistory) {\n\t\tconst stack = new Error().stack\n\t\tif (stack) {\n\t\t\t// Clean up the stack trace to remove internal frames\n\t\t\tconst cleanStack = stack.split('\\n').slice(2).join('\\n')\n\t\t\teffectCreationStacks.set(getRoot(fn), cleanStack)\n\t\t}\n\t}\n\tlet cleanup: (() => void) | null = null\n\t// capture the parent effect at creation time for ascend\n\tconst parentsForAscend = captureEffectStack()\n\tconst tracked = <T>(cb: () => T) => withEffect(runEffect, cb)\n\tconst ascend = <T>(cb: () => T) => withEffectStack(parentsForAscend, cb)\n\tlet effectStopped = false\n\tlet hasReacted = false\n\tlet runningPromise: Promise<any> | null = null\n\tlet cancelPrevious: (() => void) | null = null\n\n\tfunction runEffect() {\n\t\t// Clear previous dependencies\n\t\tif (cleanup) {\n\t\t\tconst prevCleanup = cleanup\n\t\t\tcleanup = null\n\t\t\twithEffect(undefined, () => prevCleanup())\n\t\t}\n\n\t\t// Handle async modes when effect is retriggered\n\t\tif (runningPromise) {\n\t\t\tif (asyncMode === 'cancel' && cancelPrevious) {\n\t\t\t\t// Cancel previous execution\n\t\t\t\tcancelPrevious()\n\t\t\t\tcancelPrevious = null\n\t\t\t\trunningPromise = null\n\t\t\t} else if (asyncMode === 'ignore') {\n\t\t\t\t// Ignore new execution while async work is running\n\t\t\t\treturn\n\t\t\t}\n\t\t\t// Note: 'queue' mode not yet implemented\n\t\t}\n\n\t\t// The effect has been stopped after having been planned\n\t\tif (effectStopped) return\n\n\t\toptions.enter(getRoot(fn))\n\t\tlet reactionCleanup: ScopedCallback | undefined\n\t\tlet result: any\n\t\ttry {\n\t\t\tresult = withEffect(runEffect, () => fn({ tracked, ascend, reaction: hasReacted }))\n\t\t\tif (\n\t\t\t\tresult &&\n\t\t\t\ttypeof result !== 'function' &&\n\t\t\t\t(typeof result !== 'object' || !('then' in result))\n\t\t\t)\n\t\t\t\tthrow new ReactiveError(`[reactive] Effect returned a non-function value: ${result}`)\n\t\t\t// Check if result is a Promise (async effect)\n\t\t\tif (result && typeof result === 'object' && typeof result.then === 'function') {\n\t\t\t\tconst originalPromise = result as Promise<any>\n\n\t\t\t\t// Create a cancellation promise that we can reject\n\t\t\t\tlet cancelReject: ((reason: any) => void) | null = null\n\t\t\t\tconst cancelPromise = new Promise<never>((_, reject) => {\n\t\t\t\t\tcancelReject = reject\n\t\t\t\t})\n\n\t\t\t\tconst cancelError = new ReactiveError('[reactive] Effect canceled due to dependency change')\n\n\t\t\t\t// Race between the actual promise and cancellation\n\t\t\t\t// If canceled, the race rejects, which will propagate through any promise chain\n\t\t\t\trunningPromise = Promise.race([originalPromise, cancelPromise])\n\n\t\t\t\t// Store the cancellation function\n\t\t\t\tcancelPrevious = () => {\n\t\t\t\t\tif (cancelReject) {\n\t\t\t\t\t\tcancelReject(cancelError)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Wrap the original promise chain so cancellation propagates\n\t\t\t\t// This ensures that when we cancel, the original promise's .catch() handlers are triggered\n\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// through the zone-wrapped .then()/.catch() handlers\n\t\t\t} else {\n\t\t\t\t// Synchronous result - treat as cleanup function\n\t\t\t\treactionCleanup = result as undefined | ScopedCallback\n\t\t\t}\n\t\t} finally {\n\t\t\thasReacted = true\n\t\t\toptions.leave(fn)\n\t\t}\n\n\t\t// Create cleanup function for next run\n\t\tcleanup = () => {\n\t\t\tcleanup = null\n\t\t\treactionCleanup?.()\n\t\t\t// Remove this effect from all reactive objects it's watching\n\t\t\tconst effectObjects = effectToReactiveObjects.get(runEffect)\n\t\t\tif (effectObjects) {\n\t\t\t\tfor (const reactiveObj of effectObjects) {\n\t\t\t\t\tconst objectWatchers = watchers.get(reactiveObj)\n\t\t\t\t\tif (objectWatchers) {\n\t\t\t\t\t\tfor (const [prop, deps] of objectWatchers.entries()) {\n\t\t\t\t\t\t\tdeps.delete(runEffect)\n\t\t\t\t\t\t\tif (deps.size === 0) {\n\t\t\t\t\t\t\t\tobjectWatchers.delete(prop)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectWatchers.size === 0) {\n\t\t\t\t\t\t\twatchers.delete(reactiveObj)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\teffectToReactiveObjects.delete(runEffect)\n\t\t\t}\n\t\t\t// Invoke all child stops (recursive via subEffectCleanup calling its own mainCleanup)\n\t\t\tconst children = effectChildren.get(runEffect)\n\t\t\tif (children) {\n\t\t\t\tfor (const childCleanup of children) childCleanup()\n\t\t\t\teffectChildren.delete(runEffect)\n\t\t\t}\n\t\t}\n\t}\n\t// Mark the runEffect callback with the original function as its root\n\tmarkWithRoot(runEffect, fn)\n\n\t// Register strict mode if enabled\n\tif (effectOptions?.opaque) {\n\t\topaqueEffects.add(runEffect)\n\t}\n\n\tif (isDevtoolsEnabled()) {\n\t\tregisterEffectForDebug(runEffect)\n\t}\n\n\tbatch(runEffect, 'immediate')\n\n\tconst parent = parentsForAscend[0]\n\t// Store parent relationship for hierarchy traversal\n\teffectParent.set(runEffect, parent)\n\t// Only ROOT effects are registered for GC cleanup and zone tracking\n\tconst isRootEffect = !parent\n\n\tconst stopEffect = (): void => {\n\t\tif (effectStopped) return\n\t\teffectStopped = true\n\t\t// Cancel any running async work\n\t\tif (cancelPrevious) {\n\t\t\tcancelPrevious()\n\t\t\tcancelPrevious = null\n\t\t\trunningPromise = null\n\t\t}\n\t\tcleanup?.()\n\t\t// Clean up dependency graph edges\n\t\tcleanupEffectFromGraph(runEffect)\n\t\tfr.unregister(stopEffect)\n\t}\n\tfunction augmentedRv(rv: ScopedCallback): ScopedCallback {\n\t\tObject.defineProperty(rv, stopped, {\n\t\t\tget() {\n\t\t\t\treturn effectStopped\n\t\t\t},\n\t\t})\n\t\tObject.defineProperty(rv, cleanupSymbol, {\n\t\t\tvalue: () => {\n\t\t\t\tif (cleanup) {\n\t\t\t\t\tconst prevCleanup = cleanup\n\t\t\t\t\tcleanup = null\n\t\t\t\t\twithEffect(undefined, () => prevCleanup())\n\t\t\t\t}\n\t\t\t},\n\t\t})\n\t\treturn rv\n\t}\n\tif (isRootEffect) {\n\t\tconst callIfCollected = augmentedRv(() => stopEffect())\n\t\tfr.register(\n\t\t\tcallIfCollected,\n\t\t\t() => {\n\t\t\t\tstopEffect()\n\t\t\t\toptions.garbageCollected(fn)\n\t\t\t},\n\t\t\tstopEffect\n\t\t)\n\t\treturn callIfCollected\n\t}\n\t// Register this effect to be stopped when the parent effect is cleaned up\n\tlet children = effectChildren.get(parent)\n\tif (!children) {\n\t\tchildren = new Set()\n\t\teffectChildren.set(parent, children)\n\t}\n\tconst subEffectCleanup = augmentedRv(() => {\n\t\tchildren.delete(subEffectCleanup)\n\t\tif (children.size === 0) {\n\t\t\teffectChildren.delete(parent)\n\t\t}\n\t\t// Execute this child effect cleanup (which triggers its own mainCleanup)\n\t\tstopEffect()\n\t})\n\tchildren.add(subEffectCleanup)\n\n\treturn subEffectCleanup\n}\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\t// Store current tracking state and temporarily disable it\n\t// This prevents the parent effect from tracking dependencies during fn execution\n\tconst wasTrackingDisabled = getTrackingDisabled()\n\tsetTrackingDisabled(true)\n\n\ttry {\n\t\treturn fn()\n\t} finally {\n\t\t// Restore tracking state\n\t\tsetTrackingDisabled(wasTrackingDisabled)\n\t}\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\tlet rv!: T\n\twithEffect(undefined, () => {\n\t\trv = fn()\n\t})\n\treturn rv\n}\n\nexport { effectTrackers }\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\tconst root = getRoot(received)\n\teffect(\n\t\tmarkWithRoot(() => {\n\t\t\treceived(get())\n\t\t}, root)\n\t)\n\treturn atomic((value: T) => {\n\t\tset!(value)\n\t\tif (batchQueue?.all.has(root)) {\n\t\t\t// Remove the effect from the batch queue so it doesn't execute\n\t\t\t// This prevents circular updates in bidirectional bindings\n\t\t\tbatchQueue.all.delete(root)\n\t\t}\n\t})\n}\n","import { batch } from './effects'\nimport type { Evolution, ScopedCallback } 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>()\n\n// Track deep watchers per object\nexport const deepWatchers = new WeakMap<object, Set<ScopedCallback>>()\n\n// Track which effects are doing deep watching\nexport const effectToDeepWatchedObjects = new WeakMap<ScopedCallback, 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: 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) for (const watcher of parentDeepWatchers) batch(watcher)\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 { recordTriggerLink } from './debug'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { getActiveEffect, isRunning } from './effect-context'\nimport { batch, effectTrackers, hasBatched, opaqueEffects, recordActivation } from './effects'\nimport { unwrap } from './proxy-state'\nimport { watchers } from './registry'\nimport { allProps, type Evolution, options, type ScopedCallback, type State } 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: Set<ScopedCallback>,\n\tobjectWatchers: Map<any, Set<ScopedCallback>>,\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\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\toptions.skipRunningEffect(effect, runningChain as any)\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.add(effect)\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\tconst trackers = effectTrackers.get(effect)\n\t\t\t\t\trecordTriggerLink(sourceEffect, effect, obj, key, evolution)\n\t\t\t\t\tif (trackers) {\n\t\t\t\t\t\tfor (const tracker of trackers) tracker(obj, evolution, key)\n\t\t\t\t\t\ttrackers.delete(effect)\n\t\t\t\t\t}\n\t\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 Set<ScopedCallback>()\n\t\tif (props) collectEffects(obj, evolution, effects, objectWatchers, [allProps], props)\n\t\telse collectEffects(obj, evolution, effects, objectWatchers, objectWatchers.keys())\n\t\toptions.touched(obj, evolution, props as any[] | undefined, effects)\n\t\tbatch(Array.from(effects))\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<ScopedCallback>()\n\tconst sourceEffect = getActiveEffect()\n\n\tfor (const effect of deps) {\n\t\tif (!opaqueEffects.has(effect)) continue\n\n\t\tconst runningChain = isRunning(effect)\n\t\tif (runningChain) {\n\t\t\toptions.skipRunningEffect(effect, runningChain as any)\n\t\t\tcontinue\n\t\t}\n\t\teffects.add(effect)\n\t\trecordActivation(effect, obj, evolution, prop)\n\t\tconst trackers = effectTrackers.get(effect)\n\t\trecordTriggerLink(sourceEffect, effect, obj, prop, evolution)\n\t\tif (trackers) {\n\t\t\tfor (const tracker of trackers) tracker(obj, evolution, prop)\n\t\t\ttrackers.delete(effect)\n\t\t}\n\t}\n\n\tif (effects.size > 0) {\n\t\toptions.touched(obj, evolution, [prop], effects)\n\t\tbatch(Array.from(effects))\n\t}\n}\n","import { nativeReactive, nonReactiveMark } from './types'\n\nexport const nonReactiveObjects = new WeakSet<object>()\nexport const immutables = new Set<(tested: any) => boolean>()\nexport const absent = Symbol('absent')\n\nfunction markNonReactive<T extends object[]>(...obj: T): T[0] {\n\tfor (const o of obj) {\n\t\ttry {\n\t\t\tObject.defineProperty(o, nonReactiveMark, {\n\t\t\t\tvalue: true,\n\t\t\t\twritable: false,\n\t\t\t\tenumerable: false,\n\t\t\t\tconfigurable: false,\n\t\t\t})\n\t\t} catch {}\n\t\tif (!(nonReactiveMark in (o as object))) nonReactiveObjects.add(o as object)\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)[nonReactiveMark] = true\n\treturn cls[0]\n}\n\nexport function isNonReactive(obj: any): boolean {\n\tif (obj === null || typeof obj !== 'object') return true\n\tif (nonReactiveObjects.has(obj)) return true\n\tif ((obj as any)[nonReactiveMark]) return true\n\tfor (const fn of immutables) if (fn(obj)) return true\n\treturn false\n}\n\nexport function registerNativeReactivity(\n\toriginalClass: new (...args: any[]) => any,\n\treactiveClass: new (...args: any[]) => any\n) {\n\toriginalClass.prototype[nativeReactive] = reactiveClass\n\tnonReactiveClass(reactiveClass)\n}\n\nnonReactiveClass(Date, RegExp, Error, Promise, Function)\nif (typeof window !== 'undefined') {\n\tmarkNonReactive(window, document)\n\tnonReactiveClass(Node, Element, HTMLElement, EventTarget)\n}\n\nexport { markNonReactive as nonReactive }\n","import { addState, collectEffects, touched1, touchedOpaque } from './change'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { batch } from './effects'\nimport { isNonReactive } from './non-reactive-state'\nimport { unwrap } from './proxy-state'\nimport { effectParent, watchers } from './registry'\nimport { allProps, type Evolution, options, type ScopedCallback } from './types'\n\nfunction isObject(value: any): value is object {\n\treturn typeof value === 'object' && value !== null\n}\n\nfunction isObjectLike(value: unknown): value is object {\n\treturn isObject(value)\n}\n\nfunction getPrototypeToken(value: any): object | null | undefined {\n\tif (!isObjectLike(value)) return undefined\n\tif (Array.isArray(value)) return Array.prototype\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 (!isObjectLike(oldValue) || !isObjectLike(newValue)) return false\n\tif (isNonReactive(oldValue) || isNonReactive(newValue)) return false\n\treturn getPrototypeToken(oldValue) === getPrototypeToken(newValue)\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\t\tdispatchNotifications(recursiveTouch(oldValue, newValue, new WeakMap(), [], origin))\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 (!isObjectLike(oldValue) || !isObjectLike(newValue)) return 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\n\tfor (const key of newKeys) {\n\t\tif (!oldKeys.has(key)) continue\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(effect: ScopedCallback, allowedSet: Set<ScopedCallback>): boolean {\n\tlet current: ScopedCallback | undefined = effect\n\tconst visited = new WeakSet<ScopedCallback>()\n\twhile (current && !visited.has(current)) {\n\t\tvisited.add(current)\n\t\tif (allowedSet.has(current)) return true\n\t\tcurrent = effectParent.get(current)\n\t}\n\treturn false\n}\n\nexport function dispatchNotifications(notifications: PendingNotification[]) {\n\tif (!notifications.length) return\n\tconst combinedEffects = new Set<ScopedCallback>()\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<ScopedCallback> | 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<ScopedCallback>()\n\t\tconst originWatchers = watchers.get(origin.obj)\n\t\tif (originWatchers) {\n\t\t\tconst originEffects = new Set<ScopedCallback>()\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\tfor (const effect of originEffects) allowedEffects.add(effect)\n\t\t}\n\t\t// If no allowed effects, skip all notifications (no one should be notified)\n\t\tif (allowedEffects.size === 0) return\n\t}\n\n\tfor (const { target, evolution, prop } of notifications) {\n\t\tif (!isObjectLike(target)) continue\n\t\tconst obj = unwrap(target)\n\t\taddState(obj, evolution)\n\t\tconst objectWatchers = watchers.get(obj)\n\t\tlet currentEffects: Set<ScopedCallback> | undefined\n\t\tconst propsArray = [prop]\n\t\tif (objectWatchers) {\n\t\t\tcurrentEffects = new Set<ScopedCallback>()\n\t\t\tcollectEffects(obj, evolution, currentEffects, objectWatchers, [allProps], 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 Set<ScopedCallback>()\n\t\t\t\tfor (const effect 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.add(effect)\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) combinedEffects.add(effect)\n\t\t}\n\t\toptions.touched(obj, evolution, propsArray, currentEffects)\n\t\tif (objectsWithDeepWatchers.has(obj)) bubbleUpChange(obj, evolution)\n\t}\n\tif (combinedEffects.size) batch([...combinedEffects])\n}\n","import { decorator } from '../decorator'\nimport { mixin } from '../mixins'\nimport { isOwnAccessor, ReflectGet, ReflectSet } 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 { withEffect } from './effect-context'\nimport { absent, isNonReactive } from './non-reactive-state'\nimport {\n\tgetExistingProxy,\n\tproxyToObject,\n\tstoreProxyRelationship,\n\ttrackProxyObject,\n\tunwrap,\n} from './proxy-state'\nimport { dependant } from './tracking'\nimport {\n\tallProps,\n\tnativeReactive,\n\tnonReactiveMark,\n\toptions,\n\tprototypeForwarding,\n\tReactiveError,\n\tReactiveErrorCode,\n\tunreactiveProperties,\n} from './types'\n\nconst hasReentry: any[] = []\nconst reactiveHandlers = {\n\t[Symbol.toStringTag]: 'MutTs Reactive',\n\tget(obj: any, prop: PropertyKey, receiver: any) {\n\t\tif (prop === nonReactiveMark) return false\n\t\tconst unwrappedObj = unwrap(obj)\n\t\t// Check if this property is marked as unreactive\n\t\tif (unwrappedObj[unreactiveProperties]?.has(prop) || typeof prop === 'symbol')\n\t\t\treturn ReflectGet(obj, prop, receiver)\n\n\t\t// Special-case: array wrappers use prototype forwarding + numeric accessors.\n\t\t// With options.instanceMembers=true, inherited reads are normally not tracked, which breaks\n\t\t// reactivity for array indices/length (they appear inherited on the proxy).\n\t\tconst isArrayCase =\n\t\t\tprototypeForwarding in obj &&\n\t\t\t// biome-ignore lint/suspicious/useIsArray: This is the whole point here\n\t\t\tobj[prototypeForwarding] instanceof Array &&\n\t\t\ttypeof prop === 'string' &&\n\t\t\t(prop === 'length' || !Number.isNaN(Number(prop)))\n\t\tif (isArrayCase) {\n\t\t\tdependant(obj, prop === 'length' ? 'length' : Number(prop))\n\t\t}\n\t\t// Check if property exists and if it's an own property (cached for later use)\n\t\tconst hasProp = Reflect.has(receiver, prop)\n\t\tconst isOwnProp = hasProp && Object.hasOwn(receiver, prop)\n\t\tconst isInheritedAccess = hasProp && !isOwnProp\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\tconst shouldIgnoreAccessor =\n\t\t\toptions.ignoreAccessors &&\n\t\t\tisOwnProp &&\n\t\t\t(isOwnAccessor(receiver, prop) || isOwnAccessor(unwrappedObj, prop))\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// Watch the whole prototype chain when requested or for null-proto objects\n\t\tif (isInheritedAccess && (!options.instanceMembers || !(obj instanceof Object))) {\n\t\t\tlet current = reactiveObject(Object.getPrototypeOf(obj))\n\t\t\twhile (current && current !== Object.prototype) {\n\t\t\t\tdependant(current, prop)\n\t\t\t\tif (Object.hasOwn(current, prop)) break\n\t\t\t\tlet next = reactiveObject(Object.getPrototypeOf(current))\n\t\t\t\tif (next === current) {\n\t\t\t\t\tnext = reactiveObject(Object.getPrototypeOf(unwrap(current)))\n\t\t\t\t}\n\t\t\t\tcurrent = next\n\t\t\t}\n\t\t}\n\t\tconst value = ReflectGet(obj, prop, receiver)\n\t\tif (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: any, prop: PropertyKey, value: any, receiver: any): boolean {\n\t\t// Read old value directly from unwrapped object to avoid triggering dependency tracking\n\t\tconst unwrappedObj = unwrap(obj)\n\t\tconst unwrappedReceiver = unwrap(receiver)\n\n\t\t// Check if this property is marked as unreactive\n\t\tif (unwrappedObj[unreactiveProperties]?.has(prop) || unwrappedObj !== unwrappedReceiver)\n\t\t\treturn ReflectSet(obj, prop, value, receiver)\n\t\t// Really specific case for when Array is forwarder, in order to let it manage the reactivity\n\t\tconst isArrayCase =\n\t\t\tprototypeForwarding in obj &&\n\t\t\t// biome-ignore lint/suspicious/useIsArray: This is the whole point here\n\t\t\tobj[prototypeForwarding] instanceof Array &&\n\t\t\t(!Number.isNaN(Number(prop)) || prop === 'length')\n\t\tconst newValue = unwrap(value)\n\n\t\tif (isArrayCase) {\n\t\t\t;(obj as any)[prop] = newValue\n\t\t\treturn true\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\tif (Reflect.has(unwrappedReceiver, prop)) {\n\t\t\t// Check descriptor on both receiver and target to handle proxy cases\n\t\t\tconst receiverDesc = Object.getOwnPropertyDescriptor(unwrappedReceiver, prop)\n\t\t\tconst targetDesc = Object.getOwnPropertyDescriptor(unwrappedObj, prop)\n\t\t\tconst desc = receiverDesc || targetDesc\n\t\t\t// We *need* to use `receiver` and not `unwrappedObj` here, otherwise we break\n\t\t\t// the dependency tracking for memoized getters\n\t\t\tif (desc?.get && !desc?.set) {\n\t\t\t\toldVal = withEffect(undefined, () => Reflect.get(unwrappedObj, prop, receiver))\n\t\t\t} else {\n\t\t\t\toldVal = withEffect(undefined, () => Reflect.get(unwrappedObj, prop, receiver))\n\t\t\t}\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\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 (ReflectSet(obj, prop, newValue, receiver)) {\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: any, prop: PropertyKey): boolean {\n\t\tif (hasReentry.includes(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.push(obj)\n\t\tdependant(obj, prop)\n\t\tconst rv = Reflect.has(obj, prop)\n\t\thasReentry.pop()\n\t\treturn rv\n\t},\n\tdeleteProperty(obj: any, prop: PropertyKey): boolean {\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\tgetPrototypeOf(obj: any): object | null {\n\t\tif (prototypeForwarding in obj) return obj[prototypeForwarding]\n\t\treturn Object.getPrototypeOf(obj)\n\t},\n\tsetPrototypeOf(obj: any, proto: object | null): boolean {\n\t\tif (prototypeForwarding in obj) return false\n\t\tObject.setPrototypeOf(obj, proto)\n\t\treturn true\n\t},\n\townKeys(obj: any): (string | symbol)[] {\n\t\tdependant(obj, allProps)\n\t\treturn Reflect.ownKeys(obj)\n\t},\n} as const\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): 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\tconst proxied =\n\t\tnativeReactive in target && !(target instanceof target[nativeReactive])\n\t\t\t? new target[nativeReactive](target)\n\t\t\t: target\n\tif (proxied !== target) trackProxyObject(proxied, target)\n\tconst proxy = new Proxy(proxied, reactiveHandlers)\n\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\n/**\n * Gets the original, non-reactive object from a reactive proxy\n * @param proxy - The reactive proxy\n * @returns The original object\n */\nexport { isReactive, objectToProxy, proxyToObject, unwrap } from './proxy-state'\n","import {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectsWithDeepWatchers,\n} from './deep-watch-state'\nimport { effect } from './effects'\nimport { isNonReactive } from './non-reactive-state'\nimport { reactive, unwrap } from './proxy'\nimport { markWithRoot } from './registry'\nimport { options, type ScopedCallback } from './types'\n\nfunction isObject(value: any): value is object {\n\treturn typeof value === 'object' && value !== null\n}\n\nexport {\n\taddBackReference,\n\tbubbleUpChange,\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tneedsBackReferences,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n\tremoveBackReference,\n} from './deep-watch-state'\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): (() => void) | 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 ScopedCallback signature\n\tconst wrappedCallback: ScopedCallback = markWithRoot(() => callback(target), callback)\n\n\t// Use the existing effect system to register dependencies\n\treturn effect(() => {\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) || !isObject(obj) || depth > options.maxDeepWatchDepth) return\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// biome-ignore lint/suspicious/useIsArray: Check for both native arrays and reactive arrays\n\t\t\tif (Array.isArray(obj) || obj instanceof Array) {\n\t\t\t\t// Access array length to register dependency on length changes\n\t\t\t\tconst length = obj.length\n\n\t\t\t\t// Access all current array elements to register dependencies\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\t// Access the array element to register dependency\n\t\t\t\t\tconst value = obj[i]\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\t\t\t// Handle Set values (deep watch values only, not keys since Sets don't have separate keys)\n\t\t\telse if (obj instanceof Set) {\n\t\t\t\t// Access all Set values to register dependencies\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\t\t\t}\n\t\t\t// Handle Map values (deep watch values only, not keys)\n\t\t\telse if (obj instanceof Map) {\n\t\t\t\t// Access all Map values to register dependencies\n\t\t\t\tfor (const [_key, 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\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) callback(target)\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, type GenericClassDecorator } from '../decorator'\nimport { deepWatch } from './deep-watch'\nimport { withEffect } from './effect-context'\nimport { effect, getActiveEffect, untracked } from './effects'\nimport { isNonReactive, nonReactiveClass, nonReactiveObjects } from './non-reactive-state'\nimport { unwrap } from './proxy-state'\nimport { dependant } from './tracking'\nimport { markWithRoot } from './registry'\nimport {\n\ttype DependencyAccess,\n\tnonReactiveMark,\n\ttype ScopedCallback,\n\tunreactiveProperties,\n} from './types'\n\n/**\n * Symbol for accessing the cleanup function on cleaned objects\n */\nexport const cleanup = Symbol('cleanup')\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 * @param value - Function that returns the value to watch\n * @param changed - Callback to call when the value changes\n * @param options - Watch options\n * @returns Cleanup function to stop watching\n */\nexport function watch<T>(\n\tvalue: (dep: DependencyAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep?: false }\n): ScopedCallback\n/**\n * Watches a reactive value with deep watching enabled\n * @param value - Function that returns the value to watch\n * @param changed - Callback to call when the value changes\n * @param options - Watch options with deep watching enabled\n * @returns Cleanup function to stop watching\n */\nexport function watch<T extends object | any[]>(\n\tvalue: (dep: DependencyAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep: true }\n): ScopedCallback\n/**\n * Watches a reactive object directly\n * @param value - The reactive object to watch\n * @param changed - Callback to call when the object changes\n * @param options - Watch options\n * @returns Cleanup function to stop watching\n */\nexport function watch<T extends object | any[]>(\n\tvalue: T,\n\tchanged: (value: T) => void,\n\toptions?: WatchOptions\n): ScopedCallback\n\nexport function watch(\n\tvalue: any, //object | ((dep: DependencyAccess) => object),\n\tchanged: (value?: object, oldValue?: object) => void,\n\toptions: any = {}\n) {\n\treturn typeof value === 'function'\n\t\t? watchCallBack(value, changed, options)\n\t\t: typeof value === 'object' && value !== null\n\t\t\t? watchObject(value, changed, options)\n\t\t\t: (() => {\n\t\t\t\t\tthrow new Error('watch: value must be a function or an object')\n\t\t\t\t})()\n}\n\nfunction watchObject(\n\tvalue: object,\n\tchanged: (value: object) => void,\n\t{ immediate = false, deep = false } = {}\n): ScopedCallback {\n\tconst myParentEffect = getActiveEffect()\n\tif (deep) return deepWatch(value, changed, { immediate })!\n\treturn effect(\n\t\tfunction watchObjectEffect() {\n\t\t\tdependant(value)\n\t\t\tif (immediate) withEffect(myParentEffect, () => changed(value))\n\t\t\timmediate = true\n\t\t}\n\t)\n}\n\nfunction watchCallBack<T>(\n\tvalue: (dep: DependencyAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\t{ immediate = false, deep = false } = {}\n): ScopedCallback {\n\tconst myParentEffect = getActiveEffect()\n\tlet oldValue: T | typeof unsetYet = unsetYet\n\tlet deepCleanup: ScopedCallback | undefined\n\tconst cbCleanup = effect(\n\t\tmarkWithRoot(function watchCallBackEffect(access) {\n\t\t\tconst newValue = value(access)\n\t\t\tif (oldValue !== newValue)\n\t\t\t\twithEffect(\n\t\t\t\t\tmyParentEffect,\n\t\t\t\t\t() => {\n\t\t\t\t\t\tif (oldValue === unsetYet) {\n\t\t\t\t\t\t\tif (immediate) changed(newValue)\n\t\t\t\t\t\t} else changed(newValue, oldValue)\n\t\t\t\t\t\toldValue = newValue\n\t\t\t\t\t\tif (deep) {\n\t\t\t\t\t\t\tif (deepCleanup) deepCleanup()\n\t\t\t\t\t\t\tdeepCleanup = deepWatch(\n\t\t\t\t\t\t\t\tnewValue as object,\n\t\t\t\t\t\t\t\t(value) => changed(value as T, value as T)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t)\n\t\t}, value)\n\t)\n\treturn () => {\n\t\tcbCleanup()\n\t\tif (deepCleanup) deepCleanup()\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 deepNonReactive<T>(obj: T): T {\n\tobj = unwrap(obj)\n\tif (isNonReactive(obj)) return obj\n\ttry {\n\t\tObject.defineProperty(obj as object, nonReactiveMark, {\n\t\t\tvalue: true,\n\t\t\twritable: false,\n\t\t\tenumerable: false,\n\t\t\tconfigurable: true,\n\t\t})\n\t} catch {}\n\tif (!(nonReactiveMark in (obj as object))) nonReactiveObjects.add(obj as object)\n\t//for (const key in obj) deepNonReactive(obj[key])\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? deepNonReactive(arg1)\n\t\t: (((original) => {\n\t\t\t\t// Copy the parent's unreactive properties if they exist\n\t\t\t\toriginal.prototype[unreactiveProperties] = new Set<PropertyKey>(\n\t\t\t\t\toriginal.prototype[unreactiveProperties] || []\n\t\t\t\t)\n\t\t\t\t// Add all arguments (including the first one)\n\t\t\t\toriginal.prototype[unreactiveProperties].add(arg1)\n\t\t\t\tfor (const arg of args) original.prototype[unreactiveProperties].add(arg)\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\tnonReactiveClass(original)\n\t},\n\tdefault: unreactiveApplication,\n})\n\n//#endregion\n\nexport function cleanedBy<T extends object>(obj: T, cleanupFn: ScopedCallback) {\n\treturn Object.defineProperty(obj, cleanup, {\n\t\tvalue: cleanupFn,\n\t\twritable: false,\n\t\tenumerable: false,\n\t\tconfigurable: true,\n\t}) as T & { [cleanup]: ScopedCallback }\n}\n\n//#region greedy caching\n\n/**\n * Creates a derived value that automatically recomputes when dependencies change\n * @param compute - Function that computes the derived value\n * @returns Object with value and cleanup function\n */\nexport function derived<T>(compute: (dep: DependencyAccess) => T): {\n\tvalue: T\n\t[cleanup]: ScopedCallback\n} {\n\tconst rv = { value: undefined as unknown as T }\n\treturn cleanedBy(\n\t\trv,\n\t\tuntracked(() =>\n\t\t\teffect(\n\t\t\t\tfunction derivedEffect(access) {\n\t\t\t\t\trv.value = compute(access)\n\t\t\t\t}\n\t\t\t)\n\t\t)\n\t)\n}\n","import {\n\tabsent,\n\timmutables,\n\tisNonReactive,\n\tnonReactive,\n\tnonReactiveClass,\n\tnonReactiveObjects,\n\tregisterNativeReactivity,\n} from './non-reactive-state'\nimport { 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\nexport {\n\tabsent,\n\timmutables,\n\tisNonReactive,\n\tnonReactive,\n\tnonReactiveClass,\n\tnonReactiveObjects,\n\tregisterNativeReactivity,\n}\n","import { Indexable } from '../indexable'\nimport { touched } from './change'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './non-reactive'\nimport { reactive } from './proxy'\nimport { unwrap } from './proxy-state'\nimport { dependant } from './tracking'\nimport { prototypeForwarding } from './types'\n\nexport const native = Symbol('native')\nconst isArray = Array.isArray\nArray.isArray = ((value: any) =>\n\tisArray(value) ||\n\t(value &&\n\t\ttypeof value === 'object' &&\n\t\tprototypeForwarding in value &&\n\t\tArray.isArray(value[prototypeForwarding]))) as any\nexport class ReactiveBaseArray {\n\treadonly [native]!: any[]\n\n\t// Safe array access with negative indices\n\tat(index: number): any {\n\t\tconst actualIndex = index < 0 ? this[native].length + index : index\n\t\tdependant(this, actualIndex)\n\t\tif (actualIndex < 0 || actualIndex >= this[native].length) return undefined\n\t\treturn reactive(this[native][actualIndex])\n\t}\n\n\t// Immutable versions of mutator methods\n\ttoReversed(): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].toReversed())\n\t}\n\n\ttoSorted(compareFn?: (a: any, b: any) => number): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].toSorted(compareFn))\n\t}\n\n\ttoSpliced(start: number, deleteCount?: number, ...items: any[]): any[] {\n\t\tdependant(this)\n\t\treturn deleteCount === undefined\n\t\t\t? this[native].toSpliced(start)\n\t\t\t: this[native].toSpliced(start, deleteCount, ...items)\n\t}\n\n\twith(index: number, value: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].with(index, value))\n\t}\n\n\t// Iterator methods with reactivity tracking\n\tentries() {\n\t\tdependant(this)\n\t\treturn makeReactiveEntriesIterator(this[native].entries())\n\t}\n\n\tkeys() {\n\t\tdependant(this, 'length')\n\t\treturn this[native].keys()\n\t}\n\n\tvalues() {\n\t\tdependant(this)\n\t\treturn makeReactiveIterator(this[native].values())\n\t}\n\n\t[Symbol.iterator]() {\n\t\tdependant(this)\n\t\tconst nativeIterator = this[native][Symbol.iterator]()\n\t\treturn {\n\t\t\tnext() {\n\t\t\t\tconst result = nativeIterator.next()\n\t\t\t\tif (result.done) {\n\t\t\t\t\treturn result\n\t\t\t\t}\n\t\t\t\treturn { value: reactive(result.value), done: false }\n\t\t\t},\n\t\t}\n\t}\n\n\tindexOf(searchElement: any, fromIndex?: number): number {\n\t\tdependant(this)\n\t\tconst unwrappedSearch = unwrap(searchElement)\n\t\t// Check both wrapped and unwrapped versions since array may contain either\n\t\tconst index = this[native].indexOf(unwrappedSearch, fromIndex)\n\t\tif (index !== -1) return index\n\t\t// If not found with unwrapped, try with wrapped (in case array contains wrapped version)\n\t\treturn this[native].indexOf(searchElement, fromIndex)\n\t}\n\n\tlastIndexOf(searchElement: any, fromIndex?: number): number {\n\t\tdependant(this)\n\t\tconst unwrappedSearch = unwrap(searchElement)\n\t\t// Check both wrapped and unwrapped versions since array may contain either\n\t\tconst index = this[native].lastIndexOf(unwrappedSearch, fromIndex)\n\t\tif (index !== -1) return index\n\t\t// If not found with unwrapped, try with wrapped (in case array contains wrapped version)\n\t\treturn this[native].lastIndexOf(searchElement, fromIndex)\n\t}\n\n\tincludes(searchElement: any, fromIndex?: number): boolean {\n\t\tdependant(this)\n\t\tconst unwrappedSearch = unwrap(searchElement)\n\t\t// Check both wrapped and unwrapped versions since array may contain either\n\t\treturn (\n\t\t\tthis[native].includes(unwrappedSearch, fromIndex) ||\n\t\t\tthis[native].includes(searchElement, fromIndex)\n\t\t)\n\t}\n\n\tfind(predicate: (this: any, value: any, index: number, obj: any[]) => boolean, thisArg?: any): any\n\tfind(searchElement: any, fromIndex?: number): any\n\tfind(predicateOrElement: any, thisArg?: any): any {\n\t\tdependant(this)\n\t\tif (typeof predicateOrElement === 'function') {\n\t\t\tconst predicate = predicateOrElement as (\n\t\t\t\tthis: any,\n\t\t\t\tvalue: any,\n\t\t\t\tindex: number,\n\t\t\t\tobj: any[]\n\t\t\t) => boolean\n\t\t\treturn reactive(\n\t\t\t\tthis[native].find(\n\t\t\t\t\t(value, index, array) => predicate.call(thisArg, reactive(value), index, array),\n\t\t\t\t\tthisArg\n\t\t\t\t)\n\t\t\t)\n\t\t}\n\t\tconst fromIndex = typeof thisArg === 'number' ? thisArg : undefined\n\t\tconst index = this[native].indexOf(predicateOrElement, fromIndex)\n\t\tif (index === -1) return undefined\n\t\treturn reactive(this[native][index])\n\t}\n\n\tfindIndex(\n\t\tpredicate: (this: any, value: any, index: number, obj: any[]) => boolean,\n\t\tthisArg?: any\n\t): number\n\tfindIndex(searchElement: any, fromIndex?: number): number\n\tfindIndex(predicateOrElement: any, thisArg?: any): number {\n\t\tdependant(this)\n\t\tif (typeof predicateOrElement === 'function') {\n\t\t\tconst predicate = predicateOrElement as (\n\t\t\t\tthis: any,\n\t\t\t\tvalue: any,\n\t\t\t\tindex: number,\n\t\t\t\tobj: any[]\n\t\t\t) => boolean\n\t\t\treturn this[native].findIndex(\n\t\t\t\t(value, index, array) => predicate.call(thisArg, reactive(value), index, array),\n\t\t\t\tthisArg\n\t\t\t)\n\t\t}\n\t\tconst fromIndex = typeof thisArg === 'number' ? thisArg : undefined\n\t\treturn this[native].indexOf(predicateOrElement, fromIndex)\n\t}\n\n\tflat(): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].flat())\n\t}\n\n\tflatMap(\n\t\tcallbackfn: (this: any, value: any, index: number, array: any[]) => any[],\n\t\tthisArg?: any\n\t): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].flatMap(callbackfn, thisArg))\n\t}\n\n\tfilter(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(\n\t\t\tthis[native].filter((item, index, array) => callbackfn(reactive(item), index, array), thisArg)\n\t\t)\n\t}\n\n\tmap(callbackfn: (value: any, index: number, array: any[]) => any, thisArg?: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(\n\t\t\tthis[native].map((item, index, array) => callbackfn(reactive(item), index, array), thisArg)\n\t\t)\n\t}\n\n\treduce(\n\t\tcallbackfn: (previousValue: any, currentValue: any, currentIndex: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\tdependant(this)\n\t\tconst result =\n\t\t\tinitialValue === undefined\n\t\t\t\t? this[native].reduce(callbackfn as any)\n\t\t\t\t: this[native].reduce(callbackfn as any, initialValue)\n\t\treturn reactive(result)\n\t}\n\n\treduceRight(\n\t\tcallbackfn: (previousValue: any, currentValue: any, currentIndex: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\tdependant(this)\n\t\tconst result =\n\t\t\tinitialValue !== undefined\n\t\t\t\t? this[native].reduceRight(callbackfn as any, initialValue)\n\t\t\t\t: (this[native] as any).reduceRight(callbackfn as any)\n\t\treturn reactive(result)\n\t}\n\n\tslice(start?: number, end?: number): any[] {\n\t\tfor (const i of range(start || 0, end || this[native].length - 1)) dependant(this, i)\n\t\treturn start === undefined\n\t\t\t? this[native].slice()\n\t\t\t: end === undefined\n\t\t\t\t? this[native].slice(start)\n\t\t\t\t: this[native].slice(start, end)\n\t}\n\n\tconcat(...items: any[]): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].concat(...items))\n\t}\n\n\tjoin(separator?: string): string {\n\t\tdependant(this)\n\t\treturn this[native].join(separator as any)\n\t}\n\n\tforEach(callbackfn: (value: any, index: number, array: any[]) => void, thisArg?: any): void {\n\t\tdependant(this)\n\t\tthis[native].forEach((value, index, array) => {\n\t\t\tcallbackfn.call(thisArg, reactive(value), index, array)\n\t\t})\n\t}\n\n\t// TODO: re-implement for fun dependencies? (eg - every only check the first ones until it find some),\n\t// no need to make it dependant on indexes after the found one\n\tevery(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): boolean {\n\t\tdependant(this)\n\t\treturn this[native].every(\n\t\t\t(value, index, array) => callbackfn.call(thisArg, reactive(value), index, array),\n\t\t\tthisArg\n\t\t)\n\t}\n\n\tsome(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): boolean {\n\t\tdependant(this)\n\t\treturn this[native].some(\n\t\t\t(value, index, array) => callbackfn.call(thisArg, reactive(value), index, array),\n\t\t\tthisArg\n\t\t)\n\t}\n}\nfunction* index(i: number, { length = true } = {}): IterableIterator<number | 'length'> {\n\tif (length) yield 'length'\n\tyield i\n}\n\nfunction* range(\n\ta: number,\n\tb: number,\n\t{ length = false } = {}\n): IterableIterator<number | 'length'> {\n\tconst start = Math.min(a, b)\n\tconst end = Math.max(a, b)\n\tif (length) yield 'length'\n\tfor (let i = start; i <= end; i++) yield i\n}\n/**\n * Reactive wrapper around JavaScript's Array class with full array method support\n * Tracks length changes, individual index operations, and collection-wide operations\n */\nexport class ReactiveArray extends Indexable(ReactiveBaseArray, {\n\tget(i: number): any {\n\t\tdependant(this, i)\n\t\treturn reactive(this[native][i])\n\t},\n\tset(i: number, value: any) {\n\t\tconst added = i >= this[native].length\n\t\tthis[native][i] = value\n\t\ttouched(this, { type: 'set', prop: i }, index(i, { length: added }))\n\t},\n\tgetLength() {\n\t\tdependant(this, 'length')\n\t\treturn this[native].length\n\t},\n\tsetLength(value: number) {\n\t\tconst oldLength = this[native].length\n\t\ttry {\n\t\t\tthis[native].length = value\n\t\t} finally {\n\t\t\ttouched(this, { type: 'set', prop: 'length' }, range(oldLength, value, { length: true }))\n\t\t}\n\t},\n}) {\n\tconstructor(original: any[]) {\n\t\tsuper()\n\t\tObject.defineProperties(this, {\n\t\t\t// We have to make it double, as [native] must be `unique symbol` - impossible through import\n\t\t\t[native]: { value: original },\n\t\t\t[prototypeForwarding]: { value: original },\n\t\t})\n\t}\n\n\tpush(...items: any[]) {\n\t\tconst oldLength = this[native].length\n\t\ttry {\n\t\t\treturn this[native].push(...items)\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'push' },\n\t\t\t\trange(oldLength, oldLength + items.length - 1, { length: true })\n\t\t\t)\n\t\t}\n\t}\n\n\tpop() {\n\t\tif (this[native].length === 0) return undefined\n\t\ttry {\n\t\t\treturn reactive(this[native].pop())\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'pop' }, index(this[native].length))\n\t\t}\n\t}\n\n\tshift() {\n\t\tif (this[native].length === 0) return undefined\n\t\ttry {\n\t\t\treturn reactive(this[native].shift())\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'shift' },\n\t\t\t\trange(0, this[native].length + 1, { length: true })\n\t\t\t)\n\t\t}\n\t}\n\n\tunshift(...items: any[]) {\n\t\ttry {\n\t\t\treturn this[native].unshift(...items)\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'unshift' },\n\t\t\t\trange(0, this[native].length - items.length, { length: true })\n\t\t\t)\n\t\t}\n\t}\n\n\tsplice(start: number, deleteCount?: number, ...items: any[]) {\n\t\tconst oldLength = this[native].length\n\t\tif (deleteCount === undefined) deleteCount = oldLength - start\n\t\ttry {\n\t\t\tif (deleteCount === undefined) return reactive(this[native].splice(start))\n\t\t\treturn reactive(this[native].splice(start, deleteCount, ...items))\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'splice' },\n\t\t\t\t// TODO: edge cases\n\t\t\t\tdeleteCount === items.length\n\t\t\t\t\t? range(start, start + deleteCount)\n\t\t\t\t\t: range(start, oldLength + Math.max(items.length - deleteCount, 0), {\n\t\t\t\t\t\tlength: true,\n\t\t\t\t\t})\n\t\t\t)\n\t\t}\n\t}\n\n\treverse() {\n\t\ttry {\n\t\t\treturn this[native].reverse()\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'reverse' }, range(0, this[native].length - 1))\n\t\t}\n\t}\n\n\tsort(compareFn?: (a: any, b: any) => number) {\n\t\tcompareFn = compareFn || ((a, b) => a.toString().localeCompare(b.toString()))\n\t\ttry {\n\t\t\treturn this[native].sort((a, b) => compareFn(reactive(a), reactive(b))) as any\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'sort' }, range(0, this[native].length - 1))\n\t\t}\n\t}\n\n\tfill(value: any, start?: number, end?: number) {\n\t\ttry {\n\t\t\tif (start === undefined) return this[native].fill(value) as any\n\t\t\tif (end === undefined) return this[native].fill(value, start) as any\n\t\t\treturn this[native].fill(value, start, end) as any\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'fill' }, range(0, this[native].length - 1))\n\t\t}\n\t}\n\n\tcopyWithin(target: number, start: number, end?: number) {\n\t\ttry {\n\t\t\tif (end === undefined) return this[native].copyWithin(target, start) as any\n\t\t\treturn this[native].copyWithin(target, start, end) as any\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'copyWithin' },\n\t\t\t\t// TODO: calculate the range properly\n\t\t\t\trange(0, this[native].length - 1)\n\t\t\t)\n\t\t}\n\t\t// Touch all affected indices with a single allProps call\n\t}\n}\n","import { Indexable } from '../indexable'\nimport { native, ReactiveBaseArray } from './array'\nimport { touched, touched1 } from './change'\nimport { effect, untracked } from './effects'\nimport { cleanedBy } from './interface'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\nimport { prototypeForwarding, type ScopedCallback } from './types'\n\n// TODO: Lazy reactivity ?\nexport class ReadOnlyError extends Error { }\n/**\n * Reactive wrapper around JavaScript's Array class with full array method support\n * Tracks length changes, individual index operations, and collection-wide operations\n */\nclass ReactiveReadOnlyArrayClass extends Indexable(ReactiveBaseArray, {\n\tget(i: number): any {\n\t\tdependant(this, i)\n\t\treturn reactive(this[native][i])\n\t},\n\tset(i: number, _value: any) {\n\t\tthrow new ReadOnlyError(`Setting index ${i} on a read-only array`)\n\t},\n\tgetLength() {\n\t\tdependant(this, 'length')\n\t\treturn this[native].length\n\t},\n\tsetLength(value: number) {\n\t\tthrow new ReadOnlyError(`Setting length to ${value} on a read-only array`)\n\t},\n}) {\n\tconstructor(original: any[]) {\n\t\tsuper()\n\t\tObject.defineProperties(this, {\n\t\t\t// We have to make it double, as [native] must be `unique symbol` - impossible through import\n\t\t\t[native]: { value: original },\n\t\t\t[prototypeForwarding]: { value: original },\n\t\t})\n\t}\n\n\tpush(..._items: any[]) {\n\t\tthrow new ReadOnlyError(`Pushing items to a read-only array`)\n\t}\n\n\tpop() {\n\t\tthrow new ReadOnlyError(`Popping from a read-only array`)\n\t}\n\n\tshift() {\n\t\tthrow new ReadOnlyError(`Shifting from a read-only array`)\n\t}\n\n\tunshift(..._items: any[]) {\n\t\tthrow new ReadOnlyError(`Unshifting items to a read-only array`)\n\t}\n\n\tsplice(_start: number, _deleteCount?: number, ..._items: any[]) {\n\t\tthrow new ReadOnlyError(`Splice from a read-only array`)\n\t}\n\n\treverse() {\n\t\tthrow new ReadOnlyError(`Reversing a read-only array`)\n\t}\n\n\tsort(_compareFn?: (a: any, b: any) => number) {\n\t\tthrow new ReadOnlyError(`Sorting a read-only array`)\n\t}\n\n\tfill(_value: any, _start?: number, _end?: number) {\n\t\tthrow new ReadOnlyError(`Filling a read-only array`)\n\t}\n\n\tcopyWithin(_target: number, _start: number, _end?: number) {\n\t\tthrow new ReadOnlyError(`Copying within a read-only array`)\n\t}\n}\n\nexport const ReactiveReadOnlyArray = reactive(ReactiveReadOnlyArrayClass)\nexport type ReactiveReadOnlyArray<T> = readonly T[]\nexport function mapped<T, U>(\n\tinputs: readonly T[],\n\tcompute: (input: T, index: number, output: U[]) => U,\n\tresize?: (newLength: number, oldLength: number) => void\n): readonly U[] {\n\tconst result: U[] = []\n\tconst resultReactive = new ReactiveReadOnlyArray(result)\n\tconst cleanups: ScopedCallback[] = []\n\tfunction input(index: number) {\n\t\treturn effect(function computedIndexedMapInputEffect() {\n\t\t\tresult[index] = compute(inputs[index], index, resultReactive)\n\t\t\ttouched1(resultReactive, { type: 'set', prop: index }, index)\n\t\t})\n\t}\n\tconst cleanupLength = effect(function computedMapLengthEffect({ ascend }) {\n\t\tconst length = inputs.length\n\t\tconst resultLength = untracked(() => result.length)\n\t\tresize?.(length, resultLength)\n\t\ttouched1(resultReactive, { type: 'set', prop: 'length' }, 'length')\n\t\tif (length < resultLength) {\n\t\t\tconst toCleanup = cleanups.splice(length)\n\t\t\tfor (const cleanup of toCleanup) cleanup()\n\t\t\tresult.length = length\n\t\t} else if (length > resultLength)\n\t\t\t// the input effects will be registered as the call's children, so they will remain not cleaned with this effect on length\n\t\t\tascend(function computedMapNewElements() {\n\t\t\t\tfor (let i = resultLength; i < length; i++) cleanups.push(input(i))\n\t\t\t})\n\t})\n\treturn cleanedBy(resultReactive, () => {\n\t\tfor (const cleanup of cleanups) cleanup()\n\t\tcleanups.length = 0\n\t\tcleanupLength()\n\t})\n}\n\nexport function reduced<T, U, R extends object = any>(\n\tinputs: readonly T[],\n\tcompute: (input: T, factor: R) => readonly U[]\n): readonly U[] {\n\tconst result: U[] = []\n\tconst resultReactive = new ReactiveReadOnlyArray(result)\n\tconst cleanupFactor = effect(function computedReducedFactorEffect() {\n\t\tconst factor: R = {} as R\n\t\tresult.length = 0\n\t\tfor (const input of inputs) result.push(...compute(input, factor))\n\t\ttouched(resultReactive, { type: 'invalidate', prop: 'reduced' })\n\t})\n\treturn cleanedBy(resultReactive, cleanupFactor)\n}\n","import { decorator } from '../decorator'\nimport { deepCompare, renamed } from '../utils'\nimport { touched1 } from './change'\nimport { effect, root, untracked } from './effects'\nimport { dependant } from './tracking'\nimport { getRoot, markWithRoot } from './registry'\nimport { options, rootFunction } from './types'\n\nexport type Memoizable = object | any[] | symbol | ((...args: any[]) => any)\n\ntype MemoCacheTree<Result> = {\n\tresult?: Result\n\tcleanup?: () => void\n\tbranches?: WeakMap<Memoizable, MemoCacheTree<Result>>\n}\n\nconst memoizedRegistry = new WeakMap<any, Function>()\nconst wrapperRegistry = new WeakMap<Function, Function>()\n\nfunction getBranch<Result>(tree: MemoCacheTree<Result>, key: Memoizable): 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 Memoizable[]>(\n\tfn: (...args: Args) => Result\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((...args: Args): Result => {\n\t\tconst localArgs = args //: Args = maxArgs !== undefined ? (args.slice(0, maxArgs) as Args) : args\n\t\tif (localArgs.some((arg) => !(arg && ['object', 'symbol', 'function'].includes(typeof arg))))\n\t\t\tthrow new Error('memoize expects non-null object arguments')\n\n\t\tlet node: MemoCacheTree<Result> = cacheRoot\n\t\t// Note: decorators add `this` as first argument\n\t\tfor (const arg of localArgs) {\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(...localArgs))\n\t\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\t\toptions.onMemoizationDiscrepancy(node.result, fresh, fn, localArgs, '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(\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(...localArgs)\n\t\t\t\t\treturn () => {\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: localArgs }, '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()\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(...localArgs))\n\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\toptions.onMemoizationDiscrepancy(node.result, fresh, fn, localArgs, '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\nexport const memoize = decorator({\n\tgetter(original, target, propertyKey) {\n\t\treturn function (this: any) {\n\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\tif (!wrapper) {\n\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\trenamed((that: object) => {\n\t\t\t\t\t\treturn original.call(that)\n\t\t\t\t\t}, `${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(propertyKey)}`),\n\t\t\t\t\t{\n\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\tpropertyKey,\n\t\t\t\t\t\t...((original as any)[rootFunction] ? { [rootFunction]: (original as any)[rootFunction] } : {}),\n\t\t\t\t\t}\n\t\t\t\t)\n\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t}\n\t\t\tconst memoized = memoizeFunction(wrapper as any)\n\t\t\treturn memoized(this)\n\t\t}\n\t},\n\tmethod(original, target, name) {\n\t\treturn function (this: any, ...args: object[]) {\n\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\tif (!wrapper) {\n\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\trenamed((that: object, ...args: object[]) => {\n\t\t\t\t\t\treturn original.call(that, ...args)\n\t\t\t\t\t}, `${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(name)}`),\n\t\t\t\t\t{\n\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\tpropertyKey: name,\n\t\t\t\t\t\t...((original as any)[rootFunction] ? { [rootFunction]: (original as any)[rootFunction] } : {}),\n\t\t\t\t\t}\n\t\t\t\t)\n\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t}\n\t\t\tconst memoized = memoizeFunction(wrapper as any) as (...args: object[]) => unknown\n\t\t\treturn memoized(this, ...args)\n\t\t}\n\t},\n\tdefault: memoizeFunction,\n})\n","import { ArrayReadForward, forwardArray, getAt, Indexable, setAt } from '../indexable'\nimport { effect } from './effects'\nimport { unreactive } from './interface'\nimport { reactive } from './proxy'\nimport { type DependencyFunction, prototypeForwarding, type ScopedCallback } from './types'\n\n// TODO: use register in a real-world crud situation, have \"events\" for add, delete, update\n\ntype KeyFunction<T, K extends PropertyKey> = (item: T) => K\n\n// Helper to work around TypeScript limitation: base class expressions cannot reference class type parameters\nfunction getRegisterBase<T>() {\n\tclass RegisterBase extends Indexable(ArrayReadForward, {\n\t\tget(this: any, index: number) {\n\t\t\treturn this[getAt](index)\n\t\t},\n\t\tset(this: any, index: number, value: T) {\n\t\t\tthis[setAt](index, value)\n\t\t},\n\t\tgetLength(this: any) {\n\t\t\treturn this.length\n\t\t},\n\t\tsetLength(this: any, value: number) {\n\t\t\tthis.length = value\n\t\t},\n\t}) {\n\t\ttoArray(): T[] {\n\t\t\treturn Array.from(this)\n\t\t}\n\t}\n\treturn RegisterBase as new () => ArrayReadForward<T> & {\n\t\t[x: number]: T\n\t\ttoArray(): T[]\n\t}\n}\ninterface RegisterInstance<T> extends ArrayReadForward<T> {\n\t[index: number]: T\n}\n\n@unreactive\nclass RegisterClass<T, K extends PropertyKey = PropertyKey>\n\textends getRegisterBase<any>()\n\timplements RegisterInstance<T>\n{\n\tprotected get [forwardArray](): readonly T[] {\n\t\treturn this.toArray()\n\t}\n\treadonly #keyFn: KeyFunction<T, K>\n\treadonly #keys: K[]\n\treadonly #values: Map<K, T>\n\treadonly #usage = new Map<K, number>()\n\treadonly #valueInfo = new Map<T, { key: K; stop?: ScopedCallback }>()\n\treadonly #keyEffects = new Set<ScopedCallback>()\n\treadonly #ascend: DependencyFunction\n\n\tconstructor(keyFn: KeyFunction<T, K>, initial?: Iterable<T>) {\n\t\tsuper()\n\t\t/* Moved below initialization */\n\t\tlet ascendGet: DependencyFunction | undefined\n\t\teffect(({ ascend }) => {\n\t\t\tascendGet = ascend\n\t\t})\n\t\tthis.#ascend = ascendGet!\n\t\tif (typeof keyFn !== 'function') throw new Error('Register requires a key function')\n\t\tthis.#keyFn = keyFn\n\t\tthis.#keys = reactive([] as K[])\n\t\tthis.#values = reactive(new Map<K, T>())\n\t\tObject.defineProperties(this, {\n\t\t\t[prototypeForwarding]: { value: this.#keys },\n\t\t})\n\t\tif (initial) this.push(...initial)\n\t}\n\n\tprivate ensureKey(value: T): K {\n\t\tlet info = this.#valueInfo.get(value)\n\t\tif (info) return info.key\n\t\tinfo = { key: undefined as unknown as K }\n\t\tthis.#valueInfo.set(value, info)\n\t\tthis.#ascend(() => {\n\t\t\tconst stop = effect(({ reaction }) => {\n\t\t\t\tconst nextKey = this.#keyFn(value)\n\t\t\t\tthis.assertValidKey(nextKey)\n\t\t\t\tconst previousKey = info!.key\n\t\t\t\tif (reaction && previousKey !== undefined && !Object.is(nextKey, previousKey))\n\t\t\t\t\tthis.#rekeyValue(value, previousKey, nextKey)\n\t\t\t\tinfo!.key = nextKey\n\t\t\t})\n\t\t\tinfo!.stop = stop\n\t\t\tthis.#keyEffects.add(stop)\n\t\t})\n\t\tif (info.key === undefined) throw new Error('Register key function must return a property key')\n\t\treturn info.key\n\t}\n\n\tprivate assertValidKey(key: unknown): asserts key is K {\n\t\tconst type = typeof key\n\t\tif (type !== 'string' && type !== 'number' && type !== 'symbol')\n\t\t\tthrow new Error('Register key function must return a property key')\n\t}\n\n\tprivate setKeyValue(key: K, value: T) {\n\t\tconst existing = this.#values.get(key)\n\t\tif (existing !== undefined && existing !== value) this.cleanupValue(existing)\n\t\tthis.#values.set(key, value)\n\t}\n\n\tprivate cleanupValue(value: T) {\n\t\tconst info = this.#valueInfo.get(value)\n\t\tif (!info) return\n\t\tconst stop = info.stop\n\t\tif (stop) {\n\t\t\tinfo.stop = undefined\n\t\t\tthis.#keyEffects.delete(stop)\n\t\t\tstop()\n\t\t}\n\t\tthis.#valueInfo.delete(value)\n\t}\n\n\tprivate disposeKeyEffects() {\n\t\tfor (const value of Array.from(this.#valueInfo.keys())) this.cleanupValue(value)\n\t\tthis.#keyEffects.clear()\n\t}\n\n\t#rekeyValue(value: T, oldKey: K, newKey: K) {\n\t\tif (Object.is(oldKey, newKey)) return\n\t\tconst existingValue = this.#values.get(newKey)\n\t\tif (existingValue !== undefined && existingValue !== value)\n\t\t\tthrow new Error(`Register key collision for key ${String(newKey)}`)\n\t\tconst count = this.#usage.get(oldKey)\n\t\tif (!count) return\n\t\tconst existingCount = this.#usage.get(newKey) ?? 0\n\t\tthis.setKeyValue(newKey, value)\n\t\tfor (let i = 0; i < this.#keys.length; i++)\n\t\t\tif (Object.is(this.#keys[i], oldKey)) this.#keys[i] = newKey\n\t\tthis.#usage.set(newKey, existingCount + count)\n\t\tthis.#usage.delete(oldKey)\n\t\tthis.#values.delete(oldKey)\n\t\tconst updatedInfo = this.#valueInfo.get(value)\n\t\tif (updatedInfo) updatedInfo.key = newKey\n\t}\n\n\tprivate incrementUsage(key: K) {\n\t\tconst count = this.#usage.get(key) ?? 0\n\t\tthis.#usage.set(key, count + 1)\n\t}\n\n\tprivate decrementUsage(key: K) {\n\t\tconst count = this.#usage.get(key)\n\t\tif (!count) return\n\t\tif (count <= 1) {\n\t\t\tconst value = this.#values.get(key)\n\t\t\tthis.#usage.delete(key)\n\t\t\tthis.#values.delete(key)\n\t\t\tif (value !== undefined) this.cleanupValue(value)\n\t\t} else {\n\t\t\tthis.#usage.set(key, count - 1)\n\t\t}\n\t}\n\n\tprivate normalizeIndex(index: number, allowEnd = false): number {\n\t\tconst length = this.length\n\t\tlet resolved = index\n\t\tif (resolved < 0) resolved = Math.max(length + resolved, 0)\n\t\tif (resolved > length) {\n\t\t\tif (allowEnd) resolved = length\n\t\t\telse throw new RangeError('Index out of bounds')\n\t\t}\n\t\tif (!allowEnd && resolved === length) throw new RangeError('Index out of bounds')\n\t\treturn resolved\n\t}\n\n\tprivate assignAt(index: number, key: K, value: T) {\n\t\tconst oldKey = this.#keys[index]\n\t\tif (oldKey !== undefined && Object.is(oldKey, key)) {\n\t\t\tthis.setKeyValue(key, value)\n\t\t\treturn\n\t\t}\n\t\tif (oldKey !== undefined) this.decrementUsage(oldKey as K)\n\t\tthis.#keys[index] = key\n\t\tthis.incrementUsage(key)\n\t\tthis.setKeyValue(key, value)\n\t}\n\n\tprivate insertKeyValue(index: number, key: K, value: T) {\n\t\tthis.#keys.splice(index, 0, key)\n\t\tthis.incrementUsage(key)\n\t\tthis.setKeyValue(key, value)\n\t}\n\n\tprivate rebuildFrom(values: T[]) {\n\t\tthis.disposeKeyEffects()\n\t\tthis.#keys.splice(0, this.#keys.length)\n\t\tthis.#usage.clear()\n\t\tthis.#values.clear()\n\t\tfor (const value of values) {\n\t\t\tconst key = this.ensureKey(value)\n\t\t\tthis.#keys.push(key)\n\t\t\tthis.incrementUsage(key)\n\t\t\tthis.#values.set(key, value)\n\t\t}\n\t}\n\n\tget length(): number {\n\t\treturn this.#keys.length\n\t}\n\n\t[getAt](index: number): T | undefined {\n\t\tconst key = this.#keys[index]\n\t\treturn key === undefined ? undefined : this.#values.get(key)\n\t}\n\n\t[setAt](index: number, value: T): void {\n\t\tconst key = this.ensureKey(value)\n\t\tif (index === this.length) {\n\t\t\tthis.insertKeyValue(index, key, value)\n\t\t\treturn\n\t\t}\n\t\tconst normalized = this.normalizeIndex(index)\n\t\tthis.assignAt(normalized, key, value)\n\t}\n\n\tpush(...items: T[]): number {\n\t\tfor (const item of items) {\n\t\t\tconst key = this.ensureKey(item)\n\t\t\tthis.insertKeyValue(this.length, key, item)\n\t\t}\n\t\treturn this.length\n\t}\n\n\tpop(): T | undefined {\n\t\tif (!this.length) return undefined\n\t\treturn this.removeAt(this.length - 1)\n\t}\n\n\tshift(): T | undefined {\n\t\tif (!this.length) return undefined\n\t\treturn this.removeAt(0)\n\t}\n\n\tunshift(...items: T[]): number {\n\t\tlet index = 0\n\t\tfor (const item of items) {\n\t\t\tconst key = this.ensureKey(item)\n\t\t\tthis.insertKeyValue(index++, key, item)\n\t\t}\n\t\treturn this.length\n\t}\n\n\tsplice(start: number, deleteCount?: number, ...items: T[]): T[] {\n\t\tconst normalizedStart = this.normalizeIndex(start, true)\n\t\tconst maxDeletions = this.length - normalizedStart\n\t\tconst actualDelete = Math.min(\n\t\t\tdeleteCount === undefined ? maxDeletions : Math.max(deleteCount, 0),\n\t\t\tmaxDeletions\n\t\t)\n\t\tconst keysToInsert: K[] = []\n\t\tfor (const item of items) keysToInsert.push(this.ensureKey(item))\n\t\tconst removedKeys = this.#keys.splice(normalizedStart, actualDelete, ...keysToInsert)\n\t\tconst removedValues: T[] = []\n\t\tfor (const key of removedKeys) {\n\t\t\tif (key === undefined) continue\n\t\t\tconst value = this.#values.get(key as K)\n\t\t\tthis.decrementUsage(key as K)\n\t\t\tremovedValues.push(value as T)\n\t\t}\n\t\tfor (let i = 0; i < keysToInsert.length; i++) {\n\t\t\tconst key = keysToInsert[i]\n\t\t\tconst value = items[i]\n\t\t\tthis.incrementUsage(key)\n\t\t\tthis.setKeyValue(key, value)\n\t\t}\n\t\treturn removedValues\n\t}\n\n\tclear(): void {\n\t\tthis.#keys.length = 0\n\t\tthis.#usage.clear()\n\t\tthis.#values.clear()\n\t\tthis.disposeKeyEffects()\n\t}\n\n\tget(key: K): T | undefined {\n\t\treturn this.#values.get(key)\n\t}\n\tset(key: K, value: T): void {\n\t\tif (this.#values.has(key)) this.setKeyValue(key, value)\n\t}\n\n\tremove(key: K) {\n\t\tlet index: number = this.indexOfKey(key)\n\t\twhile (index !== -1) {\n\t\t\tthis.removeAt(index)\n\t\t\tindex = this.indexOfKey(key)\n\t\t}\n\t}\n\n\tpublic removeAt(index: number): T | undefined {\n\t\tconst [key] = this.#keys.splice(index, 1)\n\t\tif (key === undefined) return undefined\n\t\tconst value = this.#values.get(key as K)\n\t\tthis.decrementUsage(key as K)\n\t\treturn value\n\t}\n\n\t/**\n\t * Keep only the items for which the predicate returns true.\n\t * Items for which the predicate returns false are removed.\n\t *\n\t * The predicate is evaluated once per distinct key; duplicate keys\n\t * will follow the same keep/remove decision.\n\t */\n\tpublic keep(predicate: (value: T) => boolean): void {\n\t\tconst decisions = new Map<K, boolean>()\n\t\tfor (const [index, key] of this.#keys.entries()) {\n\t\t\tif (decisions.has(key)) {\n\t\t\t\tif (!decisions.get(key)) this.removeAt(index)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tconst value = this.#values.get(key)\n\t\t\tconst shouldKeep = predicate(value as T)\n\t\t\tdecisions.set(key, shouldKeep)\n\t\t\tif (!shouldKeep) this.removeAt(index)\n\t\t}\n\t}\n\n\thasKey(key: K): boolean {\n\t\treturn this.#usage.has(key)\n\t}\n\n\tindexOfKey(key: K): number {\n\t\treturn this.#keys.indexOf(key)\n\t}\n\n\tmapKeys(): IterableIterator<K> {\n\t\treturn this.#values.keys()\n\t}\n\n\tupdate(...values: T[]): void {\n\t\tfor (const value of values) {\n\t\t\tconst key = this.ensureKey(value)\n\t\t\tif (this.#values.has(key)) this.setKeyValue(key, value)\n\t\t}\n\t}\n\n\tupsert(insert: (value: T) => void, ...values: T[]): void {\n\t\tfor (const value of values) {\n\t\t\tconst key = this.ensureKey(value)\n\t\t\tif (this.#values.has(key)) this.setKeyValue(key, value)\n\t\t\telse insert(value)\n\t\t}\n\t}\n\n\tentries(): IterableIterator<[number, T]> {\n\t\tconst self = this\n\t\tfunction* iterator(): IterableIterator<[number, T]> {\n\t\t\tfor (let i = 0; i < self.#keys.length; i++) {\n\t\t\t\tconst val = self.#values.get(self.#keys[i])\n\t\t\t\tif (val !== undefined) yield [i, val]\n\t\t\t}\n\t\t}\n\t\treturn iterator()\n\t}\n\n\t[Symbol.iterator](): IterableIterator<T> {\n\t\tconst self = this\n\t\tfunction* iterator(): IterableIterator<T> {\n\t\t\tfor (const key of self.#keys) {\n\t\t\t\tconst value = self.#values.get(key)\n\t\t\t\tif (value !== undefined) yield value\n\t\t\t}\n\t\t}\n\t\treturn iterator()\n\t}\n\n\ttoString(): string {\n\t\treturn `[Register length=${this.length}]`\n\t}\n\n\tat(index: number): T | undefined {\n\t\tconst resolved = index < 0 ? this.length + index : index\n\t\tif (resolved < 0 || resolved >= this.length) return undefined\n\t\treturn this[getAt](resolved)\n\t}\n\treverse(): this {\n\t\tthis.#keys.reverse()\n\t\treturn this\n\t}\n\tsort(compareFn?: ((a: T, b: T) => number) | undefined): this {\n\t\tconst fwdCompareFn = compareFn\n\t\t\t? (a: K, b: K) => compareFn(this.#values.get(a) as T, this.#values.get(b) as T)\n\t\t\t: undefined\n\t\tthis.#keys.sort(fwdCompareFn)\n\t\treturn this\n\t}\n\tfill(value: T, start = 0, end = this.length): this {\n\t\tconst values = this.toArray()\n\t\tvalues.fill(value, start, end)\n\t\tthis.rebuildFrom(values)\n\t\treturn this\n\t}\n\n\tcopyWithin(target: number, start: number, end?: number): this {\n\t\tconst values = this.toArray()\n\t\tvalues.copyWithin(target, start, end)\n\t\tthis.rebuildFrom(values)\n\t\treturn this\n\t}\n}\n\nexport type Register<T, K extends PropertyKey = PropertyKey> = RegisterClass<T, K> & T[]\nexport const Register = RegisterClass as new <T, K extends PropertyKey = PropertyKey>(\n\tkeyFn: KeyFunction<T, K>,\n\tinitial?: Iterable<T>\n) => Register<T, K>\n\nexport function register<T, K extends PropertyKey = PropertyKey>(\n\tkeyFn: KeyFunction<T, K>,\n\tinitial?: Iterable<T>\n): Register<T, K> {\n\treturn new RegisterClass(keyFn, initial) as Register<T, K>\n}\n","import { ReflectGet, ReflectSet } from '../utils'\nimport { setEffectName } from './debug'\nimport { getActiveEffect } from './effect-context'\nimport { effect, untracked } from './effects'\nimport { cleanedBy, cleanup } from './interface'\nimport { reactive } from './proxy'\nimport { Register } from './register'\nimport { type ProjectionContext, projectionInfo, type ScopedCallback } from './types'\n\n/**\n * Maps projection effects (item effects) to their projection context\n */\nexport const effectProjectionMetadata = new WeakMap<ScopedCallback, ProjectionContext>()\n\n/**\n * Returns the projection context of the currently running effect, if any.\n */\nexport function getActiveProjection(): ProjectionContext | undefined {\n\tconst active = getActiveEffect()\n\treturn active ? effectProjectionMetadata.get(active) : undefined\n}\n\n/* TODO\nIt seems to work and I feel like it's correct but I couldn't validate theoretically that `ascend`\nis the correct way to deal with nested effects.\n*/\n\ntype ProjectOldValue<Target> = Target extends readonly (infer Item)[]\n\t? Item\n\t: Target extends Map<any, infer Item>\n\t\t? Item\n\t\t: Target extends Record<PropertyKey, infer Item>\n\t\t\t? Item\n\t\t\t: unknown\n\nexport type ProjectAccess<SourceValue, Key, SourceType, Target> = {\n\treadonly key: Key\n\tget(): SourceValue\n\tset(value: SourceValue): boolean\n\treadonly source: SourceType\n\treadonly old?: ProjectOldValue<Target>\n\tvalue: SourceValue\n}\n\ntype BivariantProjectCallback<Args extends any[], Return> = {\n\tbivarianceHack(...args: Args): Return\n}['bivarianceHack']\n\nexport type ProjectCallback<\n\tSourceValue,\n\tKey,\n\tTarget extends object,\n\tSourceType,\n\tResult,\n> = BivariantProjectCallback<[ProjectAccess<SourceValue, Key, SourceType, Target>, Target], Result>\n\nexport type ProjectResult<Target extends object> = Target & { [cleanup]: ScopedCallback }\n\nfunction defineAccessValue<Access extends { get(): unknown; set(value: unknown): boolean }>(\n\taccess: Access\n) {\n\tObject.defineProperty(access, 'value', {\n\t\tget: access.get,\n\t\tset: access.set,\n\t\tconfigurable: true,\n\t\tenumerable: true,\n\t})\n}\n\nfunction makeCleanup<Result extends object>(\n\ttarget: Result,\n\teffectMap: Map<unknown, ScopedCallback>,\n\tonDispose: () => void,\n\tmetadata?: any\n): ProjectResult<Result> {\n\tif (metadata) {\n\t\tObject.defineProperty(target, projectionInfo, {\n\t\t\tvalue: metadata,\n\t\t\twritable: false,\n\t\t\tenumerable: false,\n\t\t\tconfigurable: true,\n\t\t})\n\t}\n\treturn cleanedBy(target, () => {\n\t\tonDispose()\n\t\tfor (const stop of effectMap.values()) stop?.()\n\t\teffectMap.clear()\n\t}) as ProjectResult<Result>\n}\n\nfunction projectArray<SourceValue, ResultValue>(\n\tsource: readonly SourceValue[],\n\tapply: ProjectCallback<SourceValue, number, ResultValue[], readonly SourceValue[], ResultValue>\n): ProjectResult<ResultValue[]> {\n\tconst observedSource = reactive(source) as readonly SourceValue[]\n\tconst target = reactive([] as ResultValue[])\n\tconst indexEffects = new Map<number, ScopedCallback>()\n\n\tfunction normalizeTargetLength(length: number) {\n\t\tReflectSet(target as unknown as object, 'length', length, target)\n\t}\n\n\tfunction disposeIndex(index: number) {\n\t\tconst stopEffect = indexEffects.get(index)\n\t\tif (stopEffect) {\n\t\t\tindexEffects.delete(index)\n\t\t\tstopEffect()\n\t\t\tReflect.deleteProperty(target as unknown as object, index)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupLength = effect(function projectArrayLengthEffect({ ascend }) {\n\t\tconst length = observedSource.length\n\t\tnormalizeTargetLength(length)\n\t\tconst existing = Array.from(indexEffects.keys())\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tif (indexEffects.has(i)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst index = i\n\t\t\t\tconst stop = effect(function projectArrayIndexEffect() {\n\t\t\t\t\tconst previous = untracked(() => target[index])\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey: index,\n\t\t\t\t\t\tsource: observedSource,\n\t\t\t\t\t\tget: () => ReflectGet(observedSource as any, index, observedSource),\n\t\t\t\t\t\tset: (value: SourceValue) =>\n\t\t\t\t\t\t\tReflectSet(observedSource as any, index, value, observedSource),\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<SourceValue, number, readonly SourceValue[], ResultValue[]>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\ttarget[index] = produced\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${index}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource: observedSource,\n\t\t\t\t\tkey: index,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tindexEffects.set(i, stop)\n\t\t\t})\n\t\t}\n\t\tfor (const index of existing) if (index >= length) disposeIndex(index)\n\t})\n\n\treturn makeCleanup(target, indexEffects, () => cleanupLength(), {\n\t\tsource: observedSource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\nfunction projectRegister<Key extends PropertyKey, SourceValue, ResultValue>(\n\tsource: Register<SourceValue, Key>,\n\tapply: ProjectCallback<\n\t\tSourceValue,\n\t\tKey,\n\t\tMap<Key, ResultValue>,\n\t\tRegister<SourceValue, Key>,\n\t\tResultValue\n\t>\n): ProjectResult<Map<Key, ResultValue>> {\n\tconst observedSource = reactive(source) as Register<SourceValue, Key>\n\tconst rawTarget = new Map<Key, ResultValue>()\n\tconst target = reactive(rawTarget) as Map<Key, ResultValue>\n\tconst keyEffects = new Map<Key, ScopedCallback>()\n\n\tfunction disposeKey(key: Key) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tstopEffect()\n\t\t\tkeyEffects.delete(key)\n\t\t\ttarget.delete(key)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupKeys = effect(function projectRegisterEffect({ ascend }) {\n\t\tconst keys = new Set<Key>()\n\t\tfor (const key of observedSource.mapKeys()) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function projectRegisterKeyEffect() {\n\t\t\t\t\tconst previous = untracked(() => target.get(key))\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey,\n\t\t\t\t\t\tsource: observedSource,\n\t\t\t\t\t\tget: () => observedSource.get(key) as SourceValue,\n\t\t\t\t\t\tset: (value: SourceValue) => {\n\t\t\t\t\t\t\tobservedSource.set(key, value)\n\t\t\t\t\t\t\treturn true\n\t\t\t\t\t\t},\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<SourceValue, Key, Register<SourceValue, Key>, Map<Key, ResultValue>>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\ttarget.set(key, produced)\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${String(key)}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource: observedSource,\n\t\t\t\t\tkey,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn makeCleanup(target, keyEffects, () => cleanupKeys(), {\n\t\tsource: observedSource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\nfunction projectRecord<Source extends Record<PropertyKey, any>, ResultValue>(\n\tsource: Source,\n\tapply: ProjectCallback<\n\t\tSource[keyof Source],\n\t\tkeyof Source,\n\t\tRecord<keyof Source, ResultValue>,\n\t\tSource,\n\t\tResultValue\n\t>\n): ProjectResult<Record<keyof Source, ResultValue>> {\n\tconst observedSource = reactive(source) as Source\n\tconst target = reactive({} as Record<keyof Source, ResultValue>)\n\tconst keyEffects = new Map<PropertyKey, ScopedCallback>()\n\n\tfunction disposeKey(key: PropertyKey) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tstopEffect()\n\t\t\tkeyEffects.delete(key)\n\t\t\tReflect.deleteProperty(target as Record<PropertyKey, unknown>, key)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupKeys = effect(function projectRecordEffect({ ascend }) {\n\t\tconst keys = new Set<PropertyKey>()\n\t\tfor (const key in observedSource) keys.add(key)\n\t\tconst observed = Reflect.ownKeys(observedSource)\n\t\tfor (const key of observed) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function projectRecordKeyEffect() {\n\t\t\t\t\tconst sourceKey = key as keyof Source\n\t\t\t\t\tconst previous = untracked(\n\t\t\t\t\t\t() => (target as Record<PropertyKey, ResultValue | undefined>)[key]\n\t\t\t\t\t)\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey: sourceKey,\n\t\t\t\t\t\tsource: observedSource,\n\t\t\t\t\t\tget: () => ReflectGet(observedSource, sourceKey, observedSource),\n\t\t\t\t\t\tset: (value: Source[typeof sourceKey]) =>\n\t\t\t\t\t\t\tReflectSet(observedSource, sourceKey, value, observedSource),\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<\n\t\t\t\t\t\tSource[typeof sourceKey],\n\t\t\t\t\t\tkeyof Source,\n\t\t\t\t\t\tSource,\n\t\t\t\t\t\tRecord<keyof Source, ResultValue>\n\t\t\t\t\t>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\t;(target as any)[sourceKey] = produced\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${String(key)}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource: observedSource,\n\t\t\t\t\tkey,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn makeCleanup(target, keyEffects, () => cleanupKeys(), {\n\t\tsource: observedSource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\nfunction projectMap<Key, Value, ResultValue>(\n\tsource: Map<Key, Value>,\n\tapply: ProjectCallback<Value, Key, Map<Key, ResultValue>, Map<Key, Value>, ResultValue>\n): ProjectResult<Map<Key, ResultValue>> {\n\tconst observedSource = reactive(source) as Map<Key, Value>\n\tconst rawTarget = new Map<Key, ResultValue>()\n\tconst target = reactive(rawTarget) as Map<Key, ResultValue>\n\tconst keyEffects = new Map<Key, ScopedCallback>()\n\n\tfunction disposeKey(key: Key) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tstopEffect()\n\t\t\tkeyEffects.delete(key)\n\t\t\ttarget.delete(key)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupKeys = effect(function projectMapEffect({ ascend }) {\n\t\tconst keys = new Set<Key>()\n\t\tfor (const key of observedSource.keys()) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function projectMapKeyEffect() {\n\t\t\t\t\tconst previous = untracked(() => target.get(key))\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey,\n\t\t\t\t\t\tsource: observedSource,\n\t\t\t\t\t\tget: () => observedSource.get(key) as Value,\n\t\t\t\t\t\tset: (value: Value) => {\n\t\t\t\t\t\t\tobservedSource.set(key, value)\n\t\t\t\t\t\t\treturn true\n\t\t\t\t\t\t},\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<Value, Key, Map<Key, Value>, Map<Key, ResultValue>>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\ttarget.set(key, produced)\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${String(key)}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource: observedSource,\n\t\t\t\t\tkey,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn makeCleanup(target, keyEffects, () => cleanupKeys(), {\n\t\tsource: observedSource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\ntype ProjectOverload = {\n\t<SourceValue, ResultValue>(\n\t\tsource: readonly SourceValue[],\n\t\tapply: ProjectCallback<SourceValue, number, ResultValue[], readonly SourceValue[], ResultValue>\n\t): ProjectResult<ResultValue[]>\n\t<Key extends PropertyKey, SourceValue, ResultValue>(\n\t\tsource: Register<SourceValue, Key>,\n\t\tapply: ProjectCallback<\n\t\t\tSourceValue,\n\t\t\tKey,\n\t\t\tMap<Key, ResultValue>,\n\t\t\tRegister<SourceValue, Key>,\n\t\t\tResultValue\n\t\t>\n\t): ProjectResult<Map<Key, ResultValue>>\n\t<Source extends Record<PropertyKey, any>, ResultValue>(\n\t\tsource: Source,\n\t\tapply: ProjectCallback<\n\t\t\tSource[keyof Source],\n\t\t\tkeyof Source,\n\t\t\tRecord<keyof Source, ResultValue>,\n\t\t\tSource,\n\t\t\tResultValue\n\t\t>\n\t): ProjectResult<Record<keyof Source, ResultValue>>\n\t<Key, Value, ResultValue>(\n\t\tsource: Map<Key, Value>,\n\t\tapply: ProjectCallback<Value, Key, Map<Key, ResultValue>, Map<Key, Value>, ResultValue>\n\t): ProjectResult<Map<Key, ResultValue>>\n\tarray: typeof projectArray\n\tregister: typeof projectRegister\n\trecord: typeof projectRecord\n\tmap: typeof projectMap\n}\n\nfunction projectCore(source: any, apply: any): ProjectResult<any> {\n\tif (Array.isArray(source)) return projectArray(source, apply)\n\tif (source instanceof Map) return projectMap(source, apply)\n\tif (source instanceof Register) return projectRegister(source, apply)\n\tif (source && (source.constructor === Object || source.constructor === undefined))\n\t\treturn projectRecord(source, apply)\n\tthrow new Error('Unsupported source type')\n}\n\nexport const project: ProjectOverload = Object.assign(projectCore, {\n\tarray: projectArray,\n\tregister: projectRegister,\n\trecord: projectRecord,\n\tmap: projectMap,\n})\n","import { ReflectGet, ReflectSet } from '../utils'\nimport { touched1 } from './change'\nimport { effect } from './effects'\nimport { cleanedBy, cleanup } from './interface'\nimport { reactive } from './proxy'\nimport { type ScopedCallback } 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) => ScopedCallback | 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\t/**\n\t * Cleanup function to dispose of all reactive bindings created by organized().\n\t * This is automatically called when the effect that created the organized binding is disposed.\n\t */\n\t[cleanup]: ScopedCallback\n}\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\tconst keyEffects = new Map<PropertyKey, ScopedCallback>()\n\n\tfunction disposeKey(key: PropertyKey) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tkeyEffects.delete(key)\n\t\t\tstopEffect()\n\t\t}\n\t}\n\n\tconst cleanupKeys = effect(function organizedKeysEffect({ ascend }) {\n\t\t//const keys = Reflect.ownKeys(observedSource) as PropertyKey[]\n\t\tconst keys = new Set<PropertyKey>()\n\t\tfor (const key in observedSource) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function organizedKeyEffect() {\n\t\t\t\t\tconst sourceKey = key as keyof Source\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey: sourceKey,\n\t\t\t\t\t\tget: () => ReflectGet(observedSource, sourceKey, observedSource),\n\t\t\t\t\t\tset: (value: Source[typeof sourceKey]) =>\n\t\t\t\t\t\t\tReflectSet(observedSource, sourceKey, value, observedSource),\n\t\t\t\t\t}\n\t\t\t\t\tObject.defineProperty(accessBase, 'value', {\n\t\t\t\t\t\tget: accessBase.get,\n\t\t\t\t\t\tset: accessBase.set,\n\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\tenumerable: true,\n\t\t\t\t\t})\n\t\t\t\t\treturn apply(accessBase as OrganizedAccess<Source, typeof sourceKey>, target)\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn cleanedBy(target, () => {\n\t\tcleanupKeys()\n\t\tfor (const key of Array.from(keyEffects.keys())) disposeKey(key)\n\t}) 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","import { touched, touched1 } from './change'\nimport { notifyPropertyChange } from './deep-touch'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './non-reactive'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\nimport { prototypeForwarding } from './types'\n\nconst native = Symbol('native')\n\n/**\n * Reactive wrapper around JavaScript's WeakMap class\n * Only tracks individual key operations, no size tracking (WeakMap limitation)\n */\nexport class ReactiveWeakMap<K extends object, V> {\n\treadonly [native]!: WeakMap<K, V>\n\treadonly content!: symbol\n\tconstructor(original: WeakMap<K, V>) {\n\t\tObject.defineProperties(this, {\n\t\t\t[native]: { value: original },\n\t\t\t[prototypeForwarding]: { value: original },\n\t\t\tcontent: { value: Symbol('WeakMapContent') },\n\t\t\t[Symbol.toStringTag]: { value: 'ReactiveWeakMap' },\n\t\t})\n\t}\n\n\t// Implement WeakMap interface methods with reactivity\n\tdelete(key: K): boolean {\n\t\tconst hadKey = this[native].has(key)\n\t\tconst result = this[native].delete(key)\n\n\t\tif (hadKey) touched1(this.content, { type: 'del', prop: key }, key)\n\n\t\treturn result\n\t}\n\n\tget(key: K): V | undefined {\n\t\tdependant(this.content, key)\n\t\treturn reactive(this[native].get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(this.content, key)\n\t\treturn this[native].has(key)\n\t}\n\n\tset(key: K, value: V): this {\n\t\tconst hadKey = this[native].has(key)\n\t\tconst oldValue = this[native].get(key)\n\t\tconst reactiveValue = reactive(value)\n\t\tthis[native].set(key, reactiveValue)\n\n\t\tif (!hadKey || oldValue !== reactiveValue) {\n\t\t\tnotifyPropertyChange(this.content, 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 class ReactiveMap<K, V> {\n\treadonly [native]!: Map<K, V>\n\treadonly content!: symbol\n\n\tconstructor(original: Map<K, V>) {\n\t\tObject.defineProperties(this, {\n\t\t\t[native]: { value: original },\n\t\t\t[prototypeForwarding]: { value: original },\n\t\t\tcontent: { value: Symbol('MapContent') },\n\t\t\t[Symbol.toStringTag]: { value: 'ReactiveMap' },\n\t\t})\n\t}\n\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 this[native].size\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this[native].size > 0\n\t\tthis[native].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\ttouched1(this, evolution, 'size')\n\t\t\ttouched(this.content, evolution)\n\t\t}\n\t}\n\n\tentries(): Generator<[K, V]> {\n\t\tdependant(this.content)\n\t\treturn makeReactiveEntriesIterator(this[native].entries())\n\t}\n\n\tforEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {\n\t\tdependant(this.content)\n\t\tthis[native].forEach(callbackfn, thisArg)\n\t}\n\n\tkeys(): MapIterator<K> {\n\t\tdependant(this.content)\n\t\treturn this[native].keys()\n\t}\n\n\tvalues(): Generator<V> {\n\t\tdependant(this.content)\n\t\treturn makeReactiveIterator(this[native].values())\n\t}\n\n\t[Symbol.iterator](): Iterator<[K, V]> {\n\t\tdependant(this.content)\n\t\tconst nativeIterator = this[native][Symbol.iterator]()\n\t\treturn {\n\t\t\tnext() {\n\t\t\t\tconst result = nativeIterator.next()\n\t\t\t\tif (result.done) {\n\t\t\t\t\treturn result\n\t\t\t\t}\n\t\t\t\treturn {\n\t\t\t\t\tvalue: [result.value[0], reactive(result.value[1])],\n\t\t\t\t\tdone: false,\n\t\t\t\t}\n\t\t\t},\n\t\t}\n\t}\n\n\t// Implement Map methods with reactivity\n\tdelete(key: K): boolean {\n\t\tconst hadKey = this[native].has(key)\n\t\tconst result = this[native].delete(key)\n\n\t\tif (hadKey) {\n\t\t\tconst evolution = { type: 'del', prop: key } as const\n\t\t\ttouched1(this.content, evolution, key)\n\t\t\ttouched1(this, evolution, 'size')\n\t\t}\n\n\t\treturn result\n\t}\n\n\tget(key: K): V | undefined {\n\t\tdependant(this.content, key)\n\t\treturn reactive(this[native].get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(this.content, key)\n\t\treturn this[native].has(key)\n\t}\n\n\tset(key: K, value: V): this {\n\t\tconst hadKey = this[native].has(key)\n\t\tconst oldValue = this[native].get(key)\n\t\tconst reactiveValue = reactive(value)\n\t\tthis[native].set(key, reactiveValue)\n\n\t\tif (!hadKey || oldValue !== reactiveValue) {\n\t\t\tnotifyPropertyChange(this.content, key, oldValue, reactiveValue, hadKey)\n\t\t\t// Also notify size change for Map (WeakMap doesn't track size)\n\t\t\tconst evolution = { type: hadKey ? 'set' : 'add', prop: key } as const\n\t\t\ttouched1(this, evolution, 'size')\n\t\t}\n\n\t\treturn this\n\t}\n}\n","import { touched, touched1 } from './change'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './non-reactive'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\nimport { prototypeForwarding } from './types'\n\nconst native = Symbol('native')\n\n/**\n * Reactive wrapper around JavaScript's WeakSet class\n * Only tracks individual value operations, no size tracking (WeakSet limitation)\n */\nexport class ReactiveWeakSet<T extends object> {\n\treadonly [native]!: WeakSet<T>\n\treadonly content!: symbol\n\n\tconstructor(original: WeakSet<T>) {\n\t\tObject.defineProperties(this, {\n\t\t\t[native]: { value: original },\n\t\t\t[prototypeForwarding]: { value: original },\n\t\t\tcontent: { value: Symbol('WeakSetContent') },\n\t\t\t[Symbol.toStringTag]: { value: 'ReactiveWeakSet' },\n\t\t})\n\t}\n\n\tadd(value: T): this {\n\t\tconst had = this[native].has(value)\n\t\tthis[native].add(value)\n\t\tif (!had) {\n\t\t\t// touch the specific value and the collection view\n\t\t\ttouched1(this.content, { 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[native].has(value)\n\t\tconst res = this[native].delete(value)\n\t\tif (had) touched1(this.content, { type: 'del', prop: value }, value)\n\t\treturn res\n\t}\n\n\thas(value: T): boolean {\n\t\tdependant(this.content, value)\n\t\treturn this[native].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 class ReactiveSet<T> {\n\treadonly [native]!: Set<T>\n\treadonly content!: symbol\n\tconstructor(original: Set<T>) {\n\t\tObject.defineProperties(this, {\n\t\t\t[native]: { value: original },\n\t\t\t[prototypeForwarding]: { value: original },\n\t\t\tcontent: { value: Symbol('SetContent') },\n\t\t\t[Symbol.toStringTag]: { value: 'ReactiveSet' },\n\t\t})\n\t}\n\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[native].size\n\t}\n\n\tadd(value: T): this {\n\t\tconst had = this[native].has(value)\n\t\tconst reactiveValue = reactive(value)\n\t\tthis[native].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\ttouched1(this.content, evolution, reactiveValue)\n\t\t\ttouched1(this, evolution, 'size')\n\t\t}\n\t\treturn this\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this[native].size > 0\n\t\tthis[native].clear()\n\t\tif (hadEntries) {\n\t\t\tconst evolution = { type: 'bunch', method: 'clear' } as const\n\t\t\ttouched1(this, evolution, 'size')\n\t\t\ttouched(this.content, evolution)\n\t\t}\n\t}\n\n\tdelete(value: T): boolean {\n\t\tconst had = this[native].has(value)\n\t\tconst res = this[native].delete(value)\n\t\tif (had) {\n\t\t\tconst evolution = { type: 'del', prop: value } as const\n\t\t\ttouched1(this.content, evolution, value)\n\t\t\ttouched1(this, evolution, 'size')\n\t\t}\n\t\treturn res\n\t}\n\n\thas(value: T): boolean {\n\t\tdependant(this.content, value)\n\t\treturn this[native].has(value)\n\t}\n\n\tentries(): Generator<[T, T]> {\n\t\tdependant(this.content)\n\t\treturn makeReactiveEntriesIterator(this[native].entries())\n\t}\n\n\tforEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void {\n\t\tdependant(this.content)\n\t\tthis[native].forEach(callbackfn, thisArg)\n\t}\n\n\tkeys(): Generator<T> {\n\t\tdependant(this.content)\n\t\treturn makeReactiveIterator(this[native].keys())\n\t}\n\n\tvalues(): Generator<T> {\n\t\tdependant(this.content)\n\t\treturn makeReactiveIterator(this[native].values())\n\t}\n\n\t[Symbol.iterator](): Iterator<T> {\n\t\tdependant(this.content)\n\t\tconst nativeIterator = this[native][Symbol.iterator]()\n\t\treturn {\n\t\t\tnext() {\n\t\t\t\tconst result = nativeIterator.next()\n\t\t\t\tif (result.done) {\n\t\t\t\t\treturn result\n\t\t\t\t}\n\t\t\t\treturn { value: reactive(result.value), done: false }\n\t\t\t},\n\t\t}\n\t}\n}\n","export { getState, touched, touched1 } from './change'\nexport type { ReactivityGraph } from './debug'\nexport {\n\tbuildReactivityGraph,\n\tenableDevTools,\n\tisDevtoolsEnabled,\n\tregisterEffectForDebug,\n\tregisterObjectForDebug,\n\tsetEffectName,\n\tsetObjectName,\n} from './debug'\nexport { deepWatch } from './deep-watch'\nexport {\n\taddBatchCleanup,\n\tatomic,\n\tbatch, // TODO: Batch is now exported for testing purposes, though it shouldn't be - modify the tests to go through `atomic`\n\tbiDi,\n\tdefer,\n\teffect,\n\tgetActivationLog,\n\tgetActiveEffect,\n\troot,\n\ttrackEffect,\n\tuntracked,\n} from './effects'\nexport { cleanedBy, cleanup, derived, unreactive, watch } from './interface'\nexport { mapped, ReadOnlyError, reduced } from './mapped'\nexport { type Memoizable, memoize } from './memoize'\nexport { immutables, isNonReactive, registerNativeReactivity } from './non-reactive'\nexport { getActiveProjection, project } from './project'\nexport { isReactive, ReactiveBase, reactive, unwrap } from './proxy'\nexport { organize, organized } from './record'\nexport { Register, register } from './register'\nexport {\n\ttype DependencyAccess,\n\ttype DependencyFunction,\n\ttype Evolution,\n\toptions as reactiveOptions,\n\tReactiveError,\n\ttype ScopedCallback,\n} from './types'\nexport { isZoneEnabled, setZoneEnabled } from './zone'\n\nimport { ReactiveArray } from './array'\nimport {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n} from './deep-watch'\nimport { ReactiveMap, ReactiveWeakMap } from './map'\nimport { nonReactiveObjects, registerNativeReactivity } from './non-reactive-state'\nimport { objectToProxy, proxyToObject } from './proxy'\nimport { ReactiveSet, ReactiveWeakSet } from './set'\nimport { effectToReactiveObjects, watchers } from './registry'\n\n// Register native collection types to use specialized reactive wrappers\nregisterNativeReactivity(WeakMap, ReactiveWeakMap)\nregisterNativeReactivity(Map, ReactiveMap)\nregisterNativeReactivity(WeakSet, ReactiveWeakSet)\nregisterNativeReactivity(Set, ReactiveSet)\nregisterNativeReactivity(Array, ReactiveArray)\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\tnonReactiveObjects,\n}\n","import { decorator, type GenericClassDecorator } from './decorator'\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 function describe(descriptor: {\n\tenumerable?: boolean\n\tconfigurable?: boolean // Not modifiable once the property has been defined ?\n\twritable?: boolean\n}) {\n\treturn <T>(...properties: (keyof T)[]): GenericClassDecorator<T> =>\n\t\t(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\tObject.defineProperty(this, key, {\n\t\t\t\t\t\t\t...Object.getOwnPropertyDescriptor(this, key),\n\t\t\t\t\t\t\t...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\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\t// biome-ignore lint/suspicious/noConsole: To be overridden\n\t\t\tconsole.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 './decorator'\nexport * from './destroyable'\nexport * from './eventful'\nexport * from './indexable'\nexport * from './iterableWeak'\nexport * from './mixins'\nexport * from './reactive'\nexport * from './std-decorators'\nexport * from './utils'\n\nimport pkg from '../package.json'\nconst { version } = pkg\n\n// Singleton verification\nconst GLOBAL_MUTTS_KEY = '__MUTTS_INSTANCE__'\nconst globalScope = \n\t(typeof globalThis !== 'undefined' ? globalThis : \n\t(typeof window !== 'undefined' ? window : \n\t(typeof global !== 'undefined' ? global : false))) as any\nif(globalScope) {\n\t// Detect the source of this instance safely across different environments\n\tlet source = 'mutts/index'\n\ttry {\n\t\t// @ts-ignore\n\t\tif (typeof __filename !== 'undefined') source = __filename\n\t\t// @ts-ignore\n\t\telse {\n\t\t\t// Using eval to avoid SyntaxError in CJS environments where import.meta is not allowed\n\t\t\tconst meta = eval('import.meta')\n\t\t\tif (meta && meta.url) source = meta.url\n\t\t}\n\t} catch (e) {\n\t\t// Fallback for environments where neither is available or accessible\n\t}\n\n\tconst currentSourceInfo = {\n\t\tversion,\n\t\tsource,\n\t\ttimestamp: Date.now()\n\t}\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`Existing instance: ${JSON.stringify(existing, null, 2)}\\n` +\n\t\t\t`New instance: ${JSON.stringify(currentSourceInfo, null, 2)}\\n` +\n\t\t\t`This usually happens when 'mutts' is both installed as a dependency and bundled, ` +\n\t\t\t`or when different versions are loaded. ` +\n\t\t\t`Please check your build configuration (aliases, externals) to ensure a single source of truth.`\n\t\t)\n\t}\n\n\tglobalScope[GLOBAL_MUTTS_KEY] = currentSourceInfo\n}\n"],"names":["nativeReactive","Symbol","nonReactiveMark","unreactiveProperties","prototypeForwarding","allProps","projectionInfo","stopped","cleanup","rootFunction","ReactiveErrorCode","ReactiveError","Error","constructor","message","debugInfo","super","this","name","options","enter","_effect","leave","chain","_targets","_caller","beginChain","endChain","garbageCollected","_fn","touched","_obj","_evolution","_props","_deps","skipRunningEffect","_runningChain","maxEffectChain","maxTriggerPerBatch","maxEffectReaction","onMemoizationDiscrepancy","undefined","cycleHandling","isVerificationRun","maxDeepWatchDepth","instanceMembers","ignoreAccessors","recursiveTouching","asyncMode","warn","args","introspection","enableHistory","historySize","zones","setTimeout","setInterval","requestAnimationFrame","queueMicrotask","zip","length","minLength","Math","min","map","arr","result","i","tuple","push","arrayEquals","a","b","Array","isArray","nativeConstructors","Set","Object","Date","Function","Map","WeakMap","WeakSet","Promise","TypeError","ReferenceError","SyntaxError","RangeError","URIError","EvalError","Reflect","Proxy","RegExp","String","Number","Boolean","isConstructor","fn","has","toString","startsWith","renamed","fct","defineProperties","value","ReflectGet","obj","prop","receiver","Node","get","ReflectSet","set","defineProperty","configurable","writable","enumerable","isOwnAccessor","opd","getOwnPropertyDescriptor","deepCompare","cache","getPrototypeOf","compared","add","match","getTime","size","val","found","bVal","key","foundMatch","bKey","keysA","keys","keysB","prototype","hasOwnProperty","call","DecoratorError","legacyDecorator","description","target","propertyKey","descriptor","class","includes","newGetter","getter","newSetter","setter","newMethod","method","default","modernDecorator","context","kind","rv","detectDecoratorMode","_target","contextOrKey","_descriptor","decorator","modern","legacy","fr","FinalizationRegistry","f","destructor","allocatedValues","DestructionError","msg","destroyedHandler","toStringTag","throw","Destroyable","base","destructorObj","_a","destroy","destructors","unregister","delete","setPrototypeOf","getOwnPropertyNames","isDestroyable","allocated","myDestructor","destruction","register","original","callOnGC","cb","called","forward","Eventful","_Eventful_events","_Eventful_hooks","hook","__classPrivateFieldGet","splice","indexOf","on","eventOrEvents","e","callbacks","off","filter","c","emit","event","apply","getAt","setAt","Indexable","accessor","index","getLength","numProp","isNaN","setLength","forwardArray","ArrayReadForward","iterator","callbackfn","thisArg","predicate","reduce","initialValue","reduceRight","forEach","find","findIndex","findLast","findLastIndex","searchElement","fromIndex","lastIndexOf","slice","start","end","concat","items","every","some","join","separator","values","entries","toLocaleString","locales","at","flat","depth","flatMap","callback","toReversed","reverse","toSorted","compareFn","sort","toSpliced","deleteCount","with","unscopables","IterableWeakMap","uuids","refs","registry","uuid","k","v","createIterator","keyRef","deref","clear","crypto","randomUUID","WeakRef","_value","_key","IterableWeakSet","_b","union","other","others","that","intersection","difference","symmetricDifference","isSubsetOf","isSupersetOf","isDisjointFrom","mixin","mixinFunction","unwrapFunction","mixinCache","MixedBase","_thisArg","baseClass","cached","usedBase","ProxiedBaseClass","originalPrototype","proxiedPrototype","mixedClass","effectToReactiveObjects","watchers","effectChildren","effectParent","reverseRoots","markWithRoot","root","existingRef","existing","rootName","existingName","fnName","getRoot","trackingDisabledEffects","globalTrackingDisabled","setGlobalTrackingDisabled","EXTERNAL_SOURCE","devtoolsEnabled","debugEffectRegistry","debugObjectRegistry","effectNames","objectNames","effectCounter","objectCounter","triggerGraph","ensureEffectName","effect","trim","ensureObjectName","ctorName","describeProp","objectName","addEffectToRegistry","deps","documentObject","dbRegisterObject","ensureParentChains","effects","queue","from","parent","ensureTriggerContainers","source","targetMap","ensureTriggerRecord","label","evolution","labelMap","record","object","count","lastTriggered","now","setEffectName","setObjectName","registerEffectForDebug","registerObjectForDebug","recordTriggerLink","addToMutationHistory","getTriggerChain","limit","current","foundSource","foundReason","search","lastTime","buildEffectNodes","allEffects","nodes","nodeByEffect","ordered","node","id","type","debugName","depthCache","computeDepth","parentNode","parentId","buildReactivityGraph","edges","nodeIds","effectNodes","externalId","effectId","objId","targetEffect","targetId","sourceId","meta","generatedAt","enableDevTools","window","__MUTTS_DEVTOOLS__","getGraph","registerEffect","registerObject","isDevtoolsEnabled","mutationHistory","mutationCounter","timestamp","shift","stack","captureEffectStack","isRunning","rootEffect","rootIndex","visited","ancestorChain","currentRoot","chainFromAncestor","unshift","stackFromDescendant","withEffectStack","snapshot","previousStack","assignStack","getActiveEffect","withEffect","objectToProxy","proxyToObject","storeProxyRelationship","proxy","getExistingProxy","trackProxyObject","unwrap","isReactive","getTrackingDisabled","active","setTrackingDisabled","dependant","currentActiveEffect","registerDependency","objectWatchers","effectObjects","zoneHooked","originalPromiseThen","then","originalPromiseCatch","catch","originalPromiseFinally","finally","originalSetTimeout","globalThis","originalSetInterval","originalRequestAnimationFrame","originalQueueMicrotask","batchFn","activationRegistry","ensureZoneHooked","batch","hookZone","onFulfilled","onRejected","capturedStack","wrapCallback","onFinally","wrappedSetTimeout","delay","assign","wrappedSetInterval","execute","setZoneEnabled","enabled","isZoneEnabled","findCycleInChain","roots","seen","formatRoots","names","r","activationLog","getActivationLog","recordActivation","effectData","objData","pop","effectName","code","MaxReactionExceeded","trackEffect","onTouch","activeEffect","effectTrackers","opaqueEffects","effectTriggers","effectTriggeredBy","causesClosure","consequencesClosure","effectCreationStacks","getOrCreateClosure","closure","addGraphEdge","callerRoot","targetRoot","triggers","newTriggers","triggeredBy","uConsequences","vCauses","uCausesSet","x","vConsequencesSet","y","xConsequences","hasPathExcluding","exclude","next","cleanupEffectFromGraph","rootCauses","rootConsequences","sourceRoot","causeRoot","causeConsequences","consequence","consequenceRoot","consequenceCauses","cause","yCauses","batchQueue","hasBatched","all","batchCleanups","computeAllInDegrees","activeRoot","inDegrees","inDegree","causes","decrementInDegreesForExecuted","executedRoot","consequences","currentDegree","findPath","startRoot","endRoot","path","newPath","getCyclePathForEdge","wouldCreateCycle","targetConsequences","addToBatch","caller","immediate","cleanupFn","cleanupSymbol","cyclePath","cycleMessage","causalChain","creationStack","CycleDetected","cycle","details","addBatchCleanup","defer","getCyclePath","recursionStack","findCycle","cycleStart","executeNext","effectuatedRoots","nextEffect","nextRoot","consequenceConsequences","firstEffect","firstRoot","firstEffect2","firstRoot2","firstReturn","trace","queued","MaxDepthExceeded","queuedCount","cleanups","atomic","atomicEffect","effectOptions","cleanStack","split","parentsForAscend","tracked","runEffect","ascend","effectStopped","hasReacted","runningPromise","cancelPrevious","prevCleanup","reactionCleanup","reaction","originalPromise","cancelReject","cancelPromise","_","reject","cancelError","race","reactiveObj","children","childCleanup","opaque","stopEffect","augmentedRv","callIfCollected","subEffectCleanup","untracked","wasTrackingDisabled","biDi","received","objectParents","objectsWithDeepWatchers","deepWatchers","effectToDeepWatchedObjects","addBackReference","child","parents","removeBackReference","entry","needsBackReferences","hasParentWithDeepWatchers","bubbleUpChange","changedObject","parentDeepWatchers","watcher","states","addState","state","getState","collectEffects","keyChains","sourceEffect","runningChain","trackers","tracker","touched1","props","touchedOpaque","nonReactiveObjects","immutables","absent","markNonReactive","o","nonReactiveClass","cls","isNonReactive","registerNativeReactivity","originalClass","reactiveClass","isObject","isObjectLike","getPrototypeToken","shouldRecurseTouch","oldValue","newValue","notifyPropertyChange","targetObj","hadProperty","origin","dispatchNotifications","recursiveTouch","hasVisitedPair","oldObj","newObj","mapped","collectObjectKeys","ownKeys","proto","hasOwn","notifications","diffArrayElements","diffObjectProperties","oldArray","newArray","_visited","local","oldLength","newLength","max","hasOld","hasNew","oldEntry","newEntry","is","oldKeys","newKeys","hasAncestorInSet","allowedSet","combinedEffects","allowedEffects","originWatchers","originEffects","currentEffects","propsArray","filteredEffects","document","Element","HTMLElement","EventTarget","hasReentry","reactiveHandlers","unwrappedObj","hasProp","isOwnProp","isInheritedAccess","shouldIgnoreAccessor","reactiveObject","reactiveValue","unwrappedReceiver","isArrayCase","oldVal","deleteProperty","reactiveClasses","ReactiveBase","reactive","anyTarget","proxied","Reactive","deepWatch","wrappedCallback","traverseAndTrack","unsetYet","watch","changed","watchCallBack","watchObject","deep","myParentEffect","deepCleanup","cbCleanup","access","deepNonReactive","unreactiveApplication","arg1","arg","unreactive","cleanedBy","derived","compute","makeReactiveIterator","done","makeReactiveEntriesIterator","native","ReactiveBaseArray","actualIndex","nativeIterator","unwrappedSearch","predicateOrElement","array","item","range","ReactiveArray","added","native$2","localeCompare","fill","copyWithin","ReadOnlyError","ReactiveReadOnlyArrayClass","_items","_start","_deleteCount","_compareFn","_end","ReactiveReadOnlyArray","inputs","resize","resultReactive","input","cleanupLength","resultLength","toCleanup","reduced","cleanupFactor","factor","memoizedRegistry","wrapperRegistry","getBranch","tree","branches","branch","memoizeFunction","fnRoot","cacheRoot","memoized","localArgs","wasVerification","fresh","memoize","wrapper","getRegisterBase","RegisterBase","toArray","RegisterClass","_classSuper","_classThis","_RegisterClass_keyFn","_RegisterClass_keys","_RegisterClass_values","_RegisterClass_usage","_RegisterClass_valueInfo","_RegisterClass_keyEffects","_RegisterClass_ascend","_RegisterClass_instances","keyFn","initial","ascendGet","__classPrivateFieldSet","ensureKey","info","stop","nextKey","assertValidKey","previousKey","_RegisterClass_rekeyValue","setKeyValue","cleanupValue","disposeKeyEffects","incrementUsage","decrementUsage","normalizeIndex","allowEnd","resolved","assignAt","oldKey","insertKeyValue","rebuildFrom","newKey","existingValue","existingCount","updatedInfo","normalized","removeAt","normalizedStart","maxDeletions","actualDelete","keysToInsert","removedKeys","removedValues","remove","indexOfKey","keep","decisions","shouldKeep","hasKey","mapKeys","update","upsert","insert","self","fwdCompareFn","__esDecorate","_classDescriptor","_classDecorators","metadata","_metadata","_classExtraInitializers","__runInitializers","Register","effectProjectionMetadata","getActiveProjection","defineAccessValue","makeCleanup","effectMap","onDispose","projectArray","observedSource","indexEffects","disposeIndex","normalizeTargetLength","previous","accessBase","old","produced","projectRegister","rawTarget","keyEffects","disposeKey","cleanupKeys","projectRecord","observed","sourceKey","projectMap","projectCore","project","organized","baseTarget","organize","property","ReactiveWeakMap","native$1","content","hadKey","ReactiveMap","hadEntries","ReactiveWeakSet","had","res","ReactiveSet","profileInfo","syncCalculating","alreadyCalculating","isCached","describe","properties","Base","deprecated","debounce","_propertyKey","timeoutId","clearTimeout","throttle","lastCallTime","remainingTime","scheduledArgs","version","pkg","GLOBAL_MUTTS_KEY","globalScope","global","__filename","eval","url","currentSourceInfo","JSON","stringify"],"mappings":"kPA2HA,MAAMA,eAAiBC,OAAO,mBAKjBC,gBAAkBD,OAAO,gBAIzBE,qBAAuBF,OAAO,yBAI9BG,oBAAqCH,OAAO,wBAK5CI,SAAWJ,OAAO,aAKlBK,eAAiBL,OAAO,mBAKxBM,QAAUN,OAAO,WAKjBO,UAAUP,OAAO,WAcxBQ,aAAeR,OAAO,iBAK5B,IAAYS,mBAAZ,SAAYA,GACXA,EAAA,cAAA,iBACAA,EAAA,iBAAA,qBACAA,EAAA,oBAAA,wBACAA,EAAA,gBAAA,oBACAA,EAAA,cAAA,gBACA,CAND,CAAYA,oBAAAA,kBAAiB,CAAA,IA0CvB,MAAOC,sBAAsBC,MAClC,WAAAC,CACCC,EACOC,GAEPC,MAAMF,GAFCG,KAAAF,UAAAA,EAGPE,KAAKC,KAAO,eACb,EAOM,MAAMC,QAAU,CAKtBC,MAAQC,MAKRC,MAAQD,MAMRE,MAAO,CAACC,EAAsBC,OAK9BC,WAAaF,MAIbG,SAAU,OACVC,iBAAmBC,MAQnBC,QAAS,CAACC,EAAWC,EAAuBC,EAAgBC,OAM5DC,kBAAmB,CAACd,EAAyBe,OAM7CC,eAAgB,IAMhBC,mBAAoB,GAMpBC,kBAAmB,QAoBnBC,8BAA0BC,EAW1BC,cAAe,QAKfC,mBAAmB,EAMnBC,kBAAmB,IAMnBC,iBAAiB,EAKjBC,iBAAiB,EAOjBC,mBAAmB,EAiBnBC,UAAW,SAEXC,KAAM,IAAIC,OAKVC,cAAe,CAKdC,eAAe,EAKfC,YAAa,IAQdC,MAAO,CAKNC,YAAY,EAKZC,aAAa,EAKbC,uBAAuB,EAKvBC,gBAAgB,IChZZ,SAAUC,OAAyCT,GACxD,IAAKA,EAAKU,OAAQ,MAAO,GACzB,MAAMC,EAAYC,KAAKC,OAAOb,EAAKc,IAAKC,GAAQA,EAAIL,SAC9CM,EAA4B,GAElC,IAAK,IAAIC,EAAI,EAAGA,EAAIN,EAAWM,IAAK,CACnC,MAAMC,EAAQlB,EAAKc,IAAKC,GAAQA,EAAIE,IACpCD,EAAOG,KAAKD,EACb,CAEA,OAAOF,CACR,CAQM,SAAUI,YAAYC,EAAQC,GACnC,GAAID,IAAMC,EAAG,OAAO,EACpB,IAAKC,MAAMC,QAAQH,KAAOE,MAAMC,QAAQF,GAAI,OAAO,EACnD,GAAID,EAAEX,SAAWY,EAAEZ,OAAQ,OAAO,EAClC,IAAK,IAAIO,EAAI,EAAGA,EAAII,EAAEX,OAAQO,IAC7B,GAAII,EAAEJ,KAAOK,EAAEL,GAAI,OAAO,EAE3B,OAAO,CACR,CAEA,MAAMQ,mBAAqB,IAAIC,IAAc,CAC5CC,OACAJ,MACAK,KACAC,SACAH,IACAI,IACAC,QACAC,QACAC,QACAvE,MACAwE,UACAC,eACAC,YACAC,WACAC,SACAC,UACAC,QACAC,MACAC,OACAC,OACAC,OACAC,UAOK,SAAUC,cAAcC,GAC7B,OACCA,GACc,mBAAPA,IACNtB,mBAAmBuB,IAAID,IAAOA,EAAGE,aAAaC,WAAW,UAE5D,CAQM,SAAUC,QAA4BC,EAAQpF,GACnD,OAAO2D,OAAO0B,iBAAiBD,EAAK,CACnCpF,KAAM,CACLsF,MAAOtF,IAGV,UAEgBuF,WAAWC,EAAUC,EAAWC,GAE/C,MAAoB,oBAATC,MAAwBH,aAAeG,KAAcH,EAAYC,GACrEjB,QAAQoB,IAAIJ,EAAKC,EAAMC,EAC/B,CAEM,SAAUG,WAAWL,EAAUC,EAAWH,EAAYI,GAE3D,MAAoB,oBAATC,MAAwBH,aAAeG,MAC/CH,EAAYC,GAAQH,GACf,GAEFE,aAAe7B,QAAYa,QAAQQ,IAAIQ,EAAKC,GAS3CjB,QAAQsB,IAAIN,EAAKC,EAAMH,EAAOI,IARpC/B,OAAOoC,eAAeP,EAAKC,EAAM,CAChCH,QACAU,cAAc,EACdC,UAAU,EACVC,YAAY,KAEN,EAGT,CAEM,SAAUC,cAAcX,EAAUC,GACvC,MAAMW,EAAMzC,OAAO0C,yBAAyBb,EAAKC,GACjD,SAAUW,GAAKR,MAAOQ,GAAKN,IAC5B,CAWM,SAAUQ,YAAYjD,EAAQC,EAAQiD,EAAQ,IAAIzC,KAEvD,KAAOT,GAAkB,iBAANA,GAAkBnE,uBAAuBmE,GAC3DA,EAAKA,EAAUnE,qBAEhB,KAAOoE,GAAkB,iBAANA,GAAkBpE,uBAAuBoE,GAC3DA,EAAKA,EAAUpE,qBAGhB,GAAImE,IAAMC,EAAG,OAAO,EAEpB,GAAiB,iBAAND,GAAwB,OAANA,GAA2B,iBAANC,GAAwB,OAANA,EACnE,OAAOD,IAAMC,EAMd,GAFeK,OAAO6C,eAAenD,KACtBM,OAAO6C,eAAelD,GAGpC,OAAO,EAGR,IAAImD,EAAWF,EAAMX,IAAIvC,GACzB,GAAIoD,GAAUzB,IAAI1B,GAAI,OAAO,EAQ7B,GAPKmD,IACJA,EAAW,IAAI/C,IACf6C,EAAMT,IAAIzC,EAAGoD,IAEdA,EAASC,IAAIpD,GAGTC,MAAMC,QAAQH,GAAI,CACrB,IAAKE,MAAMC,QAAQF,GAElB,OAAO,EAER,GAAID,EAAEX,SAAWY,EAAEZ,OAElB,OAAO,EAER,IAAK,IAAIO,EAAI,EAAGA,EAAII,EAAEX,OAAQO,IAC7B,IAAKqD,YAAYjD,EAAEJ,GAAIK,EAAEL,GAAIsD,GAE5B,OAAO,EAGT,OAAO,CACR,CAEA,GAAIlD,aAAaO,KAAM,CACtB,MAAM+C,EAAQrD,aAAaM,MAAQP,EAAEuD,YAActD,EAAEsD,UAErD,OAAOD,CACR,CACA,GAAItD,aAAaqB,OAAQ,CACxB,MAAMiC,EAAQrD,aAAaoB,QAAUrB,EAAE4B,aAAe3B,EAAE2B,WAExD,OAAO0B,CACR,CACA,GAAItD,aAAaK,IAAK,CACrB,KAAMJ,aAAaI,MAAQL,EAAEwD,OAASvD,EAAEuD,KAEvC,OAAO,EAER,IAAK,MAAMC,KAAOzD,EAAG,CACpB,IAAI0D,GAAQ,EACZ,IAAK,MAAMC,KAAQ1D,EAClB,GAAIgD,YAAYQ,EAAKE,EAAMT,GAAQ,CAClCQ,GAAQ,EACR,KACD,CAED,IAAKA,EAEJ,OAAO,CAET,CACA,OAAO,CACR,CACA,GAAI1D,aAAaS,IAAK,CACrB,KAAMR,aAAaQ,MAAQT,EAAEwD,OAASvD,EAAEuD,KAEvC,OAAO,EAER,IAAK,MAAOI,EAAKH,KAAQzD,EACxB,GAAKC,EAAE0B,IAAIiC,IAaV,IAAKX,YAAYQ,EAAKxD,EAAEsC,IAAIqB,GAAMV,GAEjC,OAAO,MAfQ,CAChB,IAAIW,GAAa,EACjB,IAAK,MAAOC,EAAMH,KAAS1D,EAC1B,GAAIgD,YAAYW,EAAKE,EAAMZ,IAAUD,YAAYQ,EAAKE,EAAMT,GAAQ,CACnEW,GAAa,EACb,KACD,CAED,IAAKA,EAEJ,OAAO,CAET,CAOD,OAAO,CACR,CAGA,MAAME,EAAQzD,OAAO0D,KAAKhE,GACpBiE,EAAQ3D,OAAO0D,KAAK/D,GAC1B,GAAI8D,EAAM1E,SAAW4E,EAAM5E,OAE1B,OAAO,EAGR,IAAK,MAAMuE,KAAOG,EAAO,CACxB,IAAKzD,OAAO4D,UAAUC,eAAeC,KAAKnE,EAAG2D,GAE5C,OAAO,EAER,IAAKX,YAAYjD,EAAE4D,GAAM3D,EAAE2D,GAAMV,GAEhC,OAAO,CAET,CAEA,OAAO,CACR,CCzPM,MAAOmB,uBAAuBhI,MACnC,WAAAC,CAAYC,GACXE,MAAMF,GACNG,KAAKC,KAAO,oBACb,EA6HK,SAAU2H,gBAAyBC,GACxC,OAAO,SAENC,EACAC,EACAC,KACG/F,GAEH,QAAoBT,IAAhBuG,GACH,GAAIhD,cAAc+C,GAAS,CAC1B,KAAM,UAAWD,GAAc,MAAM,IAAIlI,MAAM,0CAC/C,OAAOkI,EAAYI,MAAOH,EAC3B,OACM,GAAsB,iBAAXA,GAAuB,CAAC,SAAU,UAAUI,gBAAgBH,GAAc,CAC3F,IAAKC,EAAY,MAAM,IAAIrI,MAAM,0CAC5B,GAA0B,iBAAfqI,GAA2B,iBAAkBA,EAAY,CACxE,GAAI,QAASA,GAAc,QAASA,EAAY,CAC/C,KAAM,WAAYH,MAAe,WAAYA,GAC5C,MAAM,IAAIlI,MAAM,qDACjB,GAAI,WAAYkI,EAAa,CAC5B,MAAMM,EAAYN,EAAYO,OAAQJ,EAAWnC,IAAYiC,EAAQC,GACjEI,IAAWH,EAAWnC,IAAMsC,EACjC,CACA,GAAI,WAAYN,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,OAAQN,EAAWjC,IAAY+B,EAAQC,GACjEM,IAAWL,EAAWjC,IAAMsC,EACjC,CACA,OAAOL,CACR,CAAO,GAAgC,mBAArBA,EAAWzC,MAAsB,CAClD,KAAM,WAAYsC,GAAc,MAAM,IAAIlI,MAAM,2CAChD,MAAM4I,EAAYV,EAAYW,OAAQR,EAAWzC,MAAOuC,EAAQC,GAEhE,OADIQ,IAAWP,EAAWzC,MAAQgD,GAC3BP,CACR,CACD,CACD,CACA,KAAM,YAAaH,GAClB,MAAM,IAAIlI,MAAM,kDACjB,OAAOkI,EAAYY,QAASf,KAAK1H,KAAM8H,EAAQC,EAAaC,KAAe/F,EAC5E,CACD,CAOM,SAAUyG,gBAAyBb,GAExC,OAAO,SAAqBC,EAAaa,KAA+B1G,GACvE,IAAK0G,GAASC,MAAgC,iBAAjBD,EAAQC,KAAmB,CACvD,KAAM,YAAaf,GAClB,MAAM,IAAIlI,MAAM,kDACjB,OAAOkI,EAAYY,QAASf,KAAK1H,KAAM8H,EAAQa,KAAY1G,EAC5D,CACA,OAAQ0G,EAAQC,MACf,IAAK,QACJ,KAAM,UAAWf,GAAc,MAAM,IAAIlI,MAAM,0CAC/C,OAAOkI,EAAYI,MAAOH,GAC3B,IAAK,QACJ,MAAM,IAAInI,MAAM,0CACjB,IAAK,SACJ,KAAM,WAAYkI,GAAc,MAAM,IAAIlI,MAAM,2CAChD,OAAOkI,EAAYO,OAAQN,EAAQA,EAAQa,EAAQ1I,MACpD,IAAK,SACJ,KAAM,WAAY4H,GAAc,MAAM,IAAIlI,MAAM,2CAChD,OAAOkI,EAAYS,OAAQR,EAAQA,EAAQa,EAAQ1I,MACpD,IAAK,SACJ,KAAM,WAAY4H,GAAc,MAAM,IAAIlI,MAAM,2CAChD,OAAOkI,EAAYW,OAAQV,EAAQA,EAAQa,EAAQ1I,MACpD,IAAK,WAAY,CAChB,KAAM,WAAY4H,MAAe,WAAYA,GAC5C,MAAM,IAAIlI,MAAM,qDACjB,MAAMkJ,EAAsD,CAAA,EAC5D,GAAI,WAAYhB,EAAa,CAC5B,MAAMM,EAAYN,EAAYO,OAAQN,EAAOjC,IAAKiC,EAAQa,EAAQ1I,MAC9DkI,IAAWU,EAAGhD,IAAMsC,EACzB,CACA,GAAI,WAAYN,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,OAAQR,EAAO/B,IAAK+B,EAAQa,EAAQ1I,MAC9DoI,IAAWQ,EAAG9C,IAAMsC,EACzB,CACA,OAAOQ,CACR,EAGF,CACD,CAMA,SAASC,oBACRC,EACAC,EACAC,GAIA,MACyB,iBAAjBD,GACU,OAAjBA,GAC6B,iBAAtBA,EAAaJ,KAEb,SAED,QACR,CAOO,MAAMM,UAAoCrB,IAChD,MAAMsB,EAAST,gBAAgBb,GACzBuB,EAASxB,gBAAgBC,GAC/B,MAAA,CAASC,EAAakB,KAAuB/G,IAE5B,WADH6G,oBAAoBhB,EAAQkB,EAAc/G,EAAK,IAEzDkH,EAAOrB,EAAQkB,KAAiB/G,GAChCmH,EAAOtB,EAAQkB,KAAiB/G,IChQ/BoH,KAAK,IAAIC,qBAAkCC,GAAMA,KAI1CC,WAAaxK,OAAO,cAIpByK,gBAAkBzK,OAAO,aAIhC,MAAO0K,yBAAyB/J,MACrC,YAAO,CAAiBgK,GACvB,MAAO,KACN,MAAM,IAAID,iBAAiBC,GAE7B,CACA,WAAA/J,CAAY+J,GACX5J,MAAM,wBAAwB4J,KAC9B3J,KAAKC,KAAO,sBACb,EAED,MAAM2J,iBAAmB,CACxB,CAAC5K,OAAO6K,aAAc,oBACtBhE,IAAK6D,iBAAiBI,MAAM,kCAC5B/D,IAAK2D,iBAAiBI,MAAM,mCA+EvB,SAAUC,YAKdC,EAAkCC,SASnC,OARID,GAAwB,mBAATA,IAClBC,EAAgBD,EAChBA,OAAOxI,GAEHwI,IACJA,EAAO,SAGRE,EAAO,cAA2BF,EAEjC,cAAOG,CAAQ1E,GACd,MAAM+D,EAAaU,EAAYE,YAAYvE,IAAIJ,GAC/C,IAAK+D,EAAY,OAAO,EACxBH,KAAGgB,WAAW5E,EAAIgE,kBAClBS,EAAYE,YAAYE,OAAO7E,GAC/B7B,OAAO2G,eAAe9E,EAAK,IAAIf,MAAM,CAAA,EAAIkF,mBAEzC,IAAK,MAAM1C,KAAOtD,OAAO4G,oBAAoB/E,UACpCA,EAAYyB,GAGrB,OADAsC,KACO,CACR,CACA,oBAAOiB,CAAchF,GACpB,OAAOyE,EAAYE,YAAYnF,IAAIQ,EACpC,CAIA,WAAA7F,IAAeqC,GACdlC,SAASkC,GACT,MAAMyI,EAAY,CAAA,EAClB1K,KAAKyJ,iBAAmBiB,EAExB,MAAMC,EAAeV,GAAeT,YAAcxJ,KAAKwJ,YACvD,IAAKmB,EACJ,MAAM,IAAIjB,iBAAiB,6BAE5B,SAASkB,IACRD,EAAaD,EACd,CACAR,EAAYE,YAAYrE,IAAI/F,KAAM4K,GAClCvB,KAAGwB,SAAS7K,KAAM4K,EAAaF,EAChC,GAlCgBR,EAAAE,YAAc,IAAIpG,QAmClCkG,CACF,CAOO,MAAMQ,UAAYxB,UAAU,CAClCZ,OAAM,CAACwC,EAAU/B,EAAShB,IAClB,SAAUxC,GAEhB,OADAvF,KAAKyJ,iBAAiB1B,GAAexC,EAC9BuF,EAASpD,KAAK1H,KAAMuF,EAC5B,IASI,SAAUwF,SAASC,GACxB,IAAIC,GAAS,EACb,MAAMC,EAAU,KACXD,IACJA,GAAS,EACTD,MAGD,OADA3B,KAAGwB,SAASK,EAASF,EAAIA,GAClBE,CACR,q9DCrLaC,SAAb,WAAAvL,GACUwL,iBAAArF,IAAA/F,KAAU,IAAI+D,KACdsH,gBAAAtF,IAAA/F,KAAS,GAkEnB,CAhEQ,IAAAsL,CACNN,GAMA,OADKO,uBAAAvL,KAAIqL,gBAAA,KAAQnD,SAAS8C,IAAKO,uBAAAvL,KAAIqL,gBAAA,KAAQjI,KAAK4H,GACzC,KACNO,uBAAAvL,KAAIqL,gBAAA,KAAQG,OAAOD,uBAAAvL,KAAIqL,gBAAA,KAAQI,QAAQT,GAAK,GAE9C,CAIO,EAAAU,CACNC,EACAX,GAEA,GAA6B,iBAAlBW,EACV,IAAK,MAAMC,KAAKhI,OAAO0D,KAAKqE,GAC3B3L,KAAK0L,GAAGE,EAAGD,EAAcC,SAEpB,QAAWpK,IAAPwJ,EAAkB,CAC5B,IAAIa,EAAYN,uBAAAvL,KAAIoL,iBAAA,KAASvF,IAAI8F,GAC5BE,IACJA,EAAY,GACZN,uBAAAvL,2BAAa+F,IAAI4F,EAAeE,IAEjCA,EAAUzI,KAAK4H,EAChB,CAEA,MAAO,IAAMhL,KAAK8L,IAAIH,EAAeX,EACtC,CAGO,GAAAc,CACNH,EACAX,GAEA,GAA6B,iBAAlBW,EACV,IAAK,MAAMC,KAAKhI,OAAO0D,KAAKqE,GAC3B3L,KAAK8L,IAAIF,EAAGD,EAAcC,SAErB,GAAIZ,QAAiC,CAC3C,MAAMa,EAAYN,uBAAAvL,KAAIoL,iBAAA,KAASvF,IAAI8F,GAC/BE,GACHN,uBAAAvL,2BAAa+F,IACZ4F,EACAE,EAAUE,OAAQC,GAAMA,IAAMhB,GAGjC,MAECO,uBAAAvL,KAAIoL,iBAAA,KAASd,OAAOqB,EAEtB,CACO,IAAAM,CACNC,KACGjK,GAEH,MAAM4J,EAAYN,uBAAAvL,KAAIoL,iBAAA,KAASvF,IAAIqG,GACnC,GAAIL,EAAW,IAAK,MAAMb,KAAMa,EAAWb,EAAGmB,MAAMnM,KAAMiC,GAC1D,IAAK,MAAM+I,KAAMO,uBAAAvL,KAAIqL,gBAAA,KAASL,EAAGtD,KAAK1H,KAAMkM,KAAUjK,EACvD,iECxEYmK,MAAQpN,OAAO,SAIfqN,MAAQrN,OAAO,SAwDtB,SAAUsN,UACftC,EACAuC,GAEIvC,GAAwB,mBAATA,IAClBuC,EAAWvC,EACXA,OAAOxI,GAEHwI,IAEJA,EAAO,SAEHuC,IACJA,EAAW,CACV,GAAA1G,CAAe2G,GACd,GAA2B,mBAAhBxM,KAAKoM,OACf,MAAM,IAAIzM,MAAM,+CAEjB,OAAOK,KAAKoM,OAAOI,EACpB,EACA,GAAAzG,CAAeyG,EAAejH,GAC7B,GAA2B,mBAAhBvF,KAAKqM,OACf,MAAM,IAAI1M,MAAM,sDAEjBK,KAAKqM,OAAOG,EAAOjH,EACpB,IAIF,MAAe+G,UAAmBtC,GAoDlC,OAhDApG,OAAO2G,eACN+B,EAAU9E,UACV,IAAI9C,MAAOsF,EAAcxC,UAAW,CAEnC,CAACxI,OAAO6K,aAAc,kBACtB,GAAAhE,CAAIiC,EAAQpC,EAAMC,GACjB,GAAID,KAAQoC,EAAQ,CACnB,MAAMM,EAASxE,OAAO0C,yBAAyBwB,EAAQpC,IAAOG,IAC9D,OAAOuC,EAASA,EAAOV,KAAK/B,GAAYmC,EAAOpC,EAChD,CACA,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqB6G,EAASE,UAAW,OAAOF,EAASE,UAAU/E,KAAK/B,GAC5E,MAAM+G,EAAU7H,OAAOa,GACvB,IAAKb,OAAO8H,MAAMD,GACjB,OAAOH,EAAS1G,IAAK6B,KAAK/B,EAAU+G,EAEtC,CAED,EACA,GAAA3G,CAAI+B,EAAQpC,EAAMH,EAAOI,GACxB,GAAID,KAAQoC,EAAQ,CACnB,MAAMQ,EAAS1E,OAAO0C,yBAAyBwB,EAAQpC,IAAOK,IAG9D,OAFIuC,EAAQA,EAAOZ,KAAK/B,EAAUJ,GAC7BuC,EAAOpC,GAAQH,GACb,CACR,CACA,GAAoB,iBAATG,EAAmB,CAC7B,GAAa,WAATA,GAAqB6G,EAASK,UAEjC,OADAL,EAASK,UAAUlF,KAAK/B,EAAUJ,IAC3B,EAER,MAAMmH,EAAU7H,OAAOa,GACvB,IAAKb,OAAO8H,MAAMD,GAAU,CAC3B,IAAKH,EAASxG,IAAK,MAAM,IAAIpG,MAAM,sDAEnC,OADA4M,EAASxG,IAAK2B,KAAK/B,EAAU+G,EAASnH,IAC/B,CACR,CACD,CAOA,OANA3B,OAAOoC,eAAeL,EAAUD,EAAM,CACrCH,QACAW,UAAU,EACVC,YAAY,EACZF,cAAc,KAER,CACR,KAGKqG,CACR,OAOaO,aAAe7N,OAAO,sBAStB8N,iBACZ,IAAeD,gBACd,MAAM,IAAIlN,MAAM,sCACjB,CAKA,UAAIgD,GACH,OAAO3C,KAAK6M,cAAclK,MAC3B,CAUA,CAAC3D,OAAO+N,YACP,OAAO/M,KAAK6M,cAAc7N,OAAO+N,WAClC,CAOA,GAAAhK,CAAOiK,EAAiEC,GACvE,OAAOjN,KAAK6M,cAAc9J,IAAIiK,EAAYC,EAC3C,CAUA,MAAAlB,CAAOmB,EAAsED,GAC5E,OAAOjN,KAAK6M,cAAcd,OAAOmB,EAAWD,EAC7C,CAgBA,MAAAE,CACCH,EAMAI,GAEA,YAAwB5L,IAAjB4L,EACJpN,KAAK6M,cAAcM,OAAOH,EAAYI,GACtCpN,KAAK6M,cAAcM,OAAOH,EAC9B,CAgBA,WAAAK,CACCL,EAMAI,GAEA,YAAwB5L,IAAjB4L,EACJpN,KAAK6M,cAAcQ,YAAYL,EAAYI,GAC3CpN,KAAK6M,cAAcQ,YAAYL,EACnC,CAKA,OAAAM,CAAQN,EAAoEC,GAC3EjN,KAAK6M,cAAcS,QAAQN,EAAYC,EACxC,CAaA,IAAAM,CACCL,EACAD,GAEA,OAAOjN,KAAK6M,cAAcU,KAAKL,EAAWD,EAC3C,CAKA,SAAAO,CACCN,EACAD,GAEA,OAAOjN,KAAK6M,cAAcW,UAAUN,EAAWD,EAChD,CAaA,QAAAQ,CACCP,EACAD,GAEA,OAAOjN,KAAK6M,cAAcY,SAASP,EAAWD,EAC/C,CAKA,aAAAS,CACCR,EACAD,GAEA,OAAOjN,KAAK6M,cAAca,cAAcR,EAAWD,EACpD,CAKA,QAAA/E,CAASyF,EAAkBC,GAC1B,OAAO5N,KAAK6M,cAAc3E,SAASyF,EAAeC,EACnD,CAKA,OAAAnC,CAAQkC,EAAkBC,GACzB,OAAO5N,KAAK6M,cAAcpB,QAAQkC,EAAeC,EAClD,CAKA,WAAAC,CAAYF,EAAkBC,GAC7B,OAAO5N,KAAK6M,cAAcgB,YAAYF,EAAeC,EACtD,CAKA,KAAAE,CAAMC,EAAgBC,GACrB,OAAOhO,KAAK6M,cAAciB,MAAMC,EAAOC,EACxC,CAOA,MAAAC,IAAUC,GACT,OAAOlO,KAAK6M,cAAcoB,UAAUC,EACrC,CAKA,KAAAC,CACCjB,EACAD,GAEA,OAAOjN,KAAK6M,cAAcsB,MAAMjB,EAAWD,EAC5C,CAKA,IAAAmB,CACClB,EACAD,GAEA,OAAOjN,KAAK6M,cAAcuB,KAAKlB,EAAWD,EAC3C,CAKA,IAAAoB,CAAKC,GACJ,OAAOtO,KAAK6M,cAAcwB,KAAKC,EAChC,CAKA,IAAAhH,GACC,OAAOtH,KAAK6M,cAAcvF,MAC3B,CAKA,MAAAiH,GACC,OAAOvO,KAAK6M,cAAc0B,QAC3B,CAKA,OAAAC,GACC,OAAOxO,KAAK6M,cAAc2B,SAC3B,CAKA,QAAAtJ,GACC,OAAOlF,KAAK6M,cAAc3H,UAC3B,CAKA,cAAAuJ,CACCC,EACAxO,GAEA,OAAOF,KAAK6M,cAAc4B,eAAeC,EAA8BxO,EACxE,CAKA,EAAAyO,CAAGnC,GACF,OAAOxM,KAAK6M,cAAc8B,GAAGnC,EAC9B,CAKA,IAAAoC,CAAKC,GACJ,OAAO7O,KAAK6M,cAAc+B,KAAKC,EAChC,CAMA,OAAAC,CACCC,EACA9B,GAEA,OAAOjN,KAAK6M,cAAciC,QAAQC,EAAiB9B,EACpD,CAKA,UAAA+B,GACC,OAAOhP,KAAK6M,cAAcmC,gBAAkB,IAAIhP,KAAK6M,eAAeoC,SACrE,CAKA,QAAAC,CAASC,GACR,OAAOnP,KAAK6M,cAAcqC,WAAWC,IAAc,IAAInP,KAAK6M,eAAeuC,KAAKD,EACjF,CAKA,SAAAE,CAAUtB,EAAeuB,KAAyBpB,GACjD,YAAoB1M,IAAhB8N,EAAkCtP,KAAK6M,cAAcwC,UAAUtB,GAC5D/N,KAAK6M,cAAcwC,UAAUtB,EAAOuB,KAAgBpB,EAC5D,CAKA,KAAK1B,EAAejH,GACnB,OAAOvF,KAAK6M,cAAc0C,KAAK/C,EAAOjH,EACvC,CACA,IAAKvG,OAAOwQ,eACX,OAAOxP,KAAK6M,cAAc7N,OAAOwQ,YAClC,kBC5dYC,gBAKZ,WAAA7P,CAAY4O,GAKX,GATOxO,KAAA0P,MAAQ,IAAI1L,QACZhE,KAAA2P,KAA0C,CAAA,EA8EzC3P,KAAAkK,IAA+B,kBAzEvClK,KAAK4P,SAAW,IAAItG,qBAAsBuG,WAClC7P,KAAK2P,KAAKE,KAEdrB,EAAS,IAAK,MAAOsB,EAAGC,KAAMvB,EAASxO,KAAK+F,IAAI+J,EAAGC,EACxD,CACQ,cAAAC,CAAkBhF,GACzB,MAAM2E,KAAEA,GAAS3P,KACjB,OAAO,YACN,IAAK,MAAM6P,KAAQjM,OAAO0D,KAAKqI,GAAO,CACrC,MAAOM,EAAQ1K,GAASoK,EAAKE,GACvB3I,EAAM+I,EAAOC,QACfhJ,QAAW8D,EAAG9D,EAAK3B,UACXoK,EAAKE,EAClB,CAEA,CARM,EASR,CACA,KAAAM,GAEC,IAAK,MAAMN,KAAQjM,OAAO0D,KAAKtH,KAAK2P,MAAO,CAC1C,MAAMzI,EAAMlH,KAAK2P,KAAKE,GAAM,GAAGK,QAC3BhJ,GAAKlH,KAAK4P,SAASvF,WAAWnD,EACnC,CACAlH,KAAK0P,MAAQ,IAAI1L,QACjBhE,KAAK2P,KAAO,CAAA,CACb,CACA,OAAOzI,GACN,MAAM2I,EAAO7P,KAAK0P,MAAM7J,IAAIqB,GAC5B,QAAK2I,WACE7P,KAAK2P,KAAKE,GACjB7P,KAAK0P,MAAMpF,OAAOpD,GAClBlH,KAAK4P,SAASvF,WAAWnD,IAClB,EACR,CACA,OAAAoG,CAAQN,EAAwDC,GAC/D,IAAK,MAAO6C,EAAGC,KAAM/P,KAAMgN,EAAWtF,KAAKuF,GAAWjN,KAAM+P,EAAGD,EAAG7C,GAAWjN,KAC9E,CACA,GAAA6F,CAAIqB,GACH,MAAM2I,EAAO7P,KAAK0P,MAAM7J,IAAIqB,GAC5B,GAAK2I,EACL,OAAO7P,KAAK2P,KAAKE,GAAM,EACxB,CACA,GAAA5K,CAAIiC,GACH,OAAOlH,KAAK0P,MAAMzK,IAAIiC,EACvB,CACA,GAAAnB,CAAImB,EAAQ3B,GACX,IAAIsK,EAAO7P,KAAK0P,MAAM7J,IAAIqB,GAU1B,OATI2I,EACH7P,KAAK2P,KAAKE,GAAM,GAAKtK,GAErBsK,EAAOO,OAAOC,aACdrQ,KAAK0P,MAAM3J,IAAImB,EAAK2I,GACpB7P,KAAK2P,KAAKE,GAAQ,CAAC,IAAIS,QAAQpJ,GAAM3B,GAErCvF,KAAK4P,SAAS/E,SAAS3D,EAAK2I,EAAM3I,IAE5BlH,IACR,CACA,QAAI8G,GACH,MAAO,IAAI9G,MAAM2C,MAClB,CACA,OAAA6L,GACC,OAAOxO,KAAKgQ,eAAe,CAAC9I,EAAK3B,IAAU,CAAC2B,EAAK3B,GAClD,CACA,IAAA+B,GACC,OAAOtH,KAAKgQ,eAAe,CAAC9I,EAAKqJ,IAAWrJ,EAC7C,CACA,MAAAqH,GACC,OAAOvO,KAAKgQ,eAAe,CAACQ,EAAMjL,IAAUA,EAC7C,CACA,CAACvG,OAAO+N,YACP,OAAO/M,KAAKwO,SACb,EACUtE,GAAAlL,OAAO6K,kBAOL4G,gBAKZ,WAAA7Q,CAAY4O,GAKX,GATOxO,KAAA0P,MAAQ,IAAI1L,QACZhE,KAAA2P,KAAmC,CAAA,EA0ElC3P,KAAA0Q,IAA+B,kBArEvC1Q,KAAK4P,SAAW,IAAItG,qBAAsBuG,WAClC7P,KAAK2P,KAAKE,KAEdrB,EAAS,IAAK,MAAMsB,KAAKtB,EAASxO,KAAK2G,IAAImJ,EAChD,CACQ,cAAAE,CAAkBhF,GACzB,MAAM2E,KAAEA,GAAS3P,KACjB,OAAO,YACN,IAAK,MAAM6P,KAAQjM,OAAO0D,KAAKqI,GAAO,CACrC,MAAMzI,EAAMyI,EAAKE,GAAMK,QACnBhJ,QAAW8D,EAAG9D,UACNyI,EAAKE,EAClB,CAEA,CAPM,EAQR,CAEA,KAAAM,GAEC,IAAK,MAAMN,KAAQjM,OAAO0D,KAAKtH,KAAK2P,MAAO,CAC1C,MAAMpK,EAAQvF,KAAK2P,KAAKE,GAAMK,QAC1B3K,GAAOvF,KAAK4P,SAASvF,WAAW9E,EACrC,CACAvF,KAAK0P,MAAQ,IAAI1L,QACjBhE,KAAK2P,KAAO,CAAA,CACb,CAEA,GAAAhJ,CAAIpB,GACH,IAAIsK,EAAO7P,KAAK0P,MAAM7J,IAAIN,GAQ1B,OAPKsK,IACJA,EAAOO,OAAOC,aACdrQ,KAAK0P,MAAM3J,IAAIR,EAAOsK,GACtB7P,KAAK2P,KAAKE,GAAQ,IAAIS,QAAQ/K,GAE9BvF,KAAK4P,SAAS/E,SAAStF,EAAOsK,EAAMtK,IAE9BvF,IACR,CACA,OAAOuF,GACN,MAAMsK,EAAO7P,KAAK0P,MAAM7J,IAAIN,GAC5B,QAAKsK,WACE7P,KAAK2P,KAAKE,GACjB7P,KAAK0P,MAAMpF,OAAO/E,GAClBvF,KAAK4P,SAASvF,WAAW9E,IAClB,EACR,CAEA,OAAA+H,CAAQN,EAAwDC,GAC/D,IAAK,MAAM1H,KAASvF,KAAMgN,EAAWtF,KAAKuF,GAAWjN,KAAMuF,EAAOA,EAAO0H,GAAWjN,KACrF,CAEA,GAAAiF,CAAIM,GACH,OAAOvF,KAAK0P,MAAMzK,IAAIM,EACvB,CACA,QAAIuB,GACH,MAAO,IAAI9G,MAAM2C,MAClB,CACA,OAAA6L,GACC,OAAOxO,KAAKgQ,eAAgB9I,GAAQ,CAACA,EAAKA,GAC3C,CACA,IAAAI,GACC,OAAOtH,KAAKgQ,eAAgB9I,GAAQA,EACrC,CACA,MAAAqH,GACC,OAAOvO,KAAKgQ,eAAgB9I,GAAQA,EACrC,CACA,CAAClI,OAAO+N,YACP,OAAO/M,KAAKsH,MACb,CAGA,KAAAqJ,CAASC,GACR,MAAMC,EAAS,CACd,CAAC7R,OAAO+N,UAAS,IACT6D,EAAMtJ,QAGTwJ,EAAO9Q,KACb,OAAO,IAAI2D,IACV,kBACQmN,EACP,IAAK,MAAMvL,KAASsL,EAAaC,EAAK7L,IAAiBM,WAAeA,EACtE,CAHD,GAKF,CACA,YAAAwL,CAAqBH,GACpB,MAAME,EAAO9Q,KACb,OAAO,IAAI2D,IACV,YACC,IAAK,MAAM4B,KAASuL,EAAUF,EAAM3L,IAAiBM,WAAsBA,EAC3E,CAFD,GAIF,CACA,UAAAyL,CAAcJ,GACb,MAAME,EAAO9Q,KACb,OAAO,IAAI2D,IACV,YACC,IAAK,MAAM4B,KAASuL,EAAWF,EAAM3L,IAAiBM,WAAkBA,EACxE,CAFD,GAIF,CACA,mBAAA0L,CAAuBL,GACtB,MAAMC,EAAS,CACd,CAAC7R,OAAO+N,UAAS,IACT6D,EAAMtJ,QAGTwJ,EAAO9Q,KACb,OAAO,IAAI2D,IACV,YACC,IAAK,MAAM4B,KAASuL,EAAWF,EAAM3L,IAAiBM,WAAsBA,GAC5E,IAAK,MAAMA,KAASsL,EAAaC,EAAK7L,IAAiBM,WAAsBA,EAC7E,CAHD,GAKF,CACA,UAAA2L,CAAWN,GACV,IAAK,MAAMrL,KAASvF,KAAM,IAAK4Q,EAAM3L,IAAIM,GAAQ,OAAO,EACxD,OAAO,CACR,CACA,YAAA4L,CAAaP,GACZ,MAAMC,EAAS,CACd,CAAC7R,OAAO+N,UAAS,IACT6D,EAAMtJ,QAGf,IAAK,MAAM/B,KAASsL,EAAQ,IAAK7Q,KAAKiF,IAAOM,GAAQ,OAAO,EAC5D,OAAO,CACR,CACA,cAAA6L,CAAeR,GACd,IAAK,MAAMrL,KAASvF,KAAM,GAAI4Q,EAAM3L,IAAIM,GAAQ,OAAO,EACvD,OAAO,CACR,ECxMK,SAAU8L,MACfC,EACAC,GAYA,MAAMC,EAAa,IAAIxN,QAGjByN,EAAYH,EAAc1N,QAIhC,OAHA4N,EAAWzL,IAAInC,OAAQ6N,GAGhB,IAAI/M,MAAM+M,EAAW,CAE3B,KAAAtF,CAAMpD,EAAS2I,EAAUzP,GACxB,GAAoB,IAAhBA,EAAKU,OACR,MAAM,IAAIhD,MAAM,+BAGjB,MAAMgS,EAAY1P,EAAK,GACvB,GAAyB,mBAAd0P,EACV,MAAM,IAAIhS,MAAM,yCAIjB,KACEoF,cAAc4M,IACbA,GAAkC,mBAAdA,GAA4BA,EAAUnK,WAE5D,MAAM,IAAI7H,MAAM,sCAIjB,MAAMiS,EAASJ,EAAW3L,IAAI8L,GAC9B,GAAIC,EACH,OAAOA,EAGR,IAAIC,EAAWF,EACf,GAAIJ,EAAgB,CAEnB,MAAMO,EAAmB,cAAcH,IAGjCI,EAAoBJ,EAAUnK,UAC9BwK,EAAmB,IAAItN,MAAMqN,EAAmB,CACrD,GAAAlM,CAAIiC,EAAQpC,EAAMC,GACjB,MAAMJ,EAAQC,WAAWsC,EAAQpC,EAAMC,GAIvC,MACkB,mBAAVJ,GACS,iBAATG,GACN,CAAC,cAAe,WAAY,WAAWwC,SAASxC,GAU3CH,EAPC,YAAwBtD,GAE9B,MAAM0G,EAAU4I,EAAevR,MAC/B,OAAOuF,EAAM4G,MAAMxD,EAAS1G,EAC7B,CAIF,IAID2B,OAAO2G,eAAeuH,EAAiBtK,UAAWwK,GAClDH,EAAWC,CACZ,CAGA,MAAMG,EAAaX,EAAcO,GAKjC,OAFAL,EAAWzL,IAAI4L,EAAWM,GAEnBA,CACR,GAEF,CD+CWvB,GAAA1R,OAAO6K,YEtKX,MAAMqI,wBAA0B,IAAIlO,QAG9BmO,SAAW,IAAInO,QAGfoO,eAAiB,IAAIpO,QAGrBqO,aAAe,IAAIrO,QAG1BsO,aAAe,IAAItO,QASnB,SAAUuO,aAAiCvN,EAAOwN,GAEvD,MAAMC,EAAcH,aAAazM,IAAI2M,GAC/BE,EAAWD,GAAavC,QAE9B,GAAIwC,GAAYA,IAAa1N,EAAI,CAChC,MAAM2N,EAAWH,EAAKvS,MAAQ,YACxB2S,EAAeF,EAASzS,MAAQ,YAChC4S,EAAS7N,EAAG/E,MAAQ,YAC1B,MAAM,IAAIN,MACT,kDAAkDgT,uCAA8CC,4BACxEC,iEAE1B,CAOA,OAHAP,aAAavM,IAAIyM,EAAM,IAAIlC,QAAQtL,IAG5BpB,OAAOoC,eAAehB,EAAIxF,aAAc,CAC9C+F,MAAOuN,QAAQN,GACdtM,UAAU,GAEZ,CAOK,SAAU4M,QAAwC9N,GACvD,KAAMA,GAAMxF,gBAAgBwF,GAAIA,EAAKA,EAAGxF,cACxC,OAAOwF,CACR,CAGO,MAAM+N,wBAA0B,IAAI9O,QACpC,IAAI+O,wBAAyB,EAE9B,SAAUC,0BAA0B1N,GACzCyN,uBAAyBzN,CAC1B,CCxDA,MAAM2N,gBAAkBlU,OAAO,mBAG/B,IAAImU,iBAAkB,EAGtB,MAAMC,oBAAsB,IAAIzP,IAC1B0P,oBAAsB,IAAI1P,IAG1B2P,YAAc,IAAItP,QAClBuP,YAAc,IAAIvP,QACxB,IAAIwP,cAAgB,EAChBC,cAAgB,EAYpB,MAAMC,aAAe,IAAI3P,IAuCzB,SAAS4P,iBAAiBC,GACzB,IAAI3T,EAAOqT,YAAYzN,IAAI+N,GAC3B,IAAK3T,EAAM,CACV,MAAMuS,EAAOM,QAAQc,GACrB3T,EAAOuS,GAAMvS,MAAM4T,QAAU,aAAYL,cACzCF,YAAYvN,IAAI6N,EAAQ3T,EACzB,CACA,OAAOA,CACR,CAEA,SAAS6T,iBAAiBrO,GACzB,IAAIxF,EAAOsT,YAAY1N,IAAIJ,GAC3B,IAAKxF,EAAM,CACV,MAAM8T,EAAYtO,GAAa7F,aAAaK,KAE5CA,EAAO,GADM8T,GAAyB,WAAbA,EAAwBA,EAAW,cACxCN,gBACpBF,YAAYxN,IAAIN,EAAKxF,EACtB,CACA,OAAOA,CACR,CAEA,SAAS+T,aAAavO,EAAaC,GAClC,MAAMuO,EAAaH,iBAAiBrO,GACpC,OAAIC,IAAStG,SAAiB,GAAG6U,MACb,iBAATvO,EAA0B,GAAGuO,KAAcvO,EAAKmC,aAAenC,EAAKR,aACxE,GAAG+O,KAAcrP,OAAOc,IAChC,CAEA,SAASwO,oBAAoBN,GAC5B,IAAKA,GAAUR,oBAAoBnO,IAAI2O,GAAS,OAChDR,oBAAoBzM,IAAIiN,GACxB,MAAMO,EAAOjC,wBAAwBrM,IAAI+N,GACzC,GAAIO,EACH,IAAK,MAAM1O,KAAO0O,EACjBC,eAAe3O,EAGlB,CAEA,SAAS2O,eAAe3O,GAClB4N,oBAAoBpO,IAAIQ,IAC5B4O,iBAAiB5O,EAEnB,CAEA,SAAS4O,iBAAiB5O,GACzB4N,oBAAoB1M,IAAIlB,GACxBqO,iBAAiBrO,EAClB,CAEA,SAAS6O,mBAAmBC,GAC3B,MAAMC,EAAQhR,MAAMiR,KAAKF,GACzB,IAAK,IAAIrR,EAAI,EAAGA,EAAIsR,EAAM7R,OAAQO,IAAK,CACtC,MAAM0Q,EAASY,EAAMtR,GACfwR,EAASrC,aAAaxM,IAAI+N,GAC5Bc,IAAWH,EAAQtP,IAAIyP,KAC1BH,EAAQ5N,IAAI+N,GACZF,EAAMpR,KAAKsR,GAEb,CACD,CAEA,SAASC,wBAAwBC,GAChC,IAAIC,EAAYnB,aAAa7N,IAAI+O,GAKjC,OAJKC,IACJA,EAAY,IAAI9Q,IAChB2P,aAAa3N,IAAI6O,EAAQC,IAEnBA,CACR,CAEA,SAASC,oBACRF,EACA9M,EACAiN,EACAtP,EACAC,EACAsP,GAEA,MAAMH,EAAYF,wBAAwBC,GAC1C,IAAIK,EAAWJ,EAAUhP,IAAIiC,GACxBmN,IACJA,EAAW,IAAIlR,IACf8Q,EAAU9O,IAAI+B,EAAQmN,IAEvB,IAAIC,EAASD,EAASpP,IAAIkP,GAK1B,OAJKG,IACJA,EAAS,CAAEH,QAAOI,OAAQ1P,EAAKC,OAAMsP,YAAWI,MAAO,EAAGC,cAAexR,KAAKyR,OAC9EL,EAASlP,IAAIgP,EAAOG,IAEdA,CACR,CAKM,SAAUK,cAAc3B,EAAwB3T,GACrDqT,YAAYvN,IAAI6N,EAAQ3T,EACzB,CAKM,SAAUuV,cAAc/P,EAAaxF,GAC1CsT,YAAYxN,IAAIN,EAAKxF,GACrBoT,oBAAoB1M,IAAIlB,EACzB,CAKM,SAAUgQ,uBAAuB7B,GACjCA,GAAWT,iBAChBe,oBAAoBN,EACrB,CAKM,SAAU8B,uBAAuBjQ,GACjC0N,iBACLiB,eAAe3O,EAChB,CAUM,SAAUkQ,kBACff,EACA9M,EACArC,EACAC,EACAsP,GAKA,GAHI9U,QAAQgC,cAAcC,eACzByT,qBAAqBhB,EAAQ9M,EAAQrC,EAAKC,EAAMsP,IAE5C7B,gBAAiB,OACtBe,oBAAoBpM,GAChB8M,GAAQV,oBAAoBU,GAChC,MAAM5M,EAAagM,aAAavO,EAAKC,GAC/BwP,EAASJ,oBACdF,GAAU1B,gBACVpL,EACAE,EACAvC,EACAC,EACAsP,GAEDE,EAAOE,OAAS,EAChBF,EAAOG,cAAgBxR,KAAKyR,MAC5BlB,eAAe3O,EAChB,UAOgBoQ,gBAAgBjC,EAAwBkC,EAAQ,GAC/D,MAAMxV,EAAkB,GACxB,IAAIyV,EAAUnC,EACd,IAAK,IAAI1Q,EAAI,EAAGA,EAAI4S,EAAO5S,IAAK,CAI/B,IAAI8S,EACAC,EAAc,GAElBC,EAAQ,IAAK,MAAOtB,EAAQC,KAAcnB,aACzC,IAAK,MAAO5L,EAAQmN,KAAaJ,EAChC,GAAI/M,IAAWiO,EAAS,CAEvB,IAAII,EAAW,EACf,IAAK,MAAMjB,KAAUD,EAAS1G,SACzB2G,EAAOG,cAAgBc,IAC1BA,EAAWjB,EAAOG,cAClBY,EAAcf,EAAOH,MACrBiB,EAAcpB,IAAW1B,qBAAkB1R,EAAaoT,GAG1D,GAAIoB,GAAeC,EAAa,MAAMC,CACvC,CAIF,IAAIF,EAKG,IAAIC,EAAa,CACvB3V,EAAM8C,KAAK,gBAAgB6S,SAAmBtC,iBAAiBoC,MAC/D,KACD,CACC,KACD,CATCzV,EAAM8C,KACL,GAAGuQ,iBAAiBqC,UAAoBC,SAAmBtC,iBAAiBoC,MAE7EA,EAAUC,CAOZ,CACA,OAAO1V,EAAM2O,SACd,CAEA,SAASmH,iBAAiBC,GACzB,MAAMC,EAAsB,GACtBC,EAAe,IAAIxS,IAEnByS,EAAUhT,MAAMiR,KAAK4B,GAC3B,IAAK,MAAMzC,KAAU4C,EAAS,CAC7B,MAAMzB,EAAQpB,iBAAiBC,GACzB6C,EAAmB,CACxBC,GAAI,UAAUJ,EAAM3T,SACpBoS,QACA4B,KAAM,SACN9H,MAAO,EACP+H,UAAW7B,GAEZuB,EAAMlT,KAAKqT,GACXF,EAAaxQ,IAAI6N,EAAQ6C,EAC1B,CAEA,MAAMI,EAAa,IAAI9S,IACjB+S,EAAgBlD,IACrB,IAAKA,EAAQ,OAAO,EACpB,MAAMhC,EAASiF,EAAWhR,IAAI+N,GAC9B,QAAepS,IAAXoQ,EAAsB,OAAOA,EACjC,MAAM8C,EAASrC,aAAaxM,IAAI+N,GAC1B/E,EAAQiI,EAAapC,IAAWA,EAAS,EAAI,GAEnD,OADAmC,EAAW9Q,IAAI6N,EAAQ/E,GAChBA,GAGR,IAAK,MAAO+E,EAAQ6C,KAASF,EAAc,CAC1CE,EAAK5H,MAAQiI,EAAalD,GAC1B,MAAMc,EAASrC,aAAaxM,IAAI+N,GAChC,GAAIc,EAAQ,CACX,MAAMqC,EAAaR,EAAa1Q,IAAI6O,GAChCqC,IACHN,EAAKO,SAAWD,EAAWL,GAE7B,CACD,CAEA,MAAO,CAAEJ,QAAOC,eACjB,UAKgBU,uBACf,MAAMX,EAAwC,GACxCY,EAAqB,GACrBC,EAAU,IAAIpT,IAEdsS,EAAa,IAAI1S,IAAoByP,qBAC3CkB,mBAAmB+B,GACnB,MAAQC,MAAOc,EAAWb,aAAEA,GAAiBH,iBAAiBC,GAC9D,IAAK,MAAMI,KAAQW,EAAad,EAAMlT,KAAKqT,GAC3C,IAAK,MAAO7C,EAAQ6C,KAASF,EAC5BY,EAAQpR,IAAI6N,EAAQ6C,EAAKC,IAI1B,IAAK,MAAMjR,KAAO4N,oBAAqB,CACtC,MAAMqD,EAAK,UAAUJ,EAAM3T,SAC3B2T,EAAMlT,KAAK,CAAEsT,KAAI3B,MAAOjB,iBAAiBrO,GAAMkR,KAAM,QAASC,UAAWrD,YAAY1N,IAAIJ,KACzF0R,EAAQpR,IAAIN,EAAKiR,EAClB,CAGA,GAAIhD,aAAazO,IAAIiO,iBAAkB,CACtC,MAAMmE,EAAa,kBACnBf,EAAMlT,KAAK,CAAEsT,GAAIW,EAAYtC,MAAO,WAAY4B,KAAM,WAAY9H,MAAO,IACzEsI,EAAQpR,IAAImN,gBAAiBmE,EAC9B,CAGA,IAAK,MAAMzD,KAAUyC,EAAY,CAChC,MAAMiB,EAAWH,EAAQtR,IAAI+N,GAC7B,IAAK0D,EAAU,SACf,MAAMnD,EAAOjC,wBAAwBrM,IAAI+N,GACzC,GAAKO,EACL,IAAK,MAAM1O,KAAO0O,EAAM,CACvB,MAAMoD,EAAQJ,EAAQtR,IAAIJ,GACrB8R,GACLL,EAAM9T,KAAK,CACVsT,GAAI,GAAGY,MAAaC,IACpB3C,OAAQ0C,EACRxP,OAAQyP,EACRZ,KAAM,aACN5B,MAAO,WAET,CACD,CAGA,IAAK,MAAOH,EAAQC,KAAcnB,aACjC,IAAK,MAAO8D,EAAcvC,KAAaJ,EAAW,CACjD,MAAM4C,EAAWN,EAAQtR,IAAI2R,GAC7B,IAAKC,EAAU,SACf,MAAMC,EAAWP,EAAQtR,IAAI+O,GAC7B,GAAK8C,EACL,IAAK,MAAMxC,KAAUD,EAAS1G,SAC7B2I,EAAM9T,KAAK,CACVsT,GAAI,GAAGgB,MAAaD,KAAYvC,EAAOH,QACvCH,OAAQ8C,EACR5P,OAAQ2P,EACRd,KAAM,QACN5B,MAAOG,EAAOE,MAAQ,EAAI,GAAGF,EAAOH,UAAUG,EAAOE,SAAWF,EAAOH,MACvEK,MAAOF,EAAOE,OAGjB,CAGD,MAAO,CACNkB,QACAY,QACAS,KAAM,CACLC,YAAa/T,KAAKyR,MAClBnC,iCAGH,UAMgB0E,iBACO,oBAAXC,SACP3E,kBACJA,iBAAkB,EAGlB2E,OAAOC,mBAAqB,CAC3BC,SAAUf,qBACV1B,4BACAC,4BACAyC,eAAgBxC,uBAChByC,eAAgBxC,yBAElB,UAMgByC,oBACf,OAAOhF,eACR,CA0DA,MAAMiF,gBAAoC,GAC1C,IAAIC,gBAAkB,EAEtB,SAASzC,qBACRhB,EACA9M,EACArC,EACAC,EACAsP,GAEA,MAAME,EAAyB,CAC9BwB,KAAM2B,gBACNC,UAAWzU,KAAKyR,MAChBV,OAAQA,EAASjB,iBAAiBiB,GAAU,WAC5C9M,OAAQ6L,iBAAiB7L,GACzBmM,WAAYH,iBAAiBrO,GAC7BC,KAAMd,OAAOc,GACbiR,KAAM3B,EAAU2B,MAGjByB,gBAAgBhV,KAAK8R,GACjBkD,gBAAgBzV,OAASzC,QAAQgC,cAAcE,aAClDgW,gBAAgBG,OAElB,CCvfA,MAAMC,MAAwC,YAG9BC,qBACf,OAAOD,MAAM1K,OACd,CACM,SAAU4K,UAAU9E,GACzB,MAAM+E,EAAa7F,QAAQc,GAGrBgF,EAAYJ,MAAM/M,QAAQkN,GAChC,IAAkB,IAAdC,EACH,OAAOJ,MAAM1K,MAAM,EAAG8K,EAAY,GAAG3J,UAKtC,IAAK,IAAI/L,EAAI,EAAGA,EAAIsV,MAAM7V,OAAQO,IAAK,CAEtC,IAAI6S,EADgByC,MAAMtV,GAE1B,MAAM2V,EAAU,IAAI5U,QACd6U,EAAkC,GAGxC,KAAO/C,IAAY8C,EAAQ5T,IAAI8Q,IAAU,CACxC8C,EAAQlS,IAAIoP,GACZ,MAAMgD,EAAcjG,QAAQiD,GAE5B,GADA+C,EAAc1V,KAAK2V,GACfA,IAAgBJ,EAAY,CAI/B,MAAMK,EAAoBF,EAAc7J,UAEpC+J,EAAkB,KAAOL,GAC5BK,EAAkBC,QAAQN,GAG3B,MAAMO,EAAsBV,MAAM1K,MAAM,EAAG5K,EAAI,GAAG+L,UAKlD,OAHI+J,EAAkBrW,OAAS,GAAKuW,EAAoBvW,OAAS,GAChEuW,EAAoBX,QAEd,IAAIS,KAAsBE,EAClC,CACAnD,EAAU1D,aAAaxM,IAAIkQ,EAC5B,CACD,CAEA,OAAO,CACR,CACM,SAAUoD,gBAAmBC,EAA0CpU,GAC5E,MAAMqU,EAAgBb,MAAM1K,QAC5BwL,YAAYF,GACZ,IACC,OAAOpU,GACR,SACCsU,YAAYD,EACb,CACD,UAEgBE,kBACf,OAAOf,MAAM,EACd,CASM,SAAUgB,WAAc5F,EAAoC5O,GAEjE,GAAI8N,QAAQc,KAAYd,QAAQyG,mBAAoB,OAAOvU,IAC3DwT,MAAMS,QAAQrF,GACd,IACC,OAAO5O,GACR,SAEC,GADwBwT,MAAMD,UACN3E,EAAQ,MAAM,IAAIlU,cAAc,mCACzD,CACD,CAEA,SAAS4Z,YAAY/K,GACpBiK,MAAM7V,OAAS,EACf6V,MAAMpV,QAAQmL,EACf,CC7FO,MAAMkL,cAAgB,IAAIzV,QACpB0V,cAAgB,IAAI1V,QAE3B,SAAU2V,uBAAuB7R,EAAgB8R,GACtDH,cAAc1T,IAAI+B,EAAQ8R,GAC1BF,cAAc3T,IAAI6T,EAAO9R,EAC1B,CAEM,SAAU+R,iBAAmC/R,GAClD,OAAO2R,cAAc5T,IAAIiC,EAC1B,CAEM,SAAUgS,iBAAiBF,EAAe9R,GAC/C4R,cAAc3T,IAAI6T,EAAO9R,EAC1B,CAEM,SAAUiS,OAAUtU,GACzB,IAAIsQ,EAAUtQ,EACd,KAAOsQ,GAA8B,iBAAZA,GAAoC,OAAZA,GAAoB2D,cAAczU,IAAI8Q,IACtFA,EAAU2D,cAAc7T,IAAIkQ,GAE7B,OAAOA,CACR,CAEM,SAAUiE,WAAWvU,GAC1B,OAAOiU,cAAczU,IAAIQ,EAC1B,UCdgBwU,sBACf,MAAMC,EAASX,kBACf,OAAKW,EACEnH,wBAAwB9N,IAAI6N,QAAQoH,IADvBlH,sBAErB,CAEM,SAAUmH,oBAAoB5U,GACnC,MAAM2U,EAASX,kBACf,IAAKW,EAEJ,YADAjH,0BAA0B1N,GAG3B,MAAMiN,EAAOM,QAAQoH,GACjB3U,EAAOwN,wBAAwBpM,IAAI6L,GAClCO,wBAAwBzI,OAAOkI,EACrC,UASgB4H,UAAU3U,EAAUC,EAAYtG,UAC/CqG,EAAMsU,OAAOtU,GACb,MAAM4U,EAAsBd,mBAI1Bc,GACDJ,uBACiB,iBAATvU,GAAqBA,IAAStG,UAIvCkb,mBAAmB7U,EAAKC,EAAM2U,EAC/B,CAEA,SAASC,mBAAmB7U,EAAUC,EAAW2U,GAChD,IAAIE,EAAiBpI,SAAStM,IAAIJ,GAC7B8U,IACJA,EAAiB,IAAIxW,IACrBoO,SAASpM,IAAIN,EAAK8U,IAEnB,IAAIpG,EAAOoG,EAAe1U,IAAIH,GACzByO,IACJA,EAAO,IAAIxQ,IACX4W,EAAexU,IAAIL,EAAMyO,IAE1BA,EAAKxN,IAAI0T,GAGT,MAAMG,EAAgBtI,wBAAwBrM,IAAIwU,GAC9CG,EACHA,EAAc7T,IAAIlB,GAElByM,wBAAwBnM,IAAIsU,EAAqB,IAAI1W,IAAI,CAAC8B,IAE5D,CCpDA,IAAIgV,YAAa,EAIjB,MAAMC,oBACL9W,OAAO0C,yBAAyBpC,QAAQsD,UAAW,SAASjC,OAASrB,QAAQsD,UAAUmT,KAClFC,qBACLhX,OAAO0C,yBAAyBpC,QAAQsD,UAAW,UAAUjC,OAASrB,QAAQsD,UAAUqT,MACnFC,uBACLlX,OAAO0C,yBAAyBpC,QAAQsD,UAAW,YAAYjC,OAASrB,QAAQsD,UAAUuT,QAGrFC,mBAAqBC,WAAW3Y,WAChC4Y,oBAAsBD,WAAW1Y,YACjC4Y,mCACuC,IAArCF,WAAWzY,sBACfyY,WAAWzY,2BACXhB,EACE4Z,4BACgC,IAA9BH,WAAWxY,eAAiCwY,WAAWxY,oBAAiBjB,EAGhF,IAAI6Z,QCmCAC,mBD1BE,SAAUC,iBAAiBC,GAC5BA,IAAOH,QAAUG,IACjBf,YAAeva,QAAQ6B,YAC3B0Z,WACAhB,YAAa,EACd,CAKA,SAASgB,WAERvX,QAAQsD,UAAUmT,KAAO,SAExBe,EACAC,GAEA,MAAMC,EAAgBnD,qBACtB,OAAOiC,oBAAoBhT,KAC1B1H,KACA6b,aAAaH,EAAaE,GAC1BC,aAAaF,EAAYC,GAE3B,EAEA1X,QAAQsD,UAAUqT,MAAQ,SAEzBc,GAEA,MAAMC,EAAgBnD,qBACtB,OAAOmC,qBAAqBlT,KAAK1H,KAAM6b,aAAaF,EAAYC,GACjE,EAEA1X,QAAQsD,UAAUuT,QAAU,SAE3Be,GAEA,MAAMF,EAAgBnD,qBACtB,OAAOqC,uBAAuBpT,KAAK1H,KAAM6b,aAAaC,EAAWF,GAClE,EAGA,MAAMG,EAAiB,CACtBhN,EACAiN,KACG/Z,KAEH,MAAM2Z,EAAgB1b,QAAQmC,MAAMC,WAAamW,0BAAuBjX,EACxE,OAAOwZ,mBAAmB7O,MAAM8O,WAAY,CAC3CY,aAAa9M,EAAU6M,GACvBI,KACG/Z,GAEJ,EACD2B,OAAOqY,OAAOF,EAAmBf,oBACjCC,WAAW3Y,WAAayZ,EAGxB,MAAMG,EAAkB,CACvBnN,EACAiN,KACG/Z,KAEH,MAAM2Z,EAAgB1b,QAAQmC,MAAME,YAAckW,0BAAuBjX,EACzE,OAAO0Z,oBAAoB/O,MAAM8O,WAAY,CAC5CY,aAAa9M,EAAU6M,GACvBI,KACG/Z,GAEJ,EACD2B,OAAOqY,OAAOC,EAAoBhB,qBAClCD,WAAW1Y,YAAc2Z,EAGrBf,gCACHF,WAAWzY,sBACVuM,IAEA,MAAM6M,EAAgB1b,QAAQmC,MAAMG,sBAAwBiW,0BAAuBjX,EACnF,OAAO2Z,8BAA8BzT,KACpCuT,WACAY,aAAa9M,EAAiB6M,GAE/B,GAIER,yBACHH,WAAWxY,eAAmBsM,IAC7B,MAAM6M,EAAgB1b,QAAQmC,MAAMI,eAAiBgW,0BAAuBjX,EAC5E4Z,uBAAuB1T,KAAKuT,WAAYY,aAAa9M,EAAU6M,GAC/D,EAEH,CAKA,SAASC,aACR9M,EACA6M,GAEA,GAAK7M,EAGL,OAAM6M,GAAkBA,EAAcjZ,QAAY0Y,QAIlD,IAAYpZ,KACX,MAAMka,EAAU,IACXP,GAAejZ,OACXwW,gBAAgByC,EAAe,IAAM7M,KAAY9M,IAElD8M,KAAY9M,GAGpB,OAAIoZ,QACIA,QAAQc,EAAS,aAElBA,GACP,EAfOpN,CAgBT,CAKM,SAAUqN,eAAeC,GAC1BA,IAAY5B,YACfgB,WACAhB,YAAa,IACF4B,GAAW5B,aAGtBvW,QAAQsD,UAAUmT,KAAOD,oBACzBxW,QAAQsD,UAAUqT,MAAQD,qBAC1B1W,QAAQsD,UAAUuT,QAAUD,uBAG5BG,WAAW3Y,WAAa0Y,mBACxBC,WAAW1Y,YAAc2Y,oBACrBC,gCACHF,WAAWzY,sBAAwB2Y,+BAEhCC,yBACHH,WAAWxY,eAAiB2Y,wBAG7BX,YAAa,EAEf,UAKgB6B,gBACf,OAAO7B,UACR,CCzKA,SAAS8B,iBAAiBC,GACzB,MAAMC,EAAO,IAAI1Y,IACjB,IAAK,IAAIb,EAAI,EAAGA,EAAIsZ,EAAM7Z,OAAQO,IAAK,CACtC,MAAMsP,EAAOgK,EAAMtZ,GACnB,GAAIuZ,EAAKxX,IAAIuN,GACZ,OAAOgK,EAAM1O,MAAM2O,EAAK5W,IAAI2M,IAE7BiK,EAAK1W,IAAIyM,EAAMtP,EAChB,CACA,OAAO,IACR,CAKA,SAASwZ,YAAYF,EAAmB1G,EAAQ,IAC/C,MAAM6G,EAAQH,EAAMzZ,IAAK6Z,GAAMA,EAAE3c,MAAQ,eACzC,GAAI0c,EAAMha,QAAUmT,EAAO,OAAO6G,EAAMtO,KAAK,OAC7C,MAAMN,EAAQ4O,EAAM7O,MAAM,EAAG,GACvBE,EAAM2O,EAAM7O,WAClB,MAAO,GAAGC,EAAMM,KAAK,eAAesO,EAAMha,OAAS,gBAAgBqL,EAAIK,KAAK,QAC7E,CAmBO,MAAMwO,cAAqD,IAAIrZ,MAAM,cAE5DsZ,mBACf,OAAOD,aACR,CAEM,SAAUE,iBACfnJ,EACAnO,EACAuP,EACAtP,GAEA,MAAM8M,EAAOM,QAAQc,GAErB,IAAK0H,mBAAoB,OACzB,IAAI0B,EAAa1B,mBAAmBzV,IAAI2M,GACnCwK,IACJA,EAAa,IAAIjZ,IACjBuX,mBAAmBvV,IAAIyM,EAAMwK,IAE9B,IAAIC,EAAUD,EAAWnX,IAAIJ,GACxBwX,IACJA,EAAU,IAAIlZ,IACdiZ,EAAWjX,IAAIN,EAAKwX,IAErB,MAAM7H,GAAS6H,EAAQpX,IAAIH,IAAS,GAAK,EAYzC,GAXAuX,EAAQlX,IAAIL,EAAM0P,GAGlByH,cAAc5D,QAAQ,CACrBrF,SACAnO,MACAuP,YACAtP,SAEDmX,cAAcK,MAEV9H,GAASlV,QAAQmB,mBAAoB,CACxC,MAAM8b,EAAc3K,GAAcvS,MAAQ,YACpCJ,EAAU,wCAAwCsd,gBAAyB/H,0CACjF,GAAkC,UAA9BlV,QAAQoB,kBACX,MAAM,IAAI5B,cAAcG,EAAS,CAChCud,KAAM3d,kBAAkB4d,oBACxBjI,QACAxB,OAAQuJ,IAGVjd,QAAQ8B,KAAK,cAAcnC,IAC5B,CACD,CAuCM,SAAUyd,YAAYC,GAC3B,MAAMC,EAAejE,kBACrB,IAAKiE,EAAc,MAAM,IAAI7d,MAAM,oBAC9B8d,eAAexY,IAAIuY,GACnBC,eAAe5X,IAAI2X,GAAe7W,IAAI4W,GADJE,eAAe1X,IAAIyX,EAAc,IAAI7Z,IAAI,CAAC4Z,IAElF,CAEA,MAAME,eAAiB,IAAIzZ,QAEd0Z,cAAgB,IAAIzZ,QAI3B0Z,eAAiB,IAAI3Z,QACrB4Z,kBAAoB,IAAI5Z,QAKxB6Z,cAAgB,IAAI7Z,QACpB8Z,oBAAsB,IAAI9Z,QAGnB+Z,qBAAuB,IAAI/Z,QAKxC,SAASga,mBACRC,EACAzL,GAEA,IAAIzM,EAAMkY,EAAQpY,IAAI2M,GAKtB,OAJKzM,IACJA,EAAM,IAAI0K,gBACVwN,EAAQlY,IAAIyM,EAAMzM,IAEZA,CACR,CAQA,SAASmY,aAAaC,EAAsBC,GAE3C,MAAMC,EAAWV,eAAe9X,IAAIsY,GACpC,GAAIE,GAAUpZ,IAAImZ,GACjB,OAID,GAAKC,EAKJA,EAAS1X,IAAIyX,OALC,CACd,MAAME,EAAc,IAAI7N,gBACxB6N,EAAY3X,IAAIyX,GAChBT,eAAe5X,IAAIoY,EAAYG,EAChC,CAKA,IAAIC,EAAcX,kBAAkB/X,IAAIuY,GAiBxC,GAhBKG,IACJA,EAAc,IAAI9N,gBAClBmN,kBAAkB7X,IAAIqY,EAAYG,IAEnCA,EAAY5X,IAAIwX,GAYZA,IAAeC,EAClB,OAGD,MAAMI,EAAgBR,mBAAmBF,oBAAqBK,GACxDM,EAAUT,mBAAmBH,cAAeO,GAGlDI,EAAc7X,IAAIyX,GAClBK,EAAQ9X,IAAIwX,GAGZ,MAAMO,EAAab,cAAchY,IAAIsY,GACrC,GAAIO,EACH,IAAK,MAAMC,KAAKD,EAAY,CAE3B,GAAIC,IAAMP,EAAY,SACAJ,mBAAmBF,oBAAqBa,GAChDhY,IAAIyX,GAClBK,EAAQ9X,IAAIgY,EACb,CAID,MAAMC,EAAmBd,oBAAoBjY,IAAIuY,GACjD,GAAIQ,EACH,IAAK,MAAMC,KAAKD,EAAkB,CAEjC,GAAIC,IAAMV,EAAY,SACNH,mBAAmBH,cAAegB,GAC1ClY,IAAIwX,GACZK,EAAc7X,IAAIkY,EACnB,CAID,GAAIH,GAAcE,EACjB,IAAK,MAAMD,KAAKD,EAAY,CAC3B,MAAMI,EAAgBd,mBAAmBF,oBAAqBa,GAC9D,IAAK,MAAME,KAAKD,EAAkB,CAEjC,GAAID,IAAME,EAAG,SACbC,EAAcnY,IAAIkY,GACFb,mBAAmBH,cAAegB,GAC1ClY,IAAIgY,EACb,CACD,CAEF,CAWA,SAASI,iBAAiBhR,EAAiBC,EAAegR,GACzD,GAAIjR,IAAUC,EAAK,OAAO,EAC1B,GAAID,IAAUiR,EAAS,OAAO,EAE9B,MAAMnG,EAAU,IAAIlV,IACd6Q,EAAoB,CAACzG,GAI3B,IAHA8K,EAAQlS,IAAIoH,GACZ8K,EAAQlS,IAAIqY,GAELxK,EAAM7R,OAAS,GAAG,CACxB,MAAMoT,EAAUvB,EAAM+D,QAChB8F,EAAWV,eAAe9X,IAAIkQ,GACpC,GAAKsI,EAEL,IAAK,MAAMY,KAAQZ,EAAU,CAC5B,GAAIY,IAASjR,EAAK,OAAO,EACpB6K,EAAQ5T,IAAIga,KAChBpG,EAAQlS,IAAIsY,GACZzK,EAAMpR,KAAK6b,GAEb,CACD,CAEA,OAAO,CACR,CAQA,SAASC,uBAAuBtL,GAC/B,MAAMpB,EAAOM,QAAQc,GAGfuL,EAAatB,cAAchY,IAAI2M,GAC/B4M,EAAmBtB,oBAAoBjY,IAAI2M,GAG3C6L,EAAWV,eAAe9X,IAAI2M,GACpC,GAAI6L,EAAU,CAEb,IAAK,MAAMD,KAAcC,EAAU,CAClC,MAAME,EAAcX,kBAAkB/X,IAAIuY,GAC1CG,GAAajU,OAAOkI,EACrB,CACAmL,eAAerT,OAAOkI,EACvB,CAGA,MAAM+L,EAAcX,kBAAkB/X,IAAI2M,GAC1C,GAAI+L,EAAa,CAEhB,IAAK,MAAMc,KAAcd,EAAa,CACrC,MAAMF,EAAWV,eAAe9X,IAAIwZ,GACpChB,GAAU/T,OAAOkI,EAClB,CACAoL,kBAAkBtT,OAAOkI,EAC1B,CASA,GAAI2M,EAGH,IAAK,MAAMG,KAAaH,EAAY,CACnC,MAAMI,EAAoBzB,oBAAoBjY,IAAIyZ,GAClD,GAAIC,IAEHA,EAAkBjV,OAAOkI,GAErB4M,GACH,IAAK,MAAMI,KAAeJ,EAEpBL,iBAAiBO,EAAWE,EAAahN,IAC7C+M,EAAkBjV,OAAOkV,EAK9B,CAGD,GAAIJ,EAGH,IAAK,MAAMK,KAAmBL,EAAkB,CAC/C,MAAMM,EAAoB7B,cAAchY,IAAI4Z,GAC5C,GAAIC,IAEHA,EAAkBpV,OAAOkI,GAErB2M,GACH,IAAK,MAAMQ,KAASR,EAEdJ,iBAAiBY,EAAOF,EAAiBjN,IAC7CkN,EAAkBpV,OAAOqV,EAK9B,CAKD,GAAIR,GAAcC,EACjB,IAAK,MAAMT,KAAKQ,EAAY,CAC3B,MAAML,EAAgBhB,oBAAoBjY,IAAI8Y,GAC9C,GAAIG,EACH,IAAK,MAAMD,KAAKO,EAGf,IAAKL,iBAAiBJ,EAAGE,EAAGrM,GAAO,CAClCsM,EAAcxU,OAAOuU,GACrB,MAAMe,EAAU/B,cAAchY,IAAIgZ,GAClCe,GAAStV,OAAOqU,EACjB,CAGH,CAIDd,cAAcvT,OAAOkI,GACrBsL,oBAAoBxT,OAAOkI,EAC5B,CAYA,IAAIqN,WACE,SAAUC,WAAWlM,GAC1B,OAAOiM,YAAYE,IAAI9a,IAAI6N,QAAQc,GACpC,CACA,MAAMoM,cAAgB,IAAIrc,IAM1B,SAASsc,oBAAoBzE,GAC5B,MAAMgC,EAAejE,kBACf2G,EAAa1C,EAAe1K,QAAQ0K,GAAgB,KAG1DhC,EAAM2E,UAAUhQ,QAEhB,IAAK,MAAOqC,KAASgJ,EAAMuE,IAAK,CAC/B,IAAIK,EAAW,EACf,MAAMC,EAASxC,cAAchY,IAAI2M,GACjC,GAAI6N,EACH,IAAK,MAAMf,KAAae,EAEnB7E,EAAMuE,IAAI9a,IAAIqa,IAAcA,IAAcY,GAAcZ,IAAc9M,GACzE4N,IAIH5E,EAAM2E,UAAUpa,IAAIyM,EAAM4N,EAC3B,CACD,CAMA,SAASE,8BAA8B9E,EAAmB+E,GAEzD,MAAMC,EAAe1C,oBAAoBjY,IAAI0a,GAC7C,GAAKC,EAEL,IAAK,MAAMf,KAAmBe,EAE7B,GAAIhF,EAAMuE,IAAI9a,IAAIwa,GAAkB,CACnC,MAAMgB,EAAgBjF,EAAM2E,UAAUta,IAAI4Z,IAAoB,EAC1DgB,EAAgB,GACnBjF,EAAM2E,UAAUpa,IAAI0Z,EAAiBgB,EAAgB,EAEvD,CAEF,CAiDA,SAASC,SACRC,EACAC,EACA/H,EAAyB,IAAIlV,IAC7Bkd,EAAmB,IAEnB,GAAIF,IAAcC,EACjB,MAAO,IAAIC,EAAMD,GAGlB,GAAI/H,EAAQ5T,IAAI0b,GACf,MAAO,GAGR9H,EAAQlS,IAAIga,GACZ,MAAMG,EAAU,IAAID,EAAMF,GAEpBtC,EAAWV,eAAe9X,IAAI8a,GACpC,GAAItC,EACH,IAAK,MAAMD,KAAcC,EAAU,CAClC,MAAMpb,EAASyd,SAAStC,EAAYwC,EAAS/H,EAASiI,GACtD,GAAI7d,EAAON,OAAS,EACnB,OAAOM,CAET,CAGD,MAAO,EACR,CAQA,SAAS8d,oBAAoB5C,EAAsBC,GAGlD,MAAMyC,EAAOH,SAAStC,EAAYD,GAClC,OAAI0C,EAAKle,OAAS,EAEV,CAACwb,KAAe0C,GAEjB,EACR,CAUA,SAASG,iBAAiB7C,EAAsBC,GAG/C,GAAID,IAAeC,EAClB,OAAO,EAMR,MAAM6C,EAAqBnD,oBAAoBjY,IAAIuY,GACnD,QAAI6C,GAAoBhc,IAAIkZ,EAK7B,CAQA,SAAS+C,WAAWtN,EAAwBuN,EAAyBC,GACpE,MAAMC,EAAazN,EAAe0N,WAGlC,GAFID,GAAWA,IAEVzN,EAAetU,SAAU,OAE9B,IAAKugB,WAAY,OAEjB,MAAMrN,EAAOM,QAAQc,GAOrB,GAJAiM,WAAWE,IAAIha,IAAIyM,EAAMoB,GAIrBuN,IAAWC,EAAW,CACzB,MAAMjD,EAAarL,QAAQqO,GAK3B,GAAIH,iBAAiB7C,EAAY3L,GAAO,CAEvC,MAAM+O,EAAYR,oBAAoB5C,EAAY3L,GAC5CgP,EACLD,EAAU5e,OAAS,EAChB,mBAAmB4e,EAAUxe,IAAK6Z,GAAMA,EAAE3c,MAAQ2c,EAAE1X,YAAYmJ,KAAK,SACrE,mBAAmB8P,EAAWle,MAAQke,EAAWjZ,gBAAgBsN,EAAKvS,MAAQuS,EAAKtN,wBAEjFzD,EAAgBvB,QAAQuB,cAG9B,GAAsB,WAAlBA,EAA4B,CAC/Boe,WAAWE,IAAIzV,OAAOkI,GACtB,MAAMiP,EAAc5L,gBAAgBjC,GAC9B8N,EAAgB3D,qBAAqBlY,IAAI2M,GAE/C,MAAM,IAAI9S,cAAc,uCAAuC8hB,IAAgB,CAC9EpE,KAAM3d,kBAAkBkiB,cACxBC,MAAOL,EAAUxe,IAAK6Z,GAAMA,EAAE3c,MAAQ2c,EAAE1X,YACxC2c,QAASL,EACTC,cACAC,iBAEF,CAEA,OAAQjgB,GACP,IAAK,QAAS,CAEboe,WAAWE,IAAIzV,OAAOkI,GACtB,MAAMiP,EAAc5L,gBAAgBjC,GAC9B8N,EAAgB3D,qBAAqBlY,IAAI2M,GAE/C,MAAM,IAAI9S,cAAc,cAAc8hB,IAAgB,CACrDpE,KAAM3d,kBAAkBkiB,cACxBC,MAAOL,EAAUxe,IAAK6Z,GAAMA,EAAE3c,MAAQ2c,EAAE1X,YACxC2c,QAASL,EACTC,cACAC,iBAEF,CACA,IAAK,OAIJ,OAHAxhB,QAAQ8B,KAAK,cAAcwf,UAE3B3B,WAAWE,IAAIzV,OAAOkI,GAEvB,IAAK,QAGJ,YADAqN,WAAWE,IAAIzV,OAAOkI,GAGzB,CAEA0L,aAAaC,EAAY3L,EAC1B,CACD,CAMM,SAAUsP,gBAAgBviB,GAC1BsgB,WACAG,cAAcrZ,IAAIpH,GADNA,GAElB,CAsBO,MAAMwiB,MAAQD,gBAQrB,SAASE,aAAanC,GAGrB,MAAMhH,EAAU,IAAIlV,IACdse,EAAiB,IAAIte,IACrBkd,EAAmB,GAEzB,IAAK,MAAOrO,KAASqN,EAAWE,IAAK,CACpC,GAAIlH,EAAQ5T,IAAIuN,GAAO,SACvB,MAAMoP,EAAQM,UAAU1P,EAAMqG,EAASoJ,EAAgBpB,EAAMhB,GAC7D,GAAI+B,EAAMjf,OAAS,EAClB,OAAOif,CAET,CAEA,MAAO,EACR,CAEA,SAASM,UACR1P,EACAqG,EACAoJ,EACApB,EACAhB,GAEA,GAAIoC,EAAehd,IAAIuN,GAAO,CAE7B,MAAM2P,EAAatB,EAAKpV,QAAQ+G,GAChC,OAAOqO,EAAK/S,MAAMqU,GAAYlU,OAAO,CAACuE,GACvC,CAEA,GAAIqG,EAAQ5T,IAAIuN,GACf,MAAO,GAGRqG,EAAQlS,IAAI6L,GACZyP,EAAetb,IAAI6L,GACnBqO,EAAKzd,KAAKoP,GAIV,MAAM6L,EAAWV,eAAe9X,IAAI2M,GACpC,GAAI6L,EACH,IAAK,MAAMD,KAAcC,EACxB,GAAIwB,EAAWE,IAAI9a,IAAImZ,GAAa,CACnC,MAAMwD,EAAQM,UAAU9D,EAAYvF,EAASoJ,EAAgBpB,EAAMhB,GACnE,GAAI+B,EAAMjf,OAAS,EAClB,OAAOif,CAET,CAMF,OAFAf,EAAK3D,MACL+E,EAAe3X,OAAOkI,GACf,EACR,CAOA,SAAS4P,YAAYC,GAEpB,IAAIC,EAAoC,KACpCC,EAA4B,KAIhC,IAAK,MAAO/P,EAAMoB,KAAWiM,WAAYE,IAAK,CAE7C,GAAiB,KADAF,WAAYM,UAAUta,IAAI2M,IAAS,GAChC,CACnB8P,EAAa1O,EACb2O,EAAW/P,EACX,KACD,CACD,CAEA,IAAK8P,EAAY,CAGhB,GAAIzC,WAAYE,IAAIjZ,KAAO,EAAG,CAC7B,IAAI8a,EAAQI,aAAanC,YAGzB,GAAqB,IAAjB+B,EAAMjf,OAGT,IAAK,MAAO6P,KAASqN,WAAYE,IAAK,CACrC,MAAMS,EAAe1C,oBAAoBjY,IAAI2M,GAC7C,GAAIgO,EAAc,CAEjB,IAAK,MAAMhB,KAAegB,EAEzB,GAAIhB,IAAgBhN,GAChBqN,WAAYE,IAAI9a,IAAIua,GAAc,CACrC,MAAMgD,EAA0B1E,oBAAoBjY,IAAI2Z,GACxD,GAAIgD,GAAyBvd,IAAIuN,GAAO,CAEvCoP,EAAQ,CAACpP,EAAMgN,EAAahN,GAC5B,KACD,CACD,CAED,GAAIoP,EAAMjf,OAAS,EAAG,KACvB,CACD,CAED,MAAM6e,EACLI,EAAMjf,OAAS,EACZ,mBAAmBif,EAAM7e,IAAK6Z,GAAMA,EAAE3c,MAAQ,eAAeoO,KAAK,SAClE,wFAGJ,OADsBnO,QAAQuB,eAE7B,IAAK,QACJ,MAAM,IAAI/B,cAAc,cAAc8hB,KACvC,IAAK,OAAQ,CACZthB,QAAQ8B,KAAK,cAAcwf,KAE3B,MAAMiB,EAAc5C,WAAYE,IAAIxR,SAAS0Q,OAAO1Z,MACpD,GAAIkd,EAAa,CAChB,MAAMC,EAAY5P,QAAQ2P,GAG1B,OAFA5C,WAAYE,IAAIzV,OAAOoY,GACvB7C,WAAYM,UAAU7V,OAAOoY,GACtBD,GACR,CACA,KACD,CACA,IAAK,QAAS,CAEb,MAAME,EAAe9C,WAAYE,IAAIxR,SAAS0Q,OAAO1Z,MACrD,GAAIod,EAAc,CACjB,MAAMC,EAAa9P,QAAQ6P,GAG3B,OAFA9C,WAAYE,IAAIzV,OAAOsY,GACvB/C,WAAYM,UAAU7V,OAAOsY,GACtBD,GACR,CACA,KACD,EAEF,CACA,OAAO,IACR,CAEAN,EAAiBjf,KAAK0P,QAAQwP,IAE9B,MAAMrf,EAASqf,IAOf,OAJAzC,WAAYE,IAAIzV,OAAOiY,GACvB1C,WAAYM,UAAU7V,OAAOiY,GAC7BjC,8BAA8BT,WAAa0C,GAEpCtf,CACR,CAIM,SAAUuY,MAAM5H,EAA2CwN,GAC3D5d,MAAMC,QAAQmQ,KAASA,EAAS,CAACA,IACtC,MAAM4I,EAAQ5I,EAAO7Q,IAAI+P,SAEzB,GAAI+M,WAAY,CAEf3f,SAASI,MAAMkc,EAAO1J,QAAQyG,oBAC9B,MAAM4H,EAAS5H,kBACf,IAAK,IAAIrW,EAAI,EAAGA,EAAI0Q,EAAOjR,OAAQO,IAClCge,WAAWtN,EAAO1Q,GAAIie,EAAsB,cAAdC,GAE/B,GAAIA,EAAW,CACd,MAAMyB,EAA+B,CAAA,EAErC,IAAK,IAAI3f,EAAI,EAAGA,EAAI0Q,EAAOjR,OAAQO,IAClC,IACC,MAAM2F,EAAK+K,EAAO1Q,UACP1B,IAAPqH,GAAsB,UAAWga,IAAcA,EAAYtd,MAAQsD,EACxE,SACC,MAAM2J,EAAOM,QAAQc,EAAO1Q,IAC5B2c,WAAWE,IAAIzV,OAAOkI,EACvB,CAED,OAAOqQ,EAAYtd,KACpB,CAED,KAAO,CAEN,GAAK+V,mBACA,MAAM,IAAI3b,MAAM,6BADI2b,mBAAqB,IAAIvX,IAElD7D,QAAQO,WAAW+b,GACnBqD,WAAa,CACZE,IAAK,IAAIhc,IACToc,UAAW,IAAIpc,KAIhB,MAAMod,EAAS5H,kBACf,IAAK,IAAIrW,EAAI,EAAGA,EAAI0Q,EAAOjR,OAAQO,IAClCge,WAAWtN,EAAO1Q,GAAIie,EAAsB,cAAdC,GAG/B,MAAMiB,EAAqC,GAE3C,GADApC,oBAAoBJ,YAChBuB,EAAW,CAEd,MAAMyB,EAA+B,CAAA,EACrC,IACC,IAAK,IAAI3f,EAAI,EAAGA,EAAI0Q,EAAOjR,OAAQO,IAClC,IACC,MAAM2F,EAAK+K,EAAO1Q,UACP1B,IAAPqH,GAAsB,UAAWga,IAAcA,EAAYtd,MAAQsD,EACxE,SACC,MAAM2J,EAAOM,QAAQc,EAAO1Q,IAC5B2c,WAAWE,IAAIzV,OAAOkI,EACvB,CAID,KAAOqN,WAAWE,IAAIjZ,KAAO,GAAG,CAC/B,GAAIub,EAAiB1f,OAASzC,QAAQkB,eAAgB,CACrD,MAAMwgB,EAAQrF,iBAAiB8F,GACzBS,EAAQpG,YAAY2F,GACpBxiB,EAAU+hB,EACb,6CAA6ClF,YAAYkF,MACzD,oCAAoCkB,KAGjCC,GADclD,WAAarc,MAAMiR,KAAKoL,WAAWE,IAAIzY,QAAU,IAC1CvE,IAAK6Z,GAAMA,EAAE3c,MAAQ,eAC1CH,EAAY,CACjBsd,KAAM3d,kBAAkBujB,iBACxBX,mBACAT,QACAkB,QACA1hB,eAAgBlB,QAAQkB,eACxB2hB,OAAQA,EAAOjV,MAAM,EAAG,IACxBmV,YAAaF,EAAOpgB,OAEpB8e,YACCY,EAAiB1f,OAAS,EACvBkT,gBACAgK,WAAWE,IAAIla,IAAIwc,EAAiBA,EAAiB1f,OAAS,KAE9D,IAEL,OAAQzC,QAAQoB,mBACf,IAAK,QAEL,IAAK,QAGJ,MAAM,IAAI5B,cAAc,cAAcG,IAAWC,GAClD,IAAK,OACJI,QAAQ8B,KACP,cAAcnC,cAAoBkjB,EAAOjV,MAAM,EAAG,IAAIO,KAAK,QAAQ0U,EAAOpgB,OAAS,GAAK,MAAQ,OAIpG,CACA,IAAKkd,YAAsC,IAAxBA,WAAWE,IAAIjZ,KAAY,MAC9C,MAAM+B,EAAKuZ,YAAYC,QAGZ7gB,IAAPqH,GAAsB,UAAWga,IAAcA,EAAYtd,MAAQsD,EACxE,CACA,MAAMqa,EAAW1f,MAAMiR,KAAKuL,eAC5BA,cAAc7P,QACd,IAAK,MAAM5Q,KAAW2jB,EAAU3jB,IAChC,OAAOsjB,EAAYtd,KACpB,SACC+V,wBAAqB9Z,EACrBqe,gBAAare,EACbtB,QAAQQ,UACT,CACD,KAAO,CAEN,MAAMmiB,EAA+B,CAAA,EACrC,IAGC,KAAOhD,WAAWE,IAAIjZ,KAAO,GAAKkZ,cAAclZ,KAAO,GAAG,CAEzD,KAAO+Y,WAAWE,IAAIjZ,KAAO,GAAG,CAC/B,GAAIub,EAAiB1f,OAASzC,QAAQkB,eAAgB,CACrD,MAAMwgB,EAAQrF,iBAAiB8F,GACzBS,EAAQpG,YAAY2F,GACpBxiB,EAAU+hB,EACb,6CAA6ClF,YAAYkF,MACzD,oCAAoCkB,KAGjCC,GADclD,WAAarc,MAAMiR,KAAKoL,WAAWE,IAAIzY,QAAU,IAC1CvE,IAAK6Z,GAAMA,EAAE3c,MAAQ,eAC1CH,EAAY,CACjBsd,KAAM3d,kBAAkBujB,iBACxBX,mBACAT,QACAkB,QACA1hB,eAAgBlB,QAAQkB,eACxB2hB,OAAQA,EAAOjV,MAAM,EAAG,IACxBmV,YAAaF,EAAOpgB,OAEpB8e,YACCY,EAAiB1f,OAAS,EACvBkT,gBACAgK,WAAWE,IAAIla,IAAIwc,EAAiBA,EAAiB1f,OAAS,KAE9D,IAEL,OAAQzC,QAAQoB,mBACf,IAAK,QAEL,IAAK,QAGJ,MAAM,IAAI5B,cAAc,cAAcG,IAAWC,GAClD,IAAK,OACJI,QAAQ8B,KACP,cAAcnC,cAAoBkjB,EAAOjV,MAAM,EAAG,IAAIO,KAAK,QAAQ0U,EAAOpgB,OAAS,GAAK,MAAQ,OAIpG,CACA,MAAMkG,EAAKuZ,YAAYC,GAGvB,GAA4B,IAAxBxC,WAAWE,IAAIjZ,KAElB,WAIUtF,IAAPqH,GAAsB,UAAWga,IAAcA,EAAYtd,MAAQsD,EAExE,CAEA,GAAImX,cAAclZ,KAAO,EAAG,CAC3B,MAAMoc,EAAW1f,MAAMiR,KAAKuL,eAC5BA,cAAc7P,QACd,IAAK,MAAM5Q,KAAW2jB,EAAU3jB,GACjC,CACD,CACA,OAAOsjB,EAAYtd,KACpB,SACC+V,wBAAqB9Z,EACrBqe,gBAAare,EACbtB,QAAQQ,UACT,CACD,CACD,CACD,CAKO,MAAMyiB,OAASja,UAAU,CAC/BV,OAAOsC,GACC,YAAwB7I,GAC9B,MAAMmhB,EAAe,IAAMtY,EAASqB,MAAMnM,KAAMiC,GAGhD,OADA2B,OAAOoC,eAAeod,EAAc,OAAQ,CAAE7d,MAAO,UAAUuF,EAAS7K,UACjEub,MAAM4H,EAAc,YAC5B,EAED3a,QACCqC,GAEO,YAAwB7I,GAC9B,MAAMmhB,EAAe,IAAMtY,EAASqB,MAAMnM,KAAMiC,GAGhD,OADA2B,OAAOoC,eAAeod,EAAc,OAAQ,CAAE7d,MAAO,UAAUuF,EAAS7K,UACjEub,MAAM4H,EAAc,YAC5B,IAII/Z,GAAK,IAAIC,qBAAkCC,GAAMA,cAYvCqK,OAEf5O,EACAqe,GAIA9H,iBAAiBC,OAGjB,MAAMzZ,EAAYshB,GAAethB,WAAa7B,QAAQ6B,WAAa,SACnE,GAAI7B,QAAQgC,cAAcC,cAAe,CACxC,MAAMqW,GAAQ,IAAI7Y,OAAQ6Y,MAC1B,GAAIA,EAAO,CAEV,MAAM8K,EAAa9K,EAAM+K,MAAM,MAAMzV,MAAM,GAAGO,KAAK,MACnD0P,qBAAqBhY,IAAI+M,QAAQ9N,GAAKse,EACvC,CACD,CACA,IAAI/jB,EAA+B,KAEnC,MAAMikB,EAAmB/K,qBACnBgL,EAAczY,GAAgBwO,WAAWkK,EAAW1Y,GACpD2Y,EAAa3Y,GAAgBmO,gBAAgBqK,EAAkBxY,GACrE,IAAI4Y,GAAgB,EAChBC,GAAa,EACbC,EAAsC,KACtCC,EAAsC,KAE1C,SAASL,IAER,GAAInkB,EAAS,CACZ,MAAMykB,EAAczkB,EACpBA,EAAU,KACVia,gBAAWhY,EAAW,IAAMwiB,IAC7B,CAGA,GAAIF,EACH,GAAkB,WAAd/hB,GAA0BgiB,EAE7BA,IACAA,EAAiB,KACjBD,EAAiB,UACX,GAAkB,WAAd/hB,EAEV,OAMF,GAAI6hB,EAAe,OAGnB,IAAIK,EACAhhB,EAFJ/C,QAAQC,MAAM2S,QAAQ9N,IAGtB,IAEC,GADA/B,EAASuW,WAAWkK,EAAW,IAAM1e,EAAG,CAAEye,UAASE,SAAQO,SAAUL,KAEpE5gB,GACkB,mBAAXA,IACY,iBAAXA,KAAyB,SAAUA,IAE3C,MAAM,IAAIvD,cAAc,oDAAoDuD,KAE7E,GAAIA,GAA4B,iBAAXA,GAA8C,mBAAhBA,EAAO0X,KAAqB,CAC9E,MAAMwJ,EAAkBlhB,EAGxB,IAAImhB,EAA+C,KACnD,MAAMC,EAAgB,IAAIngB,QAAe,CAACogB,EAAGC,KAC5CH,EAAeG,IAGVC,EAAc,IAAI9kB,cAAc,uDAItCokB,EAAiB5f,QAAQugB,KAAK,CAACN,EAAiBE,IAGhDN,EAAiB,KACZK,GACHA,EAAaI,GAQhB,MAECP,EAAkBhhB,CAEpB,SACC4gB,GAAa,EACb3jB,QAAQG,MAAM2E,EACf,CAGAzF,EAAU,KACTA,EAAU,KACV0kB,MAEA,MAAMzJ,EAAgBtI,wBAAwBrM,IAAI6d,GAClD,GAAIlJ,EAAe,CAClB,IAAK,MAAMkK,KAAelK,EAAe,CACxC,MAAMD,EAAiBpI,SAAStM,IAAI6e,GACpC,GAAInK,EAAgB,CACnB,IAAK,MAAO7U,EAAMyO,KAASoG,EAAe/L,UACzC2F,EAAK7J,OAAOoZ,GACM,IAAdvP,EAAKrN,MACRyT,EAAejQ,OAAO5E,GAGI,IAAxB6U,EAAezT,MAClBqL,SAAS7H,OAAOoa,EAElB,CACD,CACAxS,wBAAwB5H,OAAOoZ,EAChC,CAEA,MAAMiB,EAAWvS,eAAevM,IAAI6d,GACpC,GAAIiB,EAAU,CACb,IAAK,MAAMC,KAAgBD,EAAUC,IACrCxS,eAAe9H,OAAOoZ,EACvB,EAEF,CAEAnR,aAAamR,EAAW1e,GAGpBqe,GAAewB,QAClBnH,cAAc/W,IAAI+c,GAGfvL,qBACH1C,uBAAuBiO,GAGxBlI,MAAMkI,EAAW,aAEjB,MAAMhP,EAAS8O,EAAiB,GAEhCnR,aAAatM,IAAI2d,EAAWhP,GAE5B,MAEMoQ,EAAa,KACdlB,IACJA,GAAgB,EAEZG,IACHA,IACAA,EAAiB,KACjBD,EAAiB,MAElBvkB,MAEA2f,uBAAuBwE,GACvBra,GAAGgB,WAAWya,KAEf,SAASC,EAAYlc,GAepB,OAdAjF,OAAOoC,eAAe6C,EAAIvJ,QAAS,CAClCuG,IAAG,IACK+d,IAGThgB,OAAOoC,eAAe6C,EAAIyY,UAAe,CACxC/b,MAAO,KACN,GAAIhG,EAAS,CACZ,MAAMykB,EAAczkB,EACpBA,EAAU,KACVia,gBAAWhY,EAAW,IAAMwiB,IAC7B,KAGKnb,CACR,CACA,IAjCsB6L,EAiCJ,CACjB,MAAMsQ,EAAkBD,EAAY,IAAMD,KAS1C,OARAzb,GAAGwB,SACFma,EACA,KACCF,IACA5kB,QAAQS,iBAAiBqE,IAE1B8f,GAEME,CACR,CAEA,IAAIL,EAAWvS,eAAevM,IAAI6O,GAC7BiQ,IACJA,EAAW,IAAIhhB,IACfyO,eAAerM,IAAI2O,EAAQiQ,IAE5B,MAAMM,EAAmBF,EAAY,KACpCJ,EAASra,OAAO2a,GACM,IAAlBN,EAAS7d,MACZsL,eAAe9H,OAAOoK,GAGvBoQ,MAID,OAFAH,EAAShe,IAAIse,GAENA,CACR,CAOM,SAAUC,UAAalgB,GAG5B,MAAMmgB,EAAsBlL,sBAC5BE,qBAAoB,GAEpB,IACC,OAAOnV,GACR,SAECmV,oBAAoBgL,EACrB,CACD,CAOM,SAAU3S,KAAQxN,GACvB,IAAI6D,EAIJ,OAHA2Q,gBAAWhY,EAAW,KACrBqH,EAAK7D,MAEC6D,CACR,UA8CgBuc,KACfC,EACAxf,EACAE,GAEmB,mBAARF,IACVE,EAAMF,EAAIE,IACVF,EAAMA,EAAIA,KAEX,MAAM2M,EAAOM,QAAQuS,GAMrB,OALAzR,OACCrB,aAAa,KACZ8S,EAASxf,MACP2M,IAEG2Q,OAAQ5d,IACdQ,EAAKR,GACDsa,YAAYE,IAAI9a,IAAIuN,IAGvBqN,WAAWE,IAAIzV,OAAOkI,IAGzB,CC75CO,MAAM8S,cAAgB,IAAIthB,QAGpBuhB,wBAA0B,IAAIthB,QAG9BuhB,aAAe,IAAIxhB,QAGnByhB,2BAA6B,IAAIzhB,iBAK9B0hB,iBAAiBC,EAAejR,EAAgBhP,GAC/D,IAAIkgB,EAAUN,cAAczf,IAAI8f,GAC3BC,IACJA,EAAU,IAAIjiB,IACd2hB,cAAcvf,IAAI4f,EAAOC,IAE1BA,EAAQjf,IAAI,CAAE+N,SAAQhP,QACvB,UAKgBmgB,oBAAoBF,EAAejR,EAAgBhP,GAClE,MAAMkgB,EAAUN,cAAczf,IAAI8f,GAClC,GAAIC,EAAS,CACZ,IAAK,MAAME,KAASF,EACnB,GAAIE,EAAMpR,SAAWA,GAAUoR,EAAMpgB,OAASA,EAAM,CACnDkgB,EAAQtb,OAAOwb,GACf,KACD,CAEoB,IAAjBF,EAAQ9e,MACXwe,cAAchb,OAAOqb,EAEvB,CACD,CAKM,SAAUI,oBAAoBtgB,GAEnC,QAAI8f,wBAAwBtgB,IAAIQ,IAEzBugB,0BAA0BvgB,EAClC,CAKM,SAAUwgB,eAAeC,EAAuBlR,GACrD,MAAM4Q,EAAUN,cAAczf,IAAIqgB,GAClC,GAAKN,EAEL,IAAK,MAAMlR,OAAEA,KAAYkR,EAAS,CAEjC,MAAMO,EAAqBX,aAAa3f,IAAI6O,GAC5C,GAAIyR,EAAoB,IAAK,MAAMC,KAAWD,EAAoB3K,MAAM4K,GAGxEH,eAAevR,EAChB,CACD,CAEA,SAASsR,0BAA0BvgB,GAClC,MAAMmgB,EAAUN,cAAczf,IAAIJ,GAClC,IAAKmgB,EAAS,OAAO,EAErB,IAAK,MAAMlR,OAAEA,KAAYkR,EAAS,CACjC,GAAIL,wBAAwBtgB,IAAIyP,GAAS,OAAO,EAChD,GAAIsR,0BAA0BtR,GAAS,OAAO,CAC/C,CACA,OAAO,CACR,CCzEA,MAAM2R,OAAS,IAAIriB,QAEb,SAAUsiB,SAAS7gB,EAAUuP,GAElC,MAAMiK,EAAO,CAAA,EACPsH,EAAQC,SAFd/gB,EAAMsU,OAAOtU,IAGT8gB,GAAO3iB,OAAOqY,OAAOsK,EAAO,CAAEvR,YAAWiK,SAC7CoH,OAAOtgB,IAAIN,EAAKwZ,EACjB,CAOM,SAAUuH,SAAS/gB,GACxBA,EAAMsU,OAAOtU,GACb,IAAI8gB,EAAQF,OAAOxgB,IAAIJ,GAKvB,OAJK8gB,IACJA,EAAQ,CAAA,EACRF,OAAOtgB,IAAIN,EAAK8gB,IAEVA,CACR,CAEM,SAAUE,eACfhhB,EACAuP,EACAT,EACAgG,KACGmM,GAEH,MAAMC,EAAepN,kBACrB,IAAK,MAAMjS,KAAQof,EAClB,IAAK,MAAMxf,KAAOI,EAAM,CACvB,MAAM6M,EAAOoG,EAAe1U,IAAIqB,GAChC,GAAIiN,EACH,IAAK,MAAMP,KAAUO,EAAM,CAC1B,MAAMyS,EAAelO,UAAU9E,GAC/B,GAAIgT,EAAc,CACjB1mB,QAAQgB,kBAAkB0S,EAAQgT,GAClC,QACD,CACKrS,EAAQtP,IAAI2O,KAChBW,EAAQ5N,IAAIiN,GACPkM,WAAWlM,IAASmJ,iBAAiBnJ,EAAQnO,EAAKuP,EAAW9N,IAEnE,MAAM2f,EAAWpJ,eAAe5X,IAAI+N,GAEpC,GADA+B,kBAAkBgR,EAAc/S,EAAQnO,EAAKyB,EAAK8N,GAC9C6R,EAAU,CACb,IAAK,MAAMC,KAAWD,EAAUC,EAAQrhB,EAAKuP,EAAW9N,GACxD2f,EAASvc,OAAOsJ,EACjB,CACD,CACF,CACF,UAQgBmT,SAASthB,EAAUuP,EAAsBtP,GACxD7E,QAAQ4E,EAAKuP,EAAW,CAACtP,GAC1B,UAQgB7E,QAAQ4E,EAAUuP,EAAsBgS,GAEvDV,SADA7gB,EAAMsU,OAAOtU,GACCuP,GACd,MAAMuF,EAAiBpI,SAAStM,IAAIJ,GACpC,GAAI8U,EAAgB,CAEnB,MAAMhG,EAAU,IAAI5Q,IAChBqjB,EAAOP,eAAehhB,EAAKuP,EAAWT,EAASgG,EAAgB,CAACnb,UAAW4nB,GAC1EP,eAAehhB,EAAKuP,EAAWT,EAASgG,EAAgBA,EAAejT,QAC5EpH,QAAQW,QAAQ4E,EAAKuP,EAAWgS,EAA4BzS,GAC5DiH,MAAMhY,MAAMiR,KAAKF,GAClB,CAGIgR,wBAAwBtgB,IAAIQ,IAC/BwgB,eAAexgB,EAEjB,UAMgBwhB,cAAcxhB,EAAUuP,EAAsBtP,GAC7DD,EAAMsU,OAAOtU,GACb,MAAM8U,EAAiBpI,SAAStM,IAAIJ,GACpC,IAAK8U,EAAgB,OAErB,MAAMpG,EAAOoG,EAAe1U,IAAIH,GAChC,IAAKyO,EAAM,OAEX,MAAMI,EAAU,IAAI5Q,IACdgjB,EAAepN,kBAErB,IAAK,MAAM3F,KAAUO,EAAM,CAC1B,IAAKuJ,cAAczY,IAAI2O,GAAS,SAEhC,MAAMgT,EAAelO,UAAU9E,GAC/B,GAAIgT,EAAc,CACjB1mB,QAAQgB,kBAAkB0S,EAAQgT,GAClC,QACD,CACArS,EAAQ5N,IAAIiN,GACZmJ,iBAAiBnJ,EAAQnO,EAAKuP,EAAWtP,GACzC,MAAMmhB,EAAWpJ,eAAe5X,IAAI+N,GAEpC,GADA+B,kBAAkBgR,EAAc/S,EAAQnO,EAAKC,EAAMsP,GAC/C6R,EAAU,CACb,IAAK,MAAMC,KAAWD,EAAUC,EAAQrhB,EAAKuP,EAAWtP,GACxDmhB,EAASvc,OAAOsJ,EACjB,CACD,CAEIW,EAAQzN,KAAO,IAClB5G,QAAQW,QAAQ4E,EAAKuP,EAAW,CAACtP,GAAO6O,GACxCiH,MAAMhY,MAAMiR,KAAKF,IAEnB,CCvIO,MAAM2S,mBAAqB,IAAIjjB,QACzBkjB,WAAa,IAAIxjB,IACjByjB,OAASpoB,OAAO,UAE7B,SAASqoB,mBAAuC5hB,GAC/C,IAAK,MAAM6hB,KAAK7hB,EAAK,CACpB,IACC7B,OAAOoC,eAAeshB,EAAGroB,gBAAiB,CACzCsG,OAAO,EACPW,UAAU,EACVC,YAAY,EACZF,cAAc,GAEhB,CAAE,MAAO,CACHhH,mBAAoBqoB,GAAeJ,mBAAmBvgB,IAAI2gB,EACjE,CACA,OAAO7hB,EAAI,EACZ,CAEM,SAAU8hB,oBAA+DC,GAC9E,IAAK,MAAMxb,KAAKwb,EAASxb,IAAIA,EAAExE,UAAkBvI,kBAAmB,GACpE,OAAOuoB,EAAI,EACZ,CAEM,SAAUC,cAAchiB,GAC7B,GAAY,OAARA,GAA+B,iBAARA,EAAkB,OAAO,EACpD,GAAIyhB,mBAAmBjiB,IAAIQ,GAAM,OAAO,EACxC,GAAKA,EAAYxG,iBAAkB,OAAO,EAC1C,IAAK,MAAM+F,KAAMmiB,WAAY,GAAIniB,EAAGS,GAAM,OAAO,EACjD,OAAO,CACR,CAEM,SAAUiiB,yBACfC,EACAC,GAEAD,EAAcngB,UAAUzI,gBAAkB6oB,EAC1CL,iBAAiBK,EAClB,CChCA,SAASC,WAAStiB,GACjB,MAAwB,iBAAVA,GAAgC,OAAVA,CACrC,CAEA,SAASuiB,aAAaviB,GACrB,OAAOsiB,WAAStiB,EACjB,CAEA,SAASwiB,kBAAkBxiB,GAC1B,GAAKuiB,aAAaviB,GAAlB,CACA,GAAI/B,MAAMC,QAAQ8B,GAAQ,OAAO/B,MAAMgE,UACvC,IACC,OAAOjC,EAAM3F,WACd,CAAE,MACD,MACD,CAN0C,CAO3C,CAEM,SAAUooB,mBAAmBC,EAAeC,GACjD,OAAID,IAAaC,OACZJ,aAAaG,KAAcH,aAAaI,OACzCT,cAAcQ,KAAaR,cAAcS,IACtCH,kBAAkBE,KAAcF,kBAAkBG,IAC1D,CAUM,SAAUC,qBACfC,EACA1iB,EACAuiB,EACAC,EACAG,GAEA,MAAMrT,EAAuB,CAAE2B,KAAM0R,EAAc,MAAQ,MAAO3iB,QAElE,GACCxF,QAAQ4B,wBACKN,IAAbymB,GACAD,mBAAmBC,EAAUC,GAC5B,CACD,MACMI,EAAS,CAAE7iB,IADIsU,OAAOqO,GACQ1iB,QAGpC6iB,sBAAsBC,eAAeP,EAAUC,EAAU,IAAIlkB,QAAW,GAAIskB,IAG5ErB,cAAcmB,EAAWpT,EAAWtP,EACrC,MACCqhB,SAASqB,EAAWpT,EAAWtP,EAEjC,CAUA,SAAS+iB,eAAe5P,EAAuB6P,EAAgBC,GAC9D,IAAIC,EAAS/P,EAAQhT,IAAI6iB,GAKzB,OAJKE,IACJA,EAAS,IAAI3kB,QACb4U,EAAQ9S,IAAI2iB,EAAQE,MAEjBA,EAAO3jB,IAAI0jB,KACfC,EAAOjiB,IAAIgiB,IACJ,EACR,CAEA,SAASE,kBAAkBpjB,GAC1B,MAAM6B,EAAO,IAAI3D,IAAiBc,QAAQqkB,QAAQrjB,IAClD,IAAIsjB,EAAQnlB,OAAO6C,eAAehB,GAIlC,KAAOsjB,IAAUnlB,OAAOolB,OAAOD,EAAO,gBAAgB,CACrD,IAAK,MAAM7hB,KAAOzC,QAAQqkB,QAAQC,GAAQzhB,EAAKX,IAAIO,GACnD6hB,EAAQnlB,OAAO6C,eAAesiB,EAC/B,CACA,OAAOzhB,CACR,CAEM,SAAUkhB,eACfP,EACAC,EACArP,EAAwB,IAAI7U,QAC5BilB,EAAuC,GACvCX,GAEA,OAAKN,mBAAmBC,EAAUC,IAC7BJ,aAAaG,IAAcH,aAAaI,GACzCO,eAAe5P,EAASoP,EAAUC,GAAkBe,EAEpDzlB,MAAMC,QAAQwkB,IAAazkB,MAAMC,QAAQykB,IAC5CgB,kBAAkBjB,EAAUC,EAAUrP,EAASoQ,EAAeX,GACvDW,IAGRE,qBAAqBlB,EAAUC,EAAUrP,EAASoQ,EAAeX,GAC1DW,GAV6CA,CAWrD,CAEA,SAASC,kBACRE,EACAC,EACAC,EACAL,EACAX,GAEA,MAAMiB,EAA+B,GAC/BC,EAAYJ,EAASzmB,OACrB8mB,EAAYJ,EAAS1mB,OACrB+mB,EAAM7mB,KAAK6mB,IAAIF,EAAWC,GAEhC,IAAK,IAAIjd,EAAQ,EAAGA,EAAQkd,EAAKld,IAAS,CACzC,MAAMmd,EAASnd,EAAQgd,EACjBI,EAASpd,EAAQid,EACvB,GAAIE,IAAWC,EAAQ,CACtBL,EAAMnmB,KAAK,CAAE0E,OAAQshB,EAAUpU,UAAW,CAAE2B,KAAM,MAAOjR,KAAM8G,GAAS9G,KAAM8G,EAAO8b,WACrF,QACD,CACA,IAAKqB,GAAUC,EAAQ,CACtBL,EAAMnmB,KAAK,CAAE0E,OAAQshB,EAAUpU,UAAW,CAAE2B,KAAM,MAAOjR,KAAM8G,GAAS9G,KAAM8G,EAAO8b,WACrF,QACD,CACA,IAAKqB,IAAWC,EAAQ,SACxB,MAAMC,EAAW9P,OAAOqP,EAAS5c,IAC3Bsd,EAAW/P,OAAOsP,EAAS7c,IAC5B5I,OAAOmmB,GAAGF,EAAUC,IACxBP,EAAMnmB,KAAK,CAAE0E,OAAQshB,EAAUpU,UAAW,CAAE2B,KAAM,MAAOjR,KAAM8G,GAAS9G,KAAM8G,EAAO8b,UAEvF,CAEIkB,IAAcC,GACjBF,EAAMnmB,KAAK,CACV0E,OAAQshB,EACRpU,UAAW,CAAE2B,KAAM,MAAOjR,KAAM,UAChCA,KAAM,SACN4iB,WAGFW,EAAc7lB,QAAQmmB,EACvB,CAEA,SAASJ,qBACRT,EACAC,EACA9P,EACAoQ,EACAX,GAEA,MAAM0B,EAAUnB,kBAAkBH,GAC5BuB,EAAUpB,kBAAkBF,GAC5BY,EAA+B,GAErC,IAAK,MAAMriB,KAAO8iB,EACZC,EAAQhlB,IAAIiC,IAChBqiB,EAAMnmB,KAAK,CAAE0E,OAAQ4gB,EAAQ1T,UAAW,CAAE2B,KAAM,MAAOjR,KAAMwB,GAAOxB,KAAMwB,EAAKohB,WAEjF,IAAK,MAAMphB,KAAO+iB,EACZD,EAAQ/kB,IAAIiC,IAChBqiB,EAAMnmB,KAAK,CAAE0E,OAAQ4gB,EAAQ1T,UAAW,CAAE2B,KAAM,MAAOjR,KAAMwB,GAAOxB,KAAMwB,EAAKohB,WAEjF,IAAK,MAAMphB,KAAO+iB,EAAS,CAC1B,IAAKD,EAAQ/kB,IAAIiC,GAAM,SACvB,MAAM2iB,EAAW9P,OAAQ2O,EAAexhB,IAClC4iB,EAAW/P,OAAQ4O,EAAezhB,IACpC8gB,mBAAmB6B,EAAUC,GAChCtB,eAAeqB,EAAUC,EAAUjR,EAASoQ,EAAeX,GAChD1kB,OAAOmmB,GAAGF,EAAUC,IAC/BP,EAAMnmB,KAAK,CAAE0E,OAAQ4gB,EAAQ1T,UAAW,CAAE2B,KAAM,MAAOjR,KAAMwB,GAAOxB,KAAMwB,EAAKohB,UAEjF,CAEAW,EAAc7lB,QAAQmmB,EACvB,CAKA,SAASW,iBAAiBtW,EAAwBuW,GACjD,IAAIpU,EAAsCnC,EAC1C,MAAMiF,EAAU,IAAI5U,QACpB,KAAO8R,IAAY8C,EAAQ5T,IAAI8Q,IAAU,CAExC,GADA8C,EAAQlS,IAAIoP,GACRoU,EAAWllB,IAAI8Q,GAAU,OAAO,EACpCA,EAAU1D,aAAaxM,IAAIkQ,EAC5B,CACA,OAAO,CACR,CAEM,SAAUwS,sBAAsBU,GACrC,IAAKA,EAActmB,OAAQ,OAC3B,MAAMynB,EAAkB,IAAIzmB,IAGtB2kB,EAASW,EAAc,IAAIX,OACjC,IAAI+B,EAGJ,GAAI/B,EAAQ,CACX+B,EAAiB,IAAI1mB,IACrB,MAAM2mB,EAAiBnY,SAAStM,IAAIyiB,EAAO7iB,KAC3C,GAAI6kB,EAAgB,CACnB,MAAMC,EAAgB,IAAI5mB,IAC1B8iB,eACC6B,EAAO7iB,IACP,CAAEkR,KAAM,MAAOjR,KAAM4iB,EAAO5iB,MAC5B6kB,EACAD,EACA,CAAClrB,UACD,CAACkpB,EAAO5iB,OAET,IAAK,MAAMkO,KAAU2W,EAAeF,EAAe1jB,IAAIiN,EACxD,CAEA,GAA4B,IAAxByW,EAAevjB,KAAY,MAChC,CAEA,IAAK,MAAMgB,OAAEA,EAAMkN,UAAEA,EAAStP,KAAEA,KAAUujB,EAAe,CACxD,IAAKnB,aAAahgB,GAAS,SAC3B,MAAMrC,EAAMsU,OAAOjS,GACnBwe,SAAS7gB,EAAKuP,GACd,MAAMuF,EAAiBpI,SAAStM,IAAIJ,GACpC,IAAI+kB,EACJ,MAAMC,EAAa,CAAC/kB,GACpB,GAAI6U,EAAgB,CAMnB,GALAiQ,EAAiB,IAAI7mB,IACrB8iB,eAAehhB,EAAKuP,EAAWwV,EAAgBjQ,EAAgB,CAACnb,UAAWqrB,GAIvEnC,GAAU+B,EAAgB,CAC7B,MAAMK,EAAkB,IAAI/mB,IAC5B,IAAK,MAAMiQ,KAAU4W,GAEhBH,EAAeplB,IAAI2O,IAAWsW,iBAAiBtW,EAAQyW,KAC1DK,EAAgB/jB,IAAIiN,GAGtB4W,EAAiBE,CAClB,CAEA,IAAK,MAAM9W,KAAU4W,EAAgBJ,EAAgBzjB,IAAIiN,EAC1D,CACA1T,QAAQW,QAAQ4E,EAAKuP,EAAWyV,EAAYD,GACxCjF,wBAAwBtgB,IAAIQ,IAAMwgB,eAAexgB,EACtD,CACI2kB,EAAgBtjB,MAAM0U,MAAM,IAAI4O,GACrC,CDjOA7C,iBAAiB1jB,KAAMc,OAAQhF,MAAOuE,QAASJ,UACzB,oBAAXgU,SACVuP,gBAAgBvP,OAAQ6S,UACxBpD,iBAAiB3hB,KAAMglB,QAASC,YAAaC,cEZ9C,MAAMC,WAAoB,GACpBC,iBAAmB,CACxB,CAAChsB,OAAO6K,aAAc,iBACtB,GAAAhE,CAAIJ,EAAUC,EAAmBC,GAChC,GAAID,IAASzG,gBAAiB,OAAO,EACrC,MAAMgsB,EAAelR,OAAOtU,GAE5B,GAAIwlB,EAAa/rB,uBAAuB+F,IAAIS,IAAyB,iBAATA,EAC3D,OAAOF,WAAWC,EAAKC,EAAMC,GAM7BxG,uBAAuBsG,GAEvBA,EAAItG,+BAAgCqE,OACpB,iBAATkC,IACG,WAATA,IAAsBb,OAAO8H,MAAM9H,OAAOa,MAE3C0U,UAAU3U,EAAc,WAATC,EAAoB,SAAWb,OAAOa,IAGtD,MAAMwlB,EAAUzmB,QAAQQ,IAAIU,EAAUD,GAChCylB,EAAYD,GAAWtnB,OAAOolB,OAAOrjB,EAAUD,GAC/C0lB,EAAoBF,IAAYC,EAIhCE,EACLnrB,QAAQ2B,iBACRspB,IACC/kB,cAAcT,EAAUD,IAASU,cAAc6kB,EAAcvlB,IAW/D,GAPEwlB,IACEhrB,QAAQ0B,iBAAmBwpB,GAAqB3lB,aAAe7B,QAChEynB,IAEFjR,UAAU3U,EAAKC,GAGZ0lB,KAAuBlrB,QAAQ0B,mBAAqB6D,aAAe7B,SAAU,CAChF,IAAImS,EAAUuV,eAAe1nB,OAAO6C,eAAehB,IACnD,KAAOsQ,GAAWA,IAAYnS,OAAO4D,YACpC4S,UAAUrE,EAASrQ,IACf9B,OAAOolB,OAAOjT,EAASrQ,KAFoB,CAG/C,IAAIuZ,EAAOqM,eAAe1nB,OAAO6C,eAAesP,IAC5CkJ,IAASlJ,IACZkJ,EAAOqM,eAAe1nB,OAAO6C,eAAesT,OAAOhE,MAEpDA,EAAUkJ,CACX,CACD,CACA,MAAM1Z,EAAQC,WAAWC,EAAKC,EAAMC,GACpC,GAAqB,iBAAVJ,GAAgC,OAAVA,EAAgB,CAChD,MAAMgmB,EAAgBD,eAAe/lB,GAOrC,OAJIwgB,oBAAoBtgB,IACvBigB,iBAAiB6F,EAAe9lB,EAAKC,GAG/B6lB,CACR,CACA,OAAOhmB,CACR,EACA,GAAAQ,CAAIN,EAAUC,EAAmBH,EAAYI,GAE5C,MAAMslB,EAAelR,OAAOtU,GACtB+lB,EAAoBzR,OAAOpU,GAGjC,GAAIslB,EAAa/rB,uBAAuB+F,IAAIS,IAASulB,IAAiBO,EACrE,OAAO1lB,WAAWL,EAAKC,EAAMH,EAAOI,GAErC,MAAM8lB,EACLtsB,uBAAuBsG,GAEvBA,EAAItG,+BAAgCqE,SAClCqB,OAAO8H,MAAM9H,OAAOa,KAAmB,WAATA,GAC3BwiB,EAAWnO,OAAOxU,GAExB,GAAIkmB,EAEH,OADEhmB,EAAYC,GAAQwiB,GACf,EAIR,IAAIwD,EAAStE,OACb,GAAI3iB,QAAQQ,IAAIumB,EAAmB9lB,GAAO,CAEpB9B,OAAO0C,yBAAyBklB,EAAmB9lB,GACrD9B,OAAO0C,yBAAyB2kB,EAAcvlB,GAKhEgmB,EAASlS,gBAAWhY,EAAW,IAAMiD,QAAQoB,IAAIolB,EAAcvlB,EAAMC,GAIvE,CACA,GAAI4f,wBAAwBtgB,IAAIQ,KACT,iBAAXimB,GAAkC,OAAXA,GACjC7F,oBAAoB6F,EAAQjmB,EAAKC,GAEV,iBAAbwiB,GAAsC,OAAbA,GAAmB,CAEtDxC,iBADsB4F,eAAepD,GACLziB,EAAKC,EACtC,CAUD,OAPIgmB,IAAWxD,GAGVpiB,WAAWL,EAAKC,EAAMwiB,EAAUviB,IACnCwiB,qBAAqB1iB,EAAKC,EAAMgmB,EAAQxD,EAAUwD,IAAWtE,SAGxD,CACR,EACA,GAAAniB,CAAIQ,EAAUC,GACb,GAAIqlB,WAAW7iB,SAASzC,GACvB,MAAM,IAAI/F,cACT,wEAAwEkF,OAAOc,MAC/E,CACC0X,KAAM3d,kBAAkBkiB,cACxBC,MAAO,KAGVmJ,WAAW3nB,KAAKqC,GAChB2U,UAAU3U,EAAKC,GACf,MAAMmD,EAAKpE,QAAQQ,IAAIQ,EAAKC,GAE5B,OADAqlB,WAAW7N,MACJrU,CACR,EACA,cAAA8iB,CAAelmB,EAAUC,GACxB,IAAK9B,OAAOolB,OAAOvjB,EAAKC,GAAO,OAAO,EAEtC,MAAMgmB,EAAUjmB,EAAYC,GAe5B,OAZI6f,wBAAwBtgB,IAAIQ,IAA0B,iBAAXimB,GAAkC,OAAXA,GACrE7F,oBAAoB6F,EAAQjmB,EAAKC,UAG1BD,EAAYC,GACpBqhB,SAASthB,EAAK,CAAEkR,KAAM,MAAOjR,QAAQA,GAGjC6f,wBAAwBtgB,IAAIQ,IAC/BwgB,eAAexgB,IAGT,CACR,EACAgB,eAAehB,GACVtG,uBAAuBsG,EAAYA,EAAItG,qBACpCyE,OAAO6C,eAAehB,GAE9B8E,eAAc,CAAC9E,EAAUsjB,MACpB5pB,uBAAuBsG,KAC3B7B,OAAO2G,eAAe9E,EAAKsjB,IACpB,GAERD,QAAQrjB,IACP2U,UAAU3U,EAAKrG,UACRqF,QAAQqkB,QAAQrjB,KAInBmmB,gBAAkB,IAAI3nB,QAOf4nB,aAAexa,MAAOrH,GAClC,cAA4BA,EAC3B,WAAApK,IAAeqC,GAKd,OAJAlC,SAASkC,GAIF2pB,gBAAgB3mB,gBAAkB6mB,SAAS9rB,MAAQA,IAC3D,IAIF,SAASsrB,eAAkBS,GAC1B,IAAKA,GAAkC,iBAAdA,EAAwB,OAAOA,EACxD,MAAMjkB,EAASikB,EAEf,GAAItE,cAAc3f,GAAS,OAAOA,EAElC,GADgB4R,cAAczU,IAAI6C,GACrB,OAAOA,EAGpB,MAAM4K,EAAWmH,iBAAiB/R,GAClC,QAAiBtG,IAAbkR,EAAwB,OAAOA,EAEnC,MAAMsZ,IACLjtB,kBAAkB+I,IAAYA,aAAkBA,EAAO/I,gBAEpD+I,EADA,IAAIA,EAAO/I,gBAAgB+I,GAE3BkkB,IAAYlkB,GAAQgS,iBAAiBkS,EAASlkB,GAClD,MAAM8R,EAAQ,IAAIlV,MAAMsnB,EAAShB,kBAIjC,OADArR,uBAAuB7R,EAAQ8R,GACxBA,CACR,CAMO,MAAMkS,SAAW5iB,UAAU,CACjC,MAAM4B,GACL,GAAIA,EAAStD,qBAAqBqkB,aAEjC,OADAD,gBAAgBjlB,IAAImE,GACbA,EAGR,MAAMmhB,UAAiBnhB,EACtB,WAAAlL,IAAeqC,GAQd,OAPAlC,SAASkC,gBACUgqB,GAAaL,gBAAgB3mB,iBAC/C/E,QAAQ8B,KACP,GAAI8I,EAAiB7K,8BAA8BD,KAAKJ,YAAYK,6HAI/D6rB,SAAS9rB,KACjB,EAKD,OAHA4D,OAAOoC,eAAeimB,EAAU,OAAQ,CACvC1mB,MAAO,YAAYuF,EAAS7K,UAEtBgsB,CACR,EACApmB,IAAIiF,GACIwgB,eAAexgB,GAEvBrC,QAAS6iB,iBC7QV,SAASzD,SAAStiB,GACjB,MAAwB,iBAAVA,GAAgC,OAAVA,CACrC,CA2BM,SAAU2mB,UACfpkB,EACAiH,GACAqS,UAAEA,GAAY,GAAU,IAExB,GAAItZ,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,MAAM,IAAInI,MAAM,6CAEhD,MAAMwsB,EAAkC5Z,aAAa,IAAMxD,EAASjH,GAASiH,GAG7E,OAAO6E,OAAO,KAEb2R,wBAAwB5e,IAAImB,GAG5B,IAAI0S,EAAgBiL,2BAA2B5f,IAAIsmB,GAC9C3R,IACJA,EAAgB,IAAI7W,IACpB8hB,2BAA2B1f,IAAIomB,EAAiB3R,IAEjDA,EAAe7T,IAAImB,GAInB,MAAM+Q,EAAU,IAAI5U,QA0EpB,OAzEA,SAASmoB,EAAiB3mB,EAAUoJ,EAAQ,GAE3C,GAAKpJ,IAAOoT,EAAQ5T,IAAIQ,IAASoiB,SAASpiB,MAAQoJ,EAAQ3O,QAAQyB,qBAE9D8lB,cAAchiB,GAAlB,CACAoT,EAAQlS,IAAIlB,GAGZ8f,wBAAwB5e,IAAIlB,GAC5B+U,EAAe7T,IAAIlB,GAInB,IAAK,MAAMyB,KAAO6S,OAAOtU,GACxB,GAAI7B,OAAOolB,OAAOvjB,EAAKyB,GAAM,CAE5B,MAAM3B,EAASE,EAAYyB,GAI3BklB,EADkB,iBAAV7mB,GAAgC,OAAVA,EAAiBumB,SAASvmB,GAASA,EACjCsJ,EAAQ,EACzC,CAKD,GAAIrL,MAAMC,QAAQgC,IAAQA,aAAejC,MAAO,CAE/C,MAAMb,EAAS8C,EAAI9C,OAGnB,IAAK,IAAIO,EAAI,EAAGA,EAAIP,EAAQO,IAAK,CAEhC,MAAMqC,EAAQE,EAAIvC,GAIlBkpB,EADkB,iBAAV7mB,GAAgC,OAAVA,EAAiBumB,SAASvmB,GAASA,EACjCsJ,EAAQ,EACzC,CACD,MAEK,GAAIpJ,aAAe9B,IAEvB,IAAK,MAAM4B,KAASE,EAAK,CAIxB2mB,EADkB,iBAAV7mB,GAAgC,OAAVA,EAAiBumB,SAASvmB,GAASA,EACjCsJ,EAAQ,EACzC,MAGI,GAAIpJ,aAAe1B,IAEvB,IAAK,MAAOyM,EAAMjL,KAAUE,EAAK,CAIhC2mB,EADkB,iBAAV7mB,GAAgC,OAAVA,EAAiBumB,SAASvmB,GAASA,EACjCsJ,EAAQ,EACzC,CAtDuB,CA0DzB,CAIAud,CAAiBtkB,GAGbsZ,GAAWrS,EAASjH,GACxBsZ,GAAY,EAGL,KAEN,MAAM5G,EAAgBiL,2BAA2B5f,IAAIsmB,GACrD,GAAI3R,EAAe,CAElB,IAAK,MAAM/U,KAAO+U,EAAe,CAEhC,MAAMrI,EAAWqT,aAAa3f,IAAIJ,GAC9B0M,GAEHA,EAAS7H,OAAO6hB,GAGM,IAAlBha,EAASrL,OACZ0e,aAAalb,OAAO7E,GACpB8f,wBAAwBjb,OAAO7E,KAIhC8f,wBAAwBjb,OAAO7E,EAEjC,CAGAggB,2BAA2Bnb,OAAO6hB,EACnC,IAGH,OCrJa5sB,QAAUP,OAAO,WAIxBqtB,SAAWrtB,OAAO,aAgDlB,SAAUstB,MACf/mB,EACAgnB,EACArsB,EAAe,CAAA,GAEf,MAAwB,mBAAVqF,EACXinB,cAAcjnB,EAAOgnB,EAASrsB,GACb,iBAAVqF,GAAgC,OAAVA,EAC5BknB,YAAYlnB,EAAOgnB,EAASrsB,GAC5B,MACA,MAAM,IAAIP,MAAM,+CAChB,EAFA,EAGL,CAEA,SAAS8sB,YACRlnB,EACAgnB,GACAnL,UAAEA,GAAY,EAAKsL,KAAEA,GAAO,GAAU,IAEtC,MAAMC,EAAiBpT,kBACvB,OAAImT,EAAaR,UAAU3mB,EAAOgnB,EAAS,CAAEnL,cACtCxN,OACN,WACCwG,UAAU7U,GACN6b,GAAW5H,WAAWmT,EAAgB,IAAMJ,EAAQhnB,IACxD6b,GAAY,CACb,EAEF,CAEA,SAASoL,cACRjnB,EACAgnB,GACAnL,UAAEA,GAAY,EAAKsL,KAAEA,GAAO,GAAU,IAEtC,MAAMC,EAAiBpT,kBACvB,IACIqT,EADA3E,EAAgCoE,SAEpC,MAAMQ,EAAYjZ,OACjBrB,aAAa,SAA6Bua,GACzC,MAAM5E,EAAW3iB,EAAMunB,GACnB7E,IAAaC,GAChB1O,WACCmT,EACA,KACK1E,IAAaoE,SACZjL,GAAWmL,EAAQrE,GACjBqE,EAAQrE,EAAUD,GACzBA,EAAWC,EACPwE,IACCE,GAAaA,IACjBA,EAAcV,UACbhE,EACC3iB,GAAUgnB,EAAQhnB,EAAYA,MAKrC,EAAGA,IAEJ,MAAO,KACNsnB,IACID,GAAaA,IAEnB,CAUA,SAASG,gBAAmBtnB,GAE3B,GAAIgiB,cADJhiB,EAAMsU,OAAOtU,IACW,OAAOA,EAC/B,IACC7B,OAAOoC,eAAeP,EAAexG,gBAAiB,CACrDsG,OAAO,EACPW,UAAU,EACVC,YAAY,EACZF,cAAc,GAEhB,CAAE,MAAO,CAGT,OAFMhH,mBAAoBwG,GAAiByhB,mBAAmBvgB,IAAIlB,GAE3DA,CACR,CAGA,SAASunB,sBACRC,KACGhrB,GAEH,MAAuB,iBAATgrB,EACXF,gBAAgBE,GACbniB,IAEHA,EAAStD,UAAUtI,sBAAwB,IAAIyE,IAC9CmH,EAAStD,UAAUtI,uBAAyB,IAG7C4L,EAAStD,UAAUtI,sBAAsByH,IAAIsmB,GAC7C,IAAK,MAAMC,KAAOjrB,EAAM6I,EAAStD,UAAUtI,sBAAsByH,IAAIumB,GACrE,OAAOpiB,CACP,CACJ,CAKO,MAAMqiB,WAAajkB,UAAU,CACnC,MAAM4B,GAELyc,iBAAiBzc,EAClB,EACArC,QAASukB,wBAKJ,SAAUI,UAA4B3nB,EAAQ4b,GACnD,OAAOzd,OAAOoC,eAAeP,EAAKlG,QAAS,CAC1CgG,MAAO8b,EACPnb,UAAU,EACVC,YAAY,EACZF,cAAc,GAEhB,CASM,SAAUonB,QAAWC,GAI1B,MAAMzkB,EAAK,CAAEtD,WAAO/D,GACpB,OAAO4rB,UACNvkB,EACAqc,UAAU,IACTtR,OACC,SAAuBkZ,GACtBjkB,EAAGtD,MAAQ+nB,EAAQR,EACpB,IAIJ,CCjNM,SAAWS,qBAAwBxgB,GACxC,IAAI9J,EAAS8J,EAASkS,OACtB,MAAQhc,EAAOuqB,YACR1B,SAAS7oB,EAAOsC,OACtBtC,EAAS8J,EAASkS,MAEpB,CAKM,SAAWwO,4BAAkC1gB,GAClD,IAAI9J,EAAS8J,EAASkS,OACtB,MAAQhc,EAAOuqB,MAAM,CACpB,MAAOtmB,EAAK3B,GAAStC,EAAOsC,WACtB,CAACumB,SAAS5kB,GAAM4kB,SAASvmB,IAC/BtC,EAAS8J,EAASkS,MACnB,CACD,CCxBO,MAAMyO,SAAS1uB,OAAO,UACvByE,QAAUD,MAAMC,QACtBD,MAAMC,QAAY8B,GACjB9B,QAAQ8B,IACPA,GACiB,iBAAVA,GACPpG,uBAAuBoG,GACvB/B,MAAMC,QAAQ8B,EAAMpG,4BACTwuB,kBAIZ,EAAAhf,CAAGnC,GACF,MAAMohB,EAAcphB,EAAQ,EAAIxM,KAAK0tB,UAAQ/qB,OAAS6J,EAAQA,EAE9D,GADA4N,UAAUpa,KAAM4tB,KACZA,EAAc,GAAKA,GAAe5tB,KAAK0tB,UAAQ/qB,QACnD,OAAOmpB,SAAS9rB,KAAK0tB,UAAQE,GAC9B,CAGA,UAAA5e,GAEC,OADAoL,UAAUpa,MACH8rB,SAAS9rB,KAAK0tB,UAAQ1e,aAC9B,CAEA,QAAAE,CAASC,GAER,OADAiL,UAAUpa,MACH8rB,SAAS9rB,KAAK0tB,UAAQxe,SAASC,GACvC,CAEA,SAAAE,CAAUtB,EAAeuB,KAAyBpB,GAEjD,OADAkM,UAAUpa,WACawB,IAAhB8N,EACJtP,KAAK0tB,UAAQre,UAAUtB,GACvB/N,KAAK0tB,UAAQre,UAAUtB,EAAOuB,KAAgBpB,EAClD,CAEA,KAAK1B,EAAejH,GAEnB,OADA6U,UAAUpa,MACH8rB,SAAS9rB,KAAK0tB,UAAQne,KAAK/C,EAAOjH,GAC1C,CAGA,OAAAiJ,GAEC,OADA4L,UAAUpa,MACHytB,4BAA4BztB,KAAK0tB,UAAQlf,UACjD,CAEA,IAAAlH,GAEC,OADA8S,UAAUpa,KAAM,UACTA,KAAK0tB,UAAQpmB,MACrB,CAEA,MAAAiH,GAEC,OADA6L,UAAUpa,MACHutB,qBAAqBvtB,KAAK0tB,UAAQnf,SAC1C,CAEA,CAACvP,OAAO+N,YACPqN,UAAUpa,MACV,MAAM6tB,EAAiB7tB,KAAK0tB,UAAQ1uB,OAAO+N,YAC3C,MAAO,CACN,IAAAkS,GACC,MAAMhc,EAAS4qB,EAAe5O,OAC9B,OAAIhc,EAAOuqB,KACHvqB,EAED,CAAEsC,MAAOumB,SAAS7oB,EAAOsC,OAAQioB,MAAM,EAC/C,EAEF,CAEA,OAAA/hB,CAAQkC,EAAoBC,GAC3BwM,UAAUpa,MACV,MAAM8tB,EAAkB/T,OAAOpM,GAEzBnB,EAAQxM,KAAK0tB,UAAQjiB,QAAQqiB,EAAiBlgB,GACpD,OAAc,IAAVpB,EAAqBA,EAElBxM,KAAK0tB,UAAQjiB,QAAQkC,EAAeC,EAC5C,CAEA,WAAAC,CAAYF,EAAoBC,GAC/BwM,UAAUpa,MACV,MAAM8tB,EAAkB/T,OAAOpM,GAEzBnB,EAAQxM,KAAK0tB,UAAQ7f,YAAYigB,EAAiBlgB,GACxD,OAAc,IAAVpB,EAAqBA,EAElBxM,KAAK0tB,UAAQ7f,YAAYF,EAAeC,EAChD,CAEA,QAAA1F,CAASyF,EAAoBC,GAC5BwM,UAAUpa,MACV,MAAM8tB,EAAkB/T,OAAOpM,GAE/B,OACC3N,KAAK0tB,UAAQxlB,SAAS4lB,EAAiBlgB,IACvC5N,KAAK0tB,UAAQxlB,SAASyF,EAAeC,EAEvC,CAIA,IAAAL,CAAKwgB,EAAyB9gB,GAE7B,GADAmN,UAAUpa,MACwB,mBAAvB+tB,EAAmC,CAC7C,MAAM7gB,EAAY6gB,EAMlB,OAAOjC,SACN9rB,KAAK0tB,UAAQngB,KACZ,CAAChI,EAAOiH,EAAOwhB,IAAU9gB,EAAUxF,KAAKuF,EAAS6e,SAASvmB,GAAQiH,EAAOwhB,GACzE/gB,GAGH,CACA,MAAMW,EAA+B,iBAAZX,EAAuBA,OAAUzL,EACpDgL,EAAQxM,KAAK0tB,UAAQjiB,QAAQsiB,EAAoBngB,GACvD,IAAc,IAAVpB,EACJ,OAAOsf,SAAS9rB,KAAK0tB,UAAQlhB,GAC9B,CAOA,SAAAgB,CAAUugB,EAAyB9gB,GAElC,GADAmN,UAAUpa,MACwB,mBAAvB+tB,EAAmC,CAC7C,MAAM7gB,EAAY6gB,EAMlB,OAAO/tB,KAAK0tB,UAAQlgB,UACnB,CAACjI,EAAOiH,EAAOwhB,IAAU9gB,EAAUxF,KAAKuF,EAAS6e,SAASvmB,GAAQiH,EAAOwhB,GACzE/gB,EAEF,CACA,MAAMW,EAA+B,iBAAZX,EAAuBA,OAAUzL,EAC1D,OAAOxB,KAAK0tB,UAAQjiB,QAAQsiB,EAAoBngB,EACjD,CAEA,IAAAgB,GAEC,OADAwL,UAAUpa,MACH8rB,SAAS9rB,KAAK0tB,UAAQ9e,OAC9B,CAEA,OAAAE,CACC9B,EACAC,GAGA,OADAmN,UAAUpa,MACH8rB,SAAS9rB,KAAK0tB,UAAQ5e,QAAQ9B,EAAYC,GAClD,CAEA,MAAAlB,CAAOiB,EAAkEC,GAExE,OADAmN,UAAUpa,MACH8rB,SACN9rB,KAAK0tB,UAAQ3hB,OAAO,CAACkiB,EAAMzhB,EAAOwhB,IAAUhhB,EAAW8e,SAASmC,GAAOzhB,EAAOwhB,GAAQ/gB,GAExF,CAEA,GAAAlK,CAAIiK,EAA8DC,GAEjE,OADAmN,UAAUpa,MACH8rB,SACN9rB,KAAK0tB,UAAQ3qB,IAAI,CAACkrB,EAAMzhB,EAAOwhB,IAAUhhB,EAAW8e,SAASmC,GAAOzhB,EAAOwhB,GAAQ/gB,GAErF,CAEA,MAAAE,CACCH,EACAI,GAEAgN,UAAUpa,MACV,MAAMiD,OACYzB,IAAjB4L,EACGpN,KAAK0tB,UAAQvgB,OAAOH,GACpBhN,KAAK0tB,UAAQvgB,OAAOH,EAAmBI,GAC3C,OAAO0e,SAAS7oB,EACjB,CAEA,WAAAoK,CACCL,EACAI,GAEAgN,UAAUpa,MACV,MAAMiD,OACYzB,IAAjB4L,EACGpN,KAAK0tB,UAAQrgB,YAAYL,EAAmBI,GAC3CpN,KAAK0tB,UAAgBrgB,YAAYL,GACtC,OAAO8e,SAAS7oB,EACjB,CAEA,KAAA6K,CAAMC,EAAgBC,GACrB,IAAK,MAAM9K,KAAKgrB,MAAMngB,GAAS,EAAGC,GAAOhO,KAAK0tB,UAAQ/qB,OAAS,GAAIyX,UAAUpa,KAAMkD,GACnF,YAAiB1B,IAAVuM,EACJ/N,KAAK0tB,UAAQ5f,aACLtM,IAARwM,EACChO,KAAK0tB,UAAQ5f,MAAMC,GACnB/N,KAAK0tB,UAAQ5f,MAAMC,EAAOC,EAC/B,CAEA,MAAAC,IAAUC,GAET,OADAkM,UAAUpa,MACH8rB,SAAS9rB,KAAK0tB,UAAQzf,UAAUC,GACxC,CAEA,IAAAG,CAAKC,GAEJ,OADA8L,UAAUpa,MACHA,KAAK0tB,UAAQrf,KAAKC,EAC1B,CAEA,OAAAhB,CAAQN,EAA+DC,GACtEmN,UAAUpa,MACVA,KAAK0tB,UAAQpgB,QAAQ,CAAC/H,EAAOiH,EAAOwhB,KACnChhB,EAAWtF,KAAKuF,EAAS6e,SAASvmB,GAAQiH,EAAOwhB,IAEnD,CAIA,KAAA7f,CAAMnB,EAAkEC,GAEvE,OADAmN,UAAUpa,MACHA,KAAK0tB,UAAQvf,MACnB,CAAC5I,EAAOiH,EAAOwhB,IAAUhhB,EAAWtF,KAAKuF,EAAS6e,SAASvmB,GAAQiH,EAAOwhB,GAC1E/gB,EAEF,CAEA,IAAAmB,CAAKpB,EAAkEC,GAEtE,OADAmN,UAAUpa,MACHA,KAAK0tB,UAAQtf,KACnB,CAAC7I,EAAOiH,EAAOwhB,IAAUhhB,EAAWtF,KAAKuF,EAAS6e,SAASvmB,GAAQiH,EAAOwhB,GAC1E/gB,EAEF,EAED,SAAUT,MAAMtJ,GAAWP,OAAEA,GAAS,GAAS,CAAA,GAC1CA,SAAc,gBACZO,CACP,CAEA,SAAUgrB,MACT5qB,EACAC,GACAZ,OAAEA,GAAS,GAAU,IAErB,MAAMoL,EAAQlL,KAAKC,IAAIQ,EAAGC,GACpByK,EAAMnL,KAAK6mB,IAAIpmB,EAAGC,GACpBZ,SAAc,UAClB,IAAK,IAAIO,EAAI6K,EAAO7K,GAAK8K,EAAK9K,UAAWA,CAC1C,OAKairB,sBAAsB7hB,UAAUqhB,kBAAmB,CAC/D,GAAA9nB,CAAI3C,GAEH,OADAkX,UAAUpa,KAAMkD,GACT4oB,SAAS9rB,KAAK0tB,UAAQxqB,GAC9B,EACA,GAAA6C,CAAI7C,EAAWqC,GACd,MAAM6oB,EAAQlrB,GAAKlD,KAAK0tB,UAAQ/qB,OAChC3C,KAAK0tB,UAAQxqB,GAAKqC,EAClB1E,QAAQb,KAAM,CAAE2W,KAAM,MAAOjR,KAAMxC,GAAKsJ,MAAMtJ,EAAG,CAAEP,OAAQyrB,IAC5D,EACA,SAAA3hB,GAEC,OADA2N,UAAUpa,KAAM,UACTA,KAAK0tB,UAAQ/qB,MACrB,EACA,SAAAiK,CAAUrH,GACT,MAAMikB,EAAYxpB,KAAK0tB,UAAQ/qB,OAC/B,IACC3C,KAAK0tB,UAAQ/qB,OAAS4C,CACvB,SACC1E,QAAQb,KAAM,CAAE2W,KAAM,MAAOjR,KAAM,UAAYwoB,MAAM1E,EAAWjkB,EAAO,CAAE5C,QAAQ,IAClF,CACD,KAEA,WAAA/C,CAAYkL,GACX/K,QACA6D,OAAO0B,iBAAiBtF,KAAM,CAE7BquB,CAACX,UAAS,CAAEnoB,MAAOuF,GACnB3L,CAACA,qBAAsB,CAAEoG,MAAOuF,IAElC,CAEA,IAAA1H,IAAQ8K,GACP,MAAMsb,EAAYxpB,KAAK0tB,UAAQ/qB,OAC/B,IACC,OAAO3C,KAAK0tB,UAAQtqB,QAAQ8K,EAC7B,SACCrN,QACCb,KACA,CAAE2W,KAAM,QAASnO,OAAQ,QACzB0lB,MAAM1E,EAAWA,EAAYtb,EAAMvL,OAAS,EAAG,CAAEA,QAAQ,IAE3D,CACD,CAEA,GAAAua,GACC,GAA4B,IAAxBld,KAAK0tB,UAAQ/qB,OACjB,IACC,OAAOmpB,SAAS9rB,KAAK0tB,UAAQxQ,MAC9B,SACCrc,QAAQb,KAAM,CAAE2W,KAAM,QAASnO,OAAQ,OAASgE,MAAMxM,KAAK0tB,UAAQ/qB,QACpE,CACD,CAEA,KAAA4V,GACC,GAA4B,IAAxBvY,KAAK0tB,UAAQ/qB,OACjB,IACC,OAAOmpB,SAAS9rB,KAAK0tB,UAAQnV,QAC9B,SACC1X,QACCb,KACA,CAAE2W,KAAM,QAASnO,OAAQ,SACzB0lB,MAAM,EAAGluB,KAAK0tB,UAAQ/qB,OAAS,EAAG,CAAEA,QAAQ,IAE9C,CACD,CAEA,OAAAsW,IAAW/K,GACV,IACC,OAAOlO,KAAK0tB,UAAQzU,WAAW/K,EAChC,SACCrN,QACCb,KACA,CAAE2W,KAAM,QAASnO,OAAQ,WACzB0lB,MAAM,EAAGluB,KAAK0tB,UAAQ/qB,OAASuL,EAAMvL,OAAQ,CAAEA,QAAQ,IAEzD,CACD,CAEA,MAAA6I,CAAOuC,EAAeuB,KAAyBpB,GAC9C,MAAMsb,EAAYxpB,KAAK0tB,UAAQ/qB,YACXnB,IAAhB8N,IAA2BA,EAAcka,EAAYzb,GACzD,IACC,OAAsC+d,cAAlBtqB,IAAhB8N,EAA2CtP,KAAK0tB,UAAQliB,OAAOuC,GACnD/N,KAAK0tB,UAAQliB,OAAOuC,EAAOuB,KAAgBpB,GAC5D,SACCrN,QACCb,KACA,CAAE2W,KAAM,QAASnO,OAAQ,UAEzB8G,IAAgBpB,EAAMvL,OACnBurB,MAAMngB,EAAOA,EAAQuB,GACrB4e,MAAMngB,EAAOyb,EAAY3mB,KAAK6mB,IAAIxb,EAAMvL,OAAS2M,EAAa,GAAI,CACnE3M,QAAQ,IAGZ,CACD,CAEA,OAAAsM,GACC,IACC,OAAOjP,KAAK0tB,UAAQze,SACrB,SACCpO,QAAQb,KAAM,CAAE2W,KAAM,QAASnO,OAAQ,WAAa0lB,MAAM,EAAGluB,KAAK0tB,UAAQ/qB,OAAS,GACpF,CACD,CAEA,IAAAyM,CAAKD,GACJA,EAAYA,GAAS,EAAM7L,EAAGC,IAAMD,EAAE4B,WAAWopB,cAAc/qB,EAAE2B,aACjE,IACC,OAAOlF,KAAK0tB,UAAQte,KAAK,CAAC9L,EAAGC,IAAM4L,EAAU2c,SAASxoB,GAAIwoB,SAASvoB,IACpE,SACC1C,QAAQb,KAAM,CAAE2W,KAAM,QAASnO,OAAQ,QAAU0lB,MAAM,EAAGluB,KAAK0tB,UAAQ/qB,OAAS,GACjF,CACD,CAEA,IAAA4rB,CAAKhpB,EAAYwI,EAAgBC,GAChC,IACC,YAAcxM,IAAVuM,EAA4B/N,KAAK0tB,UAAQa,KAAKhpB,QACtC/D,IAARwM,EAA0BhO,KAAK0tB,UAAQa,KAAKhpB,EAAOwI,GAChD/N,KAAK0tB,UAAQa,KAAKhpB,EAAOwI,EAAOC,EACxC,SACCnN,QAAQb,KAAM,CAAE2W,KAAM,QAASnO,OAAQ,QAAU0lB,MAAM,EAAGluB,KAAK0tB,UAAQ/qB,OAAS,GACjF,CACD,CAEA,UAAA6rB,CAAW1mB,EAAgBiG,EAAeC,GACzC,IACC,YAAYxM,IAARwM,EAA0BhO,KAAK0tB,UAAQc,WAAW1mB,EAAQiG,GACvD/N,KAAK0tB,UAAQc,WAAW1mB,EAAQiG,EAAOC,EAC/C,SACCnN,QACCb,KACA,CAAE2W,KAAM,QAASnO,OAAQ,cAEzB0lB,MAAM,EAAGluB,KAAK0tB,UAAQ/qB,OAAS,GAEjC,CAED,EChZK,MAAO8rB,sBAAsB9uB,OAKnC,MAAM+uB,mCAAmCpiB,UAAUqhB,kBAAmB,CACrE,GAAA9nB,CAAI3C,GAEH,OADAkX,UAAUpa,KAAMkD,GACT4oB,SAAS9rB,KAAK0tB,UAAQxqB,GAC9B,EACA,GAAA6C,CAAI7C,EAAWqN,GACd,MAAM,IAAIke,cAAc,iBAAiBvrB,yBAC1C,EACA,SAAAuJ,GAEC,OADA2N,UAAUpa,KAAM,UACTA,KAAK0tB,UAAQ/qB,MACrB,EACA,SAAAiK,CAAUrH,GACT,MAAM,IAAIkpB,cAAc,qBAAqBlpB,yBAC9C,KAEA,WAAA3F,CAAYkL,GACX/K,QACA6D,OAAO0B,iBAAiBtF,KAAM,CAE7BquB,CAACX,UAAS,CAAEnoB,MAAOuF,GACnB3L,CAACA,qBAAsB,CAAEoG,MAAOuF,IAElC,CAEA,IAAA1H,IAAQurB,GACP,MAAM,IAAIF,cAAc,qCACzB,CAEA,GAAAvR,GACC,MAAM,IAAIuR,cAAc,iCACzB,CAEA,KAAAlW,GACC,MAAM,IAAIkW,cAAc,kCACzB,CAEA,OAAAxV,IAAW0V,GACV,MAAM,IAAIF,cAAc,wCACzB,CAEA,MAAAjjB,CAAOojB,EAAgBC,KAA0BF,GAChD,MAAM,IAAIF,cAAc,gCACzB,CAEA,OAAAxf,GACC,MAAM,IAAIwf,cAAc,8BACzB,CAEA,IAAArf,CAAK0f,GACJ,MAAM,IAAIL,cAAc,4BACzB,CAEA,IAAAF,CAAKhe,EAAaqe,EAAiBG,GAClC,MAAM,IAAIN,cAAc,4BACzB,CAEA,UAAAD,CAAWzlB,EAAiB6lB,EAAgBG,GAC3C,MAAM,IAAIN,cAAc,mCACzB,EAGM,MAAMO,sBAAwBlD,SAAS4C,qCAE9B9F,OACfqG,EACA3B,EACA4B,GAEA,MAAMjsB,EAAc,GACdksB,EAAiB,IAAIH,sBAAsB/rB,GAC3CigB,EAA6B,GACnC,SAASkM,EAAM5iB,GACd,OAAOoH,OAAO,WACb3Q,EAAOuJ,GAAS8gB,EAAQ2B,EAAOziB,GAAQA,EAAO2iB,GAC9CpI,SAASoI,EAAgB,CAAExY,KAAM,MAAOjR,KAAM8G,GAASA,EACxD,EACD,CACA,MAAM6iB,EAAgBzb,OAAO,UAAiC+P,OAAEA,IAC/D,MAAMhhB,EAASssB,EAAOtsB,OAChB2sB,EAAepK,UAAU,IAAMjiB,EAAON,QAG5C,GAFAusB,IAASvsB,EAAQ2sB,GACjBvI,SAASoI,EAAgB,CAAExY,KAAM,MAAOjR,KAAM,UAAY,UACtD/C,EAAS2sB,EAAc,CAC1B,MAAMC,EAAYrM,EAAS1X,OAAO7I,GAClC,IAAK,MAAMpD,KAAWgwB,EAAWhwB,IACjC0D,EAAON,OAASA,CACjB,MAAWA,EAAS2sB,GAEnB3L,EAAO,WACN,IAAK,IAAIzgB,EAAIosB,EAAcpsB,EAAIP,EAAQO,IAAKggB,EAAS9f,KAAKgsB,EAAMlsB,GACjE,EACF,GACA,OAAOkqB,UAAU+B,EAAgB,KAChC,IAAK,MAAM5vB,KAAW2jB,EAAU3jB,IAChC2jB,EAASvgB,OAAS,EAClB0sB,KAEF,CAEM,SAAUG,QACfP,EACA3B,GAEA,MAAMrqB,EAAc,GACdksB,EAAiB,IAAIH,sBAAsB/rB,GAC3CwsB,EAAgB7b,OAAO,WAC5B,MAAM8b,EAAY,CAAA,EAClBzsB,EAAON,OAAS,EAChB,IAAK,MAAMysB,KAASH,EAAQhsB,EAAOG,QAAQkqB,EAAQ8B,EAAOM,IAC1D7uB,QAAQsuB,EAAgB,CAAExY,KAAM,aAAcjR,KAAM,WACrD,GACA,OAAO0nB,UAAU+B,EAAgBM,EAClC,CChHA,MAAME,iBAAmB,IAAI3rB,QACvB4rB,gBAAkB,IAAI5rB,QAE5B,SAAS6rB,UAAkBC,EAA6B5oB,GACvD4oB,EAAKC,WAALD,EAAKC,SAAa,IAAI/rB,SACtB,IAAIgsB,EAASF,EAAKC,SAASlqB,IAAIqB,GAK/B,OAJK8oB,IACJA,EAAS,CAAA,EACTF,EAAKC,SAAShqB,IAAImB,EAAK8oB,IAEjBA,CACR,CAEA,SAASC,gBACRjrB,GAEA,MAAMkrB,EAASpd,QAAQ9N,GACjB0N,EAAWid,iBAAiB9pB,IAAIqqB,GACtC,GAAIxd,EAAU,OAAOA,EAErB,MAAMyd,EAAmC,CAAA,EACnCC,EAAW7d,aAAa,IAAItQ,KACjC,MAAMouB,EAAYpuB,EAClB,GAAIouB,EAAUjiB,KAAM8e,KAAUA,GAAO,CAAC,SAAU,SAAU,YAAYhlB,gBAAgBglB,KACrF,MAAM,IAAIvtB,MAAM,6CAEjB,IAAI8W,EAA8B0Z,EAElC,IAAK,MAAMjD,KAAOmD,EACjB5Z,EAAOoZ,UAAUpZ,EAAMyW,GAIxB,GADA9S,UAAU3D,EAAM,WACZ,WAAYA,EAAM,CACrB,GAAIvW,QAAQqB,yBAA0B,CACrC,MAAM+uB,EAAkBpwB,QAAQwB,kBAChCxB,QAAQwB,mBAAoB,EAC5B,IACC,MAAM6uB,EAAQrL,UAAU,IAAMlgB,KAAMqrB,IAC/B9pB,YAAYkQ,EAAKxT,OAAQstB,IAC7BrwB,QAAQqB,yBAAyBkV,EAAKxT,OAAQstB,EAAOvrB,EAAIqrB,EAAW,cAEtE,SACCnwB,QAAQwB,kBAAoB4uB,CAC7B,CACD,CACA,OAAO7Z,EAAKxT,MACb,CA0BA,GAtBAwT,EAAKlX,QAAUiT,KAAK,IACnBoB,OACC,KAGC6C,EAAKxT,OAAS+B,KAAMqrB,GACb,YAEC5Z,EAAKxT,OACZ8jB,SAAStQ,EAAM,CAAEE,KAAM,aAAcjR,KAAM2qB,GAAa,WAGpD5Z,EAAKlX,UACRkX,EAAKlX,UACLkX,EAAKlX,aAAUiC,KAIlB,CAAEqjB,QAAQ,KAIR3kB,QAAQqB,yBAA0B,CACrC,MAAM+uB,EAAkBpwB,QAAQwB,kBAChCxB,QAAQwB,mBAAoB,EAC5B,IACC,MAAM6uB,EAAQrL,UAAU,IAAMlgB,KAAMqrB,IAC/B9pB,YAAYkQ,EAAKxT,OAAQstB,IAC7BrwB,QAAQqB,yBAAyBkV,EAAKxT,OAAQstB,EAAOvrB,EAAIqrB,EAAW,aAEtE,SACCnwB,QAAQwB,kBAAoB4uB,CAC7B,CACD,CAEA,OAAO7Z,EAAKxT,QACV+B,GAIH,OAFA2qB,iBAAiB5pB,IAAImqB,EAAQE,GAC7BT,iBAAiB5pB,IAAIqqB,EAAUA,GACxBA,CACR,CAEO,MAAMI,QAAUtnB,UAAU,CAChCd,OAAM,CAAC0C,EAAUhD,EAAQC,IACjB,WACN,IAAI0oB,EAAUb,gBAAgB/pB,IAAIiF,GAC7B2lB,IACJA,EAAUle,aACTnN,QAAS0L,GACDhG,EAASpD,KAAKoJ,GACnB,GAAGlM,OAAOkD,GAAQlI,aAAaK,MAAQ6H,GAAQ7H,MAAQ,aAAa2E,OAAOmD,MAC9E,CACCS,OAAQsC,EACR/C,iBACK+C,EAAiBtL,cAAgB,CAAEA,CAACA,cAAgBsL,EAAiBtL,eAAkB,KAG9FowB,gBAAgB7pB,IAAI+E,EAAU2lB,IAG/B,OADiBR,gBAAgBQ,EAC1BL,CAASpwB,KACjB,EAEDwI,OAAM,CAACsC,EAAUhD,EAAQ7H,IACjB,YAAwBgC,GAC9B,IAAIwuB,EAAUb,gBAAgB/pB,IAAIiF,GAC7B2lB,IACJA,EAAUle,aACTnN,QAAQ,CAAC0L,KAAiB7O,IAClB6I,EAASpD,KAAKoJ,KAAS7O,GAC5B,GAAG2C,OAAOkD,GAAQlI,aAAaK,MAAQ6H,GAAQ7H,MAAQ,aAAa2E,OAAO3E,MAC9E,CACCuI,OAAQsC,EACR/C,YAAa9H,KACR6K,EAAiBtL,cAAgB,CAAEA,CAACA,cAAgBsL,EAAiBtL,eAAkB,KAG9FowB,gBAAgB7pB,IAAI+E,EAAU2lB,IAG/B,OADiBR,gBAAgBQ,EAC1BL,CAASpwB,QAASiC,EAC1B,EAEDwG,QAASwnB,kBC5IV,SAASS,kBACR,MAAMC,UAAqBrkB,UAAUQ,iBAAkB,CACtD,GAAAjH,CAAe2G,GACd,OAAOxM,KAAKoM,OAAOI,EACpB,EACA,GAAAzG,CAAeyG,EAAejH,GAC7BvF,KAAKqM,OAAOG,EAAOjH,EACpB,EACA,SAAAkH,GACC,OAAOzM,KAAK2C,MACb,EACA,SAAAiK,CAAqBrH,GACpBvF,KAAK2C,OAAS4C,CACf,KAEA,OAAAqrB,GACC,OAAOptB,MAAMiR,KAAKzU,KACnB,EAED,OAAO2wB,CAIR,KAMME,cAAa,uCADlB1D,iBAEQ2D,EAAAJ,yBAARK,EAAA,cAAQD,EAGR,KAAcE,EAAA,IAAAhtB,QAAAitB,EAAA,IAAAjtB,QAAAktB,EAAA,IAAAltB,QAAAmtB,EAAA,IAAAntB,QAAAotB,EAAA,IAAAptB,QAAAqtB,EAAA,IAAArtB,QAAAstB,EAAA,IAAAttB,QAAAutB,EAAA,IAAAttB,QAAC4I,iBACd,OAAO7M,KAAK4wB,SACb,CASA,WAAAhxB,CAAY4xB,EAA0BC,GAGrC,IAAIC,EAKJ,GAPA3xB,oBATQixB,EAAAjrB,IAAA/F,aACAixB,EAAAlrB,IAAA/F,aACAkxB,EAAAnrB,IAAA/F,aACAmxB,EAAAprB,IAAA/F,KAAS,IAAI+D,KACbqtB,EAAArrB,IAAA/F,KAAa,IAAI+D,KACjBstB,EAAAtrB,IAAA/F,KAAc,IAAI2D,KAClB2tB,EAAAvrB,IAAA/F,aAMR4T,OAAO,EAAG+P,aACT+N,EAAY/N,IAEbgO,uBAAA3xB,KAAIsxB,EAAWI,EAAU,KACJ,mBAAVF,EAAsB,MAAM,IAAI7xB,MAAM,oCACjDgyB,uBAAA3xB,KAAIgxB,EAAUQ,EAAK,KACnBG,uBAAA3xB,KAAIixB,EAASnF,SAAS,SACtB6F,uBAAA3xB,OAAe8rB,SAAS,IAAI/nB,KAAY,KACxCH,OAAO0B,iBAAiBtF,KAAM,CAC7Bb,CAACA,qBAAsB,CAAEoG,MAAOgG,uBAAAvL,KAAIixB,EAAA,QAEjCQ,GAASzxB,KAAKoD,QAAQquB,EAC3B,CAEQ,SAAAG,CAAUrsB,GACjB,IAAIssB,EAAOtmB,uBAAAvL,KAAIoxB,EAAA,KAAYvrB,IAAIN,GAC/B,GAAIssB,EAAM,OAAOA,EAAK3qB,IAetB,GAdA2qB,EAAO,CAAE3qB,SAAK1F,GACd+J,uBAAAvL,YAAgB+F,IAAIR,EAAOssB,GAC3BtmB,uBAAAvL,KAAIsxB,EAAA,KAAQ5pB,KAAZ1H,KAAa,KACZ,MAAM8xB,EAAOle,OAAO,EAAGsQ,eACtB,MAAM6N,EAAUxmB,uBAAAvL,KAAIgxB,EAAA,UAAJhxB,KAAYuF,GAC5BvF,KAAKgyB,eAAeD,GACpB,MAAME,EAAcJ,EAAM3qB,IACtBgd,QAA4B1iB,IAAhBywB,IAA8BruB,OAAOmmB,GAAGgI,EAASE,IAChE1mB,uBAAAvL,KAAIuxB,EAAA,IAAAW,GAAYxqB,KAAhB1H,KAAiBuF,EAAO0sB,EAAaF,GACtCF,EAAM3qB,IAAM6qB,IAEbF,EAAMC,KAAOA,EACbvmB,uBAAAvL,KAAIqxB,EAAA,KAAa1qB,IAAImrB,UAELtwB,IAAbqwB,EAAK3qB,IAAmB,MAAM,IAAIvH,MAAM,oDAC5C,OAAOkyB,EAAK3qB,GACb,CAEQ,cAAA8qB,CAAe9qB,GACtB,MAAMyP,SAAczP,EACpB,GAAa,WAATyP,GAA8B,WAATA,GAA8B,WAATA,EAC7C,MAAM,IAAIhX,MAAM,mDAClB,CAEQ,WAAAwyB,CAAYjrB,EAAQ3B,GAC3B,MAAMmN,EAAWnH,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIqB,QACjB1F,IAAbkR,GAA0BA,IAAanN,GAAOvF,KAAKoyB,aAAa1f,GACpEnH,uBAAAvL,YAAa+F,IAAImB,EAAK3B,EACvB,CAEQ,YAAA6sB,CAAa7sB,GACpB,MAAMssB,EAAOtmB,uBAAAvL,KAAIoxB,EAAA,KAAYvrB,IAAIN,GACjC,IAAKssB,EAAM,OACX,MAAMC,EAAOD,EAAKC,KACdA,IACHD,EAAKC,UAAOtwB,EACZ+J,uBAAAvL,KAAIqxB,EAAA,KAAa/mB,OAAOwnB,GACxBA,KAEDvmB,uBAAAvL,KAAIoxB,EAAA,KAAY9mB,OAAO/E,EACxB,CAEQ,iBAAA8sB,GACP,IAAK,MAAM9sB,KAAS/B,MAAMiR,KAAKlJ,uBAAAvL,KAAIoxB,EAAA,KAAY9pB,QAAStH,KAAKoyB,aAAa7sB,GAC1EgG,uBAAAvL,KAAIqxB,EAAA,KAAalhB,OAClB,CAoBQ,cAAAmiB,CAAeprB,GACtB,MAAMkO,EAAQ7J,uBAAAvL,KAAImxB,EAAA,KAAQtrB,IAAIqB,IAAQ,EACtCqE,uBAAAvL,KAAImxB,EAAA,KAAQprB,IAAImB,EAAKkO,EAAQ,EAC9B,CAEQ,cAAAmd,CAAerrB,GACtB,MAAMkO,EAAQ7J,uBAAAvL,KAAImxB,EAAA,KAAQtrB,IAAIqB,GAC9B,GAAKkO,EACL,GAAIA,GAAS,EAAG,CACf,MAAM7P,EAAQgG,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIqB,GAC/BqE,uBAAAvL,KAAImxB,EAAA,KAAQ7mB,OAAOpD,GACnBqE,uBAAAvL,KAAIkxB,EAAA,KAAS5mB,OAAOpD,QACN1F,IAAV+D,GAAqBvF,KAAKoyB,aAAa7sB,EAC5C,MACCgG,uBAAAvL,KAAImxB,EAAA,KAAQprB,IAAImB,EAAKkO,EAAQ,EAE/B,CAEQ,cAAAod,CAAehmB,EAAeimB,GAAW,GAChD,MAAM9vB,EAAS3C,KAAK2C,OACpB,IAAI+vB,EAAWlmB,EAEf,GADIkmB,EAAW,IAAGA,EAAW7vB,KAAK6mB,IAAI/mB,EAAS+vB,EAAU,IACrDA,EAAW/vB,EAAQ,CACtB,IAAI8vB,EACC,MAAM,IAAInuB,WAAW,uBADZouB,EAAW/vB,CAE1B,CACA,IAAK8vB,GAAYC,IAAa/vB,EAAQ,MAAM,IAAI2B,WAAW,uBAC3D,OAAOouB,CACR,CAEQ,QAAAC,CAASnmB,EAAetF,EAAQ3B,GACvC,MAAMqtB,EAASrnB,uBAAAvL,YAAWwM,QACXhL,IAAXoxB,GAAwBhvB,OAAOmmB,GAAG6I,EAAQ1rB,UAI/B1F,IAAXoxB,GAAsB5yB,KAAKuyB,eAAeK,GAC9CrnB,uBAAAvL,KAAIixB,EAAA,KAAOzkB,GAAStF,EACpBlH,KAAKsyB,eAAeprB,IALnBlH,KAAKmyB,YAAYjrB,EAAK3B,EAOxB,CAEQ,cAAAstB,CAAermB,EAAetF,EAAQ3B,GAC7CgG,uBAAAvL,KAAIixB,EAAA,KAAOzlB,OAAOgB,EAAO,EAAGtF,GAC5BlH,KAAKsyB,eAAeprB,GACpBlH,KAAKmyB,YAAYjrB,EAAK3B,EACvB,CAEQ,WAAAutB,CAAYvkB,GACnBvO,KAAKqyB,oBACL9mB,uBAAAvL,KAAIixB,EAAA,KAAOzlB,OAAO,EAAGD,uBAAAvL,KAAIixB,EAAA,KAAOtuB,QAChC4I,uBAAAvL,KAAImxB,EAAA,KAAQhhB,QACZ5E,uBAAAvL,KAAIkxB,EAAA,KAAS/gB,QACb,IAAK,MAAM5K,KAASgJ,EAAQ,CAC3B,MAAMrH,EAAMlH,KAAK4xB,UAAUrsB,GAC3BgG,uBAAAvL,KAAIixB,EAAA,KAAO7tB,KAAK8D,GAChBlH,KAAKsyB,eAAeprB,GACpBqE,uBAAAvL,YAAa+F,IAAImB,EAAK3B,EACvB,CACD,CAEA,UAAI5C,GACH,OAAO4I,uBAAAvL,KAAIixB,EAAA,KAAOtuB,MACnB,CAEA,EAAAuvB,EAAA,SAnFY3sB,EAAUqtB,EAAWG,GAChC,GAAInvB,OAAOmmB,GAAG6I,EAAQG,GAAS,OAC/B,MAAMC,EAAgBznB,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIktB,GACvC,QAAsBvxB,IAAlBwxB,GAA+BA,IAAkBztB,EACpD,MAAM,IAAI5F,MAAM,kCAAkCiF,OAAOmuB,MAC1D,MAAM3d,EAAQ7J,uBAAAvL,KAAImxB,EAAA,KAAQtrB,IAAI+sB,GAC9B,IAAKxd,EAAO,OACZ,MAAM6d,EAAgB1nB,uBAAAvL,KAAImxB,EAAA,KAAQtrB,IAAIktB,IAAW,EACjD/yB,KAAKmyB,YAAYY,EAAQxtB,GACzB,IAAK,IAAIrC,EAAI,EAAGA,EAAIqI,uBAAAvL,KAAIixB,EAAA,KAAOtuB,OAAQO,IAClCU,OAAOmmB,GAAGxe,uBAAAvL,KAAIixB,EAAA,KAAO/tB,GAAI0vB,KAASrnB,uBAAAvL,KAAIixB,EAAA,KAAO/tB,GAAK6vB,GACvDxnB,uBAAAvL,KAAImxB,EAAA,KAAQprB,IAAIgtB,EAAQE,EAAgB7d,GACxC7J,uBAAAvL,KAAImxB,EAAA,KAAQ7mB,OAAOsoB,GACnBrnB,uBAAAvL,KAAIkxB,EAAA,KAAS5mB,OAAOsoB,GACpB,MAAMM,EAAc3nB,uBAAAvL,KAAIoxB,EAAA,KAAYvrB,IAAIN,GACpC2tB,IAAaA,EAAYhsB,IAAM6rB,EACpC,EAmEC3mB,QAAOI,GACP,MAAMtF,EAAMqE,uBAAAvL,YAAWwM,GACvB,YAAehL,IAAR0F,OAAoB1F,EAAY+J,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIqB,EACzD,CAEA,CAACmF,OAAOG,EAAejH,GACtB,MAAM2B,EAAMlH,KAAK4xB,UAAUrsB,GAC3B,GAAIiH,IAAUxM,KAAK2C,OAElB,YADA3C,KAAK6yB,eAAermB,EAAOtF,EAAK3B,GAGjC,MAAM4tB,EAAanzB,KAAKwyB,eAAehmB,GACvCxM,KAAK2yB,SAASQ,EAAYjsB,EAAK3B,EAChC,CAEA,IAAAnC,IAAQ8K,GACP,IAAK,MAAM+f,KAAQ/f,EAAO,CACzB,MAAMhH,EAAMlH,KAAK4xB,UAAU3D,GAC3BjuB,KAAK6yB,eAAe7yB,KAAK2C,OAAQuE,EAAK+mB,EACvC,CACA,OAAOjuB,KAAK2C,MACb,CAEA,GAAAua,GACC,GAAKld,KAAK2C,OACV,OAAO3C,KAAKozB,SAASpzB,KAAK2C,OAAS,EACpC,CAEA,KAAA4V,GACC,GAAKvY,KAAK2C,OACV,OAAO3C,KAAKozB,SAAS,EACtB,CAEA,OAAAna,IAAW/K,GACV,IAAI1B,EAAQ,EACZ,IAAK,MAAMyhB,KAAQ/f,EAAO,CACzB,MAAMhH,EAAMlH,KAAK4xB,UAAU3D,GAC3BjuB,KAAK6yB,eAAermB,IAAStF,EAAK+mB,EACnC,CACA,OAAOjuB,KAAK2C,MACb,CAEA,MAAA6I,CAAOuC,EAAeuB,KAAyBpB,GAC9C,MAAMmlB,EAAkBrzB,KAAKwyB,eAAezkB,GAAO,GAC7CulB,EAAetzB,KAAK2C,OAAS0wB,EAC7BE,EAAe1wB,KAAKC,SACTtB,IAAhB8N,EAA4BgkB,EAAezwB,KAAK6mB,IAAIpa,EAAa,GACjEgkB,GAEKE,EAAoB,GAC1B,IAAK,MAAMvF,KAAQ/f,EAAOslB,EAAapwB,KAAKpD,KAAK4xB,UAAU3D,IAC3D,MAAMwF,EAAcloB,uBAAAvL,YAAWwL,OAAO6nB,EAAiBE,KAAiBC,GAClEE,EAAqB,GAC3B,IAAK,MAAMxsB,KAAOusB,EAAa,CAC9B,QAAYjyB,IAAR0F,EAAmB,SACvB,MAAM3B,EAAQgG,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIqB,GAC/BlH,KAAKuyB,eAAerrB,GACpBwsB,EAActwB,KAAKmC,EACpB,CACA,IAAK,IAAIrC,EAAI,EAAGA,EAAIswB,EAAa7wB,OAAQO,IAAK,CAC7C,MAAMgE,EAAMssB,EAAatwB,GACnBqC,EAAQ2I,EAAMhL,GACpBlD,KAAKsyB,eAAeprB,GACpBlH,KAAKmyB,YAAYjrB,EAAK3B,EACvB,CACA,OAAOmuB,CACR,CAEA,KAAAvjB,GACC5E,uBAAAvL,KAAIixB,EAAA,KAAOtuB,OAAS,EACpB4I,uBAAAvL,KAAImxB,EAAA,KAAQhhB,QACZ5E,uBAAAvL,KAAIkxB,EAAA,KAAS/gB,QACbnQ,KAAKqyB,mBACN,CAEA,GAAAxsB,CAAIqB,GACH,OAAOqE,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIqB,EACzB,CACA,GAAAnB,CAAImB,EAAQ3B,GACPgG,uBAAAvL,KAAIkxB,EAAA,KAASjsB,IAAIiC,IAAMlH,KAAKmyB,YAAYjrB,EAAK3B,EAClD,CAEA,MAAAouB,CAAOzsB,GACN,IAAIsF,EAAgBxM,KAAK4zB,WAAW1sB,GACpC,MAAiB,IAAVsF,GACNxM,KAAKozB,SAAS5mB,GACdA,EAAQxM,KAAK4zB,WAAW1sB,EAE1B,CAEO,QAAAksB,CAAS5mB,GACf,MAAOtF,GAAOqE,uBAAAvL,KAAIixB,EAAA,KAAOzlB,OAAOgB,EAAO,GACvC,QAAYhL,IAAR0F,EAAmB,OACvB,MAAM3B,EAAQgG,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIqB,GAE/B,OADAlH,KAAKuyB,eAAerrB,GACb3B,CACR,CASO,IAAAsuB,CAAK3mB,GACX,MAAM4mB,EAAY,IAAI/vB,IACtB,IAAK,MAAOyI,EAAOtF,KAAQqE,uBAAAvL,KAAIixB,EAAA,KAAOziB,UAAW,CAChD,GAAIslB,EAAU7uB,IAAIiC,GAAM,CAClB4sB,EAAUjuB,IAAIqB,IAAMlH,KAAKozB,SAAS5mB,GACvC,QACD,CACA,MACMunB,EAAa7mB,EADL3B,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIqB,IAE/B4sB,EAAU/tB,IAAImB,EAAK6sB,GACdA,GAAY/zB,KAAKozB,SAAS5mB,EAChC,CACD,CAEA,MAAAwnB,CAAO9sB,GACN,OAAOqE,uBAAAvL,KAAImxB,EAAA,KAAQlsB,IAAIiC,EACxB,CAEA,UAAA0sB,CAAW1sB,GACV,OAAOqE,uBAAAvL,KAAIixB,EAAA,KAAOxlB,QAAQvE,EAC3B,CAEA,OAAA+sB,GACC,OAAO1oB,uBAAAvL,KAAIkxB,EAAA,KAAS5pB,MACrB,CAEA,MAAA4sB,IAAU3lB,GACT,IAAK,MAAMhJ,KAASgJ,EAAQ,CAC3B,MAAMrH,EAAMlH,KAAK4xB,UAAUrsB,GACvBgG,uBAAAvL,KAAIkxB,EAAA,KAASjsB,IAAIiC,IAAMlH,KAAKmyB,YAAYjrB,EAAK3B,EAClD,CACD,CAEA,MAAA4uB,CAAOC,KAA+B7lB,GACrC,IAAK,MAAMhJ,KAASgJ,EAAQ,CAC3B,MAAMrH,EAAMlH,KAAK4xB,UAAUrsB,GACvBgG,uBAAAvL,KAAIkxB,EAAA,KAASjsB,IAAIiC,GAAMlH,KAAKmyB,YAAYjrB,EAAK3B,GAC5C6uB,EAAO7uB,EACb,CACD,CAEA,OAAAiJ,GACC,MAAM6lB,EAAOr0B,KAOb,OANA,YACC,IAAK,IAAIkD,EAAI,EAAGA,EAAIqI,uBAAA8oB,EAAIpD,EAAA,KAAOtuB,OAAQO,IAAK,CAC3C,MAAM6D,EAAMwE,uBAAA8oB,SAAaxuB,IAAI0F,uBAAA8oB,EAAIpD,EAAA,KAAO/tB,SAC5B1B,IAARuF,SAAyB,CAAC7D,EAAG6D,GAClC,CACD,CACOgG,EACR,CAEA,CAAC/N,OAAO+N,YACP,MAAMsnB,EAAOr0B,KAOb,OANA,YACC,IAAK,MAAMkH,KAAOqE,uBAAA8oB,EAAIpD,EAAA,KAAQ,CAC7B,MAAM1rB,EAAQgG,uBAAA8oB,EAAInD,EAAA,KAASrrB,IAAIqB,QACjB1F,IAAV+D,UAA2BA,EAChC,CACD,CACOwH,EACR,CAEA,QAAA7H,GACC,MAAO,oBAAoBlF,KAAK2C,SACjC,CAEA,EAAAgM,CAAGnC,GACF,MAAMkmB,EAAWlmB,EAAQ,EAAIxM,KAAK2C,OAAS6J,EAAQA,EACnD,KAAIkmB,EAAW,GAAKA,GAAY1yB,KAAK2C,QACrC,OAAO3C,KAAKoM,OAAOsmB,EACpB,CACA,OAAAzjB,GAEC,OADA1D,uBAAAvL,KAAIixB,EAAA,KAAOhiB,UACJjP,IACR,CACA,IAAAoP,CAAKD,GACJ,MAAMmlB,EAAenlB,EAClB,CAAC7L,EAAMC,IAAS4L,EAAU5D,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAIvC,GAASiI,uBAAAvL,KAAIkxB,EAAA,KAASrrB,IAAItC,SACrE/B,EAEH,OADA+J,uBAAAvL,KAAIixB,EAAA,KAAO7hB,KAAKklB,GACTt0B,IACR,CACA,IAAAuuB,CAAKhpB,EAAUwI,EAAQ,EAAGC,EAAMhO,KAAK2C,QACpC,MAAM4L,EAASvO,KAAK4wB,UAGpB,OAFAriB,EAAOggB,KAAKhpB,EAAOwI,EAAOC,GAC1BhO,KAAK8yB,YAAYvkB,GACVvO,IACR,CAEA,UAAAwuB,CAAW1mB,EAAgBiG,EAAeC,GACzC,MAAMO,EAASvO,KAAK4wB,UAGpB,OAFAriB,EAAOigB,WAAW1mB,EAAQiG,EAAOC,GACjChO,KAAK8yB,YAAYvkB,GACVvO,IACR,gJA9WDu0B,aAAA,KAAAC,EAAA,CAAAjvB,MAAAwrB,GAAA0D,EAAA,CAAA7rB,KAAA,QAAA3I,KAAA8wB,EAAA9wB,KAAAy0B,SAAAC,GAAA,KAAAC,6GAAMC,kBAAA9D,EAAA6D,UAAa,GAkXZ,MAAME,SAAWjE,cAKlB,SAAUhmB,SACf2mB,EACAC,GAEA,OAAO,IAAIZ,cAAcW,EAAOC,EACjC,CCxZO,MAAMsD,yBAA2B,IAAI/wB,iBAK5BgxB,sBACf,MAAM9a,EAASX,kBACf,OAAOW,EAAS6a,yBAAyBlvB,IAAIqU,QAAU1Y,CACxD,CAsCA,SAASyzB,kBACRnI,GAEAlpB,OAAOoC,eAAe8mB,EAAQ,QAAS,CACtCjnB,IAAKinB,EAAOjnB,IACZE,IAAK+mB,EAAO/mB,IACZE,cAAc,EACdE,YAAY,GAEd,CAEA,SAAS+uB,YACRptB,EACAqtB,EACAC,EACAV,GAUA,OARIA,GACH9wB,OAAOoC,eAAe8B,EAAQzI,eAAgB,CAC7CkG,MAAOmvB,EACPxuB,UAAU,EACVC,YAAY,EACZF,cAAc,IAGTmnB,UAAUtlB,EAAQ,KACxBstB,IACA,IAAK,MAAMtD,KAAQqD,EAAU5mB,SAAUujB,MACvCqD,EAAUhlB,SAEZ,CAEA,SAASklB,aACRzgB,EACAzI,GAEA,MAAMmpB,EAAiBxJ,SAASlX,GAC1B9M,EAASgkB,SAAS,IAClByJ,EAAe,IAAIxxB,IAMzB,SAASyxB,EAAahpB,GACrB,MAAMsY,EAAayQ,EAAa1vB,IAAI2G,GAChCsY,IACHyQ,EAAajrB,OAAOkC,GACpBsY,IACArgB,QAAQknB,eAAe7jB,EAA6B0E,GAEtD,CAEA,MAAMkI,EAASsgB,sBACTnmB,EAAQ6F,EAASA,EAAO7F,MAAQ,EAAI,EAEpCwgB,EAAgBzb,OAAO,UAAkC+P,OAAEA,IAChE,MAAMhhB,EAAS2yB,EAAe3yB,QAjB/B,SAA+BA,GAC9BmD,WAAWgC,EAA6B,SAAUnF,EAAQmF,EAC3D,CAgBC2tB,CAAsB9yB,GACtB,MAAM+P,EAAWlP,MAAMiR,KAAK8gB,EAAajuB,QACzC,IAAK,IAAIpE,EAAI,EAAGA,EAAIP,EAAQO,IACvBqyB,EAAatwB,IAAI/B,IACrBygB,EAAO,KACN,MAAMnX,EAAQtJ,EACR4uB,EAAOle,OAAO,WACnB,MAAM8hB,EAAWxQ,UAAU,IAAMpd,EAAO0E,IAClCmpB,EAAa,CAClBzuB,IAAKsF,EACLoI,OAAQ0gB,EACRzvB,IAAK,IAAML,WAAW8vB,EAAuB9oB,EAAO8oB,GACpDvvB,IAAMR,GACLO,WAAWwvB,EAAuB9oB,EAAOjH,EAAO+vB,GACjDM,IAAKF,GAENT,kBAAkBU,GAClB,MAAME,EAAW1pB,EAAMwpB,EAAY7tB,GACnCA,EAAO0E,GAASqpB,CACjB,GACAtgB,cAAcuc,EAAM,WAAWjjB,MAAUrC,KACzCuoB,yBAAyBhvB,IAAI+rB,EAAM,CAClCld,OAAQ0gB,EACRpuB,IAAKsF,EACL1E,SACA+G,QACA6F,WAED6gB,EAAaxvB,IAAI7C,EAAG4uB,KAGtB,IAAK,MAAMtlB,KAASkG,EAAclG,GAAS7J,GAAQ6yB,EAAahpB,EACjE,GAEA,OAAO0oB,YAAYptB,EAAQytB,EAAc,IAAMlG,IAAiB,CAC/Dza,OAAQ0gB,EACRxtB,SACAqE,QACA0C,QACA6F,UAEF,CAEA,SAASohB,gBACRlhB,EACAzI,GAQA,MAAMmpB,EAAiBxJ,SAASlX,GAC1BmhB,EAAY,IAAIhyB,IAChB+D,EAASgkB,SAASiK,GAClBC,EAAa,IAAIjyB,IAEvB,SAASkyB,EAAW/uB,GACnB,MAAM4d,EAAakR,EAAWnwB,IAAIqB,GAC9B4d,IACHA,IACAkR,EAAW1rB,OAAOpD,GAClBY,EAAOwC,OAAOpD,GAEhB,CAEA,MAAMwN,EAASsgB,sBACTnmB,EAAQ6F,EAASA,EAAO7F,MAAQ,EAAI,EAEpCqnB,EAActiB,OAAO,UAA+B+P,OAAEA,IAC3D,MAAMrc,EAAO,IAAI3D,IACjB,IAAK,MAAMuD,KAAOouB,EAAerB,UAAW3sB,EAAKX,IAAIO,GAErD,IAAK,MAAMA,KAAOI,EACb0uB,EAAW/wB,IAAIiC,IACnByc,EAAO,KACN,MAAMmO,EAAOle,OAAO,WACnB,MAAM8hB,EAAWxQ,UAAU,IAAMpd,EAAOjC,IAAIqB,IACtCyuB,EAAa,CAClBzuB,MACA0N,OAAQ0gB,EACRzvB,IAAK,IAAMyvB,EAAezvB,IAAIqB,GAC9BnB,IAAMR,IACL+vB,EAAevvB,IAAImB,EAAK3B,IACjB,GAERqwB,IAAKF,GAENT,kBAAkBU,GAClB,MAAME,EAAW1pB,EAAMwpB,EAAY7tB,GACnCA,EAAO/B,IAAImB,EAAK2uB,EACjB,GACAtgB,cAAcuc,EAAM,WAAWjjB,MAAUjK,OAAOsC,MAChD6tB,yBAAyBhvB,IAAI+rB,EAAM,CAClCld,OAAQ0gB,EACRpuB,MACAY,SACA+G,QACA6F,WAEDshB,EAAWjwB,IAAImB,EAAK4qB,KAItB,IAAK,MAAM5qB,KAAO1D,MAAMiR,KAAKuhB,EAAW1uB,QAAcA,EAAKrC,IAAIiC,IAAM+uB,EAAW/uB,EACjF,GAEA,OAAOguB,YAAYptB,EAAQkuB,EAAY,IAAME,IAAe,CAC3DthB,OAAQ0gB,EACRxtB,SACAqE,QACA0C,QACA6F,UAEF,CAEA,SAASyhB,cACRvhB,EACAzI,GAQA,MAAMmpB,EAAiBxJ,SAASlX,GAC1B9M,EAASgkB,SAAS,IAClBkK,EAAa,IAAIjyB,IAEvB,SAASkyB,EAAW/uB,GACnB,MAAM4d,EAAakR,EAAWnwB,IAAIqB,GAC9B4d,IACHA,IACAkR,EAAW1rB,OAAOpD,GAClBzC,QAAQknB,eAAe7jB,EAAwCZ,GAEjE,CAEA,MAAMwN,EAASsgB,sBACTnmB,EAAQ6F,EAASA,EAAO7F,MAAQ,EAAI,EAEpCqnB,EAActiB,OAAO,UAA6B+P,OAAEA,IACzD,MAAMrc,EAAO,IAAI3D,IACjB,IAAK,MAAMuD,KAAOouB,EAAgBhuB,EAAKX,IAAIO,GAC3C,MAAMkvB,EAAW3xB,QAAQqkB,QAAQwM,GACjC,IAAK,MAAMpuB,KAAOkvB,EAAU9uB,EAAKX,IAAIO,GAErC,IAAK,MAAMA,KAAOI,EACb0uB,EAAW/wB,IAAIiC,IACnByc,EAAO,KACN,MAAMmO,EAAOle,OAAO,WACnB,MAAMyiB,EAAYnvB,EACZwuB,EAAWxQ,UAChB,IAAOpd,EAAwDZ,IAE1DyuB,EAAa,CAClBzuB,IAAKmvB,EACLzhB,OAAQ0gB,EACRzvB,IAAK,IAAML,WAAW8vB,EAAgBe,EAAWf,GACjDvvB,IAAMR,GACLO,WAAWwvB,EAAgBe,EAAW9wB,EAAO+vB,GAC9CM,IAAKF,GAONT,kBAAkBU,GAClB,MAAME,EAAW1pB,EAAMwpB,EAAY7tB,GACjCA,EAAeuuB,GAAaR,CAC/B,GACAtgB,cAAcuc,EAAM,WAAWjjB,MAAUjK,OAAOsC,MAChD6tB,yBAAyBhvB,IAAI+rB,EAAM,CAClCld,OAAQ0gB,EACRpuB,MACAY,SACA+G,QACA6F,WAEDshB,EAAWjwB,IAAImB,EAAK4qB,KAItB,IAAK,MAAM5qB,KAAO1D,MAAMiR,KAAKuhB,EAAW1uB,QAAcA,EAAKrC,IAAIiC,IAAM+uB,EAAW/uB,EACjF,GAEA,OAAOguB,YAAYptB,EAAQkuB,EAAY,IAAME,IAAe,CAC3DthB,OAAQ0gB,EACRxtB,SACAqE,QACA0C,QACA6F,UAEF,CAEA,SAAS4hB,WACR1hB,EACAzI,GAEA,MAAMmpB,EAAiBxJ,SAASlX,GAC1BmhB,EAAY,IAAIhyB,IAChB+D,EAASgkB,SAASiK,GAClBC,EAAa,IAAIjyB,IAEvB,SAASkyB,EAAW/uB,GACnB,MAAM4d,EAAakR,EAAWnwB,IAAIqB,GAC9B4d,IACHA,IACAkR,EAAW1rB,OAAOpD,GAClBY,EAAOwC,OAAOpD,GAEhB,CAEA,MAAMwN,EAASsgB,sBACTnmB,EAAQ6F,EAASA,EAAO7F,MAAQ,EAAI,EAEpCqnB,EAActiB,OAAO,UAA0B+P,OAAEA,IACtD,MAAMrc,EAAO,IAAI3D,IACjB,IAAK,MAAMuD,KAAOouB,EAAehuB,OAAQA,EAAKX,IAAIO,GAElD,IAAK,MAAMA,KAAOI,EACb0uB,EAAW/wB,IAAIiC,IACnByc,EAAO,KACN,MAAMmO,EAAOle,OAAO,WACnB,MAAM8hB,EAAWxQ,UAAU,IAAMpd,EAAOjC,IAAIqB,IACtCyuB,EAAa,CAClBzuB,MACA0N,OAAQ0gB,EACRzvB,IAAK,IAAMyvB,EAAezvB,IAAIqB,GAC9BnB,IAAMR,IACL+vB,EAAevvB,IAAImB,EAAK3B,IACjB,GAERqwB,IAAKF,GAENT,kBAAkBU,GAClB,MAAME,EAAW1pB,EAAMwpB,EAAY7tB,GACnCA,EAAO/B,IAAImB,EAAK2uB,EACjB,GACAtgB,cAAcuc,EAAM,WAAWjjB,MAAUjK,OAAOsC,MAChD6tB,yBAAyBhvB,IAAI+rB,EAAM,CAClCld,OAAQ0gB,EACRpuB,MACAY,SACA+G,QACA6F,WAEDshB,EAAWjwB,IAAImB,EAAK4qB,KAItB,IAAK,MAAM5qB,KAAO1D,MAAMiR,KAAKuhB,EAAW1uB,QAAcA,EAAKrC,IAAIiC,IAAM+uB,EAAW/uB,EACjF,GAEA,OAAOguB,YAAYptB,EAAQkuB,EAAY,IAAME,IAAe,CAC3DthB,OAAQ0gB,EACRxtB,SACAqE,QACA0C,QACA6F,UAEF,CAqCA,SAAS6hB,YAAY3hB,EAAazI,GACjC,GAAI3I,MAAMC,QAAQmR,GAAS,OAAOygB,aAAazgB,EAAQzI,GACvD,GAAIyI,aAAkB7Q,IAAK,OAAOuyB,WAAW1hB,EAAQzI,GACrD,GAAIyI,aAAkBkgB,SAAU,OAAOgB,gBAAgBlhB,EAAQzI,GAC/D,GAAIyI,IAAWA,EAAOhV,cAAgBgE,aAAiCpC,IAAvBoT,EAAOhV,aACtD,OAAOu2B,cAAcvhB,EAAQzI,GAC9B,MAAM,IAAIxM,MAAM,0BACjB,OAEa62B,QAA2B5yB,OAAOqY,OAAOsa,YAAa,CAClEvI,MAAOqH,aACPxqB,SAAUirB,gBACV5gB,OAAQihB,cACRpzB,IAAKuzB,aCzTA,SAAUG,UAIf7hB,EACAzI,EACAuqB,EAAqB,CAAA,GAErB,MAAMpB,EAAiBxJ,SAASlX,GAC1B9M,EAASgkB,SAAS4K,GAClBV,EAAa,IAAIjyB,IAEvB,SAASkyB,EAAW/uB,GACnB,MAAM4d,EAAakR,EAAWnwB,IAAIqB,GAC9B4d,IACHkR,EAAW1rB,OAAOpD,GAClB4d,IAEF,CAEA,MAAMoR,EAActiB,OAAO,UAA6B+P,OAAEA,IAEzD,MAAMrc,EAAO,IAAI3D,IACjB,IAAK,MAAMuD,KAAOouB,EAAgBhuB,EAAKX,IAAIO,GAE3C,IAAK,MAAMA,KAAOI,EACb0uB,EAAW/wB,IAAIiC,IACnByc,EAAO,KACN,MAAMmO,EAAOle,OAAO,WACnB,MAAMyiB,EAAYnvB,EACZyuB,EAAa,CAClBzuB,IAAKmvB,EACLxwB,IAAK,IAAML,WAAW8vB,EAAgBe,EAAWf,GACjDvvB,IAAMR,GACLO,WAAWwvB,EAAgBe,EAAW9wB,EAAO+vB,IAQ/C,OANA1xB,OAAOoC,eAAe2vB,EAAY,QAAS,CAC1C9vB,IAAK8vB,EAAW9vB,IAChBE,IAAK4vB,EAAW5vB,IAChBE,cAAc,EACdE,YAAY,IAENgG,EAAMwpB,EAAyD7tB,EACvE,GACAkuB,EAAWjwB,IAAImB,EAAK4qB,KAItB,IAAK,MAAM5qB,KAAO1D,MAAMiR,KAAKuhB,EAAW1uB,QAAcA,EAAKrC,IAAIiC,IAAM+uB,EAAW/uB,EACjF,GAEA,OAAOkmB,UAAUtlB,EAAQ,KACxBouB,IACA,IAAK,MAAMhvB,KAAO1D,MAAMiR,KAAKuhB,EAAW1uB,QAAS2uB,EAAW/uB,IAE9D,UAUgByvB,SACf7uB,EACA8uB,EACA9J,GASA,OAPAlpB,OAAOoC,eAAe8B,EAAQ8uB,EAAU,CACvC/wB,IAAKinB,EAAOjnB,IACZE,IAAK+mB,EAAO/mB,IACZE,cAAc,EACdE,YAAY,IAEb4gB,SAASjf,EAAQ,CAAE6O,KAAM,MAAOjR,KAAMkxB,GAAYA,GAC3C,WAAc9uB,EAAe8uB,EACrC,CC5LA,MAAMlJ,SAAS1uB,OAAO,gBAMT63B,gBAGZ,WAAAj3B,CAAYkL,GACXlH,OAAO0B,iBAAiBtF,KAAM,CAC7B82B,CAACpJ,UAAS,CAAEnoB,MAAOuF,GACnB3L,CAACA,qBAAsB,CAAEoG,MAAOuF,GAChCisB,QAAS,CAAExxB,MAAOvG,OAAO,mBACzB,CAACA,OAAO6K,aAAc,CAAEtE,MAAO,oBAEjC,CAGA,OAAO2B,GACN,MAAM8vB,EAASh3B,KAAK0tB,UAAQzoB,IAAIiC,GAC1BjE,EAASjD,KAAK0tB,UAAQpjB,OAAOpD,GAInC,OAFI8vB,GAAQjQ,SAAS/mB,KAAK+2B,QAAS,CAAEpgB,KAAM,MAAOjR,KAAMwB,GAAOA,GAExDjE,CACR,CAEA,GAAA4C,CAAIqB,GAEH,OADAkT,UAAUpa,KAAK+2B,QAAS7vB,GACjB4kB,SAAS9rB,KAAK0tB,UAAQ7nB,IAAIqB,GAClC,CAEA,GAAAjC,CAAIiC,GAEH,OADAkT,UAAUpa,KAAK+2B,QAAS7vB,GACjBlH,KAAK0tB,UAAQzoB,IAAIiC,EACzB,CAEA,GAAAnB,CAAImB,EAAQ3B,GACX,MAAMyxB,EAASh3B,KAAK0tB,UAAQzoB,IAAIiC,GAC1B+gB,EAAWjoB,KAAK0tB,UAAQ7nB,IAAIqB,GAC5BqkB,EAAgBO,SAASvmB,GAO/B,OANAvF,KAAK0tB,UAAQ3nB,IAAImB,EAAKqkB,GAEjByL,GAAU/O,IAAasD,GAC3BpD,qBAAqBnoB,KAAK+2B,QAAS7vB,EAAK+gB,EAAUsD,EAAeyL,GAG3Dh3B,IACR,QAOYi3B,YAIZ,WAAAr3B,CAAYkL,GACXlH,OAAO0B,iBAAiBtF,KAAM,CAC7B82B,CAACpJ,UAAS,CAAEnoB,MAAOuF,GACnB3L,CAACA,qBAAsB,CAAEoG,MAAOuF,GAChCisB,QAAS,CAAExxB,MAAOvG,OAAO,eACzB,CAACA,OAAO6K,aAAc,CAAEtE,MAAO,gBAEjC,CAGA,QAAIuB,GAEH,OADAsT,UAAUpa,KAAM,QACTA,KAAK0tB,UAAQ5mB,IACrB,CAEA,KAAAqJ,GACC,MAAM+mB,EAAal3B,KAAK0tB,UAAQ5mB,KAAO,EAGvC,GAFA9G,KAAK0tB,UAAQvd,QAET+mB,EAAY,CACf,MAAMliB,EAAY,CAAE2B,KAAM,QAASnO,OAAQ,SAE3Cue,SAAS/mB,KAAMgV,EAAW,QAC1BnU,QAAQb,KAAK+2B,QAAS/hB,EACvB,CACD,CAEA,OAAAxG,GAEC,OADA4L,UAAUpa,KAAK+2B,SACRtJ,4BAA4BztB,KAAK0tB,UAAQlf,UACjD,CAEA,OAAAlB,CAAQN,EAAwDC,GAC/DmN,UAAUpa,KAAK+2B,SACf/2B,KAAK0tB,UAAQpgB,QAAQN,EAAYC,EAClC,CAEA,IAAA3F,GAEC,OADA8S,UAAUpa,KAAK+2B,SACR/2B,KAAK0tB,UAAQpmB,MACrB,CAEA,MAAAiH,GAEC,OADA6L,UAAUpa,KAAK+2B,SACRxJ,qBAAqBvtB,KAAK0tB,UAAQnf,SAC1C,CAEA,CAACvP,OAAO+N,YACPqN,UAAUpa,KAAK+2B,SACf,MAAMlJ,EAAiB7tB,KAAK0tB,UAAQ1uB,OAAO+N,YAC3C,MAAO,CACN,IAAAkS,GACC,MAAMhc,EAAS4qB,EAAe5O,OAC9B,OAAIhc,EAAOuqB,KACHvqB,EAED,CACNsC,MAAO,CAACtC,EAAOsC,MAAM,GAAIumB,SAAS7oB,EAAOsC,MAAM,KAC/CioB,MAAM,EAER,EAEF,CAGA,OAAOtmB,GACN,MAAM8vB,EAASh3B,KAAK0tB,UAAQzoB,IAAIiC,GAC1BjE,EAASjD,KAAK0tB,UAAQpjB,OAAOpD,GAEnC,GAAI8vB,EAAQ,CACX,MAAMhiB,EAAY,CAAE2B,KAAM,MAAOjR,KAAMwB,GACvC6f,SAAS/mB,KAAK+2B,QAAS/hB,EAAW9N,GAClC6f,SAAS/mB,KAAMgV,EAAW,OAC3B,CAEA,OAAO/R,CACR,CAEA,GAAA4C,CAAIqB,GAEH,OADAkT,UAAUpa,KAAK+2B,QAAS7vB,GACjB4kB,SAAS9rB,KAAK0tB,UAAQ7nB,IAAIqB,GAClC,CAEA,GAAAjC,CAAIiC,GAEH,OADAkT,UAAUpa,KAAK+2B,QAAS7vB,GACjBlH,KAAK0tB,UAAQzoB,IAAIiC,EACzB,CAEA,GAAAnB,CAAImB,EAAQ3B,GACX,MAAMyxB,EAASh3B,KAAK0tB,UAAQzoB,IAAIiC,GAC1B+gB,EAAWjoB,KAAK0tB,UAAQ7nB,IAAIqB,GAC5BqkB,EAAgBO,SAASvmB,GAG/B,GAFAvF,KAAK0tB,UAAQ3nB,IAAImB,EAAKqkB,IAEjByL,GAAU/O,IAAasD,EAAe,CAC1CpD,qBAAqBnoB,KAAK+2B,QAAS7vB,EAAK+gB,EAAUsD,EAAeyL,GAGjEjQ,SAAS/mB,KADS,CAAE2W,KAAMqgB,EAAS,MAAQ,MAAOtxB,KAAMwB,GAC9B,OAC3B,CAEA,OAAOlH,IACR,ECnKD,MAAM0tB,OAAS1uB,OAAO,gBAMTm4B,gBAIZ,WAAAv3B,CAAYkL,GACXlH,OAAO0B,iBAAiBtF,KAAM,CAC7B0tB,CAACA,QAAS,CAAEnoB,MAAOuF,GACnB3L,CAACA,qBAAsB,CAAEoG,MAAOuF,GAChCisB,QAAS,CAAExxB,MAAOvG,OAAO,mBACzB,CAACA,OAAO6K,aAAc,CAAEtE,MAAO,oBAEjC,CAEA,GAAAoB,CAAIpB,GACH,MAAM6xB,EAAMp3B,KAAK0tB,QAAQzoB,IAAIM,GAO7B,OANAvF,KAAK0tB,QAAQ/mB,IAAIpB,GACZ6xB,GAEJrQ,SAAS/mB,KAAK+2B,QAAS,CAAEpgB,KAAM,MAAOjR,KAAMH,GAASA,GAG/CvF,IACR,CAEA,OAAOuF,GACN,MAAM6xB,EAAMp3B,KAAK0tB,QAAQzoB,IAAIM,GACvB8xB,EAAMr3B,KAAK0tB,QAAQpjB,OAAO/E,GAEhC,OADI6xB,GAAKrQ,SAAS/mB,KAAK+2B,QAAS,CAAEpgB,KAAM,MAAOjR,KAAMH,GAASA,GACvD8xB,CACR,CAEA,GAAApyB,CAAIM,GAEH,OADA6U,UAAUpa,KAAK+2B,QAASxxB,GACjBvF,KAAK0tB,QAAQzoB,IAAIM,EACzB,QAOY+xB,YAGZ,WAAA13B,CAAYkL,GACXlH,OAAO0B,iBAAiBtF,KAAM,CAC7B0tB,CAACA,QAAS,CAAEnoB,MAAOuF,GACnB3L,CAACA,qBAAsB,CAAEoG,MAAOuF,GAChCisB,QAAS,CAAExxB,MAAOvG,OAAO,eACzB,CAACA,OAAO6K,aAAc,CAAEtE,MAAO,gBAEjC,CAEA,QAAIuB,GAGH,OADAsT,UAAUpa,KAAM,QACTA,KAAK0tB,QAAQ5mB,IACrB,CAEA,GAAAH,CAAIpB,GACH,MAAM6xB,EAAMp3B,KAAK0tB,QAAQzoB,IAAIM,GACvBgmB,EAAgBO,SAASvmB,GAE/B,GADAvF,KAAK0tB,QAAQ/mB,IAAI4kB,IACZ6L,EAAK,CACT,MAAMpiB,EAAY,CAAE2B,KAAM,MAAOjR,KAAM6lB,GAEvCxE,SAAS/mB,KAAK+2B,QAAS/hB,EAAWuW,GAClCxE,SAAS/mB,KAAMgV,EAAW,OAC3B,CACA,OAAOhV,IACR,CAEA,KAAAmQ,GACC,MAAM+mB,EAAal3B,KAAK0tB,QAAQ5mB,KAAO,EAEvC,GADA9G,KAAK0tB,QAAQvd,QACT+mB,EAAY,CACf,MAAMliB,EAAY,CAAE2B,KAAM,QAASnO,OAAQ,SAC3Cue,SAAS/mB,KAAMgV,EAAW,QAC1BnU,QAAQb,KAAK+2B,QAAS/hB,EACvB,CACD,CAEA,OAAOzP,GACN,MAAM6xB,EAAMp3B,KAAK0tB,QAAQzoB,IAAIM,GACvB8xB,EAAMr3B,KAAK0tB,QAAQpjB,OAAO/E,GAChC,GAAI6xB,EAAK,CACR,MAAMpiB,EAAY,CAAE2B,KAAM,MAAOjR,KAAMH,GACvCwhB,SAAS/mB,KAAK+2B,QAAS/hB,EAAWzP,GAClCwhB,SAAS/mB,KAAMgV,EAAW,OAC3B,CACA,OAAOqiB,CACR,CAEA,GAAApyB,CAAIM,GAEH,OADA6U,UAAUpa,KAAK+2B,QAASxxB,GACjBvF,KAAK0tB,QAAQzoB,IAAIM,EACzB,CAEA,OAAAiJ,GAEC,OADA4L,UAAUpa,KAAK+2B,SACRtJ,4BAA4BztB,KAAK0tB,QAAQlf,UACjD,CAEA,OAAAlB,CAAQN,EAAwDC,GAC/DmN,UAAUpa,KAAK+2B,SACf/2B,KAAK0tB,QAAQpgB,QAAQN,EAAYC,EAClC,CAEA,IAAA3F,GAEC,OADA8S,UAAUpa,KAAK+2B,SACRxJ,qBAAqBvtB,KAAK0tB,QAAQpmB,OAC1C,CAEA,MAAAiH,GAEC,OADA6L,UAAUpa,KAAK+2B,SACRxJ,qBAAqBvtB,KAAK0tB,QAAQnf,SAC1C,CAEA,CAACvP,OAAO+N,YACPqN,UAAUpa,KAAK+2B,SACf,MAAMlJ,EAAiB7tB,KAAK0tB,QAAQ1uB,OAAO+N,YAC3C,MAAO,CACN,IAAAkS,GACC,MAAMhc,EAAS4qB,EAAe5O,OAC9B,OAAIhc,EAAOuqB,KACHvqB,EAED,CAAEsC,MAAOumB,SAAS7oB,EAAOsC,OAAQioB,MAAM,EAC/C,EAEF,ECrFD9F,yBAAyB1jB,QAAS6yB,iBAClCnP,yBAAyB3jB,IAAKkzB,aAC9BvP,yBAAyBzjB,QAASkzB,iBAClCzP,yBAAyB/jB,IAAK2zB,aAC9B5P,yBAAyBlkB,MAAO2qB,eAKzB,MAAMoJ,YAAmB,CAC/B9d,4BACAC,4BACAxH,gDACAC,kBACAmT,4BACAC,gDACAC,0BACAC,sDACAyB,uCCxEKsQ,gBAA2D,GAKpD5lB,OAAS1I,UAAU,CAC/Bd,OAAM,CAAC0C,EAAU/B,EAAShB,IAClB,WACN,MAAM0vB,EAAqBD,gBAAgBhqB,UACzCxB,GAAMA,EAAEmJ,SAAWnV,MAAQgM,EAAEtG,OAASqC,GAExC,GAAI0vB,GAAqB,EACxB,MAAM,IAAI93B,MACT,iCAAiC63B,gBAC/B1pB,MAAM2pB,GACN10B,IAAKiJ,GAAM,GAAGA,EAAEmJ,OAAOvV,YAAYK,QAAQ2E,OAAOoH,EAAEtG,SACpD2I,KAAK,oBAETmpB,gBAAgBp0B,KAAK,CAAE+R,OAAQnV,KAAM0F,KAAMqC,IAC3C,IACC,MAAMc,EAAKiC,EAASpD,KAAK1H,MAEzB,OADAwG,MAAMxG,KAAM+H,EAAac,GAClBA,CACR,SACC2uB,gBAAgBta,KACjB,CACD,IAUI,SAAUwa,SAASviB,EAAgBpN,GACxC,QAASnE,OAAO0C,yBAAyB6O,EAAQpN,EAClD,UAQgBvB,MAAM2O,EAAgBpN,EAA0BxC,GAC/D3B,OAAOoC,eAAemP,EAAQpN,EAAa,CAAExC,SAC9C,CAOM,SAAUoyB,SAAS3vB,GAKxB,MAAO,IAAO4vB,IACZC,GACO,cAAcA,EACpB,WAAAj4B,IAAeqC,GACdlC,SAASkC,GACT,IAAK,MAAMiF,KAAO0wB,EACjBh0B,OAAOoC,eAAehG,KAAMkH,EAAK,IAC7BtD,OAAO0C,yBAAyBtG,KAAMkH,MACtCc,GAGN,EAGJ,OAMa8vB,WAAal0B,OAAOqY,OAChC/S,UAAU,CACTV,OAAM,CAACsC,EAAU/B,EAAShB,IAClB,YAAwB9F,GAE9B,OADA61B,WAAW91B,KAAKhC,KAAM+H,GACf+C,EAASqB,MAAMnM,KAAMiC,EAC7B,EAEDmG,OAAM,CAAC0C,EAAU/B,EAAShB,IAClB,WAEN,OADA+vB,WAAW91B,KAAKhC,KAAM+H,GACf+C,EAASpD,KAAK1H,KACtB,EAEDsI,OAAM,CAACwC,EAAU/B,EAAShB,IAClB,SAAqBxC,GAE3B,OADAuyB,WAAW91B,KAAKhC,KAAM+H,GACf+C,EAASpD,KAAK1H,KAAMuF,EAC5B,EAED0C,MAAM6C,GACE,cAAcA,EACpB,WAAAlL,IAAeqC,GACdlC,SAASkC,GACT61B,WAAW91B,KAAKhC,KAAM,cACvB,GAGFyI,QAAQ5I,GACAqJ,UAAU,CAChBV,OAAM,CAACsC,EAAU/B,EAAShB,IAClB,YAAwB9F,GAE9B,OADA61B,WAAW91B,KAAKhC,KAAM+H,EAAalI,GAC5BiL,EAASqB,MAAMnM,KAAMiC,EAC7B,EAEDmG,OAAM,CAAC0C,EAAU/B,EAAShB,IAClB,WAEN,OADA+vB,WAAW91B,KAAKhC,KAAM+H,EAAalI,GAC5BiL,EAASpD,KAAK1H,KACtB,EAEDsI,OAAM,CAACwC,EAAU/B,EAAShB,IAClB,SAAqBxC,GAE3B,OADAuyB,WAAW91B,KAAKhC,KAAM+H,EAAalI,GAC5BiL,EAASpD,KAAK1H,KAAMuF,EAC5B,EAED0C,MAAM6C,GACE,cAAcA,EACpB,WAAAlL,IAAeqC,GACdlC,SAASkC,GACT61B,WAAW91B,KAAKhC,KAAM,cAAeH,EACtC,OAML,CACCmC,KAAM,CAAC8F,EAAaC,EAA0BlI,SAc1C,SAAUk4B,SAAS/b,GACxB,OAAO9S,UAAU,CAChB,MAAAV,CAAOsC,EAAU/B,EAASivB,GACzB,IAAIC,EAAkD,KAEtD,OAAO,YAAwBh2B,GAE1Bg2B,GACHC,aAAaD,GAIdA,EAAY31B,WAAW,KACtBwI,EAASqB,MAAMnM,KAAMiC,GACrBg2B,EAAY,MACVjc,EACJ,CACD,GAEF,CAOM,SAAUmc,SAASnc,GACxB,OAAO9S,UAAU,CAChB,MAAAV,CAAOsC,EAAU/B,EAASivB,GACzB,IAAII,EAAe,EACfH,EAAkD,KAEtD,OAAO,YAAwBh2B,GAC9B,MAAMqT,EAAMzR,KAAKyR,MAGjB,GAAIA,EAAM8iB,GAAgBpc,EAOzB,OALIic,IACHC,aAAaD,GACbA,EAAY,MAEbG,EAAe9iB,EACRxK,EAASqB,MAAMnM,KAAMiC,GAI7B,IAAKg2B,EAAW,CACf,MAAMI,EAAgBrc,GAAS1G,EAAM8iB,GAC/BE,EAAgB,IAAIr2B,GAC1Bg2B,EAAY31B,WAAW,KACtB81B,EAAev0B,KAAKyR,MACpBxK,EAASqB,MAAMnM,KAAMs4B,GACrBL,EAAY,MACVI,EACJ,CACD,CACD,GAEF,+CC7MA,MAAME,QAAEA,SAAYC,IAGdC,iBAAmB,qBACnBC,YACkB,oBAAfzd,WAA6BA,WAClB,oBAAXnD,OAAyBA,OACd,oBAAX6gB,QAAyBA,OAClC,GAAGD,YAAa,CAEf,IAAI9jB,OAAS,cACb,IAEC,GAA0B,oBAAfgkB,WAA4BhkB,OAASgkB,eAE3C,CAEJ,MAAMjhB,KAAOkhB,KAAK,eACdlhB,MAAQA,KAAKmhB,MAAKlkB,OAAS+C,KAAKmhB,IACrC,CACD,CAAE,MAAOltB,GAET,CAEA,MAAMmtB,kBAAoB,CACzBR,gBACA3jB,cACA0D,UAAWzU,KAAKyR,OAGjB,GAAIojB,YAAYD,kBAAmB,CAClC,MAAM/lB,EAAWgmB,YAAYD,kBAC7B,MAAM,IAAI94B,MAET,4DAAsBq5B,KAAKC,UAAUvmB,EAAU,KAAM,qBACpCsmB,KAAKC,UAAUF,kBAAmB,KAAM,6NAK3D,CAEAL,YAAYD,kBAAoBM,iBACjC"}
+{"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/indexable.ts","../src/iterableWeak.ts","../src/mixins.ts","../src/promiseChain.ts","../src/reactive/types.ts","../src/reactive/registry.ts","../src/reactive/debug.ts","../src/zone.ts","../src/reactive/effect-context.ts","../src/reactive/proxy-state.ts","../src/reactive/effects.ts","../src/reactive/deep-watch-state.ts","../src/reactive/change.ts","../src/reactive/non-reactive-state.ts","../src/reactive/deep-touch.ts","../src/reactive/tracking.ts","../src/reactive/proxy.ts","../src/reactive/deep-watch.ts","../src/reactive/interface.ts","../src/reactive/memoize.ts","../src/reactive/non-reactive.ts","../src/reactive/register.ts","../src/reactive/project.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/eventful.ts","../src/reactive/record.ts","../src/reactive/buffer.ts"],"sourcesContent":["export type Restorer = () => () => void\nexport type Hook = () => Restorer\n\nexport const asyncHooks = {\n\taddHook(_hook: Hook): () => void {\n\t\tthrow 'One must import the library from the server or the client side'\n\t},\n    /** \n     * [Hack] Sanitize a promise (or value) to prevent context leaks. \n     * Default: Identity function.\n     * Browser: Uses Macrotask wrapping to break microtask chains.\n     */\n    sanitizePromise(p: any): any {\n        return p\n    }\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)","import { Hook, Restorer, asyncHooks } from '.'\n\nconst hooks = new Set<Hook>()\nconst promiseContexts = new WeakMap<Promise<any>, Set<Restorer>>()\n\nasyncHooks.addHook = function (hook: Hook) {\n\thooks.add(hook)\n\treturn () => {\n\t\thooks.delete(hook)\n\t}\n}\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    if (res && typeof (res as any).then === 'function') {\n        return new Promise((resolve, reject) => {\n            setTimeout(() => {\n                (res as any).then(resolve, reject)\n            }, 0)\n        })\n    }\n    return 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>(fn: ((...args: Args) => R) | null | undefined, capturedRestorers?: Set<Restorer>) {\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\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 targetWrappers = new WeakMap<any, Map<string, WeakMap<Function, Function>>>()\n\nfunction patchEventTarget(proto: any) {\n\tif (!proto || !proto.addEventListener || !proto.removeEventListener) return\n\tconst nativeAdd = proto.addEventListener\n\tconst nativeRemove = proto.removeEventListener\n\n\tproto.addEventListener = function (this: any, type: string, listener: any, options: any) {\n\t\tif (typeof listener !== 'function') {\n\t\t\treturn nativeAdd.call(this, type, listener, options)\n\t\t}\n\n\t\tlet types = targetWrappers.get(this)\n\t\tif (!types) {\n\t\t\ttypes = new Map()\n\t\t\ttargetWrappers.set(this, types)\n\t\t}\n\t\tlet listeners = types.get(type)\n\t\tif (!listeners) {\n\t\t\tlisteners = new WeakMap()\n\t\t\ttypes.set(type, listeners)\n\t\t}\n\n\t\tlet wrapped = listeners.get(listener)\n\t\tif (!wrapped) {\n\t\t\twrapped = wrap(listener)\n\t\t\tlisteners.set(listener, wrapped)\n\t\t}\n\t\t\n\t\treturn nativeAdd.call(this, type, wrapped, options)\n\t}\n\n\tproto.removeEventListener = function (this: any, type: string, listener: any, options: any) {\n\t\tif (typeof listener !== 'function') {\n\t\t\treturn nativeRemove.call(this, type, listener, options)\n\t\t}\n\n\t\tconst types = targetWrappers.get(this)\n\t\tif (types) {\n\t\t\tconst listeners = types.get(type)\n\t\t\tif (listeners) {\n\t\t\t\tconst wrapped = listeners.get(listener)\n\t\t\t\tif (wrapped) {\n\t\t\t\t\treturn nativeRemove.call(this, type, wrapped, options)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn nativeRemove.call(this, type, listener, options)\n\t}\n}\n\nfunction patchOnProperties(proto: any) {\n\tif (!proto) return\n\tfor (const prop of Object.getOwnPropertyNames(proto)) {\n\t\tif (prop.startsWith('on')) {\n\t\t\tconst desc = Object.getOwnPropertyDescriptor(proto, prop)\n\t\t\tif (desc && desc.set && desc.configurable) {\n\t\t\t\tconst nativeSet = desc.set\n\t\t\t\tObject.defineProperty(proto, prop, {\n\t\t\t\t\t...desc,\n\t\t\t\t\tset: function (this: any, fn: any) {\n\t\t\t\t\t\tnativeSet.call(this, wrap(fn))\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t}\n\t\t}\n\t}\n}\n\nif (typeof EventTarget !== 'undefined') {\n\tpatchEventTarget(EventTarget.prototype)\n}\n\nconst prototypesToPatch = [\n\ttypeof EventTarget !== 'undefined' && EventTarget.prototype,\n\ttypeof HTMLElement !== 'undefined' && HTMLElement.prototype,\n\ttypeof Window !== 'undefined' && Window.prototype,\n\ttypeof Document !== 'undefined' && Document.prototype,\n\ttypeof MessagePort !== 'undefined' && MessagePort.prototype,\n\ttypeof XMLHttpRequest !== 'undefined' && XMLHttpRequest.prototype,\n\ttypeof IDBRequest !== 'undefined' && IDBRequest.prototype,\n\ttypeof IDBTransaction !== 'undefined' && IDBTransaction.prototype,\n\ttypeof IDBDatabase !== 'undefined' && IDBDatabase.prototype,\n\ttypeof FileReader !== 'undefined' && FileReader.prototype,\n\ttypeof AbortSignal !== 'undefined' && AbortSignal.prototype,\n]\n\nfor (const proto of prototypesToPatch) {\n\tif (proto) {\n\t\tpatchOnProperties(proto)\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    originals = (globalThis as any)[GLOBAL_ORIGINALS];\n    OriginalPromise = (globalThis as any)[GLOBAL_PROMISE];\n} else {\n    OriginalPromise = globalThis.Promise;\n    originals = {\n        then: OriginalPromise.prototype.then,\n        catch: OriginalPromise.prototype.catch,\n        finally: OriginalPromise.prototype.finally,\n        resolve: OriginalPromise.resolve,\n        reject: OriginalPromise.reject,\n        all: OriginalPromise.all,\n        allSettled: (OriginalPromise as any).allSettled,\n        race: OriginalPromise.race,\n        any: (OriginalPromise as any).any,\n        setTimeout: globalThis.setTimeout,\n        setInterval: globalThis.setInterval,\n        setImmediate: (globalThis as any).setImmediate,\n        requestAnimationFrame: (globalThis as any).requestAnimationFrame,\n        queueMicrotask: globalThis.queueMicrotask,\n    };\n    (globalThis as any)[GLOBAL_ORIGINALS] = originals;\n    (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(this, wrap(onFulfilled, context), wrap(onRejected, context))\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>(this: any, executor: (resolve: (value: T | PromiseLike<T>) => void, reject: (reason?: any) => void) => void) {\n    if (typeof executor === 'function') {\n        const p = new OriginalPromise((resolve, reject) => {\n            const wrappedResolve = wrap(resolve)\n            const wrappedReject = wrap(reject)\n            executor(wrappedResolve, wrappedReject)\n        })\n        const context = captureRestorers()\n        promiseContexts.set(p, context) // Always set, even if empty (Sticky Root)\n        return p\n    }\n    return 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 = function<T>(value?: T | PromiseLike<T>): Promise<T> {\n    const p = originals.resolve.call(OriginalPromise, value) as Promise<T>\n    const context = captureRestorers()\n    // Ensure we don't overwrite if it already has context (e.g. from constructor)\n    if (context.size > 0 && !promiseContexts.has(p)) promiseContexts.set(p, context)\n    return p\n} as any\n\nPatchedPromise.reject = function<T = never>(reason?: any): Promise<T> {\n    const p = originals.reject.call(OriginalPromise, reason) as Promise<T>\n    const context = captureRestorers()\n    if (context.size > 0) promiseContexts.set(p, context)\n    return p\n} as any\n\nPatchedPromise.all = function<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>[]> {\n    const p = originals.all.call(OriginalPromise, values) as Promise<Awaited<T>[]>\n    const context = captureRestorers()\n    if (context.size > 0) promiseContexts.set(p, context)\n    return p\n} as any\n\nPatchedPromise.allSettled = function<T>(values: Iterable<T | PromiseLike<T>>): Promise<PromiseSettledResult<Awaited<T>>[]> {\n    const p = (originals.allSettled as any).call(OriginalPromise, values)\n    const context = captureRestorers()\n    if (context.size > 0) promiseContexts.set(p, context)\n    return p\n} as any\n\nPatchedPromise.race = function<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>> {\n    const p = originals.race.call(OriginalPromise, values) as Promise<Awaited<T>>\n    const context = captureRestorers()\n    if (context.size > 0) promiseContexts.set(p, context)\n    return p\n} as any\n\nPatchedPromise.any = function<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>> {\n    const p = (originals.any as any).call(OriginalPromise, values)\n    const context = captureRestorers()\n    if (context.size > 0) promiseContexts.set(p, context)\n    return 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    OriginalPromise.prototype.then = patchedThen as any\n    OriginalPromise.prototype.catch = patchedCatch as any\n    OriginalPromise.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 * Combines multiple arrays into an array of tuples, stopping at the shortest array length\n * @param args - Arrays to zip together\n * @returns Array of tuples containing elements from each input array\n */\nexport function zip<T extends (readonly unknown[])[]>(...args: T): ElementTypes<T>[] {\n\tif (!args.length) return []\n\tconst minLength = Math.min(...args.map((arr) => arr.length))\n\tconst result: ElementTypes<T>[] = []\n\n\tfor (let i = 0; i < minLength; i++) {\n\t\tconst tuple = args.map((arr) => arr[i]) as ElementTypes<T>\n\t\tresult.push(tuple)\n\t}\n\n\treturn result\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 (a === b) return true\n\tif (!Array.isArray(a) || !Array.isArray(b)) return false\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 * Renames a function with a new name\n * @param fct - The function to rename\n * @param name - The new name for the function\n * @returns The function with the new name\n */\nexport function renamed<F extends Function>(fct: F, name: string): F {\n\treturn Object.defineProperties(fct, {\n\t\tname: {\n\t\t\tvalue: name,\n\t\t},\n\t})\n}\nexport const FoolProof = {\n\tget(obj: any, prop: any, receiver: any) {\n\t\t// Check if Node is available and obj is an instance of Node\n\t\tif (typeof Node !== 'undefined' && 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\t// Check if Node is available and obj is an instance of Node\n\t\tif (typeof Node !== 'undefined' && 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) && !Reflect.has(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\tconst protoA = Object.getPrototypeOf(a)\n\tconst protoB = Object.getPrototypeOf(b)\n\tif (protoA !== protoB) {\n\t\tconsole.warn(`[deepCompare] prototype mismatch:`, {\n\t\t\tnameA: a?.constructor?.name,\n\t\t\tnameB: b?.constructor?.name,\n\t\t})\n\t\treturn false\n\t}\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)) {\n\t\t\tconsole.warn(`[deepCompare] B is not an array`)\n\t\t\treturn false\n\t\t}\n\t\tif (a.length !== b.length) {\n\t\t\tconsole.warn(`[deepCompare] array length mismatch:`, { lenA: a.length, lenB: b.length })\n\t\t\treturn false\n\t\t}\n\t\tfor (let i = 0; i < a.length; i++) {\n\t\t\tif (!deepCompare(a[i], b[i], cache)) {\n\t\t\t\tconsole.warn(`[deepCompare] array element mismatch at index ${i}`)\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Date) {\n\t\tconst match = b instanceof Date && a.getTime() === b.getTime()\n\t\tif (!match) console.warn(`[deepCompare] Date mismatch`)\n\t\treturn match\n\t}\n\tif (a instanceof RegExp) {\n\t\tconst match = b instanceof RegExp && a.toString() === b.toString()\n\t\tif (!match) console.warn(`[deepCompare] RegExp mismatch`)\n\t\treturn match\n\t}\n\tif (a instanceof Set) {\n\t\tif (!(b instanceof Set) || a.size !== b.size) {\n\t\t\tconsole.warn(`[deepCompare] Set size mismatch`)\n\t\t\treturn false\n\t\t}\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) {\n\t\t\t\tconsole.warn(`[deepCompare] missing Set element`)\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t}\n\tif (a instanceof Map) {\n\t\tif (!(b instanceof Map) || a.size !== b.size) {\n\t\t\tconsole.warn(`[deepCompare] Map size mismatch`)\n\t\t\treturn false\n\t\t}\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) {\n\t\t\t\t\tconsole.warn(`[deepCompare] missing Map key`)\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (!deepCompare(val, b.get(key), cache)) {\n\t\t\t\t\tconsole.warn(`[deepCompare] Map value mismatch for key`)\n\t\t\t\t\treturn false\n\t\t\t\t}\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) {\n\t\tconsole.warn(`[deepCompare] keys length mismatch:`, {\n\t\t\tlenA: keysA.length,\n\t\t\tlenB: keysB.length,\n\t\t\tkeysA,\n\t\t\tkeysB,\n\t\t\ta,\n\t\t\tb,\n\t\t})\n\t\treturn false\n\t}\n\n\tfor (const key of keysA) {\n\t\tif (!Object.hasOwn(b, key)) {\n\t\t\tconsole.warn(`[deepCompare] missing key ${String(key)} in B`)\n\t\t\treturn false\n\t\t}\n\t\tif (!deepCompare(a[key], b[key], cache)) {\n\t\t\tconsole.warn(`[deepCompare] value mismatch for key ${String(key)}:`, {\n\t\t\t\tvalA: a[key],\n\t\t\t\tvalB: b[key],\n\t\t\t})\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n\n\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\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: false,\n\t\t},\n\t\ttoString: {\n\t\t\tvalue: () => name,\n\t\t\twritable: false,\n\t\t\tconfigurable: false,\n\t\t},\n\t})\n\treturn obj\n}\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: false,\n\t})\n\treturn fn\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","/**\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","// biome-ignore-all lint/suspicious/noConfusingVoidType: Type 'void' is not assignable to type 'ScopedCallback | undefined'.\n// Argument of type '() => void' is not assignable to parameter of type '(dep: DependencyFunction) => ScopedCallback | undefined'.\n\nimport { FunctionWrapper } from \"../zone\"\n\n/**\n * Dependency access passed to user callbacks within effects/watch\n * Provides functions to track dependencies and information about the effect execution\n */\nexport interface DependencyAccess {\n\t// TODO: remove tracked (async is managed)\n\t// TODO: remove ascend (make a global like `untracked` who  withEffect(parentEffect, () => {}))\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: FunctionWrapper\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: FunctionWrapper\n\t/**\n\t * Indicates whether the effect is running as a reaction (i.e. not the first call)\n\t * - `false`: First execution when the effect is created\n\t * - `true`: Subsequent executions triggered by dependency changes\n\t * @example\n\t * ```typescript\n\t * effect(({ reaction }) => {\n\t *   if (!reaction) {\n\t *     console.log('Effect initialized')\n\t *     // Setup code that should only run once\n\t *   } else {\n\t *     console.log('Effect re-ran due to dependency change')\n\t *     // Code that runs on every update\n\t *   }\n\t * })\n\t * ```\n\t */\n\treaction: boolean\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 * Type for effect cleanup functions\n */\nexport type ScopedCallback = () => void\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}\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\ntype State =\n\t| {\n\t\t\tevolution: Evolution\n\t\t\tnext: State\n\t  }\n\t| {}\n\n// Track native reactivity\nconst nativeReactive = Symbol('native-reactive')\n\n/**\n * Symbol to mark individual objects as non-reactive\n */\nexport const nonReactiveMark = Symbol('non-reactive')\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 accessing projection information on reactive objects\n */\nexport const projectionInfo = Symbol('projection-info')\n\n/**\n * Symbol to check if an effect is stopped\n */\nexport const stopped = Symbol('stopped')\n\n/**\n * Symbol to access effect cleanup function\n */\nexport const cleanup = Symbol('cleanup')\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// Symbol to mark functions with their root function\nconst rootFunction = Symbol('root-function')\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}\n\nexport type MaxDepthDebugInfo = {\n\tcode: ReactiveErrorCode.MaxDepthExceeded\n\tdepth: number\n\tchain: string[]\n}\n\nexport type MaxReactionDebugInfo = {\n\tcode: ReactiveErrorCode.MaxReactionExceeded\n\tcount: number\n\teffect: string\n}\n\nexport type BrokenEffectsDebugInfo = {\n\tcode: ReactiveErrorCode.BrokenEffects\n\tcause: any\n}\n\nexport type GenericDebugInfo = {\n\tcode: ReactiveErrorCode\n\tcausalChain?: string[]\n\tcreationStack?: string\n\t[key: string]: any\n}\n\nexport type ReactiveDebugInfo =\n\t| CycleDebugInfo\n\t| MaxDepthDebugInfo\n\t| MaxReactionDebugInfo\n\t| BrokenEffectsDebugInfo\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?: Set<ScopedCallback>) => {},\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: ScopedCallback) => {},\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 * - `'none'` (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 execution counts).\n\t *\n\t * - `'throw'`: Traditional Topological Sorting. Guarantees dependency order and catches\n\t *   circular dependencies mathematically before execution.\n\t *\n\t * - `'warn'`: Topological sorting, but logs a warning instead of throwing on cycles.\n\t * - `'break'`: Topological sorting, but silently breaks cycles.\n\t * - `'strict'`: Prevents cycle creation by checking the graph *during* dependency discovery.\n\t *\n\t * @default 'none'\n\t */\n\tcycleHandling: 'none' as 'none' | 'throw' | 'warn' | 'break' | 'strict',\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 * Configuration for the introspection system\n\t */\n\tintrospection: {\n\t\t/**\n\t\t * Whether to keep a history of mutations for debugging\n\t\t * @default false\n\t\t */\n\t\tenableHistory: false,\n\t\t/**\n\t\t * Number of mutations to keep in history\n\t\t * @default 50\n\t\t */\n\t\thistorySize: 50,\n\t},\n\n\t/**\n\t * Configuration for zone hooks - control which async APIs are hooked\n\t * Each option controls whether the corresponding async API is wrapped to preserve effect context\n\t * Only applies when asyncMode is enabled (truthy)\n\t * @deprecated Should take all when we made sure PIXI.create, Game.create, ... are -> .root()\n\t */\n\tzones: {\n\t\t/**\n\t\t * Hook setTimeout to preserve effect context\n\t\t * @default true\n\t\t */\n\t\tsetTimeout: true,\n\t\t/**\n\t\t * Hook setInterval to preserve effect context\n\t\t * @default true\n\t\t */\n\t\tsetInterval: true,\n\t\t/**\n\t\t * Hook requestAnimationFrame (runs in untracked context when hooked)\n\t\t * @default true\n\t\t */\n\t\trequestAnimationFrame: true,\n\t\t/**\n\t\t * Hook queueMicrotask to preserve effect context\n\t\t * @default true\n\t\t */\n\t\tqueueMicrotask: true,\n\t},\n}\n// biome-ignore-end lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n\nexport { type State, nativeReactive, rootFunction }\n","import { rootFunction, type ScopedCallback } from './types'\n\n// Track which effects are watching which reactive objects for cleanup\nexport const effectToReactiveObjects = new WeakMap<ScopedCallback, Set<object>>()\n\n// Track effects per reactive object and property\nexport const watchers = new WeakMap<object, Map<any, Set<ScopedCallback>>>()\n\n// runEffect -> set<stop>\nexport const effectChildren = new WeakMap<ScopedCallback, Set<ScopedCallback>>()\n\n// Track parent effect relationships for hierarchy traversal (used in deep touch filtering)\nexport const effectParent = new WeakMap<ScopedCallback, ScopedCallback | undefined>()\n\n// Track reverse mapping to ensure unicity: One Root -> One Function\nconst reverseRoots = new WeakMap<any, WeakRef<Function>>()\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// Mark fn with the new root\n\treturn Object.defineProperty(fn, rootFunction, {\n\t\tvalue: getRoot(root),\n\t\twritable: false,\n\t})\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 && rootFunction in fn) fn = fn[rootFunction] as T\n\treturn fn\n}","/**\n * Debug utilities for the reactivity system\n * - Captures effect metadata (names, parent relationships)\n * - Records cause → consequence edges with object/prop labels\n * - Provides graph data for tooling (DevTools panel, etc.)\n */\n\nimport { effectParent, effectToReactiveObjects, getRoot } from './registry'\nimport { allProps, type Evolution, options, type ScopedCallback } from './types'\n\nconst EXTERNAL_SOURCE = Symbol('external-source')\ntype SourceEffect = ScopedCallback | typeof EXTERNAL_SOURCE\n\nlet devtoolsEnabled = false\n\n// Registry for debugging (populated lazily when DevTools are enabled)\nconst debugEffectRegistry = new Set<ScopedCallback>()\nconst debugObjectRegistry = new Set<object>()\n\n// Human-friendly names\nconst effectNames = new WeakMap<ScopedCallback, string>()\nconst objectNames = new WeakMap<object, string>()\nlet effectCounter = 0\nlet objectCounter = 0\n\n// Cause/consequence edges aggregated by (source, target, descriptor)\ninterface TriggerRecord {\n\tlabel: string\n\tobject: object\n\tprop: any\n\tevolution: Evolution\n\tcount: number\n\tlastTriggered: number\n}\n\nconst triggerGraph = new Map<SourceEffect, Map<ScopedCallback, Map<string, TriggerRecord>>>()\n\nexport type NodeKind = 'effect' | 'external' | 'state'\nexport type EdgeKind = 'cause' | 'dependency' | 'trigger'\n\nexport interface EffectNode {\n\tid: string\n\tlabel: string\n\ttype: NodeKind\n\tdepth: number\n\tparentId?: string\n\tdebugName?: string\n}\n\nexport interface ObjectNode {\n\tid: string\n\tlabel: string\n\ttype: NodeKind\n\tdebugName?: string\n}\n\nexport interface GraphEdge {\n\tid: string\n\tsource: string\n\ttarget: string\n\ttype: EdgeKind\n\tlabel: string\n\tcount?: number\n}\n\nexport interface ReactivityGraph {\n\tnodes: Array<EffectNode | ObjectNode>\n\tedges: GraphEdge[]\n\tmeta: {\n\t\tgeneratedAt: number\n\t\tdevtoolsEnabled: boolean\n\t}\n}\n\nfunction ensureEffectName(effect: ScopedCallback): string {\n\tlet name = effectNames.get(effect)\n\tif (!name) {\n\t\tconst root = getRoot(effect)\n\t\tname = root?.name?.trim() || `effect_${++effectCounter}`\n\t\teffectNames.set(effect, name)\n\t}\n\treturn name\n}\n\nfunction ensureObjectName(obj: object): string {\n\tlet name = objectNames.get(obj)\n\tif (!name) {\n\t\tconst ctorName = (obj as any)?.constructor?.name\n\t\tconst base = ctorName && ctorName !== 'Object' ? ctorName : 'object'\n\t\tname = `${base}_${++objectCounter}`\n\t\tobjectNames.set(obj, name)\n\t}\n\treturn name\n}\n\nfunction describeProp(obj: object, prop: any): string {\n\tconst objectName = ensureObjectName(obj)\n\tif (prop === allProps) return `${objectName}.*`\n\tif (typeof prop === 'symbol') return `${objectName}.${prop.description ?? prop.toString()}`\n\treturn `${objectName}.${String(prop)}`\n}\n\nfunction addEffectToRegistry(effect: ScopedCallback) {\n\tif (!effect || debugEffectRegistry.has(effect)) return\n\tdebugEffectRegistry.add(effect)\n\tconst deps = effectToReactiveObjects.get(effect)\n\tif (deps) {\n\t\tfor (const obj of deps) {\n\t\t\tdocumentObject(obj)\n\t\t}\n\t}\n}\n\nfunction documentObject(obj: object) {\n\tif (!debugObjectRegistry.has(obj)) {\n\t\tdbRegisterObject(obj)\n\t}\n}\n\nfunction dbRegisterObject(obj: object) {\n\tdebugObjectRegistry.add(obj)\n\tensureObjectName(obj)\n}\n\nfunction ensureParentChains(effects: Set<ScopedCallback>) {\n\tconst queue = Array.from(effects)\n\tfor (let i = 0; i < queue.length; i++) {\n\t\tconst effect = queue[i]\n\t\tconst parent = effectParent.get(effect)\n\t\tif (parent && !effects.has(parent)) {\n\t\t\teffects.add(parent)\n\t\t\tqueue.push(parent)\n\t\t}\n\t}\n}\n\nfunction ensureTriggerContainers(source: SourceEffect) {\n\tlet targetMap = triggerGraph.get(source)\n\tif (!targetMap) {\n\t\ttargetMap = new Map()\n\t\ttriggerGraph.set(source, targetMap)\n\t}\n\treturn targetMap\n}\n\nfunction ensureTriggerRecord(\n\tsource: SourceEffect,\n\ttarget: ScopedCallback,\n\tlabel: string,\n\tobj: object,\n\tprop: any,\n\tevolution: Evolution\n): TriggerRecord {\n\tconst targetMap = ensureTriggerContainers(source)\n\tlet labelMap = targetMap.get(target)\n\tif (!labelMap) {\n\t\tlabelMap = new Map()\n\t\ttargetMap.set(target, labelMap)\n\t}\n\tlet record = labelMap.get(label)\n\tif (!record) {\n\t\trecord = { label, object: obj, prop, evolution, count: 0, lastTriggered: Date.now() }\n\t\tlabelMap.set(label, record)\n\t}\n\treturn record\n}\n\n/**\n * Assign a debug-friendly name to an effect (shown in DevTools)\n */\nexport function setEffectName(effect: ScopedCallback, name: string) {\n\teffectNames.set(effect, name)\n}\n\n/**\n * Assign a debug-friendly name to a reactive object\n */\nexport function setObjectName(obj: object, name: string) {\n\tobjectNames.set(obj, name)\n\tdebugObjectRegistry.add(obj)\n}\n\n/**\n * Register an effect so it appears in the DevTools graph\n */\nexport function registerEffectForDebug(effect: ScopedCallback) {\n\tif (!effect || !devtoolsEnabled) return\n\taddEffectToRegistry(effect)\n}\n\n/**\n * Register a reactive object so it appears in the DevTools graph\n */\nexport function registerObjectForDebug(obj: object) {\n\tif (!devtoolsEnabled) return\n\tdocumentObject(obj)\n}\n\n/**\n * Records a cause → consequence relationship between effects.\n * @param source - The effect performing the write (undefined if external/user input)\n * @param target - The effect that re-ran because of the write\n * @param obj - The reactive object that changed\n * @param prop - The property that changed\n * @param evolution - The type of change (set/add/del/bunch)\n */\nexport function recordTriggerLink(\n\tsource: ScopedCallback | undefined,\n\ttarget: ScopedCallback,\n\tobj: object,\n\tprop: any,\n\tevolution: Evolution\n) {\n\tif (options.introspection.enableHistory) {\n\t\taddToMutationHistory(source, target, obj, prop, evolution)\n\t}\n\tif (!devtoolsEnabled) return\n\taddEffectToRegistry(target)\n\tif (source) addEffectToRegistry(source)\n\tconst descriptor = describeProp(obj, prop)\n\tconst record = ensureTriggerRecord(\n\t\tsource ?? EXTERNAL_SOURCE,\n\t\ttarget,\n\t\tdescriptor,\n\t\tobj,\n\t\tprop,\n\t\tevolution\n\t)\n\trecord.count += 1\n\trecord.lastTriggered = Date.now()\n\tdocumentObject(obj)\n}\n\n/**\n * Traces back the chain of triggers that led to a specific effect\n * @param effect The effect to trace back\n * @param limit Max depth\n */\nexport function getTriggerChain(effect: ScopedCallback, limit = 5): string[] {\n\tconst chain: string[] = []\n\tlet current = effect\n\tfor (let i = 0; i < limit; i++) {\n\t\t// Find who triggered 'current'\n\t\t// We need to reverse search the triggerGraph (source -> target)\n\t\t// This is expensive O(Edges) but okay for error reporting\n\t\tlet foundSource: ScopedCallback | undefined\n\t\tlet foundReason = ''\n\n\t\tsearch: for (const [source, targetMap] of triggerGraph) {\n\t\t\tfor (const [target, labelMap] of targetMap) {\n\t\t\t\tif (target === current) {\n\t\t\t\t\t// Found a source! Use the most recent trigger record\n\t\t\t\t\tlet lastTime = 0\n\t\t\t\t\tfor (const record of labelMap.values()) {\n\t\t\t\t\t\tif (record.lastTriggered > lastTime) {\n\t\t\t\t\t\t\tlastTime = record.lastTriggered\n\t\t\t\t\t\t\tfoundReason = record.label\n\t\t\t\t\t\t\tfoundSource = source === EXTERNAL_SOURCE ? undefined : (source as ScopedCallback)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (foundSource || foundReason) break search\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (foundSource) {\n\t\t\tchain.push(\n\t\t\t\t`${ensureEffectName(foundSource)} -> (${foundReason}) -> ${ensureEffectName(current)}`\n\t\t\t)\n\t\t\tcurrent = foundSource\n\t\t} else if (foundReason) {\n\t\t\tchain.push(`External -> (${foundReason}) -> ${ensureEffectName(current)}`)\n\t\t\tbreak\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn chain.reverse()\n}\n\nfunction buildEffectNodes(allEffects: Set<ScopedCallback>) {\n\tconst nodes: EffectNode[] = []\n\tconst nodeByEffect = new Map<ScopedCallback, EffectNode>()\n\n\tconst ordered = Array.from(allEffects)\n\tfor (const effect of ordered) {\n\t\tconst label = ensureEffectName(effect)\n\t\tconst node: EffectNode = {\n\t\t\tid: `effect_${nodes.length}`,\n\t\t\tlabel,\n\t\t\ttype: 'effect',\n\t\t\tdepth: 0,\n\t\t\tdebugName: label,\n\t\t}\n\t\tnodes.push(node)\n\t\tnodeByEffect.set(effect, node)\n\t}\n\n\tconst depthCache = new Map<ScopedCallback, number>()\n\tconst computeDepth = (effect: ScopedCallback | undefined): number => {\n\t\tif (!effect) return 0\n\t\tconst cached = depthCache.get(effect)\n\t\tif (cached !== undefined) return cached\n\t\tconst parent = effectParent.get(effect)\n\t\tconst depth = computeDepth(parent) + (parent ? 1 : 0)\n\t\tdepthCache.set(effect, depth)\n\t\treturn depth\n\t}\n\n\tfor (const [effect, node] of nodeByEffect) {\n\t\tnode.depth = computeDepth(effect)\n\t\tconst parent = effectParent.get(effect)\n\t\tif (parent) {\n\t\t\tconst parentNode = nodeByEffect.get(parent)\n\t\t\tif (parentNode) {\n\t\t\t\tnode.parentId = parentNode.id\n\t\t\t}\n\t\t}\n\t}\n\n\treturn { nodes, nodeByEffect }\n}\n\n/**\n * Builds a graph representing current reactive state (effects, objects, and trigger edges)\n */\nexport function buildReactivityGraph(): ReactivityGraph {\n\tconst nodes: Array<EffectNode | ObjectNode> = []\n\tconst edges: GraphEdge[] = []\n\tconst nodeIds = new Map<ScopedCallback | object | SourceEffect, string>()\n\n\tconst allEffects = new Set<ScopedCallback>(debugEffectRegistry)\n\tensureParentChains(allEffects)\n\tconst { nodes: effectNodes, nodeByEffect } = buildEffectNodes(allEffects)\n\tfor (const node of effectNodes) nodes.push(node)\n\tfor (const [effect, node] of nodeByEffect) {\n\t\tnodeIds.set(effect, node.id)\n\t}\n\n\t// Object nodes (optional, used for dependency inspection)\n\tfor (const obj of debugObjectRegistry) {\n\t\tconst id = `object_${nodes.length}`\n\t\tnodes.push({ id, label: ensureObjectName(obj), type: 'state', debugName: objectNames.get(obj) })\n\t\tnodeIds.set(obj, id)\n\t}\n\n\t// External source node (user/system outside of effects)\n\tif (triggerGraph.has(EXTERNAL_SOURCE)) {\n\t\tconst externalId = `effect_external`\n\t\tnodes.push({ id: externalId, label: 'External', type: 'external', depth: 0 })\n\t\tnodeIds.set(EXTERNAL_SOURCE, externalId)\n\t}\n\n\t// Dependency edges (effect → object)\n\tfor (const effect of allEffects) {\n\t\tconst effectId = nodeIds.get(effect)\n\t\tif (!effectId) continue\n\t\tconst deps = effectToReactiveObjects.get(effect)\n\t\tif (!deps) continue\n\t\tfor (const obj of deps) {\n\t\t\tconst objId = nodeIds.get(obj)\n\t\t\tif (!objId) continue\n\t\t\tedges.push({\n\t\t\t\tid: `${effectId}->${objId}`,\n\t\t\t\tsource: effectId,\n\t\t\t\ttarget: objId,\n\t\t\t\ttype: 'dependency',\n\t\t\t\tlabel: 'depends',\n\t\t\t})\n\t\t}\n\t}\n\n\t// Cause edges (effect/object/prop → effect)\n\tfor (const [source, targetMap] of triggerGraph) {\n\t\tfor (const [targetEffect, labelMap] of targetMap) {\n\t\t\tconst targetId = nodeIds.get(targetEffect)\n\t\t\tif (!targetId) continue\n\t\t\tconst sourceId = nodeIds.get(source)\n\t\t\tif (!sourceId) continue\n\t\t\tfor (const record of labelMap.values()) {\n\t\t\t\tedges.push({\n\t\t\t\t\tid: `${sourceId}->${targetId}:${record.label}`,\n\t\t\t\t\tsource: sourceId,\n\t\t\t\t\ttarget: targetId,\n\t\t\t\t\ttype: 'cause',\n\t\t\t\t\tlabel: record.count > 1 ? `${record.label} (${record.count})` : record.label,\n\t\t\t\t\tcount: record.count,\n\t\t\t\t})\n\t\t\t}\n\t\t}\n\t}\n\n\treturn {\n\t\tnodes,\n\t\tedges,\n\t\tmeta: {\n\t\t\tgeneratedAt: Date.now(),\n\t\t\tdevtoolsEnabled,\n\t\t},\n\t}\n}\n\n/**\n * Enables the DevTools bridge and exposes the debug API on window.\n * Call as early as possible in development builds.\n */\nexport function enableDevTools() {\n\tif (typeof window === 'undefined') return\n\tif (devtoolsEnabled) return\n\tdevtoolsEnabled = true\n\n\t// @ts-expect-error - global window extension\n\twindow.__MUTTS_DEVTOOLS__ = {\n\t\tgetGraph: buildReactivityGraph,\n\t\tsetEffectName,\n\t\tsetObjectName,\n\t\tregisterEffect: registerEffectForDebug,\n\t\tregisterObject: registerObjectForDebug,\n\t}\n}\n\nexport function forceEnableGraphTracking() {\n\tdevtoolsEnabled = true\n}\n\nexport function isDevtoolsEnabled() {\n\treturn devtoolsEnabled\n}\n\n// --- Introspection API ---\n\n/**\n * Returns the raw dependency graph data structure.\n * This is useful for programmatic analysis of the reactive system.\n */\nexport function getDependencyGraph() {\n\treturn {\n\t\tnodes: buildReactivityGraph().nodes,\n\t\tedges: buildReactivityGraph().edges,\n\t}\n}\n\n/**\n * Returns a list of effects that depend on the given object.\n */\nexport function getDependents(obj: object): ScopedCallback[] {\n\tconst dependents: ScopedCallback[] = []\n\t// Scan the trigger graph for effects triggered by this object\n\t// This is O(E) where E is the number of edges, might need optimization for large graphs\n\t// but acceptable for introspection\n\tfor (const [_source, targetMap] of triggerGraph) {\n\t\tfor (const [targetEffect, labelMap] of targetMap) {\n\t\t\tfor (const record of labelMap.values()) {\n\t\t\t\tif (record.object === obj) {\n\t\t\t\t\tdependents.push(targetEffect)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t// Also check direct dependencies (dependency graph)\n\t// We don't have a direct obj -> effect map without walking all effects\n\t// unless we use `watchers` from tracking.ts but that's internal\n\treturn [...new Set(dependents)]\n}\n\n/**\n * Returns a list of objects that the given effect depends on.\n */\nexport function getDependencies(effect: ScopedCallback): object[] {\n\tconst deps = effectToReactiveObjects.get(effect)\n\treturn deps ? Array.from(deps) : []\n}\n\n// --- Mutation History ---\n\nexport interface MutationRecord {\n\tid: number\n\ttimestamp: number\n\tsource: string\n\ttarget: string\n\tobjectName: string\n\tprop: string\n\ttype: string\n}\n\nconst mutationHistory: MutationRecord[] = []\nlet mutationCounter = 0\n\nfunction addToMutationHistory(\n\tsource: ScopedCallback | undefined,\n\ttarget: ScopedCallback,\n\tobj: object,\n\tprop: any,\n\tevolution: Evolution\n) {\n\tconst record: MutationRecord = {\n\t\tid: ++mutationCounter,\n\t\ttimestamp: Date.now(),\n\t\tsource: source ? ensureEffectName(source) : 'External',\n\t\ttarget: ensureEffectName(target),\n\t\tobjectName: ensureObjectName(obj),\n\t\tprop: String(prop),\n\t\ttype: evolution.type,\n\t}\n\n\tmutationHistory.push(record)\n\tif (mutationHistory.length > options.introspection.historySize) {\n\t\tmutationHistory.shift()\n\t}\n}\n\n/**\n * Get the recent mutation history\n */\nexport function getMutationHistory(): MutationRecord[] {\n\treturn [...mutationHistory]\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, fn: () => R): R {\n\t\tconst entered = this.enter(value)\n        let res: R;\n\t\ttry {\n\t\t\tres = fn()\n\t\t} finally {\n\t\t\tthis.leave(entered)\n\t\t}\n        // [HACK]: Sanitization\n        // See BROWSER_ASYNC_POLYFILL.md\n        return asyncHooks.sanitizePromise(res) as R\n\t}\n\troot<R>(fn: () => R): R {\n\t\tlet 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(): FunctionWrapper {\n\t\tconst active = this.active\n\t\treturn named(`${this}@${active}`, (fn) => this.with(active, fn))\n\t}\n}\n\nexport type FunctionWrapper = <R>(fn?: () => R) => R\n\nexport class Zone<T> extends AZone<T> {\n\tactive: T | undefined\n}\ntype HistoryValue<T> = {present: T | undefined, history: Set<T>}\nexport class ZoneHistory<T> extends AZone<HistoryValue<T>> {\n\tprivate\thistory = 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(controlled,\n\t\t\tObject.getOwnPropertyDescriptors({\n\t\t\t\tget active() { return controlled.active },\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)) throw 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 = this.history && new Set(this.history)\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)\n\t\t\tif (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\nexport const asyncZone = tag('async', new ZoneAggregator())\nasyncHooks.addHook(() => {\n\tconst zone = asyncZone.active\n\treturn () => {\n\t\tconst prev = asyncZone.active\n\t\tasyncZone.active = zone\n\t\treturn () => asyncZone.active = prev\n\t}\n})\n","import { tag } from '../utils'\nimport { asyncZone, ZoneAggregator, ZoneHistory } from '../zone'\nimport { getRoot } from './registry'\nimport { type ScopedCallback } from './types'\n\nexport const effectHistory = tag('effectHistory', new ZoneHistory<ScopedCallback>())\ntag('effectHistory.present', effectHistory.present)\nasyncZone.add(effectHistory)\nexport const effectAggregator = tag('effectAggregator', new ZoneAggregator(effectHistory.present))\n\nexport function isRunning(effect: ScopedCallback): 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}","export 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\tlet current = obj\n\twhile (current && typeof current === 'object' && current !== null && proxyToObject.has(current)) {\n\t\tcurrent = proxyToObject.get(current) as T\n\t}\n\treturn current\n}\n\nexport function isReactive(obj: any): boolean {\n\treturn proxyToObject.has(obj)\n}\n","import { decorator } from '../decorator'\nimport { IterableWeakSet } from '../iterableWeak'\nimport { getTriggerChain, isDevtoolsEnabled, registerEffectForDebug } from './debug'\nimport {\n\teffectAggregator,\n\teffectHistory,\n\tgetActiveEffect,\n} from './effect-context'\nimport {\n\teffectChildren,\n\teffectParent,\n\teffectToReactiveObjects,\n\tgetRoot,\n\tmarkWithRoot,\n\twatchers,\n} from './registry'\nimport {\n\tcleanup as cleanupSymbol,\n\ttype DependencyAccess,\n\ttype EffectOptions,\n\ttype Evolution,\n\toptions,\n\tReactiveError,\n\tReactiveErrorCode,\n\t// type AsyncExecutionMode,\n\ttype ScopedCallback,\n\tstopped,\n} from './types'\n\nimport { unwrap } from './proxy-state'\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\ntype EffectTracking = (obj: any, evolution: Evolution, prop: any) => void\n\nexport interface ActivationRecord {\n\teffect: ScopedCallback\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\nexport function getActivationLog() {\n\treturn activationLog\n}\n\nexport function recordActivation(\n\teffect: ScopedCallback,\n\tobj: any,\n\tevolution: Evolution,\n\tprop: any\n) {\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 as any)?.name || 'anonymous'\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: effectName,\n\t\t\t})\n\t\t}\n\t\toptions.warn(`[reactive] ${message}`)\n\t}\n}\n\n/**\n * Registers a debug callback that is called when the current effect is triggered by a dependency change\n *\n * This function is useful for debugging purposes as it pin-points exactly which reactive property\n * change triggered the effect. The callback receives information about:\n * - The object that changed\n * - The type of change (evolution)\n * - The specific property that changed\n *\n * **Note:** The tracker callback is automatically removed after being called once. If you need\n * to track multiple triggers, call `trackEffect` again within the effect.\n *\n * @param onTouch - Callback function that receives (obj, evolution, prop) when the effect is triggered\n * @throws {Error} If called outside of an effect context\n *\n * @example\n * ```typescript\n * const state = reactive({ count: 0, name: 'John' })\n *\n * effect(() => {\n *   // Register a tracker to see what triggers this effect\n *   trackEffect((obj, evolution, prop) => {\n *     console.log(`Effect triggered by:`, {\n *       object: obj,\n *       change: evolution.type,\n *       property: prop\n *     })\n *   })\n *\n *   // Access reactive properties\n *   console.log(state.count, state.name)\n * })\n *\n * state.count = 5\n * // Logs: Effect triggered by: { object: state, change: 'set', property: 'count' }\n * ```\n */\nexport function trackEffect(onTouch: EffectTracking) {\n\tconst activeEffect = getActiveEffect()\n\tif (!activeEffect) throw new Error('Not in an effect')\n\tif (!effectTrackers.has(activeEffect)) effectTrackers.set(activeEffect, new Set([onTouch]))\n\telse effectTrackers.get(activeEffect)!.add(onTouch)\n}\n\nconst effectTrackers = new WeakMap<ScopedCallback, Set<EffectTracking>>()\n\nexport const opaqueEffects = new WeakSet<ScopedCallback>()\n\n// Dependency graph: tracks which effects trigger which other effects\n// Uses roots (Function) as keys for consistency\nconst effectTriggers = new WeakMap<Function, IterableWeakSet<Function>>()\nconst 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)\nconst causesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\nconst consequencesClosure = new WeakMap<Function, IterableWeakSet<Function>>()\n\n// Debug: Capture where an effect was created\nexport const effectCreationStacks = new WeakMap<Function, string>()\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 === 'none') return\n\t// Skip if edge already exists\n\tconst triggers = effectTriggers.get(callerRoot)\n\tif (triggers?.has(targetRoot)) {\n\t\treturn // Edge already exists\n\t}\n\n\t// Add to forward graph: callerRoot → targetRoot\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 && vConsequencesSet) {\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 * @todo Can be REALLY costly - optimise or make optional or ...\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: ScopedCallback) {\n\tif (options.cycleHandling === 'none') 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, ScopedCallback> // 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}\n\n// Track currently executing effects to prevent re-execution\n// These are all the effects triggered under `activeEffect`\nlet batchQueue: BatchQueue | undefined\nexport function hasBatched(effect: ScopedCallback) {\n\treturn batchQueue?.all.has(getRoot(effect))\n}\nconst batchCleanups = new Set<ScopedCallback>()\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 === 'none') 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 * Computes the in-degree (number of dependencies) for an effect in the current batch\n * Uses causesClosure to count all effects (directly or indirectly) that trigger this effect\n * @param root - Root function of the effect\n * @param batchEffects - Map of all effects in current batch (todos - effects that still need execution)\n * @returns Number of effects in batch that trigger this effect (directly or indirectly)\n *\n * TODO: Optimization - For large graphs with small batches, iterating over all causes in the closure\n * can be expensive. Consider maintaining a separate \"batch causes\" set or caching in-degrees.\n */\n/* function computeInDegreeInBatch(\n\troot: Function,\n\tbatchEffects: Map<Function, ScopedCallback>\n): number {\n\tlet inDegree = 0\n\tconst activeEffect = getActiveEffect()\n\tconst activeRoot = activeEffect ? getRoot(activeEffect) : null\n\n\t// Count effects in batch that trigger this effect (directly or indirectly)\n\t// Using causesClosure which contains all transitive causes\n\t// Note: batchEffects only contains effects that still need execution (todos),\n\t// so we don't need to check if causes have been executed - they're not in the map if executed\n\tconst causes = causesClosure.get(root)\n\tif (causes) {\n\t\tfor (const causeRoot of causes) {\n\t\t\t// Only count if it's in the batch (still needs execution)\n\t\t\t// BUT: don't count the currently executing effect (active effect)\n\t\t\t// This handles the case where an effect is triggered during another effect's execution\n\t\t\t// Note: Self-loops are ignored - they should not appear in closures, but we check to be safe\n\t\t\tif (batchEffects.has(causeRoot) && causeRoot !== activeRoot && causeRoot !== root) {\n\t\t\t\tinDegree++\n\t\t\t}\n\t\t}\n\t}\n\n\treturn inDegree\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(effect: ScopedCallback, caller?: ScopedCallback, immediate?: boolean) {\n\t(effect as any)[cleanupSymbol]?.()\n\t// If the effect was stopped during cleanup (e.g. lazy memoization), don't add it to the batch\n\tif ((effect as any)[stopped]) return\n\n\tif (!batchQueue) return\n\n\tconst root = getRoot(effect)\n\n\t// 1. Add to batch first (needed for cycle detection)\n\tif (options.cycleHandling === 'none' && batchQueue.all.has(root)) {\n\t\t// If already present in flat mode, remove it so that the next set puts it at the end\n\t\tbatchQueue.all.delete(root)\n\t}\n\n\tbatchQueue.all.set(root, effect)\n\n\t// 2. Add to global graph (if caller exists and not immediate) - USE ROOTS ONLY\n\t// When immediate is true, don't create edges - the effect is not considered as a consequence\n\tif (caller && !immediate && options.cycleHandling !== 'none') {\n\t\tconst callerRoot = getRoot(caller)\n\n\t\t// Check for cycle BEFORE adding edge\n\t\t// We check if adding callerRoot -> root would create a cycle\n\t\t// This means checking if root already triggers callerRoot (directly or transitively)\n\t\tif (wouldCreateCycle(callerRoot, root)) {\n\t\t\t// Cycle detected! Get the full cycle path for debugging\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\tconst cycleHandling = options.cycleHandling\n\n\t\t\t// In strict mode, we throw immediately on detection\n\t\t\tif (cycleHandling === 'strict') {\n\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\tconst causalChain = getTriggerChain(effect)\n\t\t\t\tconst creationStack = effectCreationStacks.get(root)\n\n\t\t\t\tthrow new ReactiveError(`[reactive] Strict Cycle Prevention: ${cycleMessage}`, {\n\t\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\t\tcycle: cyclePath.map((r) => r.name || r.toString()),\n\t\t\t\t\tdetails: cycleMessage,\n\t\t\t\t\tcausalChain,\n\t\t\t\t\tcreationStack,\n\t\t\t\t})\n\t\t\t}\n\n\t\t\tswitch (cycleHandling) {\n\t\t\t\tcase 'throw': {\n\t\t\t\t\t// Remove from batch before throwing\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t\tconst causalChain = getTriggerChain(effect)\n\t\t\t\t\tconst creationStack = effectCreationStacks.get(root)\n\n\t\t\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`, {\n\t\t\t\t\t\tcode: ReactiveErrorCode.CycleDetected,\n\t\t\t\t\t\tcycle: cyclePath.map((r) => r.name || r.toString()),\n\t\t\t\t\t\tdetails: cycleMessage,\n\t\t\t\t\t\tcausalChain,\n\t\t\t\t\t\tcreationStack,\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t\tcase 'warn':\n\t\t\t\t\toptions.warn(`[reactive] ${cycleMessage}`)\n\t\t\t\t\t// Don't add the edge, break the cycle\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t\treturn\n\t\t\t\tcase 'break':\n\t\t\t\t\t// Silently break cycle, don't add the edge\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t\treturn\n\t\t\t}\n\t\t}\n\n\t\taddGraphEdge(callerRoot, root) // Add to persistent graph using roots\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: ScopedCallback) {\n\tif (!batchQueue) cleanup()\n\telse batchCleanups.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 batchQueue - The batch queue\n * @returns Array of effect roots forming a cycle\n */\nfunction getCyclePath(batchQueue: 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 batchQueue.all) {\n\t\tif (visited.has(root)) continue\n\t\tconst cycle = findCycle(root, visited, recursionStack, path, batchQueue)\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\tbatchQueue: 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 (batchQueue.all.has(targetRoot)) {\n\t\t\t\tconst cycle = findCycle(targetRoot, visited, recursionStack, path, batchQueue)\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\t// Find an effect with in-degree 0 using cached values\n\tlet nextEffect: ScopedCallback | null = null\n\tlet nextRoot: Function | null = null\n\n\tif (options.cycleHandling === 'none') {\n\t\t// In flat mode, we just take the first effect in the queue (FIFO)\n\t\tconst first = batchQueue!.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 batchQueue!.all) {\n\t\t\tconst inDegree = batchQueue!.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 (batchQueue!.all.size > 0) {\n\t\t\tlet cycle = getCyclePath(batchQueue!)\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 batchQueue!.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 (batchQueue!.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\tconst cycleHandling = options.cycleHandling\n\t\t\tswitch (cycleHandling) {\n\t\t\t\tcase 'throw':\n\t\t\t\t\tthrow new ReactiveError(`[reactive] ${cycleMessage}`)\n\t\t\t\tcase 'warn': {\n\t\t\t\t\toptions.warn(`[reactive] ${cycleMessage}`)\n\t\t\t\t\t// Break the cycle by executing one effect anyway\n\t\t\t\t\tconst firstEffect = batchQueue!.all.values().next().value\n\t\t\t\t\tif (firstEffect) {\n\t\t\t\t\t\tconst firstRoot = getRoot(firstEffect)\n\t\t\t\t\t\tbatchQueue!.all.delete(firstRoot)\n\t\t\t\t\t\tbatchQueue!.inDegrees.delete(firstRoot)\n\t\t\t\t\t\treturn firstEffect()\n\t\t\t\t\t}\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tcase 'break': {\n\t\t\t\t\t// Silently break cycle\n\t\t\t\t\tconst firstEffect2 = batchQueue!.all.values().next().value\n\t\t\t\t\tif (firstEffect2) {\n\t\t\t\t\t\tconst firstRoot2 = getRoot(firstEffect2)\n\t\t\t\t\t\tbatchQueue!.all.delete(firstRoot2)\n\t\t\t\t\t\tbatchQueue!.inDegrees.delete(firstRoot2)\n\t\t\t\t\t\treturn firstEffect2()\n\t\t\t\t\t}\n\t\t\t\t\tbreak\n\t\t\t\t}\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\tconst result = nextEffect()\n\n\t// Remove from batch and update in-degrees of dependents\n\tbatchQueue!.all.delete(nextRoot!)\n\tbatchQueue!.inDegrees.delete(nextRoot!)\n\tdecrementInDegreesForExecuted(batchQueue!, nextRoot!)\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: ScopedCallback | ScopedCallback[], immediate?: 'immediate') {\n\tif (!Array.isArray(effect)) effect = [effect]\n\tconst roots = effect.map(getRoot)\n\n\tif (batchQueue) {\n\t\t// Nested batch - add to existing\n\t\toptions?.chain(roots, getRoot(getActiveEffect()))\n\t\tconst caller = getActiveEffect()\n\t\tfor (let i = 0; i < effect.length; i++)\n\t\t\taddToBatch(effect[i], caller, immediate === 'immediate')\n\t\tif (immediate) {\n\t\t\tconst firstReturn: { value?: any } = {}\n\t\t\t// Execute immediately (before batch returns)\n\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\ttry {\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\tconst root = getRoot(effect[i])\n\t\t\t\t\tbatchQueue.all.delete(root)\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn firstReturn.value\n\t\t}\n\t\t// Otherwise, effects will be picked up in next executeNext() call\n\t} else {\n\t\t// New batch - initialize\n\t\tif (!activationRegistry) activationRegistry = new Map()\n\t\telse throw new Error('Batch already in progress')\n\t\toptions.beginChain(roots)\n\t\tbatchQueue = {\n\t\t\tall: new Map(),\n\t\t\tinDegrees: new Map(),\n\t\t}\n\n\t\tconst caller = getActiveEffect()\n\t\tconst effectuatedRoots: ScopedCallback[] = []\n\t\tconst firstReturn: { value?: any } = {}\n\n\t\ttry {\n\t\t\tif (immediate) {\n\t\t\t\t// Execute initial effects in providing order\n\t\t\t\tfor (let i = 0; i < effect.length; i++) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tconst rv = effect[i]()\n\t\t\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\t\t} finally {\n\t\t\t\t\t\tbatchQueue.all.delete(getRoot(effect[i]))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Add initial effects to batch and compute dependencies\n\t\t\t\tfor (let i = 0; i < effect.length; i++) addToBatch(effect[i], caller, false)\n\t\t\t\tcomputeAllInDegrees(batchQueue)\n\t\t\t}\n\n\t\t\t// Processing loop for all triggered effects and cleanups\n\t\t\twhile (batchQueue.all.size > 0 || batchCleanups.size > 0) {\n\t\t\t\tif (batchQueue.all.size > 0) {\n\t\t\t\t\tif (effectuatedRoots.length > options.maxEffectChain) {\n\t\t\t\t\t\tconst cycle = findCycleInChain(effectuatedRoots as any)\n\t\t\t\t\t\tconst trace = formatRoots(effectuatedRoots as any)\n\t\t\t\t\t\tconst message = cycle\n\t\t\t\t\t\t\t? `Max effect chain reached (cycle detected: ${formatRoots(cycle)})`\n\t\t\t\t\t\t\t: `Max effect chain reached (trace: ${trace})`\n\n\t\t\t\t\t\tconst queuedRoots = batchQueue ? Array.from(batchQueue.all.keys()) : []\n\t\t\t\t\t\tconst queued = queuedRoots.map((r) => r.name || '<anonymous>')\n\t\t\t\t\t\tconst debugInfo = {\n\t\t\t\t\t\t\tcode: ReactiveErrorCode.MaxDepthExceeded,\n\t\t\t\t\t\t\teffectuatedRoots,\n\t\t\t\t\t\t\tcycle,\n\t\t\t\t\t\t\ttrace,\n\t\t\t\t\t\t\tmaxEffectChain: options.maxEffectChain,\n\t\t\t\t\t\t\tqueued: queued.slice(0, 50),\n\t\t\t\t\t\t\tqueuedCount: queued.length,\n\t\t\t\t\t\t\t// Try to get causation for the last effect\n\t\t\t\t\t\t\tcausalChain:\n\t\t\t\t\t\t\t\teffectuatedRoots.length > 0\n\t\t\t\t\t\t\t\t\t? getTriggerChain(\n\t\t\t\t\t\t\t\t\t\t\tbatchQueue.all.get(effectuatedRoots[effectuatedRoots.length - 1])!\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}\n\t\t\t\t\t\tswitch (options.maxEffectReaction) {\n\t\t\t\t\t\t\tcase 'throw':\n\t\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\t\tcase 'debug':\n\t\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\t\tdebugger\n\t\t\t\t\t\t\t\tthrow new ReactiveError(`[reactive] ${message}`, debugInfo)\n\t\t\t\t\t\t\tcase 'warn':\n\t\t\t\t\t\t\t\toptions.warn(\n\t\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\t)\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tconst rv = executeNext(effectuatedRoots)\n\t\t\t\t\tif (rv !== undefined && !('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\t} else {\n\t\t\t\t\t// Process cleanups. If they trigger more effects, they will be caught in the next iteration.\n\t\t\t\t\tconst cleanups = Array.from(batchCleanups)\n\t\t\t\t\tbatchCleanups.clear()\n\t\t\t\t\tfor (const cleanup of cleanups) cleanup()\n\n\t\t\t\t\t// In immediate mode, we traditionally don't process recursive effects from cleanups.\n\t\t\t\t\t// If we want to keep that behavior: if (immediate) break\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn firstReturn.value\n\t\t} catch (error) {\n\t\t\tthrow error instanceof ReactiveError\n\t\t\t\t? error\n\t\t\t\t: new ReactiveError('Effects are broken', { code: ReactiveErrorCode.BrokenEffects, cause: error })\n\t\t} finally {\n\t\t\tactivationRegistry = undefined\n\t\t\tbatchQueue = undefined\n\t\t\toptions.endChain()\n\t\t}\n\t}\n}\n\n// Inject batch function to allow atomic game loops in requestAnimationFrame/setTimeout/...\n// TODO: perhaps introduce somewhere a way to wrap async functions - find out if it's necessary\n// wrapAsync(fn=> batch(fn, 'immediate'))\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, '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, 'immediate')\n\t\t}\n\t},\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 * 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 function effect(\n\t//biome-ignore lint/suspicious/noConfusingVoidType: We have to\n\tfn: (access: DependencyAccess) => ScopedCallback | undefined | void | Promise<any>,\n\teffectOptions?: EffectOptions\n): ScopedCallback & {\n\t[stopped]: boolean\n\t[cleanupSymbol]: () => void\n} {\n\n\t// Use per-effect asyncMode or fall back to global option\n\tconst asyncMode = effectOptions?.asyncMode ?? options.asyncMode ?? 'cancel'\n\tif (options.introspection.enableHistory) {\n\t\tconst stack = new Error().stack\n\t\tif (stack) {\n\t\t\t// Clean up the stack trace to remove internal frames\n\t\t\tconst cleanStack = stack.split('\\n').slice(2).join('\\n')\n\t\t\teffectCreationStacks.set(getRoot(fn), cleanStack)\n\t\t}\n\t}\n\tlet cleanup: (() => void) | null = null\n\tconst tracked = effectHistory.present.with(runEffect, ()=> effectAggregator.zoned)\n\tconst ascend = effectHistory.zoned\n\t//const parent = effectHistory.present.active // TODO: Double-check parenting (untracked -> stop children) - use case or untracked(effect)\n\tlet parent = effectHistory.present.active\n\t/*if (!parent) {\n\t\tfor (const h of effectHistory.active.history) parent = h\n\t}*/\n\tlet effectStopped = false\n\tlet hasReacted = false\n\tlet runningPromise: Promise<any> | null = null\n\tlet cancelPrevious: (() => void) | null = null\n\n\tfunction runEffect() {\n\t\t// Clear previous dependencies\n\t\tif (cleanup) {\n\t\t\tconst prevCleanup = cleanup\n\t\t\tcleanup = null\n\t\t\tuntracked(() => prevCleanup())\n\t\t}\n\n\t\t// Handle async modes when effect is retriggered\n\t\tif (runningPromise) {\n\t\t\tif (asyncMode === 'cancel' && cancelPrevious) {\n\t\t\t\t// Cancel previous execution\n\t\t\t\tcancelPrevious()\n\t\t\t\tcancelPrevious = null\n\t\t\t\trunningPromise = null\n\t\t\t} else if (asyncMode === 'ignore') {\n\t\t\t\t// Ignore new execution while async work is running\n\t\t\t\treturn\n\t\t\t}\n\t\t\t// Note: 'queue' mode not yet implemented\n\t\t}\n\n\t\t// The effect has been stopped after having been planned\n\t\tif (effectStopped) return\n\n\t\toptions.enter(getRoot(fn))\n\t\tlet reactionCleanup: ScopedCallback | undefined\n\t\tlet result: any\n\t\ttry {\n\t\t\tresult = tracked(() => fn({ tracked, ascend, reaction: hasReacted }))\n\t\t\tif (\n\t\t\t\tresult &&\n\t\t\t\ttypeof result !== 'function' &&\n\t\t\t\t(typeof result !== 'object' || !('then' in result))\n\t\t\t)\n\t\t\t\tthrow new ReactiveError(`[reactive] Effect returned a non-function value: ${result}`)\n\t\t\t// Check if result is a Promise (async effect)\n\t\t\tif (result && typeof result === 'object' && typeof result.then === 'function') {\n\t\t\t\tconst originalPromise = result as Promise<any>\n\n\t\t\t\t// Create a cancellation promise that we can reject\n\t\t\t\tlet cancelReject: ((reason: any) => void) | null = null\n\t\t\t\tconst cancelPromise = new Promise<never>((_, reject) => {\n\t\t\t\t\tcancelReject = reject\n\t\t\t\t})\n\n\t\t\t\tconst cancelError = new ReactiveError('[reactive] Effect canceled due to dependency change')\n\n\t\t\t\t// Race between the actual promise and cancellation\n\t\t\t\t// If canceled, the race rejects, which will propagate through any promise chain\n\t\t\t\trunningPromise = Promise.race([originalPromise, cancelPromise])\n\n\t\t\t\t// Store the cancellation function\n\t\t\t\tcancelPrevious = () => {\n\t\t\t\t\tif (cancelReject) {\n\t\t\t\t\t\tcancelReject(cancelError)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Wrap the original promise chain so cancellation propagates\n\t\t\t\t// This ensures that when we cancel, the original promise's .catch() handlers are triggered\n\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// through the zone-wrapped .then()/.catch() handlers\n\t\t\t} else {\n\t\t\t\t// Synchronous result - treat as cleanup function\n\t\t\t\treactionCleanup = result as undefined | ScopedCallback\n\t\t\t}\n\t\t} finally {\n\t\t\thasReacted = true\n\t\t\toptions.leave(fn)\n\t\t}\n\n\t\t// Create cleanup function for next run\n\t\tcleanup = () => {\n\t\t\tcleanup = null\n\t\t\treactionCleanup?.()\n\t\t\t// Remove this effect from all reactive objects it's watching\n\t\t\tconst effectObjects = effectToReactiveObjects.get(runEffect)\n\t\t\tif (effectObjects) {\n\t\t\t\tfor (const reactiveObj of effectObjects) {\n\t\t\t\t\tconst objectWatchers = watchers.get(reactiveObj)\n\t\t\t\t\tif (objectWatchers) {\n\t\t\t\t\t\tfor (const [prop, deps] of objectWatchers.entries()) {\n\t\t\t\t\t\t\tdeps.delete(runEffect)\n\t\t\t\t\t\t\tif (deps.size === 0) {\n\t\t\t\t\t\t\t\tobjectWatchers.delete(prop)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectWatchers.size === 0) {\n\t\t\t\t\t\t\twatchers.delete(reactiveObj)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\teffectToReactiveObjects.delete(runEffect)\n\t\t\t}\n\t\t\t// Invoke all child stops (recursive via subEffectCleanup calling its own mainCleanup)\n\t\t\tconst children = effectChildren.get(runEffect)\n\t\t\tif (children) {\n\t\t\t\tfor (const childCleanup of children) childCleanup()\n\t\t\t\teffectChildren.delete(runEffect)\n\t\t\t}\n\t\t}\n\t}\n\t// Mark the runEffect callback with the original function as its root\n\tmarkWithRoot(runEffect, fn)\n\tfunction augmentedRv(rv: ScopedCallback) {\n\t\treturn Object.defineProperties(rv, {\n\t\t\t[stopped]: {\n\t\t\t\tget() {\n\t\t\t\t\treturn effectStopped\n\t\t\t\t},\n\t\t\t},\n\t\t\t[cleanupSymbol]: {\n\t\t\t\tvalue: () => {\n\t\t\t\t\tif (cleanup) {\n\t\t\t\t\t\tconst prevCleanup = cleanup\n\t\t\t\t\t\tcleanup = null\n\t\t\t\t\t\tuntracked(() => prevCleanup())\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t},\n\t\t}) as ScopedCallback & {\n\t\t\t[stopped]: boolean\n\t\t\t[cleanupSymbol]: () => void\n\t\t}\n\t}\n\taugmentedRv(runEffect)\n\n\t// Register strict mode if enabled\n\tif (effectOptions?.opaque) {\n\t\topaqueEffects.add(runEffect)\n\t}\n\n\tif (isDevtoolsEnabled()) {\n\t\tregisterEffectForDebug(runEffect)\n\t}\n\n\tbatch(runEffect, 'immediate')\n\n\t// Store parent relationship for hierarchy traversal\n\teffectParent.set(runEffect, parent)\n\t// Only ROOT effects are registered for GC cleanup and zone tracking\n\tconst isRootEffect = !parent\n\n\tconst stopEffect = (): void => {\n\t\tif (effectStopped) return\n\t\teffectStopped = true\n\t\t// Cancel any running async work\n\t\tif (cancelPrevious) {\n\t\t\tcancelPrevious()\n\t\t\tcancelPrevious = null\n\t\t\trunningPromise = null\n\t\t}\n\t\tcleanup?.()\n\t\t// Clean up dependency graph edges\n\t\tcleanupEffectFromGraph(runEffect)\n\t\tfr.unregister(stopEffect)\n\t}\n\tif (isRootEffect) {\n\t\tconst callIfCollected = augmentedRv(() => stopEffect())\n\t\tfr.register(\n\t\t\tcallIfCollected,\n\t\t\t() => {\n\t\t\t\tstopEffect()\n\t\t\t\toptions.garbageCollected(fn)\n\t\t\t},\n\t\t\tstopEffect\n\t\t)\n\t\treturn callIfCollected\n\t}\n\t// Register this effect to be stopped when the parent effect is cleaned up\n\tlet children = effectChildren.get(parent)\n\tif (!children) {\n\t\tchildren = new Set()\n\t\teffectChildren.set(parent, children)\n\t}\n\tconst subEffectCleanup = augmentedRv(() => {\n\t\tchildren.delete(subEffectCleanup)\n\t\tif (children.size === 0) {\n\t\t\teffectChildren.delete(parent)\n\t\t}\n\t\t// Execute this child effect cleanup (which triggers its own mainCleanup)\n\t\tstopEffect()\n\t})\n\tchildren.add(subEffectCleanup)\n\n\treturn subEffectCleanup\n}\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\nexport { effectTrackers }\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 programatticallySetValue: any = Symbol()\n\teffect(\n\t\tmarkWithRoot(() => {\n\t\t\tconst newValue = get()\n\t\t\tif (unwrap(newValue) !== programatticallySetValue) received(newValue)\n\t\t}, received)\n\t)\n\treturn set\n\t\t? atomic((value: T) => {\n\t\t\t\tprogramatticallySetValue = unwrap(value)\n\t\t\t\tset(value)\n\t\t\t})\n\t\t: () => {}\n}\n","import { batch } from './effects'\nimport type { Evolution, ScopedCallback } 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>()\n\n// Track deep watchers per object\nexport const deepWatchers = new WeakMap<object, Set<ScopedCallback>>()\n\n// Track which effects are doing deep watching\nexport const effectToDeepWatchedObjects = new WeakMap<ScopedCallback, 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: 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) for (const watcher of parentDeepWatchers) batch(watcher)\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 { recordTriggerLink } from './debug'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { getActiveEffect, isRunning } from './effect-context'\nimport { batch, effectTrackers, hasBatched, opaqueEffects, recordActivation } from './effects'\nimport { unwrap } from './proxy-state'\nimport { watchers } from './registry'\nimport { allProps, type Evolution, options, type ScopedCallback, type State } 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: Set<ScopedCallback>,\n\tobjectWatchers: Map<any, Set<ScopedCallback>>,\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\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\toptions.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.add(effect)\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\tconst trackers = effectTrackers.get(effect)\n\t\t\t\t\trecordTriggerLink(sourceEffect, effect, obj, key, evolution)\n\t\t\t\t\tif (trackers) {\n\t\t\t\t\t\tfor (const tracker of trackers) tracker(obj, evolution, key)\n\t\t\t\t\t\ttrackers.delete(effect)\n\t\t\t\t\t}\n\t\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 Set<ScopedCallback>()\n\t\tif (props) collectEffects(obj, evolution, effects, objectWatchers, [allProps], props)\n\t\telse collectEffects(obj, evolution, effects, objectWatchers, objectWatchers.keys())\n\t\toptions.touched(obj, evolution, props as any[] | undefined, effects)\n\t\tbatch(Array.from(effects))\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<ScopedCallback>()\n\tconst sourceEffect = getActiveEffect()\n\n\tfor (const effect of deps) {\n\t\tif (!opaqueEffects.has(effect)) continue\n\n\t\tconst runningChain = isRunning(effect)\n\t\tif (runningChain) {\n\t\t\toptions.skipRunningEffect(effect)\n\t\t\tcontinue\n\t\t}\n\t\teffects.add(effect)\n\t\trecordActivation(effect, obj, evolution, prop)\n\t\tconst trackers = effectTrackers.get(effect)\n\t\trecordTriggerLink(sourceEffect, effect, obj, prop, evolution)\n\t\tif (trackers) {\n\t\t\tfor (const tracker of trackers) tracker(obj, evolution, prop)\n\t\t\ttrackers.delete(effect)\n\t\t}\n\t}\n\n\tif (effects.size > 0) {\n\t\toptions.touched(obj, evolution, [prop], effects)\n\t\tbatch(Array.from(effects))\n\t}\n}\n","import { nativeReactive, nonReactiveMark } from './types'\n\nexport const nonReactiveObjects = new WeakSet<object>()\nexport const immutables = new Set<(tested: any) => boolean>()\nexport const absent = Symbol('absent')\n\nfunction markNonReactive<T extends object[]>(...obj: T): T[0] {\n\tfor (const o of obj) {\n\t\ttry {\n\t\t\tObject.defineProperty(o, nonReactiveMark, {\n\t\t\t\tvalue: true,\n\t\t\t\twritable: false,\n\t\t\t\tenumerable: false,\n\t\t\t\tconfigurable: false,\n\t\t\t})\n\t\t} catch {}\n\t\tif (!(nonReactiveMark in (o as object))) nonReactiveObjects.add(o as object)\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)[nonReactiveMark] = true\n\treturn cls[0]\n}\n\nexport function isNonReactive(obj: any): boolean {\n\tif (obj === null || typeof obj !== 'object') return true\n\tif (nonReactiveObjects.has(obj)) return true\n\tif ((obj as any)[nonReactiveMark]) return true\n\tfor (const fn of immutables) if (fn(obj)) return true\n\treturn false\n}\n\nexport function registerNativeReactivity(\n\toriginalClass: new (...args: any[]) => any,\n\treactiveClass: new (...args: any[]) => any\n) {\n\toriginalClass.prototype[nativeReactive] = reactiveClass\n\tnonReactiveClass(reactiveClass)\n}\n\nnonReactiveClass(Date, RegExp, Error, Promise, Function)\nif (typeof window !== 'undefined') {\n\tmarkNonReactive(window, document)\n\tnonReactiveClass(Node, Element, HTMLElement, EventTarget)\n}\n\nexport { markNonReactive as nonReactive }\n","import { addState, collectEffects, touched1, touchedOpaque } from './change'\nimport { bubbleUpChange, objectsWithDeepWatchers } from './deep-watch-state'\nimport { batch } from './effects'\nimport { isNonReactive } from './non-reactive-state'\nimport { unwrap } from './proxy-state'\nimport { effectParent, watchers } from './registry'\nimport { allProps, type Evolution, options, type ScopedCallback } from './types'\n\nfunction isObject(value: any): value is object {\n\treturn typeof value === 'object' && value !== null\n}\n\nfunction isObjectLike(value: unknown): value is object {\n\treturn isObject(value)\n}\n\nfunction getPrototypeToken(value: any): object | null | undefined {\n\tif (!isObjectLike(value)) return undefined\n\tif (Array.isArray(value)) return Array.prototype\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 (!isObjectLike(oldValue) || !isObjectLike(newValue)) return false\n\tif (isNonReactive(oldValue) || isNonReactive(newValue)) return false\n\treturn getPrototypeToken(oldValue) === getPrototypeToken(newValue)\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\t\tdispatchNotifications(recursiveTouch(oldValue, newValue, new WeakMap(), [], origin))\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 (!isObjectLike(oldValue) || !isObjectLike(newValue)) return 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\n\tfor (const key of newKeys) {\n\t\tif (!oldKeys.has(key)) continue\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(effect: ScopedCallback, allowedSet: Set<ScopedCallback>): boolean {\n\tlet current: ScopedCallback | undefined = effect\n\tconst visited = new WeakSet<ScopedCallback>()\n\twhile (current && !visited.has(current)) {\n\t\tvisited.add(current)\n\t\tif (allowedSet.has(current)) return true\n\t\tcurrent = effectParent.get(current)\n\t}\n\treturn false\n}\n\nexport function dispatchNotifications(notifications: PendingNotification[]) {\n\tif (!notifications.length) return\n\tconst combinedEffects = new Set<ScopedCallback>()\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<ScopedCallback> | 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<ScopedCallback>()\n\t\tconst originWatchers = watchers.get(origin.obj)\n\t\tif (originWatchers) {\n\t\t\tconst originEffects = new Set<ScopedCallback>()\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\tfor (const effect of originEffects) allowedEffects.add(effect)\n\t\t}\n\t\t// If no allowed effects, skip all notifications (no one should be notified)\n\t\tif (allowedEffects.size === 0) return\n\t}\n\n\tfor (const { target, evolution, prop } of notifications) {\n\t\tif (!isObjectLike(target)) continue\n\t\tconst obj = unwrap(target)\n\t\taddState(obj, evolution)\n\t\tconst objectWatchers = watchers.get(obj)\n\t\tlet currentEffects: Set<ScopedCallback> | undefined\n\t\tconst propsArray = [prop]\n\t\tif (objectWatchers) {\n\t\t\tcurrentEffects = new Set<ScopedCallback>()\n\t\t\tcollectEffects(obj, evolution, currentEffects, objectWatchers, [allProps], 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 Set<ScopedCallback>()\n\t\t\t\tfor (const effect 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.add(effect)\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) combinedEffects.add(effect)\n\t\t}\n\t\toptions.touched(obj, evolution, propsArray, currentEffects)\n\t\tif (objectsWithDeepWatchers.has(obj)) bubbleUpChange(obj, evolution)\n\t}\n\tif (combinedEffects.size) batch([...combinedEffects])\n}\n","import { getActiveEffect } from './effect-context'\nimport { unwrap } from './proxy-state'\nimport {\n\teffectToReactiveObjects,\n\twatchers,\n} from './registry'\nimport { allProps, type ScopedCallback } from './types'\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\tobj = unwrap(obj)\n\tconst currentActiveEffect = getActiveEffect()\n\n\t// Early return if no active effect, tracking disabled, or invalid prop\n\tif (\n\t\t!currentActiveEffect ||\n\t\t(typeof prop === 'symbol' && prop !== allProps)\n\t)\n\t\treturn\n\n\tlet objectWatchers = watchers.get(obj)\n\tif (!objectWatchers) {\n\t\tobjectWatchers = new Map<PropertyKey, Set<ScopedCallback>>()\n\t\twatchers.set(obj, objectWatchers)\n\t}\n\tlet deps = objectWatchers.get(prop)\n\tif (!deps) {\n\t\tdeps = new Set<ScopedCallback>()\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","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 { untracked } from './effects'\nimport { absent, isNonReactive } from './non-reactive-state'\nimport {\n\tgetExistingProxy,\n\tproxyToObject,\n\tstoreProxyRelationship,\n\ttrackProxyObject,\n\tunwrap,\n} from './proxy-state'\nimport { dependant } from './tracking'\nimport {\n\tallProps,\n\tnativeReactive,\n\tnonReactiveMark,\n\toptions,\n\tReactiveError,\n\tReactiveErrorCode,\n\tunreactiveProperties,\n} from './types'\nexport const metaProtos = new WeakMap()\n\nconst hasReentry: any[] = []\nconst reactiveHandlers = {\n\t[Symbol.toStringTag]: 'MutTs Reactive',\n\tget(obj: any, prop: PropertyKey, receiver: any) {\n\t\tif (obj && typeof obj === 'object' && !Object.hasOwn(obj, prop)) {\n\t\t\tconst metaProto = metaProtos.get(obj.constructor)\n\t\t\tif (metaProto && prop in metaProto) {\n\t\t\t\tconst desc = Object.getOwnPropertyDescriptor(metaProto, prop)!\n\t\t\t\treturn desc.get ? desc.get.call(obj) : (...args) => desc.value.apply(obj, args)\n\t\t\t}\n\t\t}\n\t\tif (prop === nonReactiveMark) return false\n\t\tconst unwrappedObj = unwrap(obj)\n\t\t// Check if this property is marked as unreactive\n\t\tif (unwrappedObj[unreactiveProperties]?.has(prop) || typeof prop === 'symbol')\n\t\t\treturn FoolProof.get(obj, prop, receiver)\n\n\t\t// Check if property exists and if it's an own property (cached for later use)\n\t\tconst hasProp = Reflect.has(receiver, prop)\n\t\tconst isOwnProp = hasProp && Object.hasOwn(receiver, prop)\n\t\tconst isInheritedAccess = hasProp && !isOwnProp\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\tconst shouldIgnoreAccessor =\n\t\t\toptions.ignoreAccessors &&\n\t\t\tisOwnProp &&\n\t\t\t(isOwnAccessor(receiver, prop) || isOwnAccessor(unwrappedObj, prop))\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// Watch the whole prototype chain when requested or for null-proto objects\n\t\tif (isInheritedAccess && (!options.instanceMembers || !(obj instanceof Object))) {\n\t\t\tlet current = reactiveObject(Object.getPrototypeOf(obj))\n\t\t\twhile (current && current !== Object.prototype) {\n\t\t\t\tdependant(current, prop)\n\t\t\t\tif (Object.hasOwn(current, prop)) break\n\t\t\t\tlet next = reactiveObject(Object.getPrototypeOf(current))\n\t\t\t\tif (next === current) {\n\t\t\t\t\tnext = reactiveObject(Object.getPrototypeOf(unwrap(current)))\n\t\t\t\t}\n\t\t\t\tcurrent = next\n\t\t\t}\n\t\t}\n\t\tconst value = FoolProof.get(obj, prop, receiver)\n\t\tif (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: any, prop: PropertyKey, value: any, receiver: any): boolean {\n\t\t// Read old value directly from unwrapped object to avoid triggering dependency tracking\n\t\tconst unwrappedObj = unwrap(obj)\n\t\tconst unwrappedReceiver = unwrap(receiver)\n\n\t\t// Check if this property is marked as unreactive\n\t\tif (unwrappedObj[unreactiveProperties]?.has(prop) || unwrappedObj !== unwrappedReceiver)\n\t\t\treturn FoolProof.set(obj, prop, value, receiver)\n\t\tconst newValue = unwrap(value)\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\tif (Reflect.has(unwrappedReceiver, prop)) {\n\t\t\t// Check descriptor on both receiver and target to handle proxy cases\n\t\t\tconst receiverDesc = Object.getOwnPropertyDescriptor(unwrappedReceiver, prop)\n\t\t\tconst targetDesc = Object.getOwnPropertyDescriptor(unwrappedObj, prop)\n\t\t\tconst desc = receiverDesc || targetDesc\n\t\t\t// We *need* to use `receiver` and not `unwrappedObj` here, otherwise we break\n\t\t\t// the dependency tracking for memoized getters\n\t\t\tif (desc?.get && !desc?.set) {\n\t\t\t\toldVal = untracked(() => Reflect.get(unwrappedObj, prop, receiver))\n\t\t\t} else {\n\t\t\t\toldVal = untracked(() => Reflect.get(unwrappedObj, prop, receiver))\n\t\t\t}\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\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\tnotifyPropertyChange(obj, prop, oldVal, newValue, oldVal !== absent)\n\t\t\t}\n\t\t}\n\t\treturn true\n\t},\n\thas(obj: any, prop: PropertyKey): boolean {\n\t\tif (hasReentry.includes(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.push(obj)\n\t\tdependant(obj, prop)\n\t\tconst rv = Reflect.has(obj, prop)\n\t\thasReentry.pop()\n\t\treturn rv\n\t},\n\tdeleteProperty(obj: any, prop: PropertyKey): boolean {\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: any): (string | symbol)[] {\n\t\tdependant(obj, allProps)\n\t\treturn Reflect.ownKeys(obj)\n\t},\n} as const\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): 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\tconst proxied =\n\t\tnativeReactive in target && !(target instanceof target[nativeReactive])\n\t\t\t? new target[nativeReactive](target)\n\t\t\t: target\n\tif (proxied !== target) trackProxyObject(proxied, target)\n\tconst proxy = new Proxy(proxied, reactiveHandlers)\n\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\n/**\n * Gets the original, non-reactive object from a reactive proxy\n * @param proxy - The reactive proxy\n * @returns The original object\n */\nexport { isReactive, objectToProxy, proxyToObject, unwrap } from './proxy-state'\n","import {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectsWithDeepWatchers,\n} from './deep-watch-state'\nimport { effect } from './effects'\nimport { isNonReactive } from './non-reactive-state'\nimport { reactive, unwrap } from './proxy'\nimport { markWithRoot } from './registry'\nimport { options, type ScopedCallback } from './types'\n\nfunction isObject(value: any): value is object {\n\treturn typeof value === 'object' && value !== null\n}\n\nexport {\n\taddBackReference,\n\tbubbleUpChange,\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tneedsBackReferences,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n\tremoveBackReference,\n} from './deep-watch-state'\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): (() => void) | 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 ScopedCallback signature\n\tconst wrappedCallback: ScopedCallback = markWithRoot(() => callback(target), callback)\n\n\t// Use the existing effect system to register dependencies\n\treturn effect(() => {\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) || !isObject(obj) || depth > options.maxDeepWatchDepth) return\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// biome-ignore lint/suspicious/useIsArray: Check for both native arrays and reactive arrays\n\t\t\tif (Array.isArray(obj) || obj instanceof Array) {\n\t\t\t\t// Access array length to register dependency on length changes\n\t\t\t\tconst length = obj.length\n\n\t\t\t\t// Access all current array elements to register dependencies\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\t// Access the array element to register dependency\n\t\t\t\t\tconst value = obj[i]\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\t\t\t// Handle Set values (deep watch values only, not keys since Sets don't have separate keys)\n\t\t\telse if (obj instanceof Set) {\n\t\t\t\t// Access all Set values to register dependencies\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\t\t\t}\n\t\t\t// Handle Map values (deep watch values only, not keys)\n\t\t\telse if (obj instanceof Map) {\n\t\t\t\t// Access all Map values to register dependencies\n\t\t\t\tfor (const [_key, 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\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) callback(target)\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, type GenericClassDecorator } from '../decorator'\nimport { deepWatch } from './deep-watch'\nimport { effect, untracked } from './effects'\nimport { isNonReactive, nonReactiveClass, nonReactiveObjects } from './non-reactive-state'\nimport { unwrap } from './proxy-state'\nimport { markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport {\n\ttype DependencyAccess,\n\tnonReactiveMark,\n\ttype ScopedCallback,\n\tunreactiveProperties,\n} from './types'\n\n/**\n * Symbol for accessing the cleanup function on cleaned objects\n */\nexport const cleanup = Symbol('cleanup')\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 * @param value - Function that returns the value to watch\n * @param changed - Callback to call when the value changes\n * @param options - Watch options\n * @returns Cleanup function to stop watching\n */\nexport function watch<T>(\n\tvalue: (dep: DependencyAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep?: false }\n): ScopedCallback\n/**\n * Watches a reactive value with deep watching enabled\n * @param value - Function that returns the value to watch\n * @param changed - Callback to call when the value changes\n * @param options - Watch options with deep watching enabled\n * @returns Cleanup function to stop watching\n */\nexport function watch<T extends object | any[]>(\n\tvalue: (dep: DependencyAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep: true }\n): ScopedCallback\n/**\n * Watches a reactive object directly\n * @param value - The reactive object to watch\n * @param changed - Callback to call when the object changes\n * @param options - Watch options\n * @returns Cleanup function to stop watching\n */\nexport function watch<T extends object | any[]>(\n\tvalue: T,\n\tchanged: (value: T) => void,\n\toptions?: WatchOptions\n): ScopedCallback\n\nexport function watch(\n\tvalue: any, //object | ((dep: DependencyAccess) => object),\n\tchanged: (value?: object, oldValue?: object) => void,\n\toptions: any = {}\n) {\n\treturn typeof value === 'function'\n\t\t? watchCallBack(value, changed, options)\n\t\t: typeof value === 'object' && value !== null\n\t\t\t? watchObject(value, changed, options)\n\t\t\t: (() => {\n\t\t\t\t\tthrow new Error('watch: value must be a function or an object')\n\t\t\t\t})()\n}\n\nfunction watchObject(\n\tvalue: object,\n\tchanged: (value: object) => void,\n\t{ immediate = false, deep = false } = {}\n): ScopedCallback {\n\tif (deep) return deepWatch(value, changed, { immediate })!\n\treturn effect(function watchObjectEffect() {\n\t\tdependant(value)\n\t\tif (immediate) changed(value)\n\t\timmediate = true\n\t})\n}\n\nfunction watchCallBack<T>(\n\tvalue: (dep: DependencyAccess) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\t{ immediate = false, deep = false } = {}\n): ScopedCallback {\n\tlet oldValue: T | typeof unsetYet = unsetYet\n\tlet deepCleanup: ScopedCallback | undefined\n\tconst cbCleanup = effect(\n\t\tmarkWithRoot(function watchCallBackEffect(access) {\n\t\t\tconst newValue = value(access)\n\t\t\tif (oldValue !== newValue)\n\t\t\t\tif (oldValue === unsetYet) {\n\t\t\t\t\tif (immediate) changed(newValue)\n\t\t\t\t} else changed(newValue, oldValue)\n\t\t\t\toldValue = newValue\n\t\t\t\tif (deep) {\n\t\t\t\t\tif (deepCleanup) deepCleanup()\n\t\t\t\t\tdeepCleanup = deepWatch(newValue as object, (value) => changed(value as T, value as T))\n\t\t\t\t}\n\t\t}, value)\n\t)\n\treturn () => {\n\t\tcbCleanup()\n\t\tif (deepCleanup) deepCleanup()\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 deepNonReactive<T>(obj: T): T {\n\tobj = unwrap(obj)\n\tif (isNonReactive(obj)) return obj\n\ttry {\n\t\tObject.defineProperty(obj as object, nonReactiveMark, {\n\t\t\tvalue: true,\n\t\t\twritable: false,\n\t\t\tenumerable: false,\n\t\t\tconfigurable: true,\n\t\t})\n\t} catch {}\n\tif (!(nonReactiveMark in (obj as object))) nonReactiveObjects.add(obj as object)\n\t// Finally, not deep\n\t//for (const key in obj) deepNonReactive(obj[key])\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? deepNonReactive(arg1)\n\t\t: (((original) => {\n\t\t\t\t// Copy the parent's unreactive properties if they exist\n\t\t\t\toriginal.prototype[unreactiveProperties] = new Set<PropertyKey>(\n\t\t\t\t\toriginal.prototype[unreactiveProperties] || []\n\t\t\t\t)\n\t\t\t\t// Add all arguments (including the first one)\n\t\t\t\toriginal.prototype[unreactiveProperties].add(arg1)\n\t\t\t\tfor (const arg of args) original.prototype[unreactiveProperties].add(arg)\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\tnonReactiveClass(original)\n\t},\n\tdefault: unreactiveApplication,\n})\n\n//#endregion\n\nexport function cleanedBy<T extends object>(obj: T, cleanupFn: ScopedCallback) {\n\treturn Object.defineProperty(obj, cleanup, {\n\t\tvalue: cleanupFn,\n\t\twritable: false,\n\t\tenumerable: false,\n\t\tconfigurable: true,\n\t}) as T & { [cleanup]: ScopedCallback }\n}\n\n//#region greedy caching\n\n/**\n * Creates a derived value that automatically recomputes when dependencies change\n * @param compute - Function that computes the derived value\n * @returns Object with value and cleanup function\n */\nexport function derived<T>(compute: (dep: DependencyAccess) => T): {\n\tvalue: T\n\t[cleanup]: ScopedCallback\n} {\n\tconst rv = { value: undefined as unknown as T }\n\treturn cleanedBy(\n\t\trv,\n\t\tuntracked(() =>\n\t\t\teffect(function derivedEffect(access) {\n\t\t\t\trv.value = compute(access)\n\t\t\t})\n\t\t)\n\t)\n}\n","import { decorator } from '../decorator'\nimport { deepCompare, renamed } from '../utils'\nimport { touched1 } from './change'\nimport { effect, root, untracked } from './effects'\nimport { getRoot, markWithRoot } from './registry'\nimport { dependant } from './tracking'\nimport { options, rootFunction } from './types'\n\nexport type Memoizable = object | any[] | symbol | ((...args: any[]) => any)\n\ntype MemoCacheTree<Result> = {\n\tresult?: Result\n\tcleanup?: () => void\n\tbranches?: WeakMap<Memoizable, MemoCacheTree<Result>>\n}\n\nconst memoizedRegistry = new WeakMap<any, Function>()\nconst wrapperRegistry = new WeakMap<Function, Function>()\n\nfunction getBranch<Result>(tree: MemoCacheTree<Result>, key: Memoizable): 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 Memoizable[]>(\n\tfn: (...args: Args) => Result\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((...args: Args): Result => {\n\t\tconst localArgs = args //: Args = maxArgs !== undefined ? (args.slice(0, maxArgs) as Args) : args\n\t\tif (localArgs.some((arg) => !(arg && ['object', 'symbol', 'function'].includes(typeof arg))))\n\t\t\tthrow new Error('memoize expects non-null object arguments')\n\n\t\tlet node: MemoCacheTree<Result> = cacheRoot\n\t\t// Note: decorators add `this` as first argument\n\t\tfor (const arg of localArgs) {\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(...localArgs))\n\t\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\t\toptions.onMemoizationDiscrepancy(node.result, fresh, fn, localArgs, '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(\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(...localArgs)\n\t\t\t\t\treturn () => {\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: localArgs }, '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()\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(...localArgs))\n\t\t\t\tif (!deepCompare(node.result, fresh)) {\n\t\t\t\t\toptions.onMemoizationDiscrepancy(node.result, fresh, fn, localArgs, '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\nexport const memoize = decorator({\n\tgetter(original, target, propertyKey) {\n\t\treturn function (this: any) {\n\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\tif (!wrapper) {\n\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\trenamed(\n\t\t\t\t\t\t(that: object) => {\n\t\t\t\t\t\t\treturn original.call(that)\n\t\t\t\t\t\t},\n\t\t\t\t\t\t`${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(propertyKey)}`\n\t\t\t\t\t),\n\t\t\t\t\t{\n\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\tpropertyKey,\n\t\t\t\t\t\t...((original as any)[rootFunction]\n\t\t\t\t\t\t\t? { [rootFunction]: (original as any)[rootFunction] }\n\t\t\t\t\t\t\t: {}),\n\t\t\t\t\t}\n\t\t\t\t)\n\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t}\n\t\t\tconst memoized = memoizeFunction(wrapper as any)\n\t\t\treturn memoized(this)\n\t\t}\n\t},\n\tmethod(original, target, name) {\n\t\treturn function (this: any, ...args: object[]) {\n\t\t\tlet wrapper = wrapperRegistry.get(original)\n\t\t\tif (!wrapper) {\n\t\t\t\twrapper = markWithRoot(\n\t\t\t\t\trenamed(\n\t\t\t\t\t\t(that: object, ...args: object[]) => {\n\t\t\t\t\t\t\treturn original.call(that, ...args)\n\t\t\t\t\t\t},\n\t\t\t\t\t\t`${String(target?.constructor?.name ?? target?.name ?? 'Object')}.${String(name)}`\n\t\t\t\t\t),\n\t\t\t\t\t{\n\t\t\t\t\t\tmethod: original,\n\t\t\t\t\t\tpropertyKey: name,\n\t\t\t\t\t\t...((original as any)[rootFunction]\n\t\t\t\t\t\t\t? { [rootFunction]: (original as any)[rootFunction] }\n\t\t\t\t\t\t\t: {}),\n\t\t\t\t\t}\n\t\t\t\t)\n\t\t\t\twrapperRegistry.set(original, wrapper)\n\t\t\t}\n\t\t\tconst memoized = memoizeFunction(wrapper as any) as (...args: object[]) => unknown\n\t\t\treturn memoized(this, ...args)\n\t\t}\n\t},\n\tdefault: memoizeFunction,\n})\n","import {\n\tabsent,\n\timmutables,\n\tisNonReactive,\n\tnonReactive,\n\tnonReactiveClass,\n\tnonReactiveObjects,\n\tregisterNativeReactivity,\n} from './non-reactive-state'\nimport { 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\nexport {\n\tabsent,\n\timmutables,\n\tisNonReactive,\n\tnonReactive,\n\tnonReactiveClass,\n\tnonReactiveObjects,\n\tregisterNativeReactivity,\n}\n","import { FunctionWrapper } from '../zone'\nimport { ArrayReadForward, forwardArray, getAt, Indexable, setAt } from '../indexable'\nimport { effect } from './effects'\nimport { unreactive } from './interface'\nimport { reactive } from './proxy'\nimport { type ScopedCallback } from './types'\n\n// TODO: use register in a real-world crud situation, have \"events\" for add, delete, update\n\ntype KeyFunction<T, K extends PropertyKey> = (item: T) => K\n\n// Helper to work around TypeScript limitation: base class expressions cannot reference class type parameters\nfunction getRegisterBase<T>() {\n\tclass RegisterBase extends Indexable(ArrayReadForward, {\n\t\tget(this: any, index: number) {\n\t\t\treturn this[getAt](index)\n\t\t},\n\t\tset(this: any, index: number, value: T) {\n\t\t\tthis[setAt](index, value)\n\t\t},\n\t\tgetLength(this: any) {\n\t\t\treturn this.length\n\t\t},\n\t\tsetLength(this: any, value: number) {\n\t\t\tthis.length = value\n\t\t},\n\t}) {\n\t\ttoArray(): T[] {\n\t\t\treturn Array.from(this)\n\t\t}\n\t}\n\treturn RegisterBase as new () => ArrayReadForward<T> & {\n\t\t[x: number]: T\n\t\ttoArray(): T[]\n\t}\n}\ninterface RegisterInstance<T> extends ArrayReadForward<T> {\n\t[index: number]: T\n}\n// TODO: What to do with prototype forwarding ?\n@unreactive\nclass RegisterClass<T, K extends PropertyKey = PropertyKey>\n\textends getRegisterBase<any>()\n\timplements RegisterInstance<T>\n{\n\tprotected get [forwardArray](): readonly T[] {\n\t\treturn this.toArray()\n\t}\n\treadonly #keyFn: KeyFunction<T, K>\n\treadonly #keys: K[]\n\treadonly #values: Map<K, T>\n\treadonly #usage = new Map<K, number>()\n\treadonly #valueInfo = new Map<T, { key: K; stop?: ScopedCallback }>()\n\treadonly #keyEffects = new Set<ScopedCallback>()\n\treadonly #ascend: FunctionWrapper\n\n\tconstructor(keyFn: KeyFunction<T, K>, initial?: Iterable<T>) {\n\t\tsuper()\n\t\t/* Moved below initialization */\n\t\tlet ascendGet: FunctionWrapper | undefined\n\t\teffect(({ ascend }) => {\n\t\t\tascendGet = ascend\n\t\t})\n\t\tthis.#ascend = ascendGet!\n\t\tif (typeof keyFn !== 'function') throw new Error('Register requires a key function')\n\t\tthis.#keyFn = keyFn\n\t\tthis.#keys = reactive([] as K[])\n\t\tthis.#values = reactive(new Map<K, T>())\n\t\tif (initial) this.push(...initial)\n\t}\n\n\tprivate ensureKey(value: T): K {\n\t\tlet info = this.#valueInfo.get(value)\n\t\tif (info) return info.key\n\t\tinfo = { key: undefined as unknown as K }\n\t\tthis.#valueInfo.set(value, info)\n\t\tthis.#ascend(() => {\n\t\t\tconst stop = effect(({ reaction }) => {\n\t\t\t\tconst nextKey = this.#keyFn(value)\n\t\t\t\tthis.assertValidKey(nextKey)\n\t\t\t\tconst previousKey = info!.key\n\t\t\t\tif (reaction && previousKey !== undefined && !Object.is(nextKey, previousKey))\n\t\t\t\t\tthis.#rekeyValue(value, previousKey, nextKey)\n\t\t\t\tinfo!.key = nextKey\n\t\t\t})\n\t\t\tinfo!.stop = stop\n\t\t\tthis.#keyEffects.add(stop)\n\t\t})\n\t\tif (info.key === undefined) throw new Error('Register key function must return a property key')\n\t\treturn info.key\n\t}\n\n\tprivate assertValidKey(key: unknown): asserts key is K {\n\t\tconst type = typeof key\n\t\tif (type !== 'string' && type !== 'number' && type !== 'symbol')\n\t\t\tthrow new Error('Register key function must return a property key')\n\t}\n\n\tprivate setKeyValue(key: K, value: T) {\n\t\tconst existing = this.#values.get(key)\n\t\tif (existing !== undefined && existing !== value) this.cleanupValue(existing)\n\t\tthis.#values.set(key, value)\n\t}\n\n\tprivate cleanupValue(value: T) {\n\t\tconst info = this.#valueInfo.get(value)\n\t\tif (!info) return\n\t\tconst stop = info.stop\n\t\tif (stop) {\n\t\t\tinfo.stop = undefined\n\t\t\tthis.#keyEffects.delete(stop)\n\t\t\tstop()\n\t\t}\n\t\tthis.#valueInfo.delete(value)\n\t}\n\n\tprivate disposeKeyEffects() {\n\t\tfor (const value of Array.from(this.#valueInfo.keys())) this.cleanupValue(value)\n\t\tthis.#keyEffects.clear()\n\t}\n\n\t#rekeyValue(value: T, oldKey: K, newKey: K) {\n\t\tif (Object.is(oldKey, newKey)) return\n\t\tconst existingValue = this.#values.get(newKey)\n\t\tif (existingValue !== undefined && existingValue !== value)\n\t\t\tthrow new Error(`Register key collision for key ${String(newKey)}`)\n\t\tconst count = this.#usage.get(oldKey)\n\t\tif (!count) return\n\t\tconst existingCount = this.#usage.get(newKey) ?? 0\n\t\tthis.setKeyValue(newKey, value)\n\t\tfor (let i = 0; i < this.#keys.length; i++)\n\t\t\tif (Object.is(this.#keys[i], oldKey)) this.#keys[i] = newKey\n\t\tthis.#usage.set(newKey, existingCount + count)\n\t\tthis.#usage.delete(oldKey)\n\t\tthis.#values.delete(oldKey)\n\t\tconst updatedInfo = this.#valueInfo.get(value)\n\t\tif (updatedInfo) updatedInfo.key = newKey\n\t}\n\n\tprivate incrementUsage(key: K) {\n\t\tconst count = this.#usage.get(key) ?? 0\n\t\tthis.#usage.set(key, count + 1)\n\t}\n\n\tprivate decrementUsage(key: K) {\n\t\tconst count = this.#usage.get(key)\n\t\tif (!count) return\n\t\tif (count <= 1) {\n\t\t\tconst value = this.#values.get(key)\n\t\t\tthis.#usage.delete(key)\n\t\t\tthis.#values.delete(key)\n\t\t\tif (value !== undefined) this.cleanupValue(value)\n\t\t} else {\n\t\t\tthis.#usage.set(key, count - 1)\n\t\t}\n\t}\n\n\tprivate normalizeIndex(index: number, allowEnd = false): number {\n\t\tconst length = this.length\n\t\tlet resolved = index\n\t\tif (resolved < 0) resolved = Math.max(length + resolved, 0)\n\t\tif (resolved > length) {\n\t\t\tif (allowEnd) resolved = length\n\t\t\telse throw new RangeError('Index out of bounds')\n\t\t}\n\t\tif (!allowEnd && resolved === length) throw new RangeError('Index out of bounds')\n\t\treturn resolved\n\t}\n\n\tprivate assignAt(index: number, key: K, value: T) {\n\t\tconst oldKey = this.#keys[index]\n\t\tif (oldKey !== undefined && Object.is(oldKey, key)) {\n\t\t\tthis.setKeyValue(key, value)\n\t\t\treturn\n\t\t}\n\t\tif (oldKey !== undefined) this.decrementUsage(oldKey as K)\n\t\tthis.#keys[index] = key\n\t\tthis.incrementUsage(key)\n\t\tthis.setKeyValue(key, value)\n\t}\n\n\tprivate insertKeyValue(index: number, key: K, value: T) {\n\t\tthis.#keys.splice(index, 0, key)\n\t\tthis.incrementUsage(key)\n\t\tthis.setKeyValue(key, value)\n\t}\n\n\tprivate rebuildFrom(values: T[]) {\n\t\tthis.disposeKeyEffects()\n\t\tthis.#keys.splice(0, this.#keys.length)\n\t\tthis.#usage.clear()\n\t\tthis.#values.clear()\n\t\tfor (const value of values) {\n\t\t\tconst key = this.ensureKey(value)\n\t\t\tthis.#keys.push(key)\n\t\t\tthis.incrementUsage(key)\n\t\t\tthis.#values.set(key, value)\n\t\t}\n\t}\n\n\tget length(): number {\n\t\treturn this.#keys.length\n\t}\n\n\t[getAt](index: number): T | undefined {\n\t\tconst key = this.#keys[index]\n\t\treturn key === undefined ? undefined : this.#values.get(key)\n\t}\n\n\t[setAt](index: number, value: T): void {\n\t\tconst key = this.ensureKey(value)\n\t\tif (index === this.length) {\n\t\t\tthis.insertKeyValue(index, key, value)\n\t\t\treturn\n\t\t}\n\t\tconst normalized = this.normalizeIndex(index)\n\t\tthis.assignAt(normalized, key, value)\n\t}\n\n\tpush(...items: T[]): number {\n\t\tfor (const item of items) {\n\t\t\tconst key = this.ensureKey(item)\n\t\t\tthis.insertKeyValue(this.length, key, item)\n\t\t}\n\t\treturn this.length\n\t}\n\n\tpop(): T | undefined {\n\t\tif (!this.length) return undefined\n\t\treturn this.removeAt(this.length - 1)\n\t}\n\n\tshift(): T | undefined {\n\t\tif (!this.length) return undefined\n\t\treturn this.removeAt(0)\n\t}\n\n\tunshift(...items: T[]): number {\n\t\tlet index = 0\n\t\tfor (const item of items) {\n\t\t\tconst key = this.ensureKey(item)\n\t\t\tthis.insertKeyValue(index++, key, item)\n\t\t}\n\t\treturn this.length\n\t}\n\n\tsplice(start: number, deleteCount?: number, ...items: T[]): T[] {\n\t\tconst normalizedStart = this.normalizeIndex(start, true)\n\t\tconst maxDeletions = this.length - normalizedStart\n\t\tconst actualDelete = Math.min(\n\t\t\tdeleteCount === undefined ? maxDeletions : Math.max(deleteCount, 0),\n\t\t\tmaxDeletions\n\t\t)\n\t\tconst keysToInsert: K[] = []\n\t\tfor (const item of items) keysToInsert.push(this.ensureKey(item))\n\t\tconst removedKeys = this.#keys.splice(normalizedStart, actualDelete, ...keysToInsert)\n\t\tconst removedValues: T[] = []\n\t\tfor (const key of removedKeys) {\n\t\t\tif (key === undefined) continue\n\t\t\tconst value = this.#values.get(key as K)\n\t\t\tthis.decrementUsage(key as K)\n\t\t\tremovedValues.push(value as T)\n\t\t}\n\t\tfor (let i = 0; i < keysToInsert.length; i++) {\n\t\t\tconst key = keysToInsert[i]\n\t\t\tconst value = items[i]\n\t\t\tthis.incrementUsage(key)\n\t\t\tthis.setKeyValue(key, value)\n\t\t}\n\t\treturn removedValues\n\t}\n\n\tclear(): void {\n\t\tthis.#keys.length = 0\n\t\tthis.#usage.clear()\n\t\tthis.#values.clear()\n\t\tthis.disposeKeyEffects()\n\t}\n\n\tget(key: K): T | undefined {\n\t\treturn this.#values.get(key)\n\t}\n\tset(key: K, value: T): void {\n\t\tif (this.#values.has(key)) this.setKeyValue(key, value)\n\t}\n\n\tremove(key: K) {\n\t\tlet index: number = this.indexOfKey(key)\n\t\twhile (index !== -1) {\n\t\t\tthis.removeAt(index)\n\t\t\tindex = this.indexOfKey(key)\n\t\t}\n\t}\n\n\tpublic removeAt(index: number): T | undefined {\n\t\tconst [key] = this.#keys.splice(index, 1)\n\t\tif (key === undefined) return undefined\n\t\tconst value = this.#values.get(key as K)\n\t\tthis.decrementUsage(key as K)\n\t\treturn value\n\t}\n\n\t/**\n\t * Keep only the items for which the predicate returns true.\n\t * Items for which the predicate returns false are removed.\n\t *\n\t * The predicate is evaluated once per distinct key; duplicate keys\n\t * will follow the same keep/remove decision.\n\t */\n\tpublic keep(predicate: (value: T) => boolean): void {\n\t\tconst decisions = new Map<K, boolean>()\n\t\tfor (const [index, key] of this.#keys.entries()) {\n\t\t\tif (decisions.has(key)) {\n\t\t\t\tif (!decisions.get(key)) this.removeAt(index)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tconst value = this.#values.get(key)\n\t\t\tconst shouldKeep = predicate(value as T)\n\t\t\tdecisions.set(key, shouldKeep)\n\t\t\tif (!shouldKeep) this.removeAt(index)\n\t\t}\n\t}\n\n\thasKey(key: K): boolean {\n\t\treturn this.#usage.has(key)\n\t}\n\n\tindexOfKey(key: K): number {\n\t\treturn this.#keys.indexOf(key)\n\t}\n\n\tmapKeys(): IterableIterator<K> {\n\t\treturn this.#values.keys()\n\t}\n\n\tupdate(...values: T[]): void {\n\t\tfor (const value of values) {\n\t\t\tconst key = this.ensureKey(value)\n\t\t\tif (this.#values.has(key)) this.setKeyValue(key, value)\n\t\t}\n\t}\n\n\tupsert(insert: (value: T) => void, ...values: T[]): void {\n\t\tfor (const value of values) {\n\t\t\tconst key = this.ensureKey(value)\n\t\t\tif (this.#values.has(key)) this.setKeyValue(key, value)\n\t\t\telse insert(value)\n\t\t}\n\t}\n\n\tentries(): IterableIterator<[number, T]> {\n\t\tconst self = this\n\t\tfunction* iterator(): IterableIterator<[number, T]> {\n\t\t\tfor (let i = 0; i < self.#keys.length; i++) {\n\t\t\t\tconst val = self.#values.get(self.#keys[i])\n\t\t\t\tif (val !== undefined) yield [i, val]\n\t\t\t}\n\t\t}\n\t\treturn iterator()\n\t}\n\n\t[Symbol.iterator](): IterableIterator<T> {\n\t\tconst self = this\n\t\tfunction* iterator(): IterableIterator<T> {\n\t\t\tfor (const key of self.#keys) {\n\t\t\t\tconst value = self.#values.get(key)\n\t\t\t\tif (value !== undefined) yield value\n\t\t\t}\n\t\t}\n\t\treturn iterator()\n\t}\n\n\ttoString(): string {\n\t\treturn `[Register length=${this.length}]`\n\t}\n\n\tat(index: number): T | undefined {\n\t\tconst resolved = index < 0 ? this.length + index : index\n\t\tif (resolved < 0 || resolved >= this.length) return undefined\n\t\treturn this[getAt](resolved)\n\t}\n\treverse(): this {\n\t\tthis.#keys.reverse()\n\t\treturn this\n\t}\n\tsort(compareFn?: ((a: T, b: T) => number) | undefined): this {\n\t\tconst fwdCompareFn = compareFn\n\t\t\t? (a: K, b: K) => compareFn(this.#values.get(a) as T, this.#values.get(b) as T)\n\t\t\t: undefined\n\t\tthis.#keys.sort(fwdCompareFn)\n\t\treturn this\n\t}\n\tfill(value: T, start = 0, end = this.length): this {\n\t\tconst values = this.toArray()\n\t\tvalues.fill(value, start, end)\n\t\tthis.rebuildFrom(values)\n\t\treturn this\n\t}\n\n\tcopyWithin(target: number, start: number, end?: number): this {\n\t\tconst values = this.toArray()\n\t\tvalues.copyWithin(target, start, end)\n\t\tthis.rebuildFrom(values)\n\t\treturn this\n\t}\n}\n\nexport type Register<T, K extends PropertyKey = PropertyKey> = RegisterClass<T, K> & T[]\nexport const Register = RegisterClass as new <T, K extends PropertyKey = PropertyKey>(\n\tkeyFn: KeyFunction<T, K>,\n\tinitial?: Iterable<T>\n) => Register<T, K>\n\nexport function register<T, K extends PropertyKey = PropertyKey>(\n\tkeyFn: KeyFunction<T, K>,\n\tinitial?: Iterable<T>\n): Register<T, K> {\n\treturn new RegisterClass(keyFn, initial) as Register<T, K>\n}\n","import { FoolProof } from '../utils'\nimport { setEffectName } from './debug'\nimport { getActiveEffect } from './effect-context'\nimport { effect, untracked } from './effects'\nimport { cleanedBy, cleanup } from './interface'\nimport { reactive } from './proxy'\nimport { Register } from './register'\nimport { type ProjectionContext, projectionInfo, type ScopedCallback } from './types'\n\n/**\n * Maps projection effects (item effects) to their projection context\n */\nexport const effectProjectionMetadata = new WeakMap<ScopedCallback, ProjectionContext>()\n\n/**\n * Returns the projection context of the currently running effect, if any.\n */\nexport function getActiveProjection(): ProjectionContext | undefined {\n\tconst active = getActiveEffect()\n\treturn active ? effectProjectionMetadata.get(active) : undefined\n}\n\n/* TODO\nIt seems to work and I feel like it's correct but I couldn't validate theoretically that `ascend`\nis the correct way to deal with nested effects.\n*/\n\ntype ProjectOldValue<Target> = Target extends readonly (infer Item)[]\n\t? Item\n\t: Target extends Map<any, infer Item>\n\t\t? Item\n\t\t: Target extends Record<PropertyKey, infer Item>\n\t\t\t? Item\n\t\t\t: unknown\n\nexport type ProjectAccess<SourceValue, Key, SourceType, Target> = {\n\treadonly key: Key\n\tget(): SourceValue\n\tset(value: SourceValue): boolean\n\treadonly source: SourceType\n\treadonly old?: ProjectOldValue<Target>\n\tvalue: SourceValue\n}\n\nexport type ProjectCallback<SourceValue, Key, Target extends object, SourceType, Result> = (\n\taccess: ProjectAccess<SourceValue, Key, SourceType, Target>,\n\ttarget: Target\n) => Result\n\nexport type ProjectResult<Target extends object> = Target & { [cleanup]: ScopedCallback }\n\nfunction defineAccessValue<Access extends { get(): unknown; set(value: unknown): boolean }>(\n\taccess: Access\n) {\n\tObject.defineProperty(access, 'value', {\n\t\tget: access.get,\n\t\tset: access.set,\n\t\tconfigurable: true,\n\t\tenumerable: true,\n\t})\n}\n\nfunction makeCleanup<Result extends object>(\n\ttarget: Result,\n\teffectMap: Map<unknown, ScopedCallback>,\n\tonDispose: () => void,\n\tmetadata?: any\n): ProjectResult<Result> {\n\tif (metadata) {\n\t\tObject.defineProperty(target, projectionInfo, {\n\t\t\tvalue: metadata,\n\t\t\twritable: false,\n\t\t\tenumerable: false,\n\t\t\tconfigurable: true,\n\t\t})\n\t}\n\treturn cleanedBy(target, () => {\n\t\tonDispose()\n\t\tfor (const stop of effectMap.values()) stop?.()\n\t\teffectMap.clear()\n\t}) as ProjectResult<Result>\n}\n\nfunction projectArray<SourceValue, ResultValue>(\n\tsource: readonly SourceValue[],\n\tapply: ProjectCallback<SourceValue, number, ResultValue[], readonly SourceValue[], ResultValue>\n): ProjectResult<ResultValue[]> {\n\tsource = reactive(source)\n\tconst target = reactive([] as ResultValue[])\n\tconst indexEffects = new Map<number, ScopedCallback>()\n\n\tfunction normalizeTargetLength(length: number) {\n\t\tFoolProof.set(target as unknown as object, 'length', length, target)\n\t}\n\n\tfunction disposeIndex(index: number) {\n\t\tconst stopEffect = indexEffects.get(index)\n\t\tif (stopEffect) {\n\t\t\tindexEffects.delete(index)\n\t\t\tstopEffect()\n\t\t\tReflect.deleteProperty(target as unknown as object, index)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupLength = effect(function projectArrayLengthEffect({ ascend }) {\n\t\tconst length = source.length\n\t\tnormalizeTargetLength(length)\n\t\tconst existing = Array.from(indexEffects.keys())\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tif (indexEffects.has(i)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst index = i\n\t\t\t\tconst stop = effect(function projectArrayIndexEffect() {\n\t\t\t\t\tconst previous = untracked(() => target[index])\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey: index,\n\t\t\t\t\t\tsource,\n\t\t\t\t\t\tget: () => FoolProof.get(source as any, index, source),\n\t\t\t\t\t\tset: (value: SourceValue) =>\n\t\t\t\t\t\t\tFoolProof.set(source as any, index, value, source),\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<SourceValue, number, readonly SourceValue[], ResultValue[]>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\ttarget[index] = produced\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${index}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource,\n\t\t\t\t\tkey: index,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tindexEffects.set(i, stop)\n\t\t\t})\n\t\t}\n\t\tfor (const index of existing) if (index >= length) disposeIndex(index)\n\t})\n\n\treturn makeCleanup(target, indexEffects, () => cleanupLength(), {\n\t\tsource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\nfunction projectRegister<Key extends PropertyKey, SourceValue, ResultValue>(\n\tsource: Register<SourceValue, Key>,\n\tapply: ProjectCallback<\n\t\tSourceValue,\n\t\tKey,\n\t\tMap<Key, ResultValue>,\n\t\tRegister<SourceValue, Key>,\n\t\tResultValue\n\t>\n): ProjectResult<Map<Key, ResultValue>> {\n\tconst observedSource = reactive(source) as Register<SourceValue, Key>\n\tconst rawTarget = new Map<Key, ResultValue>()\n\tconst target = reactive(rawTarget) as Map<Key, ResultValue>\n\tconst keyEffects = new Map<Key, ScopedCallback>()\n\n\tfunction disposeKey(key: Key) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tstopEffect()\n\t\t\tkeyEffects.delete(key)\n\t\t\ttarget.delete(key)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupKeys = effect(function projectRegisterEffect({ ascend }) {\n\t\tconst keys = new Set<Key>()\n\t\tfor (const key of observedSource.mapKeys()) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function projectRegisterKeyEffect() {\n\t\t\t\t\tconst previous = untracked(() => target.get(key))\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey,\n\t\t\t\t\t\tsource: observedSource,\n\t\t\t\t\t\tget: () => observedSource.get(key) as SourceValue,\n\t\t\t\t\t\tset: (value: SourceValue) => {\n\t\t\t\t\t\t\tobservedSource.set(key, value)\n\t\t\t\t\t\t\treturn true\n\t\t\t\t\t\t},\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<SourceValue, Key, Register<SourceValue, Key>, Map<Key, ResultValue>>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\ttarget.set(key, produced)\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${String(key)}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource: observedSource,\n\t\t\t\t\tkey,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn makeCleanup(target, keyEffects, () => cleanupKeys(), {\n\t\tsource: observedSource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\nfunction projectRecord<Source extends Record<PropertyKey, any>, ResultValue>(\n\tsource: Source,\n\tapply: ProjectCallback<\n\t\tSource[keyof Source],\n\t\tkeyof Source,\n\t\tRecord<keyof Source, ResultValue>,\n\t\tSource,\n\t\tResultValue\n\t>\n): ProjectResult<Record<keyof Source, ResultValue>> {\n\tconst observedSource = reactive(source) as Source\n\tconst target = reactive({} as Record<keyof Source, ResultValue>)\n\tconst keyEffects = new Map<PropertyKey, ScopedCallback>()\n\n\tfunction disposeKey(key: PropertyKey) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tstopEffect()\n\t\t\tkeyEffects.delete(key)\n\t\t\tReflect.deleteProperty(target as Record<PropertyKey, unknown>, key)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupKeys = effect(function projectRecordEffect({ ascend }) {\n\t\tconst keys = new Set<PropertyKey>()\n\t\tfor (const key in observedSource) keys.add(key)\n\t\tconst observed = Reflect.ownKeys(observedSource)\n\t\tfor (const key of observed) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function projectRecordKeyEffect() {\n\t\t\t\t\tconst sourceKey = key as keyof Source\n\t\t\t\t\tconst previous = untracked(\n\t\t\t\t\t\t() => (target as Record<PropertyKey, ResultValue | undefined>)[key]\n\t\t\t\t\t)\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey: sourceKey,\n\t\t\t\t\t\tsource: observedSource,\n\t\t\t\t\t\tget: () => FoolProof.get(observedSource, sourceKey, observedSource),\n\t\t\t\t\t\tset: (value: Source[typeof sourceKey]) =>\n\t\t\t\t\t\t\tFoolProof.set(observedSource, sourceKey, value, observedSource),\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<\n\t\t\t\t\t\tSource[typeof sourceKey],\n\t\t\t\t\t\tkeyof Source,\n\t\t\t\t\t\tSource,\n\t\t\t\t\t\tRecord<keyof Source, ResultValue>\n\t\t\t\t\t>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\t;(target as any)[sourceKey] = produced\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${String(key)}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource: observedSource,\n\t\t\t\t\tkey,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn makeCleanup(target, keyEffects, () => cleanupKeys(), {\n\t\tsource: observedSource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\nfunction projectMap<Key, Value, ResultValue>(\n\tsource: Map<Key, Value>,\n\tapply: ProjectCallback<Value, Key, Map<Key, ResultValue>, Map<Key, Value>, ResultValue>\n): ProjectResult<Map<Key, ResultValue>> {\n\tconst observedSource = reactive(source) as Map<Key, Value>\n\tconst rawTarget = new Map<Key, ResultValue>()\n\tconst target = reactive(rawTarget) as Map<Key, ResultValue>\n\tconst keyEffects = new Map<Key, ScopedCallback>()\n\n\tfunction disposeKey(key: Key) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tstopEffect()\n\t\t\tkeyEffects.delete(key)\n\t\t\ttarget.delete(key)\n\t\t}\n\t}\n\n\tconst parent = getActiveProjection()\n\tconst depth = parent ? parent.depth + 1 : 0\n\n\tconst cleanupKeys = effect(function projectMapEffect({ ascend }) {\n\t\tconst keys = new Set<Key>()\n\t\tfor (const key of observedSource.keys()) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function projectMapKeyEffect() {\n\t\t\t\t\tconst previous = untracked(() => target.get(key))\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey,\n\t\t\t\t\t\tsource: observedSource,\n\t\t\t\t\t\tget: () => observedSource.get(key) as Value,\n\t\t\t\t\t\tset: (value: Value) => {\n\t\t\t\t\t\t\tobservedSource.set(key, value)\n\t\t\t\t\t\t\treturn true\n\t\t\t\t\t\t},\n\t\t\t\t\t\told: previous,\n\t\t\t\t\t} as ProjectAccess<Value, Key, Map<Key, Value>, Map<Key, ResultValue>>\n\t\t\t\t\tdefineAccessValue(accessBase)\n\t\t\t\t\tconst produced = apply(accessBase, target)\n\t\t\t\t\ttarget.set(key, produced)\n\t\t\t\t})\n\t\t\t\tsetEffectName(stop, `project[${depth}]:${String(key)}`)\n\t\t\t\teffectProjectionMetadata.set(stop, {\n\t\t\t\t\tsource: observedSource,\n\t\t\t\t\tkey,\n\t\t\t\t\ttarget,\n\t\t\t\t\tdepth,\n\t\t\t\t\tparent,\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn makeCleanup(target, keyEffects, () => cleanupKeys(), {\n\t\tsource: observedSource,\n\t\ttarget,\n\t\tapply,\n\t\tdepth,\n\t\tparent,\n\t} as ProjectionContext)\n}\n\ntype ProjectOverload = {\n\t<SourceValue, ResultValue>(\n\t\tsource: readonly SourceValue[],\n\t\tapply: ProjectCallback<SourceValue, number, ResultValue[], readonly SourceValue[], ResultValue>\n\t): ProjectResult<ResultValue[]>\n\t<Key extends PropertyKey, SourceValue, ResultValue>(\n\t\tsource: Register<SourceValue, Key>,\n\t\tapply: ProjectCallback<\n\t\t\tSourceValue,\n\t\t\tKey,\n\t\t\tMap<Key, ResultValue>,\n\t\t\tRegister<SourceValue, Key>,\n\t\t\tResultValue\n\t\t>\n\t): ProjectResult<Map<Key, ResultValue>>\n\t<Source extends Record<PropertyKey, any>, ResultValue>(\n\t\tsource: Source,\n\t\tapply: ProjectCallback<\n\t\t\tSource[keyof Source],\n\t\t\tkeyof Source,\n\t\t\tRecord<keyof Source, ResultValue>,\n\t\t\tSource,\n\t\t\tResultValue\n\t\t>\n\t): ProjectResult<Record<keyof Source, ResultValue>>\n\t<Key, Value, ResultValue>(\n\t\tsource: Map<Key, Value>,\n\t\tapply: ProjectCallback<Value, Key, Map<Key, ResultValue>, Map<Key, Value>, ResultValue>\n\t): ProjectResult<Map<Key, ResultValue>>\n\tarray: typeof projectArray\n\tregister: typeof projectRegister\n\trecord: typeof projectRecord\n\tmap: typeof projectMap\n}\n\nfunction projectCore<SourceValue, ResultValue>(\n\tsource: readonly SourceValue[],\n\tapply: ProjectCallback<SourceValue, number, ResultValue[], readonly SourceValue[], ResultValue>\n): ProjectResult<ResultValue[]>\nfunction projectCore<Key extends PropertyKey, SourceValue, ResultValue>(\n\tsource: Register<SourceValue, Key>,\n\tapply: ProjectCallback<\n\t\tSourceValue,\n\t\tKey,\n\t\tMap<Key, ResultValue>,\n\t\tRegister<SourceValue, Key>,\n\t\tResultValue\n\t>\n): ProjectResult<Map<Key, ResultValue>>\nfunction projectCore<Source extends Record<PropertyKey, any>, ResultValue>(\n\tsource: Source,\n\tapply: ProjectCallback<\n\t\tSource[keyof Source],\n\t\tkeyof Source,\n\t\tRecord<keyof Source, ResultValue>,\n\t\tSource,\n\t\tResultValue\n\t>\n): ProjectResult<Record<keyof Source, ResultValue>>\nfunction projectCore<Key, Value, ResultValue>(\n\tsource: Map<Key, Value>,\n\tapply: ProjectCallback<Value, Key, Map<Key, ResultValue>, Map<Key, Value>, ResultValue>\n): ProjectResult<Map<Key, ResultValue>>\nfunction projectCore(source: any, apply: any): ProjectResult<any> {\n\tif (Array.isArray(source)) return projectArray(source, apply)\n\tif (source instanceof Map) return projectMap(source, apply)\n\tif (source instanceof Register) return projectRegister(source, apply)\n\tif (source && (source.constructor === Object || source.constructor === undefined))\n\t\treturn projectRecord(source, apply)\n\tthrow new Error('Unsupported source type')\n}\n\nexport const project: ProjectOverload = Object.assign(projectCore, {\n\tarray: projectArray,\n\tregister: projectRegister,\n\trecord: projectRecord,\n\tmap: projectMap,\n})\n","import { FoolProof } from '../utils'\nimport { touched } from './change'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './non-reactive'\nimport { reactive } from './proxy'\nimport { unwrap } from './proxy-state'\nimport { dependant } from './tracking'\n\nfunction* index(i: number, { length = true } = {}): IterableIterator<number | 'length'> {\n\tif (length) yield 'length'\n\tyield i\n}\n\nfunction* range(\n\ta: number,\n\tb: number,\n\t{ length = false } = {}\n): IterableIterator<number | 'length'> {\n\tconst start = Math.min(a, b)\n\tconst end = Math.max(a, b)\n\tif (length) yield 'length'\n\tfor (let i = start; i <= end; i++) yield 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\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\tgetLength() {\n\t\tdependant(this, 'length')\n\t\treturn this.length\n\t}\n\tsetLength(value: number) {\n\t\tconst oldLength = this.length\n\t\ttry {\n\t\t\tthis.length = value\n\t\t} finally {\n\t\t\ttouched(this, { type: 'set', prop: 'length' }, range(oldLength, value, { length: true }))\n\t\t}\n\t}\n}\nconst indexLess = { get: FoolProof.get, set: FoolProof.set }\nObject.assign(FoolProof, {\n\tget(obj: any, prop: any, receiver: any) {\n\t\tif (obj instanceof Array && typeof prop === 'string') {\n\t\t\tif (prop === 'length') return Indexer.prototype.getLength.call(obj)\n\t\t\tconst index = parseInt(prop)\n\t\t\tif (!Number.isNaN(index)) return Indexer.prototype.get.call(obj, index)\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 (obj instanceof Array && typeof prop === 'string') {\n\t\t\tif (prop === 'length') return Indexer.prototype.setLength.call(obj, value)\n\t\t\tconst index = parseInt(prop)\n\t\t\tif (!Number.isNaN(index)) return Indexer.prototype.set.call(obj, index, 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\tget [Symbol.toStringTag]() {\n\t\treturn 'ReactiveArray'\n\t}\n\t// Safe array access with negative indices\n\tat(index: number): any {\n\t\tconst actualIndex = index < 0 ? this.length + index : index\n\t\tdependant(this, actualIndex)\n\t\tif (index < 0) dependant(this, 'length')\n\t\tif (actualIndex < 0 || actualIndex >= this.length) return undefined\n\t\treturn reactive(this[actualIndex])\n\t}\n\n\t// Immutable versions of mutator methods\n\ttoReversed(): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this.toReversed())\n\t}\n\n\ttoSorted(compareFn?: (a: any, b: any) => number): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this.toSorted(compareFn))\n\t}\n\n\ttoSpliced(start: number, deleteCount?: number, ...items: any[]): any[] {\n\t\tdependant(this)\n\t\treturn deleteCount === undefined\n\t\t\t? this.toSpliced(start)\n\t\t\t: this.toSpliced(start, deleteCount, ...items)\n\t}\n\n\twith(index: number, value: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this.with(index, value))\n\t}\n\n\t// Iterator methods with reactivity tracking\n\tentries() {\n\t\tdependant(this)\n\t\treturn makeReactiveEntriesIterator(this.entries())\n\t}\n\n\tkeys() {\n\t\tdependant(this, 'length')\n\t\treturn this.keys()\n\t}\n\n\tvalues() {\n\t\tdependant(this)\n\t\treturn makeReactiveIterator(this.values())\n\t}\n\n\t[Symbol.iterator](): ArrayIterator<any> {\n\t\tdependant(this)\n\t\tconst nativeIterator = this[Symbol.iterator]()\n\t\treturn {\n\t\t\tnext() {\n\t\t\t\tconst result = nativeIterator.next()\n\t\t\t\tif (result.done) {\n\t\t\t\t\treturn result\n\t\t\t\t}\n\t\t\t\treturn { value: reactive(result.value), done: false }\n\t\t\t},\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn this\n\t\t\t},\n\t\t\t[Symbol.dispose]() {},\n\t\t} as any\n\t}\n\n\tindexOf(searchElement: any, fromIndex?: number): number {\n\t\tconst length = this.length\n\t\tlet i = fromIndex === undefined ? 0 : fromIndex\n\t\tif (i < 0) i = Math.max(length + i, 0)\n\t\t\n\t\tconst unwrappedSearch = unwrap(searchElement)\n\n\t\tfor (; i < length; i++) {\n\t\t\tdependant(this, i)\n\t\t\tconst item = this[i]\n\t\t\tif (item === searchElement || item === unwrappedSearch || unwrap(item) === unwrappedSearch) {\n\t\t\t\treturn i\n\t\t\t}\n\t\t}\n\n\t\tdependant(this, 'length')\n\t\treturn -1\n\t}\n\n\tlastIndexOf(searchElement: any, fromIndex?: number): number {\n\t\tconst length = this.length\n\t\tlet i = fromIndex === undefined ? length - 1 : fromIndex\n\t\tif (i >= length) i = length - 1\n\t\tif (i < 0) i = Math.max(length + i, -1) // -1 ensures loop condition i >= 0 works correctly\n\n\t\tconst unwrappedSearch = unwrap(searchElement)\n\n\t\tfor (; i >= 0; i--) {\n\t\t\tdependant(this, i)\n\t\t\tconst item = this[i]\n\t\t\tif (item === searchElement || item === unwrappedSearch || unwrap(item) === unwrappedSearch) {\n\t\t\t\treturn i\n\t\t\t}\n\t\t}\n\n\t\t// If we scanned the whole relevant part and didn't find it, we depend on length \n\t\t// (because adding elements might shift indices or add the element)\n\t\t// Actually for lastIndexOf, if we start from end, length dependency is implicit in the start index calculation?\n\t\t// But if we return -1, it means we didn't find it.\n\t\t// If we push an element, should lastIndexOf update?\n\t\t// Yes, if the new element is the one we are looking for.\n\t\tdependant(this, 'length')\n\t\treturn -1\n\t}\n\n\tincludes(searchElement: any, fromIndex?: number): boolean {\n\t\treturn this.indexOf(searchElement, fromIndex) !== -1\n\t}\n\n\tfind(predicate: (this: any, value: any, index: number, obj: any[]) => boolean, thisArg?: any): any\n\tfind(searchElement: any, fromIndex?: number): any\n\tfind(predicateOrElement: any, thisArg?: any): any {\n\t\tif (typeof predicateOrElement === 'function') {\n\t\t\tconst predicate = predicateOrElement as (\n\t\t\t\tthis: any,\n\t\t\t\tvalue: any,\n\t\t\t\tindex: number,\n\t\t\t\tobj: any[]\n\t\t\t) => boolean\n\t\t\tconst length = this.length\n\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tdependant(this, i)\n\t\t\t\tconst val = reactive(this[i])\n\t\t\t\tif (predicate.call(thisArg, val, i, this)) {\n\t\t\t\t\treturn val\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdependant(this, 'length')\n\t\t\treturn undefined\n\t\t}\n\t\tconst fromIndex = typeof thisArg === 'number' ? thisArg : undefined\n\t\tconst index = this.indexOf(predicateOrElement, fromIndex)\n\t\tif (index === -1) return undefined\n\t\treturn reactive(this[index])\n\t}\n\n\tfindIndex(\n\t\tpredicate: (this: any, value: any, index: number, obj: any[]) => boolean,\n\t\tthisArg?: any\n\t): number\n\tfindIndex(searchElement: any, fromIndex?: number): number\n\tfindIndex(predicateOrElement: any, thisArg?: any): number {\n\t\tif (typeof predicateOrElement === 'function') {\n\t\t\tconst predicate = predicateOrElement as (\n\t\t\t\tthis: any,\n\t\t\t\tvalue: any,\n\t\t\t\tindex: number,\n\t\t\t\tobj: any[]\n\t\t\t) => boolean\n\t\t\tconst length = this.length\n\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tdependant(this, i)\n\t\t\t\tconst val = reactive(this[i])\n\t\t\t\tif (predicate.call(thisArg, val, i, this)) {\n\t\t\t\t\treturn i\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdependant(this, 'length')\n\t\t\treturn -1\n\t\t}\n\t\tconst fromIndex = typeof thisArg === 'number' ? thisArg : undefined\n\t\treturn this.indexOf(predicateOrElement, fromIndex)\n\t}\n\n\tflat(depth?: number): any[] {\n\t\tdependant(this)\n\t\treturn reactive(depth === undefined ? this.flat() : this.flat(depth))\n\t}\n\n\tflatMap(\n\t\tcallbackfn: (this: any, value: any, index: number, array: any[]) => any[],\n\t\tthisArg?: any\n\t): any[] {\n\t\tdependant(this)\n\t\treturn reactive(\n\t\t\tthis.flatMap(\n\t\t\t\t(item, index, array) => callbackfn.call(thisArg, reactive(item), index, array),\n\t\t\t\tthisArg\n\t\t\t)\n\t\t)\n\t}\n\n\tfilter(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(\n\t\t\tthis.filter((item, index, array) => callbackfn(reactive(item), index, array), thisArg)\n\t\t)\n\t}\n\n\tmap(callbackfn: (value: any, index: number, array: any[]) => any, thisArg?: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(\n\t\t\tthis.map((item, index, array) => callbackfn(reactive(item), index, array), thisArg)\n\t\t)\n\t}\n\n\treduce(\n\t\tcallbackfn: (previousValue: any, currentValue: any, currentIndex: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\tdependant(this)\n\t\tconst result =\n\t\t\tinitialValue === undefined\n\t\t\t\t? this.reduce(callbackfn as any)\n\t\t\t\t: this.reduce(callbackfn as any, initialValue)\n\t\treturn reactive(result)\n\t}\n\n\treduceRight(\n\t\tcallbackfn: (previousValue: any, currentValue: any, currentIndex: number, array: any[]) => any,\n\t\tinitialValue?: any\n\t): any {\n\t\tdependant(this)\n\t\tconst result =\n\t\t\tinitialValue !== undefined\n\t\t\t\t? this.reduceRight(callbackfn as any, initialValue)\n\t\t\t\t: (this as any).reduceRight(callbackfn as any)\n\t\treturn reactive(result)\n\t}\n\n\tslice(start?: number, end?: number): any[] {\n\t\tfor (const i of range(start || 0, end || this.length - 1)) dependant(this, i)\n\t\treturn start === undefined\n\t\t\t? this.slice()\n\t\t\t: end === undefined\n\t\t\t\t? this.slice(start)\n\t\t\t\t: this.slice(start, end)\n\t}\n\n\tconcat(...items: any[]): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this.concat(...items))\n\t}\n\n\tjoin(separator?: string): string {\n\t\tdependant(this)\n\t\treturn this.join(separator as any)\n\t}\n\n\tforEach(callbackfn: (value: any, index: number, array: any[]) => void, thisArg?: any): void {\n\t\tdependant(this)\n\t\tthis.forEach((value, index, array) => {\n\t\t\tcallbackfn.call(thisArg, reactive(value), index, array)\n\t\t})\n\t}\n\n\t// no need to make it dependant on indexes after the found one\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(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): boolean\n\tevery(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): boolean {\n\t\tconst length = this.length\n\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tdependant(this, i)\n\t\t\tif (!callbackfn.call(thisArg, reactive(this[i]), i, this)) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\n\t\tdependant(this, 'length')\n\t\treturn true\n\t}\n\n\tsome(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): boolean {\n\t\tconst length = this.length\n\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tdependant(this, i)\n\t\t\tif (callbackfn.call(thisArg, reactive(this[i]), i, this)) {\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\n\t\tdependant(this, 'length')\n\t\treturn false\n\t}\n\t// Side-effectful\n\tpush(...items: any[]) {\n\t\tconst oldLength = this.length\n\t\ttry {\n\t\t\treturn this.push(...items)\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'push' },\n\t\t\t\trange(oldLength, oldLength + items.length - 1, { length: true })\n\t\t\t)\n\t\t}\n\t}\n\n\tpop() {\n\t\tif (this.length === 0) return undefined\n\t\ttry {\n\t\t\treturn reactive(this.pop())\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'pop' }, index(this.length))\n\t\t}\n\t}\n\n\tshift() {\n\t\tif (this.length === 0) return undefined\n\t\ttry {\n\t\t\treturn reactive(this.shift())\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'shift' }, range(0, this.length + 1, { length: true }))\n\t\t}\n\t}\n\n\tunshift(...items: any[]) {\n\t\ttry {\n\t\t\treturn this.unshift(...items)\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'unshift' },\n\t\t\t\trange(0, this.length - items.length, { length: true })\n\t\t\t)\n\t\t}\n\t}\n\n\tsplice(start: number, deleteCount?: number, ...items: any[]) {\n\t\tconst oldLength = this.length\n\n\t\t// Normalize start index\n\t\tlet actualStart = start\n\t\tif (actualStart < 0) actualStart = Math.max(oldLength + actualStart, 0)\n\t\telse actualStart = Math.min(actualStart, oldLength)\n\n\t\t// Normalize deleteCount\n\t\tlet actualDeleteCount = deleteCount\n\t\tif (actualDeleteCount === undefined) {\n\t\t\tactualDeleteCount = oldLength - actualStart\n\t\t} else {\n\t\t\tactualDeleteCount = Math.max(0, Math.min(actualDeleteCount, oldLength - actualStart))\n\t\t}\n\n\t\ttry {\n\t\t\tif (deleteCount === undefined) return reactive(this.splice(start))\n\t\t\treturn reactive(this.splice(start, deleteCount, ...items))\n\t\t} finally {\n\t\t\ttouched(\n\t\t\t\tthis,\n\t\t\t\t{ type: 'bunch', method: 'splice' },\n\t\t\t\tactualDeleteCount === items.length\n\t\t\t\t\t? range(actualStart, actualStart + actualDeleteCount - 1)\n\t\t\t\t\t: range(actualStart, oldLength + Math.max(items.length - actualDeleteCount, 0), {\n\t\t\t\t\t\t\tlength: true,\n\t\t\t\t\t\t})\n\t\t\t)\n\t\t}\n\t}\n\n\treverse() {\n\t\ttry {\n\t\t\treturn this.reverse()\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'reverse' }, range(0, this.length - 1))\n\t\t}\n\t}\n\n\tsort(compareFn?: (a: any, b: any) => number) {\n\t\tcompareFn = compareFn || ((a, b) => a.toString().localeCompare(b.toString()))\n\t\ttry {\n\t\t\treturn this.sort((a, b) => compareFn(reactive(a), reactive(b))) as any\n\t\t} finally {\n\t\t\ttouched(this, { type: 'bunch', method: 'sort' }, range(0, this.length - 1))\n\t\t}\n\t}\n\n\tfill(value: any, start?: number, end?: number) {\n\t\tconst len = this.length\n\t\tlet k = start === undefined ? 0 : start\n\t\tif (k < 0) k = Math.max(len + k, 0)\n\t\telse k = Math.min(k, len)\n\n\t\tlet final = end === undefined ? len : end\n\t\tif (final < 0) final = Math.max(len + final, 0)\n\t\telse final = Math.min(final, len)\n\n\t\ttry {\n\t\t\tif (start === undefined) return this.fill(value) as any\n\t\t\tif (end === undefined) return this.fill(value, start) as any\n\t\t\treturn this.fill(value, start, end) as any\n\t\t} finally {\n\t\t\tif (final > k) {\n\t\t\t\ttouched(this, { type: 'bunch', method: 'fill' }, range(k, final - 1))\n\t\t\t}\n\t\t}\n\t}\n\n\tcopyWithin(target: number, start: number, end?: number) {\n\t\ttry {\n\t\t\tif (end === undefined) return this.copyWithin(target, start) as any\n\t\t\treturn this.copyWithin(target, start, end) as any\n\t\t} finally {\n\t\t\tconst len = this.length\n\n\t\t\tlet to = target\n\t\t\tif (to < 0) to = Math.max(len + to, 0)\n\t\t\telse if (to >= len) to = len\n\n\t\t\tlet from = start\n\t\t\tif (from < 0) from = Math.max(len + from, 0)\n\t\t\telse if (from >= len) from = len\n\n\t\t\tlet final = end === undefined ? len : end\n\t\t\tif (final < 0) final = Math.max(len + final, 0)\n\t\t\telse if (final >= len) final = len\n\n\t\t\tconst count = Math.min(final - from, len - to)\n\n\t\t\tif (count > 0) {\n\t\t\t\ttouched(\n\t\t\t\t\tthis,\n\t\t\t\t\t{ type: 'bunch', method: 'copyWithin' },\n\t\t\t\t\trange(to, to + count - 1)\n\t\t\t\t)\n\t\t\t}\n\n\t\t}\n\t}\n}\n","import { contentRef } from '../utils'\nimport { touched, touched1 } from './change'\nimport { notifyPropertyChange } from './deep-touch'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './non-reactive'\nimport { reactive } from './proxy'\nimport { dependant } from './tracking'\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\tget [Symbol.toStringTag]() {\n\t\treturn 'ReactiveWeakMap'\n\t}\n\n\t// Implement WeakMap interface methods with reactivity\n\tdelete(key: K): boolean {\n\t\tconst hadKey = this.has(key)\n\t\tconst result = this.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(this.get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(contentRef(this), key)\n\t\treturn this.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\tget [Symbol.toStringTag]() {\n\t\treturn 'ReactiveMap'\n\t}\n\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 this.size\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this.size > 0\n\t\tthis.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\ttouched1(this, evolution, 'size')\n\t\t\ttouched(contentRef(this), evolution)\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))\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 nativeIterator = this[Symbol.iterator]()\n\t\treturn {\n\t\t\tnext() {\n\t\t\t\tconst result = nativeIterator.next()\n\t\t\t\tif (result.done) {\n\t\t\t\t\treturn result\n\t\t\t\t}\n\t\t\t\treturn {\n\t\t\t\t\tvalue: [result.value[0], reactive(result.value[1])],\n\t\t\t\t\tdone: false,\n\t\t\t\t}\n\t\t\t},\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn this\n\t\t\t},\n\t\t\t[Symbol.dispose]() {},\n\t\t} as any // TODO: real iterator? (If easy)\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 = this.delete(key)\n\n\t\tif (hadKey) {\n\t\t\tconst evolution = { type: 'del', prop: key } as const\n\t\t\ttouched1(contentRef(this), evolution, key)\n\t\t\ttouched1(this, evolution, 'size')\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(this.get(key))\n\t}\n\n\thas(key: K): boolean {\n\t\tdependant(contentRef(this), key)\n\t\treturn this.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\t// Also notify size change for Map (WeakMap doesn't track size)\n\t\t\tconst evolution = { type: hadKey ? 'set' : 'add', prop: key } as const\n\t\t\ttouched1(this, evolution, 'size')\n\t\t}\n\n\t\treturn this\n\t}\n}\n","import { contentRef } from '../utils'\nimport { touched, touched1 } from './change'\nimport { makeReactiveEntriesIterator, makeReactiveIterator } from './non-reactive'\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\tget [Symbol.toStringTag]() {\n\t\treturn 'ReactiveWeakSet'\n\t}\n\tadd(value: T): this {\n\t\tconst had = this.has(value)\n\t\tthis.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 = this.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 this.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 [Symbol.toStringTag]() {\n\t\treturn 'ReactiveSet'\n\t}\n\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\tthis.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\ttouched1(contentRef(this), evolution, reactiveValue)\n\t\t\ttouched1(this, evolution, 'size')\n\t\t}\n\t\treturn this\n\t}\n\n\tclear(): void {\n\t\tconst hadEntries = this.size > 0\n\t\tthis.clear()\n\t\tif (hadEntries) {\n\t\t\tconst evolution = { type: 'bunch', method: 'clear' } as const\n\t\t\ttouched1(this, evolution, 'size')\n\t\t\ttouched(contentRef(this), evolution)\n\t\t}\n\t}\n\n\tdelete(value: T): boolean {\n\t\tconst had = this.has(value)\n\t\tconst res = this.delete(value)\n\t\tif (had) {\n\t\t\tconst evolution = { type: 'del', prop: value } as const\n\t\t\ttouched1(contentRef(this), evolution, value)\n\t\t\ttouched1(this, evolution, 'size')\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 nativeIterator = this[Symbol.iterator]()\n\t\treturn {\n\t\t\tnext() {\n\t\t\t\tconst result = nativeIterator.next()\n\t\t\t\tif (result.done) {\n\t\t\t\t\treturn result\n\t\t\t\t}\n\t\t\t\treturn { value: reactive(result.value), done: false }\n\t\t\t},\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn this\n\t\t\t},\n\t\t\t[Symbol.dispose]() {},\n\t\t} as any\t//TODO? (something easy)\n\t}\n}\n","export { getState, touched, touched1 } from './change'\nexport type { ReactivityGraph } from './debug'\nexport {\n\tbuildReactivityGraph,\n\tenableDevTools,\n\tisDevtoolsEnabled,\n\tregisterEffectForDebug,\n\tregisterObjectForDebug,\n\tsetEffectName,\n\tsetObjectName,\n} from './debug'\nexport { deepWatch } from './deep-watch'\nexport {\n\taddBatchCleanup,\n\tatomic,\n\tbiDi,\n\tdefer,\n\teffect,\n\tgetActivationLog,\n\troot,\n\ttrackEffect,\n\tuntracked,\n} from './effects'\nexport { cleanedBy, cleanup, derived, unreactive, watch } from './interface'\nexport { type Memoizable, memoize } from './memoize'\nexport { immutables, isNonReactive, registerNativeReactivity } from './non-reactive'\nexport { getActiveProjection, project } from './project'\nexport { isReactive, ReactiveBase, reactive, unwrap } from './proxy'\nexport { organize, organized } from './record'\nexport { scan, type ScanResult, resolve } from './buffer'\nexport { Register, register } from './register'\nexport { getActiveEffect, effectAggregator } from './effect-context'\nexport {\n\ttype DependencyAccess,\n\ttype Evolution,\n\toptions as reactiveOptions,\n\tReactiveError,\n\tReactiveErrorCode,\n\ttype ScopedCallback,\n} from './types'\n\nimport { ReactiveArray } from './array'\nimport {\n\tdeepWatchers,\n\teffectToDeepWatchedObjects,\n\tobjectParents,\n\tobjectsWithDeepWatchers,\n} from './deep-watch'\nimport { ReactiveMap, ReactiveWeakMap } from './map'\nimport { nonReactiveObjects } from './non-reactive-state'\nimport { metaProtos, objectToProxy, proxyToObject } from './proxy'\nimport { effectToReactiveObjects, watchers } from './registry'\nimport { ReactiveSet, ReactiveWeakSet } from './set'\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)\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\tnonReactiveObjects,\n}\n","import { decorator, type GenericClassDecorator } from './decorator'\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 function describe(descriptor: {\n\tenumerable?: boolean\n\tconfigurable?: boolean // Not modifiable once the property has been defined ?\n\twritable?: boolean\n}) {\n\treturn <T>(...properties: (keyof T)[]): GenericClassDecorator<T> =>\n\t\t(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\tObject.defineProperty(this, key, {\n\t\t\t\t\t\t\t...Object.getOwnPropertyDescriptor(this, key),\n\t\t\t\t\t\t\t...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\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\t// biome-ignore lint/suspicious/noConsole: To be overridden\n\t\t\tconsole.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 './decorator'\nexport * from './destroyable'\nexport * from './eventful'\nexport * from './indexable'\nexport * from './iterableWeak'\nexport * from './mixins'\nexport * from './promiseChain'\nexport * from './reactive'\nexport * from './std-decorators'\nexport * from './utils'\nexport * from './zone'\nexport * from './async'\n\nimport pkg from '../package.json'\n\nconst { version } = pkg\n\n// Singleton verification\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\t// Detect the source of this instance safely across different environments\n\tlet source = 'mutts/index'\n\tconst viteEval = eval\n\ttry {\n\t\t// @ts-ignore\n\t\tif (typeof __filename !== 'undefined') source = __filename\n\t\telse {\n\t\t\t// Using eval to avoid SyntaxError in CJS environments where import.meta is not allowed\n\t\t\tconst meta = viteEval('import.meta')\n\t\t\tif (meta && meta.url) source = meta.url\n\t\t}\n\t} catch (e) {\n\t\t// Fallback for environments where neither is available or accessible\n\t}\n\n\tconst currentSourceInfo = {\n\t\tversion,\n\t\tsource,\n\t\ttimestamp: Date.now(),\n\t}\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\n\tglobalScope[GLOBAL_MUTTS_KEY] = currentSourceInfo\n}\n","/**\n * Base type for event maps - all event handlers must be functions\n */\nexport type EventsBase = Record<string, (...args: any[]) => void>\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\treadonly #events = new Map<keyof Events, ((...args: any[]) => void)[]>()\n\treadonly #hooks = [] as ((...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\tif (!this.#hooks.includes(cb)) this.#hooks.push(cb)\n\t\treturn () => {\n\t\t\tthis.#hooks.splice(this.#hooks.indexOf(cb), 1)\n\t\t}\n\t}\n\n\tpublic on(events: Partial<Events>): void\n\tpublic on<EventType extends keyof Events>(event: EventType, cb: Events[EventType]): () => void\n\tpublic on<EventType extends keyof Events>(\n\t\teventOrEvents: EventType | Partial<Events>,\n\t\tcb?: Events[EventType]\n\t): () => void {\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof Events)[]) {\n\t\t\t\tthis.on(e, eventOrEvents[e]!)\n\t\t\t}\n\t\t} else if (cb !== undefined) {\n\t\t\tlet callbacks = this.#events.get(eventOrEvents)\n\t\t\tif (!callbacks) {\n\t\t\t\tcallbacks = []\n\t\t\t\tthis.#events.set(eventOrEvents, callbacks)\n\t\t\t}\n\t\t\tcallbacks.push(cb)\n\t\t}\n\t\t// @ts-expect-error Generic case leads to generic case\n\t\treturn () => this.off(eventOrEvents, cb)\n\t}\n\tpublic off(events: Partial<Events>): void\n\tpublic off<EventType extends keyof Events>(event: EventType, cb?: Events[EventType]): void\n\tpublic off<EventType extends keyof Events>(\n\t\teventOrEvents: EventType | Partial<Events>,\n\t\tcb?: Events[EventType]\n\t): void {\n\t\tif (typeof eventOrEvents === 'object') {\n\t\t\tfor (const e of Object.keys(eventOrEvents) as (keyof Events)[]) {\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\tthis.#events.set(\n\t\t\t\t\teventOrEvents,\n\t\t\t\t\tcallbacks.filter((c) => c !== cb)\n\t\t\t\t)\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\tpublic emit<EventType extends keyof Events>(\n\t\tevent: EventType,\n\t\t...args: Parameters<Events[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","import { FoolProof } from '../utils'\nimport { touched1 } from './change'\nimport { effect } from './effects'\nimport { cleanedBy, cleanup } from './interface'\nimport { reactive } from './proxy'\nimport { type ScopedCallback } 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) => ScopedCallback | 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\t/**\n\t * Cleanup function to dispose of all reactive bindings created by organized().\n\t * This is automatically called when the effect that created the organized binding is disposed.\n\t */\n\t[cleanup]: ScopedCallback\n}\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\tconst keyEffects = new Map<PropertyKey, ScopedCallback>()\n\n\tfunction disposeKey(key: PropertyKey) {\n\t\tconst stopEffect = keyEffects.get(key)\n\t\tif (stopEffect) {\n\t\t\tkeyEffects.delete(key)\n\t\t\tstopEffect()\n\t\t}\n\t}\n\n\tconst cleanupKeys = effect(function organizedKeysEffect({ ascend }) {\n\t\t//const keys = Reflect.ownKeys(observedSource) as PropertyKey[]\n\t\tconst keys = new Set<PropertyKey>()\n\t\tfor (const key in observedSource) keys.add(key)\n\n\t\tfor (const key of keys) {\n\t\t\tif (keyEffects.has(key)) continue\n\t\t\tascend(() => {\n\t\t\t\tconst stop = effect(function organizedKeyEffect() {\n\t\t\t\t\tconst sourceKey = key as keyof Source\n\t\t\t\t\tconst accessBase = {\n\t\t\t\t\t\tkey: sourceKey,\n\t\t\t\t\t\tget: () => FoolProof.get(observedSource, sourceKey, observedSource),\n\t\t\t\t\t\tset: (value: Source[typeof sourceKey]) =>\n\t\t\t\t\t\t\tFoolProof.set(observedSource, sourceKey, value, observedSource),\n\t\t\t\t\t}\n\t\t\t\t\tObject.defineProperty(accessBase, 'value', {\n\t\t\t\t\t\tget: accessBase.get,\n\t\t\t\t\t\tset: accessBase.set,\n\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\tenumerable: true,\n\t\t\t\t\t})\n\t\t\t\t\treturn apply(accessBase as OrganizedAccess<Source, typeof sourceKey>, target)\n\t\t\t\t})\n\t\t\t\tkeyEffects.set(key, stop)\n\t\t\t})\n\t\t}\n\n\t\tfor (const key of Array.from(keyEffects.keys())) if (!keys.has(key)) disposeKey(key)\n\t})\n\n\treturn cleanedBy(target, () => {\n\t\tcleanupKeys()\n\t\tfor (const key of Array.from(keyEffects.keys())) disposeKey(key)\n\t}) 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","import { FoolProof } from '../utils'\nimport { effect, untracked } from './effects'\nimport { cleanedBy, cleanup } from './interface'\nimport { memoize } from './memoize'\nimport { reactive } from './proxy'\nimport type { ScopedCallback } from './types'\n\n/**\n * Result of a reactive scan, which is a reactive array of accumulated values\n * with an attached cleanup function.\n */\nexport type ScanResult<Output> = readonly Output[] & { [cleanup]: ScopedCallback }\n\n/**\n * Perform a reactive scan over an array of items.\n *\n * This implementation is highly optimized for performance and fine-grained reactivity:\n * - **Incremental Updates**: Changes to an item only trigger re-computation from that \n *   point onwards in the result chain.\n * - **Move Optimization**: If items are moved within the array, their accumulated \n *   values are reused as long as their predecessor remains the same.\n * - **Duplicate Support**: Correctly handles multiple occurrences of the same object \n *   instance using an internal occurrence tracking mechanism.\n * - **Memory Efficient**: Uses `WeakMap` for caching intermediates, which are \n *   automatically cleared when source items are garbage collected.\n *\n * @example\n * ```typescript\n * const source = reactive([{ val: 1 }, { val: 2 }, { val: 3 }])\n * const sum = scan(source, (acc, item) => acc + item.val, 0)\n * \n * expect([...sum]).toEqual([1, 3, 6])\n * \n * // Modifying an item only re-computes subsequent sums\n * source[1].val = 10\n * expect([...sum]).toEqual([1, 11, 14])\n * ```\n *\n * @param source The source array of objects (will be made reactive)\n * @param callback The accumulator function called with (accumulator, currentItem)\n * @param initialValue The starting value for the accumulation\n * @returns A reactive array of accumulated values, with a [cleanup] property to stop the tracking\n */\nexport function scan<Input extends object, Output>(\n\tsource: readonly Input[],\n\tcallback: (acc: Output, val: Input) => Output,\n\tinitialValue: Output\n): ScanResult<Output> {\n\tconst observedSource = reactive(source)\n\tconst result = reactive([] as Output[])\n\t\n\t// Track effects for each index to dispose them when the array shrinks\n\tconst indexEffects = new Map<number, ScopedCallback>()\n\t// Mapping from index to its current intermediate object\n\tconst indexToIntermediate = reactive([] as Intermediate[])\n\tconst intermediaries = new WeakMap<Input, Intermediate[]>()\n\n\tclass Intermediate {\n\t\tpublic prev: Intermediate | undefined\n\t\tconstructor(public val: Input, prev: Intermediate | undefined) {\n\t\t\tthis.prev = prev\n\t\t}\n\n\t\t@memoize\n\t\tget acc(): Output {\n\t\t\tconst prevAcc = this.prev ? this.prev.acc : initialValue\n\t\t\treturn callback(prevAcc, this.val)\n\t\t}\n\t}\n\n\tfunction disposeIndex(index: number) {\n\t\tconst stop = indexEffects.get(index)\n\t\tif (stop) {\n\t\t\tstop()\n\t\t\tindexEffects.delete(index)\n\t\t\tuntracked(() => {\n\t\t\t\tReflect.deleteProperty(indexToIntermediate as any, index)\n\t\t\t\tReflect.deleteProperty(result as any, index)\n\t\t\t})\n\t\t}\n\t}\n\n\tconst mainEffect = effect(function scanMainEffect({ ascend }) {\n\t\tconst length = observedSource.length\n\t\tconst occurrenceCount = new Map<Input, number>()\n\t\tlet prev: Intermediate | undefined = undefined\n\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tconst val = FoolProof.get(observedSource as any, i, observedSource) as Input\n\t\t\t\n\t\t\tif (!(val && (typeof val === 'object' || typeof val === 'function' || typeof val === 'symbol'))) {\n\t\t\t\tthrow new Error('scan: items must be objects (WeakKey) for intermediate caching')\n\t\t\t}\n\n\t\t\tconst count = occurrenceCount.get(val) ?? 0\n\t\t\toccurrenceCount.set(val, count + 1)\n\n\t\t\tlet list = intermediaries.get(val)\n\t\t\tif (!list) {\n\t\t\t\tlist = []\n\t\t\t\tintermediaries.set(val, list)\n\t\t\t}\n\n\t\t\tlet intermediate = list[count]\n\t\t\tif (!intermediate) {\n\t\t\t\tintermediate = reactive(new Intermediate(val, prev))\n\t\t\t\tlist[count] = intermediate\n\t\t\t} else {\n\t\t\t\t// Update the link. \n\t\t\t\tif (untracked(() => intermediate.prev) !== prev) {\n\t\t\t\t\tintermediate.prev = prev\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Update the reactive mapping for this index\n\t\t\tif (indexToIntermediate[i] !== intermediate) {\n\t\t\t\tindexToIntermediate[i] = intermediate\n\t\t\t}\n\n\t\t\t// If we don't have an effect for this index yet, create one\n\t\t\tif (!indexEffects.has(i)) {\n\t\t\t\tascend(() => {\n\t\t\t\t\tconst index = i\n\t\t\t\t\tconst stop = effect(function scanIndexSyncEffect() {\n\t\t\t\t\t\tconst inter = indexToIntermediate[index]\n\t\t\t\t\t\tif (inter) {\n\t\t\t\t\t\t\tconst accValue = inter.acc\n\t\t\t\t\t\t\tuntracked(() => {\n\t\t\t\t\t\t\t\tresult[index] = accValue\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\t}\n\t\t\t\t\t})\n\t\t\t\t\tindexEffects.set(index, stop)\n\t\t\t\t})\n\t\t\t}\n\n\t\t\tprev = intermediate\n\t\t}\n\n\t\t// Cleanup trailing indices\n\t\tfor (const index of Array.from(indexEffects.keys())) {\n\t\t\tif (index >= length) disposeIndex(index)\n\t\t}\n\t\t\n\t\t// Ensure result length matches source length\n\t\tuntracked(() => {\n\t\t\tif (result.length !== length) {\n\t\t\t\tFoolProof.set(result as any, 'length', length, result)\n\t\t\t}\n\t\t})\n\t})\n\n\treturn cleanedBy(result, () => {\n\t\tmainEffect()\n\t\tfor (const stop of indexEffects.values()) stop()\n\t\tindexEffects.clear()\n\t}) as ScanResult<Output>\n}\n\nexport function resolve<Output>(cb: () => Output[]): Output[] & { [cleanup]: ScopedCallback } {\n\tconst result = reactive([] as Output[])\n\treturn cleanedBy(result, effect(() => {\n\t\tconst source = cb()\n\t\tif (result.length !== source.length) result.length = source.length\n\t\tfor (let i = 0; i < source.length; i++)\n\t\t\tif (result[i] !== source[i]) result[i] = source[i]\n\t}))\n}"],"names":["asyncHooks","addHook","_hook","sanitizePromise","p","hooks","Set","promiseContexts","WeakMap","captureRestorers","restorers","hook","restorer","add","wrap","fn","capturedRestorers","args","undoers","restore","push","apply","this","originals","queueMicrotask","call","globalThis","i","length","delete","res","then","Promise","resolve","reject","setTimeout","targetWrappers","patchOnProperties","proto","prop","Object","getOwnPropertyNames","startsWith","desc","getOwnPropertyDescriptor","set","configurable","nativeSet","defineProperty","EventTarget","addEventListener","removeEventListener","nativeAdd","nativeRemove","type","listener","options","types","get","Map","listeners","wrapped","patchEventTarget","prototype","prototypesToPatch","HTMLElement","Window","Document","MessagePort","XMLHttpRequest","IDBRequest","IDBTransaction","IDBDatabase","FileReader","AbortSignal","GLOBAL_ORIGINALS","Symbol","for","GLOBAL_PROMISE","OriginalPromise","patchedThen","onFulfilled","onRejected","context","nextPromise","size","PatchedPromise","executor","wrappedResolve","wrappedReject","catch","finally","all","allSettled","race","any","setInterval","setImmediate","requestAnimationFrame","assign","value","has","reason","values","onFinally","species","e","callback","nativeConstructors","Array","Date","Function","WeakSet","Error","TypeError","ReferenceError","SyntaxError","RangeError","URIError","EvalError","Reflect","Proxy","RegExp","String","Number","Boolean","isConstructor","toString","renamed","fct","name","defineProperties","FoolProof","obj","receiver","Node","writable","enumerable","isOwnAccessor","opd","deepCompare","a","b","cache","getPrototypeOf","compared","isArray","match","getTime","val","found","bVal","key","foundMatch","bKey","keysA","keys","keysB","hasOwn","contentRefs","contentRef","container","seal","create","contentOf","tag","toStringTag","named","DecoratorError","constructor","message","super","legacyDecorator","description","target","propertyKey","descriptor","undefined","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","getAt","setAt","Indexable","base","accessor","index","setPrototypeOf","getLength","numProp","isNaN","setLength","ownKeys","len","v","forwardArray","ArrayReadForward","iterator","map","callbackfn","thisArg","filter","predicate","reduce","initialValue","reduceRight","forEach","find","findIndex","findLast","findLastIndex","searchElement","fromIndex","indexOf","lastIndexOf","slice","start","end","concat","items","every","some","join","separator","entries","toLocaleString","locales","at","flat","depth","flatMap","toReversed","reverse","toSorted","compareFn","sort","toSpliced","deleteCount","with","unscopables","IterableWeakMap","uuids","refs","_a","registry","uuid","k","createIterator","cb","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","cached","usedBase","ProxiedBaseClass","originalPrototype","proxiedPrototype","mixedClass","forward","alreadyChained","promiseProxyHandler","chainPromise","r","promiseForward","objectProxyHandler","chainObject","given","chainable","x","t","chained","nativeReactive","nonReactiveMark","unreactiveProperties","allProps","projectionInfo","stopped","cleanup","rootFunction","ReactiveErrorCode","ReactiveError","debugInfo","code","cause","enter","_effect","leave","chain","_targets","_caller","beginChain","endChain","garbageCollected","_fn","touched","_obj","_evolution","_props","_deps","skipRunningEffect","maxEffectChain","maxTriggerPerBatch","maxEffectReaction","onMemoizationDiscrepancy","cycleHandling","isVerificationRun","maxDeepWatchDepth","instanceMembers","ignoreAccessors","recursiveTouching","asyncMode","warn","introspection","enableHistory","historySize","zones","effectToReactiveObjects","watchers","effectChildren","effectParent","reverseRoots","markWithRoot","root","existingRef","existing","rootName","existingName","fnName","getRoot","EXTERNAL_SOURCE","devtoolsEnabled","debugEffectRegistry","debugObjectRegistry","effectNames","objectNames","effectCounter","objectCounter","triggerGraph","ensureEffectName","effect","trim","ensureObjectName","ctorName","addEffectToRegistry","deps","documentObject","dbRegisterObject","ensureTriggerRecord","source","label","evolution","targetMap","ensureTriggerContainers","labelMap","record","object","count","lastTriggered","now","setEffectName","setObjectName","registerEffectForDebug","registerObjectForDebug","recordTriggerLink","id","mutationCounter","timestamp","objectName","mutationHistory","shift","addToMutationHistory","describeProp","getTriggerChain","limit","current","foundSource","foundReason","search","lastTime","buildReactivityGraph","nodes","edges","nodeIds","allEffects","effects","queue","from","parent","ensureParentChains","effectNodes","nodeByEffect","ordered","node","debugName","depthCache","computeDepth","parentNode","parentId","buildEffectNodes","externalId","effectId","objId","targetEffect","targetId","sourceId","meta","generatedAt","isDevtoolsEnabled","isu","z","AZone","prev","active","entered","zoned","Zone","ZoneHistory","history","controlled","self","present","getOwnPropertyDescriptors","added","ZoneAggregator","_ZoneAggregator_zones","__classPrivateFieldGet","asyncZone","zone","effectHistory","effectAggregator","isRunning","getActiveEffect","objectToProxy","proxyToObject","unwrap","findCycleInChain","roots","seen","formatRoots","names","activationRegistry","activationLog","recordActivation","effectData","objData","unshift","pop","effectName","MaxReactionExceeded","effectTrackers","opaqueEffects","effectTriggers","effectTriggeredBy","causesClosure","consequencesClosure","effectCreationStacks","getOrCreateClosure","closure","hasPathExcluding","exclude","visited","triggers","next","batchQueue","hasBatched","batchCleanups","findPath","startRoot","endRoot","path","newPath","targetRoot","result","getCyclePathForEdge","callerRoot","addToBatch","caller","immediate","cleanupSymbol","targetConsequences","wouldCreateCycle","cyclePath","cycleMessage","causalChain","creationStack","CycleDetected","cycle","details","newTriggers","triggeredBy","uConsequences","vCauses","uCausesSet","vConsequencesSet","y","xConsequences","addGraphEdge","addBatchCleanup","defer","findCycle","recursionStack","cycleStart","executeNext","effectuatedRoots","nextEffect","nextRoot","first","inDegrees","getCyclePath","consequences","consequence","consequenceConsequences","firstEffect","firstRoot","firstEffect2","firstRoot2","batch","executedRoot","consequenceRoot","currentDegree","decrementInDegreesForExecuted","firstReturn","activeEffect","activeRoot","inDegree","causes","causeRoot","computeAllInDegrees","trace","queued","MaxDepthExceeded","queuedCount","cleanups","error","BrokenEffects","atomic","atomicEffect","effectOptions","stack","cleanStack","split","tracked","runEffect","ascend","effectStopped","hasReacted","runningPromise","cancelPrevious","prevCleanup","untracked","reactionCleanup","reaction","originalPromise","cancelReject","cancelPromise","_","cancelError","effectObjects","reactiveObj","objectWatchers","children","childCleanup","augmentedRv","cleanup$1","opaque","stopEffect","rootCauses","rootConsequences","sourceRoot","causeConsequences","consequenceCauses","yCauses","cleanupEffectFromGraph","callIfCollected","subEffectCleanup","objectParents","objectsWithDeepWatchers","deepWatchers","effectToDeepWatchedObjects","addBackReference","child","parents","removeBackReference","entry","needsBackReferences","hasParentWithDeepWatchers","bubbleUpChange","changedObject","parentDeepWatchers","watcher","states","addState","state","getState","collectEffects","keyChains","sourceEffect","trackers","tracker","touched1","props","nonReactiveObjects","immutables","absent","nonReactiveClass","cls","c","isNonReactive","isObjectLike","isObject","getPrototypeToken","shouldRecurseTouch","oldValue","newValue","notifyPropertyChange","targetObj","hadProperty","origin","notifications","combinedEffects","allowedEffects","originWatchers","originEffects","currentEffects","propsArray","filteredEffects","hasAncestorInSet","dispatchNotifications","recursiveTouch","touchedOpaque","collectObjectKeys","oldObj","newObj","mapped","hasVisitedPair","oldArray","newArray","_visited","local","oldLength","newLength","max","Math","hasOld","hasNew","oldEntry","newEntry","is","diffArrayElements","oldKeys","newKeys","diffObjectProperties","allowedSet","dependant","currentActiveEffect","window","o","markNonReactive","document","Element","metaProtos","hasReentry","reactiveHandlers","metaProto","unwrappedObj","hasProp","isOwnProp","isInheritedAccess","shouldIgnoreAccessor","reactiveObject","reactiveValue","unwrappedReceiver","oldVal","deleteProperty","reactiveClasses","ReactiveBase","reactive","anyTarget","getExistingProxy","proxied","proxy","trackProxyObject","storeProxyRelationship","Reactive","deepWatch","wrappedCallback","traverseAndTrack","unsetYet","unreactive","arg1","deepNonReactive","arg","cleanedBy","cleanupFn","memoizedRegistry","wrapperRegistry","getBranch","tree","branches","branch","memoizeFunction","fnRoot","cacheRoot","memoized","localArgs","wasVerification","fresh","memoize","wrapper","makeReactiveIterator","done","makeReactiveEntriesIterator","RegisterClass","_classSuper","RegisterBase","toArray","getRegisterBase","_classThis","_RegisterClass_keyFn","_RegisterClass_keys","_RegisterClass_values","_RegisterClass_usage","_RegisterClass_valueInfo","_RegisterClass_keyEffects","_RegisterClass_ascend","_RegisterClass_instances","keyFn","initial","ascendGet","__classPrivateFieldSet","ensureKey","info","stop","nextKey","assertValidKey","previousKey","_RegisterClass_rekeyValue","setKeyValue","cleanupValue","disposeKeyEffects","incrementUsage","decrementUsage","normalizeIndex","allowEnd","resolved","assignAt","oldKey","insertKeyValue","splice","rebuildFrom","newKey","existingValue","existingCount","updatedInfo","normalized","item","removeAt","normalizedStart","maxDeletions","actualDelete","min","keysToInsert","removedKeys","removedValues","remove","indexOfKey","keep","decisions","shouldKeep","hasKey","mapKeys","update","upsert","insert","fwdCompareFn","fill","copyWithin","__esDecorate","_classDescriptor","_classDecorators","metadata","_metadata","_classExtraInitializers","__runInitializers","Register","effectProjectionMetadata","getActiveProjection","defineAccessValue","access","makeCleanup","effectMap","onDispose","projectArray","indexEffects","disposeIndex","cleanupLength","normalizeTargetLength","previous","accessBase","old","produced","projectRegister","observedSource","rawTarget","keyEffects","disposeKey","cleanupKeys","projectRecord","observed","sourceKey","projectMap","project","array","range","Indexer","indexLess","parseInt","ReactiveArray","toJSON","actualIndex","nativeIterator","dispose","unwrappedSearch","predicateOrElement","actualStart","actualDeleteCount","localeCompare","final","to","ReactiveWeakMap","hadKey","ReactiveMap","hadEntries","ReactiveWeakSet","had","ReactiveSet","profileInfo","syncCalculating","alreadyCalculating","deprecated","version","pkg","GLOBAL_MUTTS_KEY","globalScope","global","viteEval","eval","__filename","url","currentSourceInfo","JSON","stringify","destructorObj","destroy","destructors","isDestroyable","myDestructor","destruction","_Eventful_events","_Eventful_hooks","on","eventOrEvents","callbacks","off","emit","event","received","programatticallySetValue","called","delay","_propertyKey","timeoutId","clearTimeout","compute","properties","Base","__MUTTS_DEVTOOLS__","getGraph","registerEffect","registerObject","property","baseTarget","originalClass","reactiveClass","indexToIntermediate","intermediaries","Intermediate","_instanceExtraInitializers","acc","prevAcc","_get_acc_decorators","static","private","mainEffect","occurrenceCount","list","intermediate","inter","accValue","lastCallTime","remainingTime","scheduledArgs","onTouch","changed","deep","deepCleanup","cbCleanup","watchCallBack","watchObject","minLength","arr","tuple"],"mappings":"4OAGO,MAAMA,EAAa,CACzB,OAAAC,CAAQC,GACP,KAAM,gEACP,EAMGC,gBAAgBC,GACLA,GCXTC,EAAQ,IAAIC,IACZC,EAAkB,IAAIC,QAyB5B,SAASC,IACR,MAAMC,EAAY,IAAIJ,IACtB,IAAK,MAAMK,KAAQN,EAAO,CACzB,MAAMO,EAAWD,IACbC,GAAUF,EAAUG,IAAID,EAC7B,CACA,OAAOF,CACR,CAEA,SAASI,EAA4BC,EAA+CC,GACnF,GAAkB,mBAAPD,EAAmB,OAAOA,EACrC,MAAML,EAAYM,GAAqBP,IACvC,OAAO,YAAwBQ,GAC9B,MAAMC,EAA0B,GAChC,IAAK,MAAMC,KAAWT,EAAWQ,EAAQE,KAAKD,KAC9C,IACC,OAAOJ,EAAGM,MAAMC,KAAML,EACvB,SACC,GAAIM,EAAUC,eAEbD,EAAUC,eAAeC,KAAKC,WAAY,KACzCH,EAAUC,eAAeC,KAAKC,WAAY,KACzCH,EAAUC,eAAeC,KAAKC,WAAY,KACzC,IAAK,IAAIC,EAAIT,EAAQU,OAAS,EAAGD,GAAK,EAAGA,IAAKT,EAAQS,gBAKzD,IAAK,IAAIA,EAAIT,EAAQU,OAAS,EAAGD,GAAK,EAAGA,IAAKT,EAAQS,IAExD,CACD,CACD,CAvDA3B,EAAWC,QAAU,SAAUU,GAE9B,OADAN,EAAMQ,IAAIF,GACH,KACNN,EAAMwB,OAAOlB,GAEf,EAOAX,EAAWG,gBAAmB2B,GACtBA,GAAoC,mBAArBA,EAAYC,KACpB,IAAIC,QAAQ,CAACC,EAASC,KACzBC,WAAW,KACNL,EAAYC,KAAKE,EAASC,IAC5B,KAGJJ,EAqCX,MAAMM,EAAiB,IAAI5B,QAoD3B,SAAS6B,EAAkBC,GAC1B,GAAKA,EACL,IAAK,MAAMC,KAAQC,OAAOC,oBAAoBH,GAC7C,GAAIC,EAAKG,WAAW,MAAO,CAC1B,MAAMC,EAAOH,OAAOI,yBAAyBN,EAAOC,GACpD,GAAII,GAAQA,EAAKE,KAAOF,EAAKG,aAAc,CAC1C,MAAMC,EAAYJ,EAAKE,IACvBL,OAAOQ,eAAeV,EAAOC,EAAM,IAC/BI,EACHE,IAAK,SAAqB9B,GACzBgC,EAAUtB,KAAKH,KAAMR,EAAKC,GAC3B,GAEF,CACD,CAEF,CAE2B,oBAAhBkC,aApEX,SAA0BX,GACzB,IAAKA,IAAUA,EAAMY,mBAAqBZ,EAAMa,oBAAqB,OACrE,MAAMC,EAAYd,EAAMY,iBAClBG,EAAef,EAAMa,oBAE3Bb,EAAMY,iBAAmB,SAAqBI,EAAcC,EAAeC,GAC1E,GAAwB,mBAAbD,EACV,OAAOH,EAAU3B,KAAKH,KAAMgC,EAAMC,EAAUC,GAG7C,IAAIC,EAAQrB,EAAesB,IAAIpC,MAC1BmC,IACJA,EAAQ,IAAIE,IACZvB,EAAeS,IAAIvB,KAAMmC,IAE1B,IAAIG,EAAYH,EAAMC,IAAIJ,GACrBM,IACJA,EAAY,IAAIpD,QAChBiD,EAAMZ,IAAIS,EAAMM,IAGjB,IAAIC,EAAUD,EAAUF,IAAIH,GAM5B,OALKM,IACJA,EAAU/C,EAAKyC,GACfK,EAAUf,IAAIU,EAAUM,IAGlBT,EAAU3B,KAAKH,KAAMgC,EAAMO,EAASL,EAC5C,EAEAlB,EAAMa,oBAAsB,SAAqBG,EAAcC,EAAeC,GAC7E,GAAwB,mBAAbD,EACV,OAAOF,EAAa5B,KAAKH,KAAMgC,EAAMC,EAAUC,GAGhD,MAAMC,EAAQrB,EAAesB,IAAIpC,MACjC,GAAImC,EAAO,CACV,MAAMG,EAAYH,EAAMC,IAAIJ,GAC5B,GAAIM,EAAW,CACd,MAAMC,EAAUD,EAAUF,IAAIH,GAC9B,GAAIM,EACH,OAAOR,EAAa5B,KAAKH,KAAMgC,EAAMO,EAASL,EAEhD,CACD,CAEA,OAAOH,EAAa5B,KAAKH,KAAMgC,EAAMC,EAAUC,EAChD,CACD,CAqBCM,CAAiBb,YAAYc,WAG9B,MAAMC,EAAoB,CACF,oBAAhBf,aAA+BA,YAAYc,UAC3B,oBAAhBE,aAA+BA,YAAYF,UAChC,oBAAXG,QAA0BA,OAAOH,UACpB,oBAAbI,UAA4BA,SAASJ,UACrB,oBAAhBK,aAA+BA,YAAYL,UACxB,oBAAnBM,gBAAkCA,eAAeN,UAClC,oBAAfO,YAA8BA,WAAWP,UACtB,oBAAnBQ,gBAAkCA,eAAeR,UACjC,oBAAhBS,aAA+BA,YAAYT,UAC5B,oBAAfU,YAA8BA,WAAWV,UACzB,oBAAhBW,aAA+BA,YAAYX,WAGnD,IAAK,MAAMzB,KAAS0B,EACf1B,GACHD,EAAkBC,GAIpB,MAAMqC,EAAmBC,OAAOC,IAAI,mBAC9BC,EAAiBF,OAAOC,IAAI,yBAElC,IAAItD,EACAwD,EAgCJ,SAASC,EAAuBC,EAAkBC,GACjD,MAAMC,EAAU5E,EAAgBmD,IAAIpC,OAASb,IACvC2E,EAAc7D,EAAUQ,KAAKN,KAAKH,KAAMR,EAAKmE,EAAaE,GAAUrE,EAAKoE,EAAYC,IAE3F,OADIA,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIuC,EAAaD,GAChDC,CACR,CAgBA,SAASE,EAA6BC,GAClC,GAAwB,mBAAbA,EAAyB,CAChC,MAAMnF,EAAI,IAAI2E,EAAgB,CAAC9C,EAASC,KACpC,MAAMsD,EAAiB1E,EAAKmB,GACtBwD,EAAgB3E,EAAKoB,GAC3BqD,EAASC,EAAgBC,KAEvBN,EAAU1E,IAEhB,OADAF,EAAgBsC,IAAIzC,EAAG+E,GAChB/E,CACX,CACA,OAAO,IAAI2E,EAAgBQ,EAC/B,CA/DK7D,WAAmBiD,IACpBpD,EAAaG,WAAmBiD,GAChCI,EAAmBrD,WAAmBoD,KAEtCC,EAAkBrD,WAAWM,QAC7BT,EAAY,CACRQ,KAAMgD,EAAgBhB,UAAUhC,KAChC2D,MAAOX,EAAgBhB,UAAU2B,MACjCC,QAASZ,EAAgBhB,UAAU4B,QACnC1D,QAAS8C,EAAgB9C,QACzBC,OAAQ6C,EAAgB7C,OACxB0D,IAAKb,EAAgBa,IACrBC,WAAad,EAAwBc,WACrCC,KAAMf,EAAgBe,KACtBC,IAAMhB,EAAwBgB,IAC9B5D,WAAYT,WAAWS,WACvB6D,YAAatE,WAAWsE,YACxBC,aAAevE,WAAmBuE,aAClCC,sBAAwBxE,WAAmBwE,sBAC3C1E,eAAgBE,WAAWF,gBAE9BE,WAAmBiD,GAAoBpD,EACvCG,WAAmBoD,GAAkBC,GAIrCxD,EAAUsE,aAAYtE,EAAUsE,WAAcd,EAAwBc,YACtEtE,EAAUwE,MAAKxE,EAAUwE,IAAOhB,EAAwBgB,KACxDxE,EAAUuE,OAAMvE,EAAUuE,KAAOf,EAAgBe,MAsCtDtD,OAAO2D,OAAOb,EAAiBP,GAG/BO,EAAevB,UAAYgB,EAAgBhB,UAE3CuB,EAAerD,QAAU,SAAYmE,GACjC,MAAMhG,EAAImB,EAAUU,QAAQR,KAAKsD,EAAiBqB,GAC5CjB,EAAU1E,IAGhB,OADI0E,EAAQE,KAAO,IAAM9E,EAAgB8F,IAAIjG,IAAIG,EAAgBsC,IAAIzC,EAAG+E,GACjE/E,CACX,EAEAkF,EAAepD,OAAS,SAAoBoE,GACxC,MAAMlG,EAAImB,EAAUW,OAAOT,KAAKsD,EAAiBuB,GAC3CnB,EAAU1E,IAEhB,OADI0E,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIzC,EAAG+E,GACtC/E,CACX,EAEAkF,EAAeM,IAAM,SAAYW,GAC7B,MAAMnG,EAAImB,EAAUqE,IAAInE,KAAKsD,EAAiBwB,GACxCpB,EAAU1E,IAEhB,OADI0E,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIzC,EAAG+E,GACtC/E,CACX,EAEAkF,EAAeO,WAAa,SAAYU,GACpC,MAAMnG,EAAKmB,EAAUsE,WAAmBpE,KAAKsD,EAAiBwB,GACxDpB,EAAU1E,IAEhB,OADI0E,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIzC,EAAG+E,GACtC/E,CACX,EAEAkF,EAAeQ,KAAO,SAAYS,GAC9B,MAAMnG,EAAImB,EAAUuE,KAAKrE,KAAKsD,EAAiBwB,GACzCpB,EAAU1E,IAEhB,OADI0E,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIzC,EAAG+E,GACtC/E,CACX,EAEAkF,EAAeS,IAAM,SAAYQ,GAC7B,MAAMnG,EAAKmB,EAAUwE,IAAYtE,KAAKsD,EAAiBwB,GACjDpB,EAAU1E,IAEhB,OADI0E,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIzC,EAAG+E,GACtC/E,CACX,EAKI2E,EAAgBhB,UAAUhC,OAASiD,IACnCD,EAAgBhB,UAAUhC,KAAOiD,EACjCD,EAAgBhB,UAAU2B,MAlF9B,SAAiCR,GAChC,MAAMC,EAAU5E,EAAgBmD,IAAIpC,OAASb,IACvC2E,EAAc7D,EAAUmE,MAAMjE,KAAKH,KAAMR,EAAKoE,EAAYC,IAEhE,OADIA,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIuC,EAAaD,GAChDC,CACR,EA8EIL,EAAgBhB,UAAU4B,QA5E9B,SAAmCa,GAClC,MAAMrB,EAAU5E,EAAgBmD,IAAIpC,OAASb,IACvC2E,EAAc7D,EAAUoE,QAAQlE,KAAKH,KAAMR,EAAK0F,EAAWrB,IAEjE,OADIA,EAAQE,KAAO,GAAG9E,EAAgBsC,IAAIuC,EAAaD,GAChDC,CACR,GA0EA,IACC5C,OAAOQ,eAAe+B,EAAiBH,OAAO6B,QAAS,CACtD/C,IAAK,IAAM4B,EACXxC,cAAc,GAEhB,CAAE,MAAO4D,GAAI,CAEXhF,WAAmBM,QAAUsD,EAE/B5D,WAAWS,WAAU,CAAKwE,KAAuB1F,IACzCM,EAAUY,WAAWV,KAAKC,WAAYZ,EAAK6F,MAAqB1F,GAGxES,WAAWsE,YAAW,CAAKW,KAAuB1F,IAC1CM,EAAUyE,YAAYvE,KAAKC,WAAYZ,EAAK6F,MAAqB1F,GAGrEM,EAAU0E,eACXvE,WAAmBuE,aAAY,CAAKU,KAAuB1F,IACrDM,EAAU0E,aAAaxE,KAAKC,WAAYZ,EAAK6F,MAAqB1F,IAIvEM,EAAU2E,wBACbxE,WAAWwE,sBAAyBS,GAC5BpF,EAAU2E,sBAAsBzE,KAAKC,WAAYZ,EAAK6F,KAI3DpF,EAAUC,iBACbE,WAAWF,eAAkBmF,IAC5BpF,EAAUC,eAAeC,KAAKC,WAAYZ,EAAK6F,MCtRjD,MAAMC,EAAqB,IAAItG,IAAc,CAC5CkC,OACAqE,MACAC,KACAC,SACAzG,IACAqD,IACAnD,QACAwG,QACAhF,QACAiF,MACAC,UACAC,eACAC,YACAC,WACAC,SACAC,UACAC,QACAC,MACAC,OACAC,OACAC,OACAC,UAOK,SAAUC,EAAc/G,GAC7B,OACCA,GACc,mBAAPA,IACN6F,EAAmBP,IAAItF,IAAOA,EAAGgH,aAAarF,WAAW,UAE5D,CAQM,SAAUsF,EAA4BC,EAAQC,GACnD,OAAO1F,OAAO2F,iBAAiBF,EAAK,CACnCC,KAAM,CACL9B,MAAO8B,IAGV,CACO,MAAME,EAAY,CACxB1E,IAAG,CAAC2E,EAAU9F,EAAW+F,IAEJ,oBAATC,MAAwBF,aAAeE,KAAcF,EAAY9F,GACrEiF,QAAQ9D,IAAI2E,EAAK9F,EAAM+F,GAE/BzF,IAAG,CAACwF,EAAU9F,EAAW6D,EAAYkC,IAEhB,oBAATC,MAAwBF,aAAeE,MAC/CF,EAAY9F,GAAQ6D,GACf,GAEFiC,aAAe7F,QAAYgF,QAAQnB,IAAIgC,EAAK9F,GAS3CiF,QAAQ3E,IAAIwF,EAAK9F,EAAM6D,EAAOkC,IARpC9F,OAAOQ,eAAeqF,EAAK9F,EAAM,CAChC6D,QACAtD,cAAc,EACd0F,UAAU,EACVC,YAAY,KAEN,IAMJ,SAAUC,EAAcL,EAAU9F,GACvC,MAAMoG,EAAMnG,OAAOI,yBAAyByF,EAAK9F,GACjD,SAAUoG,GAAKjF,MAAOiF,GAAK9F,IAC5B,CAWM,SAAU+F,EAAYC,EAAQC,EAAQC,EAAQ,IAAIpF,KACvD,GAAIkF,IAAMC,EAAG,OAAO,EAEpB,GAAiB,iBAAND,GAAwB,OAANA,GAA2B,iBAANC,GAAwB,OAANA,EACnE,OAAOD,IAAMC,EAMd,GAFetG,OAAOwG,eAAeH,KACtBrG,OAAOwG,eAAeF,GAMpC,OAAO,EAGR,IAAIG,EAAWF,EAAMrF,IAAImF,GACzB,GAAII,GAAU5C,IAAIyC,GAAI,OAAO,EAQ7B,GAPKG,IACJA,EAAW,IAAI3I,IACfyI,EAAMlG,IAAIgG,EAAGI,IAEdA,EAASpI,IAAIiI,GAGTjC,MAAMqC,QAAQL,GAAI,CACrB,IAAKhC,MAAMqC,QAAQJ,GAElB,OAAO,EAER,GAAID,EAAEjH,SAAWkH,EAAElH,OAElB,OAAO,EAER,IAAK,IAAID,EAAI,EAAGA,EAAIkH,EAAEjH,OAAQD,IAC7B,IAAKiH,EAAYC,EAAElH,GAAImH,EAAEnH,GAAIoH,GAE5B,OAAO,EAGT,OAAO,CACR,CAEA,GAAIF,aAAa/B,KAAM,CACtB,MAAMqC,EAAQL,aAAahC,MAAQ+B,EAAEO,YAAcN,EAAEM,UAErD,OAAOD,CACR,CACA,GAAIN,aAAanB,OAAQ,CACxB,MAAMyB,EAAQL,aAAapB,QAAUmB,EAAEd,aAAee,EAAEf,WAExD,OAAOoB,CACR,CACA,GAAIN,aAAavI,IAAK,CACrB,KAAMwI,aAAaxI,MAAQuI,EAAExD,OAASyD,EAAEzD,KAEvC,OAAO,EAER,IAAK,MAAMgE,KAAOR,EAAG,CACpB,IAAIS,GAAQ,EACZ,IAAK,MAAMC,KAAQT,EAClB,GAAIF,EAAYS,EAAKE,EAAMR,GAAQ,CAClCO,GAAQ,EACR,KACD,CAED,IAAKA,EAEJ,OAAO,CAET,CACA,OAAO,CACR,CACA,GAAIT,aAAalF,IAAK,CACrB,KAAMmF,aAAanF,MAAQkF,EAAExD,OAASyD,EAAEzD,KAEvC,OAAO,EAER,IAAK,MAAOmE,EAAKH,KAAQR,EACxB,GAAKC,EAAEzC,IAAImD,IAaV,IAAKZ,EAAYS,EAAKP,EAAEpF,IAAI8F,GAAMT,GAEjC,OAAO,MAfQ,CAChB,IAAIU,GAAa,EACjB,IAAK,MAAOC,EAAMH,KAAST,EAC1B,GAAIF,EAAYY,EAAKE,EAAMX,IAAUH,EAAYS,EAAKE,EAAMR,GAAQ,CACnEU,GAAa,EACb,KACD,CAED,IAAKA,EAEJ,OAAO,CAET,CAOD,OAAO,CACR,CAGA,MAAME,EAAQnH,OAAOoH,KAAKf,GACpBgB,EAAQrH,OAAOoH,KAAKd,GAC1B,GAAIa,EAAM/H,SAAWiI,EAAMjI,OAS1B,OAAO,EAGR,IAAK,MAAM4H,KAAOG,EAAO,CACxB,IAAKnH,OAAOsH,OAAOhB,EAAGU,GAErB,OAAO,EAER,IAAKZ,EAAYC,EAAEW,GAAMV,EAAEU,GAAMT,GAKhC,OAAO,CAET,CAEA,OAAO,CACR,CAGA,MAAMgB,EAAc,IAAIvJ,QAClB,SAAUwJ,EAAWC,GAU1B,OATKF,EAAY1D,IAAI4D,IACpBF,EAAYlH,IACXoH,EACAzH,OAAO0H,KACN1H,OAAO2H,OAAO,KAAM,CACnBC,UAAW,CAAEhE,MAAO6D,EAAWzB,UAAU,EAAO1F,cAAc,OAI3DiH,EAAYrG,IAAIuG,EACxB,CAEM,SAAUI,EAAsBnC,EAAcG,GAanD,OAZA7F,OAAO2F,iBAAiBE,EAAK,CAC5B,CAACzD,OAAO0F,aAAc,CACrBlE,MAAO8B,EACPM,UAAU,EACV1F,cAAc,GAEfiF,SAAU,CACT3B,MAAO,IAAM8B,EACbM,UAAU,EACV1F,cAAc,KAGTuF,CACR,CAEM,SAAUkC,EAA0BrC,EAAcnH,GAMvD,OALAyB,OAAOQ,eAAejC,EAAI,OAAQ,CACjCqF,MAAOrF,EAAGmH,KAAO,GAAGnH,EAAGmH,SAASA,IAASA,EACzCM,UAAU,EACV1F,cAAc,IAER/B,CACR,CCpSM,MAAOyJ,UAAuBvD,MACnC,WAAAwD,CAAYC,GACXC,MAAMD,GACNpJ,KAAK4G,KAAO,oBACb,EAiIK,SAAU0C,EAAyBC,GACxC,OAAO,SAENC,EACAC,EACAC,KACG/J,GAEH,QAAoBgK,IAAhBF,GACH,GAAIjD,EAAcgD,GAAS,CAC1B,KAAM,UAAWD,GAAc,MAAM,IAAI5D,MAAM,0CAC/C,OAAO4D,EAAYK,MAAOJ,EAC3B,OACM,GAAsB,iBAAXA,GAAuB,CAAC,SAAU,UAAUK,gBAAgBJ,GAAc,CAC3F,IAAKC,EAAY,MAAM,IAAI/D,MAAM,0CAC5B,GAA0B,iBAAf+D,GAA2B,iBAAkBA,EAAY,CACxE,GAAI,QAASA,GAAc,QAASA,EAAY,CAC/C,KAAM,WAAYH,MAAe,WAAYA,GAC5C,MAAM,IAAI5D,MAAM,qDACjB,GAAI,WAAY4D,EAAa,CAC5B,MAAMO,EAAYP,EAAYQ,OAAQL,EAAWtH,IAAYoH,EAAQC,GACjEK,IAAWJ,EAAWtH,IAAM0H,EACjC,CACA,GAAI,WAAYP,EAAa,CAC5B,MAAMS,EAAYT,EAAYU,OAAQP,EAAWnI,IAAYiI,EAAQC,GACjEO,IAAWN,EAAWnI,IAAMyI,EACjC,CACA,OAAON,CACR,CAAO,GAAgC,mBAArBA,EAAW5E,MAAsB,CAClD,KAAM,WAAYyE,GAAc,MAAM,IAAI5D,MAAM,2CAChD,MAAMuE,EAAYX,EAAYY,OAAQT,EAAW5E,MAAO0E,EAAQC,GAEhE,OADIS,IAAWR,EAAW5E,MAAQoF,GAC3BR,CACR,CACD,CACD,CACA,KAAM,YAAaH,GAClB,MAAM,IAAI5D,MAAM,kDACjB,OAAO4D,EAAYa,QAASjK,KAAKH,KAAMwJ,EAAQC,EAAaC,KAAe/J,EAC5E,CACD,CAOM,SAAU0K,EAAyBd,GAExC,OAAO,SAAqBC,EAAa3F,KAA+BlE,GACvE,IAAKkE,GAASyG,MAAgC,iBAAjBzG,EAAQyG,KAAmB,CACvD,KAAM,YAAaf,GAClB,MAAM,IAAI5D,MAAM,kDACjB,OAAO4D,EAAYa,QAASjK,KAAKH,KAAMwJ,EAAQ3F,KAAYlE,EAC5D,CACA,OAAQkE,EAAQyG,MACf,IAAK,QACJ,KAAM,UAAWf,GAAc,MAAM,IAAI5D,MAAM,0CAC/C,OAAO4D,EAAYK,MAAOJ,GAC3B,IAAK,QACJ,MAAM,IAAI7D,MAAM,0CACjB,IAAK,SACJ,KAAM,WAAY4D,GAAc,MAAM,IAAI5D,MAAM,2CAChD,OAAO4D,EAAYQ,OAAQP,EAAQA,EAAQ3F,EAAQ+C,MACpD,IAAK,SACJ,KAAM,WAAY2C,GAAc,MAAM,IAAI5D,MAAM,2CAChD,OAAO4D,EAAYU,OAAQT,EAAQA,EAAQ3F,EAAQ+C,MACpD,IAAK,SACJ,KAAM,WAAY2C,GAAc,MAAM,IAAI5D,MAAM,2CAChD,OAAO4D,EAAYY,OAAQX,EAAQA,EAAQ3F,EAAQ+C,MACpD,IAAK,WAAY,CAChB,KAAM,WAAY2C,MAAe,WAAYA,GAC5C,MAAM,IAAI5D,MAAM,qDACjB,MAAM4E,EAAsD,CAAA,EAC5D,GAAI,WAAYhB,EAAa,CAC5B,MAAMO,EAAYP,EAAYQ,OAAQP,EAAOpH,IAAKoH,EAAQ3F,EAAQ+C,MAC9DkD,IAAWS,EAAGnI,IAAM0H,EACzB,CACA,GAAI,WAAYP,EAAa,CAC5B,MAAMS,EAAYT,EAAYU,OAAQT,EAAOjI,IAAKiI,EAAQ3F,EAAQ+C,MAC9DoD,IAAWO,EAAGhJ,IAAMyI,EACzB,CACA,OAAOO,CACR,EAGF,CACD,CA4BO,MAAMC,EAAoCjB,IAChD,MAAMkB,EAASJ,EAAgBd,GACzBmB,EAASpB,EAAgBC,GAC/B,MAAA,CAASC,EAAamB,KAAuBhL,KAC5C,MAAMiL,EA1BR,SACCC,EACAF,GAKA,MACyB,iBAAjBA,GACU,OAAjBA,GAC6B,iBAAtBA,EAAaL,KAEb,SAED,QACR,CAWeQ,CAAoBtB,EAAQmB,EAAchL,EAAK,IAC5D,MAAgB,WAATiL,EACJH,EAAOjB,EAAQmB,KAAiBhL,GAChC+K,EAAOlB,EAAQmB,KAAiBhL,EACnC,GCrQIoL,EAAK,IAAIC,qBAAkCC,GAAMA,KAI1CC,EAAa5H,OAAO,cAIpB6H,EAAkB7H,OAAO,aAIhC,MAAO8H,UAAyBzF,MACrC,YAAO,CAAiB0F,GACvB,MAAO,KACN,MAAM,IAAID,EAAiBC,GAE7B,CACA,WAAAlC,CAAYkC,GACXhC,MAAM,wBAAwBgC,KAC9BrL,KAAK4G,KAAO,sBACb,EAED,MAAM0E,EAAmB,CACxB,CAAChI,OAAO0F,aAAc,oBACtB5G,IAAKgJ,EAAiBG,MAAM,kCAC5BhK,IAAK6J,EAAiBG,MAAM,mCAyItB,MAAMC,EAAYhB,EAAU,CAClCP,OAAM,CAACwB,EAAUZ,EAASpB,IAClB,SAAU3E,GAEhB,OADA9E,KAAKmL,GAAiB1B,GAAe3E,EAC9B2G,EAAStL,KAAKH,KAAM8E,EAC5B,otDCxKW4G,EAAQpI,OAAO,SAIfqI,EAAQrI,OAAO,SAwDtB,SAAUsI,EACfC,EACAC,GAEID,GAAwB,mBAATA,IAClBC,EAAWD,EACXA,OAAOlC,GAEHkC,IAEJA,EAAO,SAEHC,IACJA,EAAW,CACV,GAAA1J,CAAe2J,GACd,GAA2B,mBAAhB/L,KAAK0L,GACf,MAAM,IAAI/F,MAAM,+CAEjB,OAAO3F,KAAK0L,GAAOK,EACpB,EACA,GAAAxK,CAAewK,EAAejH,GAC7B,GAA2B,mBAAhB9E,KAAK2L,GACf,MAAM,IAAIhG,MAAM,sDAEjB3F,KAAK2L,GAAOI,EAAOjH,EACpB,IAIF,MAAe8G,UAAmBC,GA8FlC,OA1FA3K,OAAO8K,eACNJ,EAAUnJ,UACV,IAAI0D,MAAO0F,EAAcpJ,UAAW,CAEnC,CAACa,OAAO0F,aAAc,kBACtB,GAAA5G,CAAIoH,EAAQvI,EAAM+F,GACjB,GAAI/F,KAAQuI,EAAQ,CACnB,MAAMO,EAAS7I,OAAOI,yBAAyBkI,EAAQvI,IAAOmB,IAC9D,OAAO2H,EAASA,EAAO5J,KAAK6G,GAAYwC,EAAOvI,EAChD,CACA,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqB6K,EAASG,UAAW,OAAOH,EAASG,UAAU9L,KAAK6G,GAC5E,MAAMkF,EAAU5F,OAAOrF,GACvB,IAAKqF,OAAO6F,MAAMD,GACjB,OAAOJ,EAAS1J,IAAKjC,KAAK6G,EAAUkF,EAEtC,CAED,EACA,GAAA3K,CAAIiI,EAAQvI,EAAM6D,EAAOkC,GACxB,GAAI/F,KAAQuI,EAAQ,CACnB,MAAMS,EAAS/I,OAAOI,yBAAyBkI,EAAQvI,IAAOM,IAG9D,OAFI0I,EAAQA,EAAO9J,KAAK6G,EAAUlC,GAC7B0E,EAAOvI,GAAQ6D,GACb,CACR,CACA,GAAoB,iBAAT7D,EAAmB,CAC7B,GAAa,WAATA,GAAqB6K,EAASM,UAEjC,OADAN,EAASM,UAAUjM,KAAK6G,EAAUlC,IAC3B,EAER,MAAMoH,EAAU5F,OAAOrF,GACvB,IAAKqF,OAAO6F,MAAMD,GAAU,CAC3B,IAAKJ,EAASvK,IAAK,MAAM,IAAIoE,MAAM,sDAEnC,OADAmG,EAASvK,IAAKpB,KAAK6G,EAAUkF,EAASpH,IAC/B,CACR,CACD,CAOA,OANA5D,OAAOQ,eAAesF,EAAU/F,EAAM,CACrC6D,QACAoC,UAAU,EACVC,YAAY,EACZ3F,cAAc,KAER,CACR,EACA,GAAAuD,CAAIyE,EAAQvI,GACX,GAAIA,KAAQuI,EAAQ,OAAO,EAC3B,GAAoB,iBAATvI,EAAmB,CAC7B,GAAa,WAATA,GAAqB6K,EAASG,UAAW,OAAO,EACpD,MAAMC,EAAU5F,OAAOrF,GACvB,IAAKqF,OAAO6F,MAAMD,GAAU,OAAO,CACpC,CACA,OAAO,CACR,EACA,OAAAG,CAAQ7C,GACP,MAAMlB,EAAOpC,QAAQmG,QAAQ7C,GAC7B,GAAIsC,EAASG,UAAW,CACvB3D,EAAKxI,KAAK,UACV,MAAMwM,EAAMR,EAASG,UAAU9L,KAAKH,MACpC,IAAK,IAAIK,EAAI,EAAGA,EAAIiM,EAAKjM,IAAKiI,EAAKxI,KAAKuG,OAAOhG,GAChD,CACA,OAAOiI,CACR,EACA,wBAAAhH,CAAyBkI,EAAQvI,GAChC,GAAIA,KAAQuI,EAAQ,OAAOtI,OAAOI,yBAAyBkI,EAAQvI,GACnE,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqB6K,EAASG,UACjC,MAAO,CACN9E,YAAY,EACZ3F,cAAc,EACdY,IAAK,IAAM0J,EAASG,UAAW9L,KAAKH,OAGtC,MAAMkM,EAAU5F,OAAOrF,GACvB,IAAKqF,OAAO6F,MAAMD,GACjB,MAAO,CACN/E,YAAY,EACZ3F,cAAc,EACdY,IAAK,IAAM0J,EAAS1J,IAAKjC,KAAKH,KAAakM,GAC3C3K,IAAKuK,EAASvK,IACVgL,GAAWT,EAASvK,IAAKpB,KAAKH,KAAakM,EAASK,QACrD5C,EAGN,CAED,KAGKiC,CACR,OAOaY,EAAelJ,OAAO,sBAStBmJ,EACZ,IAAeD,KACd,MAAM,IAAI7G,MAAM,sCACjB,CAKA,UAAIrF,GACH,OAAON,KAAKwM,GAAclM,MAC3B,CAUA,CAACgD,OAAOoJ,YACP,OAAO1M,KAAKwM,GAAclJ,OAAOoJ,WAClC,CAOA,GAAAC,CAAOC,EAAiEC,GACvE,OAAO7M,KAAKwM,GAAcG,IAAIC,EAAYC,EAC3C,CAUA,MAAAC,CAAOC,EAAsEF,GAC5E,OAAO7M,KAAKwM,GAAcM,OAAOC,EAAWF,EAC7C,CAgBA,MAAAG,CACCJ,EAMAK,GAEA,YAAwBtD,IAAjBsD,EACJjN,KAAKwM,GAAcQ,OAAOJ,EAAYK,GACtCjN,KAAKwM,GAAcQ,OAAOJ,EAC9B,CAgBA,WAAAM,CACCN,EAMAK,GAEA,YAAwBtD,IAAjBsD,EACJjN,KAAKwM,GAAcU,YAAYN,EAAYK,GAC3CjN,KAAKwM,GAAcU,YAAYN,EACnC,CAKA,OAAAO,CAAQP,EAAoEC,GAC3E7M,KAAKwM,GAAcW,QAAQP,EAAYC,EACxC,CAaA,IAAAO,CACCL,EACAF,GAEA,OAAO7M,KAAKwM,GAAcY,KAAKL,EAAWF,EAC3C,CAKA,SAAAQ,CACCN,EACAF,GAEA,OAAO7M,KAAKwM,GAAca,UAAUN,EAAWF,EAChD,CAaA,QAAAS,CACCP,EACAF,GAEA,OAAO7M,KAAKwM,GAAcc,SAASP,EAAWF,EAC/C,CAKA,aAAAU,CACCR,EACAF,GAEA,OAAO7M,KAAKwM,GAAce,cAAcR,EAAWF,EACpD,CAKA,QAAAhD,CAAS2D,EAAkBC,GAC1B,OAAOzN,KAAKwM,GAAc3C,SAAS2D,EAAeC,EACnD,CAKA,OAAAC,CAAQF,EAAkBC,GACzB,OAAOzN,KAAKwM,GAAckB,QAAQF,EAAeC,EAClD,CAKA,WAAAE,CAAYH,EAAkBC,GAC7B,OAAOzN,KAAKwM,GAAcmB,YAAYH,EAAeC,EACtD,CAKA,KAAAG,CAAMC,EAAgBC,GACrB,OAAO9N,KAAKwM,GAAcoB,MAAMC,EAAOC,EACxC,CAOA,MAAAC,IAAUC,GACT,OAAOhO,KAAKwM,GAAcuB,UAAUC,EACrC,CAKA,KAAAC,CACClB,EACAF,GAEA,OAAO7M,KAAKwM,GAAcyB,MAAMlB,EAAWF,EAC5C,CAKA,IAAAqB,CACCnB,EACAF,GAEA,OAAO7M,KAAKwM,GAAc0B,KAAKnB,EAAWF,EAC3C,CAKA,IAAAsB,CAAKC,GACJ,OAAOpO,KAAKwM,GAAc2B,KAAKC,EAChC,CAKA,IAAA9F,GACC,OAAOtI,KAAKwM,GAAclE,MAC3B,CAKA,MAAArD,GACC,OAAOjF,KAAKwM,GAAcvH,QAC3B,CAKA,OAAAoJ,GACC,OAAOrO,KAAKwM,GAAc6B,SAC3B,CAKA,QAAA5H,GACC,OAAOzG,KAAKwM,GAAc/F,UAC3B,CAKA,cAAA6H,CACCC,EACArM,GAEA,OAAOlC,KAAKwM,GAAc8B,eAAeC,EAA8BrM,EACxE,CAKA,EAAAsM,CAAGzC,GACF,OAAO/L,KAAKwM,GAAcgC,GAAGzC,EAC9B,CAKA,IAAA0C,CAAKC,GACJ,OAAO1O,KAAKwM,GAAciC,KAAKC,EAChC,CAMA,OAAAC,CACCtJ,EACAwH,GAEA,OAAO7M,KAAKwM,GAAcmC,QAAQtJ,EAAiBwH,EACpD,CAKA,UAAA+B,GACC,OAAO5O,KAAKwM,GAAcoC,gBAAkB,IAAI5O,KAAKwM,IAAeqC,SACrE,CAKA,QAAAC,CAASC,GACR,OAAO/O,KAAKwM,GAAcsC,WAAWC,IAAc,IAAI/O,KAAKwM,IAAewC,KAAKD,EACjF,CAKA,SAAAE,CAAUpB,EAAeqB,KAAyBlB,GACjD,YAAoBrE,IAAhBuF,EAAkClP,KAAKwM,GAAcyC,UAAUpB,GAC5D7N,KAAKwM,GAAcyC,UAAUpB,EAAOqB,KAAgBlB,EAC5D,CAKA,KAAKjC,EAAejH,GACnB,OAAO9E,KAAKwM,GAAc2C,KAAKpD,EAAOjH,EACvC,CACA,IAAKxB,OAAO8L,eACX,OAAOpP,KAAKwM,GAAclJ,OAAO8L,YAClC,gBCtgBYC,EAKZ,WAAAlG,CAAYkF,GAKX,GATOrO,KAAAsP,MAAQ,IAAIpQ,QACZc,KAAAuP,KAA0C,CAAA,EA8EzCvP,KAAAwP,GAA+B,kBAzEvCxP,KAAKyP,SAAW,IAAIzE,qBAAsB0E,WAClC1P,KAAKuP,KAAKG,KAEdrB,EAAS,IAAK,MAAOsB,EAAGpD,KAAM8B,EAASrO,KAAKuB,IAAIoO,EAAGpD,EACxD,CACQ,cAAAqD,CAAkBC,GACzB,MAAMN,KAAEA,GAASvP,KACjB,OAAO,YACN,IAAK,MAAM0P,KAAQxO,OAAOoH,KAAKiH,GAAO,CACrC,MAAOO,EAAQhL,GAASyK,EAAKG,GACvBxH,EAAM4H,EAAOC,QACf7H,QAAW2H,EAAG3H,EAAKpD,UACXyK,EAAKG,EAClB,CAEA,CARM,EASR,CACA,KAAAM,GAEC,IAAK,MAAMN,KAAQxO,OAAOoH,KAAKtI,KAAKuP,MAAO,CAC1C,MAAMrH,EAAMlI,KAAKuP,KAAKG,GAAM,GAAGK,QAC3B7H,GAAKlI,KAAKyP,SAASQ,WAAW/H,EACnC,CACAlI,KAAKsP,MAAQ,IAAIpQ,QACjBc,KAAKuP,KAAO,CAAA,CACb,CACA,OAAOrH,GACN,MAAMwH,EAAO1P,KAAKsP,MAAMlN,IAAI8F,GAC5B,QAAKwH,WACE1P,KAAKuP,KAAKG,GACjB1P,KAAKsP,MAAM/O,OAAO2H,GAClBlI,KAAKyP,SAASQ,WAAW/H,IAClB,EACR,CACA,OAAAiF,CAAQP,EAAwDC,GAC/D,IAAK,MAAO8C,EAAGpD,KAAMvM,KAAM4M,EAAWzM,KAAK0M,GAAW7M,KAAMuM,EAAGoD,EAAG9C,GAAW7M,KAC9E,CACA,GAAAoC,CAAI8F,GACH,MAAMwH,EAAO1P,KAAKsP,MAAMlN,IAAI8F,GAC5B,GAAKwH,EACL,OAAO1P,KAAKuP,KAAKG,GAAM,EACxB,CACA,GAAA3K,CAAImD,GACH,OAAOlI,KAAKsP,MAAMvK,IAAImD,EACvB,CACA,GAAA3G,CAAI2G,EAAQpD,GACX,IAAI4K,EAAO1P,KAAKsP,MAAMlN,IAAI8F,GAU1B,OATIwH,EACH1P,KAAKuP,KAAKG,GAAM,GAAK5K,GAErB4K,EAAOQ,OAAOC,aACdnQ,KAAKsP,MAAM/N,IAAI2G,EAAKwH,GACpB1P,KAAKuP,KAAKG,GAAQ,CAAC,IAAIU,QAAQlI,GAAMpD,GAErC9E,KAAKyP,SAASY,SAASnI,EAAKwH,EAAMxH,IAE5BlI,IACR,CACA,QAAI+D,GACH,MAAO,IAAI/D,MAAMM,MAClB,CACA,OAAA+N,GACC,OAAOrO,KAAK4P,eAAe,CAAC1H,EAAKpD,IAAU,CAACoD,EAAKpD,GAClD,CACA,IAAAwD,GACC,OAAOtI,KAAK4P,eAAe,CAAC1H,EAAKoI,IAAWpI,EAC7C,CACA,MAAAjD,GACC,OAAOjF,KAAK4P,eAAe,CAACW,EAAMzL,IAAUA,EAC7C,CACA,CAACxB,OAAOoJ,YACP,OAAO1M,KAAKqO,SACb,EACUmB,EAAAlM,OAAO0F,kBAOLwH,EAKZ,WAAArH,CAAYkF,GAKX,GATOrO,KAAAsP,MAAQ,IAAIpQ,QACZc,KAAAuP,KAAmC,CAAA,EA0ElCvP,KAAAyQ,GAA+B,kBArEvCzQ,KAAKyP,SAAW,IAAIzE,qBAAsB0E,WAClC1P,KAAKuP,KAAKG,KAEdrB,EAAS,IAAK,MAAMsB,KAAKtB,EAASrO,KAAKT,IAAIoQ,EAChD,CACQ,cAAAC,CAAkBC,GACzB,MAAMN,KAAEA,GAASvP,KACjB,OAAO,YACN,IAAK,MAAM0P,KAAQxO,OAAOoH,KAAKiH,GAAO,CACrC,MAAMrH,EAAMqH,EAAKG,GAAMK,QACnB7H,QAAW2H,EAAG3H,UACNqH,EAAKG,EAClB,CAEA,CAPM,EAQR,CAEA,KAAAM,GAEC,IAAK,MAAMN,KAAQxO,OAAOoH,KAAKtI,KAAKuP,MAAO,CAC1C,MAAMzK,EAAQ9E,KAAKuP,KAAKG,GAAMK,QAC1BjL,GAAO9E,KAAKyP,SAASQ,WAAWnL,EACrC,CACA9E,KAAKsP,MAAQ,IAAIpQ,QACjBc,KAAKuP,KAAO,CAAA,CACb,CAEA,GAAAhQ,CAAIuF,GACH,IAAI4K,EAAO1P,KAAKsP,MAAMlN,IAAI0C,GAQ1B,OAPK4K,IACJA,EAAOQ,OAAOC,aACdnQ,KAAKsP,MAAM/N,IAAIuD,EAAO4K,GACtB1P,KAAKuP,KAAKG,GAAQ,IAAIU,QAAQtL,GAE9B9E,KAAKyP,SAASY,SAASvL,EAAO4K,EAAM5K,IAE9B9E,IACR,CACA,OAAO8E,GACN,MAAM4K,EAAO1P,KAAKsP,MAAMlN,IAAI0C,GAC5B,QAAK4K,WACE1P,KAAKuP,KAAKG,GACjB1P,KAAKsP,MAAM/O,OAAOuE,GAClB9E,KAAKyP,SAASQ,WAAWnL,IAClB,EACR,CAEA,OAAAqI,CAAQP,EAAwDC,GAC/D,IAAK,MAAM/H,KAAS9E,KAAM4M,EAAWzM,KAAK0M,GAAW7M,KAAM8E,EAAOA,EAAO+H,GAAW7M,KACrF,CAEA,GAAA+E,CAAID,GACH,OAAO9E,KAAKsP,MAAMvK,IAAID,EACvB,CACA,QAAIf,GACH,MAAO,IAAI/D,MAAMM,MAClB,CACA,OAAA+N,GACC,OAAOrO,KAAK4P,eAAgB1H,GAAQ,CAACA,EAAKA,GAC3C,CACA,IAAAI,GACC,OAAOtI,KAAK4P,eAAgB1H,GAAQA,EACrC,CACA,MAAAjD,GACC,OAAOjF,KAAK4P,eAAgB1H,GAAQA,EACrC,CACA,CAAC5E,OAAOoJ,YACP,OAAO1M,KAAKsI,MACb,CAGA,KAAAoI,CAASC,GACR,MAAMC,EAAS,CACd,CAACtN,OAAOoJ,UAAS,IACTiE,EAAMrI,QAGTuI,EAAO7Q,KACb,OAAO,IAAIhB,IACV,kBACQ6R,EACP,IAAK,MAAM/L,KAAS8L,EAAaC,EAAK9L,IAAiBD,WAAeA,EACtE,CAHD,GAKF,CACA,YAAAgM,CAAqBH,GACpB,MAAME,EAAO7Q,KACb,OAAO,IAAIhB,IACV,YACC,IAAK,MAAM8F,KAAS+L,EAAUF,EAAM5L,IAAiBD,WAAsBA,EAC3E,CAFD,GAIF,CACA,UAAAiM,CAAcJ,GACb,MAAME,EAAO7Q,KACb,OAAO,IAAIhB,IACV,YACC,IAAK,MAAM8F,KAAS+L,EAAWF,EAAM5L,IAAiBD,WAAkBA,EACxE,CAFD,GAIF,CACA,mBAAAkM,CAAuBL,GACtB,MAAMC,EAAS,CACd,CAACtN,OAAOoJ,UAAS,IACTiE,EAAMrI,QAGTuI,EAAO7Q,KACb,OAAO,IAAIhB,IACV,YACC,IAAK,MAAM8F,KAAS+L,EAAWF,EAAM5L,IAAiBD,WAAsBA,GAC5E,IAAK,MAAMA,KAAS8L,EAAaC,EAAK9L,IAAiBD,WAAsBA,EAC7E,CAHD,GAKF,CACA,UAAAmM,CAAWN,GACV,IAAK,MAAM7L,KAAS9E,KAAM,IAAK2Q,EAAM5L,IAAID,GAAQ,OAAO,EACxD,OAAO,CACR,CACA,YAAAoM,CAAaP,GACZ,MAAMC,EAAS,CACd,CAACtN,OAAOoJ,UAAS,IACTiE,EAAMrI,QAGf,IAAK,MAAMxD,KAAS8L,EAAQ,IAAK5Q,KAAK+E,IAAOD,GAAQ,OAAO,EAC5D,OAAO,CACR,CACA,cAAAqM,CAAeR,GACd,IAAK,MAAM7L,KAAS9E,KAAM,GAAI2Q,EAAM5L,IAAID,GAAQ,OAAO,EACvD,OAAO,CACR,ECxMK,SAAUsM,EACfC,EACAC,GAYA,MAAMC,EAAa,IAAIrS,QAGjBsS,EAAYH,EAAcnQ,QAIhC,OAHAqQ,EAAWhQ,IAAIL,OAAQsQ,GAGhB,IAAIrL,MAAMqL,EAAW,CAE3B,KAAAzR,CAAM8K,EAAS4G,EAAU9R,GACxB,GAAoB,IAAhBA,EAAKW,OACR,MAAM,IAAIqF,MAAM,+BAGjB,MAAM+L,EAAY/R,EAAK,GACvB,GAAyB,mBAAd+R,EACV,MAAM,IAAI/L,MAAM,yCAIjB,KACEa,EAAckL,IACbA,GAAkC,mBAAdA,GAA4BA,EAAUjP,WAE5D,MAAM,IAAIkD,MAAM,sCAIjB,MAAMgM,EAASJ,EAAWnP,IAAIsP,GAC9B,GAAIC,EACH,OAAOA,EAGR,IAAIC,EAAWF,EACf,GAAIJ,EAAgB,CAEnB,MAAMO,EAAmB,cAAcH,IAGjCI,EAAoBJ,EAAUjP,UAC9BsP,EAAmB,IAAI5L,MAAM2L,EAAmB,CACrD,GAAA1P,CAAIoH,EAAQvI,EAAM+F,GACjB,MAAMlC,EAAQgC,EAAU1E,IAAIoH,EAAQvI,EAAM+F,GAI1C,MACkB,mBAAVlC,GACS,iBAAT7D,GACN,CAAC,cAAe,WAAY,WAAW4I,SAAS5I,GAU3C6D,EAPC,YAAwBnF,GAE9B,MAAMkE,EAAUyN,EAAetR,MAC/B,OAAO8E,EAAM/E,MAAM8D,EAASlE,EAC7B,CAIF,IAIDuB,OAAO8K,eAAe6F,EAAiBpP,UAAWsP,GAClDH,EAAWC,CACZ,CAGA,MAAMG,EAAaX,EAAcO,GAKjC,OAFAL,EAAWhQ,IAAImQ,EAAWM,GAEnBA,CACR,GAEF,CD+CWvB,EAAAnN,OAAO0F,YElJlB,MAAMiJ,EACL,CAACrL,EAAc4C,IACf,IAAI7J,IACI6J,EAAO5C,MAASjH,GAGnBuS,EAAiB,IAAIhT,QACrBe,EAAY,IAAIf,QAEtB,SAASuI,GAAM+B,EAAae,GAC3BtK,EAAUsB,IAAIgJ,EAAIf,GAClB0I,EAAe3Q,IAAIiI,EAAQe,EAC5B,CAQA,MAAM4H,GAA0D,CAE/D,CAAC7O,OAAO0F,aAAc,8BACtB5G,IAAG,CAACoH,EAAQvI,IACPA,IAASqC,OAAO0F,YAAoB,eACpB,iBAAT/H,GAAqB,CAAC,OAAQ,QAAS,WAAW4I,SAAS5I,GAC9DuI,EAAOvI,GACRmR,GAAa5I,EAAO/I,KAAM4R,GAAMA,EAAEpR,MAGrCqR,GAAkB9I,IAAW,CAElC/I,KAAMwR,EAAQ,OAAQzI,GACtBpF,MAAO6N,EAAQ,QAASzI,GACxBnF,QAAS4N,EAAQ,UAAWzI,KAEvB+I,GAAwC,CAE7C,CAACjP,OAAO0F,aAAc,4BACtB,GAAA5G,CAAIoH,EAAQvI,EAAM+F,GACjB,MAAM+C,EAAS7I,OAAOI,yBAAyBkI,EAAQvI,IAAOmB,IACxDmI,EAAKR,EAASA,EAAO5J,KAAK6G,GAAYwC,EAAOvI,GAEnD,MAAsB,mBAAXuI,EAA8Be,EAClC6H,GAAa7H,EACrB,EACAxK,MAAK,CAACyJ,EAAQqD,EAASlN,IACfyS,GAAa5I,EAAOzJ,MAAM8M,EAASlN,KAG5C,SAAS6S,GAAyCC,GACjD,MAAMlI,EAAK,IAAIpE,MAAMsM,EAAOF,IAE5B,OADA9K,GAAMgL,EAAOlI,GACNA,CACR,CAEA,SAASmI,GAAUC,GAClB,OAAOA,GAAK,CAAC,WAAY,UAAU9I,gBAAgB8I,EACpD,CAOM,SAAUP,GAAgBK,GAC/B,IAAKC,GAAUD,GAAQ,OAAOA,EAC9B,GAAIP,EAAenN,IAAI0N,GAAQ,OAAOP,EAAe9P,IAAIqQ,GACzD,KAAMA,aAAiB/R,SAAU,OAAO8R,GAAYC,GAEpDA,EAAQA,EAAMhS,KAAM4R,GAAOK,GAAUL,GAAKG,GAAYH,GAAKA,GAC3D,MAAM7I,EAAStI,OAAO2D,OAAO,YAAwBlF,GACpD,OAAOyS,GACNK,EAAMhS,KAAM4R,GACJrS,MAAMS,KACVT,KAAKS,KAAMmS,GAAYP,EAAUtS,MAAM6S,EAAGjT,IACzC0S,EAAUtS,MAAMC,KAAML,IAG7B,EAAG2S,GAAeG,IACZI,EAAU,IAAI1M,MACnBqD,EACA2I,IAGD,OADA1K,GAAMgL,EAAOI,GACNA,CACR,CCWA,MAAMC,GAAiBxP,OAAO,mBAKjByP,GAAkBzP,OAAO,gBAIzB0P,GAAuB1P,OAAO,yBAK9B2P,GAAW3P,OAAO,aAKlB4P,GAAiB5P,OAAO,mBAKxB6P,GAAU7P,OAAO,WAKjB8P,GAAU9P,OAAO,WAcxB+P,GAAe/P,OAAO,iBAK5B,IAAYgQ,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,iBA2CK,MAAOC,WAAsB5N,MAClC,WAAAwD,CACCC,EACOoK,GAEPnK,MAAMD,GAFCpJ,KAAAwT,UAAAA,EAGPxT,KAAK4G,KAAO,eACb,CAEA,QAAI6M,GACH,OAAOzT,KAAKwT,WAAWC,IACxB,CAEA,SAAIC,GACH,OAAQ1T,KAAKwT,WAAmBE,KACjC,EAOM,MAAMxR,GAAU,CAKtByR,MAAQC,MAKRC,MAAQD,MAMRE,MAAO,CAACC,EAAsBC,OAK9BC,WAAaF,MAIbG,SAAU,OACVC,iBAAmBC,MAQnBC,QAAS,CAACC,EAAWC,EAAuBC,EAAgBC,OAM5DC,kBAAoBd,MAMpBe,eAAgB,IAMhBC,mBAAoB,GAMpBC,kBAAmB,QAoBnBC,8BAA0BnL,EAyB1BoL,cAAe,OAKfC,mBAAmB,EAMnBC,kBAAmB,IAMnBC,iBAAiB,EAKjBC,iBAAiB,EAOjBC,mBAAmB,EAiBnBC,UAAW,SAEXC,KAAM,IAAI3V,OAKV4V,cAAe,CAKdC,eAAe,EAKfC,YAAa,IASdC,MAAO,CAKN7U,YAAY,EAKZ6D,aAAa,EAKbE,uBAAuB,EAKvB1E,gBAAgB,IC/aLyV,GAA0B,IAAIzW,QAG9B0W,GAAW,IAAI1W,QAGf2W,GAAiB,IAAI3W,QAGrB4W,GAAe,IAAI5W,QAG1B6W,GAAe,IAAI7W,QASnB,SAAU8W,GAAiCvW,EAAOwW,GAEvD,MAAMC,EAAcH,GAAa3T,IAAI6T,GAC/BE,EAAWD,GAAanG,QAE9B,GAAIoG,GAAYA,IAAa1W,EAAI,CAChC,MAAM2W,EAAWH,EAAKrP,MAAQ,YACxByP,EAAeF,EAASvP,MAAQ,YAChC0P,EAAS7W,EAAGmH,MAAQ,YAC1B,MAAM,IAAIjB,MACT,kDAAkDyQ,uCAA8CC,4BACvEC,iEAE3B,CAOA,OAHAP,GAAaxU,IAAI0U,EAAM,IAAI7F,QAAQ3Q,IAG5ByB,OAAOQ,eAAejC,EAAI4T,GAAc,CAC9CvO,MAAOyR,GAAQN,GACf/O,UAAU,GAEZ,CAOM,SAAUqP,GAAwC9W,GACvD,KAAOA,GAAM4T,MAAgB5T,GAAIA,EAAKA,EAAG4T,IACzC,OAAO5T,CACR,CChDA,MAAM+W,GAAkBlT,OAAO,mBAG/B,IAAImT,IAAkB,EAGtB,MAAMC,GAAsB,IAAI1X,IAC1B2X,GAAsB,IAAI3X,IAG1B4X,GAAc,IAAI1X,QAClB2X,GAAc,IAAI3X,QACxB,IAAI4X,GAAgB,EAChBC,GAAgB,EAYpB,MAAMC,GAAe,IAAI3U,IAuCzB,SAAS4U,GAAiBC,GACzB,IAAItQ,EAAOgQ,GAAYxU,IAAI8U,GAC3B,IAAKtQ,EAAM,CACV,MAAMqP,EAAOM,GAAQW,GACrBtQ,EAAOqP,GAAMrP,MAAMuQ,QAAU,aAAYL,GACzCF,GAAYrV,IAAI2V,EAAQtQ,EACzB,CACA,OAAOA,CACR,CAEA,SAASwQ,GAAiBrQ,GACzB,IAAIH,EAAOiQ,GAAYzU,IAAI2E,GAC3B,IAAKH,EAAM,CACV,MAAMyQ,EAAYtQ,GAAaoC,aAAavC,KAE5CA,EAAO,GADMyQ,GAAyB,WAAbA,EAAwBA,EAAW,cACxCN,KACpBF,GAAYtV,IAAIwF,EAAKH,EACtB,CACA,OAAOA,CACR,CASA,SAAS0Q,GAAoBJ,GAC5B,IAAKA,GAAUR,GAAoB3R,IAAImS,GAAS,OAChDR,GAAoBnX,IAAI2X,GACxB,MAAMK,EAAO5B,GAAwBvT,IAAI8U,GACzC,GAAIK,EACH,IAAK,MAAMxQ,KAAOwQ,EACjBC,GAAezQ,EAGlB,CAEA,SAASyQ,GAAezQ,GAClB4P,GAAoB5R,IAAIgC,IAK9B,SAA0BA,GACzB4P,GAAoBpX,IAAIwH,GACxBqQ,GAAiBrQ,EAClB,CAPE0Q,CAAiB1Q,EAEnB,CA4BA,SAAS2Q,GACRC,EACAnO,EACAoO,EACA7Q,EACA9F,EACA4W,GAEA,MAAMC,EAjBP,SAAiCH,GAChC,IAAIG,EAAYd,GAAa5U,IAAIuV,GAKjC,OAJKG,IACJA,EAAY,IAAIzV,IAChB2U,GAAazV,IAAIoW,EAAQG,IAEnBA,CACR,CAUmBC,CAAwBJ,GAC1C,IAAIK,EAAWF,EAAU1V,IAAIoH,GACxBwO,IACJA,EAAW,IAAI3V,IACfyV,EAAUvW,IAAIiI,EAAQwO,IAEvB,IAAIC,EAASD,EAAS5V,IAAIwV,GAK1B,OAJKK,IACJA,EAAS,CAAEL,QAAOM,OAAQnR,EAAK9F,OAAM4W,YAAWM,MAAO,EAAGC,cAAe5S,KAAK6S,OAC9EL,EAASzW,IAAIqW,EAAOK,IAEdA,CACR,CAKM,SAAUK,GAAcpB,EAAwBtQ,GACrDgQ,GAAYrV,IAAI2V,EAAQtQ,EACzB,CAKM,SAAU2R,GAAcxR,EAAaH,GAC1CiQ,GAAYtV,IAAIwF,EAAKH,GACrB+P,GAAoBpX,IAAIwH,EACzB,CAKM,SAAUyR,GAAuBtB,GACjCA,GAAWT,IAChBa,GAAoBJ,EACrB,CAKM,SAAUuB,GAAuB1R,GACjC0P,IACLe,GAAezQ,EAChB,CAUM,SAAU2R,GACff,EACAnO,EACAzC,EACA9F,EACA4W,GAKA,GAHI3V,GAAQqT,cAAcC,eAmR3B,SACCmC,EACAnO,EACAzC,EACA9F,EACA4W,GAEA,MAAMI,EAAyB,CAC9BU,KAAMC,GACNC,UAAWrT,KAAK6S,MAChBV,OAAQA,EAASV,GAAiBU,GAAU,WAC5CnO,OAAQyN,GAAiBzN,GACzBsP,WAAY1B,GAAiBrQ,GAC7B9F,KAAMoF,OAAOpF,GACbe,KAAM6V,EAAU7V,MAGjB+W,GAAgBjZ,KAAKmY,GACjBc,GAAgBzY,OAAS4B,GAAQqT,cAAcE,aAClDsD,GAAgBC,OAElB,CAvSEC,CAAqBtB,EAAQnO,EAAQzC,EAAK9F,EAAM4W,IAE5CpB,GAAiB,OACtBa,GAAoB9N,GAChBmO,GAAQL,GAAoBK,GAChC,MAAMjO,EA5HP,SAAsB3C,EAAa9F,GAClC,MAAM6X,EAAa1B,GAAiBrQ,GACpC,OAAI9F,IAASgS,GAAiB,GAAG6F,MACb,iBAAT7X,EAA0B,GAAG6X,KAAc7X,EAAKsI,aAAetI,EAAKwF,aACxE,GAAGqS,KAAczS,OAAOpF,IAChC,CAuHoBiY,CAAanS,EAAK9F,GAC/BgX,EAASP,GACdC,GAAUnB,GACVhN,EACAE,EACA3C,EACA9F,EACA4W,GAEDI,EAAOE,OAAS,EAChBF,EAAOG,cAAgB5S,KAAK6S,MAC5Bb,GAAezQ,EAChB,UAOgBoS,GAAgBjC,EAAwBkC,EAAQ,GAC/D,MAAMtF,EAAkB,GACxB,IAAIuF,EAAUnC,EACd,IAAK,IAAI7W,EAAI,EAAGA,EAAI+Y,EAAO/Y,IAAK,CAI/B,IAAIiZ,EACAC,EAAc,GAElBC,EAAQ,IAAK,MAAO7B,EAAQG,KAAcd,GACzC,IAAK,MAAOxN,EAAQwO,KAAaF,EAChC,GAAItO,IAAW6P,EAAS,CAEvB,IAAII,EAAW,EACf,IAAK,MAAMxB,KAAUD,EAAS/S,SACzBgT,EAAOG,cAAgBqB,IAC1BA,EAAWxB,EAAOG,cAClBmB,EAActB,EAAOL,MACrB0B,EAAc3B,IAAWnB,QAAkB7M,EAAagO,GAG1D,GAAI2B,GAAeC,EAAa,MAAMC,CACvC,CAIF,IAAIF,EAKG,IAAIC,EAAa,CACvBzF,EAAMhU,KAAK,gBAAgByZ,SAAmBtC,GAAiBoC,MAC/D,KACD,CACC,KACD,CATCvF,EAAMhU,KACL,GAAGmX,GAAiBqC,UAAoBC,SAAmBtC,GAAiBoC,MAE7EA,EAAUC,CAOZ,CACA,OAAOxF,EAAMjF,SACd,UAgDgB6K,KACf,MAAMC,EAAwC,GACxCC,EAAqB,GACrBC,EAAU,IAAIxX,IAEdyX,EAAa,IAAI9a,IAAoB0X,KA/M5C,SAA4BqD,GAC3B,MAAMC,EAAQzU,MAAM0U,KAAKF,GACzB,IAAK,IAAI1Z,EAAI,EAAGA,EAAI2Z,EAAM1Z,OAAQD,IAAK,CACtC,MAAM6W,EAAS8C,EAAM3Z,GACf6Z,EAASpE,GAAa1T,IAAI8U,GAC5BgD,IAAWH,EAAQhV,IAAImV,KAC1BH,EAAQxa,IAAI2a,GACZF,EAAMla,KAAKoa,GAEb,CACD,CAsMCC,CAAmBL,GACnB,MAAQH,MAAOS,EAAWC,aAAEA,GArD7B,SAA0BP,GACzB,MAAMH,EAAsB,GACtBU,EAAe,IAAIhY,IAEnBiY,EAAU/U,MAAM0U,KAAKH,GAC3B,IAAK,MAAM5C,KAAUoD,EAAS,CAC7B,MAAM1C,EAAQX,GAAiBC,GACzBqD,EAAmB,CACxB5B,GAAI,UAAUgB,EAAMrZ,SACpBsX,QACA5V,KAAM,SACN0M,MAAO,EACP8L,UAAW5C,GAEZ+B,EAAM7Z,KAAKya,GACXF,EAAa9Y,IAAI2V,EAAQqD,EAC1B,CAEA,MAAME,EAAa,IAAIpY,IACjBqY,EAAgBxD,IACrB,IAAKA,EAAQ,OAAO,EACpB,MAAMvF,EAAS8I,EAAWrY,IAAI8U,GAC9B,QAAevN,IAAXgI,EAAsB,OAAOA,EACjC,MAAMuI,EAASpE,GAAa1T,IAAI8U,GAC1BxI,EAAQgM,EAAaR,IAAWA,EAAS,EAAI,GAEnD,OADAO,EAAWlZ,IAAI2V,EAAQxI,GAChBA,GAGR,IAAK,MAAOwI,EAAQqD,KAASF,EAAc,CAC1CE,EAAK7L,MAAQgM,EAAaxD,GAC1B,MAAMgD,EAASpE,GAAa1T,IAAI8U,GAChC,GAAIgD,EAAQ,CACX,MAAMS,EAAaN,EAAajY,IAAI8X,GAChCS,IACHJ,EAAKK,SAAWD,EAAWhC,GAE7B,CACD,CAEA,MAAO,CAAEgB,QAAOU,eACjB,CAY8CQ,CAAiBf,GAC9D,IAAK,MAAMS,KAAQH,EAAaT,EAAM7Z,KAAKya,GAC3C,IAAK,MAAOrD,EAAQqD,KAASF,EAC5BR,EAAQtY,IAAI2V,EAAQqD,EAAK5B,IAI1B,IAAK,MAAM5R,KAAO4P,GAAqB,CACtC,MAAMgC,EAAK,UAAUgB,EAAMrZ,SAC3BqZ,EAAM7Z,KAAK,CAAE6Y,KAAIf,MAAOR,GAAiBrQ,GAAM/E,KAAM,QAASwY,UAAW3D,GAAYzU,IAAI2E,KACzF8S,EAAQtY,IAAIwF,EAAK4R,EAClB,CAGA,GAAI3B,GAAajS,IAAIyR,IAAkB,CACtC,MAAMsE,EAAa,kBACnBnB,EAAM7Z,KAAK,CAAE6Y,GAAImC,EAAYlD,MAAO,WAAY5V,KAAM,WAAY0M,MAAO,IACzEmL,EAAQtY,IAAIiV,GAAiBsE,EAC9B,CAGA,IAAK,MAAM5D,KAAU4C,EAAY,CAChC,MAAMiB,EAAWlB,EAAQzX,IAAI8U,GAC7B,IAAK6D,EAAU,SACf,MAAMxD,EAAO5B,GAAwBvT,IAAI8U,GACzC,GAAKK,EACL,IAAK,MAAMxQ,KAAOwQ,EAAM,CACvB,MAAMyD,EAAQnB,EAAQzX,IAAI2E,GACrBiU,GACLpB,EAAM9Z,KAAK,CACV6Y,GAAI,GAAGoC,MAAaC,IACpBrD,OAAQoD,EACRvR,OAAQwR,EACRhZ,KAAM,aACN4V,MAAO,WAET,CACD,CAGA,IAAK,MAAOD,EAAQG,KAAcd,GACjC,IAAK,MAAOiE,EAAcjD,KAAaF,EAAW,CACjD,MAAMoD,EAAWrB,EAAQzX,IAAI6Y,GAC7B,IAAKC,EAAU,SACf,MAAMC,EAAWtB,EAAQzX,IAAIuV,GAC7B,GAAKwD,EACL,IAAK,MAAMlD,KAAUD,EAAS/S,SAC7B2U,EAAM9Z,KAAK,CACV6Y,GAAI,GAAGwC,MAAaD,KAAYjD,EAAOL,QACvCD,OAAQwD,EACR3R,OAAQ0R,EACRlZ,KAAM,QACN4V,MAAOK,EAAOE,MAAQ,EAAI,GAAGF,EAAOL,UAAUK,EAAOE,SAAWF,EAAOL,MACvEO,MAAOF,EAAOE,OAGjB,CAGD,MAAO,CACNwB,QACAC,QACAwB,KAAM,CACLC,YAAa7V,KAAK6S,MAClB5B,oBAGH,UAyBgB6E,KACf,OAAO7E,EACR,CA0DA,MAAMsC,GAAoC,GAC1C,IAAIH,GAAkB,SC/dtB,SAAS2C,GAAOC,GACf,OAAOA,CACR,OACsBC,GAEX,KAAA9H,CAAM7O,GACf,MAAM4W,EAAO1b,KAAK2b,OAElB,OADA3b,KAAK2b,OAAS7W,EACP4W,CACR,CACU,KAAA7H,CAAM+H,GACf5b,KAAK2b,OAASC,CACf,CACA,KAAQ9W,EAAUrF,GACjB,MAAMmc,EAAU5b,KAAK2T,MAAM7O,GACrB,IAAItE,EACV,IACCA,EAAMf,GACP,SACCO,KAAK6T,MAAM+H,EACZ,CAGM,OAAOld,EAAWG,gBAAgB2B,EACzC,CACA,IAAAyV,CAAQxW,GACP,IAAIic,EAAO1b,KAAK2T,QAChB,IACC,OAAOlU,GACR,SACCO,KAAK6T,MAAM6H,EACZ,CACD,CACA,SAAIG,GACH,MAAMF,EAAS3b,KAAK2b,OACpB,OAAO1S,EAAM,GAAGjJ,QAAQ2b,IAAWlc,GAAOO,KAAKmP,KAAKwM,EAAQlc,GAC7D,EAKK,MAAOqc,WAAgBL,IAIvB,MAAOM,WAAuBN,GAG5B,GAAA1W,CAAID,GACV,OAAO9E,KAAKgc,QAAQjX,IAAID,EACzB,CACO,IAAAoJ,CAAKnB,GACX,IAAI,MAAMjI,KAAS9E,KAAKgc,QAAS,GAAGjP,EAAUjI,GAAQ,OAAO,EAC7D,OAAO,CACR,CACA,WAAAqE,CAAoB8S,EAAuB,IAAIH,IAC9CzS,QADmBrJ,KAAAic,WAAAA,EATZjc,KAAAgc,QAAU,IAAIhd,IAWrB,MAAMkd,EAAOlc,KACbA,KAAKmc,QAAUjb,OAAO2H,OAAOoT,EAC5B/a,OAAOkb,0BAA0B,CAChC,UAAIT,GAAW,OAAOM,EAAWN,MAAO,EACxC,UAAIA,CAAO7W,GACVmX,EAAWN,OAAS7W,CACrB,EACA,KAAA6O,CAAM7O,GACL,GAAGA,GAASoX,EAAKF,QAAQjX,IAAID,GAAQ,MAAM,IAAIa,MAAM,4CAErD,YADagE,IAAV7E,GAAqBoX,EAAKF,QAAQzc,IAAIuF,GAClC,CAAEuX,MAAOvX,EAAO8W,QAAaK,EAAYtI,MAAM7O,GACvD,EACA+O,MAAM+H,SACgBjS,IAAlBiS,EAAQS,OAAqBH,EAAKF,QAAQzb,OAAOqb,EAAQS,OACjDJ,EAAYpI,MAAM+H,EAAQA,YAIzC,CACA,UAAID,GACH,MAAO,CAACQ,QAASnc,KAAKic,WAAWN,OAAQK,QAAS,IAAIhd,IAAIgB,KAAKgc,SAChE,CACA,UAAIL,CAAO7W,GACV9E,KAAKgc,QAAUhc,KAAKgc,SAAW,IAAIhd,IAAIgB,KAAKgc,SAC5Chc,KAAKic,WAAWN,OAAS7W,GAAOqX,OACjC,EAGK,MAAOG,WAAuBb,GAEnC,WAAAtS,IAAeuM,GACdrM,QAFDkT,GAAAhb,IAAAvB,KAAS,IAAIhB,KAGZ,IAAK,MAAMwc,KAAK9F,EAAO8G,EAAAxc,KAAIuc,GAAA,KAAQhd,IAAIic,EACxC,CACA,UAAIG,GACH,MAAMpR,EAAK,IAAIlI,IACf,IAAK,MAAMmZ,KAAKgB,EAAAxc,KAAIuc,GAAA,UACF5S,IAAb6R,EAAEG,QAAsBpR,EAAGhJ,IAAIia,EAAGA,EAAEG,QACzC,OAAOpR,CACR,CACA,UAAIoR,CAAO7W,GACV,IAAK,MAAM0W,KAAKgB,EAAAxc,KAAIuc,GAAA,KAASf,EAAEG,OAAS7W,GAAO1C,IAAIoZ,EACpD,CACA,KAAA7H,CAAM7O,GACL,MAAM8W,EAAU,IAAIvZ,IACpB,IAAK,MAAMmZ,KAAKgB,EAAAxc,KAAIuc,GAAA,KAAS,CAC5B,MAAMhQ,EAAIzH,GAAO1C,IAAIoZ,GACrBI,EAAQra,IAAIia,EAAGD,GAAIC,GAAG7H,MAAMpH,GAC7B,CACA,OAAOqP,CACR,CACA,KAAA/H,CAAM+H,GACL,IAAK,MAAMJ,KAAKgB,EAAAxc,KAAIuc,GAAA,KAAShB,GAAIC,GAAG3H,MAAM+H,EAAQxZ,IAAIoZ,GACvD,CACA,GAAAjc,CAAIic,GACHgB,EAAAxc,KAAIuc,GAAA,KAAQhd,IAAIic,EACjB,CACA,OAAOA,GACNgB,EAAAxc,KAAIuc,GAAA,KAAQhc,OAAOib,EACpB,CACA,KAAAxL,GACCwM,EAAAxc,KAAIuc,GAAA,KAAQvM,OACb,iBAGM,MAAMyM,GAAY1T,EAAI,QAAS,IAAIuT,IAC1C5d,EAAWC,QAAQ,KAClB,MAAM+d,EAAOD,GAAUd,OACvB,MAAO,KACN,MAAMD,EAAOe,GAAUd,OAEvB,OADAc,GAAUd,OAASe,EACZ,IAAMD,GAAUd,OAASD,KClI3B,MAAMiB,GAAgB5T,EAAI,gBAAiB,IAAIgT,IACtDhT,EAAI,wBAAyB4T,GAAcR,SAC3CM,GAAUld,IAAIod,IACP,MAAMC,GAAmB7T,EAAI,mBAAoB,IAAIuT,GAAeK,GAAcR,UAEnF,SAAUU,GAAU3F,GACzB,MAAMjB,EAAOM,GAAQW,GACrB,OAAOyF,GAAczO,KAAM9I,GAAMmR,GAAQnR,KAAO6Q,EACjD,UAEgB6G,KACf,OAAOH,GAAcR,QAAQR,MAC9B,CCjBO,MAAMoB,GAAgB,IAAI7d,QACpB8d,GAAgB,IAAI9d,QAe3B,SAAU+d,GAAUlW,GACzB,IAAIsS,EAAUtS,EACd,KAAOsS,GAA8B,iBAAZA,GAAoC,OAAZA,GAAoB2D,GAAcjY,IAAIsU,IACtFA,EAAU2D,GAAc5a,IAAIiX,GAE7B,OAAOA,CACR,CCYA,SAAS6D,GAAiBC,GACzB,MAAMC,EAAO,IAAI/a,IACjB,IAAK,IAAIhC,EAAI,EAAGA,EAAI8c,EAAM7c,OAAQD,IAAK,CACtC,MAAM4V,EAAOkH,EAAM9c,GACnB,GAAI+c,EAAKrY,IAAIkR,GACZ,OAAOkH,EAAMvP,MAAMwP,EAAKhb,IAAI6T,IAE7BmH,EAAK7b,IAAI0U,EAAM5V,EAChB,CACA,OAAO,IACR,CAKA,SAASgd,GAAYF,EAAmB/D,EAAQ,IAC/C,MAAMkE,EAAQH,EAAMxQ,IAAK0F,GAAMA,EAAEzL,MAAQ,eACzC,GAAI0W,EAAMhd,QAAU8Y,EAAO,OAAOkE,EAAMnP,KAAK,OAC7C,MAAMN,EAAQyP,EAAM1P,MAAM,EAAG,GACvBE,EAAMwP,EAAM1P,WAClB,MAAO,GAAGC,EAAMM,KAAK,eAAemP,EAAMhd,OAAS,gBAAgBwN,EAAIK,KAAK,QAC7E,CAcA,IAAIoP,GAEG,MAAMC,GAAqD,IAAIjY,MAAM,KAMtE,SAAUkY,GACfvG,EACAnQ,EACA8Q,EACA5W,GAEA,MAAMgV,EAAOM,GAAQW,GAErB,IAAKqG,GAAoB,OACzB,IAAIG,EAAaH,GAAmBnb,IAAI6T,GACnCyH,IACJA,EAAa,IAAIrb,IACjBkb,GAAmBhc,IAAI0U,EAAMyH,IAE9B,IAAIC,EAAUD,EAAWtb,IAAI2E,GACxB4W,IACJA,EAAU,IAAItb,IACdqb,EAAWnc,IAAIwF,EAAK4W,IAErB,MAAMxF,GAASwF,EAAQvb,IAAInB,IAAS,GAAK,EAYzC,GAXA0c,EAAQpc,IAAIN,EAAMkX,GAGlBqF,GAAcI,QAAQ,CACrB1G,SACAnQ,MACA8Q,YACA5W,SAEDuc,GAAcK,MAEV1F,GAASjW,GAAQ0S,mBAAoB,CACxC,MAAMkJ,EAAc7H,GAAcrP,MAAQ,YACpCwC,EAAU,wCAAwC0U,gBAAyB3F,0CACjF,GAAkC,UAA9BjW,GAAQ2S,kBACX,MAAM,IAAItB,GAAcnK,EAAS,CAChCqK,KAAMH,EAAAA,kBAAkByK,oBACxB5F,QACAjB,OAAQ4G,IAGV5b,GAAQoT,KAAK,cAAclM,IAC5B,CACD,CA8CA,MAAM4U,GAAiB,IAAI9e,QAEd+e,GAAgB,IAAIvY,QAI3BwY,GAAiB,IAAIhf,QACrBif,GAAoB,IAAIjf,QAKxBkf,GAAgB,IAAIlf,QACpBmf,GAAsB,IAAInf,QAGnBof,GAAuB,IAAIpf,QAKxC,SAASqf,GACRC,EACAvI,GAEA,IAAI1U,EAAMid,EAAQpc,IAAI6T,GAKtB,OAJK1U,IACJA,EAAM,IAAIiP,EACVgO,EAAQjd,IAAI0U,EAAM1U,IAEZA,CACR,CAsGA,SAASkd,GAAiB5Q,EAAiBC,EAAe4Q,GACzD,GAAI7Q,IAAUC,EAAK,OAAO,EAC1B,GAAID,IAAU6Q,EAAS,OAAO,EAE9B,MAAMC,EAAU,IAAI3f,IACdgb,EAAoB,CAACnM,GAI3B,IAHA8Q,EAAQpf,IAAIsO,GACZ8Q,EAAQpf,IAAImf,GAEL1E,EAAM1Z,OAAS,GAAG,CACxB,MAAM+Y,EAAUW,EAAMhB,QAChB4F,EAAWV,GAAe9b,IAAIiX,GACpC,GAAKuF,EAEL,IAAK,MAAMC,KAAQD,EAAU,CAC5B,GAAIC,IAAS/Q,EAAK,OAAO,EACpB6Q,EAAQ5Z,IAAI8Z,KAChBF,EAAQpf,IAAIsf,GACZ7E,EAAMla,KAAK+e,GAEb,CACD,CAEA,OAAO,CACR,CAyHA,IAAIC,GACE,SAAUC,GAAW7H,GAC1B,OAAO4H,IAAYxa,IAAIS,IAAIwR,GAAQW,GACpC,CACA,MAAM8H,GAAgB,IAAIhgB,IAgG1B,SAASigB,GACRC,EACAC,EACAR,EAAyB,IAAI3f,IAC7BogB,EAAmB,IAEnB,GAAIF,IAAcC,EACjB,MAAO,IAAIC,EAAMD,GAGlB,GAAIR,EAAQ5Z,IAAIma,GACf,MAAO,GAGRP,EAAQpf,IAAI2f,GACZ,MAAMG,EAAU,IAAID,EAAMF,GAEpBN,EAAWV,GAAe9b,IAAI8c,GACpC,GAAIN,EACH,IAAK,MAAMU,KAAcV,EAAU,CAClC,MAAMW,EAASN,GAASK,EAAYH,EAASR,EAASU,GACtD,GAAIE,EAAOjf,OAAS,EACnB,OAAOif,CAET,CAGD,MAAO,EACR,CAQA,SAASC,GAAoBC,EAAsBH,GAGlD,MAAMF,EAAOH,GAASK,EAAYG,GAClC,OAAIL,EAAK9e,OAAS,EAEV,CAACmf,KAAeL,GAEjB,EACR,CAsCA,SAASM,GAAWxI,EAAwByI,EAAyBC,GAGpE,GAFC1I,EAAe2I,QAEX3I,EAAe/D,IAAU,OAE9B,IAAK2L,GAAY,OAEjB,MAAM7I,EAAOM,GAAQW,GAYrB,GAT8B,SAA1BhV,GAAQ6S,eAA4B+J,GAAWxa,IAAIS,IAAIkR,IAE1D6I,GAAWxa,IAAI/D,OAAO0V,GAGvB6I,GAAWxa,IAAI/C,IAAI0U,EAAMiB,GAIrByI,IAAWC,GAAuC,SAA1B1d,GAAQ6S,cAA0B,CAC7D,MAAM0K,EAAalJ,GAAQoJ,GAK3B,GAjDF,SAA0BF,EAAsBH,GAG/C,GAAIG,IAAeH,EAClB,OAAO,EAMR,MAAMQ,EAAqBzB,GAAoBjc,IAAIkd,GACnD,QAAIQ,GAAoB/a,IAAI0a,EAK7B,CAiCMM,CAAiBN,EAAYxJ,GAAO,CAEvC,MAAM+J,EAAYR,GAAoBC,EAAYxJ,GAC5CgK,EACLD,EAAU1f,OAAS,EAChB,mBAAmB0f,EAAUrT,IAAK0F,GAAMA,EAAEzL,MAAQyL,EAAE5L,YAAY0H,KAAK,SACrE,mBAAmBsR,EAAW7Y,MAAQ6Y,EAAWhZ,gBAAgBwP,EAAKrP,MAAQqP,EAAKxP,wBAEjFsO,EAAgB7S,GAAQ6S,cAG9B,GAAsB,WAAlBA,EAA4B,CAC/B+J,GAAWxa,IAAI/D,OAAO0V,GACtB,MAAMiK,EAAc/G,GAAgBjC,GAC9BiJ,EAAgB7B,GAAqBlc,IAAI6T,GAE/C,MAAM,IAAI1C,GAAc,uCAAuC0M,IAAgB,CAC9ExM,KAAMH,EAAAA,kBAAkB8M,cACxBC,MAAOL,EAAUrT,IAAK0F,GAAMA,EAAEzL,MAAQyL,EAAE5L,YACxC6Z,QAASL,EACTC,cACAC,iBAEF,CAEA,OAAQpL,GACP,IAAK,QAAS,CAEb+J,GAAWxa,IAAI/D,OAAO0V,GACtB,MAAMiK,EAAc/G,GAAgBjC,GAC9BiJ,EAAgB7B,GAAqBlc,IAAI6T,GAE/C,MAAM,IAAI1C,GAAc,cAAc0M,IAAgB,CACrDxM,KAAMH,EAAAA,kBAAkB8M,cACxBC,MAAOL,EAAUrT,IAAK0F,GAAMA,EAAEzL,MAAQyL,EAAE5L,YACxC6Z,QAASL,EACTC,cACAC,iBAEF,CACA,IAAK,OAIJ,OAHAje,GAAQoT,KAAK,cAAc2K,UAE3BnB,GAAWxa,IAAI/D,OAAO0V,GAEvB,IAAK,QAGJ,YADA6I,GAAWxa,IAAI/D,OAAO0V,GAGzB,EAjfF,SAAsBwJ,EAAsBH,GAC3C,GAA8B,SAA1Bpd,GAAQ6S,cAA0B,OAEtC,MAAM6J,EAAWV,GAAe9b,IAAIqd,GACpC,GAAIb,GAAU7Z,IAAIua,GACjB,OAID,GAAKV,EAKJA,EAASrf,IAAI+f,OALC,CACd,MAAMiB,EAAc,IAAI/P,EACxB+P,EAAYhhB,IAAI+f,GAChBpB,GAAe3c,IAAIke,EAAYc,EAChC,CAKA,IAAIC,EAAcrC,GAAkB/b,IAAIkd,GAiBxC,GAhBKkB,IACJA,EAAc,IAAIhQ,EAClB2N,GAAkB5c,IAAI+d,EAAYkB,IAEnCA,EAAYjhB,IAAIkgB,GAYZA,IAAeH,EAClB,OAGD,MAAMmB,EAAgBlC,GAAmBF,GAAqBoB,GACxDiB,EAAUnC,GAAmBH,GAAekB,GAGlDmB,EAAclhB,IAAI+f,GAClBoB,EAAQnhB,IAAIkgB,GAGZ,MAAMkB,EAAavC,GAAchc,IAAIqd,GACrC,GAAIkB,EACH,IAAK,MAAMhO,KAAKgO,EAEXhO,IAAM2M,IACYf,GAAmBF,GAAqB1L,GAChDpT,IAAI+f,GAClBoB,EAAQnhB,IAAIoT,IAKd,MAAMiO,EAAmBvC,GAAoBjc,IAAIkd,GACjD,GAAIsB,EACH,IAAK,MAAMC,KAAKD,EAEXC,IAAMpB,IACMlB,GAAmBH,GAAeyC,GAC1CthB,IAAIkgB,GACZgB,EAAclhB,IAAIshB,IAKpB,GAAIF,GAAcC,EACjB,IAAK,MAAMjO,KAAKgO,EAAY,CAC3B,MAAMG,EAAgBvC,GAAmBF,GAAqB1L,GAC9D,IAAK,MAAMkO,KAAKD,EAEXjO,IAAMkO,IACVC,EAAcvhB,IAAIshB,GACFtC,GAAmBH,GAAeyC,GAC1CthB,IAAIoT,GAEd,CAEF,CAgaEoO,CAAatB,EAAYxJ,EAC1B,CACD,CAMM,SAAU+K,GAAgB5N,GAC1B0L,GACAE,GAAczf,IAAI6T,GADNA,GAElB,CAsBO,MAAM6N,GAAQD,GA0BrB,SAASE,GACRjL,EACA0I,EACAwC,EACA/B,EACAN,GAEA,GAAIqC,EAAepc,IAAIkR,GAAO,CAE7B,MAAMmL,EAAahC,EAAK1R,QAAQuI,GAChC,OAAOmJ,EAAKxR,MAAMwT,GAAYrT,OAAO,CAACkI,GACvC,CAEA,GAAI0I,EAAQ5Z,IAAIkR,GACf,MAAO,GAGR0I,EAAQpf,IAAI0W,GACZkL,EAAe5hB,IAAI0W,GACnBmJ,EAAKtf,KAAKmW,GAIV,MAAM2I,EAAWV,GAAe9b,IAAI6T,GACpC,GAAI2I,EACH,IAAK,MAAMU,KAAcV,EACxB,GAAIE,EAAWxa,IAAIS,IAAIua,GAAa,CACnC,MAAMe,EAAQa,GAAU5B,EAAYX,EAASwC,EAAgB/B,EAAMN,GACnE,GAAIuB,EAAM/f,OAAS,EAClB,OAAO+f,CAET,CAMF,OAFAjB,EAAKvB,MACLsD,EAAe5gB,OAAO0V,GACf,EACR,CAOA,SAASoL,GAAYC,GAEpB,IAAIC,EAAoC,KACpCC,EAA4B,KAEhC,GAA8B,SAA1Btf,GAAQ6S,cAA0B,CAErC,MAAM0M,EAAQ3C,GAAYxa,IAAI+J,UAAUwQ,OAAO/Z,MAC3C2c,KACDD,EAAUD,GAAcE,EAE5B,MAGC,IAAK,MAAOxL,EAAMiB,KAAW4H,GAAYxa,IAAK,CAE7C,GAAiB,KADAwa,GAAY4C,UAAUtf,IAAI6T,IAAS,GAChC,CACnBsL,EAAarK,EACbsK,EAAWvL,EACX,KACD,CACD,CAGD,IAAKsL,EAAY,CAGhB,GAAIzC,GAAYxa,IAAIP,KAAO,EAAG,CAC7B,IAAIsc,EA3FP,SAAsBvB,GAGrB,MAAMH,EAAU,IAAI3f,IACdmiB,EAAiB,IAAIniB,IACrBogB,EAAmB,GAEzB,IAAK,MAAOnJ,KAAS6I,EAAWxa,IAAK,CACpC,GAAIqa,EAAQ5Z,IAAIkR,GAAO,SACvB,MAAMoK,EAAQa,GAAUjL,EAAM0I,EAASwC,EAAgB/B,EAAMN,GAC7D,GAAIuB,EAAM/f,OAAS,EAClB,OAAO+f,CAET,CAEA,MAAO,EACR,CA2EesB,CAAa7C,IAGzB,GAAqB,IAAjBuB,EAAM/f,OAGT,IAAK,MAAO2V,KAAS6I,GAAYxa,IAAK,CACrC,MAAMsd,EAAevD,GAAoBjc,IAAI6T,GAC7C,GAAI2L,EAAc,CAEjB,IAAK,MAAMC,KAAeD,EAEzB,GAAIC,IAAgB5L,GAChB6I,GAAYxa,IAAIS,IAAI8c,GAAc,CACrC,MAAMC,EAA0BzD,GAAoBjc,IAAIyf,GACxD,GAAIC,GAAyB/c,IAAIkR,GAAO,CAEvCoK,EAAQ,CAACpK,EAAM4L,EAAa5L,GAC5B,KACD,CACD,CAED,GAAIoK,EAAM/f,OAAS,EAAG,KACvB,CACD,CAED,MAAM2f,EACLI,EAAM/f,OAAS,EACZ,mBAAmB+f,EAAM1T,IAAK0F,GAAMA,EAAEzL,MAAQ,eAAeuH,KAAK,SAClE,wFAGJ,OADsBjM,GAAQ6S,eAE7B,IAAK,QACJ,MAAM,IAAIxB,GAAc,cAAc0M,KACvC,IAAK,OAAQ,CACZ/d,GAAQoT,KAAK,cAAc2K,KAE3B,MAAM8B,EAAcjD,GAAYxa,IAAIW,SAAS4Z,OAAO/Z,MACpD,GAAIid,EAAa,CAChB,MAAMC,EAAYzL,GAAQwL,GAG1B,OAFAjD,GAAYxa,IAAI/D,OAAOyhB,GACvBlD,GAAY4C,UAAUnhB,OAAOyhB,GACtBD,GACR,CACA,KACD,CACA,IAAK,QAAS,CAEb,MAAME,EAAenD,GAAYxa,IAAIW,SAAS4Z,OAAO/Z,MACrD,GAAImd,EAAc,CACjB,MAAMC,EAAa3L,GAAQ0L,GAG3B,OAFAnD,GAAYxa,IAAI/D,OAAO2hB,GACvBpD,GAAY4C,UAAUnhB,OAAO2hB,GACtBD,GACR,CACA,KACD,EAEF,CACA,OAAO,IACR,CAEAX,EAAiBxhB,KAAKyW,GAAQgL,IAE9B,MAAMhC,EAASgC,IAOf,OAJAzC,GAAYxa,IAAI/D,OAAOihB,GACvB1C,GAAY4C,UAAUnhB,OAAOihB,GAxa9B,SAAuCW,EAAmBC,GAEzD,MAAMR,EAAevD,GAAoBjc,IAAIggB,GAC7C,GAAKR,EAEL,IAAK,MAAMS,KAAmBT,EAE7B,GAAIO,EAAM7d,IAAIS,IAAIsd,GAAkB,CACnC,MAAMC,EAAgBH,EAAMT,UAAUtf,IAAIigB,IAAoB,EAC1DC,EAAgB,GACnBH,EAAMT,UAAUngB,IAAI8gB,EAAiBC,EAAgB,EAEvD,CAEF,CA2ZCC,CAA8BzD,GAAa0C,GAEpCjC,CACR,CAIM,SAAU4C,GAAMjL,EAA2C0I,GAC3Dra,MAAMqC,QAAQsP,KAASA,EAAS,CAACA,IACtC,MAAMiG,EAAQjG,EAAOvK,IAAI4J,IAEzB,GAAIuI,GAAY,CAEf5c,IAAS4R,MAAMqJ,EAAO5G,GAAQuG,OAC9B,MAAM6C,EAAS7C,KACf,IAAK,IAAIzc,EAAI,EAAGA,EAAI6W,EAAO5W,OAAQD,IAClCqf,GAAWxI,EAAO7W,GAAIsf,EAAsB,cAAdC,GAC/B,GAAIA,EAAW,CACd,MAAM4C,EAA+B,CAAA,EAErC,IAAK,IAAIniB,EAAI,EAAGA,EAAI6W,EAAO5W,OAAQD,IAClC,IACC,MAAMkK,EAAK2M,EAAO7W,UACPsJ,IAAPY,GAAsB,UAAWiY,IAAcA,EAAY1d,MAAQyF,EACxE,SACC,MAAM0L,EAAOM,GAAQW,EAAO7W,IAC5Bye,GAAWxa,IAAI/D,OAAO0V,EACvB,CAED,OAAOuM,EAAY1d,KACpB,CAED,KAAO,CAEN,GAAKyY,GACA,MAAM,IAAI5X,MAAM,6BADI4X,GAAqB,IAAIlb,IAElDH,GAAQ+R,WAAWkJ,GACnB2B,GAAa,CACZxa,IAAK,IAAIjC,IACTqf,UAAW,IAAIrf,KAGhB,MAAMsd,EAAS7C,KACTwE,EAAqC,GACrCkB,EAA+B,CAAA,EAErC,IACC,GAAI5C,EAEH,IAAK,IAAIvf,EAAI,EAAGA,EAAI6W,EAAO5W,OAAQD,IAClC,IACC,MAAMkK,EAAK2M,EAAO7W,UACPsJ,IAAPY,GAAsB,UAAWiY,IAAcA,EAAY1d,MAAQyF,EACxE,SACCuU,GAAWxa,IAAI/D,OAAOgW,GAAQW,EAAO7W,IACtC,KAEK,CAEN,IAAK,IAAIA,EAAI,EAAGA,EAAI6W,EAAO5W,OAAQD,IAAKqf,GAAWxI,EAAO7W,GAAIsf,GAAQ,IA/f1E,SAA6BwC,GAC5B,GAA8B,SAA1BjgB,GAAQ6S,cAA0B,OACtC,MAAM0N,EAAe3F,KACf4F,EAAaD,EAAelM,GAAQkM,GAAgB,KAG1DN,EAAMT,UAAU1R,QAEhB,IAAK,MAAOiG,KAASkM,EAAM7d,IAAK,CAC/B,IAAIqe,EAAW,EACf,MAAMC,EAASxE,GAAchc,IAAI6T,GACjC,GAAI2M,EACH,IAAK,MAAMC,KAAaD,EAEnBT,EAAM7d,IAAIS,IAAI8d,IAAcA,IAAcH,GAAcG,IAAc5M,GACzE0M,IAIHR,EAAMT,UAAUngB,IAAI0U,EAAM0M,EAC3B,CACD,CA2eIG,CAAoBhE,GACrB,CAGA,KAAOA,GAAWxa,IAAIP,KAAO,GAAKib,GAAcjb,KAAO,GACtD,GAAI+a,GAAWxa,IAAIP,KAAO,EAAG,CAC5B,GAAIud,EAAiBhhB,OAAS4B,GAAQyS,eAAgB,CACrD,MAAM0L,EAAQnD,GAAiBoE,GACzByB,EAAQ1F,GAAYiE,GACpBlY,EAAUiX,EACb,6CAA6ChD,GAAYgD,MACzD,oCAAoC0C,KAGjCC,GADclE,GAAavZ,MAAM0U,KAAK6E,GAAWxa,IAAIgE,QAAU,IAC1CqE,IAAK0F,GAAMA,EAAEzL,MAAQ,eAC1C4M,EAAY,CACjBC,KAAMH,EAAAA,kBAAkB2P,iBACxB3B,mBACAjB,QACA0C,QACApO,eAAgBzS,GAAQyS,eACxBqO,OAAQA,EAAOpV,MAAM,EAAG,IACxBsV,YAAaF,EAAO1iB,OAEpB4f,YACCoB,EAAiBhhB,OAAS,EACvB6Y,GACA2F,GAAWxa,IAAIlC,IAAIkf,EAAiBA,EAAiBhhB,OAAS,KAE9D,IAEL,OAAQ4B,GAAQ2S,mBACf,IAAK,QAEL,IAAK,QAGJ,MAAM,IAAItB,GAAc,cAAcnK,IAAWoK,GAClD,IAAK,OACJtR,GAAQoT,KACP,cAAclM,cAAoB4Z,EAAOpV,MAAM,EAAG,IAAIO,KAAK,QAAQ6U,EAAO1iB,OAAS,GAAK,MAAQ,OAIpG,CACA,MAAMiK,EAAK8W,GAAYC,QACZ3X,IAAPY,GAAsB,UAAWiY,IAAcA,EAAY1d,MAAQyF,EACxE,KAAO,CAEN,MAAM4Y,EAAW5d,MAAM0U,KAAK+E,IAC5BA,GAAchP,QACd,IAAK,MAAMoD,KAAW+P,EAAU/P,GAIjC,CAED,OAAOoP,EAAY1d,KACpB,CAAE,MAAOse,GACR,MAAMA,aAAiB7P,GACpB6P,EACA,IAAI7P,GAAc,qBAAsB,CAAEE,KAAMH,EAAAA,kBAAkB+P,cAAe3P,MAAO0P,GAC5F,SACC7F,QAAqB5T,EACrBmV,QAAanV,EACbzH,GAAQgS,UACT,CACD,CACD,CASO,MAAMoP,GAAS9Y,EAAU,CAC/BL,OAAOsB,GACC,YAAwB9L,GAC9B,MAAM4jB,EAAe,IAAM9X,EAAS1L,MAAMC,KAAML,GAGhD,OADAuB,OAAOQ,eAAe6hB,EAAc,OAAQ,CAAEze,MAAO,UAAU2G,EAAS7E,UACjEub,GAAMoB,EAAc,YAC5B,EAEDnZ,QACCqB,GAEO,YAAwB9L,GAC9B,MAAM4jB,EAAe,IAAM9X,EAAS1L,MAAMC,KAAML,GAGhD,OADAuB,OAAOQ,eAAe6hB,EAAc,OAAQ,CAAEze,MAAO,UAAU2G,EAAS7E,UACjEub,GAAMoB,EAAc,YAC5B,IAIIxY,GAAK,IAAIC,qBAAkCC,GAAMA,cAYvCiM,GAEfzX,EACA+jB,GAOA,MAAMnO,EAAYmO,GAAenO,WAAanT,GAAQmT,WAAa,SACnE,GAAInT,GAAQqT,cAAcC,cAAe,CACxC,MAAMiO,GAAQ,IAAI9d,OAAQ8d,MAC1B,GAAIA,EAAO,CAEV,MAAMC,EAAaD,EAAME,MAAM,MAAM/V,MAAM,GAAGO,KAAK,MACnDmQ,GAAqB/c,IAAIgV,GAAQ9W,GAAKikB,EACvC,CACD,CACA,IAAItQ,EAA+B,KACnC,MAAMwQ,EAAUjH,GAAcR,QAAQhN,KAAK0U,EAAW,IAAKjH,GAAiBf,OACtEiI,EAASnH,GAAcd,MAE7B,IAAI3B,EAASyC,GAAcR,QAAQR,OAI/BoI,GAAgB,EAChBC,GAAa,EACbC,EAAsC,KACtCC,EAAsC,KAE1C,SAASL,IAER,GAAIzQ,EAAS,CACZ,MAAM+Q,EAAc/Q,EACpBA,EAAU,KACVgR,GAAU,IAAMD,IACjB,CAGA,GAAIF,EACH,GAAkB,WAAd5O,GAA0B6O,EAE7BA,IACAA,EAAiB,KACjBD,EAAiB,UACX,GAAkB,WAAd5O,EAEV,OAMF,GAAI0O,EAAe,OAGnB,IAAIM,EACA9E,EAFJrd,GAAQyR,MAAM4C,GAAQ9W,IAGtB,IAEC,GADA8f,EAASqE,EAAQ,IAAMnkB,EAAG,CAAEmkB,UAASE,SAAQQ,SAAUN,KAEtDzE,GACkB,mBAAXA,IACY,iBAAXA,KAAyB,SAAUA,IAE3C,MAAM,IAAIhM,GAAc,oDAAoDgM,KAE7E,GAAIA,GAA4B,iBAAXA,GAA8C,mBAAhBA,EAAO9e,KAAqB,CAC9E,MAAM8jB,EAAkBhF,EAGxB,IAAIiF,EAA+C,KACnD,MAAMC,EAAgB,IAAI/jB,QAAe,CAACgkB,EAAG9jB,KAC5C4jB,EAAe5jB,IAGV+jB,EAAc,IAAIpR,GAAc,uDAItC0Q,EAAiBvjB,QAAQ8D,KAAK,CAAC+f,EAAiBE,IAGhDP,EAAiB,KACZM,GACHA,EAAaG,GAQhB,MAECN,EAAkB9E,CAEpB,SACCyE,GAAa,EACb9hB,GAAQ2R,MAAMpU,EACf,CAGA2T,EAAU,KACTA,EAAU,KACViR,MAEA,MAAMO,EAAgBjP,GAAwBvT,IAAIyhB,GAClD,GAAIe,EAAe,CAClB,IAAK,MAAMC,KAAeD,EAAe,CACxC,MAAME,EAAiBlP,GAASxT,IAAIyiB,GACpC,GAAIC,EAAgB,CACnB,IAAK,MAAO7jB,EAAMsW,KAASuN,EAAezW,UACzCkJ,EAAKhX,OAAOsjB,GACM,IAAdtM,EAAKxT,MACR+gB,EAAevkB,OAAOU,GAGI,IAAxB6jB,EAAe/gB,MAClB6R,GAASrV,OAAOskB,EAElB,CACD,CACAlP,GAAwBpV,OAAOsjB,EAChC,CAEA,MAAMkB,EAAWlP,GAAezT,IAAIyhB,GACpC,GAAIkB,EAAU,CACb,IAAK,MAAMC,KAAgBD,EAAUC,IACrCnP,GAAetV,OAAOsjB,EACvB,EAEF,CAGA,SAASoB,EAAY1a,GACpB,OAAOrJ,OAAO2F,iBAAiB0D,EAAI,CAClC4I,CAACA,IAAU,CACV/Q,IAAG,IACK2hB,GAGTmB,CAACrF,IAAgB,CAChB/a,MAAO,KACN,GAAIsO,EAAS,CACZ,MAAM+Q,EAAc/Q,EACpBA,EAAU,KACVgR,GAAU,IAAMD,IACjB,KAOJ,CArBAnO,GAAa6N,EAAWpkB,GAsBxBwlB,EAAYpB,GAGRL,GAAe2B,QAClBlH,GAAc1e,IAAIskB,GAGfvI,MACH9C,GAAuBqL,GAGxB1B,GAAM0B,EAAW,aAGjB/N,GAAavU,IAAIsiB,EAAW3J,GAE5B,MAEMkL,EAAa,KACdrB,IACJA,GAAgB,EAEZG,IACHA,IACAA,EAAiB,KACjBD,EAAiB,MAElB7Q,MAl6BF,SAAgC8D,GAC/B,GAA8B,SAA1BhV,GAAQ6S,cAA0B,OACtC,MAAMkB,EAAOM,GAAQW,GAGfmO,EAAajH,GAAchc,IAAI6T,GAC/BqP,EAAmBjH,GAAoBjc,IAAI6T,GAG3C2I,EAAWV,GAAe9b,IAAI6T,GACpC,GAAI2I,EAAU,CAEb,IAAK,MAAMU,KAAcV,EAAU,CAClC,MAAM4B,EAAcrC,GAAkB/b,IAAIkd,GAC1CkB,GAAajgB,OAAO0V,EACrB,CACAiI,GAAe3d,OAAO0V,EACvB,CAGA,MAAMuK,EAAcrC,GAAkB/b,IAAI6T,GAC1C,GAAIuK,EAAa,CAEhB,IAAK,MAAM+E,KAAc/E,EAAa,CACrC,MAAM5B,EAAWV,GAAe9b,IAAImjB,GACpC3G,GAAUre,OAAO0V,EAClB,CACAkI,GAAkB5d,OAAO0V,EAC1B,CASA,GAAIoP,EAGH,IAAK,MAAMxC,KAAawC,EAAY,CACnC,MAAMG,EAAoBnH,GAAoBjc,IAAIygB,GAClD,GAAI2C,IAEHA,EAAkBjlB,OAAO0V,GAErBqP,GACH,IAAK,MAAMzD,KAAeyD,EAEpB7G,GAAiBoE,EAAWhB,EAAa5L,IAC7CuP,EAAkBjlB,OAAOshB,EAK9B,CAGD,GAAIyD,EAGH,IAAK,MAAMjD,KAAmBiD,EAAkB,CAC/C,MAAMG,EAAoBrH,GAAchc,IAAIigB,GAC5C,GAAIoD,IAEHA,EAAkBllB,OAAO0V,GAErBoP,GACH,IAAK,MAAM3R,KAAS2R,EAEd5G,GAAiB/K,EAAO2O,EAAiBpM,IAC7CwP,EAAkBllB,OAAOmT,EAK9B,CAKD,GAAI2R,GAAcC,EACjB,IAAK,MAAM3S,KAAK0S,EAAY,CAC3B,MAAMvE,EAAgBzC,GAAoBjc,IAAIuQ,GAC9C,GAAImO,EACH,IAAK,MAAMD,KAAKyE,EAGf,IAAK7G,GAAiB9L,EAAGkO,EAAG5K,GAAO,CAClC6K,EAAcvgB,OAAOsgB,GACrB,MAAM6E,EAAUtH,GAAchc,IAAIye,GAClC6E,GAASnlB,OAAOoS,EACjB,CAGH,CAIDyL,GAAc7d,OAAO0V,GACrBoI,GAAoB9d,OAAO0V,EAC5B,CA+zBE0P,CAAuB9B,GACvB9Y,GAAGkF,WAAWmV,KAEf,IAhBsBlL,EAgBJ,CACjB,MAAM0L,EAAkBX,EAAY,IAAMG,KAS1C,OARAra,GAAGsF,SACFuV,EACA,KACCR,IACAljB,GAAQiS,iBAAiB1U,IAE1B2lB,GAEMQ,CACR,CAEA,IAAIb,EAAWlP,GAAezT,IAAI8X,GAC7B6K,IACJA,EAAW,IAAI/lB,IACf6W,GAAetU,IAAI2Y,EAAQ6K,IAE5B,MAAMc,EAAmBZ,EAAY,KACpCF,EAASxkB,OAAOslB,GACM,IAAlBd,EAAShhB,MACZ8R,GAAetV,OAAO2Z,GAGvBkL,MAID,OAFAL,EAASxlB,IAAIsmB,GAENA,CACR,CAOM,SAAUzB,GAAa3kB,GAC5B,OAAOkd,GAAcR,QAAQlG,KAAKxW,EACnC,CAOM,SAAUwW,GAAQxW,GACvB,OAAOkd,GAAc1G,KAAKxW,EAC3B,CC7xCO,MAAMqmB,GAAgB,IAAI5mB,QAGpB6mB,GAA0B,IAAIrgB,QAG9BsgB,GAAe,IAAI9mB,QAGnB+mB,GAA6B,IAAI/mB,iBAK9BgnB,GAAiBC,EAAejM,EAAgBjZ,GAC/D,IAAImlB,EAAUN,GAAc1jB,IAAI+jB,GAC3BC,IACJA,EAAU,IAAIpnB,IACd8mB,GAAcvkB,IAAI4kB,EAAOC,IAE1BA,EAAQ7mB,IAAI,CAAE2a,SAAQjZ,QACvB,UAKgBolB,GAAoBF,EAAejM,EAAgBjZ,GAClE,MAAMmlB,EAAUN,GAAc1jB,IAAI+jB,GAClC,GAAIC,EAAS,CACZ,IAAK,MAAME,KAASF,EACnB,GAAIE,EAAMpM,SAAWA,GAAUoM,EAAMrlB,OAASA,EAAM,CACnDmlB,EAAQ7lB,OAAO+lB,GACf,KACD,CAEoB,IAAjBF,EAAQriB,MACX+hB,GAAcvlB,OAAO4lB,EAEvB,CACD,CAKM,SAAUI,GAAoBxf,GAEnC,QAAIgf,GAAwBhhB,IAAIgC,IAEzByf,GAA0Bzf,EAClC,CAKM,SAAU0f,GAAeC,EAAuB7O,GACrD,MAAMuO,EAAUN,GAAc1jB,IAAIskB,GAClC,GAAKN,EAEL,IAAK,MAAMlM,OAAEA,KAAYkM,EAAS,CAEjC,MAAMO,EAAqBX,GAAa5jB,IAAI8X,GAC5C,GAAIyM,EAAoB,IAAK,MAAMC,KAAWD,EAAoBxE,GAAMyE,GAGxEH,GAAevM,EAChB,CACD,CAEA,SAASsM,GAA0Bzf,GAClC,MAAMqf,EAAUN,GAAc1jB,IAAI2E,GAClC,IAAKqf,EAAS,OAAO,EAErB,IAAK,MAAMlM,OAAEA,KAAYkM,EAAS,CACjC,GAAIL,GAAwBhhB,IAAImV,GAAS,OAAO,EAChD,GAAIsM,GAA0BtM,GAAS,OAAO,CAC/C,CACA,OAAO,CACR,CCzEA,MAAM2M,GAAS,IAAI3nB,QAEb,SAAU4nB,GAAS/f,EAAU8Q,GAElC,MAAMgH,EAAO,CAAA,EACPkI,EAAQC,GAFdjgB,EAAMkW,GAAOlW,IAGTggB,GAAO7lB,OAAO2D,OAAOkiB,EAAO,CAAElP,YAAWgH,SAC7CgI,GAAOtlB,IAAIwF,EAAK8X,EACjB,CAOM,SAAUmI,GAASjgB,GACxBA,EAAMkW,GAAOlW,GACb,IAAIggB,EAAQF,GAAOzkB,IAAI2E,GAKvB,OAJKggB,IACJA,EAAQ,CAAA,EACRF,GAAOtlB,IAAIwF,EAAKggB,IAEVA,CACR,CAEM,SAAUE,GACflgB,EACA8Q,EACAkC,EACA+K,KACGoC,GAEH,MAAMC,EAAerK,KACrB,IAAK,MAAMxU,KAAQ4e,EAClB,IAAK,MAAMhf,KAAOI,EAAM,CACvB,MAAMiP,EAAOuN,EAAe1iB,IAAI8F,GAChC,GAAIqP,EACH,IAAK,MAAML,KAAUK,EAAM,CAE1B,GADqBsF,GAAU3F,GACb,CACjBhV,GAAQwS,kBAAkBwC,GAC1B,QACD,CACK6C,EAAQhV,IAAImS,KAChB6C,EAAQxa,IAAI2X,GACP6H,GAAW7H,IAASuG,GAAiBvG,EAAQnQ,EAAK8Q,EAAW3P,IAEnE,MAAMkf,EAAWpJ,GAAe5b,IAAI8U,GAEpC,GADAwB,GAAkByO,EAAcjQ,EAAQnQ,EAAKmB,EAAK2P,GAC9CuP,EAAU,CACb,IAAK,MAAMC,KAAWD,EAAUC,EAAQtgB,EAAK8Q,EAAW3P,GACxDkf,EAAS7mB,OAAO2W,EACjB,CACD,CACF,CACF,UAQgBoQ,GAASvgB,EAAU8Q,EAAsB5W,GACxDoT,GAAQtN,EAAK8Q,EAAW,CAAC5W,GAC1B,UAQgBoT,GAAQtN,EAAU8Q,EAAsB0P,GAEvDT,GADA/f,EAAMkW,GAAOlW,GACC8Q,GACd,MAAMiN,EAAiBlP,GAASxT,IAAI2E,GACpC,GAAI+d,EAAgB,CAEnB,MAAM/K,EAAU,IAAI/a,IAChBuoB,EAAON,GAAelgB,EAAK8Q,EAAWkC,EAAS+K,EAAgB,CAAC7R,IAAWsU,GAC1EN,GAAelgB,EAAK8Q,EAAWkC,EAAS+K,EAAgBA,EAAexc,QAC5EpG,GAAQmS,QAAQtN,EAAK8Q,EAAW0P,EAA4BxN,GAC5DoI,GAAM5c,MAAM0U,KAAKF,GAClB,CAGIgM,GAAwBhhB,IAAIgC,IAC/B0f,GAAe1f,EAEjB,CChGO,MAAMygB,GAAqB,IAAI9hB,QACzB+hB,GAAa,IAAIzoB,IACjB0oB,GAASpkB,OAAO,UAiBvB,SAAUqkB,MAA+DC,GAC9E,IAAK,MAAMC,KAAKD,EAASC,IAAIA,EAAEplB,UAAkBsQ,KAAmB,GACpE,OAAO6U,EAAI,EACZ,CAEM,SAAUE,GAAc/gB,GAC7B,GAAY,OAARA,GAA+B,iBAARA,EAAkB,OAAO,EACpD,GAAIygB,GAAmBziB,IAAIgC,GAAM,OAAO,EACxC,GAAKA,EAAYgM,IAAkB,OAAO,EAC1C,IAAK,MAAMtT,KAAMgoB,GAAY,GAAIhoB,EAAGsH,GAAM,OAAO,EACjD,OAAO,CACR,CCpBA,SAASghB,GAAajjB,GACrB,OALD,SAAkBA,GACjB,MAAwB,iBAAVA,GAAgC,OAAVA,CACrC,CAGQkjB,CAASljB,EACjB,CAEA,SAASmjB,GAAkBnjB,GAC1B,GAAKijB,GAAajjB,GAAlB,CACA,GAAIS,MAAMqC,QAAQ9C,GAAQ,OAAOS,MAAM9C,UACvC,IACC,OAAOqC,EAAMqE,WACd,CAAE,MACD,MACD,CAN0C,CAO3C,CAEM,SAAU+e,GAAmBC,EAAeC,GACjD,OAAID,IAAaC,OACZL,GAAaI,KAAcJ,GAAaK,OACzCN,GAAcK,KAAaL,GAAcM,IACtCH,GAAkBE,KAAcF,GAAkBG,IAC1D,CAUM,SAAUC,GACfC,EACArnB,EACAknB,EACAC,EACAG,GAEA,MAAM1Q,EAAuB,CAAE7V,KAAMumB,EAAc,MAAQ,MAAOtnB,QAElE,GACCiB,GAAQkT,wBACKzL,IAAbwe,GACAD,GAAmBC,EAAUC,GAC5B,CACD,MACMI,EAAS,CAAEzhB,IADIkW,GAAOqL,GACQrnB,SAyJhC,SAAgCwnB,GACrC,IAAKA,EAAcnoB,OAAQ,OAC3B,MAAMooB,EAAkB,IAAI1pB,IAGtBwpB,EAASC,EAAc,IAAID,OACjC,IAAIG,EAGJ,GAAIH,EAAQ,CACXG,EAAiB,IAAI3pB,IACrB,MAAM4pB,EAAiBhT,GAASxT,IAAIomB,EAAOzhB,KAC3C,GAAI6hB,EAAgB,CACnB,MAAMC,EAAgB,IAAI7pB,IAC1BioB,GACCuB,EAAOzhB,IACP,CAAE/E,KAAM,MAAOf,KAAMunB,EAAOvnB,MAC5B4nB,EACAD,EACA,CAAC3V,IACD,CAACuV,EAAOvnB,OAET,IAAK,MAAMiW,KAAU2R,EAAeF,EAAeppB,IAAI2X,EACxD,CAEA,GAA4B,IAAxByR,EAAe5kB,KAAY,MAChC,CAEA,IAAK,MAAMyF,OAAEA,EAAMqO,UAAEA,EAAS5W,KAAEA,KAAUwnB,EAAe,CACxD,IAAKV,GAAave,GAAS,SAC3B,MAAMzC,EAAMkW,GAAOzT,GACnBsd,GAAS/f,EAAK8Q,GACd,MAAMiN,EAAiBlP,GAASxT,IAAI2E,GACpC,IAAI+hB,EACJ,MAAMC,EAAa,CAAC9nB,GACpB,GAAI6jB,EAAgB,CAMnB,GALAgE,EAAiB,IAAI9pB,IACrBioB,GAAelgB,EAAK8Q,EAAWiR,EAAgBhE,EAAgB,CAAC7R,IAAW8V,GAIvEP,GAAUG,EAAgB,CAC7B,MAAMK,EAAkB,IAAIhqB,IAC5B,IAAK,MAAMkY,KAAU4R,GAEhBH,EAAe5jB,IAAImS,IAAW+R,GAAiB/R,EAAQyR,KAC1DK,EAAgBzpB,IAAI2X,GAGtB4R,EAAiBE,CAClB,CAEA,IAAK,MAAM9R,KAAU4R,EAAgBJ,EAAgBnpB,IAAI2X,EAC1D,CACAhV,GAAQmS,QAAQtN,EAAK8Q,EAAWkR,EAAYD,GACxC/C,GAAwBhhB,IAAIgC,IAAM0f,GAAe1f,EACtD,CACI2hB,EAAgB3kB,MAAMoe,GAAM,IAAIuG,GACrC,CAhNEQ,CAAsBC,GAAehB,EAAUC,EAAU,IAAIlpB,QAAW,GAAIspB,aF6ChDzhB,EAAU8Q,EAAsB5W,GAC7D8F,EAAMkW,GAAOlW,GACb,MAAM+d,EAAiBlP,GAASxT,IAAI2E,GACpC,IAAK+d,EAAgB,OAErB,MAAMvN,EAAOuN,EAAe1iB,IAAInB,GAChC,IAAKsW,EAAM,OAEX,MAAMwC,EAAU,IAAI/a,IACdmoB,EAAerK,KAErB,IAAK,MAAM5F,KAAUK,EAAM,CAC1B,IAAK0G,GAAclZ,IAAImS,GAAS,SAGhC,GADqB2F,GAAU3F,GACb,CACjBhV,GAAQwS,kBAAkBwC,GAC1B,QACD,CACA6C,EAAQxa,IAAI2X,GACZuG,GAAiBvG,EAAQnQ,EAAK8Q,EAAW5W,GACzC,MAAMmmB,EAAWpJ,GAAe5b,IAAI8U,GAEpC,GADAwB,GAAkByO,EAAcjQ,EAAQnQ,EAAK9F,EAAM4W,GAC/CuP,EAAU,CACb,IAAK,MAAMC,KAAWD,EAAUC,EAAQtgB,EAAK8Q,EAAW5W,GACxDmmB,EAAS7mB,OAAO2W,EACjB,CACD,CAEI6C,EAAQhW,KAAO,IAClB7B,GAAQmS,QAAQtN,EAAK8Q,EAAW,CAAC5W,GAAO8Y,GACxCoI,GAAM5c,MAAM0U,KAAKF,IAEnB,CE3EEqP,CAAcd,EAAWzQ,EAAW5W,EACrC,MACCqmB,GAASgB,EAAWzQ,EAAW5W,EAEjC,CAqBA,SAASooB,GAAkBtiB,GAC1B,MAAMuB,EAAO,IAAItJ,IAAiBkH,QAAQmG,QAAQtF,IAClD,IAAI/F,EAAQE,OAAOwG,eAAeX,GAIlC,KAAO/F,IAAUE,OAAOsH,OAAOxH,EAAO,gBAAgB,CACrD,IAAK,MAAMkH,KAAOhC,QAAQmG,QAAQrL,GAAQsH,EAAK/I,IAAI2I,GACnDlH,EAAQE,OAAOwG,eAAe1G,EAC/B,CACA,OAAOsH,CACR,CAEM,SAAU6gB,GACfhB,EACAC,EACAzJ,EAAwB,IAAIzf,QAC5BupB,EAAuC,GACvCD,GAEA,OAAKN,GAAmBC,EAAUC,IAC7BL,GAAaI,IAAcJ,GAAaK,GAhC9C,SAAwBzJ,EAAuB2K,EAAgBC,GAC9D,IAAIC,EAAS7K,EAAQvc,IAAIknB,GAKzB,OAJKE,IACJA,EAAS,IAAI9jB,QACbiZ,EAAQpd,IAAI+nB,EAAQE,MAEjBA,EAAOzkB,IAAIwkB,KACfC,EAAOjqB,IAAIgqB,IACJ,EACR,CAwBKE,CAAe9K,EAASwJ,EAAUC,GAAkBK,EAEpDljB,MAAMqC,QAAQugB,IAAa5iB,MAAMqC,QAAQwgB,IAS9C,SACCsB,EACAC,EACAC,EACAnB,EACAD,GAEA,MAAMqB,EAA+B,GAC/BC,EAAYJ,EAASppB,OACrBypB,EAAYJ,EAASrpB,OACrB0pB,EAAMC,KAAKD,IAAIF,EAAWC,GAEhC,IAAK,IAAIhe,EAAQ,EAAGA,EAAQie,EAAKje,IAAS,CACzC,MAAMme,EAASne,EAAQ+d,EACjBK,EAASpe,EAAQge,EACvB,GAAIG,IAAWC,EAAQ,CACtBN,EAAM/pB,KAAK,CAAE0J,OAAQkgB,EAAU7R,UAAW,CAAE7V,KAAM,MAAOf,KAAM8K,GAAS9K,KAAM8K,EAAOyc,WACrF,QACD,CACA,IAAK0B,GAAUC,EAAQ,CACtBN,EAAM/pB,KAAK,CAAE0J,OAAQkgB,EAAU7R,UAAW,CAAE7V,KAAM,MAAOf,KAAM8K,GAAS9K,KAAM8K,EAAOyc,WACrF,QACD,CACA,IAAK0B,IAAWC,EAAQ,SACxB,MAAMC,EAAWnN,GAAOyM,EAAS3d,IAC3Bse,EAAWpN,GAAO0M,EAAS5d,IAC5B7K,OAAOopB,GAAGF,EAAUC,IACxBR,EAAM/pB,KAAK,CAAE0J,OAAQkgB,EAAU7R,UAAW,CAAE7V,KAAM,MAAOf,KAAM8K,GAAS9K,KAAM8K,EAAOyc,UAEvF,CAEIsB,IAAcC,GACjBF,EAAM/pB,KAAK,CACV0J,OAAQkgB,EACR7R,UAAW,CAAE7V,KAAM,MAAOf,KAAM,UAChCA,KAAM,SACNunB,WAGFC,EAAc3oB,QAAQ+pB,EACvB,CAhDEU,CAAkBpC,EAAUC,EAAUzJ,EAAS8J,EAAeD,GACvDC,IAiDT,SACCa,EACAC,EACA5K,EACA8J,EACAD,GAEA,MAAMgC,EAAUnB,GAAkBC,GAC5BmB,EAAUpB,GAAkBE,GAC5BM,EAA+B,GAErC,IAAK,MAAM3hB,KAAOsiB,EACZC,EAAQ1lB,IAAImD,IAChB2hB,EAAM/pB,KAAK,CAAE0J,OAAQ8f,EAAQzR,UAAW,CAAE7V,KAAM,MAAOf,KAAMiH,GAAOjH,KAAMiH,EAAKsgB,WAEjF,IAAK,MAAMtgB,KAAOuiB,EACZD,EAAQzlB,IAAImD,IAChB2hB,EAAM/pB,KAAK,CAAE0J,OAAQ8f,EAAQzR,UAAW,CAAE7V,KAAM,MAAOf,KAAMiH,GAAOjH,KAAMiH,EAAKsgB,WAEjF,IAAK,MAAMtgB,KAAOuiB,EAAS,CAC1B,IAAKD,EAAQzlB,IAAImD,GAAM,SACvB,MAAMkiB,EAAWnN,GAAQqM,EAAephB,IAClCmiB,EAAWpN,GAAQsM,EAAerhB,IACpCggB,GAAmBkC,EAAUC,GAChClB,GAAeiB,EAAUC,EAAU1L,EAAS8J,EAAeD,GAChDtnB,OAAOopB,GAAGF,EAAUC,IAC/BR,EAAM/pB,KAAK,CAAE0J,OAAQ8f,EAAQzR,UAAW,CAAE7V,KAAM,MAAOf,KAAMiH,GAAOjH,KAAMiH,EAAKsgB,UAEjF,CAEAC,EAAc3oB,QAAQ+pB,EACvB,CA7ECa,CAAqBvC,EAAUC,EAAUzJ,EAAS8J,EAAeD,GAC1DC,GAV6CA,CAWrD,CAgFA,SAASQ,GAAiB/R,EAAwByT,GACjD,IAAItR,EAAsCnC,EAC1C,MAAMyH,EAAU,IAAIjZ,QACpB,KAAO2T,IAAYsF,EAAQ5Z,IAAIsU,IAAU,CAExC,GADAsF,EAAQpf,IAAI8Z,GACRsR,EAAW5lB,IAAIsU,GAAU,OAAO,EACpCA,EAAUvD,GAAa1T,IAAIiX,EAC5B,CACA,OAAO,CACR,UClMgBuR,GAAU7jB,EAAU9F,EAAYgS,IAC/ClM,EAAMkW,GAAOlW,GACb,MAAM8jB,EAAsB/N,KAG5B,IACE+N,GACgB,iBAAT5pB,GAAqBA,IAASgS,GAEtC,OAED,IAAI6R,EAAiBlP,GAASxT,IAAI2E,GAC7B+d,IACJA,EAAiB,IAAIziB,IACrBuT,GAASrU,IAAIwF,EAAK+d,IAEnB,IAAIvN,EAAOuN,EAAe1iB,IAAInB,GACzBsW,IACJA,EAAO,IAAIvY,IACX8lB,EAAevjB,IAAIN,EAAMsW,IAE1BA,EAAKhY,IAAIsrB,GAGT,MAAMjG,EAAgBjP,GAAwBvT,IAAIyoB,GAC9CjG,EACHA,EAAcrlB,IAAIwH,GAElB4O,GAAwBpU,IAAIspB,EAAqB,IAAI7rB,IAAI,CAAC+H,IAE5D,CFDA4gB,GAAiBniB,KAAMY,OAAQT,MAAOjF,QAAS+E,UACzB,oBAAXqlB,UArCX,YAAgD/jB,GAC/C,IAAK,MAAMgkB,KAAKhkB,EAAK,CACpB,IACC7F,OAAOQ,eAAeqpB,EAAGhY,GAAiB,CACzCjO,OAAO,EACPoC,UAAU,EACVC,YAAY,EACZ3F,cAAc,GAEhB,CAAE,MAAO,CACHuR,MAAoBgY,GAAevD,GAAmBjoB,IAAIwrB,EACjE,CACOhkB,EAAI,EACZ,CAyBCikB,CAAgBF,OAAQG,UACxBtD,GAAiB1gB,KAAMikB,QAASvoB,YAAahB,cGdvC,MAAMwpB,GAAa,IAAIjsB,QAExBksB,GAAoB,GACpBC,GAAmB,CACxB,CAAC/nB,OAAO0F,aAAc,iBACtB,GAAA5G,CAAI2E,EAAU9F,EAAmB+F,GAChC,GAAID,GAAsB,iBAARA,IAAqB7F,OAAOsH,OAAOzB,EAAK9F,GAAO,CAChE,MAAMqqB,EAAYH,GAAW/oB,IAAI2E,EAAIoC,aACrC,GAAImiB,GAAarqB,KAAQqqB,EAAW,CACnC,MAAMjqB,EAAOH,OAAOI,yBAAyBgqB,EAAWrqB,GACxD,OAAOI,EAAKe,IAAMf,EAAKe,IAAIjC,KAAK4G,GAAO,IAAIpH,IAAS0B,EAAKyD,MAAM/E,MAAMgH,EAAKpH,EAC3E,CACD,CACA,GAAIsB,IAAS8R,GAAiB,OAAO,EACrC,MAAMwY,EAAetO,GAAOlW,GAE5B,GAAIwkB,EAAavY,KAAuBjO,IAAI9D,IAAyB,iBAATA,EAC3D,OAAO6F,EAAU1E,IAAI2E,EAAK9F,EAAM+F,GAGjC,MAAMwkB,EAAUtlB,QAAQnB,IAAIiC,EAAU/F,GAChCwqB,EAAYD,GAAWtqB,OAAOsH,OAAOxB,EAAU/F,GAC/CyqB,EAAoBF,IAAYC,EAIhCE,EACLzpB,GAAQiT,iBACRsW,IACCrkB,EAAcJ,EAAU/F,IAASmG,EAAcmkB,EAActqB,IAW/D,GAPEuqB,IACEtpB,GAAQgT,iBAAmBwW,GAAqB3kB,aAAe7F,QAChEyqB,IAEFf,GAAU7jB,EAAK9F,GAGZyqB,KAAuBxpB,GAAQgT,mBAAqBnO,aAAe7F,SAAU,CAChF,IAAImY,EAAUuS,GAAe1qB,OAAOwG,eAAeX,IACnD,KAAOsS,GAAWA,IAAYnY,OAAOuB,YACpCmoB,GAAUvR,EAASpY,IACfC,OAAOsH,OAAO6Q,EAASpY,KAFoB,CAG/C,IAAI4d,EAAO+M,GAAe1qB,OAAOwG,eAAe2R,IAC5CwF,IAASxF,IACZwF,EAAO+M,GAAe1qB,OAAOwG,eAAeuV,GAAO5D,MAEpDA,EAAUwF,CACX,CACD,CACA,MAAM/Z,EAAQgC,EAAU1E,IAAI2E,EAAK9F,EAAM+F,GACvC,GAAqB,iBAAVlC,GAAgC,OAAVA,EAAgB,CAChD,MAAM+mB,EAAgBD,GAAe9mB,GAOrC,OAJIyhB,GAAoBxf,IACvBmf,GAAiB2F,EAAe9kB,EAAK9F,GAG/B4qB,CACR,CACA,OAAO/mB,CACR,EACA,GAAAvD,CAAIwF,EAAU9F,EAAmB6D,EAAYkC,GAE5C,MAAMukB,EAAetO,GAAOlW,GACtB+kB,EAAoB7O,GAAOjW,GAGjC,GAAIukB,EAAavY,KAAuBjO,IAAI9D,IAASsqB,IAAiBO,EACrE,OAAOhlB,EAAUvF,IAAIwF,EAAK9F,EAAM6D,EAAOkC,GACxC,MAAMohB,EAAWnL,GAAOnY,GAGxB,IAAIinB,EAASrE,GACb,GAAIxhB,QAAQnB,IAAI+mB,EAAmB7qB,GAAO,CAEpBC,OAAOI,yBAAyBwqB,EAAmB7qB,GACrDC,OAAOI,yBAAyBiqB,EAActqB,GAKhE8qB,EAAS3H,GAAU,IAAMle,QAAQ9D,IAAImpB,EAActqB,EAAM+F,GAI3D,CACA,GAAI+e,GAAwBhhB,IAAIgC,KACT,iBAAXglB,GAAkC,OAAXA,GACjC1F,GAAoB0F,EAAQhlB,EAAK9F,GAEV,iBAAbmnB,GAAsC,OAAbA,GAAmB,CAEtDlC,GADsB0F,GAAexD,GACLrhB,EAAK9F,EACtC,CAUD,OAPI8qB,IAAW3D,GAGVthB,EAAUvF,IAAIwF,EAAK9F,EAAMmnB,EAAUphB,IACtCqhB,GAAqBthB,EAAK9F,EAAM8qB,EAAQ3D,EAAU2D,IAAWrE,KAGxD,CACR,EACA,GAAA3iB,CAAIgC,EAAU9F,GACb,GAAImqB,GAAWvhB,SAAS9C,GACvB,MAAM,IAAIwM,GACT,wEAAwElN,OAAOpF,MAC/E,CACCwS,KAAMH,EAAAA,kBAAkB8M,cACxBC,MAAO,KAGV+K,GAAWtrB,KAAKiH,GAChB6jB,GAAU7jB,EAAK9F,GACf,MAAMsJ,EAAKrE,QAAQnB,IAAIgC,EAAK9F,GAE5B,OADAmqB,GAAWvN,MACJtT,CACR,EACA,cAAAyhB,CAAejlB,EAAU9F,GACxB,IAAKC,OAAOsH,OAAOzB,EAAK9F,GAAO,OAAO,EAEtC,MAAM8qB,EAAUhlB,EAAY9F,GAe5B,OAZI8kB,GAAwBhhB,IAAIgC,IAA0B,iBAAXglB,GAAkC,OAAXA,GACrE1F,GAAoB0F,EAAQhlB,EAAK9F,UAG1B8F,EAAY9F,GACpBqmB,GAASvgB,EAAK,CAAE/E,KAAM,MAAOf,QAAQA,GAGjC8kB,GAAwBhhB,IAAIgC,IAC/B0f,GAAe1f,IAGT,CACR,EACAsF,QAAQtF,IACP6jB,GAAU7jB,EAAKkM,IACR/M,QAAQmG,QAAQtF,KAInBklB,GAAkB,IAAIvmB,QAOfwmB,GAAe9a,EAAOvF,GAClC,cAA4BA,EAC3B,WAAA1C,IAAexJ,GAKd,OAJA0J,SAAS1J,GAIFssB,GAAgBlnB,gBAAkBonB,GAASnsB,MAAQA,IAC3D,IAIF,SAAS4rB,GAAkBQ,GAC1B,IAAKA,GAAkC,iBAAdA,EAAwB,OAAOA,EACxD,MAAM5iB,EAAS4iB,EAEf,GAAItE,GAActe,GAAS,OAAOA,EAElC,GADgBwT,GAAcjY,IAAIyE,GACrB,OAAOA,EAGpB,MAAM2M,EPzMD,SAA6C3M,GAClD,OAAOuT,GAAc3a,IAAIoH,EAC1B,COuMkB6iB,CAAiB7iB,GAClC,QAAiBG,IAAbwM,EAAwB,OAAOA,EAEnC,MAAMmW,IACLxZ,MAAkBtJ,IAAYA,aAAkBA,EAAOsJ,IAEpDtJ,EADA,IAAIA,EAAOsJ,IAAgBtJ,GAE3B8iB,IAAY9iB,GP5MX,SAA2B+iB,EAAe/iB,GAC/CwT,GAAczb,IAAIgrB,EAAO/iB,EAC1B,CO0MyBgjB,CAAiBF,EAAS9iB,GAClD,MAAM+iB,EAAQ,IAAIpmB,MAAMmmB,EAASjB,IAIjC,OP1NK,SAAiC7hB,EAAgB+iB,GACtDxP,GAAcxb,IAAIiI,EAAQ+iB,GAC1BvP,GAAczb,IAAIgrB,EAAO/iB,EAC1B,COsNCijB,CAAuBjjB,EAAQ+iB,GACxBA,CACR,CAMO,MAAMJ,GAAW3hB,EAAU,CACjC,MAAMiB,GACL,GAAIA,EAAShJ,qBAAqBypB,GAEjC,OADAD,GAAgB1sB,IAAIkM,GACbA,EAGR,MAAMihB,UAAiBjhB,EACtB,WAAAtC,IAAexJ,GAQd,OAPA0J,SAAS1J,gBACU+sB,GAAaT,GAAgBlnB,iBAC/C7C,GAAQoT,KACP,GAAI7J,EAAiB7E,8BAA8B5G,KAAKmJ,YAAYvC,6HAI/DulB,GAASnsB,KACjB,EAKD,OAHAkB,OAAOQ,eAAegrB,EAAU,OAAQ,CACvC5nB,MAAO,YAAY2G,EAAS7E,UAEtB8lB,CACR,EACAtqB,IAAIqJ,GACImgB,GAAengB,GAEvBrB,QAASwhB,KCvNJ,SAAUe,GACfnjB,EACAnE,GACAua,UAAEA,GAAY,GAAU,IAExB,GAAIpW,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,MAAM,IAAI7D,MAAM,6CAEhD,MAAMinB,EAAkC5W,GAAa,IAAM3Q,EAASmE,GAASnE,GAG7E,OAAO6R,GAAO,KAEb6O,GAAwBxmB,IAAIiK,GAG5B,IAAIob,EAAgBqB,GAA2B7jB,IAAIwqB,GAC9ChI,IACJA,EAAgB,IAAI5lB,IACpBinB,GAA2B1kB,IAAIqrB,EAAiBhI,IAEjDA,EAAerlB,IAAIiK,GAInB,MAAMmV,EAAU,IAAIjZ,QA0EpB,OAzEA,SAASmnB,EAAiB9lB,EAAU2H,EAAQ,GAvD9C,IAAkB5J,EAyDf,MAAKiC,GAAO4X,EAAQ5Z,IAAIgC,KAzDTjC,EAyD2BiC,EAxDpB,iBAAVjC,GAAgC,OAAVA,IAwDgB4J,EAAQxM,GAAQ+S,mBAE9D6S,GAAc/gB,IAAlB,CACA4X,EAAQpf,IAAIwH,GAGZgf,GAAwBxmB,IAAIwH,GAC5B6d,EAAerlB,IAAIwH,GAInB,IAAK,MAAMmB,KAAO+U,GAAOlW,GACxB,GAAI7F,OAAOsH,OAAOzB,EAAKmB,GAAM,CAE5B,MAAMpD,EAASiC,EAAYmB,GAI3B2kB,EADkB,iBAAV/nB,GAAgC,OAAVA,EAAiBqnB,GAASrnB,GAASA,EACjC4J,EAAQ,EACzC,CAKD,GAAInJ,MAAMqC,QAAQb,IAAQA,aAAexB,MAAO,CAE/C,MAAMjF,EAASyG,EAAIzG,OAGnB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAQD,IAAK,CAEhC,MAAMyE,EAAQiC,EAAI1G,GAIlBwsB,EADkB,iBAAV/nB,GAAgC,OAAVA,EAAiBqnB,GAASrnB,GAASA,EACjC4J,EAAQ,EACzC,CACD,MAEK,GAAI3H,aAAe/H,IAEvB,IAAK,MAAM8F,KAASiC,EAAK,CAIxB8lB,EADkB,iBAAV/nB,GAAgC,OAAVA,EAAiBqnB,GAASrnB,GAASA,EACjC4J,EAAQ,EACzC,MAGI,GAAI3H,aAAe1E,IAEvB,IAAK,MAAOkO,EAAMzL,KAAUiC,EAAK,CAIhC8lB,EADkB,iBAAV/nB,GAAgC,OAAVA,EAAiBqnB,GAASrnB,GAASA,EACjC4J,EAAQ,EACzC,CAtDuB,CA0DzB,CAIAme,CAAiBrjB,GAGboW,GAAWva,EAASmE,GACxBoW,GAAY,EAGL,KAEN,MAAMgF,EAAgBqB,GAA2B7jB,IAAIwqB,GACrD,GAAIhI,EAAe,CAElB,IAAK,MAAM7d,KAAO6d,EAAe,CAEhC,MAAMhP,EAAWoQ,GAAa5jB,IAAI2E,GAC9B6O,GAEHA,EAASrV,OAAOqsB,GAGM,IAAlBhX,EAAS7R,OACZiiB,GAAazlB,OAAOwG,GACpBgf,GAAwBxlB,OAAOwG,KAIhCgf,GAAwBxlB,OAAOwG,EAEjC,CAGAkf,GAA2B1lB,OAAOqsB,EACnC,IAGH,OCtJaxZ,GAAU9P,OAAO,WAIxBwpB,GAAWxpB,OAAO,aAqJjB,MAAMypB,GAAaviB,EAAU,CACnC,MAAMiB,GAELkc,GAAiBlc,EAClB,EACArB,QA1BD,SACC4iB,KACGrtB,GAEH,MAAuB,iBAATqtB,EAtBf,SAA4BjmB,GAE3B,GAAI+gB,GADJ/gB,EAAMkW,GAAOlW,IACW,OAAOA,EAC/B,IACC7F,OAAOQ,eAAeqF,EAAegM,GAAiB,CACrDjO,OAAO,EACPoC,UAAU,EACVC,YAAY,EACZ3F,cAAc,GAEhB,CAAE,MAAO,CAIT,OAHMuR,MAAoBhM,GAAiBygB,GAAmBjoB,IAAIwH,GAG3DA,CACR,CAQIkmB,CAAgBD,GACbvhB,IAEHA,EAAShJ,UAAUuQ,IAAwB,IAAIhU,IAC9CyM,EAAShJ,UAAUuQ,KAAyB,IAG7CvH,EAAShJ,UAAUuQ,IAAsBzT,IAAIytB,GAC7C,IAAK,MAAME,KAAOvtB,EAAM8L,EAAShJ,UAAUuQ,IAAsBzT,IAAI2tB,GACrE,OAAOzhB,CACP,CACJ,IAeM,SAAU0hB,GAA4BpmB,EAAQqmB,GACnD,OAAOlsB,OAAOQ,eAAeqF,EAAKqM,GAAS,CAC1CtO,MAAOsoB,EACPlmB,UAAU,EACVC,YAAY,EACZ3F,cAAc,GAEhB,CC3KA,MAAM6rB,GAAmB,IAAInuB,QACvBouB,GAAkB,IAAIpuB,QAE5B,SAASquB,GAAkBC,EAA6BtlB,GACvDslB,EAAKC,WAALD,EAAKC,SAAa,IAAIvuB,SACtB,IAAIwuB,EAASF,EAAKC,SAASrrB,IAAI8F,GAK/B,OAJKwlB,IACJA,EAAS,CAAA,EACTF,EAAKC,SAASlsB,IAAI2G,EAAKwlB,IAEjBA,CACR,CAEA,SAASC,GACRluB,GAEA,MAAMmuB,EAASrX,GAAQ9W,GACjB0W,EAAWkX,GAAiBjrB,IAAIwrB,GACtC,GAAIzX,EAAU,OAAOA,EAErB,MAAM0X,EAAmC,CAAA,EACnCC,EAAW9X,GAAa,IAAIrW,KACjC,MAAMouB,EAAYpuB,EAClB,GAAIouB,EAAU7f,KAAMgf,KAAUA,GAAO,CAAC,SAAU,SAAU,YAAYrjB,gBAAgBqjB,KACrF,MAAM,IAAIvnB,MAAM,6CAEjB,IAAI4U,EAA8BsT,EAElC,IAAK,MAAMX,KAAOa,EACjBxT,EAAOgT,GAAUhT,EAAM2S,GAIxB,GADAtC,GAAUrQ,EAAM,WACZ,WAAYA,EAAM,CACrB,GAAIrY,GAAQ4S,yBAA0B,CACrC,MAAMkZ,EAAkB9rB,GAAQ8S,kBAChC9S,GAAQ8S,mBAAoB,EAC5B,IACC,MAAMiZ,EAAQ7J,GAAU,IAAM3kB,KAAMsuB,IAC/BzmB,EAAYiT,EAAKgF,OAAQ0O,IAC7B/rB,GAAQ4S,yBAAyByF,EAAKgF,OAAQ0O,EAAOxuB,EAAIsuB,EAAW,cAEtE,SACC7rB,GAAQ8S,kBAAoBgZ,CAC7B,CACD,CACA,OAAOzT,EAAKgF,MACb,CA0BA,GAtBAhF,EAAKnH,QAAU6C,GAAK,IACnBiB,GACC,KAGCqD,EAAKgF,OAAS9f,KAAMsuB,GACb,YAECxT,EAAKgF,OACZ+H,GAAS/M,EAAM,CAAEvY,KAAM,aAAcf,KAAM8sB,GAAa,WAGpDxT,EAAKnH,UACRmH,EAAKnH,UACLmH,EAAKnH,aAAUzJ,KAIlB,CAAEwb,QAAQ,KAIRjjB,GAAQ4S,yBAA0B,CACrC,MAAMkZ,EAAkB9rB,GAAQ8S,kBAChC9S,GAAQ8S,mBAAoB,EAC5B,IACC,MAAMiZ,EAAQ7J,GAAU,IAAM3kB,KAAMsuB,IAC/BzmB,EAAYiT,EAAKgF,OAAQ0O,IAC7B/rB,GAAQ4S,yBAAyByF,EAAKgF,OAAQ0O,EAAOxuB,EAAIsuB,EAAW,aAEtE,SACC7rB,GAAQ8S,kBAAoBgZ,CAC7B,CACD,CAEA,OAAOzT,EAAKgF,QACV9f,GAIH,OAFA4tB,GAAiB9rB,IAAIqsB,EAAQE,GAC7BT,GAAiB9rB,IAAIusB,EAAUA,GACxBA,CACR,CAEO,MAAMI,GAAU1jB,EAAU,CAChCT,OAAM,CAAC0B,EAAUjC,EAAQC,IACjB,WACN,IAAI0kB,EAAUb,GAAgBlrB,IAAIqJ,GAC7B0iB,IACJA,EAAUnY,GACTtP,EACEmK,GACOpF,EAAStL,KAAK0Q,GAEtB,GAAGxK,OAAOmD,GAAQL,aAAavC,MAAQ4C,GAAQ5C,MAAQ,aAAaP,OAAOoD,MAE5E,CACCU,OAAQsB,EACRhC,iBACKgC,EAAiB4H,IACnB,CAAEA,CAACA,IAAgB5H,EAAiB4H,KACpC,KAGLia,GAAgB/rB,IAAIkK,EAAU0iB,IAG/B,OADiBR,GAAgBQ,EAC1BL,CAAS9tB,KACjB,EAEDmK,OAAM,CAACsB,EAAUjC,EAAQ5C,IACjB,YAAwBjH,GAC9B,IAAIwuB,EAAUb,GAAgBlrB,IAAIqJ,GAC7B0iB,IACJA,EAAUnY,GACTtP,EACC,CAACmK,KAAiBlR,IACV8L,EAAStL,KAAK0Q,KAASlR,GAE/B,GAAG0G,OAAOmD,GAAQL,aAAavC,MAAQ4C,GAAQ5C,MAAQ,aAAaP,OAAOO,MAE5E,CACCuD,OAAQsB,EACRhC,YAAa7C,KACR6E,EAAiB4H,IACnB,CAAEA,CAACA,IAAgB5H,EAAiB4H,KACpC,KAGLia,GAAgB/rB,IAAIkK,EAAU0iB,IAG/B,OADiBR,GAAgBQ,EAC1BL,CAAS9tB,QAASL,EAC1B,EAEDyK,QAASujB,KCnJJ,SAAWS,GAAwB1hB,GACxC,IAAI6S,EAAS7S,EAASmS,OACtB,MAAQU,EAAO8O,YACRlC,GAAS5M,EAAOza,OACtBya,EAAS7S,EAASmS,MAEpB,CAKM,SAAWyP,GAAkC5hB,GAClD,IAAI6S,EAAS7S,EAASmS,OACtB,MAAQU,EAAO8O,MAAM,CACpB,MAAOnmB,EAAKpD,GAASya,EAAOza,WACtB,CAACqnB,GAASjkB,GAAMikB,GAASrnB,IAC/Bya,EAAS7S,EAASmS,MACnB,CACD,KCSM0P,GAAa,uCADlBxB,SAEQyB,EA9BT,WACC,MAAMC,UAAqB7iB,EAAUa,EAAkB,CACtD,GAAArK,CAAe2J,GACd,OAAO/L,KAAK0L,GAAOK,EACpB,EACA,GAAAxK,CAAewK,EAAejH,GAC7B9E,KAAK2L,GAAOI,EAAOjH,EACpB,EACA,SAAAmH,GACC,OAAOjM,KAAKM,MACb,EACA,SAAA8L,CAAqBtH,GACpB9E,KAAKM,OAASwE,CACf,KAEA,OAAA4pB,GACC,OAAOnpB,MAAM0U,KAAKja,KACnB,EAED,OAAOyuB,CAIR,CAOSE,oBAARC,EAAA,cAAQJ,EAGR,KAAcK,EAAA,IAAA3vB,QAAA4vB,EAAA,IAAA5vB,QAAA6vB,EAAA,IAAA7vB,QAAA8vB,EAAA,IAAA9vB,QAAA+vB,EAAA,IAAA/vB,QAAAgwB,EAAA,IAAAhwB,QAAAiwB,EAAA,IAAAjwB,QAAAkwB,EAAA,IAAA1pB,QAAC8G,MACd,OAAOxM,KAAK0uB,SACb,CASA,WAAAvlB,CAAYkmB,EAA0BC,GAGrC,IAAIC,EAKJ,GAPAlmB,oBATQwlB,EAAAttB,IAAAvB,aACA8uB,EAAAvtB,IAAAvB,aACA+uB,EAAAxtB,IAAAvB,aACAgvB,EAAAztB,IAAAvB,KAAS,IAAIqC,KACb4sB,EAAA1tB,IAAAvB,KAAa,IAAIqC,KACjB6sB,EAAA3tB,IAAAvB,KAAc,IAAIhB,KAClBmwB,EAAA5tB,IAAAvB,aAMRkX,GAAO,EAAG4M,aACTyL,EAAYzL,IAEb0L,EAAAxvB,KAAImvB,EAAWI,EAAU,KACJ,mBAAVF,EAAsB,MAAM,IAAI1pB,MAAM,oCACjD6pB,EAAAxvB,KAAI6uB,EAAUQ,EAAK,KACnBG,EAAAxvB,KAAI8uB,EAAS3C,GAAS,SACtBqD,EAAAxvB,OAAemsB,GAAS,IAAI9pB,KAAY,KACpCitB,GAAStvB,KAAKF,QAAQwvB,EAC3B,CAEQ,SAAAG,CAAU3qB,GACjB,IAAI4qB,EAAOlT,EAAAxc,KAAIivB,EAAA,KAAY7sB,IAAI0C,GAC/B,GAAI4qB,EAAM,OAAOA,EAAKxnB,IAetB,GAdAwnB,EAAO,CAAExnB,SAAKyB,GACd6S,EAAAxc,YAAgBuB,IAAIuD,EAAO4qB,GAC3BlT,EAAAxc,KAAImvB,EAAA,KAAQhvB,KAAZH,KAAa,KACZ,MAAM2vB,EAAOzY,GAAO,EAAGoN,eACtB,MAAMsL,EAAUpT,EAAAxc,KAAI6uB,EAAA,UAAJ7uB,KAAY8E,GAC5B9E,KAAK6vB,eAAeD,GACpB,MAAME,EAAcJ,EAAMxnB,IACtBoc,QAA4B3a,IAAhBmmB,IAA8B5uB,OAAOopB,GAAGsF,EAASE,IAChEtT,EAAAxc,KAAIovB,EAAA,IAAAW,GAAY5vB,KAAhBH,KAAiB8E,EAAOgrB,EAAaF,GACtCF,EAAMxnB,IAAM0nB,IAEbF,EAAMC,KAAOA,EACbnT,EAAAxc,KAAIkvB,EAAA,KAAa3vB,IAAIowB,UAELhmB,IAAb+lB,EAAKxnB,IAAmB,MAAM,IAAIvC,MAAM,oDAC5C,OAAO+pB,EAAKxnB,GACb,CAEQ,cAAA2nB,CAAe3nB,GACtB,MAAMlG,SAAckG,EACpB,GAAa,WAATlG,GAA8B,WAATA,GAA8B,WAATA,EAC7C,MAAM,IAAI2D,MAAM,mDAClB,CAEQ,WAAAqqB,CAAY9nB,EAAQpD,GAC3B,MAAMqR,EAAWqG,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAI8F,QACjByB,IAAbwM,GAA0BA,IAAarR,GAAO9E,KAAKiwB,aAAa9Z,GACpEqG,EAAAxc,YAAauB,IAAI2G,EAAKpD,EACvB,CAEQ,YAAAmrB,CAAanrB,GACpB,MAAM4qB,EAAOlT,EAAAxc,KAAIivB,EAAA,KAAY7sB,IAAI0C,GACjC,IAAK4qB,EAAM,OACX,MAAMC,EAAOD,EAAKC,KACdA,IACHD,EAAKC,UAAOhmB,EACZ6S,EAAAxc,KAAIkvB,EAAA,KAAa3uB,OAAOovB,GACxBA,KAEDnT,EAAAxc,KAAIivB,EAAA,KAAY1uB,OAAOuE,EACxB,CAEQ,iBAAAorB,GACP,IAAK,MAAMprB,KAASS,MAAM0U,KAAKuC,EAAAxc,KAAIivB,EAAA,KAAY3mB,QAAStI,KAAKiwB,aAAanrB,GAC1E0X,EAAAxc,KAAIkvB,EAAA,KAAalf,OAClB,CAoBQ,cAAAmgB,CAAejoB,GACtB,MAAMiQ,EAAQqE,EAAAxc,KAAIgvB,EAAA,KAAQ5sB,IAAI8F,IAAQ,EACtCsU,EAAAxc,KAAIgvB,EAAA,KAAQztB,IAAI2G,EAAKiQ,EAAQ,EAC9B,CAEQ,cAAAiY,CAAeloB,GACtB,MAAMiQ,EAAQqE,EAAAxc,KAAIgvB,EAAA,KAAQ5sB,IAAI8F,GAC9B,GAAKiQ,EACL,GAAIA,GAAS,EAAG,CACf,MAAMrT,EAAQ0X,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAI8F,GAC/BsU,EAAAxc,KAAIgvB,EAAA,KAAQzuB,OAAO2H,GACnBsU,EAAAxc,KAAI+uB,EAAA,KAASxuB,OAAO2H,QACNyB,IAAV7E,GAAqB9E,KAAKiwB,aAAanrB,EAC5C,MACC0X,EAAAxc,KAAIgvB,EAAA,KAAQztB,IAAI2G,EAAKiQ,EAAQ,EAE/B,CAEQ,cAAAkY,CAAetkB,EAAeukB,GAAW,GAChD,MAAMhwB,EAASN,KAAKM,OACpB,IAAIiwB,EAAWxkB,EAEf,GADIwkB,EAAW,IAAGA,EAAWtG,KAAKD,IAAI1pB,EAASiwB,EAAU,IACrDA,EAAWjwB,EAAQ,CACtB,IAAIgwB,EACC,MAAM,IAAIvqB,WAAW,uBADZwqB,EAAWjwB,CAE1B,CACA,IAAKgwB,GAAYC,IAAajwB,EAAQ,MAAM,IAAIyF,WAAW,uBAC3D,OAAOwqB,CACR,CAEQ,QAAAC,CAASzkB,EAAe7D,EAAQpD,GACvC,MAAM2rB,EAASjU,EAAAxc,YAAW+L,QACXpC,IAAX8mB,GAAwBvvB,OAAOopB,GAAGmG,EAAQvoB,UAI/ByB,IAAX8mB,GAAsBzwB,KAAKowB,eAAeK,GAC9CjU,EAAAxc,KAAI8uB,EAAA,KAAO/iB,GAAS7D,EACpBlI,KAAKmwB,eAAejoB,IALnBlI,KAAKgwB,YAAY9nB,EAAKpD,EAOxB,CAEQ,cAAA4rB,CAAe3kB,EAAe7D,EAAQpD,GAC7C0X,EAAAxc,KAAI8uB,EAAA,KAAO6B,OAAO5kB,EAAO,EAAG7D,GAC5BlI,KAAKmwB,eAAejoB,GACpBlI,KAAKgwB,YAAY9nB,EAAKpD,EACvB,CAEQ,WAAA8rB,CAAY3rB,GACnBjF,KAAKkwB,oBACL1T,EAAAxc,KAAI8uB,EAAA,KAAO6B,OAAO,EAAGnU,EAAAxc,KAAI8uB,EAAA,KAAOxuB,QAChCkc,EAAAxc,KAAIgvB,EAAA,KAAQhf,QACZwM,EAAAxc,KAAI+uB,EAAA,KAAS/e,QACb,IAAK,MAAMlL,KAASG,EAAQ,CAC3B,MAAMiD,EAAMlI,KAAKyvB,UAAU3qB,GAC3B0X,EAAAxc,KAAI8uB,EAAA,KAAOhvB,KAAKoI,GAChBlI,KAAKmwB,eAAejoB,GACpBsU,EAAAxc,YAAauB,IAAI2G,EAAKpD,EACvB,CACD,CAEA,UAAIxE,GACH,OAAOkc,EAAAxc,KAAI8uB,EAAA,KAAOxuB,MACnB,CAEA,EAAAyvB,EAAA,SAnFYjrB,EAAU2rB,EAAWI,GAChC,GAAI3vB,OAAOopB,GAAGmG,EAAQI,GAAS,OAC/B,MAAMC,EAAgBtU,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAIyuB,GACvC,QAAsBlnB,IAAlBmnB,GAA+BA,IAAkBhsB,EACpD,MAAM,IAAIa,MAAM,kCAAkCU,OAAOwqB,MAC1D,MAAM1Y,EAAQqE,EAAAxc,KAAIgvB,EAAA,KAAQ5sB,IAAIquB,GAC9B,IAAKtY,EAAO,OACZ,MAAM4Y,EAAgBvU,EAAAxc,KAAIgvB,EAAA,KAAQ5sB,IAAIyuB,IAAW,EACjD7wB,KAAKgwB,YAAYa,EAAQ/rB,GACzB,IAAK,IAAIzE,EAAI,EAAGA,EAAImc,EAAAxc,KAAI8uB,EAAA,KAAOxuB,OAAQD,IAClCa,OAAOopB,GAAG9N,EAAAxc,KAAI8uB,EAAA,KAAOzuB,GAAIowB,KAASjU,EAAAxc,KAAI8uB,EAAA,KAAOzuB,GAAKwwB,GACvDrU,EAAAxc,KAAIgvB,EAAA,KAAQztB,IAAIsvB,EAAQE,EAAgB5Y,GACxCqE,EAAAxc,KAAIgvB,EAAA,KAAQzuB,OAAOkwB,GACnBjU,EAAAxc,KAAI+uB,EAAA,KAASxuB,OAAOkwB,GACpB,MAAMO,EAAcxU,EAAAxc,KAAIivB,EAAA,KAAY7sB,IAAI0C,GACpCksB,IAAaA,EAAY9oB,IAAM2oB,EACpC,EAmECnlB,IAAOK,GACP,MAAM7D,EAAMsU,EAAAxc,YAAW+L,GACvB,YAAepC,IAARzB,OAAoByB,EAAY6S,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAI8F,EACzD,CAEA,CAACyD,GAAOI,EAAejH,GACtB,MAAMoD,EAAMlI,KAAKyvB,UAAU3qB,GAC3B,GAAIiH,IAAU/L,KAAKM,OAElB,YADAN,KAAK0wB,eAAe3kB,EAAO7D,EAAKpD,GAGjC,MAAMmsB,EAAajxB,KAAKqwB,eAAetkB,GACvC/L,KAAKwwB,SAASS,EAAY/oB,EAAKpD,EAChC,CAEA,IAAAhF,IAAQkO,GACP,IAAK,MAAMkjB,KAAQljB,EAAO,CACzB,MAAM9F,EAAMlI,KAAKyvB,UAAUyB,GAC3BlxB,KAAK0wB,eAAe1wB,KAAKM,OAAQ4H,EAAKgpB,EACvC,CACA,OAAOlxB,KAAKM,MACb,CAEA,GAAAud,GACC,GAAK7d,KAAKM,OACV,OAAON,KAAKmxB,SAASnxB,KAAKM,OAAS,EACpC,CAEA,KAAA0Y,GACC,GAAKhZ,KAAKM,OACV,OAAON,KAAKmxB,SAAS,EACtB,CAEA,OAAAvT,IAAW5P,GACV,IAAIjC,EAAQ,EACZ,IAAK,MAAMmlB,KAAQljB,EAAO,CACzB,MAAM9F,EAAMlI,KAAKyvB,UAAUyB,GAC3BlxB,KAAK0wB,eAAe3kB,IAAS7D,EAAKgpB,EACnC,CACA,OAAOlxB,KAAKM,MACb,CAEA,MAAAqwB,CAAO9iB,EAAeqB,KAAyBlB,GAC9C,MAAMojB,EAAkBpxB,KAAKqwB,eAAexiB,GAAO,GAC7CwjB,EAAerxB,KAAKM,OAAS8wB,EAC7BE,EAAerH,KAAKsH,SACT5nB,IAAhBuF,EAA4BmiB,EAAepH,KAAKD,IAAI9a,EAAa,GACjEmiB,GAEKG,EAAoB,GAC1B,IAAK,MAAMN,KAAQljB,EAAOwjB,EAAa1xB,KAAKE,KAAKyvB,UAAUyB,IAC3D,MAAMO,EAAcjV,EAAAxc,YAAW2wB,OAAOS,EAAiBE,KAAiBE,GAClEE,EAAqB,GAC3B,IAAK,MAAMxpB,KAAOupB,EAAa,CAC9B,QAAY9nB,IAARzB,EAAmB,SACvB,MAAMpD,EAAQ0X,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAI8F,GAC/BlI,KAAKowB,eAAeloB,GACpBwpB,EAAc5xB,KAAKgF,EACpB,CACA,IAAK,IAAIzE,EAAI,EAAGA,EAAImxB,EAAalxB,OAAQD,IAAK,CAC7C,MAAM6H,EAAMspB,EAAanxB,GACnByE,EAAQkJ,EAAM3N,GACpBL,KAAKmwB,eAAejoB,GACpBlI,KAAKgwB,YAAY9nB,EAAKpD,EACvB,CACA,OAAO4sB,CACR,CAEA,KAAA1hB,GACCwM,EAAAxc,KAAI8uB,EAAA,KAAOxuB,OAAS,EACpBkc,EAAAxc,KAAIgvB,EAAA,KAAQhf,QACZwM,EAAAxc,KAAI+uB,EAAA,KAAS/e,QACbhQ,KAAKkwB,mBACN,CAEA,GAAA9tB,CAAI8F,GACH,OAAOsU,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAI8F,EACzB,CACA,GAAA3G,CAAI2G,EAAQpD,GACP0X,EAAAxc,KAAI+uB,EAAA,KAAShqB,IAAImD,IAAMlI,KAAKgwB,YAAY9nB,EAAKpD,EAClD,CAEA,MAAA6sB,CAAOzpB,GACN,IAAI6D,EAAgB/L,KAAK4xB,WAAW1pB,GACpC,MAAiB,IAAV6D,GACN/L,KAAKmxB,SAASplB,GACdA,EAAQ/L,KAAK4xB,WAAW1pB,EAE1B,CAEO,QAAAipB,CAASplB,GACf,MAAO7D,GAAOsU,EAAAxc,KAAI8uB,EAAA,KAAO6B,OAAO5kB,EAAO,GACvC,QAAYpC,IAARzB,EAAmB,OACvB,MAAMpD,EAAQ0X,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAI8F,GAE/B,OADAlI,KAAKowB,eAAeloB,GACbpD,CACR,CASO,IAAA+sB,CAAK9kB,GACX,MAAM+kB,EAAY,IAAIzvB,IACtB,IAAK,MAAO0J,EAAO7D,KAAQsU,EAAAxc,KAAI8uB,EAAA,KAAOzgB,UAAW,CAChD,GAAIyjB,EAAU/sB,IAAImD,GAAM,CAClB4pB,EAAU1vB,IAAI8F,IAAMlI,KAAKmxB,SAASplB,GACvC,QACD,CACA,MACMgmB,EAAahlB,EADLyP,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAI8F,IAE/B4pB,EAAUvwB,IAAI2G,EAAK6pB,GACdA,GAAY/xB,KAAKmxB,SAASplB,EAChC,CACD,CAEA,MAAAimB,CAAO9pB,GACN,OAAOsU,EAAAxc,KAAIgvB,EAAA,KAAQjqB,IAAImD,EACxB,CAEA,UAAA0pB,CAAW1pB,GACV,OAAOsU,EAAAxc,KAAI8uB,EAAA,KAAOphB,QAAQxF,EAC3B,CAEA,OAAA+pB,GACC,OAAOzV,EAAAxc,KAAI+uB,EAAA,KAASzmB,MACrB,CAEA,MAAA4pB,IAAUjtB,GACT,IAAK,MAAMH,KAASG,EAAQ,CAC3B,MAAMiD,EAAMlI,KAAKyvB,UAAU3qB,GACvB0X,EAAAxc,KAAI+uB,EAAA,KAAShqB,IAAImD,IAAMlI,KAAKgwB,YAAY9nB,EAAKpD,EAClD,CACD,CAEA,MAAAqtB,CAAOC,KAA+BntB,GACrC,IAAK,MAAMH,KAASG,EAAQ,CAC3B,MAAMiD,EAAMlI,KAAKyvB,UAAU3qB,GACvB0X,EAAAxc,KAAI+uB,EAAA,KAAShqB,IAAImD,GAAMlI,KAAKgwB,YAAY9nB,EAAKpD,GAC5CstB,EAAOttB,EACb,CACD,CAEA,OAAAuJ,GACC,MAAM6N,EAAOlc,KAOb,OANA,YACC,IAAK,IAAIK,EAAI,EAAGA,EAAImc,EAAAN,EAAI4S,EAAA,KAAOxuB,OAAQD,IAAK,CAC3C,MAAM0H,EAAMyU,EAAAN,SAAa9Z,IAAIoa,EAAAN,EAAI4S,EAAA,KAAOzuB,SAC5BsJ,IAAR5B,SAAyB,CAAC1H,EAAG0H,GAClC,CACD,CACO2E,EACR,CAEA,CAACpJ,OAAOoJ,YACP,MAAMwP,EAAOlc,KAOb,OANA,YACC,IAAK,MAAMkI,KAAOsU,EAAAN,EAAI4S,EAAA,KAAQ,CAC7B,MAAMhqB,EAAQ0X,EAAAN,EAAI6S,EAAA,KAAS3sB,IAAI8F,QACjByB,IAAV7E,UAA2BA,EAChC,CACD,CACO4H,EACR,CAEA,QAAAjG,GACC,MAAO,oBAAoBzG,KAAKM,SACjC,CAEA,EAAAkO,CAAGzC,GACF,MAAMwkB,EAAWxkB,EAAQ,EAAI/L,KAAKM,OAASyL,EAAQA,EACnD,KAAIwkB,EAAW,GAAKA,GAAYvwB,KAAKM,QACrC,OAAON,KAAK0L,GAAO6kB,EACpB,CACA,OAAA1hB,GAEC,OADA2N,EAAAxc,KAAI8uB,EAAA,KAAOjgB,UACJ7O,IACR,CACA,IAAAgP,CAAKD,GACJ,MAAMsjB,EAAetjB,EAClB,CAACxH,EAAMC,IAASuH,EAAUyN,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAImF,GAASiV,EAAAxc,KAAI+uB,EAAA,KAAS3sB,IAAIoF,SACrEmC,EAEH,OADA6S,EAAAxc,KAAI8uB,EAAA,KAAO9f,KAAKqjB,GACTryB,IACR,CACA,IAAAsyB,CAAKxtB,EAAU+I,EAAQ,EAAGC,EAAM9N,KAAKM,QACpC,MAAM2E,EAASjF,KAAK0uB,UAGpB,OAFAzpB,EAAOqtB,KAAKxtB,EAAO+I,EAAOC,GAC1B9N,KAAK4wB,YAAY3rB,GACVjF,IACR,CAEA,UAAAuyB,CAAW/oB,EAAgBqE,EAAeC,GACzC,MAAM7I,EAASjF,KAAK0uB,UAGpB,OAFAzpB,EAAOstB,WAAW/oB,EAAQqE,EAAOC,GACjC9N,KAAK4wB,YAAY3rB,GACVjF,IACR,sRA3WDwyB,EAAA,KAAAC,EAAA,CAAA3tB,MAAA8pB,GAAA8D,EAAA,CAAApoB,KAAA,QAAA1D,KAAAgoB,EAAAhoB,KAAA+rB,SAAAC,GAAA,KAAAC,6GAAMC,EAAAlE,EAAAiE,UAAa,GA+WZ,MAAME,GAAWxE,GC5YjB,MAAMyE,GAA2B,IAAI9zB,iBAK5B+zB,KACf,MAAMtX,EAASmB,KACf,OAAOnB,EAASqX,GAAyB5wB,IAAIuZ,QAAUhS,CACxD,CA+BA,SAASupB,GACRC,GAEAjyB,OAAOQ,eAAeyxB,EAAQ,QAAS,CACtC/wB,IAAK+wB,EAAO/wB,IACZb,IAAK4xB,EAAO5xB,IACZC,cAAc,EACd2F,YAAY,GAEd,CAEA,SAASisB,GACR5pB,EACA6pB,EACAC,EACAX,GAUA,OARIA,GACHzxB,OAAOQ,eAAe8H,EAAQ0J,GAAgB,CAC7CpO,MAAO6tB,EACPzrB,UAAU,EACVC,YAAY,EACZ3F,cAAc,IAGT2rB,GAAU3jB,EAAQ,KACxB8pB,IACA,IAAK,MAAM3D,KAAQ0D,EAAUpuB,SAAU0qB,MACvC0D,EAAUrjB,SAEZ,CAEA,SAASujB,GACR5b,EACA5X,GAEA4X,EAASwU,GAASxU,GAClB,MAAMnO,EAAS2iB,GAAS,IAClBqH,EAAe,IAAInxB,IAMzB,SAASoxB,EAAa1nB,GACrB,MAAMqZ,EAAaoO,EAAapxB,IAAI2J,GAChCqZ,IACHoO,EAAajzB,OAAOwL,GACpBqZ,IACAlf,QAAQ8lB,eAAexiB,EAA6BuC,GAEtD,CAEA,MAAMmO,EAAS+Y,KACTvkB,EAAQwL,EAASA,EAAOxL,MAAQ,EAAI,EAEpCglB,EAAgBxc,GAAO,UAAkC4M,OAAEA,IAChE,MAAMxjB,EAASqX,EAAOrX,QAjBvB,SAA+BA,GAC9BwG,EAAUvF,IAAIiI,EAA6B,SAAUlJ,EAAQkJ,EAC9D,CAgBCmqB,CAAsBrzB,GACtB,MAAM6V,EAAW5Q,MAAM0U,KAAKuZ,EAAalrB,QACzC,IAAK,IAAIjI,EAAI,EAAGA,EAAIC,EAAQD,IACvBmzB,EAAazuB,IAAI1E,IACrByjB,EAAO,KACN,MAAM/X,EAAQ1L,EACRsvB,EAAOzY,GAAO,WACnB,MAAM0c,EAAWxP,GAAU,IAAM5a,EAAOuC,IAClC8nB,EAAa,CAClB3rB,IAAK6D,EACL4L,SACAvV,IAAK,IAAM0E,EAAU1E,IAAIuV,EAAe5L,EAAO4L,GAC/CpW,IAAMuD,GACLgC,EAAUvF,IAAIoW,EAAe5L,EAAOjH,EAAO6S,GAC5Cmc,IAAKF,GAENV,GAAkBW,GAClB,MAAME,EAAWh0B,EAAM8zB,EAAYrqB,GACnCA,EAAOuC,GAASgoB,CACjB,GACAzb,GAAcqX,EAAM,WAAWjhB,MAAU3C,KACzCinB,GAAyBzxB,IAAIouB,EAAM,CAClChY,SACAzP,IAAK6D,EACLvC,SACAkF,QACAwL,WAEDsZ,EAAajyB,IAAIlB,EAAGsvB,KAGtB,IAAK,MAAM5jB,KAASoK,EAAcpK,GAASzL,GAAQmzB,EAAa1nB,EACjE,GAEA,OAAOqnB,GAAY5pB,EAAQgqB,EAAc,IAAME,IAAiB,CAC/D/b,SACAnO,SACAzJ,QACA2O,QACAwL,UAEF,CAEA,SAAS8Z,GACRrc,EACA5X,GAQA,MAAMk0B,EAAiB9H,GAASxU,GAC1Buc,EAAY,IAAI7xB,IAChBmH,EAAS2iB,GAAS+H,GAClBC,EAAa,IAAI9xB,IAEvB,SAAS+xB,EAAWlsB,GACnB,MAAMkd,EAAa+O,EAAW/xB,IAAI8F,GAC9Bkd,IACHA,IACA+O,EAAW5zB,OAAO2H,GAClBsB,EAAOjJ,OAAO2H,GAEhB,CAEA,MAAMgS,EAAS+Y,KACTvkB,EAAQwL,EAASA,EAAOxL,MAAQ,EAAI,EAEpC2lB,EAAcnd,GAAO,UAA+B4M,OAAEA,IAC3D,MAAMxb,EAAO,IAAItJ,IACjB,IAAK,MAAMkJ,KAAO+rB,EAAehC,UAAW3pB,EAAK/I,IAAI2I,GAErD,IAAK,MAAMA,KAAOI,EACb6rB,EAAWpvB,IAAImD,IACnB4b,EAAO,KACN,MAAM6L,EAAOzY,GAAO,WACnB,MAAM0c,EAAWxP,GAAU,IAAM5a,EAAOpH,IAAI8F,IACtC2rB,EAAa,CAClB3rB,MACAyP,OAAQsc,EACR7xB,IAAK,IAAM6xB,EAAe7xB,IAAI8F,GAC9B3G,IAAMuD,IACLmvB,EAAe1yB,IAAI2G,EAAKpD,IACjB,GAERgvB,IAAKF,GAENV,GAAkBW,GAClB,MAAME,EAAWh0B,EAAM8zB,EAAYrqB,GACnCA,EAAOjI,IAAI2G,EAAK6rB,EACjB,GACAzb,GAAcqX,EAAM,WAAWjhB,MAAUrI,OAAO6B,MAChD8qB,GAAyBzxB,IAAIouB,EAAM,CAClChY,OAAQsc,EACR/rB,MACAsB,SACAkF,QACAwL,WAEDia,EAAW5yB,IAAI2G,EAAKynB,KAItB,IAAK,MAAMznB,KAAO3C,MAAM0U,KAAKka,EAAW7rB,QAAcA,EAAKvD,IAAImD,IAAMksB,EAAWlsB,EACjF,GAEA,OAAOkrB,GAAY5pB,EAAQ2qB,EAAY,IAAME,IAAe,CAC3D1c,OAAQsc,EACRzqB,SACAzJ,QACA2O,QACAwL,UAEF,CAEA,SAASoa,GACR3c,EACA5X,GAQA,MAAMk0B,EAAiB9H,GAASxU,GAC1BnO,EAAS2iB,GAAS,IAClBgI,EAAa,IAAI9xB,IAEvB,SAAS+xB,EAAWlsB,GACnB,MAAMkd,EAAa+O,EAAW/xB,IAAI8F,GAC9Bkd,IACHA,IACA+O,EAAW5zB,OAAO2H,GAClBhC,QAAQ8lB,eAAexiB,EAAwCtB,GAEjE,CAEA,MAAMgS,EAAS+Y,KACTvkB,EAAQwL,EAASA,EAAOxL,MAAQ,EAAI,EAEpC2lB,EAAcnd,GAAO,UAA6B4M,OAAEA,IACzD,MAAMxb,EAAO,IAAItJ,IACjB,IAAK,MAAMkJ,KAAO+rB,EAAgB3rB,EAAK/I,IAAI2I,GAC3C,MAAMqsB,EAAWruB,QAAQmG,QAAQ4nB,GACjC,IAAK,MAAM/rB,KAAOqsB,EAAUjsB,EAAK/I,IAAI2I,GAErC,IAAK,MAAMA,KAAOI,EACb6rB,EAAWpvB,IAAImD,IACnB4b,EAAO,KACN,MAAM6L,EAAOzY,GAAO,WACnB,MAAMsd,EAAYtsB,EACZ0rB,EAAWxP,GAChB,IAAO5a,EAAwDtB,IAE1D2rB,EAAa,CAClB3rB,IAAKssB,EACL7c,OAAQsc,EACR7xB,IAAK,IAAM0E,EAAU1E,IAAI6xB,EAAgBO,EAAWP,GACpD1yB,IAAMuD,GACLgC,EAAUvF,IAAI0yB,EAAgBO,EAAW1vB,EAAOmvB,GACjDH,IAAKF,GAONV,GAAkBW,GAClB,MAAME,EAAWh0B,EAAM8zB,EAAYrqB,GACjCA,EAAegrB,GAAaT,CAC/B,GACAzb,GAAcqX,EAAM,WAAWjhB,MAAUrI,OAAO6B,MAChD8qB,GAAyBzxB,IAAIouB,EAAM,CAClChY,OAAQsc,EACR/rB,MACAsB,SACAkF,QACAwL,WAEDia,EAAW5yB,IAAI2G,EAAKynB,KAItB,IAAK,MAAMznB,KAAO3C,MAAM0U,KAAKka,EAAW7rB,QAAcA,EAAKvD,IAAImD,IAAMksB,EAAWlsB,EACjF,GAEA,OAAOkrB,GAAY5pB,EAAQ2qB,EAAY,IAAME,IAAe,CAC3D1c,OAAQsc,EACRzqB,SACAzJ,QACA2O,QACAwL,UAEF,CAEA,SAASua,GACR9c,EACA5X,GAEA,MAAMk0B,EAAiB9H,GAASxU,GAC1Buc,EAAY,IAAI7xB,IAChBmH,EAAS2iB,GAAS+H,GAClBC,EAAa,IAAI9xB,IAEvB,SAAS+xB,EAAWlsB,GACnB,MAAMkd,EAAa+O,EAAW/xB,IAAI8F,GAC9Bkd,IACHA,IACA+O,EAAW5zB,OAAO2H,GAClBsB,EAAOjJ,OAAO2H,GAEhB,CAEA,MAAMgS,EAAS+Y,KACTvkB,EAAQwL,EAASA,EAAOxL,MAAQ,EAAI,EAEpC2lB,EAAcnd,GAAO,UAA0B4M,OAAEA,IACtD,MAAMxb,EAAO,IAAItJ,IACjB,IAAK,MAAMkJ,KAAO+rB,EAAe3rB,OAAQA,EAAK/I,IAAI2I,GAElD,IAAK,MAAMA,KAAOI,EACb6rB,EAAWpvB,IAAImD,IACnB4b,EAAO,KACN,MAAM6L,EAAOzY,GAAO,WACnB,MAAM0c,EAAWxP,GAAU,IAAM5a,EAAOpH,IAAI8F,IACtC2rB,EAAa,CAClB3rB,MACAyP,OAAQsc,EACR7xB,IAAK,IAAM6xB,EAAe7xB,IAAI8F,GAC9B3G,IAAMuD,IACLmvB,EAAe1yB,IAAI2G,EAAKpD,IACjB,GAERgvB,IAAKF,GAENV,GAAkBW,GAClB,MAAME,EAAWh0B,EAAM8zB,EAAYrqB,GACnCA,EAAOjI,IAAI2G,EAAK6rB,EACjB,GACAzb,GAAcqX,EAAM,WAAWjhB,MAAUrI,OAAO6B,MAChD8qB,GAAyBzxB,IAAIouB,EAAM,CAClChY,OAAQsc,EACR/rB,MACAsB,SACAkF,QACAwL,WAEDia,EAAW5yB,IAAI2G,EAAKynB,KAItB,IAAK,MAAMznB,KAAO3C,MAAM0U,KAAKka,EAAW7rB,QAAcA,EAAKvD,IAAImD,IAAMksB,EAAWlsB,EACjF,GAEA,OAAOkrB,GAAY5pB,EAAQ2qB,EAAY,IAAME,IAAe,CAC3D1c,OAAQsc,EACRzqB,SACAzJ,QACA2O,QACAwL,UAEF,OA0Eawa,GAA2BxzB,OAAO2D,OAT/C,SAAqB8S,EAAa5X,GACjC,GAAIwF,MAAMqC,QAAQ+P,GAAS,OAAO4b,GAAa5b,EAAQ5X,GACvD,GAAI4X,aAAkBtV,IAAK,OAAOoyB,GAAW9c,EAAQ5X,GACrD,GAAI4X,aAAkBob,GAAU,OAAOiB,GAAgBrc,EAAQ5X,GAC/D,GAAI4X,IAAWA,EAAOxO,cAAgBjI,aAAiCyI,IAAvBgO,EAAOxO,aACtD,OAAOmrB,GAAc3c,EAAQ5X,GAC9B,MAAM,IAAI4F,MAAM,0BACjB,EAEmE,CAClEgvB,MAAOpB,GACPljB,SAAU2jB,GACV/b,OAAQqc,GACR3nB,IAAK8nB,KC5bN,SAAU1oB,GAAM1L,GAAWC,OAAEA,GAAS,GAAS,CAAA,GAC1CA,SAAc,gBACZD,CACP,CAEA,SAAUu0B,GACTrtB,EACAC,GACAlH,OAAEA,GAAS,GAAU,IAErB,MAAMuN,EAAQoc,KAAKsH,IAAIhqB,EAAGC,GACpBsG,EAAMmc,KAAKD,IAAIziB,EAAGC,GACpBlH,SAAc,UAClB,IAAK,IAAID,EAAIwN,EAAOxN,GAAKyN,EAAKzN,UAAWA,CAC1C,CACM,MAAgBw0B,WAAgBtvB,MACrC,GAAAnD,CAAI/B,GAEH,OADAuqB,GAAU5qB,KAAMK,GACT8rB,GAASnsB,KAAKK,GACtB,CACA,GAAAkB,CAAIlB,EAAWyE,GACd,MAAMuX,EAAQhc,GAAKL,KAAKM,OACxBN,KAAKK,GAAKyE,EACVuP,GAAQrU,KAAM,CAAEgC,KAAM,MAAOf,KAAMZ,GAAK0L,GAAM1L,EAAG,CAAEC,OAAQ+b,IAC5D,CACA,SAAApQ,GAEC,OADA2e,GAAU5qB,KAAM,UACTA,KAAKM,MACb,CACA,SAAA8L,CAAUtH,GACT,MAAMglB,EAAY9pB,KAAKM,OACvB,IACCN,KAAKM,OAASwE,CACf,SACCuP,GAAQrU,KAAM,CAAEgC,KAAM,MAAOf,KAAM,UAAY2zB,GAAM9K,EAAWhlB,EAAO,CAAExE,QAAQ,IAClF,CACD,EAED,MAAMw0B,GAAY,CAAE1yB,IAAK0E,EAAU1E,IAAKb,IAAKuF,EAAUvF,KACvDL,OAAO2D,OAAOiC,EAAW,CACxB,GAAA1E,CAAI2E,EAAU9F,EAAW+F,GACxB,GAAID,aAAexB,OAAyB,iBAATtE,EAAmB,CACrD,GAAa,WAATA,EAAmB,OAAO4zB,GAAQpyB,UAAUwJ,UAAU9L,KAAK4G,GAC/D,MAAMgF,EAAQgpB,SAAS9zB,GACvB,IAAKqF,OAAO6F,MAAMJ,GAAQ,OAAO8oB,GAAQpyB,UAAUL,IAAIjC,KAAK4G,EAAKgF,EAClE,CACA,OAAO+oB,GAAU1yB,IAAI2E,EAAK9F,EAAM+F,EACjC,EACA,GAAAzF,CAAIwF,EAAU9F,EAAW6D,EAAYkC,GACpC,GAAID,aAAexB,OAAyB,iBAATtE,EAAmB,CACrD,GAAa,WAATA,EAAmB,OAAO4zB,GAAQpyB,UAAU2J,UAAUjM,KAAK4G,EAAKjC,GACpE,MAAMiH,EAAQgpB,SAAS9zB,GACvB,IAAKqF,OAAO6F,MAAMJ,GAAQ,OAAO8oB,GAAQpyB,UAAUlB,IAAIpB,KAAK4G,EAAKgF,EAAOjH,EACzE,CACA,OAAOgwB,GAAUvzB,IAAIwF,EAAK9F,EAAM6D,EAAOkC,EACxC,IAGK,MAAgBguB,WAAsBzvB,MAC3C,MAAA0vB,GACC,OAAOj1B,IACR,CACA,IAAKsD,OAAO0F,eACX,MAAO,eACR,CAEA,EAAAwF,CAAGzC,GACF,MAAMmpB,EAAcnpB,EAAQ,EAAI/L,KAAKM,OAASyL,EAAQA,EAGtD,GAFA6e,GAAU5qB,KAAMk1B,GACZnpB,EAAQ,GAAG6e,GAAU5qB,KAAM,YAC3Bk1B,EAAc,GAAKA,GAAel1B,KAAKM,QAC3C,OAAO6rB,GAASnsB,KAAKk1B,GACtB,CAGA,UAAAtmB,GAEC,OADAgc,GAAU5qB,MACHmsB,GAASnsB,KAAK4O,aACtB,CAEA,QAAAE,CAASC,GAER,OADA6b,GAAU5qB,MACHmsB,GAASnsB,KAAK8O,SAASC,GAC/B,CAEA,SAAAE,CAAUpB,EAAeqB,KAAyBlB,GAEjD,OADA4c,GAAU5qB,WACa2J,IAAhBuF,EACJlP,KAAKiP,UAAUpB,GACf7N,KAAKiP,UAAUpB,EAAOqB,KAAgBlB,EAC1C,CAEA,KAAKjC,EAAejH,GAEnB,OADA8lB,GAAU5qB,MACHmsB,GAASnsB,KAAKmP,KAAKpD,EAAOjH,GAClC,CAGA,OAAAuJ,GAEC,OADAuc,GAAU5qB,MACHsuB,GAA4BtuB,KAAKqO,UACzC,CAEA,IAAA/F,GAEC,OADAsiB,GAAU5qB,KAAM,UACTA,KAAKsI,MACb,CAEA,MAAArD,GAEC,OADA2lB,GAAU5qB,MACHouB,GAAqBpuB,KAAKiF,SAClC,CAEA,CAAC3B,OAAOoJ,YACPke,GAAU5qB,MACV,MAAMm1B,EAAiBn1B,KAAKsD,OAAOoJ,YACnC,MAAO,CACN,IAAAmS,GACC,MAAMU,EAAS4V,EAAetW,OAC9B,OAAIU,EAAO8O,KACH9O,EAED,CAAEza,MAAOqnB,GAAS5M,EAAOza,OAAQupB,MAAM,EAC/C,EACA,CAAC/qB,OAAOoJ,YACP,OAAO1M,IACR,EACA,CAACsD,OAAO8xB,WAAY,EAEtB,CAEA,OAAA1nB,CAAQF,EAAoBC,GAC3B,MAAMnN,EAASN,KAAKM,OACpB,IAAID,OAAkBsJ,IAAd8D,EAA0B,EAAIA,EAClCpN,EAAI,IAAGA,EAAI4pB,KAAKD,IAAI1pB,EAASD,EAAG,IAEpC,MAAMg1B,EAAkBpY,GAAOzP,GAE/B,KAAOnN,EAAIC,EAAQD,IAAK,CACvBuqB,GAAU5qB,KAAMK,GAChB,MAAM6wB,EAAOlxB,KAAKK,GAClB,GAAI6wB,IAAS1jB,GAAiB0jB,IAASmE,GAAmBpY,GAAOiU,KAAUmE,EAC1E,OAAOh1B,CAET,CAGA,OADAuqB,GAAU5qB,KAAM,WACT,CACR,CAEA,WAAA2N,CAAYH,EAAoBC,GAC/B,MAAMnN,EAASN,KAAKM,OACpB,IAAID,OAAkBsJ,IAAd8D,EAA0BnN,EAAS,EAAImN,EAC3CpN,GAAKC,IAAQD,EAAIC,EAAS,GAC1BD,EAAI,IAAGA,EAAI4pB,KAAKD,IAAI1pB,EAASD,GAAG,IAEpC,MAAMg1B,EAAkBpY,GAAOzP,GAE/B,KAAOnN,GAAK,EAAGA,IAAK,CACnBuqB,GAAU5qB,KAAMK,GAChB,MAAM6wB,EAAOlxB,KAAKK,GAClB,GAAI6wB,IAAS1jB,GAAiB0jB,IAASmE,GAAmBpY,GAAOiU,KAAUmE,EAC1E,OAAOh1B,CAET,CASA,OADAuqB,GAAU5qB,KAAM,WACT,CACR,CAEA,QAAA6J,CAAS2D,EAAoBC,GAC5B,OAAkD,IAA3CzN,KAAK0N,QAAQF,EAAeC,EACpC,CAIA,IAAAL,CAAKkoB,EAAyBzoB,GAC7B,GAAkC,mBAAvByoB,EAAmC,CAC7C,MAAMvoB,EAAYuoB,EAMZh1B,EAASN,KAAKM,OAEpB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAQD,IAAK,CAChCuqB,GAAU5qB,KAAMK,GAChB,MAAM0H,EAAMokB,GAASnsB,KAAKK,IAC1B,GAAI0M,EAAU5M,KAAK0M,EAAS9E,EAAK1H,EAAGL,MACnC,OAAO+H,CAET,CAGA,YADA6iB,GAAU5qB,KAAM,SAEjB,CACA,MAAMyN,EAA+B,iBAAZZ,EAAuBA,OAAUlD,EACpDoC,EAAQ/L,KAAK0N,QAAQ4nB,EAAoB7nB,GAC/C,IAAc,IAAV1B,EACJ,OAAOogB,GAASnsB,KAAK+L,GACtB,CAOA,SAAAsB,CAAUioB,EAAyBzoB,GAClC,GAAkC,mBAAvByoB,EAAmC,CAC7C,MAAMvoB,EAAYuoB,EAMZh1B,EAASN,KAAKM,OAEpB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAQD,IAAK,CAChCuqB,GAAU5qB,KAAMK,GAChB,MAAM0H,EAAMokB,GAASnsB,KAAKK,IAC1B,GAAI0M,EAAU5M,KAAK0M,EAAS9E,EAAK1H,EAAGL,MACnC,OAAOK,CAET,CAGA,OADAuqB,GAAU5qB,KAAM,WACT,CACR,CACA,MAAMyN,EAA+B,iBAAZZ,EAAuBA,OAAUlD,EAC1D,OAAO3J,KAAK0N,QAAQ4nB,EAAoB7nB,EACzC,CAEA,IAAAgB,CAAKC,GAEJ,OADAkc,GAAU5qB,MACHmsB,QAAmBxiB,IAAV+E,EAAsB1O,KAAKyO,OAASzO,KAAKyO,KAAKC,GAC/D,CAEA,OAAAC,CACC/B,EACAC,GAGA,OADA+d,GAAU5qB,MACHmsB,GACNnsB,KAAK2O,QACJ,CAACuiB,EAAMnlB,EAAO4oB,IAAU/nB,EAAWzM,KAAK0M,EAASsf,GAAS+E,GAAOnlB,EAAO4oB,GACxE9nB,GAGH,CAEA,MAAAC,CAAOF,EAAkEC,GAExE,OADA+d,GAAU5qB,MACHmsB,GACNnsB,KAAK8M,OAAO,CAACokB,EAAMnlB,EAAO4oB,IAAU/nB,EAAWuf,GAAS+E,GAAOnlB,EAAO4oB,GAAQ9nB,GAEhF,CAEA,GAAAF,CAAIC,EAA8DC,GAEjE,OADA+d,GAAU5qB,MACHmsB,GACNnsB,KAAK2M,IAAI,CAACukB,EAAMnlB,EAAO4oB,IAAU/nB,EAAWuf,GAAS+E,GAAOnlB,EAAO4oB,GAAQ9nB,GAE7E,CAEA,MAAAG,CACCJ,EACAK,GAEA2d,GAAU5qB,MACV,MAAMuf,OACY5V,IAAjBsD,EACGjN,KAAKgN,OAAOJ,GACZ5M,KAAKgN,OAAOJ,EAAmBK,GACnC,OAAOkf,GAAS5M,EACjB,CAEA,WAAArS,CACCN,EACAK,GAEA2d,GAAU5qB,MACV,MAAMuf,OACY5V,IAAjBsD,EACGjN,KAAKkN,YAAYN,EAAmBK,GACnCjN,KAAakN,YAAYN,GAC9B,OAAOuf,GAAS5M,EACjB,CAEA,KAAA3R,CAAMC,EAAgBC,GACrB,IAAK,MAAMzN,KAAKu0B,GAAM/mB,GAAS,EAAGC,GAAO9N,KAAKM,OAAS,GAAIsqB,GAAU5qB,KAAMK,GAC3E,YAAiBsJ,IAAVkE,EACJ7N,KAAK4N,aACGjE,IAARmE,EACC9N,KAAK4N,MAAMC,GACX7N,KAAK4N,MAAMC,EAAOC,EACvB,CAEA,MAAAC,IAAUC,GAET,OADA4c,GAAU5qB,MACHmsB,GAASnsB,KAAK+N,UAAUC,GAChC,CAEA,IAAAG,CAAKC,GAEJ,OADAwc,GAAU5qB,MACHA,KAAKmO,KAAKC,EAClB,CAEA,OAAAjB,CAAQP,EAA+DC,GACtE+d,GAAU5qB,MACVA,KAAKmN,QAAQ,CAACrI,EAAOiH,EAAO4oB,KAC3B/nB,EAAWzM,KAAK0M,EAASsf,GAASrnB,GAAQiH,EAAO4oB,IAEnD,CAQA,KAAA1mB,CAAMrB,EAAkEC,GACvE,MAAMvM,EAASN,KAAKM,OAEpB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAQD,IAE3B,GADAuqB,GAAU5qB,KAAMK,IACXuM,EAAWzM,KAAK0M,EAASsf,GAASnsB,KAAKK,IAAKA,EAAGL,MACnD,OAAO,EAKT,OADA4qB,GAAU5qB,KAAM,WACT,CACR,CAEA,IAAAkO,CAAKtB,EAAkEC,GACtE,MAAMvM,EAASN,KAAKM,OAEpB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAQD,IAE3B,GADAuqB,GAAU5qB,KAAMK,GACZuM,EAAWzM,KAAK0M,EAASsf,GAASnsB,KAAKK,IAAKA,EAAGL,MAClD,OAAO,EAKT,OADA4qB,GAAU5qB,KAAM,WACT,CACR,CAEA,IAAAF,IAAQkO,GACP,MAAM8b,EAAY9pB,KAAKM,OACvB,IACC,OAAON,KAAKF,QAAQkO,EACrB,SACCqG,GACCrU,KACA,CAAEgC,KAAM,QAASmI,OAAQ,QACzByqB,GAAM9K,EAAWA,EAAY9b,EAAM1N,OAAS,EAAG,CAAEA,QAAQ,IAE3D,CACD,CAEA,GAAAud,GACC,GAAoB,IAAhB7d,KAAKM,OACT,IACC,OAAO6rB,GAASnsB,KAAK6d,MACtB,SACCxJ,GAAQrU,KAAM,CAAEgC,KAAM,QAASmI,OAAQ,OAAS4B,GAAM/L,KAAKM,QAC5D,CACD,CAEA,KAAA0Y,GACC,GAAoB,IAAhBhZ,KAAKM,OACT,IACC,OAAO6rB,GAASnsB,KAAKgZ,QACtB,SACC3E,GAAQrU,KAAM,CAAEgC,KAAM,QAASmI,OAAQ,SAAWyqB,GAAM,EAAG50B,KAAKM,OAAS,EAAG,CAAEA,QAAQ,IACvF,CACD,CAEA,OAAAsd,IAAW5P,GACV,IACC,OAAOhO,KAAK4d,WAAW5P,EACxB,SACCqG,GACCrU,KACA,CAAEgC,KAAM,QAASmI,OAAQ,WACzByqB,GAAM,EAAG50B,KAAKM,OAAS0N,EAAM1N,OAAQ,CAAEA,QAAQ,IAEjD,CACD,CAEA,MAAAqwB,CAAO9iB,EAAeqB,KAAyBlB,GAC9C,MAAM8b,EAAY9pB,KAAKM,OAGvB,IAAIi1B,EAAc1nB,EACG0nB,EAAjBA,EAAc,EAAiBtL,KAAKD,IAAIF,EAAYyL,EAAa,GAClDtL,KAAKsH,IAAIgE,EAAazL,GAGzC,IAAI0L,EAAoBtmB,EAEvBsmB,OADyB7rB,IAAtB6rB,EACiB1L,EAAYyL,EAEZtL,KAAKD,IAAI,EAAGC,KAAKsH,IAAIiE,EAAmB1L,EAAYyL,IAGzE,IACC,OAAsCpJ,QAAlBxiB,IAAhBuF,EAA2ClP,KAAK2wB,OAAO9iB,GAC3C7N,KAAK2wB,OAAO9iB,EAAOqB,KAAgBlB,GACpD,SACCqG,GACCrU,KACA,CAAEgC,KAAM,QAASmI,OAAQ,UACzBqrB,IAAsBxnB,EAAM1N,OACzBs0B,GAAMW,EAAaA,EAAcC,EAAoB,GACrDZ,GAAMW,EAAazL,EAAYG,KAAKD,IAAIhc,EAAM1N,OAASk1B,EAAmB,GAAI,CAC9El1B,QAAQ,IAGb,CACD,CAEA,OAAAuO,GACC,IACC,OAAO7O,KAAK6O,SACb,SACCwF,GAAQrU,KAAM,CAAEgC,KAAM,QAASmI,OAAQ,WAAayqB,GAAM,EAAG50B,KAAKM,OAAS,GAC5E,CACD,CAEA,IAAA0O,CAAKD,GACJA,EAAYA,GAAS,EAAMxH,EAAGC,IAAMD,EAAEd,WAAWgvB,cAAcjuB,EAAEf,aACjE,IACC,OAAOzG,KAAKgP,KAAK,CAACzH,EAAGC,IAAMuH,EAAUod,GAAS5kB,GAAI4kB,GAAS3kB,IAC5D,SACC6M,GAAQrU,KAAM,CAAEgC,KAAM,QAASmI,OAAQ,QAAUyqB,GAAM,EAAG50B,KAAKM,OAAS,GACzE,CACD,CAEA,IAAAgyB,CAAKxtB,EAAY+I,EAAgBC,GAChC,MAAMxB,EAAMtM,KAAKM,OACjB,IAAIqP,OAAchG,IAAVkE,EAAsB,EAAIA,EACvB8B,EAAPA,EAAI,EAAOsa,KAAKD,IAAI1d,EAAMqD,EAAG,GACxBsa,KAAKsH,IAAI5hB,EAAGrD,GAErB,IAAIopB,OAAgB/rB,IAARmE,EAAoBxB,EAAMwB,EACvB4nB,EAAXA,EAAQ,EAAWzL,KAAKD,IAAI1d,EAAMopB,EAAO,GAChCzL,KAAKsH,IAAImE,EAAOppB,GAE7B,IACC,YAAc3C,IAAVkE,EAA4B7N,KAAKsyB,KAAKxtB,QAC9B6E,IAARmE,EAA0B9N,KAAKsyB,KAAKxtB,EAAO+I,GACxC7N,KAAKsyB,KAAKxtB,EAAO+I,EAAOC,EAChC,SACK4nB,EAAQ/lB,GACX0E,GAAQrU,KAAM,CAAEgC,KAAM,QAASmI,OAAQ,QAAUyqB,GAAMjlB,EAAG+lB,EAAQ,GAEpE,CACD,CAEA,UAAAnD,CAAW/oB,EAAgBqE,EAAeC,GACzC,IACC,YAAYnE,IAARmE,EAA0B9N,KAAKuyB,WAAW/oB,EAAQqE,GAC/C7N,KAAKuyB,WAAW/oB,EAAQqE,EAAOC,EACvC,SACC,MAAMxB,EAAMtM,KAAKM,OAEjB,IAAIq1B,EAAKnsB,EACLmsB,EAAK,EAAGA,EAAK1L,KAAKD,IAAI1d,EAAMqpB,EAAI,GAC3BA,GAAMrpB,IAAKqpB,EAAKrpB,GAEzB,IAAI2N,EAAOpM,EACPoM,EAAO,EAAGA,EAAOgQ,KAAKD,IAAI1d,EAAM2N,EAAM,GACjCA,GAAQ3N,IAAK2N,EAAO3N,GAE7B,IAAIopB,OAAgB/rB,IAARmE,EAAoBxB,EAAMwB,EAClC4nB,EAAQ,EAAGA,EAAQzL,KAAKD,IAAI1d,EAAMopB,EAAO,GACpCA,GAASppB,IAAKopB,EAAQppB,GAE/B,MAAM6L,EAAQ8R,KAAKsH,IAAImE,EAAQzb,EAAM3N,EAAMqpB,GAEvCxd,EAAQ,GACX9D,GACCrU,KACA,CAAEgC,KAAM,QAASmI,OAAQ,cACzByqB,GAAMe,EAAIA,EAAKxd,EAAQ,GAI1B,CACD,EC9eK,MAAgByd,WAA6C12B,QAClE,IAAKoE,OAAO0F,eACX,MAAO,iBACR,CAGA,OAAOd,GACN,MAAM2tB,EAAS71B,KAAK+E,IAAImD,GAClBqX,EAASvf,KAAKO,OAAO2H,GAI3B,OAFI2tB,GAAQvO,GAAS5e,EAAW1I,MAAO,CAAEgC,KAAM,MAAOf,KAAMiH,GAAOA,GAE5DqX,CACR,CAEA,GAAAnd,CAAI8F,GAEH,OADA0iB,GAAUliB,EAAW1I,MAAOkI,GACrBikB,GAASnsB,KAAKoC,IAAI8F,GAC1B,CAEA,GAAAnD,CAAImD,GAEH,OADA0iB,GAAUliB,EAAW1I,MAAOkI,GACrBlI,KAAK+E,IAAImD,EACjB,CAEA,GAAA3G,CAAI2G,EAAQpD,GACX,MAAM+wB,EAAS71B,KAAK+E,IAAImD,GAClBigB,EAAWnoB,KAAKoC,IAAI8F,GACpB2jB,EAAgBM,GAASrnB,GAO/B,OANA9E,KAAKuB,IAAI2G,EAAK2jB,GAETgK,GAAU1N,IAAa0D,GAC3BxD,GAAqB3f,EAAW1I,MAAOkI,EAAKigB,EAAU0D,EAAegK,GAG/D71B,IACR,EAOK,MAAgB81B,WAA0BzzB,IAC/C,IAAKiB,OAAO0F,eACX,MAAO,aACR,CAGA,QAAIjF,GAEH,OADA6mB,GAAU5qB,KAAM,QACTA,KAAK+D,IACb,CAEA,KAAAiM,GACC,MAAM+lB,EAAa/1B,KAAK+D,KAAO,EAG/B,GAFA/D,KAAKgQ,QAED+lB,EAAY,CACf,MAAMle,EAAY,CAAE7V,KAAM,QAASmI,OAAQ,SAE3Cmd,GAAStnB,KAAM6X,EAAW,QAC1BxD,GAAQ3L,EAAW1I,MAAO6X,EAC3B,CACD,CAEA,OAAAxJ,GAEC,OADAuc,GAAUliB,EAAW1I,OACdsuB,GAA4BtuB,KAAKqO,UACzC,CAEA,OAAAlB,CAAQP,EAAwDC,GAC/D+d,GAAUliB,EAAW1I,OACrBA,KAAKmN,QAAQP,EAAYC,EAC1B,CAEA,IAAAvE,GAEC,OADAsiB,GAAUliB,EAAW1I,OACdA,KAAKsI,MACb,CAEA,MAAArD,GAEC,OADA2lB,GAAUliB,EAAW1I,OACdouB,GAAqBpuB,KAAKiF,SAClC,CAEA,CAAC3B,OAAOoJ,YACPke,GAAUliB,EAAW1I,OACrB,MAAMm1B,EAAiBn1B,KAAKsD,OAAOoJ,YACnC,MAAO,CACN,IAAAmS,GACC,MAAMU,EAAS4V,EAAetW,OAC9B,OAAIU,EAAO8O,KACH9O,EAED,CACNza,MAAO,CAACya,EAAOza,MAAM,GAAIqnB,GAAS5M,EAAOza,MAAM,KAC/CupB,MAAM,EAER,EACA,CAAC/qB,OAAOoJ,YACP,OAAO1M,IACR,EACA,CAACsD,OAAO8xB,WAAY,EAEtB,CAGA,OAAOltB,GACN,MAAM2tB,EAAS71B,KAAK+E,IAAImD,GAClBqX,EAASvf,KAAKO,OAAO2H,GAE3B,GAAI2tB,EAAQ,CACX,MAAMhe,EAAY,CAAE7V,KAAM,MAAOf,KAAMiH,GACvCof,GAAS5e,EAAW1I,MAAO6X,EAAW3P,GACtCof,GAAStnB,KAAM6X,EAAW,OAC3B,CAEA,OAAO0H,CACR,CAEA,GAAAnd,CAAI8F,GAEH,OADA0iB,GAAUliB,EAAW1I,MAAOkI,GACrBikB,GAASnsB,KAAKoC,IAAI8F,GAC1B,CAEA,GAAAnD,CAAImD,GAEH,OADA0iB,GAAUliB,EAAW1I,MAAOkI,GACrBlI,KAAK+E,IAAImD,EACjB,CAEA,GAAA3G,CAAI2G,EAAQpD,GACX,MAAM+wB,EAAS71B,KAAK+E,IAAImD,GAClBigB,EAAWnoB,KAAKoC,IAAI8F,GACpB2jB,EAAgBM,GAASrnB,GAG/B,GAFA9E,KAAKuB,IAAI2G,EAAK2jB,IAETgK,GAAU1N,IAAa0D,EAAe,CAC1CxD,GAAqB3f,EAAW1I,MAAOkI,EAAKigB,EAAU0D,EAAegK,GAGrEvO,GAAStnB,KADS,CAAEgC,KAAM6zB,EAAS,MAAQ,MAAO50B,KAAMiH,GAC9B,OAC3B,CAEA,OAAOlI,IACR,EClJK,MAAgBg2B,WAA0CtwB,QAC/D,IAAKpC,OAAO0F,eACX,MAAO,iBACR,CACA,GAAAzJ,CAAIuF,GACH,MAAMmxB,EAAMj2B,KAAK+E,IAAID,GAOrB,OANA9E,KAAKT,IAAIuF,GACJmxB,GAEJ3O,GAAS5e,EAAW1I,MAAO,CAAEgC,KAAM,MAAOf,KAAM6D,GAASA,GAGnD9E,IACR,CAEA,OAAO8E,GACN,MAAMmxB,EAAMj2B,KAAK+E,IAAID,GACftE,EAAMR,KAAKO,OAAOuE,GAExB,OADImxB,GAAK3O,GAAS5e,EAAW1I,MAAO,CAAEgC,KAAM,MAAOf,KAAM6D,GAASA,GAC3DtE,CACR,CAEA,GAAAuE,CAAID,GAEH,OADA8lB,GAAUliB,EAAW1I,MAAO8E,GACrB9E,KAAK+E,IAAID,EACjB,EAOK,MAAgBoxB,WAAuBl3B,IAC5C,IAAKsE,OAAO0F,eACX,MAAO,aACR,CAEA,QAAIjF,GAGH,OADA6mB,GAAU5qB,KAAM,QACTA,KAAK+D,IACb,CAEA,GAAAxE,CAAIuF,GACH,MAAMmxB,EAAMj2B,KAAK+E,IAAID,GACf+mB,EAAgBM,GAASrnB,GAE/B,GADA9E,KAAKT,IAAIssB,IACJoK,EAAK,CACT,MAAMpe,EAAY,CAAE7V,KAAM,MAAOf,KAAM4qB,GAEvCvE,GAAS5e,EAAW1I,MAAO6X,EAAWgU,GACtCvE,GAAStnB,KAAM6X,EAAW,OAC3B,CACA,OAAO7X,IACR,CAEA,KAAAgQ,GACC,MAAM+lB,EAAa/1B,KAAK+D,KAAO,EAE/B,GADA/D,KAAKgQ,QACD+lB,EAAY,CACf,MAAMle,EAAY,CAAE7V,KAAM,QAASmI,OAAQ,SAC3Cmd,GAAStnB,KAAM6X,EAAW,QAC1BxD,GAAQ3L,EAAW1I,MAAO6X,EAC3B,CACD,CAEA,OAAO/S,GACN,MAAMmxB,EAAMj2B,KAAK+E,IAAID,GACftE,EAAMR,KAAKO,OAAOuE,GACxB,GAAImxB,EAAK,CACR,MAAMpe,EAAY,CAAE7V,KAAM,MAAOf,KAAM6D,GACvCwiB,GAAS5e,EAAW1I,MAAO6X,EAAW/S,GACtCwiB,GAAStnB,KAAM6X,EAAW,OAC3B,CACA,OAAOrX,CACR,CAEA,GAAAuE,CAAID,GAEH,OADA8lB,GAAUliB,EAAW1I,MAAO8E,GACrB9E,KAAK+E,IAAID,EACjB,CAEA,OAAAuJ,GAEC,OADAuc,GAAUliB,EAAW1I,OACdsuB,GAA4BtuB,KAAKqO,UACzC,CAEA,OAAAlB,CAAQP,EAAwDC,GAC/D+d,GAAUliB,EAAW1I,OACrBA,KAAKmN,QAAQP,EAAYC,EAC1B,CAEA,IAAAvE,GAEC,OADAsiB,GAAUliB,EAAW1I,OACdouB,GAAqBpuB,KAAKsI,OAClC,CAEA,MAAArD,GAEC,OADA2lB,GAAUliB,EAAW1I,OACdouB,GAAqBpuB,KAAKiF,SAClC,CAEA,CAAC3B,OAAOoJ,YACPke,GAAUliB,EAAW1I,OACrB,MAAMm1B,EAAiBn1B,KAAKsD,OAAOoJ,YACnC,MAAO,CACN,IAAAmS,GACC,MAAMU,EAAS4V,EAAetW,OAC9B,OAAIU,EAAO8O,KACH9O,EAED,CAAEza,MAAOqnB,GAAS5M,EAAOza,OAAQupB,MAAM,EAC/C,EACA,CAAC/qB,OAAOoJ,YACP,OAAO1M,IACR,EACA,CAACsD,OAAO8xB,WAAY,EAEtB,ECzEDjK,GAAW5pB,IAAIgE,MAAOyvB,GAAcvyB,WACpC0oB,GAAW5pB,IAAIvC,IAAKk3B,GAAYzzB,WAChC0oB,GAAW5pB,IAAImE,QAASswB,GAAgBvzB,WACxC0oB,GAAW5pB,IAAIc,IAAKyzB,GAAYrzB,WAChC0oB,GAAW5pB,IAAIrC,QAAS02B,GAAgBnzB,WAKjC,MAAM0zB,GAAmB,CAC/BpZ,iBACAC,iBACArH,2BACAC,YACAkQ,iBACAC,2BACAC,gBACAC,8BACAuB,uBCtEK4O,GAA2D,GAKpDzkB,GAASnH,EAAU,CAC/BT,OAAM,CAAC0B,EAAUZ,EAASpB,IAClB,WACN,MAAM4sB,EAAqBD,GAAgB/oB,UACzCwa,GAAMA,EAAE3P,SAAWlY,MAAQ6nB,EAAE5mB,OAASwI,GAExC,GAAI4sB,GAAqB,EACxB,MAAM,IAAI1wB,MACT,iCAAiCywB,GAC/BxoB,MAAMyoB,GACN1pB,IAAKkb,GAAM,GAAGA,EAAE3P,OAAO/O,YAAYvC,QAAQP,OAAOwhB,EAAE5mB,SACpDkN,KAAK,oBAETioB,GAAgBt2B,KAAK,CAAEoY,OAAQlY,KAAMiB,KAAMwI,IAC3C,IACC,MAAMc,EAAKkB,EAAStL,KAAKH,MAEzB,OADAyH,GAAMzH,KAAMyJ,EAAac,GAClBA,CACR,SACC6rB,GAAgBvY,KACjB,CACD,aAoBcpW,GAAMyQ,EAAgBzO,EAA0B3E,GAC/D5D,OAAOQ,eAAewW,EAAQzO,EAAa,CAAE3E,SAC9C,OAgCawxB,GAAap1B,OAAO2D,OAChC2F,EAAU,CACTL,OAAM,CAACsB,EAAUZ,EAASpB,IAClB,YAAwB9J,GAE9B,OADA22B,GAAWhhB,KAAKtV,KAAMyJ,GACfgC,EAAS1L,MAAMC,KAAML,EAC7B,EAEDoK,OAAM,CAAC0B,EAAUZ,EAASpB,IAClB,WAEN,OADA6sB,GAAWhhB,KAAKtV,KAAMyJ,GACfgC,EAAStL,KAAKH,KACtB,EAEDiK,OAAM,CAACwB,EAAUZ,EAASpB,IAClB,SAAqB3E,GAE3B,OADAwxB,GAAWhhB,KAAKtV,KAAMyJ,GACfgC,EAAStL,KAAKH,KAAM8E,EAC5B,EAED8E,MAAM6B,GACE,cAAcA,EACpB,WAAAtC,IAAexJ,GACd0J,SAAS1J,GACT22B,GAAWhhB,KAAKtV,KAAM,cACvB,GAGFoK,QAAQhB,GACAoB,EAAU,CAChBL,OAAM,CAACsB,EAAUZ,EAASpB,IAClB,YAAwB9J,GAE9B,OADA22B,GAAWhhB,KAAKtV,KAAMyJ,EAAaL,GAC5BqC,EAAS1L,MAAMC,KAAML,EAC7B,EAEDoK,OAAM,CAAC0B,EAAUZ,EAASpB,IAClB,WAEN,OADA6sB,GAAWhhB,KAAKtV,KAAMyJ,EAAaL,GAC5BqC,EAAStL,KAAKH,KACtB,EAEDiK,OAAM,CAACwB,EAAUZ,EAASpB,IAClB,SAAqB3E,GAE3B,OADAwxB,GAAWhhB,KAAKtV,KAAMyJ,EAAaL,GAC5BqC,EAAStL,KAAKH,KAAM8E,EAC5B,EAED8E,MAAM6B,GACE,cAAcA,EACpB,WAAAtC,IAAexJ,GACd0J,SAAS1J,GACT22B,GAAWhhB,KAAKtV,KAAM,cAAeoJ,EACtC,OAML,CACCkM,KAAM,CAAC9L,EAAaC,EAA0BL,kCChIhD,MAAMmtB,QAAEA,IAAYC,GAGdC,GAAmB,qBACnBC,GACiB,oBAAft2B,WACJA,WACkB,oBAAX0qB,OACNA,OACkB,oBAAX6L,QACNA,OAGN,GAAID,GAAa,CAEhB,IAAI/e,EAAS,cACb,MAAMif,EAAWC,KACjB,IAEC,GAA0B,oBAAfC,WAA4Bnf,EAASmf,eAC3C,CAEJ,MAAM1b,EAAOwb,EAAS,eAClBxb,GAAQA,EAAK2b,MAAKpf,EAASyD,EAAK2b,IACrC,CACD,CAAE,MAAO3xB,GAET,CAEA,MAAM4xB,EAAoB,CACzBT,WACA5e,SACAkB,UAAWrT,KAAK6S,OAGjB,GAAIqe,GAAYD,IAAmB,CAClC,MAAMtgB,EAAWugB,GAAYD,IAC7B,MAAM,IAAI9wB,MAER,4DAAsBsxB,KAAKC,UAAU/gB,EAAU,KAAM,qBACpC8gB,KAAKC,UAAUF,EAAmB,KAAM,6NAK5D,CAEAN,GAAYD,IAAoBO,CACjC,kE7B6CM,SAKJnrB,EAAkCsrB,SASnC,OARItrB,GAAwB,mBAATA,IAClBsrB,EAAgBtrB,EAChBA,OAAOlC,GAEHkC,IACJA,EAAO,SAGR2D,EAAO,cAA2B3D,EAEjC,cAAOurB,CAAQrwB,GACd,MAAMmE,EAAasE,EAAY6nB,YAAYj1B,IAAI2E,GAC/C,IAAKmE,EAAY,OAAO,EACxBH,EAAGkF,WAAWlJ,EAAIoE,IAClBqE,EAAY6nB,YAAY92B,OAAOwG,GAC/B7F,OAAO8K,eAAejF,EAAK,IAAIZ,MAAM,CAAA,EAAImF,IAEzC,IAAK,MAAMpD,KAAOhH,OAAOC,oBAAoB4F,UACpCA,EAAYmB,GAGrB,OADAgD,KACO,CACR,CACA,oBAAOosB,CAAcvwB,GACpB,OAAOyI,EAAY6nB,YAAYtyB,IAAIgC,EACpC,CAIA,WAAAoC,IAAexJ,GACd0J,SAAS1J,GACT,MAAM6L,EAAY,CAAA,EAClBxL,KAAKmL,GAAmBK,EAExB,MAAM+rB,EAAeJ,GAAejsB,YAAclL,KAAKkL,GACvD,IAAKqsB,EACJ,MAAM,IAAInsB,EAAiB,6BAE5B,SAASosB,IACRD,EAAa/rB,EACd,CACAgE,EAAY6nB,YAAY91B,IAAIvB,KAAMw3B,GAClCzsB,EAAGsF,SAASrQ,KAAMw3B,EAAahsB,EAChC,GAlCgBgE,EAAA6nB,YAAc,IAAIn4B,QAmClCsQ,CACF,wC8BvJA,WAAArG,GACUsuB,EAAAl2B,IAAAvB,KAAU,IAAIqC,KACdq1B,EAAAn2B,IAAAvB,KAAS,GAkEnB,CAhEQ,IAAAX,CACNwQ,GAMA,OADK2M,EAAAxc,KAAI03B,EAAA,KAAQ7tB,SAASgG,IAAK2M,EAAAxc,KAAI03B,EAAA,KAAQ53B,KAAK+P,GACzC,KACN2M,EAAAxc,KAAI03B,EAAA,KAAQ/G,OAAOnU,EAAAxc,KAAI03B,EAAA,KAAQhqB,QAAQmC,GAAK,GAE9C,CAIO,EAAA8nB,CACNC,EACA/nB,GAEA,GAA6B,iBAAlB+nB,EACV,IAAK,MAAMxyB,KAAKlE,OAAOoH,KAAKsvB,GAC3B53B,KAAK23B,GAAGvyB,EAAGwyB,EAAcxyB,SAEpB,QAAWuE,IAAPkG,EAAkB,CAC5B,IAAIgoB,EAAYrb,EAAAxc,KAAIy3B,EAAA,KAASr1B,IAAIw1B,GAC5BC,IACJA,EAAY,GACZrb,EAAAxc,YAAauB,IAAIq2B,EAAeC,IAEjCA,EAAU/3B,KAAK+P,EAChB,CAEA,MAAO,IAAM7P,KAAK83B,IAAIF,EAAe/nB,EACtC,CAGO,GAAAioB,CACNF,EACA/nB,GAEA,GAA6B,iBAAlB+nB,EACV,IAAK,MAAMxyB,KAAKlE,OAAOoH,KAAKsvB,GAC3B53B,KAAK83B,IAAI1yB,EAAGwyB,EAAcxyB,SAErB,GAAIyK,QAAiC,CAC3C,MAAMgoB,EAAYrb,EAAAxc,KAAIy3B,EAAA,KAASr1B,IAAIw1B,GAC/BC,GACHrb,EAAAxc,YAAauB,IACZq2B,EACAC,EAAU/qB,OAAQ+a,GAAMA,IAAMhY,GAGjC,MAEC2M,EAAAxc,KAAIy3B,EAAA,KAASl3B,OAAOq3B,EAEtB,CACO,IAAAG,CACNC,KACGr4B,GAEH,MAAMk4B,EAAYrb,EAAAxc,KAAIy3B,EAAA,KAASr1B,IAAI41B,GACnC,GAAIH,EAAW,IAAK,MAAMhoB,KAAMgoB,EAAWhoB,EAAG9P,MAAMC,KAAML,GAC1D,IAAK,MAAMkQ,KAAM2M,EAAAxc,KAAI03B,EAAA,KAAS7nB,EAAG1P,KAAKH,KAAMg4B,KAAUr4B,EACvD,8OhC/CK,SAAsB4H,EAAQC,GACnC,GAAID,IAAMC,EAAG,OAAO,EACpB,IAAKjC,MAAMqC,QAAQL,KAAOhC,MAAMqC,QAAQJ,GAAI,OAAO,EACnD,GAAID,EAAEjH,SAAWkH,EAAElH,OAAQ,OAAO,EAClC,IAAK,IAAID,EAAI,EAAGA,EAAIkH,EAAEjH,OAAQD,IAC7B,GAAIkH,EAAElH,KAAOmH,EAAEnH,GAAI,OAAO,EAE3B,OAAO,CACR,cFd0BhB,GAAeX,EAAWC,QAAQU,6De0zC3D44B,EACA71B,EACAb,GAEmB,mBAARa,IACVb,EAAMa,EAAIb,IACVa,EAAMA,EAAIA,KAEX,IAAI81B,EAAgC50B,SAOpC,OANA4T,GACClB,GAAa,KACZ,MAAMoS,EAAWhmB,IACb6a,GAAOmL,KAAc8P,GAA0BD,EAAS7P,IAC1D6P,IAEG12B,EACJ+hB,GAAQxe,IACRozB,EAA2Bjb,GAAOnY,GAClCvD,EAAIuD,KAEJ,MACJ,8DXjrCM,SAAmB+K,GACxB,IAAIsoB,GAAS,EACb,MAAMlmB,EAAU,KACXkmB,IACJA,GAAS,EACTtoB,MAGD,OADA9E,EAAGsF,SAAS4B,EAASpC,EAAIA,GAClBoC,CACR,0E4BhCM,SAAmBmmB,GACxB,OAAO5tB,EAAU,CAChB,MAAAL,CAAOsB,EAAUZ,EAASwtB,GACzB,IAAIC,EAAkD,KAEtD,OAAO,YAAwB34B,GAE1B24B,GACHC,aAAaD,GAIdA,EAAYz3B,WAAW,KACtB4K,EAAS1L,MAAMC,KAAML,GACrB24B,EAAY,MACVF,EACJ,CACD,GAEF,oFToBM,SAAqBI,GAI1B,MAAMjuB,EAAK,CAAEzF,WAAO6E,GACpB,OAAOwjB,GACN5iB,EACA6Z,GAAU,IACTlN,GAAO,SAAuBic,GAC7B5oB,EAAGzF,MAAQ0zB,EAAQrF,EACpB,IAGH,aSvJM,SAAmBzpB,GAKxB,MAAO,IAAO+uB,IACZC,GACO,cAAcA,EACpB,WAAAvvB,IAAexJ,GACd0J,SAAS1J,GACT,IAAK,MAAMuI,KAAOuwB,EACjBv3B,OAAOQ,eAAe1B,KAAMkI,EAAK,IAC7BhH,OAAOI,yBAAyBtB,KAAMkI,MACtCwB,GAGN,EAGJ,+ErB0UuB,oBAAXohB,SACPrU,KACJA,IAAkB,EAGlBqU,OAAO6N,mBAAqB,CAC3BC,SAAUlf,GACVpB,iBACAC,iBACAsgB,eAAgBrgB,GAChBsgB,eAAgBrgB,KAElB,iDIzVC,OAAO+E,EACR,mGiBpCM,SAAmBtF,EAAgBzO,GACxC,QAASvI,OAAOI,yBAAyB4W,EAAQzO,EAClD,6FlBjBM,SAAqB1C,GAC1B,OAAOiW,GAAcjY,IAAIgC,EAC1B,+FqB6JCyC,EACAuvB,EACA5F,GASA,OAPAjyB,OAAOQ,eAAe8H,EAAQuvB,EAAU,CACvC32B,IAAK+wB,EAAO/wB,IACZb,IAAK4xB,EAAO5xB,IACZC,cAAc,EACd2F,YAAY,IAEbmgB,GAAS9d,EAAQ,CAAExH,KAAM,MAAOf,KAAM83B,GAAYA,GAC3C,WAAcvvB,EAAeuvB,EACrC,cA9EM,SAILphB,EACA5X,EACAi5B,EAAqB,CAAA,GAErB,MAAM/E,EAAiB9H,GAASxU,GAC1BnO,EAAS2iB,GAAS6M,GAClB7E,EAAa,IAAI9xB,IAEvB,SAAS+xB,EAAWlsB,GACnB,MAAMkd,EAAa+O,EAAW/xB,IAAI8F,GAC9Bkd,IACH+O,EAAW5zB,OAAO2H,GAClBkd,IAEF,CAEA,MAAMiP,EAAcnd,GAAO,UAA6B4M,OAAEA,IAEzD,MAAMxb,EAAO,IAAItJ,IACjB,IAAK,MAAMkJ,KAAO+rB,EAAgB3rB,EAAK/I,IAAI2I,GAE3C,IAAK,MAAMA,KAAOI,EACb6rB,EAAWpvB,IAAImD,IACnB4b,EAAO,KACN,MAAM6L,EAAOzY,GAAO,WACnB,MAAMsd,EAAYtsB,EACZ2rB,EAAa,CAClB3rB,IAAKssB,EACLpyB,IAAK,IAAM0E,EAAU1E,IAAI6xB,EAAgBO,EAAWP,GACpD1yB,IAAMuD,GACLgC,EAAUvF,IAAI0yB,EAAgBO,EAAW1vB,EAAOmvB,IAQlD,OANA/yB,OAAOQ,eAAemyB,EAAY,QAAS,CAC1CzxB,IAAKyxB,EAAWzxB,IAChBb,IAAKsyB,EAAWtyB,IAChBC,cAAc,EACd2F,YAAY,IAENpH,EAAM8zB,EAAyDrqB,EACvE,GACA2qB,EAAW5yB,IAAI2G,EAAKynB,KAItB,IAAK,MAAMznB,KAAO3C,MAAM0U,KAAKka,EAAW7rB,QAAcA,EAAKvD,IAAImD,IAAMksB,EAAWlsB,EACjF,GAEA,OAAOilB,GAAU3jB,EAAQ,KACxB6qB,IACA,IAAK,MAAMnsB,KAAO3C,MAAM0U,KAAKka,EAAW7rB,QAAS8rB,EAAWlsB,IAE9D,8ETiPM,SACLmnB,EACAC,GAEA,OAAO,IAAIf,GAAcc,EAAOC,EACjC,yDRhYM,SACL2J,EACAC,GAEAD,EAAcx2B,UAAUqQ,IAAkBomB,EAC1CvR,GAAiBuR,EAClB,oDkBuHM,SAA0BrpB,GAC/B,MAAM0P,EAAS4M,GAAS,IACxB,OAAOgB,GAAU5N,EAAQrI,GAAO,KAC/B,MAAMS,EAAS9H,IACX0P,EAAOjf,SAAWqX,EAAOrX,SAAQif,EAAOjf,OAASqX,EAAOrX,QAC5D,IAAK,IAAID,EAAI,EAAGA,EAAIsX,EAAOrX,OAAQD,IAC9Bkf,EAAOlf,KAAOsX,EAAOtX,KAAIkf,EAAOlf,GAAKsX,EAAOtX,MAEnD,4BA3HCsX,EACAtS,EACA4H,GAEA,MAAMgnB,EAAiB9H,GAASxU,GAC1B4H,EAAS4M,GAAS,IAGlBqH,EAAe,IAAInxB,IAEnB82B,EAAsBhN,GAAS,IAC/BiN,EAAiB,IAAIl6B,YAErBm6B,EAAY,sCAEjB,WAAAlwB,CAAmBpB,EAAY2T,GAAZ1b,KAAA+H,KAFd+qB,EAAA9yB,KAAAs5B,GAEcvxB,GAClB/H,KAAK0b,KAAOA,CACb,CAGA,OAAI6d,GACH,MAAMC,EAAUx5B,KAAK0b,KAAO1b,KAAK0b,KAAK6d,IAAMtsB,EAC5C,OAAO5H,EAASm0B,EAASx5B,KAAK+H,IAC/B,0FAJCmmB,IACDsE,EAAAhjB,EAAA,KAAAiqB,EAAA,CAAAnvB,KAAA,SAAA1D,KAAA,MAAA8yB,QAAA,EAAAC,SAAA,EAAAxG,OAAA,CAAApuB,IAAAgC,GAAA,QAAAA,EAAA3E,IAAA2E,GAAAA,EAAIwyB,KAAG5G,SAAAC,GAAA,KAAA0G,0GAPU,GAalB,SAAS7F,EAAa1nB,GACrB,MAAM4jB,EAAO6D,EAAapxB,IAAI2J,GAC1B4jB,IACHA,IACA6D,EAAajzB,OAAOwL,GACpBqY,GAAU,KACTle,QAAQ8lB,eAAemN,EAA4BptB,GACnD7F,QAAQ8lB,eAAezM,EAAexT,KAGzC,CAEA,MAAM6tB,EAAa1iB,GAAO,UAAwB4M,OAAEA,IACnD,MAAMxjB,EAAS2zB,EAAe3zB,OACxBu5B,EAAkB,IAAIx3B,IAC5B,IAAIqZ,EAEJ,IAAK,IAAIrb,EAAI,EAAGA,EAAIC,EAAQD,IAAK,CAChC,MAAM0H,EAAMjB,EAAU1E,IAAI6xB,EAAuB5zB,EAAG4zB,GAEpD,IAAMlsB,GAAuB,iBAARA,GAAmC,mBAARA,GAAqC,iBAARA,EAC5E,MAAM,IAAIpC,MAAM,kEAGjB,MAAMwS,EAAQ0hB,EAAgBz3B,IAAI2F,IAAQ,EAC1C8xB,EAAgBt4B,IAAIwG,EAAKoQ,EAAQ,GAEjC,IAAI2hB,EAAOV,EAAeh3B,IAAI2F,GACzB+xB,IACJA,EAAO,GACPV,EAAe73B,IAAIwG,EAAK+xB,IAGzB,IAAIC,EAAeD,EAAK3hB,GACnB4hB,EAKA3V,GAAU,IAAM2V,EAAare,QAAUA,IAC1Cqe,EAAare,KAAOA,IALrBqe,EAAe5N,GAAS,IAAIkN,EAAatxB,EAAK2T,IAC9Coe,EAAK3hB,GAAS4hB,GASXZ,EAAoB94B,KAAO05B,IAC9BZ,EAAoB94B,GAAK05B,GAIrBvG,EAAazuB,IAAI1E,IACrByjB,EAAO,KACN,MAAM/X,EAAQ1L,EACRsvB,EAAOzY,GAAO,WACnB,MAAM8iB,EAAQb,EAAoBptB,GAClC,GAAIiuB,EAAO,CACV,MAAMC,EAAWD,EAAMT,IACvBnV,GAAU,KACT7E,EAAOxT,GAASkuB,GAElB,CACD,GACAzG,EAAajyB,IAAIwK,EAAO4jB,KAI1BjU,EAAOqe,CACR,CAGA,IAAK,MAAMhuB,KAASxG,MAAM0U,KAAKuZ,EAAalrB,QACvCyD,GAASzL,GAAQmzB,EAAa1nB,GAInCqY,GAAU,KACL7E,EAAOjf,SAAWA,GACrBwG,EAAUvF,IAAIge,EAAe,SAAUjf,EAAQif,IAGlD,GAEA,OAAO4N,GAAU5N,EAAQ,KACxBqa,IACA,IAAK,MAAMjK,KAAQ6D,EAAavuB,SAAU0qB,IAC1C6D,EAAaxjB,SAEf,qEJ0BM,SAAmBooB,GACxB,OAAO5tB,EAAU,CAChB,MAAAL,CAAOsB,EAAUZ,EAASwtB,GACzB,IAAI6B,EAAe,EACf5B,EAAkD,KAEtD,OAAO,YAAwB34B,GAC9B,MAAM0Y,EAAM7S,KAAK6S,MAGjB,GAAIA,EAAM6hB,GAAgB9B,EAOzB,OALIE,IACHC,aAAaD,GACbA,EAAY,MAEb4B,EAAe7hB,EACR5M,EAAS1L,MAAMC,KAAML,GAI7B,IAAK24B,EAAW,CACf,MAAM6B,EAAgB/B,GAAS/f,EAAM6hB,GAC/BE,EAAgB,IAAIz6B,GAC1B24B,EAAYz3B,WAAW,KACtBq5B,EAAe10B,KAAK6S,MACpB5M,EAAS1L,MAAMC,KAAMo6B,GACrB9B,EAAY,MACV6B,EACJ,CACD,CACD,GAEF,2CjBzDM,SAAsBE,GAC3B,MAAM5X,EAAe3F,KACrB,IAAK2F,EAAc,MAAM,IAAI9c,MAAM,oBAC9BqY,GAAejZ,IAAI0d,GACnBzE,GAAe5b,IAAIqgB,GAAeljB,IAAI86B,GADJrc,GAAezc,IAAIkhB,EAAc,IAAIzjB,IAAI,CAACq7B,IAElF,qDQ/FM,SACLv1B,EACAw1B,EACAp4B,EAAe,CAAA,GAEf,MAAwB,mBAAV4C,EAsBf,SACCA,EACAw1B,GACA1a,UAAEA,GAAY,EAAK2a,KAAEA,GAAO,GAAU,IAEtC,IACIC,EADArS,EAAgC2E,GAEpC,MAAM2N,EAAYvjB,GACjBlB,GAAa,SAA6Bmd,GACzC,MAAM/K,EAAWtjB,EAAMquB,GACnBhL,IAAaC,IACZD,IAAa2E,GACZlN,GAAW0a,EAAQlS,GACjBkS,EAAQlS,EAAUD,IACzBA,EAAWC,EACPmS,IACCC,GAAaA,IACjBA,EAAc7N,GAAUvE,EAAqBtjB,GAAUw1B,EAAQx1B,EAAYA,IAE9E,EAAGA,IAEJ,MAAO,KACN21B,IACID,GAAaA,IAEnB,CA9CIE,CAAc51B,EAAOw1B,EAASp4B,GACb,iBAAV4C,GAAgC,OAAVA,EAOjC,SACCA,EACAw1B,GACA1a,UAAEA,GAAY,EAAK2a,KAAEA,GAAO,GAAU,IAEtC,OAAIA,EAAa5N,GAAU7nB,EAAOw1B,EAAS,CAAE1a,cACtC1I,GAAO,WACb0T,GAAU9lB,GACN8a,GAAW0a,EAAQx1B,GACvB8a,GAAY,CACb,EACD,CAjBK+a,CAAY71B,EAAOw1B,EAASp4B,GAC5B,MACA,MAAM,IAAIyD,MAAM,+CAChB,EAFA,EAGL,QrBxEM,YAAmDhG,GACxD,IAAKA,EAAKW,OAAQ,MAAO,GACzB,MAAMs6B,EAAY3Q,KAAKsH,OAAO5xB,EAAKgN,IAAKkuB,GAAQA,EAAIv6B,SAC9Cif,EAA4B,GAElC,IAAK,IAAIlf,EAAI,EAAGA,EAAIu6B,EAAWv6B,IAAK,CACnC,MAAMy6B,EAAQn7B,EAAKgN,IAAKkuB,GAAQA,EAAIx6B,IACpCkf,EAAOzf,KAAKg7B,EACb,CAEA,OAAOvb,CACR"}