npm - @reddb-io/ui - Versions diffs - 0.4.0 → 0.4.2 - Mend

@reddb-io/ui 0.4.0 → 0.4.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (75) hide show

package/dist/embed/{index-BSBRHtH4.js.map → index-EW_M_YFX.js.map} RENAMED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index-BSBRHtH4.js","sources":["../../src/lib/reddb/dev-console.ts","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/constants.js","../../../../node_modules/.pnpm/esm-env@1.2.2/node_modules/esm-env/false.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/shared/utils.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/constants.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/shared/errors.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/errors.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/warnings.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/hydration.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/equality.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/flags/index.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/context.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/task.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/error-handling.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/status.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/utils.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/store/utils.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/store/shared/index.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/store.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/batch.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/async.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/deriveds.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/sources.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/proxy.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/operations.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/elements/misc.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/elements/bindings/shared.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/effects.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/runtime.js","../../src/lib/theme.svelte.ts","../../src/lib/build-info.ts","../../src/lib/reddb/server-capabilities.ts","../../src/lib/reddb/client.ts","../../src/lib/reddb/connection-provider.ts","../../src/lib/reddb/injected-client-provider.ts","../../src/lib/embed/index.ts"],"sourcesContent":["// Instrumented developer console (#128). A deliberately framework-agnostic,\n// rune-free observable store so the data layer (`RedClient`, transports) can\n// log every query and HTTP call without importing Svelte — the client seam\n// must not depend on the UI runtime. The Svelte panel bridges this store into\n// reactivity by subscribing and copying the snapshot into `$state`.\n//\n// Every entry is one round-trip the client made: the verb (HTTP method /\n// statement head), the target (path or endpoint), how long it took, how many\n// rows came back, and a sanitized payload — secrets are redacted before an\n// entry is ever stored, so a copy action can never leak a token.\n\n/** What kind of round-trip an entry records. /\nexport type ConsoleEntryKind = \"query\" \| \"http\";\n\nexport interface ConsoleEntry {\n /* Monotonic id, assigned on record. Stable for keying/dedup in the panel. /\n id: number;\n kind: ConsoleEntryKind;\n /* HTTP method or statement head, e.g. `POST`, `GET`, `SELECT`. /\n verb: string;\n /* Endpoint path or logical target the call hit, e.g. `/query`. /\n target: string;\n /* Absolute wall-clock time the call started. /\n startedAt: number;\n /* Round-trip duration in milliseconds. /\n durationMs: number;\n /* True when the call succeeded (2xx / resolved). /\n ok: boolean;\n /* HTTP status code when one is known. /\n status?: number;\n /* Rows returned, when the response carries a row/record count. /\n rowCount?: number;\n /* Sanitized request payload or query text — copyable, never contains secrets. /\n payload?: string;\n /* Error text when the call failed. /\n error?: string;\n}\n\n/* A record as handed to the store — the store owns `id`. /\nexport type ConsoleEntryInput = Omit<ConsoleEntry, \"id\">;\n\n/\n A per-entry tap on the console. Unlike `subscribe` (which observes the whole\n * snapshot for rendering), a sink receives each entry exactly once, as it is\n * recorded — the shape an embedding host wants for mirroring red-ui's traffic\n * into its own developer console.\n /\nexport type ConsoleSink = (entry: ConsoleEntry) => void;\n\ntype Listener = (entries: readonly ConsoleEntry[]) => void;\n\n/* Keys whose values are always masked, matched case-insensitively as substrings. /\nconst SENSITIVE_KEY_RE =\n /pass(word)?\|secret\|token\|api[-_]?key\|authorization\|auth\|credential\|cookie\|session\|bearer\|private[-_]?key\|mfa/i;\n\nconst REDACTED = \"«redacted»\";\n\n/\n Recursively redact sensitive values from an arbitrary structure, returning a\n * plain clone safe to stringify. A value under a sensitive key is replaced with\n * a marker rather than dropped, so the reader still sees that a field existed.\n * Depth- and breadth-bounded so a pathological payload can't blow the console.\n /\nexport function redactSecrets(value: unknown, depth = 0): unknown {\n if (depth > 6) return \"«…»\";\n if (Array.isArray(value)) {\n return value.slice(0, 100).map((v) => redactSecrets(v, depth + 1));\n }\n if (value && typeof value === \"object\") {\n const out: Record<string, unknown> = {};\n for (const [k, v] of Object.entries(value as Record<string, unknown>)) {\n out[k] = SENSITIVE_KEY_RE.test(k)\n ? REDACTED\n : redactSecrets(v, depth + 1);\n }\n return out;\n }\n return value;\n}\n\n/\n Turn a request body (a JSON string, an object, or anything else) into a\n * sanitized, human-readable string for the entry's copyable payload. Parses\n * JSON so keys can be redacted; falls back to a truncated raw string when the\n * body isn't JSON. Returns `undefined` for an absent body.\n /\nexport function sanitizePayload(body: unknown): string \| undefined {\n if (body === undefined \|\| body === null) return undefined;\n let parsed: unknown = body;\n if (typeof body === \"string\") {\n if (body.length === 0) return undefined;\n try {\n parsed = JSON.parse(body);\n } catch {\n return body.length > 2000 ? `${body.slice(0, 2000)}…` : body;\n }\n }\n try {\n const json = JSON.stringify(redactSecrets(parsed), null, 2);\n return json.length > 4000 ? `${json.slice(0, 4000)}…` : json;\n } catch {\n return undefined;\n }\n}\n\n/\n The developer console log. A bounded ring of entries with a minimal\n * subscribe/emit surface — no framework, no runes. `record` is the single\n * write path the client seam calls; `subscribe` is how the panel observes.\n /\nexport class DevConsoleStore {\n private entries: ConsoleEntry[] = [];\n private readonly listeners = new Set<Listener>();\n private readonly sinks = new Set<ConsoleSink>();\n private nextId = 1;\n\n /* Cap on retained entries; oldest are dropped past this. /\n constructor(private readonly capacity = 500) {}\n\n /* Append one round-trip. Assigns the id, trims to capacity, notifies. /\n record(input: ConsoleEntryInput): ConsoleEntry {\n const entry: ConsoleEntry = { ...input, id: this.nextId++ };\n this.entries.push(entry);\n if (this.entries.length > this.capacity) {\n this.entries.splice(0, this.entries.length - this.capacity);\n }\n this.emit();\n for (const sink of this.sinks) {\n try {\n sink(entry);\n } catch {\n // A host-owned sink must never be able to break the client seam.\n }\n }\n return entry;\n }\n\n /\n Tap every future entry. Entries recorded before the sink was added are\n * not replayed — a host mirrors live traffic, it doesn't import history.\n * Returns an unsubscribe.\n /\n addSink(sink: ConsoleSink): () => void {\n this.sinks.add(sink);\n return () => {\n this.sinks.delete(sink);\n };\n }\n\n /* A frozen, newest-last snapshot of the log. /\n snapshot(): readonly ConsoleEntry[] {\n return this.entries.slice();\n }\n\n /* Number of retained entries. /\n get size(): number {\n return this.entries.length;\n }\n\n /* Drop every entry and notify. /\n clear(): void {\n if (this.entries.length === 0) return;\n this.entries = [];\n this.emit();\n }\n\n /\n Observe the log. The listener fires immediately with the current snapshot\n * and again on every change. Returns an unsubscribe.\n /\n subscribe(listener: Listener): () => void {\n this.listeners.add(listener);\n listener(this.snapshot());\n return () => {\n this.listeners.delete(listener);\n };\n }\n\n private emit(): void {\n const snap = this.snapshot();\n for (const listener of this.listeners) listener(snap);\n }\n}\n\n/* The singleton the client seam records into and the panel observes. /\nexport const devConsole = new DevConsoleStore();\n","export const EACH_ITEM_REACTIVE = 1;\nexport const EACH_INDEX_REACTIVE = 1 << 1;\n/* See EachBlock interface metadata.is_controlled for an explanation what this is /\nexport const EACH_IS_CONTROLLED = 1 << 2;\nexport const EACH_IS_ANIMATED = 1 << 3;\nexport const EACH_ITEM_IMMUTABLE = 1 << 4;\n\nexport const PROPS_IS_IMMUTABLE = 1;\nexport const PROPS_IS_RUNES = 1 << 1;\nexport const PROPS_IS_UPDATED = 1 << 2;\nexport const PROPS_IS_BINDABLE = 1 << 3;\nexport const PROPS_IS_LAZY_INITIAL = 1 << 4;\n\nexport const TRANSITION_IN = 1;\nexport const TRANSITION_OUT = 1 << 1;\nexport const TRANSITION_GLOBAL = 1 << 2;\n\nexport const TEMPLATE_FRAGMENT = 1;\nexport const TEMPLATE_USE_IMPORT_NODE = 1 << 1;\nexport const TEMPLATE_USE_SVG = 1 << 2;\nexport const TEMPLATE_USE_MATHML = 1 << 3;\n\nexport const HYDRATION_START = '[';\n/* used to indicate that an `{:else}...` block was rendered /\nexport const HYDRATION_START_ELSE = '[!';\n/* used to indicate that a boundary's `failed` snippet was rendered on the server /\nexport const HYDRATION_START_FAILED = '[?';\nexport const HYDRATION_END = ']';\nexport const HYDRATION_ERROR = {};\n\nexport const ELEMENT_IS_NAMESPACED = 1;\nexport const ELEMENT_PRESERVE_ATTRIBUTE_CASE = 1 << 1;\nexport const ELEMENT_IS_INPUT = 1 << 2;\n\nexport const UNINITIALIZED = Symbol('uninitialized');\n\n// Dev-time component properties\nexport const FILENAME = Symbol('filename');\nexport const HMR = Symbol('hmr');\n\nexport const NAMESPACE_HTML = 'http://www.w3.org/1999/xhtml';\nexport const NAMESPACE_SVG = 'http://www.w3.org/2000/svg';\nexport const NAMESPACE_MATHML = 'http://www.w3.org/1998/Math/MathML';\n\n// we use a list of ignorable runtime warnings because not every runtime warning\n// can be ignored and we want to keep the validation for svelte-ignore in place\nexport const IGNORABLE_RUNTIME_WARNINGS = /* @type {const} / ([\n\t'await_waterfall',\n\t'await_reactivity_loss',\n\t'state_snapshot_uncloneable',\n\t'binding_property_non_reactive',\n\t'hydration_attribute_changed',\n\t'hydration_html_changed',\n\t'ownership_invalid_binding',\n\t'ownership_invalid_mutation'\n]);\n\n/\n Whitespace inside one of these elements will not result in\n * a whitespace node being created in any circumstances. (This\n * list is almost certainly very incomplete)\n * TODO this is currently unused\n /\nexport const ELEMENTS_WITHOUT_TEXT = ['audio', 'datalist', 'dl', 'optgroup', 'select', 'video'];\n\nexport const ATTACHMENT_KEY = '@attach';\n","export default false;\n","// Store the references to globals in case someone tries to monkey patch these, causing the below\n// to de-opt (this occurs often when using popular extensions).\nexport var is_array = Array.isArray;\nexport var index_of = Array.prototype.indexOf;\nexport var includes = Array.prototype.includes;\nexport var array_from = Array.from;\nexport var object_keys = Object.keys;\nexport var define_property = Object.defineProperty;\nexport var get_descriptor = Object.getOwnPropertyDescriptor;\nexport var get_descriptors = Object.getOwnPropertyDescriptors;\nexport var object_prototype = Object.prototype;\nexport var array_prototype = Array.prototype;\nexport var get_prototype_of = Object.getPrototypeOf;\nexport var is_extensible = Object.isExtensible;\nexport var has_own_property = Object.prototype.hasOwnProperty;\n\n/\n @param {any} thing\n * @returns {thing is Function}\n /\nexport function is_function(thing) {\n\treturn typeof thing === 'function';\n}\n\nexport const noop = () => {};\n\n// Adapted from https://github.com/then/is-promise/blob/master/index.js\n// Distributed under MIT License https://github.com/then/is-promise/blob/master/LICENSE\n\n/\n @template [T=any]\n * @param {any} value\n * @returns {value is PromiseLike<T>}\n /\nexport function is_promise(value) {\n\treturn typeof value?.then === 'function';\n}\n\n/* @param {Function} fn /\nexport function run(fn) {\n\treturn fn();\n}\n\n/* @param {Array<() => void>} arr /\nexport function run_all(arr) {\n\tfor (var i = 0; i < arr.length; i++) {\n\t\tarr[i]();\n\t}\n}\n\n/\n TODO replace with Promise.withResolvers once supported widely enough\n * @template [T=void]\n /\nexport function deferred() {\n\t/* @type {(value: T) => void} /\n\tvar resolve;\n\n\t/* @type {(reason: any) => void} /\n\tvar reject;\n\n\t/* @type {Promise<T>} /\n\tvar promise = new Promise((res, rej) => {\n\t\tresolve = res;\n\t\treject = rej;\n\t});\n\n\t// @ts-expect-error\n\treturn { promise, resolve, reject };\n}\n\n/\n @template V\n * @param {V} value\n * @param {V \| (() => V)} fallback\n * @param {boolean} [lazy]\n * @returns {V}\n /\nexport function fallback(value, fallback, lazy = false) {\n\treturn value === undefined\n\t\t? lazy\n\t\t\t? /* @type {() => V} / (fallback)()\n\t\t\t: /* @type {V} / (fallback)\n\t\t: value;\n}\n\n/\n When encountering a situation like `let [a, b, c] = $derived(blah())`,\n * we need to stash an intermediate value that `a`, `b`, and `c` derive\n * from, in case it's an iterable\n * @template T\n * @param {ArrayLike<T> \| Iterable<T>} value\n * @param {number} [n]\n * @returns {Array<T>}\n /\nexport function to_array(value, n) {\n\t// return arrays unchanged\n\tif (Array.isArray(value)) {\n\t\treturn value;\n\t}\n\n\t// if value is not iterable, or `n` is unspecified (indicates a rest\n\t// element, which means we're not concerned about unbounded iterables)\n\t// convert to an array with `Array.from`\n\tif (n === undefined \|\| !(Symbol.iterator in value)) {\n\t\treturn Array.from(value);\n\t}\n\n\t// otherwise, populate an array with `n` values\n\n\t/* @type {T[]} /\n\tconst array = [];\n\n\tfor (const element of value) {\n\t\tarray.push(element);\n\t\tif (array.length === n) break;\n\t}\n\n\treturn array;\n}\n\n/\n @param {Record<string \| symbol, unknown>} obj\n * @param {Array<string \| symbol>} keys\n * @returns {Record<string \| symbol, unknown>}\n /\nexport function exclude_from_object(obj, keys) {\n\t/* @type {Record<string \| symbol, unknown>} /\n\tvar result = {};\n\n\tfor (var key in obj) {\n\t\tif (!keys.includes(key)) {\n\t\t\tresult[key] = obj[key];\n\t\t}\n\t}\n\n\tfor (var symbol of Object.getOwnPropertySymbols(obj)) {\n\t\tif (Object.propertyIsEnumerable.call(obj, symbol) && !keys.includes(symbol)) {\n\t\t\tresult[symbol] = obj[symbol];\n\t\t}\n\t}\n\n\treturn result;\n}\n","// General flags\nexport const DERIVED = 1 << 1;\nexport const EFFECT = 1 << 2;\nexport const RENDER_EFFECT = 1 << 3;\n/\n An effect that does not destroy its child effects when it reruns.\n * Runs as part of render effects, i.e. not eagerly as part of tree traversal or effect flushing.\n /\nexport const MANAGED_EFFECT = 1 << 24;\n/\n An effect that does not destroy its child effects when it reruns (like MANAGED_EFFECT).\n * Runs eagerly as part of tree traversal or effect flushing.\n /\nexport const BLOCK_EFFECT = 1 << 4;\nexport const BRANCH_EFFECT = 1 << 5;\nexport const ROOT_EFFECT = 1 << 6;\nexport const BOUNDARY_EFFECT = 1 << 7;\n/\n Indicates that a reaction is connected to an effect root — either it is an effect,\n * or it is a derived that is depended on by at least one effect. If a derived has\n * no dependents, we can disconnect it from the graph, allowing it to either be\n * GC'd or reconnected later if an effect comes to depend on it again\n /\nexport const CONNECTED = 1 << 9;\nexport const CLEAN = 1 << 10;\nexport const DIRTY = 1 << 11;\nexport const MAYBE_DIRTY = 1 << 12;\nexport const INERT = 1 << 13;\nexport const DESTROYED = 1 << 14;\n/* Set once a reaction has run for the first time /\nexport const REACTION_RAN = 1 << 15;\n/* Effect is in the process of getting destroyed. Can be observed in child teardown functions /\nexport const DESTROYING = 1 << 25;\n\n// Flags exclusive to effects\n/\n 'Transparent' effects do not create a transition boundary.\n * This is on a block effect 99% of the time but may also be on a branch effect if its parent block effect was pruned\n /\nexport const EFFECT_TRANSPARENT = 1 << 16;\nexport const EAGER_EFFECT = 1 << 17;\nexport const HEAD_EFFECT = 1 << 18;\nexport const EFFECT_PRESERVED = 1 << 19;\nexport const USER_EFFECT = 1 << 20;\nexport const EFFECT_OFFSCREEN = 1 << 25;\n\n// Flags exclusive to deriveds\n/\n Tells that we marked this derived and its reactions as visited during the \"mark as (maybe) dirty\"-phase.\n * Will be lifted during execution of the derived and during checking its dirty state (both are necessary\n * because a derived might be checked but not executed). This is a pure performance optimization flag and\n * should not be used for any other purpose!\n /\nexport const WAS_MARKED = 1 << 16;\n\n// Flags used for async\nexport const REACTION_IS_UPDATING = 1 << 21;\nexport const ASYNC = 1 << 22;\n\nexport const ERROR_VALUE = 1 << 23;\n\nexport const STATE_SYMBOL = Symbol('$state');\nexport const LEGACY_PROPS = Symbol('legacy props');\nexport const LOADING_ATTR_SYMBOL = Symbol('');\nexport const PROXY_PATH_SYMBOL = Symbol('proxy path');\nexport const ATTRIBUTES_CACHE = Symbol('attributes');\nexport const CLASS_CACHE = Symbol('class');\nexport const STYLE_CACHE = Symbol('style');\nexport const TEXT_CACHE = Symbol('text');\nexport const FORM_RESET_HANDLER = Symbol('form reset');\n/* An anchor might change, via this symbol on the original anchor we can tell HMR about the updated anchor /\nexport const HMR_ANCHOR = Symbol('hmr anchor');\n\n/* allow users to ignore aborted signal errors if `reason.name === 'StaleReactionError` /\nexport const STALE_REACTION = new (class StaleReactionError extends Error {\n\tname = 'StaleReactionError';\n\tmessage = 'The reaction that called `getAbortSignal()` was re-run or destroyed';\n})();\n\nexport const IS_XHTML =\n\t// We gotta write it like this because after downleveling the pure comment may end up in the wrong location\n\t!!globalThis.document?.contentType &&\n\t/ @__PURE__ / globalThis.document.contentType.includes('xml');\nexport const ELEMENT_NODE = 1;\nexport const TEXT_NODE = 3;\nexport const COMMENT_NODE = 8;\nexport const DOCUMENT_FRAGMENT_NODE = 11;\n","/ This file is generated by scripts/process-messages/index.js. Do not edit! /\n\nimport { DEV } from 'esm-env';\n\n/\n Cannot use `%name%(...)` unless the `experimental.async` compiler option is `true`\n * @param {string} name\n * @returns {never}\n /\nexport function experimental_async_required(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`experimental_async_required\\nCannot use \\`${name}(...)\\` unless the \\`experimental.async\\` compiler option is \\`true\\`\\nhttps://svelte.dev/e/experimental_async_required`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/experimental_async_required`);\n\t}\n}\n\n/\n Cannot use `{@render children(...)}` if the parent component uses `let:` directives. Consider using a named snippet instead\n * @returns {never}\n /\nexport function invalid_default_snippet() {\n\tif (DEV) {\n\t\tconst error = new Error(`invalid_default_snippet\\nCannot use \\`{@render children(...)}\\` if the parent component uses \\`let:\\` directives. Consider using a named snippet instead\\nhttps://svelte.dev/e/invalid_default_snippet`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invalid_default_snippet`);\n\t}\n}\n\n/\n A snippet function was passed invalid arguments. Snippets should only be instantiated via `{@render ...}`\n * @returns {never}\n /\nexport function invalid_snippet_arguments() {\n\tif (DEV) {\n\t\tconst error = new Error(`invalid_snippet_arguments\\nA snippet function was passed invalid arguments. Snippets should only be instantiated via \\`{@render ...}\\`\\nhttps://svelte.dev/e/invalid_snippet_arguments`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invalid_snippet_arguments`);\n\t}\n}\n\n/\n An invariant violation occurred, meaning Svelte's internal assumptions were flawed. This is a bug in Svelte, not your app — please open an issue at https://github.com/sveltejs/svelte, citing the following message: \"%message%\"\n * @param {string} message\n * @returns {never}\n /\nexport function invariant_violation(message) {\n\tif (DEV) {\n\t\tconst error = new Error(`invariant_violation\\nAn invariant violation occurred, meaning Svelte's internal assumptions were flawed. This is a bug in Svelte, not your app — please open an issue at https://github.com/sveltejs/svelte, citing the following message: \"${message}\"\\nhttps://svelte.dev/e/invariant_violation`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invariant_violation`);\n\t}\n}\n\n/\n `%name%(...)` can only be used during component initialisation\n * @param {string} name\n * @returns {never}\n /\nexport function lifecycle_outside_component(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`lifecycle_outside_component\\n\\`${name}(...)\\` can only be used during component initialisation\\nhttps://svelte.dev/e/lifecycle_outside_component`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/lifecycle_outside_component`);\n\t}\n}\n\n/\n Context was not set in a parent component\n * @returns {never}\n /\nexport function missing_context() {\n\tif (DEV) {\n\t\tconst error = new Error(`missing_context\\nContext was not set in a parent component\\nhttps://svelte.dev/e/missing_context`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/missing_context`);\n\t}\n}\n\n/\n Attempted to render a snippet without a `{@render}` block. This would cause the snippet code to be stringified instead of its content being rendered to the DOM. To fix this, change `{snippet}` to `{@render snippet()}`.\n * @returns {never}\n /\nexport function snippet_without_render_tag() {\n\tif (DEV) {\n\t\tconst error = new Error(`snippet_without_render_tag\\nAttempted to render a snippet without a \\`{@render}\\` block. This would cause the snippet code to be stringified instead of its content being rendered to the DOM. To fix this, change \\`{snippet}\\` to \\`{@render snippet()}\\`.\\nhttps://svelte.dev/e/snippet_without_render_tag`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/snippet_without_render_tag`);\n\t}\n}\n\n/\n `%name%` is not a store with a `subscribe` method\n * @param {string} name\n * @returns {never}\n /\nexport function store_invalid_shape(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`store_invalid_shape\\n\\`${name}\\` is not a store with a \\`subscribe\\` method\\nhttps://svelte.dev/e/store_invalid_shape`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/store_invalid_shape`);\n\t}\n}\n\n/\n The `this` prop on `<svelte:element>` must be a string, if defined\n * @returns {never}\n /\nexport function svelte_element_invalid_this_value() {\n\tif (DEV) {\n\t\tconst error = new Error(`svelte_element_invalid_this_value\\nThe \\`this\\` prop on \\`<svelte:element>\\` must be a string, if defined\\nhttps://svelte.dev/e/svelte_element_invalid_this_value`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/svelte_element_invalid_this_value`);\n\t}\n}","/ This file is generated by scripts/process-messages/index.js. Do not edit! /\n\nimport { DEV } from 'esm-env';\n\nexport from '../shared/errors.js';\n\n/*\n Cannot create a `$derived(...)` with an `await` expression outside of an effect tree\n * @returns {never}\n /\nexport function async_derived_orphan() {\n\tif (DEV) {\n\t\tconst error = new Error(`async_derived_orphan\\nCannot create a \\`$derived(...)\\` with an \\`await\\` expression outside of an effect tree\\nhttps://svelte.dev/e/async_derived_orphan`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/async_derived_orphan`);\n\t}\n}\n\n/\n Using `bind:value` together with a checkbox input is not allowed. Use `bind:checked` instead\n * @returns {never}\n /\nexport function bind_invalid_checkbox_value() {\n\tif (DEV) {\n\t\tconst error = new Error(`bind_invalid_checkbox_value\\nUsing \\`bind:value\\` together with a checkbox input is not allowed. Use \\`bind:checked\\` instead\\nhttps://svelte.dev/e/bind_invalid_checkbox_value`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/bind_invalid_checkbox_value`);\n\t}\n}\n\n/\n Component %component% has an export named `%key%` that a consumer component is trying to access using `bind:%key%`, which is disallowed. Instead, use `bind:this` (e.g. `<%name% bind:this={component} />`) and then access the property on the bound component instance (e.g. `component.%key%`)\n * @param {string} component\n * @param {string} key\n * @param {string} name\n * @returns {never}\n /\nexport function bind_invalid_export(component, key, name) {\n\tif (DEV) {\n\t\tconst error = new Error(`bind_invalid_export\\nComponent ${component} has an export named \\`${key}\\` that a consumer component is trying to access using \\`bind:${key}\\`, which is disallowed. Instead, use \\`bind:this\\` (e.g. \\`<${name} bind:this={component} />\\`) and then access the property on the bound component instance (e.g. \\`component.${key}\\`)\\nhttps://svelte.dev/e/bind_invalid_export`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/bind_invalid_export`);\n\t}\n}\n\n/\n A component is attempting to bind to a non-bindable property `%key%` belonging to %component% (i.e. `<%name% bind:%key%={...}>`). To mark a property as bindable: `let { %key% = $bindable() } = $props()`\n * @param {string} key\n * @param {string} component\n * @param {string} name\n * @returns {never}\n /\nexport function bind_not_bindable(key, component, name) {\n\tif (DEV) {\n\t\tconst error = new Error(`bind_not_bindable\\nA component is attempting to bind to a non-bindable property \\`${key}\\` belonging to ${component} (i.e. \\`<${name} bind:${key}={...}>\\`). To mark a property as bindable: \\`let { ${key} = $bindable() } = $props()\\`\\nhttps://svelte.dev/e/bind_not_bindable`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/bind_not_bindable`);\n\t}\n}\n\n/\n Calling `%method%` on a component instance (of %component%) is no longer valid in Svelte 5\n * @param {string} method\n * @param {string} component\n * @returns {never}\n /\nexport function component_api_changed(method, component) {\n\tif (DEV) {\n\t\tconst error = new Error(`component_api_changed\\nCalling \\`${method}\\` on a component instance (of ${component}) is no longer valid in Svelte 5\\nhttps://svelte.dev/e/component_api_changed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/component_api_changed`);\n\t}\n}\n\n/\n Attempted to instantiate %component% with `new %name%`, which is no longer valid in Svelte 5. If this component is not under your control, set the `compatibility.componentApi` compiler option to `4` to keep it working.\n * @param {string} component\n * @param {string} name\n * @returns {never}\n /\nexport function component_api_invalid_new(component, name) {\n\tif (DEV) {\n\t\tconst error = new Error(`component_api_invalid_new\\nAttempted to instantiate ${component} with \\`new ${name}\\`, which is no longer valid in Svelte 5. If this component is not under your control, set the \\`compatibility.componentApi\\` compiler option to \\`4\\` to keep it working.\\nhttps://svelte.dev/e/component_api_invalid_new`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/component_api_invalid_new`);\n\t}\n}\n\n/\n A derived value cannot reference itself recursively\n * @returns {never}\n /\nexport function derived_references_self() {\n\tif (DEV) {\n\t\tconst error = new Error(`derived_references_self\\nA derived value cannot reference itself recursively\\nhttps://svelte.dev/e/derived_references_self`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/derived_references_self`);\n\t}\n}\n\n/\n Keyed each block has duplicate key `%value%` at indexes %a% and %b%\n * @param {string} a\n * @param {string} b\n * @param {string \| undefined \| null} [value]\n * @returns {never}\n /\nexport function each_key_duplicate(a, b, value) {\n\tif (DEV) {\n\t\tconst error = new Error(`each_key_duplicate\\n${value\n\t\t\t? `Keyed each block has duplicate key \\`${value}\\` at indexes ${a} and ${b}`\n\t\t\t: `Keyed each block has duplicate key at indexes ${a} and ${b}`}\\nhttps://svelte.dev/e/each_key_duplicate`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/each_key_duplicate`);\n\t}\n}\n\n/\n Keyed each block has key that is not idempotent — the key for item at index %index% was `%a%` but is now `%b%`. Keys must be the same each time for a given item\n * @param {string} index\n * @param {string} a\n * @param {string} b\n * @returns {never}\n /\nexport function each_key_volatile(index, a, b) {\n\tif (DEV) {\n\t\tconst error = new Error(`each_key_volatile\\nKeyed each block has key that is not idempotent — the key for item at index ${index} was \\`${a}\\` but is now \\`${b}\\`. Keys must be the same each time for a given item\\nhttps://svelte.dev/e/each_key_volatile`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/each_key_volatile`);\n\t}\n}\n\n/\n `%rune%` cannot be used inside an effect cleanup function\n * @param {string} rune\n * @returns {never}\n /\nexport function effect_in_teardown(rune) {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_in_teardown\\n\\`${rune}\\` cannot be used inside an effect cleanup function\\nhttps://svelte.dev/e/effect_in_teardown`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_in_teardown`);\n\t}\n}\n\n/\n Effect cannot be created inside a `$derived` value that was not itself created inside an effect\n * @returns {never}\n /\nexport function effect_in_unowned_derived() {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_in_unowned_derived\\nEffect cannot be created inside a \\`$derived\\` value that was not itself created inside an effect\\nhttps://svelte.dev/e/effect_in_unowned_derived`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_in_unowned_derived`);\n\t}\n}\n\n/\n `%rune%` can only be used inside an effect (e.g. during component initialisation)\n * @param {string} rune\n * @returns {never}\n /\nexport function effect_orphan(rune) {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_orphan\\n\\`${rune}\\` can only be used inside an effect (e.g. during component initialisation)\\nhttps://svelte.dev/e/effect_orphan`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_orphan`);\n\t}\n}\n\n/\n `$effect.pending()` can only be called inside an effect or derived\n * @returns {never}\n /\nexport function effect_pending_outside_reaction() {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_pending_outside_reaction\\n\\`$effect.pending()\\` can only be called inside an effect or derived\\nhttps://svelte.dev/e/effect_pending_outside_reaction`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_pending_outside_reaction`);\n\t}\n}\n\n/\n Maximum update depth exceeded. This typically indicates that an effect reads and writes the same piece of state\n * @returns {never}\n /\nexport function effect_update_depth_exceeded() {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_update_depth_exceeded\\nMaximum update depth exceeded. This typically indicates that an effect reads and writes the same piece of state\\nhttps://svelte.dev/e/effect_update_depth_exceeded`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_update_depth_exceeded`);\n\t}\n}\n\n/\n Cannot use `flushSync` inside an effect\n * @returns {never}\n /\nexport function flush_sync_in_effect() {\n\tif (DEV) {\n\t\tconst error = new Error(`flush_sync_in_effect\\nCannot use \\`flushSync\\` inside an effect\\nhttps://svelte.dev/e/flush_sync_in_effect`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/flush_sync_in_effect`);\n\t}\n}\n\n/\n Cannot commit a fork that was already discarded\n * @returns {never}\n /\nexport function fork_discarded() {\n\tif (DEV) {\n\t\tconst error = new Error(`fork_discarded\\nCannot commit a fork that was already discarded\\nhttps://svelte.dev/e/fork_discarded`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/fork_discarded`);\n\t}\n}\n\n/\n Cannot create a fork inside an effect or when state changes are pending\n * @returns {never}\n /\nexport function fork_timing() {\n\tif (DEV) {\n\t\tconst error = new Error(`fork_timing\\nCannot create a fork inside an effect or when state changes are pending\\nhttps://svelte.dev/e/fork_timing`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/fork_timing`);\n\t}\n}\n\n/\n `getAbortSignal()` can only be called inside an effect or derived\n * @returns {never}\n /\nexport function get_abort_signal_outside_reaction() {\n\tif (DEV) {\n\t\tconst error = new Error(`get_abort_signal_outside_reaction\\n\\`getAbortSignal()\\` can only be called inside an effect or derived\\nhttps://svelte.dev/e/get_abort_signal_outside_reaction`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/get_abort_signal_outside_reaction`);\n\t}\n}\n\n/\n Expected to find a hydratable with key `%key%` during hydration, but did not.\n * @param {string} key\n * @returns {never}\n /\nexport function hydratable_missing_but_required(key) {\n\tif (DEV) {\n\t\tconst error = new Error(`hydratable_missing_but_required\\nExpected to find a hydratable with key \\`${key}\\` during hydration, but did not.\\nhttps://svelte.dev/e/hydratable_missing_but_required`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/hydratable_missing_but_required`);\n\t}\n}\n\n/\n Failed to hydrate the application\n * @returns {never}\n /\nexport function hydration_failed() {\n\tif (DEV) {\n\t\tconst error = new Error(`hydration_failed\\nFailed to hydrate the application\\nhttps://svelte.dev/e/hydration_failed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/hydration_failed`);\n\t}\n}\n\n/\n Could not `{@render}` snippet due to the expression being `null` or `undefined`. Consider using optional chaining `{@render snippet?.()}`\n * @returns {never}\n /\nexport function invalid_snippet() {\n\tif (DEV) {\n\t\tconst error = new Error(`invalid_snippet\\nCould not \\`{@render}\\` snippet due to the expression being \\`null\\` or \\`undefined\\`. Consider using optional chaining \\`{@render snippet?.()}\\`\\nhttps://svelte.dev/e/invalid_snippet`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invalid_snippet`);\n\t}\n}\n\n/\n `%name%(...)` cannot be used in runes mode\n * @param {string} name\n * @returns {never}\n /\nexport function lifecycle_legacy_only(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`lifecycle_legacy_only\\n\\`${name}(...)\\` cannot be used in runes mode\\nhttps://svelte.dev/e/lifecycle_legacy_only`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/lifecycle_legacy_only`);\n\t}\n}\n\n/\n Cannot do `bind:%key%={undefined}` when `%key%` has a fallback value\n * @param {string} key\n * @returns {never}\n /\nexport function props_invalid_value(key) {\n\tif (DEV) {\n\t\tconst error = new Error(`props_invalid_value\\nCannot do \\`bind:${key}={undefined}\\` when \\`${key}\\` has a fallback value\\nhttps://svelte.dev/e/props_invalid_value`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/props_invalid_value`);\n\t}\n}\n\n/\n Rest element properties of `$props()` such as `%property%` are readonly\n * @param {string} property\n * @returns {never}\n /\nexport function props_rest_readonly(property) {\n\tif (DEV) {\n\t\tconst error = new Error(`props_rest_readonly\\nRest element properties of \\`$props()\\` such as \\`${property}\\` are readonly\\nhttps://svelte.dev/e/props_rest_readonly`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/props_rest_readonly`);\n\t}\n}\n\n/\n The `%rune%` rune is only available inside `.svelte` and `.svelte.js/ts` files\n * @param {string} rune\n * @returns {never}\n /\nexport function rune_outside_svelte(rune) {\n\tif (DEV) {\n\t\tconst error = new Error(`rune_outside_svelte\\nThe \\`${rune}\\` rune is only available inside \\`.svelte\\` and \\`.svelte.js/ts\\` files\\nhttps://svelte.dev/e/rune_outside_svelte`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/rune_outside_svelte`);\n\t}\n}\n\n/\n `setContext` must be called when a component first initializes, not in a subsequent effect or after an `await` expression\n * @returns {never}\n /\nexport function set_context_after_init() {\n\tif (DEV) {\n\t\tconst error = new Error(`set_context_after_init\\n\\`setContext\\` must be called when a component first initializes, not in a subsequent effect or after an \\`await\\` expression\\nhttps://svelte.dev/e/set_context_after_init`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/set_context_after_init`);\n\t}\n}\n\n/\n Property descriptors defined on `$state` objects must contain `value` and always be `enumerable`, `configurable` and `writable`.\n * @returns {never}\n /\nexport function state_descriptors_fixed() {\n\tif (DEV) {\n\t\tconst error = new Error(`state_descriptors_fixed\\nProperty descriptors defined on \\`$state\\` objects must contain \\`value\\` and always be \\`enumerable\\`, \\`configurable\\` and \\`writable\\`.\\nhttps://svelte.dev/e/state_descriptors_fixed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/state_descriptors_fixed`);\n\t}\n}\n\n/\n Cannot set prototype of `$state` object\n * @returns {never}\n /\nexport function state_prototype_fixed() {\n\tif (DEV) {\n\t\tconst error = new Error(`state_prototype_fixed\\nCannot set prototype of \\`$state\\` object\\nhttps://svelte.dev/e/state_prototype_fixed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/state_prototype_fixed`);\n\t}\n}\n\n/\n Updating state inside `$derived(...)`, `$inspect(...)` or a template expression is forbidden. If the value should not be reactive, declare it without `$state`\n * @returns {never}\n /\nexport function state_unsafe_mutation() {\n\tif (DEV) {\n\t\tconst error = new Error(`state_unsafe_mutation\\nUpdating state inside \\`$derived(...)\\`, \\`$inspect(...)\\` or a template expression is forbidden. If the value should not be reactive, declare it without \\`$state\\`\\nhttps://svelte.dev/e/state_unsafe_mutation`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/state_unsafe_mutation`);\n\t}\n}\n\n/\n A `<svelte:boundary>` `reset` function cannot be called while an error is still being handled\n * @returns {never}\n /\nexport function svelte_boundary_reset_onerror() {\n\tif (DEV) {\n\t\tconst error = new Error(`svelte_boundary_reset_onerror\\nA \\`<svelte:boundary>\\` \\`reset\\` function cannot be called while an error is still being handled\\nhttps://svelte.dev/e/svelte_boundary_reset_onerror`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/svelte_boundary_reset_onerror`);\n\t}\n}","/ This file is generated by scripts/process-messages/index.js. Do not edit! /\n\nimport { DEV } from 'esm-env';\n\nvar bold = 'font-weight: bold';\nvar normal = 'font-weight: normal';\n\n/\n Assignment to `%property%` property (%location%) will evaluate to the right-hand side, not the value of `%property%` following the assignment. This may result in unexpected behaviour.\n * @param {string} property\n * @param {string} location\n /\nexport function assignment_value_stale(property, location) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] assignment_value_stale\\n%cAssignment to \\`${property}\\` property (${location}) will evaluate to the right-hand side, not the value of \\`${property}\\` following the assignment. This may result in unexpected behaviour.\\nhttps://svelte.dev/e/assignment_value_stale`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/assignment_value_stale`);\n\t}\n}\n\n/\n Detected reactivity loss when reading `%name%`. This happens when state is read in an async function after an earlier `await`\n * @param {string} name\n /\nexport function await_reactivity_loss(name) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] await_reactivity_loss\\n%cDetected reactivity loss when reading \\`${name}\\`. This happens when state is read in an async function after an earlier \\`await\\`\\nhttps://svelte.dev/e/await_reactivity_loss`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/await_reactivity_loss`);\n\t}\n}\n\n/\n An async derived, `%name%` (%location%) was not read immediately after it resolved. This often indicates an unnecessary waterfall, which can slow down your app\n * @param {string} name\n * @param {string} location\n /\nexport function await_waterfall(name, location) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] await_waterfall\\n%cAn async derived, \\`${name}\\` (${location}) was not read immediately after it resolved. This often indicates an unnecessary waterfall, which can slow down your app\\nhttps://svelte.dev/e/await_waterfall`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/await_waterfall`);\n\t}\n}\n\n/\n `%binding%` (%location%) is binding to a non-reactive property\n * @param {string} binding\n * @param {string \| undefined \| null} [location]\n /\nexport function binding_property_non_reactive(binding, location) {\n\tif (DEV) {\n\t\tconsole.warn(\n\t\t\t`%c[svelte] binding_property_non_reactive\\n%c${location\n\t\t\t\t? `\\`${binding}\\` (${location}) is binding to a non-reactive property`\n\t\t\t\t: `\\`${binding}\\` is binding to a non-reactive property`}\\nhttps://svelte.dev/e/binding_property_non_reactive`,\n\t\t\tbold,\n\t\t\tnormal\n\t\t);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/binding_property_non_reactive`);\n\t}\n}\n\n/\n Your `console.%method%` contained `$state` proxies. Consider using `$inspect(...)` or `$state.snapshot(...)` instead\n * @param {string} method\n /\nexport function console_log_state(method) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] console_log_state\\n%cYour \\`console.${method}\\` contained \\`$state\\` proxies. Consider using \\`$inspect(...)\\` or \\`$state.snapshot(...)\\` instead\\nhttps://svelte.dev/e/console_log_state`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/console_log_state`);\n\t}\n}\n\n/\n Reading a derived belonging to a now-destroyed effect may result in stale values\n /\nexport function derived_inert() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] derived_inert\\n%cReading a derived belonging to a now-destroyed effect may result in stale values\\nhttps://svelte.dev/e/derived_inert`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/derived_inert`);\n\t}\n}\n\n/\n %handler% should be a function. Did you mean to %suggestion%?\n * @param {string} handler\n * @param {string} suggestion\n /\nexport function event_handler_invalid(handler, suggestion) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] event_handler_invalid\\n%c${handler} should be a function. Did you mean to ${suggestion}?\\nhttps://svelte.dev/e/event_handler_invalid`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/event_handler_invalid`);\n\t}\n}\n\n/\n Expected to find a hydratable with key `%key%` during hydration, but did not.\n * @param {string} key\n /\nexport function hydratable_missing_but_expected(key) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] hydratable_missing_but_expected\\n%cExpected to find a hydratable with key \\`${key}\\` during hydration, but did not.\\nhttps://svelte.dev/e/hydratable_missing_but_expected`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydratable_missing_but_expected`);\n\t}\n}\n\n/\n The `%attribute%` attribute on `%html%` changed its value between server and client renders. The client value, `%value%`, will be ignored in favour of the server value\n * @param {string} attribute\n * @param {string} html\n * @param {string} value\n /\nexport function hydration_attribute_changed(attribute, html, value) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] hydration_attribute_changed\\n%cThe \\`${attribute}\\` attribute on \\`${html}\\` changed its value between server and client renders. The client value, \\`${value}\\`, will be ignored in favour of the server value\\nhttps://svelte.dev/e/hydration_attribute_changed`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydration_attribute_changed`);\n\t}\n}\n\n/\n The value of an `{@html ...}` block %location% changed between server and client renders. The client value will be ignored in favour of the server value\n * @param {string \| undefined \| null} [location]\n /\nexport function hydration_html_changed(location) {\n\tif (DEV) {\n\t\tconsole.warn(\n\t\t\t`%c[svelte] hydration_html_changed\\n%c${location\n\t\t\t\t? `The value of an \\`{@html ...}\\` block ${location} changed between server and client renders. The client value will be ignored in favour of the server value`\n\t\t\t\t: 'The value of an `{@html ...}` block changed between server and client renders. The client value will be ignored in favour of the server value'}\\nhttps://svelte.dev/e/hydration_html_changed`,\n\t\t\tbold,\n\t\t\tnormal\n\t\t);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydration_html_changed`);\n\t}\n}\n\n/\n Hydration failed because the initial UI does not match what was rendered on the server. The error occurred near %location%\n * @param {string \| undefined \| null} [location]\n /\nexport function hydration_mismatch(location) {\n\tif (DEV) {\n\t\tconsole.warn(\n\t\t\t`%c[svelte] hydration_mismatch\\n%c${location\n\t\t\t\t? `Hydration failed because the initial UI does not match what was rendered on the server. The error occurred near ${location}`\n\t\t\t\t: 'Hydration failed because the initial UI does not match what was rendered on the server'}\\nhttps://svelte.dev/e/hydration_mismatch`,\n\t\t\tbold,\n\t\t\tnormal\n\t\t);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydration_mismatch`);\n\t}\n}\n\n/\n The `render` function passed to `createRawSnippet` should return HTML for a single element\n /\nexport function invalid_raw_snippet_render() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] invalid_raw_snippet_render\\n%cThe \\`render\\` function passed to \\`createRawSnippet\\` should return HTML for a single element\\nhttps://svelte.dev/e/invalid_raw_snippet_render`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/invalid_raw_snippet_render`);\n\t}\n}\n\n/\n Detected a migrated `$:` reactive block in `%filename%` that both accesses and updates the same reactive value. This may cause recursive updates when converted to an `$effect`.\n * @param {string} filename\n /\nexport function legacy_recursive_reactive_block(filename) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] legacy_recursive_reactive_block\\n%cDetected a migrated \\`$:\\` reactive block in \\`${filename}\\` that both accesses and updates the same reactive value. This may cause recursive updates when converted to an \\`$effect\\`.\\nhttps://svelte.dev/e/legacy_recursive_reactive_block`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/legacy_recursive_reactive_block`);\n\t}\n}\n\n/\n Tried to unmount a component that was not mounted\n /\nexport function lifecycle_double_unmount() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] lifecycle_double_unmount\\n%cTried to unmount a component that was not mounted\\nhttps://svelte.dev/e/lifecycle_double_unmount`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/lifecycle_double_unmount`);\n\t}\n}\n\n/\n %parent% passed property `%prop%` to %child% with `bind:`, but its parent component %owner% did not declare `%prop%` as a binding. Consider creating a binding between %owner% and %parent% (e.g. `bind:%prop%={...}` instead of `%prop%={...}`)\n * @param {string} parent\n * @param {string} prop\n * @param {string} child\n * @param {string} owner\n /\nexport function ownership_invalid_binding(parent, prop, child, owner) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] ownership_invalid_binding\\n%c${parent} passed property \\`${prop}\\` to ${child} with \\`bind:\\`, but its parent component ${owner} did not declare \\`${prop}\\` as a binding. Consider creating a binding between ${owner} and ${parent} (e.g. \\`bind:${prop}={...}\\` instead of \\`${prop}={...}\\`)\\nhttps://svelte.dev/e/ownership_invalid_binding`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/ownership_invalid_binding`);\n\t}\n}\n\n/\n Mutating unbound props (`%name%`, at %location%) is strongly discouraged. Consider using `bind:%prop%={...}` in %parent% (or using a callback) instead\n * @param {string} name\n * @param {string} location\n * @param {string} prop\n * @param {string} parent\n /\nexport function ownership_invalid_mutation(name, location, prop, parent) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] ownership_invalid_mutation\\n%cMutating unbound props (\\`${name}\\`, at ${location}) is strongly discouraged. Consider using \\`bind:${prop}={...}\\` in ${parent} (or using a callback) instead\\nhttps://svelte.dev/e/ownership_invalid_mutation`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/ownership_invalid_mutation`);\n\t}\n}\n\n/\n The `value` property of a `<select multiple>` element should be an array, but it received a non-array value. The selection will be kept as is.\n /\nexport function select_multiple_invalid_value() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] select_multiple_invalid_value\\n%cThe \\`value\\` property of a \\`<select multiple>\\` element should be an array, but it received a non-array value. The selection will be kept as is.\\nhttps://svelte.dev/e/select_multiple_invalid_value`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/select_multiple_invalid_value`);\n\t}\n}\n\n/\n Reactive `$state(...)` proxies and the values they proxy have different identities. Because of this, comparisons with `%operator%` will produce unexpected results\n * @param {string} operator\n /\nexport function state_proxy_equality_mismatch(operator) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] state_proxy_equality_mismatch\\n%cReactive \\`$state(...)\\` proxies and the values they proxy have different identities. Because of this, comparisons with \\`${operator}\\` will produce unexpected results\\nhttps://svelte.dev/e/state_proxy_equality_mismatch`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/state_proxy_equality_mismatch`);\n\t}\n}\n\n/\n Tried to unmount a state proxy, rather than a component\n /\nexport function state_proxy_unmount() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] state_proxy_unmount\\n%cTried to unmount a state proxy, rather than a component\\nhttps://svelte.dev/e/state_proxy_unmount`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/state_proxy_unmount`);\n\t}\n}\n\n/\n A `<svelte:boundary>` `reset` function only resets the boundary the first time it is called\n /\nexport function svelte_boundary_reset_noop() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] svelte_boundary_reset_noop\\n%cA \\`<svelte:boundary>\\` \\`reset\\` function only resets the boundary the first time it is called\\nhttps://svelte.dev/e/svelte_boundary_reset_noop`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/svelte_boundary_reset_noop`);\n\t}\n}\n\n/\n The `slide` transition does not work correctly for elements with `display: %value%`\n * @param {string} value\n /\nexport function transition_slide_display(value) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] transition_slide_display\\n%cThe \\`slide\\` transition does not work correctly for elements with \\`display: ${value}\\`\\nhttps://svelte.dev/e/transition_slide_display`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/transition_slide_display`);\n\t}\n}","/* @import { TemplateNode } from '#client' /\n\nimport { COMMENT_NODE } from '#client/constants';\nimport {\n\tHYDRATION_END,\n\tHYDRATION_ERROR,\n\tHYDRATION_START,\n\tHYDRATION_START_ELSE\n} from '../../../constants.js';\nimport as w from '../warnings.js';\nimport { get_next_sibling } from './operations.js';\n\n/*\n Use this variable to guard everything related to hydration code so it can be treeshaken out\n * if the user doesn't use the `hydrate` method and these code paths are therefore not needed.\n /\nexport let hydrating = false;\n\n/* @param {boolean} value /\nexport function set_hydrating(value) {\n\thydrating = value;\n}\n\n/\n The node that is currently being hydrated. This starts out as the first node inside the opening\n * <!--[--> comment, and updates each time a component calls `$.child(...)` or `$.sibling(...)`.\n * When entering a block (e.g. `{#if ...}`), `hydrate_node` is the block opening comment; by the\n * time we leave the block it is the closing comment, which serves as the block's anchor.\n * @type {TemplateNode}\n /\nexport let hydrate_node;\n\n/* @param {TemplateNode \| null} node /\nexport function set_hydrate_node(node) {\n\tif (node === null) {\n\t\tw.hydration_mismatch();\n\t\tthrow HYDRATION_ERROR;\n\t}\n\n\treturn (hydrate_node = node);\n}\n\nexport function hydrate_next() {\n\treturn set_hydrate_node(get_next_sibling(hydrate_node));\n}\n\n/* @param {TemplateNode} node /\nexport function reset(node) {\n\tif (!hydrating) return;\n\n\t// If the node has remaining siblings, something has gone wrong\n\tif (get_next_sibling(hydrate_node) !== null) {\n\t\tw.hydration_mismatch();\n\t\tthrow HYDRATION_ERROR;\n\t}\n\n\thydrate_node = node;\n}\n\n/\n @param {HTMLTemplateElement} template\n /\nexport function hydrate_template(template) {\n\tif (hydrating) {\n\t\t// @ts-expect-error TemplateNode doesn't include DocumentFragment, but it's actually fine\n\t\thydrate_node = template.content;\n\t}\n}\n\nexport function next(count = 1) {\n\tif (hydrating) {\n\t\tvar i = count;\n\t\tvar node = hydrate_node;\n\n\t\twhile (i--) {\n\t\t\tnode = /* @type {TemplateNode} / (get_next_sibling(node));\n\t\t}\n\n\t\thydrate_node = node;\n\t}\n}\n\n/\n Skips or removes (depending on {@link remove}) all nodes starting at `hydrate_node` up until the next hydration end comment\n * @param {boolean} remove\n /\nexport function skip_nodes(remove = true) {\n\tvar depth = 0;\n\tvar node = hydrate_node;\n\n\twhile (true) {\n\t\tif (node.nodeType === COMMENT_NODE) {\n\t\t\tvar data = /* @type {Comment} / (node).data;\n\n\t\t\tif (data === HYDRATION_END) {\n\t\t\t\tif (depth === 0) return node;\n\t\t\t\tdepth -= 1;\n\t\t\t} else if (\n\t\t\t\tdata === HYDRATION_START \|\|\n\t\t\t\tdata === HYDRATION_START_ELSE \|\|\n\t\t\t\t// \"[1\", \"[2\", etc. for if blocks\n\t\t\t\t(data[0] === '[' && !isNaN(Number(data.slice(1))))\n\t\t\t) {\n\t\t\t\tdepth += 1;\n\t\t\t}\n\t\t}\n\n\t\tvar next = /* @type {TemplateNode} / (get_next_sibling(node));\n\t\tif (remove) node.remove();\n\t\tnode = next;\n\t}\n}\n\n/\n \n * @param {TemplateNode} node\n /\nexport function read_hydration_instruction(node) {\n\tif (!node \|\| node.nodeType !== COMMENT_NODE) {\n\t\tw.hydration_mismatch();\n\t\tthrow HYDRATION_ERROR;\n\t}\n\n\treturn /* @type {Comment} / (node).data;\n}\n","/* @import { Equals } from '#client' /\n\n/* @type {Equals} /\nexport function equals(value) {\n\treturn value === this.v;\n}\n\n/\n @param {unknown} a\n * @param {unknown} b\n * @returns {boolean}\n /\nexport function safe_not_equal(a, b) {\n\treturn a != a\n\t\t? b == b\n\t\t: a !== b \|\| (a !== null && typeof a === 'object') \|\| typeof a === 'function';\n}\n\n/\n @param {unknown} a\n * @param {unknown} b\n * @returns {boolean}\n /\nexport function not_equal(a, b) {\n\treturn a !== b;\n}\n\n/* @type {Equals} /\nexport function safe_equals(value) {\n\treturn !safe_not_equal(value, this.v);\n}\n","/* True if experimental.async=true /\nexport let async_mode_flag = false;\n/* True if we're not certain that we only have Svelte 5 code in the compilation /\nexport let legacy_mode_flag = false;\n/* True if $inspect.trace is used /\nexport let tracing_mode_flag = false;\n\nexport function enable_async_mode_flag() {\n\tasync_mode_flag = true;\n}\n\n/* ONLY USE THIS DURING TESTING /\nexport function disable_async_mode_flag() {\n\tasync_mode_flag = false;\n}\n\nexport function enable_legacy_mode_flag() {\n\tlegacy_mode_flag = true;\n}\n\nexport function enable_tracing_mode_flag() {\n\ttracing_mode_flag = true;\n}\n","/* @import { ComponentContext, DevStackEntry, Effect } from '#client' /\nimport { DEV } from 'esm-env';\nimport as e from './errors.js';\nimport { active_effect, active_reaction } from './runtime.js';\nimport { create_user_effect } from './reactivity/effects.js';\nimport { async_mode_flag, legacy_mode_flag } from '../flags/index.js';\nimport { FILENAME } from '../../constants.js';\nimport { BRANCH_EFFECT } from './constants.js';\n\n/** @type {ComponentContext \| null} /\nexport let component_context = null;\n\n/* @param {ComponentContext \| null} context /\nexport function set_component_context(context) {\n\tcomponent_context = context;\n}\n\n/* @type {DevStackEntry \| null} /\nexport let dev_stack = null;\n\n/* @param {DevStackEntry \| null} stack /\nexport function set_dev_stack(stack) {\n\tdev_stack = stack;\n}\n\n/\n Execute a callback with a new dev stack entry\n * @param {() => any} callback - Function to execute\n * @param {DevStackEntry['type']} type - Type of block/component\n * @param {any} component - Component function\n * @param {number} line - Line number\n * @param {number} column - Column number\n * @param {Record<string, any>} [additional] - Any additional properties to add to the dev stack entry\n * @returns {any}\n /\nexport function add_svelte_meta(callback, type, component, line, column, additional) {\n\tconst parent = dev_stack;\n\n\tdev_stack = {\n\t\ttype,\n\t\tfile: component[FILENAME],\n\t\tline,\n\t\tcolumn,\n\t\tparent,\n\t\t...additional\n\t};\n\n\ttry {\n\t\treturn callback();\n\t} finally {\n\t\tdev_stack = parent;\n\t}\n}\n\n/\n The current component function. Different from current component context:\n * ```html\n * <!-- App.svelte -->\n * <Foo>\n * <Bar /> <!-- context == Foo.svelte, function == App.svelte -->\n * </Foo>\n * ```\n * @type {ComponentContext['function']}\n /\nexport let dev_current_component_function = null;\n\n/* @param {ComponentContext['function']} fn /\nexport function set_dev_current_component_function(fn) {\n\tdev_current_component_function = fn;\n}\n\n/\n Returns a `[get, set]` pair of functions for working with context in a type-safe way.\n \n `get` will throw an error if no parent component called `set`.\n \n @template T\n * @returns {[() => T, (context: T) => T]}\n * @since 5.40.0\n /\nexport function createContext() {\n\tconst key = {};\n\n\treturn [\n\t\t() => {\n\t\t\tif (!hasContext(key)) {\n\t\t\t\te.missing_context();\n\t\t\t}\n\n\t\t\treturn getContext(key);\n\t\t},\n\t\t(context) => setContext(key, context)\n\t];\n}\n\n/\n Retrieves the context that belongs to the closest parent component with the specified `key`.\n * Must be called during component initialisation.\n \n [`createContext`](https://svelte.dev/docs/svelte/svelte#createContext) is a type-safe alternative.\n \n @template T\n * @param {any} key\n * @returns {T}\n /\nexport function getContext(key) {\n\tconst context_map = get_or_init_context_map('getContext');\n\tconst result = /* @type {T} / (context_map.get(key));\n\treturn result;\n}\n\n/\n Associates an arbitrary `context` object with the current component and the specified `key`\n * and returns that object. The context is then available to children of the component\n * (including slotted content) with `getContext`.\n \n Like lifecycle functions, this must be called during component initialisation.\n \n [`createContext`](https://svelte.dev/docs/svelte/svelte#createContext) is a type-safe alternative.\n \n @template T\n * @param {any} key\n * @param {T} context\n * @returns {T}\n /\nexport function setContext(key, context) {\n\tconst context_map = get_or_init_context_map('setContext');\n\n\tif (async_mode_flag) {\n\t\tvar flags = /* @type {Effect} / (active_effect).f;\n\t\tvar valid =\n\t\t\t!active_reaction &&\n\t\t\t(flags & BRANCH_EFFECT) !== 0 &&\n\t\t\t// pop() runs synchronously, so this indicates we're setting context after an await\n\t\t\t!(/* @type {ComponentContext} / (component_context).i);\n\n\t\tif (!valid) {\n\t\t\te.set_context_after_init();\n\t\t}\n\t}\n\n\tcontext_map.set(key, context);\n\treturn context;\n}\n\n/\n Checks whether a given `key` has been set in the context of a parent component.\n * Must be called during component initialisation.\n \n @param {any} key\n * @returns {boolean}\n /\nexport function hasContext(key) {\n\tconst context_map = get_or_init_context_map('hasContext');\n\treturn context_map.has(key);\n}\n\n/\n Retrieves the whole context map that belongs to the closest parent component.\n * Must be called during component initialisation. Useful, for example, if you\n * programmatically create a component and want to pass the existing context to it.\n \n @template {Map<any, any>} [T=Map<any, any>]\n * @returns {T}\n /\nexport function getAllContexts() {\n\tconst context_map = get_or_init_context_map('getAllContexts');\n\treturn /* @type {T} / (context_map);\n}\n\n/\n @param {Record<string, unknown>} props\n * @param {any} runes\n * @param {Function} [fn]\n * @returns {void}\n /\nexport function push(props, runes = false, fn) {\n\tcomponent_context = {\n\t\tp: component_context,\n\t\ti: false,\n\t\tc: null,\n\t\te: null,\n\t\ts: props,\n\t\tx: null,\n\t\tr: /* @type {Effect} / (active_effect),\n\t\tl: legacy_mode_flag && !runes ? { s: null, u: null, $: [] } : null\n\t};\n\n\tif (DEV) {\n\t\t// component function\n\t\tcomponent_context.function = fn;\n\t\tdev_current_component_function = fn;\n\t}\n}\n\n/\n @template {Record<string, any>} T\n * @param {T} [component]\n * @returns {T}\n /\nexport function pop(component) {\n\tvar context = /* @type {ComponentContext} / (component_context);\n\tvar effects = context.e;\n\n\tif (effects !== null) {\n\t\tcontext.e = null;\n\n\t\tfor (var fn of effects) {\n\t\t\tcreate_user_effect(fn);\n\t\t}\n\t}\n\n\tif (component !== undefined) {\n\t\tcontext.x = component;\n\t}\n\n\tcontext.i = true;\n\n\tcomponent_context = context.p;\n\n\tif (DEV) {\n\t\tdev_current_component_function = component_context?.function ?? null;\n\t}\n\n\treturn component ?? /* @type {T} / ({});\n}\n\n/* @returns {boolean} /\nexport function is_runes() {\n\treturn !legacy_mode_flag \|\| (component_context !== null && component_context.l === null);\n}\n\n/\n @param {string} name\n * @returns {Map<unknown, unknown>}\n /\nfunction get_or_init_context_map(name) {\n\tif (component_context === null) {\n\t\te.lifecycle_outside_component(name);\n\t}\n\n\treturn (component_context.c ??= new Map(get_parent_context(component_context) \|\| undefined));\n}\n\n/\n @param {ComponentContext} component_context\n * @returns {Map<unknown, unknown> \| null}\n /\nfunction get_parent_context(component_context) {\n\tlet parent = component_context.p;\n\twhile (parent !== null) {\n\t\tconst context_map = parent.c;\n\t\tif (context_map !== null) {\n\t\t\treturn context_map;\n\t\t}\n\t\tparent = parent.p;\n\t}\n\treturn null;\n}\n","import { run_all } from '../../shared/utils.js';\nimport { is_flushing_sync } from '../reactivity/batch.js';\n\n/* @type {Array<() => void>} /\nlet micro_tasks = [];\n\nfunction run_micro_tasks() {\n\tvar tasks = micro_tasks;\n\tmicro_tasks = [];\n\trun_all(tasks);\n}\n\n/\n @param {() => void} fn\n /\nexport function queue_micro_task(fn) {\n\tif (micro_tasks.length === 0 && !is_flushing_sync) {\n\t\tvar tasks = micro_tasks;\n\t\tqueueMicrotask(() => {\n\t\t\t// If this is false, a flushSync happened in the meantime. Do _not_ run new scheduled microtasks in that case\n\t\t\t// as the ordering of microtasks would be broken at that point - consider this case:\n\t\t\t// - queue_micro_task schedules microtask A to flush task X\n\t\t\t// - synchronously after, flushSync runs, processing task X\n\t\t\t// - synchronously after, some other microtask B is scheduled, but not through queue_micro_task but for example a Promise.resolve() in user code\n\t\t\t// - synchronously after, queue_micro_task schedules microtask C to flush task Y\n\t\t\t// - one tick later, microtask A now resolves, flushing task Y before microtask B, which is incorrect\n\t\t\t// This if check prevents that race condition (that realistically will only happen in tests)\n\t\t\tif (tasks === micro_tasks) run_micro_tasks();\n\t\t});\n\t}\n\n\tmicro_tasks.push(fn);\n}\n\n/\n Synchronously run any queued tasks.\n /\nexport function flush_tasks() {\n\twhile (micro_tasks.length > 0) {\n\t\trun_micro_tasks();\n\t}\n}\n","/* @import { Derived, Effect } from '#client' /\n/* @import { Boundary } from './dom/blocks/boundary.js' /\nimport { DEV } from 'esm-env';\nimport { FILENAME } from '../../constants.js';\nimport { is_firefox } from './dom/operations.js';\nimport { ERROR_VALUE, BOUNDARY_EFFECT, REACTION_RAN, EFFECT } from './constants.js';\nimport { define_property, get_descriptor } from '../shared/utils.js';\nimport { active_effect, active_reaction } from './runtime.js';\n\nconst adjustments = new WeakMap();\n\n/\n @param {unknown} error\n /\nexport function handle_error(error) {\n\tvar effect = active_effect;\n\n\t// for unowned deriveds, don't throw until we read the value\n\tif (effect === null) {\n\t\t/* @type {Derived} / (active_reaction).f \|= ERROR_VALUE;\n\t\treturn error;\n\t}\n\n\tif (DEV && error instanceof Error && !adjustments.has(error)) {\n\t\tadjustments.set(error, get_adjustments(error, effect));\n\t}\n\n\t// if the error occurred while creating this subtree, we let it\n\t// bubble up until it hits a boundary that can handle it, unless\n\t// it's an $effect in which case it doesn't run immediately\n\tif ((effect.f & REACTION_RAN) === 0 && (effect.f & EFFECT) === 0) {\n\t\tif (DEV && !effect.parent && error instanceof Error) {\n\t\t\tapply_adjustments(error);\n\t\t}\n\n\t\tthrow error;\n\t}\n\n\t// otherwise we bubble up the effect tree ourselves\n\tinvoke_error_boundary(error, effect);\n}\n\n/\n @param {unknown} error\n * @param {Effect \| null} effect\n /\nexport function invoke_error_boundary(error, effect) {\n\twhile (effect !== null) {\n\t\tif ((effect.f & BOUNDARY_EFFECT) !== 0) {\n\t\t\tif ((effect.f & REACTION_RAN) === 0) {\n\t\t\t\t// we are still creating the boundary effect\n\t\t\t\tthrow error;\n\t\t\t}\n\n\t\t\ttry {\n\t\t\t\t/* @type {Boundary} / (effect.b).error(error);\n\t\t\t\treturn;\n\t\t\t} catch (e) {\n\t\t\t\terror = e;\n\t\t\t}\n\t\t}\n\n\t\teffect = effect.parent;\n\t}\n\n\tif (DEV && error instanceof Error) {\n\t\tapply_adjustments(error);\n\t}\n\n\tthrow error;\n}\n\n/\n Add useful information to the error message/stack in development\n * @param {Error} error\n * @param {Effect} effect\n /\nfunction get_adjustments(error, effect) {\n\tconst message_descriptor = get_descriptor(error, 'message');\n\n\t// if the message was already changed and it's not configurable we can't change it\n\t// or it will throw a different error swallowing the original error\n\tif (message_descriptor && !message_descriptor.configurable) return;\n\n\tvar indent = is_firefox ? ' ' : '\\t';\n\tvar component_stack = `\\n${indent}in ${effect.fn?.name \|\| '<unknown>'}`;\n\tvar context = effect.ctx;\n\n\twhile (context !== null) {\n\t\tcomponent_stack += `\\n${indent}in ${context.function?.[FILENAME].split('/').pop()}`;\n\t\tcontext = context.p;\n\t}\n\n\treturn {\n\t\tmessage: error.message + `\\n${component_stack}\\n`,\n\t\tstack: error.stack\n\t\t\t?.split('\\n')\n\t\t\t.filter((line) => !line.includes('svelte/src/internal'))\n\t\t\t.join('\\n')\n\t};\n}\n\n/\n @param {Error} error\n /\nfunction apply_adjustments(error) {\n\tconst adjusted = adjustments.get(error);\n\n\tif (adjusted) {\n\t\tdefine_property(error, 'message', {\n\t\t\tvalue: adjusted.message\n\t\t});\n\n\t\tdefine_property(error, 'stack', {\n\t\t\tvalue: adjusted.stack\n\t\t});\n\t}\n}\n","/* @import { Derived, Signal } from '#client' /\nimport { CLEAN, CONNECTED, DIRTY, MAYBE_DIRTY } from '#client/constants';\n\nconst STATUS_MASK = ~(DIRTY \| MAYBE_DIRTY \| CLEAN);\n\n/\n @param {Signal} signal\n * @param {number} status\n /\nexport function set_signal_status(signal, status) {\n\tsignal.f = (signal.f & STATUS_MASK) \| status;\n}\n\n/\n Set a derived's status to CLEAN or MAYBE_DIRTY based on its connection state.\n * @param {Derived} derived\n /\nexport function update_derived_status(derived) {\n\t// Only mark as MAYBE_DIRTY if disconnected and has dependencies.\n\tif ((derived.f & CONNECTED) !== 0 \|\| derived.deps === null) {\n\t\tset_signal_status(derived, CLEAN);\n\t} else {\n\t\tset_signal_status(derived, MAYBE_DIRTY);\n\t}\n}\n","/* @import { Derived, Effect, Value } from '#client' /\nimport { CLEAN, DERIVED, DIRTY, MAYBE_DIRTY, WAS_MARKED } from '#client/constants';\nimport { set_signal_status } from './status.js';\n\n/\n @param {Value[] \| null} deps\n /\nfunction clear_marked(deps) {\n\tif (deps === null) return;\n\n\tfor (const dep of deps) {\n\t\tif ((dep.f & DERIVED) === 0 \|\| (dep.f & WAS_MARKED) === 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tdep.f ^= WAS_MARKED;\n\n\t\tclear_marked(/* @type {Derived} / (dep).deps);\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {Set<Effect>} dirty_effects\n * @param {Set<Effect>} maybe_dirty_effects\n /\nexport function defer_effect(effect, dirty_effects, maybe_dirty_effects) {\n\tif ((effect.f & DIRTY) !== 0) {\n\t\tdirty_effects.add(effect);\n\t} else if ((effect.f & MAYBE_DIRTY) !== 0) {\n\t\tmaybe_dirty_effects.add(effect);\n\t}\n\n\t// Since we're not executing these effects now, we need to clear any WAS_MARKED flags\n\t// so that other batches can correctly reach these effects during their own traversal\n\tclear_marked(effect.deps);\n\n\t// mark as clean so they get scheduled if they depend on pending async state\n\tset_signal_status(effect, CLEAN);\n}\n","/* @import { Readable } from './public' /\nimport { untrack } from '../internal/client/runtime.js';\nimport { noop } from '../internal/shared/utils.js';\n\n/\n @template T\n * @param {Readable<T> \| null \| undefined} store\n * @param {(value: T) => void} run\n * @param {(value: T) => void} [invalidate]\n * @returns {() => void}\n /\nexport function subscribe_to_store(store, run, invalidate) {\n\tif (store == null) {\n\t\t// @ts-expect-error\n\t\trun(undefined);\n\n\t\t// @ts-expect-error\n\t\tif (invalidate) invalidate(undefined);\n\n\t\treturn noop;\n\t}\n\n\t// Svelte store takes a private second argument\n\t// StartStopNotifier could mutate state, and we want to silence the corresponding validation error\n\tconst unsub = untrack(() =>\n\t\tstore.subscribe(\n\t\t\trun,\n\t\t\t// @ts-expect-error\n\t\t\tinvalidate\n\t\t)\n\t);\n\n\t// Also support RxJS\n\t// @ts-expect-error TODO fix this in the types?\n\treturn unsub.unsubscribe ? () => unsub.unsubscribe() : unsub;\n}\n","/* @import { Readable, StartStopNotifier, Subscriber, Unsubscriber, Updater, Writable } from '../public.js' /\n/* @import { Stores, StoresValues, SubscribeInvalidateTuple } from '../private.js' /\nimport { noop, run_all } from '../../internal/shared/utils.js';\nimport { safe_not_equal } from '../../internal/client/reactivity/equality.js';\nimport { subscribe_to_store } from '../utils.js';\n\n/\n @type {Array<SubscribeInvalidateTuple<any> \| any>}\n /\nconst subscriber_queue = [];\n\n/\n Creates a `Readable` store that allows reading by subscription.\n \n @template T\n * @param {T} [value] initial value\n * @param {StartStopNotifier<T>} [start]\n * @returns {Readable<T>}\n /\nexport function readable(value, start) {\n\treturn {\n\t\tsubscribe: writable(value, start).subscribe\n\t};\n}\n\n/\n Create a `Writable` store that allows both updating and reading by subscription.\n \n @template T\n * @param {T} [value] initial value\n * @param {StartStopNotifier<T>} [start]\n * @returns {Writable<T>}\n /\nexport function writable(value, start = noop) {\n\t/* @type {Unsubscriber \| null} /\n\tlet stop = null;\n\n\t/* @type {Set<SubscribeInvalidateTuple<T>>} /\n\tconst subscribers = new Set();\n\n\t/\n\t @param {T} new_value\n\t * @returns {void}\n\t /\n\tfunction set(new_value) {\n\t\tif (safe_not_equal(value, new_value)) {\n\t\t\tvalue = new_value;\n\t\t\tif (stop) {\n\t\t\t\t// store is ready\n\t\t\t\tconst run_queue = !subscriber_queue.length;\n\t\t\t\tfor (const subscriber of subscribers) {\n\t\t\t\t\tsubscriber[1]();\n\t\t\t\t\tsubscriber_queue.push(subscriber, value);\n\t\t\t\t}\n\t\t\t\tif (run_queue) {\n\t\t\t\t\tfor (let i = 0; i < subscriber_queue.length; i += 2) {\n\t\t\t\t\t\tsubscriber_queue[i][0](subscriber_queue[i + 1]);\n\t\t\t\t\t}\n\t\t\t\t\tsubscriber_queue.length = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t @param {Updater<T>} fn\n\t * @returns {void}\n\t /\n\tfunction update(fn) {\n\t\tset(fn(/* @type {T} / (value)));\n\t}\n\n\t/\n\t @param {Subscriber<T>} run\n\t * @param {() => void} [invalidate]\n\t * @returns {Unsubscriber}\n\t /\n\tfunction subscribe(run, invalidate = noop) {\n\t\t/* @type {SubscribeInvalidateTuple<T>} /\n\t\tconst subscriber = [run, invalidate];\n\t\tsubscribers.add(subscriber);\n\t\tif (subscribers.size === 1) {\n\t\t\tstop = start(set, update) \|\| noop;\n\t\t}\n\t\trun(/* @type {T} / (value));\n\t\treturn () => {\n\t\t\tsubscribers.delete(subscriber);\n\t\t\tif (subscribers.size === 0 && stop) {\n\t\t\t\tstop();\n\t\t\t\tstop = null;\n\t\t\t}\n\t\t};\n\t}\n\treturn { set, update, subscribe };\n}\n\n/\n Derived value store by synchronizing one or more readable stores and\n * applying an aggregation function over its input values.\n \n @template {Stores} S\n * @template T\n * @overload\n * @param {S} stores\n * @param {(values: StoresValues<S>, set: (value: T) => void, update: (fn: Updater<T>) => void) => Unsubscriber \| void} fn\n * @param {T} [initial_value]\n * @returns {Readable<T>}\n /\n/\n Derived value store by synchronizing one or more readable stores and\n * applying an aggregation function over its input values.\n \n @template {Stores} S\n * @template T\n * @overload\n * @param {S} stores\n * @param {(values: StoresValues<S>) => T} fn\n * @param {T} [initial_value]\n * @returns {Readable<T>}\n /\n/\n @template {Stores} S\n * @template T\n * @param {S} stores\n * @param {Function} fn\n * @param {T} [initial_value]\n * @returns {Readable<T>}\n /\nexport function derived(stores, fn, initial_value) {\n\tconst single = !Array.isArray(stores);\n\t/* @type {Array<Readable<any>>} /\n\tconst stores_array = single ? [stores] : stores;\n\tif (!stores_array.every(Boolean)) {\n\t\tthrow new Error('derived() expects stores as input, got a falsy value');\n\t}\n\tconst auto = fn.length < 2;\n\treturn readable(initial_value, (set, update) => {\n\t\tlet started = false;\n\t\t/* @type {T[]} /\n\t\tconst values = [];\n\t\tlet pending = 0;\n\t\tlet cleanup = noop;\n\t\tconst sync = () => {\n\t\t\tif (pending) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tcleanup();\n\t\t\tconst result = fn(single ? values[0] : values, set, update);\n\t\t\tif (auto) {\n\t\t\t\tset(result);\n\t\t\t} else {\n\t\t\t\tcleanup = typeof result === 'function' ? result : noop;\n\t\t\t}\n\t\t};\n\t\tconst unsubscribers = stores_array.map((store, i) =>\n\t\t\tsubscribe_to_store(\n\t\t\t\tstore,\n\t\t\t\t(value) => {\n\t\t\t\t\tvalues[i] = value;\n\t\t\t\t\tpending &= ~(1 << i);\n\t\t\t\t\tif (started) {\n\t\t\t\t\t\tsync();\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t() => {\n\t\t\t\t\tpending \|= 1 << i;\n\t\t\t\t}\n\t\t\t)\n\t\t);\n\t\tstarted = true;\n\t\tsync();\n\t\treturn function stop() {\n\t\t\trun_all(unsubscribers);\n\t\t\tcleanup();\n\t\t\t// We need to set this to false because callbacks can still happen despite having unsubscribed:\n\t\t\t// Callbacks might already be placed in the queue which doesn't know it should no longer\n\t\t\t// invoke this derived store.\n\t\t\tstarted = false;\n\t\t};\n\t});\n}\n\n/\n Takes a store and returns a new one derived from the old one that is readable.\n \n @template T\n * @param {Readable<T>} store - store to make readonly\n * @returns {Readable<T>}\n /\nexport function readonly(store) {\n\treturn {\n\t\t// @ts-expect-error TODO i suspect the bind is unnecessary\n\t\tsubscribe: store.subscribe.bind(store)\n\t};\n}\n\n/\n Get the current value from a store by subscribing and immediately unsubscribing.\n \n @template T\n * @param {Readable<T>} store\n * @returns {T}\n /\nexport function get(store) {\n\tlet value;\n\tsubscribe_to_store(store, (_) => (value = _))();\n\t// @ts-expect-error\n\treturn value;\n}\n","/* @import { StoreReferencesContainer } from '#client' /\n/* @import { Store } from '#shared' /\nimport { subscribe_to_store } from '../../../store/utils.js';\nimport { get as get_store } from '../../../store/shared/index.js';\nimport { define_property, noop } from '../../shared/utils.js';\nimport { get } from '../runtime.js';\nimport { teardown } from './effects.js';\nimport { mutable_source, set } from './sources.js';\nimport { DEV } from 'esm-env';\n\n/\n We set this to `true` when updating a store so that we correctly\n * schedule effects if the update takes place inside a `$:` effect\n /\nexport let legacy_is_updating_store = false;\n\n/\n Whether or not the prop currently being read is a store binding, as in\n * `<Child bind:x={$y} />`. If it is, we treat the prop as mutable even in\n * runes mode, and skip `binding_property_non_reactive` validation\n /\nlet is_store_binding = false;\n\nlet IS_UNMOUNTED = Symbol('unmounted');\n\n/\n Gets the current value of a store. If the store isn't subscribed to yet, it will create a proxy\n * signal that will be updated when the store is. The store references container is needed to\n * track reassignments to stores and to track the correct component context.\n * @template V\n * @param {Store<V> \| null \| undefined} store\n * @param {string} store_name\n * @param {StoreReferencesContainer} stores\n * @returns {V}\n /\nexport function store_get(store, store_name, stores) {\n\tconst entry = (stores[store_name] ??= {\n\t\tstore: null,\n\t\tsource: mutable_source(undefined),\n\t\tunsubscribe: noop\n\t});\n\n\tif (DEV) {\n\t\tentry.source.label = store_name;\n\t}\n\n\t// if the component that setup this is already unmounted we don't want to register a subscription\n\tif (entry.store !== store && !(IS_UNMOUNTED in stores)) {\n\t\tentry.unsubscribe();\n\t\tentry.store = store ?? null;\n\n\t\tif (store == null) {\n\t\t\tentry.source.v = undefined; // see synchronous callback comment below\n\t\t\tentry.unsubscribe = noop;\n\t\t} else {\n\t\t\tvar is_synchronous_callback = true;\n\n\t\t\tentry.unsubscribe = subscribe_to_store(store, (v) => {\n\t\t\t\tif (is_synchronous_callback) {\n\t\t\t\t\t// If the first updates to the store value (possibly multiple of them) are synchronously\n\t\t\t\t\t// inside a derived, we will hit the `state_unsafe_mutation` error if we `set` the value\n\t\t\t\t\tentry.source.v = v;\n\t\t\t\t} else {\n\t\t\t\t\tset(entry.source, v);\n\t\t\t\t}\n\t\t\t});\n\n\t\t\tis_synchronous_callback = false;\n\t\t}\n\t}\n\n\t// if the component that setup this stores is already unmounted the source will be out of sync\n\t// so we just use the `get` for the stores, less performant but it avoids to create a memory leak\n\t// and it will keep the value consistent\n\tif (store && IS_UNMOUNTED in stores) {\n\t\treturn get_store(store);\n\t}\n\n\treturn get(entry.source);\n}\n\n/\n Unsubscribe from a store if it's not the same as the one in the store references container.\n * We need this in addition to `store_get` because someone could unsubscribe from a store but\n * then never subscribe to the new one (if any), causing the subscription to stay open wrongfully.\n * @param {Store<any> \| null \| undefined} store\n * @param {string} store_name\n * @param {StoreReferencesContainer} stores\n /\nexport function store_unsub(store, store_name, stores) {\n\t/* @type {StoreReferencesContainer[''] \| undefined} /\n\tlet entry = stores[store_name];\n\n\tif (entry && entry.store !== store) {\n\t\t// Don't reset store yet, so that store_get above can resubscribe to new store if necessary\n\t\tentry.unsubscribe();\n\t\tentry.unsubscribe = noop;\n\t}\n\n\treturn store;\n}\n\n/\n Sets the new value of a store and returns that value.\n * @template V\n * @param {Store<V>} store\n * @param {V} value\n * @returns {V}\n /\nexport function store_set(store, value) {\n\tupdate_with_flag(store, value);\n\treturn value;\n}\n\n/\n @param {StoreReferencesContainer} stores\n * @param {string} store_name\n /\nexport function invalidate_store(stores, store_name) {\n\tvar entry = stores[store_name];\n\tif (entry.store !== null) {\n\t\tstore_set(entry.store, entry.source.v);\n\t}\n}\n\n/\n Unsubscribes from all auto-subscribed stores on destroy\n * @returns {[StoreReferencesContainer, ()=>void]}\n /\nexport function setup_stores() {\n\t/* @type {StoreReferencesContainer} /\n\tconst stores = {};\n\n\tfunction cleanup() {\n\t\tteardown(() => {\n\t\t\tfor (var store_name in stores) {\n\t\t\t\tconst ref = stores[store_name];\n\t\t\t\tref.unsubscribe();\n\t\t\t}\n\t\t\tdefine_property(stores, IS_UNMOUNTED, {\n\t\t\t\tenumerable: false,\n\t\t\t\tvalue: true\n\t\t\t});\n\t\t});\n\t}\n\n\treturn [stores, cleanup];\n}\n\n/\n @param {Store<V>} store\n * @param {V} value\n * @template V\n /\nfunction update_with_flag(store, value) {\n\tlegacy_is_updating_store = true;\n\n\ttry {\n\t\tstore.set(value);\n\t} finally {\n\t\tlegacy_is_updating_store = false;\n\t}\n}\n\n/\n Updates a store with a new value.\n * @param {Store<V>} store the store to update\n * @param {any} expression the expression that mutates the store\n * @param {V} new_value the new store value\n * @template V\n /\nexport function store_mutate(store, expression, new_value) {\n\tupdate_with_flag(store, new_value);\n\treturn expression;\n}\n\n/\n @param {Store<number>} store\n * @param {number} store_value\n * @param {1 \| -1} [d]\n * @returns {number}\n /\nexport function update_store(store, store_value, d = 1) {\n\tupdate_with_flag(store, store_value + d);\n\treturn store_value;\n}\n\n/\n @param {Store<number>} store\n * @param {number} store_value\n * @param {1 \| -1} [d]\n * @returns {number}\n /\nexport function update_pre_store(store, store_value, d = 1) {\n\tconst value = store_value + d;\n\tupdate_with_flag(store, value);\n\treturn value;\n}\n\n/\n Called inside prop getters to communicate that the prop is a store binding\n /\nexport function mark_store_binding() {\n\tis_store_binding = true;\n}\n\n/\n Returns a tuple that indicates whether `fn()` reads a prop that is a store binding.\n * Used to prevent `binding_property_non_reactive` validation false positives and\n * ensure that these props are treated as mutable even in runes mode\n * @template T\n * @param {() => T} fn\n * @returns {[T, boolean]}\n /\nexport function capture_store_binding(fn) {\n\tvar previous_is_store_binding = is_store_binding;\n\n\ttry {\n\t\tis_store_binding = false;\n\t\treturn [fn(), is_store_binding];\n\t} finally {\n\t\tis_store_binding = previous_is_store_binding;\n\t}\n}\n","/* @import { Fork } from 'svelte' /\n/* @import { Derived, Effect, Reaction, Source, Value } from '#client' /\nimport {\n\tBLOCK_EFFECT,\n\tBRANCH_EFFECT,\n\tCLEAN,\n\tDESTROYED,\n\tDIRTY,\n\tEFFECT,\n\tASYNC,\n\tINERT,\n\tRENDER_EFFECT,\n\tROOT_EFFECT,\n\tMAYBE_DIRTY,\n\tDERIVED,\n\tEAGER_EFFECT,\n\tERROR_VALUE,\n\tMANAGED_EFFECT,\n\tREACTION_RAN,\n\tDESTROYING\n} from '#client/constants';\nimport { async_mode_flag } from '../../flags/index.js';\nimport { deferred, define_property, includes } from '../../shared/utils.js';\nimport {\n\tactive_effect,\n\tactive_reaction,\n\tget,\n\tincrement_write_version,\n\tis_dirty,\n\tupdate_effect\n} from '../runtime.js';\nimport as e from '../errors.js';\nimport { flush_tasks, queue_micro_task } from '../dom/task.js';\nimport { DEV } from 'esm-env';\nimport { invoke_error_boundary } from '../error-handling.js';\nimport { flush_eager_effects, old_values, set_eager_effects, source, update } from './sources.js';\nimport { eager_effect, teardown, unlink_effect } from './effects.js';\nimport { defer_effect } from './utils.js';\nimport { UNINITIALIZED } from '../../../constants.js';\nimport { set_signal_status } from './status.js';\nimport { legacy_is_updating_store } from './store.js';\nimport { invariant } from '../../shared/dev.js';\nimport { log_effect_tree } from '../dev/debug.js';\n\n/** @type {Batch \| null} /\nlet first_batch = null;\n\n/* @type {Batch \| null} /\nlet last_batch = null;\n\n/* @type {Batch \| null} /\nexport let current_batch = null;\n\n/\n This is needed to avoid overwriting inputs\n * @type {Batch \| null}\n /\nexport let previous_batch = null;\n\n/\n When time travelling (i.e. working in one batch, while other batches\n * still have ongoing work), we ignore the real values of affected\n * signals in favour of their values within the batch\n * @type {Map<Value, any> \| null}\n /\nexport let batch_values = null;\n\n/* @type {Effect \| null} /\nlet last_scheduled_effect = null;\n\nexport let is_flushing_sync = false;\nlet is_processing = false;\n\n/\n During traversal, this is an array. Newly created effects are (if not immediately\n * executed) pushed to this array, rather than going through the scheduling\n * rigamarole that would cause another turn of the flush loop.\n * @type {Effect[] \| null}\n /\nexport let collected_effects = null;\n\n/\n An array of effects that are marked during traversal as a result of a `set`\n * (not `internal_set`) call. These will be added to the next batch and\n * trigger another `batch.process()`\n * @type {Effect[] \| null}\n * @deprecated when we get rid of legacy mode and stores, we can get rid of this\n /\nexport let legacy_updates = null;\n\nvar flush_count = 0;\n\n/* @type {Set<Value>} /\nvar source_stacks = new Set();\n\nlet uid = 1;\n\nexport class Batch {\n\tid = uid++;\n\n\t/* True as soon as `#process` was called /\n\t#started = false;\n\n\tlinked = true;\n\n\t/* @type {Batch \| null} /\n\t#prev = null;\n\n\t/* @type {Batch \| null} /\n\t#next = null;\n\n\t/* @type {Map<Effect, ReturnType<typeof deferred<any>>>} /\n\tasync_deriveds = new Map();\n\n\t/\n\t The current values of any signals that are updated in this batch.\n\t * Tuple format: [value, is_derived] (note: is_derived is false for deriveds, too, if they were overridden via assignment)\n\t * They keys of this map are identical to `this.#previous`\n\t * @type {Map<Value, [any, boolean]>}\n\t /\n\tcurrent = new Map();\n\n\t/\n\t The values of any signals (sources and deriveds) that are updated in this batch _before_ those updates took place.\n\t * They keys of this map are identical to `this.#current`\n\t * @type {Map<Value, any>}\n\t /\n\tprevious = new Map();\n\n\t/\n\t Async effects which this batch doesn't take into account anymore when calculating blockers,\n\t * as it has a value for it already.\n\t * @type {Set<Effect>}\n\t /\n\tunblocked = new Set();\n\n\t/\n\t When the batch is committed (and the DOM is updated), we need to remove old branches\n\t * and append new ones by calling the functions added inside (if/each/key/etc) blocks\n\t * @type {Set<(batch: Batch) => void>}\n\t /\n\t#commit_callbacks = new Set();\n\n\t/\n\t If a fork is discarded, we need to destroy any effects that are no longer needed\n\t * @type {Set<(batch: Batch) => void>}\n\t /\n\t#discard_callbacks = new Set();\n\n\t/\n\t Callbacks that should run only when a fork is committed.\n\t * @type {Set<(batch: Batch) => void>}\n\t /\n\t#fork_commit_callbacks = new Set();\n\n\t/\n\t The number of async effects that are currently in flight\n\t /\n\t#pending = 0;\n\n\t/\n\t Async effects that are currently in flight, _not_ inside a pending boundary\n\t * @type {Map<Effect, number>}\n\t /\n\t#blocking_pending = new Map();\n\n\t/\n\t A deferred that resolves when the batch is committed, used with `settled()`\n\t * TODO replace with Promise.withResolvers once supported widely enough\n\t * @type {{ promise: Promise<void>, resolve: (value?: any) => void, reject: (reason: unknown) => void } \| null}\n\t /\n\t#deferred = null;\n\n\t/\n\t The root effects that need to be flushed\n\t * @type {Effect[]}\n\t /\n\t#roots = [];\n\n\t/\n\t Effects created while this batch was active.\n\t * @type {Effect[]}\n\t /\n\t#new_effects = [];\n\n\t/\n\t Deferred effects (which run after async work has completed) that are DIRTY\n\t * @type {Set<Effect>}\n\t /\n\t#dirty_effects = new Set();\n\n\t/\n\t Deferred effects that are MAYBE_DIRTY\n\t * @type {Set<Effect>}\n\t /\n\t#maybe_dirty_effects = new Set();\n\n\t/\n\t A map of branches that still exist, but will be destroyed when this batch\n\t * is committed — we skip over these during `process`.\n\t * The value contains child effects that were dirty/maybe_dirty before being reset,\n\t * so they can be rescheduled if the branch survives.\n\t * @type {Map<Effect, { d: Effect[], m: Effect[] }>}\n\t /\n\t#skipped_branches = new Map();\n\n\t/\n\t Inverse of #skipped_branches which we need to tell prior batches to unskip them when committing\n\t * @type {Set<Effect>}\n\t /\n\t#unskipped_branches = new Set();\n\n\tis_fork = false;\n\n\t#decrement_queued = false;\n\n\t#is_deferred() {\n\t\tif (this.is_fork) return true;\n\n\t\tfor (const effect of this.#blocking_pending.keys()) {\n\t\t\tvar e = effect;\n\t\t\tvar skipped = false;\n\n\t\t\twhile (e.parent !== null) {\n\t\t\t\tif (this.#skipped_branches.has(e)) {\n\t\t\t\t\tskipped = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\te = e.parent;\n\t\t\t}\n\n\t\t\tif (!skipped) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/\n\t Add an effect to the #skipped_branches map and reset its children\n\t * @param {Effect} effect\n\t /\n\tskip_effect(effect) {\n\t\tif (!this.#skipped_branches.has(effect)) {\n\t\t\tthis.#skipped_branches.set(effect, { d: [], m: [] });\n\t\t}\n\t\tthis.#unskipped_branches.delete(effect);\n\t}\n\n\t/\n\t Remove an effect from the #skipped_branches map and reschedule\n\t * any tracked dirty/maybe_dirty child effects\n\t * @param {Effect} effect\n\t * @param {(e: Effect) => void} callback\n\t /\n\tunskip_effect(effect, callback = (e) => this.schedule(e)) {\n\t\tvar tracked = this.#skipped_branches.get(effect);\n\t\tif (tracked) {\n\t\t\tthis.#skipped_branches.delete(effect);\n\n\t\t\tfor (var e of tracked.d) {\n\t\t\t\tset_signal_status(e, DIRTY);\n\t\t\t\tcallback(e);\n\t\t\t}\n\n\t\t\tfor (e of tracked.m) {\n\t\t\t\tset_signal_status(e, MAYBE_DIRTY);\n\t\t\t\tcallback(e);\n\t\t\t}\n\t\t}\n\t\tthis.#unskipped_branches.add(effect);\n\t}\n\n\t#process() {\n\t\tthis.#started = true;\n\n\t\tif (flush_count++ > 1000) {\n\t\t\tthis.#unlink();\n\t\t\tinfinite_loop_guard();\n\t\t}\n\n\t\tif (DEV) {\n\t\t\t// track all the values that were updated during this flush,\n\t\t\t// so that they can be reset afterwards\n\t\t\tfor (const value of this.current.keys()) {\n\t\t\t\tsource_stacks.add(value);\n\t\t\t}\n\t\t}\n\n\t\t// we only reschedule previously-deferred effects if we expect\n\t\t// to be able to run them after processing the batch\n\t\tif (!this.#is_deferred()) {\n\t\t\tfor (const e of this.#dirty_effects) {\n\t\t\t\tthis.#maybe_dirty_effects.delete(e);\n\t\t\t\tset_signal_status(e, DIRTY);\n\t\t\t\tthis.schedule(e);\n\t\t\t}\n\n\t\t\tfor (const e of this.#maybe_dirty_effects) {\n\t\t\t\tset_signal_status(e, MAYBE_DIRTY);\n\t\t\t\tthis.schedule(e);\n\t\t\t}\n\t\t}\n\n\t\tconst roots = this.#roots;\n\t\tthis.#roots = [];\n\n\t\tthis.apply();\n\n\t\t/* @type {Effect[]} /\n\t\tvar effects = (collected_effects = []);\n\n\t\t/* @type {Effect[]} /\n\t\tvar render_effects = [];\n\n\t\t/\n\t\t @type {Effect[]}\n\t\t * @deprecated when we get rid of legacy mode and stores, we can get rid of this\n\t\t /\n\t\tvar updates = (legacy_updates = []);\n\n\t\tfor (const root of roots) {\n\t\t\ttry {\n\t\t\t\tthis.#traverse(root, effects, render_effects);\n\t\t\t} catch (e) {\n\t\t\t\treset_all(root);\n\t\t\t\tthrow e;\n\t\t\t}\n\t\t}\n\n\t\t// any writes should take effect in a subsequent batch\n\t\tcurrent_batch = null;\n\n\t\tif (updates.length > 0) {\n\t\t\tvar batch = Batch.ensure();\n\t\t\tfor (const e of updates) {\n\t\t\t\tbatch.schedule(e);\n\t\t\t}\n\t\t}\n\n\t\tcollected_effects = null;\n\t\tlegacy_updates = null;\n\n\t\t// if the batch has outstanding pending work, stash effects and bail\n\t\tif (this.#is_deferred()) {\n\t\t\tthis.#defer_effects(render_effects);\n\t\t\tthis.#defer_effects(effects);\n\n\t\t\tfor (const [e, t] of this.#skipped_branches) {\n\t\t\t\treset_branch(e, t);\n\t\t\t}\n\n\t\t\tif (updates.length > 0) {\n\t\t\t\t/* @type {Batch} / (/* @type {unknown} / (current_batch)).#process();\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\tconst earlier_batch = this.#find_earlier_batch();\n\n\t\tif (earlier_batch) {\n\t\t\tearlier_batch.#merge(this);\n\t\t\treturn;\n\t\t}\n\n\t\t// clear effects. Those that are still needed will be rescheduled through unskipping the skipped branches.\n\t\tthis.#dirty_effects.clear();\n\t\tthis.#maybe_dirty_effects.clear();\n\n\t\t// append/remove branches\n\t\tfor (const fn of this.#commit_callbacks) fn(this);\n\t\tthis.#commit_callbacks.clear();\n\n\t\tprevious_batch = this;\n\t\tflush_queued_effects(render_effects);\n\t\tflush_queued_effects(effects);\n\t\tprevious_batch = null;\n\n\t\tthis.#deferred?.resolve();\n\n\t\tvar next_batch = /* @type {Batch \| null} / (/* @type {unknown} / (current_batch));\n\n\t\tif (this.linked && this.#pending === 0) {\n\t\t\tthis.#unlink();\n\t\t}\n\n\t\t// Order matters here - we need to commit and THEN continue flushing new batches, not the other way around,\n\t\t// else we could start flushing a new batch and then, if it has pending work, rebase it right afterwards, which is wrong.\n\t\t// In sync mode flushSync can cause #commit to wrongfully think that there needs to be a rebase, so we only do it in async mode\n\t\t// TODO fix the underlying cause, otherwise this will likely regress when non-async mode is removed\n\t\tif (async_mode_flag && !this.linked) {\n\t\t\tthis.#commit();\n\t\t\t// Rebases can activate other batches or null it out, therefore restore the new one here\n\t\t\tcurrent_batch = next_batch;\n\t\t}\n\n\t\t// Edge case: During traversal new branches might create effects that run immediately and set state,\n\t\t// causing an effect and therefore a root to be scheduled again. We need to traverse the current batch\n\t\t// once more in that case - most of the time this will just clean up dirty branches.\n\t\tif (this.#roots.length > 0) {\n\t\t\tif (next_batch === null) {\n\t\t\t\tnext_batch = this;\n\t\t\t\tthis.#link();\n\t\t\t}\n\n\t\t\tconst batch = next_batch;\n\t\t\tbatch.#roots.push(...this.#roots.filter((r) => !batch.#roots.includes(r)));\n\t\t}\n\n\t\tif (next_batch !== null) {\n\t\t\tnext_batch.#process();\n\t\t}\n\t}\n\n\t/\n\t Traverse the effect tree, executing effects or stashing\n\t * them for later execution as appropriate\n\t * @param {Effect} root\n\t * @param {Effect[]} effects\n\t * @param {Effect[]} render_effects\n\t /\n\t#traverse(root, effects, render_effects) {\n\t\troot.f ^= CLEAN;\n\n\t\tvar effect = root.first;\n\n\t\twhile (effect !== null) {\n\t\t\tvar flags = effect.f;\n\t\t\tvar is_branch = (flags & (BRANCH_EFFECT \| ROOT_EFFECT)) !== 0;\n\t\t\tvar is_skippable_branch = is_branch && (flags & CLEAN) !== 0;\n\n\t\t\tvar skip = is_skippable_branch \|\| (flags & INERT) !== 0 \|\| this.#skipped_branches.has(effect);\n\n\t\t\tif (!skip && effect.fn !== null) {\n\t\t\t\tif (is_branch) {\n\t\t\t\t\teffect.f ^= CLEAN;\n\t\t\t\t} else if ((flags & EFFECT) !== 0) {\n\t\t\t\t\teffects.push(effect);\n\t\t\t\t} else if (async_mode_flag && (flags & (RENDER_EFFECT \| MANAGED_EFFECT)) !== 0) {\n\t\t\t\t\trender_effects.push(effect);\n\t\t\t\t} else if (is_dirty(effect)) {\n\t\t\t\t\tif ((flags & BLOCK_EFFECT) !== 0) this.#maybe_dirty_effects.add(effect);\n\t\t\t\t\tupdate_effect(effect);\n\t\t\t\t}\n\n\t\t\t\tvar child = effect.first;\n\n\t\t\t\tif (child !== null) {\n\t\t\t\t\teffect = child;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\twhile (effect !== null) {\n\t\t\t\tvar next = effect.next;\n\n\t\t\t\tif (next !== null) {\n\t\t\t\t\teffect = next;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\teffect = effect.parent;\n\t\t\t}\n\t\t}\n\t}\n\n\t#find_earlier_batch() {\n\t\tvar batch = this.#prev;\n\n\t\twhile (batch !== null) {\n\t\t\tif (!batch.is_fork) {\n\t\t\t\t// if the batches are connected, break\n\t\t\t\tfor (const [value, [, is_derived]] of this.current) {\n\t\t\t\t\tif (batch.current.has(value) && !is_derived) {\n\t\t\t\t\t\treturn batch;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbatch = batch.#prev;\n\t\t}\n\n\t\treturn null;\n\t}\n\n\t/\n\t @param {Batch} batch\n\t /\n\t#merge(batch) {\n\t\tfor (const [source, value] of batch.current) {\n\t\t\tif (!this.previous.has(source) && batch.previous.has(source)) {\n\t\t\t\tthis.previous.set(source, batch.previous.get(source));\n\t\t\t}\n\n\t\t\tthis.current.set(source, value);\n\t\t}\n\n\t\tfor (const [effect, deferred] of batch.async_deriveds) {\n\t\t\tconst d = this.async_deriveds.get(effect);\n\t\t\tif (d) deferred.promise.then(d.resolve);\n\t\t}\n\n\t\t/\n\t\t mark all effects that depend on `batch.current`, except the\n\t\t * async effects that we just resolved (TODO unless they depend\n\t\t * on values in this batch that are NOT in the later batch?).\n\t\t * Through this we also will populate the correct #skipped_branches,\n\t\t * oncommit callbacks etc, so we don't need to merge them separately.\n\t\t * @param {Value} value\n\t\t /\n\t\tconst mark = (value) => {\n\t\t\tvar reactions = value.reactions;\n\t\t\tif (reactions === null) return;\n\n\t\t\tfor (const reaction of reactions) {\n\t\t\t\tvar flags = reaction.f;\n\n\t\t\t\tif ((flags & DERIVED) !== 0) {\n\t\t\t\t\tmark(/* @type {Derived} / (reaction));\n\t\t\t\t} else {\n\t\t\t\t\tvar effect = /* @type {Effect} / (reaction);\n\n\t\t\t\t\tif (flags & (ASYNC \| BLOCK_EFFECT) && !this.async_deriveds.has(effect)) {\n\t\t\t\t\t\tthis.#maybe_dirty_effects.delete(effect);\n\t\t\t\t\t\tset_signal_status(effect, DIRTY);\n\t\t\t\t\t\tthis.schedule(effect);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\t\tfor (const source of this.current.keys()) {\n\t\t\tmark(source);\n\t\t}\n\n\t\tthis.oncommit(() => batch.discard());\n\t\tbatch.#unlink();\n\n\t\tcurrent_batch = this;\n\t\tthis.#process();\n\t}\n\n\t/\n\t @param {Effect[]} effects\n\t /\n\t#defer_effects(effects) {\n\t\tfor (var i = 0; i < effects.length; i += 1) {\n\t\t\tdefer_effect(effects[i], this.#dirty_effects, this.#maybe_dirty_effects);\n\t\t}\n\t}\n\n\t/\n\t Associate a change to a given source with the current\n\t * batch, noting its previous and current values\n\t * @param {Value} source\n\t * @param {any} value\n\t * @param {boolean} [is_derived]\n\t /\n\tcapture(source, value, is_derived = false) {\n\t\tif (source.v !== UNINITIALIZED && !this.previous.has(source)) {\n\t\t\tthis.previous.set(source, source.v);\n\t\t}\n\n\t\t// Don't save errors in `batch_values`, or they won't be thrown in `runtime.js#get`\n\t\tif ((source.f & ERROR_VALUE) === 0) {\n\t\t\tthis.current.set(source, [value, is_derived]);\n\t\t\tbatch_values?.set(source, value);\n\t\t}\n\n\t\tif (!this.is_fork) {\n\t\t\tsource.v = value;\n\t\t}\n\t}\n\n\tactivate() {\n\t\tcurrent_batch = this;\n\t}\n\n\tdeactivate() {\n\t\tcurrent_batch = null;\n\t\tbatch_values = null;\n\t}\n\n\tflush() {\n\t\ttry {\n\t\t\tif (DEV) {\n\t\t\t\tsource_stacks.clear();\n\t\t\t}\n\n\t\t\tis_processing = true;\n\t\t\tcurrent_batch = this;\n\n\t\t\tthis.#process();\n\t\t} finally {\n\t\t\tflush_count = 0;\n\t\t\tlast_scheduled_effect = null;\n\t\t\tcollected_effects = null;\n\t\t\tlegacy_updates = null;\n\t\t\tis_processing = false;\n\n\t\t\tcurrent_batch = null;\n\t\t\tbatch_values = null;\n\n\t\t\told_values.clear();\n\n\t\t\tif (DEV) {\n\t\t\t\tfor (const source of source_stacks) {\n\t\t\t\t\tsource.updated = null;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdiscard() {\n\t\tfor (const fn of this.#discard_callbacks) fn(this);\n\t\tthis.#discard_callbacks.clear();\n\t\tthis.#fork_commit_callbacks.clear();\n\n\t\tthis.#unlink();\n\t}\n\n\t/\n\t @param {Effect} effect\n\t /\n\tregister_created_effect(effect) {\n\t\tthis.#new_effects.push(effect);\n\t}\n\n\t#commit() {\n\t\tthis.#unlink();\n\n\t\t// If there are other pending batches, they now need to be 'rebased' —\n\t\t// in other words, we re-run block/async effects with the newly\n\t\t// committed state, unless the batch in question has a more\n\t\t// recent value for a given source\n\t\tfor (let batch = first_batch; batch !== null; batch = batch.#next) {\n\t\t\tvar is_earlier = batch.id < this.id;\n\n\t\t\t/* @type {Source[]} /\n\t\t\tvar sources = [];\n\n\t\t\tfor (const [source, [value, is_derived]] of this.current) {\n\t\t\t\tif (batch.current.has(source)) {\n\t\t\t\t\tvar batch_value = /* @type {[any, boolean]} / (batch.current.get(source))[0]; // faster than destructuring\n\n\t\t\t\t\tif (is_earlier && value !== batch_value) {\n\t\t\t\t\t\t// bring the value up to date\n\t\t\t\t\t\tbatch.current.set(source, [value, is_derived]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// same value or later batch has more recent value,\n\t\t\t\t\t\t// no need to re-run these effects\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tsources.push(source);\n\t\t\t}\n\n\t\t\tif (is_earlier) {\n\t\t\t\t// TODO do we need to restart these in some cases, instead of\n\t\t\t\t// immediately resolving them? Likely not because of how this.apply() works.\n\t\t\t\tfor (const [effect, deferred] of this.async_deriveds) {\n\t\t\t\t\tconst d = batch.async_deriveds.get(effect);\n\t\t\t\t\tif (d) deferred.promise.then(d.resolve);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!batch.#started) continue;\n\n\t\t\t// Re-run async/block effects that depend on distinct values changed in both batches\n\t\t\tvar others = [...batch.current.keys()].filter((s) => !this.current.has(s));\n\n\t\t\tif (others.length === 0) {\n\t\t\t\tif (is_earlier) {\n\t\t\t\t\t// this batch is now obsolete and can be discarded\n\t\t\t\t\tbatch.discard();\n\t\t\t\t}\n\t\t\t} else if (sources.length > 0) {\n\t\t\t\t// The microtask queue can contain the batch already scheduled to run right\n\t\t\t\t// after this one is finished, so throwing the invariant would be wrong here.\n\t\t\t\tif (DEV && !batch.#decrement_queued) {\n\t\t\t\t\tinvariant(batch.#roots.length === 0, 'Batch has scheduled roots');\n\t\t\t\t}\n\n\t\t\t\t// A batch was unskipped in a later batch -> tell prior batches to unskip it, too\n\t\t\t\tif (is_earlier) {\n\t\t\t\t\tfor (const unskipped of this.#unskipped_branches) {\n\t\t\t\t\t\tbatch.unskip_effect(unskipped, (e) => {\n\t\t\t\t\t\t\tif ((e.f & (BLOCK_EFFECT \| ASYNC)) !== 0) {\n\t\t\t\t\t\t\t\tbatch.schedule(e);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbatch.#defer_effects([e]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbatch.activate();\n\n\t\t\t\t/* @type {Set<Value>} /\n\t\t\t\tvar marked = new Set();\n\n\t\t\t\t/* @type {Map<Reaction, boolean>} /\n\t\t\t\tvar checked = new Map();\n\n\t\t\t\tfor (var source of sources) {\n\t\t\t\t\tmark_effects(source, others, marked, checked);\n\t\t\t\t}\n\n\t\t\t\tchecked = new Map();\n\t\t\t\tvar current_unequal = [...batch.current.keys()].filter((c) =>\n\t\t\t\t\tthis.current.has(c)\n\t\t\t\t\t\t? /* @type {[any, boolean]} / (this.current.get(c))[0] !== c.v\n\t\t\t\t\t\t: true\n\t\t\t\t);\n\n\t\t\t\tif (current_unequal.length > 0) {\n\t\t\t\t\tfor (const effect of this.#new_effects) {\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t(effect.f & (DESTROYED \| INERT \| EAGER_EFFECT)) === 0 &&\n\t\t\t\t\t\t\tdepends_on(effect, current_unequal, checked)\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tif ((effect.f & (ASYNC \| BLOCK_EFFECT)) !== 0) {\n\t\t\t\t\t\t\t\tset_signal_status(effect, DIRTY);\n\t\t\t\t\t\t\t\tbatch.schedule(effect);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbatch.#dirty_effects.add(effect);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Only apply and traverse when we know we triggered async work with marking the effects\n\t\t\t\t// and know this won't run anyway right afterwards\n\t\t\t\tif (batch.#roots.length > 0 && !batch.#decrement_queued) {\n\t\t\t\t\tbatch.apply();\n\n\t\t\t\t\tfor (var root of batch.#roots) {\n\t\t\t\t\t\tbatch.#traverse(root, [], []);\n\t\t\t\t\t}\n\n\t\t\t\t\tbatch.#roots = [];\n\t\t\t\t}\n\n\t\t\t\tbatch.deactivate();\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t @param {boolean} blocking\n\t * @param {Effect} effect\n\t /\n\tincrement(blocking, effect) {\n\t\tthis.#pending += 1;\n\n\t\tif (blocking) {\n\t\t\tlet blocking_pending_count = this.#blocking_pending.get(effect) ?? 0;\n\t\t\tthis.#blocking_pending.set(effect, blocking_pending_count + 1);\n\t\t}\n\t}\n\n\t/\n\t @param {boolean} blocking\n\t * @param {Effect} effect\n\t /\n\tdecrement(blocking, effect) {\n\t\tthis.#pending -= 1;\n\n\t\tif (blocking) {\n\t\t\tlet blocking_pending_count = this.#blocking_pending.get(effect) ?? 0;\n\n\t\t\tif (blocking_pending_count === 1) {\n\t\t\t\tthis.#blocking_pending.delete(effect);\n\t\t\t} else {\n\t\t\t\tthis.#blocking_pending.set(effect, blocking_pending_count - 1);\n\t\t\t}\n\t\t}\n\n\t\tif (this.#decrement_queued) return;\n\t\tthis.#decrement_queued = true;\n\n\t\tqueue_micro_task(() => {\n\t\t\tthis.#decrement_queued = false;\n\n\t\t\tif (this.linked) {\n\t\t\t\tthis.flush();\n\t\t\t}\n\t\t});\n\t}\n\n\t/\n\t @param {Set<Effect>} dirty_effects\n\t * @param {Set<Effect>} maybe_dirty_effects\n\t /\n\ttransfer_effects(dirty_effects, maybe_dirty_effects) {\n\t\tfor (const e of dirty_effects) {\n\t\t\tthis.#dirty_effects.add(e);\n\t\t}\n\n\t\tfor (const e of maybe_dirty_effects) {\n\t\t\tthis.#maybe_dirty_effects.add(e);\n\t\t}\n\n\t\tdirty_effects.clear();\n\t\tmaybe_dirty_effects.clear();\n\t}\n\n\t/* @param {(batch: Batch) => void} fn /\n\toncommit(fn) {\n\t\tthis.#commit_callbacks.add(fn);\n\t}\n\n\t/* @param {(batch: Batch) => void} fn /\n\tondiscard(fn) {\n\t\tthis.#discard_callbacks.add(fn);\n\t}\n\n\t/* @param {(batch: Batch) => void} fn /\n\ton_fork_commit(fn) {\n\t\tthis.#fork_commit_callbacks.add(fn);\n\t}\n\n\trun_fork_commit_callbacks() {\n\t\tfor (const fn of this.#fork_commit_callbacks) fn(this);\n\t\tthis.#fork_commit_callbacks.clear();\n\t}\n\n\tsettled() {\n\t\treturn (this.#deferred ??= deferred()).promise;\n\t}\n\n\tstatic ensure() {\n\t\tif (current_batch === null) {\n\t\t\tconst batch = (current_batch = new Batch());\n\t\t\tbatch.#link();\n\n\t\t\tif (!is_processing && !is_flushing_sync) {\n\t\t\t\tqueue_micro_task(() => {\n\t\t\t\t\tif (!batch.#started) {\n\t\t\t\t\t\tbatch.flush();\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\treturn current_batch;\n\t}\n\n\tapply() {\n\t\tif (!async_mode_flag \|\| (!this.is_fork && this.#prev === null && this.#next === null)) {\n\t\t\tbatch_values = null;\n\t\t\treturn;\n\t\t}\n\n\t\t// if there are multiple batches, we are 'time travelling' —\n\t\t// we need to override values with the ones in this batch...\n\t\tbatch_values = new Map();\n\t\tfor (const [source, [value]] of this.current) {\n\t\t\tbatch_values.set(source, value);\n\t\t}\n\n\t\t// ...and undo changes belonging to other batches unless they intersect\n\t\tfor (let batch = first_batch; batch !== null; batch = batch.#next) {\n\t\t\tif (batch === this \|\| batch.is_fork) continue;\n\n\t\t\t// If two batches intersect, the latter batch will be merged into the earlier batch,\n\t\t\t// and we should treat them as a single set of changes\n\t\t\tvar intersects = false;\n\n\t\t\tif (batch.id < this.id) {\n\t\t\t\tfor (const [source, [, is_derived]] of batch.current) {\n\t\t\t\t\t// Derived values don't partake in the intersection mechanism, because a derived could\n\t\t\t\t\t// be triggered in one batch already but not the other one yet, causing a false-positive\n\t\t\t\t\tif (is_derived) continue;\n\n\t\t\t\t\tif (this.current.has(source)) {\n\t\t\t\t\t\tintersects = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Since the latter batch merges into the earlier (if it resolves before the earlier one),\n\t\t\t// we treat the earlier values as \"already applied\". This way we don't need to rerun async\n\t\t\t// effects of the earlier batch in case they are merged.\n\t\t\t// As a result you can think of batch_values as having the latest values of all intersecting\n\t\t\t// batches up until this batch.\n\t\t\tif (!intersects) {\n\t\t\t\tfor (const [source, previous] of batch.previous) {\n\t\t\t\t\tif (!batch_values.has(source)) {\n\t\t\t\t\t\tbatch_values.set(source, previous);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t \n\t * @param {Effect} effect\n\t /\n\tschedule(effect) {\n\t\tlast_scheduled_effect = effect;\n\n\t\t// defer render effects inside a pending boundary\n\t\t// TODO the `REACTION_RAN` check is only necessary because of legacy `$:` effects AFAICT — we can remove later\n\t\tif (\n\t\t\teffect.b?.is_pending &&\n\t\t\t(effect.f & (EFFECT \| RENDER_EFFECT \| MANAGED_EFFECT)) !== 0 &&\n\t\t\t(effect.f & REACTION_RAN) === 0\n\t\t) {\n\t\t\teffect.b.defer_effect(effect);\n\t\t\treturn;\n\t\t}\n\n\t\tvar e = effect;\n\n\t\twhile (e.parent !== null) {\n\t\t\te = e.parent;\n\t\t\tvar flags = e.f;\n\n\t\t\t// if the effect is being scheduled because a parent (each/await/etc) block\n\t\t\t// updated an internal source, or because a branch is being unskipped,\n\t\t\t// bail out or we'll cause a second flush\n\t\t\tif (collected_effects !== null && e === active_effect) {\n\t\t\t\tif (async_mode_flag) return;\n\n\t\t\t\t// in sync mode, render effects run during traversal. in an extreme edge case\n\t\t\t\t// — namely that we're setting a value inside a derived read during traversal —\n\t\t\t\t// they can be made dirty after they have already been visited, in which\n\t\t\t\t// case we shouldn't bail out. we also shouldn't bail out if we're\n\t\t\t\t// updating a store inside a `$:`, since this might invalidate\n\t\t\t\t// effects that were already visited\n\t\t\t\tif (\n\t\t\t\t\t(active_reaction === null \|\| (active_reaction.f & DERIVED) === 0) &&\n\t\t\t\t\t!legacy_is_updating_store\n\t\t\t\t) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ((flags & (ROOT_EFFECT \| BRANCH_EFFECT)) !== 0) {\n\t\t\t\tif ((flags & CLEAN) === 0) {\n\t\t\t\t\t// branch is already dirty, bail\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\te.f ^= CLEAN;\n\t\t\t}\n\t\t}\n\n\t\tthis.#roots.push(e);\n\t}\n\n\t#link() {\n\t\tif (last_batch === null) {\n\t\t\tfirst_batch = last_batch = this;\n\t\t} else {\n\t\t\tlast_batch.#next = this;\n\t\t\tthis.#prev = last_batch;\n\t\t}\n\n\t\tlast_batch = this;\n\t}\n\n\t#unlink() {\n\t\tvar prev = this.#prev;\n\t\tvar next = this.#next;\n\n\t\tif (prev === null) {\n\t\t\tfirst_batch = next;\n\t\t} else {\n\t\t\tprev.#next = next;\n\t\t}\n\n\t\tif (next === null) {\n\t\t\tlast_batch = prev;\n\t\t} else {\n\t\t\tnext.#prev = prev;\n\t\t}\n\n\t\tthis.linked = false;\n\t}\n}\n\n// TODO Svelte@6 think about removing the callback argument.\n/\n Synchronously flush any pending updates.\n * Returns void if no callback is provided, otherwise returns the result of calling the callback.\n * @template [T=void]\n * @param {(() => T) \| undefined} [fn]\n * @returns {T}\n /\nexport function flushSync(fn) {\n\tvar was_flushing_sync = is_flushing_sync;\n\tis_flushing_sync = true;\n\n\ttry {\n\t\tvar result;\n\n\t\tif (fn) {\n\t\t\tif (current_batch !== null && !current_batch.is_fork) {\n\t\t\t\tcurrent_batch.flush();\n\t\t\t}\n\n\t\t\tresult = fn();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tflush_tasks();\n\n\t\t\tif (current_batch === null) {\n\t\t\t\treturn /* @type {T} / (result);\n\t\t\t}\n\n\t\t\tcurrent_batch.flush();\n\t\t}\n\t} finally {\n\t\tis_flushing_sync = was_flushing_sync;\n\t}\n}\n\nfunction infinite_loop_guard() {\n\tif (DEV) {\n\t\tvar updates = new Map();\n\n\t\tfor (const source of /* @type {Batch} / (current_batch).current.keys()) {\n\t\t\tfor (const [stack, update] of source.updated ?? []) {\n\t\t\t\tvar entry = updates.get(stack);\n\n\t\t\t\tif (!entry) {\n\t\t\t\t\tentry = { error: update.error, count: 0 };\n\t\t\t\t\tupdates.set(stack, entry);\n\t\t\t\t}\n\n\t\t\t\tentry.count += update.count;\n\t\t\t}\n\t\t}\n\n\t\tfor (const update of updates.values()) {\n\t\t\tif (update.error) {\n\t\t\t\t// eslint-disable-next-line no-console\n\t\t\t\tconsole.error(update.error);\n\t\t\t}\n\t\t}\n\t}\n\n\ttry {\n\t\te.effect_update_depth_exceeded();\n\t} catch (error) {\n\t\tif (DEV) {\n\t\t\t// stack contains no useful information, replace it\n\t\t\tdefine_property(error, 'stack', { value: '' });\n\t\t}\n\n\t\t// Best effort: invoke the boundary nearest the most recent\n\t\t// effect and hope that it's relevant to the infinite loop\n\t\tinvoke_error_boundary(error, last_scheduled_effect);\n\t}\n}\n\n/* @type {Set<Effect> \| null} /\nexport let eager_block_effects = null;\n\n/\n @param {Array<Effect>} effects\n * @returns {void}\n /\nfunction flush_queued_effects(effects) {\n\tvar length = effects.length;\n\tif (length === 0) return;\n\n\tvar i = 0;\n\n\twhile (i < length) {\n\t\tvar effect = effects[i++];\n\n\t\tif ((effect.f & (DESTROYED \| INERT)) === 0 && is_dirty(effect)) {\n\t\t\teager_block_effects = new Set();\n\n\t\t\tupdate_effect(effect);\n\n\t\t\t// Effects with no dependencies or teardown do not get added to the effect tree.\n\t\t\t// Deferred effects (e.g. `$effect(...)`) _are_ added to the tree because we\n\t\t\t// don't know if we need to keep them until they are executed. Doing the check\n\t\t\t// here (rather than in `update_effect`) allows us to skip the work for\n\t\t\t// immediate effects.\n\t\t\tif (\n\t\t\t\teffect.deps === null &&\n\t\t\t\teffect.first === null &&\n\t\t\t\teffect.nodes === null &&\n\t\t\t\teffect.teardown === null &&\n\t\t\t\teffect.ac === null\n\t\t\t) {\n\t\t\t\t// remove this effect from the graph\n\t\t\t\tunlink_effect(effect);\n\t\t\t}\n\n\t\t\t// If update_effect() has a flushSync() in it, we may have flushed another flush_queued_effects(),\n\t\t\t// which already handled this logic and did set eager_block_effects to null.\n\t\t\tif (eager_block_effects?.size > 0) {\n\t\t\t\told_values.clear();\n\n\t\t\t\tfor (const e of eager_block_effects) {\n\t\t\t\t\t// Skip eager effects that have already been unmounted\n\t\t\t\t\tif ((e.f & (DESTROYED \| INERT)) !== 0) continue;\n\n\t\t\t\t\t// Run effects in order from ancestor to descendant, else we could run into nullpointers\n\t\t\t\t\t/* @type {Effect[]} /\n\t\t\t\t\tconst ordered_effects = [e];\n\t\t\t\t\tlet ancestor = e.parent;\n\t\t\t\t\twhile (ancestor !== null) {\n\t\t\t\t\t\tif (eager_block_effects.has(ancestor)) {\n\t\t\t\t\t\t\teager_block_effects.delete(ancestor);\n\t\t\t\t\t\t\tordered_effects.push(ancestor);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tancestor = ancestor.parent;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor (let j = ordered_effects.length - 1; j >= 0; j--) {\n\t\t\t\t\t\tconst e = ordered_effects[j];\n\t\t\t\t\t\t// Skip eager effects that have already been unmounted\n\t\t\t\t\t\tif ((e.f & (DESTROYED \| INERT)) !== 0) continue;\n\t\t\t\t\t\tupdate_effect(e);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\teager_block_effects.clear();\n\t\t\t}\n\t\t}\n\t}\n\n\teager_block_effects = null;\n}\n\n/\n This is similar to `mark_reactions`, but it only marks async/block effects\n * depending on `value` and at least one of the other `sources`, so that\n * these effects can re-run after another batch has been committed\n * @param {Value} value\n * @param {Source[]} sources\n * @param {Set<Value>} marked\n * @param {Map<Reaction, boolean>} checked\n /\nfunction mark_effects(value, sources, marked, checked) {\n\tif (marked.has(value)) return;\n\tmarked.add(value);\n\n\tif (value.reactions !== null) {\n\t\tfor (const reaction of value.reactions) {\n\t\t\tconst flags = reaction.f;\n\n\t\t\tif ((flags & DERIVED) !== 0) {\n\t\t\t\tmark_effects(/* @type {Derived} / (reaction), sources, marked, checked);\n\t\t\t} else if (\n\t\t\t\t(flags & (ASYNC \| BLOCK_EFFECT)) !== 0 &&\n\t\t\t\t(flags & DIRTY) === 0 &&\n\t\t\t\tdepends_on(reaction, sources, checked)\n\t\t\t) {\n\t\t\t\tset_signal_status(reaction, DIRTY);\n\t\t\t\tschedule_effect(/* @type {Effect} / (reaction));\n\t\t\t}\n\t\t}\n\t}\n}\n\n/\n When committing a fork, we need to trigger eager effects so that\n * any `$state.eager(...)` expressions update immediately. This\n * function allows us to discover them\n * @param {Value} value\n * @param {Set<Effect>} effects\n /\nfunction mark_eager_effects(value, effects) {\n\tif (value.reactions === null) return;\n\n\tfor (const reaction of value.reactions) {\n\t\tconst flags = reaction.f;\n\n\t\tif ((flags & DERIVED) !== 0) {\n\t\t\tmark_eager_effects(/* @type {Derived} / (reaction), effects);\n\t\t} else if ((flags & EAGER_EFFECT) !== 0) {\n\t\t\tset_signal_status(reaction, DIRTY);\n\t\t\teffects.add(/* @type {Effect} / (reaction));\n\t\t}\n\t}\n}\n\n/\n @param {Reaction} reaction\n * @param {Source[]} sources\n * @param {Map<Reaction, boolean>} checked\n /\nfunction depends_on(reaction, sources, checked) {\n\tconst depends = checked.get(reaction);\n\tif (depends !== undefined) return depends;\n\n\tif (reaction.deps !== null) {\n\t\tfor (const dep of reaction.deps) {\n\t\t\tif (includes.call(sources, dep)) {\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tif ((dep.f & DERIVED) !== 0 && depends_on(/* @type {Derived} / (dep), sources, checked)) {\n\t\t\t\tchecked.set(/* @type {Derived} / (dep), true);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\tchecked.set(reaction, false);\n\n\treturn false;\n}\n\n/\n @param {Effect} effect\n * @returns {void}\n /\nexport function schedule_effect(effect) {\n\t/* @type {Batch} / (current_batch).schedule(effect);\n}\n\n/* @type {Source<number>[]} /\nlet eager_versions = [];\n\nfunction eager_flush() {\n\tflushSync(() => {\n\t\tconst eager = eager_versions;\n\t\teager_versions = [];\n\t\tfor (const version of eager) {\n\t\t\tupdate(version);\n\t\t}\n\t});\n}\n\n/* @type {Map<Reaction, Source<number>>} /\nvar version_map = new Map();\n\n/\n Implementation of `$state.eager(fn())`\n * @template T\n * @param {() => T} fn\n * @returns {T}\n /\nexport function eager(fn) {\n\tvar initial = true;\n\tvar value = /* @type {T} / (undefined);\n\n\tif (active_reaction === null) {\n\t\treturn fn();\n\t}\n\n\tlet parent = active_reaction;\n\n\tlet version = version_map.get(parent) ?? source(0);\n\tversion_map.set(parent, version);\n\n\tteardown(() => {\n\t\tif (parent.f & DESTROYING) version_map.delete(parent);\n\t});\n\n\tget(version);\n\n\teager_effect(() => {\n\t\tif (initial) {\n\t\t\t// the first time this runs, we create an eager effect\n\t\t\t// that will run eagerly whenever the expression changes\n\t\t\tvar previous_batch_values = batch_values;\n\n\t\t\ttry {\n\t\t\t\tbatch_values = null;\n\t\t\t\tvalue = fn();\n\t\t\t} finally {\n\t\t\t\tbatch_values = previous_batch_values;\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\t// the second time this effect runs, it's to schedule a\n\t\t// `version` update. since this will recreate the effect,\n\t\t// we don't need to evaluate the expression here\n\t\tif (eager_versions.length === 0) {\n\t\t\tqueue_micro_task(eager_flush);\n\t\t}\n\n\t\teager_versions.push(version);\n\t});\n\n\tinitial = false;\n\n\treturn value;\n}\n\n/\n Mark all the effects inside a skipped branch CLEAN, so that\n * they can be correctly rescheduled later. Tracks dirty and maybe_dirty\n * effects so they can be rescheduled if the branch survives.\n * @param {Effect} effect\n * @param {{ d: Effect[], m: Effect[] }} tracked\n /\nfunction reset_branch(effect, tracked) {\n\t// clean branch = nothing dirty inside, no need to traverse further\n\tif ((effect.f & BRANCH_EFFECT) !== 0 && (effect.f & CLEAN) !== 0) {\n\t\treturn;\n\t}\n\n\tif ((effect.f & DIRTY) !== 0) {\n\t\ttracked.d.push(effect);\n\t} else if ((effect.f & MAYBE_DIRTY) !== 0) {\n\t\ttracked.m.push(effect);\n\t}\n\n\tset_signal_status(effect, CLEAN);\n\n\tvar e = effect.first;\n\twhile (e !== null) {\n\t\treset_branch(e, tracked);\n\t\te = e.next;\n\t}\n}\n\n/\n Mark an entire effect tree clean following an error\n * @param {Effect} effect\n /\nfunction reset_all(effect) {\n\tset_signal_status(effect, CLEAN);\n\n\tvar e = effect.first;\n\twhile (e !== null) {\n\t\treset_all(e);\n\t\te = e.next;\n\t}\n}\n\n/\n Creates a 'fork', in which state changes are evaluated but not applied to the DOM.\n * This is useful for speculatively loading data (for example) when you suspect that\n * the user is about to take some action.\n \n Frameworks like SvelteKit can use this to preload data when the user touches or\n * hovers over a link, making any subsequent navigation feel instantaneous.\n \n The `fn` parameter is a synchronous function that modifies some state. The\n * state changes will be reverted after the fork is initialised, then reapplied\n * if and when the fork is eventually committed.\n \n When it becomes clear that a fork will _not_ be committed (e.g. because the\n * user navigated elsewhere), it must be discarded to avoid leaking memory.\n \n @param {() => void} fn\n * @returns {Fork}\n * @since 5.42\n /\nexport function fork(fn) {\n\tif (!async_mode_flag) {\n\t\te.experimental_async_required('fork');\n\t}\n\n\tif (current_batch !== null) {\n\t\te.fork_timing();\n\t}\n\n\tvar batch = Batch.ensure();\n\tbatch.is_fork = true;\n\tbatch_values = new Map();\n\n\tvar committed = false;\n\tvar settled = batch.settled();\n\n\tflushSync(fn);\n\n\treturn {\n\t\tcommit: async () => {\n\t\t\tif (committed) {\n\t\t\t\tawait settled;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (!batch.linked) {\n\t\t\t\te.fork_discarded();\n\t\t\t}\n\n\t\t\tcommitted = true;\n\n\t\t\tbatch.is_fork = false;\n\n\t\t\t// apply changes and update write versions so deriveds see the change\n\t\t\tfor (var [source, [value]] of batch.current) {\n\t\t\t\tsource.v = value;\n\t\t\t\tsource.wv = increment_write_version();\n\t\t\t}\n\n\t\t\tbatch.activate();\n\t\t\tbatch.run_fork_commit_callbacks();\n\t\t\tbatch.deactivate();\n\n\t\t\t// trigger any `$state.eager(...)` expressions with the new state.\n\t\t\t// eager effects don't get scheduled like other effects, so we\n\t\t\t// can't just encounter them during traversal, we need to\n\t\t\t// proactively flush them\n\t\t\t// TODO maybe there's a better implementation?\n\t\t\tflushSync(() => {\n\t\t\t\t/* @type {Set<Effect>} /\n\t\t\t\tvar eager_effects = new Set();\n\n\t\t\t\tfor (var source of batch.current.keys()) {\n\t\t\t\t\tmark_eager_effects(source, eager_effects);\n\t\t\t\t}\n\n\t\t\t\tset_eager_effects(eager_effects);\n\t\t\t\tflush_eager_effects();\n\t\t\t});\n\n\t\t\tbatch.flush();\n\t\t\tawait settled;\n\t\t},\n\t\tdiscard: () => {\n\t\t\t// cause any MAYBE_DIRTY deriveds to update\n\t\t\t// if they depend on things thath changed\n\t\t\t// inside the discarded fork\n\t\t\tfor (var source of batch.current.keys()) {\n\t\t\t\tsource.wv = increment_write_version();\n\t\t\t}\n\n\t\t\tif (!committed && batch.linked) {\n\t\t\t\tbatch.discard();\n\t\t\t}\n\t\t}\n\t};\n}\n\n/\n Forcibly remove all current batches, to prevent cross-talk between tests\n /\nexport function clear() {\n\tfirst_batch = last_batch = null;\n}\n","/* @import { Blocker, Effect, Value } from '#client' /\nimport { DESTROYED, STALE_REACTION } from '#client/constants';\nimport { DEV } from 'esm-env';\nimport {\n\tcomponent_context,\n\tdev_stack,\n\tis_runes,\n\tset_component_context,\n\tset_dev_stack\n} from '../context.js';\nimport { Boundary } from '../dom/blocks/boundary.js';\nimport { invoke_error_boundary } from '../error-handling.js';\nimport {\n\tactive_effect,\n\tactive_reaction,\n\tset_active_effect,\n\tset_active_reaction\n} from '../runtime.js';\nimport { Batch, current_batch } from './batch.js';\nimport {\n\tasync_derived,\n\treactivity_loss_tracker,\n\tderived,\n\tderived_safe_equal,\n\tset_reactivity_loss_tracker\n} from './deriveds.js';\nimport { aborted } from './effects.js';\n\n/\n @param {Blocker[]} blockers\n * @param {Array<() => any>} sync\n * @param {Array<() => Promise<any>>} async\n * @param {(values: Value[]) => any} fn\n /\nexport function flatten(blockers, sync, async, fn) {\n\tconst d = is_runes() ? derived : derived_safe_equal;\n\n\t// Filter out already-settled blockers - no need to wait for them\n\tvar pending = blockers.filter((b) => !b.settled);\n\n\tif (async.length === 0 && pending.length === 0) {\n\t\tfn(sync.map(d));\n\t\treturn;\n\t}\n\n\tvar parent = /* @type {Effect} / (active_effect);\n\n\tvar restore = capture();\n\tvar blocker_promise =\n\t\tpending.length === 1\n\t\t\t? pending[0].promise\n\t\t\t: pending.length > 1\n\t\t\t\t? Promise.all(pending.map((b) => b.promise))\n\t\t\t\t: null;\n\n\t/* @param {Value[]} values /\n\tfunction finish(values) {\n\t\tif ((parent.f & DESTROYED) !== 0) {\n\t\t\treturn;\n\t\t}\n\n\t\trestore();\n\n\t\ttry {\n\t\t\tfn(values);\n\t\t} catch (error) {\n\t\t\tinvoke_error_boundary(error, parent);\n\t\t}\n\n\t\tunset_context();\n\t}\n\n\tvar decrement_pending = increment_pending();\n\n\t// Fast path: blockers but no async expressions\n\tif (async.length === 0) {\n\t\t/* @type {Promise<any>} / (blocker_promise)\n\t\t\t.then(() => finish(sync.map(d)))\n\t\t\t.finally(decrement_pending);\n\n\t\treturn;\n\t}\n\n\t// Full path: has async expressions\n\tfunction run() {\n\t\tPromise.all(async.map((expression) => async_derived(expression)))\n\t\t\t.then((result) => finish([...sync.map(d), ...result]))\n\t\t\t.catch((error) => invoke_error_boundary(error, parent))\n\t\t\t.finally(decrement_pending);\n\t}\n\n\tif (blocker_promise) {\n\t\tblocker_promise.then(() => {\n\t\t\trestore();\n\t\t\trun();\n\t\t\tunset_context();\n\t\t});\n\t} else {\n\t\trun();\n\t}\n}\n\n/\n @param {Blocker[]} blockers\n * @param {(values: Value[]) => any} fn\n /\nexport function run_after_blockers(blockers, fn) {\n\tflatten(blockers, [], [], fn);\n}\n\n/\n Captures the current effect context so that we can restore it after\n * some asynchronous work has happened (so that e.g. `await a + b`\n * causes `b` to be registered as a dependency).\n /\nexport function capture() {\n\tvar previous_effect = /* @type {Effect} / (active_effect);\n\tvar previous_reaction = active_reaction;\n\tvar previous_component_context = component_context;\n\tvar previous_batch = /* @type {Batch} / (current_batch);\n\n\tif (DEV) {\n\t\tvar previous_dev_stack = dev_stack;\n\t}\n\n\treturn function restore(activate_batch = true) {\n\t\tset_active_effect(previous_effect);\n\t\tset_active_reaction(previous_reaction);\n\t\tset_component_context(previous_component_context);\n\n\t\tif (activate_batch && (previous_effect.f & DESTROYED) === 0) {\n\t\t\t// TODO we only need optional chaining here because `{#await ...}` blocks\n\t\t\t// are anomalous. Once we retire them we can get rid of it\n\t\t\tprevious_batch?.activate();\n\t\t\tprevious_batch?.apply();\n\t\t}\n\n\t\tif (DEV) {\n\t\t\tset_reactivity_loss_tracker(null);\n\t\t\tset_dev_stack(previous_dev_stack);\n\t\t}\n\t};\n}\n\n/\n Wraps an `await` expression in such a way that the effect context that was\n * active before the expression evaluated can be reapplied afterwards —\n * `await a + b` becomes `(await $.save(a))() + b`\n * @template T\n * @param {Promise<T>} promise\n * @returns {Promise<() => T>}\n /\nexport async function save(promise) {\n\tvar restore = capture();\n\tvar value = await promise;\n\n\treturn () => {\n\t\trestore();\n\t\treturn value;\n\t};\n}\n\n/\n Reset `current_async_effect` after the `promise` resolves, so\n * that we can emit `await_reactivity_loss` warnings\n * @template T\n * @param {Promise<T>} promise\n * @returns {Promise<() => T>}\n /\nexport async function track_reactivity_loss(promise) {\n\tvar previous_async_effect = reactivity_loss_tracker;\n\t// Ensure that unrelated reads after an async operation is kicked off don't cause false positives\n\tqueueMicrotask(() => {\n\t\tif (reactivity_loss_tracker === previous_async_effect) {\n\t\t\tset_reactivity_loss_tracker(null);\n\t\t}\n\t});\n\n\tvar value = await promise;\n\n\treturn () => {\n\t\tset_reactivity_loss_tracker(previous_async_effect);\n\t\t// While this can result in false negatives it also guards against the more important\n\t\t// false positives that would occur if this is the last in a chain of async operations,\n\t\t// and the reactivity_loss_tracker would then stay around until the next async operation happens.\n\t\tqueueMicrotask(() => {\n\t\t\tif (reactivity_loss_tracker === previous_async_effect) {\n\t\t\t\tset_reactivity_loss_tracker(null);\n\t\t\t}\n\t\t});\n\n\t\treturn value;\n\t};\n}\n\n/\n Used in `for await` loops in DEV, so\n * that we can emit `await_reactivity_loss` warnings\n * after each `async_iterator` result resolves and\n * after the `async_iterator` return resolves (if it runs)\n * @template T\n * @template TReturn\n * @param {Iterable<T> \| AsyncIterable<T>} iterable\n * @returns {AsyncGenerator<T, TReturn \| undefined>}\n /\nexport async function for_await_track_reactivity_loss(iterable) {\n\t// This is based on the algorithms described in ECMA-262:\n\t// ForIn/OfBodyEvaluation\n\t// https://tc39.es/ecma262/multipage/ecmascript-language-statements-and-declarations.html#sec-runtime-semantics-forin-div-ofbodyevaluation-lhs-stmt-iterator-lhskind-labelset\n\t// AsyncIteratorClose\n\t// https://tc39.es/ecma262/multipage/abstract-operations.html#sec-asynciteratorclose\n\n\t/** @type {AsyncIterator<T, TReturn>} /\n\t// @ts-ignore\n\tconst iterator = iterable[Symbol.asyncIterator]?.() ?? iterable[Symbol.iterator]?.();\n\n\tif (iterator === undefined) {\n\t\tthrow new TypeError('value is not async iterable');\n\t}\n\n\t// eslint-disable-next-line no-useless-assignment\n\tlet invoke_return = true;\n\n\ttry {\n\t\twhile (true) {\n\t\t\tconst { done, value } = (await track_reactivity_loss(iterator.next()))();\n\t\t\tif (done) {\n\t\t\t\tinvoke_return = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tvar prev = reactivity_loss_tracker;\n\t\t\ttry {\n\t\t\t\tyield value;\n\t\t\t} catch (e) {\n\t\t\t\tset_reactivity_loss_tracker(prev);\n\t\t\t\t// If the yield throws, we need to call `return` but not return its value, instead rethrow\n\t\t\t\tif (iterator.return !== undefined) {\n\t\t\t\t\t(await track_reactivity_loss(iterator.return()))();\n\t\t\t\t}\n\t\t\t\tthrow e;\n\t\t\t}\n\t\t\tset_reactivity_loss_tracker(prev);\n\t\t}\n\t} catch (error) {\n\t\tinvoke_return = false;\n\t\tthrow error;\n\t} finally {\n\t\t// If the iterator had an abrupt completion (break) and `return` is defined on the iterator, call it and return the value\n\t\tif (invoke_return && iterator.return !== undefined) {\n\t\t\t// eslint-disable-next-line no-unsafe-finally\n\t\t\treturn /* @type {TReturn} / ((await track_reactivity_loss(iterator.return()))().value);\n\t\t}\n\t}\n}\n\nexport function unset_context(deactivate_batch = true) {\n\tset_active_effect(null);\n\tset_active_reaction(null);\n\tset_component_context(null);\n\tif (deactivate_batch) current_batch?.deactivate();\n\n\tif (DEV) {\n\t\tset_reactivity_loss_tracker(null);\n\t\tset_dev_stack(null);\n\t}\n}\n\n/\n @param {Array<() => void \| Promise<void>>} thunks\n /\nexport function run(thunks) {\n\tconst restore = capture();\n\n\tconst decrement_pending = increment_pending();\n\n\tvar active = /* @type {Effect} / (active_effect);\n\n\t/* @type {null \| { error: any }} /\n\tvar errored = null;\n\n\t/* @param {any} error /\n\tconst handle_error = (error) => {\n\t\terrored = { error }; // wrap in object in case a promise rejects with a falsy value\n\n\t\tif (!aborted(active)) {\n\t\t\tinvoke_error_boundary(error, active);\n\t\t}\n\t};\n\n\tvar promise = Promise.resolve(thunks[0]()).catch(handle_error);\n\n\t/* @type {Blocker} /\n\tvar blocker = { promise, settled: false };\n\tvar blockers = [blocker];\n\n\tpromise.finally(() => {\n\t\tblocker.settled = true;\n\t\tunset_context();\n\t});\n\n\tfor (const fn of thunks.slice(1)) {\n\t\tpromise = promise\n\t\t\t.then(() => {\n\t\t\t\trestore();\n\n\t\t\t\ttry {\n\t\t\t\t\tif (errored) {\n\t\t\t\t\t\tthrow errored.error;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (aborted(active)) {\n\t\t\t\t\t\tthrow STALE_REACTION;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn fn();\n\t\t\t\t} finally {\n\t\t\t\t\t// We gotta unset context directly in case the function returns a promise, in which case\n\t\t\t\t\t// unset_context in .finally() would be too late ...\n\t\t\t\t\tunset_context();\n\t\t\t\t}\n\t\t\t})\n\t\t\t.catch(handle_error);\n\n\t\tconst blocker = { promise, settled: false };\n\t\tblockers.push(blocker);\n\n\t\tpromise.finally(() => {\n\t\t\tblocker.settled = true;\n\t\t\t// ... but we also need it after such a promise has resolved in case it restores our context\n\t\t\tunset_context();\n\t\t});\n\t}\n\n\tpromise\n\t\t// wait one more tick, so that template effects are\n\t\t// guaranteed to run before `$effect(...)`\n\t\t.then(() => Promise.resolve())\n\t\t.finally(decrement_pending);\n\n\treturn blockers;\n}\n\n/\n @param {Blocker[]} blockers\n /\nexport function wait(blockers) {\n\treturn Promise.all(blockers.map((b) => b.promise));\n}\n\n/\n @returns {(skip?: boolean) => void}\n /\nexport function increment_pending() {\n\tvar effect = /* @type {Effect} / (active_effect);\n\tvar boundary = /* @type {Boundary} / (effect.b);\n\tvar batch = /* @type {Batch} / (current_batch);\n\tvar blocking = boundary.is_rendered();\n\n\tboundary.update_pending_count(1, batch);\n\tbatch.increment(blocking, effect);\n\n\treturn () => {\n\t\tboundary.update_pending_count(-1, batch);\n\t\tbatch.decrement(blocking, effect);\n\t};\n}\n","/* @import { Derived, Effect, Reaction, Source, Value } from '#client' /\n/* @import { Batch } from './batch.js'; /\n/* @import { Boundary } from '../dom/blocks/boundary.js'; /\nimport { DEV } from 'esm-env';\nimport {\n\tERROR_VALUE,\n\tDERIVED,\n\tDIRTY,\n\tEFFECT_PRESERVED,\n\tSTALE_REACTION,\n\tASYNC,\n\tWAS_MARKED,\n\tDESTROYED,\n\tCLEAN,\n\tREACTION_RAN,\n\tINERT\n} from '#client/constants';\nimport {\n\tactive_reaction,\n\tactive_effect,\n\tupdate_reaction,\n\tincrement_write_version,\n\tset_active_effect,\n\tpush_reaction_value,\n\tis_destroying_effect,\n\tupdate_effect,\n\tremove_reactions,\n\tskipped_deps,\n\tnew_deps\n} from '../runtime.js';\nimport { equals, safe_equals } from './equality.js';\nimport as e from '../errors.js';\nimport * as w from '../warnings.js';\nimport {\n\tasync_effect,\n\tdestroy_effect,\n\tdestroy_effect_children,\n\teffect_tracking,\n\tteardown\n} from './effects.js';\nimport { eager_effects, internal_set, set_eager_effects, source } from './sources.js';\nimport { get_error } from '../../shared/dev.js';\nimport { async_mode_flag, tracing_mode_flag } from '../../flags/index.js';\nimport { component_context } from '../context.js';\nimport { UNINITIALIZED } from '../../../constants.js';\nimport { batch_values, current_batch, previous_batch } from './batch.js';\nimport { increment_pending, unset_context } from './async.js';\nimport { deferred, includes, noop } from '../../shared/utils.js';\nimport { set_signal_status, update_derived_status } from './status.js';\n\n/*\n This allows us to track 'reactivity loss' that occurs when signals\n * are read after a non-context-restoring `await`. Dev-only\n * @type {{ effect: Effect, effect_deps: Set<Value>, warned: boolean } \| null}\n /\nexport let reactivity_loss_tracker = null;\n\n/* @param {{ effect: Effect, effect_deps: Set<Value>, warned: boolean } \| null} v /\nexport function set_reactivity_loss_tracker(v) {\n\treactivity_loss_tracker = v;\n}\n\nexport const recent_async_deriveds = new Set();\n\n/\n @template V\n * @param {() => V} fn\n * @returns {Derived<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function derived(fn) {\n\tvar flags = DERIVED \| DIRTY;\n\n\tif (active_effect !== null) {\n\t\t// Since deriveds are evaluated lazily, any effects created inside them are\n\t\t// created too late to ensure that the parent effect is added to the tree\n\t\tactive_effect.f \|= EFFECT_PRESERVED;\n\t}\n\n\t/* @type {Derived<V>} /\n\tconst signal = {\n\t\tctx: component_context,\n\t\tdeps: null,\n\t\teffects: null,\n\t\tequals,\n\t\tf: flags,\n\t\tfn,\n\t\treactions: null,\n\t\trv: 0,\n\t\tv: /* @type {V} / (UNINITIALIZED),\n\t\twv: 0,\n\t\tparent: active_effect,\n\t\tac: null\n\t};\n\n\tif (DEV && tracing_mode_flag) {\n\t\tsignal.created = get_error('created at');\n\t}\n\n\treturn signal;\n}\n\nexport const OBSOLETE = Symbol('obsolete');\n\n/\n @template V\n * @param {() => V \| Promise<V>} fn\n * @param {string} [label]\n * @param {string} [location] If provided, print a warning if the value is not read immediately after update\n * @returns {Promise<Source<V>>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function async_derived(fn, label, location) {\n\tlet parent = /* @type {Effect \| null} / (active_effect);\n\n\tif (parent === null) {\n\t\te.async_derived_orphan();\n\t}\n\n\tvar promise = /* @type {Promise<V>} / (/* @type {unknown} / (undefined));\n\tvar signal = source(/* @type {V} / (UNINITIALIZED));\n\n\tif (DEV) signal.label = label ?? fn.toString();\n\n\t// only suspend in async deriveds created on initialisation\n\tvar should_suspend = !active_reaction;\n\n\t/* @type {Set<ReturnType<typeof deferred<V>>>} /\n\tvar deferreds = new Set();\n\n\tasync_effect(() => {\n\t\tvar effect = /* @type {Effect} / (active_effect);\n\n\t\tif (DEV) {\n\t\t\treactivity_loss_tracker = { effect, effect_deps: new Set(), warned: false };\n\t\t}\n\n\t\t/* @type {ReturnType<typeof deferred<V>>} /\n\t\tvar d = deferred();\n\t\tpromise = d.promise;\n\n\t\ttry {\n\t\t\t// If this code is changed at some point, make sure to still access the then property\n\t\t\t// of fn() to read any signals it might access, so that we track them as dependencies.\n\t\t\t// We call `unset_context` to undo any `save` calls that happen inside `fn()`\n\t\t\tPromise.resolve(fn())\n\t\t\t\t.then(d.resolve, (e) => {\n\t\t\t\t\t// if the promise was rejected by the user, via `getAbortSignal`, then\n\t\t\t\t\t// wait for a subsequent resolution instead of flushing the batch\n\t\t\t\t\tif (e !== STALE_REACTION) d.reject(e);\n\t\t\t\t})\n\t\t\t\t.finally(unset_context);\n\t\t} catch (error) {\n\t\t\td.reject(error);\n\t\t\tunset_context();\n\t\t}\n\n\t\tif (DEV) {\n\t\t\tif (reactivity_loss_tracker) {\n\t\t\t\t// Reused deps from previous run (indices 0 to skipped_deps-1)\n\t\t\t\t// We deliberately only track direct dependencies of the async expression to encourage\n\t\t\t\t// dependencies being directly visible at the point of the expression\n\t\t\t\tif (effect.deps !== null) {\n\t\t\t\t\tfor (let i = 0; i < skipped_deps; i += 1) {\n\t\t\t\t\t\treactivity_loss_tracker.effect_deps.add(effect.deps[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// New deps discovered this run\n\t\t\t\tif (new_deps !== null) {\n\t\t\t\t\tfor (let i = 0; i < new_deps.length; i += 1) {\n\t\t\t\t\t\treactivity_loss_tracker.effect_deps.add(new_deps[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treactivity_loss_tracker = null;\n\t\t}\n\n\t\tvar batch = /* @type {Batch} / (current_batch);\n\n\t\tif (should_suspend) {\n\t\t\t// we only increment the batch's pending state for updates, not creation, otherwise\n\t\t\t// we will decrement to zero before the work that depends on this promise (e.g. a\n\t\t\t// template effect) has initialized, causing the batch to resolve prematurely\n\t\t\tif ((effect.f & REACTION_RAN) !== 0) {\n\t\t\t\tvar decrement_pending = increment_pending();\n\t\t\t}\n\n\t\t\tif (/* @type {Boundary} / (parent.b).is_rendered()) {\n\t\t\t\tbatch.async_deriveds.get(effect)?.reject(OBSOLETE);\n\t\t\t} else {\n\t\t\t\t// While the boundary is still showing pending, a new run supersedes all older in-flight runs\n\t\t\t\t// for this async expression. Cancel eagerly so resolution cannot commit stale values.\n\t\t\t\tfor (const d of deferreds.values()) {\n\t\t\t\t\td.reject(OBSOLETE);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdeferreds.add(d);\n\t\t\tbatch.async_deriveds.set(effect, d);\n\t\t}\n\n\t\t/\n\t\t @param {any} value\n\t\t * @param {unknown} error\n\t\t /\n\t\tconst handler = (value, error = undefined) => {\n\t\t\tif (DEV) {\n\t\t\t\treactivity_loss_tracker = null;\n\t\t\t}\n\n\t\t\tdecrement_pending?.();\n\t\t\tdeferreds.delete(d);\n\n\t\t\tif (error === OBSOLETE) return;\n\n\t\t\tbatch.activate();\n\n\t\t\tif (error) {\n\t\t\t\tsignal.f \|= ERROR_VALUE;\n\n\t\t\t\t// @ts-expect-error the error is the wrong type, but we don't care\n\t\t\t\tinternal_set(signal, error);\n\t\t\t} else {\n\t\t\t\tif ((signal.f & ERROR_VALUE) !== 0) {\n\t\t\t\t\tsignal.f ^= ERROR_VALUE;\n\t\t\t\t}\n\n\t\t\t\tinternal_set(signal, value);\n\n\t\t\t\tif (DEV && location !== undefined) {\n\t\t\t\t\trecent_async_deriveds.add(signal);\n\n\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\tif (recent_async_deriveds.has(signal) && (effect.f & DESTROYED) === 0) {\n\t\t\t\t\t\t\tw.await_waterfall(/* @type {string} / (signal.label), location);\n\t\t\t\t\t\t\trecent_async_deriveds.delete(signal);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbatch.deactivate();\n\t\t};\n\n\t\td.promise.then(handler, (e) => handler(null, e \|\| 'unknown'));\n\t});\n\n\tteardown(() => {\n\t\tfor (const d of deferreds) {\n\t\t\td.reject(OBSOLETE);\n\t\t}\n\t});\n\n\tif (DEV) {\n\t\t// add a flag that lets this be printed as a derived\n\t\t// when using `$inspect.trace()`\n\t\tsignal.f \|= ASYNC;\n\t}\n\n\treturn new Promise((fulfil) => {\n\t\t/* @param {Promise<V>} p /\n\t\tfunction next(p) {\n\t\t\tfunction go() {\n\t\t\t\tif (p === promise) {\n\t\t\t\t\tfulfil(signal);\n\t\t\t\t} else {\n\t\t\t\t\t// if the effect re-runs before the initial promise\n\t\t\t\t\t// resolves, delay resolution until we have a value\n\t\t\t\t\tnext(promise);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tp.then(go, go);\n\t\t}\n\n\t\tnext(promise);\n\t});\n}\n\n/\n @template V\n * @param {() => V} fn\n * @returns {Derived<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function user_derived(fn) {\n\tconst d = derived(fn);\n\n\tif (!async_mode_flag) push_reaction_value(d);\n\n\treturn d;\n}\n\n/\n @template V\n * @param {() => V} fn\n * @returns {Derived<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function derived_safe_equal(fn) {\n\tconst signal = derived(fn);\n\tsignal.equals = safe_equals;\n\treturn signal;\n}\n\n/\n @param {Derived} derived\n * @returns {void}\n /\nexport function destroy_derived_effects(derived) {\n\tvar effects = derived.effects;\n\n\tif (effects !== null) {\n\t\tderived.effects = null;\n\n\t\tfor (var i = 0; i < effects.length; i += 1) {\n\t\t\tdestroy_effect(/* @type {Effect} / (effects[i]));\n\t\t}\n\t}\n}\n\n/\n The currently updating deriveds, used to detect infinite recursion\n * in dev mode and provide a nicer error than 'too much recursion'\n * @type {Derived[]}\n /\nlet stack = [];\n\n/\n @template T\n * @param {Derived} derived\n * @returns {T}\n /\nexport function execute_derived(derived) {\n\tvar value;\n\tvar prev_active_effect = active_effect;\n\tvar parent = derived.parent;\n\n\tif (\n\t\t!is_destroying_effect &&\n\t\tparent !== null &&\n\t\tderived.v !== UNINITIALIZED && // if it was never evaluated before, it's guaranteed to fail downstream, so we try to execute instead\n\t\t(parent.f & (DESTROYED \| INERT)) !== 0\n\t) {\n\t\tw.derived_inert();\n\n\t\treturn derived.v;\n\t}\n\n\tset_active_effect(parent);\n\n\tif (DEV) {\n\t\tlet prev_eager_effects = eager_effects;\n\t\tset_eager_effects(new Set());\n\t\ttry {\n\t\t\tif (includes.call(stack, derived)) {\n\t\t\t\te.derived_references_self();\n\t\t\t}\n\n\t\t\tstack.push(derived);\n\n\t\t\tderived.f &= ~WAS_MARKED;\n\t\t\tdestroy_derived_effects(derived);\n\t\t\tvalue = update_reaction(derived);\n\t\t} finally {\n\t\t\tset_active_effect(prev_active_effect);\n\t\t\tset_eager_effects(prev_eager_effects);\n\t\t\tstack.pop();\n\t\t}\n\t} else {\n\t\ttry {\n\t\t\tderived.f &= ~WAS_MARKED;\n\t\t\tdestroy_derived_effects(derived);\n\t\t\tvalue = update_reaction(derived);\n\t\t} finally {\n\t\t\tset_active_effect(prev_active_effect);\n\t\t}\n\t}\n\n\treturn value;\n}\n\n/\n @param {Derived} derived\n * @returns {void}\n /\nexport function update_derived(derived) {\n\tvar value = execute_derived(derived);\n\n\tif (!derived.equals(value)) {\n\t\tderived.wv = increment_write_version();\n\n\t\t// in a fork, we don't update the underlying value, just `batch_values`.\n\t\t// the underlying value will be updated when the fork is committed.\n\t\t// otherwise, the next time we get here after a 'real world' state\n\t\t// change, `derived.equals` may incorrectly return `true`\n\t\tif (!current_batch?.is_fork \|\| derived.deps === null) {\n\t\t\tif (current_batch !== null) {\n\t\t\t\t// We also write to previous_batch because if it exists, it is a sign that we're\n\t\t\t\t// currently in the process of flushing effects. These updates to deriveds may belong\n\t\t\t\t// to the previous batch, not the new one (which can already exist if an earlier\n\t\t\t\t// effect wrote to a source). This can cause bugs when running batch.#commit() later,\n\t\t\t\t// but not adding it to current_batch can, too, so we add it to both.\n\t\t\t\t// See https://github.com/sveltejs/svelte/pull/18117 for more details.\n\t\t\t\tcurrent_batch.capture(derived, value, true);\n\t\t\t\tprevious_batch?.capture(derived, value, true);\n\t\t\t} else {\n\t\t\t\tderived.v = value;\n\t\t\t}\n\n\t\t\t// deriveds without dependencies should never be recomputed\n\t\t\tif (derived.deps === null) {\n\t\t\t\tset_signal_status(derived, CLEAN);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\t// don't mark derived clean if we're reading it inside a\n\t// cleanup function, or it will cache a stale value\n\tif (is_destroying_effect) {\n\t\treturn;\n\t}\n\n\t// During time traveling we don't want to reset the status so that\n\t// traversal of the graph in the other batches still happens\n\tif (batch_values !== null) {\n\t\t// only cache the value if we're in a tracking context, otherwise we won't\n\t\t// clear the cache in `mark_reactions` when dependencies are updated\n\t\tif (effect_tracking() \|\| current_batch?.is_fork) {\n\t\t\tbatch_values.set(derived, value);\n\t\t}\n\t} else {\n\t\tupdate_derived_status(derived);\n\t}\n}\n\n/\n @param {Derived} derived\n /\nexport function freeze_derived_effects(derived) {\n\tif (derived.effects === null) return;\n\n\tfor (const e of derived.effects) {\n\t\t// if the effect has a teardown function or abort signal, call it\n\t\tif (e.teardown \|\| e.ac) {\n\t\t\te.teardown?.();\n\t\t\te.ac?.abort(STALE_REACTION);\n\n\t\t\t// make it a noop so it doesn't get called again if the derived\n\t\t\t// is unfrozen. we don't set it to `null`, because the existence\n\t\t\t// of a teardown function is what determines whether the\n\t\t\t// effect runs again during unfreezing (but not for teardown-only effects)\n\t\t\tif (e.fn !== null) e.teardown = noop;\n\t\t\te.ac = null;\n\n\t\t\tremove_reactions(e, 0);\n\t\t\tdestroy_effect_children(e);\n\t\t}\n\t}\n}\n\n/\n @param {Derived} derived\n /\nexport function unfreeze_derived_effects(derived) {\n\tif (derived.effects === null) return;\n\n\tfor (const e of derived.effects) {\n\t\t// if the effect was previously frozen — indicated by the presence\n\t\t// of a teardown function — unfreeze it\n\t\tif (e.teardown && e.fn !== null) {\n\t\t\tupdate_effect(e);\n\t\t}\n\t}\n}\n","/* @import { Derived, Effect, Source, Value } from '#client' /\nimport { DEV } from 'esm-env';\nimport {\n\tactive_reaction,\n\tactive_effect,\n\tuntracked_writes,\n\tget,\n\tset_untracked_writes,\n\tuntrack,\n\tincrement_write_version,\n\tupdate_effect,\n\tcurrent_sources,\n\tis_dirty,\n\tuntracking,\n\tis_destroying_effect,\n\tpush_reaction_value\n} from '../runtime.js';\nimport { equals, safe_equals } from './equality.js';\nimport {\n\tCLEAN,\n\tDERIVED,\n\tDIRTY,\n\tBRANCH_EFFECT,\n\tEAGER_EFFECT,\n\tMAYBE_DIRTY,\n\tBLOCK_EFFECT,\n\tROOT_EFFECT,\n\tASYNC,\n\tWAS_MARKED,\n\tCONNECTED,\n\tREACTION_IS_UPDATING\n} from '#client/constants';\nimport as e from '../errors.js';\nimport { legacy_mode_flag, tracing_mode_flag } from '../../flags/index.js';\nimport { includes } from '../../shared/utils.js';\nimport { tag_proxy } from '../dev/tracing.js';\nimport { get_error } from '../../shared/dev.js';\nimport { component_context, is_runes } from '../context.js';\nimport {\n\tBatch,\n\tbatch_values,\n\teager_block_effects,\n\tschedule_effect,\n\tlegacy_updates\n} from './batch.js';\nimport { proxy } from '../proxy.js';\nimport { execute_derived } from './deriveds.js';\nimport { set_signal_status, update_derived_status } from './status.js';\n\n/** @type {Set<Effect>} /\nexport let eager_effects = new Set();\n\n/* @type {Map<Source, any>} /\nexport const old_values = new Map();\n\n/\n @param {Set<any>} v\n /\nexport function set_eager_effects(v) {\n\teager_effects = v;\n}\n\nlet eager_effects_deferred = false;\n\nexport function set_eager_effects_deferred() {\n\teager_effects_deferred = true;\n}\n\n/\n @template V\n * @param {V} v\n * @param {Error \| null} [stack]\n * @returns {Source<V>}\n /\n// TODO rename this to `state` throughout the codebase\nexport function source(v, stack) {\n\t/* @type {Value} /\n\tvar signal = {\n\t\tf: 0, // TODO ideally we could skip this altogether, but it causes type errors\n\t\tv,\n\t\treactions: null,\n\t\tequals,\n\t\trv: 0,\n\t\twv: 0\n\t};\n\n\tif (DEV && tracing_mode_flag) {\n\t\tsignal.created = stack ?? get_error('created at');\n\t\tsignal.updated = null;\n\t\tsignal.set_during_effect = false;\n\t\tsignal.trace = null;\n\t}\n\n\treturn signal;\n}\n\n/\n @template V\n * @param {V} v\n * @param {Error \| null} [stack]\n /\n/#__NO_SIDE_EFFECTS__/\nexport function state(v, stack) {\n\tconst s = source(v, stack);\n\n\tpush_reaction_value(s);\n\n\treturn s;\n}\n\n/\n @template V\n * @param {V} initial_value\n * @param {boolean} [immutable]\n * @returns {Source<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function mutable_source(initial_value, immutable = false, trackable = true) {\n\tconst s = source(initial_value);\n\tif (!immutable) {\n\t\ts.equals = safe_equals;\n\t}\n\n\t// bind the signal to the component context, in case we need to\n\t// track updates to trigger beforeUpdate/afterUpdate callbacks\n\tif (legacy_mode_flag && trackable && component_context !== null && component_context.l !== null) {\n\t\t(component_context.l.s ??= []).push(s);\n\t}\n\n\treturn s;\n}\n\n/\n @template V\n * @param {Value<V>} source\n * @param {V} value\n /\nexport function mutate(source, value) {\n\tset(\n\t\tsource,\n\t\tuntrack(() => get(source))\n\t);\n\treturn value;\n}\n\n/\n @template V\n * @param {Source<V>} source\n * @param {V} value\n * @param {boolean} [should_proxy]\n * @returns {V}\n /\nexport function set(source, value, should_proxy = false) {\n\tif (\n\t\tactive_reaction !== null &&\n\t\t// since we are untracking the function inside `$inspect.with` we need to add this check\n\t\t// to ensure we error if state is set inside an inspect effect\n\t\t(!untracking \|\| (active_reaction.f & EAGER_EFFECT) !== 0) &&\n\t\tis_runes() &&\n\t\t(active_reaction.f & (DERIVED \| BLOCK_EFFECT \| ASYNC \| EAGER_EFFECT)) !== 0 &&\n\t\t(current_sources === null \|\| !includes.call(current_sources, source))\n\t) {\n\t\te.state_unsafe_mutation();\n\t}\n\n\tlet new_value = should_proxy ? proxy(value) : value;\n\n\tif (DEV) {\n\t\ttag_proxy(new_value, /* @type {string} / (source.label));\n\t}\n\n\treturn internal_set(source, new_value, legacy_updates);\n}\n\n/\n @template V\n * @param {Source<V>} source\n * @param {V} value\n * @param {Effect[] \| null} [updated_during_traversal]\n * @returns {V}\n /\nexport function internal_set(source, value, updated_during_traversal = null) {\n\tif (!source.equals(value)) {\n\t\told_values.set(source, is_destroying_effect ? value : source.v);\n\n\t\tvar batch = Batch.ensure();\n\t\tbatch.capture(source, value);\n\n\t\tif (DEV) {\n\t\t\tif (tracing_mode_flag \|\| active_effect !== null) {\n\t\t\t\tsource.updated ??= new Map();\n\n\t\t\t\t// For performance reasons, when not using $inspect.trace, we only start collecting stack traces\n\t\t\t\t// after the same source has been updated more than 5 times in the same flush cycle.\n\t\t\t\tconst count = (source.updated.get('')?.count ?? 0) + 1;\n\t\t\t\tsource.updated.set('', { error: /* @type {any} / (null), count });\n\n\t\t\t\tif (tracing_mode_flag \|\| count > 5) {\n\t\t\t\t\tconst error = get_error('updated at');\n\n\t\t\t\t\tif (error !== null) {\n\t\t\t\t\t\tlet entry = source.updated.get(error.stack);\n\n\t\t\t\t\t\tif (!entry) {\n\t\t\t\t\t\t\tentry = { error, count: 0 };\n\t\t\t\t\t\t\tsource.updated.set(error.stack, entry);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tentry.count++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (active_effect !== null) {\n\t\t\t\tsource.set_during_effect = true;\n\t\t\t}\n\t\t}\n\n\t\tif ((source.f & DERIVED) !== 0) {\n\t\t\tconst derived = /* @type {Derived} / (source);\n\n\t\t\t// if we are assigning to a dirty derived we set it to clean/maybe dirty but we also eagerly execute it to track the dependencies\n\t\t\tif ((source.f & DIRTY) !== 0) {\n\t\t\t\texecute_derived(derived);\n\t\t\t}\n\n\t\t\t// During time traveling we don't want to reset the status so that\n\t\t\t// traversal of the graph in the other batches still happens\n\t\t\tif (batch_values === null) {\n\t\t\t\tupdate_derived_status(derived);\n\t\t\t}\n\t\t}\n\n\t\tsource.wv = increment_write_version();\n\n\t\t// For debugging, in case you want to know which reactions are being scheduled:\n\t\t// log_reactions(source);\n\t\tmark_reactions(source, DIRTY, updated_during_traversal);\n\n\t\t// It's possible that the current reaction might not have up-to-date dependencies\n\t\t// whilst it's actively running. So in the case of ensuring it registers the reaction\n\t\t// properly for itself, we need to ensure the current effect actually gets\n\t\t// scheduled. i.e: `$effect(() => x++)`\n\t\tif (\n\t\t\tis_runes() &&\n\t\t\tactive_effect !== null &&\n\t\t\t(active_effect.f & CLEAN) !== 0 &&\n\t\t\t(active_effect.f & (BRANCH_EFFECT \| ROOT_EFFECT)) === 0\n\t\t) {\n\t\t\tif (untracked_writes === null) {\n\t\t\t\tset_untracked_writes([source]);\n\t\t\t} else {\n\t\t\t\tuntracked_writes.push(source);\n\t\t\t}\n\t\t}\n\n\t\tif (!batch.is_fork && eager_effects.size > 0 && !eager_effects_deferred) {\n\t\t\tflush_eager_effects();\n\t\t}\n\t}\n\n\treturn value;\n}\n\nexport function flush_eager_effects() {\n\teager_effects_deferred = false;\n\n\tfor (const effect of eager_effects) {\n\t\t// Mark clean inspect-effects as maybe dirty and then check their dirtiness\n\t\t// instead of just updating the effects - this way we avoid overfiring.\n\t\tif ((effect.f & CLEAN) !== 0) {\n\t\t\tset_signal_status(effect, MAYBE_DIRTY);\n\t\t}\n\n\t\tlet dirty;\n\n\t\ttry {\n\t\t\tdirty = is_dirty(effect);\n\t\t} catch {\n\t\t\t// Dirty-checking can evaluate derived dependencies and throw in cases where\n\t\t\t// parent effects are about to destroy this eager effect. Run the effect so\n\t\t\t// its own error handling can deal with transient failures.\n\t\t\tdirty = true;\n\t\t}\n\n\t\tif (dirty) {\n\t\t\tupdate_effect(effect);\n\t\t}\n\t}\n\n\teager_effects.clear();\n}\n\n/\n @template {number \| bigint} T\n * @param {Source<T>} source\n * @param {1 \| -1} [d]\n * @returns {T}\n /\nexport function update(source, d = 1) {\n\tvar value = get(source);\n\tvar result = d === 1 ? value++ : value--;\n\n\tset(source, value);\n\n\t// @ts-expect-error\n\treturn result;\n}\n\n/\n @template {number \| bigint} T\n * @param {Source<T>} source\n * @param {1 \| -1} [d]\n * @returns {T}\n /\nexport function update_pre(source, d = 1) {\n\tvar value = get(source);\n\n\t// @ts-expect-error\n\t// eslint-disable-next-line no-useless-assignment -- `++`/`--` used for return value, not side effect on `value`\n\treturn set(source, d === 1 ? ++value : --value);\n}\n\n/\n Silently (without using `get`) increment a source\n * @param {Source<number>} source\n /\nexport function increment(source) {\n\tset(source, source.v + 1);\n}\n\n/\n @param {Value} signal\n * @param {number} status should be DIRTY or MAYBE_DIRTY\n * @param {Effect[] \| null} updated_during_traversal\n * @returns {void}\n /\nfunction mark_reactions(signal, status, updated_during_traversal) {\n\tvar reactions = signal.reactions;\n\tif (reactions === null) return;\n\n\tvar runes = is_runes();\n\tvar length = reactions.length;\n\n\tfor (var i = 0; i < length; i++) {\n\t\tvar reaction = reactions[i];\n\t\tvar flags = reaction.f;\n\n\t\t// In legacy mode, skip the current effect to prevent infinite loops\n\t\tif (!runes && reaction === active_effect) continue;\n\n\t\tvar not_dirty = (flags & DIRTY) === 0;\n\n\t\t// don't set a DIRTY reaction to MAYBE_DIRTY\n\t\tif (not_dirty) {\n\t\t\tset_signal_status(reaction, status);\n\t\t}\n\n\t\tif ((flags & EAGER_EFFECT) !== 0) {\n\t\t\t// Eager effects need to run immediately:\n\t\t\t// - for $inspect so that the stack trace makes sense\n\t\t\t// - for $state.eager because they might be without an effect parent\n\t\t\teager_effects.add(/* @type {Effect} / (reaction));\n\t\t} else if ((flags & DERIVED) !== 0) {\n\t\t\tvar derived = /* @type {Derived} / (reaction);\n\n\t\t\tbatch_values?.delete(derived);\n\n\t\t\tif ((flags & WAS_MARKED) === 0) {\n\t\t\t\t// Only connected deriveds being executed outside the update cycle can be reliably unmarked right away\n\t\t\t\tif (\n\t\t\t\t\tflags & CONNECTED &&\n\t\t\t\t\t(active_effect === null \|\| (active_effect.f & REACTION_IS_UPDATING) === 0)\n\t\t\t\t) {\n\t\t\t\t\treaction.f \|= WAS_MARKED;\n\t\t\t\t}\n\n\t\t\t\tmark_reactions(derived, MAYBE_DIRTY, updated_during_traversal);\n\t\t\t}\n\t\t} else if (not_dirty) {\n\t\t\tvar effect = /* @type {Effect} / (reaction);\n\n\t\t\tif ((flags & BLOCK_EFFECT) !== 0 && eager_block_effects !== null) {\n\t\t\t\teager_block_effects.add(effect);\n\t\t\t}\n\n\t\t\tif (updated_during_traversal !== null) {\n\t\t\t\tupdated_during_traversal.push(effect);\n\t\t\t} else {\n\t\t\t\tschedule_effect(effect);\n\t\t\t}\n\t\t}\n\t}\n}\n","/* @import { Source } from '#client' /\nimport { DEV } from 'esm-env';\nimport {\n\tget,\n\tactive_effect,\n\tupdate_version,\n\tactive_reaction,\n\tset_update_version,\n\tset_active_reaction\n} from './runtime.js';\nimport {\n\tarray_prototype,\n\tget_descriptor,\n\tget_prototype_of,\n\tis_array,\n\tobject_prototype\n} from '../shared/utils.js';\nimport {\n\tstate as source,\n\tset,\n\tincrement,\n\tflush_eager_effects,\n\tset_eager_effects_deferred\n} from './reactivity/sources.js';\nimport { PROXY_PATH_SYMBOL, STATE_SYMBOL } from '#client/constants';\nimport { UNINITIALIZED } from '../../constants.js';\nimport as e from './errors.js';\nimport { tag } from './dev/tracing.js';\nimport { get_error } from '../shared/dev.js';\nimport { tracing_mode_flag } from '../flags/index.js';\n\n// TODO move all regexes into shared module?\nconst regex_is_valid_identifier = /^[a-zA-Z_$][a-zA-Z_$0-9]$/;\n\n/\n @template T\n * @param {T} value\n * @returns {T}\n /\nexport function proxy(value) {\n\t// if non-proxyable, or is already a proxy, return `value`\n\tif (typeof value !== 'object' \|\| value === null \|\| STATE_SYMBOL in value) {\n\t\treturn value;\n\t}\n\n\tconst prototype = get_prototype_of(value);\n\n\tif (prototype !== object_prototype && prototype !== array_prototype) {\n\t\treturn value;\n\t}\n\n\t/* @type {Map<any, Source<any>>} /\n\tvar sources = new Map();\n\tvar is_proxied_array = is_array(value);\n\tvar version = source(0);\n\n\tvar stack = DEV && tracing_mode_flag ? get_error('created at') : null;\n\tvar parent_version = update_version;\n\n\t/\n\t Executes the proxy in the context of the reaction it was originally created in, if any\n\t * @template T\n\t * @param {() => T} fn\n\t /\n\tvar with_parent = (fn) => {\n\t\tif (update_version === parent_version) {\n\t\t\treturn fn();\n\t\t}\n\n\t\t// child source is being created after the initial proxy —\n\t\t// prevent it from being associated with the current reaction\n\t\tvar reaction = active_reaction;\n\t\tvar version = update_version;\n\n\t\tset_active_reaction(null);\n\t\tset_update_version(parent_version);\n\n\t\tvar result = fn();\n\n\t\tset_active_reaction(reaction);\n\t\tset_update_version(version);\n\n\t\treturn result;\n\t};\n\n\tif (is_proxied_array) {\n\t\t// We need to create the length source eagerly to ensure that\n\t\t// mutations to the array are properly synced with our proxy\n\t\tsources.set('length', source(/* @type {any[]} / (value).length, stack));\n\t\tif (DEV) {\n\t\t\tvalue = /* @type {any} / (inspectable_array(/* @type {any[]} / (value)));\n\t\t}\n\t}\n\n\t/* Used in dev for $inspect.trace() /\n\tvar path = '';\n\tlet updating = false;\n\t/* @param {string} new_path /\n\tfunction update_path(new_path) {\n\t\tif (updating) return;\n\t\tupdating = true;\n\t\tpath = new_path;\n\n\t\ttag(version, `${path} version`);\n\n\t\t// rename all child sources and child proxies\n\t\tfor (const [prop, source] of sources) {\n\t\t\ttag(source, get_label(path, prop));\n\t\t}\n\t\tupdating = false;\n\t}\n\n\treturn new Proxy(/* @type {any} / (value), {\n\t\tdefineProperty(_, prop, descriptor) {\n\t\t\tif (\n\t\t\t\t!('value' in descriptor) \|\|\n\t\t\t\tdescriptor.configurable === false \|\|\n\t\t\t\tdescriptor.enumerable === false \|\|\n\t\t\t\tdescriptor.writable === false\n\t\t\t) {\n\t\t\t\t// we disallow non-basic descriptors, because unless they are applied to the\n\t\t\t\t// target object — which we avoid, so that state can be forked — we will run\n\t\t\t\t// afoul of the various invariants\n\t\t\t\t// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Proxy/Proxy/getOwnPropertyDescriptor#invariants\n\t\t\t\te.state_descriptors_fixed();\n\t\t\t}\n\t\t\tvar s = sources.get(prop);\n\t\t\tif (s === undefined) {\n\t\t\t\twith_parent(() => {\n\t\t\t\t\tvar s = source(descriptor.value, stack);\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t\tif (DEV && typeof prop === 'string') {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\t\t\t\t\treturn s;\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tset(s, descriptor.value, true);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t},\n\n\t\tdeleteProperty(target, prop) {\n\t\t\tvar s = sources.get(prop);\n\n\t\t\tif (s === undefined) {\n\t\t\t\tif (prop in target) {\n\t\t\t\t\tconst s = with_parent(() => source(UNINITIALIZED, stack));\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t\tincrement(version);\n\n\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tset(s, UNINITIALIZED);\n\t\t\t\tincrement(version);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t},\n\n\t\tget(target, prop, receiver) {\n\t\t\tif (prop === STATE_SYMBOL) {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\tif (DEV && prop === PROXY_PATH_SYMBOL) {\n\t\t\t\treturn update_path;\n\t\t\t}\n\n\t\t\tvar s = sources.get(prop);\n\t\t\tvar exists = prop in target;\n\n\t\t\t// create a source, but only if it's an own property and not a prototype property\n\t\t\tif (s === undefined && (!exists \|\| get_descriptor(target, prop)?.writable)) {\n\t\t\t\ts = with_parent(() => {\n\t\t\t\t\tvar p = proxy(exists ? target[prop] : UNINITIALIZED);\n\t\t\t\t\tvar s = source(p, stack);\n\n\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\n\t\t\t\t\treturn s;\n\t\t\t\t});\n\n\t\t\t\tsources.set(prop, s);\n\t\t\t}\n\n\t\t\tif (s !== undefined) {\n\t\t\t\tvar v = get(s);\n\t\t\t\treturn v === UNINITIALIZED ? undefined : v;\n\t\t\t}\n\n\t\t\treturn Reflect.get(target, prop, receiver);\n\t\t},\n\n\t\tgetOwnPropertyDescriptor(target, prop) {\n\t\t\tvar descriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n\n\t\t\tif (descriptor && 'value' in descriptor) {\n\t\t\t\tvar s = sources.get(prop);\n\t\t\t\tif (s) descriptor.value = get(s);\n\t\t\t} else if (descriptor === undefined) {\n\t\t\t\tvar source = sources.get(prop);\n\t\t\t\tvar value = source?.v;\n\n\t\t\t\tif (source !== undefined && value !== UNINITIALIZED) {\n\t\t\t\t\treturn {\n\t\t\t\t\t\tenumerable: true,\n\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\tvalue,\n\t\t\t\t\t\twritable: true\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn descriptor;\n\t\t},\n\n\t\thas(target, prop) {\n\t\t\tif (prop === STATE_SYMBOL) {\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tvar s = sources.get(prop);\n\t\t\tvar has = (s !== undefined && s.v !== UNINITIALIZED) \|\| Reflect.has(target, prop);\n\n\t\t\tif (\n\t\t\t\ts !== undefined \|\|\n\t\t\t\t(active_effect !== null && (!has \|\| get_descriptor(target, prop)?.writable))\n\t\t\t) {\n\t\t\t\tif (s === undefined) {\n\t\t\t\t\ts = with_parent(() => {\n\t\t\t\t\t\tvar p = has ? proxy(target[prop]) : UNINITIALIZED;\n\t\t\t\t\t\tvar s = source(p, stack);\n\n\t\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn s;\n\t\t\t\t\t});\n\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t}\n\n\t\t\t\tvar value = get(s);\n\t\t\t\tif (value === UNINITIALIZED) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn has;\n\t\t},\n\n\t\tset(target, prop, value, receiver) {\n\t\t\tvar s = sources.get(prop);\n\t\t\tvar has = prop in target;\n\n\t\t\t// variable.length = value -> clear all signals with index >= value\n\t\t\tif (is_proxied_array && prop === 'length') {\n\t\t\t\tfor (var i = value; i < /* @type {Source<number>} / (s).v; i += 1) {\n\t\t\t\t\tvar other_s = sources.get(i + '');\n\t\t\t\t\tif (other_s !== undefined) {\n\t\t\t\t\t\tset(other_s, UNINITIALIZED);\n\t\t\t\t\t} else if (i in target) {\n\t\t\t\t\t\t// If the item exists in the original, we need to create an uninitialized source,\n\t\t\t\t\t\t// else a later read of the property would result in a source being created with\n\t\t\t\t\t\t// the value of the original item at that index.\n\t\t\t\t\t\tother_s = with_parent(() => source(UNINITIALIZED, stack));\n\t\t\t\t\t\tsources.set(i + '', other_s);\n\n\t\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\t\ttag(other_s, get_label(path, i));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If we haven't yet created a source for this property, we need to ensure\n\t\t\t// we do so otherwise if we read it later, then the write won't be tracked and\n\t\t\t// the heuristics of effects will be different vs if we had read the proxied\n\t\t\t// object property before writing to that property.\n\t\t\tif (s === undefined) {\n\t\t\t\tif (!has \|\| get_descriptor(target, prop)?.writable) {\n\t\t\t\t\ts = with_parent(() => source(undefined, stack));\n\n\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\t\t\t\t\tset(s, proxy(value));\n\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\thas = s.v !== UNINITIALIZED;\n\n\t\t\t\tvar p = with_parent(() => proxy(value));\n\t\t\t\tset(s, p);\n\t\t\t}\n\n\t\t\tvar descriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n\n\t\t\t// Set the new value before updating any signals so that any listeners get the new value\n\t\t\tif (descriptor?.set) {\n\t\t\t\tdescriptor.set.call(receiver, value);\n\t\t\t}\n\n\t\t\tif (!has) {\n\t\t\t\t// If we have mutated an array directly, we might need to\n\t\t\t\t// signal that length has also changed. Do it before updating metadata\n\t\t\t\t// to ensure that iterating over the array as a result of a metadata update\n\t\t\t\t// will not cause the length to be out of sync.\n\t\t\t\tif (is_proxied_array && typeof prop === 'string') {\n\t\t\t\t\tvar ls = /* @type {Source<number>} / (sources.get('length'));\n\t\t\t\t\tvar n = Number(prop);\n\n\t\t\t\t\tif (Number.isInteger(n) && n >= ls.v) {\n\t\t\t\t\t\tset(ls, n + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tincrement(version);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t},\n\n\t\townKeys(target) {\n\t\t\tget(version);\n\n\t\t\tvar own_keys = Reflect.ownKeys(target).filter((key) => {\n\t\t\t\tvar source = sources.get(key);\n\t\t\t\treturn source === undefined \|\| source.v !== UNINITIALIZED;\n\t\t\t});\n\n\t\t\tfor (var [key, source] of sources) {\n\t\t\t\tif (source.v !== UNINITIALIZED && !(key in target)) {\n\t\t\t\t\town_keys.push(key);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn own_keys;\n\t\t},\n\n\t\tsetPrototypeOf() {\n\t\t\te.state_prototype_fixed();\n\t\t}\n\t});\n}\n\n/\n @param {string} path\n * @param {string \| symbol} prop\n /\nfunction get_label(path, prop) {\n\tif (typeof prop === 'symbol') return `${path}[Symbol(${prop.description ?? ''})]`;\n\tif (regex_is_valid_identifier.test(prop)) return `${path}.${prop}`;\n\treturn /^\\d+$/.test(prop) ? `${path}[${prop}]` : `${path}['${prop}']`;\n}\n\n/\n @param {any} value\n /\nexport function get_proxied_value(value) {\n\ttry {\n\t\tif (value !== null && typeof value === 'object' && STATE_SYMBOL in value) {\n\t\t\treturn value[STATE_SYMBOL];\n\t\t}\n\t} catch {\n\t\t// the above if check can throw an error if the value in question\n\t\t// is the contentWindow of an iframe on another domain, in which\n\t\t// case we want to just return the value (because it's definitely\n\t\t// not a proxied value) so we don't break any JavaScript interacting\n\t\t// with that iframe (such as various payment companies client side\n\t\t// JavaScript libraries interacting with their iframes on the same\n\t\t// domain)\n\t}\n\n\treturn value;\n}\n\n/\n @param {any} a\n * @param {any} b\n /\nexport function is(a, b) {\n\treturn Object.is(get_proxied_value(a), get_proxied_value(b));\n}\n\nconst ARRAY_MUTATING_METHODS = new Set([\n\t'copyWithin',\n\t'fill',\n\t'pop',\n\t'push',\n\t'reverse',\n\t'shift',\n\t'sort',\n\t'splice',\n\t'unshift'\n]);\n\n/\n Wrap array mutating methods so $inspect is triggered only once and\n * to prevent logging an array in intermediate state (e.g. with an empty slot)\n * @param {any[]} array\n /\nfunction inspectable_array(array) {\n\treturn new Proxy(array, {\n\t\tget(target, prop, receiver) {\n\t\t\tvar value = Reflect.get(target, prop, receiver);\n\t\t\tif (!ARRAY_MUTATING_METHODS.has(/* @type {string} / (prop))) {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\t/\n\t\t\t @this {any[]}\n\t\t\t * @param {any[]} args\n\t\t\t /\n\t\t\treturn function (...args) {\n\t\t\t\tset_eager_effects_deferred();\n\t\t\t\tvar result = value.apply(this, args);\n\t\t\t\tflush_eager_effects();\n\t\t\t\treturn result;\n\t\t\t};\n\t\t}\n\t});\n}\n","/* @import { Effect, TemplateNode } from '#client' /\nimport { hydrate_node, hydrating, set_hydrate_node } from './hydration.js';\nimport { DEV } from 'esm-env';\nimport { init_array_prototype_warnings } from '../dev/equality.js';\nimport { get_descriptor, is_extensible } from '../../shared/utils.js';\nimport { active_effect } from '../runtime.js';\nimport { async_mode_flag } from '../../flags/index.js';\nimport {\n\tATTRIBUTES_CACHE,\n\tCLASS_CACHE,\n\tREACTION_RAN,\n\tSTYLE_CACHE,\n\tTEXT_CACHE,\n\tTEXT_NODE\n} from '#client/constants';\nimport { eager_block_effects } from '../reactivity/batch.js';\nimport { NAMESPACE_HTML } from '../../../constants.js';\n\n// export these for reference in the compiled code, making global name deduplication unnecessary\n/* @type {Window} /\nexport var $window;\n\n/* @type {Document} /\nexport var $document;\n\n/* @type {boolean} /\nexport var is_firefox;\n\n/* @type {() => Node \| null} /\nvar first_child_getter;\n/* @type {() => Node \| null} /\nvar next_sibling_getter;\n\n/\n Initialize these lazily to avoid issues when using the runtime in a server context\n * where these globals are not available while avoiding a separate server entry point\n /\nexport function init_operations() {\n\tif ($window !== undefined) {\n\t\treturn;\n\t}\n\n\t$window = window;\n\t$document = document;\n\tis_firefox = /Firefox/.test(navigator.userAgent);\n\n\tvar element_prototype = Element.prototype;\n\tvar node_prototype = Node.prototype;\n\tvar text_prototype = Text.prototype;\n\n\t// @ts-ignore\n\tfirst_child_getter = get_descriptor(node_prototype, 'firstChild').get;\n\t// @ts-ignore\n\tnext_sibling_getter = get_descriptor(node_prototype, 'nextSibling').get;\n\n\tif (is_extensible(element_prototype)) {\n\t\t// the following assignments improve perf of lookups on DOM nodes\n\t\t/* @type {any} / (element_prototype)[CLASS_CACHE] = undefined;\n\t\t/* @type {any} / (element_prototype)[ATTRIBUTES_CACHE] = null;\n\t\t/* @type {any} / (element_prototype)[STYLE_CACHE] = undefined;\n\t\t// @ts-expect-error\n\t\telement_prototype.__e = undefined;\n\t}\n\n\tif (is_extensible(text_prototype)) {\n\t\t/* @type {any} / (text_prototype)[TEXT_CACHE] = undefined;\n\t}\n\n\tif (DEV) {\n\t\t// @ts-expect-error\n\t\telement_prototype.__svelte_meta = null;\n\n\t\tinit_array_prototype_warnings();\n\t}\n}\n\n/\n @param {string} value\n * @returns {Text}\n /\nexport function create_text(value = '') {\n\treturn document.createTextNode(value);\n}\n\n/\n @template {Node} N\n * @param {N} node\n /\n/@__NO_SIDE_EFFECTS__/\nexport function get_first_child(node) {\n\treturn /* @type {TemplateNode \| null} / (first_child_getter.call(node));\n}\n\n/\n @template {Node} N\n * @param {N} node\n /\n/@__NO_SIDE_EFFECTS__/\nexport function get_next_sibling(node) {\n\treturn /* @type {TemplateNode \| null} / (next_sibling_getter.call(node));\n}\n\n/\n Don't mark this as side-effect-free, hydration needs to walk all nodes\n * @template {Node} N\n * @param {N} node\n * @param {boolean} is_text\n * @returns {TemplateNode \| null}\n /\nexport function child(node, is_text) {\n\tif (!hydrating) {\n\t\treturn get_first_child(node);\n\t}\n\n\tvar child = get_first_child(hydrate_node);\n\n\t// Child can be null if we have an element with a single child, like `<p>{text}</p>`, where `text` is empty\n\tif (child === null) {\n\t\tchild = hydrate_node.appendChild(create_text());\n\t} else if (is_text && child.nodeType !== TEXT_NODE) {\n\t\tvar text = create_text();\n\t\tchild?.before(text);\n\t\tset_hydrate_node(text);\n\t\treturn text;\n\t}\n\n\tif (is_text) {\n\t\tmerge_text_nodes(/* @type {Text} / (child));\n\t}\n\n\tset_hydrate_node(child);\n\treturn child;\n}\n\n/\n Don't mark this as side-effect-free, hydration needs to walk all nodes\n * @param {TemplateNode} node\n * @param {boolean} [is_text]\n * @returns {TemplateNode \| null}\n /\nexport function first_child(node, is_text = false) {\n\tif (!hydrating) {\n\t\tvar first = get_first_child(node);\n\n\t\t// TODO prevent user comments with the empty string when preserveComments is true\n\t\tif (first instanceof Comment && first.data === '') return get_next_sibling(first);\n\n\t\treturn first;\n\t}\n\n\tif (is_text) {\n\t\t// if an {expression} is empty during SSR, there might be no\n\t\t// text node to hydrate — we must therefore create one\n\t\tif (hydrate_node?.nodeType !== TEXT_NODE) {\n\t\t\tvar text = create_text();\n\n\t\t\thydrate_node?.before(text);\n\t\t\tset_hydrate_node(text);\n\t\t\treturn text;\n\t\t}\n\n\t\tmerge_text_nodes(/* @type {Text} / (hydrate_node));\n\t}\n\n\treturn hydrate_node;\n}\n\n/\n Don't mark this as side-effect-free, hydration needs to walk all nodes\n * @param {TemplateNode} node\n * @param {number} count\n * @param {boolean} is_text\n * @returns {TemplateNode \| null}\n /\nexport function sibling(node, count = 1, is_text = false) {\n\tlet next_sibling = hydrating ? hydrate_node : node;\n\tvar last_sibling;\n\n\twhile (count--) {\n\t\tlast_sibling = next_sibling;\n\t\tnext_sibling = /* @type {TemplateNode} / (get_next_sibling(next_sibling));\n\t}\n\n\tif (!hydrating) {\n\t\treturn next_sibling;\n\t}\n\n\tif (is_text) {\n\t\t// if a sibling {expression} is empty during SSR, there might be no\n\t\t// text node to hydrate — we must therefore create one\n\t\tif (next_sibling?.nodeType !== TEXT_NODE) {\n\t\t\tvar text = create_text();\n\t\t\t// If the next sibling is `null` and we're handling text then it's because\n\t\t\t// the SSR content was empty for the text, so we need to generate a new text\n\t\t\t// node and insert it after the last sibling\n\t\t\tif (next_sibling === null) {\n\t\t\t\tlast_sibling?.after(text);\n\t\t\t} else {\n\t\t\t\tnext_sibling.before(text);\n\t\t\t}\n\t\t\tset_hydrate_node(text);\n\t\t\treturn text;\n\t\t}\n\n\t\tmerge_text_nodes(/* @type {Text} / (next_sibling));\n\t}\n\n\tset_hydrate_node(next_sibling);\n\treturn next_sibling;\n}\n\n/\n @template {Node} N\n * @param {N} node\n * @returns {void}\n /\nexport function clear_text_content(node) {\n\tnode.textContent = '';\n}\n\n/\n Returns `true` if we're updating the current block, for example `condition` in\n * an `{#if condition}` block just changed. In this case, the branch should be\n * appended (or removed) at the same time as other updates within the\n * current `<svelte:boundary>`\n /\nexport function should_defer_append() {\n\tif (!async_mode_flag) return false;\n\tif (eager_block_effects !== null) return false;\n\n\tvar flags = /* @type {Effect} / (active_effect).f;\n\treturn (flags & REACTION_RAN) !== 0;\n}\n\n/\n @template {keyof HTMLElementTagNameMap \| string} T\n * @param {T} tag\n * @param {string} [namespace]\n * @param {string} [is]\n * @returns {T extends keyof HTMLElementTagNameMap ? HTMLElementTagNameMap[T] : Element}\n /\nexport function create_element(tag, namespace, is) {\n\tlet options = is ? { is } : undefined;\n\treturn /* @type {T extends keyof HTMLElementTagNameMap ? HTMLElementTagNameMap[T] : Element} / (\n\t\tdocument.createElementNS(namespace ?? NAMESPACE_HTML, tag, options)\n\t);\n}\n\nexport function create_fragment() {\n\treturn document.createDocumentFragment();\n}\n\n/\n @param {string} data\n * @returns\n /\nexport function create_comment(data = '') {\n\treturn document.createComment(data);\n}\n\n/\n @param {Element} element\n * @param {string} key\n * @param {string} value\n * @returns\n /\nexport function set_attribute(element, key, value = '') {\n\tif (key.startsWith('xlink:')) {\n\t\telement.setAttributeNS('http://www.w3.org/1999/xlink', key, value);\n\t\treturn;\n\t}\n\treturn element.setAttribute(key, value);\n}\n\n/\n Browsers split text nodes larger than 65536 bytes when parsing.\n * For hydration to succeed, we need to stitch them back together\n * @param {Text} text\n /\nexport function merge_text_nodes(text) {\n\tif (/* @type {string} / (text.nodeValue).length < 65536) {\n\t\treturn;\n\t}\n\n\tlet next = text.nextSibling;\n\n\twhile (next !== null && next.nodeType === TEXT_NODE) {\n\t\tnext.remove();\n\n\t\t/* @type {string} / (text.nodeValue) += /* @type {string} / (next.nodeValue);\n\n\t\tnext = text.nextSibling;\n\t}\n}\n","import { hydrating } from '../hydration.js';\nimport { clear_text_content, get_first_child } from '../operations.js';\nimport { queue_micro_task } from '../task.js';\nimport { FORM_RESET_HANDLER } from '../../constants.js';\n\n/\n @param {HTMLElement} dom\n * @param {boolean} value\n * @returns {void}\n /\nexport function autofocus(dom, value) {\n\tif (value) {\n\t\tconst body = document.body;\n\t\tdom.autofocus = true;\n\n\t\tqueue_micro_task(() => {\n\t\t\tif (document.activeElement === body) {\n\t\t\t\tdom.focus();\n\t\t\t}\n\t\t});\n\t}\n}\n\n/\n The child of a textarea actually corresponds to the defaultValue property, so we need\n * to remove it upon hydration to avoid a bug when someone resets the form value.\n * @param {HTMLTextAreaElement} dom\n * @returns {void}\n /\nexport function remove_textarea_child(dom) {\n\tif (hydrating && get_first_child(dom) !== null) {\n\t\tclear_text_content(dom);\n\t}\n}\n\nlet listening_to_form_reset = false;\n\nexport function add_form_reset_listener() {\n\tif (!listening_to_form_reset) {\n\t\tlistening_to_form_reset = true;\n\t\tdocument.addEventListener(\n\t\t\t'reset',\n\t\t\t(evt) => {\n\t\t\t\t// Needs to happen one tick later or else the dom properties of the form\n\t\t\t\t// elements have not updated to their reset values yet\n\t\t\t\tPromise.resolve().then(() => {\n\t\t\t\t\tif (!evt.defaultPrevented) {\n\t\t\t\t\t\tfor (const e of /@type {HTMLFormElement} / (evt.target).elements) {\n\t\t\t\t\t\t\t/** @type {any} / (e)[FORM_RESET_HANDLER]?.();\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\t// In the capture phase to guarantee we get noticed of it (no possibility of stopPropagation)\n\t\t\t{ capture: true }\n\t\t);\n\t}\n}\n","import { teardown } from '../../../reactivity/effects.js';\nimport {\n\tactive_effect,\n\tactive_reaction,\n\tset_active_effect,\n\tset_active_reaction\n} from '../../../runtime.js';\nimport { FORM_RESET_HANDLER } from '../../../constants.js';\nimport { add_form_reset_listener } from '../misc.js';\n\n/\n Fires the handler once immediately (unless corresponding arg is set to `false`),\n * then listens to the given events until the render effect context is destroyed\n * @param {EventTarget} target\n * @param {Array<string>} events\n * @param {(event?: Event) => void} handler\n * @param {any} call_handler_immediately\n /\nexport function listen(target, events, handler, call_handler_immediately = true) {\n\tif (call_handler_immediately) {\n\t\thandler();\n\t}\n\n\tfor (var name of events) {\n\t\ttarget.addEventListener(name, handler);\n\t}\n\n\tteardown(() => {\n\t\tfor (var name of events) {\n\t\t\ttarget.removeEventListener(name, handler);\n\t\t}\n\t});\n}\n\n/\n @template T\n * @param {() => T} fn\n /\nexport function without_reactive_context(fn) {\n\tvar previous_reaction = active_reaction;\n\tvar previous_effect = active_effect;\n\tset_active_reaction(null);\n\tset_active_effect(null);\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tset_active_reaction(previous_reaction);\n\t\tset_active_effect(previous_effect);\n\t}\n}\n\n/\n Listen to the given event, and then instantiate a global form reset listener if not already done,\n * to notify all bindings when the form is reset\n * @param {HTMLElement} element\n * @param {string} event\n * @param {(is_reset?: true) => void} handler\n * @param {(is_reset?: true) => void} [on_reset]\n /\nexport function listen_to_event_and_reset_event(element, event, handler, on_reset = handler) {\n\telement.addEventListener(event, () => without_reactive_context(handler));\n\tconst prev = /* @type {any} / (element)[FORM_RESET_HANDLER];\n\tif (prev) {\n\t\t// special case for checkbox that can have multiple binds (group & checked)\n\t\t/* @type {any} / (element)[FORM_RESET_HANDLER] = () => {\n\t\t\tprev();\n\t\t\ton_reset(true);\n\t\t};\n\t} else {\n\t\t/* @type {any} / (element)[FORM_RESET_HANDLER] = () => on_reset(true);\n\t}\n\n\tadd_form_reset_listener();\n}\n","/* @import { Blocker, ComponentContext, ComponentContextLegacy, Derived, Effect, TemplateNode, TransitionManager } from '#client' /\nimport {\n\tis_dirty,\n\tactive_effect,\n\tactive_reaction,\n\tupdate_effect,\n\tget,\n\tis_destroying_effect,\n\tremove_reactions,\n\tset_active_reaction,\n\tset_is_destroying_effect,\n\tuntrack,\n\tuntracking,\n\tset_active_effect\n} from '../runtime.js';\nimport {\n\tDIRTY,\n\tBRANCH_EFFECT,\n\tRENDER_EFFECT,\n\tEFFECT,\n\tDESTROYED,\n\tINERT,\n\tREACTION_RAN,\n\tBLOCK_EFFECT,\n\tROOT_EFFECT,\n\tEFFECT_TRANSPARENT,\n\tDERIVED,\n\tCLEAN,\n\tEAGER_EFFECT,\n\tHEAD_EFFECT,\n\tMAYBE_DIRTY,\n\tEFFECT_PRESERVED,\n\tSTALE_REACTION,\n\tUSER_EFFECT,\n\tASYNC,\n\tCONNECTED,\n\tMANAGED_EFFECT,\n\tDESTROYING\n} from '#client/constants';\nimport as e from '../errors.js';\nimport { DEV } from 'esm-env';\nimport { define_property } from '../../shared/utils.js';\nimport { get_next_sibling } from '../dom/operations.js';\nimport { component_context, dev_current_component_function, dev_stack } from '../context.js';\nimport { Batch, collected_effects, current_batch } from './batch.js';\nimport { flatten } from './async.js';\nimport { without_reactive_context } from '../dom/elements/bindings/shared.js';\nimport { set_signal_status } from './status.js';\n\n/*\n @param {'$effect' \| '$effect.pre' \| '$inspect'} rune\n /\nexport function validate_effect(rune) {\n\tif (active_effect === null) {\n\t\tif (active_reaction === null) {\n\t\t\te.effect_orphan(rune);\n\t\t}\n\n\t\te.effect_in_unowned_derived();\n\t}\n\n\tif (is_destroying_effect) {\n\t\te.effect_in_teardown(rune);\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {Effect} parent_effect\n /\nfunction push_effect(effect, parent_effect) {\n\tvar parent_last = parent_effect.last;\n\tif (parent_last === null) {\n\t\tparent_effect.last = parent_effect.first = effect;\n\t} else {\n\t\tparent_last.next = effect;\n\t\teffect.prev = parent_last;\n\t\tparent_effect.last = effect;\n\t}\n}\n\n/\n @param {number} type\n * @param {null \| (() => void \| (() => void))} fn\n * @returns {Effect}\n /\nfunction create_effect(type, fn) {\n\tvar parent = active_effect;\n\n\tif (DEV) {\n\t\t// Ensure the parent is never an inspect effect\n\t\twhile (parent !== null && (parent.f & EAGER_EFFECT) !== 0) {\n\t\t\tparent = parent.parent;\n\t\t}\n\t}\n\n\tif (parent !== null && (parent.f & INERT) !== 0) {\n\t\ttype \|= INERT;\n\t}\n\n\t/* @type {Effect} /\n\tvar effect = {\n\t\tctx: component_context,\n\t\tdeps: null,\n\t\tnodes: null,\n\t\tf: type \| DIRTY \| CONNECTED,\n\t\tfirst: null,\n\t\tfn,\n\t\tlast: null,\n\t\tnext: null,\n\t\tparent,\n\t\tb: parent && parent.b,\n\t\tprev: null,\n\t\tteardown: null,\n\t\twv: 0,\n\t\tac: null\n\t};\n\n\tif (DEV) {\n\t\teffect.component_function = dev_current_component_function;\n\t}\n\n\tcurrent_batch?.register_created_effect(effect);\n\n\t/* @type {Effect \| null} /\n\tvar e = effect;\n\n\tif ((type & EFFECT) !== 0) {\n\t\tif (collected_effects !== null) {\n\t\t\t// created during traversal — collect and run afterwards\n\t\t\tcollected_effects.push(effect);\n\t\t} else {\n\t\t\t// schedule for later\n\t\t\tBatch.ensure().schedule(effect);\n\t\t}\n\t} else if (fn !== null) {\n\t\ttry {\n\t\t\tupdate_effect(effect);\n\t\t} catch (e) {\n\t\t\tdestroy_effect(effect);\n\t\t\tthrow e;\n\t\t}\n\n\t\t// if an effect doesn't need to be kept in the tree (because it\n\t\t// won't re-run, has no DOM, and has no teardown etc)\n\t\t// then we skip it and go to its child (if any)\n\t\tif (\n\t\t\te.deps === null &&\n\t\t\te.teardown === null &&\n\t\t\te.nodes === null &&\n\t\t\te.first === e.last && // either `null`, or a singular child\n\t\t\t(e.f & EFFECT_PRESERVED) === 0\n\t\t) {\n\t\t\te = e.first;\n\t\t\tif ((type & BLOCK_EFFECT) !== 0 && (type & EFFECT_TRANSPARENT) !== 0 && e !== null) {\n\t\t\t\te.f \|= EFFECT_TRANSPARENT;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (e !== null) {\n\t\te.parent = parent;\n\n\t\tif (parent !== null) {\n\t\t\tpush_effect(e, parent);\n\t\t}\n\n\t\t// if we're in a derived, add the effect there too\n\t\tif (\n\t\t\tactive_reaction !== null &&\n\t\t\t(active_reaction.f & DERIVED) !== 0 &&\n\t\t\t(type & ROOT_EFFECT) === 0\n\t\t) {\n\t\t\tvar derived = /* @type {Derived} / (active_reaction);\n\t\t\t(derived.effects ??= []).push(e);\n\t\t}\n\t}\n\n\treturn effect;\n}\n\n/\n Internal representation of `$effect.tracking()`\n * @returns {boolean}\n /\nexport function effect_tracking() {\n\treturn active_reaction !== null && !untracking;\n}\n\n/\n @param {() => void} fn\n /\nexport function teardown(fn) {\n\tconst effect = create_effect(RENDER_EFFECT, null);\n\tset_signal_status(effect, CLEAN);\n\teffect.teardown = fn;\n\treturn effect;\n}\n\n/\n Internal representation of `$effect(...)`\n * @param {() => void \| (() => void)} fn\n /\nexport function user_effect(fn) {\n\tvalidate_effect('$effect');\n\n\tif (DEV) {\n\t\tdefine_property(fn, 'name', {\n\t\t\tvalue: '$effect'\n\t\t});\n\t}\n\n\t// Non-nested `$effect(...)` in a component should be deferred\n\t// until the component is mounted\n\tvar flags = /* @type {Effect} / (active_effect).f;\n\tvar defer = !active_reaction && (flags & BRANCH_EFFECT) !== 0 && (flags & REACTION_RAN) === 0;\n\n\tif (defer) {\n\t\t// Top-level `$effect(...)` in an unmounted component — defer until mount\n\t\tvar context = /* @type {ComponentContext} / (component_context);\n\t\t(context.e ??= []).push(fn);\n\t} else {\n\t\t// Everything else — create immediately\n\t\treturn create_user_effect(fn);\n\t}\n}\n\n/\n @param {() => void \| (() => void)} fn\n /\nexport function create_user_effect(fn) {\n\treturn create_effect(EFFECT \| USER_EFFECT, fn);\n}\n\n/\n Internal representation of `$effect.pre(...)`\n * @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function user_pre_effect(fn) {\n\tvalidate_effect('$effect.pre');\n\tif (DEV) {\n\t\tdefine_property(fn, 'name', {\n\t\t\tvalue: '$effect.pre'\n\t\t});\n\t}\n\treturn create_effect(RENDER_EFFECT \| USER_EFFECT, fn);\n}\n\n/* @param {() => void \| (() => void)} fn /\nexport function eager_effect(fn) {\n\treturn create_effect(EAGER_EFFECT, fn);\n}\n\n/\n Internal representation of `$effect.root(...)`\n * @param {() => void \| (() => void)} fn\n * @returns {() => void}\n /\nexport function effect_root(fn) {\n\tBatch.ensure();\n\tconst effect = create_effect(ROOT_EFFECT \| EFFECT_PRESERVED, fn);\n\n\treturn () => {\n\t\tdestroy_effect(effect);\n\t};\n}\n\n/\n An effect root whose children can transition out\n * @param {() => void} fn\n * @returns {(options?: { outro?: boolean }) => Promise<void>}\n /\nexport function component_root(fn) {\n\tBatch.ensure();\n\tconst effect = create_effect(ROOT_EFFECT \| EFFECT_PRESERVED, fn);\n\n\treturn (options = {}) => {\n\t\treturn new Promise((fulfil) => {\n\t\t\tif (options.outro) {\n\t\t\t\tpause_effect(effect, () => {\n\t\t\t\t\tdestroy_effect(effect);\n\t\t\t\t\tfulfil(undefined);\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tdestroy_effect(effect);\n\t\t\t\tfulfil(undefined);\n\t\t\t}\n\t\t});\n\t};\n}\n\n/\n @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function effect(fn) {\n\treturn create_effect(EFFECT, fn);\n}\n\n/\n Internal representation of `$: ..`\n * @param {() => any} deps\n * @param {() => void \| (() => void)} fn\n /\nexport function legacy_pre_effect(deps, fn) {\n\tvar context = /* @type {ComponentContextLegacy} / (component_context);\n\n\t/* @type {{ effect: null \| Effect, ran: boolean, deps: () => any }} /\n\tvar token = { effect: null, ran: false, deps };\n\n\tcontext.l.$.push(token);\n\n\ttoken.effect = render_effect(() => {\n\t\tdeps();\n\n\t\t// If this legacy pre effect has already run before the end of the reset, then\n\t\t// bail out to emulate the same behavior.\n\t\tif (token.ran) return;\n\n\t\ttoken.ran = true;\n\n\t\tvar effect = /* @type {Effect} / (active_effect);\n\n\t\t// here, we lie: by setting `active_effect` to be the parent branch, any writes\n\t\t// that happen inside `fn` will _not_ cause an unnecessary reschedule, because\n\t\t// the affected effects will be children of `active_effect`. this is safe\n\t\t// because these effects are known to run in the correct order\n\t\ttry {\n\t\t\tset_active_effect(effect.parent);\n\t\t\tuntrack(fn);\n\t\t} finally {\n\t\t\tset_active_effect(effect);\n\t\t}\n\t});\n}\n\nexport function legacy_pre_effect_reset() {\n\tvar context = /* @type {ComponentContextLegacy} / (component_context);\n\n\trender_effect(() => {\n\t\t// Run dirty `$:` statements\n\t\tfor (var token of context.l.$) {\n\t\t\ttoken.deps();\n\n\t\t\tvar effect = token.effect;\n\n\t\t\t// If the effect is CLEAN, then make it MAYBE_DIRTY. This ensures we traverse through\n\t\t\t// the effects dependencies and correctly ensure each dependency is up-to-date.\n\t\t\tif ((effect.f & CLEAN) !== 0 && effect.deps !== null) {\n\t\t\t\tset_signal_status(effect, MAYBE_DIRTY);\n\t\t\t}\n\n\t\t\tif (is_dirty(effect)) {\n\t\t\t\tupdate_effect(effect);\n\t\t\t}\n\n\t\t\ttoken.ran = false;\n\t\t}\n\t});\n}\n\n/\n @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function async_effect(fn) {\n\treturn create_effect(ASYNC \| EFFECT_PRESERVED, fn);\n}\n\n/\n @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function render_effect(fn, flags = 0) {\n\treturn create_effect(RENDER_EFFECT \| flags, fn);\n}\n\n/\n @param {(...expressions: any) => void \| (() => void)} fn\n * @param {Array<() => any>} sync\n * @param {Array<() => Promise<any>>} async\n * @param {Blocker[]} blockers\n /\nexport function template_effect(fn, sync = [], async = [], blockers = []) {\n\tflatten(blockers, sync, async, (values) => {\n\t\tcreate_effect(RENDER_EFFECT, () => fn(...values.map(get)));\n\t});\n}\n\n/\n Like `template_effect`, but with an effect which is deferred until the batch commits\n * @param {(...expressions: any) => void \| (() => void)} fn\n * @param {Array<() => any>} sync\n * @param {Array<() => Promise<any>>} async\n * @param {Blocker[]} blockers\n /\nexport function deferred_template_effect(fn, sync = [], async = [], blockers = []) {\n\tflatten(blockers, sync, async, (values) => {\n\t\tcreate_effect(EFFECT, () => fn(...values.map(get)));\n\t});\n}\n\n/\n @param {(() => void)} fn\n * @param {number} flags\n /\nexport function block(fn, flags = 0) {\n\tvar effect = create_effect(BLOCK_EFFECT \| flags, fn);\n\tif (DEV) {\n\t\teffect.dev_stack = dev_stack;\n\t}\n\treturn effect;\n}\n\n/\n @param {(() => void)} fn\n * @param {number} flags\n /\nexport function managed(fn, flags = 0) {\n\tvar effect = create_effect(MANAGED_EFFECT \| flags, fn);\n\tif (DEV) {\n\t\teffect.dev_stack = dev_stack;\n\t}\n\treturn effect;\n}\n\n/\n @param {(() => void)} fn\n /\nexport function branch(fn) {\n\treturn create_effect(BRANCH_EFFECT \| EFFECT_PRESERVED, fn);\n}\n\n/\n @param {Effect} effect\n /\nexport function execute_effect_teardown(effect) {\n\tvar teardown = effect.teardown;\n\tif (teardown !== null) {\n\t\tconst previously_destroying_effect = is_destroying_effect;\n\t\tconst previous_reaction = active_reaction;\n\t\tset_is_destroying_effect(true);\n\t\tset_active_reaction(null);\n\t\ttry {\n\t\t\tteardown.call(null);\n\t\t} finally {\n\t\t\tset_is_destroying_effect(previously_destroying_effect);\n\t\t\tset_active_reaction(previous_reaction);\n\t\t}\n\t}\n}\n\n/\n @param {Effect} signal\n * @param {boolean} remove_dom\n * @returns {void}\n /\nexport function destroy_effect_children(signal, remove_dom = false) {\n\tvar effect = signal.first;\n\tsignal.first = signal.last = null;\n\n\twhile (effect !== null) {\n\t\tconst controller = effect.ac;\n\n\t\tif (controller !== null) {\n\t\t\twithout_reactive_context(() => {\n\t\t\t\tcontroller.abort(STALE_REACTION);\n\t\t\t});\n\t\t}\n\n\t\tvar next = effect.next;\n\n\t\tif ((effect.f & ROOT_EFFECT) !== 0) {\n\t\t\t// this is now an independent root\n\t\t\teffect.parent = null;\n\t\t} else {\n\t\t\tdestroy_effect(effect, remove_dom);\n\t\t}\n\n\t\teffect = next;\n\t}\n}\n\n/\n @param {Effect} signal\n * @returns {void}\n /\nexport function destroy_block_effect_children(signal) {\n\tvar effect = signal.first;\n\n\twhile (effect !== null) {\n\t\tvar next = effect.next;\n\t\tif ((effect.f & BRANCH_EFFECT) === 0) {\n\t\t\tdestroy_effect(effect);\n\t\t}\n\t\teffect = next;\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {boolean} [remove_dom]\n * @returns {void}\n /\nexport function destroy_effect(effect, remove_dom = true) {\n\tvar removed = false;\n\n\tif (\n\t\t(remove_dom \|\| (effect.f & HEAD_EFFECT) !== 0) &&\n\t\teffect.nodes !== null &&\n\t\teffect.nodes.end !== null\n\t) {\n\t\tremove_effect_dom(effect.nodes.start, /* @type {TemplateNode} / (effect.nodes.end));\n\t\tremoved = true;\n\t}\n\n\tset_signal_status(effect, DESTROYING);\n\tdestroy_effect_children(effect, remove_dom && !removed);\n\tremove_reactions(effect, 0);\n\n\tvar transitions = effect.nodes && effect.nodes.t;\n\n\tif (transitions !== null) {\n\t\tfor (const transition of transitions) {\n\t\t\ttransition.stop();\n\t\t}\n\t}\n\n\texecute_effect_teardown(effect);\n\n\teffect.f ^= DESTROYING;\n\teffect.f \|= DESTROYED;\n\n\tvar parent = effect.parent;\n\n\t// If the parent doesn't have any children, then skip this work altogether\n\tif (parent !== null && parent.first !== null) {\n\t\tunlink_effect(effect);\n\t}\n\n\tif (DEV) {\n\t\teffect.component_function = null;\n\t}\n\n\t// `first` and `child` are nulled out in destroy_effect_children\n\t// we don't null out `parent` so that error propagation can work correctly\n\teffect.next =\n\t\teffect.prev =\n\t\teffect.teardown =\n\t\teffect.ctx =\n\t\teffect.deps =\n\t\teffect.fn =\n\t\teffect.nodes =\n\t\teffect.ac =\n\t\teffect.b =\n\t\t\tnull;\n}\n\n/\n \n * @param {TemplateNode \| null} node\n * @param {TemplateNode} end\n /\nexport function remove_effect_dom(node, end) {\n\twhile (node !== null) {\n\t\t/* @type {TemplateNode \| null} /\n\t\tvar next = node === end ? null : get_next_sibling(node);\n\n\t\tnode.remove();\n\t\tnode = next;\n\t}\n}\n\n/\n Detach an effect from the effect tree, freeing up memory and\n * reducing the amount of work that happens on subsequent traversals\n * @param {Effect} effect\n /\nexport function unlink_effect(effect) {\n\tvar parent = effect.parent;\n\tvar prev = effect.prev;\n\tvar next = effect.next;\n\n\tif (prev !== null) prev.next = next;\n\tif (next !== null) next.prev = prev;\n\n\tif (parent !== null) {\n\t\tif (parent.first === effect) parent.first = next;\n\t\tif (parent.last === effect) parent.last = prev;\n\t}\n}\n\n/\n When a block effect is removed, we don't immediately destroy it or yank it\n * out of the DOM, because it might have transitions. Instead, we 'pause' it.\n * It stays around (in memory, and in the DOM) until outro transitions have\n * completed, and if the state change is reversed then we _resume_ it.\n * A paused effect does not update, and the DOM subtree becomes inert.\n * @param {Effect} effect\n * @param {() => void} [callback]\n * @param {boolean} [destroy]\n /\nexport function pause_effect(effect, callback, destroy = true) {\n\t/* @type {TransitionManager[]} /\n\tvar transitions = [];\n\n\tpause_children(effect, transitions, true);\n\n\tvar fn = () => {\n\t\tif (destroy) destroy_effect(effect);\n\t\tif (callback) callback();\n\t};\n\n\tvar remaining = transitions.length;\n\tif (remaining > 0) {\n\t\tvar check = () => --remaining \|\| fn();\n\t\tfor (var transition of transitions) {\n\t\t\ttransition.out(check);\n\t\t}\n\t} else {\n\t\tfn();\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {TransitionManager[]} transitions\n * @param {boolean} local\n /\nfunction pause_children(effect, transitions, local) {\n\tif ((effect.f & INERT) !== 0) return;\n\teffect.f ^= INERT;\n\n\tvar t = effect.nodes && effect.nodes.t;\n\n\tif (t !== null) {\n\t\tfor (const transition of t) {\n\t\t\tif (transition.is_global \|\| local) {\n\t\t\t\ttransitions.push(transition);\n\t\t\t}\n\t\t}\n\t}\n\n\tvar child = effect.first;\n\n\twhile (child !== null) {\n\t\tvar sibling = child.next;\n\n\t\t// If this child is a root effect, then it will become an independent root when its parent\n\t\t// is destroyed, it should therefore not become inert nor partake in transitions.\n\t\tif ((child.f & ROOT_EFFECT) === 0) {\n\t\t\tvar transparent =\n\t\t\t\t(child.f & EFFECT_TRANSPARENT) !== 0 \|\|\n\t\t\t\t// If this is a branch effect without a block effect parent,\n\t\t\t\t// it means the parent block effect was pruned. In that case,\n\t\t\t\t// transparency information was transferred to the branch effect.\n\t\t\t\t((child.f & BRANCH_EFFECT) !== 0 && (effect.f & BLOCK_EFFECT) !== 0);\n\t\t\t// TODO we don't need to call pause_children recursively with a linked list in place\n\t\t\t// it's slightly more involved though as we have to account for `transparent` changing\n\t\t\t// through the tree.\n\t\t\tpause_children(child, transitions, transparent ? local : false);\n\t\t}\n\n\t\tchild = sibling;\n\t}\n}\n\n/\n The opposite of `pause_effect`. We call this if (for example)\n * `x` becomes falsy then truthy: `{#if x}...{/if}`\n * @param {Effect} effect\n /\nexport function resume_effect(effect) {\n\tresume_children(effect, true);\n}\n\n/\n @param {Effect} effect\n * @param {boolean} local\n /\nfunction resume_children(effect, local) {\n\tif ((effect.f & INERT) === 0) return;\n\teffect.f ^= INERT;\n\n\t// If a dependency of this effect changed while it was paused,\n\t// schedule the effect to update. we don't use `is_dirty`\n\t// here because we don't want to eagerly recompute a derived like\n\t// `{#if foo}{foo.bar()}{/if}` if `foo` is now `undefined\n\tif ((effect.f & CLEAN) === 0) {\n\t\tset_signal_status(effect, DIRTY);\n\t\tBatch.ensure().schedule(effect); // Assumption: This happens during the commit phase of the batch, causing another flush, but it's safe\n\t}\n\n\tvar child = effect.first;\n\n\twhile (child !== null) {\n\t\tvar sibling = child.next;\n\t\tvar transparent = (child.f & EFFECT_TRANSPARENT) !== 0 \|\| (child.f & BRANCH_EFFECT) !== 0;\n\t\t// TODO we don't need to call resume_children recursively with a linked list in place\n\t\t// it's slightly more involved though as we have to account for `transparent` changing\n\t\t// through the tree.\n\t\tresume_children(child, transparent ? local : false);\n\t\tchild = sibling;\n\t}\n\n\tvar t = effect.nodes && effect.nodes.t;\n\n\tif (t !== null) {\n\t\tfor (const transition of t) {\n\t\t\tif (transition.is_global \|\| local) {\n\t\t\t\ttransition.in();\n\t\t\t}\n\t\t}\n\t}\n}\n\nexport function aborted(effect = /* @type {Effect} / (active_effect)) {\n\treturn (effect.f & DESTROYED) !== 0;\n}\n\n/\n @param {Effect} effect\n * @param {DocumentFragment} fragment\n /\nexport function move_effect(effect, fragment) {\n\tif (!effect.nodes) return;\n\n\t/* @type {TemplateNode \| null} /\n\tvar node = effect.nodes.start;\n\tvar end = effect.nodes.end;\n\n\twhile (node !== null) {\n\t\t/* @type {TemplateNode \| null} /\n\t\tvar next = node === end ? null : get_next_sibling(node);\n\n\t\tfragment.append(node);\n\t\tnode = next;\n\t}\n}\n","/* @import { Derived, Effect, Reaction, Source, Value } from '#client' /\nimport { DEV } from 'esm-env';\nimport { get_descriptors, get_prototype_of, includes, index_of } from '../shared/utils.js';\nimport {\n\tdestroy_block_effect_children,\n\tdestroy_effect_children,\n\teffect_tracking,\n\texecute_effect_teardown\n} from './reactivity/effects.js';\nimport {\n\tDIRTY,\n\tMAYBE_DIRTY,\n\tCLEAN,\n\tDERIVED,\n\tDESTROYED,\n\tBRANCH_EFFECT,\n\tSTATE_SYMBOL,\n\tBLOCK_EFFECT,\n\tROOT_EFFECT,\n\tCONNECTED,\n\tREACTION_IS_UPDATING,\n\tSTALE_REACTION,\n\tERROR_VALUE,\n\tWAS_MARKED,\n\tMANAGED_EFFECT,\n\tREACTION_RAN\n} from './constants.js';\nimport { old_values } from './reactivity/sources.js';\nimport {\n\treactivity_loss_tracker,\n\texecute_derived,\n\tfreeze_derived_effects,\n\trecent_async_deriveds,\n\tunfreeze_derived_effects,\n\tupdate_derived\n} from './reactivity/deriveds.js';\nimport { async_mode_flag, tracing_mode_flag } from '../flags/index.js';\nimport { tracing_expressions } from './dev/tracing.js';\nimport { get_error } from '../shared/dev.js';\nimport {\n\tcomponent_context,\n\tdev_current_component_function,\n\tdev_stack,\n\tis_runes,\n\tset_component_context,\n\tset_dev_current_component_function,\n\tset_dev_stack\n} from './context.js';\nimport {\n\tBatch,\n\tbatch_values,\n\tcurrent_batch,\n\tflushSync,\n\tschedule_effect\n} from './reactivity/batch.js';\nimport { handle_error } from './error-handling.js';\nimport { UNINITIALIZED } from '../../constants.js';\nimport { captured_signals } from './legacy.js';\nimport { without_reactive_context } from './dom/elements/bindings/shared.js';\nimport { set_signal_status, update_derived_status } from './reactivity/status.js';\nimport as w from './warnings.js';\n\nlet is_updating_effect = false;\n\nexport let is_destroying_effect = false;\n\n/** @param {boolean} value /\nexport function set_is_destroying_effect(value) {\n\tis_destroying_effect = value;\n}\n\n/* @type {null \| Reaction} /\nexport let active_reaction = null;\n\nexport let untracking = false;\n\n/* @param {null \| Reaction} reaction /\nexport function set_active_reaction(reaction) {\n\tactive_reaction = reaction;\n}\n\n/* @type {null \| Effect} /\nexport let active_effect = null;\n\n/* @param {null \| Effect} effect /\nexport function set_active_effect(effect) {\n\tactive_effect = effect;\n}\n\n/\n When sources are created within a reaction, reading and writing\n * them within that reaction should not cause a re-run\n * @type {null \| Source[]}\n /\nexport let current_sources = null;\n\n/* @param {Value} value /\nexport function push_reaction_value(value) {\n\tif (active_reaction !== null && (!async_mode_flag \|\| (active_reaction.f & DERIVED) !== 0)) {\n\t\tif (current_sources === null) {\n\t\t\tcurrent_sources = [value];\n\t\t} else {\n\t\t\tcurrent_sources.push(value);\n\t\t}\n\t}\n}\n\n/\n The dependencies of the reaction that is currently being executed. In many cases,\n * the dependencies are unchanged between runs, and so this will be `null` unless\n * and until a new dependency is accessed — we track this via `skipped_deps`\n * @type {null \| Value[]}\n /\nexport let new_deps = null;\n\nexport let skipped_deps = 0;\n\n/\n Tracks writes that the effect it's executed in doesn't listen to yet,\n * so that the dependency can be added to the effect later on if it then reads it\n * @type {null \| Source[]}\n /\nexport let untracked_writes = null;\n\n/* @param {null \| Source[]} value /\nexport function set_untracked_writes(value) {\n\tuntracked_writes = value;\n}\n\n/\n @type {number} Used by sources and deriveds for handling updates.\n * Version starts from 1 so that unowned deriveds differentiate between a created effect and a run one for tracing\n /\nexport let write_version = 1;\n\n/ @type {number} Used to version each read of a source of derived to avoid duplicating depedencies inside a reaction /\nlet read_version = 0;\n\nexport let update_version = read_version;\n\n/* @param {number} value /\nexport function set_update_version(value) {\n\tupdate_version = value;\n}\n\nexport function increment_write_version() {\n\treturn ++write_version;\n}\n\n/\n Determines whether a derived or effect is dirty.\n * If it is MAYBE_DIRTY, will set the status to CLEAN\n * @param {Reaction} reaction\n * @returns {boolean}\n /\nexport function is_dirty(reaction) {\n\tvar flags = reaction.f;\n\n\tif ((flags & DIRTY) !== 0) {\n\t\treturn true;\n\t}\n\n\tif (flags & DERIVED) {\n\t\treaction.f &= ~WAS_MARKED;\n\t}\n\n\tif ((flags & MAYBE_DIRTY) !== 0) {\n\t\tvar dependencies = /* @type {Value[]} / (reaction.deps);\n\t\tvar length = dependencies.length;\n\n\t\tfor (var i = 0; i < length; i++) {\n\t\t\tvar dependency = dependencies[i];\n\n\t\t\tif (is_dirty(/* @type {Derived} / (dependency))) {\n\t\t\t\tupdate_derived(/* @type {Derived} / (dependency));\n\t\t\t}\n\n\t\t\tif (dependency.wv > reaction.wv) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tif (\n\t\t\t(flags & CONNECTED) !== 0 &&\n\t\t\t// During time traveling we don't want to reset the status so that\n\t\t\t// traversal of the graph in the other batches still happens\n\t\t\tbatch_values === null\n\t\t) {\n\t\t\tset_signal_status(reaction, CLEAN);\n\t\t}\n\t}\n\n\treturn false;\n}\n\n/\n @param {Value} signal\n * @param {Effect} effect\n * @param {boolean} [root]\n /\nfunction schedule_possible_effect_self_invalidation(signal, effect, root = true) {\n\tvar reactions = signal.reactions;\n\tif (reactions === null) return;\n\n\tif (!async_mode_flag && current_sources !== null && includes.call(current_sources, signal)) {\n\t\treturn;\n\t}\n\n\tfor (var i = 0; i < reactions.length; i++) {\n\t\tvar reaction = reactions[i];\n\n\t\tif ((reaction.f & DERIVED) !== 0) {\n\t\t\tschedule_possible_effect_self_invalidation(/* @type {Derived} / (reaction), effect, false);\n\t\t} else if (effect === reaction) {\n\t\t\tif (root) {\n\t\t\t\tset_signal_status(reaction, DIRTY);\n\t\t\t} else if ((reaction.f & CLEAN) !== 0) {\n\t\t\t\tset_signal_status(reaction, MAYBE_DIRTY);\n\t\t\t}\n\t\t\tschedule_effect(/* @type {Effect} / (reaction));\n\t\t}\n\t}\n}\n\n/* @param {Reaction} reaction /\nexport function update_reaction(reaction) {\n\tvar previous_deps = new_deps;\n\tvar previous_skipped_deps = skipped_deps;\n\tvar previous_untracked_writes = untracked_writes;\n\tvar previous_reaction = active_reaction;\n\tvar previous_sources = current_sources;\n\tvar previous_component_context = component_context;\n\tvar previous_untracking = untracking;\n\tvar previous_update_version = update_version;\n\n\tvar flags = reaction.f;\n\n\tnew_deps = /* @type {null \| Value[]} / (null);\n\tskipped_deps = 0;\n\tuntracked_writes = null;\n\tactive_reaction = (flags & (BRANCH_EFFECT \| ROOT_EFFECT)) === 0 ? reaction : null;\n\n\tcurrent_sources = null;\n\tset_component_context(reaction.ctx);\n\tuntracking = false;\n\tupdate_version = ++read_version;\n\n\tif (reaction.ac !== null) {\n\t\twithout_reactive_context(() => {\n\t\t\t/* @type {AbortController} / (reaction.ac).abort(STALE_REACTION);\n\t\t});\n\n\t\treaction.ac = null;\n\t}\n\n\ttry {\n\t\treaction.f \|= REACTION_IS_UPDATING;\n\t\tvar fn = /* @type {Function} / (reaction.fn);\n\t\tvar result = fn();\n\t\treaction.f \|= REACTION_RAN;\n\t\tvar deps = reaction.deps;\n\n\t\t// Don't remove reactions during fork;\n\t\t// they must remain for when fork is discarded\n\t\tvar is_fork = current_batch?.is_fork;\n\n\t\tif (new_deps !== null) {\n\t\t\tvar i;\n\n\t\t\tif (!is_fork) {\n\t\t\t\tremove_reactions(reaction, skipped_deps);\n\t\t\t}\n\n\t\t\tif (deps !== null && skipped_deps > 0) {\n\t\t\t\tdeps.length = skipped_deps + new_deps.length;\n\t\t\t\tfor (i = 0; i < new_deps.length; i++) {\n\t\t\t\t\tdeps[skipped_deps + i] = new_deps[i];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\treaction.deps = deps = new_deps;\n\t\t\t}\n\n\t\t\tif (effect_tracking() && (reaction.f & CONNECTED) !== 0) {\n\t\t\t\tfor (i = skipped_deps; i < deps.length; i++) {\n\t\t\t\t\t(deps[i].reactions ??= []).push(reaction);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (!is_fork && deps !== null && skipped_deps < deps.length) {\n\t\t\tremove_reactions(reaction, skipped_deps);\n\t\t\tdeps.length = skipped_deps;\n\t\t}\n\n\t\t// If we're inside an effect and we have untracked writes, then we need to\n\t\t// ensure that if any of those untracked writes result in re-invalidation\n\t\t// of the current effect, then that happens accordingly\n\t\tif (\n\t\t\tis_runes() &&\n\t\t\tuntracked_writes !== null &&\n\t\t\t!untracking &&\n\t\t\tdeps !== null &&\n\t\t\t(reaction.f & (DERIVED \| MAYBE_DIRTY \| DIRTY)) === 0\n\t\t) {\n\t\t\tfor (i = 0; i < /* @type {Source[]} / (untracked_writes).length; i++) {\n\t\t\t\tschedule_possible_effect_self_invalidation(\n\t\t\t\t\tuntracked_writes[i],\n\t\t\t\t\t/* @type {Effect} / (reaction)\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\t// If we are returning to an previous reaction then\n\t\t// we need to increment the read version to ensure that\n\t\t// any dependencies in this reaction aren't marked with\n\t\t// the same version\n\t\tif (previous_reaction !== null && previous_reaction !== reaction) {\n\t\t\tread_version++;\n\n\t\t\t// update the `rv` of the previous reaction's deps — both existing and new —\n\t\t\t// so that they are not added again\n\t\t\tif (previous_reaction.deps !== null) {\n\t\t\t\tfor (let i = 0; i < previous_skipped_deps; i += 1) {\n\t\t\t\t\tprevious_reaction.deps[i].rv = read_version;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (previous_deps !== null) {\n\t\t\t\tfor (const dep of previous_deps) {\n\t\t\t\t\tdep.rv = read_version;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (untracked_writes !== null) {\n\t\t\t\tif (previous_untracked_writes === null) {\n\t\t\t\t\tprevious_untracked_writes = untracked_writes;\n\t\t\t\t} else {\n\t\t\t\t\tprevious_untracked_writes.push(.../* @type {Source[]} / (untracked_writes));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif ((reaction.f & ERROR_VALUE) !== 0) {\n\t\t\treaction.f ^= ERROR_VALUE;\n\t\t}\n\n\t\treturn result;\n\t} catch (error) {\n\t\treturn handle_error(error);\n\t} finally {\n\t\treaction.f ^= REACTION_IS_UPDATING;\n\t\tnew_deps = previous_deps;\n\t\tskipped_deps = previous_skipped_deps;\n\t\tuntracked_writes = previous_untracked_writes;\n\t\tactive_reaction = previous_reaction;\n\t\tcurrent_sources = previous_sources;\n\t\tset_component_context(previous_component_context);\n\t\tuntracking = previous_untracking;\n\t\tupdate_version = previous_update_version;\n\t}\n}\n\n/\n @template V\n * @param {Reaction} signal\n * @param {Value<V>} dependency\n * @returns {void}\n /\nfunction remove_reaction(signal, dependency) {\n\tlet reactions = dependency.reactions;\n\tif (reactions !== null) {\n\t\tvar index = index_of.call(reactions, signal);\n\t\tif (index !== -1) {\n\t\t\tvar new_length = reactions.length - 1;\n\t\t\tif (new_length === 0) {\n\t\t\t\treactions = dependency.reactions = null;\n\t\t\t} else {\n\t\t\t\t// Swap with last element and then remove.\n\t\t\t\treactions[index] = reactions[new_length];\n\t\t\t\treactions.pop();\n\t\t\t}\n\t\t}\n\t}\n\n\t// If the derived has no reactions, then we can disconnect it from the graph,\n\t// allowing it to either reconnect in the future, or be GC'd by the VM.\n\tif (\n\t\treactions === null &&\n\t\t(dependency.f & DERIVED) !== 0 &&\n\t\t// Destroying a child effect while updating a parent effect can cause a dependency to appear\n\t\t// to be unused, when in fact it is used by the currently-updating parent. Checking `new_deps`\n\t\t// allows us to skip the expensive work of disconnecting and immediately reconnecting it\n\t\t(new_deps === null \|\| !includes.call(new_deps, dependency))\n\t) {\n\t\tvar derived = /* @type {Derived} / (dependency);\n\n\t\t// If we are working with a derived that is owned by an effect, then mark it as being\n\t\t// disconnected and remove the mark flag, as it cannot be reliably removed otherwise\n\t\tif ((derived.f & CONNECTED) !== 0) {\n\t\t\tderived.f ^= CONNECTED;\n\t\t\tderived.f &= ~WAS_MARKED;\n\t\t}\n\n\t\t// In a fork it's possible that a derived is executed and gets reactions, then commits, but is\n\t\t// never re-executed. This is possible when the derived is only executed once in the context\n\t\t// of a new branch which happens before fork.commit() runs. In this case, the derived still has\n\t\t// UNINITIALIZED as its value, and then when it's loosing its reactions we need to ensure it stays\n\t\t// DIRTY so it is reexecuted once someone wants its value again.\n\t\tif (derived.v !== UNINITIALIZED) {\n\t\t\tupdate_derived_status(derived);\n\t\t}\n\n\t\t// freeze any effects inside this derived\n\t\tfreeze_derived_effects(derived);\n\n\t\t// Disconnect any reactions owned by this reaction\n\t\tremove_reactions(derived, 0);\n\t}\n}\n\n/\n @param {Reaction} signal\n * @param {number} start_index\n * @returns {void}\n /\nexport function remove_reactions(signal, start_index) {\n\tvar dependencies = signal.deps;\n\tif (dependencies === null) return;\n\n\tfor (var i = start_index; i < dependencies.length; i++) {\n\t\tremove_reaction(signal, dependencies[i]);\n\t}\n}\n\n/\n @param {Effect} effect\n * @returns {void}\n /\nexport function update_effect(effect) {\n\tvar flags = effect.f;\n\n\tif ((flags & DESTROYED) !== 0) {\n\t\treturn;\n\t}\n\n\tset_signal_status(effect, CLEAN);\n\n\tvar previous_effect = active_effect;\n\tvar was_updating_effect = is_updating_effect;\n\n\tactive_effect = effect;\n\tis_updating_effect = true;\n\n\tif (DEV) {\n\t\tvar previous_component_fn = dev_current_component_function;\n\t\tset_dev_current_component_function(effect.component_function);\n\t\tvar previous_stack = /* @type {any} / (dev_stack);\n\t\t// only block effects have a dev stack, keep the current one otherwise\n\t\tset_dev_stack(effect.dev_stack ?? dev_stack);\n\t}\n\n\ttry {\n\t\tif ((flags & (BLOCK_EFFECT \| MANAGED_EFFECT)) !== 0) {\n\t\t\tdestroy_block_effect_children(effect);\n\t\t} else {\n\t\t\tdestroy_effect_children(effect);\n\t\t}\n\n\t\texecute_effect_teardown(effect);\n\t\tvar teardown = update_reaction(effect);\n\t\teffect.teardown = typeof teardown === 'function' ? teardown : null;\n\t\teffect.wv = write_version;\n\n\t\t// In DEV, increment versions of any sources that were written to during the effect,\n\t\t// so that they are correctly marked as dirty when the effect re-runs\n\t\tif (DEV && tracing_mode_flag && (effect.f & DIRTY) !== 0 && effect.deps !== null) {\n\t\t\tfor (var dep of effect.deps) {\n\t\t\t\tif (dep.set_during_effect) {\n\t\t\t\t\tdep.wv = increment_write_version();\n\t\t\t\t\tdep.set_during_effect = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} finally {\n\t\tis_updating_effect = was_updating_effect;\n\t\tactive_effect = previous_effect;\n\n\t\tif (DEV) {\n\t\t\tset_dev_current_component_function(previous_component_fn);\n\t\t\tset_dev_stack(previous_stack);\n\t\t}\n\t}\n}\n\n/\n Returns a promise that resolves once any pending state changes have been applied.\n * @returns {Promise<void>}\n /\nexport async function tick() {\n\tif (async_mode_flag) {\n\t\treturn new Promise((f) => {\n\t\t\t// Race them against each other - in almost all cases requestAnimationFrame will fire first,\n\t\t\t// but e.g. in case the window is not focused or a view transition happens, requestAnimationFrame\n\t\t\t// will be delayed and setTimeout helps us resolve fast enough in that case\n\t\t\trequestAnimationFrame(() => f());\n\t\t\tsetTimeout(() => f());\n\t\t});\n\t}\n\n\tawait Promise.resolve();\n\n\t// By calling flushSync we guarantee that any pending state changes are applied after one tick.\n\t// TODO look into whether we can make flushing subsequent updates synchronously in the future.\n\tflushSync();\n}\n\n/\n Returns a promise that resolves once any state changes, and asynchronous work resulting from them,\n * have resolved and the DOM has been updated\n * @returns {Promise<void>}\n * @since 5.36\n /\nexport function settled() {\n\treturn Batch.ensure().settled();\n}\n\n/\n @template V\n * @param {Value<V>} signal\n * @returns {V}\n /\nexport function get(signal) {\n\tvar flags = signal.f;\n\tvar is_derived = (flags & DERIVED) !== 0;\n\n\tcaptured_signals?.add(signal);\n\n\t// Register the dependency on the current reaction signal.\n\tif (active_reaction !== null && !untracking) {\n\t\t// if we're in a derived that is being read inside an _async_ derived,\n\t\t// it's possible that the effect was already destroyed. In this case,\n\t\t// we don't add the dependency, because that would create a memory leak\n\t\tvar destroyed = active_effect !== null && (active_effect.f & DESTROYED) !== 0;\n\n\t\tif (!destroyed && (current_sources === null \|\| !includes.call(current_sources, signal))) {\n\t\t\tvar deps = active_reaction.deps;\n\n\t\t\tif ((active_reaction.f & REACTION_IS_UPDATING) !== 0) {\n\t\t\t\t// we're in the effect init/update cycle\n\t\t\t\tif (signal.rv < read_version) {\n\t\t\t\t\tsignal.rv = read_version;\n\n\t\t\t\t\t// If the signal is accessing the same dependencies in the same\n\t\t\t\t\t// order as it did last time, increment `skipped_deps`\n\t\t\t\t\t// rather than updating `new_deps`, which creates GC cost\n\t\t\t\t\tif (new_deps === null && deps !== null && deps[skipped_deps] === signal) {\n\t\t\t\t\t\tskipped_deps++;\n\t\t\t\t\t} else if (new_deps === null) {\n\t\t\t\t\t\tnew_deps = [signal];\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnew_deps.push(signal);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// We're adding a dependency outside the init/update cycle (i.e. after an `await`).\n\t\t\t\t// We have to deduplicate deps/reactions in this case or remove_reactions could\n\t\t\t\t// disconnect deps/reactions that are actually still in use (if skip_deps says\n\t\t\t\t// \"disconnect all after this index\" and some of the signals are also present in\n\t\t\t\t// list prior to the cutoff index, i.e. that should be kept).\n\t\t\t\tactive_reaction.deps ??= [];\n\t\t\t\tif (!includes.call(active_reaction.deps, signal)) {\n\t\t\t\t\tactive_reaction.deps.push(signal);\n\t\t\t\t}\n\n\t\t\t\tvar reactions = signal.reactions;\n\n\t\t\t\tif (reactions === null) {\n\t\t\t\t\tsignal.reactions = [active_reaction];\n\t\t\t\t} else if (!includes.call(reactions, active_reaction)) {\n\t\t\t\t\treactions.push(active_reaction);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (DEV) {\n\t\tif (\n\t\t\t!untracking &&\n\t\t\treactivity_loss_tracker &&\n\t\t\t!reactivity_loss_tracker.warned &&\n\t\t\t(reactivity_loss_tracker.effect.f & REACTION_IS_UPDATING) === 0 &&\n\t\t\t!reactivity_loss_tracker.effect_deps.has(signal)\n\t\t) {\n\t\t\treactivity_loss_tracker.warned = true;\n\n\t\t\tw.await_reactivity_loss(/* @type {string} / (signal.label));\n\n\t\t\tvar trace = get_error('traced at');\n\t\t\t// eslint-disable-next-line no-console\n\t\t\tif (trace) console.warn(trace);\n\t\t}\n\n\t\trecent_async_deriveds.delete(signal);\n\n\t\tif (\n\t\t\ttracing_mode_flag &&\n\t\t\t!untracking &&\n\t\t\ttracing_expressions !== null &&\n\t\t\tactive_reaction !== null &&\n\t\t\ttracing_expressions.reaction === active_reaction\n\t\t) {\n\t\t\t// Used when mapping state between special blocks like `each`\n\t\t\tif (signal.trace) {\n\t\t\t\tsignal.trace();\n\t\t\t} else {\n\t\t\t\ttrace = get_error('traced at');\n\n\t\t\t\tif (trace) {\n\t\t\t\t\tvar entry = tracing_expressions.entries.get(signal);\n\n\t\t\t\t\tif (entry === undefined) {\n\t\t\t\t\t\tentry = { traces: [] };\n\t\t\t\t\t\ttracing_expressions.entries.set(signal, entry);\n\t\t\t\t\t}\n\n\t\t\t\t\tvar last = entry.traces[entry.traces.length - 1];\n\n\t\t\t\t\t// traces can be duplicated, e.g. by `snapshot` invoking both\n\t\t\t\t\t// both `getOwnPropertyDescriptor` and `get` traps at once\n\t\t\t\t\tif (trace.stack !== last?.stack) {\n\t\t\t\t\t\tentry.traces.push(trace);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (is_destroying_effect && old_values.has(signal)) {\n\t\treturn old_values.get(signal);\n\t}\n\n\tif (is_derived) {\n\t\tvar derived = /* @type {Derived} / (signal);\n\n\t\tif (is_destroying_effect) {\n\t\t\tvar value = derived.v;\n\n\t\t\t// if the derived is dirty and has reactions, or depends on the values that just changed, re-execute\n\t\t\t// (a derived can be maybe_dirty due to the effect destroy removing its last reaction)\n\t\t\tif (\n\t\t\t\t((derived.f & CLEAN) === 0 && derived.reactions !== null) \|\|\n\t\t\t\tdepends_on_old_values(derived)\n\t\t\t) {\n\t\t\t\tvalue = execute_derived(derived);\n\t\t\t}\n\n\t\t\told_values.set(derived, value);\n\n\t\t\treturn value;\n\t\t}\n\n\t\t// connect disconnected deriveds if we are reading them inside an effect,\n\t\t// or inside another derived that is already connected\n\t\tvar should_connect =\n\t\t\t(derived.f & CONNECTED) === 0 &&\n\t\t\t!untracking &&\n\t\t\tactive_reaction !== null &&\n\t\t\t(is_updating_effect \|\| (active_reaction.f & CONNECTED) !== 0);\n\n\t\tvar is_new = (derived.f & REACTION_RAN) === 0;\n\n\t\tif (is_dirty(derived)) {\n\t\t\tif (should_connect) {\n\t\t\t\t// set the flag before `update_derived`, so that the derived\n\t\t\t\t// is added as a reaction to its dependencies\n\t\t\t\tderived.f \|= CONNECTED;\n\t\t\t}\n\n\t\t\tupdate_derived(derived);\n\t\t}\n\n\t\tif (should_connect && !is_new) {\n\t\t\tunfreeze_derived_effects(derived);\n\t\t\treconnect(derived);\n\t\t}\n\t}\n\n\tif (batch_values?.has(signal)) {\n\t\treturn batch_values.get(signal);\n\t}\n\n\tif ((signal.f & ERROR_VALUE) !== 0) {\n\t\tthrow signal.v;\n\t}\n\n\treturn signal.v;\n}\n\n/\n (Re)connect a disconnected derived, so that it is notified\n * of changes in `mark_reactions`\n * @param {Derived} derived\n /\nfunction reconnect(derived) {\n\tderived.f \|= CONNECTED;\n\n\tif (derived.deps === null) return;\n\n\tfor (const dep of derived.deps) {\n\t\t(dep.reactions ??= []).push(derived);\n\n\t\tif ((dep.f & DERIVED) !== 0 && (dep.f & CONNECTED) === 0) {\n\t\t\tunfreeze_derived_effects(/* @type {Derived} / (dep));\n\t\t\treconnect(/* @type {Derived} / (dep));\n\t\t}\n\t}\n}\n\n/* @param {Derived} derived /\nfunction depends_on_old_values(derived) {\n\tif (derived.v === UNINITIALIZED) return true; // we don't know, so assume the worst\n\tif (derived.deps === null) return false;\n\n\tfor (const dep of derived.deps) {\n\t\tif (old_values.has(dep)) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif ((dep.f & DERIVED) !== 0 && depends_on_old_values(/* @type {Derived} / (dep))) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n/\n Like `get`, but checks for `undefined`. Used for `var` declarations because they can be accessed before being declared\n * @template V\n * @param {Value<V> \| undefined} signal\n * @returns {V \| undefined}\n /\nexport function safe_get(signal) {\n\treturn signal && get(signal);\n}\n\n/\n When used inside a [`$derived`](https://svelte.dev/docs/svelte/$derived) or [`$effect`](https://svelte.dev/docs/svelte/$effect),\n * any state read inside `fn` will not be treated as a dependency.\n \n ```ts\n * $effect(() => {\n * // this will run when `data` changes, but not when `time` changes\n * save(data, {\n * timestamp: untrack(() => time)\n * });\n * });\n * ```\n * @template T\n * @param {() => T} fn\n * @returns {T}\n /\nexport function untrack(fn) {\n\tvar previous_untracking = untracking;\n\ttry {\n\t\tuntracking = true;\n\t\treturn fn();\n\t} finally {\n\t\tuntracking = previous_untracking;\n\t}\n}\n\n/\n Possibly traverse an object and read all its properties so that they're all reactive in case this is `$state`.\n * Does only check first level of an object for performance reasons (heuristic should be good for 99% of all cases).\n * @param {any} value\n * @returns {void}\n /\nexport function deep_read_state(value) {\n\tif (typeof value !== 'object' \|\| !value \|\| value instanceof EventTarget) {\n\t\treturn;\n\t}\n\n\tif (STATE_SYMBOL in value) {\n\t\tdeep_read(value);\n\t} else if (!Array.isArray(value)) {\n\t\tfor (let key in value) {\n\t\t\tconst prop = value[key];\n\t\t\tif (typeof prop === 'object' && prop && STATE_SYMBOL in prop) {\n\t\t\t\tdeep_read(prop);\n\t\t\t}\n\t\t}\n\t}\n}\n\n/\n Deeply traverse an object and read all its properties\n * so that they're all reactive in case this is `$state`\n * @param {any} value\n * @param {Set<any>} visited\n * @returns {void}\n /\nexport function deep_read(value, visited = new Set()) {\n\tif (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t// We don't want to traverse DOM elements\n\t\t!(value instanceof EventTarget) &&\n\t\t!visited.has(value)\n\t) {\n\t\tvisited.add(value);\n\t\t// When working with a possible SvelteDate, this\n\t\t// will ensure we capture changes to it.\n\t\tif (value instanceof Date) {\n\t\t\tvalue.getTime();\n\t\t}\n\t\tfor (let key in value) {\n\t\t\ttry {\n\t\t\t\tdeep_read(value[key], visited);\n\t\t\t} catch (e) {\n\t\t\t\t// continue\n\t\t\t}\n\t\t}\n\t\tconst proto = get_prototype_of(value);\n\t\tif (\n\t\t\tproto !== Object.prototype &&\n\t\t\tproto !== Array.prototype &&\n\t\t\tproto !== Map.prototype &&\n\t\t\tproto !== Set.prototype &&\n\t\t\tproto !== Date.prototype\n\t\t) {\n\t\t\tconst descriptors = get_descriptors(proto);\n\t\t\tfor (let key in descriptors) {\n\t\t\t\tconst get = descriptors[key].get;\n\t\t\t\tif (get) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tget.call(value);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\t// continue\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n","// red-ui's light/dark choice is the DS Color Scheme axis (DS ADR 0008):\n// `data-color-scheme` carries it, while `data-theme` names the DS Theme\n// direction, which for red-ui is always \"application\".\nexport type Theme = \"light\" \| \"dark\";\n\nexport const DS_THEME = \"application\";\n\n/* Put red-ui's appearance on an element in the DS's attribute vocabulary. /\nexport function applyAppearance(el: HTMLElement, scheme: Theme) {\n el.dataset.theme = DS_THEME;\n el.dataset.density \|\|= \"compact\";\n el.dataset.colorScheme = scheme;\n}\n\n/* The Color Scheme an element (default: the document root) carries. /\nexport function colorSchemeOf(el?: HTMLElement \| null): Theme {\n const target =\n el ?? (typeof document !== \"undefined\" ? document.documentElement : null);\n return target?.dataset.colorScheme === \"dark\" ? \"dark\" : \"light\";\n}\n\nconst STORAGE_KEY = \"red-ui-theme\";\nconst DEFAULT: Theme = \"light\";\n\ninterface ThemeInitOptions {\n target?: HTMLElement \| null;\n persist?: boolean;\n initial?: Theme;\n}\n\nfunction read(\n target: HTMLElement \| null,\n persist: boolean,\n initial?: Theme\n): Theme {\n const scoped = target?.dataset.colorScheme;\n if (scoped === \"dark\" \|\| scoped === \"light\") return scoped;\n if (!persist) return initial ?? DEFAULT;\n if (typeof localStorage === \"undefined\") return initial ?? DEFAULT;\n const v = localStorage.getItem(STORAGE_KEY);\n return v === \"dark\" \|\| v === \"light\" ? v : (initial ?? DEFAULT);\n}\n\nfunction apply(t: Theme, target: HTMLElement \| null) {\n if (target) {\n applyAppearance(target, t);\n return;\n }\n if (typeof document !== \"undefined\")\n applyAppearance(document.documentElement, t);\n}\n\nfunction persist(t: Theme, enabled: boolean) {\n if (!enabled) return;\n if (typeof localStorage === \"undefined\") return;\n localStorage.setItem(STORAGE_KEY, t);\n}\n\nclass ThemeStore {\n current = $state<Theme>(DEFAULT);\n target: HTMLElement \| null = null;\n persistTheme = true;\n\n init(opts: ThemeInitOptions = {}) {\n this.target = opts.target ?? null;\n this.persistTheme = opts.persist ?? true;\n this.current = read(this.target, this.persistTheme, opts.initial);\n apply(this.current, this.target);\n }\n\n set(t: Theme) {\n this.current = t;\n apply(t, this.target);\n persist(t, this.persistTheme);\n }\n\n toggle() {\n this.set(this.current === \"dark\" ? \"light\" : \"dark\");\n }\n}\n\nexport const theme = new ThemeStore();\n","// Single source of truth for \"what version am I\" across the Web/PWA, the\n// Embeddable Lib, and the Tauri desktop webview (which all run this same\n// bundle). Mirrors ../red-skills/src/packages/build-info: the version is\n// injected at build time by Vite `define` (see vite.config.ts /\n// vite.embed.config.ts) from `packages/ui/package.json` — overridable by the\n// `RED_BUILD_VERSION` env the release CI sets from the git tag. Falls back to\n// `0.0.0-dev` for an un-stamped local dev build.\n\ndeclare const __RED_UI_VERSION__: string \| undefined;\ndeclare const __RED_UI_GIT_SHA__: string \| undefined;\ndeclare const __RED_UI_BUILD_TIME__: string \| undefined;\n\nexport interface BuildInfo {\n version: string;\n gitSha: string;\n buildTime: string;\n}\n\nfunction injected(read: () => string \| undefined): string \| undefined {\n try {\n const v = read();\n return typeof v === \"string\" && v.length > 0 ? v : undefined;\n } catch {\n return undefined;\n }\n}\n\nfunction stripTagPrefix(v: string): string {\n return v.startsWith(\"v\") ? v.slice(1) : v;\n}\n\nexport function readBuildInfo(): BuildInfo {\n return {\n version: stripTagPrefix(injected(() => __RED_UI_VERSION__) ?? \"0.0.0-dev\"),\n gitSha: injected(() => __RED_UI_GIT_SHA__) ?? \"unknown\",\n buildTime: injected(() => __RED_UI_BUILD_TIME__) ?? \"unknown\",\n };\n}\n\n/* The resolved app version, e.g. `0.1.1` (or `0.0.0-dev` un-stamped). /\nexport const RED_UI_VERSION: string = readBuildInfo().version;\n","// Server-version capability negotiation (#22). One UI build talks to many\n// reddb server versions: rather than assume every endpoint exists, the UI\n// resolves a capability map for the active connection and HIDES controls the\n// server can't honour (absent, not greyed — the permission-aware rule).\n//\n// Resolution prefers a STABLE server signal (`GET /capabilities`) over\n// inferring from 404s, and FAILS SAFE — any uncertainty resolves to \"not\n// supported\" so a newer UI never assumes a capability a server lacks.\n\n/* The feature flags the UI gates controls on. Extend as features are added. /\nexport interface ServerCapabilities {\n /* Version control (commits / diffs) — `/repo/commits`, `/collections/:n/vcs`. /\n vcs: boolean\n /* Cluster topology + status — `/cluster/status`. /\n clusterStatus: boolean\n /* Per-collection metadata route — `GET /collections/:name`. /\n collectionMetadata: boolean\n /* Server-sent change stream — `/changes/stream`. /\n cdcStream: boolean\n}\n\n/* Fail-safe baseline: nothing is assumed present until proven. /\nexport const EMPTY_SERVER_CAPABILITIES: ServerCapabilities = Object.freeze({\n vcs: false,\n clusterStatus: false,\n collectionMetadata: false,\n cdcStream: false,\n})\n\n/* Shape of the optional stable `/capabilities` signal. /\nexport interface RawCapabilities {\n ok?: boolean\n /* Flat feature names, e.g. [\"vcs\",\"cluster_status\"]. /\n features?: string[]\n /* Or an explicit flag map, e.g. { vcs: true }. /\n capabilities?: Record<string, boolean>\n}\n\n// Server feature names → our capability keys. Several aliases per key so we\n// tolerate naming drift across server versions without a UI release.\nconst FEATURE_ALIASES: Record<string, keyof ServerCapabilities> = {\n vcs: 'vcs',\n versioning: 'vcs',\n version_control: 'vcs',\n cluster: 'clusterStatus',\n cluster_status: 'clusterStatus',\n collection_metadata: 'collectionMetadata',\n collections_metadata: 'collectionMetadata',\n cdc: 'cdcStream',\n changes_stream: 'cdcStream',\n cdc_stream: 'cdcStream',\n}\n\n/\n Build a capability map from the stable `/capabilities` signal. Unknown\n * feature names are ignored (a server advertising features this UI version\n * doesn't model is harmless); known ones flip their flag on. The explicit\n * `capabilities` map, when present, takes precedence over the `features` list.\n /\nexport function capabilitiesFromSignal(raw: RawCapabilities): ServerCapabilities {\n const out: ServerCapabilities = { ...EMPTY_SERVER_CAPABILITIES }\n for (const name of raw.features ?? []) {\n const key = FEATURE_ALIASES[name?.toLowerCase?.() ?? '']\n if (key) out[key] = true\n }\n for (const [name, on] of Object.entries(raw.capabilities ?? {})) {\n const key = FEATURE_ALIASES[name.toLowerCase()]\n if (key) out[key] = on === true\n }\n return out\n}\n","// Real HTTP client for a running reddb instance.\n// Endpoints discovered from reddb/crates/reddb-server/src/server/routing.rs.\n\nimport {\n capabilitiesFromSignal,\n EMPTY_SERVER_CAPABILITIES,\n type RawCapabilities,\n type ServerCapabilities,\n} from \"./server-capabilities\";\nimport type {\n PermissionCheck,\n PermissionDecision,\n PermissionResource,\n} from \"../permission-gate\";\nimport type { ClusterStatus, ReplicationStatus } from \"./cluster-status\";\nimport type { MetricDescriptor, PromResponse } from \"./analytics\";\nimport type { AskResponse, AskOptions } from \"./ask\";\nimport { devConsole, sanitizePayload } from \"./dev-console\";\n\nexport interface QueryRow {\n values: Record<string, unknown>;\n edges?: Record<string, unknown>;\n nodes?: Record<string, unknown>;\n paths?: unknown[];\n vector_results?: Array<{\n id?: number \| string;\n collection?: string;\n distance?: number;\n vector?: number[];\n metadata?: Record<string, unknown>;\n linked_node?: string;\n linked_row?: [string, number];\n }>;\n}\n\nexport interface QueryResult {\n ok: boolean;\n query: string;\n capability?: string;\n engine?: string;\n mode?: string;\n record_count: number;\n result: { columns: string[]; records: QueryRow[] };\n error?: string;\n /* True when this result was assembled from the NDJSON streaming endpoint\n * (`POST /query/stream`) rather than the buffered `POST /query`. /\n streamed?: boolean;\n /* True when streaming stopped at `maxRows` and more rows remained on the\n * server (the cursor was cancelled). Surfaced so the UI never silently\n * drops rows. /\n truncated?: boolean;\n}\n\n/* Result of collecting a read-only SELECT over the NDJSON streaming endpoint. /\nexport interface StreamedQueryResult {\n columns: string[];\n schemaFingerprint?: string;\n rows: Array<Record<string, unknown>>;\n rowCount: number;\n /* Hit the `maxRows` cap with more rows still on the server. /\n truncated: boolean;\n /* Opaque resume token from the `cursor` frame, if one was emitted. /\n cursor?: string;\n}\n\nexport interface CollectionMetadata {\n ok?: boolean;\n name: string;\n kind?: string;\n capability?: string;\n capabilities?: string[];\n schema?: Record<string, unknown>;\n indexes?: Array<Record<string, unknown>>;\n retention?: Record<string, unknown>;\n tenant?: string;\n actions?: Record<string, boolean \| { allowed: boolean; reason?: string }>;\n}\n\nexport interface Stats {\n active_connections: number;\n idle_connections: number;\n started_at_unix_ms: number;\n store: {\n collection_count: number;\n cross_ref_count: number;\n total_entities: number;\n total_memory_bytes: number;\n };\n system: {\n arch: string;\n cpu_cores: number;\n hostname: string;\n os: string;\n pid: number;\n total_memory_bytes: number;\n available_memory_bytes: number;\n };\n kv?: {\n gets: number;\n puts: number;\n deletes: number;\n cas_success: number;\n cas_conflict: number;\n };\n /\n Set by the server when the store is open read-only — e.g. an embedded file\n * already held by an active writer (lock detection is owned by reddb). Absent\n * when the server reports no read-only signal, in which case the UI shows no\n * badge and behaves normally (#23). `read_only_reason` is an optional\n * human-facing explanation for the badge tooltip.\n /\n read_only?: boolean;\n read_only_reason?: string;\n}\n\nexport interface Whoami {\n ok: boolean;\n authenticated: boolean;\n username: string;\n role: string;\n note?: string;\n}\n\nexport interface RedClientOptions {\n headers?: HeadersInit;\n fetch?: typeof fetch;\n}\n\nexport interface AuthUser {\n username: string;\n role?: string;\n created_at?: number;\n last_active?: number;\n mfa?: boolean;\n}\n\nexport interface AuthTenant {\n id?: string;\n name?: string;\n slug?: string;\n role?: string;\n grants?: string[];\n created_at?: number;\n}\n\nexport interface AuthPolicy {\n id?: string;\n name?: string;\n tenant?: string;\n principal?: string;\n resource?: string;\n action?: string;\n effect?: \"allow\" \| \"deny\" \| string;\n description?: string;\n created_at?: number;\n}\n\ninterface AuthCanResponse {\n ok?: boolean;\n results?: Array<Partial<PermissionDecision>>;\n error?: string;\n}\n\nexport interface ChangeEvent {\n lsn: number;\n timestamp: number;\n collection: string;\n kind: string;\n operation: \"insert\" \| \"update\" \| \"delete\" \| \"refresh\";\n rid?: number;\n}\n\nexport interface VcsEnvelope<T> {\n ok: boolean;\n result: T;\n error?: string;\n}\n\nexport interface CollectionVcsState {\n collection: string;\n versioned: boolean;\n}\n\nexport interface VcsAuthor {\n name: string;\n email: string;\n}\n\nexport interface VcsCommit {\n hash: string;\n root_xid?: number;\n parents: string[];\n height?: number;\n author?: VcsAuthor;\n committer?: VcsAuthor;\n message: string;\n timestamp_ms: number;\n signature?: string;\n}\n\nexport interface VcsDiffEntry {\n collection: string;\n entity_id: string;\n change: \"added\" \| \"removed\" \| \"modified\" \| string;\n before?: unknown;\n after?: unknown;\n}\n\nexport interface VcsDiff {\n from: string;\n to: string;\n added: number;\n removed: number;\n modified: number;\n entries: VcsDiffEntry[];\n}\n\nconst unsupportedCollectionMetadata = new Set<string>();\nconst collectionMetadataSupportProbe = new Map<string, Promise<boolean>>();\n\nfunction isUnsupportedCollectionMetadataRoute(e: unknown): boolean {\n const message = e instanceof Error ? e.message : String(e);\n return message.includes(\"route not found: GET /collections/\");\n}\n\n/\n Generalised \"the server doesn't have this route\" check (#22). `json()`\n * throws `<METHOD> <path> → <status> <body>`, so a 404 or a \"route not found\"\n * body both signal an unsupported route. Distinct from auth/5xx/network errors\n * — but capability negotiation treats any probe failure as unsupported\n * (fail safe), so this is only used to tell \"route absent\" from \"signal\n * present\" when reading the stable `/capabilities` endpoint.\n /\nfunction isUnsupportedRoute(e: unknown): boolean {\n const message = e instanceof Error ? e.message : String(e);\n return / → 404\\b/.test(message) \|\| message.includes(\"route not found\");\n}\n\nfunction unsupportedCollectionMetadataError(baseUrl: string): Error {\n return new Error(\n `GET /collections/:name unsupported by this reddb server (${baseUrl})`\n );\n}\n\nfunction isPermissionResource(value: unknown): value is PermissionResource {\n if (!value \|\| typeof value !== \"object\") return false;\n const candidate = value as Partial<PermissionResource>;\n return (\n typeof candidate.kind === \"string\" &&\n candidate.kind.length > 0 &&\n typeof candidate.name === \"string\" &&\n candidate.name.length > 0 &&\n (candidate.tenant === undefined \|\| typeof candidate.tenant === \"string\")\n );\n}\n\n/* One NDJSON frame from `POST /query/stream`. Discriminated by its single key. /\ntype NdjsonFrame =\n \| {\n descriptor: {\n columns: Array<string \| { name: string }>;\n schema_fingerprint?: string;\n };\n }\n \| { cursor: { token: string; snapshot_lsn?: number; resumable?: boolean } }\n \| { row: Record<string, unknown> }\n \| { end: { row_count?: number } }\n \| { cancelled: Record<string, unknown> };\n\n/\n Parse a chunked `application/x-ndjson` body into one frame per line. Buffers\n * across chunk boundaries (a JSON object split over two TCP reads is emitted\n * exactly once, in order) and flushes a trailing newline-less line at EOF.\n /\nasync function parseNdjsonFrames(\n body: ReadableStream<Uint8Array>\n): AsyncGenerator<NdjsonFrame> {\n const reader = body.getReader();\n const decoder = new TextDecoder();\n let buf = \"\";\n try {\n for (;;) {\n const { done, value } = await reader.read();\n if (done) break;\n buf += decoder.decode(value, { stream: true });\n let nl: number;\n while ((nl = buf.indexOf(\"\\n\")) !== -1) {\n const line = buf.slice(0, nl).trim();\n buf = buf.slice(nl + 1);\n if (line) yield JSON.parse(line) as NdjsonFrame;\n }\n }\n const tail = buf.trim();\n if (tail) yield JSON.parse(tail) as NdjsonFrame;\n } finally {\n reader.releaseLock();\n }\n}\n\nconst SELECT_RE = /^\\sselect\\b/i;\n\n/\n Pull a row count out of a parsed response for the developer console (#128).\n * Recognises the `/query` envelope (`record_count`, else the length of\n * `result.records`) and a bare array; returns `undefined` when the shape\n * carries no notion of rows. Purely structural — never throws.\n /\nexport function extractRowCount(data: unknown): number \| undefined {\n if (Array.isArray(data)) return data.length;\n if (data && typeof data === \"object\") {\n const d = data as {\n record_count?: unknown;\n result?: { records?: unknown };\n };\n if (typeof d.record_count === \"number\") return d.record_count;\n if (Array.isArray(d.result?.records)) return d.result.records.length;\n }\n return undefined;\n}\n\n/\n Extract a human-readable message from any thrown value. Tauri's `invoke` and\n * the HTTP plugin reject with plain strings or bare objects (not `Error`), so\n * `(e as Error).message` is often `undefined` — this never returns that.\n /\nexport function errorText(e: unknown): string {\n if (e instanceof Error) return e.message \|\| String(e);\n if (typeof e === \"string\") return e;\n if (e && typeof e === \"object\") {\n const m = (e as { message?: unknown }).message;\n if (typeof m === \"string\" && m) return m;\n try {\n const s = JSON.stringify(e);\n if (s && s !== \"{}\") return s;\n } catch {\n / circular — fall through /\n }\n }\n return String(e);\n}\n\n/\n Run a query, preferring the bounded-memory NDJSON stream for a plain SELECT\n * and falling back to the buffered `POST /query` for everything else — and for\n * any streaming failure (network, a non-SELECT 400, or an older server with no\n * `/query/stream` route returning 404). The fallback makes this strictly safe:\n * behaviour is identical to {@link RedClient.query} unless the server supports\n * streaming AND the statement is a SELECT, in which case the server streams\n * rows instead of buffering the whole result set.\n /\nexport async function runQueryPreferStream(\n client: Pick<RedClient, \"query\" \| \"queryStreamCollect\">,\n sql: string,\n opts: { maxRows?: number; signal?: AbortSignal } = {}\n): Promise<QueryResult> {\n const queryOpts = opts.signal ? { signal: opts.signal } : undefined;\n if (!SELECT_RE.test(sql))\n return queryOpts ? client.query(sql, queryOpts) : client.query(sql);\n try {\n const s = await client.queryStreamCollect(sql, opts);\n return {\n ok: true,\n query: sql,\n record_count: s.rowCount,\n result: {\n columns: s.columns,\n records: s.rows.map((row) =>\n row.values &&\n typeof row.values === \"object\" &&\n (\"nodes\" in row \|\|\n \"edges\" in row \|\|\n \"paths\" in row \|\|\n \"vector_results\" in row)\n ? (row as unknown as QueryRow)\n : { values: row }\n ),\n },\n streamed: true,\n truncated: s.truncated,\n };\n } catch (e) {\n if (\n opts.signal?.aborted \|\|\n (e instanceof Error && e.name === \"AbortError\")\n ) {\n throw e;\n }\n return queryOpts ? client.query(sql, queryOpts) : client.query(sql);\n }\n}\n\nexport class RedClient {\n readonly baseUrl: string;\n private readonly headers: HeadersInit \| undefined;\n private readonly fetcher: typeof fetch;\n\n constructor(baseUrl: string, opts: RedClientOptions = {}) {\n this.baseUrl = baseUrl.replace(/\\/$/, \"\");\n this.headers = opts.headers;\n this.fetcher = opts.fetch ?? globalThis.fetch.bind(globalThis);\n }\n\n private async json<T>(path: string, init?: RequestInit): Promise<T> {\n const url = `${this.baseUrl}${path}`;\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n };\n Object.assign(headers, this.headers as Record<string, string> \| undefined);\n Object.assign(headers, init?.headers as Record<string, string> \| undefined);\n\n // Developer console instrumentation (#128). Every HTTP call the client\n // makes is timed and logged from this single seam, so every Surface is\n // covered without touching each caller. The request body is sanitized\n // before it lands in an entry — a copy action can never leak a secret.\n const verb = init?.method ?? \"GET\";\n const startedAt = Date.now();\n const start = performance.now();\n const payload = sanitizePayload(init?.body);\n const elapsed = () => Math.round(performance.now() - start);\n\n let res: Response;\n try {\n res = await this.fetcher(url, { ...init, headers });\n } catch (e) {\n devConsole.record({\n kind: \"http\",\n verb,\n target: path,\n startedAt,\n durationMs: elapsed(),\n ok: false,\n payload,\n error: errorText(e),\n });\n throw e;\n }\n\n if (!res.ok) {\n const body = await res.text().catch(() => \"\");\n const message = `${verb} ${path} → ${res.status} ${body.slice(0, 200)}`;\n devConsole.record({\n kind: \"http\",\n verb,\n target: path,\n startedAt,\n durationMs: elapsed(),\n ok: false,\n status: res.status,\n payload,\n error: message,\n });\n throw new Error(message);\n }\n\n const data = (await res.json()) as T;\n const rowCount = extractRowCount(data);\n devConsole.record({\n // A response carrying a row count is a query round-trip; everything else\n // is a plain HTTP call. This is how `/query` entries mark themselves.\n kind: rowCount === undefined ? \"http\" : \"query\",\n verb,\n target: path,\n startedAt,\n durationMs: elapsed(),\n ok: true,\n status: res.status,\n ...(rowCount === undefined ? {} : { rowCount }),\n payload,\n });\n return data;\n }\n\n /* Exchange credentials for a session token. Neither value is persisted. /\n async login(username: string, password: string): Promise<string> {\n const endpoint = new URL(this.baseUrl);\n if (\n endpoint.username \|\|\n endpoint.password \|\|\n endpoint.search \|\|\n endpoint.hash \|\|\n (endpoint.protocol !== \"https:\" &&\n !(\n endpoint.protocol === \"http:\" &&\n [\"localhost\", \"127.0.0.1\", \"[::1]\"].includes(endpoint.hostname)\n ))\n ) {\n throw new Error(\"Use HTTPS to sign in to a remote database.\");\n }\n // Bypass query instrumentation: credentials and the session response must\n // never enter the developer console, including an authentication failure.\n const response = await this.fetcher(`${this.baseUrl}/auth/login`, {\n method: \"POST\",\n headers: { \"Content-Type\": \"application/json\" },\n credentials: \"omit\",\n redirect: \"error\",\n body: JSON.stringify({ username, password }),\n });\n if (!response.ok)\n throw new Error(\n \"Database sign-in failed. Check your credentials and try again.\"\n );\n const session = await response.json();\n if (\n session.ok !== true \|\|\n typeof session.token !== \"string\" \|\|\n !session.token\n ) {\n throw new Error(\"The database did not return a session token.\");\n }\n return session.token;\n }\n\n async stats(): Promise<Stats> {\n return this.json<Stats>(\"/stats\");\n }\n\n async clusterStatus(): Promise<ClusterStatus> {\n return this.json<ClusterStatus>(\"/cluster/status\");\n }\n\n /\n List registered metric descriptors from the typed `red.metrics`\n * projection (reddb #747). One row per `CREATE METRIC`, carrying the\n * `kind` (counter\|gauge\|histogram\|ratio\|derived) the UI uses to auto-select\n * a chart. Returns `[]` when the server has no analytics surface.\n /\n async metricsCatalog(): Promise<MetricDescriptor[]> {\n const r = await this.query(\n \"SELECT path, kind, role, unit, supports_prometheus_query, created_at_ms FROM red.metrics\"\n );\n return r.result.records.map((rec) => {\n const v = rec.values;\n return {\n path: String(v.path ?? \"\"),\n kind: v.kind as MetricDescriptor[\"kind\"],\n role: String(v.role ?? \"metric\"),\n unit: (v.unit as string \| null) ?? null,\n supports_prometheus_query: v.supports_prometheus_query !== false,\n created_at_ms:\n typeof v.created_at_ms === \"number\" ? v.created_at_ms : undefined,\n } satisfies MetricDescriptor;\n });\n }\n\n /\n Prometheus instant query (`GET /api/v1/query`). Returns the raw\n * Prometheus-shaped envelope; callers normalise with `parsePromVector`.\n /\n async promQuery(query: string, time?: number): Promise<PromResponse> {\n const qs = new URLSearchParams({ query });\n if (time !== undefined) qs.set(\"time\", String(time));\n return this.json<PromResponse>(`/api/v1/query?${qs}`);\n }\n\n /\n Prometheus range query (`GET /api/v1/query_range`). `start`/`end` are unix\n * seconds, `step` is the resolution in seconds. Normalise with\n * `parsePromMatrix`.\n /\n async promQueryRange(\n query: string,\n start: number,\n end: number,\n step: number\n ): Promise<PromResponse> {\n const qs = new URLSearchParams({\n query,\n start: String(start),\n end: String(end),\n step: String(step),\n });\n return this.json<PromResponse>(`/api/v1/query_range?${qs}`);\n }\n\n async ping(): Promise<\n { ok: true; rtt_ms: number } \| { ok: false; error: string }\n > {\n const start = performance.now();\n try {\n await this.json(\"/stats\");\n return { ok: true, rtt_ms: Math.round(performance.now() - start) };\n } catch (e) {\n return { ok: false, error: errorText(e) };\n }\n }\n\n /\n Resolve the server's capability map (#22). Prefers the stable\n * `/capabilities` signal; when that route is absent (older server), infers\n * from lightweight, side-effect-free GET probes. Any non-404 failure\n * (network, auth, 5xx) fails safe to the empty map, so the UI hides controls\n * rather than showing ones the server can't honour.\n /\n async capabilities(): Promise<ServerCapabilities> {\n try {\n const raw = await this.json<RawCapabilities>(\"/capabilities\");\n return capabilitiesFromSignal(raw);\n } catch (e) {\n // Only an absent route falls through to inference; anything else (a\n // flaky network, an auth wall, a 5xx) hides everything.\n if (!isUnsupportedRoute(e)) return { ...EMPTY_SERVER_CAPABILITIES };\n }\n const [vcs, clusterStatus] = await Promise.all([\n this.probeGet(\"/repo/commits?limit=1\"),\n this.probeGet(\"/cluster/status\"),\n ]);\n return { ...EMPTY_SERVER_CAPABILITIES, vcs, clusterStatus };\n }\n\n /* True iff a GET to `path` succeeds; any failure (404/auth/5xx/network) is\n * treated as unsupported — the fail-safe-to-hide rule of #22. /\n private async probeGet(path: string): Promise<boolean> {\n try {\n await this.json(path);\n return true;\n } catch {\n return false;\n }\n }\n\n async collections(): Promise<string[]> {\n const r = await this.json<{ collections: string[] }>(\"/collections\");\n return r.collections;\n }\n\n async collection(name: string): Promise<CollectionMetadata> {\n if (unsupportedCollectionMetadata.has(this.baseUrl)) {\n throw unsupportedCollectionMetadataError(this.baseUrl);\n }\n\n const path = `/collections/${encodeURIComponent(name)}`;\n const inFlightProbe = collectionMetadataSupportProbe.get(this.baseUrl);\n if (inFlightProbe) {\n const supported = await inFlightProbe;\n if (!supported) throw unsupportedCollectionMetadataError(this.baseUrl);\n return this.json<CollectionMetadata>(path);\n }\n\n let resolveProbe: (supported: boolean) => void;\n const probe = new Promise<boolean>((resolve) => {\n resolveProbe = resolve;\n });\n collectionMetadataSupportProbe.set(this.baseUrl, probe);\n\n try {\n const metadata = await this.json<CollectionMetadata>(path);\n resolveProbe!(true);\n return metadata;\n } catch (e) {\n if (isUnsupportedCollectionMetadataRoute(e)) {\n unsupportedCollectionMetadata.add(this.baseUrl);\n resolveProbe!(false);\n } else {\n resolveProbe!(true);\n }\n throw e;\n } finally {\n collectionMetadataSupportProbe.delete(this.baseUrl);\n }\n }\n\n async createCollection(name: string): Promise<void> {\n await this.json(\"/collections\", {\n method: \"POST\",\n body: JSON.stringify({ name }),\n });\n }\n\n async insertDocument(\n collection: string,\n doc: Record<string, unknown>\n ): Promise<{ id: number }> {\n return this.json<{ id: number }>(\n `/collections/${encodeURIComponent(collection)}/documents`,\n {\n method: \"POST\",\n body: JSON.stringify(doc),\n }\n );\n }\n\n async query(\n query: string,\n opts: { signal?: AbortSignal } = {}\n ): Promise<QueryResult> {\n return this.json<QueryResult>(\"/query\", {\n method: \"POST\",\n body: JSON.stringify({ query }),\n signal: opts.signal,\n });\n }\n\n /\n Stream a read-only SELECT through `POST /query/stream` (NDJSON, chunked).\n * The server emits rows through a bounded-memory channel — it never buffers\n * the whole result — and we collect up to `maxRows` (default 10 000) before\n * cancelling the server cursor. The NDJSON frame order is fixed\n * (`descriptor` → `cursor` → `row`* → `end`\|`cancelled`), verified against\n * ../reddb/docs/api/query-streaming.md.\n \n Throws for a non-SELECT (server `400 stream_unsupported_statement`) and for\n * an absent route on an older server (`404`) — callers fall back to\n * {@link query}. Browser-reachable: this is `fetch` + `ReadableStream`, not\n * `EventSource` (the endpoint is POST-based).\n /\n async queryStreamCollect(\n query: string,\n opts: { maxRows?: number; signal?: AbortSignal } = {}\n ): Promise<StreamedQueryResult> {\n const maxRows = opts.maxRows ?? 10_000;\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n Accept: \"application/x-ndjson\",\n };\n Object.assign(headers, this.headers as Record<string, string> \| undefined);\n\n // Developer console instrumentation (#128). The streaming endpoint skips\n // `json()`, so it logs its own query round-trip here (verb `POST`, target\n // `/query/stream`) with the collected row count.\n const startedAt = Date.now();\n const start = performance.now();\n const body = JSON.stringify({ query });\n const payload = sanitizePayload(body);\n const elapsed = () => Math.round(performance.now() - start);\n\n let res: Response;\n try {\n res = await this.fetcher(`${this.baseUrl}/query/stream`, {\n method: \"POST\",\n headers,\n body,\n signal: opts.signal,\n });\n } catch (e) {\n devConsole.record({\n kind: \"query\",\n verb: \"POST\",\n target: \"/query/stream\",\n startedAt,\n durationMs: elapsed(),\n ok: false,\n payload,\n error: errorText(e),\n });\n throw e;\n }\n if (!res.ok \|\| !res.body) {\n const errBody = res.body ? await res.text().catch(() => \"\") : \"\";\n const message = `POST /query/stream → ${res.status} ${errBody.slice(0, 200)}`;\n devConsole.record({\n kind: \"query\",\n verb: \"POST\",\n target: \"/query/stream\",\n startedAt,\n durationMs: elapsed(),\n ok: false,\n status: res.status,\n payload,\n error: message,\n });\n throw new Error(message);\n }\n\n const out: StreamedQueryResult = {\n columns: [],\n rows: [],\n rowCount: 0,\n truncated: false,\n };\n\n for await (const frame of parseNdjsonFrames(res.body)) {\n if (\"descriptor\" in frame) {\n out.columns = (frame.descriptor.columns ?? []).map((column) =>\n typeof column === \"string\" ? column : column.name\n );\n out.schemaFingerprint = frame.descriptor.schema_fingerprint;\n } else if (\"cursor\" in frame) {\n out.cursor = frame.cursor.token;\n } else if (\"row\" in frame) {\n if (out.rows.length >= maxRows) {\n out.truncated = true;\n break;\n }\n out.rows.push(frame.row);\n out.rowCount = out.rows.length;\n } else if (\"end\" in frame \|\| \"cancelled\" in frame) {\n break;\n }\n }\n\n devConsole.record({\n kind: \"query\",\n verb: \"POST\",\n target: \"/query/stream\",\n startedAt,\n durationMs: elapsed(),\n ok: true,\n status: res.status,\n rowCount: out.rowCount,\n payload,\n });\n\n // We stopped early with more rows on the server — release the pinned cursor.\n if (out.truncated && out.cursor) {\n await this.cancelQueryStream(out.cursor).catch(() => {\n // best-effort: the cursor TTL reclaims it anyway.\n });\n }\n return out;\n }\n\n /* Cancel a streaming-query cursor server-side (`POST /query/stream/cancel`). /\n async cancelQueryStream(cursor: string): Promise<void> {\n await this.json(\"/query/stream/cancel\", {\n method: \"POST\",\n body: JSON.stringify({ cursor }),\n }).catch(() => undefined);\n }\n\n async collectionVcs(name: string): Promise<CollectionVcsState> {\n const r = await this.json<VcsEnvelope<CollectionVcsState>>(\n `/collections/${encodeURIComponent(name)}/vcs`\n );\n return r.result;\n }\n\n async setCollectionVcs(\n name: string,\n versioned: boolean\n ): Promise<CollectionVcsState> {\n const r = await this.json<VcsEnvelope<CollectionVcsState>>(\n `/collections/${encodeURIComponent(name)}/vcs`,\n {\n method: \"PUT\",\n body: JSON.stringify({ versioned }),\n }\n );\n return r.result;\n }\n\n async commits(\n opts: {\n from?: string;\n to?: string;\n branch?: string;\n limit?: number;\n skip?: number;\n noMerges?: boolean;\n } = {}\n ): Promise<VcsCommit[]> {\n const qs = new URLSearchParams();\n if (opts.from) qs.set(\"from\", opts.from);\n if (opts.to) qs.set(\"to\", opts.to);\n if (opts.branch) qs.set(\"branch\", opts.branch);\n if (opts.limit !== undefined) qs.set(\"limit\", String(opts.limit));\n if (opts.skip !== undefined) qs.set(\"skip\", String(opts.skip));\n if (opts.noMerges !== undefined) qs.set(\"no_merges\", String(opts.noMerges));\n const suffix = qs.toString() ? `?${qs}` : \"\";\n const r = await this.json<VcsEnvelope<VcsCommit[]>>(\n `/repo/commits${suffix}`\n );\n return r.result;\n }\n\n async commitDiff(\n from: string,\n to: string,\n opts: { collection?: string; summary?: boolean } = {}\n ): Promise<VcsDiff> {\n const qs = new URLSearchParams();\n if (opts.collection) qs.set(\"collection\", opts.collection);\n if (opts.summary !== undefined) qs.set(\"summary\", String(opts.summary));\n const suffix = qs.toString() ? `?${qs}` : \"\";\n const r = await this.json<VcsEnvelope<VcsDiff>>(\n `/repo/commits/${encodeURIComponent(from)}/diff/${encodeURIComponent(to)}${suffix}`\n );\n return r.result;\n }\n\n async replication(): Promise<ReplicationStatus> {\n return this.json<ReplicationStatus>(\"/replication/status\").catch(() => ({\n ok: false,\n role: \"standalone\" as const,\n }));\n }\n\n async whoami(): Promise<Whoami> {\n return this.json<Whoami>(\"/auth/whoami\");\n }\n\n /\n Grounded natural-language query (`POST /ai/ask`, ADR 0013). Returns the\n * synthesised answer plus the `sources_flat` it was grounded on and the\n * `[^N]` citations linking claims to sources. Requires the server's AI\n * provider to be configured; an unconfigured server answers with an error\n * status (surfaced by `json()`).\n /\n async ask(question: string, opts: AskOptions = {}): Promise<AskResponse> {\n return this.json<AskResponse>(\"/ai/ask\", {\n method: \"POST\",\n body: JSON.stringify({ question, ...opts }),\n });\n }\n\n async users(): Promise<AuthUser[]> {\n const r = await this.json<{ ok: boolean; users: AuthUser[] }>(\n \"/auth/users\"\n );\n return r.users;\n }\n\n async tenants(): Promise<AuthTenant[]> {\n const r = await this.json<{ ok: boolean; tenants: AuthTenant[] }>(\n \"/auth/tenants\"\n );\n return r.tenants ?? [];\n }\n\n async policies(): Promise<AuthPolicy[]> {\n const r = await this.json<{ ok: boolean; policies: AuthPolicy[] }>(\n \"/auth/policies\"\n );\n return r.policies ?? [];\n }\n\n async authCan(checks: PermissionCheck[]): Promise<PermissionDecision[]> {\n const r = await this.json<AuthCanResponse>(\"/auth/can\", {\n method: \"POST\",\n body: JSON.stringify({ checks }),\n });\n if (!Array.isArray(r.results)) {\n throw new Error(r.error ?? \"POST /auth/can returned no results\");\n }\n return checks.map((check, index) => {\n const result = r.results?.[index] ?? {};\n const resource = isPermissionResource(result.resource)\n ? result.resource\n : check.resource;\n return {\n action:\n typeof result.action === \"string\" ? result.action : check.action,\n resource,\n current_tenant:\n typeof result.current_tenant === \"string\"\n ? result.current_tenant\n : check.current_tenant,\n allowed: result.allowed === true,\n reason: typeof result.reason === \"string\" ? result.reason : undefined,\n };\n });\n }\n\n async changes(\n sinceLsn?: number,\n opts: { collection?: string; limit?: number } = {}\n ): Promise<ChangeEvent[]> {\n const qs = new URLSearchParams();\n if (sinceLsn !== undefined) qs.set(\"since_lsn\", String(sinceLsn));\n if (opts.limit !== undefined) qs.set(\"limit\", String(opts.limit));\n const suffix = qs.toString() ? `?${qs}` : \"\";\n const r = await this.json<{ events: ChangeEvent[] }>(\"/changes\" + suffix);\n const events = r.events ?? [];\n return opts.collection\n ? events.filter((e) => e.collection === opts.collection)\n : events;\n }\n\n // Convenience: turn a /query response into plain row objects.\n async rows(query: string): Promise<Array<Record<string, unknown>>> {\n const r = await this.query(query);\n return r.result.records.map((rec) => rec.values);\n }\n}\n","// ConnectionProvider — deep module: the UI's only seam for \"how do I\n// discover and select databases?\". Local OSS lives behind LocalUrlProvider;\n// cloud SSO (ReddbIoSsoProvider) will land in a separate slice without\n// touching the consumers.\n\nimport type { RedClient } from './client'\nimport type { Transport } from './types'\nimport type { BootParams } from './boot-params'\n\nexport type ConnectionRole = 'primary' \| 'replica' \| 'embedded'\n\nexport interface Connection {\n id: string\n label: string\n url: string\n role?: ConnectionRole\n description?: string\n}\n\nexport interface Identity {\n authenticated: boolean\n username: string\n role: string\n}\n\nexport interface ActiveConnection {\n connection: Connection\n client: RedClient\n rtt_ms: number\n}\n\nexport interface ConnectionProvider {\n list(): Promise<Connection[]>\n connect(id: string): Promise<ActiveConnection>\n whoami(): Promise<Identity>\n /\n The wire transports this provider can actually materialize on its Surface\n * (#34, ADR-0003). The Connect UI offers only these, so the user never picks\n * a transport that fails. Optional: a provider that omits it is treated as\n * browser-reachable (http/https + coerced red://) by the consumer.\n /\n transports?(): Transport[]\n\n /\n Non-secret connection config seeded by the Surface (#36, ADR-0005) — the\n * endpoint and initial view from the app URL. The Core reads it through this\n * seam (not a special MCP branch) to connect without the Connect flow.\n * Tokens never appear here. Returns null when nothing was seeded.\n /\n bootParams?(): BootParams \| null\n}\n\nexport class UnknownConnectionError extends Error {\n constructor(public readonly id: string) {\n super(`Unknown connection: ${id}`)\n this.name = 'UnknownConnectionError'\n }\n}\n\nexport class NotConnectedError extends Error {\n constructor() {\n super('No active connection — call connect() first')\n this.name = 'NotConnectedError'\n }\n}\n\nexport class UnreachableConnectionError extends Error {\n constructor(public readonly id: string, public readonly reason: string) {\n super(`Connection ${id} unreachable: ${reason}`)\n this.name = 'UnreachableConnectionError'\n }\n}\n","// InjectedClientProvider — the embed-Surface implementation of\n// ConnectionProvider. The embedding host owns auth (ADR-0001 / ADR-0005): it\n// constructs and authenticates a RedClient, then hands it to the Core. The\n// Core stays agnostic — it acquires its client through the same\n// ConnectionProvider seam as the PWA/Desktop Surfaces, never knowing whether\n// the connection came from a Connect flow or from its host.\n//\n// Unlike LocalUrlProvider this is a single-connection* provider: there is no\n// discovery, no history, no Connect flow. `list()` surfaces exactly one\n// connection and `connect()` returns the host-supplied client immediately. A\n// ping only measures RTT for the status bar — a failed probe does NOT block\n// the mount, because the host vouches for the client it injected.\n\nimport type { RedClient } from './client'\nimport {\n NotConnectedError,\n UnknownConnectionError,\n type ActiveConnection,\n type Connection,\n type ConnectionProvider,\n type Identity,\n} from './connection-provider'\n\nexport interface InjectedClientOptions {\n /** The host-supplied, already-authenticated client. /\n client: RedClient\n /* UI metadata for the single connection this provider exposes. /\n connection?: Partial<Connection>\n}\n\nexport class InjectedClientProvider implements ConnectionProvider {\n private readonly client: RedClient\n /* The sole connection this provider resolves. /\n readonly connection: Connection\n private connected = false\n\n constructor(opts: InjectedClientOptions) {\n this.client = opts.client\n this.connection = {\n id: opts.connection?.id ?? 'host',\n label: opts.connection?.label ?? 'Host connection',\n url: opts.connection?.url ?? '',\n role: opts.connection?.role ?? 'primary',\n description: opts.connection?.description ?? 'Injected by the embedding host.',\n }\n }\n\n async list(): Promise<Connection[]> {\n return [this.connection]\n }\n\n /\n Resolve the single host connection. Any other id throws\n * UnknownConnectionError — there is nothing else to connect to. The probe is\n * best-effort: an unreachable host still yields an ActiveConnection (rtt 0)\n * rather than rejecting, since the host owns the client's lifecycle.\n /\n async connect(id: string): Promise<ActiveConnection> {\n if (id !== this.connection.id) throw new UnknownConnectionError(id)\n let rtt_ms = 0\n try {\n const ping = await this.client.ping()\n if (ping.ok) rtt_ms = ping.rtt_ms\n } catch {\n / host vouches for the client — surface rtt 0, don't block the mount /\n }\n this.connected = true\n return { connection: this.connection, client: this.client, rtt_ms }\n }\n\n async whoami(): Promise<Identity> {\n if (!this.connected) throw new NotConnectedError()\n const w = await this.client.whoami()\n return { authenticated: w.authenticated, username: w.username, role: w.role }\n }\n}\n","import appCss from \"../../app.css?inline\";\nimport type { Component } from \"svelte\";\nimport type { ConnectionProvider, ConsoleSink } from \"../reddb\";\nimport { devConsole } from \"../reddb/dev-console\";\nimport { applyAppearance, type Theme } from \"../theme.svelte\";\nimport { RED_UI_VERSION, readBuildInfo } from \"../build-info\";\n\n/* Build version of the embeddable bundle, stamped at build time. /\nexport { RED_UI_VERSION, readBuildInfo };\n\ndeclare global {\n interface Window {\n __RED_UI_EMBED_SURFACE__?: boolean;\n }\n}\n\nexport {\n InjectedClientProvider,\n RedClient,\n type Connection,\n type ConnectionProvider,\n type ConsoleEntry,\n type ConsoleEntryKind,\n type ConsoleSink,\n type InjectedClientOptions,\n type RedClientOptions,\n} from \"../reddb\";\n\nexport interface RedUiEmbedOptions {\n connectionProvider: ConnectionProvider;\n initialRoute?: string;\n theme?: Theme;\n shadowRoot?: ShadowRootInit;\n /\n Host tap on red-ui's developer console. When set, every query/HTTP\n * round-trip the embedded Core records — verb, target, duration, row count,\n * sanitized payload — is also delivered to the host, so a host app (e.g.\n * red-request) can mirror red-ui's RQL/SQL traffic into its own developer\n * bar. Entries are already secret-redacted before they reach the sink.\n /\n consoleSink?: ConsoleSink;\n}\n\nexport interface RedUiEmbedHandle {\n host: HTMLElement;\n shadowRoot: ShadowRoot;\n portalTarget: HTMLElement;\n destroy(): void;\n}\n\nexport type RedUiElementTagName = `${string}-${string}`;\n\nconst shadowCss = `\n:host {\n display: block;\n min-height: 720px;\n color-scheme: light dark;\n contain: content;\n font-family: var(--font-sans);\n}\n\n:host {\n box-sizing: border-box;\n}\n\n.red-ui-shadow-mount {\n min-height: 720px;\n background: var(--color-bg-0);\n color: var(--color-fg-0);\n font-family: var(--font-sans);\n font-size: 13px;\n line-height: 1.5;\n -webkit-font-smoothing: antialiased;\n text-rendering: optimizeLegibility;\n}\n\n[data-red-ui-shadow-portal] {\n position: relative;\n z-index: 2147483647;\n}\n`;\n\nfunction markEmbedSurface() {\n if (typeof window !== \"undefined\") window.__RED_UI_EMBED_SURFACE__ = true;\n}\n\nexport async function mountRedUi(\n host: HTMLElement,\n opts: RedUiEmbedOptions\n): Promise<RedUiEmbedHandle> {\n markEmbedSurface();\n // The DS axes (ADR 0008): `data-theme` is the Theme direction and\n // `data-color-scheme` is light/dark. A host that still pre-sets the legacy\n // `data-theme=\"light\|dark\"` keeps its choice.\n const legacy = host.dataset.theme;\n const preset =\n host.dataset.colorScheme ??\n (legacy === \"light\" \|\| legacy === \"dark\" ? legacy : undefined);\n applyAppearance(host, opts.theme ?? (preset as Theme \| undefined) ?? \"dark\");\n\n // Browsers do not register @font-face rules inside a shadow tree. Publish\n // only the received DS faces once per document; appearance stays scoped.\n const doc = host.ownerDocument;\n if (!doc.head.querySelector(`style[data-red-ui-fonts=\"${RED_UI_VERSION}\"]`)) {\n const fonts = doc.createElement(\"style\");\n fonts.dataset.redUiFonts = RED_UI_VERSION;\n fonts.textContent =\n appCss.match(/@font-face\\s\\{[^}]\\}/g)?.join(\"\\n\") ?? \"\";\n doc.head.append(fonts);\n }\n\n const shadowRoot =\n host.shadowRoot ?? host.attachShadow(opts.shadowRoot ?? { mode: \"open\" });\n shadowRoot.textContent = \"\";\n\n const style = document.createElement(\"style\");\n style.textContent = `${appCss}\\n${shadowCss}`;\n\n const mountTarget = document.createElement(\"div\");\n mountTarget.className = \"red-ui-shadow-mount\";\n\n const portalTarget = document.createElement(\"div\");\n portalTarget.setAttribute(\"data-red-ui-shadow-portal\", \"\");\n\n shadowRoot.append(style, mountTarget, portalTarget);\n\n const [{ mount, unmount }, root] = await Promise.all([\n import(\"svelte\"),\n import(\"./RedUiEmbedRoot.svelte\") as Promise<{\n default: Component<Record<string, unknown>>;\n }>,\n ]);\n\n const instance = mount(root.default, {\n target: mountTarget,\n props: {\n connectionProvider: opts.connectionProvider,\n portalTarget,\n shadowHost: host,\n initialRoute: opts.initialRoute,\n initialTheme: opts.theme,\n },\n });\n\n const removeSink = opts.consoleSink\n ? devConsole.addSink(opts.consoleSink)\n : undefined;\n\n return {\n host,\n shadowRoot,\n portalTarget,\n destroy: () => {\n removeSink?.();\n void unmount(instance);\n shadowRoot.textContent = \"\";\n },\n };\n}\n\nexport class RedUiElement extends HTMLElement {\n #connectionProvider: ConnectionProvider \| null = null;\n #consoleSink: ConsoleSink \| null = null;\n initialRoute: string \| undefined;\n theme: Theme \| undefined;\n #handle: RedUiEmbedHandle \| null = null;\n #mounting: Promise<void> \| null = null;\n\n /** Build version of the embedded bundle (also reflected as a `version`\n * attribute on connect, so a host can read `el.getAttribute('version')`). /\n static readonly version = RED_UI_VERSION;\n get version(): string {\n return RED_UI_VERSION;\n }\n\n get connectionProvider(): ConnectionProvider \| null {\n return this.#connectionProvider;\n }\n\n set connectionProvider(provider: ConnectionProvider \| null) {\n this.#connectionProvider = provider;\n if (this.isConnected) this.#mounting = this.#mount();\n }\n\n get consoleSink(): ConsoleSink \| null {\n return this.#consoleSink;\n }\n\n /\n Host tap on the embedded Core's developer console (see\n * `RedUiEmbedOptions.consoleSink`). Setting it after mount remounts, like\n * `connectionProvider` — hosts normally assign both before attach.\n */\n set consoleSink(sink: ConsoleSink \| null) {\n this.#consoleSink = sink;\n if (this.isConnected) this.#mounting = this.#mount();\n }\n\n connectedCallback() {\n if (!this.hasAttribute(\"version\"))\n this.setAttribute(\"version\", RED_UI_VERSION);\n this.#mounting ??= this.#mount();\n }\n\n disconnectedCallback() {\n this.#handle?.destroy();\n this.#handle = null;\n this.#mounting = null;\n }\n\n async #mount() {\n if (!this.#connectionProvider) return;\n this.#handle?.destroy();\n this.#handle = await mountRedUi(this, {\n connectionProvider: this.#connectionProvider,\n initialRoute: this.initialRoute,\n theme: this.theme,\n consoleSink: this.#consoleSink ?? undefined,\n });\n }\n}\n\nexport function registerRedUiElement(\n tagName: RedUiElementTagName = \"red-ui-app\"\n): typeof RedUiElement {\n markEmbedSurface();\n if (!customElements.get(tagName))\n customElements.define(tagName, RedUiElement);\n return customElements.get(tagName) as typeof RedUiElement;\n}\n"],"names":["SENSITIVE_KEY_RE","REDACTED","redactSecrets","value","depth","v","out","k","sanitizePayload","body","parsed","json","DevConsoleStore","capacity","__publicField","input","entry","sink","listener","snap","devConsole","EACH_ITEM_REACTIVE","EACH_INDEX_REACTIVE","EACH_IS_CONTROLLED","EACH_IS_ANIMATED","EACH_ITEM_IMMUTABLE","PROPS_IS_IMMUTABLE","PROPS_IS_RUNES","PROPS_IS_UPDATED","PROPS_IS_BINDABLE","PROPS_IS_LAZY_INITIAL","TRANSITION_IN","TRANSITION_OUT","TRANSITION_GLOBAL","TEMPLATE_FRAGMENT","TEMPLATE_USE_IMPORT_NODE","HYDRATION_START","HYDRATION_START_ELSE","HYDRATION_START_FAILED","HYDRATION_END","HYDRATION_ERROR","UNINITIALIZED","NAMESPACE_HTML","NAMESPACE_SVG","NAMESPACE_MATHML","ATTACHMENT_KEY","DEV","is_array","index_of","includes","array_from","define_property","get_descriptor","get_descriptors","object_prototype","array_prototype","get_prototype_of","is_extensible","is_function","thing","noop","is_promise","run","fn","run_all","arr","i","deferred","resolve","reject","promise","res","rej","fallback","lazy","to_array","n","array","element","exclude_from_object","obj","keys","result","key","symbol","DERIVED","EFFECT","RENDER_EFFECT","MANAGED_EFFECT","BLOCK_EFFECT","BRANCH_EFFECT","ROOT_EFFECT","BOUNDARY_EFFECT","CONNECTED","CLEAN","DIRTY","MAYBE_DIRTY","INERT","DESTROYED","REACTION_RAN","DESTROYING","EFFECT_TRANSPARENT","EAGER_EFFECT","HEAD_EFFECT","EFFECT_PRESERVED","USER_EFFECT","EFFECT_OFFSCREEN","WAS_MARKED","REACTION_IS_UPDATING","ASYNC","ERROR_VALUE","STATE_SYMBOL","LEGACY_PROPS","LOADING_ATTR_SYMBOL","ATTRIBUTES_CACHE","CLASS_CACHE","STYLE_CACHE","TEXT_CACHE","FORM_RESET_HANDLER","STALE_REACTION","IS_XHTML","_a","ELEMENT_NODE","TEXT_NODE","COMMENT_NODE","experimental_async_required","name","invalid_default_snippet","lifecycle_outside_component","missing_context","async_derived_orphan","each_key_duplicate","a","b","effect_in_teardown","rune","effect_in_unowned_derived","effect_orphan","effect_update_depth_exceeded","fork_discarded","fork_timing","get_abort_signal_outside_reaction","hydration_failed","lifecycle_legacy_only","props_invalid_value","state_descriptors_fixed","state_prototype_fixed","state_unsafe_mutation","svelte_boundary_reset_onerror","derived_inert","hydratable_missing_but_expected","hydration_mismatch","location","select_multiple_invalid_value","svelte_boundary_reset_noop","hydrating","set_hydrating","hydrate_node","set_hydrate_node","node","w.hydration_mismatch","hydrate_next","get_next_sibling","reset","next","count","skip_nodes","remove","data","read_hydration_instruction","equals","safe_not_equal","safe_equals","legacy_mode_flag","tracing_mode_flag","enable_legacy_mode_flag","component_context","set_component_context","context","createContext","hasContext","e.missing_context","getContext","setContext","get_or_init_context_map","getAllContexts","push","props","runes","active_effect","pop","component","effects","create_user_effect","is_runes","e.lifecycle_outside_component","get_parent_context","parent","context_map","micro_tasks","run_micro_tasks","tasks","queue_micro_task","is_flushing_sync","flush_tasks","handle_error","error","effect","active_reaction","invoke_error_boundary","e","STATUS_MASK","set_signal_status","signal","status","update_derived_status","derived","clear_marked","deps","dep","defer_effect","dirty_effects","maybe_dirty_effects","subscribe_to_store","store","invalidate","unsub","untrack","subscriber_queue","readable","start","writable","stop","subscribers","set","new_value","run_queue","subscriber","update","subscribe","stores","initial_value","single","stores_array","auto","started","values","pending","cleanup","sync","unsubscribers","get","_","legacy_is_updating_store","is_store_binding","IS_UNMOUNTED","store_get","store_name","mutable_source","is_synchronous_callback","get_store","store_unsub","store_set","update_with_flag","setup_stores","teardown","capture_store_binding","previous_is_store_binding","first_batch","last_batch","current_batch","previous_batch","batch_values","last_scheduled_effect","is_processing","collected_effects","legacy_updates","flush_count","uid","_Batch","__privateAdd","_Batch_instances","_started","_prev","_next","_commit_callbacks","_discard_callbacks","_fork_commit_callbacks","_pending","_blocking_pending","_deferred","_roots","_new_effects","_dirty_effects","_maybe_dirty_effects","_skipped_branches","_unskipped_branches","_decrement_queued","__privateGet","callback","tracked","source","is_derived","__privateMethod","process_fn","old_values","unlink_fn","blocking","__privateSet","blocking_pending_count","batch","link_fn","flags","is_deferred_fn","skipped","infinite_loop_guard","roots","render_effects","updates","root","traverse_fn","reset_all","defer_effects_fn","t","reset_branch","earlier_batch","find_earlier_batch_fn","_b","merge_fn","flush_queued_effects","_c","next_batch","r","_d","is_branch","is_skippable_branch","skip","is_dirty","update_effect","child","d","mark","reactions","reaction","commit_fn","is_earlier","sources","batch_value","others","s","unskipped","marked","checked","mark_effects","current_unequal","c","depends_on","prev","Batch","flushSync","was_flushing_sync","e.effect_update_depth_exceeded","eager_block_effects","length","unlink_effect","ordered_effects","ancestor","j","schedule_effect","mark_eager_effects","depends","fork","e.experimental_async_required","e.fork_timing","committed","settled","e.fork_discarded","increment_write_version","eager_effects","set_eager_effects","flush_eager_effects","flatten","blockers","async","derived_safe_equal","restore","capture","blocker_promise","finish","unset_context","decrement_pending","increment_pending","expression","async_derived","previous_effect","previous_reaction","previous_component_context","activate_batch","set_active_effect","set_active_reaction","deactivate_batch","boundary","OBSOLETE","label","e.async_derived_orphan","should_suspend","deferreds","async_effect","handler","internal_set","fulfil","p","go","user_derived","push_reaction_value","destroy_derived_effects","destroy_effect","execute_derived","prev_active_effect","is_destroying_effect","w.derived_inert","update_reaction","update_derived","effect_tracking","freeze_derived_effects","remove_reactions","destroy_effect_children","unfreeze_derived_effects","eager_effects_deferred","stack","state","immutable","trackable","mutate","should_proxy","untracking","current_sources","e.state_unsafe_mutation","proxy","updated_during_traversal","mark_reactions","untracked_writes","set_untracked_writes","dirty","increment","not_dirty","prototype","is_proxied_array","version","parent_version","update_version","with_parent","set_update_version","prop","descriptor","e.state_descriptors_fixed","target","receiver","exists","has","other_s","ls","own_keys","e.state_prototype_fixed","get_proxied_value","is","$window","is_firefox","first_child_getter","next_sibling_getter","init_operations","element_prototype","node_prototype","text_prototype","create_text","get_first_child","is_text","text","merge_text_nodes","first_child","first","sibling","next_sibling","last_sibling","clear_text_content","should_defer_append","create_element","tag","namespace","autofocus","dom","remove_textarea_child","listening_to_form_reset","add_form_reset_listener","evt","without_reactive_context","listen_to_event_and_reset_event","event","on_reset","validate_effect","e.effect_orphan","e.effect_in_unowned_derived","e.effect_in_teardown","push_effect","parent_effect","parent_last","create_effect","type","user_effect","defer","user_pre_effect","effect_root","component_root","options","pause_effect","legacy_pre_effect","token","render_effect","legacy_pre_effect_reset","template_effect","block","managed","branch","execute_effect_teardown","previously_destroying_effect","set_is_destroying_effect","remove_dom","controller","destroy_block_effect_children","removed","remove_effect_dom","transitions","transition","end","destroy","pause_children","remaining","check","local","transparent","resume_effect","resume_children","move_effect","fragment","is_updating_effect","new_deps","skipped_deps","write_version","read_version","dependencies","dependency","schedule_possible_effect_self_invalidation","previous_deps","previous_skipped_deps","previous_untracked_writes","previous_sources","previous_untracking","previous_update_version","is_fork","remove_reaction","index","new_length","start_index","was_updating_effect","tick","destroyed","depends_on_old_values","should_connect","is_new","reconnect","deep_read_state","deep_read","visited","proto","descriptors","DS_THEME","applyAppearance","el","scheme","STORAGE_KEY","DEFAULT","read","persist","initial","scoped","apply","enabled","ThemeStore","_current","$.state","opts","theme","injected","stripTagPrefix","readBuildInfo","RED_UI_VERSION","EMPTY_SERVER_CAPABILITIES","FEATURE_ALIASES","capabilitiesFromSignal","raw","on","unsupportedCollectionMetadata","collectionMetadataSupportProbe","isUnsupportedCollectionMetadataRoute","isUnsupportedRoute","message","unsupportedCollectionMetadataError","baseUrl","isPermissionResource","candidate","parseNdjsonFrames","reader","decoder","buf","done","nl","line","tail","SELECT_RE","extractRowCount","errorText","m","runQueryPreferStream","client","sql","queryOpts","row","RedClient","path","init","url","headers","verb","startedAt","payload","elapsed","rowCount","username","password","endpoint","response","session","rec","query","time","qs","step","vcs","clusterStatus","inFlightProbe","resolveProbe","probe","metadata","collection","doc","maxRows","errBody","frame","column","cursor","versioned","suffix","from","to","question","checks","resource","sinceLsn","events","UnknownConnectionError","id","NotConnectedError","UnreachableConnectionError","reason","InjectedClientProvider","_e","rtt_ms","ping","w","shadowCss","markEmbedSurface","mountRedUi","host","legacy","preset","fonts","appCss","shadowRoot","style","mountTarget","portalTarget","mount","unmount","instance","removeSink","RedUiElement","_RedUiElement_instances","_connectionProvider","_consoleSink","_handle","_mounting","provider","mount_fn","registerRedUiElement","tagName"],"mappings":";;;;;;;i60WAoDMA,KACJ,iHAEIC,KAAW;AAQV,SAASC,GAAcC,GAAgBC,IAAQ,GAAY;AAChE,MAAIA,IAAQ,EAAG,QAAO;AACtB,MAAI,MAAM,QAAQD,CAAK;AACrB,WAAOA,EAAM,MAAM,GAAG,GAAG,EAAE,IAAI,CAACE,MAAMH,GAAcG,GAAGD,IAAQ,CAAC,CAAC;AAEnE,MAAID,KAAS,OAAOA,KAAU,UAAU;AACtC,UAAMG,IAA+B,CAAA;AACrC,eAAW,CAACC,GAAGF,CAAC,KAAK,OAAO,QAAQF,CAAgC;AAClE,MAAAG,EAAIC,CAAC,IAAIP,GAAiB,KAAKO,CAAC,IAC5BN,KACAC,GAAcG,GAAGD,IAAQ,CAAC;AAEhC,WAAOE;AAAA,EACT;AACA,SAAOH;AACT;AAQO,SAASK,GAAgBC,GAAmC;AACjE,MAA0BA,KAAS,KAAM;AACzC,MAAIC,IAAkBD;AACtB,MAAI,OAAOA,KAAS,UAAU;AAC5B,QAAIA,EAAK,WAAW,EAAG;AACvB,QAAI;AACF,MAAAC,IAAS,KAAK,MAAMD,CAAI;AAAA,IAC1B,QAAQ;AACN,aAAOA,EAAK,SAAS,MAAO,GAAGA,EAAK,MAAM,GAAG,GAAI,CAAC,MAAMA;AAAA,IAC1D;AAAA,EACF;AACA,MAAI;AACF,UAAME,IAAO,KAAK,UAAUT,GAAcQ,CAAM,GAAG,MAAM,CAAC;AAC1D,WAAOC,EAAK,SAAS,MAAO,GAAGA,EAAK,MAAM,GAAG,GAAI,CAAC,MAAMA;AAAA,EAC1D,QAAQ;AACN;AAAA,EACF;AACF;AAOO,MAAMC,GAAgB;AAAA;AAAA,EAO3B,YAA6BC,IAAW,KAAK;AANrC,IAAAC,EAAA,iBAA0B,CAAA;AACjB,IAAAA,EAAA,uCAAgB,IAAA;AAChB,IAAAA,EAAA,mCAAY,IAAA;AACrB,IAAAA,EAAA,gBAAS;AAGY,SAAA,WAAAD;AAAA,EAAiB;AAAA;AAAA,EAG9C,OAAOE,GAAwC;AAC7C,UAAMC,IAAsB,EAAE,GAAGD,GAAO,IAAI,KAAK,SAAA;AACjD,SAAK,QAAQ,KAAKC,CAAK,GACnB,KAAK,QAAQ,SAAS,KAAK,YAC7B,KAAK,QAAQ,OAAO,GAAG,KAAK,QAAQ,SAAS,KAAK,QAAQ,GAE5D,KAAK,KAAA;AACL,eAAWC,KAAQ,KAAK;AACtB,UAAI;AACF,QAAAA,EAAKD,CAAK;AAAA,MACZ,QAAQ;AAAA,MAER;AAEF,WAAOA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQC,GAA+B;AACrC,gBAAK,MAAM,IAAIA,CAAI,GACZ,MAAM;AACX,WAAK,MAAM,OAAOA,CAAI;AAAA,IACxB;AAAA,EACF;AAAA;AAAA,EAGA,WAAoC;AAClC,WAAO,KAAK,QAAQ,MAAA;AAAA,EACtB;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA;AAAA,EAGA,QAAc;AACZ,IAAI,KAAK,QAAQ,WAAW,MAC5B,KAAK,UAAU,CAAA,GACf,KAAK,KAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAUC,GAAgC;AACxC,gBAAK,UAAU,IAAIA,CAAQ,GAC3BA,EAAS,KAAK,UAAU,GACjB,MAAM;AACX,WAAK,UAAU,OAAOA,CAAQ;AAAA,IAChC;AAAA,EACF;AAAA,EAEQ,OAAa;AACnB,UAAMC,IAAO,KAAK,SAAA;AAClB,eAAWD,KAAY,KAAK,UAAW,CAAAA,EAASC,CAAI;AAAA,EACtD;AACF;AAGO,MAAMC,KAAa,IAAIR,GAAA,GCzLjBS,KAAqB,GACrBC,KAAsB,GAEtBC,KAAqB,GACrBC,KAAmB,GACnBC,KAAsB,IAEtBC,KAAqB,GACrBC,KAAiB,GACjBC,KAAmB,GACnBC,KAAoB,GACpBC,KAAwB,IAExBC,KAAgB,GAChBC,KAAiB,GACjBC,KAAoB,GAEpBC,KAAoB,GACpBC,KAA2B,GAI3BC,KAAkB,KAElBC,KAAuB,MAEvBC,KAAyB,MACzBC,KAAgB,KAChBC,KAAkB,CAAA,GAMlBC,IAAgB,OAAO,eAAe,GAMtCC,KAAiB,gCACjBC,KAAgB,8BAChBC,KAAmB,sCAuBnBC,KAAiB,WCjE9BC,KAAe;ACEL,IAACC,KAAW,MAAM,SACjBC,KAAW,MAAM,UAAU,SAC3BC,KAAW,MAAM,UAAU,UAC3BC,KAAa,MAAM,MAEnBC,KAAkB,OAAO,gBACzBC,KAAiB,OAAO,0BACxBC,KAAkB,OAAO,2BACzBC,KAAmB,OAAO,WAC1BC,KAAkB,MAAM,WACxBC,KAAmB,OAAO,gBAC1BC,KAAgB,OAAO;AAO3B,SAASC,GAAYC,GAAO;AAClC,SAAO,OAAOA,KAAU;AACzB;AAEY,MAACC,IAAO,MAAM;AAAC;AAUpB,SAASC,GAAW1D,GAAO;AACjC,SAAO,QAAOA,KAAA,gBAAAA,EAAO,SAAS;AAC/B;AAGO,SAAS2D,GAAIC,GAAI;AACvB,SAAOA,EAAE;AACV;AAGO,SAASC,GAAQC,GAAK;AAC5B,WAASC,IAAI,GAAGA,IAAID,EAAI,QAAQC;AAC/B,IAAAD,EAAIC,CAAC,EAAC;AAER;AAMO,SAASC,KAAW;AAE1B,MAAIC,GAGAC,GAGAC,IAAU,IAAI,QAAQ,CAACC,GAAKC,MAAQ;AACvC,IAAAJ,IAAUG,GACVF,IAASG;AAAA,EACV,CAAC;AAGD,SAAO,EAAE,SAAAF,GAAS,SAAAF,GAAS,QAAAC,EAAM;AAClC;AASO,SAASI,GAAStE,GAAOsE,GAAUC,IAAO,IAAO;AACvD,SAAOvE,MAAU,SACduE;AAAA;AAAA,IACyBD,EAAQ;AAAA;AAAA;AAAA,IACdA;AAAA,MACnBtE;AACJ;AAWO,SAASwE,GAASxE,GAAOyE,GAAG;AAElC,MAAI,MAAM,QAAQzE,CAAK;AACtB,WAAOA;AAMR,MAAIyE,MAAM,UAAa,EAAE,OAAO,YAAYzE;AAC3C,WAAO,MAAM,KAAKA,CAAK;AAMxB,QAAM0E,IAAQ,CAAA;AAEd,aAAWC,KAAW3E;AAErB,QADA0E,EAAM,KAAKC,CAAO,GACdD,EAAM,WAAWD,EAAG;AAGzB,SAAOC;AACR;AAOO,SAASE,GAAoBC,GAAKC,GAAM;AAE9C,MAAIC,IAAS,CAAA;AAEb,WAASC,KAAOH;AACf,IAAKC,EAAK,SAASE,CAAG,MACrBD,EAAOC,CAAG,IAAIH,EAAIG,CAAG;AAIvB,WAASC,KAAU,OAAO,sBAAsBJ,CAAG;AAClD,IAAI,OAAO,qBAAqB,KAAKA,GAAKI,CAAM,KAAK,CAACH,EAAK,SAASG,CAAM,MACzEF,EAAOE,CAAM,IAAIJ,EAAII,CAAM;AAI7B,SAAOF;AACR;AC9IO,MAAMG,IAAU,GACVC,KAAS,GACTC,KAAgB,GAKhBC,KAAiB,KAAK,IAKtBC,IAAe,IACfC,IAAgB,IAChBC,KAAc,IACdC,KAAkB,KAOlBC,IAAY,KACZC,IAAQ,MACRC,IAAQ,MACRC,IAAc,MACdC,IAAQ,MACRC,IAAY,OAEZC,KAAe,OAEfC,KAAa,KAAK,IAOlBC,KAAqB,OACrBC,KAAe,KAAK,IACpBC,KAAc,KAAK,IACnBC,KAAmB,KAAK,IACxBC,KAAc,KAAK,IACnBC,KAAmB,KAAK,IASxBC,KAAa,OAGbC,KAAuB,KAAK,IAC5BC,KAAQ,KAAK,IAEbC,KAAc,KAAK,IAEnBC,KAAe,OAAO,QAAQ,GAC9BC,KAAe,OAAO,cAAc,GACpCC,KAAsB,OAAO,EAAE,GAE/BC,KAAmB,OAAO,YAAY,GACtCC,KAAc,OAAO,OAAO,GAC5BC,KAAc,OAAO,OAAO,GAC5BC,KAAa,OAAO,MAAM,GAC1BC,KAAqB,OAAO,YAAY,GAKxCC,KAAiB,IAAK,cAAiC,MAAM;AAAA,EAAvC;AAAA;AAClC,IAAAzG,EAAA,cAAO;AACP,IAAAA,EAAA,iBAAU;AAAA;AACX,EAAC;;AAEW,MAAC0G;AAAA;AAAA,EAEZ,CAAC,GAACC,KAAA,WAAW,aAAX,QAAAA,GAAqB,gBACP,2BAAW,SAAS,YAAY,SAAS,KAAK;AAAA,GAClDC,KAAe,GACfC,KAAY,GACZC,KAAe;AC5ErB,SAASC,GAA4BC,GAAM;AAQhD,QAAM,IAAI,MAAM,kDAAkD;AAEpE;AAMO,SAASC,KAA0B;AAQxC,QAAM,IAAI,MAAM,8CAA8C;AAEhE;AAwCO,SAASC,GAA4BF,GAAM;AAQhD,QAAM,IAAI,MAAM,kDAAkD;AAEpE;AAMO,SAASG,KAAkB;AAQhC,QAAM,IAAI,MAAM,sCAAsC;AAExD;AC3FO,SAASC,KAAuB;AAQrC,QAAM,IAAI,MAAM,2CAA2C;AAE7D;AAmHO,SAASC,GAAmBC,GAAGC,GAAGlI,GAAO;AAU9C,QAAM,IAAI,MAAM,yCAAyC;AAE3D;AA0BO,SAASmI,GAAmBC,GAAM;AAQvC,QAAM,IAAI,MAAM,yCAAyC;AAE3D;AAMO,SAASC,KAA4B;AAQ1C,QAAM,IAAI,MAAM,gDAAgD;AAElE;AAOO,SAASC,GAAcF,GAAM;AAQlC,QAAM,IAAI,MAAM,oCAAoC;AAEtD;AAsBO,SAASG,KAA+B;AAQ7C,QAAM,IAAI,MAAM,mDAAmD;AAErE;AAsBO,SAASC,KAAiB;AAQ/B,QAAM,IAAI,MAAM,qCAAqC;AAEvD;AAMO,SAASC,KAAc;AAQ5B,QAAM,IAAI,MAAM,kCAAkC;AAEpD;AAMO,SAASC,KAAoC;AAQlD,QAAM,IAAI,MAAM,wDAAwD;AAE1E;AAuBO,SAASC,KAAmB;AAQjC,QAAM,IAAI,MAAM,uCAAuC;AAEzD;AAuBO,SAASC,GAAsBjB,GAAM;AAQ1C,QAAM,IAAI,MAAM,4CAA4C;AAE9D;AAOO,SAASkB,GAAoB7D,GAAK;AAQvC,QAAM,IAAI,MAAM,0CAA0C;AAE5D;AAwDO,SAAS8D,KAA0B;AAQxC,QAAM,IAAI,MAAM,8CAA8C;AAEhE;AAMO,SAASC,KAAwB;AAQtC,QAAM,IAAI,MAAM,4CAA4C;AAE9D;AAMO,SAASC,KAAwB;AAQtC,QAAM,IAAI,MAAM,4CAA4C;AAE9D;AAMO,SAASC,KAAgC;AAQ9C,QAAM,IAAI,MAAM,oDAAoD;AAEtE;AC9aO,SAASC,KAAgB;AAI9B,UAAQ,KAAK,oCAAoC;AAEnD;AAmBO,SAASC,GAAgCnE,GAAK;AAInD,UAAQ,KAAK,sDAAsD;AAErE;AAsCO,SAASoE,GAAmBC,GAAU;AAU3C,UAAQ,KAAK,yCAAyC;AAExD;AAqEO,SAASC,KAAgC;AAI9C,UAAQ,KAAK,oDAAoD;AAEnE;AA4BO,SAASC,KAA6B;AAI3C,UAAQ,KAAK,iDAAiD;AAEhE;AC7PU,IAACC,KAAY;AAGhB,SAASC,GAAczJ,GAAO;AACpC,EAAAwJ,KAAYxJ;AACb;AASU,IAAC0J;AAGJ,SAASC,GAAiBC,GAAM;AACtC,MAAIA,MAAS;AACZC,UAAAA,GAAoB,GACdxH;AAGP,SAAQqH,IAAeE;AACxB;AAEO,SAASE,KAAe;AAC9B,SAAOH,GAAiB,gBAAAI,GAAiBL,CAAY,CAAC;AACvD;AAGO,SAASM,GAAMJ,GAAM;AAC3B,MAAKJ,IAGL;AAAA,QAAI,gBAAAO,GAAiBL,CAAY,MAAM;AACtCG,YAAAA,GAAoB,GACdxH;AAGP,IAAAqH,IAAeE;AAAA;AAChB;AAYO,SAASK,GAAKC,IAAQ,GAAG;AAC/B,MAAIV,IAAW;AAId,aAHIzF,IAAImG,GACJN,IAAOF,GAEJ3F;AACN,MAAA6F;AAAA,MAAoC,gBAAAG,GAAiBH,CAAI;AAG1D,IAAAF,IAAeE;AAAA,EAChB;AACD;AAMO,SAASO,GAAWC,IAAS,IAAM;AAIzC,WAHInK,IAAQ,GACR2J,IAAOF,OAEE;AACZ,QAAIE,EAAK,aAAanC,IAAc;AACnC,UAAI4C;AAAA;AAAA,QAA+BT,EAAM;AAAA;AAEzC,UAAIS,MAASjI,IAAe;AAC3B,YAAInC,MAAU,EAAG,QAAO2J;AACxB,QAAA3J,KAAS;AAAA,MACV,MAAO,EACNoK,MAASpI,MACToI,MAASnI;AAAA,MAERmI,EAAK,CAAC,MAAM,OAAO,CAAC,MAAM,OAAOA,EAAK,MAAM,CAAC,CAAC,CAAC,OAEhDpK,KAAS;AAAA,IAEX;AAEA,QAAIgK;AAAA;AAAA,MAAoC,gBAAAF,GAAiBH,CAAI;AAAA;AAC7D,IAAIQ,KAAQR,EAAK,OAAM,GACvBA,IAAOK;AAAA,EACR;AACD;AAMO,SAASK,GAA2BV,GAAM;AAChD,MAAI,CAACA,KAAQA,EAAK,aAAanC;AAC9BoC,UAAAA,GAAoB,GACdxH;AAGP;AAAA;AAAA,IAA+BuH,EAAM;AAAA;AACtC;ACzHO,SAASW,GAAOvK,GAAO;AAC7B,SAAOA,MAAU,KAAK;AACvB;AAOO,SAASwK,GAAevC,GAAGC,GAAG;AACpC,SAAOD,KAAKA,IACTC,KAAKA,IACLD,MAAMC,KAAMD,MAAM,QAAQ,OAAOA,KAAM,YAAa,OAAOA,KAAM;AACrE;AAYO,SAASwC,GAAYzK,GAAO;AAClC,SAAO,CAACwK,GAAexK,GAAO,KAAK,CAAC;AACrC;AC3BU,IAAC0K,KAAmB,IAEnBC,KAAoB;AAWxB,SAASC,KAA0B;AACzC,EAAAF,KAAmB;AACpB;ACRU,IAACG,IAAoB;AAGxB,SAASC,GAAsBC,GAAS;AAC9C,EAAAF,IAAoBE;AACrB;AAiEO,SAASC,KAAgB;AAC/B,QAAMhG,IAAM,CAAA;AAEZ,SAAO;AAAA,IACN,OACMiG,GAAWjG,CAAG,KAClBkG,GAAiB,GAGXC,GAAWnG,CAAG;AAAA,IAEtB,CAAC+F,MAAYK,GAAWpG,GAAK+F,CAAO;AAAA,EACtC;AACA;AAYO,SAASI,GAAWnG,GAAK;AAG/B;AAAA;AAAA,IAFoBqG,GAAoC,EACX,IAAIrG,CAAG;AAAA;AAErD;AAgBO,SAASoG,GAAWpG,GAAK+F,GAAS;AAgBxC,SAfoBM,GAAoC,EAe5C,IAAIrG,GAAK+F,CAAO,GACrBA;AACR;AASO,SAASE,GAAWjG,GAAK;AAE/B,SADoBqG,GAAoC,EACrC,IAAIrG,CAAG;AAC3B;AAUO,SAASsG,KAAiB;AAEhC,SADoBD,GAAwC;AAE7D;AAQO,SAASE,GAAKC,GAAOC,IAAQ,IAAO7H,GAAI;AAC9C,EAAAiH,IAAoB;AAAA,IACnB,GAAGA;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAGW;AAAA,IACH,GAAG;AAAA,IACH;AAAA;AAAA,MAA0BE;AAAA;AAAA,IAC1B,GAAGhB,MAAoB,CAACe,IAAQ,EAAE,GAAG,MAAM,GAAG,MAAM,GAAG,CAAA,MAAO;AAAA,EAChE;AAOA;AAOO,SAASE,GAAIC,GAAW;AAC9B,MAAIb;AAAA;AAAA,IAA2CF;AAAA,KAC3CgB,IAAUd,EAAQ;AAEtB,MAAIc,MAAY,MAAM;AACrB,IAAAd,EAAQ,IAAI;AAEZ,aAASnH,KAAMiI;AACd,MAAAC,GAAmBlI,CAAE;AAAA,EAEvB;AAEA,SAAIgI,MAAc,WACjBb,EAAQ,IAAIa,IAGbb,EAAQ,IAAI,IAEZF,IAAoBE,EAAQ,GAMrBa;AAAA,EAA+B,CAAA;AACvC;AAGO,SAASG,KAAW;AAC1B,SAAO,CAACrB,MAAqBG,MAAsB,QAAQA,EAAkB,MAAM;AACpF;AAMA,SAASQ,GAAwB1D,GAAM;AACtC,SAAIkD,MAAsB,QACzBmB,GAAkC,GAG3BnB,EAAkB,MAAlBA,EAAkB,IAAM,IAAI,IAAIoB,GAAmBpB,CAAiB,KAAK,MAAS;AAC3F;AAMA,SAASoB,GAAmBpB,GAAmB;AAC9C,MAAIqB,IAASrB,EAAkB;AAC/B,SAAOqB,MAAW,QAAM;AACvB,UAAMC,IAAcD,EAAO;AAC3B,QAAIC,MAAgB;AACnB,aAAOA;AAER,IAAAD,IAASA,EAAO;AAAA,EACjB;AACA,SAAO;AACR;AC9PA,IAAIE,KAAc,CAAA;AAElB,SAASC,KAAkB;AAC1B,MAAIC,IAAQF;AACZ,EAAAA,KAAc,CAAA,GACdvI,GAAQyI,CAAK;AACd;AAKO,SAASC,GAAiB3I,GAAI;AACpC,MAAIwI,GAAY,WAAW,KAAK,CAACI,IAAkB;AAClD,QAAIF,IAAQF;AACZ,mBAAe,MAAM;AASpB,MAAIE,MAAUF,MAAaC,GAAe;AAAA,IAC3C,CAAC;AAAA,EACF;AAEA,EAAAD,GAAY,KAAKxI,CAAE;AACpB;AAKO,SAAS6I,KAAc;AAC7B,SAAOL,GAAY,SAAS;AAC3B,IAAAC,GAAe;AAEjB;AC3BO,SAASK,GAAaC,GAAO;AACnC,MAAIC,IAASlB;AAGb,MAAIkB,MAAW;AACS,WAACC,EAAiB,KAAKlG,IACvCgG;AAUR,OAAKC,EAAO,IAAI5G,QAAkB,MAAM4G,EAAO,IAAIzH,QAAY;AAK9D,UAAMwH;AAIP,EAAAG,GAAsBH,GAAOC,CAAM;AACpC;AAMO,SAASE,GAAsBH,GAAOC,GAAQ;AACpD,SAAOA,MAAW,QAAM;AACvB,SAAKA,EAAO,IAAInH,QAAqB,GAAG;AACvC,WAAKmH,EAAO,IAAI5G,QAAkB;AAEjC,cAAM2G;AAGP,UAAI;AACqB,QAACC,EAAO,EAAG,MAAMD,CAAK;AAC9C;AAAA,MACD,SAASI,GAAG;AACX,QAAAJ,IAAQI;AAAA,MACT;AAAA,IACD;AAEA,IAAAH,IAASA,EAAO;AAAA,EACjB;AAMA,QAAMD;AACP;ACnEA,MAAMK,KAAc;AAMb,SAASC,EAAkBC,GAAQC,GAAQ;AACjD,EAAAD,EAAO,IAAKA,EAAO,IAAIF,KAAeG;AACvC;AAMO,SAASC,GAAsBC,GAAS;AAE9C,GAAKA,EAAQ,IAAI3H,OAAe,KAAK2H,EAAQ,SAAS,OACrDJ,EAAkBI,GAAS1H,CAAK,IAEhCsH,EAAkBI,GAASxH,CAAW;AAExC;ACjBA,SAASyH,GAAaC,GAAM;AAC3B,MAAIA,MAAS;AAEb,eAAWC,KAAOD;AACjB,OAAKC,EAAI,IAAItI,OAAa,MAAMsI,EAAI,IAAIhH,QAAgB,MAIxDgH,EAAI,KAAKhH,IAET8G;AAAA;AAAA,QAAqCE,EAAK;AAAA,MAAI;AAEhD;AAOO,SAASC,GAAab,GAAQc,GAAeC,GAAqB;AACxE,GAAKf,EAAO,IAAIhH,OAAW,IAC1B8H,EAAc,IAAId,CAAM,KACbA,EAAO,IAAI/G,OAAiB,KACvC8H,EAAoB,IAAIf,CAAM,GAK/BU,GAAaV,EAAO,IAAI,GAGxBK,EAAkBL,GAAQjH,CAAK;AAChC;AC5BO,SAASiI,GAAmBC,GAAOlK,GAAKmK,GAAY;AAC1D,MAAID,KAAS;AAEZ,WAAAlK,EAAI,MAAS,GAGTmK,KAAYA,EAAW,MAAS,GAE7BrK;AAKR,QAAMsK,IAAQC;AAAA,IAAQ,MACrBH,EAAM;AAAA,MACLlK;AAAA;AAAA,MAEAmK;AAAA,IACH;AAAA,EACA;AAIC,SAAOC,EAAM,cAAc,MAAMA,EAAM,YAAW,IAAKA;AACxD;AC1BA,MAAME,KAAmB,CAAA;AAUlB,SAASC,GAASlO,GAAOmO,GAAO;AACtC,SAAO;AAAA,IACN,WAAWC,GAASpO,GAAOmO,CAAK,EAAE;AAAA,EACpC;AACA;AAUO,SAASC,GAASpO,GAAOmO,IAAQ1K,GAAM;AAE7C,MAAI4K,IAAO;AAGX,QAAMC,IAAc,oBAAI,IAAG;AAM3B,WAASC,EAAIC,GAAW;AACvB,QAAIhE,GAAexK,GAAOwO,CAAS,MAClCxO,IAAQwO,GACJH,IAAM;AAET,YAAMI,IAAY,CAACR,GAAiB;AACpC,iBAAWS,KAAcJ;AACxB,QAAAI,EAAW,CAAC,EAAC,GACbT,GAAiB,KAAKS,GAAY1O,CAAK;AAExC,UAAIyO,GAAW;AACd,iBAAS1K,IAAI,GAAGA,IAAIkK,GAAiB,QAAQlK,KAAK;AACjD,UAAAkK,GAAiBlK,CAAC,EAAE,CAAC,EAAEkK,GAAiBlK,IAAI,CAAC,CAAC;AAE/C,QAAAkK,GAAiB,SAAS;AAAA,MAC3B;AAAA,IACD;AAAA,EAEF;AAMA,WAASU,EAAO/K,GAAI;AACnB,IAAA2K,EAAI3K;AAAA;AAAA,MAAqB5D;AAAA,KAAO;AAAA,EACjC;AAOA,WAAS4O,EAAUjL,GAAKmK,IAAarK,GAAM;AAE1C,UAAMiL,IAAa,CAAC/K,GAAKmK,CAAU;AACnC,WAAAQ,EAAY,IAAII,CAAU,GACtBJ,EAAY,SAAS,MACxBD,IAAOF,EAAMI,GAAKI,CAAM,KAAKlL,IAE9BE;AAAA;AAAA,MAAsB3D;AAAA,IAAK,GACpB,MAAM;AACZ,MAAAsO,EAAY,OAAOI,CAAU,GACzBJ,EAAY,SAAS,KAAKD,MAC7BA,EAAI,GACJA,IAAO;AAAA,IAET;AAAA,EACD;AACA,SAAO,EAAE,KAAAE,GAAK,QAAAI,GAAQ,WAAAC,EAAS;AAChC;AAkCO,SAASvB,GAAQwB,GAAQjL,GAAIkL,GAAe;AAClD,QAAMC,IAAS,CAAC,MAAM,QAAQF,CAAM,GAE9BG,IAAeD,IAAS,CAACF,CAAM,IAAIA;AACzC,MAAI,CAACG,EAAa,MAAM,OAAO;AAC9B,UAAM,IAAI,MAAM,sDAAsD;AAEvE,QAAMC,IAAOrL,EAAG,SAAS;AACzB,SAAOsK,GAASY,GAAe,CAACP,GAAKI,MAAW;AAC/C,QAAIO,IAAU;AAEd,UAAMC,IAAS,CAAA;AACf,QAAIC,IAAU,GACVC,IAAU5L;AACd,UAAM6L,IAAO,MAAM;AAClB,UAAIF;AACH;AAED,MAAAC,EAAO;AACP,YAAMtK,IAASnB,EAAGmL,IAASI,EAAO,CAAC,IAAIA,GAAQZ,GAAKI,CAAM;AAC1D,MAAIM,IACHV,EAAIxJ,CAAM,IAEVsK,IAAU,OAAOtK,KAAW,aAAaA,IAAStB;AAAA,IAEpD,GACM8L,IAAgBP,EAAa;AAAA,MAAI,CAACnB,GAAO9J,MAC9C6J;AAAA,QACCC;AAAA,QACA,CAAC7N,MAAU;AACV,UAAAmP,EAAOpL,CAAC,IAAI/D,GACZoP,KAAW,EAAE,KAAKrL,IACdmL,KACHI,EAAI;AAAA,QAEN;AAAA,QACA,MAAM;AACL,UAAAF,KAAW,KAAKrL;AAAA,QACjB;AAAA,MACJ;AAAA,IACA;AACE,WAAAmL,IAAU,IACVI,EAAI,GACG,WAAgB;AACtB,MAAAzL,GAAQ0L,CAAa,GACrBF,EAAO,GAIPH,IAAU;AAAA,IACX;AAAA,EACD,CAAC;AACF;AAuBO,SAASM,GAAI3B,GAAO;AAC1B,MAAI7N;AACJ,SAAA4N,GAAmBC,GAAO,CAAC4B,MAAOzP,IAAQyP,CAAE,EAAC,GAEtCzP;AACR;AClMO,IAAI0P,KAA2B,IAOlCC,KAAmB,IAEnBC,KAAe,OAAO,WAAW;AAY9B,SAASC,GAAUhC,GAAOiC,GAAYjB,GAAQ;AACpD,QAAMhO,IAASgO,EAAAiB,OAAAjB,EAAAiB,KAAuB;AAAA,IACrC,OAAO;AAAA,IACP,QAAQ,gBAAAC,GAAe,MAAS;AAAA,IAChC,aAAatM;AAAA,EACf;AAOC,MAAI5C,EAAM,UAAUgN,KAAS,EAAE+B,MAAgBf;AAI9C,QAHAhO,EAAM,YAAW,GACjBA,EAAM,QAAQgN,KAAS,MAEnBA,KAAS;AACZ,MAAAhN,EAAM,OAAO,IAAI,QACjBA,EAAM,cAAc4C;AAAA,SACd;AACN,UAAIuM,IAA0B;AAE9B,MAAAnP,EAAM,cAAc+M,GAAmBC,GAAO,CAAC3N,MAAM;AACpD,QAAI8P,IAGHnP,EAAM,OAAO,IAAIX,IAEjBqO,EAAI1N,EAAM,QAAQX,CAAC;AAAA,MAErB,CAAC,GAED8P,IAA0B;AAAA,IAC3B;AAMD,SAAInC,KAAS+B,MAAgBf,IACrBoB,GAAUpC,CAAK,IAGhB2B,GAAI3O,EAAM,MAAM;AACxB;AAUO,SAASqP,GAAYrC,GAAOiC,GAAYjB,GAAQ;AAEtD,MAAIhO,IAAQgO,EAAOiB,CAAU;AAE7B,SAAIjP,KAASA,EAAM,UAAUgN,MAE5BhN,EAAM,YAAW,GACjBA,EAAM,cAAc4C,IAGdoK;AACR;AASO,SAASsC,GAAUtC,GAAO7N,GAAO;AACvC,SAAAoQ,GAAiBvC,GAAO7N,CAAK,GACtBA;AACR;AAiBO,SAASqQ,KAAe;AAE9B,QAAMxB,IAAS,CAAA;AAEf,WAASQ,IAAU;AAClB,IAAAiB,GAAS,MAAM;AACd,eAASR,KAAcjB;AAEtB,QADYA,EAAOiB,CAAU,EACzB,YAAW;AAEhB,MAAA9M,GAAgB6L,GAAQe,IAAc;AAAA,QACrC,YAAY;AAAA,QACZ,OAAO;AAAA,MACX,CAAI;AAAA,IACF,CAAC;AAAA,EACF;AAEA,SAAO,CAACf,GAAQQ,CAAO;AACxB;AAOA,SAASe,GAAiBvC,GAAO7N,GAAO;AACvC,EAAA0P,KAA2B;AAE3B,MAAI;AACH,IAAA7B,EAAM,IAAI7N,CAAK;AAAA,EAChB,UAAC;AACA,IAAA0P,KAA2B;AAAA,EAC5B;AACD;AAoDO,SAASa,GAAsB3M,GAAI;AACzC,MAAI4M,IAA4Bb;AAEhC,MAAI;AACH,WAAAA,KAAmB,IACZ,CAAC/L,EAAE,GAAI+L,EAAgB;AAAA,EAC/B,UAAC;AACA,IAAAA,KAAmBa;AAAA,EACpB;AACD;AClLA,IAAIC,KAAc,MAGdC,KAAa,MAGNC,IAAgB,MAMhBC,KAAiB,MAQjBC,IAAe,MAGtBC,KAAwB,MAEjBtE,KAAmB,IAC1BuE,KAAgB,IAQTC,KAAoB,MASpBC,KAAiB;AAE5B,IAAIC,KAAc;AAKlB,IAAIC,KAAM;;AAEH,MAAMC,KAAN,MAAMA,GAAM;AAAA,EAAZ;AAAA,IAAAC,EAAA,MAAAC;AACN,IAAA3Q,EAAA,YAAKwQ;AAGL;AAAA,IAAAE,EAAA,MAAAE,IAAW;AAEX,IAAA5Q,EAAA,gBAAS;AAGT;AAAA,IAAA0Q,EAAA,MAAAG,IAAQ;AAGR;AAAA,IAAAH,EAAA,MAAAI,IAAQ;AAGR;AAAA,IAAA9Q,EAAA,wBAAiB,oBAAI,IAAG;AAQxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,EAAA,iBAAU,oBAAI,IAAG;AAOjB;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,EAAA,kBAAW,oBAAI,IAAG;AAOlB;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,EAAA,mBAAY,oBAAI,IAAG;AAOnB;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA0Q,EAAA,MAAAK,IAAoB,oBAAI,IAAG;AAM3B;AAAA;AAAA;AAAA;AAAA,IAAAL,EAAA,MAAAM,IAAqB,oBAAI,IAAG;AAM5B;AAAA;AAAA;AAAA;AAAA,IAAAN,EAAA,MAAAO,IAAyB,oBAAI,IAAG;AAKhC;AAAA;AAAA;AAAA,IAAAP,EAAA,MAAAQ,IAAW;AAMX;AAAA;AAAA;AAAA;AAAA,IAAAR,EAAA,MAAAS,GAAoB,oBAAI,IAAG;AAO3B;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAT,EAAA,MAAAU,IAAY;AAMZ;AAAA;AAAA;AAAA;AAAA,IAAAV,EAAA,MAAAW,GAAS,CAAA;AAMT;AAAA;AAAA;AAAA;AAAA,IAAAX,EAAA,MAAAY,IAAe,CAAA;AAMf;AAAA;AAAA;AAAA;AAAA,IAAAZ,EAAA,MAAAa,IAAiB,oBAAI,IAAG;AAMxB;AAAA;AAAA;AAAA;AAAA,IAAAb,EAAA,MAAAc,GAAuB,oBAAI,IAAG;AAS9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAd,EAAA,MAAAe,GAAoB,oBAAI,IAAG;AAM3B;AAAA;AAAA;AAAA;AAAA,IAAAf,EAAA,MAAAgB,IAAsB,oBAAI,IAAG;AAE7B,IAAA1R,EAAA,iBAAU;AAEV,IAAA0Q,EAAA,MAAAiB,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BpB,YAAY1F,GAAQ;AACnB,IAAK2F,EAAA,MAAKH,GAAkB,IAAIxF,CAAM,KACrC2F,EAAA,MAAKH,GAAkB,IAAIxF,GAAQ,EAAE,GAAG,CAAA,GAAI,GAAG,CAAA,GAAI,GAEpD2F,EAAA,MAAKF,IAAoB,OAAOzF,CAAM;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAcA,GAAQ4F,IAAW,CAACzF,MAAM,KAAK,SAASA,CAAC,GAAG;AACzD,QAAI0F,IAAUF,EAAA,MAAKH,GAAkB,IAAIxF,CAAM;AAC/C,QAAI6F,GAAS;AACZ,MAAAF,EAAA,MAAKH,GAAkB,OAAOxF,CAAM;AAEpC,eAASG,KAAK0F,EAAQ;AACrB,QAAAxF,EAAkBF,GAAGnH,CAAK,GAC1B4M,EAASzF,CAAC;AAGX,WAAKA,KAAK0F,EAAQ;AACjB,QAAAxF,EAAkBF,GAAGlH,CAAW,GAChC2M,EAASzF,CAAC;AAAA,IAEZ;AACA,IAAAwF,EAAA,MAAKF,IAAoB,IAAIzF,CAAM;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgSA,QAAQ8F,GAAQ1S,GAAO2S,IAAa,IAAO;AAC1C,IAAID,EAAO,MAAMpQ,KAAiB,CAAC,KAAK,SAAS,IAAIoQ,CAAM,KAC1D,KAAK,SAAS,IAAIA,GAAQA,EAAO,CAAC,IAI9BA,EAAO,IAAI/L,QAAiB,MAChC,KAAK,QAAQ,IAAI+L,GAAQ,CAAC1S,GAAO2S,CAAU,CAAC,GAC5C9B,KAAA,QAAAA,EAAc,IAAI6B,GAAQ1S,KAGtB,KAAK,YACT0S,EAAO,IAAI1S;AAAA,EAEb;AAAA,EAEA,WAAW;AACV,IAAA2Q,IAAgB;AAAA,EACjB;AAAA,EAEA,aAAa;AACZ,IAAAA,IAAgB,MAChBE,IAAe;AAAA,EAChB;AAAA,EAEA,QAAQ;AACP,QAAI;AAKH,MAAAE,KAAgB,IAChBJ,IAAgB,MAEhBiC,EAAA,MAAKtB,GAAAuB,IAAL;AAAA,IACD,UAAC;AACA,MAAA3B,KAAc,GACdJ,KAAwB,MACxBE,KAAoB,MACpBC,KAAiB,MACjBF,KAAgB,IAEhBJ,IAAgB,MAChBE,IAAe,MAEfiC,GAAW,MAAK;AAAA,IAOjB;AAAA,EACD;AAAA,EAEA,UAAU;AACT,eAAWlP,KAAM2O,EAAA,MAAKZ,IAAoB,CAAA/N,EAAG,IAAI;AACjD,IAAA2O,EAAA,MAAKZ,IAAmB,MAAK,GAC7BY,EAAA,MAAKX,IAAuB,MAAK,GAEjCgB,EAAA,MAAKtB,GAAAyB,IAAL;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,wBAAwBnG,GAAQ;AAC/B,IAAA2F,EAAA,MAAKN,IAAa,KAAKrF,CAAM;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EA+HA,UAAUoG,GAAUpG,GAAQ;AAG3B,QAFAqG,EAAA,MAAKpB,IAALU,EAAA,MAAKV,MAAY,IAEbmB,GAAU;AACb,UAAIE,IAAyBX,EAAA,MAAKT,GAAkB,IAAIlF,CAAM,KAAK;AACnE,MAAA2F,EAAA,MAAKT,GAAkB,IAAIlF,GAAQsG,IAAyB,CAAC;AAAA,IAC9D;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAUF,GAAUpG,GAAQ;AAG3B,QAFAqG,EAAA,MAAKpB,IAALU,EAAA,MAAKV,MAAY,IAEbmB,GAAU;AACb,UAAIE,IAAyBX,EAAA,MAAKT,GAAkB,IAAIlF,CAAM,KAAK;AAEnE,MAAIsG,MAA2B,IAC9BX,EAAA,MAAKT,GAAkB,OAAOlF,CAAM,IAEpC2F,EAAA,MAAKT,GAAkB,IAAIlF,GAAQsG,IAAyB,CAAC;AAAA,IAE/D;AAEA,IAAIX,EAAA,MAAKD,QACTW,EAAA,MAAKX,IAAoB,KAEzB/F,GAAiB,MAAM;AACtB,MAAA0G,EAAA,MAAKX,IAAoB,KAErB,KAAK,UACR,KAAK,MAAK;AAAA,IAEZ,CAAC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB5E,GAAeC,GAAqB;AACpD,eAAWZ,KAAKW;AACf,MAAA6E,EAAA,MAAKL,IAAe,IAAInF,CAAC;AAG1B,eAAWA,KAAKY;AACf,MAAA4E,EAAA,MAAKJ,GAAqB,IAAIpF,CAAC;AAGhC,IAAAW,EAAc,MAAK,GACnBC,EAAoB,MAAK;AAAA,EAC1B;AAAA;AAAA,EAGA,SAAS/J,GAAI;AACZ,IAAA2O,EAAA,MAAKb,IAAkB,IAAI9N,CAAE;AAAA,EAC9B;AAAA;AAAA,EAGA,UAAUA,GAAI;AACb,IAAA2O,EAAA,MAAKZ,IAAmB,IAAI/N,CAAE;AAAA,EAC/B;AAAA;AAAA,EAGA,eAAeA,GAAI;AAClB,IAAA2O,EAAA,MAAKX,IAAuB,IAAIhO,CAAE;AAAA,EACnC;AAAA,EAEA,4BAA4B;AAC3B,eAAWA,KAAM2O,EAAA,MAAKX,IAAwB,CAAAhO,EAAG,IAAI;AACrD,IAAA2O,EAAA,MAAKX,IAAuB,MAAK;AAAA,EAClC;AAAA,EAEA,UAAU;AACT,YAAQW,EAAA,MAAKR,OAALkB,EAAA,MAAKlB,IAAc/N,GAAQ,IAAI;AAAA,EACxC;AAAA,EAEA,OAAO,SAAS;;AACf,QAAI2M,MAAkB,MAAM;AAC3B,YAAMwC,IAASxC,IAAgB,IAAIS;AACnC,MAAAwB,EAAAtL,IAAA6L,GAAM7B,GAAA8B,IAAN,KAAA9L,IAEI,CAACyJ,MAAiB,CAACvE,MACtBD,GAAiB,MAAM;AACtB,QAAKgG,EAAAY,GAAM5B,OACV4B,EAAM,MAAK;AAAA,MAEb,CAAC;AAAA,IAEH;AAEA,WAAOxC;AAAA,EACR;AAAA,EAEA,QAAQ;AACgF;AACtF,MAAAE,IAAe;AACf;AAAA,IACD;AAAA,EA2CD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAASjE,GAAQ;;AAKhB,QAJAkE,KAAwBlE,IAKvBtF,IAAAsF,EAAO,MAAP,QAAAtF,EAAU,eACTsF,EAAO,KAAKzH,KAASC,KAAgBC,SAAqB,MAC1DuH,EAAO,IAAI5G,QAAkB,GAC7B;AACD,MAAA4G,EAAO,EAAE,aAAaA,CAAM;AAC5B;AAAA,IACD;AAIA,aAFIG,IAAIH,GAEDG,EAAE,WAAW,QAAM;AACzB,MAAAA,IAAIA,EAAE;AACN,UAAIsG,IAAQtG,EAAE;AAKd,UAAIiE,OAAsB,QAAQjE,MAAMrB,MAUrCmB,MAAoB,SAASA,EAAgB,IAAI3H,OAAa,MAC/D,CAACwK;AAED;AAIF,WAAK2D,KAAS7N,KAAcD,QAAoB,GAAG;AAClD,aAAK8N,IAAQ1N,OAAW;AAEvB;AAGD,QAAAoH,EAAE,KAAKpH;AAAA,MACR;AAAA,IACD;AAEA,IAAA4M,EAAA,MAAKP,GAAO,KAAKjF,CAAC;AAAA,EACnB;AA+BD;AAt3BCwE,KAAA,eAKAC,KAAA,eAGAC,KAAA,eAgCAC,KAAA,eAMAC,KAAA,eAMAC,KAAA,eAKAC,KAAA,eAMAC,IAAA,eAOAC,KAAA,eAMAC,IAAA,eAMAC,KAAA,eAMAC,KAAA,eAMAC,IAAA,eASAC,IAAA,eAMAC,KAAA,eAIAC,KAAA,eArHMhB,IAAA,eAuHNgC,KAAY,WAAG;AACd,MAAI,KAAK,QAAS,QAAO;AAEzB,aAAW1G,KAAU2F,EAAA,MAAKT,GAAkB,KAAI,GAAI;AAInD,aAHI/E,IAAIH,GACJ2G,IAAU,IAEPxG,EAAE,WAAW,QAAM;AACzB,UAAIwF,EAAA,MAAKH,GAAkB,IAAIrF,CAAC,GAAG;AAClC,QAAAwG,IAAU;AACV;AAAA,MACD;AAEA,MAAAxG,IAAIA,EAAE;AAAA,IACP;AAEA,QAAI,CAACwG;AACJ,aAAO;AAAA,EAET;AAEA,SAAO;AACR,GAqCAV,KAAQ,WAAG;;AAkBV,MAjBAI,EAAA,MAAK1B,IAAW,KAEZL,OAAgB,QACnB0B,EAAA,MAAKtB,GAAAyB,IAAL,YACAS,GAAmB,IAahB,CAACZ,EAAA,MAAKtB,GAAAgC,IAAL,YAAqB;AACzB,eAAWvG,KAAKwF,EAAA,MAAKL;AACpB,MAAAK,EAAA,MAAKJ,GAAqB,OAAOpF,CAAC,GAClCE,EAAkBF,GAAGnH,CAAK,GAC1B,KAAK,SAASmH,CAAC;AAGhB,eAAWA,KAAKwF,EAAA,MAAKJ;AACpB,MAAAlF,EAAkBF,GAAGlH,CAAW,GAChC,KAAK,SAASkH,CAAC;AAAA,EAEjB;AAEA,QAAM0G,IAAQlB,EAAA,MAAKP;AACnB,EAAAiB,EAAA,MAAKjB,GAAS,CAAA,IAEd,KAAK,MAAK;AAGV,MAAInG,IAAWmF,KAAoB,IAG/B0C,IAAiB,CAAA,GAMjBC,IAAW1C,KAAiB;AAEhC,aAAW2C,KAAQH;AAClB,QAAI;AACH,MAAAb,EAAA,MAAKtB,GAAAuC,IAAL,WAAeD,GAAM/H,GAAS6H;AAAA,IAC/B,SAAS3G,GAAG;AACX,YAAA+G,GAAUF,CAAI,GACR7G;AAAA,IACP;AAMD,MAFA4D,IAAgB,MAEZgD,EAAQ,SAAS,GAAG;AACvB,QAAIR,IAAQ/B,GAAM,OAAM;AACxB,eAAWrE,KAAK4G;AACf,MAAAR,EAAM,SAASpG,CAAC;AAAA,EAElB;AAMA,MAJAiE,KAAoB,MACpBC,KAAiB,MAGb2B,EAAA,MAAKtB,GAAAgC,IAAL,YAAqB;AACxB,IAAAV,EAAA,MAAKtB,GAAAyC,IAAL,WAAoBL,IACpBd,EAAA,MAAKtB,GAAAyC,IAAL,WAAoBlI;AAEpB,eAAW,CAACkB,GAAGiH,CAAC,KAAKzB,EAAA,MAAKH;AACzB,MAAA6B,GAAalH,GAAGiH,CAAC;AAGlB,IAAIL,EAAQ,SAAS;AAAA,IAC0Bf,EAAAtL,IAAAqJ,GAAgBW,GAAAuB,IAAhB,KAAAvL;AAG/C;AAAA,EACD;AAEA,QAAM4M,IAAgBtB,EAAA,MAAKtB,GAAA6C,IAAL;AAEtB,MAAID,GAAe;AAClB,IAAAtB,EAAAwB,IAAAF,GAAc5C,GAAA+C,IAAd,KAAAD,GAAqB;AACrB;AAAA,EACD;AAGA,EAAA7B,EAAA,MAAKL,IAAe,MAAK,GACzBK,EAAA,MAAKJ,GAAqB,MAAK;AAG/B,aAAWvO,KAAM2O,EAAA,MAAKb,IAAmB,CAAA9N,EAAG,IAAI;AAChD,EAAA2O,EAAA,MAAKb,IAAkB,MAAK,GAE5Bd,KAAiB,MACjB0D,GAAqBZ,CAAc,GACnCY,GAAqBzI,CAAO,GAC5B+E,KAAiB,OAEjB2D,IAAAhC,EAAA,MAAKR,QAAL,QAAAwC,EAAgB;AAEhB,MAAIC;AAAA;AAAA;AAAA,IAAkE7D;AAAA;AAmBtE,MAjBI,KAAK,UAAU4B,EAAA,MAAKV,QAAa,KACpCe,EAAA,MAAKtB,GAAAyB,IAAL,YAgBGR,EAAA,MAAKP,GAAO,SAAS,GAAG;AAC3B,IAAIwC,MAAe,SAClBA,IAAa,MACb5B,EAAA,MAAKtB,GAAA8B,IAAL;AAGD,UAAMD,IAAQqB;AACd,IAAAjC,EAAAY,GAAMnB,GAAO,KAAK,GAAGO,EAAA,MAAKP,GAAO,OAAO,CAACyC,MAAM,CAAClC,EAAAY,GAAMnB,GAAO,SAASyC,CAAC,CAAC,CAAC;AAAA,EAC1E;AAEA,EAAID,MAAe,QAClB5B,EAAA8B,IAAAF,GAAWlD,GAAAuB,IAAX,KAAA6B;AAEF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASAb,KAAS,SAACD,GAAM/H,GAAS6H,GAAgB;AACxC,EAAAE,EAAK,KAAKjO;AAIV,WAFIiH,IAASgH,EAAK,OAEXhH,MAAW,QAAM;AACvB,QAAIyG,IAAQzG,EAAO,GACf+H,KAAatB,KAAS9N,IAAgBC,SAAkB,GACxDoP,IAAsBD,MAActB,IAAQ1N,OAAW,GAEvDkP,IAAOD,MAAwBvB,IAAQvN,OAAW,KAAKyM,EAAA,MAAKH,GAAkB,IAAIxF,CAAM;AAE5F,QAAI,CAACiI,KAAQjI,EAAO,OAAO,MAAM;AAChC,MAAI+H,IACH/H,EAAO,KAAKjH,KACD0N,IAAQlO,QAAY,IAC/B0G,EAAQ,KAAKe,CAAM,IAGTkI,GAASlI,CAAM,OACpByG,IAAQ/N,OAAkB,KAAGiN,EAAA,MAAKJ,GAAqB,IAAIvF,CAAM,GACtEmI,GAAcnI,CAAM;AAGrB,UAAIoI,IAAQpI,EAAO;AAEnB,UAAIoI,MAAU,MAAM;AACnB,QAAApI,IAASoI;AACT;AAAA,MACD;AAAA,IACD;AAEA,WAAOpI,MAAW,QAAM;AACvB,UAAI3C,IAAO2C,EAAO;AAElB,UAAI3C,MAAS,MAAM;AAClB,QAAA2C,IAAS3C;AACT;AAAA,MACD;AAEA,MAAA2C,IAASA,EAAO;AAAA,IACjB;AAAA,EACD;AACD,GAEAuH,KAAmB,WAAG;AAGrB,WAFIhB,IAAQZ,EAAA,MAAKf,KAEV2B,MAAU,QAAM;AACtB,QAAI,CAACA,EAAM;AAEV,iBAAW,CAACnT,GAAO,CAAA,EAAG2S,CAAU,CAAC,KAAK,KAAK;AAC1C,YAAIQ,EAAM,QAAQ,IAAInT,CAAK,KAAK,CAAC2S;AAChC,iBAAOQ;AAAA;AAKV,IAAAA,IAAQZ,EAAAY,GAAM3B;AAAA,EACf;AAEA,SAAO;AACR;AAAA;AAAA;AAKA6C,KAAM,SAAClB,GAAO;;AACb,aAAW,CAACT,GAAQ1S,CAAK,KAAKmT,EAAM;AACnC,IAAI,CAAC,KAAK,SAAS,IAAIT,CAAM,KAAKS,EAAM,SAAS,IAAIT,CAAM,KAC1D,KAAK,SAAS,IAAIA,GAAQS,EAAM,SAAS,IAAIT,CAAM,CAAC,GAGrD,KAAK,QAAQ,IAAIA,GAAQ1S,CAAK;AAG/B,aAAW,CAAC4M,GAAQ5I,CAAQ,KAAKmP,EAAM,gBAAgB;AACtD,UAAM8B,IAAI,KAAK,eAAe,IAAIrI,CAAM;AACxC,IAAIqI,KAAGjR,EAAS,QAAQ,KAAKiR,EAAE,OAAO;AAAA,EACvC;AAUA,QAAMC,IAAO,CAAClV,MAAU;AACvB,QAAImV,IAAYnV,EAAM;AACtB,QAAImV,MAAc;AAElB,iBAAWC,KAAYD,GAAW;AACjC,YAAI9B,IAAQ+B,EAAS;AAErB,aAAK/B,IAAQnO,OAAa;AACzB,UAAAgQ;AAAA;AAAA,YAA6BE;AAAA,UAAQ;AAAA,aAC/B;AACN,cAAIxI;AAAA;AAAA,YAAgCwI;AAAA;AAEpC,UAAI/B,KAAS3M,KAAQpB,MAAiB,CAAC,KAAK,eAAe,IAAIsH,CAAM,MACpE2F,EAAA,MAAKJ,GAAqB,OAAOvF,CAAM,GACvCK,EAAkBL,GAAQhH,CAAK,GAC/B,KAAK,SAASgH,CAAM;AAAA,QAEtB;AAAA,MACD;AAAA,EACD;AAEA,aAAW8F,KAAU,KAAK,QAAQ,KAAI;AACrC,IAAAwC,EAAKxC,CAAM;AAGZ,OAAK,SAAS,MAAMS,EAAM,QAAO,CAAE,GACnCP,EAAAtL,IAAA6L,GAAM7B,GAAAyB,IAAN,KAAAzL,IAEAqJ,IAAgB,MAChBiC,EAAA,MAAKtB,GAAAuB,IAAL;AACD;AAAA;AAAA;AAKAkB,KAAc,SAAClI,GAAS;AACvB,WAAS9H,IAAI,GAAGA,IAAI8H,EAAQ,QAAQ9H,KAAK;AACxC,IAAA0J,GAAa5B,EAAQ9H,CAAC,GAAGwO,EAAA,MAAKL,KAAgBK,EAAA,MAAKJ,EAAoB;AAEzE,GA+EAkD,KAAO,WAAG;;AACT,EAAAzC,EAAA,MAAKtB,GAAAyB,IAAL;AAMA,WAASI,IAAQ1C,IAAa0C,MAAU,MAAMA,IAAQZ,EAAAY,GAAM1B,KAAO;AAClE,QAAI6D,IAAanC,EAAM,KAAK,KAAK,IAG7BoC,IAAU,CAAA;AAEd,eAAW,CAAC7C,GAAQ,CAAC1S,GAAO2S,CAAU,CAAC,KAAK,KAAK,SAAS;AACzD,UAAIQ,EAAM,QAAQ,IAAIT,CAAM,GAAG;AAC9B,YAAI8C;AAAA;AAAA,UAA6CrC,EAAM,QAAQ,IAAIT,CAAM,EAAG,CAAC;AAAA;AAE7E,YAAI4C,KAActV,MAAUwV;AAE3B,UAAArC,EAAM,QAAQ,IAAIT,GAAQ,CAAC1S,GAAO2S,CAAU,CAAC;AAAA;AAI7C;AAAA,MAEF;AAEA,MAAA4C,EAAQ,KAAK7C,CAAM;AAAA,IACpB;AAEA,QAAI4C;AAGH,iBAAW,CAAC1I,GAAQ5I,CAAQ,KAAK,KAAK,gBAAgB;AACrD,cAAMiR,IAAI9B,EAAM,eAAe,IAAIvG,CAAM;AACzC,QAAIqI,KAAGjR,EAAS,QAAQ,KAAKiR,EAAE,OAAO;AAAA,MACvC;AAGD,QAAK1C,EAAAY,GAAM5B,KAGX;AAAA,UAAIkE,IAAS,CAAC,GAAGtC,EAAM,QAAQ,KAAI,CAAE,EAAE,OAAO,CAACuC,MAAM,CAAC,KAAK,QAAQ,IAAIA,CAAC,CAAC;AAEzE,UAAID,EAAO,WAAW;AACrB,QAAIH,KAEHnC,EAAM,QAAO;AAAA,eAEJoC,EAAQ,SAAS,GAAG;AAQ9B,YAAID;AACH,qBAAWK,KAAapD,EAAA,MAAKF;AAC5B,YAAAc,EAAM,cAAcwC,GAAW,CAAC5I,MAAM;;AACrC,eAAKA,EAAE,KAAKzH,IAAeoB,SAAY,IACtCyM,EAAM,SAASpG,CAAC,IAEhB6F,EAAAtL,IAAA6L,GAAM7B,GAAAyC,IAAN,KAAAzM,GAAqB,CAACyF,CAAC;AAAA,YAEzB,CAAC;AAIH,QAAAoG,EAAM,SAAQ;AAGd,YAAIyC,IAAS,oBAAI,IAAG,GAGhBC,IAAU,oBAAI,IAAG;AAErB,iBAASnD,KAAU6C;AAClB,UAAAO,GAAapD,GAAQ+C,GAAQG,GAAQC,CAAO;AAG7C,QAAAA,IAAU,oBAAI,IAAG;AACjB,YAAIE,IAAkB,CAAC,GAAG5C,EAAM,QAAQ,MAAM,EAAE;AAAA,UAAO,CAAC6C,MACvD,KAAK,QAAQ,IAAIA,CAAC;AAAA;AAAA,YACgB,KAAK,QAAQ,IAAIA,CAAC,EAAG,CAAC,MAAMA,EAAE;AAAA,cAC7D;AAAA,QACR;AAEI,YAAID,EAAgB,SAAS;AAC5B,qBAAWnJ,KAAU2F,EAAA,MAAKN;AACzB,aACErF,EAAO,KAAK7G,IAAYD,IAAQK,SAAmB,KACpD8P,GAAWrJ,GAAQmJ,GAAiBF,CAAO,OAEtCjJ,EAAO,KAAKlG,KAAQpB,QAAmB,KAC3C2H,EAAkBL,GAAQhH,CAAK,GAC/BuN,EAAM,SAASvG,CAAM,KAErB2F,EAAAY,GAAMjB,IAAe,IAAItF,CAAM;AAQnC,YAAI2F,EAAAY,GAAMnB,GAAO,SAAS,KAAK,CAACO,EAAAY,GAAMb,KAAmB;AACxD,UAAAa,EAAM,MAAK;AAEX,mBAASS,KAAQrB,EAAAY,GAAMnB;AACtB,YAAAY,EAAAtL,IAAA6L,GAAM7B,GAAAuC,IAAN,KAAAvM,GAAgBsM,GAAM,CAAA,GAAI,CAAA;AAG3B,UAAAX,EAAAE,GAAMnB,GAAS,CAAA;AAAA,QAChB;AAEA,QAAAmB,EAAM,WAAU;AAAA,MACjB;AAAA;AAAA,EACD;AACD,GAgNAC,KAAK,WAAG;AACP,EAAI1C,OAAe,OAClBD,KAAcC,KAAa,QAE3BuC,EAAAvC,IAAWe,IAAQ,OACnBwB,EAAA,MAAKzB,IAAQd,MAGdA,KAAa;AACd,GAEAqC,KAAO,WAAG;AACT,MAAImD,IAAO3D,EAAA,MAAKf,KACZvH,IAAOsI,EAAA,MAAKd;AAEhB,EAAIyE,MAAS,OACZzF,KAAcxG,IAEdgJ,EAAAiD,GAAKzE,IAAQxH,IAGVA,MAAS,OACZyG,KAAawF,IAEbjD,EAAAhJ,GAAKuH,IAAQ0E,IAGd,KAAK,SAAS;AACf;AAz3BM,IAAMC,KAAN/E;AAo4BA,SAASgF,GAAUxS,GAAI;AAC7B,MAAIyS,IAAoB7J;AACxB,EAAAA,KAAmB;AAEnB,MAAI;AACH,QAAIzH;AAUJ,SARInB,MACC+M,MAAkB,QAAQ,CAACA,EAAc,WAC5CA,EAAc,MAAK,GAGpB5L,IAASnB,EAAE,QAGC;AAGZ,UAFA6I,GAAW,GAEPkE,MAAkB;AACrB;AAAA;AAAA,UAAyB5L;AAAA;AAG1B,MAAA4L,EAAc,MAAK;AAAA,IACpB;AAAA,EACD,UAAC;AACA,IAAAnE,KAAmB6J;AAAA,EACpB;AACD;AAEA,SAAS7C,KAAsB;AAyB9B,MAAI;AACH8C,IAAAA,GAA8B;AAAA,EAC/B,SAAS3J,GAAO;AAQf,IAAAG,GAAsBH,GAAOmE,EAAqB;AAAA,EACnD;AACD;AAGO,IAAIyF,IAAsB;AAMjC,SAASjC,GAAqBzI,GAAS;AACtC,MAAI2K,IAAS3K,EAAQ;AACrB,MAAI2K,MAAW,GAIf;AAAA,aAFIzS,IAAI,GAEDA,IAAIyS,KAAQ;AAClB,UAAI5J,IAASf,EAAQ9H,GAAG;AAExB,WAAK6I,EAAO,KAAK7G,IAAYD,QAAY,KAAKgP,GAASlI,CAAM,MAC5D2J,IAAsB,oBAAI,IAAG,GAE7BxB,GAAcnI,CAAM,GAQnBA,EAAO,SAAS,QAChBA,EAAO,UAAU,QACjBA,EAAO,UAAU,QACjBA,EAAO,aAAa,QACpBA,EAAO,OAAO,QAGd6J,GAAc7J,CAAM,IAKjB2J,KAAA,gBAAAA,EAAqB,QAAO,IAAG;AAClC,QAAAzD,GAAW,MAAK;AAEhB,mBAAW/F,KAAKwJ,GAAqB;AAEpC,eAAKxJ,EAAE,KAAKhH,IAAYD,QAAY,EAAG;AAIvC,gBAAM4Q,IAAkB,CAAC3J,CAAC;AAC1B,cAAI4J,IAAW5J,EAAE;AACjB,iBAAO4J,MAAa;AACnB,YAAIJ,EAAoB,IAAII,CAAQ,MACnCJ,EAAoB,OAAOI,CAAQ,GACnCD,EAAgB,KAAKC,CAAQ,IAE9BA,IAAWA,EAAS;AAGrB,mBAASC,IAAIF,EAAgB,SAAS,GAAGE,KAAK,GAAGA,KAAK;AACrD,kBAAM7J,IAAI2J,EAAgBE,CAAC;AAE3B,aAAK7J,EAAE,KAAKhH,IAAYD,QAAY,KACpCiP,GAAchI,CAAC;AAAA,UAChB;AAAA,QACD;AAEA,QAAAwJ,EAAoB,MAAK;AAAA,MAC1B;AAAA,IAEF;AAEA,IAAAA,IAAsB;AAAA;AACvB;AAWA,SAAST,GAAa9V,GAAOuV,GAASK,GAAQC,GAAS;AACtD,MAAI,CAAAD,EAAO,IAAI5V,CAAK,MACpB4V,EAAO,IAAI5V,CAAK,GAEZA,EAAM,cAAc;AACvB,eAAWoV,KAAYpV,EAAM,WAAW;AACvC,YAAMqT,IAAQ+B,EAAS;AAEvB,OAAK/B,IAAQnO,OAAa,IACzB4Q;AAAA;AAAA,QAAqCV;AAAA,QAAWG;AAAA,QAASK;AAAA,QAAQC;AAAA,MAAO,KAEvExC,KAAS3M,KAAQpB,QAAmB,MACpC+N,IAAQzN,OAAW,KACpBqQ,GAAWb,GAAUG,GAASM,CAAO,MAErC5I,EAAkBmI,GAAUxP,CAAK,GACjCiR;AAAA;AAAA,QAAuCzB;AAAA,MAAQ;AAAA,IAEjD;AAEF;AASA,SAAS0B,GAAmB9W,GAAO6L,GAAS;AAC3C,MAAI7L,EAAM,cAAc;AAExB,eAAWoV,KAAYpV,EAAM,WAAW;AACvC,YAAMqT,IAAQ+B,EAAS;AAEvB,OAAK/B,IAAQnO,OAAa,IACzB4R;AAAA;AAAA,QAA2C1B;AAAA,QAAWvJ;AAAA,MAAO,KAClDwH,IAAQlN,QAAkB,MACrC8G,EAAkBmI,GAAUxP,CAAK,GACjCiG,EAAQ;AAAA;AAAA,QAA2BuJ;AAAA,MAAQ;AAAA,IAE7C;AACD;AAOA,SAASa,GAAWb,GAAUG,GAASM,GAAS;AAC/C,QAAMkB,IAAUlB,EAAQ,IAAIT,CAAQ;AACpC,MAAI2B,MAAY,OAAW,QAAOA;AAElC,MAAI3B,EAAS,SAAS;AACrB,eAAW5H,KAAO4H,EAAS,MAAM;AAChC,UAAItS,GAAS,KAAKyS,GAAS/H,CAAG;AAC7B,eAAO;AAGR,WAAKA,EAAI,IAAItI,OAAa,KAAK+Q;AAAA;AAAA,QAAmCzI;AAAA,QAAM+H;AAAA,QAASM;AAAA,MAAO;AACvF,eAAAA,EAAQ;AAAA;AAAA,UAA4BrI;AAAA,UAAM;AAAA,QAAI,GACvC;AAAA,IAET;AAGD,SAAAqI,EAAQ,IAAIT,GAAU,EAAK,GAEpB;AACR;AAMO,SAASyB,GAAgBjK,GAAQ;AAClB,EAAC+D,EAAe,SAAS/D,CAAM;AACrD;AAiFA,SAASqH,GAAarH,GAAQ6F,GAAS;AAEtC,MAAK,GAAA7F,EAAO,IAAIrH,OAAmB,MAAMqH,EAAO,IAAIjH,OAAW,IAI/D;AAAA,KAAKiH,EAAO,IAAIhH,OAAW,IAC1B6M,EAAQ,EAAE,KAAK7F,CAAM,KACVA,EAAO,IAAI/G,OAAiB,KACvC4M,EAAQ,EAAE,KAAK7F,CAAM,GAGtBK,EAAkBL,GAAQjH,CAAK;AAG/B,aADIoH,IAAIH,EAAO,OACRG,MAAM;AACZ,MAAAkH,GAAalH,GAAG0F,CAAO,GACvB1F,IAAIA,EAAE;AAAA;AAER;AAMA,SAAS+G,GAAUlH,GAAQ;AAC1B,EAAAK,EAAkBL,GAAQjH,CAAK;AAG/B,WADIoH,IAAIH,EAAO,OACRG,MAAM;AACZ,IAAA+G,GAAU/G,CAAC,GACXA,IAAIA,EAAE;AAER;AAqBO,SAASiK,GAAKpT,GAAI;AAEvBqT,EAAAA,GAAoC,GAGjCtG,MAAkB,QACrBuG,GAAa;AAGd,MAAI/D,IAAQgD,GAAM,OAAM;AACxB,EAAAhD,EAAM,UAAU,IAChBtC,IAAe,oBAAI,IAAG;AAEtB,MAAIsG,IAAY,IACZC,IAAUjE,EAAM,QAAO;AAE3B,SAAAiD,GAAUxS,CAAE,GAEL;AAAA,IACN,QAAQ,YAAY;AACnB,UAAIuT,GAAW;AACd,cAAMC;AACN;AAAA,MACD;AAEA,MAAKjE,EAAM,UACVkE,GAAgB,GAGjBF,IAAY,IAEZhE,EAAM,UAAU;AAGhB,eAAS,CAACT,GAAQ,CAAC1S,CAAK,CAAC,KAAKmT,EAAM;AACnC,QAAAT,EAAO,IAAI1S,GACX0S,EAAO,KAAK4E,GAAuB;AAGpC,MAAAnE,EAAM,SAAQ,GACdA,EAAM,0BAAyB,GAC/BA,EAAM,WAAU,GAOhBiD,GAAU,MAAM;AAEf,YAAImB,IAAgB,oBAAI,IAAG;AAE3B,iBAAS7E,KAAUS,EAAM,QAAQ,KAAI;AACpC,UAAA2D,GAAmBpE,GAAQ6E,CAAa;AAGzC,QAAAC,GAAkBD,CAAa,GAC/BE,GAAmB;AAAA,MACpB,CAAC,GAEDtE,EAAM,MAAK,GACX,MAAMiE;AAAA,IACP;AAAA,IACA,SAAS,MAAM;AAId,eAAS1E,KAAUS,EAAM,QAAQ,KAAI;AACpC,QAAAT,EAAO,KAAK4E,GAAuB;AAGpC,MAAI,CAACH,KAAahE,EAAM,UACvBA,EAAM,QAAO;AAAA,IAEf;AAAA,EACF;AACA;AC13CO,SAASuE,GAAQC,GAAUrI,GAAMsI,GAAOhU,GAAI;AAClD,QAAMqR,IAAIlJ,OAAasB,KAAUwK;AAGjC,MAAIzI,IAAUuI,EAAS,OAAO,CAACzP,MAAM,CAACA,EAAE,OAAO;AAE/C,MAAI0P,EAAM,WAAW,KAAKxI,EAAQ,WAAW,GAAG;AAC/C,IAAAxL,EAAG0L,EAAK,IAAI2F,CAAC,CAAC;AACd;AAAA,EACD;AAEA,MAAI/I;AAAA;AAAA,IAAgCR;AAAA,KAEhCoM,IAAUC,GAAO,GACjBC,IACH5I,EAAQ,WAAW,IAChBA,EAAQ,CAAC,EAAE,UACXA,EAAQ,SAAS,IAChB,QAAQ,IAAIA,EAAQ,IAAI,CAAClH,MAAMA,EAAE,OAAO,CAAC,IACzC;AAGL,WAAS+P,EAAO9I,GAAQ;AACvB,SAAKjD,EAAO,IAAInG,OAAe,GAI/B;AAAA,MAAA+R,EAAO;AAEP,UAAI;AACH,QAAAlU,EAAGuL,CAAM;AAAA,MACV,SAASxC,GAAO;AACf,QAAAG,GAAsBH,GAAOT,CAAM;AAAA,MACpC;AAEA,MAAAgM,GAAa;AAAA;AAAA,EACd;AAEA,MAAIC,IAAoBC,GAAiB;AAGzC,MAAIR,EAAM,WAAW,GAAG;AACK,IAACI,EAC3B,KAAK,MAAMC,EAAO3I,EAAK,IAAI2F,CAAC,CAAC,CAAC,EAC9B,QAAQkD,CAAiB;AAE3B;AAAA,EACD;AAGA,WAASxU,IAAM;AACd,YAAQ,IAAIiU,EAAM,IAAI,CAACS,MAAe,gBAAAC,GAAcD,CAAU,CAAC,CAAC,EAC9D,KAAK,CAACtT,MAAWkT,EAAO,CAAC,GAAG3I,EAAK,IAAI2F,CAAC,GAAG,GAAGlQ,CAAM,CAAC,CAAC,EACpD,MAAM,CAAC4H,MAAUG,GAAsBH,GAAOT,CAAM,CAAC,EACrD,QAAQiM,CAAiB;AAAA,EAC5B;AAEA,EAAIH,IACHA,EAAgB,KAAK,MAAM;AAC1B,IAAAF,EAAO,GACPnU,EAAG,GACHuU,GAAa;AAAA,EACd,CAAC,IAEDvU,EAAG;AAEL;AAeO,SAASoU,KAAU;AACzB,MAAIQ;AAAA;AAAA,IAAyC7M;AAAA,KACzC8M,IAAoB3L,GACpB4L,IAA6B5N,GAC7B+F;AAAA;AAAA,IAAuCD;AAAA;AAM3C,SAAO,SAAiB+H,IAAiB,IAAM;AAC9C,IAAAC,GAAkBJ,CAAe,GACjCK,GAAoBJ,CAAiB,GACrC1N,GAAsB2N,CAA0B,GAE5CC,MAAmBH,EAAgB,IAAIxS,OAAe,MAGzD6K,KAAA,QAAAA,EAAgB,YAChBA,KAAA,QAAAA,EAAgB;AAAA,EAOlB;AACD;AAiHO,SAASsH,GAAcW,IAAmB,IAAM;AACtD,EAAAF,GAAkB,IAAI,GACtBC,GAAoB,IAAI,GACxB9N,GAAsB,IAAI,GACtB+N,MAAkBlI,KAAA,QAAAA,EAAe;AAMtC;AAuFO,SAASyH,KAAoB;AACnC,MAAIxL;AAAA;AAAA,IAAgClB;AAAA,KAChCoN;AAAA;AAAA,IAAoClM,EAAO;AAAA,KAC3CuG;AAAA;AAAA,IAA8BxC;AAAA,KAC9BqC,IAAW8F,EAAS,YAAW;AAEnC,SAAAA,EAAS,qBAAqB,GAAG3F,CAAK,GACtCA,EAAM,UAAUH,GAAUpG,CAAM,GAEzB,MAAM;AACZ,IAAAkM,EAAS,qBAAqB,IAAI3F,CAAK,GACvCA,EAAM,UAAUH,GAAUpG,CAAM;AAAA,EACjC;AACD;AAAA;ACvSO,SAASS,GAAQzJ,GAAI;AAC3B,MAAIyP,IAAQnO,IAAUU;AAEtB,SAAI8F,MAAkB,SAGrBA,EAAc,KAAKrF,KAIL;AAAA,IACd,KAAKwE;AAAA,IACL,MAAM;AAAA,IACN,SAAS;AAAA,IACT,QAAAN;AAAA,IACA,GAAG8I;AAAA,IACH,IAAAzP;AAAA,IACA,WAAW;AAAA,IACX,IAAI;AAAA,IACJ;AAAA;AAAA,MAAqBtB;AAAA;AAAA,IACrB,IAAI;AAAA,IACJ,QAAQoJ;AAAA,IACR,IAAI;AAAA,EACN;AAOA;AAEO,MAAMqN,KAAW,OAAO,UAAU;AAAA;AAUlC,SAAST,GAAc1U,GAAIoV,GAAO3P,GAAU;AAClD,MAAI6C;AAAA;AAAA,IAAuCR;AAAA;AAE3C,EAAIQ,MAAW,QACd+M,GAAsB;AAGvB,MAAI9U;AAAA;AAAA;AAAA,IAA6D;AAAA,KAC7D+I,IAASwF;AAAA;AAAA,IAAyBpQ;AAAA,EAAa,GAK/C4W,IAAiB,CAACrM,GAGlBsM,IAAY,oBAAI,IAAG;AAEvB,SAAAC,GAAa,MAAM;;AAClB,QAAIxM;AAAA;AAAA,MAAgClB;AAAA,OAOhCuJ,IAAIjR,GAAQ;AAChB,IAAAG,IAAU8Q,EAAE;AAEZ,QAAI;AAIH,cAAQ,QAAQrR,EAAE,CAAE,EAClB,KAAKqR,EAAE,SAAS,CAAClI,MAAM;AAGvB,QAAIA,MAAM3F,MAAgB6N,EAAE,OAAOlI,CAAC;AAAA,MACrC,CAAC,EACA,QAAQmL,EAAa;AAAA,IACxB,SAASvL,GAAO;AACf,MAAAsI,EAAE,OAAOtI,CAAK,GACduL,GAAa;AAAA,IACd;AAwBA,QAAI/E;AAAA;AAAA,MAA8BxC;AAAA;AAElC,QAAIuI,GAAgB;AAInB,WAAKtM,EAAO,IAAI5G,QAAkB;AACjC,YAAImS,IAAoBC,GAAiB;AAG1C;AAAA;AAAA,QAA6BlM,EAAO,EAAG;;AACtC,SAAA5E,IAAA6L,EAAM,eAAe,IAAIvG,CAAM,MAA/B,QAAAtF,EAAkC,OAAOyR;AAAA;AAIzC,mBAAW9D,KAAKkE,EAAU;AACzB,UAAAlE,EAAE,OAAO8D,EAAQ;AAInB,MAAAI,EAAU,IAAIlE,CAAC,GACf9B,EAAM,eAAe,IAAIvG,GAAQqI,CAAC;AAAA,IACnC;AAMA,UAAMoE,IAAU,CAACrZ,GAAO2M,IAAQ,WAAc;AAQ7C,MAHAwL,KAAA,QAAAA,KACAgB,EAAU,OAAOlE,CAAC,GAEdtI,MAAUoM,OAEd5F,EAAM,SAAQ,GAEVxG,KACHO,EAAO,KAAKvG,IAGZ2S,GAAapM,GAAQP,CAAK,OAErBO,EAAO,IAAIvG,QAAiB,MAChCuG,EAAO,KAAKvG,KAGb2S,GAAapM,GAAQlN,CAAK,IAc3BmT,EAAM,WAAU;AAAA,IACjB;AAEA,IAAA8B,EAAE,QAAQ,KAAKoE,GAAS,CAACtM,MAAMsM,EAAQ,MAAMtM,KAAK,SAAS,CAAC;AAAA,EAC7D,CAAC,GAEDuD,GAAS,MAAM;AACd,eAAW2E,KAAKkE;AACf,MAAAlE,EAAE,OAAO8D,EAAQ;AAAA,EAEnB,CAAC,GAQM,IAAI,QAAQ,CAACQ,MAAW;AAE9B,aAAStP,EAAKuP,GAAG;AAChB,eAASC,IAAK;AACb,QAAID,MAAMrV,IACToV,EAAOrM,CAAM,IAIbjD,EAAK9F,CAAO;AAAA,MAEd;AAEA,MAAAqV,EAAE,KAAKC,GAAIA,CAAE;AAAA,IACd;AAEA,IAAAxP,EAAK9F,CAAO;AAAA,EACb,CAAC;AACF;AAAA;AAQO,SAASuV,GAAa9V,GAAI;AAChC,QAAMqR,IAAI,gBAAA5H,GAAQzJ,CAAE;AAEE,SAAA+V,GAAoB1E,CAAC,GAEpCA;AACR;AAAA;AAQO,SAAS4C,GAAmBjU,GAAI;AACtC,QAAMsJ,IAAS,gBAAAG,GAAQzJ,CAAE;AACzB,SAAAsJ,EAAO,SAASzC,IACTyC;AACR;AAMO,SAAS0M,GAAwBvM,GAAS;AAChD,MAAIxB,IAAUwB,EAAQ;AAEtB,MAAIxB,MAAY,MAAM;AACrB,IAAAwB,EAAQ,UAAU;AAElB,aAAStJ,IAAI,GAAGA,IAAI8H,EAAQ,QAAQ9H,KAAK;AACxC,MAAA8V;AAAA;AAAA,QAAsChO,EAAQ9H,CAAC;AAAA,MAAC;AAAA,EAElD;AACD;AAcO,SAAS+V,GAAgBzM,GAAS;AACxC,MAAIrN,GACA+Z,IAAqBrO,GACrBQ,IAASmB,EAAQ;AAErB,MACC,CAAC2M,MACD9N,MAAW,QACXmB,EAAQ,MAAM/K;AAAA,GACb4J,EAAO,KAAKnG,IAAYD,QAAY;AAErCmU,WAAAA,GAAe,GAER5M,EAAQ;AAGhB,EAAAsL,GAAkBzM,CAAM;AAqBvB,MAAI;AACH,IAAAmB,EAAQ,KAAK,CAAC7G,IACdoT,GAAwBvM,CAAO,GAC/BrN,IAAQka,GAAgB7M,CAAO;AAAA,EAChC,UAAC;AACA,IAAAsL,GAAkBoB,CAAkB;AAAA,EACrC;AAGD,SAAO/Z;AACR;AAMO,SAASma,GAAe9M,GAAS;AACvC,MAAIrN,IAAQ8Z,GAAgBzM,CAAO;AAEnC,MAAI,CAACA,EAAQ,OAAOrN,CAAK,MACxBqN,EAAQ,KAAKiK,GAAuB,IAMhC,EAAC3G,KAAA,QAAAA,EAAe,YAAWtD,EAAQ,SAAS,UAC3CsD,MAAkB,QAOrBA,EAAc,QAAQtD,GAASrN,GAAO,EAAI,GAC1C4Q,MAAA,QAAAA,GAAgB,QAAQvD,GAASrN,GAAO,OAExCqN,EAAQ,IAAIrN,GAITqN,EAAQ,SAAS,QAAM;AAC1B,IAAAJ,EAAkBI,GAAS1H,CAAK;AAChC;AAAA,EACD;AAMF,EAAIqU,OAMAnJ,MAAiB,QAGhBuJ,GAAe,KAAMzJ,KAAA,QAAAA,EAAe,YACvCE,EAAa,IAAIxD,GAASrN,CAAK,IAGhCoN,GAAsBC,CAAO;AAE/B;AAKO,SAASgN,GAAuBhN,GAAS;;AAC/C,MAAIA,EAAQ,YAAY;AAExB,eAAWN,KAAKM,EAAQ;AAEvB,OAAIN,EAAE,YAAYA,EAAE,SACnBzF,IAAAyF,EAAE,aAAF,QAAAzF,EAAA,KAAAyF,KACAqH,IAAArH,EAAE,OAAF,QAAAqH,EAAM,MAAMhN,KAMR2F,EAAE,OAAO,SAAMA,EAAE,WAAWtJ,IAChCsJ,EAAE,KAAK,MAEPuN,GAAiBvN,GAAG,CAAC,GACrBwN,GAAwBxN,CAAC;AAG5B;AAKO,SAASyN,GAAyBnN,GAAS;AACjD,MAAIA,EAAQ,YAAY;AAExB,eAAWN,KAAKM,EAAQ;AAGvB,MAAIN,EAAE,YAAYA,EAAE,OAAO,QAC1BgI,GAAchI,CAAC;AAGlB;AC3aO,IAAIwK,KAAgB,oBAAI,IAAG;AAG3B,MAAMzE,KAAa,oBAAI,IAAG;AAK1B,SAAS0E,GAAkBtX,GAAG;AACpC,EAAAqX,KAAgBrX;AACjB;AAEA,IAAIua,KAAyB;AAatB,SAAS/H,GAAOxS,GAAGwa,GAAO;AAEhC,MAAIxN,IAAS;AAAA,IACZ,GAAG;AAAA;AAAA,IACH,GAAAhN;AAAA,IACA,WAAW;AAAA,IACX,QAAAqK;AAAA,IACA,IAAI;AAAA,IACJ,IAAI;AAAA,EACN;AASC,SAAO2C;AACR;AAAA;AAQO,SAASyN,EAAMza,GAAGwa,GAAO;AAC/B,QAAMhF,IAAIhD,GAAOxS,CAAQ;AAEzB,SAAAyZ,GAAoBjE,CAAC,GAEdA;AACR;AAAA;AASO,SAAS3F,GAAejB,GAAe8L,IAAY,IAAOC,IAAY,IAAM;;AAClF,QAAMnF,IAAIhD,GAAO5D,CAAa;AAC9B,SAAK8L,MACJlF,EAAE,SAASjL,KAKRC,MAAoBmQ,KAAahQ,MAAsB,QAAQA,EAAkB,MAAM,UACzFvD,IAAAuD,EAAkB,GAAE,MAApBvD,EAAoB,IAAM,CAAA,IAAI,KAAKoO,CAAC,GAG/BA;AACR;AAOO,SAASoF,GAAOpI,GAAQ1S,GAAO;AACrC,SAAAuO;AAAA,IACCmE;AAAA,IACA1E,GAAQ,MAAMwB,GAAIkD,CAAM,CAAC;AAAA,EAC3B,GACQ1S;AACR;AASO,SAASuO,EAAImE,GAAQ1S,GAAO+a,IAAe,IAAO;AACxD,EACClO,MAAoB;AAAA;AAAA,GAGnB,CAACmO,MAAenO,EAAgB,IAAI1G,QAAkB,MACvD4F,GAAQ,MACPc,EAAgB,KAAK3H,IAAUI,IAAeoB,KAAQP,SAAmB,MACzE8U,MAAoB,QAAQ,CAACnY,GAAS,KAAKmY,GAAiBvI,CAAM,MAEnEwI,GAAuB;AAGxB,MAAI1M,IAAYuM,IAAeI,GAAMnb,CAAK,IAAIA;AAM9C,SAAOsZ,GAAa5G,GAAQlE,GAAWyC,EAAc;AACtD;AASO,SAASqI,GAAa5G,GAAQ1S,GAAOob,IAA2B,MAAM;AAC5E,MAAI,CAAC1I,EAAO,OAAO1S,CAAK,GAAG;AAC1B,IAAA8S,GAAW,IAAIJ,GAAQsH,KAAuBha,IAAQ0S,EAAO,CAAC;AAE9D,QAAIS,IAAQgD,GAAM,OAAM;AAiCxB,QAhCAhD,EAAM,QAAQT,GAAQ1S,CAAK,IAgCtB0S,EAAO,IAAIxN,OAAa,GAAG;AAC/B,YAAMmI;AAAA;AAAA,QAAkCqF;AAAA;AAGxC,OAAKA,EAAO,IAAI9M,OAAW,KAC1BkU,GAAgBzM,CAAO,GAKpBwD,MAAiB,QACpBzD,GAAsBC,CAAO;AAAA,IAE/B;AAEA,IAAAqF,EAAO,KAAK4E,GAAuB,GAInC+D,GAAe3I,GAAQ9M,GAAOwV,CAAwB,GAOrDrP,GAAQ,KACRL,MAAkB,SACjBA,EAAc,IAAI/F,OAAW,MAC7B+F,EAAc,KAAKnG,IAAgBC,SAAkB,MAElD8V,MAAqB,OACxBC,GAAqB,CAAC7I,CAAM,CAAC,IAE7B4I,EAAiB,KAAK5I,CAAM,IAI1B,CAACS,EAAM,WAAWoE,GAAc,OAAO,KAAK,CAACkD,MAChDhD,GAAmB;AAAA,EAErB;AAEA,SAAOzX;AACR;AAEO,SAASyX,KAAsB;AACrC,EAAAgD,KAAyB;AAEzB,aAAW7N,KAAU2K,IAAe;AAGnC,KAAK3K,EAAO,IAAIjH,OAAW,KAC1BsH,EAAkBL,GAAQ/G,CAAW;AAGtC,QAAI2V;AAEJ,QAAI;AACH,MAAAA,IAAQ1G,GAASlI,CAAM;AAAA,IACxB,QAAQ;AAIP,MAAA4O,IAAQ;AAAA,IACT;AAEA,IAAIA,KACHzG,GAAcnI,CAAM;AAAA,EAEtB;AAEA,EAAA2K,GAAc,MAAK;AACpB;AAQO,SAAS5I,GAAO+D,GAAQuC,IAAI,GAAG;AACrC,MAAIjV,IAAQwP,GAAIkD,CAAM,GAClB3N,IAASkQ,MAAM,IAAIjV,MAAUA;AAEjC,SAAAuO,EAAImE,GAAQ1S,CAAK,GAGV+E;AACR;AAoBO,SAAS0W,GAAU/I,GAAQ;AACjC,EAAAnE,EAAImE,GAAQA,EAAO,IAAI,CAAC;AACzB;AAQA,SAAS2I,GAAenO,GAAQC,GAAQiO,GAA0B;AACjE,MAAIjG,IAAYjI,EAAO;AACvB,MAAIiI,MAAc;AAKlB,aAHI1J,IAAQM,GAAQ,GAChByK,IAASrB,EAAU,QAEdpR,IAAI,GAAGA,IAAIyS,GAAQzS,KAAK;AAChC,UAAIqR,IAAWD,EAAUpR,CAAC,GACtBsP,IAAQ+B,EAAS;AAGrB,UAAI,GAAC3J,KAAS2J,MAAa1J,IAE3B;AAAA,YAAIgQ,KAAarI,IAAQzN,OAAW;AAOpC,YAJI8V,KACHzO,EAAkBmI,GAAUjI,CAAM,IAG9BkG,IAAQlN,QAAkB;AAI9B,UAAAoR,GAAc;AAAA;AAAA,YAA2BnC;AAAA,UAAQ;AAAA,kBACtC/B,IAAQnO,OAAa,GAAG;AACnC,cAAImI;AAAA;AAAA,YAAkC+H;AAAA;AAEtC,UAAAvE,KAAA,QAAAA,EAAc,OAAOxD,KAEhBgG,IAAQ7M,QAAgB,MAG3B6M,IAAQ3N,MACPgG,MAAkB,SAASA,EAAc,IAAIjF,QAA0B,OAExE2O,EAAS,KAAK5O,KAGf6U,GAAehO,GAASxH,GAAauV,CAAwB;AAAA,QAE/D,WAAWM,GAAW;AACrB,cAAI9O;AAAA;AAAA,YAAgCwI;AAAA;AAEpC,WAAK/B,IAAQ/N,OAAkB,KAAKiR,MAAwB,QAC3DA,EAAoB,IAAI3J,CAAM,GAG3BwO,MAA6B,OAChCA,EAAyB,KAAKxO,CAAM,IAEpCiK,GAAgBjK,CAAM;AAAA,QAExB;AAAA;AAAA,IACD;AACD;AClWO,SAASuO,GAAMnb,GAAO;AAE5B,MAAI,OAAOA,KAAU,YAAYA,MAAU,QAAQ4G,MAAgB5G;AAClE,WAAOA;AAGR,QAAM2b,IAAYtY,GAAiBrD,CAAK;AAExC,MAAI2b,MAAcxY,MAAoBwY,MAAcvY;AACnD,WAAOpD;AAIR,MAAIuV,IAAU,oBAAI,IAAG,GACjBqG,IAAmBhZ,GAAS5C,CAAK,GACjC6b,IAAUnJ,gBAAAA,EAAO,CAAC,GAGlBoJ,IAAiBC,IAOjBC,IAAc,CAACpY,MAAO;AACzB,QAAImY,OAAmBD;AACtB,aAAOlY,EAAE;AAKV,QAAIwR,IAAWvI,GACXgP,IAAUE;AAEd,IAAAnD,GAAoB,IAAI,GACxBqD,GAAmBH,CAAc;AAEjC,QAAI/W,IAASnB,EAAE;AAEf,WAAAgV,GAAoBxD,CAAQ,GAC5B6G,GAAmBJ,CAAO,GAEnB9W;AAAA,EACR;AAEA,SAAI6W,KAGHrG,EAAQ,IAAI,UAAU7C,gBAAAA;AAAAA;AAAAA,IAA6B1S,EAAO;AAAA,EAAa,CAAC,GAwBlE,IAAI;AAAA;AAAA,IAA0BA;AAAA,IAAQ;AAAA,MAC5C,eAAeyP,GAAGyM,GAAMC,GAAY;AACnC,SACC,EAAE,WAAWA,MACbA,EAAW,iBAAiB,MAC5BA,EAAW,eAAe,MAC1BA,EAAW,aAAa,OAMxBC,GAAyB;AAE1B,YAAI1G,IAAIH,EAAQ,IAAI2G,CAAI;AACxB,eAAIxG,MAAM,SACTsG,EAAY,MAAM;AACjB,cAAItG,IAAIhD,gBAAAA,EAAOyJ,EAAW,KAAY;AACtC,iBAAA5G,EAAQ,IAAI2G,GAAMxG,CAAC,GAIZA;AAAA,QACR,CAAC,IAEDnH,EAAImH,GAAGyG,EAAW,OAAO,EAAI,GAGvB;AAAA,MACR;AAAA,MAEA,eAAeE,GAAQH,GAAM;AAC5B,YAAIxG,IAAIH,EAAQ,IAAI2G,CAAI;AAExB,YAAIxG,MAAM;AACT,cAAIwG,KAAQG,GAAQ;AACnB,kBAAM3G,IAAIsG,EAAY,MAAMtJ,gBAAAA,EAAOpQ,CAAoB,CAAC;AACxD,YAAAiT,EAAQ,IAAI2G,GAAMxG,CAAC,GACnB+F,GAAUI,CAAO;AAAA,UAKlB;AAAA;AAEA,UAAAtN,EAAImH,GAAGpT,CAAa,GACpBmZ,GAAUI,CAAO;AAGlB,eAAO;AAAA,MACR;AAAA,MAEA,IAAIQ,GAAQH,GAAMI,GAAU;;AAC3B,YAAIJ,MAAStV;AACZ,iBAAO5G;AAOR,YAAI0V,IAAIH,EAAQ,IAAI2G,CAAI,GACpBK,IAASL,KAAQG;AAkBrB,YAfI3G,MAAM,WAAc,CAAC6G,MAAUjV,IAAArE,GAAeoZ,GAAQH,CAAI,MAA3B,QAAA5U,EAA8B,cAChEoO,IAAIsG,EAAY,MAAM;AACrB,cAAIxC,IAAI2B,GAAMoB,IAASF,EAAOH,CAAI,IAAI5Z,CAAa,GAC/CoT,IAAIhD,gBAAAA,EAAO8G,CAAQ;AAMvB,iBAAO9D;AAAA,QACR,CAAC,GAEDH,EAAQ,IAAI2G,GAAMxG,CAAC,IAGhBA,MAAM,QAAW;AACpB,cAAIxV,IAAIsP,GAAIkG,CAAC;AACb,iBAAOxV,MAAMoC,IAAgB,SAAYpC;AAAA,QAC1C;AAEA,eAAO,QAAQ,IAAImc,GAAQH,GAAMI,CAAQ;AAAA,MAC1C;AAAA,MAEA,yBAAyBD,GAAQH,GAAM;AACtC,YAAIC,IAAa,QAAQ,yBAAyBE,GAAQH,CAAI;AAE9D,YAAIC,KAAc,WAAWA,GAAY;AACxC,cAAIzG,IAAIH,EAAQ,IAAI2G,CAAI;AACxB,UAAIxG,MAAGyG,EAAW,QAAQ3M,GAAIkG,CAAC;AAAA,QAChC,WAAWyG,MAAe,QAAW;AACpC,cAAIzJ,IAAS6C,EAAQ,IAAI2G,CAAI,GACzBlc,IAAQ0S,KAAA,gBAAAA,EAAQ;AAEpB,cAAIA,MAAW,UAAa1S,MAAUsC;AACrC,mBAAO;AAAA,cACN,YAAY;AAAA,cACZ,cAAc;AAAA,cACd,OAAAtC;AAAA,cACA,UAAU;AAAA,YAChB;AAAA,QAEG;AAEA,eAAOmc;AAAA,MACR;AAAA,MAEA,IAAIE,GAAQH,GAAM;;AACjB,YAAIA,MAAStV;AACZ,iBAAO;AAGR,YAAI8O,IAAIH,EAAQ,IAAI2G,CAAI,GACpBM,IAAO9G,MAAM,UAAaA,EAAE,MAAMpT,KAAkB,QAAQ,IAAI+Z,GAAQH,CAAI;AAEhF,YACCxG,MAAM,UACLhK,MAAkB,SAAS,CAAC8Q,MAAOlV,IAAArE,GAAeoZ,GAAQH,CAAI,MAA3B,QAAA5U,EAA8B,WACjE;AACD,UAAIoO,MAAM,WACTA,IAAIsG,EAAY,MAAM;AACrB,gBAAIxC,IAAIgD,IAAMrB,GAAMkB,EAAOH,CAAI,CAAC,IAAI5Z,GAChCoT,IAAIhD,gBAAAA,EAAO8G,CAAQ;AAMvB,mBAAO9D;AAAA,UACR,CAAC,GAEDH,EAAQ,IAAI2G,GAAMxG,CAAC;AAGpB,cAAI1V,IAAQwP,GAAIkG,CAAC;AACjB,cAAI1V,MAAUsC;AACb,mBAAO;AAAA,QAET;AAEA,eAAOka;AAAA,MACR;AAAA,MAEA,IAAIH,GAAQH,GAAMlc,GAAOsc,GAAU;;AAClC,YAAI5G,IAAIH,EAAQ,IAAI2G,CAAI,GACpBM,IAAMN,KAAQG;AAGlB,YAAIT,KAAoBM,MAAS;AAChC,mBAASnY,IAAI/D,GAAO+D;AAAA,UAAmC2R,EAAG,GAAG3R,KAAK,GAAG;AACpE,gBAAI0Y,IAAUlH,EAAQ,IAAIxR,IAAI,EAAE;AAChC,YAAI0Y,MAAY,SACflO,EAAIkO,GAASna,CAAa,IAChByB,KAAKsY,MAIfI,IAAUT,EAAY,MAAMtJ,gBAAAA,EAAOpQ,CAAoB,CAAC,GACxDiT,EAAQ,IAAIxR,IAAI,IAAI0Y,CAAO;AAAA,UAM7B;AAOD,YAAI/G,MAAM;AACT,WAAI,CAAC8G,MAAOlV,KAAArE,GAAeoZ,GAAQH,CAAI,MAA3B,QAAA5U,GAA8B,cACzCoO,IAAIsG,EAAY,MAAMtJ,gBAAAA,EAAO,MAAgB,CAAC,GAK9CnE,EAAImH,GAAGyF,GAAMnb,CAAK,CAAC,GAEnBuV,EAAQ,IAAI2G,GAAMxG,CAAC;AAAA,aAEd;AACN,UAAA8G,IAAM9G,EAAE,MAAMpT;AAEd,cAAIkX,IAAIwC,EAAY,MAAMb,GAAMnb,CAAK,CAAC;AACtC,UAAAuO,EAAImH,GAAG8D,CAAC;AAAA,QACT;AAEA,YAAI2C,IAAa,QAAQ,yBAAyBE,GAAQH,CAAI;AAO9D,YAJIC,KAAA,QAAAA,EAAY,OACfA,EAAW,IAAI,KAAKG,GAAUtc,CAAK,GAGhC,CAACwc,GAAK;AAKT,cAAIZ,KAAoB,OAAOM,KAAS,UAAU;AACjD,gBAAIQ;AAAA;AAAA,cAAoCnH,EAAQ,IAAI,QAAQ;AAAA,eACxD9Q,KAAI,OAAOyX,CAAI;AAEnB,YAAI,OAAO,UAAUzX,EAAC,KAAKA,MAAKiY,GAAG,KAClCnO,EAAImO,IAAIjY,KAAI,CAAC;AAAA,UAEf;AAEA,UAAAgX,GAAUI,CAAO;AAAA,QAClB;AAEA,eAAO;AAAA,MACR;AAAA,MAEA,QAAQQ,GAAQ;AACf,QAAA7M,GAAIqM,CAAO;AAEX,YAAIc,IAAW,QAAQ,QAAQN,CAAM,EAAE,OAAO,CAACrX,MAAQ;AACtD,cAAI0N,IAAS6C,EAAQ,IAAIvQ,CAAG;AAC5B,iBAAO0N,MAAW,UAAaA,EAAO,MAAMpQ;AAAA,QAC7C,CAAC;AAED,iBAAS,CAAC0C,GAAK0N,CAAM,KAAK6C;AACzB,UAAI7C,EAAO,MAAMpQ,KAAiB,EAAE0C,KAAOqX,MAC1CM,EAAS,KAAK3X,CAAG;AAInB,eAAO2X;AAAA,MACR;AAAA,MAEA,iBAAiB;AAChBC,QAAAA,GAAuB;AAAA,MACxB;AAAA,IACF;AAAA,EAAE;AACF;AAeO,SAASC,GAAkB7c,GAAO;AACxC,MAAI;AACH,QAAIA,MAAU,QAAQ,OAAOA,KAAU,YAAY4G,MAAgB5G;AAClE,aAAOA,EAAM4G,EAAY;AAAA,EAE3B,QAAQ;AAAA,EAQR;AAEA,SAAO5G;AACR;AAMO,SAAS8c,GAAG7U,GAAGC,GAAG;AACxB,SAAO,OAAO,GAAG2U,GAAkB5U,CAAC,GAAG4U,GAAkB3U,CAAC,CAAC;AAC5D;ACpXU,IAAC6U,IAMAC,IAGPC,IAEAC;AAMG,SAASC,KAAkB;AACjC,MAAIJ,OAAY,QAIhB;AAAA,IAAAA,KAAU,QAEVC,KAAa,UAAU,KAAK,UAAU,SAAS;AAE/C,QAAII,IAAoB,QAAQ,WAC5BC,IAAiB,KAAK,WACtBC,IAAiB,KAAK;AAG1B,IAAAL,KAAqBha,GAAeoa,GAAgB,YAAY,EAAE,KAElEH,KAAsBja,GAAeoa,GAAgB,aAAa,EAAE,KAEhE/Z,GAAc8Z,CAAiB,MAEdA,EAAmBpW,EAAW,IAAI,QAClCoW,EAAmBrW,EAAgB,IAAI,MACvCqW,EAAmBnW,EAAW,IAAI,QAEtDmW,EAAkB,MAAM,SAGrB9Z,GAAcga,CAAc,MACXA,EAAgBpW,EAAU,IAAI;AAAA;AASpD;AAMO,SAASqW,GAAYvd,IAAQ,IAAI;AACvC,SAAO,SAAS,eAAeA,CAAK;AACrC;AAAA;AAOO,SAASwd,GAAgB5T,GAAM;AACrC;AAAA;AAAA,IAA2CqT,GAAmB,KAAKrT,CAAI;AAAA;AACxE;AAAA;AAOO,SAASG,GAAiBH,GAAM;AACtC;AAAA;AAAA,IAA2CsT,GAAoB,KAAKtT,CAAI;AAAA;AACzE;AASO,SAASoL,GAAMpL,GAAM6T,GAAS;AACpC,MAAI,CAACjU;AACJ,WAAO,gBAAAgU,GAAgB5T,CAAI;AAG5B,MAAIoL,IAAQ,gBAAAwI,GAAgB9T,CAAY;AAGxC,MAAIsL,MAAU;AACb,IAAAA,IAAQtL,EAAa,YAAY6T,IAAa;AAAA,WACpCE,KAAWzI,EAAM,aAAaxN,IAAW;AACnD,QAAIkW,IAAOH,GAAW;AACtB,WAAAvI,KAAA,QAAAA,EAAO,OAAO0I,IACd/T,GAAiB+T,CAAI,GACdA;AAAA,EACR;AAEA,SAAID,KACHE;AAAA;AAAA,IAAsC3I;AAAA,EAAK,GAG5CrL,GAAiBqL,CAAK,GACfA;AACR;AAQO,SAAS4I,GAAYhU,GAAM6T,IAAU,IAAO;AAClD,MAAI,CAACjU,IAAW;AACf,QAAIqU,IAAQ,gBAAAL,GAAgB5T,CAAI;AAGhC,WAAIiU,aAAiB,WAAWA,EAAM,SAAS,KAAW,gBAAA9T,GAAiB8T,CAAK,IAEzEA;AAAA,EACR;AAEA,MAAIJ,GAAS;AAGZ,SAAI/T,KAAA,gBAAAA,EAAc,cAAalC,IAAW;AACzC,UAAIkW,IAAOH,GAAW;AAEtB,aAAA7T,KAAA,QAAAA,EAAc,OAAOgU,IACrB/T,GAAiB+T,CAAI,GACdA;AAAA,IACR;AAEA,IAAAC;AAAA;AAAA,MAAsCjU;AAAA,IAAY;AAAA,EACnD;AAEA,SAAOA;AACR;AASO,SAASoU,GAAQlU,GAAMM,IAAQ,GAAGuT,IAAU,IAAO;AACzD,MAAIM,IAAevU,KAAYE,IAAeE;AAG9C,WAFIoU,GAEG9T;AACN,IAAA8T,IAAeD,GACfA;AAAA,IAA4C,gBAAAhU,GAAiBgU,CAAY;AAG1E,MAAI,CAACvU;AACJ,WAAOuU;AAGR,MAAIN,GAAS;AAGZ,SAAIM,KAAA,gBAAAA,EAAc,cAAavW,IAAW;AACzC,UAAIkW,IAAOH,GAAW;AAItB,aAAIQ,MAAiB,OACpBC,KAAA,QAAAA,EAAc,MAAMN,KAEpBK,EAAa,OAAOL,CAAI,GAEzB/T,GAAiB+T,CAAI,GACdA;AAAA,IACR;AAEA,IAAAC;AAAA;AAAA,MAAsCI;AAAA,IAAY;AAAA,EACnD;AAEA,SAAApU,GAAiBoU,CAAY,GACtBA;AACR;AAOO,SAASE,GAAmBrU,GAAM;AACxC,EAAAA,EAAK,cAAc;AACpB;AAQO,SAASsU,KAAsB;AACf,SAAO;AAK9B;AASO,SAASC,GAAeC,GAAKC,GAAWvB,GAAI;AAElD;AAAA;AAAA,IACC,SAAS,gBAAgBuB,KAAa9b,IAAgB6b,GAFnD,MAE+D;AAAA;AAEpE;AAiCO,SAAST,GAAiBD,GAAM;AACtC;AAAA;AAAA,IAA2BA,EAAK,UAAW,SAAS;AAAA;AACnD;AAGD,MAAIzT,IAAOyT,EAAK;AAEhB,SAAOzT,MAAS,QAAQA,EAAK,aAAazC;AACzC,IAAAyC,EAAK,OAAM,GAEYyT,EAAK;AAAA,IAAqCzT,EAAK,WAEtEA,IAAOyT,EAAK;AAEd;AC3RO,SAASY,GAAUC,GAAKve,GAAO;AACrC,MAAIA,GAAO;AACV,UAAMM,IAAO,SAAS;AACtB,IAAAie,EAAI,YAAY,IAEhBhS,GAAiB,MAAM;AACtB,MAAI,SAAS,kBAAkBjM,KAC9Bie,EAAI,MAAK;AAAA,IAEX,CAAC;AAAA,EACF;AACD;AAQO,SAASC,GAAsBD,GAAK;AAC1C,EAAI/U,MAAa,gBAAAgU,GAAgBe,CAAG,MAAM,QACzCN,GAAmBM,CAAG;AAExB;AAEA,IAAIE,KAA0B;AAEvB,SAASC,KAA0B;AACzC,EAAKD,OACJA,KAA0B,IAC1B,SAAS;AAAA,IACR;AAAA,IACA,CAACE,MAAQ;AAGR,cAAQ,UAAU,KAAK,MAAM;;AAC5B,YAAI,CAACA,EAAI;AACR;AAAA,kBAAW5R;AAAA;AAAA,YAAoC4R,EAAI,OAAQ;AAAA;AACvC,aAACrX,IAAAyF,EAAG5F,QAAH,QAAAG,EAAA,KAAAyF;AAAA,MAGvB,CAAC;AAAA,IACF;AAAA;AAAA,IAEA,EAAE,SAAS,GAAI;AAAA,EAClB;AAEA;ACnBO,SAAS6R,GAAyBhb,GAAI;AAC5C,MAAI4U,IAAoB3L,GACpB0L,IAAkB7M;AACtB,EAAAkN,GAAoB,IAAI,GACxBD,GAAkB,IAAI;AACtB,MAAI;AACH,WAAO/U,EAAE;AAAA,EACV,UAAC;AACA,IAAAgV,GAAoBJ,CAAiB,GACrCG,GAAkBJ,CAAe;AAAA,EAClC;AACD;AAUO,SAASsG,GAAgCla,GAASma,GAAOzF,GAAS0F,IAAW1F,GAAS;AAC5F,EAAA1U,EAAQ,iBAAiBma,GAAO,MAAMF,GAAyBvF,CAAO,CAAC;AACvE,QAAMnD;AAAA;AAAA,IAA2BvR,EAASwC,EAAkB;AAAA;AAC5D,EAAI+O,IAEiBvR,EAASwC,EAAkB,IAAI,MAAM;AACxD,IAAA+O,EAAI,GACJ6I,EAAS,EAAI;AAAA,EACd,IAEoBpa,EAASwC,EAAkB,IAAI,MAAM4X,EAAS,EAAI,GAGvEL,GAAuB;AACxB;ACrBO,SAASM,GAAgB5W,GAAM;AACrC,EAAIsD,MAAkB,SACjBmB,MAAoB,QACvBoS,GAAoB,GAGrBC,GAA2B,IAGxBlF,MACHmF,GAAyB;AAE3B;AAMA,SAASC,GAAYxS,GAAQyS,GAAe;AAC3C,MAAIC,IAAcD,EAAc;AAChC,EAAIC,MAAgB,OACnBD,EAAc,OAAOA,EAAc,QAAQzS,KAE3C0S,EAAY,OAAO1S,GACnBA,EAAO,OAAO0S,GACdD,EAAc,OAAOzS;AAEvB;AAOA,SAAS2S,EAAcC,GAAM5b,GAAI;AAChC,MAAIsI,IAASR;AASb,EAAIQ,MAAW,SAASA,EAAO,IAAIpG,OAAW,MAC7C0Z,KAAQ1Z;AAIT,MAAI8G,IAAS;AAAA,IACZ,KAAK/B;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,GAAG2U,IAAO5Z,IAAQF;AAAA,IAClB,OAAO;AAAA,IACP,IAAA9B;AAAA,IACA,MAAM;AAAA,IACN,MAAM;AAAA,IACN,QAAAsI;AAAA,IACA,GAAGA,KAAUA,EAAO;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,IAAI;AAAA,IACJ,IAAI;AAAA,EACN;AAMC,EAAAyE,KAAA,QAAAA,EAAe,wBAAwB/D;AAGvC,MAAIG,IAAIH;AAER,OAAK4S,IAAOra,QAAY;AACvB,IAAI6L,OAAsB,OAEzBA,GAAkB,KAAKpE,CAAM,IAG7BuJ,GAAM,OAAM,EAAG,SAASvJ,CAAM;AAAA,WAErBhJ,MAAO,MAAM;AACvB,QAAI;AACH,MAAAmR,GAAcnI,CAAM;AAAA,IACrB,SAASG,GAAG;AACX,YAAA8M,GAAejN,CAAM,GACfG;AAAA,IACP;AAKA,IACCA,EAAE,SAAS,QACXA,EAAE,aAAa,QACfA,EAAE,UAAU,QACZA,EAAE,UAAUA,EAAE;AAAA,KACbA,EAAE,IAAI1G,QAAsB,MAE7B0G,IAAIA,EAAE,QACDyS,IAAOla,OAAkB,MAAMka,IAAOtZ,QAAwB,KAAK6G,MAAM,SAC7EA,EAAE,KAAK7G;AAAA,EAGV;AAEA,MAAI6G,MAAM,SACTA,EAAE,SAASb,GAEPA,MAAW,QACdkT,GAAYrS,GAAGb,CAAM,GAKrBW,MAAoB,SACnBA,EAAgB,IAAI3H,OAAa,MACjCsa,IAAOha,QAAiB,IACxB;AACD,QAAI6H;AAAA;AAAA,MAAkCR;AAAA;AACtC,KAACQ,EAAQ,YAARA,EAAQ,UAAY,KAAI,KAAKN,CAAC;AAAA,EAChC;AAGD,SAAOH;AACR;AAMO,SAASwN,KAAkB;AACjC,SAAOvN,MAAoB,QAAQ,CAACmO;AACrC;AAKO,SAAS1K,GAAS1M,GAAI;AAC5B,QAAMgJ,IAAS2S,EAAcna,IAAe,IAAI;AAChD,SAAA6H,EAAkBL,GAAQjH,CAAK,GAC/BiH,EAAO,WAAWhJ,GACXgJ;AACR;AAMO,SAAS6S,GAAY7b,GAAI;AAC/B,EAAAob,GAAyB;AAUzB,MAAI3L;AAAA;AAAA,IAA+B3H,EAAe;AAAA,KAC9CgU,IAAQ,CAAC7S,MAAoBwG,IAAQ9N,OAAmB,MAAM8N,IAAQrN,QAAkB;AAE5F,MAAI0Z,GAAO;AAEV,QAAI3U;AAAA;AAAA,MAA2CF;AAAA;AAC/C,KAACE,EAAQ,MAARA,EAAQ,IAAM,KAAI,KAAKnH,CAAE;AAAA,EAC3B;AAEC,WAAOkI,GAAmBlI,CAAE;AAE9B;AAKO,SAASkI,GAAmBlI,GAAI;AACtC,SAAO2b,EAAcpa,KAASmB,IAAa1C,CAAE;AAC9C;AAOO,SAAS+b,GAAgB/b,GAAI;AACnC,SAAAob,GAA6B,GAMtBO,EAAcna,KAAgBkB,IAAa1C,CAAE;AACrD;AAYO,SAASgc,GAAYhc,GAAI;AAC/B,EAAAuS,GAAM,OAAM;AACZ,QAAMvJ,IAAS2S,EAAc/Z,KAAca,IAAkBzC,CAAE;AAE/D,SAAO,MAAM;AACZ,IAAAiW,GAAejN,CAAM;AAAA,EACtB;AACD;AAOO,SAASiT,GAAejc,GAAI;AAClC,EAAAuS,GAAM,OAAM;AACZ,QAAMvJ,IAAS2S,EAAc/Z,KAAca,IAAkBzC,CAAE;AAE/D,SAAO,CAACkc,IAAU,OACV,IAAI,QAAQ,CAACvG,MAAW;AAC9B,IAAIuG,EAAQ,QACXC,GAAanT,GAAQ,MAAM;AAC1B,MAAAiN,GAAejN,CAAM,GACrB2M,EAAO,MAAS;AAAA,IACjB,CAAC,KAEDM,GAAejN,CAAM,GACrB2M,EAAO,MAAS;AAAA,EAElB,CAAC;AAEH;AAMO,SAAS3M,GAAOhJ,GAAI;AAC1B,SAAO2b,EAAcpa,IAAQvB,CAAE;AAChC;AAOO,SAASoc,GAAkBzS,GAAM3J,GAAI;AAC3C,MAAImH;AAAA;AAAA,IAAiDF;AAAA,KAGjDoV,IAAQ,EAAE,QAAQ,MAAM,KAAK,IAAO,MAAA1S,EAAI;AAE5C,EAAAxC,EAAQ,EAAE,EAAE,KAAKkV,CAAK,GAEtBA,EAAM,SAASC,GAAc,MAAM;AAKlC,QAJA3S,EAAI,GAIA,CAAA0S,EAAM,KAEV;AAAA,MAAAA,EAAM,MAAM;AAEZ,UAAIrT;AAAA;AAAA,QAAgClB;AAAA;AAMpC,UAAI;AACH,QAAAiN,GAAkB/L,EAAO,MAAM,GAC/BoB,GAAQpK,CAAE;AAAA,MACX,UAAC;AACA,QAAA+U,GAAkB/L,CAAM;AAAA,MACzB;AAAA;AAAA,EACD,CAAC;AACF;AAEO,SAASuT,KAA0B;AACzC,MAAIpV;AAAA;AAAA,IAAiDF;AAAA;AAErD,EAAAqV,GAAc,MAAM;AAEnB,aAASD,KAASlV,EAAQ,EAAE,GAAG;AAC9B,MAAAkV,EAAM,KAAI;AAEV,UAAIrT,IAASqT,EAAM;AAInB,OAAKrT,EAAO,IAAIjH,OAAW,KAAKiH,EAAO,SAAS,QAC/CK,EAAkBL,GAAQ/G,CAAW,GAGlCiP,GAASlI,CAAM,KAClBmI,GAAcnI,CAAM,GAGrBqT,EAAM,MAAM;AAAA,IACb;AAAA,EACD,CAAC;AACF;AAMO,SAAS7G,GAAaxV,GAAI;AAChC,SAAO2b,EAAc7Y,KAAQL,IAAkBzC,CAAE;AAClD;AAMO,SAASsc,GAActc,GAAIyP,IAAQ,GAAG;AAC5C,SAAOkM,EAAcna,KAAgBiO,GAAOzP,CAAE;AAC/C;AAQO,SAASwc,GAAgBxc,GAAI0L,IAAO,CAAA,GAAIsI,IAAQ,CAAA,GAAID,IAAW,IAAI;AACzE,EAAAD,GAAQC,GAAUrI,GAAMsI,GAAO,CAACzI,MAAW;AAC1C,IAAAoQ,EAAcna,IAAe,MAAMxB,EAAG,GAAGuL,EAAO,IAAIK,EAAG,CAAC,CAAC;AAAA,EAC1D,CAAC;AACF;AAmBO,SAAS6Q,GAAMzc,GAAIyP,IAAQ,GAAG;AACpC,MAAIzG,IAAS2S,EAAcja,IAAe+N,GAAOzP,CAAE;AAInD,SAAOgJ;AACR;AAMO,SAAS0T,GAAQ1c,GAAIyP,IAAQ,GAAG;AACtC,MAAIzG,IAAS2S,EAAcla,KAAiBgO,GAAOzP,CAAE;AAIrD,SAAOgJ;AACR;AAKO,SAAS2T,GAAO3c,GAAI;AAC1B,SAAO2b,EAAcha,IAAgBc,IAAkBzC,CAAE;AAC1D;AAKO,SAAS4c,GAAwB5T,GAAQ;AAC/C,MAAI0D,IAAW1D,EAAO;AACtB,MAAI0D,MAAa,MAAM;AACtB,UAAMmQ,IAA+BzG,IAC/BxB,IAAoB3L;AAC1B,IAAA6T,GAAyB,EAAI,GAC7B9H,GAAoB,IAAI;AACxB,QAAI;AACH,MAAAtI,EAAS,KAAK,IAAI;AAAA,IACnB,UAAC;AACA,MAAAoQ,GAAyBD,CAA4B,GACrD7H,GAAoBJ,CAAiB;AAAA,IACtC;AAAA,EACD;AACD;AAOO,SAAS+B,GAAwBrN,GAAQyT,IAAa,IAAO;AACnE,MAAI/T,IAASM,EAAO;AAGpB,OAFAA,EAAO,QAAQA,EAAO,OAAO,MAEtBN,MAAW,QAAM;AACvB,UAAMgU,IAAahU,EAAO;AAE1B,IAAIgU,MAAe,QAClBhC,GAAyB,MAAM;AAC9B,MAAAgC,EAAW,MAAMxZ,EAAc;AAAA,IAChC,CAAC;AAGF,QAAI6C,IAAO2C,EAAO;AAElB,KAAKA,EAAO,IAAIpH,QAAiB,IAEhCoH,EAAO,SAAS,OAEhBiN,GAAejN,GAAQ+T,CAAU,GAGlC/T,IAAS3C;AAAA,EACV;AACD;AAMO,SAAS4W,GAA8B3T,GAAQ;AAGrD,WAFIN,IAASM,EAAO,OAEbN,MAAW,QAAM;AACvB,QAAI3C,IAAO2C,EAAO;AAClB,KAAKA,EAAO,IAAIrH,OAAmB,KAClCsU,GAAejN,CAAM,GAEtBA,IAAS3C;AAAA,EACV;AACD;AAOO,SAAS4P,GAAejN,GAAQ+T,IAAa,IAAM;AACzD,MAAIG,IAAU;AAEd,GACEH,MAAe/T,EAAO,IAAIxG,QAAiB,MAC5CwG,EAAO,UAAU,QACjBA,EAAO,MAAM,QAAQ,SAErBmU;AAAA,IAAkBnU,EAAO,MAAM;AAAA;AAAA,IAAoCA,EAAO,MAAM;AAAA,EAAG,GACnFkU,IAAU,KAGX7T,EAAkBL,GAAQ3G,EAAU,GACpCsU,GAAwB3N,GAAQ+T,KAAc,CAACG,CAAO,GACtDxG,GAAiB1N,GAAQ,CAAC;AAE1B,MAAIoU,IAAcpU,EAAO,SAASA,EAAO,MAAM;AAE/C,MAAIoU,MAAgB;AACnB,eAAWC,KAAcD;AACxB,MAAAC,EAAW,KAAI;AAIjB,EAAAT,GAAwB5T,CAAM,GAE9BA,EAAO,KAAK3G,IACZ2G,EAAO,KAAK7G;AAEZ,MAAImG,IAASU,EAAO;AAGpB,EAAIV,MAAW,QAAQA,EAAO,UAAU,QACvCuK,GAAc7J,CAAM,GASrBA,EAAO,OACNA,EAAO,OACPA,EAAO,WACPA,EAAO,MACPA,EAAO,OACPA,EAAO,KACPA,EAAO,QACPA,EAAO,KACPA,EAAO,IACN;AACH;AAOO,SAASmU,GAAkBnX,GAAMsX,GAAK;AAC5C,SAAOtX,MAAS,QAAM;AAErB,QAAIK,IAAOL,MAASsX,IAAM,OAAO,gBAAAnX,GAAiBH,CAAI;AAEtD,IAAAA,EAAK,OAAM,GACXA,IAAOK;AAAA,EACR;AACD;AAOO,SAASwM,GAAc7J,GAAQ;AACrC,MAAIV,IAASU,EAAO,QAChBsJ,IAAOtJ,EAAO,MACd3C,IAAO2C,EAAO;AAElB,EAAIsJ,MAAS,SAAMA,EAAK,OAAOjM,IAC3BA,MAAS,SAAMA,EAAK,OAAOiM,IAE3BhK,MAAW,SACVA,EAAO,UAAUU,MAAQV,EAAO,QAAQjC,IACxCiC,EAAO,SAASU,MAAQV,EAAO,OAAOgK;AAE5C;AAYO,SAAS6J,GAAanT,GAAQ4F,GAAU2O,IAAU,IAAM;AAE9D,MAAIH,IAAc,CAAA;AAElB,EAAAI,GAAexU,GAAQoU,GAAa,EAAI;AAExC,MAAIpd,IAAK,MAAM;AACd,IAAIud,KAAStH,GAAejN,CAAM,GAC9B4F,KAAUA,EAAQ;AAAA,EACvB,GAEI6O,IAAYL,EAAY;AAC5B,MAAIK,IAAY,GAAG;AAClB,QAAIC,IAAQ,MAAM,EAAED,KAAazd,EAAE;AACnC,aAASqd,KAAcD;AACtB,MAAAC,EAAW,IAAIK,CAAK;AAAA,EAEtB;AACC,IAAA1d,EAAE;AAEJ;AAOA,SAASwd,GAAexU,GAAQoU,GAAaO,GAAO;AACnD,OAAK3U,EAAO,IAAI9G,OAAW,GAC3B;AAAA,IAAA8G,EAAO,KAAK9G;AAEZ,QAAI,IAAI8G,EAAO,SAASA,EAAO,MAAM;AAErC,QAAI,MAAM;AACT,iBAAWqU,KAAc;AACxB,SAAIA,EAAW,aAAaM,MAC3BP,EAAY,KAAKC,CAAU;AAO9B,aAFIjM,IAAQpI,EAAO,OAEZoI,MAAU,QAAM;AACtB,UAAI8I,IAAU9I,EAAM;AAIpB,WAAKA,EAAM,IAAIxP,QAAiB,GAAG;AAClC,YAAIgc,KACFxM,EAAM,IAAI9O,QAAwB;AAAA;AAAA;AAAA,SAIjC8O,EAAM,IAAIzP,OAAmB,MAAMqH,EAAO,IAAItH,OAAkB;AAInE,QAAA8b,GAAepM,GAAOgM,GAAaQ,IAAcD,IAAQ,EAAK;AAAA,MAC/D;AAEA,MAAAvM,IAAQ8I;AAAA,IACT;AAAA;AACD;AAOO,SAAS2D,GAAc7U,GAAQ;AACrC,EAAA8U,GAAgB9U,GAAQ,EAAI;AAC7B;AAMA,SAAS8U,GAAgB9U,GAAQ2U,GAAO;AACvC,OAAK3U,EAAO,IAAI9G,OAAW,GAC3B;AAAA,IAAA8G,EAAO,KAAK9G,IAMP8G,EAAO,IAAIjH,OAAW,MAC1BsH,EAAkBL,GAAQhH,CAAK,GAC/BuQ,GAAM,OAAM,EAAG,SAASvJ,CAAM;AAK/B,aAFIoI,IAAQpI,EAAO,OAEZoI,MAAU,QAAM;AACtB,UAAI8I,IAAU9I,EAAM,MAChBwM,KAAexM,EAAM,IAAI9O,QAAwB,MAAM8O,EAAM,IAAIzP,OAAmB;AAIxF,MAAAmc,GAAgB1M,GAAOwM,IAAcD,IAAQ,EAAK,GAClDvM,IAAQ8I;AAAA,IACT;AAEA,QAAI9J,IAAIpH,EAAO,SAASA,EAAO,MAAM;AAErC,QAAIoH,MAAM;AACT,iBAAWiN,KAAcjN;AACxB,SAAIiN,EAAW,aAAaM,MAC3BN,EAAW,GAAE;AAAA;AAIjB;AAUO,SAASU,GAAY/U,GAAQgV,GAAU;AAC7C,MAAKhV,EAAO;AAMZ,aAHIhD,IAAOgD,EAAO,MAAM,OACpBsU,IAAMtU,EAAO,MAAM,KAEhBhD,MAAS,QAAM;AAErB,UAAIK,IAAOL,MAASsX,IAAM,OAAO,gBAAAnX,GAAiBH,CAAI;AAEtD,MAAAgY,EAAS,OAAOhY,CAAI,GACpBA,IAAOK;AAAA,IACR;AACD;ACrqBA,IAAI4X,KAAqB,IAEd7H,KAAuB;AAG3B,SAAS0G,GAAyB1gB,GAAO;AAC/C,EAAAga,KAAuBha;AACxB;AAGU,IAAC6M,IAAkB,MAElBmO,IAAa;AAGjB,SAASpC,GAAoBxD,GAAU;AAC7C,EAAAvI,IAAkBuI;AACnB;AAGU,IAAC1J,IAAgB;AAGpB,SAASiN,GAAkB/L,GAAQ;AACzC,EAAAlB,IAAgBkB;AACjB;AAOO,IAAIqO,IAAkB;AAGtB,SAAStB,GAAoB3Z,GAAO;AAC1C,EAAI6M,MAAoB,SACnBoO,MAAoB,OACvBA,IAAkB,CAACjb,CAAK,IAExBib,EAAgB,KAAKjb,CAAK;AAG7B;AAQO,IAAI8hB,IAAW,MAEXC,IAAe,GAOfzG,IAAmB;AAGvB,SAASC,GAAqBvb,GAAO;AAC3C,EAAAsb,IAAmBtb;AACpB;AAMO,IAAIgiB,KAAgB,GAGvBC,KAAe,GAERlG,KAAiBkG;AAGrB,SAAShG,GAAmBjc,GAAO;AACzC,EAAA+b,KAAiB/b;AAClB;AAEO,SAASsX,KAA0B;AACzC,SAAO,EAAE0K;AACV;AAQO,SAASlN,GAASM,GAAU;AAClC,MAAI/B,IAAQ+B,EAAS;AAErB,OAAK/B,IAAQzN,OAAW;AACvB,WAAO;AAOR,MAJIyN,IAAQnO,MACXkQ,EAAS,KAAK,CAAC5O,MAGX6M,IAAQxN,OAAiB,GAAG;AAIhC,aAHIqc;AAAA;AAAA,MAAuC9M,EAAS;AAAA,OAChDoB,IAAS0L,EAAa,QAEjBne,IAAI,GAAGA,IAAIyS,GAAQzS,KAAK;AAChC,UAAIoe,IAAaD,EAAane,CAAC;AAM/B,UAJI+Q;AAAA;AAAA,QAAiCqN;AAAA,WACpChI;AAAA;AAAA,QAAuCgI;AAAA,MAAU,GAG9CA,EAAW,KAAK/M,EAAS;AAC5B,eAAO;AAAA,IAET;AAEA,KACE/B,IAAQ3N,OAAe;AAAA;AAAA,IAGxBmL,MAAiB,QAEjB5D,EAAkBmI,GAAUzP,CAAK;AAAA,EAEnC;AAEA,SAAO;AACR;AAOA,SAASyc,GAA2ClV,GAAQN,GAAQgH,IAAO,IAAM;AAChF,MAAIuB,IAAYjI,EAAO;AACvB,MAAIiI,MAAc,QAEM,EAAA8F,MAAoB,QAAQnY,GAAS,KAAKmY,GAAiB/N,CAAM;AAIzF,aAASnJ,IAAI,GAAGA,IAAIoR,EAAU,QAAQpR,KAAK;AAC1C,UAAIqR,IAAWD,EAAUpR,CAAC;AAE1B,OAAKqR,EAAS,IAAIlQ,OAAa,IAC9Bkd;AAAA;AAAA,QAAmEhN;AAAA,QAAWxI;AAAA,QAAQ;AAAA,MAAK,IACjFA,MAAWwI,MACjBxB,IACH3G,EAAkBmI,GAAUxP,CAAK,KACtBwP,EAAS,IAAIzP,OAAW,KACnCsH,EAAkBmI,GAAUvP,CAAW,GAExCgR;AAAA;AAAA,QAAuCzB;AAAA,MAAQ;AAAA,IAEjD;AACD;AAGO,SAAS8E,GAAgB9E,GAAU;;AACzC,MAAIiN,IAAgBP,GAChBQ,IAAwBP,GACxBQ,IAA4BjH,GAC5B9C,IAAoB3L,GACpB2V,IAAmBvH,GACnBxC,IAA6B5N,GAC7B4X,IAAsBzH,GACtB0H,IAA0B3G,IAE1B1I,IAAQ+B,EAAS;AAErB,EAAA0M;AAAA,EAA0C,MAC1CC,IAAe,GACfzG,IAAmB,MACnBzO,KAAmBwG,KAAS9N,IAAgBC,SAAkB,IAAI4P,IAAW,MAE7E6F,IAAkB,MAClBnQ,GAAsBsK,EAAS,GAAG,GAClC4F,IAAa,IACbe,KAAiB,EAAEkG,IAEf7M,EAAS,OAAO,SACnBwJ,GAAyB,MAAM;AACC,IAACxJ,EAAS,GAAI,MAAMhO,EAAc;AAAA,EAClE,CAAC,GAEDgO,EAAS,KAAK;AAGf,MAAI;AACH,IAAAA,EAAS,KAAK3O;AACd,QAAI7C;AAAA;AAAA,MAA8BwR,EAAS;AAAA,OACvCrQ,IAASnB,EAAE;AACf,IAAAwR,EAAS,KAAKpP;AACd,QAAIuH,IAAO6H,EAAS,MAIhBuN,IAAUhS,KAAA,gBAAAA,EAAe;AAE7B,QAAImR,MAAa,MAAM;AACtB,UAAI/d;AAMJ,UAJK4e,KACJrI,GAAiBlF,GAAU2M,CAAY,GAGpCxU,MAAS,QAAQwU,IAAe;AAEnC,aADAxU,EAAK,SAASwU,IAAeD,EAAS,QACjC/d,IAAI,GAAGA,IAAI+d,EAAS,QAAQ/d;AAChC,UAAAwJ,EAAKwU,IAAehe,CAAC,IAAI+d,EAAS/d,CAAC;AAAA;AAGpC,QAAAqR,EAAS,OAAO7H,IAAOuU;AAGxB,UAAI1H,GAAe,MAAOhF,EAAS,IAAI1P,OAAe;AACrD,aAAK3B,IAAIge,GAAche,IAAIwJ,EAAK,QAAQxJ;AACvC,YAACuD,IAAAiG,EAAKxJ,CAAC,GAAE,cAARuD,EAAQ,YAAc,CAAA,IAAI,KAAK8N,CAAQ;AAAA,IAG3C,MAAO,CAAI,CAACuN,KAAWpV,MAAS,QAAQwU,IAAexU,EAAK,WAC3D+M,GAAiBlF,GAAU2M,CAAY,GACvCxU,EAAK,SAASwU;AAMf,QACChW,GAAQ,KACRuP,MAAqB,QACrB,CAACN,KACDzN,MAAS,SACR6H,EAAS,KAAKlQ,IAAUW,IAAcD,QAAY;AAEnD,WAAK7B,IAAI,GAAGA;AAAA,MAA6BuX,EAAkB,QAAQvX;AAClE,QAAAqe;AAAA,UACC9G,EAAiBvX,CAAC;AAAA;AAAA,UACKqR;AAAA,QAC5B;AAQE,QAAIoD,MAAsB,QAAQA,MAAsBpD,GAAU;AAKjE,UAJA6M,MAIIzJ,EAAkB,SAAS;AAC9B,iBAASzU,IAAI,GAAGA,IAAIue,GAAuBve,KAAK;AAC/C,UAAAyU,EAAkB,KAAKzU,CAAC,EAAE,KAAKke;AAIjC,UAAII,MAAkB;AACrB,mBAAW7U,KAAO6U;AACjB,UAAA7U,EAAI,KAAKyU;AAIX,MAAI3G,MAAqB,SACpBiH,MAA8B,OACjCA,IAA4BjH,IAE5BiH,EAA0B,KAAK;AAAA,MAA4BjH,CAAiB;AAAA,IAG/E;AAEA,YAAKlG,EAAS,IAAIzO,QAAiB,MAClCyO,EAAS,KAAKzO,KAGR5B;AAAA,EACR,SAAS4H,GAAO;AACf,WAAOD,GAAaC,CAAK;AAAA,EAC1B,UAAC;AACA,IAAAyI,EAAS,KAAK3O,IACdqb,IAAWO,GACXN,IAAeO,GACfhH,IAAmBiH,GACnB1V,IAAkB2L,GAClByC,IAAkBuH,GAClB1X,GAAsB2N,CAA0B,GAChDuC,IAAayH,GACb1G,KAAiB2G;AAAA,EAClB;AACD;AAQA,SAASE,GAAgB1V,GAAQiV,GAAY;AAC5C,MAAIhN,IAAYgN,EAAW;AAC3B,MAAIhN,MAAc,MAAM;AACvB,QAAI0N,IAAQhgB,GAAS,KAAKsS,GAAWjI,CAAM;AAC3C,QAAI2V,MAAU,IAAI;AACjB,UAAIC,IAAa3N,EAAU,SAAS;AACpC,MAAI2N,MAAe,IAClB3N,IAAYgN,EAAW,YAAY,QAGnChN,EAAU0N,CAAK,IAAI1N,EAAU2N,CAAU,GACvC3N,EAAU,IAAG;AAAA,IAEf;AAAA,EACD;AAIA,MACCA,MAAc,SACbgN,EAAW,IAAIjd,OAAa;AAAA;AAAA;AAAA,GAI5B4c,MAAa,QAAQ,CAAChf,GAAS,KAAKgf,GAAUK,CAAU,IACxD;AACD,QAAI9U;AAAA;AAAA,MAAkC8U;AAAA;AAItC,KAAK9U,EAAQ,IAAI3H,OAAe,MAC/B2H,EAAQ,KAAK3H,GACb2H,EAAQ,KAAK,CAAC7G,KAQX6G,EAAQ,MAAM/K,KACjB8K,GAAsBC,CAAO,GAI9BgN,GAAuBhN,CAAO,GAG9BiN,GAAiBjN,GAAS,CAAC;AAAA,EAC5B;AACD;AAOO,SAASiN,GAAiBpN,GAAQ6V,GAAa;AACrD,MAAIb,IAAehV,EAAO;AAC1B,MAAIgV,MAAiB;AAErB,aAASne,IAAIgf,GAAahf,IAAIme,EAAa,QAAQne;AAClD,MAAA6e,GAAgB1V,GAAQgV,EAAane,CAAC,CAAC;AAEzC;AAMO,SAASgR,GAAcnI,GAAQ;AACrC,MAAIyG,IAAQzG,EAAO;AAEnB,OAAKyG,IAAQtN,OAAe,GAI5B;AAAA,IAAAkH,EAAkBL,GAAQjH,CAAK;AAE/B,QAAI4S,IAAkB7M,GAClBsX,IAAsBnB;AAE1B,IAAAnW,IAAgBkB,GAChBiV,KAAqB;AAUrB,QAAI;AACH,OAAKxO,KAAS/N,IAAeD,SAAqB,IACjDwb,GAA8BjU,CAAM,IAEpC2N,GAAwB3N,CAAM,GAG/B4T,GAAwB5T,CAAM;AAC9B,UAAI0D,IAAW4J,GAAgBtN,CAAM;AACrC,MAAAA,EAAO,WAAW,OAAO0D,KAAa,aAAaA,IAAW,MAC9D1D,EAAO,KAAKoV;AAId,UAAAxU;AAAE,MAAI7K,MAAOgI,OAAsBiC,EAAO,IAAIhH,OAAW,KAAKgH,EAAO;AAAA,IAQpE,UAAC;AACA,MAAAiV,KAAqBmB,GACrBtX,IAAgB6M;AAAA,IAMjB;AAAA;AACD;AAMO,eAAe0K,KAAO;AAW5B,QAAM,QAAQ,QAAO,GAIrB7M,GAAS;AACV;AAQO,SAASgB,KAAU;AACzB,SAAOjB,GAAM,OAAM,EAAG,QAAO;AAC9B;AAOO,SAAS3G,GAAItC,GAAQ;AAC3B,MAAImG,IAAQnG,EAAO,GACfyF,KAAcU,IAAQnO,OAAa;AAKvC,MAAI2H,MAAoB,QAAQ,CAACmO,GAAY;AAI5C,QAAIkI,IAAYxX,MAAkB,SAASA,EAAc,IAAI3F,OAAe;AAE5E,QAAI,CAACmd,MAAcjI,MAAoB,QAAQ,CAACnY,GAAS,KAAKmY,GAAiB/N,CAAM,IAAI;AACxF,UAAIK,IAAOV,EAAgB;AAE3B,WAAKA,EAAgB,IAAIpG,QAA0B;AAElD,QAAIyG,EAAO,KAAK+U,OACf/U,EAAO,KAAK+U,IAKRH,MAAa,QAAQvU,MAAS,QAAQA,EAAKwU,CAAY,MAAM7U,IAChE6U,MACUD,MAAa,OACvBA,IAAW,CAAC5U,CAAM,IAElB4U,EAAS,KAAK5U,CAAM;AAAA,WAGhB;AAMN,QAAAL,EAAgB,SAAhBA,EAAgB,OAAS,CAAA,IACpB/J,GAAS,KAAK+J,EAAgB,MAAMK,CAAM,KAC9CL,EAAgB,KAAK,KAAKK,CAAM;AAGjC,YAAIiI,IAAYjI,EAAO;AAEvB,QAAIiI,MAAc,OACjBjI,EAAO,YAAY,CAACL,CAAe,IACxB/J,GAAS,KAAKqS,GAAWtI,CAAe,KACnDsI,EAAU,KAAKtI,CAAe;AAAA,MAEhC;AAAA,IACD;AAAA,EACD;AAsDA,MAAImN,MAAwBlH,GAAW,IAAI5F,CAAM;AAChD,WAAO4F,GAAW,IAAI5F,CAAM;AAG7B,MAAIyF,GAAY;AACf,QAAItF;AAAA;AAAA,MAAkCH;AAAA;AAEtC,QAAI8M,IAAsB;AACzB,UAAIha,IAAQqN,EAAQ;AAIpB,eACGA,EAAQ,IAAI1H,OAAW,KAAK0H,EAAQ,cAAc,QACpD8V,GAAsB9V,CAAO,OAE7BrN,IAAQ8Z,GAAgBzM,CAAO,IAGhCyF,GAAW,IAAIzF,GAASrN,CAAK,GAEtBA;AAAA,IACR;AAIA,QAAIojB,KACF/V,EAAQ,IAAI3H,OAAe,KAC5B,CAACsV,KACDnO,MAAoB,SACnBgV,OAAuBhV,EAAgB,IAAInH,OAAe,IAExD2d,KAAUhW,EAAQ,IAAIrH,QAAkB;AAE5C,IAAI8O,GAASzH,CAAO,MACf+V,MAGH/V,EAAQ,KAAK3H,IAGdyU,GAAe9M,CAAO,IAGnB+V,KAAkB,CAACC,MACtB7I,GAAyBnN,CAAO,GAChCiW,GAAUjW,CAAO;AAAA,EAEnB;AAEA,MAAIwD,KAAA,QAAAA,EAAc,IAAI3D;AACrB,WAAO2D,EAAa,IAAI3D,CAAM;AAG/B,OAAKA,EAAO,IAAIvG,QAAiB;AAChC,UAAMuG,EAAO;AAGd,SAAOA,EAAO;AACf;AAOA,SAASoW,GAAUjW,GAAS;AAG3B,MAFAA,EAAQ,KAAK3H,GAET2H,EAAQ,SAAS;AAErB,eAAWG,KAAOH,EAAQ;AACzB,OAACG,EAAI,cAAJA,EAAI,YAAc,KAAI,KAAKH,CAAO,IAE9BG,EAAI,IAAItI,OAAa,MAAMsI,EAAI,IAAI9H,OAAe,MACtD8U;AAAA;AAAA,QAAiDhN;AAAA,MAAG,GACpD8V;AAAA;AAAA,QAAkC9V;AAAA,MAAG;AAGxC;AAGA,SAAS2V,GAAsB9V,GAAS;AACvC,MAAIA,EAAQ,MAAM/K,EAAe,QAAO;AACxC,MAAI+K,EAAQ,SAAS,KAAM,QAAO;AAElC,aAAWG,KAAOH,EAAQ;AAKzB,QAJIyF,GAAW,IAAItF,CAAG,MAIjBA,EAAI,IAAItI,OAAa,KAAKie;AAAA;AAAA,MAA8C3V;AAAA;AAC5E,aAAO;AAIT,SAAO;AACR;AA4BO,SAASQ,GAAQpK,GAAI;AAC3B,MAAI6e,IAAsBzH;AAC1B,MAAI;AACH,WAAAA,IAAa,IACNpX,EAAE;AAAA,EACV,UAAC;AACA,IAAAoX,IAAayH;AAAA,EACd;AACD;AAQO,SAASc,GAAgBvjB,GAAO;AACtC,MAAI,SAAOA,KAAU,YAAY,CAACA,KAASA,aAAiB;AAI5D,QAAI4G,MAAgB5G;AACnB,MAAAwjB,GAAUxjB,CAAK;AAAA,aACL,CAAC,MAAM,QAAQA,CAAK;AAC9B,eAASgF,KAAOhF,GAAO;AACtB,cAAMkc,IAAOlc,EAAMgF,CAAG;AACtB,QAAI,OAAOkX,KAAS,YAAYA,KAAQtV,MAAgBsV,KACvDsH,GAAUtH,CAAI;AAAA,MAEhB;AAAA;AAEF;AASO,SAASsH,GAAUxjB,GAAOyjB,IAAU,oBAAI,IAAG,GAAI;AACrD,MACC,OAAOzjB,KAAU,YACjBA,MAAU;AAAA,EAEV,EAAEA,aAAiB,gBACnB,CAACyjB,EAAQ,IAAIzjB,CAAK,GACjB;AACD,IAAAyjB,EAAQ,IAAIzjB,CAAK,GAGbA,aAAiB,QACpBA,EAAM,QAAO;AAEd,aAASgF,KAAOhF;AACf,UAAI;AACH,QAAAwjB,GAAUxjB,EAAMgF,CAAG,GAAGye,CAAO;AAAA,MAC9B,QAAY;AAAA,MAEZ;AAED,UAAMC,IAAQrgB,GAAiBrD,CAAK;AACpC,QACC0jB,MAAU,OAAO,aACjBA,MAAU,MAAM,aAChBA,MAAU,IAAI,aACdA,MAAU,IAAI,aACdA,MAAU,KAAK,WACd;AACD,YAAMC,IAAczgB,GAAgBwgB,CAAK;AACzC,eAAS1e,KAAO2e,GAAa;AAC5B,cAAMnU,IAAMmU,EAAY3e,CAAG,EAAE;AAC7B,YAAIwK;AACH,cAAI;AACH,YAAAA,EAAI,KAAKxP,CAAK;AAAA,UACf,QAAY;AAAA,UAEZ;AAAA,MAEF;AAAA,IACD;AAAA,EACD;AACD;ACr0BO,MAAM4jB,KAAW;AAGjB,SAASC,GAAgBC,GAAiBC,GAAe;;AAC9D,EAAAD,EAAG,QAAQ,QAAQF,KACnBtc,IAAAwc,EAAG,SAAQ,YAAXxc,EAAW,UAAY,YACvBwc,EAAG,QAAQ,cAAcC;AAC3B;AASA,MAAMC,KAAc,gBACdC,KAAiB;AAQvB,SAASC,GACP7H,GACA8H,GACAC,GACO;AACP,QAAMC,IAAShI,KAAA,gBAAAA,EAAQ,QAAQ;AAC/B,MAAIgI,MAAW,UAAUA,MAAW,QAAS,QAAOA;AAEpD,OADKF,KACL,OAAW,eAAiB,IAAa,QAAOC,KAAWH;AAC3D,QAAM/jB,IAAI,aAAa,QAAQ8jB,EAAW;AAC1C,SAAO9jB,MAAM,UAAUA,MAAM,UAAUA,IAAKkkB,KAAWH;AACzD;AAEA,SAASK,GAAMtQ,GAAUqI,GAA4B;AACnD,MAAIA,GAAQ;AACV,IAAAwH,GAAgBxH,GAAQrI,CAAC;AACzB;AAAA,EACF;AACA,EAAA,OAAW,WAAa,OACtB6P,GAAgB,SAAS,iBAAiB7P,CAAC;AAC/C;AAEA,SAASmQ,GAAQnQ,GAAUuQ,GAAkB;AAC3C,EAAKA,MACL,OAAW,eAAiB,OAC5B,aAAa,QAAQP,IAAahQ,CAAC;AACrC;;AAEA,MAAMwQ,GAAW;AAAA,EAAjB;AACY,IAAAnT,EAAA,MAAAoT,IAAAC,gBAAAA,EAAcT,EAAO;AAC/B,IAAAtjB,EAAA,gBAA6B;AAC7B,IAAAA,EAAA,sBAAe;AAAA;AAAA,MAFf,UAAA;;;MAAA,QAAAX,GAAA;;;EAIA,KAAK2kB,IAAA,IAA6B;AAChC,SAAK,SAASA,EAAK,UAAU,MAC7B,KAAK,eAAeA,EAAK,WAAW,IACpC,KAAK,UAAUT,GAAK,KAAK,QAAQ,KAAK,cAAcS,EAAK,OAAO,GAChEL,GAAM,KAAK,SAAS,KAAK,MAAM;AAAA,EACjC;AAAA,EAEA,IAAItQ,GAAU;AACZ,SAAK,UAAUA,GACfsQ,GAAMtQ,GAAG,KAAK,MAAM,GACpBmQ,GAAQnQ,GAAG,KAAK,YAAY;AAAA,EAC9B;AAAA,EAEA,SAAS;AACP,SAAK,IAAI,KAAK,YAAY,SAAS,UAAU,MAAM;AAAA,EACrD;AACF;AApBYyQ,KAAA;AAsBL,MAAMG,KAAQ,IAAIJ,GAAA;AC/DzB,SAASK,GAASX,GAAoD;AACpE,MAAI;AACF,UAAMhkB,IAAIgkB,EAAA;AACV,WAAO,OAAOhkB,KAAM,YAAYA,EAAE,SAAS,IAAIA,IAAI;AAAA,EACrD,QAAQ;AACN;AAAA,EACF;AACF;AAEA,SAAS4kB,GAAe5kB,GAAmB;AACzC,SAAOA,EAAE,WAAW,GAAG,IAAIA,EAAE,MAAM,CAAC,IAAIA;AAC1C;AAEO,SAAS6kB,KAA2B;AACzC,SAAO;AAAA,IACL,SAASD,GAAeD,GAAS,MAAM,OAAkB,KAAK,WAAW;AAAA,IACzE,QAAQA,GAAS,MAAM,SAAkB,KAAK;AAAA,IAC9C,WAAWA,GAAS,MAAM,SAAqB,KAAK;AAAA,EAAA;AAExD;AAGO,MAAMG,KAAyBD,KAAgB,SClBzCE,KAAgD,OAAO,OAAO;AAAA,EACzE,KAAK;AAAA,EACL,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,WAAW;AACb,CAAC,GAaKC,KAA4D;AAAA,EAChE,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,SAAS;AAAA,EACT,gBAAgB;AAAA,EAChB,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,KAAK;AAAA,EACL,gBAAgB;AAAA,EAChB,YAAY;AACd;AAQO,SAASC,GAAuBC,GAA0C;;AAC/E,QAAMjlB,IAA0B,EAAE,GAAG8kB,GAAA;AACrC,aAAWtd,KAAQyd,EAAI,YAAY,CAAA,GAAI;AACrC,UAAMpgB,IAAMkgB,KAAgB5d,IAAAK,KAAA,gBAAAA,EAAM,gBAAN,gBAAAL,EAAA,KAAAK,OAAyB,EAAE;AACvD,IAAI3C,MAAK7E,EAAI6E,CAAG,IAAI;AAAA,EACtB;AACA,aAAW,CAAC2C,GAAM0d,CAAE,KAAK,OAAO,QAAQD,EAAI,gBAAgB,CAAA,CAAE,GAAG;AAC/D,UAAMpgB,IAAMkgB,GAAgBvd,EAAK,YAAA,CAAa;AAC9C,IAAI3C,MAAK7E,EAAI6E,CAAG,IAAIqgB,MAAO;AAAA,EAC7B;AACA,SAAOllB;AACT;ACmJA,MAAMmlB,yBAAoC,IAAA,GACpCC,yBAAqC,IAAA;AAE3C,SAASC,GAAqC,GAAqB;AAEjE,UADgB,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,GAC1C,SAAS,oCAAoC;AAC9D;AAUA,SAASC,GAAmB,GAAqB;AAC/C,QAAMC,IAAU,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;AACzD,SAAO,WAAW,KAAKA,CAAO,KAAKA,EAAQ,SAAS,iBAAiB;AACvE;AAEA,SAASC,GAAmCC,GAAwB;AAClE,SAAO,IAAI;AAAA,IACT,4DAA4DA,CAAO;AAAA,EAAA;AAEvE;AAEA,SAASC,GAAqB7lB,GAA6C;AACzE,MAAI,CAACA,KAAS,OAAOA,KAAU,SAAU,QAAO;AAChD,QAAM8lB,IAAY9lB;AAClB,SACE,OAAO8lB,EAAU,QAAS,YAC1BA,EAAU,KAAK,SAAS,KACxB,OAAOA,EAAU,QAAS,YAC1BA,EAAU,KAAK,SAAS,MACvBA,EAAU,WAAW,UAAa,OAAOA,EAAU,UAAW;AAEnE;AAoBA,gBAAgBC,GACdzlB,GAC6B;AAC7B,QAAM0lB,IAAS1lB,EAAK,UAAA,GACd2lB,IAAU,IAAI,YAAA;AACpB,MAAIC,IAAM;AACV,MAAI;AACF,eAAS;AACP,YAAM,EAAE,MAAAC,GAAM,OAAAnmB,EAAA,IAAU,MAAMgmB,EAAO,KAAA;AACrC,UAAIG,EAAM;AACV,MAAAD,KAAOD,EAAQ,OAAOjmB,GAAO,EAAE,QAAQ,IAAM;AAC7C,UAAIomB;AACJ,cAAQA,IAAKF,EAAI,QAAQ;AAAA,CAAI,OAAO,MAAI;AACtC,cAAMG,IAAOH,EAAI,MAAM,GAAGE,CAAE,EAAE,KAAA;AAC9B,QAAAF,IAAMA,EAAI,MAAME,IAAK,CAAC,GAClBC,MAAM,MAAM,KAAK,MAAMA,CAAI;AAAA,MACjC;AAAA,IACF;AACA,UAAMC,IAAOJ,EAAI,KAAA;AACjB,IAAII,MAAM,MAAM,KAAK,MAAMA,CAAI;AAAA,EACjC,UAAA;AACE,IAAAN,EAAO,YAAA;AAAA,EACT;AACF;AAEA,MAAMO,KAAY;AAQX,SAASC,GAAgBnc,GAAmC;;AACjE,MAAI,MAAM,QAAQA,CAAI,UAAUA,EAAK;AACrC,MAAIA,KAAQ,OAAOA,KAAS,UAAU;AACpC,UAAM4K,IAAI5K;AAIV,QAAI,OAAO4K,EAAE,gBAAiB,iBAAiBA,EAAE;AACjD,QAAI,MAAM,SAAQ3N,IAAA2N,EAAE,WAAF,gBAAA3N,EAAU,OAAO,EAAG,QAAO2N,EAAE,OAAO,QAAQ;AAAA,EAChE;AAEF;AAOO,SAASwR,GAAU,GAAoB;AAC5C,MAAI,aAAa,MAAO,QAAO,EAAE,WAAW,OAAO,CAAC;AACpD,MAAI,OAAO,KAAM,SAAU,QAAO;AAClC,MAAI,KAAK,OAAO,KAAM,UAAU;AAC9B,UAAMC,IAAK,EAA4B;AACvC,QAAI,OAAOA,KAAM,YAAYA,EAAG,QAAOA;AACvC,QAAI;AACF,YAAMhR,IAAI,KAAK,UAAU,CAAC;AAC1B,UAAIA,KAAKA,MAAM,KAAM,QAAOA;AAAA,IAC9B,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO,OAAO,CAAC;AACjB;AAWA,eAAsBiR,GACpBC,GACAC,GACAlC,IAAmD,CAAA,GAC7B;;AACtB,QAAMmC,IAAYnC,EAAK,SAAS,EAAE,QAAQA,EAAK,WAAW;AAC1D,MAAI,CAAC4B,GAAU,KAAKM,CAAG;AACrB,WAAOC,IAAYF,EAAO,MAAMC,GAAKC,CAAS,IAAIF,EAAO,MAAMC,CAAG;AACpE,MAAI;AACF,UAAMnR,IAAI,MAAMkR,EAAO,mBAAmBC,GAAKlC,CAAI;AACnD,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAOkC;AAAA,MACP,cAAcnR,EAAE;AAAA,MAChB,QAAQ;AAAA,QACN,SAASA,EAAE;AAAA,QACX,SAASA,EAAE,KAAK;AAAA,UAAI,CAACqR,MACnBA,EAAI,UACJ,OAAOA,EAAI,UAAW,aACrB,WAAWA,KACV,WAAWA,KACX,WAAWA,KACX,oBAAoBA,KACjBA,IACD,EAAE,QAAQA,EAAA;AAAA,QAAI;AAAA,MACpB;AAAA,MAEF,UAAU;AAAA,MACV,WAAWrR,EAAE;AAAA,IAAA;AAAA,EAEjB,SAAS3I,GAAG;AACV,SACEzF,IAAAqd,EAAK,WAAL,QAAArd,EAAa,WACZyF,aAAa,SAASA,EAAE,SAAS;AAElC,YAAMA;AAER,WAAO+Z,IAAYF,EAAO,MAAMC,GAAKC,CAAS,IAAIF,EAAO,MAAMC,CAAG;AAAA,EACpE;AACF;AAEO,MAAMG,GAAU;AAAA,EAKrB,YAAYpB,GAAiBjB,IAAyB,IAAI;AAJjD,IAAAhkB,EAAA;AACQ,IAAAA,EAAA;AACA,IAAAA,EAAA;AAGf,SAAK,UAAUilB,EAAQ,QAAQ,OAAO,EAAE,GACxC,KAAK,UAAUjB,EAAK,SACpB,KAAK,UAAUA,EAAK,SAAS,WAAW,MAAM,KAAK,UAAU;AAAA,EAC/D;AAAA,EAEA,MAAc,KAAQsC,GAAcC,GAAgC;AAClE,UAAMC,IAAM,GAAG,KAAK,OAAO,GAAGF,CAAI,IAC5BG,IAAkC;AAAA,MACtC,gBAAgB;AAAA,IAAA;AAElB,WAAO,OAAOA,GAAS,KAAK,OAA6C,GACzE,OAAO,OAAOA,GAASF,KAAA,gBAAAA,EAAM,OAA6C;AAM1E,UAAMG,KAAOH,KAAA,gBAAAA,EAAM,WAAU,OACvBI,IAAY,KAAK,IAAA,GACjBnZ,IAAQ,YAAY,IAAA,GACpBoZ,IAAUlnB,GAAgB6mB,KAAA,gBAAAA,EAAM,IAAI,GACpCM,IAAU,MAAM,KAAK,MAAM,YAAY,IAAA,IAAQrZ,CAAK;AAE1D,QAAI/J;AACJ,QAAI;AACF,MAAAA,IAAM,MAAM,KAAK,QAAQ+iB,GAAK,EAAE,GAAGD,GAAM,SAAAE,GAAS;AAAA,IACpD,SAASra,GAAG;AACV,YAAA9L,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAAomB;AAAA,QACA,QAAQJ;AAAA,QACR,WAAAK;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,SAAAD;AAAA,QACA,OAAOd,GAAU1Z,CAAC;AAAA,MAAA,CACnB,GACKA;AAAA,IACR;AAEA,QAAI,CAAC3I,EAAI,IAAI;AACX,YAAM9D,IAAO,MAAM8D,EAAI,OAAO,MAAM,MAAM,EAAE,GACtCshB,IAAU,GAAG2B,CAAI,IAAIJ,CAAI,MAAM7iB,EAAI,MAAM,IAAI9D,EAAK,MAAM,GAAG,GAAG,CAAC;AACrE,YAAAW,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAAomB;AAAA,QACA,QAAQJ;AAAA,QACR,WAAAK;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,QAAQpjB,EAAI;AAAA,QACZ,SAAAmjB;AAAA,QACA,OAAO7B;AAAA,MAAA,CACR,GACK,IAAI,MAAMA,CAAO;AAAA,IACzB;AAEA,UAAMrb,IAAQ,MAAMjG,EAAI,KAAA,GAClBqjB,IAAWjB,GAAgBnc,CAAI;AACrC,WAAApJ,GAAW,OAAO;AAAA;AAAA;AAAA,MAGhB,MAAMwmB,MAAa,SAAY,SAAS;AAAA,MACxC,MAAAJ;AAAA,MACA,QAAQJ;AAAA,MACR,WAAAK;AAAA,MACA,YAAYE,EAAA;AAAA,MACZ,IAAI;AAAA,MACJ,QAAQpjB,EAAI;AAAA,MACZ,GAAIqjB,MAAa,SAAY,CAAA,IAAK,EAAE,UAAAA,EAAA;AAAA,MACpC,SAAAF;AAAA,IAAA,CACD,GACMld;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,MAAMqd,GAAkBC,GAAmC;AAC/D,UAAMC,IAAW,IAAI,IAAI,KAAK,OAAO;AACrC,QACEA,EAAS,YACTA,EAAS,YACTA,EAAS,UACTA,EAAS,QACRA,EAAS,aAAa,YACrB,EACEA,EAAS,aAAa,WACtB,CAAC,aAAa,aAAa,OAAO,EAAE,SAASA,EAAS,QAAQ;AAGlE,YAAM,IAAI,MAAM,4CAA4C;AAI9D,UAAMC,IAAW,MAAM,KAAK,QAAQ,GAAG,KAAK,OAAO,eAAe;AAAA,MAChE,QAAQ;AAAA,MACR,SAAS,EAAE,gBAAgB,mBAAA;AAAA,MAC3B,aAAa;AAAA,MACb,UAAU;AAAA,MACV,MAAM,KAAK,UAAU,EAAE,UAAAH,GAAU,UAAAC,GAAU;AAAA,IAAA,CAC5C;AACD,QAAI,CAACE,EAAS;AACZ,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAEJ,UAAMC,IAAU,MAAMD,EAAS,KAAA;AAC/B,QACEC,EAAQ,OAAO,MACf,OAAOA,EAAQ,SAAU,YACzB,CAACA,EAAQ;AAET,YAAM,IAAI,MAAM,8CAA8C;AAEhE,WAAOA,EAAQ;AAAA,EACjB;AAAA,EAEA,MAAM,QAAwB;AAC5B,WAAO,KAAK,KAAY,QAAQ;AAAA,EAClC;AAAA,EAEA,MAAM,gBAAwC;AAC5C,WAAO,KAAK,KAAoB,iBAAiB;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,iBAA8C;AAIlD,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO,OAAO,QAAQ,IAAI,CAACC,MAAQ;AACnC,YAAM7nB,IAAI6nB,EAAI;AACd,aAAO;AAAA,QACL,MAAM,OAAO7nB,EAAE,QAAQ,EAAE;AAAA,QACzB,MAAMA,EAAE;AAAA,QACR,MAAM,OAAOA,EAAE,QAAQ,QAAQ;AAAA,QAC/B,MAAOA,EAAE,QAA0B;AAAA,QACnC,2BAA2BA,EAAE,8BAA8B;AAAA,QAC3D,eACE,OAAOA,EAAE,iBAAkB,WAAWA,EAAE,gBAAgB;AAAA,MAAA;AAAA,IAE9D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU8nB,GAAeC,GAAsC;AACnE,UAAMC,IAAK,IAAI,gBAAgB,EAAE,OAAAF,GAAO;AACxC,WAAIC,MAAS,UAAWC,EAAG,IAAI,QAAQ,OAAOD,CAAI,CAAC,GAC5C,KAAK,KAAmB,iBAAiBC,CAAE,EAAE;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,eACJF,GACA7Z,GACA+S,GACAiH,GACuB;AACvB,UAAMD,IAAK,IAAI,gBAAgB;AAAA,MAC7B,OAAAF;AAAA,MACA,OAAO,OAAO7Z,CAAK;AAAA,MACnB,KAAK,OAAO+S,CAAG;AAAA,MACf,MAAM,OAAOiH,CAAI;AAAA,IAAA,CAClB;AACD,WAAO,KAAK,KAAmB,uBAAuBD,CAAE,EAAE;AAAA,EAC5D;AAAA,EAEA,MAAM,OAEJ;AACA,UAAM/Z,IAAQ,YAAY,IAAA;AAC1B,QAAI;AACF,mBAAM,KAAK,KAAK,QAAQ,GACjB,EAAE,IAAI,IAAM,QAAQ,KAAK,MAAM,YAAY,QAAQA,CAAK,EAAA;AAAA,IACjE,SAASpB,GAAG;AACV,aAAO,EAAE,IAAI,IAAO,OAAO0Z,GAAU1Z,CAAC,EAAA;AAAA,IACxC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,eAA4C;AAChD,QAAI;AACF,YAAMqY,IAAM,MAAM,KAAK,KAAsB,eAAe;AAC5D,aAAOD,GAAuBC,CAAG;AAAA,IACnC,SAASrY,GAAG;AAGV,UAAI,CAAC0Y,GAAmB1Y,CAAC,EAAG,QAAO,EAAE,GAAGkY,GAAA;AAAA,IAC1C;AACA,UAAM,CAACmD,GAAKC,CAAa,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC7C,KAAK,SAAS,uBAAuB;AAAA,MACrC,KAAK,SAAS,iBAAiB;AAAA,IAAA,CAChC;AACD,WAAO,EAAE,GAAGpD,IAA2B,KAAAmD,GAAK,eAAAC,EAAA;AAAA,EAC9C;AAAA;AAAA;AAAA,EAIA,MAAc,SAASpB,GAAgC;AACrD,QAAI;AACF,mBAAM,KAAK,KAAKA,CAAI,GACb;AAAA,IACT,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,cAAiC;AAErC,YADU,MAAM,KAAK,KAAgC,cAAc,GAC1D;AAAA,EACX;AAAA,EAEA,MAAM,WAAWtf,GAA2C;AAC1D,QAAI2d,GAA8B,IAAI,KAAK,OAAO;AAChD,YAAMK,GAAmC,KAAK,OAAO;AAGvD,UAAMsB,IAAO,gBAAgB,mBAAmBtf,CAAI,CAAC,IAC/C2gB,IAAgB/C,GAA+B,IAAI,KAAK,OAAO;AACrE,QAAI+C,GAAe;AAEjB,UAAI,CADc,MAAMA,EACR,OAAM3C,GAAmC,KAAK,OAAO;AACrE,aAAO,KAAK,KAAyBsB,CAAI;AAAA,IAC3C;AAEA,QAAIsB;AACJ,UAAMC,IAAQ,IAAI,QAAiB,CAACvkB,MAAY;AAC9C,MAAAskB,IAAetkB;AAAA,IACjB,CAAC;AACD,IAAAshB,GAA+B,IAAI,KAAK,SAASiD,CAAK;AAEtD,QAAI;AACF,YAAMC,IAAW,MAAM,KAAK,KAAyBxB,CAAI;AACzD,aAAAsB,EAAc,EAAI,GACXE;AAAA,IACT,SAAS1b,GAAG;AACV,YAAIyY,GAAqCzY,CAAC,KACxCuY,GAA8B,IAAI,KAAK,OAAO,GAC9CiD,EAAc,EAAK,KAEnBA,EAAc,EAAI,GAEdxb;AAAA,IACR,UAAA;AACE,MAAAwY,GAA+B,OAAO,KAAK,OAAO;AAAA,IACpD;AAAA,EACF;AAAA,EAEA,MAAM,iBAAiB5d,GAA6B;AAClD,UAAM,KAAK,KAAK,gBAAgB;AAAA,MAC9B,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,MAAAA,GAAM;AAAA,IAAA,CAC9B;AAAA,EACH;AAAA,EAEA,MAAM,eACJ+gB,GACAC,GACyB;AACzB,WAAO,KAAK;AAAA,MACV,gBAAgB,mBAAmBD,CAAU,CAAC;AAAA,MAC9C;AAAA,QACE,QAAQ;AAAA,QACR,MAAM,KAAK,UAAUC,CAAG;AAAA,MAAA;AAAA,IAC1B;AAAA,EAEJ;AAAA,EAEA,MAAM,MACJX,GACArD,IAAiC,IACX;AACtB,WAAO,KAAK,KAAkB,UAAU;AAAA,MACtC,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,OAAAqD,GAAO;AAAA,MAC9B,QAAQrD,EAAK;AAAA,IAAA,CACd;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,mBACJqD,GACArD,IAAmD,IACrB;AAC9B,UAAMiE,IAAUjE,EAAK,WAAW,KAC1ByC,IAAkC;AAAA,MACtC,gBAAgB;AAAA,MAChB,QAAQ;AAAA,IAAA;AAEV,WAAO,OAAOA,GAAS,KAAK,OAA6C;AAKzE,UAAME,IAAY,KAAK,IAAA,GACjBnZ,IAAQ,YAAY,IAAA,GACpB7N,IAAO,KAAK,UAAU,EAAE,OAAA0nB,GAAO,GAC/BT,IAAUlnB,GAAgBC,CAAI,GAC9BknB,IAAU,MAAM,KAAK,MAAM,YAAY,IAAA,IAAQrZ,CAAK;AAE1D,QAAI/J;AACJ,QAAI;AACF,MAAAA,IAAM,MAAM,KAAK,QAAQ,GAAG,KAAK,OAAO,iBAAiB;AAAA,QACvD,QAAQ;AAAA,QACR,SAAAgjB;AAAA,QACA,MAAA9mB;AAAA,QACA,QAAQqkB,EAAK;AAAA,MAAA,CACd;AAAA,IACH,SAAS5X,GAAG;AACV,YAAA9L,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,WAAAqmB;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,SAAAD;AAAA,QACA,OAAOd,GAAU1Z,CAAC;AAAA,MAAA,CACnB,GACKA;AAAA,IACR;AACA,QAAI,CAAC3I,EAAI,MAAM,CAACA,EAAI,MAAM;AACxB,YAAMykB,IAAUzkB,EAAI,OAAO,MAAMA,EAAI,OAAO,MAAM,MAAM,EAAE,IAAI,IACxDshB,IAAU,wBAAwBthB,EAAI,MAAM,IAAIykB,EAAQ,MAAM,GAAG,GAAG,CAAC;AAC3E,YAAA5nB,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,WAAAqmB;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,QAAQpjB,EAAI;AAAA,QACZ,SAAAmjB;AAAA,QACA,OAAO7B;AAAA,MAAA,CACR,GACK,IAAI,MAAMA,CAAO;AAAA,IACzB;AAEA,UAAMvlB,IAA2B;AAAA,MAC/B,SAAS,CAAA;AAAA,MACT,MAAM,CAAA;AAAA,MACN,UAAU;AAAA,MACV,WAAW;AAAA,IAAA;AAGb,qBAAiB2oB,KAAS/C,GAAkB3hB,EAAI,IAAI;AAClD,UAAI,gBAAgB0kB;AAClB,QAAA3oB,EAAI,WAAW2oB,EAAM,WAAW,WAAW,CAAA,GAAI;AAAA,UAAI,CAACC,MAClD,OAAOA,KAAW,WAAWA,IAASA,EAAO;AAAA,QAAA,GAE/C5oB,EAAI,oBAAoB2oB,EAAM,WAAW;AAAA,eAChC,YAAYA;AACrB,QAAA3oB,EAAI,SAAS2oB,EAAM,OAAO;AAAA,eACjB,SAASA,GAAO;AACzB,YAAI3oB,EAAI,KAAK,UAAUyoB,GAAS;AAC9B,UAAAzoB,EAAI,YAAY;AAChB;AAAA,QACF;AACA,QAAAA,EAAI,KAAK,KAAK2oB,EAAM,GAAG,GACvB3oB,EAAI,WAAWA,EAAI,KAAK;AAAA,MAC1B,WAAW,SAAS2oB,KAAS,eAAeA;AAC1C;AAIJ,WAAA7nB,GAAW,OAAO;AAAA,MAChB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,WAAAqmB;AAAA,MACA,YAAYE,EAAA;AAAA,MACZ,IAAI;AAAA,MACJ,QAAQpjB,EAAI;AAAA,MACZ,UAAUjE,EAAI;AAAA,MACd,SAAAonB;AAAA,IAAA,CACD,GAGGpnB,EAAI,aAAaA,EAAI,UACvB,MAAM,KAAK,kBAAkBA,EAAI,MAAM,EAAE,MAAM,MAAM;AAAA,IAErD,CAAC,GAEIA;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,kBAAkB6oB,GAA+B;AACrD,UAAM,KAAK,KAAK,wBAAwB;AAAA,MACtC,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,QAAAA,GAAQ;AAAA,IAAA,CAChC,EAAE,MAAM,MAAA;AAAA,KAAe;AAAA,EAC1B;AAAA,EAEA,MAAM,cAAcrhB,GAA2C;AAI7D,YAHU,MAAM,KAAK;AAAA,MACnB,gBAAgB,mBAAmBA,CAAI,CAAC;AAAA,IAAA,GAEjC;AAAA,EACX;AAAA,EAEA,MAAM,iBACJA,GACAshB,GAC6B;AAQ7B,YAPU,MAAM,KAAK;AAAA,MACnB,gBAAgB,mBAAmBthB,CAAI,CAAC;AAAA,MACxC;AAAA,QACE,QAAQ;AAAA,QACR,MAAM,KAAK,UAAU,EAAE,WAAAshB,GAAW;AAAA,MAAA;AAAA,IACpC,GAEO;AAAA,EACX;AAAA,EAEA,MAAM,QACJtE,IAOI,IACkB;AACtB,UAAMuD,IAAK,IAAI,gBAAA;AACf,IAAIvD,EAAK,QAAMuD,EAAG,IAAI,QAAQvD,EAAK,IAAI,GACnCA,EAAK,MAAIuD,EAAG,IAAI,MAAMvD,EAAK,EAAE,GAC7BA,EAAK,UAAQuD,EAAG,IAAI,UAAUvD,EAAK,MAAM,GACzCA,EAAK,UAAU,UAAWuD,EAAG,IAAI,SAAS,OAAOvD,EAAK,KAAK,CAAC,GAC5DA,EAAK,SAAS,UAAWuD,EAAG,IAAI,QAAQ,OAAOvD,EAAK,IAAI,CAAC,GACzDA,EAAK,aAAa,UAAWuD,EAAG,IAAI,aAAa,OAAOvD,EAAK,QAAQ,CAAC;AAC1E,UAAMuE,IAAShB,EAAG,SAAA,IAAa,IAAIA,CAAE,KAAK;AAI1C,YAHU,MAAM,KAAK;AAAA,MACnB,gBAAgBgB,CAAM;AAAA,IAAA,GAEf;AAAA,EACX;AAAA,EAEA,MAAM,WACJC,GACAC,GACAzE,IAAmD,CAAA,GACjC;AAClB,UAAMuD,IAAK,IAAI,gBAAA;AACf,IAAIvD,EAAK,cAAYuD,EAAG,IAAI,cAAcvD,EAAK,UAAU,GACrDA,EAAK,YAAY,UAAWuD,EAAG,IAAI,WAAW,OAAOvD,EAAK,OAAO,CAAC;AACtE,UAAMuE,IAAShB,EAAG,SAAA,IAAa,IAAIA,CAAE,KAAK;AAI1C,YAHU,MAAM,KAAK;AAAA,MACnB,iBAAiB,mBAAmBiB,CAAI,CAAC,SAAS,mBAAmBC,CAAE,CAAC,GAAGF,CAAM;AAAA,IAAA,GAE1E;AAAA,EACX;AAAA,EAEA,MAAM,cAA0C;AAC9C,WAAO,KAAK,KAAwB,qBAAqB,EAAE,MAAM,OAAO;AAAA,MACtE,IAAI;AAAA,MACJ,MAAM;AAAA,IAAA,EACN;AAAA,EACJ;AAAA,EAEA,MAAM,SAA0B;AAC9B,WAAO,KAAK,KAAa,cAAc;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,IAAIG,GAAkB1E,IAAmB,IAA0B;AACvE,WAAO,KAAK,KAAkB,WAAW;AAAA,MACvC,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,UAAA0E,GAAU,GAAG1E,GAAM;AAAA,IAAA,CAC3C;AAAA,EACH;AAAA,EAEA,MAAM,QAA6B;AAIjC,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO;AAAA,EACX;AAAA,EAEA,MAAM,UAAiC;AAIrC,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO,WAAW,CAAA;AAAA,EACtB;AAAA,EAEA,MAAM,WAAkC;AAItC,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO,YAAY,CAAA;AAAA,EACvB;AAAA,EAEA,MAAM,QAAQ2E,GAA0D;AACtE,UAAM7U,IAAI,MAAM,KAAK,KAAsB,aAAa;AAAA,MACtD,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,QAAA6U,GAAQ;AAAA,IAAA,CAChC;AACD,QAAI,CAAC,MAAM,QAAQ7U,EAAE,OAAO;AAC1B,YAAM,IAAI,MAAMA,EAAE,SAAS,oCAAoC;AAEjE,WAAO6U,EAAO,IAAI,CAAChI,GAAOuB,MAAU;;AAClC,YAAM9d,MAASuC,IAAAmN,EAAE,YAAF,gBAAAnN,EAAYub,OAAU,CAAA,GAC/B0G,IAAW1D,GAAqB9gB,EAAO,QAAQ,IACjDA,EAAO,WACPuc,EAAM;AACV,aAAO;AAAA,QACL,QACE,OAAOvc,EAAO,UAAW,WAAWA,EAAO,SAASuc,EAAM;AAAA,QAC5D,UAAAiI;AAAA,QACA,gBACE,OAAOxkB,EAAO,kBAAmB,WAC7BA,EAAO,iBACPuc,EAAM;AAAA,QACZ,SAASvc,EAAO,YAAY;AAAA,QAC5B,QAAQ,OAAOA,EAAO,UAAW,WAAWA,EAAO,SAAS;AAAA,MAAA;AAAA,IAEhE,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,QACJykB,GACA7E,IAAgD,IACxB;AACxB,UAAMuD,IAAK,IAAI,gBAAA;AACf,IAAIsB,MAAa,UAAWtB,EAAG,IAAI,aAAa,OAAOsB,CAAQ,CAAC,GAC5D7E,EAAK,UAAU,UAAWuD,EAAG,IAAI,SAAS,OAAOvD,EAAK,KAAK,CAAC;AAChE,UAAMuE,IAAShB,EAAG,SAAA,IAAa,IAAIA,CAAE,KAAK,IAEpCuB,KADI,MAAM,KAAK,KAAgC,aAAaP,CAAM,GACvD,UAAU,CAAA;AAC3B,WAAOvE,EAAK,aACR8E,EAAO,OAAO,CAAC1c,MAAMA,EAAE,eAAe4X,EAAK,UAAU,IACrD8E;AAAA,EACN;AAAA;AAAA,EAGA,MAAM,KAAKzB,GAAwD;AAEjE,YADU,MAAM,KAAK,MAAMA,CAAK,GACvB,OAAO,QAAQ,IAAI,CAACD,MAAQA,EAAI,MAAM;AAAA,EACjD;AACF;ACx5BO,MAAM2B,WAA+B,MAAM;AAAA,EAChD,YAA4BC,GAAY;AACtC,UAAM,uBAAuBA,CAAE,EAAE,GADP,KAAA,KAAAA,GAE1B,KAAK,OAAO;AAAA,EACd;AACF;AAEO,MAAMC,WAA0B,MAAM;AAAA,EAC3C,cAAc;AACZ,UAAM,6CAA6C,GACnD,KAAK,OAAO;AAAA,EACd;AACF;AAEO,MAAMC,WAAmC,MAAM;AAAA,EACpD,YAA4BF,GAA4BG,GAAgB;AACtE,UAAM,cAAcH,CAAE,iBAAiBG,CAAM,EAAE,GADrB,KAAA,KAAAH,GAA4B,KAAA,SAAAG,GAEtD,KAAK,OAAO;AAAA,EACd;AACF;ACzCO,MAAMC,GAAqD;AAAA,EAMhE,YAAYpF,GAA6B;AALxB,IAAAhkB,EAAA;AAER;AAAA,IAAAA,EAAA;AACD,IAAAA,EAAA,mBAAY;;AAGlB,SAAK,SAASgkB,EAAK,QACnB,KAAK,aAAa;AAAA,MAChB,MAAIrd,IAAAqd,EAAK,eAAL,gBAAArd,EAAiB,OAAM;AAAA,MAC3B,SAAO8M,IAAAuQ,EAAK,eAAL,gBAAAvQ,EAAiB,UAAS;AAAA,MACjC,OAAKG,IAAAoQ,EAAK,eAAL,gBAAApQ,EAAiB,QAAO;AAAA,MAC7B,QAAMG,IAAAiQ,EAAK,eAAL,gBAAAjQ,EAAiB,SAAQ;AAAA,MAC/B,eAAasV,IAAArF,EAAK,eAAL,gBAAAqF,EAAiB,gBAAe;AAAA,IAAA;AAAA,EAEjD;AAAA,EAEA,MAAM,OAA8B;AAClC,WAAO,CAAC,KAAK,UAAU;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,QAAQL,GAAuC;AACnD,QAAIA,MAAO,KAAK,WAAW,GAAI,OAAM,IAAID,GAAuBC,CAAE;AAClE,QAAIM,IAAS;AACb,QAAI;AACF,YAAMC,IAAO,MAAM,KAAK,OAAO,KAAA;AAC/B,MAAIA,EAAK,OAAID,IAASC,EAAK;AAAA,IAC7B,QAAQ;AAAA,IAER;AACA,gBAAK,YAAY,IACV,EAAE,YAAY,KAAK,YAAY,QAAQ,KAAK,QAAQ,QAAAD,EAAA;AAAA,EAC7D;AAAA,EAEA,MAAM,SAA4B;AAChC,QAAI,CAAC,KAAK,UAAW,OAAM,IAAIL,GAAA;AAC/B,UAAMO,IAAI,MAAM,KAAK,OAAO,OAAA;AAC5B,WAAO,EAAE,eAAeA,EAAE,eAAe,UAAUA,EAAE,UAAU,MAAMA,EAAE,KAAA;AAAA,EACzE;AACF;ACvBA,MAAMC,KAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA8BlB,SAASC,KAAmB;AAC1B,EAAI,OAAO,SAAW,QAAa,OAAO,2BAA2B;AACvE;AAEA,eAAsBC,GACpBC,GACA5F,GAC2B;;AAC3B,EAAA0F,GAAA;AAIA,QAAMG,IAASD,EAAK,QAAQ,OACtBE,IACJF,EAAK,QAAQ,gBACZC,MAAW,WAAWA,MAAW,SAASA,IAAS;AACtD,EAAA3G,GAAgB0G,GAAM5F,EAAK,SAAU8F,KAAgC,MAAM;AAI3E,QAAM9B,IAAM4B,EAAK;AACjB,MAAI,CAAC5B,EAAI,KAAK,cAAc,4BAA4B3D,EAAc,IAAI,GAAG;AAC3E,UAAM0F,IAAQ/B,EAAI,cAAc,OAAO;AACvC,IAAA+B,EAAM,QAAQ,aAAa1F,IAC3B0F,EAAM,gBACJpjB,IAAAqjB,GAAO,MAAM,yBAAyB,MAAtC,gBAAArjB,EAAyC,KAAK;AAAA,OAAS,IACzDqhB,EAAI,KAAK,OAAO+B,CAAK;AAAA,EACvB;AAEA,QAAME,IACJL,EAAK,cAAcA,EAAK,aAAa5F,EAAK,cAAc,EAAE,MAAM,QAAQ;AAC1E,EAAAiG,EAAW,cAAc;AAEzB,QAAMC,IAAQ,SAAS,cAAc,OAAO;AAC5C,EAAAA,EAAM,cAAc,GAAGF,EAAM;AAAA,EAAKP,EAAS;AAE3C,QAAMU,IAAc,SAAS,cAAc,KAAK;AAChD,EAAAA,EAAY,YAAY;AAExB,QAAMC,IAAe,SAAS,cAAc,KAAK;AACjD,EAAAA,EAAa,aAAa,6BAA6B,EAAE,GAEzDH,EAAW,OAAOC,GAAOC,GAAaC,CAAY;AAElD,QAAM,CAAC,EAAE,OAAAC,GAAO,SAAAC,EAAA,GAAWrX,CAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,IACnD,OAAO,4BAAQ,EAAA,KAAA,CAAAnP,MAAAA,EAAA,CAAA;AAAA,IACf,OAAO,8BAAyB,EAAA,KAAA,CAAAA,MAAAA,EAAA,CAAA;AAAA,EAAA,CAGjC,GAEKymB,IAAWF,EAAMpX,EAAK,SAAS;AAAA,IACnC,QAAQkX;AAAA,IACR,OAAO;AAAA,MACL,oBAAoBnG,EAAK;AAAA,MACzB,cAAAoG;AAAA,MACA,YAAYR;AAAA,MACZ,cAAc5F,EAAK;AAAA,MACnB,cAAcA,EAAK;AAAA,IAAA;AAAA,EACrB,CACD,GAEKwG,IAAaxG,EAAK,cACpB1jB,GAAW,QAAQ0jB,EAAK,WAAW,IACnC;AAEJ,SAAO;AAAA,IACL,MAAA4F;AAAA,IACA,YAAAK;AAAA,IACA,cAAAG;AAAA,IACA,SAAS,MAAM;AACb,MAAAI,KAAA,QAAAA,KACKF,EAAQC,CAAQ,GACrBN,EAAW,cAAc;AAAA,IAC3B;AAAA,EAAA;AAEJ;;AAEO,MAAMQ,WAAqB,YAAY;AAAA,EAAvC;AAAA;AAAA,IAAA/Z,EAAA,MAAAga;AACL,IAAAha,EAAA,MAAAia,IAAiD;AACjD,IAAAja,EAAA,MAAAka,IAAmC;AACnC,IAAA5qB,EAAA;AACA,IAAAA,EAAA;AACA,IAAA0Q,EAAA,MAAAma,IAAmC;AACnC,IAAAna,EAAA,MAAAoa,IAAkC;AAAA;AAAA,EAKlC,IAAI,UAAkB;AACpB,WAAOzG;AAAA,EACT;AAAA,EAEA,IAAI,qBAAgD;AAClD,WAAOzS,EAAA,MAAK+Y;AAAA,EACd;AAAA,EAEA,IAAI,mBAAmBI,GAAqC;AAC1D,IAAAzY,EAAA,MAAKqY,IAAsBI,IACvB,KAAK,eAAazY,EAAA,MAAKwY,IAAY7Y,EAAA,MAAKyY,IAAAM,IAAL;AAAA,EACzC;AAAA,EAEA,IAAI,cAAkC;AACpC,WAAOpZ,EAAA,MAAKgZ;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,YAAYzqB,GAA0B;AACxC,IAAAmS,EAAA,MAAKsY,IAAezqB,IAChB,KAAK,eAAamS,EAAA,MAAKwY,IAAY7Y,EAAA,MAAKyY,IAAAM,IAAL;AAAA,EACzC;AAAA,EAEA,oBAAoB;AAClB,IAAK,KAAK,aAAa,SAAS,KAC9B,KAAK,aAAa,WAAW3G,EAAc,GAC7CzS,EAAA,MAAKkZ,OAALxY,EAAA,MAAKwY,IAAc7Y,EAAA,MAAKyY,IAAAM,IAAL;AAAA,EACrB;AAAA,EAEA,uBAAuB;;AACrB,KAAArkB,IAAAiL,EAAA,MAAKiZ,QAAL,QAAAlkB,EAAc,WACd2L,EAAA,MAAKuY,IAAU,OACfvY,EAAA,MAAKwY,IAAY;AAAA,EACnB;AAYF;AA3DEH,KAAA,eACAC,KAAA,eAGAC,KAAA,eACAC,KAAA,eANKJ,KAAA,eAkDCM,KAAA,iBAAS;;AACb,EAAKpZ,EAAA,MAAK+Y,SACVhkB,IAAAiL,EAAA,MAAKiZ,QAAL,QAAAlkB,EAAc,WACd2L,EAAA,MAAKuY,IAAU,MAAMlB,GAAW,MAAM;AAAA,IACpC,oBAAoB/X,EAAA,MAAK+Y;AAAA,IACzB,cAAc,KAAK;AAAA,IACnB,OAAO,KAAK;AAAA,IACZ,aAAa/Y,EAAA,MAAKgZ,OAAgB;AAAA,EAAA,CACnC;AACH;AAAA;AAjDA5qB,EAVWyqB,IAUK,WAAUpG;AAoDrB,SAAS4G,GACdC,IAA+B,cACV;AACrB,SAAAxB,GAAA,GACK,eAAe,IAAIwB,CAAO,KAC7B,eAAe,OAAOA,GAAST,EAAY,GACtC,eAAe,IAAIS,CAAO;AACnC;","x_google_ignoreList":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28]}
1	+ {"version":3,"file":"index-EW_M_YFX.js","sources":["../../src/lib/reddb/dev-console.ts","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/constants.js","../../../../node_modules/.pnpm/esm-env@1.2.2/node_modules/esm-env/false.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/shared/utils.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/constants.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/shared/errors.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/errors.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/warnings.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/hydration.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/equality.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/flags/index.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/context.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/task.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/error-handling.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/status.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/utils.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/store/utils.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/store/shared/index.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/store.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/batch.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/async.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/deriveds.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/sources.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/proxy.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/operations.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/elements/misc.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/dom/elements/bindings/shared.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/reactivity/effects.js","../../../../node_modules/.pnpm/svelte@5.55.9/node_modules/svelte/src/internal/client/runtime.js","../../src/lib/theme.svelte.ts","../../src/lib/build-info.ts","../../src/lib/reddb/server-capabilities.ts","../../src/lib/reddb/client.ts","../../src/lib/reddb/connection-provider.ts","../../src/lib/reddb/injected-client-provider.ts","../../src/lib/embed/index.ts"],"sourcesContent":["// Instrumented developer console (#128). A deliberately framework-agnostic,\n// rune-free observable store so the data layer (`RedClient`, transports) can\n// log every query and HTTP call without importing Svelte — the client seam\n// must not depend on the UI runtime. The Svelte panel bridges this store into\n// reactivity by subscribing and copying the snapshot into `$state`.\n//\n// Every entry is one round-trip the client made: the verb (HTTP method /\n// statement head), the target (path or endpoint), how long it took, how many\n// rows came back, and a sanitized payload — secrets are redacted before an\n// entry is ever stored, so a copy action can never leak a token.\n\n/** What kind of round-trip an entry records. /\nexport type ConsoleEntryKind = \"query\" \| \"http\";\n\nexport interface ConsoleEntry {\n /* Monotonic id, assigned on record. Stable for keying/dedup in the panel. /\n id: number;\n kind: ConsoleEntryKind;\n /* HTTP method or statement head, e.g. `POST`, `GET`, `SELECT`. /\n verb: string;\n /* Endpoint path or logical target the call hit, e.g. `/query`. /\n target: string;\n /* Absolute wall-clock time the call started. /\n startedAt: number;\n /* Round-trip duration in milliseconds. /\n durationMs: number;\n /* True when the call succeeded (2xx / resolved). /\n ok: boolean;\n /* HTTP status code when one is known. /\n status?: number;\n /* Rows returned, when the response carries a row/record count. /\n rowCount?: number;\n /* Sanitized request payload or query text — copyable, never contains secrets. /\n payload?: string;\n /* Error text when the call failed. /\n error?: string;\n}\n\n/* A record as handed to the store — the store owns `id`. /\nexport type ConsoleEntryInput = Omit<ConsoleEntry, \"id\">;\n\n/\n A per-entry tap on the console. Unlike `subscribe` (which observes the whole\n * snapshot for rendering), a sink receives each entry exactly once, as it is\n * recorded — the shape an embedding host wants for mirroring red-ui's traffic\n * into its own developer console.\n /\nexport type ConsoleSink = (entry: ConsoleEntry) => void;\n\ntype Listener = (entries: readonly ConsoleEntry[]) => void;\n\n/* Keys whose values are always masked, matched case-insensitively as substrings. /\nconst SENSITIVE_KEY_RE =\n /pass(word)?\|secret\|token\|api[-_]?key\|authorization\|auth\|credential\|cookie\|session\|bearer\|private[-_]?key\|mfa/i;\n\nconst REDACTED = \"«redacted»\";\n\n/\n Recursively redact sensitive values from an arbitrary structure, returning a\n * plain clone safe to stringify. A value under a sensitive key is replaced with\n * a marker rather than dropped, so the reader still sees that a field existed.\n * Depth- and breadth-bounded so a pathological payload can't blow the console.\n /\nexport function redactSecrets(value: unknown, depth = 0): unknown {\n if (depth > 6) return \"«…»\";\n if (Array.isArray(value)) {\n return value.slice(0, 100).map((v) => redactSecrets(v, depth + 1));\n }\n if (value && typeof value === \"object\") {\n const out: Record<string, unknown> = {};\n for (const [k, v] of Object.entries(value as Record<string, unknown>)) {\n out[k] = SENSITIVE_KEY_RE.test(k)\n ? REDACTED\n : redactSecrets(v, depth + 1);\n }\n return out;\n }\n return value;\n}\n\n/\n Turn a request body (a JSON string, an object, or anything else) into a\n * sanitized, human-readable string for the entry's copyable payload. Parses\n * JSON so keys can be redacted; falls back to a truncated raw string when the\n * body isn't JSON. Returns `undefined` for an absent body.\n /\nexport function sanitizePayload(body: unknown): string \| undefined {\n if (body === undefined \|\| body === null) return undefined;\n let parsed: unknown = body;\n if (typeof body === \"string\") {\n if (body.length === 0) return undefined;\n try {\n parsed = JSON.parse(body);\n } catch {\n return body.length > 2000 ? `${body.slice(0, 2000)}…` : body;\n }\n }\n try {\n const json = JSON.stringify(redactSecrets(parsed), null, 2);\n return json.length > 4000 ? `${json.slice(0, 4000)}…` : json;\n } catch {\n return undefined;\n }\n}\n\n/\n The developer console log. A bounded ring of entries with a minimal\n * subscribe/emit surface — no framework, no runes. `record` is the single\n * write path the client seam calls; `subscribe` is how the panel observes.\n /\nexport class DevConsoleStore {\n private entries: ConsoleEntry[] = [];\n private readonly listeners = new Set<Listener>();\n private readonly sinks = new Set<ConsoleSink>();\n private nextId = 1;\n\n /* Cap on retained entries; oldest are dropped past this. /\n constructor(private readonly capacity = 500) {}\n\n /* Append one round-trip. Assigns the id, trims to capacity, notifies. /\n record(input: ConsoleEntryInput): ConsoleEntry {\n const entry: ConsoleEntry = { ...input, id: this.nextId++ };\n this.entries.push(entry);\n if (this.entries.length > this.capacity) {\n this.entries.splice(0, this.entries.length - this.capacity);\n }\n this.emit();\n for (const sink of this.sinks) {\n try {\n sink(entry);\n } catch {\n // A host-owned sink must never be able to break the client seam.\n }\n }\n return entry;\n }\n\n /\n Tap every future entry. Entries recorded before the sink was added are\n * not replayed — a host mirrors live traffic, it doesn't import history.\n * Returns an unsubscribe.\n /\n addSink(sink: ConsoleSink): () => void {\n this.sinks.add(sink);\n return () => {\n this.sinks.delete(sink);\n };\n }\n\n /* A frozen, newest-last snapshot of the log. /\n snapshot(): readonly ConsoleEntry[] {\n return this.entries.slice();\n }\n\n /* Number of retained entries. /\n get size(): number {\n return this.entries.length;\n }\n\n /* Drop every entry and notify. /\n clear(): void {\n if (this.entries.length === 0) return;\n this.entries = [];\n this.emit();\n }\n\n /\n Observe the log. The listener fires immediately with the current snapshot\n * and again on every change. Returns an unsubscribe.\n /\n subscribe(listener: Listener): () => void {\n this.listeners.add(listener);\n listener(this.snapshot());\n return () => {\n this.listeners.delete(listener);\n };\n }\n\n private emit(): void {\n const snap = this.snapshot();\n for (const listener of this.listeners) listener(snap);\n }\n}\n\n/* The singleton the client seam records into and the panel observes. /\nexport const devConsole = new DevConsoleStore();\n","export const EACH_ITEM_REACTIVE = 1;\nexport const EACH_INDEX_REACTIVE = 1 << 1;\n/* See EachBlock interface metadata.is_controlled for an explanation what this is /\nexport const EACH_IS_CONTROLLED = 1 << 2;\nexport const EACH_IS_ANIMATED = 1 << 3;\nexport const EACH_ITEM_IMMUTABLE = 1 << 4;\n\nexport const PROPS_IS_IMMUTABLE = 1;\nexport const PROPS_IS_RUNES = 1 << 1;\nexport const PROPS_IS_UPDATED = 1 << 2;\nexport const PROPS_IS_BINDABLE = 1 << 3;\nexport const PROPS_IS_LAZY_INITIAL = 1 << 4;\n\nexport const TRANSITION_IN = 1;\nexport const TRANSITION_OUT = 1 << 1;\nexport const TRANSITION_GLOBAL = 1 << 2;\n\nexport const TEMPLATE_FRAGMENT = 1;\nexport const TEMPLATE_USE_IMPORT_NODE = 1 << 1;\nexport const TEMPLATE_USE_SVG = 1 << 2;\nexport const TEMPLATE_USE_MATHML = 1 << 3;\n\nexport const HYDRATION_START = '[';\n/* used to indicate that an `{:else}...` block was rendered /\nexport const HYDRATION_START_ELSE = '[!';\n/* used to indicate that a boundary's `failed` snippet was rendered on the server /\nexport const HYDRATION_START_FAILED = '[?';\nexport const HYDRATION_END = ']';\nexport const HYDRATION_ERROR = {};\n\nexport const ELEMENT_IS_NAMESPACED = 1;\nexport const ELEMENT_PRESERVE_ATTRIBUTE_CASE = 1 << 1;\nexport const ELEMENT_IS_INPUT = 1 << 2;\n\nexport const UNINITIALIZED = Symbol('uninitialized');\n\n// Dev-time component properties\nexport const FILENAME = Symbol('filename');\nexport const HMR = Symbol('hmr');\n\nexport const NAMESPACE_HTML = 'http://www.w3.org/1999/xhtml';\nexport const NAMESPACE_SVG = 'http://www.w3.org/2000/svg';\nexport const NAMESPACE_MATHML = 'http://www.w3.org/1998/Math/MathML';\n\n// we use a list of ignorable runtime warnings because not every runtime warning\n// can be ignored and we want to keep the validation for svelte-ignore in place\nexport const IGNORABLE_RUNTIME_WARNINGS = /* @type {const} / ([\n\t'await_waterfall',\n\t'await_reactivity_loss',\n\t'state_snapshot_uncloneable',\n\t'binding_property_non_reactive',\n\t'hydration_attribute_changed',\n\t'hydration_html_changed',\n\t'ownership_invalid_binding',\n\t'ownership_invalid_mutation'\n]);\n\n/\n Whitespace inside one of these elements will not result in\n * a whitespace node being created in any circumstances. (This\n * list is almost certainly very incomplete)\n * TODO this is currently unused\n /\nexport const ELEMENTS_WITHOUT_TEXT = ['audio', 'datalist', 'dl', 'optgroup', 'select', 'video'];\n\nexport const ATTACHMENT_KEY = '@attach';\n","export default false;\n","// Store the references to globals in case someone tries to monkey patch these, causing the below\n// to de-opt (this occurs often when using popular extensions).\nexport var is_array = Array.isArray;\nexport var index_of = Array.prototype.indexOf;\nexport var includes = Array.prototype.includes;\nexport var array_from = Array.from;\nexport var object_keys = Object.keys;\nexport var define_property = Object.defineProperty;\nexport var get_descriptor = Object.getOwnPropertyDescriptor;\nexport var get_descriptors = Object.getOwnPropertyDescriptors;\nexport var object_prototype = Object.prototype;\nexport var array_prototype = Array.prototype;\nexport var get_prototype_of = Object.getPrototypeOf;\nexport var is_extensible = Object.isExtensible;\nexport var has_own_property = Object.prototype.hasOwnProperty;\n\n/\n @param {any} thing\n * @returns {thing is Function}\n /\nexport function is_function(thing) {\n\treturn typeof thing === 'function';\n}\n\nexport const noop = () => {};\n\n// Adapted from https://github.com/then/is-promise/blob/master/index.js\n// Distributed under MIT License https://github.com/then/is-promise/blob/master/LICENSE\n\n/\n @template [T=any]\n * @param {any} value\n * @returns {value is PromiseLike<T>}\n /\nexport function is_promise(value) {\n\treturn typeof value?.then === 'function';\n}\n\n/* @param {Function} fn /\nexport function run(fn) {\n\treturn fn();\n}\n\n/* @param {Array<() => void>} arr /\nexport function run_all(arr) {\n\tfor (var i = 0; i < arr.length; i++) {\n\t\tarr[i]();\n\t}\n}\n\n/\n TODO replace with Promise.withResolvers once supported widely enough\n * @template [T=void]\n /\nexport function deferred() {\n\t/* @type {(value: T) => void} /\n\tvar resolve;\n\n\t/* @type {(reason: any) => void} /\n\tvar reject;\n\n\t/* @type {Promise<T>} /\n\tvar promise = new Promise((res, rej) => {\n\t\tresolve = res;\n\t\treject = rej;\n\t});\n\n\t// @ts-expect-error\n\treturn { promise, resolve, reject };\n}\n\n/\n @template V\n * @param {V} value\n * @param {V \| (() => V)} fallback\n * @param {boolean} [lazy]\n * @returns {V}\n /\nexport function fallback(value, fallback, lazy = false) {\n\treturn value === undefined\n\t\t? lazy\n\t\t\t? /* @type {() => V} / (fallback)()\n\t\t\t: /* @type {V} / (fallback)\n\t\t: value;\n}\n\n/\n When encountering a situation like `let [a, b, c] = $derived(blah())`,\n * we need to stash an intermediate value that `a`, `b`, and `c` derive\n * from, in case it's an iterable\n * @template T\n * @param {ArrayLike<T> \| Iterable<T>} value\n * @param {number} [n]\n * @returns {Array<T>}\n /\nexport function to_array(value, n) {\n\t// return arrays unchanged\n\tif (Array.isArray(value)) {\n\t\treturn value;\n\t}\n\n\t// if value is not iterable, or `n` is unspecified (indicates a rest\n\t// element, which means we're not concerned about unbounded iterables)\n\t// convert to an array with `Array.from`\n\tif (n === undefined \|\| !(Symbol.iterator in value)) {\n\t\treturn Array.from(value);\n\t}\n\n\t// otherwise, populate an array with `n` values\n\n\t/* @type {T[]} /\n\tconst array = [];\n\n\tfor (const element of value) {\n\t\tarray.push(element);\n\t\tif (array.length === n) break;\n\t}\n\n\treturn array;\n}\n\n/\n @param {Record<string \| symbol, unknown>} obj\n * @param {Array<string \| symbol>} keys\n * @returns {Record<string \| symbol, unknown>}\n /\nexport function exclude_from_object(obj, keys) {\n\t/* @type {Record<string \| symbol, unknown>} /\n\tvar result = {};\n\n\tfor (var key in obj) {\n\t\tif (!keys.includes(key)) {\n\t\t\tresult[key] = obj[key];\n\t\t}\n\t}\n\n\tfor (var symbol of Object.getOwnPropertySymbols(obj)) {\n\t\tif (Object.propertyIsEnumerable.call(obj, symbol) && !keys.includes(symbol)) {\n\t\t\tresult[symbol] = obj[symbol];\n\t\t}\n\t}\n\n\treturn result;\n}\n","// General flags\nexport const DERIVED = 1 << 1;\nexport const EFFECT = 1 << 2;\nexport const RENDER_EFFECT = 1 << 3;\n/\n An effect that does not destroy its child effects when it reruns.\n * Runs as part of render effects, i.e. not eagerly as part of tree traversal or effect flushing.\n /\nexport const MANAGED_EFFECT = 1 << 24;\n/\n An effect that does not destroy its child effects when it reruns (like MANAGED_EFFECT).\n * Runs eagerly as part of tree traversal or effect flushing.\n /\nexport const BLOCK_EFFECT = 1 << 4;\nexport const BRANCH_EFFECT = 1 << 5;\nexport const ROOT_EFFECT = 1 << 6;\nexport const BOUNDARY_EFFECT = 1 << 7;\n/\n Indicates that a reaction is connected to an effect root — either it is an effect,\n * or it is a derived that is depended on by at least one effect. If a derived has\n * no dependents, we can disconnect it from the graph, allowing it to either be\n * GC'd or reconnected later if an effect comes to depend on it again\n /\nexport const CONNECTED = 1 << 9;\nexport const CLEAN = 1 << 10;\nexport const DIRTY = 1 << 11;\nexport const MAYBE_DIRTY = 1 << 12;\nexport const INERT = 1 << 13;\nexport const DESTROYED = 1 << 14;\n/* Set once a reaction has run for the first time /\nexport const REACTION_RAN = 1 << 15;\n/* Effect is in the process of getting destroyed. Can be observed in child teardown functions /\nexport const DESTROYING = 1 << 25;\n\n// Flags exclusive to effects\n/\n 'Transparent' effects do not create a transition boundary.\n * This is on a block effect 99% of the time but may also be on a branch effect if its parent block effect was pruned\n /\nexport const EFFECT_TRANSPARENT = 1 << 16;\nexport const EAGER_EFFECT = 1 << 17;\nexport const HEAD_EFFECT = 1 << 18;\nexport const EFFECT_PRESERVED = 1 << 19;\nexport const USER_EFFECT = 1 << 20;\nexport const EFFECT_OFFSCREEN = 1 << 25;\n\n// Flags exclusive to deriveds\n/\n Tells that we marked this derived and its reactions as visited during the \"mark as (maybe) dirty\"-phase.\n * Will be lifted during execution of the derived and during checking its dirty state (both are necessary\n * because a derived might be checked but not executed). This is a pure performance optimization flag and\n * should not be used for any other purpose!\n /\nexport const WAS_MARKED = 1 << 16;\n\n// Flags used for async\nexport const REACTION_IS_UPDATING = 1 << 21;\nexport const ASYNC = 1 << 22;\n\nexport const ERROR_VALUE = 1 << 23;\n\nexport const STATE_SYMBOL = Symbol('$state');\nexport const LEGACY_PROPS = Symbol('legacy props');\nexport const LOADING_ATTR_SYMBOL = Symbol('');\nexport const PROXY_PATH_SYMBOL = Symbol('proxy path');\nexport const ATTRIBUTES_CACHE = Symbol('attributes');\nexport const CLASS_CACHE = Symbol('class');\nexport const STYLE_CACHE = Symbol('style');\nexport const TEXT_CACHE = Symbol('text');\nexport const FORM_RESET_HANDLER = Symbol('form reset');\n/* An anchor might change, via this symbol on the original anchor we can tell HMR about the updated anchor /\nexport const HMR_ANCHOR = Symbol('hmr anchor');\n\n/* allow users to ignore aborted signal errors if `reason.name === 'StaleReactionError` /\nexport const STALE_REACTION = new (class StaleReactionError extends Error {\n\tname = 'StaleReactionError';\n\tmessage = 'The reaction that called `getAbortSignal()` was re-run or destroyed';\n})();\n\nexport const IS_XHTML =\n\t// We gotta write it like this because after downleveling the pure comment may end up in the wrong location\n\t!!globalThis.document?.contentType &&\n\t/ @__PURE__ / globalThis.document.contentType.includes('xml');\nexport const ELEMENT_NODE = 1;\nexport const TEXT_NODE = 3;\nexport const COMMENT_NODE = 8;\nexport const DOCUMENT_FRAGMENT_NODE = 11;\n","/ This file is generated by scripts/process-messages/index.js. Do not edit! /\n\nimport { DEV } from 'esm-env';\n\n/\n Cannot use `%name%(...)` unless the `experimental.async` compiler option is `true`\n * @param {string} name\n * @returns {never}\n /\nexport function experimental_async_required(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`experimental_async_required\\nCannot use \\`${name}(...)\\` unless the \\`experimental.async\\` compiler option is \\`true\\`\\nhttps://svelte.dev/e/experimental_async_required`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/experimental_async_required`);\n\t}\n}\n\n/\n Cannot use `{@render children(...)}` if the parent component uses `let:` directives. Consider using a named snippet instead\n * @returns {never}\n /\nexport function invalid_default_snippet() {\n\tif (DEV) {\n\t\tconst error = new Error(`invalid_default_snippet\\nCannot use \\`{@render children(...)}\\` if the parent component uses \\`let:\\` directives. Consider using a named snippet instead\\nhttps://svelte.dev/e/invalid_default_snippet`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invalid_default_snippet`);\n\t}\n}\n\n/\n A snippet function was passed invalid arguments. Snippets should only be instantiated via `{@render ...}`\n * @returns {never}\n /\nexport function invalid_snippet_arguments() {\n\tif (DEV) {\n\t\tconst error = new Error(`invalid_snippet_arguments\\nA snippet function was passed invalid arguments. Snippets should only be instantiated via \\`{@render ...}\\`\\nhttps://svelte.dev/e/invalid_snippet_arguments`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invalid_snippet_arguments`);\n\t}\n}\n\n/\n An invariant violation occurred, meaning Svelte's internal assumptions were flawed. This is a bug in Svelte, not your app — please open an issue at https://github.com/sveltejs/svelte, citing the following message: \"%message%\"\n * @param {string} message\n * @returns {never}\n /\nexport function invariant_violation(message) {\n\tif (DEV) {\n\t\tconst error = new Error(`invariant_violation\\nAn invariant violation occurred, meaning Svelte's internal assumptions were flawed. This is a bug in Svelte, not your app — please open an issue at https://github.com/sveltejs/svelte, citing the following message: \"${message}\"\\nhttps://svelte.dev/e/invariant_violation`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invariant_violation`);\n\t}\n}\n\n/\n `%name%(...)` can only be used during component initialisation\n * @param {string} name\n * @returns {never}\n /\nexport function lifecycle_outside_component(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`lifecycle_outside_component\\n\\`${name}(...)\\` can only be used during component initialisation\\nhttps://svelte.dev/e/lifecycle_outside_component`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/lifecycle_outside_component`);\n\t}\n}\n\n/\n Context was not set in a parent component\n * @returns {never}\n /\nexport function missing_context() {\n\tif (DEV) {\n\t\tconst error = new Error(`missing_context\\nContext was not set in a parent component\\nhttps://svelte.dev/e/missing_context`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/missing_context`);\n\t}\n}\n\n/\n Attempted to render a snippet without a `{@render}` block. This would cause the snippet code to be stringified instead of its content being rendered to the DOM. To fix this, change `{snippet}` to `{@render snippet()}`.\n * @returns {never}\n /\nexport function snippet_without_render_tag() {\n\tif (DEV) {\n\t\tconst error = new Error(`snippet_without_render_tag\\nAttempted to render a snippet without a \\`{@render}\\` block. This would cause the snippet code to be stringified instead of its content being rendered to the DOM. To fix this, change \\`{snippet}\\` to \\`{@render snippet()}\\`.\\nhttps://svelte.dev/e/snippet_without_render_tag`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/snippet_without_render_tag`);\n\t}\n}\n\n/\n `%name%` is not a store with a `subscribe` method\n * @param {string} name\n * @returns {never}\n /\nexport function store_invalid_shape(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`store_invalid_shape\\n\\`${name}\\` is not a store with a \\`subscribe\\` method\\nhttps://svelte.dev/e/store_invalid_shape`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/store_invalid_shape`);\n\t}\n}\n\n/\n The `this` prop on `<svelte:element>` must be a string, if defined\n * @returns {never}\n /\nexport function svelte_element_invalid_this_value() {\n\tif (DEV) {\n\t\tconst error = new Error(`svelte_element_invalid_this_value\\nThe \\`this\\` prop on \\`<svelte:element>\\` must be a string, if defined\\nhttps://svelte.dev/e/svelte_element_invalid_this_value`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/svelte_element_invalid_this_value`);\n\t}\n}","/ This file is generated by scripts/process-messages/index.js. Do not edit! /\n\nimport { DEV } from 'esm-env';\n\nexport from '../shared/errors.js';\n\n/*\n Cannot create a `$derived(...)` with an `await` expression outside of an effect tree\n * @returns {never}\n /\nexport function async_derived_orphan() {\n\tif (DEV) {\n\t\tconst error = new Error(`async_derived_orphan\\nCannot create a \\`$derived(...)\\` with an \\`await\\` expression outside of an effect tree\\nhttps://svelte.dev/e/async_derived_orphan`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/async_derived_orphan`);\n\t}\n}\n\n/\n Using `bind:value` together with a checkbox input is not allowed. Use `bind:checked` instead\n * @returns {never}\n /\nexport function bind_invalid_checkbox_value() {\n\tif (DEV) {\n\t\tconst error = new Error(`bind_invalid_checkbox_value\\nUsing \\`bind:value\\` together with a checkbox input is not allowed. Use \\`bind:checked\\` instead\\nhttps://svelte.dev/e/bind_invalid_checkbox_value`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/bind_invalid_checkbox_value`);\n\t}\n}\n\n/\n Component %component% has an export named `%key%` that a consumer component is trying to access using `bind:%key%`, which is disallowed. Instead, use `bind:this` (e.g. `<%name% bind:this={component} />`) and then access the property on the bound component instance (e.g. `component.%key%`)\n * @param {string} component\n * @param {string} key\n * @param {string} name\n * @returns {never}\n /\nexport function bind_invalid_export(component, key, name) {\n\tif (DEV) {\n\t\tconst error = new Error(`bind_invalid_export\\nComponent ${component} has an export named \\`${key}\\` that a consumer component is trying to access using \\`bind:${key}\\`, which is disallowed. Instead, use \\`bind:this\\` (e.g. \\`<${name} bind:this={component} />\\`) and then access the property on the bound component instance (e.g. \\`component.${key}\\`)\\nhttps://svelte.dev/e/bind_invalid_export`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/bind_invalid_export`);\n\t}\n}\n\n/\n A component is attempting to bind to a non-bindable property `%key%` belonging to %component% (i.e. `<%name% bind:%key%={...}>`). To mark a property as bindable: `let { %key% = $bindable() } = $props()`\n * @param {string} key\n * @param {string} component\n * @param {string} name\n * @returns {never}\n /\nexport function bind_not_bindable(key, component, name) {\n\tif (DEV) {\n\t\tconst error = new Error(`bind_not_bindable\\nA component is attempting to bind to a non-bindable property \\`${key}\\` belonging to ${component} (i.e. \\`<${name} bind:${key}={...}>\\`). To mark a property as bindable: \\`let { ${key} = $bindable() } = $props()\\`\\nhttps://svelte.dev/e/bind_not_bindable`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/bind_not_bindable`);\n\t}\n}\n\n/\n Calling `%method%` on a component instance (of %component%) is no longer valid in Svelte 5\n * @param {string} method\n * @param {string} component\n * @returns {never}\n /\nexport function component_api_changed(method, component) {\n\tif (DEV) {\n\t\tconst error = new Error(`component_api_changed\\nCalling \\`${method}\\` on a component instance (of ${component}) is no longer valid in Svelte 5\\nhttps://svelte.dev/e/component_api_changed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/component_api_changed`);\n\t}\n}\n\n/\n Attempted to instantiate %component% with `new %name%`, which is no longer valid in Svelte 5. If this component is not under your control, set the `compatibility.componentApi` compiler option to `4` to keep it working.\n * @param {string} component\n * @param {string} name\n * @returns {never}\n /\nexport function component_api_invalid_new(component, name) {\n\tif (DEV) {\n\t\tconst error = new Error(`component_api_invalid_new\\nAttempted to instantiate ${component} with \\`new ${name}\\`, which is no longer valid in Svelte 5. If this component is not under your control, set the \\`compatibility.componentApi\\` compiler option to \\`4\\` to keep it working.\\nhttps://svelte.dev/e/component_api_invalid_new`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/component_api_invalid_new`);\n\t}\n}\n\n/\n A derived value cannot reference itself recursively\n * @returns {never}\n /\nexport function derived_references_self() {\n\tif (DEV) {\n\t\tconst error = new Error(`derived_references_self\\nA derived value cannot reference itself recursively\\nhttps://svelte.dev/e/derived_references_self`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/derived_references_self`);\n\t}\n}\n\n/\n Keyed each block has duplicate key `%value%` at indexes %a% and %b%\n * @param {string} a\n * @param {string} b\n * @param {string \| undefined \| null} [value]\n * @returns {never}\n /\nexport function each_key_duplicate(a, b, value) {\n\tif (DEV) {\n\t\tconst error = new Error(`each_key_duplicate\\n${value\n\t\t\t? `Keyed each block has duplicate key \\`${value}\\` at indexes ${a} and ${b}`\n\t\t\t: `Keyed each block has duplicate key at indexes ${a} and ${b}`}\\nhttps://svelte.dev/e/each_key_duplicate`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/each_key_duplicate`);\n\t}\n}\n\n/\n Keyed each block has key that is not idempotent — the key for item at index %index% was `%a%` but is now `%b%`. Keys must be the same each time for a given item\n * @param {string} index\n * @param {string} a\n * @param {string} b\n * @returns {never}\n /\nexport function each_key_volatile(index, a, b) {\n\tif (DEV) {\n\t\tconst error = new Error(`each_key_volatile\\nKeyed each block has key that is not idempotent — the key for item at index ${index} was \\`${a}\\` but is now \\`${b}\\`. Keys must be the same each time for a given item\\nhttps://svelte.dev/e/each_key_volatile`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/each_key_volatile`);\n\t}\n}\n\n/\n `%rune%` cannot be used inside an effect cleanup function\n * @param {string} rune\n * @returns {never}\n /\nexport function effect_in_teardown(rune) {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_in_teardown\\n\\`${rune}\\` cannot be used inside an effect cleanup function\\nhttps://svelte.dev/e/effect_in_teardown`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_in_teardown`);\n\t}\n}\n\n/\n Effect cannot be created inside a `$derived` value that was not itself created inside an effect\n * @returns {never}\n /\nexport function effect_in_unowned_derived() {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_in_unowned_derived\\nEffect cannot be created inside a \\`$derived\\` value that was not itself created inside an effect\\nhttps://svelte.dev/e/effect_in_unowned_derived`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_in_unowned_derived`);\n\t}\n}\n\n/\n `%rune%` can only be used inside an effect (e.g. during component initialisation)\n * @param {string} rune\n * @returns {never}\n /\nexport function effect_orphan(rune) {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_orphan\\n\\`${rune}\\` can only be used inside an effect (e.g. during component initialisation)\\nhttps://svelte.dev/e/effect_orphan`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_orphan`);\n\t}\n}\n\n/\n `$effect.pending()` can only be called inside an effect or derived\n * @returns {never}\n /\nexport function effect_pending_outside_reaction() {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_pending_outside_reaction\\n\\`$effect.pending()\\` can only be called inside an effect or derived\\nhttps://svelte.dev/e/effect_pending_outside_reaction`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_pending_outside_reaction`);\n\t}\n}\n\n/\n Maximum update depth exceeded. This typically indicates that an effect reads and writes the same piece of state\n * @returns {never}\n /\nexport function effect_update_depth_exceeded() {\n\tif (DEV) {\n\t\tconst error = new Error(`effect_update_depth_exceeded\\nMaximum update depth exceeded. This typically indicates that an effect reads and writes the same piece of state\\nhttps://svelte.dev/e/effect_update_depth_exceeded`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/effect_update_depth_exceeded`);\n\t}\n}\n\n/\n Cannot use `flushSync` inside an effect\n * @returns {never}\n /\nexport function flush_sync_in_effect() {\n\tif (DEV) {\n\t\tconst error = new Error(`flush_sync_in_effect\\nCannot use \\`flushSync\\` inside an effect\\nhttps://svelte.dev/e/flush_sync_in_effect`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/flush_sync_in_effect`);\n\t}\n}\n\n/\n Cannot commit a fork that was already discarded\n * @returns {never}\n /\nexport function fork_discarded() {\n\tif (DEV) {\n\t\tconst error = new Error(`fork_discarded\\nCannot commit a fork that was already discarded\\nhttps://svelte.dev/e/fork_discarded`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/fork_discarded`);\n\t}\n}\n\n/\n Cannot create a fork inside an effect or when state changes are pending\n * @returns {never}\n /\nexport function fork_timing() {\n\tif (DEV) {\n\t\tconst error = new Error(`fork_timing\\nCannot create a fork inside an effect or when state changes are pending\\nhttps://svelte.dev/e/fork_timing`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/fork_timing`);\n\t}\n}\n\n/\n `getAbortSignal()` can only be called inside an effect or derived\n * @returns {never}\n /\nexport function get_abort_signal_outside_reaction() {\n\tif (DEV) {\n\t\tconst error = new Error(`get_abort_signal_outside_reaction\\n\\`getAbortSignal()\\` can only be called inside an effect or derived\\nhttps://svelte.dev/e/get_abort_signal_outside_reaction`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/get_abort_signal_outside_reaction`);\n\t}\n}\n\n/\n Expected to find a hydratable with key `%key%` during hydration, but did not.\n * @param {string} key\n * @returns {never}\n /\nexport function hydratable_missing_but_required(key) {\n\tif (DEV) {\n\t\tconst error = new Error(`hydratable_missing_but_required\\nExpected to find a hydratable with key \\`${key}\\` during hydration, but did not.\\nhttps://svelte.dev/e/hydratable_missing_but_required`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/hydratable_missing_but_required`);\n\t}\n}\n\n/\n Failed to hydrate the application\n * @returns {never}\n /\nexport function hydration_failed() {\n\tif (DEV) {\n\t\tconst error = new Error(`hydration_failed\\nFailed to hydrate the application\\nhttps://svelte.dev/e/hydration_failed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/hydration_failed`);\n\t}\n}\n\n/\n Could not `{@render}` snippet due to the expression being `null` or `undefined`. Consider using optional chaining `{@render snippet?.()}`\n * @returns {never}\n /\nexport function invalid_snippet() {\n\tif (DEV) {\n\t\tconst error = new Error(`invalid_snippet\\nCould not \\`{@render}\\` snippet due to the expression being \\`null\\` or \\`undefined\\`. Consider using optional chaining \\`{@render snippet?.()}\\`\\nhttps://svelte.dev/e/invalid_snippet`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/invalid_snippet`);\n\t}\n}\n\n/\n `%name%(...)` cannot be used in runes mode\n * @param {string} name\n * @returns {never}\n /\nexport function lifecycle_legacy_only(name) {\n\tif (DEV) {\n\t\tconst error = new Error(`lifecycle_legacy_only\\n\\`${name}(...)\\` cannot be used in runes mode\\nhttps://svelte.dev/e/lifecycle_legacy_only`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/lifecycle_legacy_only`);\n\t}\n}\n\n/\n Cannot do `bind:%key%={undefined}` when `%key%` has a fallback value\n * @param {string} key\n * @returns {never}\n /\nexport function props_invalid_value(key) {\n\tif (DEV) {\n\t\tconst error = new Error(`props_invalid_value\\nCannot do \\`bind:${key}={undefined}\\` when \\`${key}\\` has a fallback value\\nhttps://svelte.dev/e/props_invalid_value`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/props_invalid_value`);\n\t}\n}\n\n/\n Rest element properties of `$props()` such as `%property%` are readonly\n * @param {string} property\n * @returns {never}\n /\nexport function props_rest_readonly(property) {\n\tif (DEV) {\n\t\tconst error = new Error(`props_rest_readonly\\nRest element properties of \\`$props()\\` such as \\`${property}\\` are readonly\\nhttps://svelte.dev/e/props_rest_readonly`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/props_rest_readonly`);\n\t}\n}\n\n/\n The `%rune%` rune is only available inside `.svelte` and `.svelte.js/ts` files\n * @param {string} rune\n * @returns {never}\n /\nexport function rune_outside_svelte(rune) {\n\tif (DEV) {\n\t\tconst error = new Error(`rune_outside_svelte\\nThe \\`${rune}\\` rune is only available inside \\`.svelte\\` and \\`.svelte.js/ts\\` files\\nhttps://svelte.dev/e/rune_outside_svelte`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/rune_outside_svelte`);\n\t}\n}\n\n/\n `setContext` must be called when a component first initializes, not in a subsequent effect or after an `await` expression\n * @returns {never}\n /\nexport function set_context_after_init() {\n\tif (DEV) {\n\t\tconst error = new Error(`set_context_after_init\\n\\`setContext\\` must be called when a component first initializes, not in a subsequent effect or after an \\`await\\` expression\\nhttps://svelte.dev/e/set_context_after_init`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/set_context_after_init`);\n\t}\n}\n\n/\n Property descriptors defined on `$state` objects must contain `value` and always be `enumerable`, `configurable` and `writable`.\n * @returns {never}\n /\nexport function state_descriptors_fixed() {\n\tif (DEV) {\n\t\tconst error = new Error(`state_descriptors_fixed\\nProperty descriptors defined on \\`$state\\` objects must contain \\`value\\` and always be \\`enumerable\\`, \\`configurable\\` and \\`writable\\`.\\nhttps://svelte.dev/e/state_descriptors_fixed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/state_descriptors_fixed`);\n\t}\n}\n\n/\n Cannot set prototype of `$state` object\n * @returns {never}\n /\nexport function state_prototype_fixed() {\n\tif (DEV) {\n\t\tconst error = new Error(`state_prototype_fixed\\nCannot set prototype of \\`$state\\` object\\nhttps://svelte.dev/e/state_prototype_fixed`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/state_prototype_fixed`);\n\t}\n}\n\n/\n Updating state inside `$derived(...)`, `$inspect(...)` or a template expression is forbidden. If the value should not be reactive, declare it without `$state`\n * @returns {never}\n /\nexport function state_unsafe_mutation() {\n\tif (DEV) {\n\t\tconst error = new Error(`state_unsafe_mutation\\nUpdating state inside \\`$derived(...)\\`, \\`$inspect(...)\\` or a template expression is forbidden. If the value should not be reactive, declare it without \\`$state\\`\\nhttps://svelte.dev/e/state_unsafe_mutation`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/state_unsafe_mutation`);\n\t}\n}\n\n/\n A `<svelte:boundary>` `reset` function cannot be called while an error is still being handled\n * @returns {never}\n /\nexport function svelte_boundary_reset_onerror() {\n\tif (DEV) {\n\t\tconst error = new Error(`svelte_boundary_reset_onerror\\nA \\`<svelte:boundary>\\` \\`reset\\` function cannot be called while an error is still being handled\\nhttps://svelte.dev/e/svelte_boundary_reset_onerror`);\n\n\t\terror.name = 'Svelte error';\n\n\t\tthrow error;\n\t} else {\n\t\tthrow new Error(`https://svelte.dev/e/svelte_boundary_reset_onerror`);\n\t}\n}","/ This file is generated by scripts/process-messages/index.js. Do not edit! /\n\nimport { DEV } from 'esm-env';\n\nvar bold = 'font-weight: bold';\nvar normal = 'font-weight: normal';\n\n/\n Assignment to `%property%` property (%location%) will evaluate to the right-hand side, not the value of `%property%` following the assignment. This may result in unexpected behaviour.\n * @param {string} property\n * @param {string} location\n /\nexport function assignment_value_stale(property, location) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] assignment_value_stale\\n%cAssignment to \\`${property}\\` property (${location}) will evaluate to the right-hand side, not the value of \\`${property}\\` following the assignment. This may result in unexpected behaviour.\\nhttps://svelte.dev/e/assignment_value_stale`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/assignment_value_stale`);\n\t}\n}\n\n/\n Detected reactivity loss when reading `%name%`. This happens when state is read in an async function after an earlier `await`\n * @param {string} name\n /\nexport function await_reactivity_loss(name) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] await_reactivity_loss\\n%cDetected reactivity loss when reading \\`${name}\\`. This happens when state is read in an async function after an earlier \\`await\\`\\nhttps://svelte.dev/e/await_reactivity_loss`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/await_reactivity_loss`);\n\t}\n}\n\n/\n An async derived, `%name%` (%location%) was not read immediately after it resolved. This often indicates an unnecessary waterfall, which can slow down your app\n * @param {string} name\n * @param {string} location\n /\nexport function await_waterfall(name, location) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] await_waterfall\\n%cAn async derived, \\`${name}\\` (${location}) was not read immediately after it resolved. This often indicates an unnecessary waterfall, which can slow down your app\\nhttps://svelte.dev/e/await_waterfall`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/await_waterfall`);\n\t}\n}\n\n/\n `%binding%` (%location%) is binding to a non-reactive property\n * @param {string} binding\n * @param {string \| undefined \| null} [location]\n /\nexport function binding_property_non_reactive(binding, location) {\n\tif (DEV) {\n\t\tconsole.warn(\n\t\t\t`%c[svelte] binding_property_non_reactive\\n%c${location\n\t\t\t\t? `\\`${binding}\\` (${location}) is binding to a non-reactive property`\n\t\t\t\t: `\\`${binding}\\` is binding to a non-reactive property`}\\nhttps://svelte.dev/e/binding_property_non_reactive`,\n\t\t\tbold,\n\t\t\tnormal\n\t\t);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/binding_property_non_reactive`);\n\t}\n}\n\n/\n Your `console.%method%` contained `$state` proxies. Consider using `$inspect(...)` or `$state.snapshot(...)` instead\n * @param {string} method\n /\nexport function console_log_state(method) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] console_log_state\\n%cYour \\`console.${method}\\` contained \\`$state\\` proxies. Consider using \\`$inspect(...)\\` or \\`$state.snapshot(...)\\` instead\\nhttps://svelte.dev/e/console_log_state`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/console_log_state`);\n\t}\n}\n\n/\n Reading a derived belonging to a now-destroyed effect may result in stale values\n /\nexport function derived_inert() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] derived_inert\\n%cReading a derived belonging to a now-destroyed effect may result in stale values\\nhttps://svelte.dev/e/derived_inert`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/derived_inert`);\n\t}\n}\n\n/\n %handler% should be a function. Did you mean to %suggestion%?\n * @param {string} handler\n * @param {string} suggestion\n /\nexport function event_handler_invalid(handler, suggestion) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] event_handler_invalid\\n%c${handler} should be a function. Did you mean to ${suggestion}?\\nhttps://svelte.dev/e/event_handler_invalid`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/event_handler_invalid`);\n\t}\n}\n\n/\n Expected to find a hydratable with key `%key%` during hydration, but did not.\n * @param {string} key\n /\nexport function hydratable_missing_but_expected(key) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] hydratable_missing_but_expected\\n%cExpected to find a hydratable with key \\`${key}\\` during hydration, but did not.\\nhttps://svelte.dev/e/hydratable_missing_but_expected`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydratable_missing_but_expected`);\n\t}\n}\n\n/\n The `%attribute%` attribute on `%html%` changed its value between server and client renders. The client value, `%value%`, will be ignored in favour of the server value\n * @param {string} attribute\n * @param {string} html\n * @param {string} value\n /\nexport function hydration_attribute_changed(attribute, html, value) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] hydration_attribute_changed\\n%cThe \\`${attribute}\\` attribute on \\`${html}\\` changed its value between server and client renders. The client value, \\`${value}\\`, will be ignored in favour of the server value\\nhttps://svelte.dev/e/hydration_attribute_changed`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydration_attribute_changed`);\n\t}\n}\n\n/\n The value of an `{@html ...}` block %location% changed between server and client renders. The client value will be ignored in favour of the server value\n * @param {string \| undefined \| null} [location]\n /\nexport function hydration_html_changed(location) {\n\tif (DEV) {\n\t\tconsole.warn(\n\t\t\t`%c[svelte] hydration_html_changed\\n%c${location\n\t\t\t\t? `The value of an \\`{@html ...}\\` block ${location} changed between server and client renders. The client value will be ignored in favour of the server value`\n\t\t\t\t: 'The value of an `{@html ...}` block changed between server and client renders. The client value will be ignored in favour of the server value'}\\nhttps://svelte.dev/e/hydration_html_changed`,\n\t\t\tbold,\n\t\t\tnormal\n\t\t);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydration_html_changed`);\n\t}\n}\n\n/\n Hydration failed because the initial UI does not match what was rendered on the server. The error occurred near %location%\n * @param {string \| undefined \| null} [location]\n /\nexport function hydration_mismatch(location) {\n\tif (DEV) {\n\t\tconsole.warn(\n\t\t\t`%c[svelte] hydration_mismatch\\n%c${location\n\t\t\t\t? `Hydration failed because the initial UI does not match what was rendered on the server. The error occurred near ${location}`\n\t\t\t\t: 'Hydration failed because the initial UI does not match what was rendered on the server'}\\nhttps://svelte.dev/e/hydration_mismatch`,\n\t\t\tbold,\n\t\t\tnormal\n\t\t);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/hydration_mismatch`);\n\t}\n}\n\n/\n The `render` function passed to `createRawSnippet` should return HTML for a single element\n /\nexport function invalid_raw_snippet_render() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] invalid_raw_snippet_render\\n%cThe \\`render\\` function passed to \\`createRawSnippet\\` should return HTML for a single element\\nhttps://svelte.dev/e/invalid_raw_snippet_render`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/invalid_raw_snippet_render`);\n\t}\n}\n\n/\n Detected a migrated `$:` reactive block in `%filename%` that both accesses and updates the same reactive value. This may cause recursive updates when converted to an `$effect`.\n * @param {string} filename\n /\nexport function legacy_recursive_reactive_block(filename) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] legacy_recursive_reactive_block\\n%cDetected a migrated \\`$:\\` reactive block in \\`${filename}\\` that both accesses and updates the same reactive value. This may cause recursive updates when converted to an \\`$effect\\`.\\nhttps://svelte.dev/e/legacy_recursive_reactive_block`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/legacy_recursive_reactive_block`);\n\t}\n}\n\n/\n Tried to unmount a component that was not mounted\n /\nexport function lifecycle_double_unmount() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] lifecycle_double_unmount\\n%cTried to unmount a component that was not mounted\\nhttps://svelte.dev/e/lifecycle_double_unmount`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/lifecycle_double_unmount`);\n\t}\n}\n\n/\n %parent% passed property `%prop%` to %child% with `bind:`, but its parent component %owner% did not declare `%prop%` as a binding. Consider creating a binding between %owner% and %parent% (e.g. `bind:%prop%={...}` instead of `%prop%={...}`)\n * @param {string} parent\n * @param {string} prop\n * @param {string} child\n * @param {string} owner\n /\nexport function ownership_invalid_binding(parent, prop, child, owner) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] ownership_invalid_binding\\n%c${parent} passed property \\`${prop}\\` to ${child} with \\`bind:\\`, but its parent component ${owner} did not declare \\`${prop}\\` as a binding. Consider creating a binding between ${owner} and ${parent} (e.g. \\`bind:${prop}={...}\\` instead of \\`${prop}={...}\\`)\\nhttps://svelte.dev/e/ownership_invalid_binding`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/ownership_invalid_binding`);\n\t}\n}\n\n/\n Mutating unbound props (`%name%`, at %location%) is strongly discouraged. Consider using `bind:%prop%={...}` in %parent% (or using a callback) instead\n * @param {string} name\n * @param {string} location\n * @param {string} prop\n * @param {string} parent\n /\nexport function ownership_invalid_mutation(name, location, prop, parent) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] ownership_invalid_mutation\\n%cMutating unbound props (\\`${name}\\`, at ${location}) is strongly discouraged. Consider using \\`bind:${prop}={...}\\` in ${parent} (or using a callback) instead\\nhttps://svelte.dev/e/ownership_invalid_mutation`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/ownership_invalid_mutation`);\n\t}\n}\n\n/\n The `value` property of a `<select multiple>` element should be an array, but it received a non-array value. The selection will be kept as is.\n /\nexport function select_multiple_invalid_value() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] select_multiple_invalid_value\\n%cThe \\`value\\` property of a \\`<select multiple>\\` element should be an array, but it received a non-array value. The selection will be kept as is.\\nhttps://svelte.dev/e/select_multiple_invalid_value`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/select_multiple_invalid_value`);\n\t}\n}\n\n/\n Reactive `$state(...)` proxies and the values they proxy have different identities. Because of this, comparisons with `%operator%` will produce unexpected results\n * @param {string} operator\n /\nexport function state_proxy_equality_mismatch(operator) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] state_proxy_equality_mismatch\\n%cReactive \\`$state(...)\\` proxies and the values they proxy have different identities. Because of this, comparisons with \\`${operator}\\` will produce unexpected results\\nhttps://svelte.dev/e/state_proxy_equality_mismatch`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/state_proxy_equality_mismatch`);\n\t}\n}\n\n/\n Tried to unmount a state proxy, rather than a component\n /\nexport function state_proxy_unmount() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] state_proxy_unmount\\n%cTried to unmount a state proxy, rather than a component\\nhttps://svelte.dev/e/state_proxy_unmount`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/state_proxy_unmount`);\n\t}\n}\n\n/\n A `<svelte:boundary>` `reset` function only resets the boundary the first time it is called\n /\nexport function svelte_boundary_reset_noop() {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] svelte_boundary_reset_noop\\n%cA \\`<svelte:boundary>\\` \\`reset\\` function only resets the boundary the first time it is called\\nhttps://svelte.dev/e/svelte_boundary_reset_noop`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/svelte_boundary_reset_noop`);\n\t}\n}\n\n/\n The `slide` transition does not work correctly for elements with `display: %value%`\n * @param {string} value\n /\nexport function transition_slide_display(value) {\n\tif (DEV) {\n\t\tconsole.warn(`%c[svelte] transition_slide_display\\n%cThe \\`slide\\` transition does not work correctly for elements with \\`display: ${value}\\`\\nhttps://svelte.dev/e/transition_slide_display`, bold, normal);\n\t} else {\n\t\tconsole.warn(`https://svelte.dev/e/transition_slide_display`);\n\t}\n}","/* @import { TemplateNode } from '#client' /\n\nimport { COMMENT_NODE } from '#client/constants';\nimport {\n\tHYDRATION_END,\n\tHYDRATION_ERROR,\n\tHYDRATION_START,\n\tHYDRATION_START_ELSE\n} from '../../../constants.js';\nimport as w from '../warnings.js';\nimport { get_next_sibling } from './operations.js';\n\n/*\n Use this variable to guard everything related to hydration code so it can be treeshaken out\n * if the user doesn't use the `hydrate` method and these code paths are therefore not needed.\n /\nexport let hydrating = false;\n\n/* @param {boolean} value /\nexport function set_hydrating(value) {\n\thydrating = value;\n}\n\n/\n The node that is currently being hydrated. This starts out as the first node inside the opening\n * <!--[--> comment, and updates each time a component calls `$.child(...)` or `$.sibling(...)`.\n * When entering a block (e.g. `{#if ...}`), `hydrate_node` is the block opening comment; by the\n * time we leave the block it is the closing comment, which serves as the block's anchor.\n * @type {TemplateNode}\n /\nexport let hydrate_node;\n\n/* @param {TemplateNode \| null} node /\nexport function set_hydrate_node(node) {\n\tif (node === null) {\n\t\tw.hydration_mismatch();\n\t\tthrow HYDRATION_ERROR;\n\t}\n\n\treturn (hydrate_node = node);\n}\n\nexport function hydrate_next() {\n\treturn set_hydrate_node(get_next_sibling(hydrate_node));\n}\n\n/* @param {TemplateNode} node /\nexport function reset(node) {\n\tif (!hydrating) return;\n\n\t// If the node has remaining siblings, something has gone wrong\n\tif (get_next_sibling(hydrate_node) !== null) {\n\t\tw.hydration_mismatch();\n\t\tthrow HYDRATION_ERROR;\n\t}\n\n\thydrate_node = node;\n}\n\n/\n @param {HTMLTemplateElement} template\n /\nexport function hydrate_template(template) {\n\tif (hydrating) {\n\t\t// @ts-expect-error TemplateNode doesn't include DocumentFragment, but it's actually fine\n\t\thydrate_node = template.content;\n\t}\n}\n\nexport function next(count = 1) {\n\tif (hydrating) {\n\t\tvar i = count;\n\t\tvar node = hydrate_node;\n\n\t\twhile (i--) {\n\t\t\tnode = /* @type {TemplateNode} / (get_next_sibling(node));\n\t\t}\n\n\t\thydrate_node = node;\n\t}\n}\n\n/\n Skips or removes (depending on {@link remove}) all nodes starting at `hydrate_node` up until the next hydration end comment\n * @param {boolean} remove\n /\nexport function skip_nodes(remove = true) {\n\tvar depth = 0;\n\tvar node = hydrate_node;\n\n\twhile (true) {\n\t\tif (node.nodeType === COMMENT_NODE) {\n\t\t\tvar data = /* @type {Comment} / (node).data;\n\n\t\t\tif (data === HYDRATION_END) {\n\t\t\t\tif (depth === 0) return node;\n\t\t\t\tdepth -= 1;\n\t\t\t} else if (\n\t\t\t\tdata === HYDRATION_START \|\|\n\t\t\t\tdata === HYDRATION_START_ELSE \|\|\n\t\t\t\t// \"[1\", \"[2\", etc. for if blocks\n\t\t\t\t(data[0] === '[' && !isNaN(Number(data.slice(1))))\n\t\t\t) {\n\t\t\t\tdepth += 1;\n\t\t\t}\n\t\t}\n\n\t\tvar next = /* @type {TemplateNode} / (get_next_sibling(node));\n\t\tif (remove) node.remove();\n\t\tnode = next;\n\t}\n}\n\n/\n \n * @param {TemplateNode} node\n /\nexport function read_hydration_instruction(node) {\n\tif (!node \|\| node.nodeType !== COMMENT_NODE) {\n\t\tw.hydration_mismatch();\n\t\tthrow HYDRATION_ERROR;\n\t}\n\n\treturn /* @type {Comment} / (node).data;\n}\n","/* @import { Equals } from '#client' /\n\n/* @type {Equals} /\nexport function equals(value) {\n\treturn value === this.v;\n}\n\n/\n @param {unknown} a\n * @param {unknown} b\n * @returns {boolean}\n /\nexport function safe_not_equal(a, b) {\n\treturn a != a\n\t\t? b == b\n\t\t: a !== b \|\| (a !== null && typeof a === 'object') \|\| typeof a === 'function';\n}\n\n/\n @param {unknown} a\n * @param {unknown} b\n * @returns {boolean}\n /\nexport function not_equal(a, b) {\n\treturn a !== b;\n}\n\n/* @type {Equals} /\nexport function safe_equals(value) {\n\treturn !safe_not_equal(value, this.v);\n}\n","/* True if experimental.async=true /\nexport let async_mode_flag = false;\n/* True if we're not certain that we only have Svelte 5 code in the compilation /\nexport let legacy_mode_flag = false;\n/* True if $inspect.trace is used /\nexport let tracing_mode_flag = false;\n\nexport function enable_async_mode_flag() {\n\tasync_mode_flag = true;\n}\n\n/* ONLY USE THIS DURING TESTING /\nexport function disable_async_mode_flag() {\n\tasync_mode_flag = false;\n}\n\nexport function enable_legacy_mode_flag() {\n\tlegacy_mode_flag = true;\n}\n\nexport function enable_tracing_mode_flag() {\n\ttracing_mode_flag = true;\n}\n","/* @import { ComponentContext, DevStackEntry, Effect } from '#client' /\nimport { DEV } from 'esm-env';\nimport as e from './errors.js';\nimport { active_effect, active_reaction } from './runtime.js';\nimport { create_user_effect } from './reactivity/effects.js';\nimport { async_mode_flag, legacy_mode_flag } from '../flags/index.js';\nimport { FILENAME } from '../../constants.js';\nimport { BRANCH_EFFECT } from './constants.js';\n\n/** @type {ComponentContext \| null} /\nexport let component_context = null;\n\n/* @param {ComponentContext \| null} context /\nexport function set_component_context(context) {\n\tcomponent_context = context;\n}\n\n/* @type {DevStackEntry \| null} /\nexport let dev_stack = null;\n\n/* @param {DevStackEntry \| null} stack /\nexport function set_dev_stack(stack) {\n\tdev_stack = stack;\n}\n\n/\n Execute a callback with a new dev stack entry\n * @param {() => any} callback - Function to execute\n * @param {DevStackEntry['type']} type - Type of block/component\n * @param {any} component - Component function\n * @param {number} line - Line number\n * @param {number} column - Column number\n * @param {Record<string, any>} [additional] - Any additional properties to add to the dev stack entry\n * @returns {any}\n /\nexport function add_svelte_meta(callback, type, component, line, column, additional) {\n\tconst parent = dev_stack;\n\n\tdev_stack = {\n\t\ttype,\n\t\tfile: component[FILENAME],\n\t\tline,\n\t\tcolumn,\n\t\tparent,\n\t\t...additional\n\t};\n\n\ttry {\n\t\treturn callback();\n\t} finally {\n\t\tdev_stack = parent;\n\t}\n}\n\n/\n The current component function. Different from current component context:\n * ```html\n * <!-- App.svelte -->\n * <Foo>\n * <Bar /> <!-- context == Foo.svelte, function == App.svelte -->\n * </Foo>\n * ```\n * @type {ComponentContext['function']}\n /\nexport let dev_current_component_function = null;\n\n/* @param {ComponentContext['function']} fn /\nexport function set_dev_current_component_function(fn) {\n\tdev_current_component_function = fn;\n}\n\n/\n Returns a `[get, set]` pair of functions for working with context in a type-safe way.\n \n `get` will throw an error if no parent component called `set`.\n \n @template T\n * @returns {[() => T, (context: T) => T]}\n * @since 5.40.0\n /\nexport function createContext() {\n\tconst key = {};\n\n\treturn [\n\t\t() => {\n\t\t\tif (!hasContext(key)) {\n\t\t\t\te.missing_context();\n\t\t\t}\n\n\t\t\treturn getContext(key);\n\t\t},\n\t\t(context) => setContext(key, context)\n\t];\n}\n\n/\n Retrieves the context that belongs to the closest parent component with the specified `key`.\n * Must be called during component initialisation.\n \n [`createContext`](https://svelte.dev/docs/svelte/svelte#createContext) is a type-safe alternative.\n \n @template T\n * @param {any} key\n * @returns {T}\n /\nexport function getContext(key) {\n\tconst context_map = get_or_init_context_map('getContext');\n\tconst result = /* @type {T} / (context_map.get(key));\n\treturn result;\n}\n\n/\n Associates an arbitrary `context` object with the current component and the specified `key`\n * and returns that object. The context is then available to children of the component\n * (including slotted content) with `getContext`.\n \n Like lifecycle functions, this must be called during component initialisation.\n \n [`createContext`](https://svelte.dev/docs/svelte/svelte#createContext) is a type-safe alternative.\n \n @template T\n * @param {any} key\n * @param {T} context\n * @returns {T}\n /\nexport function setContext(key, context) {\n\tconst context_map = get_or_init_context_map('setContext');\n\n\tif (async_mode_flag) {\n\t\tvar flags = /* @type {Effect} / (active_effect).f;\n\t\tvar valid =\n\t\t\t!active_reaction &&\n\t\t\t(flags & BRANCH_EFFECT) !== 0 &&\n\t\t\t// pop() runs synchronously, so this indicates we're setting context after an await\n\t\t\t!(/* @type {ComponentContext} / (component_context).i);\n\n\t\tif (!valid) {\n\t\t\te.set_context_after_init();\n\t\t}\n\t}\n\n\tcontext_map.set(key, context);\n\treturn context;\n}\n\n/\n Checks whether a given `key` has been set in the context of a parent component.\n * Must be called during component initialisation.\n \n @param {any} key\n * @returns {boolean}\n /\nexport function hasContext(key) {\n\tconst context_map = get_or_init_context_map('hasContext');\n\treturn context_map.has(key);\n}\n\n/\n Retrieves the whole context map that belongs to the closest parent component.\n * Must be called during component initialisation. Useful, for example, if you\n * programmatically create a component and want to pass the existing context to it.\n \n @template {Map<any, any>} [T=Map<any, any>]\n * @returns {T}\n /\nexport function getAllContexts() {\n\tconst context_map = get_or_init_context_map('getAllContexts');\n\treturn /* @type {T} / (context_map);\n}\n\n/\n @param {Record<string, unknown>} props\n * @param {any} runes\n * @param {Function} [fn]\n * @returns {void}\n /\nexport function push(props, runes = false, fn) {\n\tcomponent_context = {\n\t\tp: component_context,\n\t\ti: false,\n\t\tc: null,\n\t\te: null,\n\t\ts: props,\n\t\tx: null,\n\t\tr: /* @type {Effect} / (active_effect),\n\t\tl: legacy_mode_flag && !runes ? { s: null, u: null, $: [] } : null\n\t};\n\n\tif (DEV) {\n\t\t// component function\n\t\tcomponent_context.function = fn;\n\t\tdev_current_component_function = fn;\n\t}\n}\n\n/\n @template {Record<string, any>} T\n * @param {T} [component]\n * @returns {T}\n /\nexport function pop(component) {\n\tvar context = /* @type {ComponentContext} / (component_context);\n\tvar effects = context.e;\n\n\tif (effects !== null) {\n\t\tcontext.e = null;\n\n\t\tfor (var fn of effects) {\n\t\t\tcreate_user_effect(fn);\n\t\t}\n\t}\n\n\tif (component !== undefined) {\n\t\tcontext.x = component;\n\t}\n\n\tcontext.i = true;\n\n\tcomponent_context = context.p;\n\n\tif (DEV) {\n\t\tdev_current_component_function = component_context?.function ?? null;\n\t}\n\n\treturn component ?? /* @type {T} / ({});\n}\n\n/* @returns {boolean} /\nexport function is_runes() {\n\treturn !legacy_mode_flag \|\| (component_context !== null && component_context.l === null);\n}\n\n/\n @param {string} name\n * @returns {Map<unknown, unknown>}\n /\nfunction get_or_init_context_map(name) {\n\tif (component_context === null) {\n\t\te.lifecycle_outside_component(name);\n\t}\n\n\treturn (component_context.c ??= new Map(get_parent_context(component_context) \|\| undefined));\n}\n\n/\n @param {ComponentContext} component_context\n * @returns {Map<unknown, unknown> \| null}\n /\nfunction get_parent_context(component_context) {\n\tlet parent = component_context.p;\n\twhile (parent !== null) {\n\t\tconst context_map = parent.c;\n\t\tif (context_map !== null) {\n\t\t\treturn context_map;\n\t\t}\n\t\tparent = parent.p;\n\t}\n\treturn null;\n}\n","import { run_all } from '../../shared/utils.js';\nimport { is_flushing_sync } from '../reactivity/batch.js';\n\n/* @type {Array<() => void>} /\nlet micro_tasks = [];\n\nfunction run_micro_tasks() {\n\tvar tasks = micro_tasks;\n\tmicro_tasks = [];\n\trun_all(tasks);\n}\n\n/\n @param {() => void} fn\n /\nexport function queue_micro_task(fn) {\n\tif (micro_tasks.length === 0 && !is_flushing_sync) {\n\t\tvar tasks = micro_tasks;\n\t\tqueueMicrotask(() => {\n\t\t\t// If this is false, a flushSync happened in the meantime. Do _not_ run new scheduled microtasks in that case\n\t\t\t// as the ordering of microtasks would be broken at that point - consider this case:\n\t\t\t// - queue_micro_task schedules microtask A to flush task X\n\t\t\t// - synchronously after, flushSync runs, processing task X\n\t\t\t// - synchronously after, some other microtask B is scheduled, but not through queue_micro_task but for example a Promise.resolve() in user code\n\t\t\t// - synchronously after, queue_micro_task schedules microtask C to flush task Y\n\t\t\t// - one tick later, microtask A now resolves, flushing task Y before microtask B, which is incorrect\n\t\t\t// This if check prevents that race condition (that realistically will only happen in tests)\n\t\t\tif (tasks === micro_tasks) run_micro_tasks();\n\t\t});\n\t}\n\n\tmicro_tasks.push(fn);\n}\n\n/\n Synchronously run any queued tasks.\n /\nexport function flush_tasks() {\n\twhile (micro_tasks.length > 0) {\n\t\trun_micro_tasks();\n\t}\n}\n","/* @import { Derived, Effect } from '#client' /\n/* @import { Boundary } from './dom/blocks/boundary.js' /\nimport { DEV } from 'esm-env';\nimport { FILENAME } from '../../constants.js';\nimport { is_firefox } from './dom/operations.js';\nimport { ERROR_VALUE, BOUNDARY_EFFECT, REACTION_RAN, EFFECT } from './constants.js';\nimport { define_property, get_descriptor } from '../shared/utils.js';\nimport { active_effect, active_reaction } from './runtime.js';\n\nconst adjustments = new WeakMap();\n\n/\n @param {unknown} error\n /\nexport function handle_error(error) {\n\tvar effect = active_effect;\n\n\t// for unowned deriveds, don't throw until we read the value\n\tif (effect === null) {\n\t\t/* @type {Derived} / (active_reaction).f \|= ERROR_VALUE;\n\t\treturn error;\n\t}\n\n\tif (DEV && error instanceof Error && !adjustments.has(error)) {\n\t\tadjustments.set(error, get_adjustments(error, effect));\n\t}\n\n\t// if the error occurred while creating this subtree, we let it\n\t// bubble up until it hits a boundary that can handle it, unless\n\t// it's an $effect in which case it doesn't run immediately\n\tif ((effect.f & REACTION_RAN) === 0 && (effect.f & EFFECT) === 0) {\n\t\tif (DEV && !effect.parent && error instanceof Error) {\n\t\t\tapply_adjustments(error);\n\t\t}\n\n\t\tthrow error;\n\t}\n\n\t// otherwise we bubble up the effect tree ourselves\n\tinvoke_error_boundary(error, effect);\n}\n\n/\n @param {unknown} error\n * @param {Effect \| null} effect\n /\nexport function invoke_error_boundary(error, effect) {\n\twhile (effect !== null) {\n\t\tif ((effect.f & BOUNDARY_EFFECT) !== 0) {\n\t\t\tif ((effect.f & REACTION_RAN) === 0) {\n\t\t\t\t// we are still creating the boundary effect\n\t\t\t\tthrow error;\n\t\t\t}\n\n\t\t\ttry {\n\t\t\t\t/* @type {Boundary} / (effect.b).error(error);\n\t\t\t\treturn;\n\t\t\t} catch (e) {\n\t\t\t\terror = e;\n\t\t\t}\n\t\t}\n\n\t\teffect = effect.parent;\n\t}\n\n\tif (DEV && error instanceof Error) {\n\t\tapply_adjustments(error);\n\t}\n\n\tthrow error;\n}\n\n/\n Add useful information to the error message/stack in development\n * @param {Error} error\n * @param {Effect} effect\n /\nfunction get_adjustments(error, effect) {\n\tconst message_descriptor = get_descriptor(error, 'message');\n\n\t// if the message was already changed and it's not configurable we can't change it\n\t// or it will throw a different error swallowing the original error\n\tif (message_descriptor && !message_descriptor.configurable) return;\n\n\tvar indent = is_firefox ? ' ' : '\\t';\n\tvar component_stack = `\\n${indent}in ${effect.fn?.name \|\| '<unknown>'}`;\n\tvar context = effect.ctx;\n\n\twhile (context !== null) {\n\t\tcomponent_stack += `\\n${indent}in ${context.function?.[FILENAME].split('/').pop()}`;\n\t\tcontext = context.p;\n\t}\n\n\treturn {\n\t\tmessage: error.message + `\\n${component_stack}\\n`,\n\t\tstack: error.stack\n\t\t\t?.split('\\n')\n\t\t\t.filter((line) => !line.includes('svelte/src/internal'))\n\t\t\t.join('\\n')\n\t};\n}\n\n/\n @param {Error} error\n /\nfunction apply_adjustments(error) {\n\tconst adjusted = adjustments.get(error);\n\n\tif (adjusted) {\n\t\tdefine_property(error, 'message', {\n\t\t\tvalue: adjusted.message\n\t\t});\n\n\t\tdefine_property(error, 'stack', {\n\t\t\tvalue: adjusted.stack\n\t\t});\n\t}\n}\n","/* @import { Derived, Signal } from '#client' /\nimport { CLEAN, CONNECTED, DIRTY, MAYBE_DIRTY } from '#client/constants';\n\nconst STATUS_MASK = ~(DIRTY \| MAYBE_DIRTY \| CLEAN);\n\n/\n @param {Signal} signal\n * @param {number} status\n /\nexport function set_signal_status(signal, status) {\n\tsignal.f = (signal.f & STATUS_MASK) \| status;\n}\n\n/\n Set a derived's status to CLEAN or MAYBE_DIRTY based on its connection state.\n * @param {Derived} derived\n /\nexport function update_derived_status(derived) {\n\t// Only mark as MAYBE_DIRTY if disconnected and has dependencies.\n\tif ((derived.f & CONNECTED) !== 0 \|\| derived.deps === null) {\n\t\tset_signal_status(derived, CLEAN);\n\t} else {\n\t\tset_signal_status(derived, MAYBE_DIRTY);\n\t}\n}\n","/* @import { Derived, Effect, Value } from '#client' /\nimport { CLEAN, DERIVED, DIRTY, MAYBE_DIRTY, WAS_MARKED } from '#client/constants';\nimport { set_signal_status } from './status.js';\n\n/\n @param {Value[] \| null} deps\n /\nfunction clear_marked(deps) {\n\tif (deps === null) return;\n\n\tfor (const dep of deps) {\n\t\tif ((dep.f & DERIVED) === 0 \|\| (dep.f & WAS_MARKED) === 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tdep.f ^= WAS_MARKED;\n\n\t\tclear_marked(/* @type {Derived} / (dep).deps);\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {Set<Effect>} dirty_effects\n * @param {Set<Effect>} maybe_dirty_effects\n /\nexport function defer_effect(effect, dirty_effects, maybe_dirty_effects) {\n\tif ((effect.f & DIRTY) !== 0) {\n\t\tdirty_effects.add(effect);\n\t} else if ((effect.f & MAYBE_DIRTY) !== 0) {\n\t\tmaybe_dirty_effects.add(effect);\n\t}\n\n\t// Since we're not executing these effects now, we need to clear any WAS_MARKED flags\n\t// so that other batches can correctly reach these effects during their own traversal\n\tclear_marked(effect.deps);\n\n\t// mark as clean so they get scheduled if they depend on pending async state\n\tset_signal_status(effect, CLEAN);\n}\n","/* @import { Readable } from './public' /\nimport { untrack } from '../internal/client/runtime.js';\nimport { noop } from '../internal/shared/utils.js';\n\n/\n @template T\n * @param {Readable<T> \| null \| undefined} store\n * @param {(value: T) => void} run\n * @param {(value: T) => void} [invalidate]\n * @returns {() => void}\n /\nexport function subscribe_to_store(store, run, invalidate) {\n\tif (store == null) {\n\t\t// @ts-expect-error\n\t\trun(undefined);\n\n\t\t// @ts-expect-error\n\t\tif (invalidate) invalidate(undefined);\n\n\t\treturn noop;\n\t}\n\n\t// Svelte store takes a private second argument\n\t// StartStopNotifier could mutate state, and we want to silence the corresponding validation error\n\tconst unsub = untrack(() =>\n\t\tstore.subscribe(\n\t\t\trun,\n\t\t\t// @ts-expect-error\n\t\t\tinvalidate\n\t\t)\n\t);\n\n\t// Also support RxJS\n\t// @ts-expect-error TODO fix this in the types?\n\treturn unsub.unsubscribe ? () => unsub.unsubscribe() : unsub;\n}\n","/* @import { Readable, StartStopNotifier, Subscriber, Unsubscriber, Updater, Writable } from '../public.js' /\n/* @import { Stores, StoresValues, SubscribeInvalidateTuple } from '../private.js' /\nimport { noop, run_all } from '../../internal/shared/utils.js';\nimport { safe_not_equal } from '../../internal/client/reactivity/equality.js';\nimport { subscribe_to_store } from '../utils.js';\n\n/\n @type {Array<SubscribeInvalidateTuple<any> \| any>}\n /\nconst subscriber_queue = [];\n\n/\n Creates a `Readable` store that allows reading by subscription.\n \n @template T\n * @param {T} [value] initial value\n * @param {StartStopNotifier<T>} [start]\n * @returns {Readable<T>}\n /\nexport function readable(value, start) {\n\treturn {\n\t\tsubscribe: writable(value, start).subscribe\n\t};\n}\n\n/\n Create a `Writable` store that allows both updating and reading by subscription.\n \n @template T\n * @param {T} [value] initial value\n * @param {StartStopNotifier<T>} [start]\n * @returns {Writable<T>}\n /\nexport function writable(value, start = noop) {\n\t/* @type {Unsubscriber \| null} /\n\tlet stop = null;\n\n\t/* @type {Set<SubscribeInvalidateTuple<T>>} /\n\tconst subscribers = new Set();\n\n\t/\n\t @param {T} new_value\n\t * @returns {void}\n\t /\n\tfunction set(new_value) {\n\t\tif (safe_not_equal(value, new_value)) {\n\t\t\tvalue = new_value;\n\t\t\tif (stop) {\n\t\t\t\t// store is ready\n\t\t\t\tconst run_queue = !subscriber_queue.length;\n\t\t\t\tfor (const subscriber of subscribers) {\n\t\t\t\t\tsubscriber[1]();\n\t\t\t\t\tsubscriber_queue.push(subscriber, value);\n\t\t\t\t}\n\t\t\t\tif (run_queue) {\n\t\t\t\t\tfor (let i = 0; i < subscriber_queue.length; i += 2) {\n\t\t\t\t\t\tsubscriber_queue[i][0](subscriber_queue[i + 1]);\n\t\t\t\t\t}\n\t\t\t\t\tsubscriber_queue.length = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t @param {Updater<T>} fn\n\t * @returns {void}\n\t /\n\tfunction update(fn) {\n\t\tset(fn(/* @type {T} / (value)));\n\t}\n\n\t/\n\t @param {Subscriber<T>} run\n\t * @param {() => void} [invalidate]\n\t * @returns {Unsubscriber}\n\t /\n\tfunction subscribe(run, invalidate = noop) {\n\t\t/* @type {SubscribeInvalidateTuple<T>} /\n\t\tconst subscriber = [run, invalidate];\n\t\tsubscribers.add(subscriber);\n\t\tif (subscribers.size === 1) {\n\t\t\tstop = start(set, update) \|\| noop;\n\t\t}\n\t\trun(/* @type {T} / (value));\n\t\treturn () => {\n\t\t\tsubscribers.delete(subscriber);\n\t\t\tif (subscribers.size === 0 && stop) {\n\t\t\t\tstop();\n\t\t\t\tstop = null;\n\t\t\t}\n\t\t};\n\t}\n\treturn { set, update, subscribe };\n}\n\n/\n Derived value store by synchronizing one or more readable stores and\n * applying an aggregation function over its input values.\n \n @template {Stores} S\n * @template T\n * @overload\n * @param {S} stores\n * @param {(values: StoresValues<S>, set: (value: T) => void, update: (fn: Updater<T>) => void) => Unsubscriber \| void} fn\n * @param {T} [initial_value]\n * @returns {Readable<T>}\n /\n/\n Derived value store by synchronizing one or more readable stores and\n * applying an aggregation function over its input values.\n \n @template {Stores} S\n * @template T\n * @overload\n * @param {S} stores\n * @param {(values: StoresValues<S>) => T} fn\n * @param {T} [initial_value]\n * @returns {Readable<T>}\n /\n/\n @template {Stores} S\n * @template T\n * @param {S} stores\n * @param {Function} fn\n * @param {T} [initial_value]\n * @returns {Readable<T>}\n /\nexport function derived(stores, fn, initial_value) {\n\tconst single = !Array.isArray(stores);\n\t/* @type {Array<Readable<any>>} /\n\tconst stores_array = single ? [stores] : stores;\n\tif (!stores_array.every(Boolean)) {\n\t\tthrow new Error('derived() expects stores as input, got a falsy value');\n\t}\n\tconst auto = fn.length < 2;\n\treturn readable(initial_value, (set, update) => {\n\t\tlet started = false;\n\t\t/* @type {T[]} /\n\t\tconst values = [];\n\t\tlet pending = 0;\n\t\tlet cleanup = noop;\n\t\tconst sync = () => {\n\t\t\tif (pending) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tcleanup();\n\t\t\tconst result = fn(single ? values[0] : values, set, update);\n\t\t\tif (auto) {\n\t\t\t\tset(result);\n\t\t\t} else {\n\t\t\t\tcleanup = typeof result === 'function' ? result : noop;\n\t\t\t}\n\t\t};\n\t\tconst unsubscribers = stores_array.map((store, i) =>\n\t\t\tsubscribe_to_store(\n\t\t\t\tstore,\n\t\t\t\t(value) => {\n\t\t\t\t\tvalues[i] = value;\n\t\t\t\t\tpending &= ~(1 << i);\n\t\t\t\t\tif (started) {\n\t\t\t\t\t\tsync();\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t() => {\n\t\t\t\t\tpending \|= 1 << i;\n\t\t\t\t}\n\t\t\t)\n\t\t);\n\t\tstarted = true;\n\t\tsync();\n\t\treturn function stop() {\n\t\t\trun_all(unsubscribers);\n\t\t\tcleanup();\n\t\t\t// We need to set this to false because callbacks can still happen despite having unsubscribed:\n\t\t\t// Callbacks might already be placed in the queue which doesn't know it should no longer\n\t\t\t// invoke this derived store.\n\t\t\tstarted = false;\n\t\t};\n\t});\n}\n\n/\n Takes a store and returns a new one derived from the old one that is readable.\n \n @template T\n * @param {Readable<T>} store - store to make readonly\n * @returns {Readable<T>}\n /\nexport function readonly(store) {\n\treturn {\n\t\t// @ts-expect-error TODO i suspect the bind is unnecessary\n\t\tsubscribe: store.subscribe.bind(store)\n\t};\n}\n\n/\n Get the current value from a store by subscribing and immediately unsubscribing.\n \n @template T\n * @param {Readable<T>} store\n * @returns {T}\n /\nexport function get(store) {\n\tlet value;\n\tsubscribe_to_store(store, (_) => (value = _))();\n\t// @ts-expect-error\n\treturn value;\n}\n","/* @import { StoreReferencesContainer } from '#client' /\n/* @import { Store } from '#shared' /\nimport { subscribe_to_store } from '../../../store/utils.js';\nimport { get as get_store } from '../../../store/shared/index.js';\nimport { define_property, noop } from '../../shared/utils.js';\nimport { get } from '../runtime.js';\nimport { teardown } from './effects.js';\nimport { mutable_source, set } from './sources.js';\nimport { DEV } from 'esm-env';\n\n/\n We set this to `true` when updating a store so that we correctly\n * schedule effects if the update takes place inside a `$:` effect\n /\nexport let legacy_is_updating_store = false;\n\n/\n Whether or not the prop currently being read is a store binding, as in\n * `<Child bind:x={$y} />`. If it is, we treat the prop as mutable even in\n * runes mode, and skip `binding_property_non_reactive` validation\n /\nlet is_store_binding = false;\n\nlet IS_UNMOUNTED = Symbol('unmounted');\n\n/\n Gets the current value of a store. If the store isn't subscribed to yet, it will create a proxy\n * signal that will be updated when the store is. The store references container is needed to\n * track reassignments to stores and to track the correct component context.\n * @template V\n * @param {Store<V> \| null \| undefined} store\n * @param {string} store_name\n * @param {StoreReferencesContainer} stores\n * @returns {V}\n /\nexport function store_get(store, store_name, stores) {\n\tconst entry = (stores[store_name] ??= {\n\t\tstore: null,\n\t\tsource: mutable_source(undefined),\n\t\tunsubscribe: noop\n\t});\n\n\tif (DEV) {\n\t\tentry.source.label = store_name;\n\t}\n\n\t// if the component that setup this is already unmounted we don't want to register a subscription\n\tif (entry.store !== store && !(IS_UNMOUNTED in stores)) {\n\t\tentry.unsubscribe();\n\t\tentry.store = store ?? null;\n\n\t\tif (store == null) {\n\t\t\tentry.source.v = undefined; // see synchronous callback comment below\n\t\t\tentry.unsubscribe = noop;\n\t\t} else {\n\t\t\tvar is_synchronous_callback = true;\n\n\t\t\tentry.unsubscribe = subscribe_to_store(store, (v) => {\n\t\t\t\tif (is_synchronous_callback) {\n\t\t\t\t\t// If the first updates to the store value (possibly multiple of them) are synchronously\n\t\t\t\t\t// inside a derived, we will hit the `state_unsafe_mutation` error if we `set` the value\n\t\t\t\t\tentry.source.v = v;\n\t\t\t\t} else {\n\t\t\t\t\tset(entry.source, v);\n\t\t\t\t}\n\t\t\t});\n\n\t\t\tis_synchronous_callback = false;\n\t\t}\n\t}\n\n\t// if the component that setup this stores is already unmounted the source will be out of sync\n\t// so we just use the `get` for the stores, less performant but it avoids to create a memory leak\n\t// and it will keep the value consistent\n\tif (store && IS_UNMOUNTED in stores) {\n\t\treturn get_store(store);\n\t}\n\n\treturn get(entry.source);\n}\n\n/\n Unsubscribe from a store if it's not the same as the one in the store references container.\n * We need this in addition to `store_get` because someone could unsubscribe from a store but\n * then never subscribe to the new one (if any), causing the subscription to stay open wrongfully.\n * @param {Store<any> \| null \| undefined} store\n * @param {string} store_name\n * @param {StoreReferencesContainer} stores\n /\nexport function store_unsub(store, store_name, stores) {\n\t/* @type {StoreReferencesContainer[''] \| undefined} /\n\tlet entry = stores[store_name];\n\n\tif (entry && entry.store !== store) {\n\t\t// Don't reset store yet, so that store_get above can resubscribe to new store if necessary\n\t\tentry.unsubscribe();\n\t\tentry.unsubscribe = noop;\n\t}\n\n\treturn store;\n}\n\n/\n Sets the new value of a store and returns that value.\n * @template V\n * @param {Store<V>} store\n * @param {V} value\n * @returns {V}\n /\nexport function store_set(store, value) {\n\tupdate_with_flag(store, value);\n\treturn value;\n}\n\n/\n @param {StoreReferencesContainer} stores\n * @param {string} store_name\n /\nexport function invalidate_store(stores, store_name) {\n\tvar entry = stores[store_name];\n\tif (entry.store !== null) {\n\t\tstore_set(entry.store, entry.source.v);\n\t}\n}\n\n/\n Unsubscribes from all auto-subscribed stores on destroy\n * @returns {[StoreReferencesContainer, ()=>void]}\n /\nexport function setup_stores() {\n\t/* @type {StoreReferencesContainer} /\n\tconst stores = {};\n\n\tfunction cleanup() {\n\t\tteardown(() => {\n\t\t\tfor (var store_name in stores) {\n\t\t\t\tconst ref = stores[store_name];\n\t\t\t\tref.unsubscribe();\n\t\t\t}\n\t\t\tdefine_property(stores, IS_UNMOUNTED, {\n\t\t\t\tenumerable: false,\n\t\t\t\tvalue: true\n\t\t\t});\n\t\t});\n\t}\n\n\treturn [stores, cleanup];\n}\n\n/\n @param {Store<V>} store\n * @param {V} value\n * @template V\n /\nfunction update_with_flag(store, value) {\n\tlegacy_is_updating_store = true;\n\n\ttry {\n\t\tstore.set(value);\n\t} finally {\n\t\tlegacy_is_updating_store = false;\n\t}\n}\n\n/\n Updates a store with a new value.\n * @param {Store<V>} store the store to update\n * @param {any} expression the expression that mutates the store\n * @param {V} new_value the new store value\n * @template V\n /\nexport function store_mutate(store, expression, new_value) {\n\tupdate_with_flag(store, new_value);\n\treturn expression;\n}\n\n/\n @param {Store<number>} store\n * @param {number} store_value\n * @param {1 \| -1} [d]\n * @returns {number}\n /\nexport function update_store(store, store_value, d = 1) {\n\tupdate_with_flag(store, store_value + d);\n\treturn store_value;\n}\n\n/\n @param {Store<number>} store\n * @param {number} store_value\n * @param {1 \| -1} [d]\n * @returns {number}\n /\nexport function update_pre_store(store, store_value, d = 1) {\n\tconst value = store_value + d;\n\tupdate_with_flag(store, value);\n\treturn value;\n}\n\n/\n Called inside prop getters to communicate that the prop is a store binding\n /\nexport function mark_store_binding() {\n\tis_store_binding = true;\n}\n\n/\n Returns a tuple that indicates whether `fn()` reads a prop that is a store binding.\n * Used to prevent `binding_property_non_reactive` validation false positives and\n * ensure that these props are treated as mutable even in runes mode\n * @template T\n * @param {() => T} fn\n * @returns {[T, boolean]}\n /\nexport function capture_store_binding(fn) {\n\tvar previous_is_store_binding = is_store_binding;\n\n\ttry {\n\t\tis_store_binding = false;\n\t\treturn [fn(), is_store_binding];\n\t} finally {\n\t\tis_store_binding = previous_is_store_binding;\n\t}\n}\n","/* @import { Fork } from 'svelte' /\n/* @import { Derived, Effect, Reaction, Source, Value } from '#client' /\nimport {\n\tBLOCK_EFFECT,\n\tBRANCH_EFFECT,\n\tCLEAN,\n\tDESTROYED,\n\tDIRTY,\n\tEFFECT,\n\tASYNC,\n\tINERT,\n\tRENDER_EFFECT,\n\tROOT_EFFECT,\n\tMAYBE_DIRTY,\n\tDERIVED,\n\tEAGER_EFFECT,\n\tERROR_VALUE,\n\tMANAGED_EFFECT,\n\tREACTION_RAN,\n\tDESTROYING\n} from '#client/constants';\nimport { async_mode_flag } from '../../flags/index.js';\nimport { deferred, define_property, includes } from '../../shared/utils.js';\nimport {\n\tactive_effect,\n\tactive_reaction,\n\tget,\n\tincrement_write_version,\n\tis_dirty,\n\tupdate_effect\n} from '../runtime.js';\nimport as e from '../errors.js';\nimport { flush_tasks, queue_micro_task } from '../dom/task.js';\nimport { DEV } from 'esm-env';\nimport { invoke_error_boundary } from '../error-handling.js';\nimport { flush_eager_effects, old_values, set_eager_effects, source, update } from './sources.js';\nimport { eager_effect, teardown, unlink_effect } from './effects.js';\nimport { defer_effect } from './utils.js';\nimport { UNINITIALIZED } from '../../../constants.js';\nimport { set_signal_status } from './status.js';\nimport { legacy_is_updating_store } from './store.js';\nimport { invariant } from '../../shared/dev.js';\nimport { log_effect_tree } from '../dev/debug.js';\n\n/** @type {Batch \| null} /\nlet first_batch = null;\n\n/* @type {Batch \| null} /\nlet last_batch = null;\n\n/* @type {Batch \| null} /\nexport let current_batch = null;\n\n/\n This is needed to avoid overwriting inputs\n * @type {Batch \| null}\n /\nexport let previous_batch = null;\n\n/\n When time travelling (i.e. working in one batch, while other batches\n * still have ongoing work), we ignore the real values of affected\n * signals in favour of their values within the batch\n * @type {Map<Value, any> \| null}\n /\nexport let batch_values = null;\n\n/* @type {Effect \| null} /\nlet last_scheduled_effect = null;\n\nexport let is_flushing_sync = false;\nlet is_processing = false;\n\n/\n During traversal, this is an array. Newly created effects are (if not immediately\n * executed) pushed to this array, rather than going through the scheduling\n * rigamarole that would cause another turn of the flush loop.\n * @type {Effect[] \| null}\n /\nexport let collected_effects = null;\n\n/\n An array of effects that are marked during traversal as a result of a `set`\n * (not `internal_set`) call. These will be added to the next batch and\n * trigger another `batch.process()`\n * @type {Effect[] \| null}\n * @deprecated when we get rid of legacy mode and stores, we can get rid of this\n /\nexport let legacy_updates = null;\n\nvar flush_count = 0;\n\n/* @type {Set<Value>} /\nvar source_stacks = new Set();\n\nlet uid = 1;\n\nexport class Batch {\n\tid = uid++;\n\n\t/* True as soon as `#process` was called /\n\t#started = false;\n\n\tlinked = true;\n\n\t/* @type {Batch \| null} /\n\t#prev = null;\n\n\t/* @type {Batch \| null} /\n\t#next = null;\n\n\t/* @type {Map<Effect, ReturnType<typeof deferred<any>>>} /\n\tasync_deriveds = new Map();\n\n\t/\n\t The current values of any signals that are updated in this batch.\n\t * Tuple format: [value, is_derived] (note: is_derived is false for deriveds, too, if they were overridden via assignment)\n\t * They keys of this map are identical to `this.#previous`\n\t * @type {Map<Value, [any, boolean]>}\n\t /\n\tcurrent = new Map();\n\n\t/\n\t The values of any signals (sources and deriveds) that are updated in this batch _before_ those updates took place.\n\t * They keys of this map are identical to `this.#current`\n\t * @type {Map<Value, any>}\n\t /\n\tprevious = new Map();\n\n\t/\n\t Async effects which this batch doesn't take into account anymore when calculating blockers,\n\t * as it has a value for it already.\n\t * @type {Set<Effect>}\n\t /\n\tunblocked = new Set();\n\n\t/\n\t When the batch is committed (and the DOM is updated), we need to remove old branches\n\t * and append new ones by calling the functions added inside (if/each/key/etc) blocks\n\t * @type {Set<(batch: Batch) => void>}\n\t /\n\t#commit_callbacks = new Set();\n\n\t/\n\t If a fork is discarded, we need to destroy any effects that are no longer needed\n\t * @type {Set<(batch: Batch) => void>}\n\t /\n\t#discard_callbacks = new Set();\n\n\t/\n\t Callbacks that should run only when a fork is committed.\n\t * @type {Set<(batch: Batch) => void>}\n\t /\n\t#fork_commit_callbacks = new Set();\n\n\t/\n\t The number of async effects that are currently in flight\n\t /\n\t#pending = 0;\n\n\t/\n\t Async effects that are currently in flight, _not_ inside a pending boundary\n\t * @type {Map<Effect, number>}\n\t /\n\t#blocking_pending = new Map();\n\n\t/\n\t A deferred that resolves when the batch is committed, used with `settled()`\n\t * TODO replace with Promise.withResolvers once supported widely enough\n\t * @type {{ promise: Promise<void>, resolve: (value?: any) => void, reject: (reason: unknown) => void } \| null}\n\t /\n\t#deferred = null;\n\n\t/\n\t The root effects that need to be flushed\n\t * @type {Effect[]}\n\t /\n\t#roots = [];\n\n\t/\n\t Effects created while this batch was active.\n\t * @type {Effect[]}\n\t /\n\t#new_effects = [];\n\n\t/\n\t Deferred effects (which run after async work has completed) that are DIRTY\n\t * @type {Set<Effect>}\n\t /\n\t#dirty_effects = new Set();\n\n\t/\n\t Deferred effects that are MAYBE_DIRTY\n\t * @type {Set<Effect>}\n\t /\n\t#maybe_dirty_effects = new Set();\n\n\t/\n\t A map of branches that still exist, but will be destroyed when this batch\n\t * is committed — we skip over these during `process`.\n\t * The value contains child effects that were dirty/maybe_dirty before being reset,\n\t * so they can be rescheduled if the branch survives.\n\t * @type {Map<Effect, { d: Effect[], m: Effect[] }>}\n\t /\n\t#skipped_branches = new Map();\n\n\t/\n\t Inverse of #skipped_branches which we need to tell prior batches to unskip them when committing\n\t * @type {Set<Effect>}\n\t /\n\t#unskipped_branches = new Set();\n\n\tis_fork = false;\n\n\t#decrement_queued = false;\n\n\t#is_deferred() {\n\t\tif (this.is_fork) return true;\n\n\t\tfor (const effect of this.#blocking_pending.keys()) {\n\t\t\tvar e = effect;\n\t\t\tvar skipped = false;\n\n\t\t\twhile (e.parent !== null) {\n\t\t\t\tif (this.#skipped_branches.has(e)) {\n\t\t\t\t\tskipped = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\te = e.parent;\n\t\t\t}\n\n\t\t\tif (!skipped) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/\n\t Add an effect to the #skipped_branches map and reset its children\n\t * @param {Effect} effect\n\t /\n\tskip_effect(effect) {\n\t\tif (!this.#skipped_branches.has(effect)) {\n\t\t\tthis.#skipped_branches.set(effect, { d: [], m: [] });\n\t\t}\n\t\tthis.#unskipped_branches.delete(effect);\n\t}\n\n\t/\n\t Remove an effect from the #skipped_branches map and reschedule\n\t * any tracked dirty/maybe_dirty child effects\n\t * @param {Effect} effect\n\t * @param {(e: Effect) => void} callback\n\t /\n\tunskip_effect(effect, callback = (e) => this.schedule(e)) {\n\t\tvar tracked = this.#skipped_branches.get(effect);\n\t\tif (tracked) {\n\t\t\tthis.#skipped_branches.delete(effect);\n\n\t\t\tfor (var e of tracked.d) {\n\t\t\t\tset_signal_status(e, DIRTY);\n\t\t\t\tcallback(e);\n\t\t\t}\n\n\t\t\tfor (e of tracked.m) {\n\t\t\t\tset_signal_status(e, MAYBE_DIRTY);\n\t\t\t\tcallback(e);\n\t\t\t}\n\t\t}\n\t\tthis.#unskipped_branches.add(effect);\n\t}\n\n\t#process() {\n\t\tthis.#started = true;\n\n\t\tif (flush_count++ > 1000) {\n\t\t\tthis.#unlink();\n\t\t\tinfinite_loop_guard();\n\t\t}\n\n\t\tif (DEV) {\n\t\t\t// track all the values that were updated during this flush,\n\t\t\t// so that they can be reset afterwards\n\t\t\tfor (const value of this.current.keys()) {\n\t\t\t\tsource_stacks.add(value);\n\t\t\t}\n\t\t}\n\n\t\t// we only reschedule previously-deferred effects if we expect\n\t\t// to be able to run them after processing the batch\n\t\tif (!this.#is_deferred()) {\n\t\t\tfor (const e of this.#dirty_effects) {\n\t\t\t\tthis.#maybe_dirty_effects.delete(e);\n\t\t\t\tset_signal_status(e, DIRTY);\n\t\t\t\tthis.schedule(e);\n\t\t\t}\n\n\t\t\tfor (const e of this.#maybe_dirty_effects) {\n\t\t\t\tset_signal_status(e, MAYBE_DIRTY);\n\t\t\t\tthis.schedule(e);\n\t\t\t}\n\t\t}\n\n\t\tconst roots = this.#roots;\n\t\tthis.#roots = [];\n\n\t\tthis.apply();\n\n\t\t/* @type {Effect[]} /\n\t\tvar effects = (collected_effects = []);\n\n\t\t/* @type {Effect[]} /\n\t\tvar render_effects = [];\n\n\t\t/\n\t\t @type {Effect[]}\n\t\t * @deprecated when we get rid of legacy mode and stores, we can get rid of this\n\t\t /\n\t\tvar updates = (legacy_updates = []);\n\n\t\tfor (const root of roots) {\n\t\t\ttry {\n\t\t\t\tthis.#traverse(root, effects, render_effects);\n\t\t\t} catch (e) {\n\t\t\t\treset_all(root);\n\t\t\t\tthrow e;\n\t\t\t}\n\t\t}\n\n\t\t// any writes should take effect in a subsequent batch\n\t\tcurrent_batch = null;\n\n\t\tif (updates.length > 0) {\n\t\t\tvar batch = Batch.ensure();\n\t\t\tfor (const e of updates) {\n\t\t\t\tbatch.schedule(e);\n\t\t\t}\n\t\t}\n\n\t\tcollected_effects = null;\n\t\tlegacy_updates = null;\n\n\t\t// if the batch has outstanding pending work, stash effects and bail\n\t\tif (this.#is_deferred()) {\n\t\t\tthis.#defer_effects(render_effects);\n\t\t\tthis.#defer_effects(effects);\n\n\t\t\tfor (const [e, t] of this.#skipped_branches) {\n\t\t\t\treset_branch(e, t);\n\t\t\t}\n\n\t\t\tif (updates.length > 0) {\n\t\t\t\t/* @type {Batch} / (/* @type {unknown} / (current_batch)).#process();\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\tconst earlier_batch = this.#find_earlier_batch();\n\n\t\tif (earlier_batch) {\n\t\t\tearlier_batch.#merge(this);\n\t\t\treturn;\n\t\t}\n\n\t\t// clear effects. Those that are still needed will be rescheduled through unskipping the skipped branches.\n\t\tthis.#dirty_effects.clear();\n\t\tthis.#maybe_dirty_effects.clear();\n\n\t\t// append/remove branches\n\t\tfor (const fn of this.#commit_callbacks) fn(this);\n\t\tthis.#commit_callbacks.clear();\n\n\t\tprevious_batch = this;\n\t\tflush_queued_effects(render_effects);\n\t\tflush_queued_effects(effects);\n\t\tprevious_batch = null;\n\n\t\tthis.#deferred?.resolve();\n\n\t\tvar next_batch = /* @type {Batch \| null} / (/* @type {unknown} / (current_batch));\n\n\t\tif (this.linked && this.#pending === 0) {\n\t\t\tthis.#unlink();\n\t\t}\n\n\t\t// Order matters here - we need to commit and THEN continue flushing new batches, not the other way around,\n\t\t// else we could start flushing a new batch and then, if it has pending work, rebase it right afterwards, which is wrong.\n\t\t// In sync mode flushSync can cause #commit to wrongfully think that there needs to be a rebase, so we only do it in async mode\n\t\t// TODO fix the underlying cause, otherwise this will likely regress when non-async mode is removed\n\t\tif (async_mode_flag && !this.linked) {\n\t\t\tthis.#commit();\n\t\t\t// Rebases can activate other batches or null it out, therefore restore the new one here\n\t\t\tcurrent_batch = next_batch;\n\t\t}\n\n\t\t// Edge case: During traversal new branches might create effects that run immediately and set state,\n\t\t// causing an effect and therefore a root to be scheduled again. We need to traverse the current batch\n\t\t// once more in that case - most of the time this will just clean up dirty branches.\n\t\tif (this.#roots.length > 0) {\n\t\t\tif (next_batch === null) {\n\t\t\t\tnext_batch = this;\n\t\t\t\tthis.#link();\n\t\t\t}\n\n\t\t\tconst batch = next_batch;\n\t\t\tbatch.#roots.push(...this.#roots.filter((r) => !batch.#roots.includes(r)));\n\t\t}\n\n\t\tif (next_batch !== null) {\n\t\t\tnext_batch.#process();\n\t\t}\n\t}\n\n\t/\n\t Traverse the effect tree, executing effects or stashing\n\t * them for later execution as appropriate\n\t * @param {Effect} root\n\t * @param {Effect[]} effects\n\t * @param {Effect[]} render_effects\n\t /\n\t#traverse(root, effects, render_effects) {\n\t\troot.f ^= CLEAN;\n\n\t\tvar effect = root.first;\n\n\t\twhile (effect !== null) {\n\t\t\tvar flags = effect.f;\n\t\t\tvar is_branch = (flags & (BRANCH_EFFECT \| ROOT_EFFECT)) !== 0;\n\t\t\tvar is_skippable_branch = is_branch && (flags & CLEAN) !== 0;\n\n\t\t\tvar skip = is_skippable_branch \|\| (flags & INERT) !== 0 \|\| this.#skipped_branches.has(effect);\n\n\t\t\tif (!skip && effect.fn !== null) {\n\t\t\t\tif (is_branch) {\n\t\t\t\t\teffect.f ^= CLEAN;\n\t\t\t\t} else if ((flags & EFFECT) !== 0) {\n\t\t\t\t\teffects.push(effect);\n\t\t\t\t} else if (async_mode_flag && (flags & (RENDER_EFFECT \| MANAGED_EFFECT)) !== 0) {\n\t\t\t\t\trender_effects.push(effect);\n\t\t\t\t} else if (is_dirty(effect)) {\n\t\t\t\t\tif ((flags & BLOCK_EFFECT) !== 0) this.#maybe_dirty_effects.add(effect);\n\t\t\t\t\tupdate_effect(effect);\n\t\t\t\t}\n\n\t\t\t\tvar child = effect.first;\n\n\t\t\t\tif (child !== null) {\n\t\t\t\t\teffect = child;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\twhile (effect !== null) {\n\t\t\t\tvar next = effect.next;\n\n\t\t\t\tif (next !== null) {\n\t\t\t\t\teffect = next;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\teffect = effect.parent;\n\t\t\t}\n\t\t}\n\t}\n\n\t#find_earlier_batch() {\n\t\tvar batch = this.#prev;\n\n\t\twhile (batch !== null) {\n\t\t\tif (!batch.is_fork) {\n\t\t\t\t// if the batches are connected, break\n\t\t\t\tfor (const [value, [, is_derived]] of this.current) {\n\t\t\t\t\tif (batch.current.has(value) && !is_derived) {\n\t\t\t\t\t\treturn batch;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbatch = batch.#prev;\n\t\t}\n\n\t\treturn null;\n\t}\n\n\t/\n\t @param {Batch} batch\n\t /\n\t#merge(batch) {\n\t\tfor (const [source, value] of batch.current) {\n\t\t\tif (!this.previous.has(source) && batch.previous.has(source)) {\n\t\t\t\tthis.previous.set(source, batch.previous.get(source));\n\t\t\t}\n\n\t\t\tthis.current.set(source, value);\n\t\t}\n\n\t\tfor (const [effect, deferred] of batch.async_deriveds) {\n\t\t\tconst d = this.async_deriveds.get(effect);\n\t\t\tif (d) deferred.promise.then(d.resolve);\n\t\t}\n\n\t\t/\n\t\t mark all effects that depend on `batch.current`, except the\n\t\t * async effects that we just resolved (TODO unless they depend\n\t\t * on values in this batch that are NOT in the later batch?).\n\t\t * Through this we also will populate the correct #skipped_branches,\n\t\t * oncommit callbacks etc, so we don't need to merge them separately.\n\t\t * @param {Value} value\n\t\t /\n\t\tconst mark = (value) => {\n\t\t\tvar reactions = value.reactions;\n\t\t\tif (reactions === null) return;\n\n\t\t\tfor (const reaction of reactions) {\n\t\t\t\tvar flags = reaction.f;\n\n\t\t\t\tif ((flags & DERIVED) !== 0) {\n\t\t\t\t\tmark(/* @type {Derived} / (reaction));\n\t\t\t\t} else {\n\t\t\t\t\tvar effect = /* @type {Effect} / (reaction);\n\n\t\t\t\t\tif (flags & (ASYNC \| BLOCK_EFFECT) && !this.async_deriveds.has(effect)) {\n\t\t\t\t\t\tthis.#maybe_dirty_effects.delete(effect);\n\t\t\t\t\t\tset_signal_status(effect, DIRTY);\n\t\t\t\t\t\tthis.schedule(effect);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\t\tfor (const source of this.current.keys()) {\n\t\t\tmark(source);\n\t\t}\n\n\t\tthis.oncommit(() => batch.discard());\n\t\tbatch.#unlink();\n\n\t\tcurrent_batch = this;\n\t\tthis.#process();\n\t}\n\n\t/\n\t @param {Effect[]} effects\n\t /\n\t#defer_effects(effects) {\n\t\tfor (var i = 0; i < effects.length; i += 1) {\n\t\t\tdefer_effect(effects[i], this.#dirty_effects, this.#maybe_dirty_effects);\n\t\t}\n\t}\n\n\t/\n\t Associate a change to a given source with the current\n\t * batch, noting its previous and current values\n\t * @param {Value} source\n\t * @param {any} value\n\t * @param {boolean} [is_derived]\n\t /\n\tcapture(source, value, is_derived = false) {\n\t\tif (source.v !== UNINITIALIZED && !this.previous.has(source)) {\n\t\t\tthis.previous.set(source, source.v);\n\t\t}\n\n\t\t// Don't save errors in `batch_values`, or they won't be thrown in `runtime.js#get`\n\t\tif ((source.f & ERROR_VALUE) === 0) {\n\t\t\tthis.current.set(source, [value, is_derived]);\n\t\t\tbatch_values?.set(source, value);\n\t\t}\n\n\t\tif (!this.is_fork) {\n\t\t\tsource.v = value;\n\t\t}\n\t}\n\n\tactivate() {\n\t\tcurrent_batch = this;\n\t}\n\n\tdeactivate() {\n\t\tcurrent_batch = null;\n\t\tbatch_values = null;\n\t}\n\n\tflush() {\n\t\ttry {\n\t\t\tif (DEV) {\n\t\t\t\tsource_stacks.clear();\n\t\t\t}\n\n\t\t\tis_processing = true;\n\t\t\tcurrent_batch = this;\n\n\t\t\tthis.#process();\n\t\t} finally {\n\t\t\tflush_count = 0;\n\t\t\tlast_scheduled_effect = null;\n\t\t\tcollected_effects = null;\n\t\t\tlegacy_updates = null;\n\t\t\tis_processing = false;\n\n\t\t\tcurrent_batch = null;\n\t\t\tbatch_values = null;\n\n\t\t\told_values.clear();\n\n\t\t\tif (DEV) {\n\t\t\t\tfor (const source of source_stacks) {\n\t\t\t\t\tsource.updated = null;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdiscard() {\n\t\tfor (const fn of this.#discard_callbacks) fn(this);\n\t\tthis.#discard_callbacks.clear();\n\t\tthis.#fork_commit_callbacks.clear();\n\n\t\tthis.#unlink();\n\t}\n\n\t/\n\t @param {Effect} effect\n\t /\n\tregister_created_effect(effect) {\n\t\tthis.#new_effects.push(effect);\n\t}\n\n\t#commit() {\n\t\tthis.#unlink();\n\n\t\t// If there are other pending batches, they now need to be 'rebased' —\n\t\t// in other words, we re-run block/async effects with the newly\n\t\t// committed state, unless the batch in question has a more\n\t\t// recent value for a given source\n\t\tfor (let batch = first_batch; batch !== null; batch = batch.#next) {\n\t\t\tvar is_earlier = batch.id < this.id;\n\n\t\t\t/* @type {Source[]} /\n\t\t\tvar sources = [];\n\n\t\t\tfor (const [source, [value, is_derived]] of this.current) {\n\t\t\t\tif (batch.current.has(source)) {\n\t\t\t\t\tvar batch_value = /* @type {[any, boolean]} / (batch.current.get(source))[0]; // faster than destructuring\n\n\t\t\t\t\tif (is_earlier && value !== batch_value) {\n\t\t\t\t\t\t// bring the value up to date\n\t\t\t\t\t\tbatch.current.set(source, [value, is_derived]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// same value or later batch has more recent value,\n\t\t\t\t\t\t// no need to re-run these effects\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tsources.push(source);\n\t\t\t}\n\n\t\t\tif (is_earlier) {\n\t\t\t\t// TODO do we need to restart these in some cases, instead of\n\t\t\t\t// immediately resolving them? Likely not because of how this.apply() works.\n\t\t\t\tfor (const [effect, deferred] of this.async_deriveds) {\n\t\t\t\t\tconst d = batch.async_deriveds.get(effect);\n\t\t\t\t\tif (d) deferred.promise.then(d.resolve);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!batch.#started) continue;\n\n\t\t\t// Re-run async/block effects that depend on distinct values changed in both batches\n\t\t\tvar others = [...batch.current.keys()].filter((s) => !this.current.has(s));\n\n\t\t\tif (others.length === 0) {\n\t\t\t\tif (is_earlier) {\n\t\t\t\t\t// this batch is now obsolete and can be discarded\n\t\t\t\t\tbatch.discard();\n\t\t\t\t}\n\t\t\t} else if (sources.length > 0) {\n\t\t\t\t// The microtask queue can contain the batch already scheduled to run right\n\t\t\t\t// after this one is finished, so throwing the invariant would be wrong here.\n\t\t\t\tif (DEV && !batch.#decrement_queued) {\n\t\t\t\t\tinvariant(batch.#roots.length === 0, 'Batch has scheduled roots');\n\t\t\t\t}\n\n\t\t\t\t// A batch was unskipped in a later batch -> tell prior batches to unskip it, too\n\t\t\t\tif (is_earlier) {\n\t\t\t\t\tfor (const unskipped of this.#unskipped_branches) {\n\t\t\t\t\t\tbatch.unskip_effect(unskipped, (e) => {\n\t\t\t\t\t\t\tif ((e.f & (BLOCK_EFFECT \| ASYNC)) !== 0) {\n\t\t\t\t\t\t\t\tbatch.schedule(e);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbatch.#defer_effects([e]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbatch.activate();\n\n\t\t\t\t/* @type {Set<Value>} /\n\t\t\t\tvar marked = new Set();\n\n\t\t\t\t/* @type {Map<Reaction, boolean>} /\n\t\t\t\tvar checked = new Map();\n\n\t\t\t\tfor (var source of sources) {\n\t\t\t\t\tmark_effects(source, others, marked, checked);\n\t\t\t\t}\n\n\t\t\t\tchecked = new Map();\n\t\t\t\tvar current_unequal = [...batch.current.keys()].filter((c) =>\n\t\t\t\t\tthis.current.has(c)\n\t\t\t\t\t\t? /* @type {[any, boolean]} / (this.current.get(c))[0] !== c.v\n\t\t\t\t\t\t: true\n\t\t\t\t);\n\n\t\t\t\tif (current_unequal.length > 0) {\n\t\t\t\t\tfor (const effect of this.#new_effects) {\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t(effect.f & (DESTROYED \| INERT \| EAGER_EFFECT)) === 0 &&\n\t\t\t\t\t\t\tdepends_on(effect, current_unequal, checked)\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tif ((effect.f & (ASYNC \| BLOCK_EFFECT)) !== 0) {\n\t\t\t\t\t\t\t\tset_signal_status(effect, DIRTY);\n\t\t\t\t\t\t\t\tbatch.schedule(effect);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbatch.#dirty_effects.add(effect);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Only apply and traverse when we know we triggered async work with marking the effects\n\t\t\t\t// and know this won't run anyway right afterwards\n\t\t\t\tif (batch.#roots.length > 0 && !batch.#decrement_queued) {\n\t\t\t\t\tbatch.apply();\n\n\t\t\t\t\tfor (var root of batch.#roots) {\n\t\t\t\t\t\tbatch.#traverse(root, [], []);\n\t\t\t\t\t}\n\n\t\t\t\t\tbatch.#roots = [];\n\t\t\t\t}\n\n\t\t\t\tbatch.deactivate();\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t @param {boolean} blocking\n\t * @param {Effect} effect\n\t /\n\tincrement(blocking, effect) {\n\t\tthis.#pending += 1;\n\n\t\tif (blocking) {\n\t\t\tlet blocking_pending_count = this.#blocking_pending.get(effect) ?? 0;\n\t\t\tthis.#blocking_pending.set(effect, blocking_pending_count + 1);\n\t\t}\n\t}\n\n\t/\n\t @param {boolean} blocking\n\t * @param {Effect} effect\n\t /\n\tdecrement(blocking, effect) {\n\t\tthis.#pending -= 1;\n\n\t\tif (blocking) {\n\t\t\tlet blocking_pending_count = this.#blocking_pending.get(effect) ?? 0;\n\n\t\t\tif (blocking_pending_count === 1) {\n\t\t\t\tthis.#blocking_pending.delete(effect);\n\t\t\t} else {\n\t\t\t\tthis.#blocking_pending.set(effect, blocking_pending_count - 1);\n\t\t\t}\n\t\t}\n\n\t\tif (this.#decrement_queued) return;\n\t\tthis.#decrement_queued = true;\n\n\t\tqueue_micro_task(() => {\n\t\t\tthis.#decrement_queued = false;\n\n\t\t\tif (this.linked) {\n\t\t\t\tthis.flush();\n\t\t\t}\n\t\t});\n\t}\n\n\t/\n\t @param {Set<Effect>} dirty_effects\n\t * @param {Set<Effect>} maybe_dirty_effects\n\t /\n\ttransfer_effects(dirty_effects, maybe_dirty_effects) {\n\t\tfor (const e of dirty_effects) {\n\t\t\tthis.#dirty_effects.add(e);\n\t\t}\n\n\t\tfor (const e of maybe_dirty_effects) {\n\t\t\tthis.#maybe_dirty_effects.add(e);\n\t\t}\n\n\t\tdirty_effects.clear();\n\t\tmaybe_dirty_effects.clear();\n\t}\n\n\t/* @param {(batch: Batch) => void} fn /\n\toncommit(fn) {\n\t\tthis.#commit_callbacks.add(fn);\n\t}\n\n\t/* @param {(batch: Batch) => void} fn /\n\tondiscard(fn) {\n\t\tthis.#discard_callbacks.add(fn);\n\t}\n\n\t/* @param {(batch: Batch) => void} fn /\n\ton_fork_commit(fn) {\n\t\tthis.#fork_commit_callbacks.add(fn);\n\t}\n\n\trun_fork_commit_callbacks() {\n\t\tfor (const fn of this.#fork_commit_callbacks) fn(this);\n\t\tthis.#fork_commit_callbacks.clear();\n\t}\n\n\tsettled() {\n\t\treturn (this.#deferred ??= deferred()).promise;\n\t}\n\n\tstatic ensure() {\n\t\tif (current_batch === null) {\n\t\t\tconst batch = (current_batch = new Batch());\n\t\t\tbatch.#link();\n\n\t\t\tif (!is_processing && !is_flushing_sync) {\n\t\t\t\tqueue_micro_task(() => {\n\t\t\t\t\tif (!batch.#started) {\n\t\t\t\t\t\tbatch.flush();\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\treturn current_batch;\n\t}\n\n\tapply() {\n\t\tif (!async_mode_flag \|\| (!this.is_fork && this.#prev === null && this.#next === null)) {\n\t\t\tbatch_values = null;\n\t\t\treturn;\n\t\t}\n\n\t\t// if there are multiple batches, we are 'time travelling' —\n\t\t// we need to override values with the ones in this batch...\n\t\tbatch_values = new Map();\n\t\tfor (const [source, [value]] of this.current) {\n\t\t\tbatch_values.set(source, value);\n\t\t}\n\n\t\t// ...and undo changes belonging to other batches unless they intersect\n\t\tfor (let batch = first_batch; batch !== null; batch = batch.#next) {\n\t\t\tif (batch === this \|\| batch.is_fork) continue;\n\n\t\t\t// If two batches intersect, the latter batch will be merged into the earlier batch,\n\t\t\t// and we should treat them as a single set of changes\n\t\t\tvar intersects = false;\n\n\t\t\tif (batch.id < this.id) {\n\t\t\t\tfor (const [source, [, is_derived]] of batch.current) {\n\t\t\t\t\t// Derived values don't partake in the intersection mechanism, because a derived could\n\t\t\t\t\t// be triggered in one batch already but not the other one yet, causing a false-positive\n\t\t\t\t\tif (is_derived) continue;\n\n\t\t\t\t\tif (this.current.has(source)) {\n\t\t\t\t\t\tintersects = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Since the latter batch merges into the earlier (if it resolves before the earlier one),\n\t\t\t// we treat the earlier values as \"already applied\". This way we don't need to rerun async\n\t\t\t// effects of the earlier batch in case they are merged.\n\t\t\t// As a result you can think of batch_values as having the latest values of all intersecting\n\t\t\t// batches up until this batch.\n\t\t\tif (!intersects) {\n\t\t\t\tfor (const [source, previous] of batch.previous) {\n\t\t\t\t\tif (!batch_values.has(source)) {\n\t\t\t\t\t\tbatch_values.set(source, previous);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t \n\t * @param {Effect} effect\n\t /\n\tschedule(effect) {\n\t\tlast_scheduled_effect = effect;\n\n\t\t// defer render effects inside a pending boundary\n\t\t// TODO the `REACTION_RAN` check is only necessary because of legacy `$:` effects AFAICT — we can remove later\n\t\tif (\n\t\t\teffect.b?.is_pending &&\n\t\t\t(effect.f & (EFFECT \| RENDER_EFFECT \| MANAGED_EFFECT)) !== 0 &&\n\t\t\t(effect.f & REACTION_RAN) === 0\n\t\t) {\n\t\t\teffect.b.defer_effect(effect);\n\t\t\treturn;\n\t\t}\n\n\t\tvar e = effect;\n\n\t\twhile (e.parent !== null) {\n\t\t\te = e.parent;\n\t\t\tvar flags = e.f;\n\n\t\t\t// if the effect is being scheduled because a parent (each/await/etc) block\n\t\t\t// updated an internal source, or because a branch is being unskipped,\n\t\t\t// bail out or we'll cause a second flush\n\t\t\tif (collected_effects !== null && e === active_effect) {\n\t\t\t\tif (async_mode_flag) return;\n\n\t\t\t\t// in sync mode, render effects run during traversal. in an extreme edge case\n\t\t\t\t// — namely that we're setting a value inside a derived read during traversal —\n\t\t\t\t// they can be made dirty after they have already been visited, in which\n\t\t\t\t// case we shouldn't bail out. we also shouldn't bail out if we're\n\t\t\t\t// updating a store inside a `$:`, since this might invalidate\n\t\t\t\t// effects that were already visited\n\t\t\t\tif (\n\t\t\t\t\t(active_reaction === null \|\| (active_reaction.f & DERIVED) === 0) &&\n\t\t\t\t\t!legacy_is_updating_store\n\t\t\t\t) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ((flags & (ROOT_EFFECT \| BRANCH_EFFECT)) !== 0) {\n\t\t\t\tif ((flags & CLEAN) === 0) {\n\t\t\t\t\t// branch is already dirty, bail\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\te.f ^= CLEAN;\n\t\t\t}\n\t\t}\n\n\t\tthis.#roots.push(e);\n\t}\n\n\t#link() {\n\t\tif (last_batch === null) {\n\t\t\tfirst_batch = last_batch = this;\n\t\t} else {\n\t\t\tlast_batch.#next = this;\n\t\t\tthis.#prev = last_batch;\n\t\t}\n\n\t\tlast_batch = this;\n\t}\n\n\t#unlink() {\n\t\tvar prev = this.#prev;\n\t\tvar next = this.#next;\n\n\t\tif (prev === null) {\n\t\t\tfirst_batch = next;\n\t\t} else {\n\t\t\tprev.#next = next;\n\t\t}\n\n\t\tif (next === null) {\n\t\t\tlast_batch = prev;\n\t\t} else {\n\t\t\tnext.#prev = prev;\n\t\t}\n\n\t\tthis.linked = false;\n\t}\n}\n\n// TODO Svelte@6 think about removing the callback argument.\n/\n Synchronously flush any pending updates.\n * Returns void if no callback is provided, otherwise returns the result of calling the callback.\n * @template [T=void]\n * @param {(() => T) \| undefined} [fn]\n * @returns {T}\n /\nexport function flushSync(fn) {\n\tvar was_flushing_sync = is_flushing_sync;\n\tis_flushing_sync = true;\n\n\ttry {\n\t\tvar result;\n\n\t\tif (fn) {\n\t\t\tif (current_batch !== null && !current_batch.is_fork) {\n\t\t\t\tcurrent_batch.flush();\n\t\t\t}\n\n\t\t\tresult = fn();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tflush_tasks();\n\n\t\t\tif (current_batch === null) {\n\t\t\t\treturn /* @type {T} / (result);\n\t\t\t}\n\n\t\t\tcurrent_batch.flush();\n\t\t}\n\t} finally {\n\t\tis_flushing_sync = was_flushing_sync;\n\t}\n}\n\nfunction infinite_loop_guard() {\n\tif (DEV) {\n\t\tvar updates = new Map();\n\n\t\tfor (const source of /* @type {Batch} / (current_batch).current.keys()) {\n\t\t\tfor (const [stack, update] of source.updated ?? []) {\n\t\t\t\tvar entry = updates.get(stack);\n\n\t\t\t\tif (!entry) {\n\t\t\t\t\tentry = { error: update.error, count: 0 };\n\t\t\t\t\tupdates.set(stack, entry);\n\t\t\t\t}\n\n\t\t\t\tentry.count += update.count;\n\t\t\t}\n\t\t}\n\n\t\tfor (const update of updates.values()) {\n\t\t\tif (update.error) {\n\t\t\t\t// eslint-disable-next-line no-console\n\t\t\t\tconsole.error(update.error);\n\t\t\t}\n\t\t}\n\t}\n\n\ttry {\n\t\te.effect_update_depth_exceeded();\n\t} catch (error) {\n\t\tif (DEV) {\n\t\t\t// stack contains no useful information, replace it\n\t\t\tdefine_property(error, 'stack', { value: '' });\n\t\t}\n\n\t\t// Best effort: invoke the boundary nearest the most recent\n\t\t// effect and hope that it's relevant to the infinite loop\n\t\tinvoke_error_boundary(error, last_scheduled_effect);\n\t}\n}\n\n/* @type {Set<Effect> \| null} /\nexport let eager_block_effects = null;\n\n/\n @param {Array<Effect>} effects\n * @returns {void}\n /\nfunction flush_queued_effects(effects) {\n\tvar length = effects.length;\n\tif (length === 0) return;\n\n\tvar i = 0;\n\n\twhile (i < length) {\n\t\tvar effect = effects[i++];\n\n\t\tif ((effect.f & (DESTROYED \| INERT)) === 0 && is_dirty(effect)) {\n\t\t\teager_block_effects = new Set();\n\n\t\t\tupdate_effect(effect);\n\n\t\t\t// Effects with no dependencies or teardown do not get added to the effect tree.\n\t\t\t// Deferred effects (e.g. `$effect(...)`) _are_ added to the tree because we\n\t\t\t// don't know if we need to keep them until they are executed. Doing the check\n\t\t\t// here (rather than in `update_effect`) allows us to skip the work for\n\t\t\t// immediate effects.\n\t\t\tif (\n\t\t\t\teffect.deps === null &&\n\t\t\t\teffect.first === null &&\n\t\t\t\teffect.nodes === null &&\n\t\t\t\teffect.teardown === null &&\n\t\t\t\teffect.ac === null\n\t\t\t) {\n\t\t\t\t// remove this effect from the graph\n\t\t\t\tunlink_effect(effect);\n\t\t\t}\n\n\t\t\t// If update_effect() has a flushSync() in it, we may have flushed another flush_queued_effects(),\n\t\t\t// which already handled this logic and did set eager_block_effects to null.\n\t\t\tif (eager_block_effects?.size > 0) {\n\t\t\t\told_values.clear();\n\n\t\t\t\tfor (const e of eager_block_effects) {\n\t\t\t\t\t// Skip eager effects that have already been unmounted\n\t\t\t\t\tif ((e.f & (DESTROYED \| INERT)) !== 0) continue;\n\n\t\t\t\t\t// Run effects in order from ancestor to descendant, else we could run into nullpointers\n\t\t\t\t\t/* @type {Effect[]} /\n\t\t\t\t\tconst ordered_effects = [e];\n\t\t\t\t\tlet ancestor = e.parent;\n\t\t\t\t\twhile (ancestor !== null) {\n\t\t\t\t\t\tif (eager_block_effects.has(ancestor)) {\n\t\t\t\t\t\t\teager_block_effects.delete(ancestor);\n\t\t\t\t\t\t\tordered_effects.push(ancestor);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tancestor = ancestor.parent;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor (let j = ordered_effects.length - 1; j >= 0; j--) {\n\t\t\t\t\t\tconst e = ordered_effects[j];\n\t\t\t\t\t\t// Skip eager effects that have already been unmounted\n\t\t\t\t\t\tif ((e.f & (DESTROYED \| INERT)) !== 0) continue;\n\t\t\t\t\t\tupdate_effect(e);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\teager_block_effects.clear();\n\t\t\t}\n\t\t}\n\t}\n\n\teager_block_effects = null;\n}\n\n/\n This is similar to `mark_reactions`, but it only marks async/block effects\n * depending on `value` and at least one of the other `sources`, so that\n * these effects can re-run after another batch has been committed\n * @param {Value} value\n * @param {Source[]} sources\n * @param {Set<Value>} marked\n * @param {Map<Reaction, boolean>} checked\n /\nfunction mark_effects(value, sources, marked, checked) {\n\tif (marked.has(value)) return;\n\tmarked.add(value);\n\n\tif (value.reactions !== null) {\n\t\tfor (const reaction of value.reactions) {\n\t\t\tconst flags = reaction.f;\n\n\t\t\tif ((flags & DERIVED) !== 0) {\n\t\t\t\tmark_effects(/* @type {Derived} / (reaction), sources, marked, checked);\n\t\t\t} else if (\n\t\t\t\t(flags & (ASYNC \| BLOCK_EFFECT)) !== 0 &&\n\t\t\t\t(flags & DIRTY) === 0 &&\n\t\t\t\tdepends_on(reaction, sources, checked)\n\t\t\t) {\n\t\t\t\tset_signal_status(reaction, DIRTY);\n\t\t\t\tschedule_effect(/* @type {Effect} / (reaction));\n\t\t\t}\n\t\t}\n\t}\n}\n\n/\n When committing a fork, we need to trigger eager effects so that\n * any `$state.eager(...)` expressions update immediately. This\n * function allows us to discover them\n * @param {Value} value\n * @param {Set<Effect>} effects\n /\nfunction mark_eager_effects(value, effects) {\n\tif (value.reactions === null) return;\n\n\tfor (const reaction of value.reactions) {\n\t\tconst flags = reaction.f;\n\n\t\tif ((flags & DERIVED) !== 0) {\n\t\t\tmark_eager_effects(/* @type {Derived} / (reaction), effects);\n\t\t} else if ((flags & EAGER_EFFECT) !== 0) {\n\t\t\tset_signal_status(reaction, DIRTY);\n\t\t\teffects.add(/* @type {Effect} / (reaction));\n\t\t}\n\t}\n}\n\n/\n @param {Reaction} reaction\n * @param {Source[]} sources\n * @param {Map<Reaction, boolean>} checked\n /\nfunction depends_on(reaction, sources, checked) {\n\tconst depends = checked.get(reaction);\n\tif (depends !== undefined) return depends;\n\n\tif (reaction.deps !== null) {\n\t\tfor (const dep of reaction.deps) {\n\t\t\tif (includes.call(sources, dep)) {\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tif ((dep.f & DERIVED) !== 0 && depends_on(/* @type {Derived} / (dep), sources, checked)) {\n\t\t\t\tchecked.set(/* @type {Derived} / (dep), true);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\tchecked.set(reaction, false);\n\n\treturn false;\n}\n\n/\n @param {Effect} effect\n * @returns {void}\n /\nexport function schedule_effect(effect) {\n\t/* @type {Batch} / (current_batch).schedule(effect);\n}\n\n/* @type {Source<number>[]} /\nlet eager_versions = [];\n\nfunction eager_flush() {\n\tflushSync(() => {\n\t\tconst eager = eager_versions;\n\t\teager_versions = [];\n\t\tfor (const version of eager) {\n\t\t\tupdate(version);\n\t\t}\n\t});\n}\n\n/* @type {Map<Reaction, Source<number>>} /\nvar version_map = new Map();\n\n/\n Implementation of `$state.eager(fn())`\n * @template T\n * @param {() => T} fn\n * @returns {T}\n /\nexport function eager(fn) {\n\tvar initial = true;\n\tvar value = /* @type {T} / (undefined);\n\n\tif (active_reaction === null) {\n\t\treturn fn();\n\t}\n\n\tlet parent = active_reaction;\n\n\tlet version = version_map.get(parent) ?? source(0);\n\tversion_map.set(parent, version);\n\n\tteardown(() => {\n\t\tif (parent.f & DESTROYING) version_map.delete(parent);\n\t});\n\n\tget(version);\n\n\teager_effect(() => {\n\t\tif (initial) {\n\t\t\t// the first time this runs, we create an eager effect\n\t\t\t// that will run eagerly whenever the expression changes\n\t\t\tvar previous_batch_values = batch_values;\n\n\t\t\ttry {\n\t\t\t\tbatch_values = null;\n\t\t\t\tvalue = fn();\n\t\t\t} finally {\n\t\t\t\tbatch_values = previous_batch_values;\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\t// the second time this effect runs, it's to schedule a\n\t\t// `version` update. since this will recreate the effect,\n\t\t// we don't need to evaluate the expression here\n\t\tif (eager_versions.length === 0) {\n\t\t\tqueue_micro_task(eager_flush);\n\t\t}\n\n\t\teager_versions.push(version);\n\t});\n\n\tinitial = false;\n\n\treturn value;\n}\n\n/\n Mark all the effects inside a skipped branch CLEAN, so that\n * they can be correctly rescheduled later. Tracks dirty and maybe_dirty\n * effects so they can be rescheduled if the branch survives.\n * @param {Effect} effect\n * @param {{ d: Effect[], m: Effect[] }} tracked\n /\nfunction reset_branch(effect, tracked) {\n\t// clean branch = nothing dirty inside, no need to traverse further\n\tif ((effect.f & BRANCH_EFFECT) !== 0 && (effect.f & CLEAN) !== 0) {\n\t\treturn;\n\t}\n\n\tif ((effect.f & DIRTY) !== 0) {\n\t\ttracked.d.push(effect);\n\t} else if ((effect.f & MAYBE_DIRTY) !== 0) {\n\t\ttracked.m.push(effect);\n\t}\n\n\tset_signal_status(effect, CLEAN);\n\n\tvar e = effect.first;\n\twhile (e !== null) {\n\t\treset_branch(e, tracked);\n\t\te = e.next;\n\t}\n}\n\n/\n Mark an entire effect tree clean following an error\n * @param {Effect} effect\n /\nfunction reset_all(effect) {\n\tset_signal_status(effect, CLEAN);\n\n\tvar e = effect.first;\n\twhile (e !== null) {\n\t\treset_all(e);\n\t\te = e.next;\n\t}\n}\n\n/\n Creates a 'fork', in which state changes are evaluated but not applied to the DOM.\n * This is useful for speculatively loading data (for example) when you suspect that\n * the user is about to take some action.\n \n Frameworks like SvelteKit can use this to preload data when the user touches or\n * hovers over a link, making any subsequent navigation feel instantaneous.\n \n The `fn` parameter is a synchronous function that modifies some state. The\n * state changes will be reverted after the fork is initialised, then reapplied\n * if and when the fork is eventually committed.\n \n When it becomes clear that a fork will _not_ be committed (e.g. because the\n * user navigated elsewhere), it must be discarded to avoid leaking memory.\n \n @param {() => void} fn\n * @returns {Fork}\n * @since 5.42\n /\nexport function fork(fn) {\n\tif (!async_mode_flag) {\n\t\te.experimental_async_required('fork');\n\t}\n\n\tif (current_batch !== null) {\n\t\te.fork_timing();\n\t}\n\n\tvar batch = Batch.ensure();\n\tbatch.is_fork = true;\n\tbatch_values = new Map();\n\n\tvar committed = false;\n\tvar settled = batch.settled();\n\n\tflushSync(fn);\n\n\treturn {\n\t\tcommit: async () => {\n\t\t\tif (committed) {\n\t\t\t\tawait settled;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (!batch.linked) {\n\t\t\t\te.fork_discarded();\n\t\t\t}\n\n\t\t\tcommitted = true;\n\n\t\t\tbatch.is_fork = false;\n\n\t\t\t// apply changes and update write versions so deriveds see the change\n\t\t\tfor (var [source, [value]] of batch.current) {\n\t\t\t\tsource.v = value;\n\t\t\t\tsource.wv = increment_write_version();\n\t\t\t}\n\n\t\t\tbatch.activate();\n\t\t\tbatch.run_fork_commit_callbacks();\n\t\t\tbatch.deactivate();\n\n\t\t\t// trigger any `$state.eager(...)` expressions with the new state.\n\t\t\t// eager effects don't get scheduled like other effects, so we\n\t\t\t// can't just encounter them during traversal, we need to\n\t\t\t// proactively flush them\n\t\t\t// TODO maybe there's a better implementation?\n\t\t\tflushSync(() => {\n\t\t\t\t/* @type {Set<Effect>} /\n\t\t\t\tvar eager_effects = new Set();\n\n\t\t\t\tfor (var source of batch.current.keys()) {\n\t\t\t\t\tmark_eager_effects(source, eager_effects);\n\t\t\t\t}\n\n\t\t\t\tset_eager_effects(eager_effects);\n\t\t\t\tflush_eager_effects();\n\t\t\t});\n\n\t\t\tbatch.flush();\n\t\t\tawait settled;\n\t\t},\n\t\tdiscard: () => {\n\t\t\t// cause any MAYBE_DIRTY deriveds to update\n\t\t\t// if they depend on things thath changed\n\t\t\t// inside the discarded fork\n\t\t\tfor (var source of batch.current.keys()) {\n\t\t\t\tsource.wv = increment_write_version();\n\t\t\t}\n\n\t\t\tif (!committed && batch.linked) {\n\t\t\t\tbatch.discard();\n\t\t\t}\n\t\t}\n\t};\n}\n\n/\n Forcibly remove all current batches, to prevent cross-talk between tests\n /\nexport function clear() {\n\tfirst_batch = last_batch = null;\n}\n","/* @import { Blocker, Effect, Value } from '#client' /\nimport { DESTROYED, STALE_REACTION } from '#client/constants';\nimport { DEV } from 'esm-env';\nimport {\n\tcomponent_context,\n\tdev_stack,\n\tis_runes,\n\tset_component_context,\n\tset_dev_stack\n} from '../context.js';\nimport { Boundary } from '../dom/blocks/boundary.js';\nimport { invoke_error_boundary } from '../error-handling.js';\nimport {\n\tactive_effect,\n\tactive_reaction,\n\tset_active_effect,\n\tset_active_reaction\n} from '../runtime.js';\nimport { Batch, current_batch } from './batch.js';\nimport {\n\tasync_derived,\n\treactivity_loss_tracker,\n\tderived,\n\tderived_safe_equal,\n\tset_reactivity_loss_tracker\n} from './deriveds.js';\nimport { aborted } from './effects.js';\n\n/\n @param {Blocker[]} blockers\n * @param {Array<() => any>} sync\n * @param {Array<() => Promise<any>>} async\n * @param {(values: Value[]) => any} fn\n /\nexport function flatten(blockers, sync, async, fn) {\n\tconst d = is_runes() ? derived : derived_safe_equal;\n\n\t// Filter out already-settled blockers - no need to wait for them\n\tvar pending = blockers.filter((b) => !b.settled);\n\n\tif (async.length === 0 && pending.length === 0) {\n\t\tfn(sync.map(d));\n\t\treturn;\n\t}\n\n\tvar parent = /* @type {Effect} / (active_effect);\n\n\tvar restore = capture();\n\tvar blocker_promise =\n\t\tpending.length === 1\n\t\t\t? pending[0].promise\n\t\t\t: pending.length > 1\n\t\t\t\t? Promise.all(pending.map((b) => b.promise))\n\t\t\t\t: null;\n\n\t/* @param {Value[]} values /\n\tfunction finish(values) {\n\t\tif ((parent.f & DESTROYED) !== 0) {\n\t\t\treturn;\n\t\t}\n\n\t\trestore();\n\n\t\ttry {\n\t\t\tfn(values);\n\t\t} catch (error) {\n\t\t\tinvoke_error_boundary(error, parent);\n\t\t}\n\n\t\tunset_context();\n\t}\n\n\tvar decrement_pending = increment_pending();\n\n\t// Fast path: blockers but no async expressions\n\tif (async.length === 0) {\n\t\t/* @type {Promise<any>} / (blocker_promise)\n\t\t\t.then(() => finish(sync.map(d)))\n\t\t\t.finally(decrement_pending);\n\n\t\treturn;\n\t}\n\n\t// Full path: has async expressions\n\tfunction run() {\n\t\tPromise.all(async.map((expression) => async_derived(expression)))\n\t\t\t.then((result) => finish([...sync.map(d), ...result]))\n\t\t\t.catch((error) => invoke_error_boundary(error, parent))\n\t\t\t.finally(decrement_pending);\n\t}\n\n\tif (blocker_promise) {\n\t\tblocker_promise.then(() => {\n\t\t\trestore();\n\t\t\trun();\n\t\t\tunset_context();\n\t\t});\n\t} else {\n\t\trun();\n\t}\n}\n\n/\n @param {Blocker[]} blockers\n * @param {(values: Value[]) => any} fn\n /\nexport function run_after_blockers(blockers, fn) {\n\tflatten(blockers, [], [], fn);\n}\n\n/\n Captures the current effect context so that we can restore it after\n * some asynchronous work has happened (so that e.g. `await a + b`\n * causes `b` to be registered as a dependency).\n /\nexport function capture() {\n\tvar previous_effect = /* @type {Effect} / (active_effect);\n\tvar previous_reaction = active_reaction;\n\tvar previous_component_context = component_context;\n\tvar previous_batch = /* @type {Batch} / (current_batch);\n\n\tif (DEV) {\n\t\tvar previous_dev_stack = dev_stack;\n\t}\n\n\treturn function restore(activate_batch = true) {\n\t\tset_active_effect(previous_effect);\n\t\tset_active_reaction(previous_reaction);\n\t\tset_component_context(previous_component_context);\n\n\t\tif (activate_batch && (previous_effect.f & DESTROYED) === 0) {\n\t\t\t// TODO we only need optional chaining here because `{#await ...}` blocks\n\t\t\t// are anomalous. Once we retire them we can get rid of it\n\t\t\tprevious_batch?.activate();\n\t\t\tprevious_batch?.apply();\n\t\t}\n\n\t\tif (DEV) {\n\t\t\tset_reactivity_loss_tracker(null);\n\t\t\tset_dev_stack(previous_dev_stack);\n\t\t}\n\t};\n}\n\n/\n Wraps an `await` expression in such a way that the effect context that was\n * active before the expression evaluated can be reapplied afterwards —\n * `await a + b` becomes `(await $.save(a))() + b`\n * @template T\n * @param {Promise<T>} promise\n * @returns {Promise<() => T>}\n /\nexport async function save(promise) {\n\tvar restore = capture();\n\tvar value = await promise;\n\n\treturn () => {\n\t\trestore();\n\t\treturn value;\n\t};\n}\n\n/\n Reset `current_async_effect` after the `promise` resolves, so\n * that we can emit `await_reactivity_loss` warnings\n * @template T\n * @param {Promise<T>} promise\n * @returns {Promise<() => T>}\n /\nexport async function track_reactivity_loss(promise) {\n\tvar previous_async_effect = reactivity_loss_tracker;\n\t// Ensure that unrelated reads after an async operation is kicked off don't cause false positives\n\tqueueMicrotask(() => {\n\t\tif (reactivity_loss_tracker === previous_async_effect) {\n\t\t\tset_reactivity_loss_tracker(null);\n\t\t}\n\t});\n\n\tvar value = await promise;\n\n\treturn () => {\n\t\tset_reactivity_loss_tracker(previous_async_effect);\n\t\t// While this can result in false negatives it also guards against the more important\n\t\t// false positives that would occur if this is the last in a chain of async operations,\n\t\t// and the reactivity_loss_tracker would then stay around until the next async operation happens.\n\t\tqueueMicrotask(() => {\n\t\t\tif (reactivity_loss_tracker === previous_async_effect) {\n\t\t\t\tset_reactivity_loss_tracker(null);\n\t\t\t}\n\t\t});\n\n\t\treturn value;\n\t};\n}\n\n/\n Used in `for await` loops in DEV, so\n * that we can emit `await_reactivity_loss` warnings\n * after each `async_iterator` result resolves and\n * after the `async_iterator` return resolves (if it runs)\n * @template T\n * @template TReturn\n * @param {Iterable<T> \| AsyncIterable<T>} iterable\n * @returns {AsyncGenerator<T, TReturn \| undefined>}\n /\nexport async function for_await_track_reactivity_loss(iterable) {\n\t// This is based on the algorithms described in ECMA-262:\n\t// ForIn/OfBodyEvaluation\n\t// https://tc39.es/ecma262/multipage/ecmascript-language-statements-and-declarations.html#sec-runtime-semantics-forin-div-ofbodyevaluation-lhs-stmt-iterator-lhskind-labelset\n\t// AsyncIteratorClose\n\t// https://tc39.es/ecma262/multipage/abstract-operations.html#sec-asynciteratorclose\n\n\t/** @type {AsyncIterator<T, TReturn>} /\n\t// @ts-ignore\n\tconst iterator = iterable[Symbol.asyncIterator]?.() ?? iterable[Symbol.iterator]?.();\n\n\tif (iterator === undefined) {\n\t\tthrow new TypeError('value is not async iterable');\n\t}\n\n\t// eslint-disable-next-line no-useless-assignment\n\tlet invoke_return = true;\n\n\ttry {\n\t\twhile (true) {\n\t\t\tconst { done, value } = (await track_reactivity_loss(iterator.next()))();\n\t\t\tif (done) {\n\t\t\t\tinvoke_return = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tvar prev = reactivity_loss_tracker;\n\t\t\ttry {\n\t\t\t\tyield value;\n\t\t\t} catch (e) {\n\t\t\t\tset_reactivity_loss_tracker(prev);\n\t\t\t\t// If the yield throws, we need to call `return` but not return its value, instead rethrow\n\t\t\t\tif (iterator.return !== undefined) {\n\t\t\t\t\t(await track_reactivity_loss(iterator.return()))();\n\t\t\t\t}\n\t\t\t\tthrow e;\n\t\t\t}\n\t\t\tset_reactivity_loss_tracker(prev);\n\t\t}\n\t} catch (error) {\n\t\tinvoke_return = false;\n\t\tthrow error;\n\t} finally {\n\t\t// If the iterator had an abrupt completion (break) and `return` is defined on the iterator, call it and return the value\n\t\tif (invoke_return && iterator.return !== undefined) {\n\t\t\t// eslint-disable-next-line no-unsafe-finally\n\t\t\treturn /* @type {TReturn} / ((await track_reactivity_loss(iterator.return()))().value);\n\t\t}\n\t}\n}\n\nexport function unset_context(deactivate_batch = true) {\n\tset_active_effect(null);\n\tset_active_reaction(null);\n\tset_component_context(null);\n\tif (deactivate_batch) current_batch?.deactivate();\n\n\tif (DEV) {\n\t\tset_reactivity_loss_tracker(null);\n\t\tset_dev_stack(null);\n\t}\n}\n\n/\n @param {Array<() => void \| Promise<void>>} thunks\n /\nexport function run(thunks) {\n\tconst restore = capture();\n\n\tconst decrement_pending = increment_pending();\n\n\tvar active = /* @type {Effect} / (active_effect);\n\n\t/* @type {null \| { error: any }} /\n\tvar errored = null;\n\n\t/* @param {any} error /\n\tconst handle_error = (error) => {\n\t\terrored = { error }; // wrap in object in case a promise rejects with a falsy value\n\n\t\tif (!aborted(active)) {\n\t\t\tinvoke_error_boundary(error, active);\n\t\t}\n\t};\n\n\tvar promise = Promise.resolve(thunks[0]()).catch(handle_error);\n\n\t/* @type {Blocker} /\n\tvar blocker = { promise, settled: false };\n\tvar blockers = [blocker];\n\n\tpromise.finally(() => {\n\t\tblocker.settled = true;\n\t\tunset_context();\n\t});\n\n\tfor (const fn of thunks.slice(1)) {\n\t\tpromise = promise\n\t\t\t.then(() => {\n\t\t\t\trestore();\n\n\t\t\t\ttry {\n\t\t\t\t\tif (errored) {\n\t\t\t\t\t\tthrow errored.error;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (aborted(active)) {\n\t\t\t\t\t\tthrow STALE_REACTION;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn fn();\n\t\t\t\t} finally {\n\t\t\t\t\t// We gotta unset context directly in case the function returns a promise, in which case\n\t\t\t\t\t// unset_context in .finally() would be too late ...\n\t\t\t\t\tunset_context();\n\t\t\t\t}\n\t\t\t})\n\t\t\t.catch(handle_error);\n\n\t\tconst blocker = { promise, settled: false };\n\t\tblockers.push(blocker);\n\n\t\tpromise.finally(() => {\n\t\t\tblocker.settled = true;\n\t\t\t// ... but we also need it after such a promise has resolved in case it restores our context\n\t\t\tunset_context();\n\t\t});\n\t}\n\n\tpromise\n\t\t// wait one more tick, so that template effects are\n\t\t// guaranteed to run before `$effect(...)`\n\t\t.then(() => Promise.resolve())\n\t\t.finally(decrement_pending);\n\n\treturn blockers;\n}\n\n/\n @param {Blocker[]} blockers\n /\nexport function wait(blockers) {\n\treturn Promise.all(blockers.map((b) => b.promise));\n}\n\n/\n @returns {(skip?: boolean) => void}\n /\nexport function increment_pending() {\n\tvar effect = /* @type {Effect} / (active_effect);\n\tvar boundary = /* @type {Boundary} / (effect.b);\n\tvar batch = /* @type {Batch} / (current_batch);\n\tvar blocking = boundary.is_rendered();\n\n\tboundary.update_pending_count(1, batch);\n\tbatch.increment(blocking, effect);\n\n\treturn () => {\n\t\tboundary.update_pending_count(-1, batch);\n\t\tbatch.decrement(blocking, effect);\n\t};\n}\n","/* @import { Derived, Effect, Reaction, Source, Value } from '#client' /\n/* @import { Batch } from './batch.js'; /\n/* @import { Boundary } from '../dom/blocks/boundary.js'; /\nimport { DEV } from 'esm-env';\nimport {\n\tERROR_VALUE,\n\tDERIVED,\n\tDIRTY,\n\tEFFECT_PRESERVED,\n\tSTALE_REACTION,\n\tASYNC,\n\tWAS_MARKED,\n\tDESTROYED,\n\tCLEAN,\n\tREACTION_RAN,\n\tINERT\n} from '#client/constants';\nimport {\n\tactive_reaction,\n\tactive_effect,\n\tupdate_reaction,\n\tincrement_write_version,\n\tset_active_effect,\n\tpush_reaction_value,\n\tis_destroying_effect,\n\tupdate_effect,\n\tremove_reactions,\n\tskipped_deps,\n\tnew_deps\n} from '../runtime.js';\nimport { equals, safe_equals } from './equality.js';\nimport as e from '../errors.js';\nimport * as w from '../warnings.js';\nimport {\n\tasync_effect,\n\tdestroy_effect,\n\tdestroy_effect_children,\n\teffect_tracking,\n\tteardown\n} from './effects.js';\nimport { eager_effects, internal_set, set_eager_effects, source } from './sources.js';\nimport { get_error } from '../../shared/dev.js';\nimport { async_mode_flag, tracing_mode_flag } from '../../flags/index.js';\nimport { component_context } from '../context.js';\nimport { UNINITIALIZED } from '../../../constants.js';\nimport { batch_values, current_batch, previous_batch } from './batch.js';\nimport { increment_pending, unset_context } from './async.js';\nimport { deferred, includes, noop } from '../../shared/utils.js';\nimport { set_signal_status, update_derived_status } from './status.js';\n\n/*\n This allows us to track 'reactivity loss' that occurs when signals\n * are read after a non-context-restoring `await`. Dev-only\n * @type {{ effect: Effect, effect_deps: Set<Value>, warned: boolean } \| null}\n /\nexport let reactivity_loss_tracker = null;\n\n/* @param {{ effect: Effect, effect_deps: Set<Value>, warned: boolean } \| null} v /\nexport function set_reactivity_loss_tracker(v) {\n\treactivity_loss_tracker = v;\n}\n\nexport const recent_async_deriveds = new Set();\n\n/\n @template V\n * @param {() => V} fn\n * @returns {Derived<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function derived(fn) {\n\tvar flags = DERIVED \| DIRTY;\n\n\tif (active_effect !== null) {\n\t\t// Since deriveds are evaluated lazily, any effects created inside them are\n\t\t// created too late to ensure that the parent effect is added to the tree\n\t\tactive_effect.f \|= EFFECT_PRESERVED;\n\t}\n\n\t/* @type {Derived<V>} /\n\tconst signal = {\n\t\tctx: component_context,\n\t\tdeps: null,\n\t\teffects: null,\n\t\tequals,\n\t\tf: flags,\n\t\tfn,\n\t\treactions: null,\n\t\trv: 0,\n\t\tv: /* @type {V} / (UNINITIALIZED),\n\t\twv: 0,\n\t\tparent: active_effect,\n\t\tac: null\n\t};\n\n\tif (DEV && tracing_mode_flag) {\n\t\tsignal.created = get_error('created at');\n\t}\n\n\treturn signal;\n}\n\nexport const OBSOLETE = Symbol('obsolete');\n\n/\n @template V\n * @param {() => V \| Promise<V>} fn\n * @param {string} [label]\n * @param {string} [location] If provided, print a warning if the value is not read immediately after update\n * @returns {Promise<Source<V>>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function async_derived(fn, label, location) {\n\tlet parent = /* @type {Effect \| null} / (active_effect);\n\n\tif (parent === null) {\n\t\te.async_derived_orphan();\n\t}\n\n\tvar promise = /* @type {Promise<V>} / (/* @type {unknown} / (undefined));\n\tvar signal = source(/* @type {V} / (UNINITIALIZED));\n\n\tif (DEV) signal.label = label ?? fn.toString();\n\n\t// only suspend in async deriveds created on initialisation\n\tvar should_suspend = !active_reaction;\n\n\t/* @type {Set<ReturnType<typeof deferred<V>>>} /\n\tvar deferreds = new Set();\n\n\tasync_effect(() => {\n\t\tvar effect = /* @type {Effect} / (active_effect);\n\n\t\tif (DEV) {\n\t\t\treactivity_loss_tracker = { effect, effect_deps: new Set(), warned: false };\n\t\t}\n\n\t\t/* @type {ReturnType<typeof deferred<V>>} /\n\t\tvar d = deferred();\n\t\tpromise = d.promise;\n\n\t\ttry {\n\t\t\t// If this code is changed at some point, make sure to still access the then property\n\t\t\t// of fn() to read any signals it might access, so that we track them as dependencies.\n\t\t\t// We call `unset_context` to undo any `save` calls that happen inside `fn()`\n\t\t\tPromise.resolve(fn())\n\t\t\t\t.then(d.resolve, (e) => {\n\t\t\t\t\t// if the promise was rejected by the user, via `getAbortSignal`, then\n\t\t\t\t\t// wait for a subsequent resolution instead of flushing the batch\n\t\t\t\t\tif (e !== STALE_REACTION) d.reject(e);\n\t\t\t\t})\n\t\t\t\t.finally(unset_context);\n\t\t} catch (error) {\n\t\t\td.reject(error);\n\t\t\tunset_context();\n\t\t}\n\n\t\tif (DEV) {\n\t\t\tif (reactivity_loss_tracker) {\n\t\t\t\t// Reused deps from previous run (indices 0 to skipped_deps-1)\n\t\t\t\t// We deliberately only track direct dependencies of the async expression to encourage\n\t\t\t\t// dependencies being directly visible at the point of the expression\n\t\t\t\tif (effect.deps !== null) {\n\t\t\t\t\tfor (let i = 0; i < skipped_deps; i += 1) {\n\t\t\t\t\t\treactivity_loss_tracker.effect_deps.add(effect.deps[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// New deps discovered this run\n\t\t\t\tif (new_deps !== null) {\n\t\t\t\t\tfor (let i = 0; i < new_deps.length; i += 1) {\n\t\t\t\t\t\treactivity_loss_tracker.effect_deps.add(new_deps[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treactivity_loss_tracker = null;\n\t\t}\n\n\t\tvar batch = /* @type {Batch} / (current_batch);\n\n\t\tif (should_suspend) {\n\t\t\t// we only increment the batch's pending state for updates, not creation, otherwise\n\t\t\t// we will decrement to zero before the work that depends on this promise (e.g. a\n\t\t\t// template effect) has initialized, causing the batch to resolve prematurely\n\t\t\tif ((effect.f & REACTION_RAN) !== 0) {\n\t\t\t\tvar decrement_pending = increment_pending();\n\t\t\t}\n\n\t\t\tif (/* @type {Boundary} / (parent.b).is_rendered()) {\n\t\t\t\tbatch.async_deriveds.get(effect)?.reject(OBSOLETE);\n\t\t\t} else {\n\t\t\t\t// While the boundary is still showing pending, a new run supersedes all older in-flight runs\n\t\t\t\t// for this async expression. Cancel eagerly so resolution cannot commit stale values.\n\t\t\t\tfor (const d of deferreds.values()) {\n\t\t\t\t\td.reject(OBSOLETE);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdeferreds.add(d);\n\t\t\tbatch.async_deriveds.set(effect, d);\n\t\t}\n\n\t\t/\n\t\t @param {any} value\n\t\t * @param {unknown} error\n\t\t /\n\t\tconst handler = (value, error = undefined) => {\n\t\t\tif (DEV) {\n\t\t\t\treactivity_loss_tracker = null;\n\t\t\t}\n\n\t\t\tdecrement_pending?.();\n\t\t\tdeferreds.delete(d);\n\n\t\t\tif (error === OBSOLETE) return;\n\n\t\t\tbatch.activate();\n\n\t\t\tif (error) {\n\t\t\t\tsignal.f \|= ERROR_VALUE;\n\n\t\t\t\t// @ts-expect-error the error is the wrong type, but we don't care\n\t\t\t\tinternal_set(signal, error);\n\t\t\t} else {\n\t\t\t\tif ((signal.f & ERROR_VALUE) !== 0) {\n\t\t\t\t\tsignal.f ^= ERROR_VALUE;\n\t\t\t\t}\n\n\t\t\t\tinternal_set(signal, value);\n\n\t\t\t\tif (DEV && location !== undefined) {\n\t\t\t\t\trecent_async_deriveds.add(signal);\n\n\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\tif (recent_async_deriveds.has(signal) && (effect.f & DESTROYED) === 0) {\n\t\t\t\t\t\t\tw.await_waterfall(/* @type {string} / (signal.label), location);\n\t\t\t\t\t\t\trecent_async_deriveds.delete(signal);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbatch.deactivate();\n\t\t};\n\n\t\td.promise.then(handler, (e) => handler(null, e \|\| 'unknown'));\n\t});\n\n\tteardown(() => {\n\t\tfor (const d of deferreds) {\n\t\t\td.reject(OBSOLETE);\n\t\t}\n\t});\n\n\tif (DEV) {\n\t\t// add a flag that lets this be printed as a derived\n\t\t// when using `$inspect.trace()`\n\t\tsignal.f \|= ASYNC;\n\t}\n\n\treturn new Promise((fulfil) => {\n\t\t/* @param {Promise<V>} p /\n\t\tfunction next(p) {\n\t\t\tfunction go() {\n\t\t\t\tif (p === promise) {\n\t\t\t\t\tfulfil(signal);\n\t\t\t\t} else {\n\t\t\t\t\t// if the effect re-runs before the initial promise\n\t\t\t\t\t// resolves, delay resolution until we have a value\n\t\t\t\t\tnext(promise);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tp.then(go, go);\n\t\t}\n\n\t\tnext(promise);\n\t});\n}\n\n/\n @template V\n * @param {() => V} fn\n * @returns {Derived<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function user_derived(fn) {\n\tconst d = derived(fn);\n\n\tif (!async_mode_flag) push_reaction_value(d);\n\n\treturn d;\n}\n\n/\n @template V\n * @param {() => V} fn\n * @returns {Derived<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function derived_safe_equal(fn) {\n\tconst signal = derived(fn);\n\tsignal.equals = safe_equals;\n\treturn signal;\n}\n\n/\n @param {Derived} derived\n * @returns {void}\n /\nexport function destroy_derived_effects(derived) {\n\tvar effects = derived.effects;\n\n\tif (effects !== null) {\n\t\tderived.effects = null;\n\n\t\tfor (var i = 0; i < effects.length; i += 1) {\n\t\t\tdestroy_effect(/* @type {Effect} / (effects[i]));\n\t\t}\n\t}\n}\n\n/\n The currently updating deriveds, used to detect infinite recursion\n * in dev mode and provide a nicer error than 'too much recursion'\n * @type {Derived[]}\n /\nlet stack = [];\n\n/\n @template T\n * @param {Derived} derived\n * @returns {T}\n /\nexport function execute_derived(derived) {\n\tvar value;\n\tvar prev_active_effect = active_effect;\n\tvar parent = derived.parent;\n\n\tif (\n\t\t!is_destroying_effect &&\n\t\tparent !== null &&\n\t\tderived.v !== UNINITIALIZED && // if it was never evaluated before, it's guaranteed to fail downstream, so we try to execute instead\n\t\t(parent.f & (DESTROYED \| INERT)) !== 0\n\t) {\n\t\tw.derived_inert();\n\n\t\treturn derived.v;\n\t}\n\n\tset_active_effect(parent);\n\n\tif (DEV) {\n\t\tlet prev_eager_effects = eager_effects;\n\t\tset_eager_effects(new Set());\n\t\ttry {\n\t\t\tif (includes.call(stack, derived)) {\n\t\t\t\te.derived_references_self();\n\t\t\t}\n\n\t\t\tstack.push(derived);\n\n\t\t\tderived.f &= ~WAS_MARKED;\n\t\t\tdestroy_derived_effects(derived);\n\t\t\tvalue = update_reaction(derived);\n\t\t} finally {\n\t\t\tset_active_effect(prev_active_effect);\n\t\t\tset_eager_effects(prev_eager_effects);\n\t\t\tstack.pop();\n\t\t}\n\t} else {\n\t\ttry {\n\t\t\tderived.f &= ~WAS_MARKED;\n\t\t\tdestroy_derived_effects(derived);\n\t\t\tvalue = update_reaction(derived);\n\t\t} finally {\n\t\t\tset_active_effect(prev_active_effect);\n\t\t}\n\t}\n\n\treturn value;\n}\n\n/\n @param {Derived} derived\n * @returns {void}\n /\nexport function update_derived(derived) {\n\tvar value = execute_derived(derived);\n\n\tif (!derived.equals(value)) {\n\t\tderived.wv = increment_write_version();\n\n\t\t// in a fork, we don't update the underlying value, just `batch_values`.\n\t\t// the underlying value will be updated when the fork is committed.\n\t\t// otherwise, the next time we get here after a 'real world' state\n\t\t// change, `derived.equals` may incorrectly return `true`\n\t\tif (!current_batch?.is_fork \|\| derived.deps === null) {\n\t\t\tif (current_batch !== null) {\n\t\t\t\t// We also write to previous_batch because if it exists, it is a sign that we're\n\t\t\t\t// currently in the process of flushing effects. These updates to deriveds may belong\n\t\t\t\t// to the previous batch, not the new one (which can already exist if an earlier\n\t\t\t\t// effect wrote to a source). This can cause bugs when running batch.#commit() later,\n\t\t\t\t// but not adding it to current_batch can, too, so we add it to both.\n\t\t\t\t// See https://github.com/sveltejs/svelte/pull/18117 for more details.\n\t\t\t\tcurrent_batch.capture(derived, value, true);\n\t\t\t\tprevious_batch?.capture(derived, value, true);\n\t\t\t} else {\n\t\t\t\tderived.v = value;\n\t\t\t}\n\n\t\t\t// deriveds without dependencies should never be recomputed\n\t\t\tif (derived.deps === null) {\n\t\t\t\tset_signal_status(derived, CLEAN);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\t// don't mark derived clean if we're reading it inside a\n\t// cleanup function, or it will cache a stale value\n\tif (is_destroying_effect) {\n\t\treturn;\n\t}\n\n\t// During time traveling we don't want to reset the status so that\n\t// traversal of the graph in the other batches still happens\n\tif (batch_values !== null) {\n\t\t// only cache the value if we're in a tracking context, otherwise we won't\n\t\t// clear the cache in `mark_reactions` when dependencies are updated\n\t\tif (effect_tracking() \|\| current_batch?.is_fork) {\n\t\t\tbatch_values.set(derived, value);\n\t\t}\n\t} else {\n\t\tupdate_derived_status(derived);\n\t}\n}\n\n/\n @param {Derived} derived\n /\nexport function freeze_derived_effects(derived) {\n\tif (derived.effects === null) return;\n\n\tfor (const e of derived.effects) {\n\t\t// if the effect has a teardown function or abort signal, call it\n\t\tif (e.teardown \|\| e.ac) {\n\t\t\te.teardown?.();\n\t\t\te.ac?.abort(STALE_REACTION);\n\n\t\t\t// make it a noop so it doesn't get called again if the derived\n\t\t\t// is unfrozen. we don't set it to `null`, because the existence\n\t\t\t// of a teardown function is what determines whether the\n\t\t\t// effect runs again during unfreezing (but not for teardown-only effects)\n\t\t\tif (e.fn !== null) e.teardown = noop;\n\t\t\te.ac = null;\n\n\t\t\tremove_reactions(e, 0);\n\t\t\tdestroy_effect_children(e);\n\t\t}\n\t}\n}\n\n/\n @param {Derived} derived\n /\nexport function unfreeze_derived_effects(derived) {\n\tif (derived.effects === null) return;\n\n\tfor (const e of derived.effects) {\n\t\t// if the effect was previously frozen — indicated by the presence\n\t\t// of a teardown function — unfreeze it\n\t\tif (e.teardown && e.fn !== null) {\n\t\t\tupdate_effect(e);\n\t\t}\n\t}\n}\n","/* @import { Derived, Effect, Source, Value } from '#client' /\nimport { DEV } from 'esm-env';\nimport {\n\tactive_reaction,\n\tactive_effect,\n\tuntracked_writes,\n\tget,\n\tset_untracked_writes,\n\tuntrack,\n\tincrement_write_version,\n\tupdate_effect,\n\tcurrent_sources,\n\tis_dirty,\n\tuntracking,\n\tis_destroying_effect,\n\tpush_reaction_value\n} from '../runtime.js';\nimport { equals, safe_equals } from './equality.js';\nimport {\n\tCLEAN,\n\tDERIVED,\n\tDIRTY,\n\tBRANCH_EFFECT,\n\tEAGER_EFFECT,\n\tMAYBE_DIRTY,\n\tBLOCK_EFFECT,\n\tROOT_EFFECT,\n\tASYNC,\n\tWAS_MARKED,\n\tCONNECTED,\n\tREACTION_IS_UPDATING\n} from '#client/constants';\nimport as e from '../errors.js';\nimport { legacy_mode_flag, tracing_mode_flag } from '../../flags/index.js';\nimport { includes } from '../../shared/utils.js';\nimport { tag_proxy } from '../dev/tracing.js';\nimport { get_error } from '../../shared/dev.js';\nimport { component_context, is_runes } from '../context.js';\nimport {\n\tBatch,\n\tbatch_values,\n\teager_block_effects,\n\tschedule_effect,\n\tlegacy_updates\n} from './batch.js';\nimport { proxy } from '../proxy.js';\nimport { execute_derived } from './deriveds.js';\nimport { set_signal_status, update_derived_status } from './status.js';\n\n/** @type {Set<Effect>} /\nexport let eager_effects = new Set();\n\n/* @type {Map<Source, any>} /\nexport const old_values = new Map();\n\n/\n @param {Set<any>} v\n /\nexport function set_eager_effects(v) {\n\teager_effects = v;\n}\n\nlet eager_effects_deferred = false;\n\nexport function set_eager_effects_deferred() {\n\teager_effects_deferred = true;\n}\n\n/\n @template V\n * @param {V} v\n * @param {Error \| null} [stack]\n * @returns {Source<V>}\n /\n// TODO rename this to `state` throughout the codebase\nexport function source(v, stack) {\n\t/* @type {Value} /\n\tvar signal = {\n\t\tf: 0, // TODO ideally we could skip this altogether, but it causes type errors\n\t\tv,\n\t\treactions: null,\n\t\tequals,\n\t\trv: 0,\n\t\twv: 0\n\t};\n\n\tif (DEV && tracing_mode_flag) {\n\t\tsignal.created = stack ?? get_error('created at');\n\t\tsignal.updated = null;\n\t\tsignal.set_during_effect = false;\n\t\tsignal.trace = null;\n\t}\n\n\treturn signal;\n}\n\n/\n @template V\n * @param {V} v\n * @param {Error \| null} [stack]\n /\n/#__NO_SIDE_EFFECTS__/\nexport function state(v, stack) {\n\tconst s = source(v, stack);\n\n\tpush_reaction_value(s);\n\n\treturn s;\n}\n\n/\n @template V\n * @param {V} initial_value\n * @param {boolean} [immutable]\n * @returns {Source<V>}\n /\n/#__NO_SIDE_EFFECTS__/\nexport function mutable_source(initial_value, immutable = false, trackable = true) {\n\tconst s = source(initial_value);\n\tif (!immutable) {\n\t\ts.equals = safe_equals;\n\t}\n\n\t// bind the signal to the component context, in case we need to\n\t// track updates to trigger beforeUpdate/afterUpdate callbacks\n\tif (legacy_mode_flag && trackable && component_context !== null && component_context.l !== null) {\n\t\t(component_context.l.s ??= []).push(s);\n\t}\n\n\treturn s;\n}\n\n/\n @template V\n * @param {Value<V>} source\n * @param {V} value\n /\nexport function mutate(source, value) {\n\tset(\n\t\tsource,\n\t\tuntrack(() => get(source))\n\t);\n\treturn value;\n}\n\n/\n @template V\n * @param {Source<V>} source\n * @param {V} value\n * @param {boolean} [should_proxy]\n * @returns {V}\n /\nexport function set(source, value, should_proxy = false) {\n\tif (\n\t\tactive_reaction !== null &&\n\t\t// since we are untracking the function inside `$inspect.with` we need to add this check\n\t\t// to ensure we error if state is set inside an inspect effect\n\t\t(!untracking \|\| (active_reaction.f & EAGER_EFFECT) !== 0) &&\n\t\tis_runes() &&\n\t\t(active_reaction.f & (DERIVED \| BLOCK_EFFECT \| ASYNC \| EAGER_EFFECT)) !== 0 &&\n\t\t(current_sources === null \|\| !includes.call(current_sources, source))\n\t) {\n\t\te.state_unsafe_mutation();\n\t}\n\n\tlet new_value = should_proxy ? proxy(value) : value;\n\n\tif (DEV) {\n\t\ttag_proxy(new_value, /* @type {string} / (source.label));\n\t}\n\n\treturn internal_set(source, new_value, legacy_updates);\n}\n\n/\n @template V\n * @param {Source<V>} source\n * @param {V} value\n * @param {Effect[] \| null} [updated_during_traversal]\n * @returns {V}\n /\nexport function internal_set(source, value, updated_during_traversal = null) {\n\tif (!source.equals(value)) {\n\t\told_values.set(source, is_destroying_effect ? value : source.v);\n\n\t\tvar batch = Batch.ensure();\n\t\tbatch.capture(source, value);\n\n\t\tif (DEV) {\n\t\t\tif (tracing_mode_flag \|\| active_effect !== null) {\n\t\t\t\tsource.updated ??= new Map();\n\n\t\t\t\t// For performance reasons, when not using $inspect.trace, we only start collecting stack traces\n\t\t\t\t// after the same source has been updated more than 5 times in the same flush cycle.\n\t\t\t\tconst count = (source.updated.get('')?.count ?? 0) + 1;\n\t\t\t\tsource.updated.set('', { error: /* @type {any} / (null), count });\n\n\t\t\t\tif (tracing_mode_flag \|\| count > 5) {\n\t\t\t\t\tconst error = get_error('updated at');\n\n\t\t\t\t\tif (error !== null) {\n\t\t\t\t\t\tlet entry = source.updated.get(error.stack);\n\n\t\t\t\t\t\tif (!entry) {\n\t\t\t\t\t\t\tentry = { error, count: 0 };\n\t\t\t\t\t\t\tsource.updated.set(error.stack, entry);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tentry.count++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (active_effect !== null) {\n\t\t\t\tsource.set_during_effect = true;\n\t\t\t}\n\t\t}\n\n\t\tif ((source.f & DERIVED) !== 0) {\n\t\t\tconst derived = /* @type {Derived} / (source);\n\n\t\t\t// if we are assigning to a dirty derived we set it to clean/maybe dirty but we also eagerly execute it to track the dependencies\n\t\t\tif ((source.f & DIRTY) !== 0) {\n\t\t\t\texecute_derived(derived);\n\t\t\t}\n\n\t\t\t// During time traveling we don't want to reset the status so that\n\t\t\t// traversal of the graph in the other batches still happens\n\t\t\tif (batch_values === null) {\n\t\t\t\tupdate_derived_status(derived);\n\t\t\t}\n\t\t}\n\n\t\tsource.wv = increment_write_version();\n\n\t\t// For debugging, in case you want to know which reactions are being scheduled:\n\t\t// log_reactions(source);\n\t\tmark_reactions(source, DIRTY, updated_during_traversal);\n\n\t\t// It's possible that the current reaction might not have up-to-date dependencies\n\t\t// whilst it's actively running. So in the case of ensuring it registers the reaction\n\t\t// properly for itself, we need to ensure the current effect actually gets\n\t\t// scheduled. i.e: `$effect(() => x++)`\n\t\tif (\n\t\t\tis_runes() &&\n\t\t\tactive_effect !== null &&\n\t\t\t(active_effect.f & CLEAN) !== 0 &&\n\t\t\t(active_effect.f & (BRANCH_EFFECT \| ROOT_EFFECT)) === 0\n\t\t) {\n\t\t\tif (untracked_writes === null) {\n\t\t\t\tset_untracked_writes([source]);\n\t\t\t} else {\n\t\t\t\tuntracked_writes.push(source);\n\t\t\t}\n\t\t}\n\n\t\tif (!batch.is_fork && eager_effects.size > 0 && !eager_effects_deferred) {\n\t\t\tflush_eager_effects();\n\t\t}\n\t}\n\n\treturn value;\n}\n\nexport function flush_eager_effects() {\n\teager_effects_deferred = false;\n\n\tfor (const effect of eager_effects) {\n\t\t// Mark clean inspect-effects as maybe dirty and then check their dirtiness\n\t\t// instead of just updating the effects - this way we avoid overfiring.\n\t\tif ((effect.f & CLEAN) !== 0) {\n\t\t\tset_signal_status(effect, MAYBE_DIRTY);\n\t\t}\n\n\t\tlet dirty;\n\n\t\ttry {\n\t\t\tdirty = is_dirty(effect);\n\t\t} catch {\n\t\t\t// Dirty-checking can evaluate derived dependencies and throw in cases where\n\t\t\t// parent effects are about to destroy this eager effect. Run the effect so\n\t\t\t// its own error handling can deal with transient failures.\n\t\t\tdirty = true;\n\t\t}\n\n\t\tif (dirty) {\n\t\t\tupdate_effect(effect);\n\t\t}\n\t}\n\n\teager_effects.clear();\n}\n\n/\n @template {number \| bigint} T\n * @param {Source<T>} source\n * @param {1 \| -1} [d]\n * @returns {T}\n /\nexport function update(source, d = 1) {\n\tvar value = get(source);\n\tvar result = d === 1 ? value++ : value--;\n\n\tset(source, value);\n\n\t// @ts-expect-error\n\treturn result;\n}\n\n/\n @template {number \| bigint} T\n * @param {Source<T>} source\n * @param {1 \| -1} [d]\n * @returns {T}\n /\nexport function update_pre(source, d = 1) {\n\tvar value = get(source);\n\n\t// @ts-expect-error\n\t// eslint-disable-next-line no-useless-assignment -- `++`/`--` used for return value, not side effect on `value`\n\treturn set(source, d === 1 ? ++value : --value);\n}\n\n/\n Silently (without using `get`) increment a source\n * @param {Source<number>} source\n /\nexport function increment(source) {\n\tset(source, source.v + 1);\n}\n\n/\n @param {Value} signal\n * @param {number} status should be DIRTY or MAYBE_DIRTY\n * @param {Effect[] \| null} updated_during_traversal\n * @returns {void}\n /\nfunction mark_reactions(signal, status, updated_during_traversal) {\n\tvar reactions = signal.reactions;\n\tif (reactions === null) return;\n\n\tvar runes = is_runes();\n\tvar length = reactions.length;\n\n\tfor (var i = 0; i < length; i++) {\n\t\tvar reaction = reactions[i];\n\t\tvar flags = reaction.f;\n\n\t\t// In legacy mode, skip the current effect to prevent infinite loops\n\t\tif (!runes && reaction === active_effect) continue;\n\n\t\tvar not_dirty = (flags & DIRTY) === 0;\n\n\t\t// don't set a DIRTY reaction to MAYBE_DIRTY\n\t\tif (not_dirty) {\n\t\t\tset_signal_status(reaction, status);\n\t\t}\n\n\t\tif ((flags & EAGER_EFFECT) !== 0) {\n\t\t\t// Eager effects need to run immediately:\n\t\t\t// - for $inspect so that the stack trace makes sense\n\t\t\t// - for $state.eager because they might be without an effect parent\n\t\t\teager_effects.add(/* @type {Effect} / (reaction));\n\t\t} else if ((flags & DERIVED) !== 0) {\n\t\t\tvar derived = /* @type {Derived} / (reaction);\n\n\t\t\tbatch_values?.delete(derived);\n\n\t\t\tif ((flags & WAS_MARKED) === 0) {\n\t\t\t\t// Only connected deriveds being executed outside the update cycle can be reliably unmarked right away\n\t\t\t\tif (\n\t\t\t\t\tflags & CONNECTED &&\n\t\t\t\t\t(active_effect === null \|\| (active_effect.f & REACTION_IS_UPDATING) === 0)\n\t\t\t\t) {\n\t\t\t\t\treaction.f \|= WAS_MARKED;\n\t\t\t\t}\n\n\t\t\t\tmark_reactions(derived, MAYBE_DIRTY, updated_during_traversal);\n\t\t\t}\n\t\t} else if (not_dirty) {\n\t\t\tvar effect = /* @type {Effect} / (reaction);\n\n\t\t\tif ((flags & BLOCK_EFFECT) !== 0 && eager_block_effects !== null) {\n\t\t\t\teager_block_effects.add(effect);\n\t\t\t}\n\n\t\t\tif (updated_during_traversal !== null) {\n\t\t\t\tupdated_during_traversal.push(effect);\n\t\t\t} else {\n\t\t\t\tschedule_effect(effect);\n\t\t\t}\n\t\t}\n\t}\n}\n","/* @import { Source } from '#client' /\nimport { DEV } from 'esm-env';\nimport {\n\tget,\n\tactive_effect,\n\tupdate_version,\n\tactive_reaction,\n\tset_update_version,\n\tset_active_reaction\n} from './runtime.js';\nimport {\n\tarray_prototype,\n\tget_descriptor,\n\tget_prototype_of,\n\tis_array,\n\tobject_prototype\n} from '../shared/utils.js';\nimport {\n\tstate as source,\n\tset,\n\tincrement,\n\tflush_eager_effects,\n\tset_eager_effects_deferred\n} from './reactivity/sources.js';\nimport { PROXY_PATH_SYMBOL, STATE_SYMBOL } from '#client/constants';\nimport { UNINITIALIZED } from '../../constants.js';\nimport as e from './errors.js';\nimport { tag } from './dev/tracing.js';\nimport { get_error } from '../shared/dev.js';\nimport { tracing_mode_flag } from '../flags/index.js';\n\n// TODO move all regexes into shared module?\nconst regex_is_valid_identifier = /^[a-zA-Z_$][a-zA-Z_$0-9]$/;\n\n/\n @template T\n * @param {T} value\n * @returns {T}\n /\nexport function proxy(value) {\n\t// if non-proxyable, or is already a proxy, return `value`\n\tif (typeof value !== 'object' \|\| value === null \|\| STATE_SYMBOL in value) {\n\t\treturn value;\n\t}\n\n\tconst prototype = get_prototype_of(value);\n\n\tif (prototype !== object_prototype && prototype !== array_prototype) {\n\t\treturn value;\n\t}\n\n\t/* @type {Map<any, Source<any>>} /\n\tvar sources = new Map();\n\tvar is_proxied_array = is_array(value);\n\tvar version = source(0);\n\n\tvar stack = DEV && tracing_mode_flag ? get_error('created at') : null;\n\tvar parent_version = update_version;\n\n\t/\n\t Executes the proxy in the context of the reaction it was originally created in, if any\n\t * @template T\n\t * @param {() => T} fn\n\t /\n\tvar with_parent = (fn) => {\n\t\tif (update_version === parent_version) {\n\t\t\treturn fn();\n\t\t}\n\n\t\t// child source is being created after the initial proxy —\n\t\t// prevent it from being associated with the current reaction\n\t\tvar reaction = active_reaction;\n\t\tvar version = update_version;\n\n\t\tset_active_reaction(null);\n\t\tset_update_version(parent_version);\n\n\t\tvar result = fn();\n\n\t\tset_active_reaction(reaction);\n\t\tset_update_version(version);\n\n\t\treturn result;\n\t};\n\n\tif (is_proxied_array) {\n\t\t// We need to create the length source eagerly to ensure that\n\t\t// mutations to the array are properly synced with our proxy\n\t\tsources.set('length', source(/* @type {any[]} / (value).length, stack));\n\t\tif (DEV) {\n\t\t\tvalue = /* @type {any} / (inspectable_array(/* @type {any[]} / (value)));\n\t\t}\n\t}\n\n\t/* Used in dev for $inspect.trace() /\n\tvar path = '';\n\tlet updating = false;\n\t/* @param {string} new_path /\n\tfunction update_path(new_path) {\n\t\tif (updating) return;\n\t\tupdating = true;\n\t\tpath = new_path;\n\n\t\ttag(version, `${path} version`);\n\n\t\t// rename all child sources and child proxies\n\t\tfor (const [prop, source] of sources) {\n\t\t\ttag(source, get_label(path, prop));\n\t\t}\n\t\tupdating = false;\n\t}\n\n\treturn new Proxy(/* @type {any} / (value), {\n\t\tdefineProperty(_, prop, descriptor) {\n\t\t\tif (\n\t\t\t\t!('value' in descriptor) \|\|\n\t\t\t\tdescriptor.configurable === false \|\|\n\t\t\t\tdescriptor.enumerable === false \|\|\n\t\t\t\tdescriptor.writable === false\n\t\t\t) {\n\t\t\t\t// we disallow non-basic descriptors, because unless they are applied to the\n\t\t\t\t// target object — which we avoid, so that state can be forked — we will run\n\t\t\t\t// afoul of the various invariants\n\t\t\t\t// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Proxy/Proxy/getOwnPropertyDescriptor#invariants\n\t\t\t\te.state_descriptors_fixed();\n\t\t\t}\n\t\t\tvar s = sources.get(prop);\n\t\t\tif (s === undefined) {\n\t\t\t\twith_parent(() => {\n\t\t\t\t\tvar s = source(descriptor.value, stack);\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t\tif (DEV && typeof prop === 'string') {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\t\t\t\t\treturn s;\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tset(s, descriptor.value, true);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t},\n\n\t\tdeleteProperty(target, prop) {\n\t\t\tvar s = sources.get(prop);\n\n\t\t\tif (s === undefined) {\n\t\t\t\tif (prop in target) {\n\t\t\t\t\tconst s = with_parent(() => source(UNINITIALIZED, stack));\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t\tincrement(version);\n\n\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tset(s, UNINITIALIZED);\n\t\t\t\tincrement(version);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t},\n\n\t\tget(target, prop, receiver) {\n\t\t\tif (prop === STATE_SYMBOL) {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\tif (DEV && prop === PROXY_PATH_SYMBOL) {\n\t\t\t\treturn update_path;\n\t\t\t}\n\n\t\t\tvar s = sources.get(prop);\n\t\t\tvar exists = prop in target;\n\n\t\t\t// create a source, but only if it's an own property and not a prototype property\n\t\t\tif (s === undefined && (!exists \|\| get_descriptor(target, prop)?.writable)) {\n\t\t\t\ts = with_parent(() => {\n\t\t\t\t\tvar p = proxy(exists ? target[prop] : UNINITIALIZED);\n\t\t\t\t\tvar s = source(p, stack);\n\n\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\n\t\t\t\t\treturn s;\n\t\t\t\t});\n\n\t\t\t\tsources.set(prop, s);\n\t\t\t}\n\n\t\t\tif (s !== undefined) {\n\t\t\t\tvar v = get(s);\n\t\t\t\treturn v === UNINITIALIZED ? undefined : v;\n\t\t\t}\n\n\t\t\treturn Reflect.get(target, prop, receiver);\n\t\t},\n\n\t\tgetOwnPropertyDescriptor(target, prop) {\n\t\t\tvar descriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n\n\t\t\tif (descriptor && 'value' in descriptor) {\n\t\t\t\tvar s = sources.get(prop);\n\t\t\t\tif (s) descriptor.value = get(s);\n\t\t\t} else if (descriptor === undefined) {\n\t\t\t\tvar source = sources.get(prop);\n\t\t\t\tvar value = source?.v;\n\n\t\t\t\tif (source !== undefined && value !== UNINITIALIZED) {\n\t\t\t\t\treturn {\n\t\t\t\t\t\tenumerable: true,\n\t\t\t\t\t\tconfigurable: true,\n\t\t\t\t\t\tvalue,\n\t\t\t\t\t\twritable: true\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn descriptor;\n\t\t},\n\n\t\thas(target, prop) {\n\t\t\tif (prop === STATE_SYMBOL) {\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tvar s = sources.get(prop);\n\t\t\tvar has = (s !== undefined && s.v !== UNINITIALIZED) \|\| Reflect.has(target, prop);\n\n\t\t\tif (\n\t\t\t\ts !== undefined \|\|\n\t\t\t\t(active_effect !== null && (!has \|\| get_descriptor(target, prop)?.writable))\n\t\t\t) {\n\t\t\t\tif (s === undefined) {\n\t\t\t\t\ts = with_parent(() => {\n\t\t\t\t\t\tvar p = has ? proxy(target[prop]) : UNINITIALIZED;\n\t\t\t\t\t\tvar s = source(p, stack);\n\n\t\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn s;\n\t\t\t\t\t});\n\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t}\n\n\t\t\t\tvar value = get(s);\n\t\t\t\tif (value === UNINITIALIZED) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn has;\n\t\t},\n\n\t\tset(target, prop, value, receiver) {\n\t\t\tvar s = sources.get(prop);\n\t\t\tvar has = prop in target;\n\n\t\t\t// variable.length = value -> clear all signals with index >= value\n\t\t\tif (is_proxied_array && prop === 'length') {\n\t\t\t\tfor (var i = value; i < /* @type {Source<number>} / (s).v; i += 1) {\n\t\t\t\t\tvar other_s = sources.get(i + '');\n\t\t\t\t\tif (other_s !== undefined) {\n\t\t\t\t\t\tset(other_s, UNINITIALIZED);\n\t\t\t\t\t} else if (i in target) {\n\t\t\t\t\t\t// If the item exists in the original, we need to create an uninitialized source,\n\t\t\t\t\t\t// else a later read of the property would result in a source being created with\n\t\t\t\t\t\t// the value of the original item at that index.\n\t\t\t\t\t\tother_s = with_parent(() => source(UNINITIALIZED, stack));\n\t\t\t\t\t\tsources.set(i + '', other_s);\n\n\t\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\t\ttag(other_s, get_label(path, i));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If we haven't yet created a source for this property, we need to ensure\n\t\t\t// we do so otherwise if we read it later, then the write won't be tracked and\n\t\t\t// the heuristics of effects will be different vs if we had read the proxied\n\t\t\t// object property before writing to that property.\n\t\t\tif (s === undefined) {\n\t\t\t\tif (!has \|\| get_descriptor(target, prop)?.writable) {\n\t\t\t\t\ts = with_parent(() => source(undefined, stack));\n\n\t\t\t\t\tif (DEV) {\n\t\t\t\t\t\ttag(s, get_label(path, prop));\n\t\t\t\t\t}\n\t\t\t\t\tset(s, proxy(value));\n\n\t\t\t\t\tsources.set(prop, s);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\thas = s.v !== UNINITIALIZED;\n\n\t\t\t\tvar p = with_parent(() => proxy(value));\n\t\t\t\tset(s, p);\n\t\t\t}\n\n\t\t\tvar descriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n\n\t\t\t// Set the new value before updating any signals so that any listeners get the new value\n\t\t\tif (descriptor?.set) {\n\t\t\t\tdescriptor.set.call(receiver, value);\n\t\t\t}\n\n\t\t\tif (!has) {\n\t\t\t\t// If we have mutated an array directly, we might need to\n\t\t\t\t// signal that length has also changed. Do it before updating metadata\n\t\t\t\t// to ensure that iterating over the array as a result of a metadata update\n\t\t\t\t// will not cause the length to be out of sync.\n\t\t\t\tif (is_proxied_array && typeof prop === 'string') {\n\t\t\t\t\tvar ls = /* @type {Source<number>} / (sources.get('length'));\n\t\t\t\t\tvar n = Number(prop);\n\n\t\t\t\t\tif (Number.isInteger(n) && n >= ls.v) {\n\t\t\t\t\t\tset(ls, n + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tincrement(version);\n\t\t\t}\n\n\t\t\treturn true;\n\t\t},\n\n\t\townKeys(target) {\n\t\t\tget(version);\n\n\t\t\tvar own_keys = Reflect.ownKeys(target).filter((key) => {\n\t\t\t\tvar source = sources.get(key);\n\t\t\t\treturn source === undefined \|\| source.v !== UNINITIALIZED;\n\t\t\t});\n\n\t\t\tfor (var [key, source] of sources) {\n\t\t\t\tif (source.v !== UNINITIALIZED && !(key in target)) {\n\t\t\t\t\town_keys.push(key);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn own_keys;\n\t\t},\n\n\t\tsetPrototypeOf() {\n\t\t\te.state_prototype_fixed();\n\t\t}\n\t});\n}\n\n/\n @param {string} path\n * @param {string \| symbol} prop\n /\nfunction get_label(path, prop) {\n\tif (typeof prop === 'symbol') return `${path}[Symbol(${prop.description ?? ''})]`;\n\tif (regex_is_valid_identifier.test(prop)) return `${path}.${prop}`;\n\treturn /^\\d+$/.test(prop) ? `${path}[${prop}]` : `${path}['${prop}']`;\n}\n\n/\n @param {any} value\n /\nexport function get_proxied_value(value) {\n\ttry {\n\t\tif (value !== null && typeof value === 'object' && STATE_SYMBOL in value) {\n\t\t\treturn value[STATE_SYMBOL];\n\t\t}\n\t} catch {\n\t\t// the above if check can throw an error if the value in question\n\t\t// is the contentWindow of an iframe on another domain, in which\n\t\t// case we want to just return the value (because it's definitely\n\t\t// not a proxied value) so we don't break any JavaScript interacting\n\t\t// with that iframe (such as various payment companies client side\n\t\t// JavaScript libraries interacting with their iframes on the same\n\t\t// domain)\n\t}\n\n\treturn value;\n}\n\n/\n @param {any} a\n * @param {any} b\n /\nexport function is(a, b) {\n\treturn Object.is(get_proxied_value(a), get_proxied_value(b));\n}\n\nconst ARRAY_MUTATING_METHODS = new Set([\n\t'copyWithin',\n\t'fill',\n\t'pop',\n\t'push',\n\t'reverse',\n\t'shift',\n\t'sort',\n\t'splice',\n\t'unshift'\n]);\n\n/\n Wrap array mutating methods so $inspect is triggered only once and\n * to prevent logging an array in intermediate state (e.g. with an empty slot)\n * @param {any[]} array\n /\nfunction inspectable_array(array) {\n\treturn new Proxy(array, {\n\t\tget(target, prop, receiver) {\n\t\t\tvar value = Reflect.get(target, prop, receiver);\n\t\t\tif (!ARRAY_MUTATING_METHODS.has(/* @type {string} / (prop))) {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\t/\n\t\t\t @this {any[]}\n\t\t\t * @param {any[]} args\n\t\t\t /\n\t\t\treturn function (...args) {\n\t\t\t\tset_eager_effects_deferred();\n\t\t\t\tvar result = value.apply(this, args);\n\t\t\t\tflush_eager_effects();\n\t\t\t\treturn result;\n\t\t\t};\n\t\t}\n\t});\n}\n","/* @import { Effect, TemplateNode } from '#client' /\nimport { hydrate_node, hydrating, set_hydrate_node } from './hydration.js';\nimport { DEV } from 'esm-env';\nimport { init_array_prototype_warnings } from '../dev/equality.js';\nimport { get_descriptor, is_extensible } from '../../shared/utils.js';\nimport { active_effect } from '../runtime.js';\nimport { async_mode_flag } from '../../flags/index.js';\nimport {\n\tATTRIBUTES_CACHE,\n\tCLASS_CACHE,\n\tREACTION_RAN,\n\tSTYLE_CACHE,\n\tTEXT_CACHE,\n\tTEXT_NODE\n} from '#client/constants';\nimport { eager_block_effects } from '../reactivity/batch.js';\nimport { NAMESPACE_HTML } from '../../../constants.js';\n\n// export these for reference in the compiled code, making global name deduplication unnecessary\n/* @type {Window} /\nexport var $window;\n\n/* @type {Document} /\nexport var $document;\n\n/* @type {boolean} /\nexport var is_firefox;\n\n/* @type {() => Node \| null} /\nvar first_child_getter;\n/* @type {() => Node \| null} /\nvar next_sibling_getter;\n\n/\n Initialize these lazily to avoid issues when using the runtime in a server context\n * where these globals are not available while avoiding a separate server entry point\n /\nexport function init_operations() {\n\tif ($window !== undefined) {\n\t\treturn;\n\t}\n\n\t$window = window;\n\t$document = document;\n\tis_firefox = /Firefox/.test(navigator.userAgent);\n\n\tvar element_prototype = Element.prototype;\n\tvar node_prototype = Node.prototype;\n\tvar text_prototype = Text.prototype;\n\n\t// @ts-ignore\n\tfirst_child_getter = get_descriptor(node_prototype, 'firstChild').get;\n\t// @ts-ignore\n\tnext_sibling_getter = get_descriptor(node_prototype, 'nextSibling').get;\n\n\tif (is_extensible(element_prototype)) {\n\t\t// the following assignments improve perf of lookups on DOM nodes\n\t\t/* @type {any} / (element_prototype)[CLASS_CACHE] = undefined;\n\t\t/* @type {any} / (element_prototype)[ATTRIBUTES_CACHE] = null;\n\t\t/* @type {any} / (element_prototype)[STYLE_CACHE] = undefined;\n\t\t// @ts-expect-error\n\t\telement_prototype.__e = undefined;\n\t}\n\n\tif (is_extensible(text_prototype)) {\n\t\t/* @type {any} / (text_prototype)[TEXT_CACHE] = undefined;\n\t}\n\n\tif (DEV) {\n\t\t// @ts-expect-error\n\t\telement_prototype.__svelte_meta = null;\n\n\t\tinit_array_prototype_warnings();\n\t}\n}\n\n/\n @param {string} value\n * @returns {Text}\n /\nexport function create_text(value = '') {\n\treturn document.createTextNode(value);\n}\n\n/\n @template {Node} N\n * @param {N} node\n /\n/@__NO_SIDE_EFFECTS__/\nexport function get_first_child(node) {\n\treturn /* @type {TemplateNode \| null} / (first_child_getter.call(node));\n}\n\n/\n @template {Node} N\n * @param {N} node\n /\n/@__NO_SIDE_EFFECTS__/\nexport function get_next_sibling(node) {\n\treturn /* @type {TemplateNode \| null} / (next_sibling_getter.call(node));\n}\n\n/\n Don't mark this as side-effect-free, hydration needs to walk all nodes\n * @template {Node} N\n * @param {N} node\n * @param {boolean} is_text\n * @returns {TemplateNode \| null}\n /\nexport function child(node, is_text) {\n\tif (!hydrating) {\n\t\treturn get_first_child(node);\n\t}\n\n\tvar child = get_first_child(hydrate_node);\n\n\t// Child can be null if we have an element with a single child, like `<p>{text}</p>`, where `text` is empty\n\tif (child === null) {\n\t\tchild = hydrate_node.appendChild(create_text());\n\t} else if (is_text && child.nodeType !== TEXT_NODE) {\n\t\tvar text = create_text();\n\t\tchild?.before(text);\n\t\tset_hydrate_node(text);\n\t\treturn text;\n\t}\n\n\tif (is_text) {\n\t\tmerge_text_nodes(/* @type {Text} / (child));\n\t}\n\n\tset_hydrate_node(child);\n\treturn child;\n}\n\n/\n Don't mark this as side-effect-free, hydration needs to walk all nodes\n * @param {TemplateNode} node\n * @param {boolean} [is_text]\n * @returns {TemplateNode \| null}\n /\nexport function first_child(node, is_text = false) {\n\tif (!hydrating) {\n\t\tvar first = get_first_child(node);\n\n\t\t// TODO prevent user comments with the empty string when preserveComments is true\n\t\tif (first instanceof Comment && first.data === '') return get_next_sibling(first);\n\n\t\treturn first;\n\t}\n\n\tif (is_text) {\n\t\t// if an {expression} is empty during SSR, there might be no\n\t\t// text node to hydrate — we must therefore create one\n\t\tif (hydrate_node?.nodeType !== TEXT_NODE) {\n\t\t\tvar text = create_text();\n\n\t\t\thydrate_node?.before(text);\n\t\t\tset_hydrate_node(text);\n\t\t\treturn text;\n\t\t}\n\n\t\tmerge_text_nodes(/* @type {Text} / (hydrate_node));\n\t}\n\n\treturn hydrate_node;\n}\n\n/\n Don't mark this as side-effect-free, hydration needs to walk all nodes\n * @param {TemplateNode} node\n * @param {number} count\n * @param {boolean} is_text\n * @returns {TemplateNode \| null}\n /\nexport function sibling(node, count = 1, is_text = false) {\n\tlet next_sibling = hydrating ? hydrate_node : node;\n\tvar last_sibling;\n\n\twhile (count--) {\n\t\tlast_sibling = next_sibling;\n\t\tnext_sibling = /* @type {TemplateNode} / (get_next_sibling(next_sibling));\n\t}\n\n\tif (!hydrating) {\n\t\treturn next_sibling;\n\t}\n\n\tif (is_text) {\n\t\t// if a sibling {expression} is empty during SSR, there might be no\n\t\t// text node to hydrate — we must therefore create one\n\t\tif (next_sibling?.nodeType !== TEXT_NODE) {\n\t\t\tvar text = create_text();\n\t\t\t// If the next sibling is `null` and we're handling text then it's because\n\t\t\t// the SSR content was empty for the text, so we need to generate a new text\n\t\t\t// node and insert it after the last sibling\n\t\t\tif (next_sibling === null) {\n\t\t\t\tlast_sibling?.after(text);\n\t\t\t} else {\n\t\t\t\tnext_sibling.before(text);\n\t\t\t}\n\t\t\tset_hydrate_node(text);\n\t\t\treturn text;\n\t\t}\n\n\t\tmerge_text_nodes(/* @type {Text} / (next_sibling));\n\t}\n\n\tset_hydrate_node(next_sibling);\n\treturn next_sibling;\n}\n\n/\n @template {Node} N\n * @param {N} node\n * @returns {void}\n /\nexport function clear_text_content(node) {\n\tnode.textContent = '';\n}\n\n/\n Returns `true` if we're updating the current block, for example `condition` in\n * an `{#if condition}` block just changed. In this case, the branch should be\n * appended (or removed) at the same time as other updates within the\n * current `<svelte:boundary>`\n /\nexport function should_defer_append() {\n\tif (!async_mode_flag) return false;\n\tif (eager_block_effects !== null) return false;\n\n\tvar flags = /* @type {Effect} / (active_effect).f;\n\treturn (flags & REACTION_RAN) !== 0;\n}\n\n/\n @template {keyof HTMLElementTagNameMap \| string} T\n * @param {T} tag\n * @param {string} [namespace]\n * @param {string} [is]\n * @returns {T extends keyof HTMLElementTagNameMap ? HTMLElementTagNameMap[T] : Element}\n /\nexport function create_element(tag, namespace, is) {\n\tlet options = is ? { is } : undefined;\n\treturn /* @type {T extends keyof HTMLElementTagNameMap ? HTMLElementTagNameMap[T] : Element} / (\n\t\tdocument.createElementNS(namespace ?? NAMESPACE_HTML, tag, options)\n\t);\n}\n\nexport function create_fragment() {\n\treturn document.createDocumentFragment();\n}\n\n/\n @param {string} data\n * @returns\n /\nexport function create_comment(data = '') {\n\treturn document.createComment(data);\n}\n\n/\n @param {Element} element\n * @param {string} key\n * @param {string} value\n * @returns\n /\nexport function set_attribute(element, key, value = '') {\n\tif (key.startsWith('xlink:')) {\n\t\telement.setAttributeNS('http://www.w3.org/1999/xlink', key, value);\n\t\treturn;\n\t}\n\treturn element.setAttribute(key, value);\n}\n\n/\n Browsers split text nodes larger than 65536 bytes when parsing.\n * For hydration to succeed, we need to stitch them back together\n * @param {Text} text\n /\nexport function merge_text_nodes(text) {\n\tif (/* @type {string} / (text.nodeValue).length < 65536) {\n\t\treturn;\n\t}\n\n\tlet next = text.nextSibling;\n\n\twhile (next !== null && next.nodeType === TEXT_NODE) {\n\t\tnext.remove();\n\n\t\t/* @type {string} / (text.nodeValue) += /* @type {string} / (next.nodeValue);\n\n\t\tnext = text.nextSibling;\n\t}\n}\n","import { hydrating } from '../hydration.js';\nimport { clear_text_content, get_first_child } from '../operations.js';\nimport { queue_micro_task } from '../task.js';\nimport { FORM_RESET_HANDLER } from '../../constants.js';\n\n/\n @param {HTMLElement} dom\n * @param {boolean} value\n * @returns {void}\n /\nexport function autofocus(dom, value) {\n\tif (value) {\n\t\tconst body = document.body;\n\t\tdom.autofocus = true;\n\n\t\tqueue_micro_task(() => {\n\t\t\tif (document.activeElement === body) {\n\t\t\t\tdom.focus();\n\t\t\t}\n\t\t});\n\t}\n}\n\n/\n The child of a textarea actually corresponds to the defaultValue property, so we need\n * to remove it upon hydration to avoid a bug when someone resets the form value.\n * @param {HTMLTextAreaElement} dom\n * @returns {void}\n /\nexport function remove_textarea_child(dom) {\n\tif (hydrating && get_first_child(dom) !== null) {\n\t\tclear_text_content(dom);\n\t}\n}\n\nlet listening_to_form_reset = false;\n\nexport function add_form_reset_listener() {\n\tif (!listening_to_form_reset) {\n\t\tlistening_to_form_reset = true;\n\t\tdocument.addEventListener(\n\t\t\t'reset',\n\t\t\t(evt) => {\n\t\t\t\t// Needs to happen one tick later or else the dom properties of the form\n\t\t\t\t// elements have not updated to their reset values yet\n\t\t\t\tPromise.resolve().then(() => {\n\t\t\t\t\tif (!evt.defaultPrevented) {\n\t\t\t\t\t\tfor (const e of /@type {HTMLFormElement} / (evt.target).elements) {\n\t\t\t\t\t\t\t/** @type {any} / (e)[FORM_RESET_HANDLER]?.();\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\t// In the capture phase to guarantee we get noticed of it (no possibility of stopPropagation)\n\t\t\t{ capture: true }\n\t\t);\n\t}\n}\n","import { teardown } from '../../../reactivity/effects.js';\nimport {\n\tactive_effect,\n\tactive_reaction,\n\tset_active_effect,\n\tset_active_reaction\n} from '../../../runtime.js';\nimport { FORM_RESET_HANDLER } from '../../../constants.js';\nimport { add_form_reset_listener } from '../misc.js';\n\n/\n Fires the handler once immediately (unless corresponding arg is set to `false`),\n * then listens to the given events until the render effect context is destroyed\n * @param {EventTarget} target\n * @param {Array<string>} events\n * @param {(event?: Event) => void} handler\n * @param {any} call_handler_immediately\n /\nexport function listen(target, events, handler, call_handler_immediately = true) {\n\tif (call_handler_immediately) {\n\t\thandler();\n\t}\n\n\tfor (var name of events) {\n\t\ttarget.addEventListener(name, handler);\n\t}\n\n\tteardown(() => {\n\t\tfor (var name of events) {\n\t\t\ttarget.removeEventListener(name, handler);\n\t\t}\n\t});\n}\n\n/\n @template T\n * @param {() => T} fn\n /\nexport function without_reactive_context(fn) {\n\tvar previous_reaction = active_reaction;\n\tvar previous_effect = active_effect;\n\tset_active_reaction(null);\n\tset_active_effect(null);\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tset_active_reaction(previous_reaction);\n\t\tset_active_effect(previous_effect);\n\t}\n}\n\n/\n Listen to the given event, and then instantiate a global form reset listener if not already done,\n * to notify all bindings when the form is reset\n * @param {HTMLElement} element\n * @param {string} event\n * @param {(is_reset?: true) => void} handler\n * @param {(is_reset?: true) => void} [on_reset]\n /\nexport function listen_to_event_and_reset_event(element, event, handler, on_reset = handler) {\n\telement.addEventListener(event, () => without_reactive_context(handler));\n\tconst prev = /* @type {any} / (element)[FORM_RESET_HANDLER];\n\tif (prev) {\n\t\t// special case for checkbox that can have multiple binds (group & checked)\n\t\t/* @type {any} / (element)[FORM_RESET_HANDLER] = () => {\n\t\t\tprev();\n\t\t\ton_reset(true);\n\t\t};\n\t} else {\n\t\t/* @type {any} / (element)[FORM_RESET_HANDLER] = () => on_reset(true);\n\t}\n\n\tadd_form_reset_listener();\n}\n","/* @import { Blocker, ComponentContext, ComponentContextLegacy, Derived, Effect, TemplateNode, TransitionManager } from '#client' /\nimport {\n\tis_dirty,\n\tactive_effect,\n\tactive_reaction,\n\tupdate_effect,\n\tget,\n\tis_destroying_effect,\n\tremove_reactions,\n\tset_active_reaction,\n\tset_is_destroying_effect,\n\tuntrack,\n\tuntracking,\n\tset_active_effect\n} from '../runtime.js';\nimport {\n\tDIRTY,\n\tBRANCH_EFFECT,\n\tRENDER_EFFECT,\n\tEFFECT,\n\tDESTROYED,\n\tINERT,\n\tREACTION_RAN,\n\tBLOCK_EFFECT,\n\tROOT_EFFECT,\n\tEFFECT_TRANSPARENT,\n\tDERIVED,\n\tCLEAN,\n\tEAGER_EFFECT,\n\tHEAD_EFFECT,\n\tMAYBE_DIRTY,\n\tEFFECT_PRESERVED,\n\tSTALE_REACTION,\n\tUSER_EFFECT,\n\tASYNC,\n\tCONNECTED,\n\tMANAGED_EFFECT,\n\tDESTROYING\n} from '#client/constants';\nimport as e from '../errors.js';\nimport { DEV } from 'esm-env';\nimport { define_property } from '../../shared/utils.js';\nimport { get_next_sibling } from '../dom/operations.js';\nimport { component_context, dev_current_component_function, dev_stack } from '../context.js';\nimport { Batch, collected_effects, current_batch } from './batch.js';\nimport { flatten } from './async.js';\nimport { without_reactive_context } from '../dom/elements/bindings/shared.js';\nimport { set_signal_status } from './status.js';\n\n/*\n @param {'$effect' \| '$effect.pre' \| '$inspect'} rune\n /\nexport function validate_effect(rune) {\n\tif (active_effect === null) {\n\t\tif (active_reaction === null) {\n\t\t\te.effect_orphan(rune);\n\t\t}\n\n\t\te.effect_in_unowned_derived();\n\t}\n\n\tif (is_destroying_effect) {\n\t\te.effect_in_teardown(rune);\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {Effect} parent_effect\n /\nfunction push_effect(effect, parent_effect) {\n\tvar parent_last = parent_effect.last;\n\tif (parent_last === null) {\n\t\tparent_effect.last = parent_effect.first = effect;\n\t} else {\n\t\tparent_last.next = effect;\n\t\teffect.prev = parent_last;\n\t\tparent_effect.last = effect;\n\t}\n}\n\n/\n @param {number} type\n * @param {null \| (() => void \| (() => void))} fn\n * @returns {Effect}\n /\nfunction create_effect(type, fn) {\n\tvar parent = active_effect;\n\n\tif (DEV) {\n\t\t// Ensure the parent is never an inspect effect\n\t\twhile (parent !== null && (parent.f & EAGER_EFFECT) !== 0) {\n\t\t\tparent = parent.parent;\n\t\t}\n\t}\n\n\tif (parent !== null && (parent.f & INERT) !== 0) {\n\t\ttype \|= INERT;\n\t}\n\n\t/* @type {Effect} /\n\tvar effect = {\n\t\tctx: component_context,\n\t\tdeps: null,\n\t\tnodes: null,\n\t\tf: type \| DIRTY \| CONNECTED,\n\t\tfirst: null,\n\t\tfn,\n\t\tlast: null,\n\t\tnext: null,\n\t\tparent,\n\t\tb: parent && parent.b,\n\t\tprev: null,\n\t\tteardown: null,\n\t\twv: 0,\n\t\tac: null\n\t};\n\n\tif (DEV) {\n\t\teffect.component_function = dev_current_component_function;\n\t}\n\n\tcurrent_batch?.register_created_effect(effect);\n\n\t/* @type {Effect \| null} /\n\tvar e = effect;\n\n\tif ((type & EFFECT) !== 0) {\n\t\tif (collected_effects !== null) {\n\t\t\t// created during traversal — collect and run afterwards\n\t\t\tcollected_effects.push(effect);\n\t\t} else {\n\t\t\t// schedule for later\n\t\t\tBatch.ensure().schedule(effect);\n\t\t}\n\t} else if (fn !== null) {\n\t\ttry {\n\t\t\tupdate_effect(effect);\n\t\t} catch (e) {\n\t\t\tdestroy_effect(effect);\n\t\t\tthrow e;\n\t\t}\n\n\t\t// if an effect doesn't need to be kept in the tree (because it\n\t\t// won't re-run, has no DOM, and has no teardown etc)\n\t\t// then we skip it and go to its child (if any)\n\t\tif (\n\t\t\te.deps === null &&\n\t\t\te.teardown === null &&\n\t\t\te.nodes === null &&\n\t\t\te.first === e.last && // either `null`, or a singular child\n\t\t\t(e.f & EFFECT_PRESERVED) === 0\n\t\t) {\n\t\t\te = e.first;\n\t\t\tif ((type & BLOCK_EFFECT) !== 0 && (type & EFFECT_TRANSPARENT) !== 0 && e !== null) {\n\t\t\t\te.f \|= EFFECT_TRANSPARENT;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (e !== null) {\n\t\te.parent = parent;\n\n\t\tif (parent !== null) {\n\t\t\tpush_effect(e, parent);\n\t\t}\n\n\t\t// if we're in a derived, add the effect there too\n\t\tif (\n\t\t\tactive_reaction !== null &&\n\t\t\t(active_reaction.f & DERIVED) !== 0 &&\n\t\t\t(type & ROOT_EFFECT) === 0\n\t\t) {\n\t\t\tvar derived = /* @type {Derived} / (active_reaction);\n\t\t\t(derived.effects ??= []).push(e);\n\t\t}\n\t}\n\n\treturn effect;\n}\n\n/\n Internal representation of `$effect.tracking()`\n * @returns {boolean}\n /\nexport function effect_tracking() {\n\treturn active_reaction !== null && !untracking;\n}\n\n/\n @param {() => void} fn\n /\nexport function teardown(fn) {\n\tconst effect = create_effect(RENDER_EFFECT, null);\n\tset_signal_status(effect, CLEAN);\n\teffect.teardown = fn;\n\treturn effect;\n}\n\n/\n Internal representation of `$effect(...)`\n * @param {() => void \| (() => void)} fn\n /\nexport function user_effect(fn) {\n\tvalidate_effect('$effect');\n\n\tif (DEV) {\n\t\tdefine_property(fn, 'name', {\n\t\t\tvalue: '$effect'\n\t\t});\n\t}\n\n\t// Non-nested `$effect(...)` in a component should be deferred\n\t// until the component is mounted\n\tvar flags = /* @type {Effect} / (active_effect).f;\n\tvar defer = !active_reaction && (flags & BRANCH_EFFECT) !== 0 && (flags & REACTION_RAN) === 0;\n\n\tif (defer) {\n\t\t// Top-level `$effect(...)` in an unmounted component — defer until mount\n\t\tvar context = /* @type {ComponentContext} / (component_context);\n\t\t(context.e ??= []).push(fn);\n\t} else {\n\t\t// Everything else — create immediately\n\t\treturn create_user_effect(fn);\n\t}\n}\n\n/\n @param {() => void \| (() => void)} fn\n /\nexport function create_user_effect(fn) {\n\treturn create_effect(EFFECT \| USER_EFFECT, fn);\n}\n\n/\n Internal representation of `$effect.pre(...)`\n * @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function user_pre_effect(fn) {\n\tvalidate_effect('$effect.pre');\n\tif (DEV) {\n\t\tdefine_property(fn, 'name', {\n\t\t\tvalue: '$effect.pre'\n\t\t});\n\t}\n\treturn create_effect(RENDER_EFFECT \| USER_EFFECT, fn);\n}\n\n/* @param {() => void \| (() => void)} fn /\nexport function eager_effect(fn) {\n\treturn create_effect(EAGER_EFFECT, fn);\n}\n\n/\n Internal representation of `$effect.root(...)`\n * @param {() => void \| (() => void)} fn\n * @returns {() => void}\n /\nexport function effect_root(fn) {\n\tBatch.ensure();\n\tconst effect = create_effect(ROOT_EFFECT \| EFFECT_PRESERVED, fn);\n\n\treturn () => {\n\t\tdestroy_effect(effect);\n\t};\n}\n\n/\n An effect root whose children can transition out\n * @param {() => void} fn\n * @returns {(options?: { outro?: boolean }) => Promise<void>}\n /\nexport function component_root(fn) {\n\tBatch.ensure();\n\tconst effect = create_effect(ROOT_EFFECT \| EFFECT_PRESERVED, fn);\n\n\treturn (options = {}) => {\n\t\treturn new Promise((fulfil) => {\n\t\t\tif (options.outro) {\n\t\t\t\tpause_effect(effect, () => {\n\t\t\t\t\tdestroy_effect(effect);\n\t\t\t\t\tfulfil(undefined);\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tdestroy_effect(effect);\n\t\t\t\tfulfil(undefined);\n\t\t\t}\n\t\t});\n\t};\n}\n\n/\n @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function effect(fn) {\n\treturn create_effect(EFFECT, fn);\n}\n\n/\n Internal representation of `$: ..`\n * @param {() => any} deps\n * @param {() => void \| (() => void)} fn\n /\nexport function legacy_pre_effect(deps, fn) {\n\tvar context = /* @type {ComponentContextLegacy} / (component_context);\n\n\t/* @type {{ effect: null \| Effect, ran: boolean, deps: () => any }} /\n\tvar token = { effect: null, ran: false, deps };\n\n\tcontext.l.$.push(token);\n\n\ttoken.effect = render_effect(() => {\n\t\tdeps();\n\n\t\t// If this legacy pre effect has already run before the end of the reset, then\n\t\t// bail out to emulate the same behavior.\n\t\tif (token.ran) return;\n\n\t\ttoken.ran = true;\n\n\t\tvar effect = /* @type {Effect} / (active_effect);\n\n\t\t// here, we lie: by setting `active_effect` to be the parent branch, any writes\n\t\t// that happen inside `fn` will _not_ cause an unnecessary reschedule, because\n\t\t// the affected effects will be children of `active_effect`. this is safe\n\t\t// because these effects are known to run in the correct order\n\t\ttry {\n\t\t\tset_active_effect(effect.parent);\n\t\t\tuntrack(fn);\n\t\t} finally {\n\t\t\tset_active_effect(effect);\n\t\t}\n\t});\n}\n\nexport function legacy_pre_effect_reset() {\n\tvar context = /* @type {ComponentContextLegacy} / (component_context);\n\n\trender_effect(() => {\n\t\t// Run dirty `$:` statements\n\t\tfor (var token of context.l.$) {\n\t\t\ttoken.deps();\n\n\t\t\tvar effect = token.effect;\n\n\t\t\t// If the effect is CLEAN, then make it MAYBE_DIRTY. This ensures we traverse through\n\t\t\t// the effects dependencies and correctly ensure each dependency is up-to-date.\n\t\t\tif ((effect.f & CLEAN) !== 0 && effect.deps !== null) {\n\t\t\t\tset_signal_status(effect, MAYBE_DIRTY);\n\t\t\t}\n\n\t\t\tif (is_dirty(effect)) {\n\t\t\t\tupdate_effect(effect);\n\t\t\t}\n\n\t\t\ttoken.ran = false;\n\t\t}\n\t});\n}\n\n/\n @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function async_effect(fn) {\n\treturn create_effect(ASYNC \| EFFECT_PRESERVED, fn);\n}\n\n/\n @param {() => void \| (() => void)} fn\n * @returns {Effect}\n /\nexport function render_effect(fn, flags = 0) {\n\treturn create_effect(RENDER_EFFECT \| flags, fn);\n}\n\n/\n @param {(...expressions: any) => void \| (() => void)} fn\n * @param {Array<() => any>} sync\n * @param {Array<() => Promise<any>>} async\n * @param {Blocker[]} blockers\n /\nexport function template_effect(fn, sync = [], async = [], blockers = []) {\n\tflatten(blockers, sync, async, (values) => {\n\t\tcreate_effect(RENDER_EFFECT, () => fn(...values.map(get)));\n\t});\n}\n\n/\n Like `template_effect`, but with an effect which is deferred until the batch commits\n * @param {(...expressions: any) => void \| (() => void)} fn\n * @param {Array<() => any>} sync\n * @param {Array<() => Promise<any>>} async\n * @param {Blocker[]} blockers\n /\nexport function deferred_template_effect(fn, sync = [], async = [], blockers = []) {\n\tflatten(blockers, sync, async, (values) => {\n\t\tcreate_effect(EFFECT, () => fn(...values.map(get)));\n\t});\n}\n\n/\n @param {(() => void)} fn\n * @param {number} flags\n /\nexport function block(fn, flags = 0) {\n\tvar effect = create_effect(BLOCK_EFFECT \| flags, fn);\n\tif (DEV) {\n\t\teffect.dev_stack = dev_stack;\n\t}\n\treturn effect;\n}\n\n/\n @param {(() => void)} fn\n * @param {number} flags\n /\nexport function managed(fn, flags = 0) {\n\tvar effect = create_effect(MANAGED_EFFECT \| flags, fn);\n\tif (DEV) {\n\t\teffect.dev_stack = dev_stack;\n\t}\n\treturn effect;\n}\n\n/\n @param {(() => void)} fn\n /\nexport function branch(fn) {\n\treturn create_effect(BRANCH_EFFECT \| EFFECT_PRESERVED, fn);\n}\n\n/\n @param {Effect} effect\n /\nexport function execute_effect_teardown(effect) {\n\tvar teardown = effect.teardown;\n\tif (teardown !== null) {\n\t\tconst previously_destroying_effect = is_destroying_effect;\n\t\tconst previous_reaction = active_reaction;\n\t\tset_is_destroying_effect(true);\n\t\tset_active_reaction(null);\n\t\ttry {\n\t\t\tteardown.call(null);\n\t\t} finally {\n\t\t\tset_is_destroying_effect(previously_destroying_effect);\n\t\t\tset_active_reaction(previous_reaction);\n\t\t}\n\t}\n}\n\n/\n @param {Effect} signal\n * @param {boolean} remove_dom\n * @returns {void}\n /\nexport function destroy_effect_children(signal, remove_dom = false) {\n\tvar effect = signal.first;\n\tsignal.first = signal.last = null;\n\n\twhile (effect !== null) {\n\t\tconst controller = effect.ac;\n\n\t\tif (controller !== null) {\n\t\t\twithout_reactive_context(() => {\n\t\t\t\tcontroller.abort(STALE_REACTION);\n\t\t\t});\n\t\t}\n\n\t\tvar next = effect.next;\n\n\t\tif ((effect.f & ROOT_EFFECT) !== 0) {\n\t\t\t// this is now an independent root\n\t\t\teffect.parent = null;\n\t\t} else {\n\t\t\tdestroy_effect(effect, remove_dom);\n\t\t}\n\n\t\teffect = next;\n\t}\n}\n\n/\n @param {Effect} signal\n * @returns {void}\n /\nexport function destroy_block_effect_children(signal) {\n\tvar effect = signal.first;\n\n\twhile (effect !== null) {\n\t\tvar next = effect.next;\n\t\tif ((effect.f & BRANCH_EFFECT) === 0) {\n\t\t\tdestroy_effect(effect);\n\t\t}\n\t\teffect = next;\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {boolean} [remove_dom]\n * @returns {void}\n /\nexport function destroy_effect(effect, remove_dom = true) {\n\tvar removed = false;\n\n\tif (\n\t\t(remove_dom \|\| (effect.f & HEAD_EFFECT) !== 0) &&\n\t\teffect.nodes !== null &&\n\t\teffect.nodes.end !== null\n\t) {\n\t\tremove_effect_dom(effect.nodes.start, /* @type {TemplateNode} / (effect.nodes.end));\n\t\tremoved = true;\n\t}\n\n\tset_signal_status(effect, DESTROYING);\n\tdestroy_effect_children(effect, remove_dom && !removed);\n\tremove_reactions(effect, 0);\n\n\tvar transitions = effect.nodes && effect.nodes.t;\n\n\tif (transitions !== null) {\n\t\tfor (const transition of transitions) {\n\t\t\ttransition.stop();\n\t\t}\n\t}\n\n\texecute_effect_teardown(effect);\n\n\teffect.f ^= DESTROYING;\n\teffect.f \|= DESTROYED;\n\n\tvar parent = effect.parent;\n\n\t// If the parent doesn't have any children, then skip this work altogether\n\tif (parent !== null && parent.first !== null) {\n\t\tunlink_effect(effect);\n\t}\n\n\tif (DEV) {\n\t\teffect.component_function = null;\n\t}\n\n\t// `first` and `child` are nulled out in destroy_effect_children\n\t// we don't null out `parent` so that error propagation can work correctly\n\teffect.next =\n\t\teffect.prev =\n\t\teffect.teardown =\n\t\teffect.ctx =\n\t\teffect.deps =\n\t\teffect.fn =\n\t\teffect.nodes =\n\t\teffect.ac =\n\t\teffect.b =\n\t\t\tnull;\n}\n\n/\n \n * @param {TemplateNode \| null} node\n * @param {TemplateNode} end\n /\nexport function remove_effect_dom(node, end) {\n\twhile (node !== null) {\n\t\t/* @type {TemplateNode \| null} /\n\t\tvar next = node === end ? null : get_next_sibling(node);\n\n\t\tnode.remove();\n\t\tnode = next;\n\t}\n}\n\n/\n Detach an effect from the effect tree, freeing up memory and\n * reducing the amount of work that happens on subsequent traversals\n * @param {Effect} effect\n /\nexport function unlink_effect(effect) {\n\tvar parent = effect.parent;\n\tvar prev = effect.prev;\n\tvar next = effect.next;\n\n\tif (prev !== null) prev.next = next;\n\tif (next !== null) next.prev = prev;\n\n\tif (parent !== null) {\n\t\tif (parent.first === effect) parent.first = next;\n\t\tif (parent.last === effect) parent.last = prev;\n\t}\n}\n\n/\n When a block effect is removed, we don't immediately destroy it or yank it\n * out of the DOM, because it might have transitions. Instead, we 'pause' it.\n * It stays around (in memory, and in the DOM) until outro transitions have\n * completed, and if the state change is reversed then we _resume_ it.\n * A paused effect does not update, and the DOM subtree becomes inert.\n * @param {Effect} effect\n * @param {() => void} [callback]\n * @param {boolean} [destroy]\n /\nexport function pause_effect(effect, callback, destroy = true) {\n\t/* @type {TransitionManager[]} /\n\tvar transitions = [];\n\n\tpause_children(effect, transitions, true);\n\n\tvar fn = () => {\n\t\tif (destroy) destroy_effect(effect);\n\t\tif (callback) callback();\n\t};\n\n\tvar remaining = transitions.length;\n\tif (remaining > 0) {\n\t\tvar check = () => --remaining \|\| fn();\n\t\tfor (var transition of transitions) {\n\t\t\ttransition.out(check);\n\t\t}\n\t} else {\n\t\tfn();\n\t}\n}\n\n/\n @param {Effect} effect\n * @param {TransitionManager[]} transitions\n * @param {boolean} local\n /\nfunction pause_children(effect, transitions, local) {\n\tif ((effect.f & INERT) !== 0) return;\n\teffect.f ^= INERT;\n\n\tvar t = effect.nodes && effect.nodes.t;\n\n\tif (t !== null) {\n\t\tfor (const transition of t) {\n\t\t\tif (transition.is_global \|\| local) {\n\t\t\t\ttransitions.push(transition);\n\t\t\t}\n\t\t}\n\t}\n\n\tvar child = effect.first;\n\n\twhile (child !== null) {\n\t\tvar sibling = child.next;\n\n\t\t// If this child is a root effect, then it will become an independent root when its parent\n\t\t// is destroyed, it should therefore not become inert nor partake in transitions.\n\t\tif ((child.f & ROOT_EFFECT) === 0) {\n\t\t\tvar transparent =\n\t\t\t\t(child.f & EFFECT_TRANSPARENT) !== 0 \|\|\n\t\t\t\t// If this is a branch effect without a block effect parent,\n\t\t\t\t// it means the parent block effect was pruned. In that case,\n\t\t\t\t// transparency information was transferred to the branch effect.\n\t\t\t\t((child.f & BRANCH_EFFECT) !== 0 && (effect.f & BLOCK_EFFECT) !== 0);\n\t\t\t// TODO we don't need to call pause_children recursively with a linked list in place\n\t\t\t// it's slightly more involved though as we have to account for `transparent` changing\n\t\t\t// through the tree.\n\t\t\tpause_children(child, transitions, transparent ? local : false);\n\t\t}\n\n\t\tchild = sibling;\n\t}\n}\n\n/\n The opposite of `pause_effect`. We call this if (for example)\n * `x` becomes falsy then truthy: `{#if x}...{/if}`\n * @param {Effect} effect\n /\nexport function resume_effect(effect) {\n\tresume_children(effect, true);\n}\n\n/\n @param {Effect} effect\n * @param {boolean} local\n /\nfunction resume_children(effect, local) {\n\tif ((effect.f & INERT) === 0) return;\n\teffect.f ^= INERT;\n\n\t// If a dependency of this effect changed while it was paused,\n\t// schedule the effect to update. we don't use `is_dirty`\n\t// here because we don't want to eagerly recompute a derived like\n\t// `{#if foo}{foo.bar()}{/if}` if `foo` is now `undefined\n\tif ((effect.f & CLEAN) === 0) {\n\t\tset_signal_status(effect, DIRTY);\n\t\tBatch.ensure().schedule(effect); // Assumption: This happens during the commit phase of the batch, causing another flush, but it's safe\n\t}\n\n\tvar child = effect.first;\n\n\twhile (child !== null) {\n\t\tvar sibling = child.next;\n\t\tvar transparent = (child.f & EFFECT_TRANSPARENT) !== 0 \|\| (child.f & BRANCH_EFFECT) !== 0;\n\t\t// TODO we don't need to call resume_children recursively with a linked list in place\n\t\t// it's slightly more involved though as we have to account for `transparent` changing\n\t\t// through the tree.\n\t\tresume_children(child, transparent ? local : false);\n\t\tchild = sibling;\n\t}\n\n\tvar t = effect.nodes && effect.nodes.t;\n\n\tif (t !== null) {\n\t\tfor (const transition of t) {\n\t\t\tif (transition.is_global \|\| local) {\n\t\t\t\ttransition.in();\n\t\t\t}\n\t\t}\n\t}\n}\n\nexport function aborted(effect = /* @type {Effect} / (active_effect)) {\n\treturn (effect.f & DESTROYED) !== 0;\n}\n\n/\n @param {Effect} effect\n * @param {DocumentFragment} fragment\n /\nexport function move_effect(effect, fragment) {\n\tif (!effect.nodes) return;\n\n\t/* @type {TemplateNode \| null} /\n\tvar node = effect.nodes.start;\n\tvar end = effect.nodes.end;\n\n\twhile (node !== null) {\n\t\t/* @type {TemplateNode \| null} /\n\t\tvar next = node === end ? null : get_next_sibling(node);\n\n\t\tfragment.append(node);\n\t\tnode = next;\n\t}\n}\n","/* @import { Derived, Effect, Reaction, Source, Value } from '#client' /\nimport { DEV } from 'esm-env';\nimport { get_descriptors, get_prototype_of, includes, index_of } from '../shared/utils.js';\nimport {\n\tdestroy_block_effect_children,\n\tdestroy_effect_children,\n\teffect_tracking,\n\texecute_effect_teardown\n} from './reactivity/effects.js';\nimport {\n\tDIRTY,\n\tMAYBE_DIRTY,\n\tCLEAN,\n\tDERIVED,\n\tDESTROYED,\n\tBRANCH_EFFECT,\n\tSTATE_SYMBOL,\n\tBLOCK_EFFECT,\n\tROOT_EFFECT,\n\tCONNECTED,\n\tREACTION_IS_UPDATING,\n\tSTALE_REACTION,\n\tERROR_VALUE,\n\tWAS_MARKED,\n\tMANAGED_EFFECT,\n\tREACTION_RAN\n} from './constants.js';\nimport { old_values } from './reactivity/sources.js';\nimport {\n\treactivity_loss_tracker,\n\texecute_derived,\n\tfreeze_derived_effects,\n\trecent_async_deriveds,\n\tunfreeze_derived_effects,\n\tupdate_derived\n} from './reactivity/deriveds.js';\nimport { async_mode_flag, tracing_mode_flag } from '../flags/index.js';\nimport { tracing_expressions } from './dev/tracing.js';\nimport { get_error } from '../shared/dev.js';\nimport {\n\tcomponent_context,\n\tdev_current_component_function,\n\tdev_stack,\n\tis_runes,\n\tset_component_context,\n\tset_dev_current_component_function,\n\tset_dev_stack\n} from './context.js';\nimport {\n\tBatch,\n\tbatch_values,\n\tcurrent_batch,\n\tflushSync,\n\tschedule_effect\n} from './reactivity/batch.js';\nimport { handle_error } from './error-handling.js';\nimport { UNINITIALIZED } from '../../constants.js';\nimport { captured_signals } from './legacy.js';\nimport { without_reactive_context } from './dom/elements/bindings/shared.js';\nimport { set_signal_status, update_derived_status } from './reactivity/status.js';\nimport as w from './warnings.js';\n\nlet is_updating_effect = false;\n\nexport let is_destroying_effect = false;\n\n/** @param {boolean} value /\nexport function set_is_destroying_effect(value) {\n\tis_destroying_effect = value;\n}\n\n/* @type {null \| Reaction} /\nexport let active_reaction = null;\n\nexport let untracking = false;\n\n/* @param {null \| Reaction} reaction /\nexport function set_active_reaction(reaction) {\n\tactive_reaction = reaction;\n}\n\n/* @type {null \| Effect} /\nexport let active_effect = null;\n\n/* @param {null \| Effect} effect /\nexport function set_active_effect(effect) {\n\tactive_effect = effect;\n}\n\n/\n When sources are created within a reaction, reading and writing\n * them within that reaction should not cause a re-run\n * @type {null \| Source[]}\n /\nexport let current_sources = null;\n\n/* @param {Value} value /\nexport function push_reaction_value(value) {\n\tif (active_reaction !== null && (!async_mode_flag \|\| (active_reaction.f & DERIVED) !== 0)) {\n\t\tif (current_sources === null) {\n\t\t\tcurrent_sources = [value];\n\t\t} else {\n\t\t\tcurrent_sources.push(value);\n\t\t}\n\t}\n}\n\n/\n The dependencies of the reaction that is currently being executed. In many cases,\n * the dependencies are unchanged between runs, and so this will be `null` unless\n * and until a new dependency is accessed — we track this via `skipped_deps`\n * @type {null \| Value[]}\n /\nexport let new_deps = null;\n\nexport let skipped_deps = 0;\n\n/\n Tracks writes that the effect it's executed in doesn't listen to yet,\n * so that the dependency can be added to the effect later on if it then reads it\n * @type {null \| Source[]}\n /\nexport let untracked_writes = null;\n\n/* @param {null \| Source[]} value /\nexport function set_untracked_writes(value) {\n\tuntracked_writes = value;\n}\n\n/\n @type {number} Used by sources and deriveds for handling updates.\n * Version starts from 1 so that unowned deriveds differentiate between a created effect and a run one for tracing\n /\nexport let write_version = 1;\n\n/ @type {number} Used to version each read of a source of derived to avoid duplicating depedencies inside a reaction /\nlet read_version = 0;\n\nexport let update_version = read_version;\n\n/* @param {number} value /\nexport function set_update_version(value) {\n\tupdate_version = value;\n}\n\nexport function increment_write_version() {\n\treturn ++write_version;\n}\n\n/\n Determines whether a derived or effect is dirty.\n * If it is MAYBE_DIRTY, will set the status to CLEAN\n * @param {Reaction} reaction\n * @returns {boolean}\n /\nexport function is_dirty(reaction) {\n\tvar flags = reaction.f;\n\n\tif ((flags & DIRTY) !== 0) {\n\t\treturn true;\n\t}\n\n\tif (flags & DERIVED) {\n\t\treaction.f &= ~WAS_MARKED;\n\t}\n\n\tif ((flags & MAYBE_DIRTY) !== 0) {\n\t\tvar dependencies = /* @type {Value[]} / (reaction.deps);\n\t\tvar length = dependencies.length;\n\n\t\tfor (var i = 0; i < length; i++) {\n\t\t\tvar dependency = dependencies[i];\n\n\t\t\tif (is_dirty(/* @type {Derived} / (dependency))) {\n\t\t\t\tupdate_derived(/* @type {Derived} / (dependency));\n\t\t\t}\n\n\t\t\tif (dependency.wv > reaction.wv) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tif (\n\t\t\t(flags & CONNECTED) !== 0 &&\n\t\t\t// During time traveling we don't want to reset the status so that\n\t\t\t// traversal of the graph in the other batches still happens\n\t\t\tbatch_values === null\n\t\t) {\n\t\t\tset_signal_status(reaction, CLEAN);\n\t\t}\n\t}\n\n\treturn false;\n}\n\n/\n @param {Value} signal\n * @param {Effect} effect\n * @param {boolean} [root]\n /\nfunction schedule_possible_effect_self_invalidation(signal, effect, root = true) {\n\tvar reactions = signal.reactions;\n\tif (reactions === null) return;\n\n\tif (!async_mode_flag && current_sources !== null && includes.call(current_sources, signal)) {\n\t\treturn;\n\t}\n\n\tfor (var i = 0; i < reactions.length; i++) {\n\t\tvar reaction = reactions[i];\n\n\t\tif ((reaction.f & DERIVED) !== 0) {\n\t\t\tschedule_possible_effect_self_invalidation(/* @type {Derived} / (reaction), effect, false);\n\t\t} else if (effect === reaction) {\n\t\t\tif (root) {\n\t\t\t\tset_signal_status(reaction, DIRTY);\n\t\t\t} else if ((reaction.f & CLEAN) !== 0) {\n\t\t\t\tset_signal_status(reaction, MAYBE_DIRTY);\n\t\t\t}\n\t\t\tschedule_effect(/* @type {Effect} / (reaction));\n\t\t}\n\t}\n}\n\n/* @param {Reaction} reaction /\nexport function update_reaction(reaction) {\n\tvar previous_deps = new_deps;\n\tvar previous_skipped_deps = skipped_deps;\n\tvar previous_untracked_writes = untracked_writes;\n\tvar previous_reaction = active_reaction;\n\tvar previous_sources = current_sources;\n\tvar previous_component_context = component_context;\n\tvar previous_untracking = untracking;\n\tvar previous_update_version = update_version;\n\n\tvar flags = reaction.f;\n\n\tnew_deps = /* @type {null \| Value[]} / (null);\n\tskipped_deps = 0;\n\tuntracked_writes = null;\n\tactive_reaction = (flags & (BRANCH_EFFECT \| ROOT_EFFECT)) === 0 ? reaction : null;\n\n\tcurrent_sources = null;\n\tset_component_context(reaction.ctx);\n\tuntracking = false;\n\tupdate_version = ++read_version;\n\n\tif (reaction.ac !== null) {\n\t\twithout_reactive_context(() => {\n\t\t\t/* @type {AbortController} / (reaction.ac).abort(STALE_REACTION);\n\t\t});\n\n\t\treaction.ac = null;\n\t}\n\n\ttry {\n\t\treaction.f \|= REACTION_IS_UPDATING;\n\t\tvar fn = /* @type {Function} / (reaction.fn);\n\t\tvar result = fn();\n\t\treaction.f \|= REACTION_RAN;\n\t\tvar deps = reaction.deps;\n\n\t\t// Don't remove reactions during fork;\n\t\t// they must remain for when fork is discarded\n\t\tvar is_fork = current_batch?.is_fork;\n\n\t\tif (new_deps !== null) {\n\t\t\tvar i;\n\n\t\t\tif (!is_fork) {\n\t\t\t\tremove_reactions(reaction, skipped_deps);\n\t\t\t}\n\n\t\t\tif (deps !== null && skipped_deps > 0) {\n\t\t\t\tdeps.length = skipped_deps + new_deps.length;\n\t\t\t\tfor (i = 0; i < new_deps.length; i++) {\n\t\t\t\t\tdeps[skipped_deps + i] = new_deps[i];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\treaction.deps = deps = new_deps;\n\t\t\t}\n\n\t\t\tif (effect_tracking() && (reaction.f & CONNECTED) !== 0) {\n\t\t\t\tfor (i = skipped_deps; i < deps.length; i++) {\n\t\t\t\t\t(deps[i].reactions ??= []).push(reaction);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (!is_fork && deps !== null && skipped_deps < deps.length) {\n\t\t\tremove_reactions(reaction, skipped_deps);\n\t\t\tdeps.length = skipped_deps;\n\t\t}\n\n\t\t// If we're inside an effect and we have untracked writes, then we need to\n\t\t// ensure that if any of those untracked writes result in re-invalidation\n\t\t// of the current effect, then that happens accordingly\n\t\tif (\n\t\t\tis_runes() &&\n\t\t\tuntracked_writes !== null &&\n\t\t\t!untracking &&\n\t\t\tdeps !== null &&\n\t\t\t(reaction.f & (DERIVED \| MAYBE_DIRTY \| DIRTY)) === 0\n\t\t) {\n\t\t\tfor (i = 0; i < /* @type {Source[]} / (untracked_writes).length; i++) {\n\t\t\t\tschedule_possible_effect_self_invalidation(\n\t\t\t\t\tuntracked_writes[i],\n\t\t\t\t\t/* @type {Effect} / (reaction)\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\t// If we are returning to an previous reaction then\n\t\t// we need to increment the read version to ensure that\n\t\t// any dependencies in this reaction aren't marked with\n\t\t// the same version\n\t\tif (previous_reaction !== null && previous_reaction !== reaction) {\n\t\t\tread_version++;\n\n\t\t\t// update the `rv` of the previous reaction's deps — both existing and new —\n\t\t\t// so that they are not added again\n\t\t\tif (previous_reaction.deps !== null) {\n\t\t\t\tfor (let i = 0; i < previous_skipped_deps; i += 1) {\n\t\t\t\t\tprevious_reaction.deps[i].rv = read_version;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (previous_deps !== null) {\n\t\t\t\tfor (const dep of previous_deps) {\n\t\t\t\t\tdep.rv = read_version;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (untracked_writes !== null) {\n\t\t\t\tif (previous_untracked_writes === null) {\n\t\t\t\t\tprevious_untracked_writes = untracked_writes;\n\t\t\t\t} else {\n\t\t\t\t\tprevious_untracked_writes.push(.../* @type {Source[]} / (untracked_writes));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif ((reaction.f & ERROR_VALUE) !== 0) {\n\t\t\treaction.f ^= ERROR_VALUE;\n\t\t}\n\n\t\treturn result;\n\t} catch (error) {\n\t\treturn handle_error(error);\n\t} finally {\n\t\treaction.f ^= REACTION_IS_UPDATING;\n\t\tnew_deps = previous_deps;\n\t\tskipped_deps = previous_skipped_deps;\n\t\tuntracked_writes = previous_untracked_writes;\n\t\tactive_reaction = previous_reaction;\n\t\tcurrent_sources = previous_sources;\n\t\tset_component_context(previous_component_context);\n\t\tuntracking = previous_untracking;\n\t\tupdate_version = previous_update_version;\n\t}\n}\n\n/\n @template V\n * @param {Reaction} signal\n * @param {Value<V>} dependency\n * @returns {void}\n /\nfunction remove_reaction(signal, dependency) {\n\tlet reactions = dependency.reactions;\n\tif (reactions !== null) {\n\t\tvar index = index_of.call(reactions, signal);\n\t\tif (index !== -1) {\n\t\t\tvar new_length = reactions.length - 1;\n\t\t\tif (new_length === 0) {\n\t\t\t\treactions = dependency.reactions = null;\n\t\t\t} else {\n\t\t\t\t// Swap with last element and then remove.\n\t\t\t\treactions[index] = reactions[new_length];\n\t\t\t\treactions.pop();\n\t\t\t}\n\t\t}\n\t}\n\n\t// If the derived has no reactions, then we can disconnect it from the graph,\n\t// allowing it to either reconnect in the future, or be GC'd by the VM.\n\tif (\n\t\treactions === null &&\n\t\t(dependency.f & DERIVED) !== 0 &&\n\t\t// Destroying a child effect while updating a parent effect can cause a dependency to appear\n\t\t// to be unused, when in fact it is used by the currently-updating parent. Checking `new_deps`\n\t\t// allows us to skip the expensive work of disconnecting and immediately reconnecting it\n\t\t(new_deps === null \|\| !includes.call(new_deps, dependency))\n\t) {\n\t\tvar derived = /* @type {Derived} / (dependency);\n\n\t\t// If we are working with a derived that is owned by an effect, then mark it as being\n\t\t// disconnected and remove the mark flag, as it cannot be reliably removed otherwise\n\t\tif ((derived.f & CONNECTED) !== 0) {\n\t\t\tderived.f ^= CONNECTED;\n\t\t\tderived.f &= ~WAS_MARKED;\n\t\t}\n\n\t\t// In a fork it's possible that a derived is executed and gets reactions, then commits, but is\n\t\t// never re-executed. This is possible when the derived is only executed once in the context\n\t\t// of a new branch which happens before fork.commit() runs. In this case, the derived still has\n\t\t// UNINITIALIZED as its value, and then when it's loosing its reactions we need to ensure it stays\n\t\t// DIRTY so it is reexecuted once someone wants its value again.\n\t\tif (derived.v !== UNINITIALIZED) {\n\t\t\tupdate_derived_status(derived);\n\t\t}\n\n\t\t// freeze any effects inside this derived\n\t\tfreeze_derived_effects(derived);\n\n\t\t// Disconnect any reactions owned by this reaction\n\t\tremove_reactions(derived, 0);\n\t}\n}\n\n/\n @param {Reaction} signal\n * @param {number} start_index\n * @returns {void}\n /\nexport function remove_reactions(signal, start_index) {\n\tvar dependencies = signal.deps;\n\tif (dependencies === null) return;\n\n\tfor (var i = start_index; i < dependencies.length; i++) {\n\t\tremove_reaction(signal, dependencies[i]);\n\t}\n}\n\n/\n @param {Effect} effect\n * @returns {void}\n /\nexport function update_effect(effect) {\n\tvar flags = effect.f;\n\n\tif ((flags & DESTROYED) !== 0) {\n\t\treturn;\n\t}\n\n\tset_signal_status(effect, CLEAN);\n\n\tvar previous_effect = active_effect;\n\tvar was_updating_effect = is_updating_effect;\n\n\tactive_effect = effect;\n\tis_updating_effect = true;\n\n\tif (DEV) {\n\t\tvar previous_component_fn = dev_current_component_function;\n\t\tset_dev_current_component_function(effect.component_function);\n\t\tvar previous_stack = /* @type {any} / (dev_stack);\n\t\t// only block effects have a dev stack, keep the current one otherwise\n\t\tset_dev_stack(effect.dev_stack ?? dev_stack);\n\t}\n\n\ttry {\n\t\tif ((flags & (BLOCK_EFFECT \| MANAGED_EFFECT)) !== 0) {\n\t\t\tdestroy_block_effect_children(effect);\n\t\t} else {\n\t\t\tdestroy_effect_children(effect);\n\t\t}\n\n\t\texecute_effect_teardown(effect);\n\t\tvar teardown = update_reaction(effect);\n\t\teffect.teardown = typeof teardown === 'function' ? teardown : null;\n\t\teffect.wv = write_version;\n\n\t\t// In DEV, increment versions of any sources that were written to during the effect,\n\t\t// so that they are correctly marked as dirty when the effect re-runs\n\t\tif (DEV && tracing_mode_flag && (effect.f & DIRTY) !== 0 && effect.deps !== null) {\n\t\t\tfor (var dep of effect.deps) {\n\t\t\t\tif (dep.set_during_effect) {\n\t\t\t\t\tdep.wv = increment_write_version();\n\t\t\t\t\tdep.set_during_effect = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} finally {\n\t\tis_updating_effect = was_updating_effect;\n\t\tactive_effect = previous_effect;\n\n\t\tif (DEV) {\n\t\t\tset_dev_current_component_function(previous_component_fn);\n\t\t\tset_dev_stack(previous_stack);\n\t\t}\n\t}\n}\n\n/\n Returns a promise that resolves once any pending state changes have been applied.\n * @returns {Promise<void>}\n /\nexport async function tick() {\n\tif (async_mode_flag) {\n\t\treturn new Promise((f) => {\n\t\t\t// Race them against each other - in almost all cases requestAnimationFrame will fire first,\n\t\t\t// but e.g. in case the window is not focused or a view transition happens, requestAnimationFrame\n\t\t\t// will be delayed and setTimeout helps us resolve fast enough in that case\n\t\t\trequestAnimationFrame(() => f());\n\t\t\tsetTimeout(() => f());\n\t\t});\n\t}\n\n\tawait Promise.resolve();\n\n\t// By calling flushSync we guarantee that any pending state changes are applied after one tick.\n\t// TODO look into whether we can make flushing subsequent updates synchronously in the future.\n\tflushSync();\n}\n\n/\n Returns a promise that resolves once any state changes, and asynchronous work resulting from them,\n * have resolved and the DOM has been updated\n * @returns {Promise<void>}\n * @since 5.36\n /\nexport function settled() {\n\treturn Batch.ensure().settled();\n}\n\n/\n @template V\n * @param {Value<V>} signal\n * @returns {V}\n /\nexport function get(signal) {\n\tvar flags = signal.f;\n\tvar is_derived = (flags & DERIVED) !== 0;\n\n\tcaptured_signals?.add(signal);\n\n\t// Register the dependency on the current reaction signal.\n\tif (active_reaction !== null && !untracking) {\n\t\t// if we're in a derived that is being read inside an _async_ derived,\n\t\t// it's possible that the effect was already destroyed. In this case,\n\t\t// we don't add the dependency, because that would create a memory leak\n\t\tvar destroyed = active_effect !== null && (active_effect.f & DESTROYED) !== 0;\n\n\t\tif (!destroyed && (current_sources === null \|\| !includes.call(current_sources, signal))) {\n\t\t\tvar deps = active_reaction.deps;\n\n\t\t\tif ((active_reaction.f & REACTION_IS_UPDATING) !== 0) {\n\t\t\t\t// we're in the effect init/update cycle\n\t\t\t\tif (signal.rv < read_version) {\n\t\t\t\t\tsignal.rv = read_version;\n\n\t\t\t\t\t// If the signal is accessing the same dependencies in the same\n\t\t\t\t\t// order as it did last time, increment `skipped_deps`\n\t\t\t\t\t// rather than updating `new_deps`, which creates GC cost\n\t\t\t\t\tif (new_deps === null && deps !== null && deps[skipped_deps] === signal) {\n\t\t\t\t\t\tskipped_deps++;\n\t\t\t\t\t} else if (new_deps === null) {\n\t\t\t\t\t\tnew_deps = [signal];\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnew_deps.push(signal);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// We're adding a dependency outside the init/update cycle (i.e. after an `await`).\n\t\t\t\t// We have to deduplicate deps/reactions in this case or remove_reactions could\n\t\t\t\t// disconnect deps/reactions that are actually still in use (if skip_deps says\n\t\t\t\t// \"disconnect all after this index\" and some of the signals are also present in\n\t\t\t\t// list prior to the cutoff index, i.e. that should be kept).\n\t\t\t\tactive_reaction.deps ??= [];\n\t\t\t\tif (!includes.call(active_reaction.deps, signal)) {\n\t\t\t\t\tactive_reaction.deps.push(signal);\n\t\t\t\t}\n\n\t\t\t\tvar reactions = signal.reactions;\n\n\t\t\t\tif (reactions === null) {\n\t\t\t\t\tsignal.reactions = [active_reaction];\n\t\t\t\t} else if (!includes.call(reactions, active_reaction)) {\n\t\t\t\t\treactions.push(active_reaction);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (DEV) {\n\t\tif (\n\t\t\t!untracking &&\n\t\t\treactivity_loss_tracker &&\n\t\t\t!reactivity_loss_tracker.warned &&\n\t\t\t(reactivity_loss_tracker.effect.f & REACTION_IS_UPDATING) === 0 &&\n\t\t\t!reactivity_loss_tracker.effect_deps.has(signal)\n\t\t) {\n\t\t\treactivity_loss_tracker.warned = true;\n\n\t\t\tw.await_reactivity_loss(/* @type {string} / (signal.label));\n\n\t\t\tvar trace = get_error('traced at');\n\t\t\t// eslint-disable-next-line no-console\n\t\t\tif (trace) console.warn(trace);\n\t\t}\n\n\t\trecent_async_deriveds.delete(signal);\n\n\t\tif (\n\t\t\ttracing_mode_flag &&\n\t\t\t!untracking &&\n\t\t\ttracing_expressions !== null &&\n\t\t\tactive_reaction !== null &&\n\t\t\ttracing_expressions.reaction === active_reaction\n\t\t) {\n\t\t\t// Used when mapping state between special blocks like `each`\n\t\t\tif (signal.trace) {\n\t\t\t\tsignal.trace();\n\t\t\t} else {\n\t\t\t\ttrace = get_error('traced at');\n\n\t\t\t\tif (trace) {\n\t\t\t\t\tvar entry = tracing_expressions.entries.get(signal);\n\n\t\t\t\t\tif (entry === undefined) {\n\t\t\t\t\t\tentry = { traces: [] };\n\t\t\t\t\t\ttracing_expressions.entries.set(signal, entry);\n\t\t\t\t\t}\n\n\t\t\t\t\tvar last = entry.traces[entry.traces.length - 1];\n\n\t\t\t\t\t// traces can be duplicated, e.g. by `snapshot` invoking both\n\t\t\t\t\t// both `getOwnPropertyDescriptor` and `get` traps at once\n\t\t\t\t\tif (trace.stack !== last?.stack) {\n\t\t\t\t\t\tentry.traces.push(trace);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (is_destroying_effect && old_values.has(signal)) {\n\t\treturn old_values.get(signal);\n\t}\n\n\tif (is_derived) {\n\t\tvar derived = /* @type {Derived} / (signal);\n\n\t\tif (is_destroying_effect) {\n\t\t\tvar value = derived.v;\n\n\t\t\t// if the derived is dirty and has reactions, or depends on the values that just changed, re-execute\n\t\t\t// (a derived can be maybe_dirty due to the effect destroy removing its last reaction)\n\t\t\tif (\n\t\t\t\t((derived.f & CLEAN) === 0 && derived.reactions !== null) \|\|\n\t\t\t\tdepends_on_old_values(derived)\n\t\t\t) {\n\t\t\t\tvalue = execute_derived(derived);\n\t\t\t}\n\n\t\t\told_values.set(derived, value);\n\n\t\t\treturn value;\n\t\t}\n\n\t\t// connect disconnected deriveds if we are reading them inside an effect,\n\t\t// or inside another derived that is already connected\n\t\tvar should_connect =\n\t\t\t(derived.f & CONNECTED) === 0 &&\n\t\t\t!untracking &&\n\t\t\tactive_reaction !== null &&\n\t\t\t(is_updating_effect \|\| (active_reaction.f & CONNECTED) !== 0);\n\n\t\tvar is_new = (derived.f & REACTION_RAN) === 0;\n\n\t\tif (is_dirty(derived)) {\n\t\t\tif (should_connect) {\n\t\t\t\t// set the flag before `update_derived`, so that the derived\n\t\t\t\t// is added as a reaction to its dependencies\n\t\t\t\tderived.f \|= CONNECTED;\n\t\t\t}\n\n\t\t\tupdate_derived(derived);\n\t\t}\n\n\t\tif (should_connect && !is_new) {\n\t\t\tunfreeze_derived_effects(derived);\n\t\t\treconnect(derived);\n\t\t}\n\t}\n\n\tif (batch_values?.has(signal)) {\n\t\treturn batch_values.get(signal);\n\t}\n\n\tif ((signal.f & ERROR_VALUE) !== 0) {\n\t\tthrow signal.v;\n\t}\n\n\treturn signal.v;\n}\n\n/\n (Re)connect a disconnected derived, so that it is notified\n * of changes in `mark_reactions`\n * @param {Derived} derived\n /\nfunction reconnect(derived) {\n\tderived.f \|= CONNECTED;\n\n\tif (derived.deps === null) return;\n\n\tfor (const dep of derived.deps) {\n\t\t(dep.reactions ??= []).push(derived);\n\n\t\tif ((dep.f & DERIVED) !== 0 && (dep.f & CONNECTED) === 0) {\n\t\t\tunfreeze_derived_effects(/* @type {Derived} / (dep));\n\t\t\treconnect(/* @type {Derived} / (dep));\n\t\t}\n\t}\n}\n\n/* @param {Derived} derived /\nfunction depends_on_old_values(derived) {\n\tif (derived.v === UNINITIALIZED) return true; // we don't know, so assume the worst\n\tif (derived.deps === null) return false;\n\n\tfor (const dep of derived.deps) {\n\t\tif (old_values.has(dep)) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif ((dep.f & DERIVED) !== 0 && depends_on_old_values(/* @type {Derived} / (dep))) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n/\n Like `get`, but checks for `undefined`. Used for `var` declarations because they can be accessed before being declared\n * @template V\n * @param {Value<V> \| undefined} signal\n * @returns {V \| undefined}\n /\nexport function safe_get(signal) {\n\treturn signal && get(signal);\n}\n\n/\n When used inside a [`$derived`](https://svelte.dev/docs/svelte/$derived) or [`$effect`](https://svelte.dev/docs/svelte/$effect),\n * any state read inside `fn` will not be treated as a dependency.\n \n ```ts\n * $effect(() => {\n * // this will run when `data` changes, but not when `time` changes\n * save(data, {\n * timestamp: untrack(() => time)\n * });\n * });\n * ```\n * @template T\n * @param {() => T} fn\n * @returns {T}\n /\nexport function untrack(fn) {\n\tvar previous_untracking = untracking;\n\ttry {\n\t\tuntracking = true;\n\t\treturn fn();\n\t} finally {\n\t\tuntracking = previous_untracking;\n\t}\n}\n\n/\n Possibly traverse an object and read all its properties so that they're all reactive in case this is `$state`.\n * Does only check first level of an object for performance reasons (heuristic should be good for 99% of all cases).\n * @param {any} value\n * @returns {void}\n /\nexport function deep_read_state(value) {\n\tif (typeof value !== 'object' \|\| !value \|\| value instanceof EventTarget) {\n\t\treturn;\n\t}\n\n\tif (STATE_SYMBOL in value) {\n\t\tdeep_read(value);\n\t} else if (!Array.isArray(value)) {\n\t\tfor (let key in value) {\n\t\t\tconst prop = value[key];\n\t\t\tif (typeof prop === 'object' && prop && STATE_SYMBOL in prop) {\n\t\t\t\tdeep_read(prop);\n\t\t\t}\n\t\t}\n\t}\n}\n\n/\n Deeply traverse an object and read all its properties\n * so that they're all reactive in case this is `$state`\n * @param {any} value\n * @param {Set<any>} visited\n * @returns {void}\n /\nexport function deep_read(value, visited = new Set()) {\n\tif (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t// We don't want to traverse DOM elements\n\t\t!(value instanceof EventTarget) &&\n\t\t!visited.has(value)\n\t) {\n\t\tvisited.add(value);\n\t\t// When working with a possible SvelteDate, this\n\t\t// will ensure we capture changes to it.\n\t\tif (value instanceof Date) {\n\t\t\tvalue.getTime();\n\t\t}\n\t\tfor (let key in value) {\n\t\t\ttry {\n\t\t\t\tdeep_read(value[key], visited);\n\t\t\t} catch (e) {\n\t\t\t\t// continue\n\t\t\t}\n\t\t}\n\t\tconst proto = get_prototype_of(value);\n\t\tif (\n\t\t\tproto !== Object.prototype &&\n\t\t\tproto !== Array.prototype &&\n\t\t\tproto !== Map.prototype &&\n\t\t\tproto !== Set.prototype &&\n\t\t\tproto !== Date.prototype\n\t\t) {\n\t\t\tconst descriptors = get_descriptors(proto);\n\t\t\tfor (let key in descriptors) {\n\t\t\t\tconst get = descriptors[key].get;\n\t\t\t\tif (get) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tget.call(value);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\t// continue\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n","// red-ui's light/dark choice is the DS Color Scheme axis (DS ADR 0008):\n// `data-color-scheme` carries it, while `data-theme` names the DS Theme\n// direction, which for red-ui is always \"application\".\nexport type Theme = \"light\" \| \"dark\";\n\nexport const DS_THEME = \"application\";\n\n/* Put red-ui's appearance on an element in the DS's attribute vocabulary. /\nexport function applyAppearance(el: HTMLElement, scheme: Theme) {\n el.dataset.theme = DS_THEME;\n el.dataset.density \|\|= \"compact\";\n el.dataset.colorScheme = scheme;\n}\n\n/* The Color Scheme an element (default: the document root) carries. /\nexport function colorSchemeOf(el?: HTMLElement \| null): Theme {\n const target =\n el ?? (typeof document !== \"undefined\" ? document.documentElement : null);\n return target?.dataset.colorScheme === \"dark\" ? \"dark\" : \"light\";\n}\n\nconst STORAGE_KEY = \"red-ui-theme\";\nconst DEFAULT: Theme = \"light\";\n\ninterface ThemeInitOptions {\n target?: HTMLElement \| null;\n persist?: boolean;\n initial?: Theme;\n}\n\nfunction read(\n target: HTMLElement \| null,\n persist: boolean,\n initial?: Theme\n): Theme {\n const scoped = target?.dataset.colorScheme;\n if (scoped === \"dark\" \|\| scoped === \"light\") return scoped;\n if (!persist) return initial ?? DEFAULT;\n if (typeof localStorage === \"undefined\") return initial ?? DEFAULT;\n const v = localStorage.getItem(STORAGE_KEY);\n return v === \"dark\" \|\| v === \"light\" ? v : (initial ?? DEFAULT);\n}\n\nfunction apply(t: Theme, target: HTMLElement \| null) {\n if (target) {\n applyAppearance(target, t);\n return;\n }\n if (typeof document !== \"undefined\")\n applyAppearance(document.documentElement, t);\n}\n\nfunction persist(t: Theme, enabled: boolean) {\n if (!enabled) return;\n if (typeof localStorage === \"undefined\") return;\n localStorage.setItem(STORAGE_KEY, t);\n}\n\nclass ThemeStore {\n current = $state<Theme>(DEFAULT);\n target: HTMLElement \| null = null;\n persistTheme = true;\n\n init(opts: ThemeInitOptions = {}) {\n this.target = opts.target ?? null;\n this.persistTheme = opts.persist ?? true;\n this.current = read(this.target, this.persistTheme, opts.initial);\n apply(this.current, this.target);\n }\n\n set(t: Theme) {\n this.current = t;\n apply(t, this.target);\n persist(t, this.persistTheme);\n }\n\n toggle() {\n this.set(this.current === \"dark\" ? \"light\" : \"dark\");\n }\n}\n\nexport const theme = new ThemeStore();\n","// Single source of truth for \"what version am I\" across the Web/PWA, the\n// Embeddable Lib, and the Tauri desktop webview (which all run this same\n// bundle). Mirrors ../red-skills/src/packages/build-info: the version is\n// injected at build time by Vite `define` (see vite.config.ts /\n// vite.embed.config.ts) from `packages/ui/package.json` — overridable by the\n// `RED_BUILD_VERSION` env the release CI sets from the git tag. Falls back to\n// `0.0.0-dev` for an un-stamped local dev build.\n\ndeclare const __RED_UI_VERSION__: string \| undefined;\ndeclare const __RED_UI_GIT_SHA__: string \| undefined;\ndeclare const __RED_UI_BUILD_TIME__: string \| undefined;\n\nexport interface BuildInfo {\n version: string;\n gitSha: string;\n buildTime: string;\n}\n\nfunction injected(read: () => string \| undefined): string \| undefined {\n try {\n const v = read();\n return typeof v === \"string\" && v.length > 0 ? v : undefined;\n } catch {\n return undefined;\n }\n}\n\nfunction stripTagPrefix(v: string): string {\n return v.startsWith(\"v\") ? v.slice(1) : v;\n}\n\nexport function readBuildInfo(): BuildInfo {\n return {\n version: stripTagPrefix(injected(() => __RED_UI_VERSION__) ?? \"0.0.0-dev\"),\n gitSha: injected(() => __RED_UI_GIT_SHA__) ?? \"unknown\",\n buildTime: injected(() => __RED_UI_BUILD_TIME__) ?? \"unknown\",\n };\n}\n\n/* The resolved app version, e.g. `0.1.1` (or `0.0.0-dev` un-stamped). /\nexport const RED_UI_VERSION: string = readBuildInfo().version;\n","// Server-version capability negotiation (#22). One UI build talks to many\n// reddb server versions: rather than assume every endpoint exists, the UI\n// resolves a capability map for the active connection and HIDES controls the\n// server can't honour (absent, not greyed — the permission-aware rule).\n//\n// Resolution prefers a STABLE server signal (`GET /capabilities`) over\n// inferring from 404s, and FAILS SAFE — any uncertainty resolves to \"not\n// supported\" so a newer UI never assumes a capability a server lacks.\n\n/* The feature flags the UI gates controls on. Extend as features are added. /\nexport interface ServerCapabilities {\n /* Version control (commits / diffs) — `/repo/commits`, `/collections/:n/vcs`. /\n vcs: boolean\n /* Cluster topology + status — `/cluster/status`. /\n clusterStatus: boolean\n /* Per-collection metadata route — `GET /collections/:name`. /\n collectionMetadata: boolean\n /* Server-sent change stream — `/changes/stream`. /\n cdcStream: boolean\n}\n\n/* Fail-safe baseline: nothing is assumed present until proven. /\nexport const EMPTY_SERVER_CAPABILITIES: ServerCapabilities = Object.freeze({\n vcs: false,\n clusterStatus: false,\n collectionMetadata: false,\n cdcStream: false,\n})\n\n/* Shape of the optional stable `/capabilities` signal. /\nexport interface RawCapabilities {\n ok?: boolean\n /* Flat feature names, e.g. [\"vcs\",\"cluster_status\"]. /\n features?: string[]\n /* Or an explicit flag map, e.g. { vcs: true }. /\n capabilities?: Record<string, boolean>\n}\n\n// Server feature names → our capability keys. Several aliases per key so we\n// tolerate naming drift across server versions without a UI release.\nconst FEATURE_ALIASES: Record<string, keyof ServerCapabilities> = {\n vcs: 'vcs',\n versioning: 'vcs',\n version_control: 'vcs',\n cluster: 'clusterStatus',\n cluster_status: 'clusterStatus',\n collection_metadata: 'collectionMetadata',\n collections_metadata: 'collectionMetadata',\n cdc: 'cdcStream',\n changes_stream: 'cdcStream',\n cdc_stream: 'cdcStream',\n}\n\n/\n Build a capability map from the stable `/capabilities` signal. Unknown\n * feature names are ignored (a server advertising features this UI version\n * doesn't model is harmless); known ones flip their flag on. The explicit\n * `capabilities` map, when present, takes precedence over the `features` list.\n /\nexport function capabilitiesFromSignal(raw: RawCapabilities): ServerCapabilities {\n const out: ServerCapabilities = { ...EMPTY_SERVER_CAPABILITIES }\n for (const name of raw.features ?? []) {\n const key = FEATURE_ALIASES[name?.toLowerCase?.() ?? '']\n if (key) out[key] = true\n }\n for (const [name, on] of Object.entries(raw.capabilities ?? {})) {\n const key = FEATURE_ALIASES[name.toLowerCase()]\n if (key) out[key] = on === true\n }\n return out\n}\n","// Real HTTP client for a running reddb instance.\n// Endpoints discovered from reddb/crates/reddb-server/src/server/routing.rs.\n\nimport {\n capabilitiesFromSignal,\n EMPTY_SERVER_CAPABILITIES,\n type RawCapabilities,\n type ServerCapabilities,\n} from \"./server-capabilities\";\nimport type {\n PermissionCheck,\n PermissionDecision,\n PermissionResource,\n} from \"../permission-gate\";\nimport type { ClusterStatus, ReplicationStatus } from \"./cluster-status\";\nimport type { MetricDescriptor, PromResponse } from \"./analytics\";\nimport type { AskResponse, AskOptions } from \"./ask\";\nimport { devConsole, sanitizePayload } from \"./dev-console\";\n\nexport interface QueryRow {\n values: Record<string, unknown>;\n edges?: Record<string, unknown>;\n nodes?: Record<string, unknown>;\n paths?: unknown[];\n vector_results?: Array<{\n id?: number \| string;\n collection?: string;\n distance?: number;\n vector?: number[];\n metadata?: Record<string, unknown>;\n linked_node?: string;\n linked_row?: [string, number];\n }>;\n}\n\nexport interface QueryResult {\n ok: boolean;\n query: string;\n capability?: string;\n engine?: string;\n mode?: string;\n record_count: number;\n result: { columns: string[]; records: QueryRow[] };\n error?: string;\n /* True when this result was assembled from the NDJSON streaming endpoint\n * (`POST /query/stream`) rather than the buffered `POST /query`. /\n streamed?: boolean;\n /* True when streaming stopped at `maxRows` and more rows remained on the\n * server (the cursor was cancelled). Surfaced so the UI never silently\n * drops rows. /\n truncated?: boolean;\n}\n\n/* Result of collecting a read-only SELECT over the NDJSON streaming endpoint. /\nexport interface StreamedQueryResult {\n columns: string[];\n schemaFingerprint?: string;\n rows: Array<Record<string, unknown>>;\n rowCount: number;\n /* Hit the `maxRows` cap with more rows still on the server. /\n truncated: boolean;\n /* Opaque resume token from the `cursor` frame, if one was emitted. /\n cursor?: string;\n}\n\nexport interface CollectionMetadata {\n ok?: boolean;\n name: string;\n kind?: string;\n capability?: string;\n capabilities?: string[];\n schema?: Record<string, unknown>;\n indexes?: Array<Record<string, unknown>>;\n retention?: Record<string, unknown>;\n tenant?: string;\n actions?: Record<string, boolean \| { allowed: boolean; reason?: string }>;\n}\n\nexport interface Stats {\n active_connections: number;\n idle_connections: number;\n started_at_unix_ms: number;\n store: {\n collection_count: number;\n cross_ref_count: number;\n total_entities: number;\n total_memory_bytes: number;\n };\n system: {\n arch: string;\n cpu_cores: number;\n hostname: string;\n os: string;\n pid: number;\n total_memory_bytes: number;\n available_memory_bytes: number;\n };\n kv?: {\n gets: number;\n puts: number;\n deletes: number;\n cas_success: number;\n cas_conflict: number;\n };\n /\n Set by the server when the store is open read-only — e.g. an embedded file\n * already held by an active writer (lock detection is owned by reddb). Absent\n * when the server reports no read-only signal, in which case the UI shows no\n * badge and behaves normally (#23). `read_only_reason` is an optional\n * human-facing explanation for the badge tooltip.\n /\n read_only?: boolean;\n read_only_reason?: string;\n}\n\nexport interface Whoami {\n ok: boolean;\n authenticated: boolean;\n username: string;\n role: string;\n note?: string;\n}\n\nexport interface RedClientOptions {\n headers?: HeadersInit;\n fetch?: typeof fetch;\n}\n\nexport interface AuthUser {\n username: string;\n role?: string;\n created_at?: number;\n last_active?: number;\n mfa?: boolean;\n}\n\nexport interface AuthTenant {\n id?: string;\n name?: string;\n slug?: string;\n role?: string;\n grants?: string[];\n created_at?: number;\n}\n\nexport interface AuthPolicy {\n id?: string;\n name?: string;\n tenant?: string;\n principal?: string;\n resource?: string;\n action?: string;\n effect?: \"allow\" \| \"deny\" \| string;\n description?: string;\n created_at?: number;\n}\n\ninterface AuthCanResponse {\n ok?: boolean;\n results?: Array<Partial<PermissionDecision>>;\n error?: string;\n}\n\nexport interface ChangeEvent {\n lsn: number;\n timestamp: number;\n collection: string;\n kind: string;\n operation: \"insert\" \| \"update\" \| \"delete\" \| \"refresh\";\n rid?: number;\n}\n\nexport interface VcsEnvelope<T> {\n ok: boolean;\n result: T;\n error?: string;\n}\n\nexport interface CollectionVcsState {\n collection: string;\n versioned: boolean;\n}\n\nexport interface VcsAuthor {\n name: string;\n email: string;\n}\n\nexport interface VcsCommit {\n hash: string;\n root_xid?: number;\n parents: string[];\n height?: number;\n author?: VcsAuthor;\n committer?: VcsAuthor;\n message: string;\n timestamp_ms: number;\n signature?: string;\n}\n\nexport interface VcsDiffEntry {\n collection: string;\n entity_id: string;\n change: \"added\" \| \"removed\" \| \"modified\" \| string;\n before?: unknown;\n after?: unknown;\n}\n\nexport interface VcsDiff {\n from: string;\n to: string;\n added: number;\n removed: number;\n modified: number;\n entries: VcsDiffEntry[];\n}\n\nconst unsupportedCollectionMetadata = new Set<string>();\nconst collectionMetadataSupportProbe = new Map<string, Promise<boolean>>();\n\nfunction isUnsupportedCollectionMetadataRoute(e: unknown): boolean {\n const message = e instanceof Error ? e.message : String(e);\n return message.includes(\"route not found: GET /collections/\");\n}\n\n/* Missing or unimplemented discovery routes may use compatibility probes. /\nfunction isUnsupportedRoute(e: unknown): boolean {\n const message = e instanceof Error ? e.message : String(e);\n return / → (404\|405\|501)\\b/.test(message);\n}\n\nfunction unsupportedCollectionMetadataError(baseUrl: string): Error {\n return new Error(\n `GET /collections/:name unsupported by this reddb server (${baseUrl})`\n );\n}\n\nfunction isPermissionResource(value: unknown): value is PermissionResource {\n if (!value \|\| typeof value !== \"object\") return false;\n const candidate = value as Partial<PermissionResource>;\n return (\n typeof candidate.kind === \"string\" &&\n candidate.kind.length > 0 &&\n typeof candidate.name === \"string\" &&\n candidate.name.length > 0 &&\n (candidate.tenant === undefined \|\| typeof candidate.tenant === \"string\")\n );\n}\n\n/* One NDJSON frame from `POST /query/stream`. Discriminated by its single key. /\ntype NdjsonFrame =\n \| {\n descriptor: {\n columns: Array<string \| { name: string }>;\n schema_fingerprint?: string;\n };\n }\n \| { cursor: { token: string; snapshot_lsn?: number; resumable?: boolean } }\n \| { row: Record<string, unknown> }\n \| { end: { row_count?: number } }\n \| { cancelled: Record<string, unknown> };\n\n/\n Parse a chunked `application/x-ndjson` body into one frame per line. Buffers\n * across chunk boundaries (a JSON object split over two TCP reads is emitted\n * exactly once, in order) and flushes a trailing newline-less line at EOF.\n /\nasync function parseNdjsonFrames(\n body: ReadableStream<Uint8Array>\n): AsyncGenerator<NdjsonFrame> {\n const reader = body.getReader();\n const decoder = new TextDecoder();\n let buf = \"\";\n try {\n for (;;) {\n const { done, value } = await reader.read();\n if (done) break;\n buf += decoder.decode(value, { stream: true });\n let nl: number;\n while ((nl = buf.indexOf(\"\\n\")) !== -1) {\n const line = buf.slice(0, nl).trim();\n buf = buf.slice(nl + 1);\n if (line) yield JSON.parse(line) as NdjsonFrame;\n }\n }\n const tail = buf.trim();\n if (tail) yield JSON.parse(tail) as NdjsonFrame;\n } finally {\n reader.releaseLock();\n }\n}\n\nconst SELECT_RE = /^\\sselect\\b/i;\n\n/\n Pull a row count out of a parsed response for the developer console (#128).\n * Recognises the `/query` envelope (`record_count`, else the length of\n * `result.records`) and a bare array; returns `undefined` when the shape\n * carries no notion of rows. Purely structural — never throws.\n /\nexport function extractRowCount(data: unknown): number \| undefined {\n if (Array.isArray(data)) return data.length;\n if (data && typeof data === \"object\") {\n const d = data as {\n record_count?: unknown;\n result?: { records?: unknown };\n };\n if (typeof d.record_count === \"number\") return d.record_count;\n if (Array.isArray(d.result?.records)) return d.result.records.length;\n }\n return undefined;\n}\n\n/\n Extract a human-readable message from any thrown value. Tauri's `invoke` and\n * the HTTP plugin reject with plain strings or bare objects (not `Error`), so\n * `(e as Error).message` is often `undefined` — this never returns that.\n /\nexport function errorText(e: unknown): string {\n if (e instanceof Error) return e.message \|\| String(e);\n if (typeof e === \"string\") return e;\n if (e && typeof e === \"object\") {\n const m = (e as { message?: unknown }).message;\n if (typeof m === \"string\" && m) return m;\n try {\n const s = JSON.stringify(e);\n if (s && s !== \"{}\") return s;\n } catch {\n / circular — fall through /\n }\n }\n return String(e);\n}\n\n/\n Run a query, preferring the bounded-memory NDJSON stream for a plain SELECT\n * and falling back to the buffered `POST /query` for everything else — and for\n * any streaming failure (network, a non-SELECT 400, or an older server with no\n * `/query/stream` route returning 404). The fallback makes this strictly safe:\n * behaviour is identical to {@link RedClient.query} unless the server supports\n * streaming AND the statement is a SELECT, in which case the server streams\n * rows instead of buffering the whole result set.\n /\nexport async function runQueryPreferStream(\n client: Pick<RedClient, \"query\" \| \"queryStreamCollect\">,\n sql: string,\n opts: { maxRows?: number; signal?: AbortSignal } = {}\n): Promise<QueryResult> {\n const queryOpts = opts.signal ? { signal: opts.signal } : undefined;\n if (!SELECT_RE.test(sql))\n return queryOpts ? client.query(sql, queryOpts) : client.query(sql);\n try {\n const s = await client.queryStreamCollect(sql, opts);\n return {\n ok: true,\n query: sql,\n record_count: s.rowCount,\n result: {\n columns: s.columns,\n records: s.rows.map((row) =>\n row.values &&\n typeof row.values === \"object\" &&\n (\"nodes\" in row \|\|\n \"edges\" in row \|\|\n \"paths\" in row \|\|\n \"vector_results\" in row)\n ? (row as unknown as QueryRow)\n : { values: row }\n ),\n },\n streamed: true,\n truncated: s.truncated,\n };\n } catch (e) {\n if (\n opts.signal?.aborted \|\|\n (e instanceof Error && e.name === \"AbortError\")\n ) {\n throw e;\n }\n return queryOpts ? client.query(sql, queryOpts) : client.query(sql);\n }\n}\n\nexport class RedClient {\n readonly baseUrl: string;\n private readonly headers: HeadersInit \| undefined;\n private readonly fetcher: typeof fetch;\n\n constructor(baseUrl: string, opts: RedClientOptions = {}) {\n this.baseUrl = baseUrl.replace(/\\/$/, \"\");\n this.headers = opts.headers;\n this.fetcher = opts.fetch ?? globalThis.fetch.bind(globalThis);\n }\n\n private async json<T>(path: string, init?: RequestInit): Promise<T> {\n const url = `${this.baseUrl}${path}`;\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n };\n Object.assign(headers, this.headers as Record<string, string> \| undefined);\n Object.assign(headers, init?.headers as Record<string, string> \| undefined);\n\n // Developer console instrumentation (#128). Every HTTP call the client\n // makes is timed and logged from this single seam, so every Surface is\n // covered without touching each caller. The request body is sanitized\n // before it lands in an entry — a copy action can never leak a secret.\n const verb = init?.method ?? \"GET\";\n const startedAt = Date.now();\n const start = performance.now();\n const payload = sanitizePayload(init?.body);\n const elapsed = () => Math.round(performance.now() - start);\n\n let res: Response;\n try {\n res = await this.fetcher(url, { ...init, headers });\n } catch (e) {\n devConsole.record({\n kind: \"http\",\n verb,\n target: path,\n startedAt,\n durationMs: elapsed(),\n ok: false,\n payload,\n error: errorText(e),\n });\n throw e;\n }\n\n if (!res.ok) {\n const body = await res.text().catch(() => \"\");\n const message = `${verb} ${path} → ${res.status} ${body.slice(0, 200)}`;\n devConsole.record({\n kind: \"http\",\n verb,\n target: path,\n startedAt,\n durationMs: elapsed(),\n ok: false,\n status: res.status,\n payload,\n error: message,\n });\n throw new Error(message);\n }\n\n const data = (await res.json()) as T;\n const rowCount = extractRowCount(data);\n devConsole.record({\n // A response carrying a row count is a query round-trip; everything else\n // is a plain HTTP call. This is how `/query` entries mark themselves.\n kind: rowCount === undefined ? \"http\" : \"query\",\n verb,\n target: path,\n startedAt,\n durationMs: elapsed(),\n ok: true,\n status: res.status,\n ...(rowCount === undefined ? {} : { rowCount }),\n payload,\n });\n return data;\n }\n\n /* Exchange credentials for a session token. Neither value is persisted. /\n async login(username: string, password: string): Promise<string> {\n const endpoint = new URL(this.baseUrl);\n if (\n endpoint.username \|\|\n endpoint.password \|\|\n endpoint.search \|\|\n endpoint.hash \|\|\n (endpoint.protocol !== \"https:\" &&\n !(\n endpoint.protocol === \"http:\" &&\n [\"localhost\", \"127.0.0.1\", \"[::1]\"].includes(endpoint.hostname)\n ))\n ) {\n throw new Error(\"Use HTTPS to sign in to a remote database.\");\n }\n // Bypass query instrumentation: credentials and the session response must\n // never enter the developer console, including an authentication failure.\n const response = await this.fetcher(`${this.baseUrl}/auth/login`, {\n method: \"POST\",\n headers: { \"Content-Type\": \"application/json\" },\n credentials: \"omit\",\n redirect: \"error\",\n body: JSON.stringify({ username, password }),\n });\n if (!response.ok)\n throw new Error(\n \"Database sign-in failed. Check your credentials and try again.\"\n );\n const session = await response.json();\n if (\n session.ok !== true \|\|\n typeof session.token !== \"string\" \|\|\n !session.token\n ) {\n throw new Error(\"The database did not return a session token.\");\n }\n return session.token;\n }\n\n async stats(): Promise<Stats> {\n return this.json<Stats>(\"/stats\");\n }\n\n async clusterStatus(): Promise<ClusterStatus> {\n return this.json<ClusterStatus>(\"/cluster/status\");\n }\n\n /\n List registered metric descriptors from the typed `red.metrics`\n * projection (reddb #747). One row per `CREATE METRIC`, carrying the\n * `kind` (counter\|gauge\|histogram\|ratio\|derived) the UI uses to auto-select\n * a chart. Returns `[]` when the server has no analytics surface.\n /\n async metricsCatalog(): Promise<MetricDescriptor[]> {\n const r = await this.query(\n \"SELECT path, kind, role, unit, supports_prometheus_query, created_at_ms FROM red.metrics\"\n );\n return r.result.records.map((rec) => {\n const v = rec.values;\n return {\n path: String(v.path ?? \"\"),\n kind: v.kind as MetricDescriptor[\"kind\"],\n role: String(v.role ?? \"metric\"),\n unit: (v.unit as string \| null) ?? null,\n supports_prometheus_query: v.supports_prometheus_query !== false,\n created_at_ms:\n typeof v.created_at_ms === \"number\" ? v.created_at_ms : undefined,\n } satisfies MetricDescriptor;\n });\n }\n\n /\n Prometheus instant query (`GET /api/v1/query`). Returns the raw\n * Prometheus-shaped envelope; callers normalise with `parsePromVector`.\n /\n async promQuery(query: string, time?: number): Promise<PromResponse> {\n const qs = new URLSearchParams({ query });\n if (time !== undefined) qs.set(\"time\", String(time));\n return this.json<PromResponse>(`/api/v1/query?${qs}`);\n }\n\n /\n Prometheus range query (`GET /api/v1/query_range`). `start`/`end` are unix\n * seconds, `step` is the resolution in seconds. Normalise with\n * `parsePromMatrix`.\n /\n async promQueryRange(\n query: string,\n start: number,\n end: number,\n step: number\n ): Promise<PromResponse> {\n const qs = new URLSearchParams({\n query,\n start: String(start),\n end: String(end),\n step: String(step),\n });\n return this.json<PromResponse>(`/api/v1/query_range?${qs}`);\n }\n\n async ping(): Promise<\n { ok: true; rtt_ms: number } \| { ok: false; error: string }\n > {\n const start = performance.now();\n try {\n await this.json(\"/stats\");\n return { ok: true, rtt_ms: Math.round(performance.now() - start) };\n } catch (e) {\n return { ok: false, error: errorText(e) };\n }\n }\n\n /\n Resolve the server's capability map (#22). Prefers the stable\n * `/capabilities` signal; when that route is absent or returns structured\n * discovery without UI feature flags, infers from lightweight, side-effect-free\n * GET probes. Compatibility follows working APIs, not the server version.\n * Other failures (network, authentication, unexpected HTTP status) fail safe\n * to the empty map, so the UI hides controls\n * rather than showing ones the server can't honour.\n /\n async capabilities(): Promise<ServerCapabilities> {\n try {\n const raw = await this.json<RawCapabilities>(\"/capabilities\");\n if (\n !raw \|\|\n typeof raw !== \"object\" \|\|\n Array.isArray(raw) \|\|\n raw.ok === false\n )\n return { ...EMPTY_SERVER_CAPABILITIES };\n // A flat declaration is authoritative, including explicit false/empty\n // flags. Structured discovery reports build/deployment state instead;\n // prove optional UI routes with read-only probes before enabling them.\n if (\"features\" in raw \|\| \"capabilities\" in raw)\n return capabilitiesFromSignal(raw);\n } catch (e) {\n // Only an absent/unimplemented route falls through; anything else (a\n // flaky network, an auth wall, a 5xx) hides everything.\n if (!isUnsupportedRoute(e)) return { ...EMPTY_SERVER_CAPABILITIES };\n }\n const [vcs, clusterStatus] = await Promise.all([\n this.probeGet(\"/repo/commits?limit=1\"),\n this.probeGet(\"/cluster/status\"),\n ]);\n return { ...EMPTY_SERVER_CAPABILITIES, vcs, clusterStatus };\n }\n\n /* True iff a GET to `path` succeeds; any failure (404/auth/5xx/network) is\n * treated as unsupported — the fail-safe-to-hide rule of #22. /\n private async probeGet(path: string): Promise<boolean> {\n try {\n await this.json(path);\n return true;\n } catch {\n return false;\n }\n }\n\n async collections(): Promise<string[]> {\n const r = await this.json<{ collections: string[] }>(\"/collections\");\n return r.collections;\n }\n\n async collection(name: string): Promise<CollectionMetadata> {\n if (unsupportedCollectionMetadata.has(this.baseUrl)) {\n throw unsupportedCollectionMetadataError(this.baseUrl);\n }\n\n const path = `/collections/${encodeURIComponent(name)}`;\n const inFlightProbe = collectionMetadataSupportProbe.get(this.baseUrl);\n if (inFlightProbe) {\n const supported = await inFlightProbe;\n if (!supported) throw unsupportedCollectionMetadataError(this.baseUrl);\n return this.json<CollectionMetadata>(path);\n }\n\n let resolveProbe: (supported: boolean) => void;\n const probe = new Promise<boolean>((resolve) => {\n resolveProbe = resolve;\n });\n collectionMetadataSupportProbe.set(this.baseUrl, probe);\n\n try {\n const metadata = await this.json<CollectionMetadata>(path);\n resolveProbe!(true);\n return metadata;\n } catch (e) {\n if (isUnsupportedCollectionMetadataRoute(e)) {\n unsupportedCollectionMetadata.add(this.baseUrl);\n resolveProbe!(false);\n } else {\n resolveProbe!(true);\n }\n throw e;\n } finally {\n collectionMetadataSupportProbe.delete(this.baseUrl);\n }\n }\n\n async createCollection(name: string): Promise<void> {\n await this.json(\"/collections\", {\n method: \"POST\",\n body: JSON.stringify({ name }),\n });\n }\n\n async insertDocument(\n collection: string,\n doc: Record<string, unknown>\n ): Promise<{ id: number }> {\n return this.json<{ id: number }>(\n `/collections/${encodeURIComponent(collection)}/documents`,\n {\n method: \"POST\",\n body: JSON.stringify(doc),\n }\n );\n }\n\n async query(\n query: string,\n opts: { signal?: AbortSignal } = {}\n ): Promise<QueryResult> {\n return this.json<QueryResult>(\"/query\", {\n method: \"POST\",\n body: JSON.stringify({ query }),\n signal: opts.signal,\n });\n }\n\n /\n Stream a read-only SELECT through `POST /query/stream` (NDJSON, chunked).\n * The server emits rows through a bounded-memory channel — it never buffers\n * the whole result — and we collect up to `maxRows` (default 10 000) before\n * cancelling the server cursor. The NDJSON frame order is fixed\n * (`descriptor` → `cursor` → `row`* → `end`\|`cancelled`), verified against\n * ../reddb/docs/api/query-streaming.md.\n \n Throws for a non-SELECT (server `400 stream_unsupported_statement`) and for\n * an absent route on an older server (`404`) — callers fall back to\n * {@link query}. Browser-reachable: this is `fetch` + `ReadableStream`, not\n * `EventSource` (the endpoint is POST-based).\n /\n async queryStreamCollect(\n query: string,\n opts: { maxRows?: number; signal?: AbortSignal } = {}\n ): Promise<StreamedQueryResult> {\n const maxRows = opts.maxRows ?? 10_000;\n const headers: Record<string, string> = {\n \"Content-Type\": \"application/json\",\n Accept: \"application/x-ndjson\",\n };\n Object.assign(headers, this.headers as Record<string, string> \| undefined);\n\n // Developer console instrumentation (#128). The streaming endpoint skips\n // `json()`, so it logs its own query round-trip here (verb `POST`, target\n // `/query/stream`) with the collected row count.\n const startedAt = Date.now();\n const start = performance.now();\n const body = JSON.stringify({ query });\n const payload = sanitizePayload(body);\n const elapsed = () => Math.round(performance.now() - start);\n\n let res: Response;\n try {\n res = await this.fetcher(`${this.baseUrl}/query/stream`, {\n method: \"POST\",\n headers,\n body,\n signal: opts.signal,\n });\n } catch (e) {\n devConsole.record({\n kind: \"query\",\n verb: \"POST\",\n target: \"/query/stream\",\n startedAt,\n durationMs: elapsed(),\n ok: false,\n payload,\n error: errorText(e),\n });\n throw e;\n }\n if (!res.ok \|\| !res.body) {\n const errBody = res.body ? await res.text().catch(() => \"\") : \"\";\n const message = `POST /query/stream → ${res.status} ${errBody.slice(0, 200)}`;\n devConsole.record({\n kind: \"query\",\n verb: \"POST\",\n target: \"/query/stream\",\n startedAt,\n durationMs: elapsed(),\n ok: false,\n status: res.status,\n payload,\n error: message,\n });\n throw new Error(message);\n }\n\n const out: StreamedQueryResult = {\n columns: [],\n rows: [],\n rowCount: 0,\n truncated: false,\n };\n\n for await (const frame of parseNdjsonFrames(res.body)) {\n if (\"descriptor\" in frame) {\n out.columns = (frame.descriptor.columns ?? []).map((column) =>\n typeof column === \"string\" ? column : column.name\n );\n out.schemaFingerprint = frame.descriptor.schema_fingerprint;\n } else if (\"cursor\" in frame) {\n out.cursor = frame.cursor.token;\n } else if (\"row\" in frame) {\n if (out.rows.length >= maxRows) {\n out.truncated = true;\n break;\n }\n out.rows.push(frame.row);\n out.rowCount = out.rows.length;\n } else if (\"end\" in frame \|\| \"cancelled\" in frame) {\n break;\n }\n }\n\n devConsole.record({\n kind: \"query\",\n verb: \"POST\",\n target: \"/query/stream\",\n startedAt,\n durationMs: elapsed(),\n ok: true,\n status: res.status,\n rowCount: out.rowCount,\n payload,\n });\n\n // We stopped early with more rows on the server — release the pinned cursor.\n if (out.truncated && out.cursor) {\n await this.cancelQueryStream(out.cursor).catch(() => {\n // best-effort: the cursor TTL reclaims it anyway.\n });\n }\n return out;\n }\n\n /* Cancel a streaming-query cursor server-side (`POST /query/stream/cancel`). /\n async cancelQueryStream(cursor: string): Promise<void> {\n await this.json(\"/query/stream/cancel\", {\n method: \"POST\",\n body: JSON.stringify({ cursor }),\n }).catch(() => undefined);\n }\n\n async collectionVcs(name: string): Promise<CollectionVcsState> {\n const r = await this.json<VcsEnvelope<CollectionVcsState>>(\n `/collections/${encodeURIComponent(name)}/vcs`\n );\n return r.result;\n }\n\n async setCollectionVcs(\n name: string,\n versioned: boolean\n ): Promise<CollectionVcsState> {\n const r = await this.json<VcsEnvelope<CollectionVcsState>>(\n `/collections/${encodeURIComponent(name)}/vcs`,\n {\n method: \"PUT\",\n body: JSON.stringify({ versioned }),\n }\n );\n return r.result;\n }\n\n async commits(\n opts: {\n from?: string;\n to?: string;\n branch?: string;\n limit?: number;\n skip?: number;\n noMerges?: boolean;\n } = {}\n ): Promise<VcsCommit[]> {\n const qs = new URLSearchParams();\n if (opts.from) qs.set(\"from\", opts.from);\n if (opts.to) qs.set(\"to\", opts.to);\n if (opts.branch) qs.set(\"branch\", opts.branch);\n if (opts.limit !== undefined) qs.set(\"limit\", String(opts.limit));\n if (opts.skip !== undefined) qs.set(\"skip\", String(opts.skip));\n if (opts.noMerges !== undefined) qs.set(\"no_merges\", String(opts.noMerges));\n const suffix = qs.toString() ? `?${qs}` : \"\";\n const r = await this.json<VcsEnvelope<VcsCommit[]>>(\n `/repo/commits${suffix}`\n );\n return r.result;\n }\n\n async commitDiff(\n from: string,\n to: string,\n opts: { collection?: string; summary?: boolean } = {}\n ): Promise<VcsDiff> {\n const qs = new URLSearchParams();\n if (opts.collection) qs.set(\"collection\", opts.collection);\n if (opts.summary !== undefined) qs.set(\"summary\", String(opts.summary));\n const suffix = qs.toString() ? `?${qs}` : \"\";\n const r = await this.json<VcsEnvelope<VcsDiff>>(\n `/repo/commits/${encodeURIComponent(from)}/diff/${encodeURIComponent(to)}${suffix}`\n );\n return r.result;\n }\n\n async replication(): Promise<ReplicationStatus> {\n return this.json<ReplicationStatus>(\"/replication/status\").catch(() => ({\n ok: false,\n role: \"standalone\" as const,\n }));\n }\n\n async whoami(): Promise<Whoami> {\n return this.json<Whoami>(\"/auth/whoami\");\n }\n\n /\n Grounded natural-language query (`POST /ai/ask`, ADR 0013). Returns the\n * synthesised answer plus the `sources_flat` it was grounded on and the\n * `[^N]` citations linking claims to sources. Requires the server's AI\n * provider to be configured; an unconfigured server answers with an error\n * status (surfaced by `json()`).\n /\n async ask(question: string, opts: AskOptions = {}): Promise<AskResponse> {\n return this.json<AskResponse>(\"/ai/ask\", {\n method: \"POST\",\n body: JSON.stringify({ question, ...opts }),\n });\n }\n\n async users(): Promise<AuthUser[]> {\n const r = await this.json<{ ok: boolean; users: AuthUser[] }>(\n \"/auth/users\"\n );\n return r.users;\n }\n\n async tenants(): Promise<AuthTenant[]> {\n const r = await this.json<{ ok: boolean; tenants: AuthTenant[] }>(\n \"/auth/tenants\"\n );\n return r.tenants ?? [];\n }\n\n async policies(): Promise<AuthPolicy[]> {\n const r = await this.json<{ ok: boolean; policies: AuthPolicy[] }>(\n \"/auth/policies\"\n );\n return r.policies ?? [];\n }\n\n async authCan(checks: PermissionCheck[]): Promise<PermissionDecision[]> {\n const r = await this.json<AuthCanResponse>(\"/auth/can\", {\n method: \"POST\",\n body: JSON.stringify({ checks }),\n });\n if (!Array.isArray(r.results)) {\n throw new Error(r.error ?? \"POST /auth/can returned no results\");\n }\n return checks.map((check, index) => {\n const result = r.results?.[index] ?? {};\n const resource = isPermissionResource(result.resource)\n ? result.resource\n : check.resource;\n return {\n action:\n typeof result.action === \"string\" ? result.action : check.action,\n resource,\n current_tenant:\n typeof result.current_tenant === \"string\"\n ? result.current_tenant\n : check.current_tenant,\n allowed: result.allowed === true,\n reason: typeof result.reason === \"string\" ? result.reason : undefined,\n };\n });\n }\n\n async changes(\n sinceLsn?: number,\n opts: { collection?: string; limit?: number } = {}\n ): Promise<ChangeEvent[]> {\n const qs = new URLSearchParams();\n if (sinceLsn !== undefined) qs.set(\"since_lsn\", String(sinceLsn));\n if (opts.limit !== undefined) qs.set(\"limit\", String(opts.limit));\n const suffix = qs.toString() ? `?${qs}` : \"\";\n const r = await this.json<{ events: ChangeEvent[] }>(\"/changes\" + suffix);\n const events = r.events ?? [];\n return opts.collection\n ? events.filter((e) => e.collection === opts.collection)\n : events;\n }\n\n // Convenience: turn a /query response into plain row objects.\n async rows(query: string): Promise<Array<Record<string, unknown>>> {\n const r = await this.query(query);\n return r.result.records.map((rec) => rec.values);\n }\n}\n","// ConnectionProvider — deep module: the UI's only seam for \"how do I\n// discover and select databases?\". Local OSS lives behind LocalUrlProvider;\n// cloud SSO (ReddbIoSsoProvider) will land in a separate slice without\n// touching the consumers.\n\nimport type { RedClient } from './client'\nimport type { Transport } from './types'\nimport type { BootParams } from './boot-params'\n\nexport type ConnectionRole = 'primary' \| 'replica' \| 'embedded'\n\nexport interface Connection {\n id: string\n label: string\n url: string\n role?: ConnectionRole\n description?: string\n}\n\nexport interface Identity {\n authenticated: boolean\n username: string\n role: string\n}\n\nexport interface ActiveConnection {\n connection: Connection\n client: RedClient\n rtt_ms: number\n}\n\nexport interface ConnectionProvider {\n list(): Promise<Connection[]>\n connect(id: string): Promise<ActiveConnection>\n whoami(): Promise<Identity>\n /\n The wire transports this provider can actually materialize on its Surface\n * (#34, ADR-0003). The Connect UI offers only these, so the user never picks\n * a transport that fails. Optional: a provider that omits it is treated as\n * browser-reachable (http/https + coerced red://) by the consumer.\n /\n transports?(): Transport[]\n\n /\n Non-secret connection config seeded by the Surface (#36, ADR-0005) — the\n * endpoint and initial view from the app URL. The Core reads it through this\n * seam (not a special MCP branch) to connect without the Connect flow.\n * Tokens never appear here. Returns null when nothing was seeded.\n /\n bootParams?(): BootParams \| null\n}\n\nexport class UnknownConnectionError extends Error {\n constructor(public readonly id: string) {\n super(`Unknown connection: ${id}`)\n this.name = 'UnknownConnectionError'\n }\n}\n\nexport class NotConnectedError extends Error {\n constructor() {\n super('No active connection — call connect() first')\n this.name = 'NotConnectedError'\n }\n}\n\nexport class UnreachableConnectionError extends Error {\n constructor(public readonly id: string, public readonly reason: string) {\n super(`Connection ${id} unreachable: ${reason}`)\n this.name = 'UnreachableConnectionError'\n }\n}\n","// InjectedClientProvider — the embed-Surface implementation of\n// ConnectionProvider. The embedding host owns auth (ADR-0001 / ADR-0005): it\n// constructs and authenticates a RedClient, then hands it to the Core. The\n// Core stays agnostic — it acquires its client through the same\n// ConnectionProvider seam as the PWA/Desktop Surfaces, never knowing whether\n// the connection came from a Connect flow or from its host.\n//\n// Unlike LocalUrlProvider this is a single-connection* provider: there is no\n// discovery, no history, no Connect flow. `list()` surfaces exactly one\n// connection and `connect()` returns the host-supplied client immediately. A\n// ping only measures RTT for the status bar — a failed probe does NOT block\n// the mount, because the host vouches for the client it injected.\n\nimport type { RedClient } from './client'\nimport {\n NotConnectedError,\n UnknownConnectionError,\n type ActiveConnection,\n type Connection,\n type ConnectionProvider,\n type Identity,\n} from './connection-provider'\n\nexport interface InjectedClientOptions {\n /** The host-supplied, already-authenticated client. /\n client: RedClient\n /* UI metadata for the single connection this provider exposes. /\n connection?: Partial<Connection>\n}\n\nexport class InjectedClientProvider implements ConnectionProvider {\n private readonly client: RedClient\n /* The sole connection this provider resolves. /\n readonly connection: Connection\n private connected = false\n\n constructor(opts: InjectedClientOptions) {\n this.client = opts.client\n this.connection = {\n id: opts.connection?.id ?? 'host',\n label: opts.connection?.label ?? 'Host connection',\n url: opts.connection?.url ?? '',\n role: opts.connection?.role ?? 'primary',\n description: opts.connection?.description ?? 'Injected by the embedding host.',\n }\n }\n\n async list(): Promise<Connection[]> {\n return [this.connection]\n }\n\n /\n Resolve the single host connection. Any other id throws\n * UnknownConnectionError — there is nothing else to connect to. The probe is\n * best-effort: an unreachable host still yields an ActiveConnection (rtt 0)\n * rather than rejecting, since the host owns the client's lifecycle.\n /\n async connect(id: string): Promise<ActiveConnection> {\n if (id !== this.connection.id) throw new UnknownConnectionError(id)\n let rtt_ms = 0\n try {\n const ping = await this.client.ping()\n if (ping.ok) rtt_ms = ping.rtt_ms\n } catch {\n / host vouches for the client — surface rtt 0, don't block the mount /\n }\n this.connected = true\n return { connection: this.connection, client: this.client, rtt_ms }\n }\n\n async whoami(): Promise<Identity> {\n if (!this.connected) throw new NotConnectedError()\n const w = await this.client.whoami()\n return { authenticated: w.authenticated, username: w.username, role: w.role }\n }\n}\n","import appCss from \"../../app.css?inline\";\nimport type { Component } from \"svelte\";\nimport type { ConnectionProvider, ConsoleSink } from \"../reddb\";\nimport { devConsole } from \"../reddb/dev-console\";\nimport { applyAppearance, type Theme } from \"../theme.svelte\";\nimport { RED_UI_VERSION, readBuildInfo } from \"../build-info\";\n\n/* Build version of the embeddable bundle, stamped at build time. /\nexport { RED_UI_VERSION, readBuildInfo };\n\ndeclare global {\n interface Window {\n __RED_UI_EMBED_SURFACE__?: boolean;\n }\n}\n\nexport {\n InjectedClientProvider,\n RedClient,\n type Connection,\n type ConnectionProvider,\n type ConsoleEntry,\n type ConsoleEntryKind,\n type ConsoleSink,\n type InjectedClientOptions,\n type RedClientOptions,\n} from \"../reddb\";\n\nexport interface RedUiEmbedOptions {\n connectionProvider: ConnectionProvider;\n initialRoute?: string;\n theme?: Theme;\n shadowRoot?: ShadowRootInit;\n /\n Host tap on red-ui's developer console. When set, every query/HTTP\n * round-trip the embedded Core records — verb, target, duration, row count,\n * sanitized payload — is also delivered to the host, so a host app (e.g.\n * red-request) can mirror red-ui's RQL/SQL traffic into its own developer\n * bar. Entries are already secret-redacted before they reach the sink.\n /\n consoleSink?: ConsoleSink;\n}\n\nexport interface RedUiEmbedHandle {\n host: HTMLElement;\n shadowRoot: ShadowRoot;\n portalTarget: HTMLElement;\n destroy(): void;\n}\n\nexport type RedUiElementTagName = `${string}-${string}`;\n\nconst shadowCss = `\n:host {\n display: block;\n min-height: 720px;\n color-scheme: light dark;\n contain: content;\n font-family: var(--font-sans);\n}\n\n:host {\n box-sizing: border-box;\n}\n\n.red-ui-shadow-mount {\n min-height: 720px;\n background: var(--color-bg-0);\n color: var(--color-fg-0);\n font-family: var(--font-sans);\n font-size: 13px;\n line-height: 1.5;\n -webkit-font-smoothing: antialiased;\n text-rendering: optimizeLegibility;\n}\n\n[data-red-ui-shadow-portal] {\n position: relative;\n z-index: 2147483647;\n}\n`;\n\nfunction markEmbedSurface() {\n if (typeof window !== \"undefined\") window.__RED_UI_EMBED_SURFACE__ = true;\n}\n\nexport async function mountRedUi(\n host: HTMLElement,\n opts: RedUiEmbedOptions\n): Promise<RedUiEmbedHandle> {\n markEmbedSurface();\n // The DS axes (ADR 0008): `data-theme` is the Theme direction and\n // `data-color-scheme` is light/dark. A host that still pre-sets the legacy\n // `data-theme=\"light\|dark\"` keeps its choice.\n const legacy = host.dataset.theme;\n const preset =\n host.dataset.colorScheme ??\n (legacy === \"light\" \|\| legacy === \"dark\" ? legacy : undefined);\n applyAppearance(host, opts.theme ?? (preset as Theme \| undefined) ?? \"dark\");\n\n // Browsers do not register @font-face rules inside a shadow tree. Publish\n // only the received DS faces once per document; appearance stays scoped.\n const doc = host.ownerDocument;\n if (!doc.head.querySelector(`style[data-red-ui-fonts=\"${RED_UI_VERSION}\"]`)) {\n const fonts = doc.createElement(\"style\");\n fonts.dataset.redUiFonts = RED_UI_VERSION;\n fonts.textContent =\n appCss.match(/@font-face\\s\\{[^}]\\}/g)?.join(\"\\n\") ?? \"\";\n doc.head.append(fonts);\n }\n\n const shadowRoot =\n host.shadowRoot ?? host.attachShadow(opts.shadowRoot ?? { mode: \"open\" });\n shadowRoot.textContent = \"\";\n\n const style = document.createElement(\"style\");\n style.textContent = `${appCss}\\n${shadowCss}`;\n\n const mountTarget = document.createElement(\"div\");\n mountTarget.className = \"red-ui-shadow-mount\";\n\n const portalTarget = document.createElement(\"div\");\n portalTarget.setAttribute(\"data-red-ui-shadow-portal\", \"\");\n\n shadowRoot.append(style, mountTarget, portalTarget);\n\n const [{ mount, unmount }, root] = await Promise.all([\n import(\"svelte\"),\n import(\"./RedUiEmbedRoot.svelte\") as Promise<{\n default: Component<Record<string, unknown>>;\n }>,\n ]);\n\n const instance = mount(root.default, {\n target: mountTarget,\n props: {\n connectionProvider: opts.connectionProvider,\n portalTarget,\n shadowHost: host,\n initialRoute: opts.initialRoute,\n initialTheme: opts.theme,\n },\n });\n\n const removeSink = opts.consoleSink\n ? devConsole.addSink(opts.consoleSink)\n : undefined;\n\n return {\n host,\n shadowRoot,\n portalTarget,\n destroy: () => {\n removeSink?.();\n void unmount(instance);\n shadowRoot.textContent = \"\";\n },\n };\n}\n\nexport class RedUiElement extends HTMLElement {\n #connectionProvider: ConnectionProvider \| null = null;\n #consoleSink: ConsoleSink \| null = null;\n initialRoute: string \| undefined;\n theme: Theme \| undefined;\n #handle: RedUiEmbedHandle \| null = null;\n #mounting: Promise<void> \| null = null;\n\n /** Build version of the embedded bundle (also reflected as a `version`\n * attribute on connect, so a host can read `el.getAttribute('version')`). /\n static readonly version = RED_UI_VERSION;\n get version(): string {\n return RED_UI_VERSION;\n }\n\n get connectionProvider(): ConnectionProvider \| null {\n return this.#connectionProvider;\n }\n\n set connectionProvider(provider: ConnectionProvider \| null) {\n this.#connectionProvider = provider;\n if (this.isConnected) this.#mounting = this.#mount();\n }\n\n get consoleSink(): ConsoleSink \| null {\n return this.#consoleSink;\n }\n\n /\n Host tap on the embedded Core's developer console (see\n * `RedUiEmbedOptions.consoleSink`). Setting it after mount remounts, like\n * `connectionProvider` — hosts normally assign both before attach.\n */\n set consoleSink(sink: ConsoleSink \| null) {\n this.#consoleSink = sink;\n if (this.isConnected) this.#mounting = this.#mount();\n }\n\n connectedCallback() {\n if (!this.hasAttribute(\"version\"))\n this.setAttribute(\"version\", RED_UI_VERSION);\n this.#mounting ??= this.#mount();\n }\n\n disconnectedCallback() {\n this.#handle?.destroy();\n this.#handle = null;\n this.#mounting = null;\n }\n\n async #mount() {\n if (!this.#connectionProvider) return;\n this.#handle?.destroy();\n this.#handle = await mountRedUi(this, {\n connectionProvider: this.#connectionProvider,\n initialRoute: this.initialRoute,\n theme: this.theme,\n consoleSink: this.#consoleSink ?? undefined,\n });\n }\n}\n\nexport function registerRedUiElement(\n tagName: RedUiElementTagName = \"red-ui-app\"\n): typeof RedUiElement {\n markEmbedSurface();\n if (!customElements.get(tagName))\n customElements.define(tagName, RedUiElement);\n return customElements.get(tagName) as typeof RedUiElement;\n}\n"],"names":["SENSITIVE_KEY_RE","REDACTED","redactSecrets","value","depth","v","out","k","sanitizePayload","body","parsed","json","DevConsoleStore","capacity","__publicField","input","entry","sink","listener","snap","devConsole","EACH_ITEM_REACTIVE","EACH_INDEX_REACTIVE","EACH_IS_CONTROLLED","EACH_IS_ANIMATED","EACH_ITEM_IMMUTABLE","PROPS_IS_IMMUTABLE","PROPS_IS_RUNES","PROPS_IS_UPDATED","PROPS_IS_BINDABLE","PROPS_IS_LAZY_INITIAL","TRANSITION_IN","TRANSITION_OUT","TRANSITION_GLOBAL","TEMPLATE_FRAGMENT","TEMPLATE_USE_IMPORT_NODE","HYDRATION_START","HYDRATION_START_ELSE","HYDRATION_START_FAILED","HYDRATION_END","HYDRATION_ERROR","UNINITIALIZED","NAMESPACE_HTML","NAMESPACE_SVG","NAMESPACE_MATHML","ATTACHMENT_KEY","DEV","is_array","index_of","includes","array_from","define_property","get_descriptor","get_descriptors","object_prototype","array_prototype","get_prototype_of","is_extensible","is_function","thing","noop","is_promise","run","fn","run_all","arr","i","deferred","resolve","reject","promise","res","rej","fallback","lazy","to_array","n","array","element","exclude_from_object","obj","keys","result","key","symbol","DERIVED","EFFECT","RENDER_EFFECT","MANAGED_EFFECT","BLOCK_EFFECT","BRANCH_EFFECT","ROOT_EFFECT","BOUNDARY_EFFECT","CONNECTED","CLEAN","DIRTY","MAYBE_DIRTY","INERT","DESTROYED","REACTION_RAN","DESTROYING","EFFECT_TRANSPARENT","EAGER_EFFECT","HEAD_EFFECT","EFFECT_PRESERVED","USER_EFFECT","EFFECT_OFFSCREEN","WAS_MARKED","REACTION_IS_UPDATING","ASYNC","ERROR_VALUE","STATE_SYMBOL","LEGACY_PROPS","LOADING_ATTR_SYMBOL","ATTRIBUTES_CACHE","CLASS_CACHE","STYLE_CACHE","TEXT_CACHE","FORM_RESET_HANDLER","STALE_REACTION","IS_XHTML","_a","ELEMENT_NODE","TEXT_NODE","COMMENT_NODE","experimental_async_required","name","invalid_default_snippet","lifecycle_outside_component","missing_context","async_derived_orphan","each_key_duplicate","a","b","effect_in_teardown","rune","effect_in_unowned_derived","effect_orphan","effect_update_depth_exceeded","fork_discarded","fork_timing","get_abort_signal_outside_reaction","hydration_failed","lifecycle_legacy_only","props_invalid_value","state_descriptors_fixed","state_prototype_fixed","state_unsafe_mutation","svelte_boundary_reset_onerror","derived_inert","hydratable_missing_but_expected","hydration_mismatch","location","select_multiple_invalid_value","svelte_boundary_reset_noop","hydrating","set_hydrating","hydrate_node","set_hydrate_node","node","w.hydration_mismatch","hydrate_next","get_next_sibling","reset","next","count","skip_nodes","remove","data","read_hydration_instruction","equals","safe_not_equal","safe_equals","legacy_mode_flag","tracing_mode_flag","enable_legacy_mode_flag","component_context","set_component_context","context","createContext","hasContext","e.missing_context","getContext","setContext","get_or_init_context_map","getAllContexts","push","props","runes","active_effect","pop","component","effects","create_user_effect","is_runes","e.lifecycle_outside_component","get_parent_context","parent","context_map","micro_tasks","run_micro_tasks","tasks","queue_micro_task","is_flushing_sync","flush_tasks","handle_error","error","effect","active_reaction","invoke_error_boundary","e","STATUS_MASK","set_signal_status","signal","status","update_derived_status","derived","clear_marked","deps","dep","defer_effect","dirty_effects","maybe_dirty_effects","subscribe_to_store","store","invalidate","unsub","untrack","subscriber_queue","readable","start","writable","stop","subscribers","set","new_value","run_queue","subscriber","update","subscribe","stores","initial_value","single","stores_array","auto","started","values","pending","cleanup","sync","unsubscribers","get","_","legacy_is_updating_store","is_store_binding","IS_UNMOUNTED","store_get","store_name","mutable_source","is_synchronous_callback","get_store","store_unsub","store_set","update_with_flag","setup_stores","teardown","capture_store_binding","previous_is_store_binding","first_batch","last_batch","current_batch","previous_batch","batch_values","last_scheduled_effect","is_processing","collected_effects","legacy_updates","flush_count","uid","_Batch","__privateAdd","_Batch_instances","_started","_prev","_next","_commit_callbacks","_discard_callbacks","_fork_commit_callbacks","_pending","_blocking_pending","_deferred","_roots","_new_effects","_dirty_effects","_maybe_dirty_effects","_skipped_branches","_unskipped_branches","_decrement_queued","__privateGet","callback","tracked","source","is_derived","__privateMethod","process_fn","old_values","unlink_fn","blocking","__privateSet","blocking_pending_count","batch","link_fn","flags","is_deferred_fn","skipped","infinite_loop_guard","roots","render_effects","updates","root","traverse_fn","reset_all","defer_effects_fn","t","reset_branch","earlier_batch","find_earlier_batch_fn","_b","merge_fn","flush_queued_effects","_c","next_batch","r","_d","is_branch","is_skippable_branch","skip","is_dirty","update_effect","child","d","mark","reactions","reaction","commit_fn","is_earlier","sources","batch_value","others","s","unskipped","marked","checked","mark_effects","current_unequal","c","depends_on","prev","Batch","flushSync","was_flushing_sync","e.effect_update_depth_exceeded","eager_block_effects","length","unlink_effect","ordered_effects","ancestor","j","schedule_effect","mark_eager_effects","depends","fork","e.experimental_async_required","e.fork_timing","committed","settled","e.fork_discarded","increment_write_version","eager_effects","set_eager_effects","flush_eager_effects","flatten","blockers","async","derived_safe_equal","restore","capture","blocker_promise","finish","unset_context","decrement_pending","increment_pending","expression","async_derived","previous_effect","previous_reaction","previous_component_context","activate_batch","set_active_effect","set_active_reaction","deactivate_batch","boundary","OBSOLETE","label","e.async_derived_orphan","should_suspend","deferreds","async_effect","handler","internal_set","fulfil","p","go","user_derived","push_reaction_value","destroy_derived_effects","destroy_effect","execute_derived","prev_active_effect","is_destroying_effect","w.derived_inert","update_reaction","update_derived","effect_tracking","freeze_derived_effects","remove_reactions","destroy_effect_children","unfreeze_derived_effects","eager_effects_deferred","stack","state","immutable","trackable","mutate","should_proxy","untracking","current_sources","e.state_unsafe_mutation","proxy","updated_during_traversal","mark_reactions","untracked_writes","set_untracked_writes","dirty","increment","not_dirty","prototype","is_proxied_array","version","parent_version","update_version","with_parent","set_update_version","prop","descriptor","e.state_descriptors_fixed","target","receiver","exists","has","other_s","ls","own_keys","e.state_prototype_fixed","get_proxied_value","is","$window","is_firefox","first_child_getter","next_sibling_getter","init_operations","element_prototype","node_prototype","text_prototype","create_text","get_first_child","is_text","text","merge_text_nodes","first_child","first","sibling","next_sibling","last_sibling","clear_text_content","should_defer_append","create_element","tag","namespace","autofocus","dom","remove_textarea_child","listening_to_form_reset","add_form_reset_listener","evt","without_reactive_context","listen_to_event_and_reset_event","event","on_reset","validate_effect","e.effect_orphan","e.effect_in_unowned_derived","e.effect_in_teardown","push_effect","parent_effect","parent_last","create_effect","type","user_effect","defer","user_pre_effect","effect_root","component_root","options","pause_effect","legacy_pre_effect","token","render_effect","legacy_pre_effect_reset","template_effect","block","managed","branch","execute_effect_teardown","previously_destroying_effect","set_is_destroying_effect","remove_dom","controller","destroy_block_effect_children","removed","remove_effect_dom","transitions","transition","end","destroy","pause_children","remaining","check","local","transparent","resume_effect","resume_children","move_effect","fragment","is_updating_effect","new_deps","skipped_deps","write_version","read_version","dependencies","dependency","schedule_possible_effect_self_invalidation","previous_deps","previous_skipped_deps","previous_untracked_writes","previous_sources","previous_untracking","previous_update_version","is_fork","remove_reaction","index","new_length","start_index","was_updating_effect","tick","destroyed","depends_on_old_values","should_connect","is_new","reconnect","deep_read_state","deep_read","visited","proto","descriptors","DS_THEME","applyAppearance","el","scheme","STORAGE_KEY","DEFAULT","read","persist","initial","scoped","apply","enabled","ThemeStore","_current","$.state","opts","theme","injected","stripTagPrefix","readBuildInfo","RED_UI_VERSION","EMPTY_SERVER_CAPABILITIES","FEATURE_ALIASES","capabilitiesFromSignal","raw","on","unsupportedCollectionMetadata","collectionMetadataSupportProbe","isUnsupportedCollectionMetadataRoute","isUnsupportedRoute","message","unsupportedCollectionMetadataError","baseUrl","isPermissionResource","candidate","parseNdjsonFrames","reader","decoder","buf","done","nl","line","tail","SELECT_RE","extractRowCount","errorText","m","runQueryPreferStream","client","sql","queryOpts","row","RedClient","path","init","url","headers","verb","startedAt","payload","elapsed","rowCount","username","password","endpoint","response","session","rec","query","time","qs","step","vcs","clusterStatus","inFlightProbe","resolveProbe","probe","metadata","collection","doc","maxRows","errBody","frame","column","cursor","versioned","suffix","from","to","question","checks","resource","sinceLsn","events","UnknownConnectionError","id","NotConnectedError","UnreachableConnectionError","reason","InjectedClientProvider","_e","rtt_ms","ping","w","shadowCss","markEmbedSurface","mountRedUi","host","legacy","preset","fonts","appCss","shadowRoot","style","mountTarget","portalTarget","mount","unmount","instance","removeSink","RedUiElement","_RedUiElement_instances","_connectionProvider","_consoleSink","_handle","_mounting","provider","mount_fn","registerRedUiElement","tagName"],"mappings":";;;;;;;s/3WAoDMA,KACJ,iHAEIC,KAAW;AAQV,SAASC,GAAcC,GAAgBC,IAAQ,GAAY;AAChE,MAAIA,IAAQ,EAAG,QAAO;AACtB,MAAI,MAAM,QAAQD,CAAK;AACrB,WAAOA,EAAM,MAAM,GAAG,GAAG,EAAE,IAAI,CAACE,MAAMH,GAAcG,GAAGD,IAAQ,CAAC,CAAC;AAEnE,MAAID,KAAS,OAAOA,KAAU,UAAU;AACtC,UAAMG,IAA+B,CAAA;AACrC,eAAW,CAACC,GAAGF,CAAC,KAAK,OAAO,QAAQF,CAAgC;AAClE,MAAAG,EAAIC,CAAC,IAAIP,GAAiB,KAAKO,CAAC,IAC5BN,KACAC,GAAcG,GAAGD,IAAQ,CAAC;AAEhC,WAAOE;AAAA,EACT;AACA,SAAOH;AACT;AAQO,SAASK,GAAgBC,GAAmC;AACjE,MAA0BA,KAAS,KAAM;AACzC,MAAIC,IAAkBD;AACtB,MAAI,OAAOA,KAAS,UAAU;AAC5B,QAAIA,EAAK,WAAW,EAAG;AACvB,QAAI;AACF,MAAAC,IAAS,KAAK,MAAMD,CAAI;AAAA,IAC1B,QAAQ;AACN,aAAOA,EAAK,SAAS,MAAO,GAAGA,EAAK,MAAM,GAAG,GAAI,CAAC,MAAMA;AAAA,IAC1D;AAAA,EACF;AACA,MAAI;AACF,UAAME,IAAO,KAAK,UAAUT,GAAcQ,CAAM,GAAG,MAAM,CAAC;AAC1D,WAAOC,EAAK,SAAS,MAAO,GAAGA,EAAK,MAAM,GAAG,GAAI,CAAC,MAAMA;AAAA,EAC1D,QAAQ;AACN;AAAA,EACF;AACF;AAOO,MAAMC,GAAgB;AAAA;AAAA,EAO3B,YAA6BC,IAAW,KAAK;AANrC,IAAAC,EAAA,iBAA0B,CAAA;AACjB,IAAAA,EAAA,uCAAgB,IAAA;AAChB,IAAAA,EAAA,mCAAY,IAAA;AACrB,IAAAA,EAAA,gBAAS;AAGY,SAAA,WAAAD;AAAA,EAAiB;AAAA;AAAA,EAG9C,OAAOE,GAAwC;AAC7C,UAAMC,IAAsB,EAAE,GAAGD,GAAO,IAAI,KAAK,SAAA;AACjD,SAAK,QAAQ,KAAKC,CAAK,GACnB,KAAK,QAAQ,SAAS,KAAK,YAC7B,KAAK,QAAQ,OAAO,GAAG,KAAK,QAAQ,SAAS,KAAK,QAAQ,GAE5D,KAAK,KAAA;AACL,eAAWC,KAAQ,KAAK;AACtB,UAAI;AACF,QAAAA,EAAKD,CAAK;AAAA,MACZ,QAAQ;AAAA,MAER;AAEF,WAAOA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQC,GAA+B;AACrC,gBAAK,MAAM,IAAIA,CAAI,GACZ,MAAM;AACX,WAAK,MAAM,OAAOA,CAAI;AAAA,IACxB;AAAA,EACF;AAAA;AAAA,EAGA,WAAoC;AAClC,WAAO,KAAK,QAAQ,MAAA;AAAA,EACtB;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA;AAAA,EAGA,QAAc;AACZ,IAAI,KAAK,QAAQ,WAAW,MAC5B,KAAK,UAAU,CAAA,GACf,KAAK,KAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAUC,GAAgC;AACxC,gBAAK,UAAU,IAAIA,CAAQ,GAC3BA,EAAS,KAAK,UAAU,GACjB,MAAM;AACX,WAAK,UAAU,OAAOA,CAAQ;AAAA,IAChC;AAAA,EACF;AAAA,EAEQ,OAAa;AACnB,UAAMC,IAAO,KAAK,SAAA;AAClB,eAAWD,KAAY,KAAK,UAAW,CAAAA,EAASC,CAAI;AAAA,EACtD;AACF;AAGO,MAAMC,KAAa,IAAIR,GAAA,GCzLjBS,KAAqB,GACrBC,KAAsB,GAEtBC,KAAqB,GACrBC,KAAmB,GACnBC,KAAsB,IAEtBC,KAAqB,GACrBC,KAAiB,GACjBC,KAAmB,GACnBC,KAAoB,GACpBC,KAAwB,IAExBC,KAAgB,GAChBC,KAAiB,GACjBC,KAAoB,GAEpBC,KAAoB,GACpBC,KAA2B,GAI3BC,KAAkB,KAElBC,KAAuB,MAEvBC,KAAyB,MACzBC,KAAgB,KAChBC,KAAkB,CAAA,GAMlBC,IAAgB,OAAO,eAAe,GAMtCC,KAAiB,gCACjBC,KAAgB,8BAChBC,KAAmB,sCAuBnBC,KAAiB,WCjE9BC,KAAe;ACEL,IAACC,KAAW,MAAM,SACjBC,KAAW,MAAM,UAAU,SAC3BC,KAAW,MAAM,UAAU,UAC3BC,KAAa,MAAM,MAEnBC,KAAkB,OAAO,gBACzBC,KAAiB,OAAO,0BACxBC,KAAkB,OAAO,2BACzBC,KAAmB,OAAO,WAC1BC,KAAkB,MAAM,WACxBC,KAAmB,OAAO,gBAC1BC,KAAgB,OAAO;AAO3B,SAASC,GAAYC,GAAO;AAClC,SAAO,OAAOA,KAAU;AACzB;AAEY,MAACC,IAAO,MAAM;AAAC;AAUpB,SAASC,GAAW1D,GAAO;AACjC,SAAO,QAAOA,KAAA,gBAAAA,EAAO,SAAS;AAC/B;AAGO,SAAS2D,GAAIC,GAAI;AACvB,SAAOA,EAAE;AACV;AAGO,SAASC,GAAQC,GAAK;AAC5B,WAASC,IAAI,GAAGA,IAAID,EAAI,QAAQC;AAC/B,IAAAD,EAAIC,CAAC,EAAC;AAER;AAMO,SAASC,KAAW;AAE1B,MAAIC,GAGAC,GAGAC,IAAU,IAAI,QAAQ,CAACC,GAAKC,MAAQ;AACvC,IAAAJ,IAAUG,GACVF,IAASG;AAAA,EACV,CAAC;AAGD,SAAO,EAAE,SAAAF,GAAS,SAAAF,GAAS,QAAAC,EAAM;AAClC;AASO,SAASI,GAAStE,GAAOsE,GAAUC,IAAO,IAAO;AACvD,SAAOvE,MAAU,SACduE;AAAA;AAAA,IACyBD,EAAQ;AAAA;AAAA;AAAA,IACdA;AAAA,MACnBtE;AACJ;AAWO,SAASwE,GAASxE,GAAOyE,GAAG;AAElC,MAAI,MAAM,QAAQzE,CAAK;AACtB,WAAOA;AAMR,MAAIyE,MAAM,UAAa,EAAE,OAAO,YAAYzE;AAC3C,WAAO,MAAM,KAAKA,CAAK;AAMxB,QAAM0E,IAAQ,CAAA;AAEd,aAAWC,KAAW3E;AAErB,QADA0E,EAAM,KAAKC,CAAO,GACdD,EAAM,WAAWD,EAAG;AAGzB,SAAOC;AACR;AAOO,SAASE,GAAoBC,GAAKC,GAAM;AAE9C,MAAIC,IAAS,CAAA;AAEb,WAASC,KAAOH;AACf,IAAKC,EAAK,SAASE,CAAG,MACrBD,EAAOC,CAAG,IAAIH,EAAIG,CAAG;AAIvB,WAASC,KAAU,OAAO,sBAAsBJ,CAAG;AAClD,IAAI,OAAO,qBAAqB,KAAKA,GAAKI,CAAM,KAAK,CAACH,EAAK,SAASG,CAAM,MACzEF,EAAOE,CAAM,IAAIJ,EAAII,CAAM;AAI7B,SAAOF;AACR;AC9IO,MAAMG,IAAU,GACVC,KAAS,GACTC,KAAgB,GAKhBC,KAAiB,KAAK,IAKtBC,IAAe,IACfC,IAAgB,IAChBC,KAAc,IACdC,KAAkB,KAOlBC,IAAY,KACZC,IAAQ,MACRC,IAAQ,MACRC,IAAc,MACdC,IAAQ,MACRC,IAAY,OAEZC,KAAe,OAEfC,KAAa,KAAK,IAOlBC,KAAqB,OACrBC,KAAe,KAAK,IACpBC,KAAc,KAAK,IACnBC,KAAmB,KAAK,IACxBC,KAAc,KAAK,IACnBC,KAAmB,KAAK,IASxBC,KAAa,OAGbC,KAAuB,KAAK,IAC5BC,KAAQ,KAAK,IAEbC,KAAc,KAAK,IAEnBC,KAAe,OAAO,QAAQ,GAC9BC,KAAe,OAAO,cAAc,GACpCC,KAAsB,OAAO,EAAE,GAE/BC,KAAmB,OAAO,YAAY,GACtCC,KAAc,OAAO,OAAO,GAC5BC,KAAc,OAAO,OAAO,GAC5BC,KAAa,OAAO,MAAM,GAC1BC,KAAqB,OAAO,YAAY,GAKxCC,KAAiB,IAAK,cAAiC,MAAM;AAAA,EAAvC;AAAA;AAClC,IAAAzG,EAAA,cAAO;AACP,IAAAA,EAAA,iBAAU;AAAA;AACX,EAAC;;AAEW,MAAC0G;AAAA;AAAA,EAEZ,CAAC,GAACC,KAAA,WAAW,aAAX,QAAAA,GAAqB,gBACP,2BAAW,SAAS,YAAY,SAAS,KAAK;AAAA,GAClDC,KAAe,GACfC,KAAY,GACZC,KAAe;AC5ErB,SAASC,GAA4BC,GAAM;AAQhD,QAAM,IAAI,MAAM,kDAAkD;AAEpE;AAMO,SAASC,KAA0B;AAQxC,QAAM,IAAI,MAAM,8CAA8C;AAEhE;AAwCO,SAASC,GAA4BF,GAAM;AAQhD,QAAM,IAAI,MAAM,kDAAkD;AAEpE;AAMO,SAASG,KAAkB;AAQhC,QAAM,IAAI,MAAM,sCAAsC;AAExD;AC3FO,SAASC,KAAuB;AAQrC,QAAM,IAAI,MAAM,2CAA2C;AAE7D;AAmHO,SAASC,GAAmBC,GAAGC,GAAGlI,GAAO;AAU9C,QAAM,IAAI,MAAM,yCAAyC;AAE3D;AA0BO,SAASmI,GAAmBC,GAAM;AAQvC,QAAM,IAAI,MAAM,yCAAyC;AAE3D;AAMO,SAASC,KAA4B;AAQ1C,QAAM,IAAI,MAAM,gDAAgD;AAElE;AAOO,SAASC,GAAcF,GAAM;AAQlC,QAAM,IAAI,MAAM,oCAAoC;AAEtD;AAsBO,SAASG,KAA+B;AAQ7C,QAAM,IAAI,MAAM,mDAAmD;AAErE;AAsBO,SAASC,KAAiB;AAQ/B,QAAM,IAAI,MAAM,qCAAqC;AAEvD;AAMO,SAASC,KAAc;AAQ5B,QAAM,IAAI,MAAM,kCAAkC;AAEpD;AAMO,SAASC,KAAoC;AAQlD,QAAM,IAAI,MAAM,wDAAwD;AAE1E;AAuBO,SAASC,KAAmB;AAQjC,QAAM,IAAI,MAAM,uCAAuC;AAEzD;AAuBO,SAASC,GAAsBjB,GAAM;AAQ1C,QAAM,IAAI,MAAM,4CAA4C;AAE9D;AAOO,SAASkB,GAAoB7D,GAAK;AAQvC,QAAM,IAAI,MAAM,0CAA0C;AAE5D;AAwDO,SAAS8D,KAA0B;AAQxC,QAAM,IAAI,MAAM,8CAA8C;AAEhE;AAMO,SAASC,KAAwB;AAQtC,QAAM,IAAI,MAAM,4CAA4C;AAE9D;AAMO,SAASC,KAAwB;AAQtC,QAAM,IAAI,MAAM,4CAA4C;AAE9D;AAMO,SAASC,KAAgC;AAQ9C,QAAM,IAAI,MAAM,oDAAoD;AAEtE;AC9aO,SAASC,KAAgB;AAI9B,UAAQ,KAAK,oCAAoC;AAEnD;AAmBO,SAASC,GAAgCnE,GAAK;AAInD,UAAQ,KAAK,sDAAsD;AAErE;AAsCO,SAASoE,GAAmBC,GAAU;AAU3C,UAAQ,KAAK,yCAAyC;AAExD;AAqEO,SAASC,KAAgC;AAI9C,UAAQ,KAAK,oDAAoD;AAEnE;AA4BO,SAASC,KAA6B;AAI3C,UAAQ,KAAK,iDAAiD;AAEhE;AC7PU,IAACC,KAAY;AAGhB,SAASC,GAAczJ,GAAO;AACpC,EAAAwJ,KAAYxJ;AACb;AASU,IAAC0J;AAGJ,SAASC,GAAiBC,GAAM;AACtC,MAAIA,MAAS;AACZC,UAAAA,GAAoB,GACdxH;AAGP,SAAQqH,IAAeE;AACxB;AAEO,SAASE,KAAe;AAC9B,SAAOH,GAAiB,gBAAAI,GAAiBL,CAAY,CAAC;AACvD;AAGO,SAASM,GAAMJ,GAAM;AAC3B,MAAKJ,IAGL;AAAA,QAAI,gBAAAO,GAAiBL,CAAY,MAAM;AACtCG,YAAAA,GAAoB,GACdxH;AAGP,IAAAqH,IAAeE;AAAA;AAChB;AAYO,SAASK,GAAKC,IAAQ,GAAG;AAC/B,MAAIV,IAAW;AAId,aAHIzF,IAAImG,GACJN,IAAOF,GAEJ3F;AACN,MAAA6F;AAAA,MAAoC,gBAAAG,GAAiBH,CAAI;AAG1D,IAAAF,IAAeE;AAAA,EAChB;AACD;AAMO,SAASO,GAAWC,IAAS,IAAM;AAIzC,WAHInK,IAAQ,GACR2J,IAAOF,OAEE;AACZ,QAAIE,EAAK,aAAanC,IAAc;AACnC,UAAI4C;AAAA;AAAA,QAA+BT,EAAM;AAAA;AAEzC,UAAIS,MAASjI,IAAe;AAC3B,YAAInC,MAAU,EAAG,QAAO2J;AACxB,QAAA3J,KAAS;AAAA,MACV,MAAO,EACNoK,MAASpI,MACToI,MAASnI;AAAA,MAERmI,EAAK,CAAC,MAAM,OAAO,CAAC,MAAM,OAAOA,EAAK,MAAM,CAAC,CAAC,CAAC,OAEhDpK,KAAS;AAAA,IAEX;AAEA,QAAIgK;AAAA;AAAA,MAAoC,gBAAAF,GAAiBH,CAAI;AAAA;AAC7D,IAAIQ,KAAQR,EAAK,OAAM,GACvBA,IAAOK;AAAA,EACR;AACD;AAMO,SAASK,GAA2BV,GAAM;AAChD,MAAI,CAACA,KAAQA,EAAK,aAAanC;AAC9BoC,UAAAA,GAAoB,GACdxH;AAGP;AAAA;AAAA,IAA+BuH,EAAM;AAAA;AACtC;ACzHO,SAASW,GAAOvK,GAAO;AAC7B,SAAOA,MAAU,KAAK;AACvB;AAOO,SAASwK,GAAevC,GAAGC,GAAG;AACpC,SAAOD,KAAKA,IACTC,KAAKA,IACLD,MAAMC,KAAMD,MAAM,QAAQ,OAAOA,KAAM,YAAa,OAAOA,KAAM;AACrE;AAYO,SAASwC,GAAYzK,GAAO;AAClC,SAAO,CAACwK,GAAexK,GAAO,KAAK,CAAC;AACrC;AC3BU,IAAC0K,KAAmB,IAEnBC,KAAoB;AAWxB,SAASC,KAA0B;AACzC,EAAAF,KAAmB;AACpB;ACRU,IAACG,IAAoB;AAGxB,SAASC,GAAsBC,GAAS;AAC9C,EAAAF,IAAoBE;AACrB;AAiEO,SAASC,KAAgB;AAC/B,QAAMhG,IAAM,CAAA;AAEZ,SAAO;AAAA,IACN,OACMiG,GAAWjG,CAAG,KAClBkG,GAAiB,GAGXC,GAAWnG,CAAG;AAAA,IAEtB,CAAC+F,MAAYK,GAAWpG,GAAK+F,CAAO;AAAA,EACtC;AACA;AAYO,SAASI,GAAWnG,GAAK;AAG/B;AAAA;AAAA,IAFoBqG,GAAoC,EACX,IAAIrG,CAAG;AAAA;AAErD;AAgBO,SAASoG,GAAWpG,GAAK+F,GAAS;AAgBxC,SAfoBM,GAAoC,EAe5C,IAAIrG,GAAK+F,CAAO,GACrBA;AACR;AASO,SAASE,GAAWjG,GAAK;AAE/B,SADoBqG,GAAoC,EACrC,IAAIrG,CAAG;AAC3B;AAUO,SAASsG,KAAiB;AAEhC,SADoBD,GAAwC;AAE7D;AAQO,SAASE,GAAKC,GAAOC,IAAQ,IAAO7H,GAAI;AAC9C,EAAAiH,IAAoB;AAAA,IACnB,GAAGA;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAGW;AAAA,IACH,GAAG;AAAA,IACH;AAAA;AAAA,MAA0BE;AAAA;AAAA,IAC1B,GAAGhB,MAAoB,CAACe,IAAQ,EAAE,GAAG,MAAM,GAAG,MAAM,GAAG,CAAA,MAAO;AAAA,EAChE;AAOA;AAOO,SAASE,GAAIC,GAAW;AAC9B,MAAIb;AAAA;AAAA,IAA2CF;AAAA,KAC3CgB,IAAUd,EAAQ;AAEtB,MAAIc,MAAY,MAAM;AACrB,IAAAd,EAAQ,IAAI;AAEZ,aAASnH,KAAMiI;AACd,MAAAC,GAAmBlI,CAAE;AAAA,EAEvB;AAEA,SAAIgI,MAAc,WACjBb,EAAQ,IAAIa,IAGbb,EAAQ,IAAI,IAEZF,IAAoBE,EAAQ,GAMrBa;AAAA,EAA+B,CAAA;AACvC;AAGO,SAASG,KAAW;AAC1B,SAAO,CAACrB,MAAqBG,MAAsB,QAAQA,EAAkB,MAAM;AACpF;AAMA,SAASQ,GAAwB1D,GAAM;AACtC,SAAIkD,MAAsB,QACzBmB,GAAkC,GAG3BnB,EAAkB,MAAlBA,EAAkB,IAAM,IAAI,IAAIoB,GAAmBpB,CAAiB,KAAK,MAAS;AAC3F;AAMA,SAASoB,GAAmBpB,GAAmB;AAC9C,MAAIqB,IAASrB,EAAkB;AAC/B,SAAOqB,MAAW,QAAM;AACvB,UAAMC,IAAcD,EAAO;AAC3B,QAAIC,MAAgB;AACnB,aAAOA;AAER,IAAAD,IAASA,EAAO;AAAA,EACjB;AACA,SAAO;AACR;AC9PA,IAAIE,KAAc,CAAA;AAElB,SAASC,KAAkB;AAC1B,MAAIC,IAAQF;AACZ,EAAAA,KAAc,CAAA,GACdvI,GAAQyI,CAAK;AACd;AAKO,SAASC,GAAiB3I,GAAI;AACpC,MAAIwI,GAAY,WAAW,KAAK,CAACI,IAAkB;AAClD,QAAIF,IAAQF;AACZ,mBAAe,MAAM;AASpB,MAAIE,MAAUF,MAAaC,GAAe;AAAA,IAC3C,CAAC;AAAA,EACF;AAEA,EAAAD,GAAY,KAAKxI,CAAE;AACpB;AAKO,SAAS6I,KAAc;AAC7B,SAAOL,GAAY,SAAS;AAC3B,IAAAC,GAAe;AAEjB;AC3BO,SAASK,GAAaC,GAAO;AACnC,MAAIC,IAASlB;AAGb,MAAIkB,MAAW;AACS,WAACC,EAAiB,KAAKlG,IACvCgG;AAUR,OAAKC,EAAO,IAAI5G,QAAkB,MAAM4G,EAAO,IAAIzH,QAAY;AAK9D,UAAMwH;AAIP,EAAAG,GAAsBH,GAAOC,CAAM;AACpC;AAMO,SAASE,GAAsBH,GAAOC,GAAQ;AACpD,SAAOA,MAAW,QAAM;AACvB,SAAKA,EAAO,IAAInH,QAAqB,GAAG;AACvC,WAAKmH,EAAO,IAAI5G,QAAkB;AAEjC,cAAM2G;AAGP,UAAI;AACqB,QAACC,EAAO,EAAG,MAAMD,CAAK;AAC9C;AAAA,MACD,SAASI,GAAG;AACX,QAAAJ,IAAQI;AAAA,MACT;AAAA,IACD;AAEA,IAAAH,IAASA,EAAO;AAAA,EACjB;AAMA,QAAMD;AACP;ACnEA,MAAMK,KAAc;AAMb,SAASC,EAAkBC,GAAQC,GAAQ;AACjD,EAAAD,EAAO,IAAKA,EAAO,IAAIF,KAAeG;AACvC;AAMO,SAASC,GAAsBC,GAAS;AAE9C,GAAKA,EAAQ,IAAI3H,OAAe,KAAK2H,EAAQ,SAAS,OACrDJ,EAAkBI,GAAS1H,CAAK,IAEhCsH,EAAkBI,GAASxH,CAAW;AAExC;ACjBA,SAASyH,GAAaC,GAAM;AAC3B,MAAIA,MAAS;AAEb,eAAWC,KAAOD;AACjB,OAAKC,EAAI,IAAItI,OAAa,MAAMsI,EAAI,IAAIhH,QAAgB,MAIxDgH,EAAI,KAAKhH,IAET8G;AAAA;AAAA,QAAqCE,EAAK;AAAA,MAAI;AAEhD;AAOO,SAASC,GAAab,GAAQc,GAAeC,GAAqB;AACxE,GAAKf,EAAO,IAAIhH,OAAW,IAC1B8H,EAAc,IAAId,CAAM,KACbA,EAAO,IAAI/G,OAAiB,KACvC8H,EAAoB,IAAIf,CAAM,GAK/BU,GAAaV,EAAO,IAAI,GAGxBK,EAAkBL,GAAQjH,CAAK;AAChC;AC5BO,SAASiI,GAAmBC,GAAOlK,GAAKmK,GAAY;AAC1D,MAAID,KAAS;AAEZ,WAAAlK,EAAI,MAAS,GAGTmK,KAAYA,EAAW,MAAS,GAE7BrK;AAKR,QAAMsK,IAAQC;AAAA,IAAQ,MACrBH,EAAM;AAAA,MACLlK;AAAA;AAAA,MAEAmK;AAAA,IACH;AAAA,EACA;AAIC,SAAOC,EAAM,cAAc,MAAMA,EAAM,YAAW,IAAKA;AACxD;AC1BA,MAAME,KAAmB,CAAA;AAUlB,SAASC,GAASlO,GAAOmO,GAAO;AACtC,SAAO;AAAA,IACN,WAAWC,GAASpO,GAAOmO,CAAK,EAAE;AAAA,EACpC;AACA;AAUO,SAASC,GAASpO,GAAOmO,IAAQ1K,GAAM;AAE7C,MAAI4K,IAAO;AAGX,QAAMC,IAAc,oBAAI,IAAG;AAM3B,WAASC,EAAIC,GAAW;AACvB,QAAIhE,GAAexK,GAAOwO,CAAS,MAClCxO,IAAQwO,GACJH,IAAM;AAET,YAAMI,IAAY,CAACR,GAAiB;AACpC,iBAAWS,KAAcJ;AACxB,QAAAI,EAAW,CAAC,EAAC,GACbT,GAAiB,KAAKS,GAAY1O,CAAK;AAExC,UAAIyO,GAAW;AACd,iBAAS1K,IAAI,GAAGA,IAAIkK,GAAiB,QAAQlK,KAAK;AACjD,UAAAkK,GAAiBlK,CAAC,EAAE,CAAC,EAAEkK,GAAiBlK,IAAI,CAAC,CAAC;AAE/C,QAAAkK,GAAiB,SAAS;AAAA,MAC3B;AAAA,IACD;AAAA,EAEF;AAMA,WAASU,EAAO/K,GAAI;AACnB,IAAA2K,EAAI3K;AAAA;AAAA,MAAqB5D;AAAA,KAAO;AAAA,EACjC;AAOA,WAAS4O,EAAUjL,GAAKmK,IAAarK,GAAM;AAE1C,UAAMiL,IAAa,CAAC/K,GAAKmK,CAAU;AACnC,WAAAQ,EAAY,IAAII,CAAU,GACtBJ,EAAY,SAAS,MACxBD,IAAOF,EAAMI,GAAKI,CAAM,KAAKlL,IAE9BE;AAAA;AAAA,MAAsB3D;AAAA,IAAK,GACpB,MAAM;AACZ,MAAAsO,EAAY,OAAOI,CAAU,GACzBJ,EAAY,SAAS,KAAKD,MAC7BA,EAAI,GACJA,IAAO;AAAA,IAET;AAAA,EACD;AACA,SAAO,EAAE,KAAAE,GAAK,QAAAI,GAAQ,WAAAC,EAAS;AAChC;AAkCO,SAASvB,GAAQwB,GAAQjL,GAAIkL,GAAe;AAClD,QAAMC,IAAS,CAAC,MAAM,QAAQF,CAAM,GAE9BG,IAAeD,IAAS,CAACF,CAAM,IAAIA;AACzC,MAAI,CAACG,EAAa,MAAM,OAAO;AAC9B,UAAM,IAAI,MAAM,sDAAsD;AAEvE,QAAMC,IAAOrL,EAAG,SAAS;AACzB,SAAOsK,GAASY,GAAe,CAACP,GAAKI,MAAW;AAC/C,QAAIO,IAAU;AAEd,UAAMC,IAAS,CAAA;AACf,QAAIC,IAAU,GACVC,IAAU5L;AACd,UAAM6L,IAAO,MAAM;AAClB,UAAIF;AACH;AAED,MAAAC,EAAO;AACP,YAAMtK,IAASnB,EAAGmL,IAASI,EAAO,CAAC,IAAIA,GAAQZ,GAAKI,CAAM;AAC1D,MAAIM,IACHV,EAAIxJ,CAAM,IAEVsK,IAAU,OAAOtK,KAAW,aAAaA,IAAStB;AAAA,IAEpD,GACM8L,IAAgBP,EAAa;AAAA,MAAI,CAACnB,GAAO9J,MAC9C6J;AAAA,QACCC;AAAA,QACA,CAAC7N,MAAU;AACV,UAAAmP,EAAOpL,CAAC,IAAI/D,GACZoP,KAAW,EAAE,KAAKrL,IACdmL,KACHI,EAAI;AAAA,QAEN;AAAA,QACA,MAAM;AACL,UAAAF,KAAW,KAAKrL;AAAA,QACjB;AAAA,MACJ;AAAA,IACA;AACE,WAAAmL,IAAU,IACVI,EAAI,GACG,WAAgB;AACtB,MAAAzL,GAAQ0L,CAAa,GACrBF,EAAO,GAIPH,IAAU;AAAA,IACX;AAAA,EACD,CAAC;AACF;AAuBO,SAASM,GAAI3B,GAAO;AAC1B,MAAI7N;AACJ,SAAA4N,GAAmBC,GAAO,CAAC4B,MAAOzP,IAAQyP,CAAE,EAAC,GAEtCzP;AACR;AClMO,IAAI0P,KAA2B,IAOlCC,KAAmB,IAEnBC,KAAe,OAAO,WAAW;AAY9B,SAASC,GAAUhC,GAAOiC,GAAYjB,GAAQ;AACpD,QAAMhO,IAASgO,EAAAiB,OAAAjB,EAAAiB,KAAuB;AAAA,IACrC,OAAO;AAAA,IACP,QAAQ,gBAAAC,GAAe,MAAS;AAAA,IAChC,aAAatM;AAAA,EACf;AAOC,MAAI5C,EAAM,UAAUgN,KAAS,EAAE+B,MAAgBf;AAI9C,QAHAhO,EAAM,YAAW,GACjBA,EAAM,QAAQgN,KAAS,MAEnBA,KAAS;AACZ,MAAAhN,EAAM,OAAO,IAAI,QACjBA,EAAM,cAAc4C;AAAA,SACd;AACN,UAAIuM,IAA0B;AAE9B,MAAAnP,EAAM,cAAc+M,GAAmBC,GAAO,CAAC3N,MAAM;AACpD,QAAI8P,IAGHnP,EAAM,OAAO,IAAIX,IAEjBqO,EAAI1N,EAAM,QAAQX,CAAC;AAAA,MAErB,CAAC,GAED8P,IAA0B;AAAA,IAC3B;AAMD,SAAInC,KAAS+B,MAAgBf,IACrBoB,GAAUpC,CAAK,IAGhB2B,GAAI3O,EAAM,MAAM;AACxB;AAUO,SAASqP,GAAYrC,GAAOiC,GAAYjB,GAAQ;AAEtD,MAAIhO,IAAQgO,EAAOiB,CAAU;AAE7B,SAAIjP,KAASA,EAAM,UAAUgN,MAE5BhN,EAAM,YAAW,GACjBA,EAAM,cAAc4C,IAGdoK;AACR;AASO,SAASsC,GAAUtC,GAAO7N,GAAO;AACvC,SAAAoQ,GAAiBvC,GAAO7N,CAAK,GACtBA;AACR;AAiBO,SAASqQ,KAAe;AAE9B,QAAMxB,IAAS,CAAA;AAEf,WAASQ,IAAU;AAClB,IAAAiB,GAAS,MAAM;AACd,eAASR,KAAcjB;AAEtB,QADYA,EAAOiB,CAAU,EACzB,YAAW;AAEhB,MAAA9M,GAAgB6L,GAAQe,IAAc;AAAA,QACrC,YAAY;AAAA,QACZ,OAAO;AAAA,MACX,CAAI;AAAA,IACF,CAAC;AAAA,EACF;AAEA,SAAO,CAACf,GAAQQ,CAAO;AACxB;AAOA,SAASe,GAAiBvC,GAAO7N,GAAO;AACvC,EAAA0P,KAA2B;AAE3B,MAAI;AACH,IAAA7B,EAAM,IAAI7N,CAAK;AAAA,EAChB,UAAC;AACA,IAAA0P,KAA2B;AAAA,EAC5B;AACD;AAoDO,SAASa,GAAsB3M,GAAI;AACzC,MAAI4M,IAA4Bb;AAEhC,MAAI;AACH,WAAAA,KAAmB,IACZ,CAAC/L,EAAE,GAAI+L,EAAgB;AAAA,EAC/B,UAAC;AACA,IAAAA,KAAmBa;AAAA,EACpB;AACD;AClLA,IAAIC,KAAc,MAGdC,KAAa,MAGNC,IAAgB,MAMhBC,KAAiB,MAQjBC,IAAe,MAGtBC,KAAwB,MAEjBtE,KAAmB,IAC1BuE,KAAgB,IAQTC,KAAoB,MASpBC,KAAiB;AAE5B,IAAIC,KAAc;AAKlB,IAAIC,KAAM;;AAEH,MAAMC,KAAN,MAAMA,GAAM;AAAA,EAAZ;AAAA,IAAAC,EAAA,MAAAC;AACN,IAAA3Q,EAAA,YAAKwQ;AAGL;AAAA,IAAAE,EAAA,MAAAE,IAAW;AAEX,IAAA5Q,EAAA,gBAAS;AAGT;AAAA,IAAA0Q,EAAA,MAAAG,IAAQ;AAGR;AAAA,IAAAH,EAAA,MAAAI,IAAQ;AAGR;AAAA,IAAA9Q,EAAA,wBAAiB,oBAAI,IAAG;AAQxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,EAAA,iBAAU,oBAAI,IAAG;AAOjB;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,EAAA,kBAAW,oBAAI,IAAG;AAOlB;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAA,EAAA,mBAAY,oBAAI,IAAG;AAOnB;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA0Q,EAAA,MAAAK,IAAoB,oBAAI,IAAG;AAM3B;AAAA;AAAA;AAAA;AAAA,IAAAL,EAAA,MAAAM,IAAqB,oBAAI,IAAG;AAM5B;AAAA;AAAA;AAAA;AAAA,IAAAN,EAAA,MAAAO,IAAyB,oBAAI,IAAG;AAKhC;AAAA;AAAA;AAAA,IAAAP,EAAA,MAAAQ,IAAW;AAMX;AAAA;AAAA;AAAA;AAAA,IAAAR,EAAA,MAAAS,GAAoB,oBAAI,IAAG;AAO3B;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAT,EAAA,MAAAU,IAAY;AAMZ;AAAA;AAAA;AAAA;AAAA,IAAAV,EAAA,MAAAW,GAAS,CAAA;AAMT;AAAA;AAAA;AAAA;AAAA,IAAAX,EAAA,MAAAY,IAAe,CAAA;AAMf;AAAA;AAAA;AAAA;AAAA,IAAAZ,EAAA,MAAAa,IAAiB,oBAAI,IAAG;AAMxB;AAAA;AAAA;AAAA;AAAA,IAAAb,EAAA,MAAAc,GAAuB,oBAAI,IAAG;AAS9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAd,EAAA,MAAAe,GAAoB,oBAAI,IAAG;AAM3B;AAAA;AAAA;AAAA;AAAA,IAAAf,EAAA,MAAAgB,IAAsB,oBAAI,IAAG;AAE7B,IAAA1R,EAAA,iBAAU;AAEV,IAAA0Q,EAAA,MAAAiB,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BpB,YAAY1F,GAAQ;AACnB,IAAK2F,EAAA,MAAKH,GAAkB,IAAIxF,CAAM,KACrC2F,EAAA,MAAKH,GAAkB,IAAIxF,GAAQ,EAAE,GAAG,CAAA,GAAI,GAAG,CAAA,GAAI,GAEpD2F,EAAA,MAAKF,IAAoB,OAAOzF,CAAM;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAcA,GAAQ4F,IAAW,CAACzF,MAAM,KAAK,SAASA,CAAC,GAAG;AACzD,QAAI0F,IAAUF,EAAA,MAAKH,GAAkB,IAAIxF,CAAM;AAC/C,QAAI6F,GAAS;AACZ,MAAAF,EAAA,MAAKH,GAAkB,OAAOxF,CAAM;AAEpC,eAASG,KAAK0F,EAAQ;AACrB,QAAAxF,EAAkBF,GAAGnH,CAAK,GAC1B4M,EAASzF,CAAC;AAGX,WAAKA,KAAK0F,EAAQ;AACjB,QAAAxF,EAAkBF,GAAGlH,CAAW,GAChC2M,EAASzF,CAAC;AAAA,IAEZ;AACA,IAAAwF,EAAA,MAAKF,IAAoB,IAAIzF,CAAM;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgSA,QAAQ8F,GAAQ1S,GAAO2S,IAAa,IAAO;AAC1C,IAAID,EAAO,MAAMpQ,KAAiB,CAAC,KAAK,SAAS,IAAIoQ,CAAM,KAC1D,KAAK,SAAS,IAAIA,GAAQA,EAAO,CAAC,IAI9BA,EAAO,IAAI/L,QAAiB,MAChC,KAAK,QAAQ,IAAI+L,GAAQ,CAAC1S,GAAO2S,CAAU,CAAC,GAC5C9B,KAAA,QAAAA,EAAc,IAAI6B,GAAQ1S,KAGtB,KAAK,YACT0S,EAAO,IAAI1S;AAAA,EAEb;AAAA,EAEA,WAAW;AACV,IAAA2Q,IAAgB;AAAA,EACjB;AAAA,EAEA,aAAa;AACZ,IAAAA,IAAgB,MAChBE,IAAe;AAAA,EAChB;AAAA,EAEA,QAAQ;AACP,QAAI;AAKH,MAAAE,KAAgB,IAChBJ,IAAgB,MAEhBiC,EAAA,MAAKtB,GAAAuB,IAAL;AAAA,IACD,UAAC;AACA,MAAA3B,KAAc,GACdJ,KAAwB,MACxBE,KAAoB,MACpBC,KAAiB,MACjBF,KAAgB,IAEhBJ,IAAgB,MAChBE,IAAe,MAEfiC,GAAW,MAAK;AAAA,IAOjB;AAAA,EACD;AAAA,EAEA,UAAU;AACT,eAAWlP,KAAM2O,EAAA,MAAKZ,IAAoB,CAAA/N,EAAG,IAAI;AACjD,IAAA2O,EAAA,MAAKZ,IAAmB,MAAK,GAC7BY,EAAA,MAAKX,IAAuB,MAAK,GAEjCgB,EAAA,MAAKtB,GAAAyB,IAAL;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,wBAAwBnG,GAAQ;AAC/B,IAAA2F,EAAA,MAAKN,IAAa,KAAKrF,CAAM;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EA+HA,UAAUoG,GAAUpG,GAAQ;AAG3B,QAFAqG,EAAA,MAAKpB,IAALU,EAAA,MAAKV,MAAY,IAEbmB,GAAU;AACb,UAAIE,IAAyBX,EAAA,MAAKT,GAAkB,IAAIlF,CAAM,KAAK;AACnE,MAAA2F,EAAA,MAAKT,GAAkB,IAAIlF,GAAQsG,IAAyB,CAAC;AAAA,IAC9D;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAUF,GAAUpG,GAAQ;AAG3B,QAFAqG,EAAA,MAAKpB,IAALU,EAAA,MAAKV,MAAY,IAEbmB,GAAU;AACb,UAAIE,IAAyBX,EAAA,MAAKT,GAAkB,IAAIlF,CAAM,KAAK;AAEnE,MAAIsG,MAA2B,IAC9BX,EAAA,MAAKT,GAAkB,OAAOlF,CAAM,IAEpC2F,EAAA,MAAKT,GAAkB,IAAIlF,GAAQsG,IAAyB,CAAC;AAAA,IAE/D;AAEA,IAAIX,EAAA,MAAKD,QACTW,EAAA,MAAKX,IAAoB,KAEzB/F,GAAiB,MAAM;AACtB,MAAA0G,EAAA,MAAKX,IAAoB,KAErB,KAAK,UACR,KAAK,MAAK;AAAA,IAEZ,CAAC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB5E,GAAeC,GAAqB;AACpD,eAAWZ,KAAKW;AACf,MAAA6E,EAAA,MAAKL,IAAe,IAAInF,CAAC;AAG1B,eAAWA,KAAKY;AACf,MAAA4E,EAAA,MAAKJ,GAAqB,IAAIpF,CAAC;AAGhC,IAAAW,EAAc,MAAK,GACnBC,EAAoB,MAAK;AAAA,EAC1B;AAAA;AAAA,EAGA,SAAS/J,GAAI;AACZ,IAAA2O,EAAA,MAAKb,IAAkB,IAAI9N,CAAE;AAAA,EAC9B;AAAA;AAAA,EAGA,UAAUA,GAAI;AACb,IAAA2O,EAAA,MAAKZ,IAAmB,IAAI/N,CAAE;AAAA,EAC/B;AAAA;AAAA,EAGA,eAAeA,GAAI;AAClB,IAAA2O,EAAA,MAAKX,IAAuB,IAAIhO,CAAE;AAAA,EACnC;AAAA,EAEA,4BAA4B;AAC3B,eAAWA,KAAM2O,EAAA,MAAKX,IAAwB,CAAAhO,EAAG,IAAI;AACrD,IAAA2O,EAAA,MAAKX,IAAuB,MAAK;AAAA,EAClC;AAAA,EAEA,UAAU;AACT,YAAQW,EAAA,MAAKR,OAALkB,EAAA,MAAKlB,IAAc/N,GAAQ,IAAI;AAAA,EACxC;AAAA,EAEA,OAAO,SAAS;;AACf,QAAI2M,MAAkB,MAAM;AAC3B,YAAMwC,IAASxC,IAAgB,IAAIS;AACnC,MAAAwB,EAAAtL,IAAA6L,GAAM7B,GAAA8B,IAAN,KAAA9L,IAEI,CAACyJ,MAAiB,CAACvE,MACtBD,GAAiB,MAAM;AACtB,QAAKgG,EAAAY,GAAM5B,OACV4B,EAAM,MAAK;AAAA,MAEb,CAAC;AAAA,IAEH;AAEA,WAAOxC;AAAA,EACR;AAAA,EAEA,QAAQ;AACgF;AACtF,MAAAE,IAAe;AACf;AAAA,IACD;AAAA,EA2CD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAASjE,GAAQ;;AAKhB,QAJAkE,KAAwBlE,IAKvBtF,IAAAsF,EAAO,MAAP,QAAAtF,EAAU,eACTsF,EAAO,KAAKzH,KAASC,KAAgBC,SAAqB,MAC1DuH,EAAO,IAAI5G,QAAkB,GAC7B;AACD,MAAA4G,EAAO,EAAE,aAAaA,CAAM;AAC5B;AAAA,IACD;AAIA,aAFIG,IAAIH,GAEDG,EAAE,WAAW,QAAM;AACzB,MAAAA,IAAIA,EAAE;AACN,UAAIsG,IAAQtG,EAAE;AAKd,UAAIiE,OAAsB,QAAQjE,MAAMrB,MAUrCmB,MAAoB,SAASA,EAAgB,IAAI3H,OAAa,MAC/D,CAACwK;AAED;AAIF,WAAK2D,KAAS7N,KAAcD,QAAoB,GAAG;AAClD,aAAK8N,IAAQ1N,OAAW;AAEvB;AAGD,QAAAoH,EAAE,KAAKpH;AAAA,MACR;AAAA,IACD;AAEA,IAAA4M,EAAA,MAAKP,GAAO,KAAKjF,CAAC;AAAA,EACnB;AA+BD;AAt3BCwE,KAAA,eAKAC,KAAA,eAGAC,KAAA,eAgCAC,KAAA,eAMAC,KAAA,eAMAC,KAAA,eAKAC,KAAA,eAMAC,IAAA,eAOAC,KAAA,eAMAC,IAAA,eAMAC,KAAA,eAMAC,KAAA,eAMAC,IAAA,eASAC,IAAA,eAMAC,KAAA,eAIAC,KAAA,eArHMhB,IAAA,eAuHNgC,KAAY,WAAG;AACd,MAAI,KAAK,QAAS,QAAO;AAEzB,aAAW1G,KAAU2F,EAAA,MAAKT,GAAkB,KAAI,GAAI;AAInD,aAHI/E,IAAIH,GACJ2G,IAAU,IAEPxG,EAAE,WAAW,QAAM;AACzB,UAAIwF,EAAA,MAAKH,GAAkB,IAAIrF,CAAC,GAAG;AAClC,QAAAwG,IAAU;AACV;AAAA,MACD;AAEA,MAAAxG,IAAIA,EAAE;AAAA,IACP;AAEA,QAAI,CAACwG;AACJ,aAAO;AAAA,EAET;AAEA,SAAO;AACR,GAqCAV,KAAQ,WAAG;;AAkBV,MAjBAI,EAAA,MAAK1B,IAAW,KAEZL,OAAgB,QACnB0B,EAAA,MAAKtB,GAAAyB,IAAL,YACAS,GAAmB,IAahB,CAACZ,EAAA,MAAKtB,GAAAgC,IAAL,YAAqB;AACzB,eAAWvG,KAAKwF,EAAA,MAAKL;AACpB,MAAAK,EAAA,MAAKJ,GAAqB,OAAOpF,CAAC,GAClCE,EAAkBF,GAAGnH,CAAK,GAC1B,KAAK,SAASmH,CAAC;AAGhB,eAAWA,KAAKwF,EAAA,MAAKJ;AACpB,MAAAlF,EAAkBF,GAAGlH,CAAW,GAChC,KAAK,SAASkH,CAAC;AAAA,EAEjB;AAEA,QAAM0G,IAAQlB,EAAA,MAAKP;AACnB,EAAAiB,EAAA,MAAKjB,GAAS,CAAA,IAEd,KAAK,MAAK;AAGV,MAAInG,IAAWmF,KAAoB,IAG/B0C,IAAiB,CAAA,GAMjBC,IAAW1C,KAAiB;AAEhC,aAAW2C,KAAQH;AAClB,QAAI;AACH,MAAAb,EAAA,MAAKtB,GAAAuC,IAAL,WAAeD,GAAM/H,GAAS6H;AAAA,IAC/B,SAAS3G,GAAG;AACX,YAAA+G,GAAUF,CAAI,GACR7G;AAAA,IACP;AAMD,MAFA4D,IAAgB,MAEZgD,EAAQ,SAAS,GAAG;AACvB,QAAIR,IAAQ/B,GAAM,OAAM;AACxB,eAAWrE,KAAK4G;AACf,MAAAR,EAAM,SAASpG,CAAC;AAAA,EAElB;AAMA,MAJAiE,KAAoB,MACpBC,KAAiB,MAGb2B,EAAA,MAAKtB,GAAAgC,IAAL,YAAqB;AACxB,IAAAV,EAAA,MAAKtB,GAAAyC,IAAL,WAAoBL,IACpBd,EAAA,MAAKtB,GAAAyC,IAAL,WAAoBlI;AAEpB,eAAW,CAACkB,GAAGiH,CAAC,KAAKzB,EAAA,MAAKH;AACzB,MAAA6B,GAAalH,GAAGiH,CAAC;AAGlB,IAAIL,EAAQ,SAAS;AAAA,IAC0Bf,EAAAtL,IAAAqJ,GAAgBW,GAAAuB,IAAhB,KAAAvL;AAG/C;AAAA,EACD;AAEA,QAAM4M,IAAgBtB,EAAA,MAAKtB,GAAA6C,IAAL;AAEtB,MAAID,GAAe;AAClB,IAAAtB,EAAAwB,IAAAF,GAAc5C,GAAA+C,IAAd,KAAAD,GAAqB;AACrB;AAAA,EACD;AAGA,EAAA7B,EAAA,MAAKL,IAAe,MAAK,GACzBK,EAAA,MAAKJ,GAAqB,MAAK;AAG/B,aAAWvO,KAAM2O,EAAA,MAAKb,IAAmB,CAAA9N,EAAG,IAAI;AAChD,EAAA2O,EAAA,MAAKb,IAAkB,MAAK,GAE5Bd,KAAiB,MACjB0D,GAAqBZ,CAAc,GACnCY,GAAqBzI,CAAO,GAC5B+E,KAAiB,OAEjB2D,IAAAhC,EAAA,MAAKR,QAAL,QAAAwC,EAAgB;AAEhB,MAAIC;AAAA;AAAA;AAAA,IAAkE7D;AAAA;AAmBtE,MAjBI,KAAK,UAAU4B,EAAA,MAAKV,QAAa,KACpCe,EAAA,MAAKtB,GAAAyB,IAAL,YAgBGR,EAAA,MAAKP,GAAO,SAAS,GAAG;AAC3B,IAAIwC,MAAe,SAClBA,IAAa,MACb5B,EAAA,MAAKtB,GAAA8B,IAAL;AAGD,UAAMD,IAAQqB;AACd,IAAAjC,EAAAY,GAAMnB,GAAO,KAAK,GAAGO,EAAA,MAAKP,GAAO,OAAO,CAACyC,MAAM,CAAClC,EAAAY,GAAMnB,GAAO,SAASyC,CAAC,CAAC,CAAC;AAAA,EAC1E;AAEA,EAAID,MAAe,QAClB5B,EAAA8B,IAAAF,GAAWlD,GAAAuB,IAAX,KAAA6B;AAEF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASAb,KAAS,SAACD,GAAM/H,GAAS6H,GAAgB;AACxC,EAAAE,EAAK,KAAKjO;AAIV,WAFIiH,IAASgH,EAAK,OAEXhH,MAAW,QAAM;AACvB,QAAIyG,IAAQzG,EAAO,GACf+H,KAAatB,KAAS9N,IAAgBC,SAAkB,GACxDoP,IAAsBD,MAActB,IAAQ1N,OAAW,GAEvDkP,IAAOD,MAAwBvB,IAAQvN,OAAW,KAAKyM,EAAA,MAAKH,GAAkB,IAAIxF,CAAM;AAE5F,QAAI,CAACiI,KAAQjI,EAAO,OAAO,MAAM;AAChC,MAAI+H,IACH/H,EAAO,KAAKjH,KACD0N,IAAQlO,QAAY,IAC/B0G,EAAQ,KAAKe,CAAM,IAGTkI,GAASlI,CAAM,OACpByG,IAAQ/N,OAAkB,KAAGiN,EAAA,MAAKJ,GAAqB,IAAIvF,CAAM,GACtEmI,GAAcnI,CAAM;AAGrB,UAAIoI,IAAQpI,EAAO;AAEnB,UAAIoI,MAAU,MAAM;AACnB,QAAApI,IAASoI;AACT;AAAA,MACD;AAAA,IACD;AAEA,WAAOpI,MAAW,QAAM;AACvB,UAAI3C,IAAO2C,EAAO;AAElB,UAAI3C,MAAS,MAAM;AAClB,QAAA2C,IAAS3C;AACT;AAAA,MACD;AAEA,MAAA2C,IAASA,EAAO;AAAA,IACjB;AAAA,EACD;AACD,GAEAuH,KAAmB,WAAG;AAGrB,WAFIhB,IAAQZ,EAAA,MAAKf,KAEV2B,MAAU,QAAM;AACtB,QAAI,CAACA,EAAM;AAEV,iBAAW,CAACnT,GAAO,CAAA,EAAG2S,CAAU,CAAC,KAAK,KAAK;AAC1C,YAAIQ,EAAM,QAAQ,IAAInT,CAAK,KAAK,CAAC2S;AAChC,iBAAOQ;AAAA;AAKV,IAAAA,IAAQZ,EAAAY,GAAM3B;AAAA,EACf;AAEA,SAAO;AACR;AAAA;AAAA;AAKA6C,KAAM,SAAClB,GAAO;;AACb,aAAW,CAACT,GAAQ1S,CAAK,KAAKmT,EAAM;AACnC,IAAI,CAAC,KAAK,SAAS,IAAIT,CAAM,KAAKS,EAAM,SAAS,IAAIT,CAAM,KAC1D,KAAK,SAAS,IAAIA,GAAQS,EAAM,SAAS,IAAIT,CAAM,CAAC,GAGrD,KAAK,QAAQ,IAAIA,GAAQ1S,CAAK;AAG/B,aAAW,CAAC4M,GAAQ5I,CAAQ,KAAKmP,EAAM,gBAAgB;AACtD,UAAM8B,IAAI,KAAK,eAAe,IAAIrI,CAAM;AACxC,IAAIqI,KAAGjR,EAAS,QAAQ,KAAKiR,EAAE,OAAO;AAAA,EACvC;AAUA,QAAMC,IAAO,CAAClV,MAAU;AACvB,QAAImV,IAAYnV,EAAM;AACtB,QAAImV,MAAc;AAElB,iBAAWC,KAAYD,GAAW;AACjC,YAAI9B,IAAQ+B,EAAS;AAErB,aAAK/B,IAAQnO,OAAa;AACzB,UAAAgQ;AAAA;AAAA,YAA6BE;AAAA,UAAQ;AAAA,aAC/B;AACN,cAAIxI;AAAA;AAAA,YAAgCwI;AAAA;AAEpC,UAAI/B,KAAS3M,KAAQpB,MAAiB,CAAC,KAAK,eAAe,IAAIsH,CAAM,MACpE2F,EAAA,MAAKJ,GAAqB,OAAOvF,CAAM,GACvCK,EAAkBL,GAAQhH,CAAK,GAC/B,KAAK,SAASgH,CAAM;AAAA,QAEtB;AAAA,MACD;AAAA,EACD;AAEA,aAAW8F,KAAU,KAAK,QAAQ,KAAI;AACrC,IAAAwC,EAAKxC,CAAM;AAGZ,OAAK,SAAS,MAAMS,EAAM,QAAO,CAAE,GACnCP,EAAAtL,IAAA6L,GAAM7B,GAAAyB,IAAN,KAAAzL,IAEAqJ,IAAgB,MAChBiC,EAAA,MAAKtB,GAAAuB,IAAL;AACD;AAAA;AAAA;AAKAkB,KAAc,SAAClI,GAAS;AACvB,WAAS9H,IAAI,GAAGA,IAAI8H,EAAQ,QAAQ9H,KAAK;AACxC,IAAA0J,GAAa5B,EAAQ9H,CAAC,GAAGwO,EAAA,MAAKL,KAAgBK,EAAA,MAAKJ,EAAoB;AAEzE,GA+EAkD,KAAO,WAAG;;AACT,EAAAzC,EAAA,MAAKtB,GAAAyB,IAAL;AAMA,WAASI,IAAQ1C,IAAa0C,MAAU,MAAMA,IAAQZ,EAAAY,GAAM1B,KAAO;AAClE,QAAI6D,IAAanC,EAAM,KAAK,KAAK,IAG7BoC,IAAU,CAAA;AAEd,eAAW,CAAC7C,GAAQ,CAAC1S,GAAO2S,CAAU,CAAC,KAAK,KAAK,SAAS;AACzD,UAAIQ,EAAM,QAAQ,IAAIT,CAAM,GAAG;AAC9B,YAAI8C;AAAA;AAAA,UAA6CrC,EAAM,QAAQ,IAAIT,CAAM,EAAG,CAAC;AAAA;AAE7E,YAAI4C,KAActV,MAAUwV;AAE3B,UAAArC,EAAM,QAAQ,IAAIT,GAAQ,CAAC1S,GAAO2S,CAAU,CAAC;AAAA;AAI7C;AAAA,MAEF;AAEA,MAAA4C,EAAQ,KAAK7C,CAAM;AAAA,IACpB;AAEA,QAAI4C;AAGH,iBAAW,CAAC1I,GAAQ5I,CAAQ,KAAK,KAAK,gBAAgB;AACrD,cAAMiR,IAAI9B,EAAM,eAAe,IAAIvG,CAAM;AACzC,QAAIqI,KAAGjR,EAAS,QAAQ,KAAKiR,EAAE,OAAO;AAAA,MACvC;AAGD,QAAK1C,EAAAY,GAAM5B,KAGX;AAAA,UAAIkE,IAAS,CAAC,GAAGtC,EAAM,QAAQ,KAAI,CAAE,EAAE,OAAO,CAACuC,MAAM,CAAC,KAAK,QAAQ,IAAIA,CAAC,CAAC;AAEzE,UAAID,EAAO,WAAW;AACrB,QAAIH,KAEHnC,EAAM,QAAO;AAAA,eAEJoC,EAAQ,SAAS,GAAG;AAQ9B,YAAID;AACH,qBAAWK,KAAapD,EAAA,MAAKF;AAC5B,YAAAc,EAAM,cAAcwC,GAAW,CAAC5I,MAAM;;AACrC,eAAKA,EAAE,KAAKzH,IAAeoB,SAAY,IACtCyM,EAAM,SAASpG,CAAC,IAEhB6F,EAAAtL,IAAA6L,GAAM7B,GAAAyC,IAAN,KAAAzM,GAAqB,CAACyF,CAAC;AAAA,YAEzB,CAAC;AAIH,QAAAoG,EAAM,SAAQ;AAGd,YAAIyC,IAAS,oBAAI,IAAG,GAGhBC,IAAU,oBAAI,IAAG;AAErB,iBAASnD,KAAU6C;AAClB,UAAAO,GAAapD,GAAQ+C,GAAQG,GAAQC,CAAO;AAG7C,QAAAA,IAAU,oBAAI,IAAG;AACjB,YAAIE,IAAkB,CAAC,GAAG5C,EAAM,QAAQ,MAAM,EAAE;AAAA,UAAO,CAAC6C,MACvD,KAAK,QAAQ,IAAIA,CAAC;AAAA;AAAA,YACgB,KAAK,QAAQ,IAAIA,CAAC,EAAG,CAAC,MAAMA,EAAE;AAAA,cAC7D;AAAA,QACR;AAEI,YAAID,EAAgB,SAAS;AAC5B,qBAAWnJ,KAAU2F,EAAA,MAAKN;AACzB,aACErF,EAAO,KAAK7G,IAAYD,IAAQK,SAAmB,KACpD8P,GAAWrJ,GAAQmJ,GAAiBF,CAAO,OAEtCjJ,EAAO,KAAKlG,KAAQpB,QAAmB,KAC3C2H,EAAkBL,GAAQhH,CAAK,GAC/BuN,EAAM,SAASvG,CAAM,KAErB2F,EAAAY,GAAMjB,IAAe,IAAItF,CAAM;AAQnC,YAAI2F,EAAAY,GAAMnB,GAAO,SAAS,KAAK,CAACO,EAAAY,GAAMb,KAAmB;AACxD,UAAAa,EAAM,MAAK;AAEX,mBAASS,KAAQrB,EAAAY,GAAMnB;AACtB,YAAAY,EAAAtL,IAAA6L,GAAM7B,GAAAuC,IAAN,KAAAvM,GAAgBsM,GAAM,CAAA,GAAI,CAAA;AAG3B,UAAAX,EAAAE,GAAMnB,GAAS,CAAA;AAAA,QAChB;AAEA,QAAAmB,EAAM,WAAU;AAAA,MACjB;AAAA;AAAA,EACD;AACD,GAgNAC,KAAK,WAAG;AACP,EAAI1C,OAAe,OAClBD,KAAcC,KAAa,QAE3BuC,EAAAvC,IAAWe,IAAQ,OACnBwB,EAAA,MAAKzB,IAAQd,MAGdA,KAAa;AACd,GAEAqC,KAAO,WAAG;AACT,MAAImD,IAAO3D,EAAA,MAAKf,KACZvH,IAAOsI,EAAA,MAAKd;AAEhB,EAAIyE,MAAS,OACZzF,KAAcxG,IAEdgJ,EAAAiD,GAAKzE,IAAQxH,IAGVA,MAAS,OACZyG,KAAawF,IAEbjD,EAAAhJ,GAAKuH,IAAQ0E,IAGd,KAAK,SAAS;AACf;AAz3BM,IAAMC,KAAN/E;AAo4BA,SAASgF,GAAUxS,GAAI;AAC7B,MAAIyS,IAAoB7J;AACxB,EAAAA,KAAmB;AAEnB,MAAI;AACH,QAAIzH;AAUJ,SARInB,MACC+M,MAAkB,QAAQ,CAACA,EAAc,WAC5CA,EAAc,MAAK,GAGpB5L,IAASnB,EAAE,QAGC;AAGZ,UAFA6I,GAAW,GAEPkE,MAAkB;AACrB;AAAA;AAAA,UAAyB5L;AAAA;AAG1B,MAAA4L,EAAc,MAAK;AAAA,IACpB;AAAA,EACD,UAAC;AACA,IAAAnE,KAAmB6J;AAAA,EACpB;AACD;AAEA,SAAS7C,KAAsB;AAyB9B,MAAI;AACH8C,IAAAA,GAA8B;AAAA,EAC/B,SAAS3J,GAAO;AAQf,IAAAG,GAAsBH,GAAOmE,EAAqB;AAAA,EACnD;AACD;AAGO,IAAIyF,IAAsB;AAMjC,SAASjC,GAAqBzI,GAAS;AACtC,MAAI2K,IAAS3K,EAAQ;AACrB,MAAI2K,MAAW,GAIf;AAAA,aAFIzS,IAAI,GAEDA,IAAIyS,KAAQ;AAClB,UAAI5J,IAASf,EAAQ9H,GAAG;AAExB,WAAK6I,EAAO,KAAK7G,IAAYD,QAAY,KAAKgP,GAASlI,CAAM,MAC5D2J,IAAsB,oBAAI,IAAG,GAE7BxB,GAAcnI,CAAM,GAQnBA,EAAO,SAAS,QAChBA,EAAO,UAAU,QACjBA,EAAO,UAAU,QACjBA,EAAO,aAAa,QACpBA,EAAO,OAAO,QAGd6J,GAAc7J,CAAM,IAKjB2J,KAAA,gBAAAA,EAAqB,QAAO,IAAG;AAClC,QAAAzD,GAAW,MAAK;AAEhB,mBAAW/F,KAAKwJ,GAAqB;AAEpC,eAAKxJ,EAAE,KAAKhH,IAAYD,QAAY,EAAG;AAIvC,gBAAM4Q,IAAkB,CAAC3J,CAAC;AAC1B,cAAI4J,IAAW5J,EAAE;AACjB,iBAAO4J,MAAa;AACnB,YAAIJ,EAAoB,IAAII,CAAQ,MACnCJ,EAAoB,OAAOI,CAAQ,GACnCD,EAAgB,KAAKC,CAAQ,IAE9BA,IAAWA,EAAS;AAGrB,mBAASC,IAAIF,EAAgB,SAAS,GAAGE,KAAK,GAAGA,KAAK;AACrD,kBAAM7J,IAAI2J,EAAgBE,CAAC;AAE3B,aAAK7J,EAAE,KAAKhH,IAAYD,QAAY,KACpCiP,GAAchI,CAAC;AAAA,UAChB;AAAA,QACD;AAEA,QAAAwJ,EAAoB,MAAK;AAAA,MAC1B;AAAA,IAEF;AAEA,IAAAA,IAAsB;AAAA;AACvB;AAWA,SAAST,GAAa9V,GAAOuV,GAASK,GAAQC,GAAS;AACtD,MAAI,CAAAD,EAAO,IAAI5V,CAAK,MACpB4V,EAAO,IAAI5V,CAAK,GAEZA,EAAM,cAAc;AACvB,eAAWoV,KAAYpV,EAAM,WAAW;AACvC,YAAMqT,IAAQ+B,EAAS;AAEvB,OAAK/B,IAAQnO,OAAa,IACzB4Q;AAAA;AAAA,QAAqCV;AAAA,QAAWG;AAAA,QAASK;AAAA,QAAQC;AAAA,MAAO,KAEvExC,KAAS3M,KAAQpB,QAAmB,MACpC+N,IAAQzN,OAAW,KACpBqQ,GAAWb,GAAUG,GAASM,CAAO,MAErC5I,EAAkBmI,GAAUxP,CAAK,GACjCiR;AAAA;AAAA,QAAuCzB;AAAA,MAAQ;AAAA,IAEjD;AAEF;AASA,SAAS0B,GAAmB9W,GAAO6L,GAAS;AAC3C,MAAI7L,EAAM,cAAc;AAExB,eAAWoV,KAAYpV,EAAM,WAAW;AACvC,YAAMqT,IAAQ+B,EAAS;AAEvB,OAAK/B,IAAQnO,OAAa,IACzB4R;AAAA;AAAA,QAA2C1B;AAAA,QAAWvJ;AAAA,MAAO,KAClDwH,IAAQlN,QAAkB,MACrC8G,EAAkBmI,GAAUxP,CAAK,GACjCiG,EAAQ;AAAA;AAAA,QAA2BuJ;AAAA,MAAQ;AAAA,IAE7C;AACD;AAOA,SAASa,GAAWb,GAAUG,GAASM,GAAS;AAC/C,QAAMkB,IAAUlB,EAAQ,IAAIT,CAAQ;AACpC,MAAI2B,MAAY,OAAW,QAAOA;AAElC,MAAI3B,EAAS,SAAS;AACrB,eAAW5H,KAAO4H,EAAS,MAAM;AAChC,UAAItS,GAAS,KAAKyS,GAAS/H,CAAG;AAC7B,eAAO;AAGR,WAAKA,EAAI,IAAItI,OAAa,KAAK+Q;AAAA;AAAA,QAAmCzI;AAAA,QAAM+H;AAAA,QAASM;AAAA,MAAO;AACvF,eAAAA,EAAQ;AAAA;AAAA,UAA4BrI;AAAA,UAAM;AAAA,QAAI,GACvC;AAAA,IAET;AAGD,SAAAqI,EAAQ,IAAIT,GAAU,EAAK,GAEpB;AACR;AAMO,SAASyB,GAAgBjK,GAAQ;AAClB,EAAC+D,EAAe,SAAS/D,CAAM;AACrD;AAiFA,SAASqH,GAAarH,GAAQ6F,GAAS;AAEtC,MAAK,GAAA7F,EAAO,IAAIrH,OAAmB,MAAMqH,EAAO,IAAIjH,OAAW,IAI/D;AAAA,KAAKiH,EAAO,IAAIhH,OAAW,IAC1B6M,EAAQ,EAAE,KAAK7F,CAAM,KACVA,EAAO,IAAI/G,OAAiB,KACvC4M,EAAQ,EAAE,KAAK7F,CAAM,GAGtBK,EAAkBL,GAAQjH,CAAK;AAG/B,aADIoH,IAAIH,EAAO,OACRG,MAAM;AACZ,MAAAkH,GAAalH,GAAG0F,CAAO,GACvB1F,IAAIA,EAAE;AAAA;AAER;AAMA,SAAS+G,GAAUlH,GAAQ;AAC1B,EAAAK,EAAkBL,GAAQjH,CAAK;AAG/B,WADIoH,IAAIH,EAAO,OACRG,MAAM;AACZ,IAAA+G,GAAU/G,CAAC,GACXA,IAAIA,EAAE;AAER;AAqBO,SAASiK,GAAKpT,GAAI;AAEvBqT,EAAAA,GAAoC,GAGjCtG,MAAkB,QACrBuG,GAAa;AAGd,MAAI/D,IAAQgD,GAAM,OAAM;AACxB,EAAAhD,EAAM,UAAU,IAChBtC,IAAe,oBAAI,IAAG;AAEtB,MAAIsG,IAAY,IACZC,IAAUjE,EAAM,QAAO;AAE3B,SAAAiD,GAAUxS,CAAE,GAEL;AAAA,IACN,QAAQ,YAAY;AACnB,UAAIuT,GAAW;AACd,cAAMC;AACN;AAAA,MACD;AAEA,MAAKjE,EAAM,UACVkE,GAAgB,GAGjBF,IAAY,IAEZhE,EAAM,UAAU;AAGhB,eAAS,CAACT,GAAQ,CAAC1S,CAAK,CAAC,KAAKmT,EAAM;AACnC,QAAAT,EAAO,IAAI1S,GACX0S,EAAO,KAAK4E,GAAuB;AAGpC,MAAAnE,EAAM,SAAQ,GACdA,EAAM,0BAAyB,GAC/BA,EAAM,WAAU,GAOhBiD,GAAU,MAAM;AAEf,YAAImB,IAAgB,oBAAI,IAAG;AAE3B,iBAAS7E,KAAUS,EAAM,QAAQ,KAAI;AACpC,UAAA2D,GAAmBpE,GAAQ6E,CAAa;AAGzC,QAAAC,GAAkBD,CAAa,GAC/BE,GAAmB;AAAA,MACpB,CAAC,GAEDtE,EAAM,MAAK,GACX,MAAMiE;AAAA,IACP;AAAA,IACA,SAAS,MAAM;AAId,eAAS1E,KAAUS,EAAM,QAAQ,KAAI;AACpC,QAAAT,EAAO,KAAK4E,GAAuB;AAGpC,MAAI,CAACH,KAAahE,EAAM,UACvBA,EAAM,QAAO;AAAA,IAEf;AAAA,EACF;AACA;AC13CO,SAASuE,GAAQC,GAAUrI,GAAMsI,GAAOhU,GAAI;AAClD,QAAMqR,IAAIlJ,OAAasB,KAAUwK;AAGjC,MAAIzI,IAAUuI,EAAS,OAAO,CAACzP,MAAM,CAACA,EAAE,OAAO;AAE/C,MAAI0P,EAAM,WAAW,KAAKxI,EAAQ,WAAW,GAAG;AAC/C,IAAAxL,EAAG0L,EAAK,IAAI2F,CAAC,CAAC;AACd;AAAA,EACD;AAEA,MAAI/I;AAAA;AAAA,IAAgCR;AAAA,KAEhCoM,IAAUC,GAAO,GACjBC,IACH5I,EAAQ,WAAW,IAChBA,EAAQ,CAAC,EAAE,UACXA,EAAQ,SAAS,IAChB,QAAQ,IAAIA,EAAQ,IAAI,CAAClH,MAAMA,EAAE,OAAO,CAAC,IACzC;AAGL,WAAS+P,EAAO9I,GAAQ;AACvB,SAAKjD,EAAO,IAAInG,OAAe,GAI/B;AAAA,MAAA+R,EAAO;AAEP,UAAI;AACH,QAAAlU,EAAGuL,CAAM;AAAA,MACV,SAASxC,GAAO;AACf,QAAAG,GAAsBH,GAAOT,CAAM;AAAA,MACpC;AAEA,MAAAgM,GAAa;AAAA;AAAA,EACd;AAEA,MAAIC,IAAoBC,GAAiB;AAGzC,MAAIR,EAAM,WAAW,GAAG;AACK,IAACI,EAC3B,KAAK,MAAMC,EAAO3I,EAAK,IAAI2F,CAAC,CAAC,CAAC,EAC9B,QAAQkD,CAAiB;AAE3B;AAAA,EACD;AAGA,WAASxU,IAAM;AACd,YAAQ,IAAIiU,EAAM,IAAI,CAACS,MAAe,gBAAAC,GAAcD,CAAU,CAAC,CAAC,EAC9D,KAAK,CAACtT,MAAWkT,EAAO,CAAC,GAAG3I,EAAK,IAAI2F,CAAC,GAAG,GAAGlQ,CAAM,CAAC,CAAC,EACpD,MAAM,CAAC4H,MAAUG,GAAsBH,GAAOT,CAAM,CAAC,EACrD,QAAQiM,CAAiB;AAAA,EAC5B;AAEA,EAAIH,IACHA,EAAgB,KAAK,MAAM;AAC1B,IAAAF,EAAO,GACPnU,EAAG,GACHuU,GAAa;AAAA,EACd,CAAC,IAEDvU,EAAG;AAEL;AAeO,SAASoU,KAAU;AACzB,MAAIQ;AAAA;AAAA,IAAyC7M;AAAA,KACzC8M,IAAoB3L,GACpB4L,IAA6B5N,GAC7B+F;AAAA;AAAA,IAAuCD;AAAA;AAM3C,SAAO,SAAiB+H,IAAiB,IAAM;AAC9C,IAAAC,GAAkBJ,CAAe,GACjCK,GAAoBJ,CAAiB,GACrC1N,GAAsB2N,CAA0B,GAE5CC,MAAmBH,EAAgB,IAAIxS,OAAe,MAGzD6K,KAAA,QAAAA,EAAgB,YAChBA,KAAA,QAAAA,EAAgB;AAAA,EAOlB;AACD;AAiHO,SAASsH,GAAcW,IAAmB,IAAM;AACtD,EAAAF,GAAkB,IAAI,GACtBC,GAAoB,IAAI,GACxB9N,GAAsB,IAAI,GACtB+N,MAAkBlI,KAAA,QAAAA,EAAe;AAMtC;AAuFO,SAASyH,KAAoB;AACnC,MAAIxL;AAAA;AAAA,IAAgClB;AAAA,KAChCoN;AAAA;AAAA,IAAoClM,EAAO;AAAA,KAC3CuG;AAAA;AAAA,IAA8BxC;AAAA,KAC9BqC,IAAW8F,EAAS,YAAW;AAEnC,SAAAA,EAAS,qBAAqB,GAAG3F,CAAK,GACtCA,EAAM,UAAUH,GAAUpG,CAAM,GAEzB,MAAM;AACZ,IAAAkM,EAAS,qBAAqB,IAAI3F,CAAK,GACvCA,EAAM,UAAUH,GAAUpG,CAAM;AAAA,EACjC;AACD;AAAA;ACvSO,SAASS,GAAQzJ,GAAI;AAC3B,MAAIyP,IAAQnO,IAAUU;AAEtB,SAAI8F,MAAkB,SAGrBA,EAAc,KAAKrF,KAIL;AAAA,IACd,KAAKwE;AAAA,IACL,MAAM;AAAA,IACN,SAAS;AAAA,IACT,QAAAN;AAAA,IACA,GAAG8I;AAAA,IACH,IAAAzP;AAAA,IACA,WAAW;AAAA,IACX,IAAI;AAAA,IACJ;AAAA;AAAA,MAAqBtB;AAAA;AAAA,IACrB,IAAI;AAAA,IACJ,QAAQoJ;AAAA,IACR,IAAI;AAAA,EACN;AAOA;AAEO,MAAMqN,KAAW,OAAO,UAAU;AAAA;AAUlC,SAAST,GAAc1U,GAAIoV,GAAO3P,GAAU;AAClD,MAAI6C;AAAA;AAAA,IAAuCR;AAAA;AAE3C,EAAIQ,MAAW,QACd+M,GAAsB;AAGvB,MAAI9U;AAAA;AAAA;AAAA,IAA6D;AAAA,KAC7D+I,IAASwF;AAAA;AAAA,IAAyBpQ;AAAA,EAAa,GAK/C4W,IAAiB,CAACrM,GAGlBsM,IAAY,oBAAI,IAAG;AAEvB,SAAAC,GAAa,MAAM;;AAClB,QAAIxM;AAAA;AAAA,MAAgClB;AAAA,OAOhCuJ,IAAIjR,GAAQ;AAChB,IAAAG,IAAU8Q,EAAE;AAEZ,QAAI;AAIH,cAAQ,QAAQrR,EAAE,CAAE,EAClB,KAAKqR,EAAE,SAAS,CAAClI,MAAM;AAGvB,QAAIA,MAAM3F,MAAgB6N,EAAE,OAAOlI,CAAC;AAAA,MACrC,CAAC,EACA,QAAQmL,EAAa;AAAA,IACxB,SAASvL,GAAO;AACf,MAAAsI,EAAE,OAAOtI,CAAK,GACduL,GAAa;AAAA,IACd;AAwBA,QAAI/E;AAAA;AAAA,MAA8BxC;AAAA;AAElC,QAAIuI,GAAgB;AAInB,WAAKtM,EAAO,IAAI5G,QAAkB;AACjC,YAAImS,IAAoBC,GAAiB;AAG1C;AAAA;AAAA,QAA6BlM,EAAO,EAAG;;AACtC,SAAA5E,IAAA6L,EAAM,eAAe,IAAIvG,CAAM,MAA/B,QAAAtF,EAAkC,OAAOyR;AAAA;AAIzC,mBAAW9D,KAAKkE,EAAU;AACzB,UAAAlE,EAAE,OAAO8D,EAAQ;AAInB,MAAAI,EAAU,IAAIlE,CAAC,GACf9B,EAAM,eAAe,IAAIvG,GAAQqI,CAAC;AAAA,IACnC;AAMA,UAAMoE,IAAU,CAACrZ,GAAO2M,IAAQ,WAAc;AAQ7C,MAHAwL,KAAA,QAAAA,KACAgB,EAAU,OAAOlE,CAAC,GAEdtI,MAAUoM,OAEd5F,EAAM,SAAQ,GAEVxG,KACHO,EAAO,KAAKvG,IAGZ2S,GAAapM,GAAQP,CAAK,OAErBO,EAAO,IAAIvG,QAAiB,MAChCuG,EAAO,KAAKvG,KAGb2S,GAAapM,GAAQlN,CAAK,IAc3BmT,EAAM,WAAU;AAAA,IACjB;AAEA,IAAA8B,EAAE,QAAQ,KAAKoE,GAAS,CAACtM,MAAMsM,EAAQ,MAAMtM,KAAK,SAAS,CAAC;AAAA,EAC7D,CAAC,GAEDuD,GAAS,MAAM;AACd,eAAW2E,KAAKkE;AACf,MAAAlE,EAAE,OAAO8D,EAAQ;AAAA,EAEnB,CAAC,GAQM,IAAI,QAAQ,CAACQ,MAAW;AAE9B,aAAStP,EAAKuP,GAAG;AAChB,eAASC,IAAK;AACb,QAAID,MAAMrV,IACToV,EAAOrM,CAAM,IAIbjD,EAAK9F,CAAO;AAAA,MAEd;AAEA,MAAAqV,EAAE,KAAKC,GAAIA,CAAE;AAAA,IACd;AAEA,IAAAxP,EAAK9F,CAAO;AAAA,EACb,CAAC;AACF;AAAA;AAQO,SAASuV,GAAa9V,GAAI;AAChC,QAAMqR,IAAI,gBAAA5H,GAAQzJ,CAAE;AAEE,SAAA+V,GAAoB1E,CAAC,GAEpCA;AACR;AAAA;AAQO,SAAS4C,GAAmBjU,GAAI;AACtC,QAAMsJ,IAAS,gBAAAG,GAAQzJ,CAAE;AACzB,SAAAsJ,EAAO,SAASzC,IACTyC;AACR;AAMO,SAAS0M,GAAwBvM,GAAS;AAChD,MAAIxB,IAAUwB,EAAQ;AAEtB,MAAIxB,MAAY,MAAM;AACrB,IAAAwB,EAAQ,UAAU;AAElB,aAAStJ,IAAI,GAAGA,IAAI8H,EAAQ,QAAQ9H,KAAK;AACxC,MAAA8V;AAAA;AAAA,QAAsChO,EAAQ9H,CAAC;AAAA,MAAC;AAAA,EAElD;AACD;AAcO,SAAS+V,GAAgBzM,GAAS;AACxC,MAAIrN,GACA+Z,IAAqBrO,GACrBQ,IAASmB,EAAQ;AAErB,MACC,CAAC2M,MACD9N,MAAW,QACXmB,EAAQ,MAAM/K;AAAA,GACb4J,EAAO,KAAKnG,IAAYD,QAAY;AAErCmU,WAAAA,GAAe,GAER5M,EAAQ;AAGhB,EAAAsL,GAAkBzM,CAAM;AAqBvB,MAAI;AACH,IAAAmB,EAAQ,KAAK,CAAC7G,IACdoT,GAAwBvM,CAAO,GAC/BrN,IAAQka,GAAgB7M,CAAO;AAAA,EAChC,UAAC;AACA,IAAAsL,GAAkBoB,CAAkB;AAAA,EACrC;AAGD,SAAO/Z;AACR;AAMO,SAASma,GAAe9M,GAAS;AACvC,MAAIrN,IAAQ8Z,GAAgBzM,CAAO;AAEnC,MAAI,CAACA,EAAQ,OAAOrN,CAAK,MACxBqN,EAAQ,KAAKiK,GAAuB,IAMhC,EAAC3G,KAAA,QAAAA,EAAe,YAAWtD,EAAQ,SAAS,UAC3CsD,MAAkB,QAOrBA,EAAc,QAAQtD,GAASrN,GAAO,EAAI,GAC1C4Q,MAAA,QAAAA,GAAgB,QAAQvD,GAASrN,GAAO,OAExCqN,EAAQ,IAAIrN,GAITqN,EAAQ,SAAS,QAAM;AAC1B,IAAAJ,EAAkBI,GAAS1H,CAAK;AAChC;AAAA,EACD;AAMF,EAAIqU,OAMAnJ,MAAiB,QAGhBuJ,GAAe,KAAMzJ,KAAA,QAAAA,EAAe,YACvCE,EAAa,IAAIxD,GAASrN,CAAK,IAGhCoN,GAAsBC,CAAO;AAE/B;AAKO,SAASgN,GAAuBhN,GAAS;;AAC/C,MAAIA,EAAQ,YAAY;AAExB,eAAWN,KAAKM,EAAQ;AAEvB,OAAIN,EAAE,YAAYA,EAAE,SACnBzF,IAAAyF,EAAE,aAAF,QAAAzF,EAAA,KAAAyF,KACAqH,IAAArH,EAAE,OAAF,QAAAqH,EAAM,MAAMhN,KAMR2F,EAAE,OAAO,SAAMA,EAAE,WAAWtJ,IAChCsJ,EAAE,KAAK,MAEPuN,GAAiBvN,GAAG,CAAC,GACrBwN,GAAwBxN,CAAC;AAG5B;AAKO,SAASyN,GAAyBnN,GAAS;AACjD,MAAIA,EAAQ,YAAY;AAExB,eAAWN,KAAKM,EAAQ;AAGvB,MAAIN,EAAE,YAAYA,EAAE,OAAO,QAC1BgI,GAAchI,CAAC;AAGlB;AC3aO,IAAIwK,KAAgB,oBAAI,IAAG;AAG3B,MAAMzE,KAAa,oBAAI,IAAG;AAK1B,SAAS0E,GAAkBtX,GAAG;AACpC,EAAAqX,KAAgBrX;AACjB;AAEA,IAAIua,KAAyB;AAatB,SAAS/H,GAAOxS,GAAGwa,GAAO;AAEhC,MAAIxN,IAAS;AAAA,IACZ,GAAG;AAAA;AAAA,IACH,GAAAhN;AAAA,IACA,WAAW;AAAA,IACX,QAAAqK;AAAA,IACA,IAAI;AAAA,IACJ,IAAI;AAAA,EACN;AASC,SAAO2C;AACR;AAAA;AAQO,SAASyN,EAAMza,GAAGwa,GAAO;AAC/B,QAAMhF,IAAIhD,GAAOxS,CAAQ;AAEzB,SAAAyZ,GAAoBjE,CAAC,GAEdA;AACR;AAAA;AASO,SAAS3F,GAAejB,GAAe8L,IAAY,IAAOC,IAAY,IAAM;;AAClF,QAAMnF,IAAIhD,GAAO5D,CAAa;AAC9B,SAAK8L,MACJlF,EAAE,SAASjL,KAKRC,MAAoBmQ,KAAahQ,MAAsB,QAAQA,EAAkB,MAAM,UACzFvD,IAAAuD,EAAkB,GAAE,MAApBvD,EAAoB,IAAM,CAAA,IAAI,KAAKoO,CAAC,GAG/BA;AACR;AAOO,SAASoF,GAAOpI,GAAQ1S,GAAO;AACrC,SAAAuO;AAAA,IACCmE;AAAA,IACA1E,GAAQ,MAAMwB,GAAIkD,CAAM,CAAC;AAAA,EAC3B,GACQ1S;AACR;AASO,SAASuO,EAAImE,GAAQ1S,GAAO+a,IAAe,IAAO;AACxD,EACClO,MAAoB;AAAA;AAAA,GAGnB,CAACmO,MAAenO,EAAgB,IAAI1G,QAAkB,MACvD4F,GAAQ,MACPc,EAAgB,KAAK3H,IAAUI,IAAeoB,KAAQP,SAAmB,MACzE8U,MAAoB,QAAQ,CAACnY,GAAS,KAAKmY,GAAiBvI,CAAM,MAEnEwI,GAAuB;AAGxB,MAAI1M,IAAYuM,IAAeI,GAAMnb,CAAK,IAAIA;AAM9C,SAAOsZ,GAAa5G,GAAQlE,GAAWyC,EAAc;AACtD;AASO,SAASqI,GAAa5G,GAAQ1S,GAAOob,IAA2B,MAAM;AAC5E,MAAI,CAAC1I,EAAO,OAAO1S,CAAK,GAAG;AAC1B,IAAA8S,GAAW,IAAIJ,GAAQsH,KAAuBha,IAAQ0S,EAAO,CAAC;AAE9D,QAAIS,IAAQgD,GAAM,OAAM;AAiCxB,QAhCAhD,EAAM,QAAQT,GAAQ1S,CAAK,IAgCtB0S,EAAO,IAAIxN,OAAa,GAAG;AAC/B,YAAMmI;AAAA;AAAA,QAAkCqF;AAAA;AAGxC,OAAKA,EAAO,IAAI9M,OAAW,KAC1BkU,GAAgBzM,CAAO,GAKpBwD,MAAiB,QACpBzD,GAAsBC,CAAO;AAAA,IAE/B;AAEA,IAAAqF,EAAO,KAAK4E,GAAuB,GAInC+D,GAAe3I,GAAQ9M,GAAOwV,CAAwB,GAOrDrP,GAAQ,KACRL,MAAkB,SACjBA,EAAc,IAAI/F,OAAW,MAC7B+F,EAAc,KAAKnG,IAAgBC,SAAkB,MAElD8V,MAAqB,OACxBC,GAAqB,CAAC7I,CAAM,CAAC,IAE7B4I,EAAiB,KAAK5I,CAAM,IAI1B,CAACS,EAAM,WAAWoE,GAAc,OAAO,KAAK,CAACkD,MAChDhD,GAAmB;AAAA,EAErB;AAEA,SAAOzX;AACR;AAEO,SAASyX,KAAsB;AACrC,EAAAgD,KAAyB;AAEzB,aAAW7N,KAAU2K,IAAe;AAGnC,KAAK3K,EAAO,IAAIjH,OAAW,KAC1BsH,EAAkBL,GAAQ/G,CAAW;AAGtC,QAAI2V;AAEJ,QAAI;AACH,MAAAA,IAAQ1G,GAASlI,CAAM;AAAA,IACxB,QAAQ;AAIP,MAAA4O,IAAQ;AAAA,IACT;AAEA,IAAIA,KACHzG,GAAcnI,CAAM;AAAA,EAEtB;AAEA,EAAA2K,GAAc,MAAK;AACpB;AAQO,SAAS5I,GAAO+D,GAAQuC,IAAI,GAAG;AACrC,MAAIjV,IAAQwP,GAAIkD,CAAM,GAClB3N,IAASkQ,MAAM,IAAIjV,MAAUA;AAEjC,SAAAuO,EAAImE,GAAQ1S,CAAK,GAGV+E;AACR;AAoBO,SAAS0W,GAAU/I,GAAQ;AACjC,EAAAnE,EAAImE,GAAQA,EAAO,IAAI,CAAC;AACzB;AAQA,SAAS2I,GAAenO,GAAQC,GAAQiO,GAA0B;AACjE,MAAIjG,IAAYjI,EAAO;AACvB,MAAIiI,MAAc;AAKlB,aAHI1J,IAAQM,GAAQ,GAChByK,IAASrB,EAAU,QAEdpR,IAAI,GAAGA,IAAIyS,GAAQzS,KAAK;AAChC,UAAIqR,IAAWD,EAAUpR,CAAC,GACtBsP,IAAQ+B,EAAS;AAGrB,UAAI,GAAC3J,KAAS2J,MAAa1J,IAE3B;AAAA,YAAIgQ,KAAarI,IAAQzN,OAAW;AAOpC,YAJI8V,KACHzO,EAAkBmI,GAAUjI,CAAM,IAG9BkG,IAAQlN,QAAkB;AAI9B,UAAAoR,GAAc;AAAA;AAAA,YAA2BnC;AAAA,UAAQ;AAAA,kBACtC/B,IAAQnO,OAAa,GAAG;AACnC,cAAImI;AAAA;AAAA,YAAkC+H;AAAA;AAEtC,UAAAvE,KAAA,QAAAA,EAAc,OAAOxD,KAEhBgG,IAAQ7M,QAAgB,MAG3B6M,IAAQ3N,MACPgG,MAAkB,SAASA,EAAc,IAAIjF,QAA0B,OAExE2O,EAAS,KAAK5O,KAGf6U,GAAehO,GAASxH,GAAauV,CAAwB;AAAA,QAE/D,WAAWM,GAAW;AACrB,cAAI9O;AAAA;AAAA,YAAgCwI;AAAA;AAEpC,WAAK/B,IAAQ/N,OAAkB,KAAKiR,MAAwB,QAC3DA,EAAoB,IAAI3J,CAAM,GAG3BwO,MAA6B,OAChCA,EAAyB,KAAKxO,CAAM,IAEpCiK,GAAgBjK,CAAM;AAAA,QAExB;AAAA;AAAA,IACD;AACD;AClWO,SAASuO,GAAMnb,GAAO;AAE5B,MAAI,OAAOA,KAAU,YAAYA,MAAU,QAAQ4G,MAAgB5G;AAClE,WAAOA;AAGR,QAAM2b,IAAYtY,GAAiBrD,CAAK;AAExC,MAAI2b,MAAcxY,MAAoBwY,MAAcvY;AACnD,WAAOpD;AAIR,MAAIuV,IAAU,oBAAI,IAAG,GACjBqG,IAAmBhZ,GAAS5C,CAAK,GACjC6b,IAAUnJ,gBAAAA,EAAO,CAAC,GAGlBoJ,IAAiBC,IAOjBC,IAAc,CAACpY,MAAO;AACzB,QAAImY,OAAmBD;AACtB,aAAOlY,EAAE;AAKV,QAAIwR,IAAWvI,GACXgP,IAAUE;AAEd,IAAAnD,GAAoB,IAAI,GACxBqD,GAAmBH,CAAc;AAEjC,QAAI/W,IAASnB,EAAE;AAEf,WAAAgV,GAAoBxD,CAAQ,GAC5B6G,GAAmBJ,CAAO,GAEnB9W;AAAA,EACR;AAEA,SAAI6W,KAGHrG,EAAQ,IAAI,UAAU7C,gBAAAA;AAAAA;AAAAA,IAA6B1S,EAAO;AAAA,EAAa,CAAC,GAwBlE,IAAI;AAAA;AAAA,IAA0BA;AAAA,IAAQ;AAAA,MAC5C,eAAeyP,GAAGyM,GAAMC,GAAY;AACnC,SACC,EAAE,WAAWA,MACbA,EAAW,iBAAiB,MAC5BA,EAAW,eAAe,MAC1BA,EAAW,aAAa,OAMxBC,GAAyB;AAE1B,YAAI1G,IAAIH,EAAQ,IAAI2G,CAAI;AACxB,eAAIxG,MAAM,SACTsG,EAAY,MAAM;AACjB,cAAItG,IAAIhD,gBAAAA,EAAOyJ,EAAW,KAAY;AACtC,iBAAA5G,EAAQ,IAAI2G,GAAMxG,CAAC,GAIZA;AAAA,QACR,CAAC,IAEDnH,EAAImH,GAAGyG,EAAW,OAAO,EAAI,GAGvB;AAAA,MACR;AAAA,MAEA,eAAeE,GAAQH,GAAM;AAC5B,YAAIxG,IAAIH,EAAQ,IAAI2G,CAAI;AAExB,YAAIxG,MAAM;AACT,cAAIwG,KAAQG,GAAQ;AACnB,kBAAM3G,IAAIsG,EAAY,MAAMtJ,gBAAAA,EAAOpQ,CAAoB,CAAC;AACxD,YAAAiT,EAAQ,IAAI2G,GAAMxG,CAAC,GACnB+F,GAAUI,CAAO;AAAA,UAKlB;AAAA;AAEA,UAAAtN,EAAImH,GAAGpT,CAAa,GACpBmZ,GAAUI,CAAO;AAGlB,eAAO;AAAA,MACR;AAAA,MAEA,IAAIQ,GAAQH,GAAMI,GAAU;;AAC3B,YAAIJ,MAAStV;AACZ,iBAAO5G;AAOR,YAAI0V,IAAIH,EAAQ,IAAI2G,CAAI,GACpBK,IAASL,KAAQG;AAkBrB,YAfI3G,MAAM,WAAc,CAAC6G,MAAUjV,IAAArE,GAAeoZ,GAAQH,CAAI,MAA3B,QAAA5U,EAA8B,cAChEoO,IAAIsG,EAAY,MAAM;AACrB,cAAIxC,IAAI2B,GAAMoB,IAASF,EAAOH,CAAI,IAAI5Z,CAAa,GAC/CoT,IAAIhD,gBAAAA,EAAO8G,CAAQ;AAMvB,iBAAO9D;AAAA,QACR,CAAC,GAEDH,EAAQ,IAAI2G,GAAMxG,CAAC,IAGhBA,MAAM,QAAW;AACpB,cAAIxV,IAAIsP,GAAIkG,CAAC;AACb,iBAAOxV,MAAMoC,IAAgB,SAAYpC;AAAA,QAC1C;AAEA,eAAO,QAAQ,IAAImc,GAAQH,GAAMI,CAAQ;AAAA,MAC1C;AAAA,MAEA,yBAAyBD,GAAQH,GAAM;AACtC,YAAIC,IAAa,QAAQ,yBAAyBE,GAAQH,CAAI;AAE9D,YAAIC,KAAc,WAAWA,GAAY;AACxC,cAAIzG,IAAIH,EAAQ,IAAI2G,CAAI;AACxB,UAAIxG,MAAGyG,EAAW,QAAQ3M,GAAIkG,CAAC;AAAA,QAChC,WAAWyG,MAAe,QAAW;AACpC,cAAIzJ,IAAS6C,EAAQ,IAAI2G,CAAI,GACzBlc,IAAQ0S,KAAA,gBAAAA,EAAQ;AAEpB,cAAIA,MAAW,UAAa1S,MAAUsC;AACrC,mBAAO;AAAA,cACN,YAAY;AAAA,cACZ,cAAc;AAAA,cACd,OAAAtC;AAAA,cACA,UAAU;AAAA,YAChB;AAAA,QAEG;AAEA,eAAOmc;AAAA,MACR;AAAA,MAEA,IAAIE,GAAQH,GAAM;;AACjB,YAAIA,MAAStV;AACZ,iBAAO;AAGR,YAAI8O,IAAIH,EAAQ,IAAI2G,CAAI,GACpBM,IAAO9G,MAAM,UAAaA,EAAE,MAAMpT,KAAkB,QAAQ,IAAI+Z,GAAQH,CAAI;AAEhF,YACCxG,MAAM,UACLhK,MAAkB,SAAS,CAAC8Q,MAAOlV,IAAArE,GAAeoZ,GAAQH,CAAI,MAA3B,QAAA5U,EAA8B,WACjE;AACD,UAAIoO,MAAM,WACTA,IAAIsG,EAAY,MAAM;AACrB,gBAAIxC,IAAIgD,IAAMrB,GAAMkB,EAAOH,CAAI,CAAC,IAAI5Z,GAChCoT,IAAIhD,gBAAAA,EAAO8G,CAAQ;AAMvB,mBAAO9D;AAAA,UACR,CAAC,GAEDH,EAAQ,IAAI2G,GAAMxG,CAAC;AAGpB,cAAI1V,IAAQwP,GAAIkG,CAAC;AACjB,cAAI1V,MAAUsC;AACb,mBAAO;AAAA,QAET;AAEA,eAAOka;AAAA,MACR;AAAA,MAEA,IAAIH,GAAQH,GAAMlc,GAAOsc,GAAU;;AAClC,YAAI5G,IAAIH,EAAQ,IAAI2G,CAAI,GACpBM,IAAMN,KAAQG;AAGlB,YAAIT,KAAoBM,MAAS;AAChC,mBAASnY,IAAI/D,GAAO+D;AAAA,UAAmC2R,EAAG,GAAG3R,KAAK,GAAG;AACpE,gBAAI0Y,IAAUlH,EAAQ,IAAIxR,IAAI,EAAE;AAChC,YAAI0Y,MAAY,SACflO,EAAIkO,GAASna,CAAa,IAChByB,KAAKsY,MAIfI,IAAUT,EAAY,MAAMtJ,gBAAAA,EAAOpQ,CAAoB,CAAC,GACxDiT,EAAQ,IAAIxR,IAAI,IAAI0Y,CAAO;AAAA,UAM7B;AAOD,YAAI/G,MAAM;AACT,WAAI,CAAC8G,MAAOlV,KAAArE,GAAeoZ,GAAQH,CAAI,MAA3B,QAAA5U,GAA8B,cACzCoO,IAAIsG,EAAY,MAAMtJ,gBAAAA,EAAO,MAAgB,CAAC,GAK9CnE,EAAImH,GAAGyF,GAAMnb,CAAK,CAAC,GAEnBuV,EAAQ,IAAI2G,GAAMxG,CAAC;AAAA,aAEd;AACN,UAAA8G,IAAM9G,EAAE,MAAMpT;AAEd,cAAIkX,IAAIwC,EAAY,MAAMb,GAAMnb,CAAK,CAAC;AACtC,UAAAuO,EAAImH,GAAG8D,CAAC;AAAA,QACT;AAEA,YAAI2C,IAAa,QAAQ,yBAAyBE,GAAQH,CAAI;AAO9D,YAJIC,KAAA,QAAAA,EAAY,OACfA,EAAW,IAAI,KAAKG,GAAUtc,CAAK,GAGhC,CAACwc,GAAK;AAKT,cAAIZ,KAAoB,OAAOM,KAAS,UAAU;AACjD,gBAAIQ;AAAA;AAAA,cAAoCnH,EAAQ,IAAI,QAAQ;AAAA,eACxD9Q,KAAI,OAAOyX,CAAI;AAEnB,YAAI,OAAO,UAAUzX,EAAC,KAAKA,MAAKiY,GAAG,KAClCnO,EAAImO,IAAIjY,KAAI,CAAC;AAAA,UAEf;AAEA,UAAAgX,GAAUI,CAAO;AAAA,QAClB;AAEA,eAAO;AAAA,MACR;AAAA,MAEA,QAAQQ,GAAQ;AACf,QAAA7M,GAAIqM,CAAO;AAEX,YAAIc,IAAW,QAAQ,QAAQN,CAAM,EAAE,OAAO,CAACrX,MAAQ;AACtD,cAAI0N,IAAS6C,EAAQ,IAAIvQ,CAAG;AAC5B,iBAAO0N,MAAW,UAAaA,EAAO,MAAMpQ;AAAA,QAC7C,CAAC;AAED,iBAAS,CAAC0C,GAAK0N,CAAM,KAAK6C;AACzB,UAAI7C,EAAO,MAAMpQ,KAAiB,EAAE0C,KAAOqX,MAC1CM,EAAS,KAAK3X,CAAG;AAInB,eAAO2X;AAAA,MACR;AAAA,MAEA,iBAAiB;AAChBC,QAAAA,GAAuB;AAAA,MACxB;AAAA,IACF;AAAA,EAAE;AACF;AAeO,SAASC,GAAkB7c,GAAO;AACxC,MAAI;AACH,QAAIA,MAAU,QAAQ,OAAOA,KAAU,YAAY4G,MAAgB5G;AAClE,aAAOA,EAAM4G,EAAY;AAAA,EAE3B,QAAQ;AAAA,EAQR;AAEA,SAAO5G;AACR;AAMO,SAAS8c,GAAG7U,GAAGC,GAAG;AACxB,SAAO,OAAO,GAAG2U,GAAkB5U,CAAC,GAAG4U,GAAkB3U,CAAC,CAAC;AAC5D;ACpXU,IAAC6U,IAMAC,IAGPC,IAEAC;AAMG,SAASC,KAAkB;AACjC,MAAIJ,OAAY,QAIhB;AAAA,IAAAA,KAAU,QAEVC,KAAa,UAAU,KAAK,UAAU,SAAS;AAE/C,QAAII,IAAoB,QAAQ,WAC5BC,IAAiB,KAAK,WACtBC,IAAiB,KAAK;AAG1B,IAAAL,KAAqBha,GAAeoa,GAAgB,YAAY,EAAE,KAElEH,KAAsBja,GAAeoa,GAAgB,aAAa,EAAE,KAEhE/Z,GAAc8Z,CAAiB,MAEdA,EAAmBpW,EAAW,IAAI,QAClCoW,EAAmBrW,EAAgB,IAAI,MACvCqW,EAAmBnW,EAAW,IAAI,QAEtDmW,EAAkB,MAAM,SAGrB9Z,GAAcga,CAAc,MACXA,EAAgBpW,EAAU,IAAI;AAAA;AASpD;AAMO,SAASqW,GAAYvd,IAAQ,IAAI;AACvC,SAAO,SAAS,eAAeA,CAAK;AACrC;AAAA;AAOO,SAASwd,GAAgB5T,GAAM;AACrC;AAAA;AAAA,IAA2CqT,GAAmB,KAAKrT,CAAI;AAAA;AACxE;AAAA;AAOO,SAASG,GAAiBH,GAAM;AACtC;AAAA;AAAA,IAA2CsT,GAAoB,KAAKtT,CAAI;AAAA;AACzE;AASO,SAASoL,GAAMpL,GAAM6T,GAAS;AACpC,MAAI,CAACjU;AACJ,WAAO,gBAAAgU,GAAgB5T,CAAI;AAG5B,MAAIoL,IAAQ,gBAAAwI,GAAgB9T,CAAY;AAGxC,MAAIsL,MAAU;AACb,IAAAA,IAAQtL,EAAa,YAAY6T,IAAa;AAAA,WACpCE,KAAWzI,EAAM,aAAaxN,IAAW;AACnD,QAAIkW,IAAOH,GAAW;AACtB,WAAAvI,KAAA,QAAAA,EAAO,OAAO0I,IACd/T,GAAiB+T,CAAI,GACdA;AAAA,EACR;AAEA,SAAID,KACHE;AAAA;AAAA,IAAsC3I;AAAA,EAAK,GAG5CrL,GAAiBqL,CAAK,GACfA;AACR;AAQO,SAAS4I,GAAYhU,GAAM6T,IAAU,IAAO;AAClD,MAAI,CAACjU,IAAW;AACf,QAAIqU,IAAQ,gBAAAL,GAAgB5T,CAAI;AAGhC,WAAIiU,aAAiB,WAAWA,EAAM,SAAS,KAAW,gBAAA9T,GAAiB8T,CAAK,IAEzEA;AAAA,EACR;AAEA,MAAIJ,GAAS;AAGZ,SAAI/T,KAAA,gBAAAA,EAAc,cAAalC,IAAW;AACzC,UAAIkW,IAAOH,GAAW;AAEtB,aAAA7T,KAAA,QAAAA,EAAc,OAAOgU,IACrB/T,GAAiB+T,CAAI,GACdA;AAAA,IACR;AAEA,IAAAC;AAAA;AAAA,MAAsCjU;AAAA,IAAY;AAAA,EACnD;AAEA,SAAOA;AACR;AASO,SAASoU,GAAQlU,GAAMM,IAAQ,GAAGuT,IAAU,IAAO;AACzD,MAAIM,IAAevU,KAAYE,IAAeE;AAG9C,WAFIoU,GAEG9T;AACN,IAAA8T,IAAeD,GACfA;AAAA,IAA4C,gBAAAhU,GAAiBgU,CAAY;AAG1E,MAAI,CAACvU;AACJ,WAAOuU;AAGR,MAAIN,GAAS;AAGZ,SAAIM,KAAA,gBAAAA,EAAc,cAAavW,IAAW;AACzC,UAAIkW,IAAOH,GAAW;AAItB,aAAIQ,MAAiB,OACpBC,KAAA,QAAAA,EAAc,MAAMN,KAEpBK,EAAa,OAAOL,CAAI,GAEzB/T,GAAiB+T,CAAI,GACdA;AAAA,IACR;AAEA,IAAAC;AAAA;AAAA,MAAsCI;AAAA,IAAY;AAAA,EACnD;AAEA,SAAApU,GAAiBoU,CAAY,GACtBA;AACR;AAOO,SAASE,GAAmBrU,GAAM;AACxC,EAAAA,EAAK,cAAc;AACpB;AAQO,SAASsU,KAAsB;AACf,SAAO;AAK9B;AASO,SAASC,GAAeC,GAAKC,GAAWvB,GAAI;AAElD;AAAA;AAAA,IACC,SAAS,gBAAgBuB,KAAa9b,IAAgB6b,GAFnD,MAE+D;AAAA;AAEpE;AAiCO,SAAST,GAAiBD,GAAM;AACtC;AAAA;AAAA,IAA2BA,EAAK,UAAW,SAAS;AAAA;AACnD;AAGD,MAAIzT,IAAOyT,EAAK;AAEhB,SAAOzT,MAAS,QAAQA,EAAK,aAAazC;AACzC,IAAAyC,EAAK,OAAM,GAEYyT,EAAK;AAAA,IAAqCzT,EAAK,WAEtEA,IAAOyT,EAAK;AAEd;AC3RO,SAASY,GAAUC,GAAKve,GAAO;AACrC,MAAIA,GAAO;AACV,UAAMM,IAAO,SAAS;AACtB,IAAAie,EAAI,YAAY,IAEhBhS,GAAiB,MAAM;AACtB,MAAI,SAAS,kBAAkBjM,KAC9Bie,EAAI,MAAK;AAAA,IAEX,CAAC;AAAA,EACF;AACD;AAQO,SAASC,GAAsBD,GAAK;AAC1C,EAAI/U,MAAa,gBAAAgU,GAAgBe,CAAG,MAAM,QACzCN,GAAmBM,CAAG;AAExB;AAEA,IAAIE,KAA0B;AAEvB,SAASC,KAA0B;AACzC,EAAKD,OACJA,KAA0B,IAC1B,SAAS;AAAA,IACR;AAAA,IACA,CAACE,MAAQ;AAGR,cAAQ,UAAU,KAAK,MAAM;;AAC5B,YAAI,CAACA,EAAI;AACR;AAAA,kBAAW5R;AAAA;AAAA,YAAoC4R,EAAI,OAAQ;AAAA;AACvC,aAACrX,IAAAyF,EAAG5F,QAAH,QAAAG,EAAA,KAAAyF;AAAA,MAGvB,CAAC;AAAA,IACF;AAAA;AAAA,IAEA,EAAE,SAAS,GAAI;AAAA,EAClB;AAEA;ACnBO,SAAS6R,GAAyBhb,GAAI;AAC5C,MAAI4U,IAAoB3L,GACpB0L,IAAkB7M;AACtB,EAAAkN,GAAoB,IAAI,GACxBD,GAAkB,IAAI;AACtB,MAAI;AACH,WAAO/U,EAAE;AAAA,EACV,UAAC;AACA,IAAAgV,GAAoBJ,CAAiB,GACrCG,GAAkBJ,CAAe;AAAA,EAClC;AACD;AAUO,SAASsG,GAAgCla,GAASma,GAAOzF,GAAS0F,IAAW1F,GAAS;AAC5F,EAAA1U,EAAQ,iBAAiBma,GAAO,MAAMF,GAAyBvF,CAAO,CAAC;AACvE,QAAMnD;AAAA;AAAA,IAA2BvR,EAASwC,EAAkB;AAAA;AAC5D,EAAI+O,IAEiBvR,EAASwC,EAAkB,IAAI,MAAM;AACxD,IAAA+O,EAAI,GACJ6I,EAAS,EAAI;AAAA,EACd,IAEoBpa,EAASwC,EAAkB,IAAI,MAAM4X,EAAS,EAAI,GAGvEL,GAAuB;AACxB;ACrBO,SAASM,GAAgB5W,GAAM;AACrC,EAAIsD,MAAkB,SACjBmB,MAAoB,QACvBoS,GAAoB,GAGrBC,GAA2B,IAGxBlF,MACHmF,GAAyB;AAE3B;AAMA,SAASC,GAAYxS,GAAQyS,GAAe;AAC3C,MAAIC,IAAcD,EAAc;AAChC,EAAIC,MAAgB,OACnBD,EAAc,OAAOA,EAAc,QAAQzS,KAE3C0S,EAAY,OAAO1S,GACnBA,EAAO,OAAO0S,GACdD,EAAc,OAAOzS;AAEvB;AAOA,SAAS2S,EAAcC,GAAM5b,GAAI;AAChC,MAAIsI,IAASR;AASb,EAAIQ,MAAW,SAASA,EAAO,IAAIpG,OAAW,MAC7C0Z,KAAQ1Z;AAIT,MAAI8G,IAAS;AAAA,IACZ,KAAK/B;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,GAAG2U,IAAO5Z,IAAQF;AAAA,IAClB,OAAO;AAAA,IACP,IAAA9B;AAAA,IACA,MAAM;AAAA,IACN,MAAM;AAAA,IACN,QAAAsI;AAAA,IACA,GAAGA,KAAUA,EAAO;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,IAAI;AAAA,IACJ,IAAI;AAAA,EACN;AAMC,EAAAyE,KAAA,QAAAA,EAAe,wBAAwB/D;AAGvC,MAAIG,IAAIH;AAER,OAAK4S,IAAOra,QAAY;AACvB,IAAI6L,OAAsB,OAEzBA,GAAkB,KAAKpE,CAAM,IAG7BuJ,GAAM,OAAM,EAAG,SAASvJ,CAAM;AAAA,WAErBhJ,MAAO,MAAM;AACvB,QAAI;AACH,MAAAmR,GAAcnI,CAAM;AAAA,IACrB,SAASG,GAAG;AACX,YAAA8M,GAAejN,CAAM,GACfG;AAAA,IACP;AAKA,IACCA,EAAE,SAAS,QACXA,EAAE,aAAa,QACfA,EAAE,UAAU,QACZA,EAAE,UAAUA,EAAE;AAAA,KACbA,EAAE,IAAI1G,QAAsB,MAE7B0G,IAAIA,EAAE,QACDyS,IAAOla,OAAkB,MAAMka,IAAOtZ,QAAwB,KAAK6G,MAAM,SAC7EA,EAAE,KAAK7G;AAAA,EAGV;AAEA,MAAI6G,MAAM,SACTA,EAAE,SAASb,GAEPA,MAAW,QACdkT,GAAYrS,GAAGb,CAAM,GAKrBW,MAAoB,SACnBA,EAAgB,IAAI3H,OAAa,MACjCsa,IAAOha,QAAiB,IACxB;AACD,QAAI6H;AAAA;AAAA,MAAkCR;AAAA;AACtC,KAACQ,EAAQ,YAARA,EAAQ,UAAY,KAAI,KAAKN,CAAC;AAAA,EAChC;AAGD,SAAOH;AACR;AAMO,SAASwN,KAAkB;AACjC,SAAOvN,MAAoB,QAAQ,CAACmO;AACrC;AAKO,SAAS1K,GAAS1M,GAAI;AAC5B,QAAMgJ,IAAS2S,EAAcna,IAAe,IAAI;AAChD,SAAA6H,EAAkBL,GAAQjH,CAAK,GAC/BiH,EAAO,WAAWhJ,GACXgJ;AACR;AAMO,SAAS6S,GAAY7b,GAAI;AAC/B,EAAAob,GAAyB;AAUzB,MAAI3L;AAAA;AAAA,IAA+B3H,EAAe;AAAA,KAC9CgU,IAAQ,CAAC7S,MAAoBwG,IAAQ9N,OAAmB,MAAM8N,IAAQrN,QAAkB;AAE5F,MAAI0Z,GAAO;AAEV,QAAI3U;AAAA;AAAA,MAA2CF;AAAA;AAC/C,KAACE,EAAQ,MAARA,EAAQ,IAAM,KAAI,KAAKnH,CAAE;AAAA,EAC3B;AAEC,WAAOkI,GAAmBlI,CAAE;AAE9B;AAKO,SAASkI,GAAmBlI,GAAI;AACtC,SAAO2b,EAAcpa,KAASmB,IAAa1C,CAAE;AAC9C;AAOO,SAAS+b,GAAgB/b,GAAI;AACnC,SAAAob,GAA6B,GAMtBO,EAAcna,KAAgBkB,IAAa1C,CAAE;AACrD;AAYO,SAASgc,GAAYhc,GAAI;AAC/B,EAAAuS,GAAM,OAAM;AACZ,QAAMvJ,IAAS2S,EAAc/Z,KAAca,IAAkBzC,CAAE;AAE/D,SAAO,MAAM;AACZ,IAAAiW,GAAejN,CAAM;AAAA,EACtB;AACD;AAOO,SAASiT,GAAejc,GAAI;AAClC,EAAAuS,GAAM,OAAM;AACZ,QAAMvJ,IAAS2S,EAAc/Z,KAAca,IAAkBzC,CAAE;AAE/D,SAAO,CAACkc,IAAU,OACV,IAAI,QAAQ,CAACvG,MAAW;AAC9B,IAAIuG,EAAQ,QACXC,GAAanT,GAAQ,MAAM;AAC1B,MAAAiN,GAAejN,CAAM,GACrB2M,EAAO,MAAS;AAAA,IACjB,CAAC,KAEDM,GAAejN,CAAM,GACrB2M,EAAO,MAAS;AAAA,EAElB,CAAC;AAEH;AAMO,SAAS3M,GAAOhJ,GAAI;AAC1B,SAAO2b,EAAcpa,IAAQvB,CAAE;AAChC;AAOO,SAASoc,GAAkBzS,GAAM3J,GAAI;AAC3C,MAAImH;AAAA;AAAA,IAAiDF;AAAA,KAGjDoV,IAAQ,EAAE,QAAQ,MAAM,KAAK,IAAO,MAAA1S,EAAI;AAE5C,EAAAxC,EAAQ,EAAE,EAAE,KAAKkV,CAAK,GAEtBA,EAAM,SAASC,GAAc,MAAM;AAKlC,QAJA3S,EAAI,GAIA,CAAA0S,EAAM,KAEV;AAAA,MAAAA,EAAM,MAAM;AAEZ,UAAIrT;AAAA;AAAA,QAAgClB;AAAA;AAMpC,UAAI;AACH,QAAAiN,GAAkB/L,EAAO,MAAM,GAC/BoB,GAAQpK,CAAE;AAAA,MACX,UAAC;AACA,QAAA+U,GAAkB/L,CAAM;AAAA,MACzB;AAAA;AAAA,EACD,CAAC;AACF;AAEO,SAASuT,KAA0B;AACzC,MAAIpV;AAAA;AAAA,IAAiDF;AAAA;AAErD,EAAAqV,GAAc,MAAM;AAEnB,aAASD,KAASlV,EAAQ,EAAE,GAAG;AAC9B,MAAAkV,EAAM,KAAI;AAEV,UAAIrT,IAASqT,EAAM;AAInB,OAAKrT,EAAO,IAAIjH,OAAW,KAAKiH,EAAO,SAAS,QAC/CK,EAAkBL,GAAQ/G,CAAW,GAGlCiP,GAASlI,CAAM,KAClBmI,GAAcnI,CAAM,GAGrBqT,EAAM,MAAM;AAAA,IACb;AAAA,EACD,CAAC;AACF;AAMO,SAAS7G,GAAaxV,GAAI;AAChC,SAAO2b,EAAc7Y,KAAQL,IAAkBzC,CAAE;AAClD;AAMO,SAASsc,GAActc,GAAIyP,IAAQ,GAAG;AAC5C,SAAOkM,EAAcna,KAAgBiO,GAAOzP,CAAE;AAC/C;AAQO,SAASwc,GAAgBxc,GAAI0L,IAAO,CAAA,GAAIsI,IAAQ,CAAA,GAAID,IAAW,IAAI;AACzE,EAAAD,GAAQC,GAAUrI,GAAMsI,GAAO,CAACzI,MAAW;AAC1C,IAAAoQ,EAAcna,IAAe,MAAMxB,EAAG,GAAGuL,EAAO,IAAIK,EAAG,CAAC,CAAC;AAAA,EAC1D,CAAC;AACF;AAmBO,SAAS6Q,GAAMzc,GAAIyP,IAAQ,GAAG;AACpC,MAAIzG,IAAS2S,EAAcja,IAAe+N,GAAOzP,CAAE;AAInD,SAAOgJ;AACR;AAMO,SAAS0T,GAAQ1c,GAAIyP,IAAQ,GAAG;AACtC,MAAIzG,IAAS2S,EAAcla,KAAiBgO,GAAOzP,CAAE;AAIrD,SAAOgJ;AACR;AAKO,SAAS2T,GAAO3c,GAAI;AAC1B,SAAO2b,EAAcha,IAAgBc,IAAkBzC,CAAE;AAC1D;AAKO,SAAS4c,GAAwB5T,GAAQ;AAC/C,MAAI0D,IAAW1D,EAAO;AACtB,MAAI0D,MAAa,MAAM;AACtB,UAAMmQ,IAA+BzG,IAC/BxB,IAAoB3L;AAC1B,IAAA6T,GAAyB,EAAI,GAC7B9H,GAAoB,IAAI;AACxB,QAAI;AACH,MAAAtI,EAAS,KAAK,IAAI;AAAA,IACnB,UAAC;AACA,MAAAoQ,GAAyBD,CAA4B,GACrD7H,GAAoBJ,CAAiB;AAAA,IACtC;AAAA,EACD;AACD;AAOO,SAAS+B,GAAwBrN,GAAQyT,IAAa,IAAO;AACnE,MAAI/T,IAASM,EAAO;AAGpB,OAFAA,EAAO,QAAQA,EAAO,OAAO,MAEtBN,MAAW,QAAM;AACvB,UAAMgU,IAAahU,EAAO;AAE1B,IAAIgU,MAAe,QAClBhC,GAAyB,MAAM;AAC9B,MAAAgC,EAAW,MAAMxZ,EAAc;AAAA,IAChC,CAAC;AAGF,QAAI6C,IAAO2C,EAAO;AAElB,KAAKA,EAAO,IAAIpH,QAAiB,IAEhCoH,EAAO,SAAS,OAEhBiN,GAAejN,GAAQ+T,CAAU,GAGlC/T,IAAS3C;AAAA,EACV;AACD;AAMO,SAAS4W,GAA8B3T,GAAQ;AAGrD,WAFIN,IAASM,EAAO,OAEbN,MAAW,QAAM;AACvB,QAAI3C,IAAO2C,EAAO;AAClB,KAAKA,EAAO,IAAIrH,OAAmB,KAClCsU,GAAejN,CAAM,GAEtBA,IAAS3C;AAAA,EACV;AACD;AAOO,SAAS4P,GAAejN,GAAQ+T,IAAa,IAAM;AACzD,MAAIG,IAAU;AAEd,GACEH,MAAe/T,EAAO,IAAIxG,QAAiB,MAC5CwG,EAAO,UAAU,QACjBA,EAAO,MAAM,QAAQ,SAErBmU;AAAA,IAAkBnU,EAAO,MAAM;AAAA;AAAA,IAAoCA,EAAO,MAAM;AAAA,EAAG,GACnFkU,IAAU,KAGX7T,EAAkBL,GAAQ3G,EAAU,GACpCsU,GAAwB3N,GAAQ+T,KAAc,CAACG,CAAO,GACtDxG,GAAiB1N,GAAQ,CAAC;AAE1B,MAAIoU,IAAcpU,EAAO,SAASA,EAAO,MAAM;AAE/C,MAAIoU,MAAgB;AACnB,eAAWC,KAAcD;AACxB,MAAAC,EAAW,KAAI;AAIjB,EAAAT,GAAwB5T,CAAM,GAE9BA,EAAO,KAAK3G,IACZ2G,EAAO,KAAK7G;AAEZ,MAAImG,IAASU,EAAO;AAGpB,EAAIV,MAAW,QAAQA,EAAO,UAAU,QACvCuK,GAAc7J,CAAM,GASrBA,EAAO,OACNA,EAAO,OACPA,EAAO,WACPA,EAAO,MACPA,EAAO,OACPA,EAAO,KACPA,EAAO,QACPA,EAAO,KACPA,EAAO,IACN;AACH;AAOO,SAASmU,GAAkBnX,GAAMsX,GAAK;AAC5C,SAAOtX,MAAS,QAAM;AAErB,QAAIK,IAAOL,MAASsX,IAAM,OAAO,gBAAAnX,GAAiBH,CAAI;AAEtD,IAAAA,EAAK,OAAM,GACXA,IAAOK;AAAA,EACR;AACD;AAOO,SAASwM,GAAc7J,GAAQ;AACrC,MAAIV,IAASU,EAAO,QAChBsJ,IAAOtJ,EAAO,MACd3C,IAAO2C,EAAO;AAElB,EAAIsJ,MAAS,SAAMA,EAAK,OAAOjM,IAC3BA,MAAS,SAAMA,EAAK,OAAOiM,IAE3BhK,MAAW,SACVA,EAAO,UAAUU,MAAQV,EAAO,QAAQjC,IACxCiC,EAAO,SAASU,MAAQV,EAAO,OAAOgK;AAE5C;AAYO,SAAS6J,GAAanT,GAAQ4F,GAAU2O,IAAU,IAAM;AAE9D,MAAIH,IAAc,CAAA;AAElB,EAAAI,GAAexU,GAAQoU,GAAa,EAAI;AAExC,MAAIpd,IAAK,MAAM;AACd,IAAIud,KAAStH,GAAejN,CAAM,GAC9B4F,KAAUA,EAAQ;AAAA,EACvB,GAEI6O,IAAYL,EAAY;AAC5B,MAAIK,IAAY,GAAG;AAClB,QAAIC,IAAQ,MAAM,EAAED,KAAazd,EAAE;AACnC,aAASqd,KAAcD;AACtB,MAAAC,EAAW,IAAIK,CAAK;AAAA,EAEtB;AACC,IAAA1d,EAAE;AAEJ;AAOA,SAASwd,GAAexU,GAAQoU,GAAaO,GAAO;AACnD,OAAK3U,EAAO,IAAI9G,OAAW,GAC3B;AAAA,IAAA8G,EAAO,KAAK9G;AAEZ,QAAI,IAAI8G,EAAO,SAASA,EAAO,MAAM;AAErC,QAAI,MAAM;AACT,iBAAWqU,KAAc;AACxB,SAAIA,EAAW,aAAaM,MAC3BP,EAAY,KAAKC,CAAU;AAO9B,aAFIjM,IAAQpI,EAAO,OAEZoI,MAAU,QAAM;AACtB,UAAI8I,IAAU9I,EAAM;AAIpB,WAAKA,EAAM,IAAIxP,QAAiB,GAAG;AAClC,YAAIgc,KACFxM,EAAM,IAAI9O,QAAwB;AAAA;AAAA;AAAA,SAIjC8O,EAAM,IAAIzP,OAAmB,MAAMqH,EAAO,IAAItH,OAAkB;AAInE,QAAA8b,GAAepM,GAAOgM,GAAaQ,IAAcD,IAAQ,EAAK;AAAA,MAC/D;AAEA,MAAAvM,IAAQ8I;AAAA,IACT;AAAA;AACD;AAOO,SAAS2D,GAAc7U,GAAQ;AACrC,EAAA8U,GAAgB9U,GAAQ,EAAI;AAC7B;AAMA,SAAS8U,GAAgB9U,GAAQ2U,GAAO;AACvC,OAAK3U,EAAO,IAAI9G,OAAW,GAC3B;AAAA,IAAA8G,EAAO,KAAK9G,IAMP8G,EAAO,IAAIjH,OAAW,MAC1BsH,EAAkBL,GAAQhH,CAAK,GAC/BuQ,GAAM,OAAM,EAAG,SAASvJ,CAAM;AAK/B,aAFIoI,IAAQpI,EAAO,OAEZoI,MAAU,QAAM;AACtB,UAAI8I,IAAU9I,EAAM,MAChBwM,KAAexM,EAAM,IAAI9O,QAAwB,MAAM8O,EAAM,IAAIzP,OAAmB;AAIxF,MAAAmc,GAAgB1M,GAAOwM,IAAcD,IAAQ,EAAK,GAClDvM,IAAQ8I;AAAA,IACT;AAEA,QAAI9J,IAAIpH,EAAO,SAASA,EAAO,MAAM;AAErC,QAAIoH,MAAM;AACT,iBAAWiN,KAAcjN;AACxB,SAAIiN,EAAW,aAAaM,MAC3BN,EAAW,GAAE;AAAA;AAIjB;AAUO,SAASU,GAAY/U,GAAQgV,GAAU;AAC7C,MAAKhV,EAAO;AAMZ,aAHIhD,IAAOgD,EAAO,MAAM,OACpBsU,IAAMtU,EAAO,MAAM,KAEhBhD,MAAS,QAAM;AAErB,UAAIK,IAAOL,MAASsX,IAAM,OAAO,gBAAAnX,GAAiBH,CAAI;AAEtD,MAAAgY,EAAS,OAAOhY,CAAI,GACpBA,IAAOK;AAAA,IACR;AACD;ACrqBA,IAAI4X,KAAqB,IAEd7H,KAAuB;AAG3B,SAAS0G,GAAyB1gB,GAAO;AAC/C,EAAAga,KAAuBha;AACxB;AAGU,IAAC6M,IAAkB,MAElBmO,IAAa;AAGjB,SAASpC,GAAoBxD,GAAU;AAC7C,EAAAvI,IAAkBuI;AACnB;AAGU,IAAC1J,IAAgB;AAGpB,SAASiN,GAAkB/L,GAAQ;AACzC,EAAAlB,IAAgBkB;AACjB;AAOO,IAAIqO,IAAkB;AAGtB,SAAStB,GAAoB3Z,GAAO;AAC1C,EAAI6M,MAAoB,SACnBoO,MAAoB,OACvBA,IAAkB,CAACjb,CAAK,IAExBib,EAAgB,KAAKjb,CAAK;AAG7B;AAQO,IAAI8hB,IAAW,MAEXC,IAAe,GAOfzG,IAAmB;AAGvB,SAASC,GAAqBvb,GAAO;AAC3C,EAAAsb,IAAmBtb;AACpB;AAMO,IAAIgiB,KAAgB,GAGvBC,KAAe,GAERlG,KAAiBkG;AAGrB,SAAShG,GAAmBjc,GAAO;AACzC,EAAA+b,KAAiB/b;AAClB;AAEO,SAASsX,KAA0B;AACzC,SAAO,EAAE0K;AACV;AAQO,SAASlN,GAASM,GAAU;AAClC,MAAI/B,IAAQ+B,EAAS;AAErB,OAAK/B,IAAQzN,OAAW;AACvB,WAAO;AAOR,MAJIyN,IAAQnO,MACXkQ,EAAS,KAAK,CAAC5O,MAGX6M,IAAQxN,OAAiB,GAAG;AAIhC,aAHIqc;AAAA;AAAA,MAAuC9M,EAAS;AAAA,OAChDoB,IAAS0L,EAAa,QAEjBne,IAAI,GAAGA,IAAIyS,GAAQzS,KAAK;AAChC,UAAIoe,IAAaD,EAAane,CAAC;AAM/B,UAJI+Q;AAAA;AAAA,QAAiCqN;AAAA,WACpChI;AAAA;AAAA,QAAuCgI;AAAA,MAAU,GAG9CA,EAAW,KAAK/M,EAAS;AAC5B,eAAO;AAAA,IAET;AAEA,KACE/B,IAAQ3N,OAAe;AAAA;AAAA,IAGxBmL,MAAiB,QAEjB5D,EAAkBmI,GAAUzP,CAAK;AAAA,EAEnC;AAEA,SAAO;AACR;AAOA,SAASyc,GAA2ClV,GAAQN,GAAQgH,IAAO,IAAM;AAChF,MAAIuB,IAAYjI,EAAO;AACvB,MAAIiI,MAAc,QAEM,EAAA8F,MAAoB,QAAQnY,GAAS,KAAKmY,GAAiB/N,CAAM;AAIzF,aAASnJ,IAAI,GAAGA,IAAIoR,EAAU,QAAQpR,KAAK;AAC1C,UAAIqR,IAAWD,EAAUpR,CAAC;AAE1B,OAAKqR,EAAS,IAAIlQ,OAAa,IAC9Bkd;AAAA;AAAA,QAAmEhN;AAAA,QAAWxI;AAAA,QAAQ;AAAA,MAAK,IACjFA,MAAWwI,MACjBxB,IACH3G,EAAkBmI,GAAUxP,CAAK,KACtBwP,EAAS,IAAIzP,OAAW,KACnCsH,EAAkBmI,GAAUvP,CAAW,GAExCgR;AAAA;AAAA,QAAuCzB;AAAA,MAAQ;AAAA,IAEjD;AACD;AAGO,SAAS8E,GAAgB9E,GAAU;;AACzC,MAAIiN,IAAgBP,GAChBQ,IAAwBP,GACxBQ,IAA4BjH,GAC5B9C,IAAoB3L,GACpB2V,IAAmBvH,GACnBxC,IAA6B5N,GAC7B4X,IAAsBzH,GACtB0H,IAA0B3G,IAE1B1I,IAAQ+B,EAAS;AAErB,EAAA0M;AAAA,EAA0C,MAC1CC,IAAe,GACfzG,IAAmB,MACnBzO,KAAmBwG,KAAS9N,IAAgBC,SAAkB,IAAI4P,IAAW,MAE7E6F,IAAkB,MAClBnQ,GAAsBsK,EAAS,GAAG,GAClC4F,IAAa,IACbe,KAAiB,EAAEkG,IAEf7M,EAAS,OAAO,SACnBwJ,GAAyB,MAAM;AACC,IAACxJ,EAAS,GAAI,MAAMhO,EAAc;AAAA,EAClE,CAAC,GAEDgO,EAAS,KAAK;AAGf,MAAI;AACH,IAAAA,EAAS,KAAK3O;AACd,QAAI7C;AAAA;AAAA,MAA8BwR,EAAS;AAAA,OACvCrQ,IAASnB,EAAE;AACf,IAAAwR,EAAS,KAAKpP;AACd,QAAIuH,IAAO6H,EAAS,MAIhBuN,IAAUhS,KAAA,gBAAAA,EAAe;AAE7B,QAAImR,MAAa,MAAM;AACtB,UAAI/d;AAMJ,UAJK4e,KACJrI,GAAiBlF,GAAU2M,CAAY,GAGpCxU,MAAS,QAAQwU,IAAe;AAEnC,aADAxU,EAAK,SAASwU,IAAeD,EAAS,QACjC/d,IAAI,GAAGA,IAAI+d,EAAS,QAAQ/d;AAChC,UAAAwJ,EAAKwU,IAAehe,CAAC,IAAI+d,EAAS/d,CAAC;AAAA;AAGpC,QAAAqR,EAAS,OAAO7H,IAAOuU;AAGxB,UAAI1H,GAAe,MAAOhF,EAAS,IAAI1P,OAAe;AACrD,aAAK3B,IAAIge,GAAche,IAAIwJ,EAAK,QAAQxJ;AACvC,YAACuD,IAAAiG,EAAKxJ,CAAC,GAAE,cAARuD,EAAQ,YAAc,CAAA,IAAI,KAAK8N,CAAQ;AAAA,IAG3C,MAAO,CAAI,CAACuN,KAAWpV,MAAS,QAAQwU,IAAexU,EAAK,WAC3D+M,GAAiBlF,GAAU2M,CAAY,GACvCxU,EAAK,SAASwU;AAMf,QACChW,GAAQ,KACRuP,MAAqB,QACrB,CAACN,KACDzN,MAAS,SACR6H,EAAS,KAAKlQ,IAAUW,IAAcD,QAAY;AAEnD,WAAK7B,IAAI,GAAGA;AAAA,MAA6BuX,EAAkB,QAAQvX;AAClE,QAAAqe;AAAA,UACC9G,EAAiBvX,CAAC;AAAA;AAAA,UACKqR;AAAA,QAC5B;AAQE,QAAIoD,MAAsB,QAAQA,MAAsBpD,GAAU;AAKjE,UAJA6M,MAIIzJ,EAAkB,SAAS;AAC9B,iBAASzU,IAAI,GAAGA,IAAIue,GAAuBve,KAAK;AAC/C,UAAAyU,EAAkB,KAAKzU,CAAC,EAAE,KAAKke;AAIjC,UAAII,MAAkB;AACrB,mBAAW7U,KAAO6U;AACjB,UAAA7U,EAAI,KAAKyU;AAIX,MAAI3G,MAAqB,SACpBiH,MAA8B,OACjCA,IAA4BjH,IAE5BiH,EAA0B,KAAK;AAAA,MAA4BjH,CAAiB;AAAA,IAG/E;AAEA,YAAKlG,EAAS,IAAIzO,QAAiB,MAClCyO,EAAS,KAAKzO,KAGR5B;AAAA,EACR,SAAS4H,GAAO;AACf,WAAOD,GAAaC,CAAK;AAAA,EAC1B,UAAC;AACA,IAAAyI,EAAS,KAAK3O,IACdqb,IAAWO,GACXN,IAAeO,GACfhH,IAAmBiH,GACnB1V,IAAkB2L,GAClByC,IAAkBuH,GAClB1X,GAAsB2N,CAA0B,GAChDuC,IAAayH,GACb1G,KAAiB2G;AAAA,EAClB;AACD;AAQA,SAASE,GAAgB1V,GAAQiV,GAAY;AAC5C,MAAIhN,IAAYgN,EAAW;AAC3B,MAAIhN,MAAc,MAAM;AACvB,QAAI0N,IAAQhgB,GAAS,KAAKsS,GAAWjI,CAAM;AAC3C,QAAI2V,MAAU,IAAI;AACjB,UAAIC,IAAa3N,EAAU,SAAS;AACpC,MAAI2N,MAAe,IAClB3N,IAAYgN,EAAW,YAAY,QAGnChN,EAAU0N,CAAK,IAAI1N,EAAU2N,CAAU,GACvC3N,EAAU,IAAG;AAAA,IAEf;AAAA,EACD;AAIA,MACCA,MAAc,SACbgN,EAAW,IAAIjd,OAAa;AAAA;AAAA;AAAA,GAI5B4c,MAAa,QAAQ,CAAChf,GAAS,KAAKgf,GAAUK,CAAU,IACxD;AACD,QAAI9U;AAAA;AAAA,MAAkC8U;AAAA;AAItC,KAAK9U,EAAQ,IAAI3H,OAAe,MAC/B2H,EAAQ,KAAK3H,GACb2H,EAAQ,KAAK,CAAC7G,KAQX6G,EAAQ,MAAM/K,KACjB8K,GAAsBC,CAAO,GAI9BgN,GAAuBhN,CAAO,GAG9BiN,GAAiBjN,GAAS,CAAC;AAAA,EAC5B;AACD;AAOO,SAASiN,GAAiBpN,GAAQ6V,GAAa;AACrD,MAAIb,IAAehV,EAAO;AAC1B,MAAIgV,MAAiB;AAErB,aAASne,IAAIgf,GAAahf,IAAIme,EAAa,QAAQne;AAClD,MAAA6e,GAAgB1V,GAAQgV,EAAane,CAAC,CAAC;AAEzC;AAMO,SAASgR,GAAcnI,GAAQ;AACrC,MAAIyG,IAAQzG,EAAO;AAEnB,OAAKyG,IAAQtN,OAAe,GAI5B;AAAA,IAAAkH,EAAkBL,GAAQjH,CAAK;AAE/B,QAAI4S,IAAkB7M,GAClBsX,IAAsBnB;AAE1B,IAAAnW,IAAgBkB,GAChBiV,KAAqB;AAUrB,QAAI;AACH,OAAKxO,KAAS/N,IAAeD,SAAqB,IACjDwb,GAA8BjU,CAAM,IAEpC2N,GAAwB3N,CAAM,GAG/B4T,GAAwB5T,CAAM;AAC9B,UAAI0D,IAAW4J,GAAgBtN,CAAM;AACrC,MAAAA,EAAO,WAAW,OAAO0D,KAAa,aAAaA,IAAW,MAC9D1D,EAAO,KAAKoV;AAId,UAAAxU;AAAE,MAAI7K,MAAOgI,OAAsBiC,EAAO,IAAIhH,OAAW,KAAKgH,EAAO;AAAA,IAQpE,UAAC;AACA,MAAAiV,KAAqBmB,GACrBtX,IAAgB6M;AAAA,IAMjB;AAAA;AACD;AAMO,eAAe0K,KAAO;AAW5B,QAAM,QAAQ,QAAO,GAIrB7M,GAAS;AACV;AAQO,SAASgB,KAAU;AACzB,SAAOjB,GAAM,OAAM,EAAG,QAAO;AAC9B;AAOO,SAAS3G,GAAItC,GAAQ;AAC3B,MAAImG,IAAQnG,EAAO,GACfyF,KAAcU,IAAQnO,OAAa;AAKvC,MAAI2H,MAAoB,QAAQ,CAACmO,GAAY;AAI5C,QAAIkI,IAAYxX,MAAkB,SAASA,EAAc,IAAI3F,OAAe;AAE5E,QAAI,CAACmd,MAAcjI,MAAoB,QAAQ,CAACnY,GAAS,KAAKmY,GAAiB/N,CAAM,IAAI;AACxF,UAAIK,IAAOV,EAAgB;AAE3B,WAAKA,EAAgB,IAAIpG,QAA0B;AAElD,QAAIyG,EAAO,KAAK+U,OACf/U,EAAO,KAAK+U,IAKRH,MAAa,QAAQvU,MAAS,QAAQA,EAAKwU,CAAY,MAAM7U,IAChE6U,MACUD,MAAa,OACvBA,IAAW,CAAC5U,CAAM,IAElB4U,EAAS,KAAK5U,CAAM;AAAA,WAGhB;AAMN,QAAAL,EAAgB,SAAhBA,EAAgB,OAAS,CAAA,IACpB/J,GAAS,KAAK+J,EAAgB,MAAMK,CAAM,KAC9CL,EAAgB,KAAK,KAAKK,CAAM;AAGjC,YAAIiI,IAAYjI,EAAO;AAEvB,QAAIiI,MAAc,OACjBjI,EAAO,YAAY,CAACL,CAAe,IACxB/J,GAAS,KAAKqS,GAAWtI,CAAe,KACnDsI,EAAU,KAAKtI,CAAe;AAAA,MAEhC;AAAA,IACD;AAAA,EACD;AAsDA,MAAImN,MAAwBlH,GAAW,IAAI5F,CAAM;AAChD,WAAO4F,GAAW,IAAI5F,CAAM;AAG7B,MAAIyF,GAAY;AACf,QAAItF;AAAA;AAAA,MAAkCH;AAAA;AAEtC,QAAI8M,IAAsB;AACzB,UAAIha,IAAQqN,EAAQ;AAIpB,eACGA,EAAQ,IAAI1H,OAAW,KAAK0H,EAAQ,cAAc,QACpD8V,GAAsB9V,CAAO,OAE7BrN,IAAQ8Z,GAAgBzM,CAAO,IAGhCyF,GAAW,IAAIzF,GAASrN,CAAK,GAEtBA;AAAA,IACR;AAIA,QAAIojB,KACF/V,EAAQ,IAAI3H,OAAe,KAC5B,CAACsV,KACDnO,MAAoB,SACnBgV,OAAuBhV,EAAgB,IAAInH,OAAe,IAExD2d,KAAUhW,EAAQ,IAAIrH,QAAkB;AAE5C,IAAI8O,GAASzH,CAAO,MACf+V,MAGH/V,EAAQ,KAAK3H,IAGdyU,GAAe9M,CAAO,IAGnB+V,KAAkB,CAACC,MACtB7I,GAAyBnN,CAAO,GAChCiW,GAAUjW,CAAO;AAAA,EAEnB;AAEA,MAAIwD,KAAA,QAAAA,EAAc,IAAI3D;AACrB,WAAO2D,EAAa,IAAI3D,CAAM;AAG/B,OAAKA,EAAO,IAAIvG,QAAiB;AAChC,UAAMuG,EAAO;AAGd,SAAOA,EAAO;AACf;AAOA,SAASoW,GAAUjW,GAAS;AAG3B,MAFAA,EAAQ,KAAK3H,GAET2H,EAAQ,SAAS;AAErB,eAAWG,KAAOH,EAAQ;AACzB,OAACG,EAAI,cAAJA,EAAI,YAAc,KAAI,KAAKH,CAAO,IAE9BG,EAAI,IAAItI,OAAa,MAAMsI,EAAI,IAAI9H,OAAe,MACtD8U;AAAA;AAAA,QAAiDhN;AAAA,MAAG,GACpD8V;AAAA;AAAA,QAAkC9V;AAAA,MAAG;AAGxC;AAGA,SAAS2V,GAAsB9V,GAAS;AACvC,MAAIA,EAAQ,MAAM/K,EAAe,QAAO;AACxC,MAAI+K,EAAQ,SAAS,KAAM,QAAO;AAElC,aAAWG,KAAOH,EAAQ;AAKzB,QAJIyF,GAAW,IAAItF,CAAG,MAIjBA,EAAI,IAAItI,OAAa,KAAKie;AAAA;AAAA,MAA8C3V;AAAA;AAC5E,aAAO;AAIT,SAAO;AACR;AA4BO,SAASQ,GAAQpK,GAAI;AAC3B,MAAI6e,IAAsBzH;AAC1B,MAAI;AACH,WAAAA,IAAa,IACNpX,EAAE;AAAA,EACV,UAAC;AACA,IAAAoX,IAAayH;AAAA,EACd;AACD;AAQO,SAASc,GAAgBvjB,GAAO;AACtC,MAAI,SAAOA,KAAU,YAAY,CAACA,KAASA,aAAiB;AAI5D,QAAI4G,MAAgB5G;AACnB,MAAAwjB,GAAUxjB,CAAK;AAAA,aACL,CAAC,MAAM,QAAQA,CAAK;AAC9B,eAASgF,KAAOhF,GAAO;AACtB,cAAMkc,IAAOlc,EAAMgF,CAAG;AACtB,QAAI,OAAOkX,KAAS,YAAYA,KAAQtV,MAAgBsV,KACvDsH,GAAUtH,CAAI;AAAA,MAEhB;AAAA;AAEF;AASO,SAASsH,GAAUxjB,GAAOyjB,IAAU,oBAAI,IAAG,GAAI;AACrD,MACC,OAAOzjB,KAAU,YACjBA,MAAU;AAAA,EAEV,EAAEA,aAAiB,gBACnB,CAACyjB,EAAQ,IAAIzjB,CAAK,GACjB;AACD,IAAAyjB,EAAQ,IAAIzjB,CAAK,GAGbA,aAAiB,QACpBA,EAAM,QAAO;AAEd,aAASgF,KAAOhF;AACf,UAAI;AACH,QAAAwjB,GAAUxjB,EAAMgF,CAAG,GAAGye,CAAO;AAAA,MAC9B,QAAY;AAAA,MAEZ;AAED,UAAMC,IAAQrgB,GAAiBrD,CAAK;AACpC,QACC0jB,MAAU,OAAO,aACjBA,MAAU,MAAM,aAChBA,MAAU,IAAI,aACdA,MAAU,IAAI,aACdA,MAAU,KAAK,WACd;AACD,YAAMC,IAAczgB,GAAgBwgB,CAAK;AACzC,eAAS1e,KAAO2e,GAAa;AAC5B,cAAMnU,IAAMmU,EAAY3e,CAAG,EAAE;AAC7B,YAAIwK;AACH,cAAI;AACH,YAAAA,EAAI,KAAKxP,CAAK;AAAA,UACf,QAAY;AAAA,UAEZ;AAAA,MAEF;AAAA,IACD;AAAA,EACD;AACD;ACr0BO,MAAM4jB,KAAW;AAGjB,SAASC,GAAgBC,GAAiBC,GAAe;;AAC9D,EAAAD,EAAG,QAAQ,QAAQF,KACnBtc,IAAAwc,EAAG,SAAQ,YAAXxc,EAAW,UAAY,YACvBwc,EAAG,QAAQ,cAAcC;AAC3B;AASA,MAAMC,KAAc,gBACdC,KAAiB;AAQvB,SAASC,GACP7H,GACA8H,GACAC,GACO;AACP,QAAMC,IAAShI,KAAA,gBAAAA,EAAQ,QAAQ;AAC/B,MAAIgI,MAAW,UAAUA,MAAW,QAAS,QAAOA;AAEpD,OADKF,KACL,OAAW,eAAiB,IAAa,QAAOC,KAAWH;AAC3D,QAAM/jB,IAAI,aAAa,QAAQ8jB,EAAW;AAC1C,SAAO9jB,MAAM,UAAUA,MAAM,UAAUA,IAAKkkB,KAAWH;AACzD;AAEA,SAASK,GAAMtQ,GAAUqI,GAA4B;AACnD,MAAIA,GAAQ;AACV,IAAAwH,GAAgBxH,GAAQrI,CAAC;AACzB;AAAA,EACF;AACA,EAAA,OAAW,WAAa,OACtB6P,GAAgB,SAAS,iBAAiB7P,CAAC;AAC/C;AAEA,SAASmQ,GAAQnQ,GAAUuQ,GAAkB;AAC3C,EAAKA,MACL,OAAW,eAAiB,OAC5B,aAAa,QAAQP,IAAahQ,CAAC;AACrC;;AAEA,MAAMwQ,GAAW;AAAA,EAAjB;AACY,IAAAnT,EAAA,MAAAoT,IAAAC,gBAAAA,EAAcT,EAAO;AAC/B,IAAAtjB,EAAA,gBAA6B;AAC7B,IAAAA,EAAA,sBAAe;AAAA;AAAA,MAFf,UAAA;;;MAAA,QAAAX,GAAA;;;EAIA,KAAK2kB,IAAA,IAA6B;AAChC,SAAK,SAASA,EAAK,UAAU,MAC7B,KAAK,eAAeA,EAAK,WAAW,IACpC,KAAK,UAAUT,GAAK,KAAK,QAAQ,KAAK,cAAcS,EAAK,OAAO,GAChEL,GAAM,KAAK,SAAS,KAAK,MAAM;AAAA,EACjC;AAAA,EAEA,IAAItQ,GAAU;AACZ,SAAK,UAAUA,GACfsQ,GAAMtQ,GAAG,KAAK,MAAM,GACpBmQ,GAAQnQ,GAAG,KAAK,YAAY;AAAA,EAC9B;AAAA,EAEA,SAAS;AACP,SAAK,IAAI,KAAK,YAAY,SAAS,UAAU,MAAM;AAAA,EACrD;AACF;AApBYyQ,KAAA;AAsBL,MAAMG,KAAQ,IAAIJ,GAAA;AC/DzB,SAASK,GAASX,GAAoD;AACpE,MAAI;AACF,UAAMhkB,IAAIgkB,EAAA;AACV,WAAO,OAAOhkB,KAAM,YAAYA,EAAE,SAAS,IAAIA,IAAI;AAAA,EACrD,QAAQ;AACN;AAAA,EACF;AACF;AAEA,SAAS4kB,GAAe5kB,GAAmB;AACzC,SAAOA,EAAE,WAAW,GAAG,IAAIA,EAAE,MAAM,CAAC,IAAIA;AAC1C;AAEO,SAAS6kB,KAA2B;AACzC,SAAO;AAAA,IACL,SAASD,GAAeD,GAAS,MAAM,OAAkB,KAAK,WAAW;AAAA,IACzE,QAAQA,GAAS,MAAM,SAAkB,KAAK;AAAA,IAC9C,WAAWA,GAAS,MAAM,SAAqB,KAAK;AAAA,EAAA;AAExD;AAGO,MAAMG,KAAyBD,KAAgB,SClBzCE,KAAgD,OAAO,OAAO;AAAA,EACzE,KAAK;AAAA,EACL,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,WAAW;AACb,CAAC,GAaKC,KAA4D;AAAA,EAChE,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,SAAS;AAAA,EACT,gBAAgB;AAAA,EAChB,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,KAAK;AAAA,EACL,gBAAgB;AAAA,EAChB,YAAY;AACd;AAQO,SAASC,GAAuBC,GAA0C;;AAC/E,QAAMjlB,IAA0B,EAAE,GAAG8kB,GAAA;AACrC,aAAWtd,KAAQyd,EAAI,YAAY,CAAA,GAAI;AACrC,UAAMpgB,IAAMkgB,KAAgB5d,IAAAK,KAAA,gBAAAA,EAAM,gBAAN,gBAAAL,EAAA,KAAAK,OAAyB,EAAE;AACvD,IAAI3C,MAAK7E,EAAI6E,CAAG,IAAI;AAAA,EACtB;AACA,aAAW,CAAC2C,GAAM0d,CAAE,KAAK,OAAO,QAAQD,EAAI,gBAAgB,CAAA,CAAE,GAAG;AAC/D,UAAMpgB,IAAMkgB,GAAgBvd,EAAK,YAAA,CAAa;AAC9C,IAAI3C,MAAK7E,EAAI6E,CAAG,IAAIqgB,MAAO;AAAA,EAC7B;AACA,SAAOllB;AACT;ACmJA,MAAMmlB,yBAAoC,IAAA,GACpCC,yBAAqC,IAAA;AAE3C,SAASC,GAAqC,GAAqB;AAEjE,UADgB,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,GAC1C,SAAS,oCAAoC;AAC9D;AAGA,SAASC,GAAmB,GAAqB;AAC/C,QAAMC,IAAU,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;AACzD,SAAO,qBAAqB,KAAKA,CAAO;AAC1C;AAEA,SAASC,GAAmCC,GAAwB;AAClE,SAAO,IAAI;AAAA,IACT,4DAA4DA,CAAO;AAAA,EAAA;AAEvE;AAEA,SAASC,GAAqB7lB,GAA6C;AACzE,MAAI,CAACA,KAAS,OAAOA,KAAU,SAAU,QAAO;AAChD,QAAM8lB,IAAY9lB;AAClB,SACE,OAAO8lB,EAAU,QAAS,YAC1BA,EAAU,KAAK,SAAS,KACxB,OAAOA,EAAU,QAAS,YAC1BA,EAAU,KAAK,SAAS,MACvBA,EAAU,WAAW,UAAa,OAAOA,EAAU,UAAW;AAEnE;AAoBA,gBAAgBC,GACdzlB,GAC6B;AAC7B,QAAM0lB,IAAS1lB,EAAK,UAAA,GACd2lB,IAAU,IAAI,YAAA;AACpB,MAAIC,IAAM;AACV,MAAI;AACF,eAAS;AACP,YAAM,EAAE,MAAAC,GAAM,OAAAnmB,EAAA,IAAU,MAAMgmB,EAAO,KAAA;AACrC,UAAIG,EAAM;AACV,MAAAD,KAAOD,EAAQ,OAAOjmB,GAAO,EAAE,QAAQ,IAAM;AAC7C,UAAIomB;AACJ,cAAQA,IAAKF,EAAI,QAAQ;AAAA,CAAI,OAAO,MAAI;AACtC,cAAMG,IAAOH,EAAI,MAAM,GAAGE,CAAE,EAAE,KAAA;AAC9B,QAAAF,IAAMA,EAAI,MAAME,IAAK,CAAC,GAClBC,MAAM,MAAM,KAAK,MAAMA,CAAI;AAAA,MACjC;AAAA,IACF;AACA,UAAMC,IAAOJ,EAAI,KAAA;AACjB,IAAII,MAAM,MAAM,KAAK,MAAMA,CAAI;AAAA,EACjC,UAAA;AACE,IAAAN,EAAO,YAAA;AAAA,EACT;AACF;AAEA,MAAMO,KAAY;AAQX,SAASC,GAAgBnc,GAAmC;;AACjE,MAAI,MAAM,QAAQA,CAAI,UAAUA,EAAK;AACrC,MAAIA,KAAQ,OAAOA,KAAS,UAAU;AACpC,UAAM4K,IAAI5K;AAIV,QAAI,OAAO4K,EAAE,gBAAiB,iBAAiBA,EAAE;AACjD,QAAI,MAAM,SAAQ3N,IAAA2N,EAAE,WAAF,gBAAA3N,EAAU,OAAO,EAAG,QAAO2N,EAAE,OAAO,QAAQ;AAAA,EAChE;AAEF;AAOO,SAASwR,GAAU,GAAoB;AAC5C,MAAI,aAAa,MAAO,QAAO,EAAE,WAAW,OAAO,CAAC;AACpD,MAAI,OAAO,KAAM,SAAU,QAAO;AAClC,MAAI,KAAK,OAAO,KAAM,UAAU;AAC9B,UAAMC,IAAK,EAA4B;AACvC,QAAI,OAAOA,KAAM,YAAYA,EAAG,QAAOA;AACvC,QAAI;AACF,YAAMhR,IAAI,KAAK,UAAU,CAAC;AAC1B,UAAIA,KAAKA,MAAM,KAAM,QAAOA;AAAA,IAC9B,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO,OAAO,CAAC;AACjB;AAWA,eAAsBiR,GACpBC,GACAC,GACAlC,IAAmD,CAAA,GAC7B;;AACtB,QAAMmC,IAAYnC,EAAK,SAAS,EAAE,QAAQA,EAAK,WAAW;AAC1D,MAAI,CAAC4B,GAAU,KAAKM,CAAG;AACrB,WAAOC,IAAYF,EAAO,MAAMC,GAAKC,CAAS,IAAIF,EAAO,MAAMC,CAAG;AACpE,MAAI;AACF,UAAMnR,IAAI,MAAMkR,EAAO,mBAAmBC,GAAKlC,CAAI;AACnD,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAOkC;AAAA,MACP,cAAcnR,EAAE;AAAA,MAChB,QAAQ;AAAA,QACN,SAASA,EAAE;AAAA,QACX,SAASA,EAAE,KAAK;AAAA,UAAI,CAACqR,MACnBA,EAAI,UACJ,OAAOA,EAAI,UAAW,aACrB,WAAWA,KACV,WAAWA,KACX,WAAWA,KACX,oBAAoBA,KACjBA,IACD,EAAE,QAAQA,EAAA;AAAA,QAAI;AAAA,MACpB;AAAA,MAEF,UAAU;AAAA,MACV,WAAWrR,EAAE;AAAA,IAAA;AAAA,EAEjB,SAAS3I,GAAG;AACV,SACEzF,IAAAqd,EAAK,WAAL,QAAArd,EAAa,WACZyF,aAAa,SAASA,EAAE,SAAS;AAElC,YAAMA;AAER,WAAO+Z,IAAYF,EAAO,MAAMC,GAAKC,CAAS,IAAIF,EAAO,MAAMC,CAAG;AAAA,EACpE;AACF;AAEO,MAAMG,GAAU;AAAA,EAKrB,YAAYpB,GAAiBjB,IAAyB,IAAI;AAJjD,IAAAhkB,EAAA;AACQ,IAAAA,EAAA;AACA,IAAAA,EAAA;AAGf,SAAK,UAAUilB,EAAQ,QAAQ,OAAO,EAAE,GACxC,KAAK,UAAUjB,EAAK,SACpB,KAAK,UAAUA,EAAK,SAAS,WAAW,MAAM,KAAK,UAAU;AAAA,EAC/D;AAAA,EAEA,MAAc,KAAQsC,GAAcC,GAAgC;AAClE,UAAMC,IAAM,GAAG,KAAK,OAAO,GAAGF,CAAI,IAC5BG,IAAkC;AAAA,MACtC,gBAAgB;AAAA,IAAA;AAElB,WAAO,OAAOA,GAAS,KAAK,OAA6C,GACzE,OAAO,OAAOA,GAASF,KAAA,gBAAAA,EAAM,OAA6C;AAM1E,UAAMG,KAAOH,KAAA,gBAAAA,EAAM,WAAU,OACvBI,IAAY,KAAK,IAAA,GACjBnZ,IAAQ,YAAY,IAAA,GACpBoZ,IAAUlnB,GAAgB6mB,KAAA,gBAAAA,EAAM,IAAI,GACpCM,IAAU,MAAM,KAAK,MAAM,YAAY,IAAA,IAAQrZ,CAAK;AAE1D,QAAI/J;AACJ,QAAI;AACF,MAAAA,IAAM,MAAM,KAAK,QAAQ+iB,GAAK,EAAE,GAAGD,GAAM,SAAAE,GAAS;AAAA,IACpD,SAASra,GAAG;AACV,YAAA9L,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAAomB;AAAA,QACA,QAAQJ;AAAA,QACR,WAAAK;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,SAAAD;AAAA,QACA,OAAOd,GAAU1Z,CAAC;AAAA,MAAA,CACnB,GACKA;AAAA,IACR;AAEA,QAAI,CAAC3I,EAAI,IAAI;AACX,YAAM9D,IAAO,MAAM8D,EAAI,OAAO,MAAM,MAAM,EAAE,GACtCshB,IAAU,GAAG2B,CAAI,IAAIJ,CAAI,MAAM7iB,EAAI,MAAM,IAAI9D,EAAK,MAAM,GAAG,GAAG,CAAC;AACrE,YAAAW,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAAomB;AAAA,QACA,QAAQJ;AAAA,QACR,WAAAK;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,QAAQpjB,EAAI;AAAA,QACZ,SAAAmjB;AAAA,QACA,OAAO7B;AAAA,MAAA,CACR,GACK,IAAI,MAAMA,CAAO;AAAA,IACzB;AAEA,UAAMrb,IAAQ,MAAMjG,EAAI,KAAA,GAClBqjB,IAAWjB,GAAgBnc,CAAI;AACrC,WAAApJ,GAAW,OAAO;AAAA;AAAA;AAAA,MAGhB,MAAMwmB,MAAa,SAAY,SAAS;AAAA,MACxC,MAAAJ;AAAA,MACA,QAAQJ;AAAA,MACR,WAAAK;AAAA,MACA,YAAYE,EAAA;AAAA,MACZ,IAAI;AAAA,MACJ,QAAQpjB,EAAI;AAAA,MACZ,GAAIqjB,MAAa,SAAY,CAAA,IAAK,EAAE,UAAAA,EAAA;AAAA,MACpC,SAAAF;AAAA,IAAA,CACD,GACMld;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,MAAMqd,GAAkBC,GAAmC;AAC/D,UAAMC,IAAW,IAAI,IAAI,KAAK,OAAO;AACrC,QACEA,EAAS,YACTA,EAAS,YACTA,EAAS,UACTA,EAAS,QACRA,EAAS,aAAa,YACrB,EACEA,EAAS,aAAa,WACtB,CAAC,aAAa,aAAa,OAAO,EAAE,SAASA,EAAS,QAAQ;AAGlE,YAAM,IAAI,MAAM,4CAA4C;AAI9D,UAAMC,IAAW,MAAM,KAAK,QAAQ,GAAG,KAAK,OAAO,eAAe;AAAA,MAChE,QAAQ;AAAA,MACR,SAAS,EAAE,gBAAgB,mBAAA;AAAA,MAC3B,aAAa;AAAA,MACb,UAAU;AAAA,MACV,MAAM,KAAK,UAAU,EAAE,UAAAH,GAAU,UAAAC,GAAU;AAAA,IAAA,CAC5C;AACD,QAAI,CAACE,EAAS;AACZ,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAEJ,UAAMC,IAAU,MAAMD,EAAS,KAAA;AAC/B,QACEC,EAAQ,OAAO,MACf,OAAOA,EAAQ,SAAU,YACzB,CAACA,EAAQ;AAET,YAAM,IAAI,MAAM,8CAA8C;AAEhE,WAAOA,EAAQ;AAAA,EACjB;AAAA,EAEA,MAAM,QAAwB;AAC5B,WAAO,KAAK,KAAY,QAAQ;AAAA,EAClC;AAAA,EAEA,MAAM,gBAAwC;AAC5C,WAAO,KAAK,KAAoB,iBAAiB;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,iBAA8C;AAIlD,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO,OAAO,QAAQ,IAAI,CAACC,MAAQ;AACnC,YAAM7nB,IAAI6nB,EAAI;AACd,aAAO;AAAA,QACL,MAAM,OAAO7nB,EAAE,QAAQ,EAAE;AAAA,QACzB,MAAMA,EAAE;AAAA,QACR,MAAM,OAAOA,EAAE,QAAQ,QAAQ;AAAA,QAC/B,MAAOA,EAAE,QAA0B;AAAA,QACnC,2BAA2BA,EAAE,8BAA8B;AAAA,QAC3D,eACE,OAAOA,EAAE,iBAAkB,WAAWA,EAAE,gBAAgB;AAAA,MAAA;AAAA,IAE9D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU8nB,GAAeC,GAAsC;AACnE,UAAMC,IAAK,IAAI,gBAAgB,EAAE,OAAAF,GAAO;AACxC,WAAIC,MAAS,UAAWC,EAAG,IAAI,QAAQ,OAAOD,CAAI,CAAC,GAC5C,KAAK,KAAmB,iBAAiBC,CAAE,EAAE;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,eACJF,GACA7Z,GACA+S,GACAiH,GACuB;AACvB,UAAMD,IAAK,IAAI,gBAAgB;AAAA,MAC7B,OAAAF;AAAA,MACA,OAAO,OAAO7Z,CAAK;AAAA,MACnB,KAAK,OAAO+S,CAAG;AAAA,MACf,MAAM,OAAOiH,CAAI;AAAA,IAAA,CAClB;AACD,WAAO,KAAK,KAAmB,uBAAuBD,CAAE,EAAE;AAAA,EAC5D;AAAA,EAEA,MAAM,OAEJ;AACA,UAAM/Z,IAAQ,YAAY,IAAA;AAC1B,QAAI;AACF,mBAAM,KAAK,KAAK,QAAQ,GACjB,EAAE,IAAI,IAAM,QAAQ,KAAK,MAAM,YAAY,QAAQA,CAAK,EAAA;AAAA,IACjE,SAASpB,GAAG;AACV,aAAO,EAAE,IAAI,IAAO,OAAO0Z,GAAU1Z,CAAC,EAAA;AAAA,IACxC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,eAA4C;AAChD,QAAI;AACF,YAAMqY,IAAM,MAAM,KAAK,KAAsB,eAAe;AAC5D,UACE,CAACA,KACD,OAAOA,KAAQ,YACf,MAAM,QAAQA,CAAG,KACjBA,EAAI,OAAO;AAEX,eAAO,EAAE,GAAGH,GAAA;AAId,UAAI,cAAcG,KAAO,kBAAkBA;AACzC,eAAOD,GAAuBC,CAAG;AAAA,IACrC,SAASrY,GAAG;AAGV,UAAI,CAAC0Y,GAAmB1Y,CAAC,EAAG,QAAO,EAAE,GAAGkY,GAAA;AAAA,IAC1C;AACA,UAAM,CAACmD,GAAKC,CAAa,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC7C,KAAK,SAAS,uBAAuB;AAAA,MACrC,KAAK,SAAS,iBAAiB;AAAA,IAAA,CAChC;AACD,WAAO,EAAE,GAAGpD,IAA2B,KAAAmD,GAAK,eAAAC,EAAA;AAAA,EAC9C;AAAA;AAAA;AAAA,EAIA,MAAc,SAASpB,GAAgC;AACrD,QAAI;AACF,mBAAM,KAAK,KAAKA,CAAI,GACb;AAAA,IACT,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,cAAiC;AAErC,YADU,MAAM,KAAK,KAAgC,cAAc,GAC1D;AAAA,EACX;AAAA,EAEA,MAAM,WAAWtf,GAA2C;AAC1D,QAAI2d,GAA8B,IAAI,KAAK,OAAO;AAChD,YAAMK,GAAmC,KAAK,OAAO;AAGvD,UAAMsB,IAAO,gBAAgB,mBAAmBtf,CAAI,CAAC,IAC/C2gB,IAAgB/C,GAA+B,IAAI,KAAK,OAAO;AACrE,QAAI+C,GAAe;AAEjB,UAAI,CADc,MAAMA,EACR,OAAM3C,GAAmC,KAAK,OAAO;AACrE,aAAO,KAAK,KAAyBsB,CAAI;AAAA,IAC3C;AAEA,QAAIsB;AACJ,UAAMC,IAAQ,IAAI,QAAiB,CAACvkB,MAAY;AAC9C,MAAAskB,IAAetkB;AAAA,IACjB,CAAC;AACD,IAAAshB,GAA+B,IAAI,KAAK,SAASiD,CAAK;AAEtD,QAAI;AACF,YAAMC,IAAW,MAAM,KAAK,KAAyBxB,CAAI;AACzD,aAAAsB,EAAc,EAAI,GACXE;AAAA,IACT,SAAS1b,GAAG;AACV,YAAIyY,GAAqCzY,CAAC,KACxCuY,GAA8B,IAAI,KAAK,OAAO,GAC9CiD,EAAc,EAAK,KAEnBA,EAAc,EAAI,GAEdxb;AAAA,IACR,UAAA;AACE,MAAAwY,GAA+B,OAAO,KAAK,OAAO;AAAA,IACpD;AAAA,EACF;AAAA,EAEA,MAAM,iBAAiB5d,GAA6B;AAClD,UAAM,KAAK,KAAK,gBAAgB;AAAA,MAC9B,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,MAAAA,GAAM;AAAA,IAAA,CAC9B;AAAA,EACH;AAAA,EAEA,MAAM,eACJ+gB,GACAC,GACyB;AACzB,WAAO,KAAK;AAAA,MACV,gBAAgB,mBAAmBD,CAAU,CAAC;AAAA,MAC9C;AAAA,QACE,QAAQ;AAAA,QACR,MAAM,KAAK,UAAUC,CAAG;AAAA,MAAA;AAAA,IAC1B;AAAA,EAEJ;AAAA,EAEA,MAAM,MACJX,GACArD,IAAiC,IACX;AACtB,WAAO,KAAK,KAAkB,UAAU;AAAA,MACtC,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,OAAAqD,GAAO;AAAA,MAC9B,QAAQrD,EAAK;AAAA,IAAA,CACd;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,mBACJqD,GACArD,IAAmD,IACrB;AAC9B,UAAMiE,IAAUjE,EAAK,WAAW,KAC1ByC,IAAkC;AAAA,MACtC,gBAAgB;AAAA,MAChB,QAAQ;AAAA,IAAA;AAEV,WAAO,OAAOA,GAAS,KAAK,OAA6C;AAKzE,UAAME,IAAY,KAAK,IAAA,GACjBnZ,IAAQ,YAAY,IAAA,GACpB7N,IAAO,KAAK,UAAU,EAAE,OAAA0nB,GAAO,GAC/BT,IAAUlnB,GAAgBC,CAAI,GAC9BknB,IAAU,MAAM,KAAK,MAAM,YAAY,IAAA,IAAQrZ,CAAK;AAE1D,QAAI/J;AACJ,QAAI;AACF,MAAAA,IAAM,MAAM,KAAK,QAAQ,GAAG,KAAK,OAAO,iBAAiB;AAAA,QACvD,QAAQ;AAAA,QACR,SAAAgjB;AAAA,QACA,MAAA9mB;AAAA,QACA,QAAQqkB,EAAK;AAAA,MAAA,CACd;AAAA,IACH,SAAS5X,GAAG;AACV,YAAA9L,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,WAAAqmB;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,SAAAD;AAAA,QACA,OAAOd,GAAU1Z,CAAC;AAAA,MAAA,CACnB,GACKA;AAAA,IACR;AACA,QAAI,CAAC3I,EAAI,MAAM,CAACA,EAAI,MAAM;AACxB,YAAMykB,IAAUzkB,EAAI,OAAO,MAAMA,EAAI,OAAO,MAAM,MAAM,EAAE,IAAI,IACxDshB,IAAU,wBAAwBthB,EAAI,MAAM,IAAIykB,EAAQ,MAAM,GAAG,GAAG,CAAC;AAC3E,YAAA5nB,GAAW,OAAO;AAAA,QAChB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,WAAAqmB;AAAA,QACA,YAAYE,EAAA;AAAA,QACZ,IAAI;AAAA,QACJ,QAAQpjB,EAAI;AAAA,QACZ,SAAAmjB;AAAA,QACA,OAAO7B;AAAA,MAAA,CACR,GACK,IAAI,MAAMA,CAAO;AAAA,IACzB;AAEA,UAAMvlB,IAA2B;AAAA,MAC/B,SAAS,CAAA;AAAA,MACT,MAAM,CAAA;AAAA,MACN,UAAU;AAAA,MACV,WAAW;AAAA,IAAA;AAGb,qBAAiB2oB,KAAS/C,GAAkB3hB,EAAI,IAAI;AAClD,UAAI,gBAAgB0kB;AAClB,QAAA3oB,EAAI,WAAW2oB,EAAM,WAAW,WAAW,CAAA,GAAI;AAAA,UAAI,CAACC,MAClD,OAAOA,KAAW,WAAWA,IAASA,EAAO;AAAA,QAAA,GAE/C5oB,EAAI,oBAAoB2oB,EAAM,WAAW;AAAA,eAChC,YAAYA;AACrB,QAAA3oB,EAAI,SAAS2oB,EAAM,OAAO;AAAA,eACjB,SAASA,GAAO;AACzB,YAAI3oB,EAAI,KAAK,UAAUyoB,GAAS;AAC9B,UAAAzoB,EAAI,YAAY;AAChB;AAAA,QACF;AACA,QAAAA,EAAI,KAAK,KAAK2oB,EAAM,GAAG,GACvB3oB,EAAI,WAAWA,EAAI,KAAK;AAAA,MAC1B,WAAW,SAAS2oB,KAAS,eAAeA;AAC1C;AAIJ,WAAA7nB,GAAW,OAAO;AAAA,MAChB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,WAAAqmB;AAAA,MACA,YAAYE,EAAA;AAAA,MACZ,IAAI;AAAA,MACJ,QAAQpjB,EAAI;AAAA,MACZ,UAAUjE,EAAI;AAAA,MACd,SAAAonB;AAAA,IAAA,CACD,GAGGpnB,EAAI,aAAaA,EAAI,UACvB,MAAM,KAAK,kBAAkBA,EAAI,MAAM,EAAE,MAAM,MAAM;AAAA,IAErD,CAAC,GAEIA;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,kBAAkB6oB,GAA+B;AACrD,UAAM,KAAK,KAAK,wBAAwB;AAAA,MACtC,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,QAAAA,GAAQ;AAAA,IAAA,CAChC,EAAE,MAAM,MAAA;AAAA,KAAe;AAAA,EAC1B;AAAA,EAEA,MAAM,cAAcrhB,GAA2C;AAI7D,YAHU,MAAM,KAAK;AAAA,MACnB,gBAAgB,mBAAmBA,CAAI,CAAC;AAAA,IAAA,GAEjC;AAAA,EACX;AAAA,EAEA,MAAM,iBACJA,GACAshB,GAC6B;AAQ7B,YAPU,MAAM,KAAK;AAAA,MACnB,gBAAgB,mBAAmBthB,CAAI,CAAC;AAAA,MACxC;AAAA,QACE,QAAQ;AAAA,QACR,MAAM,KAAK,UAAU,EAAE,WAAAshB,GAAW;AAAA,MAAA;AAAA,IACpC,GAEO;AAAA,EACX;AAAA,EAEA,MAAM,QACJtE,IAOI,IACkB;AACtB,UAAMuD,IAAK,IAAI,gBAAA;AACf,IAAIvD,EAAK,QAAMuD,EAAG,IAAI,QAAQvD,EAAK,IAAI,GACnCA,EAAK,MAAIuD,EAAG,IAAI,MAAMvD,EAAK,EAAE,GAC7BA,EAAK,UAAQuD,EAAG,IAAI,UAAUvD,EAAK,MAAM,GACzCA,EAAK,UAAU,UAAWuD,EAAG,IAAI,SAAS,OAAOvD,EAAK,KAAK,CAAC,GAC5DA,EAAK,SAAS,UAAWuD,EAAG,IAAI,QAAQ,OAAOvD,EAAK,IAAI,CAAC,GACzDA,EAAK,aAAa,UAAWuD,EAAG,IAAI,aAAa,OAAOvD,EAAK,QAAQ,CAAC;AAC1E,UAAMuE,IAAShB,EAAG,SAAA,IAAa,IAAIA,CAAE,KAAK;AAI1C,YAHU,MAAM,KAAK;AAAA,MACnB,gBAAgBgB,CAAM;AAAA,IAAA,GAEf;AAAA,EACX;AAAA,EAEA,MAAM,WACJC,GACAC,GACAzE,IAAmD,CAAA,GACjC;AAClB,UAAMuD,IAAK,IAAI,gBAAA;AACf,IAAIvD,EAAK,cAAYuD,EAAG,IAAI,cAAcvD,EAAK,UAAU,GACrDA,EAAK,YAAY,UAAWuD,EAAG,IAAI,WAAW,OAAOvD,EAAK,OAAO,CAAC;AACtE,UAAMuE,IAAShB,EAAG,SAAA,IAAa,IAAIA,CAAE,KAAK;AAI1C,YAHU,MAAM,KAAK;AAAA,MACnB,iBAAiB,mBAAmBiB,CAAI,CAAC,SAAS,mBAAmBC,CAAE,CAAC,GAAGF,CAAM;AAAA,IAAA,GAE1E;AAAA,EACX;AAAA,EAEA,MAAM,cAA0C;AAC9C,WAAO,KAAK,KAAwB,qBAAqB,EAAE,MAAM,OAAO;AAAA,MACtE,IAAI;AAAA,MACJ,MAAM;AAAA,IAAA,EACN;AAAA,EACJ;AAAA,EAEA,MAAM,SAA0B;AAC9B,WAAO,KAAK,KAAa,cAAc;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,IAAIG,GAAkB1E,IAAmB,IAA0B;AACvE,WAAO,KAAK,KAAkB,WAAW;AAAA,MACvC,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,UAAA0E,GAAU,GAAG1E,GAAM;AAAA,IAAA,CAC3C;AAAA,EACH;AAAA,EAEA,MAAM,QAA6B;AAIjC,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO;AAAA,EACX;AAAA,EAEA,MAAM,UAAiC;AAIrC,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO,WAAW,CAAA;AAAA,EACtB;AAAA,EAEA,MAAM,WAAkC;AAItC,YAHU,MAAM,KAAK;AAAA,MACnB;AAAA,IAAA,GAEO,YAAY,CAAA;AAAA,EACvB;AAAA,EAEA,MAAM,QAAQ2E,GAA0D;AACtE,UAAM7U,IAAI,MAAM,KAAK,KAAsB,aAAa;AAAA,MACtD,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,QAAA6U,GAAQ;AAAA,IAAA,CAChC;AACD,QAAI,CAAC,MAAM,QAAQ7U,EAAE,OAAO;AAC1B,YAAM,IAAI,MAAMA,EAAE,SAAS,oCAAoC;AAEjE,WAAO6U,EAAO,IAAI,CAAChI,GAAOuB,MAAU;;AAClC,YAAM9d,MAASuC,IAAAmN,EAAE,YAAF,gBAAAnN,EAAYub,OAAU,CAAA,GAC/B0G,IAAW1D,GAAqB9gB,EAAO,QAAQ,IACjDA,EAAO,WACPuc,EAAM;AACV,aAAO;AAAA,QACL,QACE,OAAOvc,EAAO,UAAW,WAAWA,EAAO,SAASuc,EAAM;AAAA,QAC5D,UAAAiI;AAAA,QACA,gBACE,OAAOxkB,EAAO,kBAAmB,WAC7BA,EAAO,iBACPuc,EAAM;AAAA,QACZ,SAASvc,EAAO,YAAY;AAAA,QAC5B,QAAQ,OAAOA,EAAO,UAAW,WAAWA,EAAO,SAAS;AAAA,MAAA;AAAA,IAEhE,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,QACJykB,GACA7E,IAAgD,IACxB;AACxB,UAAMuD,IAAK,IAAI,gBAAA;AACf,IAAIsB,MAAa,UAAWtB,EAAG,IAAI,aAAa,OAAOsB,CAAQ,CAAC,GAC5D7E,EAAK,UAAU,UAAWuD,EAAG,IAAI,SAAS,OAAOvD,EAAK,KAAK,CAAC;AAChE,UAAMuE,IAAShB,EAAG,SAAA,IAAa,IAAIA,CAAE,KAAK,IAEpCuB,KADI,MAAM,KAAK,KAAgC,aAAaP,CAAM,GACvD,UAAU,CAAA;AAC3B,WAAOvE,EAAK,aACR8E,EAAO,OAAO,CAAC1c,MAAMA,EAAE,eAAe4X,EAAK,UAAU,IACrD8E;AAAA,EACN;AAAA;AAAA,EAGA,MAAM,KAAKzB,GAAwD;AAEjE,YADU,MAAM,KAAK,MAAMA,CAAK,GACvB,OAAO,QAAQ,IAAI,CAACD,MAAQA,EAAI,MAAM;AAAA,EACjD;AACF;AC95BO,MAAM2B,WAA+B,MAAM;AAAA,EAChD,YAA4BC,GAAY;AACtC,UAAM,uBAAuBA,CAAE,EAAE,GADP,KAAA,KAAAA,GAE1B,KAAK,OAAO;AAAA,EACd;AACF;AAEO,MAAMC,WAA0B,MAAM;AAAA,EAC3C,cAAc;AACZ,UAAM,6CAA6C,GACnD,KAAK,OAAO;AAAA,EACd;AACF;AAEO,MAAMC,WAAmC,MAAM;AAAA,EACpD,YAA4BF,GAA4BG,GAAgB;AACtE,UAAM,cAAcH,CAAE,iBAAiBG,CAAM,EAAE,GADrB,KAAA,KAAAH,GAA4B,KAAA,SAAAG,GAEtD,KAAK,OAAO;AAAA,EACd;AACF;ACzCO,MAAMC,GAAqD;AAAA,EAMhE,YAAYpF,GAA6B;AALxB,IAAAhkB,EAAA;AAER;AAAA,IAAAA,EAAA;AACD,IAAAA,EAAA,mBAAY;;AAGlB,SAAK,SAASgkB,EAAK,QACnB,KAAK,aAAa;AAAA,MAChB,MAAIrd,IAAAqd,EAAK,eAAL,gBAAArd,EAAiB,OAAM;AAAA,MAC3B,SAAO8M,IAAAuQ,EAAK,eAAL,gBAAAvQ,EAAiB,UAAS;AAAA,MACjC,OAAKG,IAAAoQ,EAAK,eAAL,gBAAApQ,EAAiB,QAAO;AAAA,MAC7B,QAAMG,IAAAiQ,EAAK,eAAL,gBAAAjQ,EAAiB,SAAQ;AAAA,MAC/B,eAAasV,IAAArF,EAAK,eAAL,gBAAAqF,EAAiB,gBAAe;AAAA,IAAA;AAAA,EAEjD;AAAA,EAEA,MAAM,OAA8B;AAClC,WAAO,CAAC,KAAK,UAAU;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,QAAQL,GAAuC;AACnD,QAAIA,MAAO,KAAK,WAAW,GAAI,OAAM,IAAID,GAAuBC,CAAE;AAClE,QAAIM,IAAS;AACb,QAAI;AACF,YAAMC,IAAO,MAAM,KAAK,OAAO,KAAA;AAC/B,MAAIA,EAAK,OAAID,IAASC,EAAK;AAAA,IAC7B,QAAQ;AAAA,IAER;AACA,gBAAK,YAAY,IACV,EAAE,YAAY,KAAK,YAAY,QAAQ,KAAK,QAAQ,QAAAD,EAAA;AAAA,EAC7D;AAAA,EAEA,MAAM,SAA4B;AAChC,QAAI,CAAC,KAAK,UAAW,OAAM,IAAIL,GAAA;AAC/B,UAAMO,IAAI,MAAM,KAAK,OAAO,OAAA;AAC5B,WAAO,EAAE,eAAeA,EAAE,eAAe,UAAUA,EAAE,UAAU,MAAMA,EAAE,KAAA;AAAA,EACzE;AACF;ACvBA,MAAMC,KAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA8BlB,SAASC,KAAmB;AAC1B,EAAI,OAAO,SAAW,QAAa,OAAO,2BAA2B;AACvE;AAEA,eAAsBC,GACpBC,GACA5F,GAC2B;;AAC3B,EAAA0F,GAAA;AAIA,QAAMG,IAASD,EAAK,QAAQ,OACtBE,IACJF,EAAK,QAAQ,gBACZC,MAAW,WAAWA,MAAW,SAASA,IAAS;AACtD,EAAA3G,GAAgB0G,GAAM5F,EAAK,SAAU8F,KAAgC,MAAM;AAI3E,QAAM9B,IAAM4B,EAAK;AACjB,MAAI,CAAC5B,EAAI,KAAK,cAAc,4BAA4B3D,EAAc,IAAI,GAAG;AAC3E,UAAM0F,IAAQ/B,EAAI,cAAc,OAAO;AACvC,IAAA+B,EAAM,QAAQ,aAAa1F,IAC3B0F,EAAM,gBACJpjB,IAAAqjB,GAAO,MAAM,yBAAyB,MAAtC,gBAAArjB,EAAyC,KAAK;AAAA,OAAS,IACzDqhB,EAAI,KAAK,OAAO+B,CAAK;AAAA,EACvB;AAEA,QAAME,IACJL,EAAK,cAAcA,EAAK,aAAa5F,EAAK,cAAc,EAAE,MAAM,QAAQ;AAC1E,EAAAiG,EAAW,cAAc;AAEzB,QAAMC,IAAQ,SAAS,cAAc,OAAO;AAC5C,EAAAA,EAAM,cAAc,GAAGF,EAAM;AAAA,EAAKP,EAAS;AAE3C,QAAMU,IAAc,SAAS,cAAc,KAAK;AAChD,EAAAA,EAAY,YAAY;AAExB,QAAMC,IAAe,SAAS,cAAc,KAAK;AACjD,EAAAA,EAAa,aAAa,6BAA6B,EAAE,GAEzDH,EAAW,OAAOC,GAAOC,GAAaC,CAAY;AAElD,QAAM,CAAC,EAAE,OAAAC,GAAO,SAAAC,EAAA,GAAWrX,CAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,IACnD,OAAO,4BAAQ,EAAA,KAAA,CAAAnP,MAAAA,EAAA,CAAA;AAAA,IACf,OAAO,8BAAyB,EAAA,KAAA,CAAAA,MAAAA,EAAA,CAAA;AAAA,EAAA,CAGjC,GAEKymB,IAAWF,EAAMpX,EAAK,SAAS;AAAA,IACnC,QAAQkX;AAAA,IACR,OAAO;AAAA,MACL,oBAAoBnG,EAAK;AAAA,MACzB,cAAAoG;AAAA,MACA,YAAYR;AAAA,MACZ,cAAc5F,EAAK;AAAA,MACnB,cAAcA,EAAK;AAAA,IAAA;AAAA,EACrB,CACD,GAEKwG,IAAaxG,EAAK,cACpB1jB,GAAW,QAAQ0jB,EAAK,WAAW,IACnC;AAEJ,SAAO;AAAA,IACL,MAAA4F;AAAA,IACA,YAAAK;AAAA,IACA,cAAAG;AAAA,IACA,SAAS,MAAM;AACb,MAAAI,KAAA,QAAAA,KACKF,EAAQC,CAAQ,GACrBN,EAAW,cAAc;AAAA,IAC3B;AAAA,EAAA;AAEJ;;AAEO,MAAMQ,WAAqB,YAAY;AAAA,EAAvC;AAAA;AAAA,IAAA/Z,EAAA,MAAAga;AACL,IAAAha,EAAA,MAAAia,IAAiD;AACjD,IAAAja,EAAA,MAAAka,IAAmC;AACnC,IAAA5qB,EAAA;AACA,IAAAA,EAAA;AACA,IAAA0Q,EAAA,MAAAma,IAAmC;AACnC,IAAAna,EAAA,MAAAoa,IAAkC;AAAA;AAAA,EAKlC,IAAI,UAAkB;AACpB,WAAOzG;AAAA,EACT;AAAA,EAEA,IAAI,qBAAgD;AAClD,WAAOzS,EAAA,MAAK+Y;AAAA,EACd;AAAA,EAEA,IAAI,mBAAmBI,GAAqC;AAC1D,IAAAzY,EAAA,MAAKqY,IAAsBI,IACvB,KAAK,eAAazY,EAAA,MAAKwY,IAAY7Y,EAAA,MAAKyY,IAAAM,IAAL;AAAA,EACzC;AAAA,EAEA,IAAI,cAAkC;AACpC,WAAOpZ,EAAA,MAAKgZ;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,YAAYzqB,GAA0B;AACxC,IAAAmS,EAAA,MAAKsY,IAAezqB,IAChB,KAAK,eAAamS,EAAA,MAAKwY,IAAY7Y,EAAA,MAAKyY,IAAAM,IAAL;AAAA,EACzC;AAAA,EAEA,oBAAoB;AAClB,IAAK,KAAK,aAAa,SAAS,KAC9B,KAAK,aAAa,WAAW3G,EAAc,GAC7CzS,EAAA,MAAKkZ,OAALxY,EAAA,MAAKwY,IAAc7Y,EAAA,MAAKyY,IAAAM,IAAL;AAAA,EACrB;AAAA,EAEA,uBAAuB;;AACrB,KAAArkB,IAAAiL,EAAA,MAAKiZ,QAAL,QAAAlkB,EAAc,WACd2L,EAAA,MAAKuY,IAAU,OACfvY,EAAA,MAAKwY,IAAY;AAAA,EACnB;AAYF;AA3DEH,KAAA,eACAC,KAAA,eAGAC,KAAA,eACAC,KAAA,eANKJ,KAAA,eAkDCM,KAAA,iBAAS;;AACb,EAAKpZ,EAAA,MAAK+Y,SACVhkB,IAAAiL,EAAA,MAAKiZ,QAAL,QAAAlkB,EAAc,WACd2L,EAAA,MAAKuY,IAAU,MAAMlB,GAAW,MAAM;AAAA,IACpC,oBAAoB/X,EAAA,MAAK+Y;AAAA,IACzB,cAAc,KAAK;AAAA,IACnB,OAAO,KAAK;AAAA,IACZ,aAAa/Y,EAAA,MAAKgZ,OAAgB;AAAA,EAAA,CACnC;AACH;AAAA;AAjDA5qB,EAVWyqB,IAUK,WAAUpG;AAoDrB,SAAS4G,GACdC,IAA+B,cACV;AACrB,SAAAxB,GAAA,GACK,eAAe,IAAIwB,CAAO,KAC7B,eAAe,OAAOA,GAAST,EAAY,GACtC,eAAe,IAAIS,CAAO;AACnC;","x_google_ignoreList":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28]}