mutts 1.0.0 → 1.0.1

package/dist/mutts.umd.js.map

@@ -1 +1 @@
-{"version":3,"file":"mutts.umd.js","sources":["../src/utils.ts","../src/decorator.ts","../src/destroyable.ts","../src/indexable.ts","../src/reactive/core.ts","../src/reactive/interface.ts","../src/reactive/array.ts","../src/reactive/map.ts","../src/reactive/set.ts","../src/reactive/index.ts","../src/std-decorators.ts","../src/eventful.ts"],"sourcesContent":["type ElementTypes<T extends readonly unknown[]> = {\n\t[K in keyof T]: T[K] extends readonly (infer U)[] ? U : T[K]\n}\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\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[])\nexport function isConstructor(fn: Function): boolean {\n\treturn fn && (nativeConstructors.has(fn) || fn.toString().startsWith('class '))\n}\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","// 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\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\nexport type LegacyPropertyDecorator<T> = (\n\ttarget: T,\n\tname: string | symbol,\n\tdescriptor: PropertyDescriptor\n) => any\n\nexport type LegacyClassDecorator<T> = (target: T) => any\n\nexport type ModernMethodDecorator<T> = (target: T, context: ClassMethodDecoratorContext) => any\n\nexport type ModernGetterDecorator<T> = (target: T, context: ClassGetterDecoratorContext) => any\n\nexport type ModernSetterDecorator<T> = (target: T, context: ClassSetterDecoratorContext) => any\n\nexport type ModernAccessorDecorator<T> = (target: T, context: ClassAccessorDecoratorContext) => any\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\tname: PropertyKey\n) => ((this: T, ...args: any[]) => any) | void\n\ntype DDGetter<T> = (original: (this: T) => any, name: PropertyKey) => ((this: T) => any) | void\n\ntype DDSetter<T> = (\n\toriginal: (this: T, value: any) => void,\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\nexport interface DecoratorDescription<T> {\n\tmethod?: DDMethod<T>\n\tclass?: DDClass<T>\n\tgetter?: DDGetter<T>\n\tsetter?: DDSetter<T>\n\tdefault?: (...args: any[]) => any\n}\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\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\nexport function legacyDecorator<T = any>(description: DecoratorDescription<T>): any {\n\treturn function (\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, 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, 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, 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\nexport function modernDecorator<T = any>(description: DecoratorDescription<T>): any {\n\treturn function (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, 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, 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, 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, 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, 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\nexport const decorator: DecoratorFactory<any> = (description: DecoratorDescription<any>) => {\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? modernDecorator(description)(target, contextOrKey, ...args)\n\t\t\t: legacyDecorator(description)(target, contextOrKey, ...args)\n\t}) as any\n}\n\nexport type GenericClassDecorator<T> = LegacyClassDecorator<new (...args: any[]) => T> &\n\tModernClassDecorator<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())\nexport const destructor = Symbol('destructor')\nexport const allocatedValues = Symbol('allocated')\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\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Partial<typeof this>,\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\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\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\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)\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\tdeclare [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, this)\n\t\t}\n\t}\n}\n\nconst forwardProperties = Symbol('forwardProperties')\nexport const allocated = decorator({\n\tsetter(original, 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\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// Context Manager Protocol for `with` statement integration\nexport interface ContextManager<T = any> {\n\t[Symbol.dispose](): void\n\tvalue?: T\n}\n","export const getAt = Symbol('getAt')\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\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\nexport function Indexable<Items>(accessor: Accessor<any, Items>): new () => { [x: number]: Items }\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\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) {\n\t\t\t\t\t\t\tthrow new Error('Indexable class has read-only numeric index access')\n\t\t\t\t\t\t}\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","// 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 { decorator } from '../decorator'\n\nexport type DependencyFunction = <T>(cb: () => T) => T\n// TODO: proper async management, read when fn returns a promise and let the effect as \"running\",\n//  either to cancel the running one or to avoid running 2 in \"parallel\" and debounce the second one\n\n// TODO: generic \"batch\" forcing even if not in an effect (perhaps when calling a reactive' function ?)\n// example: storage will make 2 modifications (add slot, modify count), they could raise 2 effects\nexport type ScopedCallback = () => void\n\nexport type PropEvolution = {\n\ttype: 'set' | 'del' | 'add'\n\tprop: any\n}\n\nexport type BunchEvolution = {\n\ttype: 'bunch'\n\tmethod: string\n}\ntype Evolution = PropEvolution | BunchEvolution\n\ntype State =\n\t| {\n\t\t\tevolution: Evolution\n\t\t\tnext: State\n\t  }\n\t| {}\n// Track which effects are watching which reactive objects for cleanup\nconst effectToReactiveObjects = new WeakMap<ScopedCallback, Set<object>>()\n\n// Track object -> proxy and proxy -> object relationships\nconst objectToProxy = new WeakMap<object, object>()\nconst proxyToObject = new WeakMap<object, object>()\n// Deep watching data structures\n// Track which objects contain which other objects (back-references)\nconst objectParents = new WeakMap<object, Set<{ parent: object; prop: PropertyKey }>>()\n\n// Track which objects have deep watchers\nconst objectsWithDeepWatchers = new WeakSet<object>()\n\n// Track deep watchers per object\nconst deepWatchers = new WeakMap<object, Set<ScopedCallback>>()\n\n// Track which effects are doing deep watching\nconst effectToDeepWatchedObjects = new WeakMap<ScopedCallback, Set<object>>()\n\n// Track objects that should never be reactive and cannot be modified\nexport const nonReactiveObjects = new WeakSet<object>()\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\n// Track effects per reactive object and property\nconst watchers = new WeakMap<object, Map<any, Set<ScopedCallback>>>()\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// Track native reactivity\nconst nativeReactive = Symbol('native-reactive')\n\n// Symbol to mark individual objects as non-reactive\nexport const nonReactiveMark = Symbol('non-reactive')\n// Symbol to mark class properties as non-reactive\nexport const unreactiveProperties = Symbol('unreactive-properties')\nexport const prototypeForwarding: unique symbol = Symbol('prototype-forwarding')\n\nexport const allProps = Symbol('all-props')\n\n// Symbol to mark functions with their root function\nconst rootFunction = Symbol('root-function')\n\n/**\n * Mark a function with its root function. If the function already has a root,\n * the root becomes the root of the new root (transitive root tracking).\n * @param fn - The function to mark\n * @param root - The root function to associate with fn\n */\nexport function markWithRoot<T extends Function>(fn: T, root: Function): T {\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 * Retrieve the root function from a callback. Returns the function itself if it has no root.\n * @param fn - The function to get the root from\n * @returns The root function, or the function itself if no root exists\n */\nexport function getRoot<T extends Function | undefined>(fn: T): T {\n\treturn (fn as any)?.[rootFunction] || fn\n}\n\nexport class ReactiveError extends Error {\n\tconstructor(message: string) {\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 * Options for the reactive system, can be configured at runtime\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: (target: Function, caller?: Function) => {},\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 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// biome-ignore lint/suspicious/noConsole: This is the whole point here\n\twarn: (...args: any[]) => console.warn(...args),\n}\n// biome-ignore-end lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n\n//#region evolution\n\nfunction raiseDeps(objectWatchers: Map<any, Set<ScopedCallback>>, ...keyChains: Iterable<any>[]) {\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) for (const effect of Array.from(deps)) hasEffect(effect)\n\t\t}\n}\n\nexport function touched1(obj: any, evolution: Evolution, prop: any) {\n\ttouched(obj, evolution, [prop])\n}\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\tif (props) raiseDeps(objectWatchers, [allProps], props)\n\t\telse raiseDeps(objectWatchers, objectWatchers.keys())\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\nconst states = new WeakMap<object, State>()\n\nfunction 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\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 dependant(obj: any, prop: any = allProps) {\n\t// TODO: avoid depending on property get?\n\tobj = unwrap(obj)\n\tif (activeEffect && (typeof prop !== 'symbol' || prop === allProps)) {\n\t\tlet objectWatchers = watchers.get(obj)\n\t\tif (!objectWatchers) {\n\t\t\tobjectWatchers = new Map<PropertyKey, Set<ScopedCallback>>()\n\t\t\twatchers.set(obj, objectWatchers)\n\t\t}\n\t\tlet deps = objectWatchers.get(prop)\n\t\tif (!deps) {\n\t\t\tdeps = new Set<ScopedCallback>()\n\t\t\tobjectWatchers.set(prop, deps)\n\t\t}\n\t\tdeps.add(activeEffect)\n\n\t\t// Track which reactive objects this effect is watching\n\t\tlet effectObjects = effectToReactiveObjects.get(activeEffect)\n\t\tif (!effectObjects) {\n\t\t\teffectObjects = new Set<object>()\n\t\t\teffectToReactiveObjects.set(activeEffect, effectObjects)\n\t\t}\n\t\teffectObjects.add(obj)\n\t}\n}\n\n// Stack of active effects to handle nested effects\nlet activeEffect: ScopedCallback | undefined\n// Parent effect used for lifecycle/cleanup relationships (can diverge later)\nlet parentEffect: ScopedCallback | undefined\n\n// Track currently executing effects to prevent re-execution\n// These are all the effects triggered under `activeEffect`\nlet batchedEffects: Map<Function, ScopedCallback> | undefined\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\nfunction hasEffect(effect: ScopedCallback) {\n\tconst root = getRoot(effect)\n\n\toptions?.chain(getRoot(effect), getRoot(activeEffect))\n\tif (batchedEffects) batchedEffects.set(root, effect)\n\telse {\n\t\tconst runEffects: any[] = []\n\t\tbatchedEffects = new Map<Function, ScopedCallback>([[root, effect]])\n\t\ttry {\n\t\t\twhile (batchedEffects.size) {\n\t\t\t\tif (runEffects.length > options.maxEffectChain)\n\t\t\t\t\tthrow new ReactiveError('[reactive] Max effect chain reached')\n\t\t\t\tconst [root, effect] = batchedEffects.entries().next().value!\n\t\t\t\trunEffects.push(root)\n\t\t\t\teffect()\n\t\t\t\tbatchedEffects.delete(root)\n\t\t\t}\n\t\t} finally {\n\t\t\tbatchedEffects = undefined\n\t\t}\n\t}\n}\n\nexport function withEffect<T>(\n\teffect: ScopedCallback | undefined,\n\tfn: () => T,\n\tkeepParent?: true\n): T {\n\tif (getRoot(effect) === getRoot(activeEffect)) return fn()\n\tconst oldActiveEffect = activeEffect\n\tconst oldParentEffect = parentEffect\n\tactiveEffect = effect\n\tif (!keepParent) parentEffect = effect\n\ttry {\n\t\treturn fn()\n\t} finally {\n\t\tactiveEffect = oldActiveEffect\n\t\tparentEffect = oldParentEffect\n\t}\n}\n\n//#endregion\n\n//#region deep watching\n\n/**\n * Add a back-reference from child to parent\n */\nfunction 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 */\nfunction removeBackReference(child: object, parent: object, prop: any) {\n\tconst parents = objectParents.get(child)\n\tif (parents) {\n\t\tparents.delete({ parent, prop })\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 */\nfunction needsBackReferences(obj: object): boolean {\n\treturn objectsWithDeepWatchers.has(obj) || hasParentWithDeepWatchers(obj)\n}\n\n/**\n * Check if an object has any parent with deep watchers\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\n/**\n * Bubble up changes through the back-reference chain\n */\nfunction 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) hasEffect(watcher)\n\n\t\t// Continue bubbling up\n\t\tbubbleUpChange(parent, evolution)\n\t}\n}\n\nexport function track1(obj: object, prop: any, oldVal: any, newValue: any) {\n\t// Manage back-references if this object has deep watchers\n\tif (objectsWithDeepWatchers.has(obj)) {\n\t\t// Remove old back-references\n\t\tif (typeof oldVal === 'object' && oldVal !== null) {\n\t\t\tremoveBackReference(oldVal, obj, prop)\n\t\t}\n\n\t\t// Add new back-references\n\t\tif (typeof newValue === 'object' && newValue !== null) {\n\t\t\tconst reactiveValue = reactive(newValue)\n\t\t\taddBackReference(reactiveValue, obj, prop)\n\t\t}\n\t}\n\treturn newValue\n}\n\n//#endregion\n\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\t// Check if this property is marked as unreactive\n\t\tif (obj[unreactiveProperties]?.has(prop) || typeof prop === 'symbol')\n\t\t\treturn Reflect.get(obj, prop, receiver)\n\t\tconst absent = !(prop in obj)\n\t\t// Depend if...\n\t\tif (!options.instanceMembers || Object.hasOwn(receiver, prop) || absent) dependant(obj, prop)\n\n\t\tconst value = Reflect.get(obj, prop, receiver)\n\t\tif (typeof value === 'object' && value !== null) {\n\t\t\tconst reactiveValue = reactive(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// Check if this property is marked as unreactive\n\t\tif (obj[unreactiveProperties]?.has(prop)) return Reflect.set(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\n\t\tconst oldVal = (obj as any)[prop]\n\t\tconst oldPresent = prop in obj\n\t\ttrack1(obj, prop, oldVal, newValue)\n\n\t\tif (oldVal !== newValue) {\n\t\t\tReflect.set(obj, prop, newValue, receiver)\n\t\t\t// try to find a \"generic\" way to express that\n\t\t\ttouched1(obj, { type: oldPresent ? 'set' : 'add', prop }, prop)\n\t\t}\n\t\treturn true\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>()\nexport class ReactiveBase {\n\tconstructor() {\n\t\t// biome-ignore lint/correctness/noConstructorReturn: This is the whole point here\n\t\treturn reactiveClasses.has(new.target) ? reactive(this) : this\n\t}\n}\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 (proxyToObject.has(target) || isNonReactive(target)) return target as T\n\n\t// If we already have a proxy for this object, return it\n\tif (objectToProxy.has(target)) return objectToProxy.get(target) 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) proxyToObject.set(proxied, target)\n\tconst proxy = new Proxy(proxied, reactiveHandlers)\n\n\t// Store the relationships\n\tobjectToProxy.set(target, proxy)\n\tproxyToObject.set(proxy, target)\n\treturn proxy as T\n}\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\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) {\n\t\treturn reactiveObject(original)\n\t},\n\tdefault: reactiveObject,\n})\n\nexport function unwrap<T>(proxy: T): T {\n\t// Return the original object\n\treturn (proxyToObject.get(proxy as any) as T) ?? proxy\n}\n\nexport function isReactive(obj: any): boolean {\n\treturn proxyToObject.has(obj)\n}\nexport function untracked(fn: () => ScopedCallback | undefined | void) {\n\twithEffect(undefined, fn, true)\n}\n\n// runEffect -> set<cleanup>\nconst effectChildren = new WeakMap<ScopedCallback, Set<ScopedCallback>>()\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 */\nexport function effect<Args extends any[]>(\n\tfn: (dep: DependencyFunction, ...args: Args) => ScopedCallback | undefined | void,\n\t...args: Args\n): ScopedCallback {\n\tlet cleanup: (() => void) | null = null\n\tconst dep = markWithRoot(<T>(cb: () => T) => withEffect(runEffect, cb), fn)\n\tlet effectStopped = false\n\n\tfunction runEffect() {\n\t\t// Clear previous dependencies\n\t\tcleanup?.()\n\n\t\toptions.enter(fn)\n\t\tconst reactionCleanup = withEffect(effectStopped ? undefined : runEffect, () =>\n\t\t\tfn(dep, ...args)\n\t\t) as undefined | ScopedCallback\n\t\toptions.leave(fn)\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}\n\t}\n\t// Mark the runEffect callback with the original function as its root\n\tmarkWithRoot(runEffect, fn)\n\n\t// Run the effect immediately\n\tif (!batchedEffects) {\n\t\thasEffect(runEffect)\n\t} else {\n\t\tconst oldBatchedEffects = batchedEffects\n\t\ttry {\n\t\t\t// Simulate a hasEffect who batches, but do not execute the batch, give it back to the parent batch,\n\t\t\t// Only the immediate effect has to be executed, the sub-effects will be executed by the parent batch\n\t\t\tbatchedEffects = new Map([[fn, runEffect]])\n\t\t\trunEffect()\n\t\t\tbatchedEffects.delete(fn)\n\t\t\tfor (const [root, effect] of batchedEffects!) oldBatchedEffects.set(root, effect)\n\t\t} finally {\n\t\t\tbatchedEffects = oldBatchedEffects\n\t\t}\n\t}\n\n\tconst mainCleanup = (): void => {\n\t\tif (effectStopped) return\n\t\teffectStopped = true\n\t\tcleanup?.()\n\t\t// Invoke all child cleanups (recursive via subEffectCleanup calling its own mainCleanup)\n\t\tconst children = effectChildren.get(runEffect)\n\t\tif (children) {\n\t\t\tfor (const childCleanup of children) childCleanup()\n\t\t\teffectChildren.delete(runEffect)\n\t\t}\n\n\t\tfr.unregister(mainCleanup)\n\t}\n\n\t// Only ROOT effects are registered for GC cleanup\n\tif (!parentEffect) {\n\t\tconst callIfCollected = () => mainCleanup()\n\t\tfr.register(callIfCollected, mainCleanup, callIfCollected)\n\t\treturn callIfCollected\n\t}\n\t// TODO: parentEffect = last non-undefined activeEffect\n\t// Register this effect to be cleaned up with the parent effect\n\tlet children = effectChildren.get(parentEffect)\n\tif (!children) {\n\t\tchildren = new Set()\n\t\teffectChildren.set(parentEffect, children)\n\t}\n\tconst parent = parentEffect\n\tconst subEffectCleanup = (): void => {\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\tmainCleanup()\n\t}\n\tchildren.add(subEffectCleanup)\n\treturn subEffectCleanup\n}\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 nonReactive<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\n/**\n * Set of functions to test if an object is immutable\n */\nexport const immutables = new Set<(tested: any) => boolean>()\n\n/**\n * Check if an object is marked as non-reactive (for testing purposes)\n * @param obj - The object to check\n * @returns true if the object is marked as non-reactive\n */\nexport function isNonReactive(obj: any): boolean {\n\t// Don't make primitives reactive\n\tif (obj === null || typeof obj !== 'object') return true\n\n\t// Check if the object itself is marked as non-reactive\n\tif (nonReactiveObjects.has(obj)) return true\n\n\t// Check if the object has the non-reactive symbol\n\tif (obj[nonReactiveMark]) return true\n\n\t// Check if the object is immutable\n\tif (Array.from(immutables).some((fn) => fn(obj))) return true\n\n\treturn false\n}\n\n/**\n * Mark a class as non-reactive. All instances of this class will automatically be non-reactive.\n * @param cls - The class constructor to mark as non-reactive\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\nnonReactiveClass(Date, RegExp, Error, Promise, Function)\nif (typeof window !== 'undefined') nonReactive(window, document)\nif (typeof Element !== 'undefined') nonReactiveClass(Element, Node)\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\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 */\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 (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\n/**\n * Check if an object is an object (not null, not primitive)\n */\nfunction isObject(obj: any): obj is object {\n\treturn obj !== null && typeof obj === 'object'\n}\n","import { decorator, GenericClassDecorator } from '../decorator'\nimport { renamed } from '../utils'\nimport {\n\ttype DependencyFunction,\n\tdeepWatch,\n\tdependant,\n\teffect,\n\tgetRoot,\n\tisNonReactive,\n\tmarkWithRoot,\n\tnonReactiveClass,\n\tnonReactiveMark,\n\tnonReactiveObjects,\n\toptions,\n\ttype ScopedCallback,\n\ttouched1,\n\tunreactiveProperties,\n\tuntracked,\n\tunwrap,\n\twithEffect,\n} from './core'\n\n//#region computed\nlet computedInvalidations: (() => void)[] | undefined\n/**\n * When used in a computed property computation, it will register the callback to be called when the computed property is invalidated\n * @param cb - The callback to register\n * @param warn - Whether to warn if used outside of a computed property\n */\nexport function invalidateComputed(cb: () => void, warn = true) {\n\tif (computedInvalidations) computedInvalidations.push(cb)\n\telse if (warn) options.warn('Using `invalidateComputed` outside of a computed property')\n}\ntype ComputedFunction<T> = (dep: DependencyFunction) => T\nconst computedCache = new WeakMap<ComputedFunction<any>, any>()\nfunction computedFunction<T>(getter: ComputedFunction<T>): T {\n\tconst key = getRoot(getter)\n\tlet invalidations: (() => void)[] = []\n\tdependant(computedCache, key)\n\tif (computedCache.has(key)) return computedCache.get(key)\n\twithEffect(undefined, () => {\n\t\tconst stop = effect(\n\t\t\tmarkWithRoot((dep) => {\n\t\t\t\tconst oldCI = computedInvalidations\n\t\t\t\tif (computedCache.has(key)) {\n\t\t\t\t\t// This should *not* be called in the cleanup chain, as its effects would be lost and cleaned-up\n\t\t\t\t\tfor (const cb of invalidations) cb()\n\t\t\t\t\tinvalidations = []\n\t\t\t\t\tcomputedCache.delete(key)\n\t\t\t\t\ttouched1(computedCache, { type: 'set', prop: key }, key)\n\t\t\t\t\tstop()\n\t\t\t\t} else\n\t\t\t\t\ttry {\n\t\t\t\t\t\tcomputedInvalidations = invalidations\n\t\t\t\t\t\tcomputedCache.set(key, getter(dep))\n\t\t\t\t\t} finally {\n\t\t\t\t\t\tcomputedInvalidations = oldCI\n\t\t\t\t\t}\n\t\t\t}, getter)\n\t\t)\n\t})\n\treturn computedCache.get(key)\n}\n\n/**\n * Get the cached value of a computed function - cache is invalidated when the dependencies change\n */\nexport const computed = decorator({\n\tgetter(original, propertyKey) {\n\t\tconst computers = new WeakMap<any, () => any>()\n\t\treturn function (this: any) {\n\t\t\tif (!computers.has(this)) {\n\t\t\t\tcomputers.set(\n\t\t\t\t\tthis,\n\t\t\t\t\trenamed(\n\t\t\t\t\t\t() => original.call(this),\n\t\t\t\t\t\t`${String(this.constructor.name)}.${String(propertyKey)}`\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t}\n\t\t\treturn computedFunction(computers.get(this)!)\n\t\t}\n\t},\n\tdefault<T>(getter: ComputedFunction<T>): T {\n\t\treturn computedFunction(getter)\n\t},\n})\n\n//#endregion\n\n//#region watch\n\nconst unsetYet = Symbol('unset-yet')\nexport interface WatchOptions {\n\timmediate?: boolean\n\tdeep?: boolean\n}\nexport function watch<T>(\n\tvalue: (dep: DependencyFunction) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep?: false }\n): ScopedCallback\nexport function watch<T extends object | any[]>(\n\tvalue: (dep: DependencyFunction) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep: true }\n): ScopedCallback\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: DependencyFunction) => 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'\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(\n\t\tmarkWithRoot(() => {\n\t\t\tdependant(value)\n\t\t\tif (immediate) untracked(() => changed(value))\n\t\t\timmediate = true\n\t\t}, changed)\n\t)\n}\n\nfunction watchCallBack<T>(\n\tvalue: (dep: DependencyFunction) => 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((dep) => {\n\t\t\tconst newValue = value(dep)\n\t\t\tif (oldValue !== newValue)\n\t\t\t\tuntracked(\n\t\t\t\t\tmarkWithRoot(() => {\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\tmarkWithRoot((value) => changed(value as T, value as T), changed)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t}\n\t\t\t\t\t}, changed)\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\tfor (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}\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\nimport { profileInfo } from './core'\n\nObject.assign(profileInfo, { computedCache })\n","import { Indexable } from '../indexable'\nimport {\n\tdependant,\n\tmakeReactiveEntriesIterator,\n\tmakeReactiveIterator,\n\tprototypeForwarding,\n\treactive,\n\ttouched,\n} from './core'\n\nconst native = Symbol('native')\nconst isArray = Array.isArray\nArray.isArray = ((value: any) =>\n\t// biome-ignore lint/suspicious/useIsArray: We are defining it\n\tisArray(value) || (value instanceof Array && native in value)) as any\nclass ReactiveBaseArray {\n\tdeclare readonly [native]: any[]\n}\nfunction* index(i: number, { length = true } = {}): IterableIterator<number | 'length'> {\n\tyield i\n\tif (length) yield 'length'\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\tfor (let i = start; i <= end; i++) yield i\n\tif (length) yield 'length'\n}\nexport class ReactiveArray extends Indexable(ReactiveBaseArray, {\n\tget(i: number): any {\n\t\tdependant(this[native], 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[native], { type: 'bunch', method: 'set' }, index(i, { length: added }))\n\t},\n\tgetLength() {\n\t\tdependant(this[native], '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(\n\t\t\t\tthis[native],\n\t\t\t\t{ type: 'set', prop: 'length' },\n\t\t\t\trange(oldLength, value, { length: true })\n\t\t\t)\n\t\t}\n\t},\n}) {\n\tdeclare length: number\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\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\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\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[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\ttry {\n\t\t\treturn this[native].sort(compareFn) 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\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)\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\treturn this[native].indexOf(searchElement, fromIndex)\n\t}\n\n\tlastIndexOf(searchElement: any, fromIndex?: number): number {\n\t\tdependant(this)\n\t\treturn this[native].lastIndexOf(searchElement, fromIndex)\n\t}\n\n\tincludes(searchElement: any, fromIndex?: number): boolean {\n\t\tdependant(this)\n\t\treturn this[native].includes(searchElement, fromIndex)\n\t}\n\n\tfind(\n\t\tpredicate: (this: any, value: any, index: number, obj: any[]) => boolean,\n\t\tthisArg?: any\n\t): any {\n\t\tdependant(this)\n\t\treturn reactive(this[native].find(predicate, thisArg))\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\t\tdependant(this)\n\t\treturn this[native].findIndex(predicate, thisArg)\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(this[native].filter(callbackfn as any, thisArg))\n\t}\n\n\tmap(callbackfn: (value: any, index: number, array: any[]) => any, thisArg?: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].map(callbackfn as any, thisArg))\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(callbackfn as any, thisArg)\n\t}\n\n\t// TODO: re-implement for fun dependencies? (eg - every only check the first ones until it find some)\n\tevery(callbackfn: (value: any, index: number, array: any[]) => boolean, thisArg?: any): boolean {\n\t\tdependant(this)\n\t\treturn this[native].every(callbackfn as any, thisArg)\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(callbackfn as any, thisArg)\n\t}\n}\n","import {\n\tdependant,\n\tmakeReactiveEntriesIterator,\n\tmakeReactiveIterator,\n\tprototypeForwarding,\n\treactive,\n\ttouched,\n\ttouched1,\n} from './core'\n\nconst native = Symbol('native')\n\n// TODO: [prototypeForwarding]\n\nexport class ReactiveWeakMap<K extends object, V> {\n\tdeclare readonly [native]: WeakMap<K, V>\n\tdeclare readonly 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('content') },\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\t// Trigger effects for the specific key\n\t\ttouched1(this.content, { type: this[native].has(key) ? 'set' : 'add', prop: key }, key)\n\t\tthis[native].set(key, value)\n\n\t\treturn this\n\t}\n}\n\nexport class ReactiveMap<K, V> {\n\tdeclare readonly [native]: Map<K, V>\n\tdeclare readonly 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('content') },\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\tconst evolution = { type: hadKey ? 'set' : 'add', 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 this\n\t}\n}\n","import {\n\tdependant,\n\tmakeReactiveEntriesIterator,\n\tmakeReactiveIterator,\n\tprototypeForwarding,\n\treactive,\n\ttouched,\n\ttouched1,\n} from './core'\n\nconst native = Symbol('native')\n\n// TODO: [prototypeForwarding]\n\nexport class ReactiveWeakSet<T extends object> {\n\tdeclare readonly [native]: WeakSet<T>\n\tdeclare readonly 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('content') },\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\nexport class ReactiveSet<T> {\n\tdeclare readonly [native]: Set<T>\n\tdeclare readonly 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('content') },\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 {\n\teffect,\n\tgetState,\n\timmutables,\n\tisNonReactive,\n\tisReactive,\n\toptions as reactiveOptions,\n\tprofileInfo,\n\tReactiveBase,\n\tReactiveError,\n\treactive,\n\ttype ScopedCallback,\n\tuntracked,\n\tunwrap,\n} from './core'\nexport { computed, invalidateComputed, unreactive, watch } from './interface'\n\nimport { ReactiveArray } from './array'\nimport { registerNativeReactivity } from './core'\nimport { ReactiveMap, ReactiveWeakMap } from './map'\nimport { ReactiveSet, ReactiveWeakSet } from './set'\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","import { decorator, 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 }[] = []\nexport const cached = decorator({\n\tgetter(original, 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\nexport function isCached(object: Object, propertyKey: PropertyKey) {\n\treturn !!Object.getOwnPropertyDescriptor(object, propertyKey)\n}\n\nexport function cache(object: Object, propertyKey: PropertyKey, value: any) {\n\tObject.defineProperty(object, propertyKey, { value })\n}\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\nexport const deprecated = Object.assign(\n\tdecorator({\n\t\tmethod(original, 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, 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, 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, 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, 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, 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\nexport function debounce(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _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\nexport function throttle(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _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 class Eventful<Events extends Record<string, (...args: any[]) => void>> {\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"],"names":["nativeConstructors","Set","Object","Array","Date","Function","Map","WeakMap","WeakSet","Promise","Error","TypeError","ReferenceError","SyntaxError","RangeError","URIError","EvalError","Reflect","Proxy","RegExp","String","Number","Boolean","isConstructor","fn","has","toString","startsWith","renamed","fct","name","defineProperties","value","DecoratorError","constructor","message","super","this","legacyDecorator","description","target","propertyKey","descriptor","args","undefined","class","includes","newGetter","getter","get","newSetter","setter","set","newMethod","method","default","call","modernDecorator","context","kind","rv","decorator","contextOrKey","mode","_target","detectDecoratorMode","fr","FinalizationRegistry","f","destructor","Symbol","allocatedValues","DestructionError","msg","destroyedHandler","toStringTag","throw","allocated","original","getAt","setAt","Indexable","base","accessor","index","setPrototypeOf","prototype","prop","receiver","getOwnPropertyDescriptor","getLength","numProp","isNaN","setLength","defineProperty","writable","enumerable","configurable","effectToReactiveObjects","objectToProxy","proxyToObject","objectParents","objectsWithDeepWatchers","deepWatchers","effectToDeepWatchedObjects","nonReactiveObjects","makeReactiveIterator","iterator","result","next","done","reactive","makeReactiveEntriesIterator","key","watchers","profileInfo","nativeReactive","nonReactiveMark","unreactiveProperties","prototypeForwarding","allProps","rootFunction","markWithRoot","root","getRoot","ReactiveError","options","enter","effect","leave","chain","caller","maxEffectChain","maxDeepWatchDepth","instanceMembers","warn","raiseDeps","objectWatchers","keyChains","keys","deps","from","hasEffect","touched1","obj","evolution","touched","props","unwrap","state","getState","assign","states","addState","bubbleUpChange","dependant","activeEffect","add","effectObjects","parentEffect","batchedEffects","runEffects","size","length","entries","push","delete","withEffect","keepParent","oldActiveEffect","oldParentEffect","addBackReference","child","parent","parents","removeBackReference","needsBackReferences","hasParentWithDeepWatchers","changedObject","parentDeepWatchers","watcher","reactiveHandlers","absent","hasOwn","reactiveValue","isArrayCase","newValue","oldVal","oldPresent","track1","type","deleteProperty","getPrototypeOf","proto","ownKeys","reactiveClasses","ReactiveBase","reactiveObject","anyTarget","isNonReactive","proxied","proxy","Reactive","untracked","effectChildren","cleanup","dep","cb","runEffect","effectStopped","reactionCleanup","reactiveObj","oldBatchedEffects","mainCleanup","children","childCleanup","unregister","callIfCollected","register","subEffectCleanup","immutables","some","nonReactiveClass","cls","c","registerNativeReactivity","originalClass","reactiveClass","deepWatch","callback","immediate","wrappedCallback","visited","traverseAndTrack","depth","isObject","isArray","i","_key","computedInvalidations","window","o","nonReactive","document","Element","Node","computedCache","computedFunction","invalidations","stop","oldCI","computed","computers","unsetYet","deepNonReactive","unreactive","arg1","arg","native","ReactiveBaseArray","range","a","b","start","Math","min","end","max","ReactiveArray","added","oldLength","native$2","at","actualIndex","items","pop","shift","unshift","splice","deleteCount","reverse","sort","compareFn","fill","copyWithin","toReversed","toSorted","toSpliced","with","values","nativeIterator","indexOf","searchElement","fromIndex","lastIndexOf","find","predicate","thisArg","findIndex","flat","flatMap","callbackfn","filter","map","reduce","initialValue","reduceRight","slice","concat","join","separator","forEach","every","ReactiveMap","native$1","content","clear","hadEntries","hadKey","oldValue","ReactiveSet","had","res","syncCalculating","cached","alreadyCalculating","object","cache","deprecated","apply","destructorObj","_a","destroy","destructors","getOwnPropertyNames","isDestroyable","myDestructor","destruction","_Eventful_events","_Eventful_hooks","hook","__classPrivateFieldGet","on","eventOrEvents","e","callbacks","off","emit","event","called","forward","delay","_propertyKey","timeoutId","clearTimeout","setTimeout","properties","Base","lastCallTime","now","remainingTime","scheduledArgs","changed","deep","deepCleanup","cbCleanup","watchCallBack","watchObject","minLength","arr","tuple"],"mappings":"4OAiBA,MAAMA,EAAqB,IAAIC,IAAc,CAC5CC,OACAC,MACAC,KACAC,SACAJ,IACAK,IACAC,QACAC,QACAC,QACAC,MACAC,UACAC,eACAC,YACAC,WACAC,SACAC,UACAC,QACAC,MACAC,OACAC,OACAC,OACAC,UAEK,SAAUC,EAAcC,GAC7B,OAAOA,IAAOxB,EAAmByB,IAAID,IAAOA,EAAGE,WAAWC,WAAW,UACtE,CAEM,SAAUC,EAA4BC,EAAQC,GACnD,OAAO5B,OAAO6B,iBAAiBF,EAAK,CACnCC,KAAM,CACLE,MAAOF,IAGV,CC9CM,MAAOG,UAAuBvB,MACnC,WAAAwB,CAAYC,GACXC,MAAMD,GACNE,KAAKP,KAAO,oBACb,EAkFK,SAAUQ,EAAyBC,GACxC,OAAO,SACNC,EACAC,EACAC,KACGC,GAEH,QAAoBC,IAAhBH,GACH,GAAIlB,EAAciB,GAAS,CAC1B,KAAM,UAAWD,GAAc,MAAM,IAAI7B,MAAM,0CAC/C,OAAO6B,EAAYM,QAAQL,EAC5B,OACM,GAAsB,iBAAXA,GAAuB,CAAC,SAAU,UAAUM,gBAAgBL,GAAc,CAC3F,IAAKC,EAAY,MAAM,IAAIhC,MAAM,0CAC5B,GAA0B,iBAAfgC,GAA2B,iBAAkBA,EAAY,CACxE,GAAI,QAASA,GAAc,QAASA,EAAY,CAC/C,KAAM,WAAYH,MAAe,WAAYA,GAC5C,MAAM,IAAI7B,MAAM,qDACjB,GAAI,WAAY6B,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,SAASN,EAAWO,IAAKR,GACnDM,IAAWL,EAAWO,IAAMF,EACjC,CACA,GAAI,WAAYR,EAAa,CAC5B,MAAMW,EAAYX,EAAYY,SAAST,EAAWU,IAAKX,GACnDS,IAAWR,EAAWU,IAAMF,EACjC,CACA,OAAOR,CACR,CAAO,GAAgC,mBAArBA,EAAWV,MAAsB,CAClD,KAAM,WAAYO,GAAc,MAAM,IAAI7B,MAAM,2CAChD,MAAM2C,EAAYd,EAAYe,SAASZ,EAAWV,MAAOS,GAEzD,OADIY,IAAWX,EAAWV,MAAQqB,GAC3BX,CACR,CACD,CACD,CACA,KAAM,YAAaH,GAClB,MAAM,IAAI7B,MAAM,kDACjB,OAAO6B,EAAYgB,QAAQC,KAAKnB,KAAMG,EAAQC,EAAaC,KAAeC,EAC3E,CACD,CAEM,SAAUc,EAAyBlB,GACxC,OAAO,SAAUC,EAAakB,KAA+Bf,GAC5D,IAAKe,GAASC,MAAgC,iBAAjBD,EAAQC,KAAmB,CACvD,KAAM,YAAapB,GAClB,MAAM,IAAI7B,MAAM,kDACjB,OAAO6B,EAAYgB,QAAQC,KAAKnB,KAAMG,EAAQkB,KAAYf,EAC3D,CACA,OAAQe,EAAQC,MACf,IAAK,QACJ,KAAM,UAAWpB,GAAc,MAAM,IAAI7B,MAAM,0CAC/C,OAAO6B,EAAYM,QAAQL,GAC5B,IAAK,QACJ,MAAM,IAAI9B,MAAM,0CACjB,IAAK,SACJ,KAAM,WAAY6B,GAAc,MAAM,IAAI7B,MAAM,2CAChD,OAAO6B,EAAYS,SAASR,EAAQkB,EAAQ5B,MAC7C,IAAK,SACJ,KAAM,WAAYS,GAAc,MAAM,IAAI7B,MAAM,2CAChD,OAAO6B,EAAYY,SAASX,EAAQkB,EAAQ5B,MAC7C,IAAK,SACJ,KAAM,WAAYS,GAAc,MAAM,IAAI7B,MAAM,2CAChD,OAAO6B,EAAYe,SAASd,EAAQkB,EAAQ5B,MAC7C,IAAK,WAAY,CAChB,KAAM,WAAYS,MAAe,WAAYA,GAC5C,MAAM,IAAI7B,MAAM,qDACjB,MAAMkD,EAAsD,CAAA,EAC5D,GAAI,WAAYrB,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,SAASR,EAAOS,IAAKS,EAAQ5B,MACvDiB,IAAWa,EAAGX,IAAMF,EACzB,CACA,GAAI,WAAYR,EAAa,CAC5B,MAAMW,EAAYX,EAAYY,SAASX,EAAOY,IAAKM,EAAQ5B,MACvDoB,IAAWU,EAAGR,IAAMF,EACzB,CACA,OAAOU,CACR,EAGF,CACD,CAuBO,MAAMC,EAAoCtB,GAChD,CAASC,EAAasB,KAAuBnB,KAC5C,MAAMoB,EAnBR,SACCC,EACAF,GAKA,MACyB,iBAAjBA,GACU,OAAjBA,GAC6B,iBAAtBA,EAAaH,KAEb,SAED,QACR,CAIeM,CAAoBzB,EAAQsB,EAAcnB,EAAK,IAC5D,MAAgB,WAAToB,EACJN,EAAgBlB,EAAhBkB,CAA6BjB,EAAQsB,KAAiBnB,GACtDL,EAAgBC,EAAhBD,CAA6BE,EAAQsB,KAAiBnB,EACzD,ECrMIuB,EAAK,IAAIC,qBAAkCC,GAAMA,KAC1CC,EAAaC,OAAO,cACpBC,EAAkBD,OAAO,aAChC,MAAOE,UAAyB9D,MACrC,YAAO,CAAiB+D,GACvB,MAAO,KACN,MAAM,IAAID,EAAiBC,GAE7B,CACA,WAAAvC,CAAYuC,GACXrC,MAAM,wBAAwBqC,KAC9BpC,KAAKP,KAAO,sBACb,EAED,MAAM4C,EAAmB,CACxB,CAACJ,OAAOK,aAAc,oBACtB1B,IAAKuB,EAAiBI,MAAM,kCAC5BxB,IAAKoB,EAAiBI,MAAM,mCAiHtB,MAAMC,EAAYhB,EAAU,CAClCV,OAAM,CAAC2B,EAAUrC,IACT,SAAUT,GAEhB,OADAK,KAAKkC,GAAiB9B,GAAeT,EAC9B8C,EAAStB,KAAKnB,KAAML,EAC5B,2YC1IW+C,EAAQT,OAAO,SACfU,EAAQV,OAAO,SAoCtB,SAAUW,EACfC,EACAC,GAEID,GAAwB,mBAATA,IAClBC,EAAWD,EACXA,OAAOtC,GAEHsC,IAEJA,EAAO,SAEHC,IACJA,EAAW,CACV,GAAAlC,CAAemC,GACd,GAA2B,mBAAhB/C,KAAK0C,GACf,MAAM,IAAIrE,MAAM,+CAEjB,OAAO2B,KAAK0C,GAAOK,EACpB,EACA,GAAAhC,CAAegC,EAAepD,GAC7B,GAA2B,mBAAhBK,KAAK2C,GACf,MAAM,IAAItE,MAAM,sDAEjB2B,KAAK2C,GAAOI,EAAOpD,EACpB,IAIF,MAAeiD,UAAmBC,GAsDlC,OAlDAhF,OAAOmF,eACNJ,EAAUK,UACV,IAAIpE,MAAOgE,EAAcI,UAAW,CAEnC,CAAChB,OAAOK,aAAc,kBACtB,GAAA1B,CAAIT,EAAQ+C,EAAMC,GACjB,GAAID,KAAQ/C,EAAQ,CACnB,MAAMQ,EAAS9C,OAAOuF,yBAAyBjD,EAAQ+C,IAAOtC,IAC9D,OAAOD,EAASA,EAAOQ,KAAKgC,GAAYhD,EAAO+C,EAChD,CACA,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqBJ,EAASO,UAAW,OAAOP,EAASO,UAAUlC,KAAKgC,GAC5E,MAAMG,EAAUtE,OAAOkE,GACvB,IAAKlE,OAAOuE,MAAMD,GACjB,OAAOR,EAASlC,IAAKO,KAAKgC,EAAUG,EAEtC,CAED,EACA,GAAAvC,CAAIZ,EAAQ+C,EAAMvD,EAAOwD,GACxB,GAAID,KAAQ/C,EAAQ,CACnB,MAAMW,EAASjD,OAAOuF,yBAAyBjD,EAAQ+C,IAAOnC,IAG9D,OAFID,EAAQA,EAAOK,KAAKgC,EAAUxD,GAC7BQ,EAAO+C,GAAQvD,GACb,CACR,CACA,GAAoB,iBAATuD,EAAmB,CAC7B,GAAa,WAATA,GAAqBJ,EAASU,UAEjC,OADAV,EAASU,UAAUrC,KAAKgC,EAAUxD,IAC3B,EAER,MAAM2D,EAAUtE,OAAOkE,GACvB,IAAKlE,OAAOuE,MAAMD,GAAU,CAC3B,IAAKR,EAAS/B,IACb,MAAM,IAAI1C,MAAM,sDAGjB,OADAyE,EAAS/B,IAAKI,KAAKgC,EAAUG,EAAS3D,IAC/B,CACR,CACD,CAOA,OANA9B,OAAO4F,eAAeN,EAAUD,EAAM,CACrCvD,QACA+D,UAAU,EACVC,YAAY,EACZC,cAAc,KAER,CACR,KAGKhB,CACR,CC1FA,MAAMiB,EAA0B,IAAI3F,QAG9B4F,EAAgB,IAAI5F,QACpB6F,EAAgB,IAAI7F,QAGpB8F,EAAgB,IAAI9F,QAGpB+F,EAA0B,IAAI9F,QAG9B+F,EAAe,IAAIhG,QAGnBiG,EAA6B,IAAIjG,QAG1BkG,EAAqB,IAAIjG,QAKhC,SAAWkG,EAAwBC,GACxC,IAAIC,EAASD,EAASE,OACtB,MAAQD,EAAOE,YACRC,GAASH,EAAO5E,OACtB4E,EAASD,EAASE,MAEpB,CAKM,SAAWG,EAAkCL,GAClD,IAAIC,EAASD,EAASE,OACtB,MAAQD,EAAOE,MAAM,CACpB,MAAOG,EAAKjF,GAAS4E,EAAO5E,WACtB,CAAC+E,GAASE,GAAMF,GAAS/E,IAC/B4E,EAASD,EAASE,MACnB,CACD,CAGA,MAAMK,EAAW,IAAI3G,QAER4G,EAAmB,CAC/BhB,gBACAC,gBACAF,0BACAgB,WACAb,gBACAC,0BACAC,eACAC,6BACAC,sBAGKW,EAAiB9C,OAAO,mBAGjB+C,EAAkB/C,OAAO,gBAEzBgD,EAAuBhD,OAAO,yBAC9BiD,EAAqCjD,OAAO,wBAE5CkD,EAAWlD,OAAO,aAGzBmD,EAAenD,OAAO,iBAQtB,SAAUoD,EAAiClG,EAAOmG,GAEvD,OAAOzH,OAAO4F,eAAetE,EAAIiG,EAAc,CAC9CzF,MAAO4F,EAAQD,GACf5B,UAAU,GAEZ,CAOM,SAAU6B,EAAwCpG,GACvD,OAAQA,IAAaiG,IAAiBjG,CACvC,CAEM,MAAOqG,UAAsBnH,MAClC,WAAAwB,CAAYC,GACXC,MAAMD,GACNE,KAAKP,KAAO,eACb,EAOM,MAAMgG,EAAU,CAKtBC,MAAQC,MAKRC,MAAQD,MAMRE,MAAO,CAAC1F,EAAkB2F,OAM1BC,eAAgB,IAMhBC,kBAAmB,IAMnBC,iBAAiB,EAEjBC,KAAM,IAAI5F,QAMX,SAAS6F,EAAUC,KAAkDC,GACpE,IAAK,MAAMC,KAAQD,EAClB,IAAK,MAAMzB,KAAO0B,EAAM,CACvB,MAAMC,EAAOH,EAAexF,IAAIgE,GAChC,GAAI2B,EAAM,IAAK,MAAMZ,KAAU7H,MAAM0I,KAAKD,GAAOE,EAAUd,EAC5D,CACF,UAEgBe,EAASC,EAAUC,EAAsB1D,GACxD2D,EAAQF,EAAKC,EAAW,CAAC1D,GAC1B,UAEgB2D,EAAQF,EAAUC,EAAsBE,IAiBxD,SAAkBH,EAAUC,GAC3BD,EAAMI,GAAOJ,GACb,MAAMnC,EAAO,CAAA,EACPwC,EAAQC,EAASN,GACnBK,GAAOnJ,OAAOqJ,OAAOF,EAAO,CAAEJ,YAAWpC,SAC7C2C,EAAOpG,IAAI4F,EAAKnC,EACjB,CArBC4C,CADAT,EAAMI,GAAOJ,GACCC,GACd,MAAMR,EAAiBvB,EAASjE,IAAI+F,GAChCP,IACCU,EAAOX,EAAUC,EAAgB,CAACjB,GAAW2B,GAC5CX,EAAUC,EAAgBA,EAAeE,SAI3CrC,EAAwB7E,IAAIuH,IAC/BU,GAAeV,EAEjB,CAEA,MAAMQ,EAAS,IAAIjJ,QAUb,SAAU+I,EAASN,GACxBA,EAAMI,GAAOJ,GACb,IAAIK,EAAQG,EAAOvG,IAAI+F,GAKvB,OAJKK,IACJA,EAAQ,CAAA,EACRG,EAAOpG,IAAI4F,EAAKK,IAEVA,CACR,UAEgBM,EAAUX,EAAUzD,EAAYiC,GAG/C,GADAwB,EAAMI,GAAOJ,GACTY,IAAiC,iBAATrE,GAAqBA,IAASiC,GAAW,CACpE,IAAIiB,EAAiBvB,EAASjE,IAAI+F,GAC7BP,IACJA,EAAiB,IAAInI,IACrB4G,EAAS9D,IAAI4F,EAAKP,IAEnB,IAAIG,EAAOH,EAAexF,IAAIsC,GACzBqD,IACJA,EAAO,IAAI3I,IACXwI,EAAerF,IAAImC,EAAMqD,IAE1BA,EAAKiB,IAAID,GAGT,IAAIE,EAAgB5D,EAAwBjD,IAAI2G,GAC3CE,IACJA,EAAgB,IAAI7J,IACpBiG,EAAwB9C,IAAIwG,EAAcE,IAE3CA,EAAcD,IAAIb,EACnB,CACD,CAGA,IAAIY,EAEAG,EAIAC,EAIJ,SAASlB,EAAUd,GAClB,MAAML,EAAOC,EAAQI,GAGrB,GADAF,GAASI,MAAMN,EAAQI,GAASJ,EAAQgC,IACpCI,EAAgBA,EAAe5G,IAAIuE,EAAMK,OACxC,CACJ,MAAMiC,EAAoB,GAC1BD,EAAiB,IAAI1J,IAA8B,CAAC,CAACqH,EAAMK,KAC3D,IACC,KAAOgC,EAAeE,MAAM,CAC3B,GAAID,EAAWE,OAASrC,EAAQM,eAC/B,MAAM,IAAIP,EAAc,uCACzB,MAAOF,EAAMK,GAAUgC,EAAeI,UAAUvD,OAAO7E,MACvDiI,EAAWI,KAAK1C,GAChBK,IACAgC,EAAeM,OAAO3C,EACvB,CACD,SACCqC,OAAiBpH,CAClB,CACD,CACD,UAEgB2H,EACfvC,EACAxG,EACAgJ,GAEA,GAAI5C,EAAQI,KAAYJ,EAAQgC,GAAe,OAAOpI,IACtD,MAAMiJ,EAAkBb,EAClBc,EAAkBX,EACxBH,EAAe5B,EACVwC,IAAYT,EAAe/B,GAChC,IACC,OAAOxG,GACR,SACCoI,EAAea,EACfV,EAAeW,CAChB,CACD,CASA,SAASC,EAAiBC,EAAeC,EAAgBtF,GACxD,IAAIuF,EAAUzE,EAAcpD,IAAI2H,GAC3BE,IACJA,EAAU,IAAI7K,IACdoG,EAAcjD,IAAIwH,EAAOE,IAE1BA,EAAQjB,IAAI,CAAEgB,SAAQtF,QACvB,CAKA,SAASwF,GAAoBH,EAAeC,EAAgBtF,GAC3D,MAAMuF,EAAUzE,EAAcpD,IAAI2H,GAC9BE,IACHA,EAAQR,OAAO,CAAEO,SAAQtF,SACJ,IAAjBuF,EAAQZ,MACX7D,EAAciE,OAAOM,GAGxB,CAKA,SAASI,GAAoBhC,GAC5B,OAAO1C,EAAwB7E,IAAIuH,IAAQiC,GAA0BjC,EACtE,CAKA,SAASiC,GAA0BjC,GAClC,MAAM8B,EAAUzE,EAAcpD,IAAI+F,GAClC,IAAK8B,EAAS,OAAO,EAErB,IAAK,MAAMD,OAAEA,KAAYC,EAAS,CACjC,GAAIxE,EAAwB7E,IAAIoJ,GAAS,OAAO,EAChD,GAAII,GAA0BJ,GAAS,OAAO,CAC/C,CACA,OAAO,CACR,CAKA,SAASnB,GAAewB,EAAuBjC,GAC9C,MAAM6B,EAAUzE,EAAcpD,IAAIiI,GAClC,GAAKJ,EAEL,IAAK,MAAMD,OAAEA,KAAYC,EAAS,CAEjC,MAAMK,EAAqB5E,EAAatD,IAAI4H,GAC5C,GAAIM,EAAoB,IAAK,MAAMC,KAAWD,EAAoBrC,EAAUsC,GAG5E1B,GAAemB,EAChB,CACD,CAqBA,MAAMQ,GAAmB,CACxB,CAAC/G,OAAOK,aAAc,iBACtB,GAAA1B,CAAI+F,EAAUzD,EAAmBC,GAChC,GAAID,IAAS8B,EAAiB,OAAO,EAErC,GAAI2B,EAAI1B,IAAuB7F,IAAI8D,IAAyB,iBAATA,EAClD,OAAOtE,QAAQgC,IAAI+F,EAAKzD,EAAMC,GAC/B,MAAM8F,IAAW/F,KAAQyD,KAEpBlB,EAAQQ,iBAAmBpI,OAAOqL,OAAO/F,EAAUD,IAAS+F,IAAQ3B,EAAUX,EAAKzD,GAExF,MAAMvD,EAAQf,QAAQgC,IAAI+F,EAAKzD,EAAMC,GACrC,GAAqB,iBAAVxD,GAAgC,OAAVA,EAAgB,CAChD,MAAMwJ,EAAgBzE,GAAS/E,GAO/B,OAJIgJ,GAAoBhC,IACvB2B,EAAiBa,EAAexC,EAAKzD,GAG/BiG,CACR,CACA,OAAOxJ,CACR,EACA,GAAAoB,CAAI4F,EAAUzD,EAAmBvD,EAAYwD,GAE5C,GAAIwD,EAAI1B,IAAuB7F,IAAI8D,GAAO,OAAOtE,QAAQmC,IAAI4F,EAAKzD,EAAMvD,EAAOwD,GAE/E,MAAMiG,EACLlE,KAAuByB,GAEvBA,EAAIzB,aAAgCpH,SAClCkB,OAAOuE,MAAMvE,OAAOkE,KAAmB,WAATA,GAC3BmG,EAAWtC,GAAOpH,GAExB,GAAIyJ,EAEH,OADEzC,EAAYzD,GAAQmG,GACf,EAGR,MAAMC,EAAU3C,EAAYzD,GACtBqG,EAAarG,KAAQyD,EAQ3B,OApEI,SAAiBA,EAAazD,EAAWoG,EAAaD,GAEvDpF,EAAwB7E,IAAIuH,KAET,iBAAX2C,GAAkC,OAAXA,GACjCZ,GAAoBY,EAAQ3C,EAAKzD,GAIV,iBAAbmG,GAAsC,OAAbA,IAEnCf,EADsB5D,GAAS2E,GACC1C,EAAKzD,EAIxC,CA8CEsG,CAAO7C,EAAKzD,EAAMoG,EAAQD,GAEtBC,IAAWD,IACdzK,QAAQmC,IAAI4F,EAAKzD,EAAMmG,EAAUlG,GAEjCuD,EAASC,EAAK,CAAE8C,KAAMF,EAAa,MAAQ,MAAOrG,QAAQA,KAEpD,CACR,EACA,cAAAwG,CAAe/C,EAAUzD,GACxB,IAAKrF,OAAOqL,OAAOvC,EAAKzD,GAAO,OAAO,EAEtC,MAAMoG,EAAU3C,EAAYzD,GAe5B,OAZIe,EAAwB7E,IAAIuH,IAA0B,iBAAX2C,GAAkC,OAAXA,GACrEZ,GAAoBY,EAAQ3C,EAAKzD,UAG1ByD,EAAYzD,GACpBwD,EAASC,EAAK,CAAE8C,KAAM,MAAOvG,QAAQA,GAGjCe,EAAwB7E,IAAIuH,IAC/BU,GAAeV,IAGT,CACR,EACAgD,eAAehD,GACVzB,KAAuByB,EAAYA,EAAIzB,GACpCrH,OAAO8L,eAAehD,GAE9B3D,eAAc,CAAC2D,EAAUiD,MACpB1E,KAAuByB,KAC3B9I,OAAOmF,eAAe2D,EAAKiD,IACpB,GAERC,QAAQlD,IACPW,EAAUX,EAAKxB,GACRvG,QAAQiL,QAAQlD,KAInBmD,GAAkB,IAAI3L,cACf4L,GACZ,WAAAlK,GAEC,OAAOiK,GAAgB1K,gBAAkBsF,GAAS1E,MAAQA,IAC3D,EAGD,SAASgK,GAAkBC,GAC1B,IAAKA,GAAkC,iBAAdA,EAAwB,OAAOA,EACxD,MAAM9J,EAAS8J,EAEf,GAAIlG,EAAc3E,IAAIe,IAAW+J,GAAc/J,GAAS,OAAOA,EAG/D,GAAI2D,EAAc1E,IAAIe,GAAS,OAAO2D,EAAclD,IAAIT,GAExD,MAAMgK,IACLpF,KAAkB5E,IAAYA,aAAkBA,EAAO4E,GAEpD5E,EADA,IAAIA,EAAO4E,GAAgB5E,GAE3BgK,IAAYhK,GAAQ4D,EAAchD,IAAIoJ,EAAShK,GACnD,MAAMiK,EAAQ,IAAIvL,MAAMsL,EAASnB,IAKjC,OAFAlF,EAAc/C,IAAIZ,EAAQiK,GAC1BrG,EAAchD,IAAIqJ,EAAOjK,GAClBiK,CACR,CAEO,MAAM1F,GAAWlD,EAAU,CACjC,MAAMiB,GACL,GAAIA,EAASQ,qBAAqB8G,GAEjC,OADAD,GAAgBtC,IAAI/E,GACbA,EAER,MAAM4H,UAAiB5H,EACtB,WAAA5C,IAAeS,GAQd,OAPAP,SAASO,gBACU+J,GAAaP,GAAgB1K,iBAC/CqG,EAAQS,KACP,GAAIzD,EAAiBhD,8BAA8BO,KAAKH,YAAYJ,6HAI/DiF,GAAS1E,KACjB,EAKD,OAHAnC,OAAO4F,eAAe4G,EAAU,OAAQ,CACvC1K,MAAO,YAAY8C,EAAShD,UAEtB4K,CACR,EACAzJ,IAAI6B,GACIuH,GAAevH,GAEvBvB,QAAS8I,KAGJ,SAAUjD,GAAUqD,GAEzB,OAAQrG,EAAcnD,IAAIwJ,IAAuBA,CAClD,CAKM,SAAUE,GAAUnL,GACzB+I,OAAW3H,EAAWpB,GAAI,EAC3B,CAGA,MAAMoL,GAAiB,IAAIrM,QACrB2D,GAAK,IAAIC,qBAAkCC,GAAMA,cAMvC4D,GACfxG,KACGmB,GAEH,IAAIkK,EAA+B,KACnC,MAAMC,EAAMpF,EAAiBqF,GAAgBxC,EAAWyC,EAAWD,GAAKvL,GACxE,IAAIyL,GAAgB,EAEpB,SAASD,IAERH,MAEA/E,EAAQC,MAAMvG,GACd,MAAM0L,EAAkB3C,EAAW0C,OAAgBrK,EAAYoK,EAAW,IACzExL,EAAGsL,KAAQnK,IAEZmF,EAAQG,MAAMzG,GAGdqL,EAAU,KACTA,EAAU,KACVK,MAEA,MAAMpD,EAAgB5D,EAAwBjD,IAAI+J,GAClD,GAAIlD,EAAe,CAClB,IAAK,MAAMqD,KAAerD,EAAe,CACxC,MAAMrB,EAAiBvB,EAASjE,IAAIkK,GACpC,GAAI1E,EAAgB,CACnB,IAAK,MAAOlD,EAAMqD,KAASH,EAAe2B,UACzCxB,EAAK0B,OAAO0C,GACM,IAAdpE,EAAKsB,MACRzB,EAAe6B,OAAO/E,GAGI,IAAxBkD,EAAeyB,MAClBhD,EAASoD,OAAO6C,EAElB,CACD,CACAjH,EAAwBoE,OAAO0C,EAChC,EAEF,CAKA,GAHAtF,EAAasF,EAAWxL,GAGnBwI,EAEE,CACN,MAAMoD,EAAoBpD,EAC1B,IAGCA,EAAiB,IAAI1J,IAAI,CAAC,CAACkB,EAAIwL,KAC/BA,IACAhD,EAAeM,OAAO9I,GACtB,IAAK,MAAOmG,EAAMK,KAAWgC,EAAiBoD,EAAkBhK,IAAIuE,EAAMK,EAC3E,SACCgC,EAAiBoD,CAClB,CACD,MAbCtE,EAAUkE,GAeX,MAAMK,EAAc,KACnB,GAAIJ,EAAe,OACnBA,GAAgB,EAChBJ,MAEA,MAAMS,EAAWV,GAAe3J,IAAI+J,GACpC,GAAIM,EAAU,CACb,IAAK,MAAMC,KAAgBD,EAAUC,IACrCX,GAAetC,OAAO0C,EACvB,CAEA9I,GAAGsJ,WAAWH,IAIf,IAAKtD,EAAc,CAClB,MAAM0D,EAAkB,IAAMJ,IAE9B,OADAnJ,GAAGwJ,SAASD,EAAiBJ,EAAaI,GACnCA,CACR,CAGA,IAAIH,EAAWV,GAAe3J,IAAI8G,GAC7BuD,IACJA,EAAW,IAAIrN,IACf2M,GAAexJ,IAAI2G,EAAcuD,IAElC,MAAMzC,EAASd,EACT4D,EAAmB,KACxBL,EAAShD,OAAOqD,GACM,IAAlBL,EAASpD,MACZ0C,GAAetC,OAAOO,GAGvBwC,KAGD,OADAC,EAASzD,IAAI8D,GACNA,CACR,CAwBO,MAAMC,GAAa,IAAI3N,IAOxB,SAAUsM,GAAcvD,GAE7B,OAAY,OAARA,GAA+B,iBAARA,MAGvBvC,EAAmBhF,IAAIuH,OAGvBA,EAAI3B,MAGJlH,MAAM0I,KAAK+E,IAAYC,KAAMrM,GAAOA,EAAGwH,KAG5C,CAMM,SAAU8E,MAA+DC,GAC9E,IAAK,MAAMC,KAAKD,EAASC,IAAIA,EAAE1I,UAAkB+B,IAAmB,GACpE,OAAO0G,EAAI,EACZ,CAMM,SAAUE,GACfC,EACAC,GAEAD,EAAc5I,UAAU8B,GAAkB+G,EAC1CL,GAAiBK,EAClB,CASM,SAAUC,GACf5L,EACA6L,GACAC,UAAEA,GAAY,GAAU,IAExB,GAAI9L,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,MAAM,IAAI9B,MAAM,6CAEhD,MAAM6N,EAAkC7G,EAAa,IAAM2G,EAAS7L,GAAS6L,GAG7E,OAAOrG,GAAO,KAEb1B,EAAwBuD,IAAIrH,GAG5B,IAAIsH,EAAgBtD,EAA2BvD,IAAIsL,GAC9CzE,IACJA,EAAgB,IAAI7J,IACpBuG,EAA2BpD,IAAImL,EAAiBzE,IAEjDA,EAAeD,IAAIrH,GAInB,MAAMgM,EAAU,IAAIhO,QA0EpB,OAzEA,SAASiO,EAAiBzF,EAAU0F,EAAQ,GAE3C,KAAIF,EAAQ/M,IAAIuH,KAwGnB,SAAkBA,GACjB,OAAe,OAARA,GAA+B,iBAARA,CAC/B,CA1G4B2F,CAAS3F,IAAQ0F,EAAQ5G,EAAQO,mBAEtDkE,GAAcvD,IAAlB,CACAwF,EAAQ3E,IAAIb,GAGZ1C,EAAwBuD,IAAIb,GAC5Bc,EAAeD,IAAIb,GAInB,IAAK,MAAM/B,KAAOmC,GAAOJ,GACxB,GAAI9I,OAAOqL,OAAOvC,EAAK/B,GAAM,CAE5B,MAAMjF,EAASgH,EAAY/B,GAI3BwH,EADkB,iBAAVzM,GAAgC,OAAVA,EAAiB+E,GAAS/E,GAASA,EACjC0M,EAAQ,EACzC,CAKD,GAAIvO,MAAMyO,QAAQ5F,IAAQA,aAAe7I,MAAO,CAE/C,MAAMgK,EAASnB,EAAImB,OAGnB,IAAK,IAAI0E,EAAI,EAAGA,EAAI1E,EAAQ0E,IAAK,CAEhC,MAAM7M,EAAQgH,EAAI6F,GAIlBJ,EADkB,iBAAVzM,GAAgC,OAAVA,EAAiB+E,GAAS/E,GAASA,EACjC0M,EAAQ,EACzC,CACD,MAEK,GAAI1F,aAAe/I,IAEvB,IAAK,MAAM+B,KAASgH,EAAK,CAIxByF,EADkB,iBAAVzM,GAAgC,OAAVA,EAAiB+E,GAAS/E,GAASA,EACjC0M,EAAQ,EACzC,MAGI,GAAI1F,aAAe1I,IAEvB,IAAK,MAAOwO,EAAM9M,KAAUgH,EAAK,CAIhCyF,EADkB,iBAAVzM,GAAgC,OAAVA,EAAiB+E,GAAS/E,GAASA,EACjC0M,EAAQ,EACzC,CAtDuB,CA0DzB,CAIAD,CAAiBjM,GAGb8L,GAAWD,EAAS7L,GACxB8L,GAAY,EAGL,KAEN,MAAMxE,EAAgBtD,EAA2BvD,IAAIsL,GACrD,GAAIzE,EAAe,CAElB,IAAK,MAAMd,KAAOc,EAAe,CAEhC,MAAM5C,EAAWX,EAAatD,IAAI+F,GAC9B9B,GAEHA,EAASoD,OAAOiE,GAGM,IAAlBrH,EAASgD,OACZ3D,EAAa+D,OAAOtB,GACpB1C,EAAwBgE,OAAOtB,KAIhC1C,EAAwBgE,OAAOtB,EAEjC,CAGAxC,EAA2B8D,OAAOiE,EACnC,IAGH,CCn0BA,IAAIQ,GDirBJjB,GAAiB1N,KAAMe,OAAQT,MAAOD,QAASJ,UACzB,oBAAX2O,QAnDX,YAA4ChG,GAC3C,IAAK,MAAMiG,KAAKjG,EAAK,CACpB,IACC9I,OAAO4F,eAAemJ,EAAG5H,EAAiB,CACzCrF,OAAO,EACP+D,UAAU,EACVC,YAAY,EACZC,cAAc,GAEhB,CAAE,MAAO,CACHoB,KAAoB4H,GAAexI,EAAmBoD,IAAIoF,EACjE,CACOjG,EAAI,EACZ,CAsCmCkG,CAAYF,OAAQG,UAChC,oBAAZC,SAAyBtB,GAAiBsB,QAASC,MCxqB9D,MAAMC,GAAgB,IAAI/O,QAC1B,SAASgP,GAAoBvM,GAC5B,MAAMiE,EAAMW,EAAQ5E,GACpB,IAAIwM,EAAgC,GAEpC,OADA7F,EAAU2F,GAAerI,GACrBqI,GAAc7N,IAAIwF,IACtBsD,OAAW3H,EAAW,KACrB,MAAM6M,EAAOzH,GACZN,EAAcoF,IACb,MAAM4C,EAAQX,GACd,GAAIO,GAAc7N,IAAIwF,GAAM,CAE3B,IAAK,MAAM8F,KAAMyC,EAAezC,IAChCyC,EAAgB,GAChBF,GAAchF,OAAOrD,GACrB8B,EAASuG,GAAe,CAAExD,KAAM,MAAOvG,KAAM0B,GAAOA,GACpDwI,GACD,MACC,IACCV,GAAwBS,EACxBF,GAAclM,IAAI6D,EAAKjE,EAAO8J,GAC/B,SACCiC,GAAwBW,CACzB,GACC1M,MAnB8BsM,GAAcrM,IAAIgE,EAuBtD,CAKO,MAAM0I,GAAW9L,EAAU,CACjC,MAAAb,CAAO8B,EAAUrC,GAChB,MAAMmN,EAAY,IAAIrP,QACtB,OAAO,WAUN,OATKqP,EAAUnO,IAAIY,OAClBuN,EAAUxM,IACTf,KACAT,EACC,IAAMkD,EAAStB,KAAKnB,MACpB,GAAGjB,OAAOiB,KAAKH,YAAYJ,SAASV,OAAOqB,OAIvC8M,GAAiBK,EAAU3M,IAAIZ,MACvC,CACD,EACAkB,QAAWP,GACHuM,GAAiBvM,KAQpB6M,GAAWvL,OAAO,aA4FxB,SAASwL,GAAmB9G,GAE3B,GAAIuD,GADJvD,EAAMI,GAAOJ,IACW,OAAOA,EAC/B,IACC9I,OAAO4F,eAAekD,EAAe3B,EAAiB,CACrDrF,OAAO,EACP+D,UAAU,EACVC,YAAY,EACZC,cAAc,GAEhB,CAAE,MAAO,CACHoB,KAAoB2B,GAAiBvC,EAAmBoD,IAAIb,GAClE,IAAK,MAAM/B,KAAO+B,EAAK8G,GAAgB9G,EAAI/B,IAC3C,OAAO+B,CACR,CAoBO,MAAM+G,GAAalM,EAAU,CACnC,MAAMiB,GAELgJ,GAAiBhJ,EAClB,EACAvB,QAtBD,SACCyM,KACGrN,GAEH,MAAuB,iBAATqN,EACXF,GAAgBE,GACblL,IAEHA,EAASQ,UAAUgC,GAAwB,IAAIrH,IAC9C6E,EAASQ,UAAUgC,IAAyB,IAG7CxC,EAASQ,UAAUgC,GAAsBuC,IAAImG,GAC7C,IAAK,MAAMC,KAAOtN,EAAMmC,EAASQ,UAAUgC,GAAsBuC,IAAIoG,GACrE,OAAOnL,CACP,CACJ,IAaA5E,OAAOqJ,OAAOpC,EAAa,CAAEmI,mBC5N7B,MAAMY,GAAS5L,OAAO,UAChBsK,GAAUzO,MAAMyO,QACtBzO,MAAMyO,QAAY5M,GAEjB4M,GAAQ5M,IAAWA,aAAiB7B,OAAS+P,MAAUlO,EACxD,MAAMmO,IAGN,SAAU/K,GAAMyJ,GAAW1E,OAAEA,GAAS,GAAS,CAAA,SACxC0E,EACF1E,SAAc,SACnB,CAEA,SAAUiG,GACTC,EACAC,GACAnG,OAAEA,GAAS,GAAU,IAErB,MAAMoG,EAAQC,KAAKC,IAAIJ,EAAGC,GACpBI,EAAMF,KAAKG,IAAIN,EAAGC,GACxB,IAAK,IAAIzB,EAAI0B,EAAO1B,GAAK6B,EAAK7B,UAAWA,EACrC1E,SAAc,SACnB,OACayG,WAAsB3L,EAAUkL,GAAmB,CAC/D,GAAAlN,CAAI4L,GAEH,OADAlF,EAAUtH,KAAK6N,IAASrB,GACjB9H,GAAS1E,KAAK6N,IAAQrB,GAC9B,EACA,GAAAzL,CAAIyL,EAAW7M,GACd,MAAM6O,EAAQhC,GAAKxM,KAAK6N,IAAQ/F,OAChC9H,KAAK6N,IAAQrB,GAAK7M,EAClBkH,EAAQ7G,KAAK6N,IAAS,CAAEpE,KAAM,QAASxI,OAAQ,OAAS8B,GAAMyJ,EAAG,CAAE1E,OAAQ0G,IAC5E,EACA,SAAAnL,GAEC,OADAiE,EAAUtH,KAAK6N,IAAS,UACjB7N,KAAK6N,IAAQ/F,MACrB,EACA,SAAAtE,CAAU7D,GACT,MAAM8O,EAAYzO,KAAK6N,IAAQ/F,OAC/B,IACC9H,KAAK6N,IAAQ/F,OAASnI,CACvB,SACCkH,EACC7G,KAAK6N,IACL,CAAEpE,KAAM,MAAOvG,KAAM,UACrB6K,GAAMU,EAAW9O,EAAO,CAAEmI,QAAQ,IAEpC,CACD,KAGA,WAAAjI,CAAY4C,GACX1C,QACAlC,OAAO6B,iBAAiBM,KAAM,CAE7B0O,CAACb,IAAS,CAAElO,MAAO8C,GACnByC,CAACA,GAAsB,CAAEvF,MAAO8C,IAElC,CAGA,EAAAkM,CAAG5L,GACF,MAAM6L,EAAc7L,EAAQ,EAAI/C,KAAK6N,IAAQ/F,OAAS/E,EAAQA,EAE9D,GADAuE,EAAUtH,KAAM4O,KACZA,EAAc,GAAKA,GAAe5O,KAAK6N,IAAQ/F,QACnD,OAAOpD,GAAS1E,KAAK6N,IAAQe,GAC9B,CAEA,IAAA5G,IAAQ6G,GACP,MAAMJ,EAAYzO,KAAK6N,IAAQ/F,OAC/B,IACC,OAAO9H,KAAK6N,IAAQ7F,QAAQ6G,EAC7B,SACChI,EACC7G,KACA,CAAEyJ,KAAM,QAASxI,OAAQ,QACzB8M,GAAMU,EAAWA,EAAYI,EAAM/G,OAAS,EAAG,CAAEA,QAAQ,IAE3D,CACD,CAEA,GAAAgH,GACC,GAA4B,IAAxB9O,KAAK6N,IAAQ/F,OACjB,IACC,OAAOpD,GAAS1E,KAAK6N,IAAQiB,MAC9B,SACCjI,EAAQ7G,KAAM,CAAEyJ,KAAM,QAASxI,OAAQ,OAAS8B,GAAM/C,KAAK6N,IAAQ/F,QACpE,CACD,CAEA,KAAAiH,GACC,GAA4B,IAAxB/O,KAAK6N,IAAQ/F,OACjB,IACC,OAAOpD,GAAS1E,KAAK6N,IAAQkB,QAC9B,SACClI,EACC7G,KACA,CAAEyJ,KAAM,QAASxI,OAAQ,SACzB8M,GAAM,EAAG/N,KAAK6N,IAAQ/F,OAAS,EAAG,CAAEA,QAAQ,IAE9C,CACD,CAEA,OAAAkH,IAAWH,GACV,IACC,OAAO7O,KAAK6N,IAAQmB,WAAWH,EAChC,SACChI,EACC7G,KACA,CAAEyJ,KAAM,QAASxI,OAAQ,WACzB8M,GAAM,EAAG/N,KAAK6N,IAAQ/F,OAAS+G,EAAM/G,OAAQ,CAAEA,QAAQ,IAEzD,CACD,CAEA,MAAAmH,CAAOf,EAAegB,KAAyBL,GAC9C,MAAMJ,EAAYzO,KAAK6N,IAAQ/F,YACXvH,IAAhB2O,IAA2BA,EAAcT,EAAYP,GACzD,IACC,OAAsCxJ,QAAlBnE,IAAhB2O,EAA2ClP,KAAK6N,IAAQoB,OAAOf,GACnDlO,KAAK6N,IAAQoB,OAAOf,EAAOgB,KAAgBL,GAC5D,SACChI,EACC7G,KACA,CAAEyJ,KAAM,QAASxI,OAAQ,UAEzBiO,IAAgBL,EAAM/G,OACnBiG,GAAMG,EAAOA,EAAQgB,GACrBnB,GAAMG,EAAOO,EAAYN,KAAKG,IAAIO,EAAM/G,OAASoH,EAAa,GAAI,CAClEpH,QAAQ,IAGb,CACD,CAEA,OAAAqH,GACC,IACC,OAAOnP,KAAK6N,IAAQsB,SACrB,SACCtI,EAAQ7G,KAAM,CAAEyJ,KAAM,QAASxI,OAAQ,WAAa8M,GAAM,EAAG/N,KAAK6N,IAAQ/F,OAAS,GACpF,CACD,CAEA,IAAAsH,CAAKC,GACJ,IACC,OAAOrP,KAAK6N,IAAQuB,KAAKC,EAC1B,SACCxI,EAAQ7G,KAAM,CAAEyJ,KAAM,QAASxI,OAAQ,QAAU8M,GAAM,EAAG/N,KAAK6N,IAAQ/F,OAAS,GACjF,CACD,CAEA,IAAAwH,CAAK3P,EAAYuO,EAAgBG,GAChC,IACC,YAAc9N,IAAV2N,EAA4BlO,KAAK6N,IAAQyB,KAAK3P,QACtCY,IAAR8N,EAA0BrO,KAAK6N,IAAQyB,KAAK3P,EAAOuO,GAChDlO,KAAK6N,IAAQyB,KAAK3P,EAAOuO,EAAOG,EACxC,SACCxH,EAAQ7G,KAAM,CAAEyJ,KAAM,QAASxI,OAAQ,QAAU8M,GAAM,EAAG/N,KAAK6N,IAAQ/F,OAAS,GACjF,CACD,CAEA,UAAAyH,CAAWpP,EAAgB+N,EAAeG,GACzC,IACC,YAAY9N,IAAR8N,EAA0BrO,KAAK6N,IAAQ0B,WAAWpP,EAAQ+N,GACvDlO,KAAK6N,IAAQ0B,WAAWpP,EAAQ+N,EAAOG,EAC/C,SACCxH,EACC7G,KACA,CAAEyJ,KAAM,QAASxI,OAAQ,cAEzB8M,GAAM,EAAG/N,KAAK6N,IAAQ/F,OAAS,GAEjC,CAED,CAGA,UAAA0H,GAEC,OADAlI,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQ2B,aAC9B,CAEA,QAAAC,CAASJ,GAER,OADA/H,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQ4B,SAASJ,GACvC,CAEA,SAAAK,CAAUxB,EAAegB,KAAyBL,GAEjD,OADAvH,EAAUtH,WACaO,IAAhB2O,EACJlP,KAAK6N,IAAQ6B,UAAUxB,GACvBlO,KAAK6N,IAAQ6B,UAAUxB,EAAOgB,KAAgBL,EAClD,CAEA,KAAK9L,EAAepD,GAEnB,OADA2H,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQ8B,KAAK5M,EAAOpD,GAC1C,CAGA,OAAAoI,GAEC,OADAT,EAAUtH,MACH2E,EAA4B3E,KAAK6N,IAAQ9F,UACjD,CAEA,IAAAzB,GAEC,OADAgB,EAAUtH,MACHA,KAAK6N,IAAQvH,MACrB,CAEA,MAAAsJ,GAEC,OADAtI,EAAUtH,MACHqE,EAAqBrE,KAAK6N,IAAQ+B,SAC1C,CAEA,CAAC3N,OAAOqC,YACPgD,EAAUtH,MACV,MAAM6P,EAAiB7P,KAAK6N,IAAQ5L,OAAOqC,YAC3C,MAAO,CACN,IAAAE,GACC,MAAMD,EAASsL,EAAerL,OAC9B,OAAID,EAAOE,KACHF,EAED,CAAE5E,MAAO+E,GAASH,EAAO5E,OAAQ8E,MAAM,EAC/C,EAEF,CAEA,OAAAqL,CAAQC,EAAoBC,GAE3B,OADA1I,EAAUtH,MACHA,KAAK6N,IAAQiC,QAAQC,EAAeC,EAC5C,CAEA,WAAAC,CAAYF,EAAoBC,GAE/B,OADA1I,EAAUtH,MACHA,KAAK6N,IAAQoC,YAAYF,EAAeC,EAChD,CAEA,QAAAvP,CAASsP,EAAoBC,GAE5B,OADA1I,EAAUtH,MACHA,KAAK6N,IAAQpN,SAASsP,EAAeC,EAC7C,CAEA,IAAAE,CACCC,EACAC,GAGA,OADA9I,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQqC,KAAKC,EAAWC,GAC9C,CAEA,SAAAC,CACCF,EACAC,GAGA,OADA9I,EAAUtH,MACHA,KAAK6N,IAAQwC,UAAUF,EAAWC,EAC1C,CAEA,IAAAE,GAEC,OADAhJ,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQyC,OAC9B,CAEA,OAAAC,CACCC,EACAJ,GAGA,OADA9I,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQ0C,QAAQC,EAAYJ,GAClD,CAEA,MAAAK,CAAOD,EAAkEJ,GAExE,OADA9I,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQ4C,OAAOD,EAAmBJ,GACxD,CAEA,GAAAM,CAAIF,EAA8DJ,GAEjE,OADA9I,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQ6C,IAAIF,EAAmBJ,GACrD,CAEA,MAAAO,CACCH,EACAI,GAEAtJ,EAAUtH,MACV,MAAMuE,OACYhE,IAAjBqQ,EACG5Q,KAAK6N,IAAQ8C,OAAOH,GACpBxQ,KAAK6N,IAAQ8C,OAAOH,EAAmBI,GAC3C,OAAOlM,GAASH,EACjB,CAEA,WAAAsM,CACCL,EACAI,GAEAtJ,EAAUtH,MACV,MAAMuE,OACYhE,IAAjBqQ,EACG5Q,KAAK6N,IAAQgD,YAAYL,EAAmBI,GAC3C5Q,KAAK6N,IAAgBgD,YAAYL,GACtC,OAAO9L,GAASH,EACjB,CAEA,KAAAuM,CAAM5C,EAAgBG,GACrB,IAAK,MAAM7B,KAAKuB,GAAMG,GAAS,EAAGG,GAAOrO,KAAK6N,IAAQ/F,OAAS,GAAIR,EAAUtH,KAAMwM,GACnF,YAAiBjM,IAAV2N,EACJlO,KAAK6N,IAAQiD,aACLvQ,IAAR8N,EACCrO,KAAK6N,IAAQiD,MAAM5C,GACnBlO,KAAK6N,IAAQiD,MAAM5C,EAAOG,EAC/B,CAEA,MAAA0C,IAAUlC,GAET,OADAvH,EAAUtH,MACH0E,GAAS1E,KAAK6N,IAAQkD,UAAUlC,GACxC,CAEA,IAAAmC,CAAKC,GAEJ,OADA3J,EAAUtH,MACHA,KAAK6N,IAAQmD,KAAKC,EAC1B,CAEA,OAAAC,CAAQV,EAA+DJ,GACtE9I,EAAUtH,MACVA,KAAK6N,IAAQqD,QAAQV,EAAmBJ,EACzC,CAGA,KAAAe,CAAMX,EAAkEJ,GAEvE,OADA9I,EAAUtH,MACHA,KAAK6N,IAAQsD,MAAMX,EAAmBJ,EAC9C,CAEA,IAAA5E,CAAKgF,EAAkEJ,GAEtE,OADA9I,EAAUtH,MACHA,KAAK6N,IAAQrC,KAAKgF,EAAmBJ,EAC7C,ECpVD,MAAMvC,GAAS5L,OAAO,gBA6CTmP,GAIZ,WAAAvR,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7BqR,CAACxD,IAAS,CAAElO,MAAO8C,GACnByC,CAACA,GAAsB,CAAEvF,MAAO8C,GAChC6O,QAAS,CAAE3R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,gBAEjC,CAGA,QAAIkI,GAEH,OADAP,EAAUtH,KAAM,QACTA,KAAK6N,IAAQhG,IACrB,CAEA,KAAA0J,GACC,MAAMC,EAAaxR,KAAK6N,IAAQhG,KAAO,EAGvC,GAFA7H,KAAK6N,IAAQ0D,QAETC,EAAY,CACf,MAAM5K,EAAY,CAAE6C,KAAM,QAASxI,OAAQ,SAE3CyF,EAAS1G,KAAM4G,EAAW,QAC1BC,EAAQ7G,KAAKsR,QAAS1K,EACvB,CACD,CAEA,OAAAmB,GAEC,OADAT,EAAUtH,KAAKsR,SACR3M,EAA4B3E,KAAK6N,IAAQ9F,UACjD,CAEA,OAAAmJ,CAAQV,EAAwDJ,GAC/D9I,EAAUtH,KAAKsR,SACftR,KAAK6N,IAAQqD,QAAQV,EAAYJ,EAClC,CAEA,IAAA9J,GAEC,OADAgB,EAAUtH,KAAKsR,SACRtR,KAAK6N,IAAQvH,MACrB,CAEA,MAAAsJ,GAEC,OADAtI,EAAUtH,KAAKsR,SACRjN,EAAqBrE,KAAK6N,IAAQ+B,SAC1C,CAEA,CAAC3N,OAAOqC,YACPgD,EAAUtH,KAAKsR,SACf,MAAMzB,EAAiB7P,KAAK6N,IAAQ5L,OAAOqC,YAC3C,MAAO,CACN,IAAAE,GACC,MAAMD,EAASsL,EAAerL,OAC9B,OAAID,EAAOE,KACHF,EAED,CACN5E,MAAO,CAAC4E,EAAO5E,MAAM,GAAI+E,GAASH,EAAO5E,MAAM,KAC/C8E,MAAM,EAER,EAEF,CAGA,OAAOG,GACN,MAAM6M,EAASzR,KAAK6N,IAAQzO,IAAIwF,GAC1BL,EAASvE,KAAK6N,IAAQ5F,OAAOrD,GAEnC,GAAI6M,EAAQ,CACX,MAAM7K,EAAY,CAAE6C,KAAM,MAAOvG,KAAM0B,GACvC8B,EAAS1G,KAAKsR,QAAS1K,EAAWhC,GAClC8B,EAAS1G,KAAM4G,EAAW,OAC3B,CAEA,OAAOrC,CACR,CAEA,GAAA3D,CAAIgE,GAEH,OADA0C,EAAUtH,KAAKsR,QAAS1M,GACjBF,GAAS1E,KAAK6N,IAAQjN,IAAIgE,GAClC,CAEA,GAAAxF,CAAIwF,GAEH,OADA0C,EAAUtH,KAAKsR,QAAS1M,GACjB5E,KAAK6N,IAAQzO,IAAIwF,EACzB,CAEA,GAAA7D,CAAI6D,EAAQjF,GACX,MAAM8R,EAASzR,KAAK6N,IAAQzO,IAAIwF,GAC1B8M,EAAW1R,KAAK6N,IAAQjN,IAAIgE,GAC5BuE,EAAgBzE,GAAS/E,GAG/B,GAFAK,KAAK6N,IAAQ9M,IAAI6D,EAAKuE,IAEjBsI,GAAUC,IAAavI,EAAe,CAC1C,MAAMvC,EAAY,CAAE6C,KAAMgI,EAAS,MAAQ,MAAOvO,KAAM0B,GACxD8B,EAAS1G,KAAKsR,QAAS1K,EAAWhC,GAClC8B,EAAS1G,KAAM4G,EAAW,OAC3B,CAEA,OAAO5G,IACR,ECtJD,MAAM6N,GAAS5L,OAAO,gBAyCT0P,GAGZ,WAAA9R,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7B6N,CAACA,IAAS,CAAElO,MAAO8C,GACnByC,CAACA,GAAsB,CAAEvF,MAAO8C,GAChC6O,QAAS,CAAE3R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,gBAEjC,CAEA,QAAIkI,GAGH,OADAP,EAAUtH,KAAM,QACTA,KAAK6N,IAAQhG,IACrB,CAEA,GAAAL,CAAI7H,GACH,MAAMiS,EAAM5R,KAAK6N,IAAQzO,IAAIO,GACvBwJ,EAAgBzE,GAAS/E,GAE/B,GADAK,KAAK6N,IAAQrG,IAAI2B,IACZyI,EAAK,CACT,MAAMhL,EAAY,CAAE6C,KAAM,MAAOvG,KAAMiG,GAEvCzC,EAAS1G,KAAKsR,QAAS1K,EAAWuC,GAClCzC,EAAS1G,KAAM4G,EAAW,OAC3B,CACA,OAAO5G,IACR,CAEA,KAAAuR,GACC,MAAMC,EAAaxR,KAAK6N,IAAQhG,KAAO,EAEvC,GADA7H,KAAK6N,IAAQ0D,QACTC,EAAY,CACf,MAAM5K,EAAY,CAAE6C,KAAM,QAASxI,OAAQ,SAC3CyF,EAAS1G,KAAM4G,EAAW,QAC1BC,EAAQ7G,KAAKsR,QAAS1K,EACvB,CACD,CAEA,OAAOjH,GACN,MAAMiS,EAAM5R,KAAK6N,IAAQzO,IAAIO,GACvBkS,EAAM7R,KAAK6N,IAAQ5F,OAAOtI,GAChC,GAAIiS,EAAK,CACR,MAAMhL,EAAY,CAAE6C,KAAM,MAAOvG,KAAMvD,GACvC+G,EAAS1G,KAAKsR,QAAS1K,EAAWjH,GAClC+G,EAAS1G,KAAM4G,EAAW,OAC3B,CACA,OAAOiL,CACR,CAEA,GAAAzS,CAAIO,GAEH,OADA2H,EAAUtH,KAAKsR,QAAS3R,GACjBK,KAAK6N,IAAQzO,IAAIO,EACzB,CAEA,OAAAoI,GAEC,OADAT,EAAUtH,KAAKsR,SACR3M,EAA4B3E,KAAK6N,IAAQ9F,UACjD,CAEA,OAAAmJ,CAAQV,EAAwDJ,GAC/D9I,EAAUtH,KAAKsR,SACftR,KAAK6N,IAAQqD,QAAQV,EAAYJ,EAClC,CAEA,IAAA9J,GAEC,OADAgB,EAAUtH,KAAKsR,SACRjN,EAAqBrE,KAAK6N,IAAQvH,OAC1C,CAEA,MAAAsJ,GAEC,OADAtI,EAAUtH,KAAKsR,SACRjN,EAAqBrE,KAAK6N,IAAQ+B,SAC1C,CAEA,CAAC3N,OAAOqC,YACPgD,EAAUtH,KAAKsR,SACf,MAAMzB,EAAiB7P,KAAK6N,IAAQ5L,OAAOqC,YAC3C,MAAO,CACN,IAAAE,GACC,MAAMD,EAASsL,EAAerL,OAC9B,OAAID,EAAOE,KACHF,EAED,CAAE5E,MAAO+E,GAASH,EAAO5E,OAAQ8E,MAAM,EAC/C,EAEF,ECrHDmH,GAAyB1N,cFNxB,WAAA2B,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7BqR,CAACxD,IAAS,CAAElO,MAAO8C,GACnByC,CAACA,GAAsB,CAAEvF,MAAO8C,GAChC6O,QAAS,CAAE3R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,oBAEjC,CAGA,OAAOiF,GACN,MAAM6M,EAASzR,KAAK6N,IAAQzO,IAAIwF,GAC1BL,EAASvE,KAAK6N,IAAQ5F,OAAOrD,GAInC,OAFI6M,GAAQ/K,EAAS1G,KAAKsR,QAAS,CAAE7H,KAAM,MAAOvG,KAAM0B,GAAOA,GAExDL,CACR,CAEA,GAAA3D,CAAIgE,GAEH,OADA0C,EAAUtH,KAAKsR,QAAS1M,GACjBF,GAAS1E,KAAK6N,IAAQjN,IAAIgE,GAClC,CAEA,GAAAxF,CAAIwF,GAEH,OADA0C,EAAUtH,KAAKsR,QAAS1M,GACjB5E,KAAK6N,IAAQzO,IAAIwF,EACzB,CAEA,GAAA7D,CAAI6D,EAAQjF,GAKX,OAHA+G,EAAS1G,KAAKsR,QAAS,CAAE7H,KAAMzJ,KAAK6N,IAAQzO,IAAIwF,GAAO,MAAQ,MAAO1B,KAAM0B,GAAOA,GACnF5E,KAAK6N,IAAQ9M,IAAI6D,EAAKjF,GAEfK,IACR,IE5BD4L,GAAyB3N,IAAKmT,IAC9BxF,GAAyBzN,cDPxB,WAAA0B,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7B6N,CAACA,IAAS,CAAElO,MAAO8C,GACnByC,CAACA,GAAsB,CAAEvF,MAAO8C,GAChC6O,QAAS,CAAE3R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,oBAEjC,CAEA,GAAA6H,CAAI7H,GACH,MAAMiS,EAAM5R,KAAK6N,IAAQzO,IAAIO,GAO7B,OANAK,KAAK6N,IAAQrG,IAAI7H,GACZiS,GAEJlL,EAAS1G,KAAKsR,QAAS,CAAE7H,KAAM,MAAOvG,KAAMvD,GAASA,GAG/CK,IACR,CAEA,OAAOL,GACN,MAAMiS,EAAM5R,KAAK6N,IAAQzO,IAAIO,GACvBkS,EAAM7R,KAAK6N,IAAQ5F,OAAOtI,GAEhC,OADIiS,GAAKlL,EAAS1G,KAAKsR,QAAS,CAAE7H,KAAM,MAAOvG,KAAMvD,GAASA,GACvDkS,CACR,CAEA,GAAAzS,CAAIO,GAEH,OADA2H,EAAUtH,KAAKsR,QAAS3R,GACjBK,KAAK6N,IAAQzO,IAAIO,EACzB,ICtBDiM,GAAyBhO,IAAK+T,IAC9B/F,GAAyB9N,MAAOyQ,ICxBhC,MAAMuD,GAA2D,GACpDC,GAASvQ,EAAU,CAC/Bb,OAAM,CAAC8B,EAAUrC,IACT,WACN,MAAM4R,EAAqBF,GAAgBzB,UACzC1E,GAAMA,EAAEsG,SAAWjS,MAAQ2L,EAAEzI,OAAS9C,GAExC,GAAI4R,GAAqB,EACxB,MAAM,IAAI3T,MACT,iCAAiCyT,GAC/BhB,MAAMkB,GACNtB,IAAK/E,GAAM,GAAGA,EAAEsG,OAAOpS,YAAYJ,QAAQV,OAAO4M,EAAEzI,SACpD8N,KAAK,oBAETc,GAAgB9J,KAAK,CAAEiK,OAAQjS,KAAMkD,KAAM9C,IAC3C,IACC,MAAMmB,EAAKkB,EAAStB,KAAKnB,MAEzB,OADAkS,GAAMlS,KAAMI,EAAamB,GAClBA,CACR,SACCuQ,GAAgBhD,KACjB,CACD,aAQcoD,GAAMD,EAAgB7R,EAA0BT,GAC/D9B,OAAO4F,eAAewO,EAAQ7R,EAAa,CAAET,SAC9C,OAuBawS,GAAatU,OAAOqJ,OAChC1F,EAAU,CACTP,OAAM,CAACwB,EAAUrC,IACT,YAAwBE,GAE9B,OADA6R,GAAWjM,KAAKlG,KAAMI,GACfqC,EAAS2P,MAAMpS,KAAMM,EAC7B,EAEDK,OAAM,CAAC8B,EAAUrC,IACT,WAEN,OADA+R,GAAWjM,KAAKlG,KAAMI,GACfqC,EAAStB,KAAKnB,KACtB,EAEDc,OAAM,CAAC2B,EAAUrC,IACT,SAAqBT,GAE3B,OADAwS,GAAWjM,KAAKlG,KAAMI,GACfqC,EAAStB,KAAKnB,KAAML,EAC5B,EAEDa,MAAMiC,GACE,cAAcA,EACpB,WAAA5C,IAAeS,GACdP,SAASO,GACT6R,GAAWjM,KAAKlG,KAAM,cACvB,GAGFkB,QAAQpB,GACA0B,EAAU,CAChBP,OAAM,CAACwB,EAAUrC,IACT,YAAwBE,GAE9B,OADA6R,GAAWjM,KAAKlG,KAAMI,EAAaN,GAC5B2C,EAAS2P,MAAMpS,KAAMM,EAC7B,EAEDK,OAAM,CAAC8B,EAAUrC,IACT,WAEN,OADA+R,GAAWjM,KAAKlG,KAAMI,EAAaN,GAC5B2C,EAAStB,KAAKnB,KACtB,EAEDc,OAAM,CAAC2B,EAAUrC,IACT,SAAqBT,GAE3B,OADAwS,GAAWjM,KAAKlG,KAAMI,EAAaN,GAC5B2C,EAAStB,KAAKnB,KAAML,EAC5B,EAEDa,MAAMiC,GACE,cAAcA,EACpB,WAAA5C,IAAeS,GACdP,SAASO,GACT6R,GAAWjM,KAAKlG,KAAM,cAAeF,EACtC,OAML,CACCoG,KAAM,CAAC/F,EAAaC,EAA0BN,0CRvC1C,SAKJ+C,EAAkCwP,SASnC,OARIxP,GAAwB,mBAATA,IAClBwP,EAAgBxP,EAChBA,OAAOtC,GAEHsC,IACJA,EAAO,SAGRyP,EAAO,cAA2BzP,EAEjC,cAAO0P,CAAQ5L,GACd,MAAM3E,EAAasQ,EAAYE,YAAY5R,IAAI+F,GAC/C,IAAK3E,EAAY,OAAO,EACxBH,EAAGsJ,WAAWxE,GACd2L,EAAYE,YAAYvK,OAAOtB,GAC/B9I,OAAOmF,eAAe2D,EAAK,IAAI9H,MAAM,CAAA,EAAIwD,IAEzC,IAAK,MAAMuC,KAAO/G,OAAO4U,oBAAoB9L,UACpCA,EAAY/B,GAGrB,OADA5C,KACO,CACR,CACA,oBAAO0Q,CAAc/L,GACpB,OAAO2L,EAAYE,YAAYpT,IAAIuH,EACpC,CAIA,WAAA9G,IAAeS,GACdP,SAASO,GACT,MAAMkC,EAAY,CAAA,EAClBxC,KAAKkC,GAAmBM,EAExB,MAAMmQ,EAAeN,GAAerQ,YAAchC,KAAKgC,GACvD,IAAK2Q,EACJ,MAAM,IAAIxQ,EAAiB,6BAE5B,SAASyQ,IACRD,EAAanQ,EACd,CACA8P,EAAYE,YAAYzR,IAAIf,KAAM4S,GAClC/Q,EAAGwJ,SAASrL,KAAM4S,EAAa5S,KAChC,GAlCgBsS,EAAAE,YAAc,IAAItU,QAmClCoU,CACF,wCSlIA,WAAAzS,GACUgT,EAAA9R,IAAAf,KAAU,IAAI/B,KACd6U,EAAA/R,IAAAf,KAAS,GAkEnB,CAhEQ,IAAA+S,CACNrI,GAMA,OADKsI,EAAAhT,KAAI8S,EAAA,KAAQrS,SAASiK,IAAKsI,EAAAhT,KAAI8S,EAAA,KAAQ9K,KAAK0C,GACzC,KACNsI,EAAAhT,KAAI8S,EAAA,KAAQ7D,OAAO+D,EAAAhT,KAAI8S,EAAA,KAAQhD,QAAQpF,GAAK,GAE9C,CAIO,EAAAuI,CACNC,EACAxI,GAEA,GAA6B,iBAAlBwI,EACV,IAAK,MAAMC,KAAKtV,OAAOyI,KAAK4M,GAC3BlT,KAAKiT,GAAGE,EAAGD,EAAcC,SAEpB,QAAW5S,IAAPmK,EAAkB,CAC5B,IAAI0I,EAAYJ,EAAAhT,KAAI6S,EAAA,KAASjS,IAAIsS,GAC5BE,IACJA,EAAY,GACZJ,EAAAhT,YAAae,IAAImS,EAAeE,IAEjCA,EAAUpL,KAAK0C,EAChB,CAEA,MAAO,IAAM1K,KAAKqT,IAAIH,EAAexI,EACtC,CAGO,GAAA2I,CACNH,EACAxI,GAEA,GAA6B,iBAAlBwI,EACV,IAAK,MAAMC,KAAKtV,OAAOyI,KAAK4M,GAC3BlT,KAAKqT,IAAIF,EAAGD,EAAcC,SAErB,GAAIzI,QAAiC,CAC3C,MAAM0I,EAAYJ,EAAAhT,KAAI6S,EAAA,KAASjS,IAAIsS,GAC/BE,GACHJ,EAAAhT,YAAae,IACZmS,EACAE,EAAU3C,OAAQ9E,GAAMA,IAAMjB,GAGjC,MAECsI,EAAAhT,KAAI6S,EAAA,KAAS5K,OAAOiL,EAEtB,CACO,IAAAI,CACNC,KACGjT,GAEH,MAAM8S,EAAYJ,EAAAhT,KAAI6S,EAAA,KAASjS,IAAI2S,GACnC,GAAIH,EAAW,IAAK,MAAM1I,KAAM0I,EAAW1I,EAAG0H,MAAMpS,KAAMM,GAC1D,IAAK,MAAMoK,KAAMsI,EAAAhT,KAAI8S,EAAA,KAASpI,EAAGvJ,KAAKnB,KAAMuT,KAAUjT,EACvD,yHT2EK,SAAmBoK,GACxB,IAAI8I,GAAS,EACb,MAAMC,EAAU,KACXD,IACJA,GAAS,EACT9I,MAGD,OADA7I,EAAGwJ,SAASoI,EAAS/I,EAAIA,GAClB+I,CACR,2BQxBM,SAAmBC,GACxB,OAAOlS,EAAU,CAChB,MAAAP,CAAOwB,EAAUkR,GAChB,IAAIC,EAAkD,KAEtD,OAAO,YAAwBtT,GAE1BsT,GACHC,aAAaD,GAIdA,EAAYE,WAAW,KACtBrR,EAAS2P,MAAMpS,KAAMM,GACrBsT,EAAY,MACVF,EACJ,CACD,GAEF,2CA7GM,SAAmBrT,GAKxB,MAAO,IAAO0T,IACZC,GACO,cAAcA,EACpB,WAAAnU,IAAeS,GACdP,SAASO,GACT,IAAK,MAAMsE,KAAOmP,EACjBlW,OAAO4F,eAAezD,KAAM4E,EAAK,IAC7B/G,OAAOuF,yBAAyBpD,KAAM4E,MACtCvE,GAGN,EAGJ,kGL3BmCqK,EAAgBxE,GAAO,GACrDwG,GAAuBA,GAAsB1E,KAAK0C,GAC7CxE,GAAMT,EAAQS,KAAK,4DAC7B,aKHM,SAAmB+L,EAAgB7R,GACxC,QAASvC,OAAOuF,yBAAyB6O,EAAQ7R,EAClD,oDN6fM,SAAqBuG,GAC1B,OAAO5C,EAAc3E,IAAIuH,EAC1B,6HM1YM,SAAmB+M,GACxB,OAAOlS,EAAU,CAChB,MAAAP,CAAOwB,EAAUkR,GAChB,IAAIM,EAAe,EACfL,EAAkD,KAEtD,OAAO,YAAwBtT,GAC9B,MAAM4T,EAAMnW,KAAKmW,MAGjB,GAAIA,EAAMD,GAAgBP,EAOzB,OALIE,IACHC,aAAaD,GACbA,EAAY,MAEbK,EAAeC,EACRzR,EAAS2P,MAAMpS,KAAMM,GAI7B,IAAKsT,EAAW,CACf,MAAMO,EAAgBT,GAASQ,EAAMD,GAC/BG,EAAgB,IAAI9T,GAC1BsT,EAAYE,WAAW,KACtBG,EAAelW,KAAKmW,MACpBzR,EAAS2P,MAAMpS,KAAMoU,GACrBR,EAAY,MACVO,EACJ,CACD,CACD,GAEF,qDLpEM,SACLxU,EACA0U,EACA5O,EAAe,CAAA,GAEf,MAAwB,mBAAV9F,EAwBf,SACCA,EACA0U,GACApI,UAAEA,GAAY,EAAKqI,KAAEA,GAAO,GAAU,IAEtC,IACIC,EADA7C,EAAgClE,GAEpC,MAAMgH,EAAY7O,GACjBN,EAAcoF,IACb,MAAMpB,EAAW1J,EAAM8K,GACnBiH,IAAarI,GAChBiB,GACCjF,EAAa,KACRqM,IAAalE,GACZvB,GAAWoI,EAAQhL,GACjBgL,EAAQhL,EAAUqI,GACzBA,EAAWrI,EACPiL,IACCC,GAAaA,IACjBA,EAAcxI,GACb1C,EACAhE,EAAc1F,GAAU0U,EAAQ1U,EAAYA,GAAa0U,MAGzDA,KAEH1U,IAEJ,MAAO,KACN6U,IACID,GAAaA,IAEnB,CAvDIE,CAAc9U,EAAO0U,EAAS5O,GACb,iBAAV9F,EAOX,SACCA,EACA0U,GACApI,UAAEA,GAAY,EAAKqI,KAAEA,GAAO,GAAU,IAEtC,OAAIA,EAAavI,GAAUpM,EAAO0U,EAAS,CAAEpI,cACtCtG,GACNN,EAAa,KACZiC,EAAU3H,GACNsM,GAAW3B,GAAU,IAAM+J,EAAQ1U,IACvCsM,GAAY,GACVoI,GAEL,CAnBKK,CAAY/U,EAAO0U,EAAS5O,GAC5B,MACA,MAAM,IAAIpH,MAAM,+CAChB,EAFA,EAGL,QLzHM,YAAmDiC,GACxD,IAAKA,EAAKwH,OAAQ,MAAO,GACzB,MAAM6M,EAAYxG,KAAKC,OAAO9N,EAAKoQ,IAAKkE,GAAQA,EAAI9M,SAC9CvD,EAA4B,GAElC,IAAK,IAAIiI,EAAI,EAAGA,EAAImI,EAAWnI,IAAK,CACnC,MAAMqI,EAAQvU,EAAKoQ,IAAKkE,GAAQA,EAAIpI,IACpCjI,EAAOyD,KAAK6M,EACb,CAEA,OAAOtQ,CACR"}
+{"version":3,"file":"mutts.umd.js","sources":["../src/utils.ts","../src/decorator.ts","../src/destroyable.ts","../src/indexable.ts","../src/reactive/core.ts","../src/reactive/interface.ts","../src/reactive/array.ts","../src/reactive/map.ts","../src/reactive/set.ts","../src/reactive/index.ts","../src/std-decorators.ts","../src/eventful.ts"],"sourcesContent":["type ElementTypes<T extends readonly unknown[]> = {\n\t[K in keyof T]: T[K] extends readonly (infer U)[] ? U : T[K]\n}\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\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[])\nexport function isConstructor(fn: Function): boolean {\n\treturn fn && (nativeConstructors.has(fn) || fn.toString?.().startsWith('class '))\n}\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","// 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\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\nexport type LegacyPropertyDecorator<T> = (\n\ttarget: T,\n\tname: string | symbol,\n\tdescriptor: PropertyDescriptor\n) => any\n\nexport type LegacyClassDecorator<T> = (target: T) => any\n\nexport type ModernMethodDecorator<T> = (target: T, context: ClassMethodDecoratorContext) => any\n\nexport type ModernGetterDecorator<T> = (target: T, context: ClassGetterDecoratorContext) => any\n\nexport type ModernSetterDecorator<T> = (target: T, context: ClassSetterDecoratorContext) => any\n\nexport type ModernAccessorDecorator<T> = (target: T, context: ClassAccessorDecoratorContext) => any\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\tname: PropertyKey\n) => ((this: T, ...args: any[]) => any) | void\n\ntype DDGetter<T> = (original: (this: T) => any, name: PropertyKey) => ((this: T) => any) | void\n\ntype DDSetter<T> = (\n\toriginal: (this: T, value: any) => void,\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\nexport interface DecoratorDescription<T> {\n\tmethod?: DDMethod<T>\n\tclass?: DDClass<T>\n\tgetter?: DDGetter<T>\n\tsetter?: DDSetter<T>\n\tdefault?: (...args: any[]) => any\n}\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\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\nexport function legacyDecorator<T = any>(description: DecoratorDescription<T>): any {\n\treturn function (\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, 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, 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, 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\nexport function modernDecorator<T = any>(description: DecoratorDescription<T>): any {\n\treturn function (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, 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, 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, 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, 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, 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\nexport const decorator: DecoratorFactory<any> = (description: DecoratorDescription<any>) => {\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? modernDecorator(description)(target, contextOrKey, ...args)\n\t\t\t: legacyDecorator(description)(target, contextOrKey, ...args)\n\t}) as any\n}\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())\nexport const destructor = Symbol('destructor')\nexport const allocatedValues = Symbol('allocated')\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\nexport function Destroyable<\n\tT extends new (\n\t\t...args: any[]\n\t) => any,\n\tAllocated extends Partial<typeof this>,\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\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\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\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)\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\tdeclare [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, this)\n\t\t}\n\t}\n}\n\nconst forwardProperties = Symbol('forwardProperties')\nexport const allocated = decorator({\n\tsetter(original, 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\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// Context Manager Protocol for `with` statement integration\nexport interface ContextManager<T = any> {\n\t[Symbol.dispose](): void\n\tvalue?: T\n}\n","export const getAt = Symbol('getAt')\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\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\nexport function Indexable<Items>(accessor: Accessor<any, Items>): new () => { [x: number]: Items }\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\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) {\n\t\t\t\t\t\t\tthrow new Error('Indexable class has read-only numeric index access')\n\t\t\t\t\t\t}\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","// 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 { decorator } from '../decorator'\n\nexport type DependencyFunction = <T>(cb: () => T) => T\n// TODO: proper async management, read when fn returns a promise and let the effect as \"running\",\n//  either to cancel the running one or to avoid running 2 in \"parallel\" and debounce the second one\n\n// TODO: generic \"batch\" forcing even if not in an effect (perhaps when calling a reactive' function ?)\n// example: storage will make 2 modifications (add slot, modify count), they could raise 2 effects\nexport type ScopedCallback = () => void\n\nexport type PropEvolution = {\n\ttype: 'set' | 'del' | 'add' | 'invalidate'\n\tprop: any\n}\n\nexport type BunchEvolution = {\n\ttype: 'bunch'\n\tmethod: string\n}\ntype Evolution = PropEvolution | BunchEvolution\n\ntype State =\n\t| {\n\t\t\tevolution: Evolution\n\t\t\tnext: State\n\t  }\n\t| {}\n// Track which effects are watching which reactive objects for cleanup\nconst effectToReactiveObjects = new WeakMap<ScopedCallback, Set<object>>()\n\n// Track object -> proxy and proxy -> object relationships\nconst objectToProxy = new WeakMap<object, object>()\nconst proxyToObject = new WeakMap<object, object>()\n// Deep watching data structures\n// Track which objects contain which other objects (back-references)\nconst objectParents = new WeakMap<object, Set<{ parent: object; prop: PropertyKey }>>()\n\n// Track which objects have deep watchers\nconst objectsWithDeepWatchers = new WeakSet<object>()\n\n// Track deep watchers per object\nconst deepWatchers = new WeakMap<object, Set<ScopedCallback>>()\n\n// Track which effects are doing deep watching\nconst effectToDeepWatchedObjects = new WeakMap<ScopedCallback, Set<object>>()\n\n// Track objects that should never be reactive and cannot be modified\nexport const nonReactiveObjects = new WeakSet<object>()\nconst absent = Symbol('absent')\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\n// Track effects per reactive object and property\nconst watchers = new WeakMap<object, Map<any, Set<ScopedCallback>>>()\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// Track native reactivity\nconst nativeReactive = Symbol('native-reactive')\n\n// Symbol to mark individual objects as non-reactive\nexport const nonReactiveMark = Symbol('non-reactive')\n// Symbol to mark class properties as non-reactive\nexport const unreactiveProperties = Symbol('unreactive-properties')\nexport const prototypeForwarding: unique symbol = Symbol('prototype-forwarding')\n\nexport const allProps = Symbol('all-props')\n\n// Symbol to mark functions with their root function\nconst rootFunction = Symbol('root-function')\n\n/**\n * Mark a function with its root function. If the function already has a root,\n * the root becomes the root of the new root (transitive root tracking).\n * @param fn - The function to mark\n * @param root - The root function to associate with fn\n */\nexport function markWithRoot<T extends Function>(fn: T, root: Function): T {\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 * Retrieve the root function from a callback. Returns the function itself if it has no root.\n * @param fn - The function to get the root from\n * @returns The root function, or the function itself if no root exists\n */\nexport function getRoot<T extends Function | undefined>(fn: T): T {\n\treturn (fn as any)?.[rootFunction] || fn\n}\n\nexport class ReactiveError extends Error {\n\tconstructor(message: string) {\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 * Options for the reactive system, can be configured at runtime\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: (target: Function, caller?: Function) => {},\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 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// biome-ignore lint/suspicious/noConsole: This is the whole point here\n\twarn: (...args: any[]) => console.warn(...args),\n}\n// biome-ignore-end lint/correctness/noUnusedFunctionParameters: Interface declaration with empty defaults\n\n//#region evolution\n\nfunction raiseDeps(objectWatchers: Map<any, Set<ScopedCallback>>, ...keyChains: Iterable<any>[]) {\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) for (const effect of Array.from(deps)) atomicEffect(effect)\n\t\t}\n}\n\nexport function touched1(obj: any, evolution: Evolution, prop: any) {\n\ttouched(obj, evolution, [prop])\n}\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\tif (props) raiseDeps(objectWatchers, [allProps], props)\n\t\telse raiseDeps(objectWatchers, objectWatchers.keys())\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\nconst states = new WeakMap<object, State>()\n\nfunction 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\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 dependant(obj: any, prop: any = allProps) {\n\tobj = unwrap(obj)\n\tif (activeEffect && (typeof prop !== 'symbol' || prop === allProps)) {\n\t\tlet objectWatchers = watchers.get(obj)\n\t\tif (!objectWatchers) {\n\t\t\tobjectWatchers = new Map<PropertyKey, Set<ScopedCallback>>()\n\t\t\twatchers.set(obj, objectWatchers)\n\t\t}\n\t\tlet deps = objectWatchers.get(prop)\n\t\tif (!deps) {\n\t\t\tdeps = new Set<ScopedCallback>()\n\t\t\tobjectWatchers.set(prop, deps)\n\t\t}\n\t\tdeps.add(activeEffect)\n\n\t\t// Track which reactive objects this effect is watching\n\t\tlet effectObjects = effectToReactiveObjects.get(activeEffect)\n\t\tif (!effectObjects) {\n\t\t\teffectObjects = new Set<object>()\n\t\t\teffectToReactiveObjects.set(activeEffect, effectObjects)\n\t\t}\n\t\teffectObjects.add(obj)\n\t}\n}\n\n// Stack of active effects to handle nested effects\nlet activeEffect: ScopedCallback | undefined\n// Parent effect used for lifecycle/cleanup relationships (can diverge later)\nlet parentEffect: ScopedCallback | undefined\n\n// Track currently executing effects to prevent re-execution\n// These are all the effects triggered under `activeEffect`\nlet batchedEffects: Map<Function, ScopedCallback> | undefined\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\nfunction atomicEffect(effect: ScopedCallback, immediate?: 'immediate') {\n\tconst root = getRoot(effect)\n\n\toptions?.chain(getRoot(effect), getRoot(activeEffect))\n\tif (batchedEffects) {\n\t\tbatchedEffects.set(root, effect)\n\t\tif (immediate)\n\t\t\ttry {\n\t\t\t\treturn effect()\n\t\t\t} finally {\n\t\t\t\tbatchedEffects.delete(root)\n\t\t\t}\n\t} else {\n\t\tconst runEffects: any[] = []\n\t\tbatchedEffects = new Map<Function, ScopedCallback>([[root, effect]])\n\t\tconst firstReturn: { value?: any } = {}\n\t\ttry {\n\t\t\twhile (batchedEffects.size) {\n\t\t\t\tif (runEffects.length > options.maxEffectChain)\n\t\t\t\t\tthrow new ReactiveError('[reactive] Max effect chain reached')\n\t\t\t\tconst [root, effect] = batchedEffects.entries().next().value!\n\t\t\t\trunEffects.push(root)\n\t\t\t\tconst rv = effect()\n\t\t\t\tif (!('value' in firstReturn)) firstReturn.value = rv\n\t\t\t\tbatchedEffects.delete(root)\n\t\t\t}\n\t\t\treturn firstReturn.value\n\t\t} finally {\n\t\t\tbatchedEffects = undefined\n\t\t}\n\t}\n}\n\nexport const atomic = decorator({\n\tmethod(original) {\n\t\treturn function (...args: any[]) {\n\t\t\treturn atomicEffect(\n\t\t\t\tmarkWithRoot(() => original.apply(this, args), original),\n\t\t\t\t'immediate'\n\t\t\t)\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 (...args: Args) {\n\t\t\treturn atomicEffect(\n\t\t\t\tmarkWithRoot(() => original.apply(this, args), original),\n\t\t\t\t'immediate'\n\t\t\t)\n\t\t}\n\t},\n})\n\nexport function withEffect<T>(\n\teffect: ScopedCallback | undefined,\n\tfn: () => T,\n\tkeepParent?: true\n): T {\n\tif (getRoot(effect) === getRoot(activeEffect)) return fn()\n\tconst oldActiveEffect = activeEffect\n\tconst oldParentEffect = parentEffect\n\tactiveEffect = effect\n\tif (!keepParent) parentEffect = effect\n\ttry {\n\t\treturn fn()\n\t} finally {\n\t\tactiveEffect = oldActiveEffect\n\t\tparentEffect = oldParentEffect\n\t}\n}\n\n//#endregion\n\n//#region deep watching\n\n/**\n * Add a back-reference from child to parent\n */\nfunction 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 */\nfunction removeBackReference(child: object, parent: object, prop: any) {\n\tconst parents = objectParents.get(child)\n\tif (parents) {\n\t\tparents.delete({ parent, prop })\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 */\nfunction needsBackReferences(obj: object): boolean {\n\treturn objectsWithDeepWatchers.has(obj) || hasParentWithDeepWatchers(obj)\n}\n\n/**\n * Check if an object has any parent with deep watchers\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\n/**\n * Bubble up changes through the back-reference chain\n */\nfunction 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) atomicEffect(watcher)\n\n\t\t// Continue bubbling up\n\t\tbubbleUpChange(parent, evolution)\n\t}\n}\n\nexport function track1(obj: object, prop: any, oldVal: any, newValue: any) {\n\t// Manage back-references if this object has deep watchers\n\tif (objectsWithDeepWatchers.has(obj)) {\n\t\t// Remove old back-references\n\t\tif (typeof oldVal === 'object' && oldVal !== null) {\n\t\t\tremoveBackReference(oldVal, obj, prop)\n\t\t}\n\n\t\t// Add new back-references\n\t\tif (typeof newValue === 'object' && newValue !== null) {\n\t\t\tconst reactiveValue = reactive(newValue)\n\t\t\taddBackReference(reactiveValue, obj, prop)\n\t\t}\n\t}\n\treturn newValue\n}\n\n//#endregion\n\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\t// Check if this property is marked as unreactive\n\t\tif (obj[unreactiveProperties]?.has(prop) || typeof prop === 'symbol')\n\t\t\treturn Reflect.get(obj, prop, receiver)\n\t\t// Depend if...\n\t\tif (!options.instanceMembers || Object.hasOwn(receiver, prop) || !Reflect.has(receiver, prop))\n\t\t\tdependant(obj, prop)\n\n\t\tconst value = Reflect.get(obj, prop, receiver)\n\t\tif (typeof value === 'object' && value !== null) {\n\t\t\tconst reactiveValue = reactive(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// Check if this property is marked as unreactive\n\t\tif (obj[unreactiveProperties]?.has(prop)) return Reflect.set(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\n\t\tconst oldVal = Reflect.has(receiver, prop) ? Reflect.get(obj, prop, receiver) : absent\n\t\ttrack1(obj, prop, oldVal, newValue)\n\n\t\tif (oldVal !== newValue) {\n\t\t\tReflect.set(obj, prop, newValue, receiver)\n\t\t\t// try to find a \"generic\" way to express that\n\t\t\ttouched1(obj, { type: oldVal !== absent ? 'set' : 'add', prop }, prop)\n\t\t}\n\t\treturn true\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>()\nexport class ReactiveBase {\n\tconstructor() {\n\t\t// biome-ignore lint/correctness/noConstructorReturn: This is the whole point here\n\t\treturn reactiveClasses.has(new.target) ? reactive(this) : this\n\t}\n}\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 (proxyToObject.has(target) || isNonReactive(target)) return target as T\n\n\t// If we already have a proxy for this object, return it\n\tif (objectToProxy.has(target)) return objectToProxy.get(target) 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) proxyToObject.set(proxied, target)\n\tconst proxy = new Proxy(proxied, reactiveHandlers)\n\n\t// Store the relationships\n\tobjectToProxy.set(target, proxy)\n\tproxyToObject.set(proxy, target)\n\treturn proxy as T\n}\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\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) {\n\t\treturn reactiveObject(original)\n\t},\n\tdefault: reactiveObject,\n})\n\nexport function unwrap<T>(proxy: T): T {\n\t// Return the original object\n\treturn (proxyToObject.get(proxy as any) as T) ?? proxy\n}\n\nexport function isReactive(obj: any): boolean {\n\treturn proxyToObject.has(obj)\n}\nexport function untracked(fn: () => ScopedCallback | undefined | void) {\n\twithEffect(undefined, fn, true)\n}\n\n// runEffect -> set<cleanup>\nconst effectChildren = new WeakMap<ScopedCallback, Set<ScopedCallback>>()\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 */\nexport function effect<Args extends any[]>(\n\tfn: (dep: DependencyFunction, ...args: Args) => ScopedCallback | undefined | void,\n\t...args: Args\n): ScopedCallback {\n\tlet cleanup: (() => void) | null = null\n\tconst dep = markWithRoot(<T>(cb: () => T) => withEffect(runEffect, cb), fn)\n\tlet effectStopped = false\n\n\tfunction runEffect() {\n\t\t// Clear previous dependencies\n\t\tcleanup?.()\n\n\t\toptions.enter(fn)\n\t\tconst reactionCleanup = withEffect(effectStopped ? undefined : runEffect, () =>\n\t\t\tfn(dep, ...args)\n\t\t) as undefined | ScopedCallback\n\t\toptions.leave(fn)\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}\n\t}\n\t// Mark the runEffect callback with the original function as its root\n\tmarkWithRoot(runEffect, fn)\n\n\tatomicEffect(runEffect, 'immediate')\n\n\tconst mainCleanup = (): void => {\n\t\tif (effectStopped) return\n\t\teffectStopped = true\n\t\tcleanup?.()\n\t\t// Invoke all child cleanups (recursive via subEffectCleanup calling its own mainCleanup)\n\t\tconst children = effectChildren.get(runEffect)\n\t\tif (children) {\n\t\t\tfor (const childCleanup of children) childCleanup()\n\t\t\teffectChildren.delete(runEffect)\n\t\t}\n\n\t\tfr.unregister(mainCleanup)\n\t}\n\n\t// Only ROOT effects are registered for GC cleanup\n\tif (!parentEffect) {\n\t\tconst callIfCollected = () => mainCleanup()\n\t\tfr.register(callIfCollected, mainCleanup, callIfCollected)\n\t\treturn callIfCollected\n\t}\n\t// Register this effect to be cleaned up with the parent effect\n\tlet children = effectChildren.get(parentEffect)\n\tif (!children) {\n\t\tchildren = new Set()\n\t\teffectChildren.set(parentEffect, children)\n\t}\n\tconst parent = parentEffect\n\tconst subEffectCleanup = (): void => {\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\tmainCleanup()\n\t}\n\tchildren.add(subEffectCleanup)\n\treturn subEffectCleanup\n}\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 nonReactive<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\n/**\n * Set of functions to test if an object is immutable\n */\nexport const immutables = new Set<(tested: any) => boolean>()\n\n/**\n * Check if an object is marked as non-reactive (for testing purposes)\n * @param obj - The object to check\n * @returns true if the object is marked as non-reactive\n */\nexport function isNonReactive(obj: any): boolean {\n\t// Don't make primitives reactive\n\tif (obj === null || typeof obj !== 'object') return true\n\n\t// Check if the object itself is marked as non-reactive\n\tif (nonReactiveObjects.has(obj)) return true\n\n\t// Check if the object has the non-reactive symbol\n\tif (obj[nonReactiveMark]) return true\n\n\t// Check if the object is immutable\n\tif (Array.from(immutables).some((fn) => fn(obj))) return true\n\n\treturn false\n}\n\n/**\n * Mark a class as non-reactive. All instances of this class will automatically be non-reactive.\n * @param cls - The class constructor to mark as non-reactive\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\nnonReactiveClass(Date, RegExp, Error, Promise, Function)\nif (typeof window !== 'undefined') nonReactive(window, document)\nif (typeof Element !== 'undefined') nonReactiveClass(Element, Node)\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\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 */\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 (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\n/**\n * Check if an object is an object (not null, not primitive)\n */\nfunction isObject(obj: any): obj is object {\n\treturn obj !== null && typeof obj === 'object'\n}\n","import { decorator, GenericClassDecorator } from '../decorator'\nimport { renamed } from '../utils'\nimport {\n\ttype DependencyFunction,\n\tdeepWatch,\n\tdependant,\n\teffect,\n\tgetRoot,\n\tisNonReactive,\n\tmarkWithRoot,\n\tnonReactiveClass,\n\tnonReactiveMark,\n\tnonReactiveObjects,\n\toptions,\n\ttype ScopedCallback,\n\ttouched1,\n\tunreactiveProperties,\n\tuntracked,\n\tunwrap,\n} from './core'\n\n//#region computed\nlet computedInvalidations: (() => void)[] | undefined\n/**\n * When used in a computed property computation, it will register the callback to be called when the computed property is invalidated\n * @param cb - The callback to register\n * @param warn - Whether to warn if used outside of a computed property\n */\nexport function invalidateComputed(cb: () => void, warn = true) {\n\tif (computedInvalidations) computedInvalidations.push(cb)\n\telse if (warn) options.warn('Using `invalidateComputed` outside of a computed property')\n}\ntype ComputedFunction<T> = (dep: DependencyFunction) => T\nconst computedCache = new WeakMap<ComputedFunction<any>, any>()\nfunction computedFunction<T>(getter: ComputedFunction<T>): T {\n\tconst key = getRoot(getter)\n\tlet invalidations: (() => void)[] = []\n\tdependant(computedCache, key)\n\tif (computedCache.has(key)) return computedCache.get(key)\n\tlet stopped = false\n\tconst stop = effect(\n\t\tmarkWithRoot((dep) => {\n\t\t\tif (stopped) return\n\t\t\tconst oldCI = computedInvalidations\n\t\t\tif (computedCache.has(key)) {\n\t\t\t\t// This should *not* be called in the cleanup chain, as its effects would be lost and cleaned-up\n\t\t\t\tfor (const cb of invalidations) cb()\n\t\t\t\tinvalidations = []\n\t\t\t\tcomputedCache.delete(key)\n\t\t\t\ttouched1(computedCache, { type: 'invalidate', prop: key }, key)\n\t\t\t\tstop()\n\t\t\t\tstopped = true\n\t\t\t} else\n\t\t\t\ttry {\n\t\t\t\t\tcomputedInvalidations = invalidations\n\t\t\t\t\tcomputedCache.set(key, getter(dep))\n\t\t\t\t} finally {\n\t\t\t\t\tcomputedInvalidations = oldCI\n\t\t\t\t}\n\t\t}, getter)\n\t)\n\treturn computedCache.get(key)\n}\n\n/**\n * Get the cached value of a computed function - cache is invalidated when the dependencies change\n */\nexport const computed = decorator({\n\tgetter(original, propertyKey) {\n\t\tconst computers = new WeakMap<any, () => any>()\n\t\treturn function (this: any) {\n\t\t\tif (!computers.has(this)) {\n\t\t\t\tcomputers.set(\n\t\t\t\t\tthis,\n\t\t\t\t\trenamed(\n\t\t\t\t\t\t() => original.call(this),\n\t\t\t\t\t\t`${String(this.constructor.name)}.${String(propertyKey)}`\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t}\n\t\t\treturn computedFunction(computers.get(this)!)\n\t\t}\n\t},\n\tdefault<T>(getter: ComputedFunction<T>): T {\n\t\treturn computedFunction(getter)\n\t},\n})\n\n//#endregion\n\n//#region watch\n\nconst unsetYet = Symbol('unset-yet')\nexport interface WatchOptions {\n\timmediate?: boolean\n\tdeep?: boolean\n}\nexport function watch<T>(\n\tvalue: (dep: DependencyFunction) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep?: false }\n): ScopedCallback\nexport function watch<T extends object | any[]>(\n\tvalue: (dep: DependencyFunction) => T,\n\tchanged: (value: T, oldValue?: T) => void,\n\toptions?: Omit<WatchOptions, 'deep'> & { deep: true }\n): ScopedCallback\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: DependencyFunction) => 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'\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(\n\t\tmarkWithRoot(() => {\n\t\t\tdependant(value)\n\t\t\tif (immediate) untracked(() => changed(value))\n\t\t\timmediate = true\n\t\t}, changed)\n\t)\n}\n\nfunction watchCallBack<T>(\n\tvalue: (dep: DependencyFunction) => 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((dep) => {\n\t\t\tconst newValue = value(dep)\n\t\t\tif (oldValue !== newValue)\n\t\t\t\tuntracked(\n\t\t\t\t\tmarkWithRoot(() => {\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\tmarkWithRoot((value) => changed(value as T, value as T), changed)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t}\n\t\t\t\t\t}, changed)\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\tfor (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}\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\nimport { profileInfo } from './core'\n\nObject.assign(profileInfo, { computedCache })\n","import { Indexable } from '../indexable'\nimport {\n\tdependant,\n\tmakeReactiveEntriesIterator,\n\tmakeReactiveIterator,\n\tprototypeForwarding,\n\treactive,\n\ttouched,\n} from './core'\n\nconst native = Symbol('native')\nconst isArray = Array.isArray\nArray.isArray = ((value: any) =>\n\t// biome-ignore lint/suspicious/useIsArray: We are defining it\n\tisArray(value) || (value instanceof Array && native in value)) as any\nclass ReactiveBaseArray {\n\tdeclare readonly [native]: any[]\n}\nfunction* index(i: number, { length = true } = {}): IterableIterator<number | 'length'> {\n\tyield i\n\tif (length) yield 'length'\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\tfor (let i = start; i <= end; i++) yield i\n\tif (length) yield 'length'\n}\nexport class ReactiveArray extends Indexable(ReactiveBaseArray, {\n\tget(i: number): any {\n\t\tdependant(this[native], 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[native], { type: 'bunch', method: 'set' }, index(i, { length: added }))\n\t},\n\tgetLength() {\n\t\tdependant(this[native], '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(\n\t\t\t\tthis[native],\n\t\t\t\t{ type: 'set', prop: 'length' },\n\t\t\t\trange(oldLength, value, { length: true })\n\t\t\t)\n\t\t}\n\t},\n}) {\n\tdeclare length: number\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\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\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\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[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\ttry {\n\t\t\treturn this[native].sort(compareFn) 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\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)\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\treturn this[native].indexOf(searchElement, fromIndex)\n\t}\n\n\tlastIndexOf(searchElement: any, fromIndex?: number): number {\n\t\tdependant(this)\n\t\treturn this[native].lastIndexOf(searchElement, fromIndex)\n\t}\n\n\tincludes(searchElement: any, fromIndex?: number): boolean {\n\t\tdependant(this)\n\t\treturn this[native].includes(searchElement, fromIndex)\n\t}\n\n\tfind(\n\t\tpredicate: (this: any, value: any, index: number, obj: any[]) => boolean,\n\t\tthisArg?: any\n\t): any {\n\t\tdependant(this)\n\t\treturn reactive(this[native].find(predicate, thisArg))\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\t\tdependant(this)\n\t\treturn this[native].findIndex(predicate, thisArg)\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(this[native].filter(callbackfn as any, thisArg))\n\t}\n\n\tmap(callbackfn: (value: any, index: number, array: any[]) => any, thisArg?: any): any[] {\n\t\tdependant(this)\n\t\treturn reactive(this[native].map(callbackfn as any, thisArg))\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(callbackfn as any, thisArg)\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(callbackfn as any, thisArg)\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(callbackfn as any, thisArg)\n\t}\n}\n","import {\n\tdependant,\n\tmakeReactiveEntriesIterator,\n\tmakeReactiveIterator,\n\tprototypeForwarding,\n\treactive,\n\ttouched,\n\ttouched1,\n} from './core'\n\nconst native = Symbol('native')\n\nexport class ReactiveWeakMap<K extends object, V> {\n\tdeclare readonly [native]: WeakMap<K, V>\n\tdeclare readonly 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('content') },\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\t// Trigger effects for the specific key\n\t\ttouched1(this.content, { type: this[native].has(key) ? 'set' : 'add', prop: key }, key)\n\t\tthis[native].set(key, value)\n\n\t\treturn this\n\t}\n}\n\nexport class ReactiveMap<K, V> {\n\tdeclare readonly [native]: Map<K, V>\n\tdeclare readonly 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('content') },\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\tconst evolution = { type: hadKey ? 'set' : 'add', 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 this\n\t}\n}\n","import {\n\tdependant,\n\tmakeReactiveEntriesIterator,\n\tmakeReactiveIterator,\n\tprototypeForwarding,\n\treactive,\n\ttouched,\n\ttouched1,\n} from './core'\n\nconst native = Symbol('native')\n\nexport class ReactiveWeakSet<T extends object> {\n\tdeclare readonly [native]: WeakSet<T>\n\tdeclare readonly 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('content') },\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\nexport class ReactiveSet<T> {\n\tdeclare readonly [native]: Set<T>\n\tdeclare readonly 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('content') },\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 {\n\tatomic,\n\teffect,\n\tgetState,\n\timmutables,\n\tisNonReactive,\n\tisReactive,\n\toptions as reactiveOptions,\n\tprofileInfo,\n\tReactiveBase,\n\tReactiveError,\n\treactive,\n\ttype ScopedCallback,\n\tuntracked,\n\tunwrap,\n} from './core'\nexport { computed, invalidateComputed, unreactive, watch } from './interface'\n\nimport { ReactiveArray } from './array'\nimport { registerNativeReactivity } from './core'\nimport { ReactiveMap, ReactiveWeakMap } from './map'\nimport { ReactiveSet, ReactiveWeakSet } from './set'\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","import { decorator, 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 }[] = []\nexport const cached = decorator({\n\tgetter(original, 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\nexport function isCached(object: Object, propertyKey: PropertyKey) {\n\treturn !!Object.getOwnPropertyDescriptor(object, propertyKey)\n}\n\nexport function cache(object: Object, propertyKey: PropertyKey, value: any) {\n\tObject.defineProperty(object, propertyKey, { value })\n}\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\nexport const deprecated = Object.assign(\n\tdecorator({\n\t\tmethod(original, 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, 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, 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, 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, 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, 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\nexport function debounce(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _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\nexport function throttle(delay: number) {\n\treturn decorator({\n\t\tmethod(original, _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 class Eventful<Events extends Record<string, (...args: any[]) => void>> {\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"],"names":["nativeConstructors","Set","Object","Array","Date","Function","Map","WeakMap","WeakSet","Promise","Error","TypeError","ReferenceError","SyntaxError","RangeError","URIError","EvalError","Reflect","Proxy","RegExp","String","Number","Boolean","isConstructor","fn","has","toString","startsWith","renamed","fct","name","defineProperties","value","DecoratorError","constructor","message","super","this","legacyDecorator","description","target","propertyKey","descriptor","args","undefined","class","includes","newGetter","getter","get","newSetter","setter","set","newMethod","method","default","call","modernDecorator","context","kind","rv","decorator","contextOrKey","mode","_target","detectDecoratorMode","fr","FinalizationRegistry","f","destructor","Symbol","allocatedValues","DestructionError","msg","destroyedHandler","toStringTag","throw","allocated","original","getAt","setAt","Indexable","base","accessor","index","setPrototypeOf","prototype","prop","receiver","getOwnPropertyDescriptor","getLength","numProp","isNaN","setLength","defineProperty","writable","enumerable","configurable","effectToReactiveObjects","objectToProxy","proxyToObject","objectParents","objectsWithDeepWatchers","deepWatchers","effectToDeepWatchedObjects","nonReactiveObjects","absent","makeReactiveIterator","iterator","result","next","done","reactive","makeReactiveEntriesIterator","key","watchers","profileInfo","nativeReactive","nonReactiveMark","unreactiveProperties","prototypeForwarding","allProps","rootFunction","markWithRoot","root","getRoot","ReactiveError","options","enter","effect","leave","chain","caller","maxEffectChain","maxDeepWatchDepth","instanceMembers","warn","raiseDeps","objectWatchers","keyChains","keys","deps","from","atomicEffect","touched1","obj","evolution","touched","props","unwrap","state","getState","assign","states","addState","bubbleUpChange","dependant","activeEffect","add","effectObjects","parentEffect","batchedEffects","immediate","delete","runEffects","firstReturn","size","length","entries","push","atomic","apply","withEffect","keepParent","oldActiveEffect","oldParentEffect","addBackReference","child","parent","parents","removeBackReference","needsBackReferences","hasParentWithDeepWatchers","changedObject","parentDeepWatchers","watcher","reactiveHandlers","hasOwn","reactiveValue","isArrayCase","newValue","oldVal","track1","type","deleteProperty","getPrototypeOf","proto","ownKeys","reactiveClasses","ReactiveBase","reactiveObject","anyTarget","isNonReactive","proxied","proxy","Reactive","untracked","effectChildren","cleanup","dep","cb","runEffect","effectStopped","reactionCleanup","reactiveObj","mainCleanup","children","childCleanup","unregister","callIfCollected","register","subEffectCleanup","immutables","some","nonReactiveClass","cls","c","registerNativeReactivity","originalClass","reactiveClass","deepWatch","callback","wrappedCallback","visited","traverseAndTrack","depth","isObject","isArray","i","_key","computedInvalidations","window","o","nonReactive","document","Element","Node","computedCache","computedFunction","invalidations","stopped","stop","oldCI","computed","computers","unsetYet","deepNonReactive","unreactive","arg1","arg","native","ReactiveBaseArray","range","a","b","start","Math","min","end","max","ReactiveArray","added","oldLength","native$2","at","actualIndex","items","pop","shift","unshift","splice","deleteCount","reverse","sort","compareFn","fill","copyWithin","toReversed","toSorted","toSpliced","with","values","nativeIterator","indexOf","searchElement","fromIndex","lastIndexOf","find","predicate","thisArg","findIndex","flat","flatMap","callbackfn","filter","map","reduce","initialValue","reduceRight","slice","concat","join","separator","forEach","every","ReactiveMap","native$1","content","clear","hadEntries","hadKey","oldValue","ReactiveSet","had","res","syncCalculating","cached","alreadyCalculating","object","cache","deprecated","destructorObj","_a","destroy","destructors","getOwnPropertyNames","isDestroyable","myDestructor","destruction","_Eventful_events","_Eventful_hooks","hook","__classPrivateFieldGet","on","eventOrEvents","e","callbacks","off","emit","event","called","forward","delay","_propertyKey","timeoutId","clearTimeout","setTimeout","properties","Base","lastCallTime","now","remainingTime","scheduledArgs","changed","deep","deepCleanup","cbCleanup","watchCallBack","watchObject","minLength","arr","tuple"],"mappings":"4OAiBA,MAAMA,EAAqB,IAAIC,IAAc,CAC5CC,OACAC,MACAC,KACAC,SACAJ,IACAK,IACAC,QACAC,QACAC,QACAC,MACAC,UACAC,eACAC,YACAC,WACAC,SACAC,UACAC,QACAC,MACAC,OACAC,OACAC,OACAC,UAEK,SAAUC,EAAcC,GAC7B,OAAOA,IAAOxB,EAAmByB,IAAID,IAAOA,EAAGE,aAAaC,WAAW,UACxE,CAEM,SAAUC,EAA4BC,EAAQC,GACnD,OAAO5B,OAAO6B,iBAAiBF,EAAK,CACnCC,KAAM,CACLE,MAAOF,IAGV,CC9CM,MAAOG,UAAuBvB,MACnC,WAAAwB,CAAYC,GACXC,MAAMD,GACNE,KAAKP,KAAO,oBACb,EAkFK,SAAUQ,EAAyBC,GACxC,OAAO,SACNC,EACAC,EACAC,KACGC,GAEH,QAAoBC,IAAhBH,GACH,GAAIlB,EAAciB,GAAS,CAC1B,KAAM,UAAWD,GAAc,MAAM,IAAI7B,MAAM,0CAC/C,OAAO6B,EAAYM,QAAQL,EAC5B,OACM,GAAsB,iBAAXA,GAAuB,CAAC,SAAU,UAAUM,gBAAgBL,GAAc,CAC3F,IAAKC,EAAY,MAAM,IAAIhC,MAAM,0CAC5B,GAA0B,iBAAfgC,GAA2B,iBAAkBA,EAAY,CACxE,GAAI,QAASA,GAAc,QAASA,EAAY,CAC/C,KAAM,WAAYH,MAAe,WAAYA,GAC5C,MAAM,IAAI7B,MAAM,qDACjB,GAAI,WAAY6B,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,SAASN,EAAWO,IAAKR,GACnDM,IAAWL,EAAWO,IAAMF,EACjC,CACA,GAAI,WAAYR,EAAa,CAC5B,MAAMW,EAAYX,EAAYY,SAAST,EAAWU,IAAKX,GACnDS,IAAWR,EAAWU,IAAMF,EACjC,CACA,OAAOR,CACR,CAAO,GAAgC,mBAArBA,EAAWV,MAAsB,CAClD,KAAM,WAAYO,GAAc,MAAM,IAAI7B,MAAM,2CAChD,MAAM2C,EAAYd,EAAYe,SAASZ,EAAWV,MAAOS,GAEzD,OADIY,IAAWX,EAAWV,MAAQqB,GAC3BX,CACR,CACD,CACD,CACA,KAAM,YAAaH,GAClB,MAAM,IAAI7B,MAAM,kDACjB,OAAO6B,EAAYgB,QAAQC,KAAKnB,KAAMG,EAAQC,EAAaC,KAAeC,EAC3E,CACD,CAEM,SAAUc,EAAyBlB,GACxC,OAAO,SAAUC,EAAakB,KAA+Bf,GAC5D,IAAKe,GAASC,MAAgC,iBAAjBD,EAAQC,KAAmB,CACvD,KAAM,YAAapB,GAClB,MAAM,IAAI7B,MAAM,kDACjB,OAAO6B,EAAYgB,QAAQC,KAAKnB,KAAMG,EAAQkB,KAAYf,EAC3D,CACA,OAAQe,EAAQC,MACf,IAAK,QACJ,KAAM,UAAWpB,GAAc,MAAM,IAAI7B,MAAM,0CAC/C,OAAO6B,EAAYM,QAAQL,GAC5B,IAAK,QACJ,MAAM,IAAI9B,MAAM,0CACjB,IAAK,SACJ,KAAM,WAAY6B,GAAc,MAAM,IAAI7B,MAAM,2CAChD,OAAO6B,EAAYS,SAASR,EAAQkB,EAAQ5B,MAC7C,IAAK,SACJ,KAAM,WAAYS,GAAc,MAAM,IAAI7B,MAAM,2CAChD,OAAO6B,EAAYY,SAASX,EAAQkB,EAAQ5B,MAC7C,IAAK,SACJ,KAAM,WAAYS,GAAc,MAAM,IAAI7B,MAAM,2CAChD,OAAO6B,EAAYe,SAASd,EAAQkB,EAAQ5B,MAC7C,IAAK,WAAY,CAChB,KAAM,WAAYS,MAAe,WAAYA,GAC5C,MAAM,IAAI7B,MAAM,qDACjB,MAAMkD,EAAsD,CAAA,EAC5D,GAAI,WAAYrB,EAAa,CAC5B,MAAMQ,EAAYR,EAAYS,SAASR,EAAOS,IAAKS,EAAQ5B,MACvDiB,IAAWa,EAAGX,IAAMF,EACzB,CACA,GAAI,WAAYR,EAAa,CAC5B,MAAMW,EAAYX,EAAYY,SAASX,EAAOY,IAAKM,EAAQ5B,MACvDoB,IAAWU,EAAGR,IAAMF,EACzB,CACA,OAAOU,CACR,EAGF,CACD,CAuBO,MAAMC,EAAoCtB,GAChD,CAASC,EAAasB,KAAuBnB,KAC5C,MAAMoB,EAnBR,SACCC,EACAF,GAKA,MACyB,iBAAjBA,GACU,OAAjBA,GAC6B,iBAAtBA,EAAaH,KAEb,SAED,QACR,CAIeM,CAAoBzB,EAAQsB,EAAcnB,EAAK,IAC5D,MAAgB,WAAToB,EACJN,EAAgBlB,EAAhBkB,CAA6BjB,EAAQsB,KAAiBnB,GACtDL,EAAgBC,EAAhBD,CAA6BE,EAAQsB,KAAiBnB,EACzD,ECrMIuB,EAAK,IAAIC,qBAAkCC,GAAMA,KAC1CC,EAAaC,OAAO,cACpBC,EAAkBD,OAAO,aAChC,MAAOE,UAAyB9D,MACrC,YAAO,CAAiB+D,GACvB,MAAO,KACN,MAAM,IAAID,EAAiBC,GAE7B,CACA,WAAAvC,CAAYuC,GACXrC,MAAM,wBAAwBqC,KAC9BpC,KAAKP,KAAO,sBACb,EAED,MAAM4C,EAAmB,CACxB,CAACJ,OAAOK,aAAc,oBACtB1B,IAAKuB,EAAiBI,MAAM,kCAC5BxB,IAAKoB,EAAiBI,MAAM,mCAiHtB,MAAMC,EAAYhB,EAAU,CAClCV,OAAM,CAAC2B,EAAUrC,IACT,SAAUT,GAEhB,OADAK,KAAKkC,GAAiB9B,GAAeT,EAC9B8C,EAAStB,KAAKnB,KAAML,EAC5B,2YC1IW+C,EAAQT,OAAO,SACfU,EAAQV,OAAO,SAoCtB,SAAUW,EACfC,EACAC,GAEID,GAAwB,mBAATA,IAClBC,EAAWD,EACXA,OAAOtC,GAEHsC,IAEJA,EAAO,SAEHC,IACJA,EAAW,CACV,GAAAlC,CAAemC,GACd,GAA2B,mBAAhB/C,KAAK0C,GACf,MAAM,IAAIrE,MAAM,+CAEjB,OAAO2B,KAAK0C,GAAOK,EACpB,EACA,GAAAhC,CAAegC,EAAepD,GAC7B,GAA2B,mBAAhBK,KAAK2C,GACf,MAAM,IAAItE,MAAM,sDAEjB2B,KAAK2C,GAAOI,EAAOpD,EACpB,IAIF,MAAeiD,UAAmBC,GAsDlC,OAlDAhF,OAAOmF,eACNJ,EAAUK,UACV,IAAIpE,MAAOgE,EAAcI,UAAW,CAEnC,CAAChB,OAAOK,aAAc,kBACtB,GAAA1B,CAAIT,EAAQ+C,EAAMC,GACjB,GAAID,KAAQ/C,EAAQ,CACnB,MAAMQ,EAAS9C,OAAOuF,yBAAyBjD,EAAQ+C,IAAOtC,IAC9D,OAAOD,EAASA,EAAOQ,KAAKgC,GAAYhD,EAAO+C,EAChD,CACA,GAAoB,iBAATA,EAAmB,CAC7B,GAAa,WAATA,GAAqBJ,EAASO,UAAW,OAAOP,EAASO,UAAUlC,KAAKgC,GAC5E,MAAMG,EAAUtE,OAAOkE,GACvB,IAAKlE,OAAOuE,MAAMD,GACjB,OAAOR,EAASlC,IAAKO,KAAKgC,EAAUG,EAEtC,CAED,EACA,GAAAvC,CAAIZ,EAAQ+C,EAAMvD,EAAOwD,GACxB,GAAID,KAAQ/C,EAAQ,CACnB,MAAMW,EAASjD,OAAOuF,yBAAyBjD,EAAQ+C,IAAOnC,IAG9D,OAFID,EAAQA,EAAOK,KAAKgC,EAAUxD,GAC7BQ,EAAO+C,GAAQvD,GACb,CACR,CACA,GAAoB,iBAATuD,EAAmB,CAC7B,GAAa,WAATA,GAAqBJ,EAASU,UAEjC,OADAV,EAASU,UAAUrC,KAAKgC,EAAUxD,IAC3B,EAER,MAAM2D,EAAUtE,OAAOkE,GACvB,IAAKlE,OAAOuE,MAAMD,GAAU,CAC3B,IAAKR,EAAS/B,IACb,MAAM,IAAI1C,MAAM,sDAGjB,OADAyE,EAAS/B,IAAKI,KAAKgC,EAAUG,EAAS3D,IAC/B,CACR,CACD,CAOA,OANA9B,OAAO4F,eAAeN,EAAUD,EAAM,CACrCvD,QACA+D,UAAU,EACVC,YAAY,EACZC,cAAc,KAER,CACR,KAGKhB,CACR,CC1FA,MAAMiB,EAA0B,IAAI3F,QAG9B4F,EAAgB,IAAI5F,QACpB6F,EAAgB,IAAI7F,QAGpB8F,EAAgB,IAAI9F,QAGpB+F,EAA0B,IAAI9F,QAG9B+F,EAAe,IAAIhG,QAGnBiG,EAA6B,IAAIjG,QAG1BkG,EAAqB,IAAIjG,QAChCkG,EAASpC,OAAO,UAIhB,SAAWqC,EAAwBC,GACxC,IAAIC,EAASD,EAASE,OACtB,MAAQD,EAAOE,YACRC,GAASH,EAAO7E,OACtB6E,EAASD,EAASE,MAEpB,CAKM,SAAWG,EAAkCL,GAClD,IAAIC,EAASD,EAASE,OACtB,MAAQD,EAAOE,MAAM,CACpB,MAAOG,EAAKlF,GAAS6E,EAAO7E,WACtB,CAACgF,GAASE,GAAMF,GAAShF,IAC/B6E,EAASD,EAASE,MACnB,CACD,CAGA,MAAMK,EAAW,IAAI5G,QAER6G,EAAmB,CAC/BjB,gBACAC,gBACAF,0BACAiB,WACAd,gBACAC,0BACAC,eACAC,6BACAC,sBAGKY,EAAiB/C,OAAO,mBAGjBgD,EAAkBhD,OAAO,gBAEzBiD,EAAuBjD,OAAO,yBAC9BkD,EAAqClD,OAAO,wBAE5CmD,EAAWnD,OAAO,aAGzBoD,EAAepD,OAAO,iBAQtB,SAAUqD,EAAiCnG,EAAOoG,GAEvD,OAAO1H,OAAO4F,eAAetE,EAAIkG,EAAc,CAC9C1F,MAAO6F,EAAQD,GACf7B,UAAU,GAEZ,CAOM,SAAU8B,EAAwCrG,GACvD,OAAQA,IAAakG,IAAiBlG,CACvC,CAEM,MAAOsG,UAAsBpH,MAClC,WAAAwB,CAAYC,GACXC,MAAMD,GACNE,KAAKP,KAAO,eACb,EAOM,MAAMiG,EAAU,CAKtBC,MAAQC,MAKRC,MAAQD,MAMRE,MAAO,CAAC3F,EAAkB4F,OAM1BC,eAAgB,IAMhBC,kBAAmB,IAMnBC,iBAAiB,EAEjBC,KAAM,IAAI7F,QAMX,SAAS8F,EAAUC,KAAkDC,GACpE,IAAK,MAAMC,KAAQD,EAClB,IAAK,MAAMzB,KAAO0B,EAAM,CACvB,MAAMC,EAAOH,EAAezF,IAAIiE,GAChC,GAAI2B,EAAM,IAAK,MAAMZ,KAAU9H,MAAM2I,KAAKD,GAAOE,EAAad,EAC/D,CACF,UAEgBe,EAASC,EAAUC,EAAsB3D,GACxD4D,EAAQF,EAAKC,EAAW,CAAC3D,GAC1B,UAEgB4D,EAAQF,EAAUC,EAAsBE,IAiBxD,SAAkBH,EAAUC,GAC3BD,EAAMI,GAAOJ,GACb,MAAMnC,EAAO,CAAA,EACPwC,EAAQC,EAASN,GACnBK,GAAOpJ,OAAOsJ,OAAOF,EAAO,CAAEJ,YAAWpC,SAC7C2C,EAAOrG,IAAI6F,EAAKnC,EACjB,CArBC4C,CADAT,EAAMI,GAAOJ,GACCC,GACd,MAAMR,EAAiBvB,EAASlE,IAAIgG,GAChCP,IACCU,EAAOX,EAAUC,EAAgB,CAACjB,GAAW2B,GAC5CX,EAAUC,EAAgBA,EAAeE,SAI3CtC,EAAwB7E,IAAIwH,IAC/BU,GAAeV,EAEjB,CAEA,MAAMQ,EAAS,IAAIlJ,QAUb,SAAUgJ,EAASN,GACxBA,EAAMI,GAAOJ,GACb,IAAIK,EAAQG,EAAOxG,IAAIgG,GAKvB,OAJKK,IACJA,EAAQ,CAAA,EACRG,EAAOrG,IAAI6F,EAAKK,IAEVA,CACR,UAEgBM,EAAUX,EAAU1D,EAAYkC,GAE/C,GADAwB,EAAMI,GAAOJ,GACTY,IAAiC,iBAATtE,GAAqBA,IAASkC,GAAW,CACpE,IAAIiB,EAAiBvB,EAASlE,IAAIgG,GAC7BP,IACJA,EAAiB,IAAIpI,IACrB6G,EAAS/D,IAAI6F,EAAKP,IAEnB,IAAIG,EAAOH,EAAezF,IAAIsC,GACzBsD,IACJA,EAAO,IAAI5I,IACXyI,EAAetF,IAAImC,EAAMsD,IAE1BA,EAAKiB,IAAID,GAGT,IAAIE,EAAgB7D,EAAwBjD,IAAI4G,GAC3CE,IACJA,EAAgB,IAAI9J,IACpBiG,EAAwB9C,IAAIyG,EAAcE,IAE3CA,EAAcD,IAAIb,EACnB,CACD,CAGA,IAAIY,EAEAG,EAIAC,EAIJ,SAASlB,EAAad,EAAwBiC,GAC7C,MAAMtC,EAAOC,EAAQI,GAGrB,GADAF,GAASI,MAAMN,EAAQI,GAASJ,EAAQgC,IACpCI,GAEH,GADAA,EAAe7G,IAAIwE,EAAMK,GACrBiC,EACH,IACC,OAAOjC,GACR,SACCgC,EAAeE,OAAOvC,EACvB,MACK,CACN,MAAMwC,EAAoB,GAC1BH,EAAiB,IAAI3J,IAA8B,CAAC,CAACsH,EAAMK,KAC3D,MAAMoC,EAA+B,CAAA,EACrC,IACC,KAAOJ,EAAeK,MAAM,CAC3B,GAAIF,EAAWG,OAASxC,EAAQM,eAC/B,MAAM,IAAIP,EAAc,uCACzB,MAAOF,EAAMK,GAAUgC,EAAeO,UAAU1D,OAAO9E,MACvDoI,EAAWK,KAAK7C,GAChB,MAAMhE,EAAKqE,IACL,UAAWoC,IAAcA,EAAYrI,MAAQ4B,GACnDqG,EAAeE,OAAOvC,EACvB,CACA,OAAOyC,EAAYrI,KACpB,SACCiI,OAAiBrH,CAClB,CACD,CACD,CAEO,MAAM8H,EAAS7G,EAAU,CAC/BP,OAAOwB,GACC,YAAanC,GACnB,OAAOoG,EACNpB,EAAa,IAAM7C,EAAS6F,MAAMtI,KAAMM,GAAOmC,GAC/C,YAEF,EAEDvB,QACCuB,GAEO,YAAanC,GACnB,OAAOoG,EACNpB,EAAa,IAAM7C,EAAS6F,MAAMtI,KAAMM,GAAOmC,GAC/C,YAEF,aAIc8F,GACf3C,EACAzG,EACAqJ,GAEA,GAAIhD,EAAQI,KAAYJ,EAAQgC,GAAe,OAAOrI,IACtD,MAAMsJ,EAAkBjB,EAClBkB,EAAkBf,EACxBH,EAAe5B,EACV4C,IAAYb,EAAe/B,GAChC,IACC,OAAOzG,GACR,SACCqI,EAAeiB,EACfd,EAAee,CAChB,CACD,CASA,SAASC,GAAiBC,EAAeC,EAAgB3F,GACxD,IAAI4F,EAAU9E,EAAcpD,IAAIgI,GAC3BE,IACJA,EAAU,IAAIlL,IACdoG,EAAcjD,IAAI6H,EAAOE,IAE1BA,EAAQrB,IAAI,CAAEoB,SAAQ3F,QACvB,CAKA,SAAS6F,GAAoBH,EAAeC,EAAgB3F,GAC3D,MAAM4F,EAAU9E,EAAcpD,IAAIgI,GAC9BE,IACHA,EAAQhB,OAAO,CAAEe,SAAQ3F,SACJ,IAAjB4F,EAAQb,MACXjE,EAAc8D,OAAOc,GAGxB,CAKA,SAASI,GAAoBpC,GAC5B,OAAO3C,EAAwB7E,IAAIwH,IAAQqC,GAA0BrC,EACtE,CAKA,SAASqC,GAA0BrC,GAClC,MAAMkC,EAAU9E,EAAcpD,IAAIgG,GAClC,IAAKkC,EAAS,OAAO,EAErB,IAAK,MAAMD,OAAEA,KAAYC,EAAS,CACjC,GAAI7E,EAAwB7E,IAAIyJ,GAAS,OAAO,EAChD,GAAII,GAA0BJ,GAAS,OAAO,CAC/C,CACA,OAAO,CACR,CAKA,SAASvB,GAAe4B,EAAuBrC,GAC9C,MAAMiC,EAAU9E,EAAcpD,IAAIsI,GAClC,GAAKJ,EAEL,IAAK,MAAMD,OAAEA,KAAYC,EAAS,CAEjC,MAAMK,EAAqBjF,EAAatD,IAAIiI,GAC5C,GAAIM,EAAoB,IAAK,MAAMC,KAAWD,EAAoBzC,EAAa0C,GAG/E9B,GAAeuB,EAChB,CACD,CAqBA,MAAMQ,GAAmB,CACxB,CAACpH,OAAOK,aAAc,iBACtB,GAAA1B,CAAIgG,EAAU1D,EAAmBC,GAChC,GAAID,IAAS+B,EAAiB,OAAO,EAErC,GAAI2B,EAAI1B,IAAuB9F,IAAI8D,IAAyB,iBAATA,EAClD,OAAOtE,QAAQgC,IAAIgG,EAAK1D,EAAMC,GAE1BuC,EAAQQ,kBAAmBrI,OAAOyL,OAAOnG,EAAUD,IAAUtE,QAAQQ,IAAI+D,EAAUD,IACvFqE,EAAUX,EAAK1D,GAEhB,MAAMvD,EAAQf,QAAQgC,IAAIgG,EAAK1D,EAAMC,GACrC,GAAqB,iBAAVxD,GAAgC,OAAVA,EAAgB,CAChD,MAAM4J,EAAgB5E,GAAShF,GAO/B,OAJIqJ,GAAoBpC,IACvB+B,GAAiBY,EAAe3C,EAAK1D,GAG/BqG,CACR,CACA,OAAO5J,CACR,EACA,GAAAoB,CAAI6F,EAAU1D,EAAmBvD,EAAYwD,GAE5C,GAAIyD,EAAI1B,IAAuB9F,IAAI8D,GAAO,OAAOtE,QAAQmC,IAAI6F,EAAK1D,EAAMvD,EAAOwD,GAE/E,MAAMqG,EACLrE,KAAuByB,GAEvBA,EAAIzB,aAAgCrH,SAClCkB,OAAOuE,MAAMvE,OAAOkE,KAAmB,WAATA,GAC3BuG,EAAWzC,GAAOrH,GAExB,GAAI6J,EAEH,OADE5C,EAAY1D,GAAQuG,GACf,EAGR,MAAMC,EAAS9K,QAAQQ,IAAI+D,EAAUD,GAAQtE,QAAQgC,IAAIgG,EAAK1D,EAAMC,GAAYkB,EAQhF,OAnEI,SAAiBuC,EAAa1D,EAAWwG,EAAaD,GAEvDxF,EAAwB7E,IAAIwH,KAET,iBAAX8C,GAAkC,OAAXA,GACjCX,GAAoBW,EAAQ9C,EAAK1D,GAIV,iBAAbuG,GAAsC,OAAbA,IAEnCd,GADsBhE,GAAS8E,GACC7C,EAAK1D,EAIxC,CA6CEyG,CAAO/C,EAAK1D,EAAMwG,EAAQD,GAEtBC,IAAWD,IACd7K,QAAQmC,IAAI6F,EAAK1D,EAAMuG,EAAUtG,GAEjCwD,EAASC,EAAK,CAAEgD,KAAMF,IAAWrF,EAAS,MAAQ,MAAOnB,QAAQA,KAE3D,CACR,EACA,cAAA2G,CAAejD,EAAU1D,GACxB,IAAKrF,OAAOyL,OAAO1C,EAAK1D,GAAO,OAAO,EAEtC,MAAMwG,EAAU9C,EAAY1D,GAe5B,OAZIe,EAAwB7E,IAAIwH,IAA0B,iBAAX8C,GAAkC,OAAXA,GACrEX,GAAoBW,EAAQ9C,EAAK1D,UAG1B0D,EAAY1D,GACpByD,EAASC,EAAK,CAAEgD,KAAM,MAAO1G,QAAQA,GAGjCe,EAAwB7E,IAAIwH,IAC/BU,GAAeV,IAGT,CACR,EACAkD,eAAelD,GACVzB,KAAuByB,EAAYA,EAAIzB,GACpCtH,OAAOiM,eAAelD,GAE9B5D,eAAc,CAAC4D,EAAUmD,MACpB5E,KAAuByB,KAC3B/I,OAAOmF,eAAe4D,EAAKmD,IACpB,GAERC,QAAQpD,IACPW,EAAUX,EAAKxB,GACRxG,QAAQoL,QAAQpD,KAInBqD,GAAkB,IAAI9L,cACf+L,GACZ,WAAArK,GAEC,OAAOoK,GAAgB7K,gBAAkBuF,GAAS3E,MAAQA,IAC3D,EAGD,SAASmK,GAAkBC,GAC1B,IAAKA,GAAkC,iBAAdA,EAAwB,OAAOA,EACxD,MAAMjK,EAASiK,EAEf,GAAIrG,EAAc3E,IAAIe,IAAWkK,GAAclK,GAAS,OAAOA,EAG/D,GAAI2D,EAAc1E,IAAIe,GAAS,OAAO2D,EAAclD,IAAIT,GAExD,MAAMmK,IACLtF,KAAkB7E,IAAYA,aAAkBA,EAAO6E,GAEpD7E,EADA,IAAIA,EAAO6E,GAAgB7E,GAE3BmK,IAAYnK,GAAQ4D,EAAchD,IAAIuJ,EAASnK,GACnD,MAAMoK,EAAQ,IAAI1L,MAAMyL,EAASjB,IAKjC,OAFAvF,EAAc/C,IAAIZ,EAAQoK,GAC1BxG,EAAchD,IAAIwJ,EAAOpK,GAClBoK,CACR,CAEO,MAAM5F,GAAWnD,EAAU,CACjC,MAAMiB,GACL,GAAIA,EAASQ,qBAAqBiH,GAEjC,OADAD,GAAgBxC,IAAIhF,GACbA,EAER,MAAM+H,UAAiB/H,EACtB,WAAA5C,IAAeS,GAQd,OAPAP,SAASO,gBACUkK,GAAaP,GAAgB7K,iBAC/CsG,EAAQS,KACP,GAAI1D,EAAiBhD,8BAA8BO,KAAKH,YAAYJ,6HAI/DkF,GAAS3E,KACjB,EAKD,OAHAnC,OAAO4F,eAAe+G,EAAU,OAAQ,CACvC7K,MAAO,YAAY8C,EAAShD,UAEtB+K,CACR,EACA5J,IAAI6B,GACI0H,GAAe1H,GAEvBvB,QAASiJ,KAGJ,SAAUnD,GAAUuD,GAEzB,OAAQxG,EAAcnD,IAAI2J,IAAuBA,CAClD,CAKM,SAAUE,GAAUtL,GACzBoJ,QAAWhI,EAAWpB,GAAI,EAC3B,CAGA,MAAMuL,GAAiB,IAAIxM,QACrB2D,GAAK,IAAIC,qBAAkCC,GAAMA,cAMvC6D,GACfzG,KACGmB,GAEH,IAAIqK,EAA+B,KACnC,MAAMC,EAAMtF,EAAiBuF,GAAgBtC,GAAWuC,EAAWD,GAAK1L,GACxE,IAAI4L,GAAgB,EAEpB,SAASD,IAERH,MAEAjF,EAAQC,MAAMxG,GACd,MAAM6L,EAAkBzC,GAAWwC,OAAgBxK,EAAYuK,EAAW,IACzE3L,EAAGyL,KAAQtK,IAEZoF,EAAQG,MAAM1G,GAGdwL,EAAU,KACTA,EAAU,KACVK,MAEA,MAAMtD,EAAgB7D,EAAwBjD,IAAIkK,GAClD,GAAIpD,EAAe,CAClB,IAAK,MAAMuD,KAAevD,EAAe,CACxC,MAAMrB,EAAiBvB,EAASlE,IAAIqK,GACpC,GAAI5E,EAAgB,CACnB,IAAK,MAAOnD,EAAMsD,KAASH,EAAe8B,UACzC3B,EAAKsB,OAAOgD,GACM,IAAdtE,EAAKyB,MACR5B,EAAeyB,OAAO5E,GAGI,IAAxBmD,EAAe4B,MAClBnD,EAASgD,OAAOmD,EAElB,CACD,CACApH,EAAwBiE,OAAOgD,EAChC,EAEF,CAEAxF,EAAawF,EAAW3L,GAExBuH,EAAaoE,EAAW,aAExB,MAAMI,EAAc,KACnB,GAAIH,EAAe,OACnBA,GAAgB,EAChBJ,MAEA,MAAMQ,EAAWT,GAAe9J,IAAIkK,GACpC,GAAIK,EAAU,CACb,IAAK,MAAMC,KAAgBD,EAAUC,IACrCV,GAAe5C,OAAOgD,EACvB,CAEAjJ,GAAGwJ,WAAWH,IAIf,IAAKvD,EAAc,CAClB,MAAM2D,EAAkB,IAAMJ,IAE9B,OADArJ,GAAG0J,SAASD,EAAiBJ,EAAaI,GACnCA,CACR,CAEA,IAAIH,EAAWT,GAAe9J,IAAI+G,GAC7BwD,IACJA,EAAW,IAAIvN,IACf8M,GAAe3J,IAAI4G,EAAcwD,IAElC,MAAMtC,EAASlB,EACT6D,EAAmB,KACxBL,EAASrD,OAAO0D,GACM,IAAlBL,EAASlD,MACZyC,GAAe5C,OAAOe,GAGvBqC,KAGD,OADAC,EAAS1D,IAAI+D,GACNA,CACR,CAwBO,MAAMC,GAAa,IAAI7N,IAOxB,SAAUyM,GAAczD,GAE7B,OAAY,OAARA,GAA+B,iBAARA,MAGvBxC,EAAmBhF,IAAIwH,OAGvBA,EAAI3B,MAGJnH,MAAM2I,KAAKgF,IAAYC,KAAMvM,GAAOA,EAAGyH,KAG5C,CAMM,SAAU+E,MAA+DC,GAC9E,IAAK,MAAMC,KAAKD,EAASC,IAAIA,EAAE5I,UAAkBgC,IAAmB,GACpE,OAAO2G,EAAI,EACZ,CAMM,SAAUE,GACfC,EACAC,GAEAD,EAAc9I,UAAU+B,GAAkBgH,EAC1CL,GAAiBK,EAClB,CASM,SAAUC,GACf9L,EACA+L,GACArE,UAAEA,GAAY,GAAU,IAExB,GAAI1H,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,MAAM,IAAI9B,MAAM,6CAEhD,MAAM8N,EAAkC7G,EAAa,IAAM4G,EAAS/L,GAAS+L,GAG7E,OAAOtG,GAAO,KAEb3B,EAAwBwD,IAAItH,GAG5B,IAAIuH,EAAgBvD,EAA2BvD,IAAIuL,GAC9CzE,IACJA,EAAgB,IAAI9J,IACpBuG,EAA2BpD,IAAIoL,EAAiBzE,IAEjDA,EAAeD,IAAItH,GAInB,MAAMiM,EAAU,IAAIjO,QA0EpB,OAzEA,SAASkO,EAAiBzF,EAAU0F,EAAQ,GAE3C,KAAIF,EAAQhN,IAAIwH,KAwGnB,SAAkBA,GACjB,OAAe,OAARA,GAA+B,iBAARA,CAC/B,CA1G4B2F,CAAS3F,IAAQ0F,EAAQ5G,EAAQO,mBAEtDoE,GAAczD,IAAlB,CACAwF,EAAQ3E,IAAIb,GAGZ3C,EAAwBwD,IAAIb,GAC5Bc,EAAeD,IAAIb,GAInB,IAAK,MAAM/B,KAAOmC,GAAOJ,GACxB,GAAI/I,OAAOyL,OAAO1C,EAAK/B,GAAM,CAE5B,MAAMlF,EAASiH,EAAY/B,GAI3BwH,EADkB,iBAAV1M,GAAgC,OAAVA,EAAiBgF,GAAShF,GAASA,EACjC2M,EAAQ,EACzC,CAKD,GAAIxO,MAAM0O,QAAQ5F,IAAQA,aAAe9I,MAAO,CAE/C,MAAMoK,EAAStB,EAAIsB,OAGnB,IAAK,IAAIuE,EAAI,EAAGA,EAAIvE,EAAQuE,IAAK,CAEhC,MAAM9M,EAAQiH,EAAI6F,GAIlBJ,EADkB,iBAAV1M,GAAgC,OAAVA,EAAiBgF,GAAShF,GAASA,EACjC2M,EAAQ,EACzC,CACD,MAEK,GAAI1F,aAAehJ,IAEvB,IAAK,MAAM+B,KAASiH,EAAK,CAIxByF,EADkB,iBAAV1M,GAAgC,OAAVA,EAAiBgF,GAAShF,GAASA,EACjC2M,EAAQ,EACzC,MAGI,GAAI1F,aAAe3I,IAEvB,IAAK,MAAOyO,EAAM/M,KAAUiH,EAAK,CAIhCyF,EADkB,iBAAV1M,GAAgC,OAAVA,EAAiBgF,GAAShF,GAASA,EACjC2M,EAAQ,EACzC,CAtDuB,CA0DzB,CAIAD,CAAiBlM,GAGb0H,GAAWqE,EAAS/L,GACxB0H,GAAY,EAGL,KAEN,MAAMH,EAAgBvD,EAA2BvD,IAAIuL,GACrD,GAAIzE,EAAe,CAElB,IAAK,MAAMd,KAAOc,EAAe,CAEhC,MAAM5C,EAAWZ,EAAatD,IAAIgG,GAC9B9B,GAEHA,EAASgD,OAAOqE,GAGM,IAAlBrH,EAASmD,OACZ/D,EAAa4D,OAAOlB,GACpB3C,EAAwB6D,OAAOlB,KAIhC3C,EAAwB6D,OAAOlB,EAEjC,CAGAzC,EAA2B2D,OAAOqE,EACnC,IAGH,CCj1BA,IAAIQ,GD+rBJhB,GAAiB5N,KAAMe,OAAQT,MAAOD,QAASJ,UACzB,oBAAX4O,QAnDX,YAA4ChG,GAC3C,IAAK,MAAMiG,KAAKjG,EAAK,CACpB,IACC/I,OAAO4F,eAAeoJ,EAAG5H,EAAiB,CACzCtF,OAAO,EACP+D,UAAU,EACVC,YAAY,EACZC,cAAc,GAEhB,CAAE,MAAO,CACHqB,KAAoB4H,GAAezI,EAAmBqD,IAAIoF,EACjE,CACOjG,EAAI,EACZ,CAsCmCkG,CAAYF,OAAQG,UAChC,oBAAZC,SAAyBrB,GAAiBqB,QAASC,MCtrB9D,MAAMC,GAAgB,IAAIhP,QAC1B,SAASiP,GAAoBxM,GAC5B,MAAMkE,EAAMW,EAAQ7E,GACpB,IAAIyM,EAAgC,GAEpC,GADA7F,EAAU2F,GAAerI,GACrBqI,GAAc9N,IAAIyF,GAAM,OAAOqI,GAActM,IAAIiE,GACrD,IAAIwI,GAAU,EACd,MAAMC,EAAO1H,GACZN,EAAcsF,IACb,GAAIyC,EAAS,OACb,MAAME,EAAQZ,GACd,GAAIO,GAAc9N,IAAIyF,GAAM,CAE3B,IAAK,MAAMgG,KAAMuC,EAAevC,IAChCuC,EAAgB,GAChBF,GAAcpF,OAAOjD,GACrB8B,EAASuG,GAAe,CAAEtD,KAAM,aAAc1G,KAAM2B,GAAOA,GAC3DyI,IACAD,GAAU,CACX,MACC,IACCV,GAAwBS,EACxBF,GAAcnM,IAAI8D,EAAKlE,EAAOiK,GAC/B,SACC+B,GAAwBY,CACzB,GACC5M,IAEJ,OAAOuM,GAActM,IAAIiE,EAC1B,CAKO,MAAM2I,GAAWhM,EAAU,CACjC,MAAAb,CAAO8B,EAAUrC,GAChB,MAAMqN,EAAY,IAAIvP,QACtB,OAAO,WAUN,OATKuP,EAAUrO,IAAIY,OAClByN,EAAU1M,IACTf,KACAT,EACC,IAAMkD,EAAStB,KAAKnB,MACpB,GAAGjB,OAAOiB,KAAKH,YAAYJ,SAASV,OAAOqB,OAIvC+M,GAAiBM,EAAU7M,IAAIZ,MACvC,CACD,EACAkB,QAAWP,GACHwM,GAAiBxM,KAQpB+M,GAAWzL,OAAO,aA4FxB,SAAS0L,GAAmB/G,GAE3B,GAAIyD,GADJzD,EAAMI,GAAOJ,IACW,OAAOA,EAC/B,IACC/I,OAAO4F,eAAemD,EAAe3B,EAAiB,CACrDtF,OAAO,EACP+D,UAAU,EACVC,YAAY,EACZC,cAAc,GAEhB,CAAE,MAAO,CACHqB,KAAoB2B,GAAiBxC,EAAmBqD,IAAIb,GAClE,IAAK,MAAM/B,KAAO+B,EAAK+G,GAAgB/G,EAAI/B,IAC3C,OAAO+B,CACR,CAoBO,MAAMgH,GAAapM,EAAU,CACnC,MAAMiB,GAELkJ,GAAiBlJ,EAClB,EACAvB,QAtBD,SACC2M,KACGvN,GAEH,MAAuB,iBAATuN,EACXF,GAAgBE,GACbpL,IAEHA,EAASQ,UAAUiC,GAAwB,IAAItH,IAC9C6E,EAASQ,UAAUiC,IAAyB,IAG7CzC,EAASQ,UAAUiC,GAAsBuC,IAAIoG,GAC7C,IAAK,MAAMC,KAAOxN,EAAMmC,EAASQ,UAAUiC,GAAsBuC,IAAIqG,GACrE,OAAOrL,CACP,CACJ,IAaA5E,OAAOsJ,OAAOpC,EAAa,CAAEmI,mBC5N7B,MAAMa,GAAS9L,OAAO,UAChBuK,GAAU1O,MAAM0O,QACtB1O,MAAM0O,QAAY7M,GAEjB6M,GAAQ7M,IAAWA,aAAiB7B,OAASiQ,MAAUpO,EACxD,MAAMqO,IAGN,SAAUjL,GAAM0J,GAAWvE,OAAEA,GAAS,GAAS,CAAA,SACxCuE,EACFvE,SAAc,SACnB,CAEA,SAAU+F,GACTC,EACAC,GACAjG,OAAEA,GAAS,GAAU,IAErB,MAAMkG,EAAQC,KAAKC,IAAIJ,EAAGC,GACpBI,EAAMF,KAAKG,IAAIN,EAAGC,GACxB,IAAK,IAAI1B,EAAI2B,EAAO3B,GAAK8B,EAAK9B,UAAWA,EACrCvE,SAAc,SACnB,OACauG,WAAsB7L,EAAUoL,GAAmB,CAC/D,GAAApN,CAAI6L,GAEH,OADAlF,EAAUvH,KAAK+N,IAAStB,GACjB9H,GAAS3E,KAAK+N,IAAQtB,GAC9B,EACA,GAAA1L,CAAI0L,EAAW9M,GACd,MAAM+O,EAAQjC,GAAKzM,KAAK+N,IAAQ7F,OAChClI,KAAK+N,IAAQtB,GAAK9M,EAClBmH,EAAQ9G,KAAK+N,IAAS,CAAEnE,KAAM,QAAS3I,OAAQ,OAAS8B,GAAM0J,EAAG,CAAEvE,OAAQwG,IAC5E,EACA,SAAArL,GAEC,OADAkE,EAAUvH,KAAK+N,IAAS,UACjB/N,KAAK+N,IAAQ7F,MACrB,EACA,SAAA1E,CAAU7D,GACT,MAAMgP,EAAY3O,KAAK+N,IAAQ7F,OAC/B,IACClI,KAAK+N,IAAQ7F,OAASvI,CACvB,SACCmH,EACC9G,KAAK+N,IACL,CAAEnE,KAAM,MAAO1G,KAAM,UACrB+K,GAAMU,EAAWhP,EAAO,CAAEuI,QAAQ,IAEpC,CACD,KAGA,WAAArI,CAAY4C,GACX1C,QACAlC,OAAO6B,iBAAiBM,KAAM,CAE7B4O,CAACb,IAAS,CAAEpO,MAAO8C,GACnB0C,CAACA,GAAsB,CAAExF,MAAO8C,IAElC,CAGA,EAAAoM,CAAG9L,GACF,MAAM+L,EAAc/L,EAAQ,EAAI/C,KAAK+N,IAAQ7F,OAASnF,EAAQA,EAE9D,GADAwE,EAAUvH,KAAM8O,KACZA,EAAc,GAAKA,GAAe9O,KAAK+N,IAAQ7F,QACnD,OAAOvD,GAAS3E,KAAK+N,IAAQe,GAC9B,CAEA,IAAA1G,IAAQ2G,GACP,MAAMJ,EAAY3O,KAAK+N,IAAQ7F,OAC/B,IACC,OAAOlI,KAAK+N,IAAQ3F,QAAQ2G,EAC7B,SACCjI,EACC9G,KACA,CAAE4J,KAAM,QAAS3I,OAAQ,QACzBgN,GAAMU,EAAWA,EAAYI,EAAM7G,OAAS,EAAG,CAAEA,QAAQ,IAE3D,CACD,CAEA,GAAA8G,GACC,GAA4B,IAAxBhP,KAAK+N,IAAQ7F,OACjB,IACC,OAAOvD,GAAS3E,KAAK+N,IAAQiB,MAC9B,SACClI,EAAQ9G,KAAM,CAAE4J,KAAM,QAAS3I,OAAQ,OAAS8B,GAAM/C,KAAK+N,IAAQ7F,QACpE,CACD,CAEA,KAAA+G,GACC,GAA4B,IAAxBjP,KAAK+N,IAAQ7F,OACjB,IACC,OAAOvD,GAAS3E,KAAK+N,IAAQkB,QAC9B,SACCnI,EACC9G,KACA,CAAE4J,KAAM,QAAS3I,OAAQ,SACzBgN,GAAM,EAAGjO,KAAK+N,IAAQ7F,OAAS,EAAG,CAAEA,QAAQ,IAE9C,CACD,CAEA,OAAAgH,IAAWH,GACV,IACC,OAAO/O,KAAK+N,IAAQmB,WAAWH,EAChC,SACCjI,EACC9G,KACA,CAAE4J,KAAM,QAAS3I,OAAQ,WACzBgN,GAAM,EAAGjO,KAAK+N,IAAQ7F,OAAS6G,EAAM7G,OAAQ,CAAEA,QAAQ,IAEzD,CACD,CAEA,MAAAiH,CAAOf,EAAegB,KAAyBL,GAC9C,MAAMJ,EAAY3O,KAAK+N,IAAQ7F,YACX3H,IAAhB6O,IAA2BA,EAAcT,EAAYP,GACzD,IACC,OAAsCzJ,QAAlBpE,IAAhB6O,EAA2CpP,KAAK+N,IAAQoB,OAAOf,GACnDpO,KAAK+N,IAAQoB,OAAOf,EAAOgB,KAAgBL,GAC5D,SACCjI,EACC9G,KACA,CAAE4J,KAAM,QAAS3I,OAAQ,UAEzBmO,IAAgBL,EAAM7G,OACnB+F,GAAMG,EAAOA,EAAQgB,GACrBnB,GAAMG,EAAOO,EAAYN,KAAKG,IAAIO,EAAM7G,OAASkH,EAAa,GAAI,CAClElH,QAAQ,IAGb,CACD,CAEA,OAAAmH,GACC,IACC,OAAOrP,KAAK+N,IAAQsB,SACrB,SACCvI,EAAQ9G,KAAM,CAAE4J,KAAM,QAAS3I,OAAQ,WAAagN,GAAM,EAAGjO,KAAK+N,IAAQ7F,OAAS,GACpF,CACD,CAEA,IAAAoH,CAAKC,GACJ,IACC,OAAOvP,KAAK+N,IAAQuB,KAAKC,EAC1B,SACCzI,EAAQ9G,KAAM,CAAE4J,KAAM,QAAS3I,OAAQ,QAAUgN,GAAM,EAAGjO,KAAK+N,IAAQ7F,OAAS,GACjF,CACD,CAEA,IAAAsH,CAAK7P,EAAYyO,EAAgBG,GAChC,IACC,YAAchO,IAAV6N,EAA4BpO,KAAK+N,IAAQyB,KAAK7P,QACtCY,IAARgO,EAA0BvO,KAAK+N,IAAQyB,KAAK7P,EAAOyO,GAChDpO,KAAK+N,IAAQyB,KAAK7P,EAAOyO,EAAOG,EACxC,SACCzH,EAAQ9G,KAAM,CAAE4J,KAAM,QAAS3I,OAAQ,QAAUgN,GAAM,EAAGjO,KAAK+N,IAAQ7F,OAAS,GACjF,CACD,CAEA,UAAAuH,CAAWtP,EAAgBiO,EAAeG,GACzC,IACC,YAAYhO,IAARgO,EAA0BvO,KAAK+N,IAAQ0B,WAAWtP,EAAQiO,GACvDpO,KAAK+N,IAAQ0B,WAAWtP,EAAQiO,EAAOG,EAC/C,SACCzH,EACC9G,KACA,CAAE4J,KAAM,QAAS3I,OAAQ,cAEzBgN,GAAM,EAAGjO,KAAK+N,IAAQ7F,OAAS,GAEjC,CAED,CAGA,UAAAwH,GAEC,OADAnI,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQ2B,aAC9B,CAEA,QAAAC,CAASJ,GAER,OADAhI,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQ4B,SAASJ,GACvC,CAEA,SAAAK,CAAUxB,EAAegB,KAAyBL,GAEjD,OADAxH,EAAUvH,WACaO,IAAhB6O,EACJpP,KAAK+N,IAAQ6B,UAAUxB,GACvBpO,KAAK+N,IAAQ6B,UAAUxB,EAAOgB,KAAgBL,EAClD,CAEA,KAAKhM,EAAepD,GAEnB,OADA4H,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQ8B,KAAK9M,EAAOpD,GAC1C,CAGA,OAAAwI,GAEC,OADAZ,EAAUvH,MACH4E,EAA4B5E,KAAK+N,IAAQ5F,UACjD,CAEA,IAAA5B,GAEC,OADAgB,EAAUvH,MACHA,KAAK+N,IAAQxH,MACrB,CAEA,MAAAuJ,GAEC,OADAvI,EAAUvH,MACHsE,EAAqBtE,KAAK+N,IAAQ+B,SAC1C,CAEA,CAAC7N,OAAOsC,YACPgD,EAAUvH,MACV,MAAM+P,EAAiB/P,KAAK+N,IAAQ9L,OAAOsC,YAC3C,MAAO,CACN,IAAAE,GACC,MAAMD,EAASuL,EAAetL,OAC9B,OAAID,EAAOE,KACHF,EAED,CAAE7E,MAAOgF,GAASH,EAAO7E,OAAQ+E,MAAM,EAC/C,EAEF,CAEA,OAAAsL,CAAQC,EAAoBC,GAE3B,OADA3I,EAAUvH,MACHA,KAAK+N,IAAQiC,QAAQC,EAAeC,EAC5C,CAEA,WAAAC,CAAYF,EAAoBC,GAE/B,OADA3I,EAAUvH,MACHA,KAAK+N,IAAQoC,YAAYF,EAAeC,EAChD,CAEA,QAAAzP,CAASwP,EAAoBC,GAE5B,OADA3I,EAAUvH,MACHA,KAAK+N,IAAQtN,SAASwP,EAAeC,EAC7C,CAEA,IAAAE,CACCC,EACAC,GAGA,OADA/I,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQqC,KAAKC,EAAWC,GAC9C,CAEA,SAAAC,CACCF,EACAC,GAGA,OADA/I,EAAUvH,MACHA,KAAK+N,IAAQwC,UAAUF,EAAWC,EAC1C,CAEA,IAAAE,GAEC,OADAjJ,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQyC,OAC9B,CAEA,OAAAC,CACCC,EACAJ,GAGA,OADA/I,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQ0C,QAAQC,EAAYJ,GAClD,CAEA,MAAAK,CAAOD,EAAkEJ,GAExE,OADA/I,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQ4C,OAAOD,EAAmBJ,GACxD,CAEA,GAAAM,CAAIF,EAA8DJ,GAEjE,OADA/I,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQ6C,IAAIF,EAAmBJ,GACrD,CAEA,MAAAO,CACCH,EACAI,GAEAvJ,EAAUvH,MACV,MAAMwE,OACYjE,IAAjBuQ,EACG9Q,KAAK+N,IAAQ8C,OAAOH,GACpB1Q,KAAK+N,IAAQ8C,OAAOH,EAAmBI,GAC3C,OAAOnM,GAASH,EACjB,CAEA,WAAAuM,CACCL,EACAI,GAEAvJ,EAAUvH,MACV,MAAMwE,OACYjE,IAAjBuQ,EACG9Q,KAAK+N,IAAQgD,YAAYL,EAAmBI,GAC3C9Q,KAAK+N,IAAgBgD,YAAYL,GACtC,OAAO/L,GAASH,EACjB,CAEA,KAAAwM,CAAM5C,EAAgBG,GACrB,IAAK,MAAM9B,KAAKwB,GAAMG,GAAS,EAAGG,GAAOvO,KAAK+N,IAAQ7F,OAAS,GAAIX,EAAUvH,KAAMyM,GACnF,YAAiBlM,IAAV6N,EACJpO,KAAK+N,IAAQiD,aACLzQ,IAARgO,EACCvO,KAAK+N,IAAQiD,MAAM5C,GACnBpO,KAAK+N,IAAQiD,MAAM5C,EAAOG,EAC/B,CAEA,MAAA0C,IAAUlC,GAET,OADAxH,EAAUvH,MACH2E,GAAS3E,KAAK+N,IAAQkD,UAAUlC,GACxC,CAEA,IAAAmC,CAAKC,GAEJ,OADA5J,EAAUvH,MACHA,KAAK+N,IAAQmD,KAAKC,EAC1B,CAEA,OAAAC,CAAQV,EAA+DJ,GACtE/I,EAAUvH,MACVA,KAAK+N,IAAQqD,QAAQV,EAAmBJ,EACzC,CAIA,KAAAe,CAAMX,EAAkEJ,GAEvE,OADA/I,EAAUvH,MACHA,KAAK+N,IAAQsD,MAAMX,EAAmBJ,EAC9C,CAEA,IAAA5E,CAAKgF,EAAkEJ,GAEtE,OADA/I,EAAUvH,MACHA,KAAK+N,IAAQrC,KAAKgF,EAAmBJ,EAC7C,ECrVD,MAAMvC,GAAS9L,OAAO,gBA2CTqP,GAIZ,WAAAzR,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7BuR,CAACxD,IAAS,CAAEpO,MAAO8C,GACnB0C,CAACA,GAAsB,CAAExF,MAAO8C,GAChC+O,QAAS,CAAE7R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,gBAEjC,CAGA,QAAIsI,GAEH,OADAV,EAAUvH,KAAM,QACTA,KAAK+N,IAAQ9F,IACrB,CAEA,KAAAwJ,GACC,MAAMC,EAAa1R,KAAK+N,IAAQ9F,KAAO,EAGvC,GAFAjI,KAAK+N,IAAQ0D,QAETC,EAAY,CACf,MAAM7K,EAAY,CAAE+C,KAAM,QAAS3I,OAAQ,SAE3C0F,EAAS3G,KAAM6G,EAAW,QAC1BC,EAAQ9G,KAAKwR,QAAS3K,EACvB,CACD,CAEA,OAAAsB,GAEC,OADAZ,EAAUvH,KAAKwR,SACR5M,EAA4B5E,KAAK+N,IAAQ5F,UACjD,CAEA,OAAAiJ,CAAQV,EAAwDJ,GAC/D/I,EAAUvH,KAAKwR,SACfxR,KAAK+N,IAAQqD,QAAQV,EAAYJ,EAClC,CAEA,IAAA/J,GAEC,OADAgB,EAAUvH,KAAKwR,SACRxR,KAAK+N,IAAQxH,MACrB,CAEA,MAAAuJ,GAEC,OADAvI,EAAUvH,KAAKwR,SACRlN,EAAqBtE,KAAK+N,IAAQ+B,SAC1C,CAEA,CAAC7N,OAAOsC,YACPgD,EAAUvH,KAAKwR,SACf,MAAMzB,EAAiB/P,KAAK+N,IAAQ9L,OAAOsC,YAC3C,MAAO,CACN,IAAAE,GACC,MAAMD,EAASuL,EAAetL,OAC9B,OAAID,EAAOE,KACHF,EAED,CACN7E,MAAO,CAAC6E,EAAO7E,MAAM,GAAIgF,GAASH,EAAO7E,MAAM,KAC/C+E,MAAM,EAER,EAEF,CAGA,OAAOG,GACN,MAAM8M,EAAS3R,KAAK+N,IAAQ3O,IAAIyF,GAC1BL,EAASxE,KAAK+N,IAAQjG,OAAOjD,GAEnC,GAAI8M,EAAQ,CACX,MAAM9K,EAAY,CAAE+C,KAAM,MAAO1G,KAAM2B,GACvC8B,EAAS3G,KAAKwR,QAAS3K,EAAWhC,GAClC8B,EAAS3G,KAAM6G,EAAW,OAC3B,CAEA,OAAOrC,CACR,CAEA,GAAA5D,CAAIiE,GAEH,OADA0C,EAAUvH,KAAKwR,QAAS3M,GACjBF,GAAS3E,KAAK+N,IAAQnN,IAAIiE,GAClC,CAEA,GAAAzF,CAAIyF,GAEH,OADA0C,EAAUvH,KAAKwR,QAAS3M,GACjB7E,KAAK+N,IAAQ3O,IAAIyF,EACzB,CAEA,GAAA9D,CAAI8D,EAAQlF,GACX,MAAMgS,EAAS3R,KAAK+N,IAAQ3O,IAAIyF,GAC1B+M,EAAW5R,KAAK+N,IAAQnN,IAAIiE,GAC5B0E,EAAgB5E,GAAShF,GAG/B,GAFAK,KAAK+N,IAAQhN,IAAI8D,EAAK0E,IAEjBoI,GAAUC,IAAarI,EAAe,CAC1C,MAAM1C,EAAY,CAAE+C,KAAM+H,EAAS,MAAQ,MAAOzO,KAAM2B,GACxD8B,EAAS3G,KAAKwR,QAAS3K,EAAWhC,GAClC8B,EAAS3G,KAAM6G,EAAW,OAC3B,CAEA,OAAO7G,IACR,ECpJD,MAAM+N,GAAS9L,OAAO,gBAuCT4P,GAGZ,WAAAhS,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7B+N,CAACA,IAAS,CAAEpO,MAAO8C,GACnB0C,CAACA,GAAsB,CAAExF,MAAO8C,GAChC+O,QAAS,CAAE7R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,gBAEjC,CAEA,QAAIsI,GAGH,OADAV,EAAUvH,KAAM,QACTA,KAAK+N,IAAQ9F,IACrB,CAEA,GAAAR,CAAI9H,GACH,MAAMmS,EAAM9R,KAAK+N,IAAQ3O,IAAIO,GACvB4J,EAAgB5E,GAAShF,GAE/B,GADAK,KAAK+N,IAAQtG,IAAI8B,IACZuI,EAAK,CACT,MAAMjL,EAAY,CAAE+C,KAAM,MAAO1G,KAAMqG,GAEvC5C,EAAS3G,KAAKwR,QAAS3K,EAAW0C,GAClC5C,EAAS3G,KAAM6G,EAAW,OAC3B,CACA,OAAO7G,IACR,CAEA,KAAAyR,GACC,MAAMC,EAAa1R,KAAK+N,IAAQ9F,KAAO,EAEvC,GADAjI,KAAK+N,IAAQ0D,QACTC,EAAY,CACf,MAAM7K,EAAY,CAAE+C,KAAM,QAAS3I,OAAQ,SAC3C0F,EAAS3G,KAAM6G,EAAW,QAC1BC,EAAQ9G,KAAKwR,QAAS3K,EACvB,CACD,CAEA,OAAOlH,GACN,MAAMmS,EAAM9R,KAAK+N,IAAQ3O,IAAIO,GACvBoS,EAAM/R,KAAK+N,IAAQjG,OAAOnI,GAChC,GAAImS,EAAK,CACR,MAAMjL,EAAY,CAAE+C,KAAM,MAAO1G,KAAMvD,GACvCgH,EAAS3G,KAAKwR,QAAS3K,EAAWlH,GAClCgH,EAAS3G,KAAM6G,EAAW,OAC3B,CACA,OAAOkL,CACR,CAEA,GAAA3S,CAAIO,GAEH,OADA4H,EAAUvH,KAAKwR,QAAS7R,GACjBK,KAAK+N,IAAQ3O,IAAIO,EACzB,CAEA,OAAAwI,GAEC,OADAZ,EAAUvH,KAAKwR,SACR5M,EAA4B5E,KAAK+N,IAAQ5F,UACjD,CAEA,OAAAiJ,CAAQV,EAAwDJ,GAC/D/I,EAAUvH,KAAKwR,SACfxR,KAAK+N,IAAQqD,QAAQV,EAAYJ,EAClC,CAEA,IAAA/J,GAEC,OADAgB,EAAUvH,KAAKwR,SACRlN,EAAqBtE,KAAK+N,IAAQxH,OAC1C,CAEA,MAAAuJ,GAEC,OADAvI,EAAUvH,KAAKwR,SACRlN,EAAqBtE,KAAK+N,IAAQ+B,SAC1C,CAEA,CAAC7N,OAAOsC,YACPgD,EAAUvH,KAAKwR,SACf,MAAMzB,EAAiB/P,KAAK+N,IAAQ9L,OAAOsC,YAC3C,MAAO,CACN,IAAAE,GACC,MAAMD,EAASuL,EAAetL,OAC9B,OAAID,EAAOE,KACHF,EAED,CAAE7E,MAAOgF,GAASH,EAAO7E,OAAQ+E,MAAM,EAC/C,EAEF,EClHDoH,GAAyB5N,cFTxB,WAAA2B,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7BuR,CAACxD,IAAS,CAAEpO,MAAO8C,GACnB0C,CAACA,GAAsB,CAAExF,MAAO8C,GAChC+O,QAAS,CAAE7R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,oBAEjC,CAGA,OAAOkF,GACN,MAAM8M,EAAS3R,KAAK+N,IAAQ3O,IAAIyF,GAC1BL,EAASxE,KAAK+N,IAAQjG,OAAOjD,GAInC,OAFI8M,GAAQhL,EAAS3G,KAAKwR,QAAS,CAAE5H,KAAM,MAAO1G,KAAM2B,GAAOA,GAExDL,CACR,CAEA,GAAA5D,CAAIiE,GAEH,OADA0C,EAAUvH,KAAKwR,QAAS3M,GACjBF,GAAS3E,KAAK+N,IAAQnN,IAAIiE,GAClC,CAEA,GAAAzF,CAAIyF,GAEH,OADA0C,EAAUvH,KAAKwR,QAAS3M,GACjB7E,KAAK+N,IAAQ3O,IAAIyF,EACzB,CAEA,GAAA9D,CAAI8D,EAAQlF,GAKX,OAHAgH,EAAS3G,KAAKwR,QAAS,CAAE5H,KAAM5J,KAAK+N,IAAQ3O,IAAIyF,GAAO,MAAQ,MAAO3B,KAAM2B,GAAOA,GACnF7E,KAAK+N,IAAQhN,IAAI8D,EAAKlF,GAEfK,IACR,IEzBD8L,GAAyB7N,IAAKqT,IAC9BxF,GAAyB3N,cDVxB,WAAA0B,CAAY4C,GACX5E,OAAO6B,iBAAiBM,KAAM,CAC7B+N,CAACA,IAAS,CAAEpO,MAAO8C,GACnB0C,CAACA,GAAsB,CAAExF,MAAO8C,GAChC+O,QAAS,CAAE7R,MAAOsC,OAAO,YACzB,CAACA,OAAOK,aAAc,CAAE3C,MAAO,oBAEjC,CAEA,GAAA8H,CAAI9H,GACH,MAAMmS,EAAM9R,KAAK+N,IAAQ3O,IAAIO,GAO7B,OANAK,KAAK+N,IAAQtG,IAAI9H,GACZmS,GAEJnL,EAAS3G,KAAKwR,QAAS,CAAE5H,KAAM,MAAO1G,KAAMvD,GAASA,GAG/CK,IACR,CAEA,OAAOL,GACN,MAAMmS,EAAM9R,KAAK+N,IAAQ3O,IAAIO,GACvBoS,EAAM/R,KAAK+N,IAAQjG,OAAOnI,GAEhC,OADImS,GAAKnL,EAAS3G,KAAKwR,QAAS,CAAE5H,KAAM,MAAO1G,KAAMvD,GAASA,GACvDoS,CACR,CAEA,GAAA3S,CAAIO,GAEH,OADA4H,EAAUvH,KAAKwR,QAAS7R,GACjBK,KAAK+N,IAAQ3O,IAAIO,EACzB,ICnBDmM,GAAyBlO,IAAKiU,IAC9B/F,GAAyBhO,MAAO2Q,ICzBhC,MAAMuD,GAA2D,GACpDC,GAASzQ,EAAU,CAC/Bb,OAAM,CAAC8B,EAAUrC,IACT,WACN,MAAM8R,EAAqBF,GAAgBzB,UACzC1E,GAAMA,EAAEsG,SAAWnS,MAAQ6L,EAAE3I,OAAS9C,GAExC,GAAI8R,GAAqB,EACxB,MAAM,IAAI7T,MACT,iCAAiC2T,GAC/BhB,MAAMkB,GACNtB,IAAK/E,GAAM,GAAGA,EAAEsG,OAAOtS,YAAYJ,QAAQV,OAAO8M,EAAE3I,SACpDgO,KAAK,oBAETc,GAAgB5J,KAAK,CAAE+J,OAAQnS,KAAMkD,KAAM9C,IAC3C,IACC,MAAMmB,EAAKkB,EAAStB,KAAKnB,MAEzB,OADAoS,GAAMpS,KAAMI,EAAamB,GAClBA,CACR,SACCyQ,GAAgBhD,KACjB,CACD,aAQcoD,GAAMD,EAAgB/R,EAA0BT,GAC/D9B,OAAO4F,eAAe0O,EAAQ/R,EAAa,CAAET,SAC9C,OAuBa0S,GAAaxU,OAAOsJ,OAChC3F,EAAU,CACTP,OAAM,CAACwB,EAAUrC,IACT,YAAwBE,GAE9B,OADA+R,GAAWlM,KAAKnG,KAAMI,GACfqC,EAAS6F,MAAMtI,KAAMM,EAC7B,EAEDK,OAAM,CAAC8B,EAAUrC,IACT,WAEN,OADAiS,GAAWlM,KAAKnG,KAAMI,GACfqC,EAAStB,KAAKnB,KACtB,EAEDc,OAAM,CAAC2B,EAAUrC,IACT,SAAqBT,GAE3B,OADA0S,GAAWlM,KAAKnG,KAAMI,GACfqC,EAAStB,KAAKnB,KAAML,EAC5B,EAEDa,MAAMiC,GACE,cAAcA,EACpB,WAAA5C,IAAeS,GACdP,SAASO,GACT+R,GAAWlM,KAAKnG,KAAM,cACvB,GAGFkB,QAAQpB,GACA0B,EAAU,CAChBP,OAAM,CAACwB,EAAUrC,IACT,YAAwBE,GAE9B,OADA+R,GAAWlM,KAAKnG,KAAMI,EAAaN,GAC5B2C,EAAS6F,MAAMtI,KAAMM,EAC7B,EAEDK,OAAM,CAAC8B,EAAUrC,IACT,WAEN,OADAiS,GAAWlM,KAAKnG,KAAMI,EAAaN,GAC5B2C,EAAStB,KAAKnB,KACtB,EAEDc,OAAM,CAAC2B,EAAUrC,IACT,SAAqBT,GAE3B,OADA0S,GAAWlM,KAAKnG,KAAMI,EAAaN,GAC5B2C,EAAStB,KAAKnB,KAAML,EAC5B,EAEDa,MAAMiC,GACE,cAAcA,EACpB,WAAA5C,IAAeS,GACdP,SAASO,GACT+R,GAAWlM,KAAKnG,KAAM,cAAeF,EACtC,OAML,CACCqG,KAAM,CAAChG,EAAaC,EAA0BN,0CRvC1C,SAKJ+C,EAAkCyP,SASnC,OARIzP,GAAwB,mBAATA,IAClByP,EAAgBzP,EAChBA,OAAOtC,GAEHsC,IACJA,EAAO,SAGR0P,EAAO,cAA2B1P,EAEjC,cAAO2P,CAAQ5L,GACd,MAAM5E,EAAauQ,EAAYE,YAAY7R,IAAIgG,GAC/C,IAAK5E,EAAY,OAAO,EACxBH,EAAGwJ,WAAWzE,GACd2L,EAAYE,YAAY3K,OAAOlB,GAC/B/I,OAAOmF,eAAe4D,EAAK,IAAI/H,MAAM,CAAA,EAAIwD,IAEzC,IAAK,MAAMwC,KAAOhH,OAAO6U,oBAAoB9L,UACpCA,EAAY/B,GAGrB,OADA7C,KACO,CACR,CACA,oBAAO2Q,CAAc/L,GACpB,OAAO2L,EAAYE,YAAYrT,IAAIwH,EACpC,CAIA,WAAA/G,IAAeS,GACdP,SAASO,GACT,MAAMkC,EAAY,CAAA,EAClBxC,KAAKkC,GAAmBM,EAExB,MAAMoQ,EAAeN,GAAetQ,YAAchC,KAAKgC,GACvD,IAAK4Q,EACJ,MAAM,IAAIzQ,EAAiB,6BAE5B,SAAS0Q,IACRD,EAAapQ,EACd,CACA+P,EAAYE,YAAY1R,IAAIf,KAAM6S,GAClChR,EAAG0J,SAASvL,KAAM6S,EAAa7S,KAChC,GAlCgBuS,EAAAE,YAAc,IAAIvU,QAmClCqU,CACF,wCSlIA,WAAA1S,GACUiT,EAAA/R,IAAAf,KAAU,IAAI/B,KACd8U,EAAAhS,IAAAf,KAAS,GAkEnB,CAhEQ,IAAAgT,CACNnI,GAMA,OADKoI,EAAAjT,KAAI+S,EAAA,KAAQtS,SAASoK,IAAKoI,EAAAjT,KAAI+S,EAAA,KAAQ3K,KAAKyC,GACzC,KACNoI,EAAAjT,KAAI+S,EAAA,KAAQ5D,OAAO8D,EAAAjT,KAAI+S,EAAA,KAAQ/C,QAAQnF,GAAK,GAE9C,CAIO,EAAAqI,CACNC,EACAtI,GAEA,GAA6B,iBAAlBsI,EACV,IAAK,MAAMC,KAAKvV,OAAO0I,KAAK4M,GAC3BnT,KAAKkT,GAAGE,EAAGD,EAAcC,SAEpB,QAAW7S,IAAPsK,EAAkB,CAC5B,IAAIwI,EAAYJ,EAAAjT,KAAI8S,EAAA,KAASlS,IAAIuS,GAC5BE,IACJA,EAAY,GACZJ,EAAAjT,YAAae,IAAIoS,EAAeE,IAEjCA,EAAUjL,KAAKyC,EAChB,CAEA,MAAO,IAAM7K,KAAKsT,IAAIH,EAAetI,EACtC,CAGO,GAAAyI,CACNH,EACAtI,GAEA,GAA6B,iBAAlBsI,EACV,IAAK,MAAMC,KAAKvV,OAAO0I,KAAK4M,GAC3BnT,KAAKsT,IAAIF,EAAGD,EAAcC,SAErB,GAAIvI,QAAiC,CAC3C,MAAMwI,EAAYJ,EAAAjT,KAAI8S,EAAA,KAASlS,IAAIuS,GAC/BE,GACHJ,EAAAjT,YAAae,IACZoS,EACAE,EAAU1C,OAAQ9E,GAAMA,IAAMhB,GAGjC,MAECoI,EAAAjT,KAAI8S,EAAA,KAAShL,OAAOqL,EAEtB,CACO,IAAAI,CACNC,KACGlT,GAEH,MAAM+S,EAAYJ,EAAAjT,KAAI8S,EAAA,KAASlS,IAAI4S,GACnC,GAAIH,EAAW,IAAK,MAAMxI,KAAMwI,EAAWxI,EAAGvC,MAAMtI,KAAMM,GAC1D,IAAK,MAAMuK,KAAMoI,EAAAjT,KAAI+S,EAAA,KAASlI,EAAG1J,KAAKnB,KAAMwT,KAAUlT,EACvD,oIT2EK,SAAmBuK,GACxB,IAAI4I,GAAS,EACb,MAAMC,EAAU,KACXD,IACJA,GAAS,EACT5I,MAGD,OADAhJ,EAAG0J,SAASmI,EAAS7I,EAAIA,GAClB6I,CACR,2BQxBM,SAAmBC,GACxB,OAAOnS,EAAU,CAChB,MAAAP,CAAOwB,EAAUmR,GAChB,IAAIC,EAAkD,KAEtD,OAAO,YAAwBvT,GAE1BuT,GACHC,aAAaD,GAIdA,EAAYE,WAAW,KACtBtR,EAAS6F,MAAMtI,KAAMM,GACrBuT,EAAY,MACVF,EACJ,CACD,GAEF,2CA7GM,SAAmBtT,GAKxB,MAAO,IAAO2T,IACZC,GACO,cAAcA,EACpB,WAAApU,IAAeS,GACdP,SAASO,GACT,IAAK,MAAMuE,KAAOmP,EACjBnW,OAAO4F,eAAezD,KAAM6E,EAAK,IAC7BhH,OAAOuF,yBAAyBpD,KAAM6E,MACtCxE,GAGN,EAGJ,kGL5BmCwK,EAAgB1E,GAAO,GACrDwG,GAAuBA,GAAsBvE,KAAKyC,GAC7C1E,GAAMT,EAAQS,KAAK,4DAC7B,aKFM,SAAmBgM,EAAgB/R,GACxC,QAASvC,OAAOuF,yBAAyB+O,EAAQ/R,EAClD,oDN0hBM,SAAqBwG,GAC1B,OAAO7C,EAAc3E,IAAIwH,EAC1B,6HMvaM,SAAmB+M,GACxB,OAAOnS,EAAU,CAChB,MAAAP,CAAOwB,EAAUmR,GAChB,IAAIM,EAAe,EACfL,EAAkD,KAEtD,OAAO,YAAwBvT,GAC9B,MAAM6T,EAAMpW,KAAKoW,MAGjB,GAAIA,EAAMD,GAAgBP,EAOzB,OALIE,IACHC,aAAaD,GACbA,EAAY,MAEbK,EAAeC,EACR1R,EAAS6F,MAAMtI,KAAMM,GAI7B,IAAKuT,EAAW,CACf,MAAMO,EAAgBT,GAASQ,EAAMD,GAC/BG,EAAgB,IAAI/T,GAC1BuT,EAAYE,WAAW,KACtBG,EAAenW,KAAKoW,MACpB1R,EAAS6F,MAAMtI,KAAMqU,GACrBR,EAAY,MACVO,EACJ,CACD,CACD,GAEF,qDLpEM,SACLzU,EACA2U,EACA5O,EAAe,CAAA,GAEf,MAAwB,mBAAV/F,EAwBf,SACCA,EACA2U,GACAzM,UAAEA,GAAY,EAAK0M,KAAEA,GAAO,GAAU,IAEtC,IACIC,EADA5C,EAAgClE,GAEpC,MAAM+G,EAAY7O,GACjBN,EAAcsF,IACb,MAAMnB,EAAW9J,EAAMiL,GACnBgH,IAAanI,GAChBgB,GACCnF,EAAa,KACRsM,IAAalE,GACZ7F,GAAWyM,EAAQ7K,GACjB6K,EAAQ7K,EAAUmI,GACzBA,EAAWnI,EACP8K,IACCC,GAAaA,IACjBA,EAAcvI,GACbxC,EACAnE,EAAc3F,GAAU2U,EAAQ3U,EAAYA,GAAa2U,MAGzDA,KAEH3U,IAEJ,MAAO,KACN8U,IACID,GAAaA,IAEnB,CAvDIE,CAAc/U,EAAO2U,EAAS5O,GACb,iBAAV/F,EAOX,SACCA,EACA2U,GACAzM,UAAEA,GAAY,EAAK0M,KAAEA,GAAO,GAAU,IAEtC,OAAIA,EAAatI,GAAUtM,EAAO2U,EAAS,CAAEzM,cACtCjC,GACNN,EAAa,KACZiC,EAAU5H,GACNkI,GAAW4C,GAAU,IAAM6J,EAAQ3U,IACvCkI,GAAY,GACVyM,GAEL,CAnBKK,CAAYhV,EAAO2U,EAAS5O,GAC5B,MACA,MAAM,IAAIrH,MAAM,+CAChB,EAFA,EAGL,QLzHM,YAAmDiC,GACxD,IAAKA,EAAK4H,OAAQ,MAAO,GACzB,MAAM0M,EAAYvG,KAAKC,OAAOhO,EAAKsQ,IAAKiE,GAAQA,EAAI3M,SAC9C1D,EAA4B,GAElC,IAAK,IAAIiI,EAAI,EAAGA,EAAImI,EAAWnI,IAAK,CACnC,MAAMqI,EAAQxU,EAAKsQ,IAAKiE,GAAQA,EAAIpI,IACpCjI,EAAO4D,KAAK0M,EACb,CAEA,OAAOtQ,CACR"}