@manyducks.co/dolla 2.0.0-alpha.61 → 2.0.0-alpha.63

package/dist/router-CjCkk4dA.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"router-CjCkk4dA.js","sources":["../src/router/router.utils.ts","../src/router/router.ts"],"sourcesContent":["import { assertString, assertArrayOf, isFunction } from \"../typeChecking.js\";\n\nexport type RouteMatch<T = Record<string, any>> = {\n  /**\n   * The path string that triggered this match.\n   */\n  path: string;\n\n  /**\n   * The pattern satisfied by `path`.\n   */\n  pattern: string;\n\n  /**\n   * Named params as parsed from `path`.\n   */\n  params: Record<string, string>;\n\n  /**\n   * Query params as parsed from `path`.\n   */\n  query: Record<string, string>;\n\n  /**\n   * Metadata registered to this route.\n   */\n  meta: T;\n};\n\nexport enum FragTypes {\n  Literal = 1,\n  Param = 2,\n  Wildcard = 3,\n  NumericParam = 4,\n}\n\nexport type RouteFragment = {\n  name: string;\n  type: FragTypes;\n  value: string | number | null;\n};\n\nexport type ParsedRoute<T> = {\n  pattern: string;\n  fragments: RouteFragment[];\n  meta: T;\n};\n\nexport type RouteMatchOptions<T> = {\n  willMatch?: (route: ParsedRoute<T>) => boolean;\n};\n\n/**\n * Separates a URL path into multiple fragments.\n *\n * @param path - A path string (e.g. `\"/api/users/5\"`)\n * @returns an array of fragments (e.g. `[\"api\", \"users\", \"5\"]`)\n */\nexport function splitPath(path: string): string[] {\n  assertString(path, \"Expected `path` to be a string. Got type: %t, value: %v\");\n\n  return path\n    .split(\"/\")\n    .map((f) => f.trim())\n    .filter((f) => f !== \"\");\n}\n\n/**\n * Joins multiple URL path fragments into a single string.\n *\n * @param parts - One or more URL fragments (e.g. `[\"api\", \"users\", 5]`)\n * @returns a joined path (e.g. `\"api/users/5\"`)\n */\nexport function joinPath(parts: { toString(): string }[]): string {\n  assertArrayOf(\n    (part) => isFunction(part?.toString),\n    parts,\n    \"Expected `parts` to be an array of objects with a .toString() method. Got type: %t, value: %v\",\n  );\n\n  parts = parts.filter((x) => x).flatMap(String);\n\n  let joined = parts.shift()?.toString();\n\n  if (joined) {\n    for (const part of parts.map((p) => p.toString())) {\n      if (part.startsWith(\".\")) {\n        // Resolve relative path against joined\n        joined = resolvePath(joined, part);\n      } else if (joined[joined.length - 1] !== \"/\") {\n        if (part[0] !== \"/\") {\n          joined += \"/\" + part;\n        } else {\n          joined += part;\n        }\n      } else {\n        if (part[0] === \"/\") {\n          joined += part.slice(1);\n        } else {\n          joined += part;\n        }\n      }\n    }\n\n    // Remove trailing slash (unless path is just '/')\n    if (joined && joined !== \"/\" && joined.endsWith(\"/\")) {\n      joined = joined.slice(0, joined.length - 1);\n    }\n  }\n\n  return joined ?? \"\";\n}\n\nexport function resolvePath(base: string, part: string | null) {\n  assertString(base, \"Expected `base` to be a string. Got type: %t, value: %v\");\n\n  if (part == null) {\n    part = base;\n    base = \"\";\n  }\n\n  if (part.startsWith(\"/\")) {\n    return part;\n  }\n\n  let resolved = base;\n\n  while (true) {\n    if (part.startsWith(\"..\")) {\n      for (let i = resolved.length; i > 0; --i) {\n        if (resolved[i] === \"/\" || i === 0) {\n          resolved = resolved.slice(0, i);\n          part = part.replace(/^\\.\\.\\/?/, \"\");\n          break;\n        }\n      }\n    } else if (part.startsWith(\".\")) {\n      part = part.replace(/^\\.\\/?/, \"\");\n    } else {\n      break;\n    }\n  }\n\n  return joinPath([resolved, part]);\n}\n\nexport function parseQueryParams(query: string): Record<string, string> {\n  if (!query) return {};\n\n  if (query.startsWith(\"?\")) {\n    query = query.slice(1);\n  }\n\n  const entries = query\n    .split(\"&\")\n    .filter((x) => x.trim() !== \"\")\n    .map((entry) =>\n      entry\n        .split(\"=\")\n        .map((x) => x.trim())\n        .slice(0, 2),\n    );\n\n  return Object.fromEntries(entries);\n}\n\n/**\n * Returns the nearest match, or undefined if the path matches no route.\n *\n * @param url - Path to match against routes.\n * @param options - Options to customize how matching operates.\n */\nexport function matchRoutes<T>(\n  routes: ParsedRoute<T>[],\n  url: string,\n  options: RouteMatchOptions<T> = {},\n): RouteMatch<T> | undefined {\n  const [path, query] = url.split(\"?\");\n  const parts = splitPath(path);\n\n  routes: for (const route of routes) {\n    const { fragments } = route;\n    const hasWildcard = fragments[fragments.length - 1]?.type === FragTypes.Wildcard;\n\n    if (!hasWildcard && fragments.length !== parts.length) {\n      continue routes;\n    }\n\n    if (options.willMatch && !options.willMatch(route)) {\n      continue routes;\n    }\n\n    const matched: RouteFragment[] = [];\n\n    fragments: for (let i = 0; i < fragments.length; i++) {\n      const part = parts[i];\n      const frag = fragments[i];\n\n      if (part == null && frag.type !== FragTypes.Wildcard) {\n        continue routes;\n      }\n\n      switch (frag.type) {\n        case FragTypes.Literal:\n          if (frag.name.toLowerCase() === part.toLowerCase()) {\n            matched.push(frag);\n            break;\n          } else {\n            continue routes;\n          }\n        case FragTypes.Param:\n          matched.push({ ...frag, value: part });\n          break;\n        case FragTypes.Wildcard:\n          matched.push({ ...frag, value: parts.slice(i).join(\"/\") });\n          break fragments;\n        case FragTypes.NumericParam:\n          if (!isNaN(Number(part))) {\n            matched.push({ ...frag, value: part });\n            break;\n          } else {\n            continue routes;\n          }\n        default:\n          throw new Error(`Unknown fragment type: ${frag.type}`);\n      }\n    }\n\n    const params: Record<string, string> = {};\n\n    for (const frag of matched) {\n      if (frag.type === FragTypes.Param) {\n        params[frag.name] = decodeURIComponent(frag.value as string);\n      }\n\n      if (frag.type === FragTypes.NumericParam) {\n        params[frag.name] = String(frag.value);\n      }\n\n      if (frag.type === FragTypes.Wildcard) {\n        params.wildcard = \"/\" + decodeURIComponent(frag.value as string);\n      }\n    }\n\n    return {\n      path: \"/\" + matched.map((f) => f.value).join(\"/\"),\n      pattern:\n        \"/\" +\n        fragments\n          .map((f) => {\n            if (f.type === FragTypes.Param) {\n              return `{${f.name}}`;\n            }\n\n            if (f.type === FragTypes.NumericParam) {\n              return `{#${f.name}}`;\n            }\n\n            return f.name;\n          })\n          .join(\"/\"),\n      params,\n      query: parseQueryParams(query),\n      meta: route.meta,\n    };\n  }\n}\n\n/**\n * Sort routes descending by specificity. Guarantees that the most specific route matches first\n * no matter the order in which they were added.\n *\n * Routes without named params and routes with more fragments are weighted more heavily.\n */\nexport function sortRoutes<T>(routes: ParsedRoute<T>[]): ParsedRoute<T>[] {\n  const withoutParams = [];\n  const withNumericParams = [];\n  const withParams = [];\n  const wildcard = [];\n\n  for (const route of routes) {\n    const { fragments } = route;\n\n    if (fragments.some((f) => f.type === FragTypes.Wildcard)) {\n      wildcard.push(route);\n    } else if (fragments.some((f) => f.type === FragTypes.NumericParam)) {\n      withNumericParams.push(route);\n    } else if (fragments.some((f) => f.type === FragTypes.Param)) {\n      withParams.push(route);\n    } else {\n      withoutParams.push(route);\n    }\n  }\n\n  const bySizeDesc = (a: ParsedRoute<T>, b: ParsedRoute<T>) => {\n    if (a.fragments.length > b.fragments.length) {\n      return -1;\n    } else {\n      return 1;\n    }\n  };\n\n  withoutParams.sort(bySizeDesc);\n  withNumericParams.sort(bySizeDesc);\n  withParams.sort(bySizeDesc);\n  wildcard.sort(bySizeDesc);\n\n  return [...withoutParams, ...withNumericParams, ...withParams, ...wildcard];\n}\n\n/**\n * Converts a route pattern into a set of matchable fragments.\n *\n * @param route - A route string (e.g. \"/api/users/{id}\")\n */\nexport function patternToFragments(pattern: string): RouteFragment[] {\n  const parts = splitPath(pattern);\n  const fragments = [];\n\n  for (let i = 0; i < parts.length; i++) {\n    const part = parts[i];\n\n    if (part === \"*\") {\n      if (i !== parts.length - 1) {\n        throw new Error(`Wildcard must be at the end of a pattern. Received: ${pattern}`);\n      }\n      fragments.push({\n        type: FragTypes.Wildcard,\n        name: \"*\",\n        value: null,\n      });\n    } else if (part.at(0) === \"{\" && part.at(-1) === \"}\") {\n      fragments.push({\n        type: part[1] === \"#\" ? FragTypes.NumericParam : FragTypes.Param,\n        name: part[1] === \"#\" ? part.slice(2, -1) : part.slice(1, -1),\n        value: null,\n      });\n    } else {\n      fragments.push({\n        type: FragTypes.Literal,\n        name: part,\n        value: part,\n      });\n    }\n  }\n\n  return fragments;\n}\n\nconst safeExternalLink = /(noopener|noreferrer) (noopener|noreferrer)/;\nconst protocolLink = /^[\\w-_]+:/;\n\n/**\n * Intercepts links within the root node.\n *\n * This is adapted from https://github.com/choojs/nanohref/blob/master/index.js\n *\n * @param root - Element under which to intercept link clicks\n * @param callback - Function to call when a click event is intercepted\n * @param _window - (optional) Override for global window object\n */\nexport function catchLinks(root: Element, callback: (anchor: HTMLAnchorElement) => void, _window = window) {\n  function traverse(node: HTMLElement | null): HTMLAnchorElement | null {\n    if (!node || node === root) {\n      return null;\n    }\n\n    if (node.localName !== \"a\" || (node as any).href === undefined) {\n      return traverse(node.parentNode as HTMLElement | null);\n    }\n\n    return node as HTMLAnchorElement;\n  }\n\n  function handler(e: MouseEvent) {\n    if ((e.button && e.button !== 0) || e.ctrlKey || e.metaKey || e.altKey || e.shiftKey || e.defaultPrevented) {\n      return;\n    }\n\n    const anchor = traverse(e.target as HTMLElement);\n\n    if (!anchor) {\n      return;\n    }\n\n    if (\n      _window.location.protocol !== anchor.protocol ||\n      _window.location.hostname !== anchor.hostname ||\n      _window.location.port !== anchor.port ||\n      anchor.hasAttribute(\"data-router-ignore\") ||\n      anchor.hasAttribute(\"download\") ||\n      (anchor.getAttribute(\"target\") === \"_blank\" && safeExternalLink.test(anchor.getAttribute(\"rel\")!)) ||\n      protocolLink.test(anchor.getAttribute(\"href\")!)\n    ) {\n      return;\n    }\n\n    e.preventDefault();\n    callback(anchor);\n  }\n\n  root.addEventListener(\"click\", handler as any);\n\n  return function cancel() {\n    root.removeEventListener(\"click\", handler as any);\n  };\n}\n\n/**\n * Replace route pattern param placeholders with real matched values.\n */\nexport function replaceParams(path: string, params: Record<string, string | number>) {\n  for (const key in params) {\n    const value = params[key].toString();\n    path = path.replace(`{${key}}`, value).replace(`{#${key}}`, value);\n  }\n\n  return path;\n}\n","import { Context } from \"../core/context.js\";\nimport { createLogger } from \"../core/logger.js\";\nimport { m, MarkupType, type MarkupNode } from \"../core/markup.js\";\nimport { DynamicNode } from \"../core/nodes/dynamic.js\";\nimport { ViewNode } from \"../core/nodes/view.js\";\nimport { $, batch, untracked, type Source } from \"../core/signals.js\";\nimport { assertObject, isArray, isArrayOf, isFunction, isObject, isString } from \"../typeChecking.js\";\nimport type { View } from \"../types.js\";\nimport { deepEqual, shallowEqual } from \"../utils.js\";\nimport {\n  catchLinks,\n  joinPath,\n  matchRoutes,\n  patternToFragments,\n  replaceParams,\n  resolvePath,\n  sortRoutes,\n  splitPath,\n  type ParsedRoute,\n  type RouteMatch,\n} from \"./router.utils.js\";\n\n// ----- Types ----- //\n\nexport type Stringable = { toString(): string };\n\nexport interface Match {\n  /**\n   * The path as it appears in the URL bar.\n   */\n  path: string;\n\n  /**\n   * The pattern that this path was matched with.\n   */\n  pattern: string;\n\n  /**\n   * Named route params parsed from `path`.\n   */\n  params: Record<string, string>;\n\n  /**\n   * Query params parsed from `path`.\n   */\n  query: Record<string, string>;\n\n  data: Record<string, any>;\n}\n\nexport interface RouteMatchContext extends Match {\n  /**\n   * Stores `value` at `key` in this context's state.\n   */\n  setState<T>(key: any, value: T): void;\n\n  /**\n   * For each tuple in `entries`, stores `value` at `key` in this context's state.\n   */\n  setState(entries: [key: any, value: any][]): void;\n\n  /**\n   * Redirects the user to a different route instead of matching the current one.\n   */\n  redirect(path: string): void;\n}\n\nexport interface Route {\n  /**\n   * The path or path fragment to match.\n   */\n  path: string;\n\n  /**\n   * Path to redirect to when this route is matched, or a callback function that returns such path.\n   */\n  redirect?: string | ((ctx: RouteRedirectContext) => string) | ((ctx: RouteRedirectContext) => Promise<string>);\n\n  /**\n   * View to display when this route is matched.\n   */\n  view?: View<any>;\n\n  /**\n   * Subroutes.\n   */\n  routes?: Route[];\n\n  /**\n   * Called after the match is identified but before it is acted on. Use this to set state, load data, etc.\n   */\n  beforeMatch?: (ctx: RouteMatchContext) => void | Promise<void>;\n\n  /**\n   * Arbitrary data you'd like to store on this route.\n   * This object will be available at `router.$match` while the route is active.\n   *\n   * In the case of nested routes, data from all layers will be merged into a single data object.\n   */\n  data?: Record<string, any>;\n}\n\nexport interface RouteMeta {\n  redirect?: string | ((ctx: RouteRedirectContext) => string) | ((ctx: RouteRedirectContext) => Promise<string>);\n  pattern?: string;\n  layers?: RouteLayer[];\n  beforeMatch?: { fn: (ctx: RouteMatchContext) => void | Promise<void>; layerId: number }[];\n  data?: Record<string, any>;\n}\n\nexport interface RouteConfig {\n  pattern: string;\n  meta: RouteMeta;\n}\n\nexport interface RouteLayer {\n  id: number;\n  view: View<{}>;\n}\n\n/**\n * An active route layer whose markup has been initialized into a view.\n */\ninterface ActiveLayer {\n  id: number;\n  node: MarkupNode;\n  context: Context;\n  $slot: Source<MarkupNode | undefined>;\n}\n\n/**\n * Object passed to redirect callbacks. Contains information useful for determining how to redirect.\n */\nexport interface RouteRedirectContext extends Match {}\n\n/**\n * A log for a single step in the route resolution process.\n */\ninterface JourneyStep {\n  kind: \"match\" | \"redirect\" | \"miss\";\n  message: string;\n}\n\nexport interface NavigateOptions {\n  /**\n   * Replace the current item in the history stack instead of adding a new one.\n   * The back button will send the user to the page they visited before this. Defaults to false.\n   */\n  replace?: boolean;\n\n  /**\n   * Preserve existing query params (if any) when navigating. Defaults to false.\n   * If true, all existing query params are preserved and merged with new ones.\n   * If an array of strings is passed only those keys will be preserved, then merged with any new ones.\n   */\n  preserveQuery?: boolean | string[];\n}\n\nexport interface RouterOptions {\n  routes: Route[];\n\n  /**\n   * When true, the router will construct routes like \"https://www.example.com/#/sub/route\" which work without any backend intervention.\n   */\n  hash?: boolean;\n}\n\n// ----- Code ----- //\n\nexport const MOUNT = Symbol();\nexport const UNMOUNT = Symbol();\nexport const ROOT_VIEW = Symbol();\n\nexport class Router {\n  #logger = createLogger(\"dolla.router\");\n\n  #nextLayerId = 0;\n  #activeLayers: ActiveLayer[] = [];\n  #routes: ParsedRoute<RouteMeta>[] = [];\n\n  #isMounted = false;\n\n  #rootLayer!: ActiveLayer;\n\n  /**\n   * Use hash routing when true. Configured in router options.\n   */\n  #hash = false;\n\n  /**\n   * Cleanup functions to call on unmount.\n   */\n  #cleanup: (() => void)[] = [];\n\n  /**\n   * The current match object (internal).\n   */\n  #match = $<RouteMatch>();\n\n  /**\n   * The current match object.\n   */\n  readonly $match = $<Match | undefined>(\n    () => {\n      const match = this.#match();\n      if (match) {\n        return {\n          path: match.path,\n          pattern: match.pattern,\n          params: { ...match.params },\n          query: { ...match.query },\n          data: match.meta.data ?? {},\n        };\n      }\n    },\n    { equals: deepEqual },\n  );\n\n  /**\n   * The currently matched route pattern, if any.\n   */\n  readonly $pattern = $(() => this.#match()?.pattern);\n\n  /**\n   * The current URL path.\n   */\n  readonly $path = $(() => this.#match()?.path ?? window.location.pathname);\n\n  /**\n   * The current named path params.\n   */\n  readonly $params = $(() => this.#match()?.params ?? {}, { equals: shallowEqual });\n\n  /**\n   * The current query params.\n   */\n  readonly $query = $(() => this.#match()?.query ?? {}, { equals: shallowEqual });\n\n  constructor(options: RouterOptions) {\n    assertObject(options, \"Options must be an object. Got: %t\");\n\n    if (options.hash) {\n      this.#hash = true;\n    }\n\n    // Add routes.\n    this.#routes = sortRoutes(\n      options.routes\n        .flatMap((route) => this.#prepareRoute(route))\n        .map((route) => ({\n          pattern: route.pattern,\n          meta: route.meta,\n          fragments: patternToFragments(route.pattern),\n        })),\n    );\n\n    assertValidRedirects(this.#routes);\n  }\n\n  async [MOUNT](parent: Element, context: Context): Promise<MarkupNode> {\n    const $slot = $<MarkupNode>();\n    this.#rootLayer = {\n      id: this.#nextLayerId++,\n      node: new DynamicNode(context, $slot),\n      context,\n      $slot,\n    };\n\n    // Listen for popstate events and update route accordingly.\n    const onPopState = () => this.#updateRoute();\n    window.addEventListener(\"popstate\", onPopState);\n    this.#cleanup.push(() => window.removeEventListener(\"popstate\", onPopState));\n\n    // Listen for clicks on <a> tags within the app.\n    this.#cleanup.push(\n      catchLinks(parent, (anchor) => {\n        this.#logger.info(\"intercepted click on <a> tag\", anchor);\n\n        const href = anchor.getAttribute(\"href\")!;\n        const preserveQuery = anchor.getAttribute(\"data-router-preserve-query\");\n\n        this.go(href, {\n          preserveQuery: parsePreserveQueryAttribute(preserveQuery),\n        });\n      }),\n    );\n    this.#logger.info(\"will intercept clicks on <a> tags within parent element:\", parent);\n\n    this.#isMounted = true;\n\n    // Mount initial route.\n    await this.#updateRoute();\n\n    return this.#rootLayer.node;\n  }\n\n  async [UNMOUNT]() {\n    for (const callback of this.#cleanup) {\n      callback();\n    }\n    this.#cleanup.length = 0;\n  }\n\n  /**\n   * Navigate backward. Pass a number of steps to hit the back button that many times.\n   */\n  back(steps = 1) {\n    window.history.go(-steps);\n  }\n\n  /**\n   * Navigate forward. Pass a number of steps to hit the forward button that many times.\n   */\n  forward(steps = 1) {\n    window.history.go(steps);\n  }\n\n  /**\n   * Navigates to another route.\n   *\n   * @example\n   * router.go(\"/login\"); // navigate to `/login`\n   * router.go[\"/users\", 215], { replace: true }); // replace current history entry with `/users/215`\n   */\n  go(path: Stringable | Stringable[], options: NavigateOptions = {}) {\n    let joined: string;\n\n    if (Array.isArray(path)) {\n      joined = joinPath(path);\n    } else {\n      joined = path.toString();\n    }\n\n    joined = resolvePath(window.location.pathname, joined);\n\n    if (options.replace) {\n      this.#replace(joined, options);\n    } else {\n      this.#push(joined, options);\n    }\n  }\n\n  /**\n   * Updates query params, keeping existing ones and applying new ones. Removes the query param if value is set to `null`.\n   */\n  updateQuery(values: Record<string, Stringable | null>) {\n    const match = untracked(this.#match)!;\n    const query = { ...this.$query() };\n\n    for (const key in values) {\n      const value = values[key];\n      if (value === null) {\n        delete query[key];\n      } else {\n        query[key] = value.toString();\n      }\n    }\n\n    let queryParts: string[] = [];\n\n    for (const key in query) {\n      queryParts.push(`${key}=${query[key]}`);\n    }\n    const queryString = queryParts.length > 0 ? \"?\" + queryParts.join(\"&\") : \"\";\n\n    this.#match({ ...match, query });\n\n    window.history.replaceState(null, \"\", this.#hash ? \"/#\" + match.path + queryString : match.path + queryString);\n  }\n\n  #push(href: string, options: NavigateOptions) {\n    this.#logger.info(\"(push)\", href);\n\n    window.history.pushState(null, \"\", this.#hash ? \"/#\" + href : href);\n    this.#updateRoute(href, options);\n  }\n\n  #replace(href: string, options: NavigateOptions) {\n    this.#logger.info(\"(replace)\", href);\n\n    window.history.replaceState(null, \"\", this.#hash ? \"/#\" + href : href);\n    this.#updateRoute(href, options);\n  }\n\n  #getCurrentURL(): URL {\n    if (this.#hash) {\n      return new URL(window.location.hash.slice(1), window.location.origin);\n    } else {\n      return new URL(window.location.pathname, window.location.origin);\n    }\n  }\n\n  /**\n   * Run when the location changes. Diffs and mounts new routes and updates\n   * the $path, $route, $params and $query states accordingly.\n   */\n  async #updateRoute(href?: string | undefined, options: NavigateOptions = {}) {\n    const logger = this.#logger;\n    const url = href ? new URL(href, window.location.origin) : this.#getCurrentURL();\n\n    const { match, journey, state } = await this.#resolveRoute(url);\n\n    for (let i = 0; i < journey.length; i++) {\n      const step = journey[i];\n      const tag = `(update: step ${i + 1} of ${journey.length})`;\n\n      switch (step.kind) {\n        case \"match\":\n          logger?.info(`${tag} 📍 ${step.message}`);\n          break;\n        case \"redirect\":\n          logger?.info(`${tag} ↩️ ${step.message}`);\n          break;\n        case \"miss\":\n          logger?.info(`${tag} 💀 ${step.message}`);\n          break;\n        default:\n          break;\n      }\n    }\n\n    if (!match) {\n      // Only crash if routing has been configured.\n      if (this.#isMounted) {\n        throw logger.crash(new NoRouteError(`Failed to match route '${url.pathname}'`));\n      }\n      return;\n    }\n\n    // Merge query params.\n    let query = match.query;\n    let queryParts: string[] = [];\n\n    if (options.preserveQuery === true) {\n      query = Object.assign({}, this.$query(), match.query);\n    } else if (isArray(options.preserveQuery)) {\n      const preserved: Record<string, any> = {};\n      const current = this.$query();\n      for (const key in current) {\n        if (options.preserveQuery.includes(key)) {\n          preserved[key] = current[key];\n        }\n      }\n      query = Object.assign({}, preserved, match.query);\n    }\n\n    for (const key in query) {\n      queryParts.push(`${key}=${query[key]}`);\n    }\n    const queryString = queryParts.length > 0 ? \"?\" + queryParts.join(\"&\") : \"\";\n\n    // Update the URL if matched path differs from navigator path.\n    // This happens if route resolution involved redirects.\n    if (match.path !== location.pathname || location.search !== queryString) {\n      window.history.replaceState(null, \"\", this.#hash ? \"/#\" + match.path + queryString : match.path + queryString);\n    }\n\n    // Run in batch so all new layers are mounted simultaneously with match signal change.\n    // This avoids the old route effects receiving new signal values just before they unmount.\n    batch(() => {\n      const oldPattern = untracked(this.$pattern);\n\n      this.#match({ ...match, query });\n\n      if (match.pattern === oldPattern) {\n        // If pattern has not changed, update state on current layers.\n        for (const layer of this.#activeLayers) {\n          const stateEntries = state.get(layer.id);\n          if (stateEntries) {\n            layer.context.setState(stateEntries);\n          }\n        }\n        return;\n      }\n\n      const layers = match.meta.layers!;\n      logger.info(\"mounting\", match);\n\n      // Diff and update route layers.\n      for (let i = 0; i < layers.length; i++) {\n        const matchedLayer = layers[i];\n        const activeLayer = this.#activeLayers[i];\n\n        if (activeLayer?.id !== matchedLayer.id) {\n          // Discard all previously active layers starting at this depth.\n          this.#activeLayers = this.#activeLayers.slice(0, i);\n          activeLayer?.node.unmount();\n\n          const parentLayer = this.#activeLayers.at(-1) ?? this.#rootLayer;\n\n          // Create a $slot and element for this layer.\n          const $slot = $<MarkupNode>();\n          const node = new ViewNode(parentLayer.context, matchedLayer.view, {\n            children: m(MarkupType.Dynamic, { source: $slot }),\n          });\n\n          // Set state for new layer.\n          const stateEntries = state.get(matchedLayer.id);\n          if (stateEntries) {\n            node.context.setState(stateEntries);\n          }\n\n          // Add new layer to activeLayers.\n          this.#activeLayers.push({\n            id: matchedLayer.id,\n            node,\n            context: node.context,\n            $slot,\n          });\n\n          // Slot this layer into parent.\n          parentLayer.$slot(node);\n        } else {\n          // Update state for layers that are still active.\n          const stateEntries = state.get(activeLayer.id);\n          if (stateEntries) {\n            activeLayer.context.setState(stateEntries);\n          }\n        }\n      }\n    });\n\n    return { match, journey };\n  }\n\n  /**\n   * Takes a URL and finds a match, following redirects.\n   */\n  async #resolveRoute(\n    url: URL,\n    journey: JourneyStep[] = [],\n    state = new Map<number, [any, any][]>(),\n  ): Promise<{\n    match: RouteMatch<RouteMeta> | null;\n    journey: JourneyStep[];\n    state: Map<number, [any, any][]>; // map of layerId to state entries\n  }> {\n    return new Promise((resolve, reject) => {\n      const match = matchRoutes(this.#routes, url.pathname);\n\n      if (!match) {\n        return resolve({\n          match: null,\n          journey: [...journey, { kind: \"miss\", message: `no match for '${url.pathname}'` }],\n          state,\n        });\n      }\n\n      let redirect = match.meta.redirect;\n\n      const finalize = async () => {\n        if (redirect != null) {\n          let path: string;\n\n          if (isString(redirect)) {\n            path = replaceParams(redirect, match.params);\n          } else if (isFunction(redirect)) {\n            const redirectContext: RouteRedirectContext = {\n              path: match.path,\n              pattern: match.pattern,\n              params: match.params,\n              query: match.query,\n              data: match.meta.data ?? {},\n            };\n            path = await redirect(redirectContext);\n            if (!isString(path)) {\n              return reject(new Error(`Redirect function must return a path to redirect to.`));\n            }\n            if (!path.startsWith(\"/\")) {\n              // Not absolute. Resolve against matched path.\n              path = resolvePath(match.path, path);\n            }\n          } else {\n            return reject(new TypeError(`Redirect must either be a path string or a function.`));\n          }\n\n          resolve(\n            this.#resolveRoute(new URL(path, window.location.origin), [\n              ...journey,\n              { kind: \"redirect\", message: `redirecting '${match.path}' -> '${path}'` },\n            ]),\n          );\n        } else {\n          resolve({ match, journey: [...journey, { kind: \"match\", message: `matched route '${match.path}'` }], state });\n        }\n      };\n\n      if (match.meta.beforeMatch?.length) {\n        const callbacks = match.meta.beforeMatch;\n        let i = -1;\n        const next = () => {\n          i++;\n          if (i === callbacks.length) {\n            // Mount route\n            finalize();\n          } else {\n            // Next callback\n            let finalized = false;\n            const result = callbacks[i].fn({\n              path: match.path,\n              pattern: match.pattern,\n              params: match.params,\n              query: match.query,\n              data: match.meta.data ?? {},\n\n              setState: (...args: any[]) => {\n                const id = callbacks[i].layerId;\n                const entries: [any, any][] = [];\n\n                if (args.length === 1 && isArrayOf(isArray, args[0])) {\n                  entries.push(...(args[0] as [any, any][]));\n                } else if (args.length === 2) {\n                  entries.push([args[0], args[1]]);\n                } else {\n                  throw new Error(\"Invalid arguments.\");\n                }\n\n                const current = state.get(id);\n                if (!current) {\n                  state.set(id, entries);\n                } else {\n                  entries.push(...entries);\n                }\n              },\n\n              redirect: (path) => {\n                redirect = path;\n                finalized = true;\n                finalize();\n              },\n            });\n            if (!finalized) {\n              if (result instanceof Promise) {\n                result.then(next);\n              } else {\n                next();\n              }\n            }\n          }\n        };\n\n        next();\n\n        // TODO: Show warning after timeout if next hasn't been called?\n      } else {\n        finalize();\n      }\n    });\n  }\n\n  /**\n   * Parses a route definition object into a set of matchable routes.\n   *\n   * @param route - Route config object.\n   * @param layers - Array of parent layers. Passed when this function calls itself on nested routes.\n   */\n  #prepareRoute(route: Route, parents: Route[] = [], layers: RouteLayer[] = []) {\n    if (!isObject(route) || !isString(route.path)) {\n      throw new TypeError(`Route configs must be objects with a 'path' string property. Got: ${route}`);\n    }\n\n    if (route.redirect && route.routes) {\n      throw new Error(`Route cannot have both a 'redirect' and nested 'routes'.`);\n    } else if (route.redirect && route.view) {\n      throw new Error(`Route cannot have both a 'redirect' and a 'view'.`);\n    } else if (!route.view && !route.routes && !route.redirect) {\n      throw new Error(`Route must have a 'view', a 'redirect', or a set of nested 'routes'.`);\n    }\n\n    let parts: string[] = [];\n\n    for (const parent of parents) {\n      parts.push(...splitPath(parent.path));\n    }\n\n    parts.push(...splitPath(route.path));\n\n    // Remove trailing wildcard for joining with nested routes.\n    if (parts[parts.length - 1] === \"*\") {\n      parts.pop();\n    }\n\n    const routes: RouteConfig[] = [];\n\n    if (route.redirect) {\n      let redirect = route.redirect;\n\n      if (isString(redirect)) {\n        redirect = resolvePath(joinPath(parts), redirect);\n\n        if (!redirect.startsWith(\"/\")) {\n          redirect = \"/\" + redirect;\n        }\n      }\n\n      const config: RouteConfig = {\n        pattern: \"/\" + joinPath([...parts, ...splitPath(route.path)]),\n        meta: {\n          redirect,\n        },\n      };\n      routes.push(config);\n\n      return routes;\n    }\n\n    let view: View<any> = (props: any) => props.children;\n\n    if (isFunction(route.view)) {\n      view = route.view;\n    } else if (route.view) {\n      throw new TypeError(`Route '${route.path}' expected a view function or undefined. Got: ${route.view}`);\n    }\n\n    const layer: RouteLayer = { id: this.#nextLayerId++, view };\n\n    // Parse nested routes if they exist.\n    if (route.routes) {\n      for (const subroute of route.routes) {\n        routes.push(...this.#prepareRoute(subroute, [...parents, route], [...layers, layer]));\n      }\n    } else {\n      const config: RouteConfig = {\n        pattern: parents.length ? joinPath([...parents.map((p) => p.path), route.path]) : route.path,\n        meta: {\n          pattern: route.path,\n          layers: [...layers, layer],\n          // Store the layer ID with each beforeMatch so we can correlate which context needs to get any state that is set.\n          beforeMatch: parents\n            .flatMap((parent, i) => (parent.beforeMatch ? { fn: parent.beforeMatch, layerId: layers[i].id } : null))\n            .concat(route.beforeMatch ? { fn: route.beforeMatch, layerId: layer.id } : null)\n            .filter((x) => x != null),\n        },\n      };\n      if (route.data) {\n        const parent = parents.at(-1);\n        if (parent) {\n          config.meta.data = { ...parent.data, ...route.data };\n        } else {\n          config.meta.data = route.data;\n        }\n      }\n      routes.push(config);\n    }\n\n    return routes;\n  }\n}\n\nfunction assertValidRedirects(routes: ParsedRoute<RouteMeta>[]) {\n  // Test redirects to make sure all possible redirect targets actually exist.\n  for (const route of routes) {\n    if (route.meta.redirect) {\n      let redirectPath: string;\n\n      if (isFunction(route.meta.redirect)) {\n        // throw new Error(`Redirect functions are not yet supported.`);\n        // Just allow, though it could fail later. Best not to call the function and cause potential side effects.\n      } else if (isString(route.meta.redirect)) {\n        redirectPath = route.meta.redirect;\n\n        const match = matchRoutes(routes, redirectPath, {\n          willMatch(r) {\n            return r !== route;\n          },\n        });\n\n        if (!match) {\n          throw new Error(`Found a redirect to an undefined URL. From '${route.pattern}' to '${route.meta.redirect}'`);\n        }\n      } else {\n        throw new TypeError(`Expected a string or redirect function. Got: ${route.meta.redirect}`);\n      }\n    }\n  }\n}\n\n/**\n * Parses the data-router-preserve-query attribute from a link.\n */\nfunction parsePreserveQueryAttribute(value: null | string | boolean): boolean | string[] {\n  if (value === null) {\n    return false;\n  } else if (value === true || value === false) {\n    return value;\n  } else if (typeof value === \"string\") {\n    value = value.trim();\n    if (value === \"\" || value === \"true\") {\n      return true;\n    } else if (value === \"false\") {\n      return false;\n    }\n\n    return value\n      .split(\",\")\n      .map((k) => k.trim())\n      .filter((k) => k.length > 0);\n  } else {\n    throw new Error(`Invalid type for data-router-preserve-query attribute: ${typeof value} (value: ${value})`);\n  }\n}\n\nclass NoRouteError extends Error {}\n"],"names":["splitPath","path","assertString","f","joinPath","parts","assertArrayOf","part","isFunction","x","joined","_a","p","resolvePath","base","resolved","i","parseQueryParams","query","entries","entry","matchRoutes","routes","url","options","route","fragments","matched","frag","params","sortRoutes","withoutParams","withNumericParams","withParams","wildcard","bySizeDesc","a","b","patternToFragments","pattern","safeExternalLink","protocolLink","catchLinks","root","callback","_window","traverse","node","handler","e","anchor","replaceParams","key","value","MOUNT","UNMOUNT","Router","__privateAdd","_Router_instances","_logger","createLogger","_nextLayerId","_activeLayers","_routes","_isMounted","_rootLayer","_hash","_cleanup","_match","$","__publicField","match","__privateGet","deepEqual","shallowEqual","assertObject","__privateSet","__privateMethod","prepareRoute_fn","assertValidRedirects","parent","context","$slot","__privateWrapper","DynamicNode","onPopState","updateRoute_fn","href","preserveQuery","parsePreserveQueryAttribute","steps","replace_fn","push_fn","values","untracked","queryParts","queryString","getCurrentURL_fn","logger","journey","state","resolveRoute_fn","step","tag","NoRouteError","isArray","preserved","current","batch","oldPattern","layer","stateEntries","layers","matchedLayer","activeLayer","parentLayer","ViewNode","m","MarkupType","resolve","reject","redirect","finalize","isString","redirectContext","callbacks","next","finalized","result","args","id","isArrayOf","parents","isObject","config","view","props","subroute","redirectPath","r","k"],"mappings":";;;;;;;;;;;;;;;;;;;AA0DO,SAASA,EAAUC,GAAwB;AAChD,SAAAC,EAAaD,GAAM,yDAAyD,GAErEA,EACJ,MAAM,GAAG,EACT,IAAI,CAACE,MAAMA,EAAE,KAAA,CAAM,EACnB,OAAO,CAACA,MAAMA,MAAM,EAAE;AAC3B;AAQO,SAASC,EAASC,GAAyC;;AAChE,EAAAC;AAAA,IACE,CAACC,MAASC,EAAWD,KAAA,gBAAAA,EAAM,QAAQ;AAAA,IACnCF;AAAA,IACA;AAAA,EACF,GAEAA,IAAQA,EAAM,OAAO,CAACI,MAAMA,CAAC,EAAE,QAAQ,MAAM;AAE7C,MAAIC,KAASC,IAAAN,EAAM,MAAM,MAAZ,gBAAAM,EAAe;AAE5B,MAAID,GAAQ;AACC,eAAAH,KAAQF,EAAM,IAAI,CAACO,MAAMA,EAAE,SAAA,CAAU;AAC1C,MAAAL,EAAK,WAAW,GAAG,IAEZG,IAAAG,EAAYH,GAAQH,CAAI,IACxBG,EAAOA,EAAO,SAAS,CAAC,MAAM,MACnCH,EAAK,CAAC,MAAM,MACdG,KAAU,MAAMH,IAENG,KAAAH,IAGRA,EAAK,CAAC,MAAM,MACJG,KAAAH,EAAK,MAAM,CAAC,IAEZG,KAAAH;AAMhB,IAAIG,KAAUA,MAAW,OAAOA,EAAO,SAAS,GAAG,MACjDA,IAASA,EAAO,MAAM,GAAGA,EAAO,SAAS,CAAC;AAAA,EAC5C;AAGF,SAAOA,KAAU;AACnB;AAEgB,SAAAG,EAAYC,GAAcP,GAAqB;AAQzD,MAPJL,EAAaY,GAAM,yDAAyD,GAExEP,KAAQ,SACHA,IAAAO,GACAA,IAAA,KAGLP,EAAK,WAAW,GAAG;AACd,WAAAA;AAGT,MAAIQ,IAAWD;AAEf;AACM,QAAAP,EAAK,WAAW,IAAI;AACtB,eAASS,IAAID,EAAS,QAAQC,IAAI,GAAG,EAAEA;AACrC,YAAID,EAASC,CAAC,MAAM,OAAOA,MAAM,GAAG;AACvB,UAAAD,IAAAA,EAAS,MAAM,GAAGC,CAAC,GACvBT,IAAAA,EAAK,QAAQ,YAAY,EAAE;AAClC;AAAA,QAAA;AAAA,eAGKA,EAAK,WAAW,GAAG;AACrB,MAAAA,IAAAA,EAAK,QAAQ,UAAU,EAAE;AAAA;AAEhC;AAIJ,SAAOH,EAAS,CAACW,GAAUR,CAAI,CAAC;AAClC;AAEO,SAASU,GAAiBC,GAAuC;AAClE,MAAA,CAACA,EAAO,QAAO,CAAC;AAEhB,EAAAA,EAAM,WAAW,GAAG,MACdA,IAAAA,EAAM,MAAM,CAAC;AAGvB,QAAMC,IAAUD,EACb,MAAM,GAAG,EACT,OAAO,CAACT,MAAMA,EAAE,WAAW,EAAE,EAC7B;AAAA,IAAI,CAACW,MACJA,EACG,MAAM,GAAG,EACT,IAAI,CAACX,MAAMA,EAAE,KAAK,CAAC,EACnB,MAAM,GAAG,CAAC;AAAA,EACf;AAEK,SAAA,OAAO,YAAYU,CAAO;AACnC;AAQO,SAASE,EACdC,GACAC,GACAC,IAAgC,CAAA,GACL;;AAC3B,QAAM,CAACvB,GAAMiB,CAAK,IAAIK,EAAI,MAAM,GAAG,GAC7BlB,IAAQL,EAAUC,CAAI;AAEpB,EAAAqB,EAAA,YAAWG,KAASH,GAAQ;AAC5B,UAAA,EAAE,WAAAI,MAAcD;AAOtB,QAJI,IAFgBd,IAAAe,EAAUA,EAAU,SAAS,CAAC,MAA9B,gBAAAf,EAAiC,UAAS,MAE1Ce,EAAU,WAAWrB,EAAM,UAI3CmB,EAAQ,aAAa,CAACA,EAAQ,UAAUC,CAAK;AACtC,eAAAH;AAGX,UAAMK,IAA2B,CAAC;AAElC,IAAAD,YAAoBV,IAAI,GAAGA,IAAIU,EAAU,QAAQV,KAAK;AAC9C,YAAAT,IAAOF,EAAMW,CAAC,GACdY,IAAOF,EAAUV,CAAC;AAExB,UAAIT,KAAQ,QAAQqB,EAAK,SAAS;AACvB,iBAAAN;AAGX,cAAQM,EAAK,MAAM;AAAA,QACjB,KAAK;AACH,cAAIA,EAAK,KAAK,YAAkB,MAAArB,EAAK,eAAe;AAClD,YAAAoB,EAAQ,KAAKC,CAAI;AACjB;AAAA,UAAA;AAES,qBAAAN;AAAA,QAEb,KAAK;AACH,UAAAK,EAAQ,KAAK,EAAE,GAAGC,GAAM,OAAOrB,GAAM;AACrC;AAAA,QACF,KAAK;AACH,UAAAoB,EAAQ,KAAK,EAAE,GAAGC,GAAM,OAAOvB,EAAM,MAAMW,CAAC,EAAE,KAAK,GAAG,EAAA,CAAG;AACnD,gBAAAU;AAAA,QACR,KAAK;AACH,cAAK,MAAM,OAAOnB,CAAI,CAAC;AAIZ,qBAAAe;AAHT,UAAAK,EAAQ,KAAK,EAAE,GAAGC,GAAM,OAAOrB,GAAM;AACrC;AAAA,QAIJ;AACE,gBAAM,IAAI,MAAM,0BAA0BqB,EAAK,IAAI,EAAE;AAAA,MAAA;AAAA,IACzD;AAGF,UAAMC,IAAiC,CAAC;AAExC,eAAWD,KAAQD;AACb,MAAAC,EAAK,SAAS,MAChBC,EAAOD,EAAK,IAAI,IAAI,mBAAmBA,EAAK,KAAe,IAGzDA,EAAK,SAAS,MAChBC,EAAOD,EAAK,IAAI,IAAI,OAAOA,EAAK,KAAK,IAGnCA,EAAK,SAAS,MAChBC,EAAO,WAAW,MAAM,mBAAmBD,EAAK,KAAe;AAI5D,WAAA;AAAA,MACL,MAAM,MAAMD,EAAQ,IAAI,CAACxB,MAAMA,EAAE,KAAK,EAAE,KAAK,GAAG;AAAA,MAChD,SACE,MACAuB,EACG,IAAI,CAACvB,MACAA,EAAE,SAAS,IACN,IAAIA,EAAE,IAAI,MAGfA,EAAE,SAAS,IACN,KAAKA,EAAE,IAAI,MAGbA,EAAE,IACV,EACA,KAAK,GAAG;AAAA,MACb,QAAA0B;AAAA,MACA,OAAOZ,GAAiBC,CAAK;AAAA,MAC7B,MAAMO,EAAM;AAAA,IACd;AAAA,EAAA;AAEJ;AAQO,SAASK,GAAcR,GAA4C;AACxE,QAAMS,IAAgB,CAAC,GACjBC,IAAoB,CAAC,GACrBC,IAAa,CAAC,GACdC,IAAW,CAAC;AAElB,aAAWT,KAASH,GAAQ;AACpB,UAAA,EAAE,WAAAI,MAAcD;AAEtB,IAAIC,EAAU;AAAA,MAAK,CAACvB,MAAMA,EAAE,SAAS;AAAA;AAAA,QACnC+B,EAAS,KAAKT,CAAK,IACVC,EAAU;AAAA,MAAK,CAACvB,MAAMA,EAAE,SAAS;AAAA;AAAA,QAC1C6B,EAAkB,KAAKP,CAAK,IACnBC,EAAU;AAAA,MAAK,CAACvB,MAAMA,EAAE,SAAS;AAAA;AAAA,QAC1C8B,EAAW,KAAKR,CAAK,IAErBM,EAAc,KAAKN,CAAK;AAAA,EAC1B;AAGI,QAAAU,IAAa,CAACC,GAAmBC,MACjCD,EAAE,UAAU,SAASC,EAAE,UAAU,SAC5B,KAEA;AAIX,SAAAN,EAAc,KAAKI,CAAU,GAC7BH,EAAkB,KAAKG,CAAU,GACjCF,EAAW,KAAKE,CAAU,GAC1BD,EAAS,KAAKC,CAAU,GAEjB,CAAC,GAAGJ,GAAe,GAAGC,GAAmB,GAAGC,GAAY,GAAGC,CAAQ;AAC5E;AAOO,SAASI,GAAmBC,GAAkC;AAC7D,QAAAlC,IAAQL,EAAUuC,CAAO,GACzBb,IAAY,CAAC;AAEnB,WAASV,IAAI,GAAGA,IAAIX,EAAM,QAAQW,KAAK;AAC/B,UAAAT,IAAOF,EAAMW,CAAC;AAEpB,QAAIT,MAAS,KAAK;AACZ,UAAAS,MAAMX,EAAM,SAAS;AACvB,cAAM,IAAI,MAAM,uDAAuDkC,CAAO,EAAE;AAElF,MAAAb,EAAU,KAAK;AAAA,QACb,MAAM;AAAA,QACN,MAAM;AAAA,QACN,OAAO;AAAA,MAAA,CACR;AAAA,IAAA,MACH,CAAWnB,EAAK,GAAG,CAAC,MAAM,OAAOA,EAAK,GAAG,EAAE,MAAM,MAC/CmB,EAAU,KAAK;AAAA,MACb,MAAMnB,EAAK,CAAC,MAAM,MAAM,IAAyB;AAAA,MACjD,MAAMA,EAAK,CAAC,MAAM,MAAMA,EAAK,MAAM,GAAG,EAAE,IAAIA,EAAK,MAAM,GAAG,EAAE;AAAA,MAC5D,OAAO;AAAA,IAAA,CACR,IAEDmB,EAAU,KAAK;AAAA,MACb,MAAM;AAAA,MACN,MAAMnB;AAAA,MACN,OAAOA;AAAA,IAAA,CACR;AAAA,EACH;AAGK,SAAAmB;AACT;AAEA,MAAMc,KAAmB,+CACnBC,KAAe;AAWd,SAASC,GAAWC,GAAeC,GAA+CC,IAAU,QAAQ;AACzG,WAASC,EAASC,GAAoD;AAChE,WAAA,CAACA,KAAQA,MAASJ,IACb,OAGLI,EAAK,cAAc,OAAQA,EAAa,SAAS,SAC5CD,EAASC,EAAK,UAAgC,IAGhDA;AAAA,EAAA;AAGT,WAASC,EAAQC,GAAe;AAC9B,QAAKA,EAAE,UAAUA,EAAE,WAAW,KAAMA,EAAE,WAAWA,EAAE,WAAWA,EAAE,UAAUA,EAAE,YAAYA,EAAE;AACxF;AAGI,UAAAC,IAASJ,EAASG,EAAE,MAAqB;AAE/C,IAAKC,MAKHL,EAAQ,SAAS,aAAaK,EAAO,YACrCL,EAAQ,SAAS,aAAaK,EAAO,YACrCL,EAAQ,SAAS,SAASK,EAAO,QACjCA,EAAO,aAAa,oBAAoB,KACxCA,EAAO,aAAa,UAAU,KAC7BA,EAAO,aAAa,QAAQ,MAAM,YAAYV,GAAiB,KAAKU,EAAO,aAAa,KAAK,CAAE,KAChGT,GAAa,KAAKS,EAAO,aAAa,MAAM,CAAE,MAKhDD,EAAE,eAAe,GACjBL,EAASM,CAAM;AAAA,EAAA;AAGZ,SAAAP,EAAA,iBAAiB,SAASK,CAAc,GAEtC,WAAkB;AAClB,IAAAL,EAAA,oBAAoB,SAASK,CAAc;AAAA,EAClD;AACF;AAKgB,SAAAG,GAAclD,GAAc4B,GAAyC;AACnF,aAAWuB,KAAOvB,GAAQ;AACxB,UAAMwB,IAAQxB,EAAOuB,CAAG,EAAE,SAAS;AAC5B,IAAAnD,IAAAA,EAAK,QAAQ,IAAImD,CAAG,KAAKC,CAAK,EAAE,QAAQ,KAAKD,CAAG,KAAKC,CAAK;AAAA,EAAA;AAG5D,SAAApD;AACT;ACzPO,MAAMqD,KAAQ,OAAO,GACfC,KAAU,OAAO;;AAGvB,MAAMC,GAAO;AAAA,EAiElB,YAAYhC,GAAwB;AAjE/B,IAAAiC,EAAA,MAAAC;AACL,IAAAD,EAAA,MAAAE,GAAUC,GAAa,cAAc;AAErC,IAAAH,EAAA,MAAAI,GAAe;AACf,IAAAJ,EAAA,MAAAK,GAA+B,CAAC;AAChC,IAAAL,EAAA,MAAAM,GAAoC,CAAC;AAErC,IAAAN,EAAA,MAAAO,GAAa;AAEb,IAAAP,EAAA,MAAAQ;AAKA;AAAA;AAAA;AAAA,IAAAR,EAAA,MAAAS,GAAQ;AAKR;AAAA;AAAA;AAAA,IAAAT,EAAA,MAAAU,GAA2B,CAAC;AAK5B;AAAA;AAAA;AAAA,IAAAV,EAAA,MAAAW,GAASC,EAAc;AAKd;AAAA;AAAA;AAAA,IAAAC,EAAA,gBAASD;AAAA,MAChB,MAAM;AACE,cAAAE,IAAQC,EAAA,MAAKJ,GAAL;AACd,YAAIG;AACK,iBAAA;AAAA,YACL,MAAMA,EAAM;AAAA,YACZ,SAASA,EAAM;AAAA,YACf,QAAQ,EAAE,GAAGA,EAAM,OAAO;AAAA,YAC1B,OAAO,EAAE,GAAGA,EAAM,MAAM;AAAA,YACxB,MAAMA,EAAM,KAAK,QAAQ,CAAA;AAAA,UAC3B;AAAA,MAEJ;AAAA,MACA,EAAE,QAAQE,GAAU;AAAA,IACtB;AAKS;AAAA;AAAA;AAAA,IAAAH,EAAA,kBAAWD,EAAE,MAAA;;AAAM,cAAA1D,IAAA6D,EAAA,MAAKJ,GAAL,+BAAAzD,EAAe;AAAA,KAAO;AAKzC;AAAA;AAAA;AAAA,IAAA2D,EAAA,eAAQD,EAAE,MAAA;;AAAM,eAAA1D,IAAA6D,EAAA,MAAKJ,GAAL,+BAAAzD,EAAe,SAAQ,OAAO,SAAS;AAAA,KAAQ;AAK/D;AAAA;AAAA;AAAA,IAAA2D,EAAA,iBAAUD,EAAE,MAAM;;AAAA,eAAA1D,IAAA6D,EAAA,MAAKJ,GAAL,+BAAAzD,EAAe,WAAU;OAAI,EAAE,QAAQ+D,GAAc;AAKvE;AAAA;AAAA;AAAA,IAAAJ,EAAA,gBAASD,EAAE,MAAM;;AAAA,eAAA1D,IAAA6D,EAAA,MAAKJ,GAAL,+BAAAzD,EAAe,UAAS;OAAI,EAAE,QAAQ+D,GAAc;AAG5E,IAAAC,GAAanD,GAAS,oCAAoC,GAEtDA,EAAQ,QACVoD,EAAA,MAAKV,GAAQ,KAIfU,EAAA,MAAKb,GAAUjC;AAAA,MACbN,EAAQ,OACL,QAAQ,CAACC,MAAUoD,EAAA,MAAKnB,GAAAoB,GAAL,WAAmBrD,EAAM,EAC5C,IAAI,CAACA,OAAW;AAAA,QACf,SAASA,EAAM;AAAA,QACf,MAAMA,EAAM;AAAA,QACZ,WAAWa,GAAmBb,EAAM,OAAO;AAAA,MAAA,EAC3C;AAAA,IACN,IAEAsD,GAAqBP,EAAA,MAAKT,EAAO;AAAA,EAAA;AAAA,EAGnC,OAAOT,EAAK,EAAE0B,GAAiBC,GAAuC;AACpE,UAAMC,IAAQb,EAAc;AAC5B,IAAAO,EAAA,MAAKX,GAAa;AAAA,MAChB,IAAIkB,EAAA,MAAKtB,GAAL;AAAA,MACJ,MAAM,IAAIuB,GAAYH,GAASC,CAAK;AAAA,MACpC,SAAAD;AAAA,MACA,OAAAC;AAAA,IACF;AAGM,UAAAG,IAAa,MAAMR,EAAA,MAAKnB,GAAA4B,GAAL;AAClB,kBAAA,iBAAiB,YAAYD,CAAU,GAC9Cb,EAAA,MAAKL,GAAS,KAAK,MAAM,OAAO,oBAAoB,YAAYkB,CAAU,CAAC,GAG3Eb,EAAA,MAAKL,GAAS;AAAA,MACZzB,GAAWsC,GAAQ,CAAC9B,MAAW;AACxB,QAAAsB,EAAA,MAAAb,GAAQ,KAAK,gCAAgCT,CAAM;AAElD,cAAAqC,IAAOrC,EAAO,aAAa,MAAM,GACjCsC,IAAgBtC,EAAO,aAAa,4BAA4B;AAEtE,aAAK,GAAGqC,GAAM;AAAA,UACZ,eAAeE,GAA4BD,CAAa;AAAA,QAAA,CACzD;AAAA,MACF,CAAA;AAAA,IACH,GACKhB,EAAA,MAAAb,GAAQ,KAAK,4DAA4DqB,CAAM,GAEpFJ,EAAA,MAAKZ,GAAa,KAGlB,MAAMa,EAAA,MAAKnB,GAAA4B,GAAL,YAECd,EAAA,MAAKP,GAAW;AAAA,EAAA;AAAA,EAGzB,OAAOV,EAAO,IAAI;AACL,eAAAX,KAAY4B,EAAA,MAAKL;AACjB,MAAAvB,EAAA;AAEX,IAAA4B,EAAA,MAAKL,GAAS,SAAS;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMzB,KAAKuB,IAAQ,GAAG;AACP,WAAA,QAAQ,GAAG,CAACA,CAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM1B,QAAQA,IAAQ,GAAG;AACV,WAAA,QAAQ,GAAGA,CAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUzB,GAAGzF,GAAiCuB,IAA2B,IAAI;AAC7D,QAAAd;AAEA,IAAA,MAAM,QAAQT,CAAI,IACpBS,IAASN,EAASH,CAAI,IAEtBS,IAAST,EAAK,SAAS,GAGzBS,IAASG,EAAY,OAAO,SAAS,UAAUH,CAAM,GAEjDc,EAAQ,UACLqD,EAAA,MAAAnB,GAAAiC,GAAA,WAASjF,GAAQc,KAEjBqD,EAAA,MAAAnB,GAAAkC,GAAA,WAAMlF,GAAQc;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAMF,YAAYqE,GAA2C;AAC/C,UAAAtB,IAAQuB,EAAUtB,EAAA,MAAKJ,EAAM,GAC7BlD,IAAQ,EAAE,GAAG,KAAK,SAAS;AAEjC,eAAWkC,KAAOyC,GAAQ;AAClB,YAAAxC,IAAQwC,EAAOzC,CAAG;AACxB,MAAIC,MAAU,OACZ,OAAOnC,EAAMkC,CAAG,IAEVlC,EAAAkC,CAAG,IAAIC,EAAM,SAAS;AAAA,IAC9B;AAGF,QAAI0C,IAAuB,CAAC;AAE5B,eAAW3C,KAAOlC;AAChB,MAAA6E,EAAW,KAAK,GAAG3C,CAAG,IAAIlC,EAAMkC,CAAG,CAAC,EAAE;AAElC,UAAA4C,IAAcD,EAAW,SAAS,IAAI,MAAMA,EAAW,KAAK,GAAG,IAAI;AAEzE,IAAAvB,EAAA,MAAKJ,GAAL,WAAY,EAAE,GAAGG,GAAO,OAAArD,MAExB,OAAO,QAAQ,aAAa,MAAM,IAAIsD,EAAA,MAAKN,KAAQ,OAAOK,EAAM,OAAOyB,IAAczB,EAAM,OAAOyB,CAAW;AAAA,EAAA;AA4XjH;AA7jBErC,IAAA,eAEAE,IAAA,eACAC,IAAA,eACAC,IAAA,eAEAC,IAAA,eAEAC,IAAA,eAKAC,IAAA,eAKAC,IAAA,eAKAC,IAAA,eAxBKV,IAAA,eAqMLkC,IAAA,SAAML,GAAc/D,GAA0B;AACvC,EAAAgD,EAAA,MAAAb,GAAQ,KAAK,UAAU4B,CAAI,GAEzB,OAAA,QAAQ,UAAU,MAAM,IAAIf,EAAA,MAAKN,KAAQ,OAAOqB,IAAOA,CAAI,GAC7DV,EAAA,MAAAnB,GAAA4B,GAAA,WAAaC,GAAM/D;AAAO,GAGjCmE,IAAA,SAASJ,GAAc/D,GAA0B;AAC1C,EAAAgD,EAAA,MAAAb,GAAQ,KAAK,aAAa4B,CAAI,GAE5B,OAAA,QAAQ,aAAa,MAAM,IAAIf,EAAA,MAAKN,KAAQ,OAAOqB,IAAOA,CAAI,GAChEV,EAAA,MAAAnB,GAAA4B,GAAA,WAAaC,GAAM/D;AAAO,GAGjCyE,KAAsB,WAAA;AACpB,SAAIzB,EAAA,MAAKN,KACA,IAAI,IAAI,OAAO,SAAS,KAAK,MAAM,CAAC,GAAG,OAAO,SAAS,MAAM,IAE7D,IAAI,IAAI,OAAO,SAAS,UAAU,OAAO,SAAS,MAAM;AACjE,GAOIoB,IAAA,eAAaC,GAA2B/D,IAA2B,IAAI;AAC3E,QAAM0E,IAAS1B,EAAA,MAAKb,IACdpC,IAAMgE,IAAO,IAAI,IAAIA,GAAM,OAAO,SAAS,MAAM,IAAIV,EAAA,MAAKnB,GAAAuC,IAAL,YAErD,EAAE,OAAA1B,GAAO,SAAA4B,GAAS,OAAAC,MAAU,MAAMvB,EAAA,MAAKnB,GAAA2C,GAAL,WAAmB9E;AAE3D,WAASP,IAAI,GAAGA,IAAImF,EAAQ,QAAQnF,KAAK;AACjC,UAAAsF,IAAOH,EAAQnF,CAAC,GAChBuF,IAAM,iBAAiBvF,IAAI,CAAC,OAAOmF,EAAQ,MAAM;AAEvD,YAAQG,EAAK,MAAM;AAAA,MACjB,KAAK;AACH,QAAAJ,KAAA,QAAAA,EAAQ,KAAK,GAAGK,CAAG,OAAOD,EAAK,OAAO;AACtC;AAAA,MACF,KAAK;AACH,QAAAJ,KAAA,QAAAA,EAAQ,KAAK,GAAGK,CAAG,OAAOD,EAAK,OAAO;AACtC;AAAA,MACF,KAAK;AACH,QAAAJ,KAAA,QAAAA,EAAQ,KAAK,GAAGK,CAAG,OAAOD,EAAK,OAAO;AACtC;AAAA,IAEA;AAAA,EACJ;AAGF,MAAI,CAAC/B,GAAO;AAEV,QAAIC,EAAA,MAAKR;AACD,YAAAkC,EAAO,MAAM,IAAIM,GAAa,0BAA0BjF,EAAI,QAAQ,GAAG,CAAC;AAEhF;AAAA,EAAA;AAIF,MAAIL,IAAQqD,EAAM,OACdwB,IAAuB,CAAC;AAExB,MAAAvE,EAAQ,kBAAkB;AACpB,IAAAN,IAAA,OAAO,OAAO,CAAC,GAAG,KAAK,OAAO,GAAGqD,EAAM,KAAK;AAAA,WAC3CkC,EAAQjF,EAAQ,aAAa,GAAG;AACzC,UAAMkF,IAAiC,CAAC,GAClCC,IAAU,KAAK,OAAO;AAC5B,eAAWvD,KAAOuD;AAChB,MAAInF,EAAQ,cAAc,SAAS4B,CAAG,MAC1BsD,EAAAtD,CAAG,IAAIuD,EAAQvD,CAAG;AAGhC,IAAAlC,IAAQ,OAAO,OAAO,CAAI,GAAAwF,GAAWnC,EAAM,KAAK;AAAA,EAAA;AAGlD,aAAWnB,KAAOlC;AAChB,IAAA6E,EAAW,KAAK,GAAG3C,CAAG,IAAIlC,EAAMkC,CAAG,CAAC,EAAE;AAElC,QAAA4C,IAAcD,EAAW,SAAS,IAAI,MAAMA,EAAW,KAAK,GAAG,IAAI;AAIzE,UAAIxB,EAAM,SAAS,SAAS,YAAY,SAAS,WAAWyB,MAC1D,OAAO,QAAQ,aAAa,MAAM,IAAIxB,EAAA,MAAKN,KAAQ,OAAOK,EAAM,OAAOyB,IAAczB,EAAM,OAAOyB,CAAW,GAK/GY,GAAM,MAAM;AACJ,UAAAC,IAAaf,EAAU,KAAK,QAAQ;AAItC,QAFJtB,EAAA,MAAKJ,GAAL,WAAY,EAAE,GAAGG,GAAO,OAAArD,MAEpBqD,EAAM,YAAYsC,GAAY;AAErB,iBAAAC,KAAStC,EAAA,MAAKV,IAAe;AACtC,cAAMiD,IAAeX,EAAM,IAAIU,EAAM,EAAE;AACvC,QAAIC,KACID,EAAA,QAAQ,SAASC,CAAY;AAAA,MACrC;AAEF;AAAA,IAAA;AAGI,UAAAC,IAASzC,EAAM,KAAK;AACnB,IAAA2B,EAAA,KAAK,YAAY3B,CAAK;AAG7B,aAASvD,IAAI,GAAGA,IAAIgG,EAAO,QAAQhG,KAAK;AAChC,YAAAiG,IAAeD,EAAOhG,CAAC,GACvBkG,IAAc1C,EAAA,MAAKV,GAAc9C,CAAC;AAEpC,WAAAkG,KAAA,gBAAAA,EAAa,QAAOD,EAAa,IAAI;AAEvC,QAAArC,EAAA,MAAKd,GAAgBU,EAAA,MAAKV,GAAc,MAAM,GAAG9C,CAAC,IAClDkG,KAAA,QAAAA,EAAa,KAAK;AAElB,cAAMC,IAAc3C,EAAA,MAAKV,GAAc,GAAG,EAAE,KAAKU,EAAA,MAAKP,IAGhDiB,IAAQb,EAAc,GACtBtB,IAAO,IAAIqE,GAASD,EAAY,SAASF,EAAa,MAAM;AAAA,UAChE,UAAUI,GAAEC,GAAW,SAAS,EAAE,QAAQpC,EAAO,CAAA;AAAA,QAAA,CAClD,GAGK6B,IAAeX,EAAM,IAAIa,EAAa,EAAE;AAC9C,QAAIF,KACGhE,EAAA,QAAQ,SAASgE,CAAY,GAIpCvC,EAAA,MAAKV,GAAc,KAAK;AAAA,UACtB,IAAImD,EAAa;AAAA,UACjB,MAAAlE;AAAA,UACA,SAASA,EAAK;AAAA,UACd,OAAAmC;AAAA,QAAA,CACD,GAGDiC,EAAY,MAAMpE,CAAI;AAAA,MAAA,OACjB;AAEL,cAAMgE,IAAeX,EAAM,IAAIc,EAAY,EAAE;AAC7C,QAAIH,KACUG,EAAA,QAAQ,SAASH,CAAY;AAAA,MAC3C;AAAA,IACF;AAAA,EACF,CACD,GAEM,EAAE,OAAAxC,GAAO,SAAA4B,EAAQ;AAAA,GAMpBE,mBACJ9E,GACA4E,IAAyB,CACzB,GAAAC,IAAY,oBAAA,OAKX;AACD,SAAO,IAAI,QAAQ,CAACmB,GAASC,MAAW;;AACtC,UAAMjD,IAAQlD,EAAYmD,EAAA,MAAKT,IAASxC,EAAI,QAAQ;AAEpD,QAAI,CAACgD;AACH,aAAOgD,EAAQ;AAAA,QACb,OAAO;AAAA,QACP,SAAS,CAAC,GAAGpB,GAAS,EAAE,MAAM,QAAQ,SAAS,iBAAiB5E,EAAI,QAAQ,IAAA,CAAK;AAAA,QACjF,OAAA6E;AAAA,MAAA,CACD;AAGC,QAAAqB,IAAWlD,EAAM,KAAK;AAE1B,UAAMmD,IAAW,YAAY;AAC3B,UAAID,KAAY,MAAM;AAChB,YAAAxH;AAEA,YAAA0H,EAASF,CAAQ;AACZ,UAAAxH,IAAAkD,GAAcsE,GAAUlD,EAAM,MAAM;AAAA,iBAClC/D,EAAWiH,CAAQ,GAAG;AAC/B,gBAAMG,IAAwC;AAAA,YAC5C,MAAMrD,EAAM;AAAA,YACZ,SAASA,EAAM;AAAA,YACf,QAAQA,EAAM;AAAA,YACd,OAAOA,EAAM;AAAA,YACb,MAAMA,EAAM,KAAK,QAAQ,CAAA;AAAA,UAC3B;AAEI,cADGtE,IAAA,MAAMwH,EAASG,CAAe,GACjC,CAACD,EAAS1H,CAAI;AAChB,mBAAOuH,EAAO,IAAI,MAAM,sDAAsD,CAAC;AAEjF,UAAKvH,EAAK,WAAW,GAAG,MAEfA,IAAAY,EAAY0D,EAAM,MAAMtE,CAAI;AAAA,QACrC;AAEA,iBAAOuH,EAAO,IAAI,UAAU,sDAAsD,CAAC;AAGrF,QAAAD;AAAA,UACE1C,EAAA,MAAKnB,GAAA2C,GAAL,WAAmB,IAAI,IAAIpG,GAAM,OAAO,SAAS,MAAM,GAAG;AAAA,YACxD,GAAGkG;AAAA,YACH,EAAE,MAAM,YAAY,SAAS,gBAAgB5B,EAAM,IAAI,SAAStE,CAAI,IAAI;AAAA,UACzE;AAAA,QACH;AAAA,MAAA;AAEA,QAAAsH,EAAQ,EAAE,OAAAhD,GAAO,SAAS,CAAC,GAAG4B,GAAS,EAAE,MAAM,SAAS,SAAS,kBAAkB5B,EAAM,IAAI,IAAK,CAAA,GAAG,OAAA6B,GAAO;AAAA,IAEhH;AAEI,SAAAzF,IAAA4D,EAAM,KAAK,gBAAX,QAAA5D,EAAwB,QAAQ;AAC5B,YAAAkH,IAAYtD,EAAM,KAAK;AAC7B,UAAIvD,IAAI;AACR,YAAM8G,IAAO,MAAM;AAEb,YADJ9G,KACIA,MAAM6G,EAAU;AAET,UAAAH,EAAA;AAAA,aACJ;AAEL,cAAIK,IAAY;AAChB,gBAAMC,IAASH,EAAU7G,CAAC,EAAE,GAAG;AAAA,YAC7B,MAAMuD,EAAM;AAAA,YACZ,SAASA,EAAM;AAAA,YACf,QAAQA,EAAM;AAAA,YACd,OAAOA,EAAM;AAAA,YACb,MAAMA,EAAM,KAAK,QAAQ,CAAC;AAAA,YAE1B,UAAU,IAAI0D,MAAgB;AACtB,oBAAAC,IAAKL,EAAU7G,CAAC,EAAE,SAClBG,IAAwB,CAAC;AAE3B,kBAAA8G,EAAK,WAAW,KAAKE,GAAU1B,GAASwB,EAAK,CAAC,CAAC;AACjD,gBAAA9G,EAAQ,KAAK,GAAI8G,EAAK,CAAC,CAAkB;AAAA,uBAChCA,EAAK,WAAW;AACjB,gBAAA9G,EAAA,KAAK,CAAC8G,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC,CAAC;AAAA;AAEzB,sBAAA,IAAI,MAAM,oBAAoB;AAItC,cADgB7B,EAAM,IAAI8B,CAAE,IAIlB/G,EAAA,KAAK,GAAGA,CAAO,IAFjBiF,EAAA,IAAI8B,GAAI/G,CAAO;AAAA,YAIzB;AAAA,YAEA,UAAU,CAAClB,MAAS;AACP,cAAAwH,IAAAxH,GACC8H,IAAA,IACHL,EAAA;AAAA,YAAA;AAAA,UACX,CACD;AACD,UAAKK,MACCC,aAAkB,UACpBA,EAAO,KAAKF,CAAI,IAEXA,EAAA;AAAA,QAET;AAAA,MAEJ;AAEK,MAAAA,EAAA;AAAA,IAAA;AAII,MAAAJ,EAAA;AAAA,EACX,CACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASH5C,aAAcrD,GAAc2G,IAAmB,CAAA,GAAIpB,IAAuB,CAAA,GAAI;AACxE,MAAA,CAACqB,GAAS5G,CAAK,KAAK,CAACkG,EAASlG,EAAM,IAAI;AAC1C,UAAM,IAAI,UAAU,qEAAqEA,CAAK,EAAE;AAG9F,MAAAA,EAAM,YAAYA,EAAM;AACpB,UAAA,IAAI,MAAM,0DAA0D;AACjE,MAAAA,EAAM,YAAYA,EAAM;AAC3B,UAAA,IAAI,MAAM,mDAAmD;AACrE,MAAW,CAACA,EAAM,QAAQ,CAACA,EAAM,UAAU,CAACA,EAAM;AAC1C,UAAA,IAAI,MAAM,sEAAsE;AAGxF,MAAIpB,IAAkB,CAAC;AAEvB,aAAW2E,KAAUoD;AACnB,IAAA/H,EAAM,KAAK,GAAGL,EAAUgF,EAAO,IAAI,CAAC;AAGtC,EAAA3E,EAAM,KAAK,GAAGL,EAAUyB,EAAM,IAAI,CAAC,GAG/BpB,EAAMA,EAAM,SAAS,CAAC,MAAM,OAC9BA,EAAM,IAAI;AAGZ,QAAMiB,IAAwB,CAAC;AAE/B,MAAIG,EAAM,UAAU;AAClB,QAAIgG,IAAWhG,EAAM;AAEjB,IAAAkG,EAASF,CAAQ,MACnBA,IAAW5G,EAAYT,EAASC,CAAK,GAAGoH,CAAQ,GAE3CA,EAAS,WAAW,GAAG,MAC1BA,IAAW,MAAMA;AAIrB,UAAMa,IAAsB;AAAA,MAC1B,SAAS,MAAMlI,EAAS,CAAC,GAAGC,GAAO,GAAGL,EAAUyB,EAAM,IAAI,CAAC,CAAC;AAAA,MAC5D,MAAM;AAAA,QACJ,UAAAgG;AAAA,MAAA;AAAA,IAEJ;AACA,WAAAnG,EAAO,KAAKgH,CAAM,GAEXhH;AAAA,EAAA;AAGL,MAAAiH,IAAkB,CAACC,MAAeA,EAAM;AAExC,MAAAhI,EAAWiB,EAAM,IAAI;AACvB,IAAA8G,IAAO9G,EAAM;AAAA,WACJA,EAAM;AACT,UAAA,IAAI,UAAU,UAAUA,EAAM,IAAI,iDAAiDA,EAAM,IAAI,EAAE;AAGvG,QAAMqF,IAAoB,EAAE,IAAI3B,EAAA,MAAKtB,GAAL,KAAqB,MAAA0E,EAAK;AAG1D,MAAI9G,EAAM;AACG,eAAAgH,KAAYhH,EAAM;AAC3B,MAAAH,EAAO,KAAK,GAAGuD,EAAA,MAAKnB,GAAAoB,GAAL,WAAmB2D,GAAU,CAAC,GAAGL,GAAS3G,CAAK,GAAG,CAAC,GAAGuF,GAAQF,CAAK,EAAE;AAAA,OAEjF;AACL,UAAMwB,IAAsB;AAAA,MAC1B,SAASF,EAAQ,SAAShI,EAAS,CAAC,GAAGgI,EAAQ,IAAI,CAACxH,MAAMA,EAAE,IAAI,GAAGa,EAAM,IAAI,CAAC,IAAIA,EAAM;AAAA,MACxF,MAAM;AAAA,QACJ,SAASA,EAAM;AAAA,QACf,QAAQ,CAAC,GAAGuF,GAAQF,CAAK;AAAA;AAAA,QAEzB,aAAasB,EACV,QAAQ,CAACpD,GAAQhE,MAAOgE,EAAO,cAAc,EAAE,IAAIA,EAAO,aAAa,SAASgC,EAAOhG,CAAC,EAAE,GAAG,IAAI,IAAK,EACtG,OAAOS,EAAM,cAAc,EAAE,IAAIA,EAAM,aAAa,SAASqF,EAAM,OAAO,IAAI,EAC9E,OAAO,CAACrG,MAAMA,KAAK,IAAI;AAAA,MAAA;AAAA,IAE9B;AACA,QAAIgB,EAAM,MAAM;AACR,YAAAuD,IAASoD,EAAQ,GAAG,EAAE;AAC5B,MAAIpD,IACKsD,EAAA,KAAK,OAAO,EAAE,GAAGtD,EAAO,MAAM,GAAGvD,EAAM,KAAK,IAE5C6G,EAAA,KAAK,OAAO7G,EAAM;AAAA,IAC3B;AAEF,IAAAH,EAAO,KAAKgH,CAAM;AAAA,EAAA;AAGb,SAAAhH;AAAA;AAIX,SAASyD,GAAqBzD,GAAkC;AAE9D,aAAWG,KAASH;AACd,QAAAG,EAAM,KAAK,UAAU;AACnB,UAAAiH;AAEJ,UAAI,CAAAlI,EAAWiB,EAAM,KAAK,QAAQ,EAGvB,KAAAkG,EAASlG,EAAM,KAAK,QAAQ;AASrC,YARAiH,IAAejH,EAAM,KAAK,UAQtB,CANUJ,EAAYC,GAAQoH,GAAc;AAAA,UAC9C,UAAUC,GAAG;AACX,mBAAOA,MAAMlH;AAAA,UAAA;AAAA,QACf,CACD;AAGO,gBAAA,IAAI,MAAM,+CAA+CA,EAAM,OAAO,SAASA,EAAM,KAAK,QAAQ,GAAG;AAAA;AAG7G,cAAM,IAAI,UAAU,gDAAgDA,EAAM,KAAK,QAAQ,EAAE;AAAA,IAC3F;AAGN;AAKA,SAASgE,GAA4BpC,GAAoD;AACvF,MAAIA,MAAU;AACL,WAAA;AACE,MAAAA,MAAU,MAAQA,MAAU;AAC9B,WAAAA;AACT,MAAW,OAAOA,KAAU;AAEtB,WADJA,IAAQA,EAAM,KAAK,GACfA,MAAU,MAAMA,MAAU,SACrB,KACEA,MAAU,UACZ,KAGFA,EACJ,MAAM,GAAG,EACT,IAAI,CAACuF,MAAMA,EAAE,KAAM,CAAA,EACnB,OAAO,CAACA,MAAMA,EAAE,SAAS,CAAC;AAE7B,QAAM,IAAI,MAAM,0DAA0D,OAAOvF,CAAK,YAAYA,CAAK,GAAG;AAE9G;AAEA,MAAMmD,WAAqB,MAAM;AAAC;"}

package/dist/signals-gCwiIe5X.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"signals-gCwiIe5X.js","sources":["../node_modules/alien-signals/esm/system.mjs","../src/utils.ts","../src/core/signals.ts"],"sourcesContent":["export var ReactiveFlags;\n(function (ReactiveFlags) {\n    ReactiveFlags[ReactiveFlags[\"None\"] = 0] = \"None\";\n    ReactiveFlags[ReactiveFlags[\"Mutable\"] = 1] = \"Mutable\";\n    ReactiveFlags[ReactiveFlags[\"Watching\"] = 2] = \"Watching\";\n    ReactiveFlags[ReactiveFlags[\"RecursedCheck\"] = 4] = \"RecursedCheck\";\n    ReactiveFlags[ReactiveFlags[\"Recursed\"] = 8] = \"Recursed\";\n    ReactiveFlags[ReactiveFlags[\"Dirty\"] = 16] = \"Dirty\";\n    ReactiveFlags[ReactiveFlags[\"Pending\"] = 32] = \"Pending\";\n})(ReactiveFlags || (ReactiveFlags = {}));\nexport function createReactiveSystem({ update, notify, unwatched, }) {\n    return {\n        link,\n        unlink,\n        propagate,\n        checkDirty,\n        endTracking,\n        startTracking,\n        shallowPropagate,\n    };\n    function link(dep, sub) {\n        const prevDep = sub.depsTail;\n        if (prevDep !== undefined && prevDep.dep === dep) {\n            return;\n        }\n        let nextDep = undefined;\n        const recursedCheck = sub.flags & 4;\n        if (recursedCheck) {\n            nextDep = prevDep !== undefined ? prevDep.nextDep : sub.deps;\n            if (nextDep !== undefined && nextDep.dep === dep) {\n                sub.depsTail = nextDep;\n                return;\n            }\n        }\n        const prevSub = dep.subsTail;\n        if (prevSub !== undefined\n            && prevSub.sub === sub\n            && (!recursedCheck || isValidLink(prevSub, sub))) {\n            return;\n        }\n        const newLink = sub.depsTail\n            = dep.subsTail\n                = {\n                    dep,\n                    sub,\n                    prevDep,\n                    nextDep,\n                    prevSub,\n                    nextSub: undefined,\n                };\n        if (nextDep !== undefined) {\n            nextDep.prevDep = newLink;\n        }\n        if (prevDep !== undefined) {\n            prevDep.nextDep = newLink;\n        }\n        else {\n            sub.deps = newLink;\n        }\n        if (prevSub !== undefined) {\n            prevSub.nextSub = newLink;\n        }\n        else {\n            dep.subs = newLink;\n        }\n    }\n    function unlink(link, sub = link.sub) {\n        const dep = link.dep;\n        const prevDep = link.prevDep;\n        const nextDep = link.nextDep;\n        const nextSub = link.nextSub;\n        const prevSub = link.prevSub;\n        if (nextDep !== undefined) {\n            nextDep.prevDep = prevDep;\n        }\n        else {\n            sub.depsTail = prevDep;\n        }\n        if (prevDep !== undefined) {\n            prevDep.nextDep = nextDep;\n        }\n        else {\n            sub.deps = nextDep;\n        }\n        if (nextSub !== undefined) {\n            nextSub.prevSub = prevSub;\n        }\n        else {\n            dep.subsTail = prevSub;\n        }\n        if (prevSub !== undefined) {\n            prevSub.nextSub = nextSub;\n        }\n        else if ((dep.subs = nextSub) === undefined) {\n            unwatched(dep);\n        }\n        return nextDep;\n    }\n    function propagate(link) {\n        let next = link.nextSub;\n        let stack;\n        top: do {\n            const sub = link.sub;\n            let flags = sub.flags;\n            if (flags & 3) {\n                if (!(flags & 60)) {\n                    sub.flags = flags | 32;\n                }\n                else if (!(flags & 12)) {\n                    flags = 0;\n                }\n                else if (!(flags & 4)) {\n                    sub.flags = (flags & ~8) | 32;\n                }\n                else if (!(flags & 48) && isValidLink(link, sub)) {\n                    sub.flags = flags | 40;\n                    flags &= 1;\n                }\n                else {\n                    flags = 0;\n                }\n                if (flags & 2) {\n                    notify(sub);\n                }\n                if (flags & 1) {\n                    const subSubs = sub.subs;\n                    if (subSubs !== undefined) {\n                        link = subSubs;\n                        if (subSubs.nextSub !== undefined) {\n                            stack = { value: next, prev: stack };\n                            next = link.nextSub;\n                        }\n                        continue;\n                    }\n                }\n            }\n            if ((link = next) !== undefined) {\n                next = link.nextSub;\n                continue;\n            }\n            while (stack !== undefined) {\n                link = stack.value;\n                stack = stack.prev;\n                if (link !== undefined) {\n                    next = link.nextSub;\n                    continue top;\n                }\n            }\n            break;\n        } while (true);\n    }\n    function startTracking(sub) {\n        sub.depsTail = undefined;\n        sub.flags = (sub.flags & ~56) | 4;\n    }\n    function endTracking(sub) {\n        const depsTail = sub.depsTail;\n        let toRemove = depsTail !== undefined ? depsTail.nextDep : sub.deps;\n        while (toRemove !== undefined) {\n            toRemove = unlink(toRemove, sub);\n        }\n        sub.flags &= ~4;\n    }\n    function checkDirty(link, sub) {\n        let stack;\n        let checkDepth = 0;\n        top: do {\n            const dep = link.dep;\n            const depFlags = dep.flags;\n            let dirty = false;\n            if (sub.flags & 16) {\n                dirty = true;\n            }\n            else if ((depFlags & 17) === 17) {\n                if (update(dep)) {\n                    const subs = dep.subs;\n                    if (subs.nextSub !== undefined) {\n                        shallowPropagate(subs);\n                    }\n                    dirty = true;\n                }\n            }\n            else if ((depFlags & 33) === 33) {\n                if (link.nextSub !== undefined || link.prevSub !== undefined) {\n                    stack = { value: link, prev: stack };\n                }\n                link = dep.deps;\n                sub = dep;\n                ++checkDepth;\n                continue;\n            }\n            if (!dirty && link.nextDep !== undefined) {\n                link = link.nextDep;\n                continue;\n            }\n            while (checkDepth) {\n                --checkDepth;\n                const firstSub = sub.subs;\n                const hasMultipleSubs = firstSub.nextSub !== undefined;\n                if (hasMultipleSubs) {\n                    link = stack.value;\n                    stack = stack.prev;\n                }\n                else {\n                    link = firstSub;\n                }\n                if (dirty) {\n                    if (update(sub)) {\n                        if (hasMultipleSubs) {\n                            shallowPropagate(firstSub);\n                        }\n                        sub = link.sub;\n                        continue;\n                    }\n                }\n                else {\n                    sub.flags &= ~32;\n                }\n                sub = link.sub;\n                if (link.nextDep !== undefined) {\n                    link = link.nextDep;\n                    continue top;\n                }\n                dirty = false;\n            }\n            return dirty;\n        } while (true);\n    }\n    function shallowPropagate(link) {\n        do {\n            const sub = link.sub;\n            const nextSub = link.nextSub;\n            const subFlags = sub.flags;\n            if ((subFlags & 48) === 32) {\n                sub.flags = subFlags | 16;\n                if (subFlags & 2) {\n                    notify(sub);\n                }\n            }\n            link = nextSub;\n        } while (link !== undefined);\n    }\n    function isValidLink(checkLink, sub) {\n        const depsTail = sub.depsTail;\n        if (depsTail !== undefined) {\n            let link = sub.deps;\n            do {\n                if (link === checkLink) {\n                    return true;\n                }\n                if (link === depsTail) {\n                    break;\n                }\n                link = link.nextDep;\n            } while (link !== undefined);\n        }\n        return false;\n    }\n}\n","import { isFunction, isObject, typeOf } from \"./typeChecking.js\";\n\nexport const noOp = () => {};\n\n// Guarantee unique ID by incrementing a global counter.\nlet idCounter = 1;\nexport function getUniqueId(): string {\n  idCounter = (idCounter % Number.MAX_SAFE_INTEGER) + 1;\n  return idCounter.toString(36) + Date.now().toString(36);\n}\n\n/*=============================*\\\n||       Object Equality       ||\n\\*=============================*/\n\n/**\n * Equality check that passes if both values are the same object.\n * This is the default equality check for states.\n */\nexport function strictEqual(a: any, b: any): boolean {\n  return Object.is(a, b);\n}\n\n/**\n * Equality check that passes if both values are the same object, or if both are objects or arrays with equal keys and values.\n */\nexport function shallowEqual(a: any, b: any): boolean {\n  if (Object.is(a, b)) return true;\n\n  // Must be same type\n  const t = typeOf(a);\n  if (t !== typeOf(b)) {\n    return false;\n  }\n\n  switch (t) {\n    case \"object\":\n      // Objects must have same number of keys with strict equal values\n      let size = 0;\n      for (const key in a) {\n        if (a[key] !== b[key]) return false;\n        size++;\n      }\n      return Object.keys(b).length === size;\n    case \"array\":\n      // Arrays must be the same length with strict equal values\n      if (a.length !== b.length) return false;\n      for (let i = 0; i < a.length; i++) {\n        if (a[i] !== b[i]) return false;\n      }\n      return true;\n    case \"map\":\n      if (a.size !== b.size) return false;\n      for (const key of a.keys()) {\n        if (a[key] !== b[key]) return false;\n      }\n      return true;\n    case \"set\":\n      if (isFunction(a.symmetricDifference)) {\n        return a.symmetricDifference(b).size === 0;\n      } else {\n        for (const key of a.keys()) {\n          if (a[key] !== b.get(key)) return false;\n        }\n        return true;\n      }\n  }\n\n  return false;\n}\n\n/**\n * Equality check that passes if two objects have equal values, even if they are not the same object.\n */\n// NOTE: This code is https://github.com/epoberezkin/fast-deep-equal licensed under MIT.\n// I imported it because I couldn't get the old school module to play nice with my modern ES code as an external dependency.\nexport function deepEqual(a: any, b: any): boolean {\n  if (a === b) return true;\n\n  if (a && b && typeof a == \"object\" && typeof b == \"object\") {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0; ) if (!deepEqual(a[i], b[i])) return false;\n      return true;\n    }\n\n    if (a instanceof Map && b instanceof Map) {\n      if (a.size !== b.size) return false;\n      for (i of a.entries()) if (!b.has(i[0])) return false;\n      for (i of a.entries()) if (!deepEqual(i[1], b.get(i[0]))) return false;\n      return true;\n    }\n\n    if (a instanceof Set && b instanceof Set) {\n      if (a.size !== b.size) return false;\n      for (i of a.entries()) if (!b.has(i[0])) return false;\n      return true;\n    }\n\n    if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n      length = (a as any).length;\n      if (length != (b as any).length) return false;\n      for (i = length; i-- !== 0; ) if ((a as any)[i] !== (b as any)[i]) return false;\n      return true;\n    }\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n    for (i = length; i-- !== 0; ) {\n      var key = keys[i];\n\n      if (!deepEqual(a[key], b[key])) return false;\n    }\n\n    return true;\n  }\n\n  // true if both NaN, false otherwise\n  return a !== a && b !== b;\n}\n\n/*=============================*\\\n||         Object Utils        ||\n\\*=============================*/\n\n/**\n * Takes an old value and a new value.  Returns a merged copy if both are objects, otherwise returns the new value.\n */\nexport function merge(one: unknown, two: unknown) {\n  if (isObject(one)) {\n    if (!isObject(two)) {\n      return two;\n    }\n\n    const merged = Object.assign({}, one) as any;\n\n    for (const key in two) {\n      merged[key] = merge(merged[key], two[key]);\n    }\n\n    return merged;\n  } else {\n    return two;\n  }\n}\n\n/**\n * Returns a new object without the specified keys.\n * If called without object, returns a function that takes an object\n * and returns a version with the original keys omitted.\n *\n * @param keys - An array of keys to omit.\n * @param object - An object to clone without the omitted keys.\n */\nexport function omit<O extends Record<any, any>>(keys: (keyof O)[], object: O): Record<any, any> {\n  const newObject: Record<any, any> = {};\n\n  for (const key in object) {\n    if (!keys.includes(key)) {\n      newObject[key] = object[key];\n    }\n  }\n\n  return newObject;\n}\n\n/*=============================*\\\n||          Misc Utils         ||\n\\*=============================*/\n\nexport function toArray<T>(value: T | T[]): T[] {\n  if (Array.isArray(value)) {\n    return value;\n  } else {\n    return [value];\n  }\n}\n\nexport function toCamelCase(s: string) {\n  return s.replace(/-./g, (x) => x[1].toUpperCase());\n}\n\n/**\n * Takes any string and returns an OKLCH color.\n */\nexport function okhash(value: string) {\n  let hue = 0;\n  for (let i = 0; i < value.length; i++) {\n    hue = (hue + value.charCodeAt(i) * 10) % 360;\n  }\n  return `oklch(0.68 0.15 ${hue}deg)`;\n}\n\nexport type MatcherFunction = (value: string) => boolean;\n\n/**\n * Parses a filter string into a matcher function.\n *\n * @param pattern - A string or regular expression that specifies a pattern for names of loggers whose messages you want to display.\n */\nexport function createMatcher(pattern: string | RegExp): MatcherFunction {\n  if (pattern instanceof RegExp) {\n    return (value: string) => pattern.test(value);\n  }\n\n  const matchers: Record<\"positive\" | \"negative\", MatcherFunction[]> = {\n    positive: [],\n    negative: [],\n  };\n\n  const parts = pattern\n    .split(\",\")\n    .map((p) => p.trim())\n    .filter((p) => p !== \"\");\n\n  for (let part of parts) {\n    let section: \"positive\" | \"negative\" = \"positive\";\n\n    if (part.startsWith(\"-\")) {\n      section = \"negative\";\n      part = part.slice(1);\n    }\n\n    if (part === \"*\") {\n      matchers[section].push(function () {\n        return true;\n      });\n    } else if (part.endsWith(\"*\")) {\n      matchers[section].push(function (value) {\n        return value.startsWith(part.slice(0, part.length - 1));\n      });\n    } else {\n      matchers[section].push(function (value) {\n        return value === part;\n      });\n    }\n  }\n\n  return function (name: string) {\n    const { positive, negative } = matchers;\n\n    // Matching any negative matcher disqualifies.\n    if (negative.some((fn) => fn(name))) {\n      return false;\n    }\n\n    // Matching at least one positive matcher is required if any are specified.\n    if (positive.length > 0 && !positive.some((fn) => fn(name))) {\n      return false;\n    }\n\n    return true;\n  };\n}\n","import type { ReactiveFlags, ReactiveNode } from \"alien-signals\";\nimport { createReactiveSystem } from \"alien-signals/system\";\nimport { isFunction } from \"../typeChecking\";\nimport { strictEqual } from \"../utils\";\nimport { Context } from \"./context\";\n\nconst enum EffectFlags {\n  Queued = 1 << 6,\n}\n\ninterface EffectScope extends ReactiveNode {}\n\ninterface Effect extends ReactiveNode {\n  fn(): void | (() => void);\n  cleanup?: () => void;\n}\n\ninterface ComputedGetterState<T> {\n  value?: T;\n}\n\ninterface Computed<T = any> extends ReactiveNode {\n  value: T | undefined;\n  getter: (this: ComputedGetterState<T>) => T;\n  equals: EqualityFn<T>;\n}\n\ninterface Value<T = any> extends ReactiveNode {\n  previousValue: T;\n  value: T;\n  equals: EqualityFn<T>;\n}\n\nconst queuedEffects: (Effect | EffectScope | undefined)[] = [];\nconst { link, unlink, propagate, checkDirty, endTracking, startTracking, shallowPropagate } = createReactiveSystem({\n  update(signal: Value | Computed): boolean {\n    if (\"getter\" in signal) {\n      return updateComputed(signal);\n    } else {\n      return updateSignal(signal, signal.value);\n    }\n  },\n  notify,\n  unwatched(node: Value | Computed | Effect | EffectScope) {\n    if (\"getter\" in node) {\n      let toRemove = node.deps;\n      if (toRemove !== undefined) {\n        node.flags = 17 as ReactiveFlags.Mutable | ReactiveFlags.Dirty;\n        do {\n          toRemove = unlink(toRemove, node);\n        } while (toRemove !== undefined);\n      }\n    } else if (!(\"previousValue\" in node)) {\n      _effect.call(node);\n    }\n  },\n});\n\nlet batchDepth = 0;\n\nlet notifyIndex = 0;\nlet queuedEffectsLength = 0;\nlet activeSub: ReactiveNode | undefined;\nlet activeScope: EffectScope | undefined;\nlet activeContext: Context | undefined;\n\nfunction getCurrentSub(): ReactiveNode | undefined {\n  return activeSub;\n}\n\nfunction setCurrentSub(sub: ReactiveNode | undefined) {\n  const prevSub = activeSub;\n  activeSub = sub;\n  return prevSub;\n}\n\nexport function getCurrentContext(): Context | undefined {\n  return activeContext;\n}\n\nexport function setCurrentContext(context: Context | undefined) {\n  const prevContext = activeContext;\n  activeContext = context;\n  return prevContext;\n}\n\n// function getCurrentScope(): EffectScope | undefined {\n//   return activeScope;\n// }\n\n// function setCurrentScope(scope: EffectScope | undefined) {\n//   const prevScope = activeScope;\n//   activeScope = scope;\n//   return prevScope;\n// }\n\n// export function effectScope(fn: () => void): () => void {\n//   const e: EffectScope = {\n//     deps: undefined,\n//     depsTail: undefined,\n//     subs: undefined,\n//     subsTail: undefined,\n//     flags: 0 satisfies ReactiveFlags.None,\n//   };\n//   if (activeScope !== undefined) {\n//     link(e, activeScope);\n//   }\n//   const prevSub = setCurrentSub(undefined);\n//   const prevScope = setCurrentScope(e);\n//   try {\n//     fn();\n//   } finally {\n//     setCurrentScope(prevScope);\n//     setCurrentSub(prevSub);\n//   }\n//   return effectOper.bind(e);\n// }\n\nfunction updateComputed(c: Computed): boolean {\n  const prevSub = setCurrentSub(c);\n  startTracking(c);\n  try {\n    const oldValue = c.value;\n    const state: ComputedGetterState<any> = { value: c.value };\n    // return oldValue !== (c.value = c.getter.call(state));\n    return !c.equals(oldValue, (c.value = c.getter.call(state)));\n  } finally {\n    setCurrentSub(prevSub);\n    endTracking(c);\n  }\n}\n\nfunction updateSignal(s: Value, value: any): boolean {\n  s.flags = 1 satisfies ReactiveFlags.Mutable;\n  // return s.previousValue !== (s.previousValue = value);\n  return !s.equals(s.previousValue, (s.previousValue = value));\n}\n\nfunction notify(e: Effect | EffectScope) {\n  const flags = e.flags;\n  if (!(flags & EffectFlags.Queued)) {\n    e.flags = flags | EffectFlags.Queued;\n    const subs = e.subs;\n    if (subs !== undefined) {\n      notify(subs.sub as Effect | EffectScope);\n    } else {\n      queuedEffects[queuedEffectsLength++] = e;\n    }\n  }\n}\n\nfunction run(e: Effect | EffectScope, flags: ReactiveFlags): void {\n  if (\n    flags & (16 satisfies ReactiveFlags.Dirty) ||\n    (flags & (32 satisfies ReactiveFlags.Pending) && checkDirty(e.deps!, e))\n  ) {\n    const prev = setCurrentSub(e);\n    startTracking(e);\n    try {\n      if (\"cleanup\" in e && e.cleanup !== undefined) {\n        e.cleanup();\n      }\n      const result = (e as Effect).fn();\n      if (\"cleanup\" in e && isFunction(result)) {\n        e.cleanup = result;\n      }\n    } finally {\n      setCurrentSub(prev);\n      endTracking(e);\n    }\n    return;\n  } else if (flags & (32 satisfies ReactiveFlags.Pending)) {\n    e.flags = flags & ~(32 satisfies ReactiveFlags.Pending);\n  }\n  let link = e.deps;\n  while (link !== undefined) {\n    const dep = link.dep;\n    const depFlags = dep.flags;\n    if (depFlags & EffectFlags.Queued) {\n      run(dep, (dep.flags = depFlags & ~EffectFlags.Queued));\n    }\n    link = link.nextDep;\n  }\n}\n\nfunction flush(): void {\n  while (notifyIndex < queuedEffectsLength) {\n    const effect = queuedEffects[notifyIndex]!;\n    queuedEffects[notifyIndex++] = undefined;\n    run(effect, (effect.flags &= ~EffectFlags.Queued));\n  }\n  notifyIndex = 0;\n  queuedEffectsLength = 0;\n}\n\nfunction _computed<T>(this: Computed<T>): T {\n  const flags = this.flags;\n  if (\n    flags & (16 satisfies ReactiveFlags.Dirty) ||\n    (flags & (32 satisfies ReactiveFlags.Pending) && checkDirty(this.deps!, this))\n  ) {\n    if (updateComputed(this)) {\n      const subs = this.subs;\n      if (subs !== undefined) {\n        shallowPropagate(subs);\n      }\n    }\n  } else if (flags & (32 satisfies ReactiveFlags.Pending)) {\n    this.flags = flags & ~(32 satisfies ReactiveFlags.Pending);\n  }\n  if (activeSub !== undefined) {\n    link(this, activeSub);\n  } else if (activeScope !== undefined) {\n    link(this, activeScope);\n  }\n  return this.value!;\n}\n\nfunction _source<T>(this: Value<T>, ...value: [T]): T | void {\n  if (value.length) {\n    let newValue = value[0];\n    if (isFunction(newValue)) {\n      newValue = get(newValue(this.value)) as T;\n    }\n    if (!this.equals(this.value, newValue)) {\n      this.value = newValue;\n      this.flags = 17 as ReactiveFlags.Mutable | ReactiveFlags.Dirty;\n      const subs = this.subs;\n      if (subs !== undefined) {\n        propagate(subs);\n        if (!batchDepth) {\n          flush();\n        }\n      }\n    }\n  } else {\n    const value = this.value;\n    if (this.flags & (16 satisfies ReactiveFlags.Dirty)) {\n      if (updateSignal(this, value)) {\n        const subs = this.subs;\n        if (subs !== undefined) {\n          shallowPropagate(subs);\n        }\n      }\n    }\n    if (activeSub !== undefined) {\n      link(this, activeSub);\n    }\n    return value;\n  }\n}\n\nfunction _effect(this: Effect | EffectScope): void {\n  let dep = this.deps;\n  while (dep !== undefined) {\n    dep = unlink(dep, this);\n  }\n  const sub = this.subs;\n  if (sub !== undefined) {\n    unlink(sub);\n  }\n  this.flags = 0 satisfies ReactiveFlags.None;\n\n  if (\"cleanup\" in this && this.cleanup != null) {\n    this.cleanup();\n  }\n}\n\n/*===================================*\\\n||                API                ||\n\\*===================================*/\n\n/* -------------- TYPES --------------- */\n\n/**\n * A getter that returns the current value held within the signal.\n * If called inside a trackable scope this signal will be tracked as a dependency.\n */\nexport interface Signal<T> {\n  (): T;\n}\n\n/**\n * Extends Signal with the ability to pass a value or an updater function to change the Signal's value.\n */\nexport interface Source<T> extends Signal<T> {\n  (value: T): void;\n  (updater: (value: T) => T): void;\n}\n\nexport type MaybeSignal<T> = Signal<T> | T;\n\nexport type EqualityFn<T> = (current: T, next: T) => boolean;\nexport interface SignalOptions<T> {\n  /**\n   * A function to compare the current and next values. Returning `true` means the value has changed.\n   */\n  equals?: EqualityFn<T>;\n}\n\n/* -------------- PUBLIC API --------------- */\n\n/**\n * Suspends effects during `fn`. Effects for all updated Signal values are called at the end of the batch.\n */\nexport function batch(fn: () => void) {\n  ++batchDepth;\n  fn();\n  if (!--batchDepth) flush();\n}\n\n/**\n * Call a Signal function without tracking its value.\n */\nexport function untracked<T>(value: MaybeSignal<T>): T {\n  if (isFunction(value)) {\n    let result: T;\n    const pausedSub = setCurrentSub(undefined);\n    result = value();\n    setCurrentSub(pausedSub);\n    return result;\n  } else {\n    return value;\n  }\n}\n\n/**\n * Unwraps the plain value from a Signal. If the value is not a Signal it is returned as-is.\n */\nexport function get<T>(value: MaybeSignal<T>) {\n  if (isFunction(value)) {\n    return (value as () => T)();\n  } else {\n    return value;\n  }\n}\n\n/**\n * Function to be invoked for the effect. Can return an optional cleanup function to be called between invocations.\n */\nexport type EffectFn = () => void | (() => void);\n\nexport type UnsubscribeFn = () => void;\n\n/**\n * Creates a tracked scope that re-runs whenever the values of any tracked reactives changes.\n * Reactives are tracked by accessing their `value` within the body of the function.\n *\n * NOTE: You must call the unsubscribe function to stop watching for changes.\n * If you are using an effect inside a View or Store, use `ctx.effect` instead, which cleans up automatically when the component unmounts.\n */\nexport function effect(fn: EffectFn): UnsubscribeFn {\n  const e: Effect = {\n    fn,\n    subs: undefined,\n    subsTail: undefined,\n    deps: undefined,\n    depsTail: undefined,\n    flags: 2 satisfies ReactiveFlags.Watching,\n  };\n  if (activeSub !== undefined) {\n    link(e, activeSub);\n  } else if (activeScope !== undefined) {\n    link(e, activeScope);\n  }\n  const prev = setCurrentSub(e);\n  try {\n    e.cleanup?.();\n    const result = e.fn();\n    e.cleanup = isFunction(result) ? result : undefined;\n  } finally {\n    setCurrentSub(prev);\n  }\n  return _effect.bind(e);\n}\n\nexport function $<T>(compute: (this: ComputedGetterState<T>) => MaybeSignal<T>, options?: SignalOptions<T>): Signal<T>;\nexport function $<T>(value: T, options?: SignalOptions<T>): Source<T>;\nexport function $<T>(value: undefined, options?: SignalOptions<T>): Source<T | undefined>;\nexport function $<T>(): Source<T | undefined>;\n\nexport function $<T>(init?: ((previousValue: T) => MaybeSignal<T>) | T, options?: SignalOptions<T>) {\n  if (isFunction(init)) {\n    return _computed.bind({\n      value: undefined,\n      subs: undefined,\n      subsTail: undefined,\n      deps: undefined,\n      depsTail: undefined,\n      flags: 17 as ReactiveFlags.Mutable | ReactiveFlags.Dirty,\n      getter: function (this: ComputedGetterState<any>) {\n        return get(init.call(this));\n      },\n      equals: (options?.equals as EqualityFn<unknown>) ?? strictEqual,\n    }) as () => T;\n  } else {\n    return _source.bind({\n      previousValue: init,\n      value: init,\n      equals: (options?.equals as EqualityFn<unknown>) ?? strictEqual,\n      subs: undefined,\n      subsTail: undefined,\n      flags: 1 satisfies ReactiveFlags.Mutable,\n    }) as () => T | undefined;\n  }\n}\n"],"names":["ReactiveFlags","createReactiveSystem","update","notify","unwatched","link","unlink","propagate","checkDirty","endTracking","startTracking","shallowPropagate","dep","sub","prevDep","nextDep","recursedCheck","prevSub","isValidLink","newLink","nextSub","next","stack","top","flags","subSubs","depsTail","toRemove","checkDepth","depFlags","dirty","subs","firstSub","hasMultipleSubs","subFlags","checkLink","noOp","idCounter","getUniqueId","strictEqual","a","b","shallowEqual","t","typeOf","size","key","i","isFunction","deepEqual","length","keys","omit","object","newObject","toArray","value","toCamelCase","s","x","okhash","hue","createMatcher","pattern","matchers","parts","p","part","section","name","positive","negative","fn","queuedEffects","signal","updateComputed","updateSignal","node","_effect","batchDepth","notifyIndex","queuedEffectsLength","activeSub","activeContext","setCurrentSub","getCurrentContext","setCurrentContext","context","prevContext","c","oldValue","state","run","prev","result","flush","effect","_computed","_source","newValue","get","batch","untracked","pausedSub","e","_a","$","init","options"],"mappings":";AAAO,IAAIA;AAAA,CACV,SAAUA,GAAe;AACtB,EAAAA,EAAcA,EAAc,OAAU,CAAC,IAAI,QAC3CA,EAAcA,EAAc,UAAa,CAAC,IAAI,WAC9CA,EAAcA,EAAc,WAAc,CAAC,IAAI,YAC/CA,EAAcA,EAAc,gBAAmB,CAAC,IAAI,iBACpDA,EAAcA,EAAc,WAAc,CAAC,IAAI,YAC/CA,EAAcA,EAAc,QAAW,EAAE,IAAI,SAC7CA,EAAcA,EAAc,UAAa,EAAE,IAAI;AACnD,GAAGA,MAAkBA,IAAgB,CAAA,EAAG;AACjC,SAASC,EAAqB,EAAE,QAAAC,GAAQ,QAAAC,GAAQ,WAAAC,EAAS,GAAK;AACjE,SAAO;AAAA,IACH,MAAAC;AAAA,IACA,QAAAC;AAAA,IACA,WAAAC;AAAA,IACA,YAAAC;AAAA,IACA,aAAAC;AAAA,IACA,eAAAC;AAAA,IACA,kBAAAC;AAAA,EACH;AACD,WAASN,EAAKO,GAAKC,GAAK;AACpB,UAAMC,IAAUD,EAAI;AACpB,QAAIC,MAAY,UAAaA,EAAQ,QAAQF;AACzC;AAEJ,QAAIG;AACJ,UAAMC,IAAgBH,EAAI,QAAQ;AAClC,QAAIG,MACAD,IAAUD,MAAY,SAAYA,EAAQ,UAAUD,EAAI,MACpDE,MAAY,UAAaA,EAAQ,QAAQH,IAAK;AAC9C,MAAAC,EAAI,WAAWE;AACf;AAAA,IAChB;AAEQ,UAAME,IAAUL,EAAI;AACpB,QAAIK,MAAY,UACTA,EAAQ,QAAQJ,MACf,CAACG,KAAiBE,EAAYD,GAASJ,CAAG;AAC9C;AAEJ,UAAMM,IAAUN,EAAI,WACdD,EAAI,WACA;AAAA,MACE,KAAAA;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,MACA,SAAAC;AAAA,MACA,SAAAE;AAAA,MACA,SAAS;AAAA,IACZ;AACT,IAAIF,MAAY,WACZA,EAAQ,UAAUI,IAElBL,MAAY,SACZA,EAAQ,UAAUK,IAGlBN,EAAI,OAAOM,GAEXF,MAAY,SACZA,EAAQ,UAAUE,IAGlBP,EAAI,OAAOO;AAAA,EAEvB;AACI,WAASb,EAAOD,GAAMQ,IAAMR,EAAK,KAAK;AAClC,UAAMO,IAAMP,EAAK,KACXS,IAAUT,EAAK,SACfU,IAAUV,EAAK,SACfe,IAAUf,EAAK,SACfY,IAAUZ,EAAK;AACrB,WAAIU,MAAY,SACZA,EAAQ,UAAUD,IAGlBD,EAAI,WAAWC,GAEfA,MAAY,SACZA,EAAQ,UAAUC,IAGlBF,EAAI,OAAOE,GAEXK,MAAY,SACZA,EAAQ,UAAUH,IAGlBL,EAAI,WAAWK,GAEfA,MAAY,SACZA,EAAQ,UAAUG,KAEZR,EAAI,OAAOQ,OAAa,UAC9BhB,EAAUQ,CAAG,GAEVG;AAAA,EACf;AACI,WAASR,EAAUF,GAAM;AACrB,QAAIgB,IAAOhB,EAAK,SACZiB;AACJ,IAAAC,EAAK,IAAG;AACJ,YAAMV,IAAMR,EAAK;AACjB,UAAImB,IAAQX,EAAI;AAChB,UAAIW,IAAQ,MACFA,IAAQ,KAGHA,IAAQ,KAGRA,IAAQ,IAGV,EAAEA,IAAQ,OAAON,EAAYb,GAAMQ,CAAG,KAC3CA,EAAI,QAAQW,IAAQ,IACpBA,KAAS,KAGTA,IAAQ,IAPRX,EAAI,QAASW,IAAQ,KAAM,KAH3BA,IAAQ,IAHRX,EAAI,QAAQW,IAAQ,IAepBA,IAAQ,KACRrB,EAAOU,CAAG,GAEVW,IAAQ,IAAG;AACX,cAAMC,IAAUZ,EAAI;AACpB,YAAIY,MAAY,QAAW;AACvB,UAAApB,IAAOoB,GACHA,EAAQ,YAAY,WACpBH,IAAQ,EAAE,OAAOD,GAAM,MAAMC,EAAO,GACpCD,IAAOhB,EAAK;AAEhB;AAAA,QACxB;AAAA,MACA;AAEY,WAAKA,IAAOgB,OAAU,QAAW;AAC7B,QAAAA,IAAOhB,EAAK;AACZ;AAAA,MAChB;AACY,aAAOiB,MAAU;AAGb,YAFAjB,IAAOiB,EAAM,OACbA,IAAQA,EAAM,MACVjB,MAAS,QAAW;AACpB,UAAAgB,IAAOhB,EAAK;AACZ,mBAASkB;AAAA,QAC7B;AAEY;AAAA,IACZ,SAAiB;AAAA,EACjB;AACI,WAASb,EAAcG,GAAK;AACxB,IAAAA,EAAI,WAAW,QACfA,EAAI,QAASA,EAAI,QAAQ,MAAO;AAAA,EACxC;AACI,WAASJ,EAAYI,GAAK;AACtB,UAAMa,IAAWb,EAAI;AACrB,QAAIc,IAAWD,MAAa,SAAYA,EAAS,UAAUb,EAAI;AAC/D,WAAOc,MAAa;AAChB,MAAAA,IAAWrB,EAAOqB,GAAUd,CAAG;AAEnC,IAAAA,EAAI,SAAS;AAAA,EACrB;AACI,WAASL,EAAWH,GAAMQ,GAAK;AAC3B,QAAIS,GACAM,IAAa;AACjB,IAAAL,EAAK,IAAG;AACJ,YAAMX,IAAMP,EAAK,KACXwB,IAAWjB,EAAI;AACrB,UAAIkB,IAAQ;AACZ,UAAIjB,EAAI,QAAQ;AACZ,QAAAiB,IAAQ;AAAA,gBAEFD,IAAW,QAAQ;AACzB,YAAI3B,EAAOU,CAAG,GAAG;AACb,gBAAMmB,IAAOnB,EAAI;AACjB,UAAImB,EAAK,YAAY,UACjBpB,EAAiBoB,CAAI,GAEzBD,IAAQ;AAAA,QAC5B;AAAA,kBAEsBD,IAAW,QAAQ,IAAI;AAC7B,SAAIxB,EAAK,YAAY,UAAaA,EAAK,YAAY,YAC/CiB,IAAQ,EAAE,OAAOjB,GAAM,MAAMiB,EAAO,IAExCjB,IAAOO,EAAI,MACXC,IAAMD,GACN,EAAEgB;AACF;AAAA,MAChB;AACY,UAAI,CAACE,KAASzB,EAAK,YAAY,QAAW;AACtC,QAAAA,IAAOA,EAAK;AACZ;AAAA,MAChB;AACY,aAAOuB,KAAY;AACf,UAAEA;AACF,cAAMI,IAAWnB,EAAI,MACfoB,IAAkBD,EAAS,YAAY;AAQ7C,YAPIC,KACA5B,IAAOiB,EAAM,OACbA,IAAQA,EAAM,QAGdjB,IAAO2B,GAEPF;AACA,cAAI5B,EAAOW,CAAG,GAAG;AACb,YAAIoB,KACAtB,EAAiBqB,CAAQ,GAE7BnB,IAAMR,EAAK;AACX;AAAA,UACxB;AAAA;AAGoB,UAAAQ,EAAI,SAAS;AAGjB,YADAA,IAAMR,EAAK,KACPA,EAAK,YAAY,QAAW;AAC5B,UAAAA,IAAOA,EAAK;AACZ,mBAASkB;AAAA,QAC7B;AACgB,QAAAO,IAAQ;AAAA,MACxB;AACY,aAAOA;AAAA,IACnB,SAAiB;AAAA,EACjB;AACI,WAASnB,EAAiBN,GAAM;AAC5B,OAAG;AACC,YAAMQ,IAAMR,EAAK,KACXe,IAAUf,EAAK,SACf6B,IAAWrB,EAAI;AACrB,OAAKqB,IAAW,QAAQ,OACpBrB,EAAI,QAAQqB,IAAW,IACnBA,IAAW,KACX/B,EAAOU,CAAG,IAGlBR,IAAOe;AAAA,IACV,SAAQf,MAAS;AAAA,EAC1B;AACI,WAASa,EAAYiB,GAAWtB,GAAK;AACjC,UAAMa,IAAWb,EAAI;AACrB,QAAIa,MAAa,QAAW;AACxB,UAAIrB,IAAOQ,EAAI;AACf,SAAG;AACC,YAAIR,MAAS8B;AACT,iBAAO;AAEX,YAAI9B,MAASqB;AACT;AAEJ,QAAArB,IAAOA,EAAK;AAAA,MACf,SAAQA,MAAS;AAAA,IAC9B;AACQ,WAAO;AAAA,EACf;AACA;AChQO,MAAM+B,IAAO,MAAM;AAAC;AAG3B,IAAIC,IAAY;AACT,SAASC,IAAsB;AACvB,SAAAD,IAAAA,IAAY,OAAO,mBAAoB,GAC7CA,EAAU,SAAS,EAAE,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE;AACxD;AAUgB,SAAAE,EAAYC,GAAQC,GAAiB;AAC5C,SAAA,OAAO,GAAGD,GAAGC,CAAC;AACvB;AAKgB,SAAAC,EAAaF,GAAQC,GAAiB;AACpD,MAAI,OAAO,GAAGD,GAAGC,CAAC,EAAU,QAAA;AAGtB,QAAAE,IAAIC,EAAOJ,CAAC;AACd,MAAAG,MAAMC,EAAOH,CAAC;AACT,WAAA;AAGT,UAAQE,GAAG;AAAA,IACT,KAAK;AAEH,UAAIE,IAAO;AACX,iBAAWC,KAAON,GAAG;AACnB,YAAIA,EAAEM,CAAG,MAAML,EAAEK,CAAG,EAAU,QAAA;AAC9B,QAAAD;AAAA,MAAA;AAEF,aAAO,OAAO,KAAKJ,CAAC,EAAE,WAAWI;AAAA,IACnC,KAAK;AAEH,UAAIL,EAAE,WAAWC,EAAE,OAAe,QAAA;AAClC,eAASM,IAAI,GAAGA,IAAIP,EAAE,QAAQO;AAC5B,YAAIP,EAAEO,CAAC,MAAMN,EAAEM,CAAC,EAAU,QAAA;AAErB,aAAA;AAAA,IACT,KAAK;AACH,UAAIP,EAAE,SAASC,EAAE,KAAa,QAAA;AACnB,iBAAAK,KAAON,EAAE;AAClB,YAAIA,EAAEM,CAAG,MAAML,EAAEK,CAAG,EAAU,QAAA;AAEzB,aAAA;AAAA,IACT,KAAK;AACC,UAAAE,EAAWR,EAAE,mBAAmB;AAClC,eAAOA,EAAE,oBAAoBC,CAAC,EAAE,SAAS;AAE9B,iBAAAK,KAAON,EAAE;AAClB,YAAIA,EAAEM,CAAG,MAAML,EAAE,IAAIK,CAAG,EAAU,QAAA;AAE7B,aAAA;AAAA,EACT;AAGG,SAAA;AACT;AAOgB,SAAAG,EAAUT,GAAQC,GAAiB;AAC7C,MAAAD,MAAMC,EAAU,QAAA;AAEpB,MAAID,KAAKC,KAAK,OAAOD,KAAK,YAAY,OAAOC,KAAK,UAAU;AAC1D,QAAID,EAAE,gBAAgBC,EAAE,YAAoB,QAAA;AAE5C,QAAIS,GAAQH,GAAGI;AACX,QAAA,MAAM,QAAQX,CAAC,GAAG;AAEhB,UADJU,IAASV,EAAE,QACPU,KAAUT,EAAE,OAAe,QAAA;AAC/B,WAAKM,IAAIG,GAAQH,QAAQ,SAAS,CAACE,EAAUT,EAAEO,CAAC,GAAGN,EAAEM,CAAC,CAAC,EAAU,QAAA;AAC1D,aAAA;AAAA,IAAA;AAGL,QAAAP,aAAa,OAAOC,aAAa,KAAK;AACxC,UAAID,EAAE,SAASC,EAAE,KAAa,QAAA;AAC9B,WAAKM,KAAKP,EAAE,QAAQ,EAAO,KAAA,CAACC,EAAE,IAAIM,EAAE,CAAC,CAAC,EAAU,QAAA;AAChD,WAAKA,KAAKP,EAAE,QAAW,EAAA,KAAI,CAACS,EAAUF,EAAE,CAAC,GAAGN,EAAE,IAAIM,EAAE,CAAC,CAAC,CAAC,EAAU,QAAA;AAC1D,aAAA;AAAA,IAAA;AAGL,QAAAP,aAAa,OAAOC,aAAa,KAAK;AACxC,UAAID,EAAE,SAASC,EAAE,KAAa,QAAA;AAC9B,WAAKM,KAAKP,EAAE,QAAQ,EAAO,KAAA,CAACC,EAAE,IAAIM,EAAE,CAAC,CAAC,EAAU,QAAA;AACzC,aAAA;AAAA,IAAA;AAGT,QAAI,YAAY,OAAOP,CAAC,KAAK,YAAY,OAAOC,CAAC,GAAG;AAE9C,UADJS,IAAUV,EAAU,QAChBU,KAAWT,EAAU,OAAe,QAAA;AACnC,WAAAM,IAAIG,GAAQH,QAAQ,IAAK,KAAKP,EAAUO,CAAC,MAAON,EAAUM,CAAC,EAAU,QAAA;AACnE,aAAA;AAAA,IAAA;AAGL,QAAAP,EAAE,gBAAgB,OAAe,QAAAA,EAAE,WAAWC,EAAE,UAAUD,EAAE,UAAUC,EAAE;AACxE,QAAAD,EAAE,YAAY,OAAO,UAAU,gBAAgBA,EAAE,QAAA,MAAcC,EAAE,QAAQ;AACzE,QAAAD,EAAE,aAAa,OAAO,UAAU,iBAAiBA,EAAE,SAAA,MAAeC,EAAE,SAAS;AAIjF,QAFOU,IAAA,OAAO,KAAKX,CAAC,GACpBU,IAASC,EAAK,QACVD,MAAW,OAAO,KAAKT,CAAC,EAAE,OAAe,QAAA;AAE7C,SAAKM,IAAIG,GAAQH,QAAQ,SAAS,CAAC,OAAO,UAAU,eAAe,KAAKN,GAAGU,EAAKJ,CAAC,CAAC,EAAU,QAAA;AAEvF,SAAAA,IAAIG,GAAQH,QAAQ,KAAK;AACxB,UAAAD,IAAMK,EAAKJ,CAAC;AAEZ,UAAA,CAACE,EAAUT,EAAEM,CAAG,GAAGL,EAAEK,CAAG,CAAC,EAAU,QAAA;AAAA,IAAA;AAGlC,WAAA;AAAA,EAAA;AAIF,SAAAN,MAAMA,KAAKC,MAAMA;AAC1B;AAmCgB,SAAAW,GAAiCD,GAAmBE,GAA6B;AAC/F,QAAMC,IAA8B,CAAC;AAErC,aAAWR,KAAOO;AAChB,IAAKF,EAAK,SAASL,CAAG,MACVQ,EAAAR,CAAG,IAAIO,EAAOP,CAAG;AAIxB,SAAAQ;AACT;AAMO,SAASC,GAAWC,GAAqB;AAC1C,SAAA,MAAM,QAAQA,CAAK,IACdA,IAEA,CAACA,CAAK;AAEjB;AAEO,SAASC,GAAYC,GAAW;AAC9B,SAAAA,EAAE,QAAQ,OAAO,CAACC,MAAMA,EAAE,CAAC,EAAE,aAAa;AACnD;AAKO,SAASC,GAAOJ,GAAe;AACpC,MAAIK,IAAM;AACV,WAASd,IAAI,GAAGA,IAAIS,EAAM,QAAQT;AAChC,IAAAc,KAAOA,IAAML,EAAM,WAAWT,CAAC,IAAI,MAAM;AAE3C,SAAO,mBAAmBc,CAAG;AAC/B;AASO,SAASC,GAAcC,GAA2C;AACvE,MAAIA,aAAmB;AACrB,WAAO,CAACP,MAAkBO,EAAQ,KAAKP,CAAK;AAG9C,QAAMQ,IAA+D;AAAA,IACnE,UAAU,CAAC;AAAA,IACX,UAAU,CAAA;AAAA,EACZ,GAEMC,IAAQF,EACX,MAAM,GAAG,EACT,IAAI,CAACG,MAAMA,EAAE,KAAM,CAAA,EACnB,OAAO,CAACA,MAAMA,MAAM,EAAE;AAEzB,WAASC,KAAQF,GAAO;AACtB,QAAIG,IAAmC;AAEnC,IAAAD,EAAK,WAAW,GAAG,MACXC,IAAA,YACHD,IAAAA,EAAK,MAAM,CAAC,IAGjBA,MAAS,MACFH,EAAAI,CAAO,EAAE,KAAK,WAAY;AAC1B,aAAA;AAAA,IAAA,CACR,IACQD,EAAK,SAAS,GAAG,IAC1BH,EAASI,CAAO,EAAE,KAAK,SAAUZ,GAAO;AAC/B,aAAAA,EAAM,WAAWW,EAAK,MAAM,GAAGA,EAAK,SAAS,CAAC,CAAC;AAAA,IAAA,CACvD,IAEDH,EAASI,CAAO,EAAE,KAAK,SAAUZ,GAAO;AACtC,aAAOA,MAAUW;AAAA,IAAA,CAClB;AAAA,EACH;AAGF,SAAO,SAAUE,GAAc;AACvB,UAAA,EAAE,UAAAC,GAAU,UAAAC,EAAA,IAAaP;AAQ3B,WALA,EAAAO,EAAS,KAAK,CAACC,MAAOA,EAAGH,CAAI,CAAC,KAK9BC,EAAS,SAAS,KAAK,CAACA,EAAS,KAAK,CAACE,MAAOA,EAAGH,CAAI,CAAC;AAAA,EAK5D;AACF;ACxOA,MAAMI,IAAsD,CAAC,GACvD,EAAE,MAAApE,GAAM,QAAAC,GAAQ,WAAAC,GAAW,YAAAC,GAAY,aAAAC,GAAa,eAAAC,GAAe,kBAAAC,EAAiB,IAAIV,EAAqB;AAAA,EACjH,OAAOyE,GAAmC;AACxC,WAAI,YAAYA,IACPC,EAAeD,CAAM,IAErBE,EAAaF,GAAQA,EAAO,KAAK;AAAA,EAE5C;AAAA,EACA,QAAAvE;AAAA,EACA,UAAU0E,GAA+C;AACvD,QAAI,YAAYA,GAAM;AACpB,UAAIlD,IAAWkD,EAAK;AACpB,UAAIlD,MAAa,QAAW;AAC1B,QAAAkD,EAAK,QAAQ;AACV;AACU,UAAAlD,IAAArB,EAAOqB,GAAUkD,CAAI;AAAA,eACzBlD,MAAa;AAAA,MAAA;AAAA,IACxB,MACF,CAAa,mBAAmBkD,KAC9BC,EAAQ,KAAKD,CAAI;AAAA,EACnB;AAEJ,CAAC;AAED,IAAIE,IAAa,GAEbC,IAAc,GACdC,IAAsB,GACtBC,GAEAC;AAMJ,SAASC,EAAcvE,GAA+B;AACpD,QAAMI,IAAUiE;AACJ,SAAAA,IAAArE,GACLI;AACT;AAEO,SAASoE,KAAyC;AAChD,SAAAF;AACT;AAEO,SAASG,GAAkBC,GAA8B;AAC9D,QAAMC,IAAcL;AACJ,SAAAA,IAAAI,GACTC;AACT;AAkCA,SAASb,EAAec,GAAsB;AACtC,QAAAxE,IAAUmE,EAAcK,CAAC;AAC/B,EAAA/E,EAAc+E,CAAC;AACX,MAAA;AACF,UAAMC,IAAWD,EAAE,OACbE,IAAkC,EAAE,OAAOF,EAAE,MAAM;AAElD,WAAA,CAACA,EAAE,OAAOC,GAAWD,EAAE,QAAQA,EAAE,OAAO,KAAKE,CAAK,CAAE;AAAA,EAAA,UAC3D;AACA,IAAAP,EAAcnE,CAAO,GACrBR,EAAYgF,CAAC;AAAA,EAAA;AAEjB;AAEA,SAASb,EAAalB,GAAUF,GAAqB;AACnD,SAAAE,EAAE,QAAQ,GAEH,CAACA,EAAE,OAAOA,EAAE,eAAgBA,EAAE,gBAAgBF,CAAM;AAC7D;AAEA,SAASrD,EAAO,GAAyB;AACvC,QAAMqB,IAAQ,EAAE;AACZ,MAAA,EAAEA,IAAQ,KAAqB;AACjC,MAAE,QAAQA,IAAQ;AAClB,UAAMO,IAAO,EAAE;AACf,IAAIA,MAAS,SACX5B,EAAO4B,EAAK,GAA2B,IAEvC0C,EAAcQ,GAAqB,IAAI;AAAA,EACzC;AAEJ;AAEA,SAASW,EAAI,GAAyBpE,GAA4B;AAE9D,MAAAA,IAAS,MACRA,IAAS,MAAuChB,EAAW,EAAE,MAAO,CAAC,GACtE;AACM,UAAAqF,IAAOT,EAAc,CAAC;AAC5B,IAAA1E,EAAc,CAAC;AACX,QAAA;AACF,MAAI,aAAa,KAAK,EAAE,YAAY,UAClC,EAAE,QAAQ;AAEN,YAAAoF,IAAU,EAAa,GAAG;AAChC,MAAI,aAAa,KAAK9C,EAAW8C,CAAM,MACrC,EAAE,UAAUA;AAAA,IACd,UACA;AACA,MAAAV,EAAcS,CAAI,GAClBpF,EAAY,CAAC;AAAA,IAAA;AAEf;AAAA,EAAA,MACF,CAAWe,IAAS,OAChB,EAAA,QAAQA,IAAQ;AAEpB,MAAInB,IAAO,EAAE;AACb,SAAOA,MAAS,UAAW;AACzB,UAAMO,IAAMP,EAAK,KACXwB,IAAWjB,EAAI;AACrB,IAAIiB,IAAW,MACb+D;AAAA,MAAIhF;AAAA,MAAMA,EAAI,QAAQiB,IAAW;AAAA;AAAA,IAAoB,GAEvDxB,IAAOA,EAAK;AAAA,EAAA;AAEhB;AAEA,SAAS0F,IAAc;AACrB,SAAOf,IAAcC,KAAqB;AAClCe,UAAAA,IAASvB,EAAcO,CAAW;AACxC,IAAAP,EAAcO,GAAa,IAAI,QAC/BY;AAAA,MAAII;AAAAA,MAASA,EAAO,SAAS;AAAA;AAAA,IAAoB;AAAA,EAAA;AAErC,EAAAhB,IAAA,GACQC,IAAA;AACxB;AAEA,SAASgB,IAAmC;AAC1C,QAAMzE,IAAQ,KAAK;AAEjB,MAAAA,IAAS,MACRA,IAAS,MAAuChB,EAAW,KAAK,MAAO,IAAI;AAExE,QAAAmE,EAAe,IAAI,GAAG;AACxB,YAAM5C,IAAO,KAAK;AAClB,MAAIA,MAAS,UACXpB,EAAiBoB,CAAI;AAAA,IACvB;AAAA,QAEJ,CAAWP,IAAS,OACb,KAAA,QAAQA,IAAQ;AAEvB,SAAI0D,MAAc,UAChB7E,EAAK,MAAM6E,CAAS,GAIf,KAAK;AACd;AAEA,SAASgB,KAA8B1C,GAAsB;AAC3D,MAAIA,EAAM,QAAQ;AACZ,QAAA2C,IAAW3C,EAAM,CAAC;AAItB,QAHIR,EAAWmD,CAAQ,MACrBA,IAAWC,EAAID,EAAS,KAAK,KAAK,CAAC,IAEjC,CAAC,KAAK,OAAO,KAAK,OAAOA,CAAQ,GAAG;AACtC,WAAK,QAAQA,GACb,KAAK,QAAQ;AACb,YAAMpE,IAAO,KAAK;AAClB,MAAIA,MAAS,WACXxB,EAAUwB,CAAI,GACTgD,KACGgB,EAAA;AAAA,IAEV;AAAA,EACF,OACK;AACL,UAAMvC,IAAQ,KAAK;AACf,QAAA,KAAK,QAAS,MACZoB,EAAa,MAAMpB,CAAK,GAAG;AAC7B,YAAMzB,IAAO,KAAK;AAClB,MAAIA,MAAS,UACXpB,EAAiBoB,CAAI;AAAA,IACvB;AAGJ,WAAImD,MAAc,UAChB7E,EAAK,MAAM6E,CAAS,GAEf1B;AAAAA,EAAA;AAEX;AAEA,SAASsB,IAA0C;AACjD,MAAIlE,IAAM,KAAK;AACf,SAAOA,MAAQ;AACP,IAAAA,IAAAN,EAAOM,GAAK,IAAI;AAExB,QAAMC,IAAM,KAAK;AACjB,EAAIA,MAAQ,UACVP,EAAOO,CAAG,GAEZ,KAAK,QAAQ,GAET,aAAa,QAAQ,KAAK,WAAW,QACvC,KAAK,QAAQ;AAEjB;AAuCO,SAASwF,GAAM7B,GAAgB;AAClC,IAAAO,GACCP,EAAA,GACE,EAAEO,KAAkBgB,EAAA;AAC3B;AAKO,SAASO,GAAa9C,GAA0B;AACjD,MAAAR,EAAWQ,CAAK,GAAG;AACjB,QAAAsC;AACE,UAAAS,IAAYnB,EAAc,MAAS;AACzC,WAAAU,IAAStC,EAAM,GACf4B,EAAcmB,CAAS,GAChBT;AAAA,EAAA;AAEA,WAAAtC;AAEX;AAKO,SAAS4C,EAAO5C,GAAuB;AACxC,SAAAR,EAAWQ,CAAK,IACVA,EAAkB,IAEnBA;AAEX;AAgBO,SAASwC,GAAOxB,GAA6B;;AAClD,QAAMgC,IAAY;AAAA,IAChB,IAAAhC;AAAA,IACA,MAAM;AAAA,IACN,UAAU;AAAA,IACV,MAAM;AAAA,IACN,UAAU;AAAA,IACV,OAAO;AAAA,EACT;AACA,EAAIU,MAAc,UAChB7E,EAAKmG,GAAGtB,CAAS;AAIb,QAAAW,IAAOT,EAAcoB,CAAC;AACxB,MAAA;AACF,KAAAC,IAAAD,EAAE,YAAF,QAAAC,EAAA,KAAAD;AACM,UAAAV,IAASU,EAAE,GAAG;AACpB,IAAAA,EAAE,UAAUxD,EAAW8C,CAAM,IAAIA,IAAS;AAAA,EAAA,UAC1C;AACA,IAAAV,EAAcS,CAAI;AAAA,EAAA;AAEb,SAAAf,EAAQ,KAAK0B,CAAC;AACvB;AAOgB,SAAAE,GAAKC,GAAmDC,GAA4B;AAC9F,SAAA5D,EAAW2D,CAAI,IACVV,EAAU,KAAK;AAAA,IACpB,OAAO;AAAA,IACP,MAAM;AAAA,IACN,UAAU;AAAA,IACV,MAAM;AAAA,IACN,UAAU;AAAA,IACV,OAAO;AAAA,IACP,QAAQ,WAA0C;AAChD,aAAOG,EAAIO,EAAK,KAAK,IAAI,CAAC;AAAA,IAC5B;AAAA,IACA,SAASC,KAAA,gBAAAA,EAAS,WAAkCrE;AAAA,EAAA,CACrD,IAEM2D,EAAQ,KAAK;AAAA,IAClB,eAAeS;AAAA,IACf,OAAOA;AAAA,IACP,SAASC,KAAA,gBAAAA,EAAS,WAAkCrE;AAAA,IACpD,MAAM;AAAA,IACN,UAAU;AAAA,IACV,OAAO;AAAA,EAAA,CACR;AAEL;","x_google_ignoreList":[0]}