@mochabug/adapt-sdk 0.4.14 → 0.4.16

package/dist/cjs/react.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/react/index.tsx", "../../node_modules/fuse.js/dist/fuse.mjs"],
-  "sourcesContent": ["import React, {\n  useState,\n  useRef,\n  useEffect,\n  useCallback,\n  useMemo\n} from 'react';\nimport Fuse from 'fuse.js';\nimport type {\n  SignalDescriptorJson,\n  SignalFormatJson,\n  ListIncomingSignalsResponseJson,\n  Transmitter_ModeJson\n} from '../api';\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// TYPES\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport interface SignalReference {\n  node: string;\n  nodeLabel: string;\n  nodeDescription?: string;\n  nodeLogoId?: string;\n  nodeIcon?: React.ReactNode;\n  transmitter: string;\n  transmitterDescription?: string;\n  transmitterMode?: Transmitter_ModeJson;\n  signal: SignalDescriptorJson;\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// FORMAT UTILITIES\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport type PrimitiveType =\n  | 'boolean'\n  | 'string'\n  | 'timestamp'\n  | 'float32'\n  | 'float64'\n  | 'int8'\n  | 'uint8'\n  | 'int16'\n  | 'uint16'\n  | 'int32'\n  | 'uint32';\n\nexport function isPrimitiveSchema(schema: Record<string, unknown>): boolean {\n  if (!schema['type']) return false;\n  return (\n    !(\n      Array.isArray(schema['enum']) && (schema['enum'] as unknown[]).length > 0\n    ) &&\n    !schema['elements'] &&\n    !(\n      schema['properties'] &&\n      Object.keys(schema['properties'] as object).length > 0\n    ) &&\n    !(\n      schema['optionalProperties'] &&\n      Object.keys(schema['optionalProperties'] as object).length > 0\n    ) &&\n    !schema['values'] &&\n    !schema['discriminator'] &&\n    !schema['ref']\n  );\n}\n\nexport function isEmptySchema(schema: Record<string, unknown>): boolean {\n  return (\n    !schema['type'] &&\n    !schema['enum'] &&\n    !schema['elements'] &&\n    !schema['properties'] &&\n    !schema['optionalProperties'] &&\n    !schema['values'] &&\n    !schema['discriminator'] &&\n    !schema['ref']\n  );\n}\n\nexport function isArraySchema(schema: Record<string, unknown>): boolean {\n  return schema['elements'] !== undefined;\n}\n\nexport function getSchemaDescription(schema: Record<string, unknown>): string {\n  if (isPrimitiveSchema(schema)) return schema['type'] as string;\n  if (schema['enum'])\n    return `enum (${(schema['enum'] as unknown[]).length} values)`;\n  if (schema['elements']) return 'array';\n  if (schema['properties'] || schema['optionalProperties']) {\n    const propCount =\n      (schema['properties']\n        ? Object.keys(schema['properties'] as object).length\n        : 0) +\n      (schema['optionalProperties']\n        ? Object.keys(schema['optionalProperties'] as object).length\n        : 0);\n    return `object (${propCount} properties)`;\n  }\n  if (schema['values']) return 'map';\n  if (schema['discriminator']) return 'discriminated union';\n  if (schema['ref']) return `ref: ${schema['ref']}`;\n  if (isEmptySchema(schema)) return 'empty schema';\n  return 'complex schema';\n}\n\nexport function getFormatLabel(format: SignalFormatJson): string {\n  if (format.mimeType) return format.mimeType;\n  if (format.jtdSchema) {\n    return getSchemaDescription(format.jtdSchema as Record<string, unknown>);\n  }\n  return 'unknown';\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// SIGNAL SEARCH (Fuse.js)\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport class SignalSearch {\n  private fuse: Fuse<SignalReference>;\n  private data: Readonly<SignalReference[]>;\n\n  constructor(data: SignalReference[]) {\n    this.fuse = new Fuse(data, {\n      includeScore: false,\n      threshold: 0.3,\n      ignoreLocation: true,\n      useExtendedSearch: true,\n      keys: [\n        { name: 'node', weight: 5 },\n        { name: 'nodeLabel', weight: 5 },\n        { name: 'nodeDescription', weight: 2 },\n        { name: 'transmitter', weight: 5 },\n        { name: 'transmitterDescription', weight: 2 },\n        { name: 'signal.name', weight: 5 },\n        { name: 'signal.label', weight: 5 },\n        { name: 'signal.description', weight: 2 }\n      ]\n    });\n    this.data = data;\n  }\n\n  search(query: string): SignalReference[] {\n    if (!query || query.trim().length === 0) {\n      return this.fuse.search('').map((result) => result.item);\n    }\n\n    if (!query.includes('/')) {\n      return this.fuse.search(query).map((result) => result.item);\n    }\n\n    const parts = query.split('/');\n    let searchQuery: any = '';\n\n    if (parts[0] === 'constant' && parts.length === 2) {\n      if (!parts[1]) {\n        searchQuery = { node: '=constant' };\n      } else {\n        searchQuery = {\n          $and: [\n            { node: '=constant' },\n            {\n              $or: [\n                { 'signal.name': parts[1] },\n                { 'signal.label': parts[1] },\n                { 'signal.description': parts[1] }\n              ]\n            }\n          ]\n        };\n      }\n    } else if (parts.length === 2 && parts[1] === '' && parts[0]) {\n      searchQuery = {\n        $or: [\n          { node: parts[0] },\n          { nodeLabel: parts[0] },\n          { nodeDescription: parts[0] }\n        ]\n      };\n    } else if (parts.length === 2 && parts[0] && parts[1]) {\n      searchQuery = {\n        $and: [\n          {\n            $or: [\n              { node: parts[0] },\n              { nodeLabel: parts[0] },\n              { nodeDescription: parts[0] }\n            ]\n          },\n          {\n            $or: [\n              { transmitter: parts[1] },\n              { transmitterDescription: parts[1] }\n            ]\n          }\n        ]\n      };\n    } else if (parts.length === 3 && parts[2] === '' && parts[0] && parts[1]) {\n      searchQuery = {\n        $and: [\n          {\n            $or: [\n              { node: parts[0] },\n              { nodeLabel: parts[0] },\n              { nodeDescription: parts[0] }\n            ]\n          },\n          {\n            $or: [\n              { transmitter: parts[1] },\n              { transmitterDescription: parts[1] }\n            ]\n          }\n        ]\n      };\n    } else if (parts.length >= 3 && parts[0] && parts[1] && parts[2]) {\n      searchQuery = {\n        $and: [\n          {\n            $or: [\n              { node: parts[0] },\n              { nodeLabel: parts[0] },\n              { nodeDescription: parts[0] }\n            ]\n          },\n          {\n            $or: [\n              { transmitter: parts[1] },\n              { transmitterDescription: parts[1] }\n            ]\n          },\n          {\n            $or: [\n              { 'signal.name': parts[2] },\n              { 'signal.label': parts[2] },\n              { 'signal.description': parts[2] }\n            ]\n          }\n        ]\n      };\n    }\n    return this.fuse.search(searchQuery).map((result) => result.item);\n  }\n\n  allSignals(): Readonly<SignalReference[]> {\n    return this.data;\n  }\n}\n\nexport function createSignalFilter(\n  search: SignalSearch\n): (options: SignalReference[], inputValue: string) => SignalReference[] {\n  return (options, inputValue) => {\n    if (!inputValue || inputValue.length < 2) return options;\n    const results = search.search(inputValue);\n    return results.sort((a, b) => {\n      const keyA = `${a.node}/${a.transmitter}`;\n      const keyB = `${b.node}/${b.transmitter}`;\n      return keyA.localeCompare(keyB);\n    });\n  };\n}\n\nexport function flattenSignals(\n  data: ListIncomingSignalsResponseJson\n): SignalReference[] {\n  const refs: SignalReference[] = [];\n  for (const vertex of data.vertices ?? []) {\n    for (const tx of vertex.transmitters ?? []) {\n      for (const sig of tx.signals ?? []) {\n        refs.push({\n          node: vertex.id ?? '',\n          nodeLabel: vertex.label ?? vertex.id ?? '',\n          nodeDescription: vertex.description,\n          nodeLogoId: vertex.logoId,\n          transmitter: tx.name ?? '',\n          transmitterDescription: tx.description,\n          transmitterMode: tx.mode,\n          signal: sig\n        });\n      }\n    }\n  }\n  for (const sig of data.constants ?? []) {\n    refs.push({\n      node: 'constant',\n      nodeLabel: 'Constants',\n      transmitter: '',\n      signal: sig\n    });\n  }\n  return refs;\n}\n\nexport function signalReferenceKey(ref: SignalReference): string {\n  if (ref.node === 'constant') {\n    return `constant/${ref.signal.name}`;\n  }\n  return `${ref.node}/${ref.transmitter}/${ref.signal.name}`;\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// ICONS\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nfunction ConstantIcon() {\n  return (\n    <svg\n      width=\"20\"\n      height=\"20\"\n      viewBox=\"0 0 24 24\"\n      xmlns=\"http://www.w3.org/2000/svg\"\n      fill=\"currentColor\"\n    >\n      <path d=\"M4,7v2c0,0.55-0.45,1-1,1H2v4h1c0.55,0,1,0.45,1,1v2c0,1.65,1.35,3,3,3h3v-2H7c-0.55,0-1-0.45-1-1v-2 c0-1.3-0.84-2.42-2-2.83v-0.34C5.16,11.42,6,10.3,6,9V7c0-0.55,0.45-1,1-1h3V4H7C5.35,4,4,5.35,4,7z\" />\n      <path d=\"M21,10c-0.55,0-1-0.45-1-1V7c0-1.65-1.35-3-3-3h-3v2h3c0.55,0,1,0.45,1,1v2c0,1.3,0.84,2.42,2,2.83v0.34 c-1.16,0.41-2,1.52-2,2.83v2c0,0.55-0.45,1-1,1h-3v2h3c1.65,0,3-1.35,3-3v-2c0-0.55,0.45-1,1-1h1v-4H21z\" />\n    </svg>\n  );\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// REACT COMPONENTS (pure React, no MUI)\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport function SignalGroupHeader(props: {\n  group: string;\n  references: Readonly<SignalReference[]>;\n  className?: string;\n}) {\n  const isConstantGroup = props.group === 'constant';\n\n  if (isConstantGroup) {\n    return (\n      <div\n        className={`adapt-signal-group-header adapt-signal-group-header--constant ${props.className ?? ''}`.trim()}\n      >\n        <span className=\"adapt-signal-group-icon adapt-signal-group-icon--constant\">\n          <ConstantIcon />\n        </span>\n        <span className=\"adapt-signal-group-node-label adapt-signal-group-node-label--constant\">\n          Constants\n        </span>\n      </div>\n    );\n  }\n\n  const [nodeId, transmitter] = props.group.split('/');\n  const firstOption = props.references.find(\n    (ref) => `${ref.node}/${ref.transmitter}` === props.group\n  );\n\n  if (!firstOption) return null;\n\n  const mode = firstOption.transmitterMode;\n  const modeClass =\n    mode === 'MODE_FAILURE'\n      ? 'adapt-signal-group-transmitter--failure'\n      : mode === 'MODE_STREAM'\n        ? 'adapt-signal-group-transmitter--stream'\n        : 'adapt-signal-group-transmitter--standard';\n\n  return (\n    <div\n      className={`adapt-signal-group-header ${props.className ?? ''}`.trim()}\n    >\n      {firstOption.nodeIcon && (\n        <span className=\"adapt-signal-group-icon\">{firstOption.nodeIcon}</span>\n      )}\n      <span className=\"adapt-signal-group-node-label\">\n        {firstOption.nodeLabel || nodeId}\n      </span>\n      <span className=\"adapt-signal-group-node-id\">({nodeId})</span>\n      <span className=\"adapt-signal-group-separator\" />\n      <span className={`adapt-signal-group-transmitter ${modeClass}`}>\n        {transmitter}\n      </span>\n    </div>\n  );\n}\n\nexport function SignalOption(props: {\n  reference: SignalReference;\n  className?: string;\n}) {\n  const { reference } = props;\n  return (\n    <div className={`adapt-signal-option ${props.className ?? ''}`.trim()}>\n      <div className=\"adapt-signal-option-label\">\n        <span className=\"adapt-signal-option-name\">\n          {reference.signal.label || reference.signal.name}\n        </span>\n        {reference.signal.label && (\n          <span className=\"adapt-signal-option-code\">\n            ({reference.signal.name})\n          </span>\n        )}\n        {reference.signal.optional && (\n          <span className=\"adapt-signal-option-optional\">Optional</span>\n        )}\n      </div>\n      {reference.signal.formats && (\n        <FormatViewer formats={reference.signal.formats} />\n      )}\n    </div>\n  );\n}\n\nexport function FormatChip(props: {\n  format: SignalFormatJson;\n  size?: 'small' | 'medium';\n  onDelete?: () => void;\n  onClick?: () => void;\n  className?: string;\n}) {\n  const { format, size = 'small', onDelete, onClick } = props;\n  const label = getFormatLabel(format);\n\n  let variant: 'mime' | 'primitive' | 'complex' = 'primitive';\n  if (format.mimeType) {\n    variant = 'mime';\n  } else if (\n    format.jtdSchema &&\n    !isPrimitiveSchema(format.jtdSchema as Record<string, unknown>)\n  ) {\n    variant = 'complex';\n  }\n\n  const isClickable = variant === 'mime' || variant === 'complex';\n  const sizeClass = size === 'medium' ? 'adapt-signal-format-chip--medium' : '';\n\n  return (\n    <span\n      className={`adapt-signal-format-chip adapt-signal-format-chip--${variant} ${sizeClass} ${props.className ?? ''}`.trim()}\n      onClick={\n        onClick && isClickable\n          ? (e: React.MouseEvent) => {\n              e.stopPropagation();\n              onClick();\n            }\n          : undefined\n      }\n    >\n      {label}\n      {onDelete && (\n        <span\n          className=\"adapt-signal-format-chip-delete\"\n          onClick={(e: React.MouseEvent) => {\n            e.stopPropagation();\n            onDelete();\n          }}\n        >\n          \u00D7\n        </span>\n      )}\n    </span>\n  );\n}\n\nexport function FormatViewer(props: {\n  formats: SignalFormatJson[];\n  maxVisible?: number;\n  size?: 'small' | 'medium';\n  onViewSchema?: (schema: Record<string, unknown>) => void;\n  className?: string;\n}) {\n  const { formats, maxVisible = 3, onViewSchema } = props;\n\n  if (formats.length === 0) {\n    return (\n      <span\n        className={`adapt-signal-format-viewer ${props.className ?? ''}`.trim()}\n      >\n        No formats defined\n      </span>\n    );\n  }\n\n  const chips: React.ReactElement[] = [];\n  let totalChips = 0;\n\n  for (let i = 0; i < formats.length; i++) {\n    const format = formats[i];\n    if (!format) continue;\n    if (!format.mimeType && !format.jtdSchema) continue;\n\n    totalChips++;\n    if (chips.length < maxVisible) {\n      chips.push(\n        <FormatChip\n          key={`fmt-${i}`}\n          format={format}\n          onClick={\n            onViewSchema &&\n            format.jtdSchema &&\n            !isPrimitiveSchema(format.jtdSchema as Record<string, unknown>)\n              ? () => onViewSchema(format.jtdSchema as Record<string, unknown>)\n              : undefined\n          }\n        />\n      );\n    }\n  }\n\n  const remaining = totalChips - chips.length;\n\n  return (\n    <div\n      className={`adapt-signal-format-viewer ${props.className ?? ''}`.trim()}\n    >\n      {chips}\n      {remaining > 0 && (\n        <span className=\"adapt-signal-format-overflow\">+{remaining}</span>\n      )}\n    </div>\n  );\n}\n\nexport interface SignalSelectorProps {\n  currentReference: SignalReference | undefined;\n  inputValue: string;\n  availableReferences: Readonly<SignalReference[]>;\n  filterOptions: (\n    options: SignalReference[],\n    inputValue: string\n  ) => SignalReference[];\n  disabled?: boolean;\n  hasError: boolean;\n  errorMessage?: string;\n  placeholder?: string;\n  className?: string;\n  theme?: 'light' | 'dark' | 'auto';\n  onInputChange: (value: string) => void;\n  onReferenceChange: (value: string | null) => void;\n}\n\nexport function SignalSelector({\n  currentReference,\n  inputValue,\n  availableReferences,\n  filterOptions,\n  disabled,\n  hasError,\n  errorMessage,\n  placeholder = 'Search signals...',\n  className,\n  theme = 'auto',\n  onInputChange,\n  onReferenceChange\n}: SignalSelectorProps) {\n  const [isOpen, setIsOpen] = useState(false);\n  const [highlightedIndex, setHighlightedIndex] = useState(-1);\n  const containerRef = useRef<HTMLDivElement>(null);\n  const inputRef = useRef<HTMLInputElement>(null);\n  const listRef = useRef<HTMLDivElement>(null);\n\n  const handleClear = useCallback(() => {\n    onReferenceChange(null);\n    onInputChange('');\n    setIsOpen(true);\n    setHighlightedIndex(0);\n    setTimeout(() => inputRef.current?.focus(), 0);\n  }, [onReferenceChange, onInputChange]);\n\n  const filtered = useMemo(() => {\n    const refs = [...availableReferences];\n    return filterOptions(refs, inputValue);\n  }, [availableReferences, inputValue, filterOptions]);\n\n  const groups = useMemo(() => {\n    const map = new Map<string, SignalReference[]>();\n    for (const ref of filtered) {\n      const key =\n        ref.node === 'constant' ? 'constant' : `${ref.node}/${ref.transmitter}`;\n      const arr = map.get(key);\n      if (arr) arr.push(ref);\n      else map.set(key, [ref]);\n    }\n    return map;\n  }, [filtered]);\n\n  const flatItems = useMemo(() => {\n    const items: SignalReference[] = [];\n    for (const refs of groups.values()) {\n      items.push(...refs);\n    }\n    return items;\n  }, [groups]);\n\n  useEffect(() => {\n    function handleClickOutside(e: MouseEvent) {\n      if (\n        containerRef.current &&\n        !containerRef.current.contains(e.target as Node)\n      ) {\n        setIsOpen(false);\n      }\n    }\n    document.addEventListener('mousedown', handleClickOutside);\n    return () => document.removeEventListener('mousedown', handleClickOutside);\n  }, []);\n\n  const handleSelect = useCallback(\n    (ref: SignalReference) => {\n      onReferenceChange(signalReferenceKey(ref));\n      onInputChange(signalReferenceKey(ref));\n      setIsOpen(false);\n    },\n    [onReferenceChange, onInputChange]\n  );\n\n  const handleKeyDown = useCallback(\n    (e: React.KeyboardEvent) => {\n      if (currentReference) {\n        if (e.key === 'Backspace' || e.key === 'Delete') {\n          e.preventDefault();\n          handleClear();\n          return;\n        }\n        if (e.key === 'ArrowDown' || e.key === 'ArrowUp' || e.key === 'Enter') {\n          e.preventDefault();\n          onReferenceChange(null);\n          onInputChange('');\n          setIsOpen(true);\n          setHighlightedIndex(0);\n          setTimeout(() => inputRef.current?.focus(), 0);\n          return;\n        }\n        if (e.key.length === 1 && !e.ctrlKey && !e.metaKey) {\n          e.preventDefault();\n          onReferenceChange(null);\n          onInputChange(e.key);\n          setIsOpen(true);\n          setHighlightedIndex(0);\n          setTimeout(() => inputRef.current?.focus(), 0);\n          return;\n        }\n        return;\n      }\n      if (e.key === 'ArrowDown') {\n        e.preventDefault();\n        if (!isOpen) {\n          setIsOpen(true);\n          setHighlightedIndex(0);\n        } else {\n          setHighlightedIndex((prev) =>\n            Math.min(prev + 1, flatItems.length - 1)\n          );\n        }\n      } else if (e.key === 'ArrowUp') {\n        e.preventDefault();\n        setHighlightedIndex((prev) => Math.max(prev - 1, 0));\n      } else if (e.key === 'Enter') {\n        e.preventDefault();\n        if (isOpen && highlightedIndex >= 0 && flatItems[highlightedIndex]) {\n          handleSelect(flatItems[highlightedIndex]!);\n        }\n      } else if (e.key === 'Escape') {\n        setIsOpen(false);\n        ('');\n      }\n    },\n    [\n      currentReference,\n      handleClear,\n      onReferenceChange,\n      onInputChange,\n      isOpen,\n      highlightedIndex,\n      flatItems,\n      handleSelect\n    ]\n  );\n\n  useEffect(() => {\n    if (listRef.current && highlightedIndex >= 0) {\n      const items = listRef.current.querySelectorAll('[data-signal-option]');\n      items[highlightedIndex]?.scrollIntoView({ block: 'nearest' });\n    }\n  }, [highlightedIndex]);\n\n  const dropdownElements: React.ReactElement[] = [];\n  let optionIndex = 0;\n\n  for (const [groupKey, groupRefs] of groups) {\n    dropdownElements.push(\n      <SignalGroupHeader\n        key={`group-${groupKey}`}\n        group={groupKey}\n        references={filtered}\n      />\n    );\n    for (const ref of groupRefs) {\n      const idx = optionIndex++;\n      const isHighlighted = idx === highlightedIndex;\n      dropdownElements.push(\n        <div\n          key={signalReferenceKey(ref)}\n          data-signal-option\n          className={`adapt-signal-selector-option ${isHighlighted ? 'adapt-signal-selector-option--highlighted' : ''}`}\n          onMouseDown={(e) => {\n            e.preventDefault();\n            handleSelect(ref);\n          }}\n          onMouseEnter={() => setHighlightedIndex(idx)}\n        >\n          <SignalOption reference={ref} />\n        </div>\n      );\n    }\n  }\n\n  const rootClasses = [\n    'adapt-signal-selector',\n    hasError && 'adapt-signal-selector--error',\n    className\n  ]\n    .filter(Boolean)\n    .join(' ');\n\n  const isConstantSelected = currentReference?.node === 'constant';\n  const modeClass = currentReference\n    ? isConstantSelected\n      ? 'adapt-signal-selector-selected-dot--constant'\n      : currentReference.transmitterMode === 'MODE_FAILURE'\n        ? 'adapt-signal-selector-selected-dot--failure'\n        : currentReference.transmitterMode === 'MODE_STREAM'\n          ? 'adapt-signal-selector-selected-dot--stream'\n          : 'adapt-signal-selector-selected-dot--standard'\n    : '';\n\n  return (\n    <div\n      ref={containerRef}\n      className={rootClasses}\n      data-adapt-theme={theme === 'auto' ? undefined : theme}\n    >\n      {currentReference && !disabled && (\n        <div className=\"adapt-signal-selector-selected\" onClick={handleClear}>\n          {isConstantSelected ? (\n            <span className=\"adapt-signal-selector-selected-icon adapt-signal-selector-selected-icon--constant\">\n              <ConstantIcon />\n            </span>\n          ) : (\n            <>\n              <span className={`adapt-signal-selector-selected-dot ${modeClass}`} />\n              {currentReference.nodeIcon && (\n                <span className=\"adapt-signal-selector-selected-icon\">\n                  {currentReference.nodeIcon}\n                </span>\n              )}\n            </>\n          )}\n          <span className=\"adapt-signal-selector-selected-node\">\n            {currentReference.nodeLabel || currentReference.node}\n          </span>\n          <span className=\"adapt-signal-selector-selected-sep\">\u203A</span>\n          <span className=\"adapt-signal-selector-selected-signal\">\n            {currentReference.signal.label || currentReference.signal.name}\n          </span>\n          <span\n            className=\"adapt-signal-selector-selected-clear\"\n            onClick={(e) => {\n              e.stopPropagation();\n              handleClear();\n            }}\n          >\n            \u00D7\n          </span>\n        </div>\n      )}\n      {currentReference && disabled && (\n        <div className=\"adapt-signal-selector-selected adapt-signal-selector-selected--disabled\">\n          {isConstantSelected ? (\n            <span className=\"adapt-signal-selector-selected-icon adapt-signal-selector-selected-icon--constant\">\n              <ConstantIcon />\n            </span>\n          ) : (\n            <>\n              <span className={`adapt-signal-selector-selected-dot ${modeClass}`} />\n              {currentReference.nodeIcon && (\n                <span className=\"adapt-signal-selector-selected-icon\">\n                  {currentReference.nodeIcon}\n                </span>\n              )}\n            </>\n          )}\n          <span className=\"adapt-signal-selector-selected-node\">\n            {currentReference.nodeLabel || currentReference.node}\n          </span>\n          <span className=\"adapt-signal-selector-selected-sep\">\u203A</span>\n          <span className=\"adapt-signal-selector-selected-signal\">\n            {currentReference.signal.label || currentReference.signal.name}\n          </span>\n        </div>\n      )}\n      <input\n        ref={inputRef}\n        type=\"text\"\n        className={`adapt-signal-selector-input${currentReference ? ' adapt-signal-selector-input--hidden' : ''}`}\n        value={inputValue}\n        placeholder={placeholder}\n        disabled={disabled}\n        onChange={(e) => {\n          onInputChange(e.target.value);\n          setIsOpen(true);\n          setHighlightedIndex(0);\n          if (!e.target.value) onReferenceChange(null);\n        }}\n        onFocus={() => {\n          if (!currentReference) setIsOpen(true);\n        }}\n        onKeyDown={handleKeyDown}\n      />\n      {errorMessage && (\n        <span className=\"adapt-signal-selector-error\">{errorMessage}</span>\n      )}\n      {isOpen && !disabled && (\n        <div ref={listRef} className=\"adapt-signal-selector-dropdown\">\n          {flatItems.length > 0 ? (\n            dropdownElements\n          ) : (\n            <div className=\"adapt-signal-selector-no-results\">\n              No signals found\n            </div>\n          )}\n        </div>\n      )}\n    </div>\n  );\n}\n", "/**\n * Fuse.js v7.2.0 - Lightweight fuzzy-search (http://fusejs.io)\n *\n * Copyright (c) 2026 Kiro Risk (http://kiro.me)\n * All Rights Reserved. Apache Software License 2.0\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n */\n\nfunction isArray(value) {\n  return !Array.isArray\n    ? getTag(value) === '[object Array]'\n    : Array.isArray(value)\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/baseToString.js\nconst INFINITY = 1 / 0;\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value\n  }\n  let result = value + '';\n  return result == '0' && 1 / value == -INFINITY ? '-0' : result\n}\n\nfunction toString(value) {\n  return value == null ? '' : baseToString(value)\n}\n\nfunction isString(value) {\n  return typeof value === 'string'\n}\n\nfunction isNumber(value) {\n  return typeof value === 'number'\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js\nfunction isBoolean(value) {\n  return (\n    value === true ||\n    value === false ||\n    (isObjectLike(value) && getTag(value) == '[object Boolean]')\n  )\n}\n\nfunction isObject(value) {\n  return typeof value === 'object'\n}\n\n// Checks if `value` is object-like.\nfunction isObjectLike(value) {\n  return isObject(value) && value !== null\n}\n\nfunction isDefined(value) {\n  return value !== undefined && value !== null\n}\n\nfunction isBlank(value) {\n  return !value.trim().length\n}\n\n// Gets the `toStringTag` of `value`.\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js\nfunction getTag(value) {\n  return value == null\n    ? value === undefined\n      ? '[object Undefined]'\n      : '[object Null]'\n    : Object.prototype.toString.call(value)\n}\n\nconst EXTENDED_SEARCH_UNAVAILABLE = 'Extended search is not available';\n\nconst INCORRECT_INDEX_TYPE = \"Incorrect 'index' type\";\n\nconst LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = (key) =>\n  `Invalid value for key ${key}`;\n\nconst PATTERN_LENGTH_TOO_LARGE = (max) =>\n  `Pattern length exceeds max of ${max}.`;\n\nconst MISSING_KEY_PROPERTY = (name) => `Missing ${name} property in key`;\n\nconst INVALID_KEY_WEIGHT_VALUE = (key) =>\n  `Property 'weight' in key '${key}' must be a positive integer`;\n\nconst hasOwn = Object.prototype.hasOwnProperty;\n\nclass KeyStore {\n  constructor(keys) {\n    this._keys = [];\n    this._keyMap = {};\n\n    let totalWeight = 0;\n\n    keys.forEach((key) => {\n      let obj = createKey(key);\n\n      this._keys.push(obj);\n      this._keyMap[obj.id] = obj;\n\n      totalWeight += obj.weight;\n    });\n\n    // Normalize weights so that their sum is equal to 1\n    this._keys.forEach((key) => {\n      key.weight /= totalWeight;\n    });\n  }\n  get(keyId) {\n    return this._keyMap[keyId]\n  }\n  keys() {\n    return this._keys\n  }\n  toJSON() {\n    return JSON.stringify(this._keys)\n  }\n}\n\nfunction createKey(key) {\n  let path = null;\n  let id = null;\n  let src = null;\n  let weight = 1;\n  let getFn = null;\n\n  if (isString(key) || isArray(key)) {\n    src = key;\n    path = createKeyPath(key);\n    id = createKeyId(key);\n  } else {\n    if (!hasOwn.call(key, 'name')) {\n      throw new Error(MISSING_KEY_PROPERTY('name'))\n    }\n\n    const name = key.name;\n    src = name;\n\n    if (hasOwn.call(key, 'weight')) {\n      weight = key.weight;\n\n      if (weight <= 0) {\n        throw new Error(INVALID_KEY_WEIGHT_VALUE(name))\n      }\n    }\n\n    path = createKeyPath(name);\n    id = createKeyId(name);\n    getFn = key.getFn;\n  }\n\n  return { path, id, weight, src, getFn }\n}\n\nfunction createKeyPath(key) {\n  return isArray(key) ? key : key.split('.')\n}\n\nfunction createKeyId(key) {\n  return isArray(key) ? key.join('.') : key\n}\n\nfunction get(obj, path) {\n  let list = [];\n  let arr = false;\n\n  const deepGet = (obj, path, index, arrayIndex) => {\n    if (!isDefined(obj)) {\n      return\n    }\n    if (!path[index]) {\n      // If there's no path left, we've arrived at the object we care about.\n      list.push(arrayIndex !== undefined ? { v: obj, i: arrayIndex } : obj);\n    } else {\n      let key = path[index];\n\n      const value = obj[key];\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      // If we're at the last value in the path, and if it's a string/number/bool,\n      // add it to the list\n      if (\n        index === path.length - 1 &&\n        (isString(value) || isNumber(value) || isBoolean(value))\n      ) {\n        list.push(\n          arrayIndex !== undefined\n            ? { v: toString(value), i: arrayIndex }\n            : toString(value)\n        );\n      } else if (isArray(value)) {\n        arr = true;\n        // Search each item in the array.\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          deepGet(value[i], path, index + 1, i);\n        }\n      } else if (path.length) {\n        // An object. Recurse further.\n        deepGet(value, path, index + 1, arrayIndex);\n      }\n    }\n  };\n\n  // Backwards compatibility (since path used to be a string)\n  deepGet(obj, isString(path) ? path.split('.') : path, 0);\n\n  return arr ? list : list[0]\n}\n\nconst MatchOptions = {\n  // Whether the matches should be included in the result set. When `true`, each record in the result\n  // set will include the indices of the matched characters.\n  // These can consequently be used for highlighting purposes.\n  includeMatches: false,\n  // When `true`, the matching function will continue to the end of a search pattern even if\n  // a perfect match has already been located in the string.\n  findAllMatches: false,\n  // Minimum number of characters that must be matched before a result is considered a match\n  minMatchCharLength: 1\n};\n\nconst BasicOptions = {\n  // When `true`, the algorithm continues searching to the end of the input even if a perfect\n  // match is found before the end of the same input.\n  isCaseSensitive: false,\n  // When `true`, the algorithm will ignore diacritics (accents) in comparisons\n  ignoreDiacritics: false,\n  // When true, the matching function will continue to the end of a search pattern even if\n  includeScore: false,\n  // List of properties that will be searched. This also supports nested properties.\n  keys: [],\n  // Whether to sort the result list, by score\n  shouldSort: true,\n  // Default sort function: sort by ascending score, ascending index\n  sortFn: (a, b) =>\n    a.score === b.score ? (a.idx < b.idx ? -1 : 1) : a.score < b.score ? -1 : 1\n};\n\nconst FuzzyOptions = {\n  // Approximately where in the text is the pattern expected to be found?\n  location: 0,\n  // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match\n  // (of both letters and location), a threshold of '1.0' would match anything.\n  threshold: 0.6,\n  // Determines how close the match must be to the fuzzy location (specified above).\n  // An exact letter match which is 'distance' characters away from the fuzzy location\n  // would score as a complete mismatch. A distance of '0' requires the match be at\n  // the exact location specified, a threshold of '1000' would require a perfect match\n  // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.\n  distance: 100\n};\n\nconst AdvancedOptions = {\n  // When `true`, it enables the use of unix-like search commands\n  useExtendedSearch: false,\n  // The get function to use when fetching an object's properties.\n  // The default will search nested paths *ie foo.bar.baz*\n  getFn: get,\n  // When `true`, search will ignore `location` and `distance`, so it won't matter\n  // where in the string the pattern appears.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score\n  ignoreLocation: false,\n  // When `true`, the calculation for the relevance score (used for sorting) will\n  // ignore the field-length norm.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm\n  ignoreFieldNorm: false,\n  // The weight to determine how much field length norm effects scoring.\n  fieldNormWeight: 1\n};\n\nvar Config = {\n  ...BasicOptions,\n  ...MatchOptions,\n  ...FuzzyOptions,\n  ...AdvancedOptions\n};\n\nconst SPACE = /[^ ]+/g;\n\n// Field-length norm: the shorter the field, the higher the weight.\n// Set to 3 decimals to reduce index size.\nfunction norm(weight = 1, mantissa = 3) {\n  const cache = new Map();\n  const m = Math.pow(10, mantissa);\n\n  return {\n    get(value) {\n      const numTokens = value.match(SPACE).length;\n\n      if (cache.has(numTokens)) {\n        return cache.get(numTokens)\n      }\n\n      // Default function is 1/sqrt(x), weight makes that variable\n      const norm = 1 / Math.pow(numTokens, 0.5 * weight);\n\n      // In place of `toFixed(mantissa)`, for faster computation\n      const n = parseFloat(Math.round(norm * m) / m);\n\n      cache.set(numTokens, n);\n\n      return n\n    },\n    clear() {\n      cache.clear();\n    }\n  }\n}\n\nclass FuseIndex {\n  constructor({\n    getFn = Config.getFn,\n    fieldNormWeight = Config.fieldNormWeight\n  } = {}) {\n    this.norm = norm(fieldNormWeight, 3);\n    this.getFn = getFn;\n    this.isCreated = false;\n\n    this.setIndexRecords();\n  }\n  setSources(docs = []) {\n    this.docs = docs;\n  }\n  setIndexRecords(records = []) {\n    this.records = records;\n  }\n  setKeys(keys = []) {\n    this.keys = keys;\n    this._keysMap = {};\n    keys.forEach((key, idx) => {\n      this._keysMap[key.id] = idx;\n    });\n  }\n  create() {\n    if (this.isCreated || !this.docs.length) {\n      return\n    }\n\n    this.isCreated = true;\n\n    // List is Array<String>\n    if (isString(this.docs[0])) {\n      this.docs.forEach((doc, docIndex) => {\n        this._addString(doc, docIndex);\n      });\n    } else {\n      // List is Array<Object>\n      this.docs.forEach((doc, docIndex) => {\n        this._addObject(doc, docIndex);\n      });\n    }\n\n    this.norm.clear();\n  }\n  // Adds a doc to the end of the index\n  add(doc) {\n    const idx = this.size();\n\n    if (isString(doc)) {\n      this._addString(doc, idx);\n    } else {\n      this._addObject(doc, idx);\n    }\n  }\n  // Removes the doc at the specified index of the index\n  removeAt(idx) {\n    this.records.splice(idx, 1);\n\n    // Change ref index of every subsquent doc\n    for (let i = idx, len = this.size(); i < len; i += 1) {\n      this.records[i].i -= 1;\n    }\n  }\n  // Removes docs at the specified indices (must be sorted ascending)\n  removeAll(indices) {\n    // Remove in reverse order to avoid index shifting during splice\n    for (let i = indices.length - 1; i >= 0; i -= 1) {\n      this.records.splice(indices[i], 1);\n    }\n    // Single re-index pass\n    for (let i = 0, len = this.records.length; i < len; i += 1) {\n      this.records[i].i = i;\n    }\n  }\n  getValueForItemAtKeyId(item, keyId) {\n    return item[this._keysMap[keyId]]\n  }\n  size() {\n    return this.records.length\n  }\n  _addString(doc, docIndex) {\n    if (!isDefined(doc) || isBlank(doc)) {\n      return\n    }\n\n    let record = {\n      v: doc,\n      i: docIndex,\n      n: this.norm.get(doc)\n    };\n\n    this.records.push(record);\n  }\n  _addObject(doc, docIndex) {\n    let record = { i: docIndex, $: {} };\n\n    // Iterate over every key (i.e, path), and fetch the value at that key\n    this.keys.forEach((key, keyIndex) => {\n      let value = key.getFn ? key.getFn(doc) : this.getFn(doc, key.path);\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      if (isArray(value)) {\n        let subRecords = [];\n\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          const item = value[i];\n\n          if (!isDefined(item)) {\n            continue\n          }\n\n          if (isString(item)) {\n            // Custom getFn returning plain string array (backward compat)\n            if (!isBlank(item)) {\n              let subRecord = {\n                v: item,\n                i: i,\n                n: this.norm.get(item)\n              };\n\n              subRecords.push(subRecord);\n            }\n          } else if (isString(item.v) && !isBlank(item.v)) {\n            // Default get() returns {v, i} objects with original array indices\n            let subRecord = {\n              v: item.v,\n              i: item.i,\n              n: this.norm.get(item.v)\n            };\n\n            subRecords.push(subRecord);\n          }\n        }\n        record.$[keyIndex] = subRecords;\n      } else if (isString(value) && !isBlank(value)) {\n        let subRecord = {\n          v: value,\n          n: this.norm.get(value)\n        };\n\n        record.$[keyIndex] = subRecord;\n      }\n    });\n\n    this.records.push(record);\n  }\n  toJSON() {\n    return {\n      keys: this.keys,\n      records: this.records\n    }\n  }\n}\n\nfunction createIndex(\n  keys,\n  docs,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys.map(createKey));\n  myIndex.setSources(docs);\n  myIndex.create();\n  return myIndex\n}\n\nfunction parseIndex(\n  data,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const { keys, records } = data;\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys);\n  myIndex.setIndexRecords(records);\n  return myIndex\n}\n\nfunction convertMaskToIndices(\n  matchmask = [],\n  minMatchCharLength = Config.minMatchCharLength\n) {\n  let indices = [];\n  let start = -1;\n  let end = -1;\n  let i = 0;\n\n  for (let len = matchmask.length; i < len; i += 1) {\n    let match = matchmask[i];\n    if (match && start === -1) {\n      start = i;\n    } else if (!match && start !== -1) {\n      end = i - 1;\n      if (end - start + 1 >= minMatchCharLength) {\n        indices.push([start, end]);\n      }\n      start = -1;\n    }\n  }\n\n  // (i-1 - start) + 1 => i - start\n  if (matchmask[i - 1] && i - start >= minMatchCharLength) {\n    indices.push([start, i - 1]);\n  }\n\n  return indices\n}\n\n// Machine word size\nconst MAX_BITS = 32;\n\nfunction search(\n  text,\n  pattern,\n  patternAlphabet,\n  {\n    location = Config.location,\n    distance = Config.distance,\n    threshold = Config.threshold,\n    findAllMatches = Config.findAllMatches,\n    minMatchCharLength = Config.minMatchCharLength,\n    includeMatches = Config.includeMatches,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  if (pattern.length > MAX_BITS) {\n    throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS))\n  }\n\n  const patternLen = pattern.length;\n  // Set starting location at beginning text and initialize the alphabet.\n  const textLen = text.length;\n  // Handle the case when location > text.length\n  const expectedLocation = Math.max(0, Math.min(location, textLen));\n  // Highest score beyond which we give up.\n  let currentThreshold = threshold;\n  // Is there a nearby exact match? (speedup)\n  let bestLocation = expectedLocation;\n\n  // Inlined score computation \u2014 avoids object allocation per call in hot loops.\n  // See ./computeScore.js for the documented version of this formula.\n  const calcScore = (errors, currentLocation) => {\n    const accuracy = errors / patternLen;\n    if (ignoreLocation) return accuracy\n    const proximity = Math.abs(expectedLocation - currentLocation);\n    if (!distance) return proximity ? 1.0 : accuracy\n    return accuracy + proximity / distance\n  };\n\n  // Performance: only computer matches when the minMatchCharLength > 1\n  // OR if `includeMatches` is true.\n  const computeMatches = minMatchCharLength > 1 || includeMatches;\n  // A mask of the matches, used for building the indices\n  const matchMask = computeMatches ? Array(textLen) : [];\n\n  let index;\n\n  // Get all exact matches, here for speed up\n  while ((index = text.indexOf(pattern, bestLocation)) > -1) {\n    let score = calcScore(0, index);\n\n    currentThreshold = Math.min(score, currentThreshold);\n    bestLocation = index + patternLen;\n\n    if (computeMatches) {\n      let i = 0;\n      while (i < patternLen) {\n        matchMask[index + i] = 1;\n        i += 1;\n      }\n    }\n  }\n\n  // Reset the best location\n  bestLocation = -1;\n\n  let lastBitArr = [];\n  let finalScore = 1;\n  let binMax = patternLen + textLen;\n\n  const mask = 1 << (patternLen - 1);\n\n  for (let i = 0; i < patternLen; i += 1) {\n    // Scan for the best match; each iteration allows for one more error.\n    // Run a binary search to determine how far from the match location we can stray\n    // at this error level.\n    let binMin = 0;\n    let binMid = binMax;\n\n    while (binMin < binMid) {\n      const score = calcScore(i, expectedLocation + binMid);\n\n      if (score <= currentThreshold) {\n        binMin = binMid;\n      } else {\n        binMax = binMid;\n      }\n\n      binMid = Math.floor((binMax - binMin) / 2 + binMin);\n    }\n\n    // Use the result from this iteration as the maximum for the next.\n    binMax = binMid;\n\n    let start = Math.max(1, expectedLocation - binMid + 1);\n    let finish = findAllMatches\n      ? textLen\n      : Math.min(expectedLocation + binMid, textLen) + patternLen;\n\n    // Initialize the bit array\n    let bitArr = Array(finish + 2);\n\n    bitArr[finish + 1] = (1 << i) - 1;\n\n    for (let j = finish; j >= start; j -= 1) {\n      let currentLocation = j - 1;\n      let charMatch = patternAlphabet[text[currentLocation]];\n\n      if (computeMatches) {\n        // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`)\n        matchMask[currentLocation] = +!!charMatch;\n      }\n\n      // First pass: exact match\n      bitArr[j] = ((bitArr[j + 1] << 1) | 1) & charMatch;\n\n      // Subsequent passes: fuzzy match\n      if (i) {\n        bitArr[j] |=\n          ((lastBitArr[j + 1] | lastBitArr[j]) << 1) | 1 | lastBitArr[j + 1];\n      }\n\n      if (bitArr[j] & mask) {\n        finalScore = calcScore(i, currentLocation);\n\n        // This match will almost certainly be better than any existing match.\n        // But check anyway.\n        if (finalScore <= currentThreshold) {\n          // Indeed it is\n          currentThreshold = finalScore;\n          bestLocation = currentLocation;\n\n          // Already passed `loc`, downhill from here on in.\n          if (bestLocation <= expectedLocation) {\n            break\n          }\n\n          // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.\n          start = Math.max(1, 2 * expectedLocation - bestLocation);\n        }\n      }\n    }\n\n    // No hope for a (better) match at greater error levels.\n    const score = calcScore(i + 1, expectedLocation);\n\n    if (score > currentThreshold) {\n      break\n    }\n\n    lastBitArr = bitArr;\n  }\n\n  const result = {\n    isMatch: bestLocation >= 0,\n    // Count exact matches (those with a score of 0) to be \"almost\" exact\n    score: Math.max(0.001, finalScore)\n  };\n\n  if (computeMatches) {\n    const indices = convertMaskToIndices(matchMask, minMatchCharLength);\n    if (!indices.length) {\n      result.isMatch = false;\n    } else if (includeMatches) {\n      result.indices = indices;\n    }\n  }\n\n  return result\n}\n\nfunction createPatternAlphabet(pattern) {\n  let mask = {};\n\n  for (let i = 0, len = pattern.length; i < len; i += 1) {\n    const char = pattern.charAt(i);\n    mask[char] = (mask[char] || 0) | (1 << (len - i - 1));\n  }\n\n  return mask\n}\n\nconst stripDiacritics = String.prototype.normalize\n    ? ((str) => str.normalize('NFD').replace(/[\\u0300-\\u036F\\u0483-\\u0489\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065F\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u07FD\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0859-\\u085B\\u08D3-\\u08E1\\u08E3-\\u0903\\u093A-\\u093C\\u093E-\\u094F\\u0951-\\u0957\\u0962\\u0963\\u0981-\\u0983\\u09BC\\u09BE-\\u09C4\\u09C7\\u09C8\\u09CB-\\u09CD\\u09D7\\u09E2\\u09E3\\u09FE\\u0A01-\\u0A03\\u0A3C\\u0A3E-\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81-\\u0A83\\u0ABC\\u0ABE-\\u0AC5\\u0AC7-\\u0AC9\\u0ACB-\\u0ACD\\u0AE2\\u0AE3\\u0AFA-\\u0AFF\\u0B01-\\u0B03\\u0B3C\\u0B3E-\\u0B44\\u0B47\\u0B48\\u0B4B-\\u0B4D\\u0B56\\u0B57\\u0B62\\u0B63\\u0B82\\u0BBE-\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCD\\u0BD7\\u0C00-\\u0C04\\u0C3E-\\u0C44\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0C81-\\u0C83\\u0CBC\\u0CBE-\\u0CC4\\u0CC6-\\u0CC8\\u0CCA-\\u0CCD\\u0CD5\\u0CD6\\u0CE2\\u0CE3\\u0D00-\\u0D03\\u0D3B\\u0D3C\\u0D3E-\\u0D44\\u0D46-\\u0D48\\u0D4A-\\u0D4D\\u0D57\\u0D62\\u0D63\\u0D82\\u0D83\\u0DCA\\u0DCF-\\u0DD4\\u0DD6\\u0DD8-\\u0DDF\\u0DF2\\u0DF3\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EB9\\u0EBB\\u0EBC\\u0EC8-\\u0ECD\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F3E\\u0F3F\\u0F71-\\u0F84\\u0F86\\u0F87\\u0F8D-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102B-\\u103E\\u1056-\\u1059\\u105E-\\u1060\\u1062-\\u1064\\u1067-\\u106D\\u1071-\\u1074\\u1082-\\u108D\\u108F\\u109A-\\u109D\\u135D-\\u135F\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17B4-\\u17D3\\u17DD\\u180B-\\u180D\\u1885\\u1886\\u18A9\\u1920-\\u192B\\u1930-\\u193B\\u1A17-\\u1A1B\\u1A55-\\u1A5E\\u1A60-\\u1A7C\\u1A7F\\u1AB0-\\u1ABE\\u1B00-\\u1B04\\u1B34-\\u1B44\\u1B6B-\\u1B73\\u1B80-\\u1B82\\u1BA1-\\u1BAD\\u1BE6-\\u1BF3\\u1C24-\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE8\\u1CED\\u1CF2-\\u1CF4\\u1CF7-\\u1CF9\\u1DC0-\\u1DF9\\u1DFB-\\u1DFF\\u20D0-\\u20F0\\u2CEF-\\u2CF1\\u2D7F\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F-\\uA672\\uA674-\\uA67D\\uA69E\\uA69F\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA823-\\uA827\\uA880\\uA881\\uA8B4-\\uA8C5\\uA8E0-\\uA8F1\\uA8FF\\uA926-\\uA92D\\uA947-\\uA953\\uA980-\\uA983\\uA9B3-\\uA9C0\\uA9E5\\uAA29-\\uAA36\\uAA43\\uAA4C\\uAA4D\\uAA7B-\\uAA7D\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uAAEB-\\uAAEF\\uAAF5\\uAAF6\\uABE3-\\uABEA\\uABEC\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE2F]/g, ''))\n    : ((str) => str);\n\nfunction mergeIndices(indices) {\n  if (indices.length <= 1) return indices\n\n  indices.sort((a, b) => a[0] - b[0] || a[1] - b[1]);\n\n  const merged = [indices[0]];\n\n  for (let i = 1, len = indices.length; i < len; i += 1) {\n    const last = merged[merged.length - 1];\n    const curr = indices[i];\n    if (curr[0] <= last[1] + 1) {\n      last[1] = Math.max(last[1], curr[1]);\n    } else {\n      merged.push(curr);\n    }\n  }\n\n  return merged\n}\n\nclass BitapSearch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    this.options = {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    };\n\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n\n    this.chunks = [];\n\n    if (!this.pattern.length) {\n      return\n    }\n\n    const addChunk = (pattern, startIndex) => {\n      this.chunks.push({\n        pattern,\n        alphabet: createPatternAlphabet(pattern),\n        startIndex\n      });\n    };\n\n    const len = this.pattern.length;\n\n    if (len > MAX_BITS) {\n      let i = 0;\n      const remainder = len % MAX_BITS;\n      const end = len - remainder;\n\n      while (i < end) {\n        addChunk(this.pattern.substr(i, MAX_BITS), i);\n        i += MAX_BITS;\n      }\n\n      if (remainder) {\n        const startIndex = len - MAX_BITS;\n        addChunk(this.pattern.substr(startIndex), startIndex);\n      }\n    } else {\n      addChunk(this.pattern, 0);\n    }\n  }\n\n  searchIn(text) {\n    const { isCaseSensitive, ignoreDiacritics, includeMatches } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n    // Exact match\n    if (this.pattern === text) {\n      let result = {\n        isMatch: true,\n        score: 0\n      };\n\n      if (includeMatches) {\n        result.indices = [[0, text.length - 1]];\n      }\n\n      return result\n    }\n\n    // Otherwise, use Bitap algorithm\n    const {\n      location,\n      distance,\n      threshold,\n      findAllMatches,\n      minMatchCharLength,\n      ignoreLocation\n    } = this.options;\n\n    let allIndices = [];\n    let totalScore = 0;\n    let hasMatches = false;\n\n    this.chunks.forEach(({ pattern, alphabet, startIndex }) => {\n      const { isMatch, score, indices } = search(text, pattern, alphabet, {\n        location: location + startIndex,\n        distance,\n        threshold,\n        findAllMatches,\n        minMatchCharLength,\n        includeMatches,\n        ignoreLocation\n      });\n\n      if (isMatch) {\n        hasMatches = true;\n      }\n\n      totalScore += score;\n\n      if (isMatch && indices) {\n        allIndices.push(...indices);\n      }\n    });\n\n    let result = {\n      isMatch: hasMatches,\n      score: hasMatches ? totalScore / this.chunks.length : 1\n    };\n\n    if (hasMatches && includeMatches) {\n      result.indices = mergeIndices(allIndices);\n    }\n\n    return result\n  }\n}\n\nclass BaseMatch {\n  constructor(pattern) {\n    this.pattern = pattern;\n  }\n  static isMultiMatch(pattern) {\n    return getMatch(pattern, this.multiRegex)\n  }\n  static isSingleMatch(pattern) {\n    return getMatch(pattern, this.singleRegex)\n  }\n  search(/*text*/) {}\n}\n\nfunction getMatch(pattern, exp) {\n  const matches = pattern.match(exp);\n  return matches ? matches[1] : null\n}\n\n// Token: 'file\n\nclass ExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'exact'\n  }\n  static get multiRegex() {\n    return /^=\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^=(.*)$/\n  }\n  search(text) {\n    const isMatch = text === this.pattern;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !fire\n\nclass InverseExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!(.*)$/\n  }\n  search(text) {\n    const index = text.indexOf(this.pattern);\n    const isMatch = index === -1;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: ^file\n\nclass PrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'prefix-exact'\n  }\n  static get multiRegex() {\n    return /^\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !^fire\n\nclass InversePrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-prefix-exact'\n  }\n  static get multiRegex() {\n    return /^!\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = !text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: .file$\n\nclass SuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'suffix-exact'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = text.endsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [text.length - this.pattern.length, text.length - 1]\n    }\n  }\n}\n\n// Token: !.file$\n\nclass InverseSuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-suffix-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^!(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = !text.endsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\nclass FuzzyMatch extends BaseMatch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    super(pattern);\n    this._bitapSearch = new BitapSearch(pattern, {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    });\n  }\n  static get type() {\n    return 'fuzzy'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^(.*)$/\n  }\n  search(text) {\n    return this._bitapSearch.searchIn(text)\n  }\n}\n\n// Token: 'file\n\nclass IncludeMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'include'\n  }\n  static get multiRegex() {\n    return /^'\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^'(.*)$/\n  }\n  search(text) {\n    let location = 0;\n    let index;\n\n    const indices = [];\n    const patternLen = this.pattern.length;\n\n    // Get all exact matches\n    while ((index = text.indexOf(this.pattern, location)) > -1) {\n      location = index + patternLen;\n      indices.push([index, location - 1]);\n    }\n\n    const isMatch = !!indices.length;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices\n    }\n  }\n}\n\n// \u2757Order is important. DO NOT CHANGE.\nconst searchers = [\n  ExactMatch,\n  IncludeMatch,\n  PrefixExactMatch,\n  InversePrefixExactMatch,\n  InverseSuffixExactMatch,\n  SuffixExactMatch,\n  InverseExactMatch,\n  FuzzyMatch\n];\n\nconst searchersLen = searchers.length;\n\n// Regex to split by spaces, but keep anything in quotes together\nconst SPACE_RE = / +(?=(?:[^\\\"]*\\\"[^\\\"]*\\\")*[^\\\"]*$)/;\nconst OR_TOKEN = '|';\n\n// Return a 2D array representation of the query, for simpler parsing.\n// Example:\n// \"^core go$ | rb$ | py$ xy$\" => [[\"^core\", \"go$\"], [\"rb$\"], [\"py$\", \"xy$\"]]\nfunction parseQuery(pattern, options = {}) {\n  return pattern.split(OR_TOKEN).map((item) => {\n    let query = item\n      .trim()\n      .split(SPACE_RE)\n      .filter((item) => item && !!item.trim());\n\n    let results = [];\n    for (let i = 0, len = query.length; i < len; i += 1) {\n      const queryItem = query[i];\n\n      // 1. Handle multiple query match (i.e, once that are quoted, like `\"hello world\"`)\n      let found = false;\n      let idx = -1;\n      while (!found && ++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isMultiMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          found = true;\n        }\n      }\n\n      if (found) {\n        continue\n      }\n\n      // 2. Handle single query matches (i.e, once that are *not* quoted)\n      idx = -1;\n      while (++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isSingleMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          break\n        }\n      }\n    }\n\n    return results\n  })\n}\n\n// These extended matchers can return an array of matches, as opposed\n// to a singl match\nconst MultiMatchSet = new Set([FuzzyMatch.type, IncludeMatch.type]);\n\n/**\n * Command-like searching\n * ======================\n *\n * Given multiple search terms delimited by spaces.e.g. `^jscript .python$ ruby !java`,\n * search in a given text.\n *\n * Search syntax:\n *\n * | Token       | Match type                 | Description                            |\n * | ----------- | -------------------------- | -------------------------------------- |\n * | `jscript`   | fuzzy-match                | Items that fuzzy match `jscript`       |\n * | `=scheme`   | exact-match                | Items that are `scheme`                |\n * | `'python`   | include-match              | Items that include `python`            |\n * | `!ruby`     | inverse-exact-match        | Items that do not include `ruby`       |\n * | `^java`     | prefix-exact-match         | Items that start with `java`           |\n * | `!^earlang` | inverse-prefix-exact-match | Items that do not start with `earlang` |\n * | `.js$`      | suffix-exact-match         | Items that end with `.js`              |\n * | `!.go$`     | inverse-suffix-exact-match | Items that do not end with `.go`       |\n *\n * A single pipe character acts as an OR operator. For example, the following\n * query matches entries that start with `core` and end with either`go`, `rb`,\n * or`py`.\n *\n * ```\n * ^core go$ | rb$ | py$\n * ```\n */\nclass ExtendedSearch {\n  constructor(\n    pattern,\n    {\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      includeMatches = Config.includeMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      ignoreLocation = Config.ignoreLocation,\n      findAllMatches = Config.findAllMatches,\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance\n    } = {}\n  ) {\n    this.query = null;\n    this.options = {\n      isCaseSensitive,\n      ignoreDiacritics,\n      includeMatches,\n      minMatchCharLength,\n      findAllMatches,\n      ignoreLocation,\n      location,\n      threshold,\n      distance\n    };\n\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n    this.query = parseQuery(this.pattern, this.options);\n  }\n\n  static condition(_, options) {\n    return options.useExtendedSearch\n  }\n\n  searchIn(text) {\n    const query = this.query;\n\n    if (!query) {\n      return {\n        isMatch: false,\n        score: 1\n      }\n    }\n\n    const { includeMatches, isCaseSensitive, ignoreDiacritics } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n    let numMatches = 0;\n    let allIndices = [];\n    let totalScore = 0;\n\n    // ORs\n    for (let i = 0, qLen = query.length; i < qLen; i += 1) {\n      const searchers = query[i];\n\n      // Reset indices\n      allIndices.length = 0;\n      numMatches = 0;\n\n      // ANDs\n      for (let j = 0, pLen = searchers.length; j < pLen; j += 1) {\n        const searcher = searchers[j];\n        const { isMatch, indices, score } = searcher.search(text);\n\n        if (isMatch) {\n          numMatches += 1;\n          totalScore += score;\n          if (includeMatches) {\n            const type = searcher.constructor.type;\n            if (MultiMatchSet.has(type)) {\n              allIndices.push(...indices);\n            } else {\n              allIndices.push(indices);\n            }\n          }\n        } else {\n          totalScore = 0;\n          numMatches = 0;\n          allIndices.length = 0;\n          break\n        }\n      }\n\n      // OR condition, so if TRUE, return\n      if (numMatches) {\n        let result = {\n          isMatch: true,\n          score: totalScore / numMatches\n        };\n\n        if (includeMatches) {\n          result.indices = allIndices;\n        }\n\n        return result\n      }\n    }\n\n    // Nothing was matched\n    return {\n      isMatch: false,\n      score: 1\n    }\n  }\n}\n\nconst registeredSearchers = [];\n\nfunction register(...args) {\n  registeredSearchers.push(...args);\n}\n\nfunction createSearcher(pattern, options) {\n  for (let i = 0, len = registeredSearchers.length; i < len; i += 1) {\n    let searcherClass = registeredSearchers[i];\n    if (searcherClass.condition(pattern, options)) {\n      return new searcherClass(pattern, options)\n    }\n  }\n\n  return new BitapSearch(pattern, options)\n}\n\nconst LogicalOperator = {\n  AND: '$and',\n  OR: '$or'\n};\n\nconst KeyType = {\n  PATH: '$path',\n  PATTERN: '$val'\n};\n\nconst isExpression = (query) =>\n  !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]);\n\nconst isPath = (query) => !!query[KeyType.PATH];\n\nconst isLeaf = (query) =>\n  !isArray(query) && isObject(query) && !isExpression(query);\n\nconst convertToExplicit = (query) => ({\n  [LogicalOperator.AND]: Object.keys(query).map((key) => ({\n    [key]: query[key]\n  }))\n});\n\n// When `auto` is `true`, the parse function will infer and initialize and add\n// the appropriate `Searcher` instance\nfunction parse(query, options, { auto = true } = {}) {\n  const next = (query) => {\n    let keys = Object.keys(query);\n\n    const isQueryPath = isPath(query);\n\n    if (!isQueryPath && keys.length > 1 && !isExpression(query)) {\n      return next(convertToExplicit(query))\n    }\n\n    if (isLeaf(query)) {\n      const key = isQueryPath ? query[KeyType.PATH] : keys[0];\n\n      const pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];\n\n      if (!isString(pattern)) {\n        throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key))\n      }\n\n      const obj = {\n        keyId: createKeyId(key),\n        pattern\n      };\n\n      if (auto) {\n        obj.searcher = createSearcher(pattern, options);\n      }\n\n      return obj\n    }\n\n    let node = {\n      children: [],\n      operator: keys[0]\n    };\n\n    keys.forEach((key) => {\n      const value = query[key];\n\n      if (isArray(value)) {\n        value.forEach((item) => {\n          node.children.push(next(item));\n        });\n      }\n    });\n\n    return node\n  };\n\n  if (!isExpression(query)) {\n    query = convertToExplicit(query);\n  }\n\n  return next(query)\n}\n\nfunction computeScoreSingle(\n  result,\n  { ignoreFieldNorm = Config.ignoreFieldNorm }\n) {\n  let totalScore = 1;\n\n  result.matches.forEach(({ key, norm, score }) => {\n    const weight = key ? key.weight : null;\n\n    totalScore *= Math.pow(\n      score === 0 && weight ? Number.EPSILON : score,\n      (weight || 1) * (ignoreFieldNorm ? 1 : norm)\n    );\n  });\n\n  result.score = totalScore;\n}\n\n// Practical scoring function\nfunction computeScore(\n  results,\n  { ignoreFieldNorm = Config.ignoreFieldNorm }\n) {\n  results.forEach((result) => {\n    computeScoreSingle(result, { ignoreFieldNorm });\n  });\n}\n\n// Max-heap by score: keeps the worst (highest) score at the top\n// so we can efficiently evict it when a better result arrives.\nclass MaxHeap {\n  constructor(limit) {\n    this.limit = limit;\n    this.heap = [];\n  }\n  get size() {\n    return this.heap.length\n  }\n  shouldInsert(score) {\n    return this.size < this.limit || score < this.heap[0].score\n  }\n  insert(item) {\n    if (this.size < this.limit) {\n      this.heap.push(item);\n      this._bubbleUp(this.size - 1);\n    } else if (item.score < this.heap[0].score) {\n      this.heap[0] = item;\n      this._sinkDown(0);\n    }\n  }\n  extractSorted(sortFn) {\n    return this.heap.sort(sortFn)\n  }\n  _bubbleUp(i) {\n    const heap = this.heap;\n    while (i > 0) {\n      const parent = (i - 1) >> 1;\n      if (heap[i].score <= heap[parent].score) break\n      const tmp = heap[i];\n      heap[i] = heap[parent];\n      heap[parent] = tmp;\n      i = parent;\n    }\n  }\n  _sinkDown(i) {\n    const heap = this.heap;\n    const len = heap.length;\n    let largest = i;\n    do {\n      i = largest;\n      const left = 2 * i + 1;\n      const right = 2 * i + 2;\n      if (left < len && heap[left].score > heap[largest].score) {\n        largest = left;\n      }\n      if (right < len && heap[right].score > heap[largest].score) {\n        largest = right;\n      }\n      if (largest !== i) {\n        const tmp = heap[i];\n        heap[i] = heap[largest];\n        heap[largest] = tmp;\n      }\n    } while (largest !== i)\n  }\n}\n\nfunction transformMatches(result, data) {\n  const matches = result.matches;\n  data.matches = [];\n\n  if (!isDefined(matches)) {\n    return\n  }\n\n  matches.forEach((match) => {\n    if (!isDefined(match.indices) || !match.indices.length) {\n      return\n    }\n\n    const { indices, value } = match;\n\n    let obj = {\n      indices,\n      value\n    };\n\n    if (match.key) {\n      obj.key = match.key.src;\n    }\n\n    if (match.idx > -1) {\n      obj.refIndex = match.idx;\n    }\n\n    data.matches.push(obj);\n  });\n}\n\nfunction transformScore(result, data) {\n  data.score = result.score;\n}\n\nfunction format(\n  results,\n  docs,\n  {\n    includeMatches = Config.includeMatches,\n    includeScore = Config.includeScore\n  } = {}\n) {\n  const transformers = [];\n\n  if (includeMatches) transformers.push(transformMatches);\n  if (includeScore) transformers.push(transformScore);\n\n  return results.map((result) => {\n    const { idx } = result;\n\n    const data = {\n      item: docs[idx],\n      refIndex: idx\n    };\n\n    if (transformers.length) {\n      transformers.forEach((transformer) => {\n        transformer(result, data);\n      });\n    }\n\n    return data\n  })\n}\n\nclass Fuse {\n  constructor(docs, options = {}, index) {\n    this.options = { ...Config, ...options };\n\n    if (\n      this.options.useExtendedSearch &&\n      !true\n    ) {\n      throw new Error(EXTENDED_SEARCH_UNAVAILABLE)\n    }\n\n    this._keyStore = new KeyStore(this.options.keys);\n\n    this.setCollection(docs, index);\n\n    this._lastQuery = null;\n    this._lastSearcher = null;\n  }\n\n  _getSearcher(query) {\n    if (this._lastQuery === query) {\n      return this._lastSearcher\n    }\n    const searcher = createSearcher(query, this.options);\n    this._lastQuery = query;\n    this._lastSearcher = searcher;\n    return searcher\n  }\n\n  setCollection(docs, index) {\n    this._docs = docs;\n\n    if (index && !(index instanceof FuseIndex)) {\n      throw new Error(INCORRECT_INDEX_TYPE)\n    }\n\n    this._myIndex =\n      index ||\n      createIndex(this.options.keys, this._docs, {\n        getFn: this.options.getFn,\n        fieldNormWeight: this.options.fieldNormWeight\n      });\n  }\n\n  add(doc) {\n    if (!isDefined(doc)) {\n      return\n    }\n\n    this._docs.push(doc);\n    this._myIndex.add(doc);\n  }\n\n  remove(predicate = (/* doc, idx */) => false) {\n    const results = [];\n    const indicesToRemove = [];\n\n    for (let i = 0, len = this._docs.length; i < len; i += 1) {\n      if (predicate(this._docs[i], i)) {\n        results.push(this._docs[i]);\n        indicesToRemove.push(i);\n      }\n    }\n\n    if (indicesToRemove.length) {\n      // Remove from docs in reverse to preserve indices\n      for (let i = indicesToRemove.length - 1; i >= 0; i -= 1) {\n        this._docs.splice(indicesToRemove[i], 1);\n      }\n      this._myIndex.removeAll(indicesToRemove);\n    }\n\n    return results\n  }\n\n  removeAt(idx) {\n    this._docs.splice(idx, 1);\n    this._myIndex.removeAt(idx);\n  }\n\n  getIndex() {\n    return this._myIndex\n  }\n\n  search(query, { limit = -1 } = {}) {\n    const {\n      includeMatches,\n      includeScore,\n      shouldSort,\n      sortFn,\n      ignoreFieldNorm\n    } = this.options;\n\n    const useHeap = isNumber(limit) && limit > 0 && isString(query);\n\n    let results;\n\n    if (useHeap) {\n      const heap = new MaxHeap(limit);\n      if (isString(this._docs[0])) {\n        this._searchStringList(query, { heap, ignoreFieldNorm });\n      } else {\n        this._searchObjectList(query, { heap, ignoreFieldNorm });\n      }\n      results = heap.extractSorted(sortFn);\n    } else {\n      results = isString(query)\n        ? isString(this._docs[0])\n          ? this._searchStringList(query)\n          : this._searchObjectList(query)\n        : this._searchLogical(query);\n\n      computeScore(results, { ignoreFieldNorm });\n\n      if (shouldSort) {\n        results.sort(sortFn);\n      }\n\n      if (isNumber(limit) && limit > -1) {\n        results = results.slice(0, limit);\n      }\n    }\n\n    return format(results, this._docs, {\n      includeMatches,\n      includeScore\n    })\n  }\n\n  _searchStringList(query, { heap, ignoreFieldNorm } = {}) {\n    const searcher = this._getSearcher(query);\n    const { records } = this._myIndex;\n    const results = heap ? null : [];\n\n    // Iterate over every string in the index\n    records.forEach(({ v: text, i: idx, n: norm }) => {\n      if (!isDefined(text)) {\n        return\n      }\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        const result = {\n          item: text,\n          idx,\n          matches: [{ score, value: text, norm, indices }]\n        };\n\n        if (heap) {\n          computeScoreSingle(result, { ignoreFieldNorm });\n          if (heap.shouldInsert(result.score)) {\n            heap.insert(result);\n          }\n        } else {\n          results.push(result);\n        }\n      }\n    });\n\n    return results\n  }\n\n  _searchLogical(query) {\n\n    const expression = parse(query, this.options);\n\n    const evaluate = (node, item, idx) => {\n      if (!node.children) {\n        const { keyId, searcher } = node;\n\n        const matches = this._findMatches({\n          key: this._keyStore.get(keyId),\n          value: this._myIndex.getValueForItemAtKeyId(item, keyId),\n          searcher\n        });\n\n        if (matches && matches.length) {\n          return [\n            {\n              idx,\n              item,\n              matches\n            }\n          ]\n        }\n\n        return []\n      }\n\n      const res = [];\n      for (let i = 0, len = node.children.length; i < len; i += 1) {\n        const child = node.children[i];\n        const result = evaluate(child, item, idx);\n        if (result.length) {\n          res.push(...result);\n        } else if (node.operator === LogicalOperator.AND) {\n          return []\n        }\n      }\n      return res\n    };\n\n    const records = this._myIndex.records;\n    const resultMap = new Map();\n    const results = [];\n\n    records.forEach(({ $: item, i: idx }) => {\n      if (isDefined(item)) {\n        let expResults = evaluate(expression, item, idx);\n\n        if (expResults.length) {\n          // Dedupe when adding\n          if (!resultMap.has(idx)) {\n            resultMap.set(idx, { idx, item, matches: [] });\n            results.push(resultMap.get(idx));\n          }\n          expResults.forEach(({ matches }) => {\n            resultMap.get(idx).matches.push(...matches);\n          });\n        }\n      }\n    });\n\n    return results\n  }\n\n  _searchObjectList(query, { heap, ignoreFieldNorm } = {}) {\n    const searcher = this._getSearcher(query);\n    const { keys, records } = this._myIndex;\n    const results = heap ? null : [];\n\n    // List is Array<Object>\n    records.forEach(({ $: item, i: idx }) => {\n      if (!isDefined(item)) {\n        return\n      }\n\n      let matches = [];\n\n      // Iterate over every key (i.e, path), and fetch the value at that key\n      keys.forEach((key, keyIndex) => {\n        matches.push(\n          ...this._findMatches({\n            key,\n            value: item[keyIndex],\n            searcher\n          })\n        );\n      });\n\n      if (matches.length) {\n        const result = { idx, item, matches };\n\n        if (heap) {\n          computeScoreSingle(result, { ignoreFieldNorm });\n          if (heap.shouldInsert(result.score)) {\n            heap.insert(result);\n          }\n        } else {\n          results.push(result);\n        }\n      }\n    });\n\n    return results\n  }\n  _findMatches({ key, value, searcher }) {\n    if (!isDefined(value)) {\n      return []\n    }\n\n    let matches = [];\n\n    if (isArray(value)) {\n      value.forEach(({ v: text, i: idx, n: norm }) => {\n        if (!isDefined(text)) {\n          return\n        }\n\n        const { isMatch, score, indices } = searcher.searchIn(text);\n\n        if (isMatch) {\n          matches.push({\n            score,\n            key,\n            value: text,\n            idx,\n            norm,\n            indices\n          });\n        }\n      });\n    } else {\n      const { v: text, n: norm } = value;\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        matches.push({ score, key, value: text, norm, indices });\n      }\n    }\n\n    return matches\n  }\n}\n\nFuse.version = '7.2.0';\nFuse.createIndex = createIndex;\nFuse.parseIndex = parseIndex;\nFuse.config = Config;\n\n{\n  Fuse.parseQuery = parse;\n}\n\n{\n  register(ExtendedSearch);\n}\n\nFuse.use = function (...plugins) {\n  plugins.forEach((plugin) => register(plugin));\n};\n\nexport { Fuse as default };\n"],
-  "mappings": "mbAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,gBAAAE,GAAA,iBAAAC,GAAA,sBAAAC,GAAA,iBAAAC,GAAA,iBAAAC,GAAA,mBAAAC,GAAA,uBAAAC,GAAA,mBAAAC,GAAA,mBAAAC,GAAA,yBAAAC,GAAA,kBAAAC,GAAA,kBAAAC,GAAA,sBAAAC,EAAA,uBAAAC,IAAA,eAAAC,GAAAhB,IAAA,IAAAiB,EAMO,iBCGP,SAASC,EAAQC,EAAO,CACtB,OAAQ,MAAM,QAEV,MAAM,QAAQA,CAAK,EADnBC,GAAOD,CAAK,IAAM,gBAExB,CAGA,IAAME,GAAW,IACjB,SAASC,GAAaH,EAAO,CAE3B,GAAI,OAAOA,GAAS,SAClB,OAAOA,EAET,IAAII,EAASJ,EAAQ,GACrB,OAAOI,GAAU,KAAO,EAAIJ,GAAS,CAACE,GAAW,KAAOE,CAC1D,CAEA,SAASC,GAASL,EAAO,CACvB,OAAOA,GAAS,KAAO,GAAKG,GAAaH,CAAK,CAChD,CAEA,SAASM,EAASN,EAAO,CACvB,OAAO,OAAOA,GAAU,QAC1B,CAEA,SAASO,EAASP,EAAO,CACvB,OAAO,OAAOA,GAAU,QAC1B,CAGA,SAASQ,GAAUR,EAAO,CACxB,OACEA,IAAU,IACVA,IAAU,IACTS,GAAaT,CAAK,GAAKC,GAAOD,CAAK,GAAK,kBAE7C,CAEA,SAASU,GAASV,EAAO,CACvB,OAAO,OAAOA,GAAU,QAC1B,CAGA,SAASS,GAAaT,EAAO,CAC3B,OAAOU,GAASV,CAAK,GAAKA,IAAU,IACtC,CAEA,SAASW,EAAUX,EAAO,CACxB,OAA8BA,GAAU,IAC1C,CAEA,SAASY,EAAQZ,EAAO,CACtB,MAAO,CAACA,EAAM,KAAK,EAAE,MACvB,CAIA,SAASC,GAAOD,EAAO,CACrB,OAAOA,GAAS,KACZA,IAAU,OACR,qBACA,gBACF,OAAO,UAAU,SAAS,KAAKA,CAAK,CAC1C,CAIA,IAAMa,GAAuB,yBAEvBC,GAAwCC,GAC5C,yBAAyBA,CAAG,GAExBC,GAA4BC,GAChC,iCAAiCA,CAAG,IAEhCC,GAAwBC,GAAS,WAAWA,CAAI,mBAEhDC,GAA4BL,GAChC,6BAA6BA,CAAG,+BAE5BM,GAAS,OAAO,UAAU,eAE1BC,GAAN,KAAe,CACb,YAAYC,EAAM,CAChB,KAAK,MAAQ,CAAC,EACd,KAAK,QAAU,CAAC,EAEhB,IAAIC,EAAc,EAElBD,EAAK,QAASR,GAAQ,CACpB,IAAIU,EAAMC,GAAUX,CAAG,EAEvB,KAAK,MAAM,KAAKU,CAAG,EACnB,KAAK,QAAQA,EAAI,EAAE,EAAIA,EAEvBD,GAAeC,EAAI,MACrB,CAAC,EAGD,KAAK,MAAM,QAASV,GAAQ,CAC1BA,EAAI,QAAUS,CAChB,CAAC,CACH,CACA,IAAIG,EAAO,CACT,OAAO,KAAK,QAAQA,CAAK,CAC3B,CACA,MAAO,CACL,OAAO,KAAK,KACd,CACA,QAAS,CACP,OAAO,KAAK,UAAU,KAAK,KAAK,CAClC,CACF,EAEA,SAASD,GAAUX,EAAK,CACtB,IAAIa,EAAO,KACPC,EAAK,KACLC,EAAM,KACNC,EAAS,EACTC,EAAQ,KAEZ,GAAIC,EAASlB,CAAG,GAAKmB,EAAQnB,CAAG,EAC9Be,EAAMf,EACNa,EAAOO,GAAcpB,CAAG,EACxBc,EAAKO,GAAYrB,CAAG,MACf,CACL,GAAI,CAACM,GAAO,KAAKN,EAAK,MAAM,EAC1B,MAAM,IAAI,MAAMG,GAAqB,MAAM,CAAC,EAG9C,IAAMC,EAAOJ,EAAI,KAGjB,GAFAe,EAAMX,EAEFE,GAAO,KAAKN,EAAK,QAAQ,IAC3BgB,EAAShB,EAAI,OAETgB,GAAU,GACZ,MAAM,IAAI,MAAMX,GAAyBD,CAAI,CAAC,EAIlDS,EAAOO,GAAchB,CAAI,EACzBU,EAAKO,GAAYjB,CAAI,EACrBa,EAAQjB,EAAI,KACd,CAEA,MAAO,CAAE,KAAAa,EAAM,GAAAC,EAAI,OAAAE,EAAQ,IAAAD,EAAK,MAAAE,CAAM,CACxC,CAEA,SAASG,GAAcpB,EAAK,CAC1B,OAAOmB,EAAQnB,CAAG,EAAIA,EAAMA,EAAI,MAAM,GAAG,CAC3C,CAEA,SAASqB,GAAYrB,EAAK,CACxB,OAAOmB,EAAQnB,CAAG,EAAIA,EAAI,KAAK,GAAG,EAAIA,CACxC,CAEA,SAASsB,GAAIZ,EAAKG,EAAM,CACtB,IAAIU,EAAO,CAAC,EACRC,EAAM,GAEJC,EAAU,CAACf,EAAKG,EAAMa,EAAOC,IAAe,CAChD,GAAKC,EAAUlB,CAAG,EAGlB,GAAI,CAACG,EAAKa,CAAK,EAEbH,EAAK,KAAKI,IAAe,OAAY,CAAE,EAAGjB,EAAK,EAAGiB,CAAW,EAAIjB,CAAG,MAC/D,CACL,IAAIV,EAAMa,EAAKa,CAAK,EAEdG,EAAQnB,EAAIV,CAAG,EAErB,GAAI,CAAC4B,EAAUC,CAAK,EAClB,OAKF,GACEH,IAAUb,EAAK,OAAS,IACvBK,EAASW,CAAK,GAAKC,EAASD,CAAK,GAAKE,GAAUF,CAAK,GAEtDN,EAAK,KACHI,IAAe,OACX,CAAE,EAAGK,GAASH,CAAK,EAAG,EAAGF,CAAW,EACpCK,GAASH,CAAK,CACpB,UACSV,EAAQU,CAAK,EAAG,CACzBL,EAAM,GAEN,QAASS,EAAI,EAAGC,EAAML,EAAM,OAAQI,EAAIC,EAAKD,GAAK,EAChDR,EAAQI,EAAMI,CAAC,EAAGpB,EAAMa,EAAQ,EAAGO,CAAC,CAExC,MAAWpB,EAAK,QAEdY,EAAQI,EAAOhB,EAAMa,EAAQ,EAAGC,CAAU,CAE9C,CACF,EAGA,OAAAF,EAAQf,EAAKQ,EAASL,CAAI,EAAIA,EAAK,MAAM,GAAG,EAAIA,EAAM,CAAC,EAEhDW,EAAMD,EAAOA,EAAK,CAAC,CAC5B,CAEA,IAAMY,GAAe,CAInB,eAAgB,GAGhB,eAAgB,GAEhB,mBAAoB,CACtB,EAEMC,GAAe,CAGnB,gBAAiB,GAEjB,iBAAkB,GAElB,aAAc,GAEd,KAAM,CAAC,EAEP,WAAY,GAEZ,OAAQ,CAACC,EAAGC,IACVD,EAAE,QAAUC,EAAE,MAASD,EAAE,IAAMC,EAAE,IAAM,GAAK,EAAKD,EAAE,MAAQC,EAAE,MAAQ,GAAK,CAC9E,EAEMC,GAAe,CAEnB,SAAU,EAGV,UAAW,GAMX,SAAU,GACZ,EAEMC,GAAkB,CAEtB,kBAAmB,GAGnB,MAAOlB,GAIP,eAAgB,GAIhB,gBAAiB,GAEjB,gBAAiB,CACnB,EAEImB,EAAS,CACX,GAAGL,GACH,GAAGD,GACH,GAAGI,GACH,GAAGC,EACL,EAEME,GAAQ,SAId,SAASC,GAAK3B,EAAS,EAAG4B,EAAW,EAAG,CACtC,IAAMC,EAAQ,IAAI,IACZC,EAAI,KAAK,IAAI,GAAIF,CAAQ,EAE/B,MAAO,CACL,IAAIf,EAAO,CACT,IAAMkB,EAAYlB,EAAM,MAAMa,EAAK,EAAE,OAErC,GAAIG,EAAM,IAAIE,CAAS,EACrB,OAAOF,EAAM,IAAIE,CAAS,EAI5B,IAAMJ,EAAO,EAAI,KAAK,IAAII,EAAW,GAAM/B,CAAM,EAG3CgC,EAAI,WAAW,KAAK,MAAML,EAAOG,CAAC,EAAIA,CAAC,EAE7C,OAAAD,EAAM,IAAIE,EAAWC,CAAC,EAEfA,CACT,EACA,OAAQ,CACNH,EAAM,MAAM,CACd,CACF,CACF,CAEA,IAAMI,EAAN,KAAgB,CACd,YAAY,CACV,MAAAhC,EAAQwB,EAAO,MACf,gBAAAS,EAAkBT,EAAO,eAC3B,EAAI,CAAC,EAAG,CACN,KAAK,KAAOE,GAAKO,EAAiB,CAAC,EACnC,KAAK,MAAQjC,EACb,KAAK,UAAY,GAEjB,KAAK,gBAAgB,CACvB,CACA,WAAWkC,EAAO,CAAC,EAAG,CACpB,KAAK,KAAOA,CACd,CACA,gBAAgBC,EAAU,CAAC,EAAG,CAC5B,KAAK,QAAUA,CACjB,CACA,QAAQ5C,EAAO,CAAC,EAAG,CACjB,KAAK,KAAOA,EACZ,KAAK,SAAW,CAAC,EACjBA,EAAK,QAAQ,CAACR,EAAKqD,IAAQ,CACzB,KAAK,SAASrD,EAAI,EAAE,EAAIqD,CAC1B,CAAC,CACH,CACA,QAAS,CACH,KAAK,WAAa,CAAC,KAAK,KAAK,SAIjC,KAAK,UAAY,GAGbnC,EAAS,KAAK,KAAK,CAAC,CAAC,EACvB,KAAK,KAAK,QAAQ,CAACoC,EAAKC,IAAa,CACnC,KAAK,WAAWD,EAAKC,CAAQ,CAC/B,CAAC,EAGD,KAAK,KAAK,QAAQ,CAACD,EAAKC,IAAa,CACnC,KAAK,WAAWD,EAAKC,CAAQ,CAC/B,CAAC,EAGH,KAAK,KAAK,MAAM,EAClB,CAEA,IAAID,EAAK,CACP,IAAMD,EAAM,KAAK,KAAK,EAElBnC,EAASoC,CAAG,EACd,KAAK,WAAWA,EAAKD,CAAG,EAExB,KAAK,WAAWC,EAAKD,CAAG,CAE5B,CAEA,SAASA,EAAK,CACZ,KAAK,QAAQ,OAAOA,EAAK,CAAC,EAG1B,QAASpB,EAAIoB,EAAKnB,EAAM,KAAK,KAAK,EAAGD,EAAIC,EAAKD,GAAK,EACjD,KAAK,QAAQA,CAAC,EAAE,GAAK,CAEzB,CAEA,UAAUuB,EAAS,CAEjB,QAASvB,EAAIuB,EAAQ,OAAS,EAAGvB,GAAK,EAAGA,GAAK,EAC5C,KAAK,QAAQ,OAAOuB,EAAQvB,CAAC,EAAG,CAAC,EAGnC,QAASA,EAAI,EAAGC,EAAM,KAAK,QAAQ,OAAQD,EAAIC,EAAKD,GAAK,EACvD,KAAK,QAAQA,CAAC,EAAE,EAAIA,CAExB,CACA,uBAAuBwB,EAAM7C,EAAO,CAClC,OAAO6C,EAAK,KAAK,SAAS7C,CAAK,CAAC,CAClC,CACA,MAAO,CACL,OAAO,KAAK,QAAQ,MACtB,CACA,WAAW0C,EAAKC,EAAU,CACxB,GAAI,CAAC3B,EAAU0B,CAAG,GAAKI,EAAQJ,CAAG,EAChC,OAGF,IAAIK,EAAS,CACX,EAAGL,EACH,EAAGC,EACH,EAAG,KAAK,KAAK,IAAID,CAAG,CACtB,EAEA,KAAK,QAAQ,KAAKK,CAAM,CAC1B,CACA,WAAWL,EAAKC,EAAU,CACxB,IAAII,EAAS,CAAE,EAAGJ,EAAU,EAAG,CAAC,CAAE,EAGlC,KAAK,KAAK,QAAQ,CAACvD,EAAK4D,IAAa,CACnC,IAAI/B,EAAQ7B,EAAI,MAAQA,EAAI,MAAMsD,CAAG,EAAI,KAAK,MAAMA,EAAKtD,EAAI,IAAI,EAEjE,GAAK4B,EAAUC,CAAK,GAIpB,GAAIV,EAAQU,CAAK,EAAG,CAClB,IAAIgC,EAAa,CAAC,EAElB,QAAS5B,EAAI,EAAGC,EAAML,EAAM,OAAQI,EAAIC,EAAKD,GAAK,EAAG,CACnD,IAAMwB,EAAO5B,EAAMI,CAAC,EAEpB,GAAKL,EAAU6B,CAAI,GAInB,GAAIvC,EAASuC,CAAI,GAEf,GAAI,CAACC,EAAQD,CAAI,EAAG,CAClB,IAAIK,EAAY,CACd,EAAGL,EACH,EAAGxB,EACH,EAAG,KAAK,KAAK,IAAIwB,CAAI,CACvB,EAEAI,EAAW,KAAKC,CAAS,CAC3B,UACS5C,EAASuC,EAAK,CAAC,GAAK,CAACC,EAAQD,EAAK,CAAC,EAAG,CAE/C,IAAIK,EAAY,CACd,EAAGL,EAAK,EACR,EAAGA,EAAK,EACR,EAAG,KAAK,KAAK,IAAIA,EAAK,CAAC,CACzB,EAEAI,EAAW,KAAKC,CAAS,CAC3B,EACF,CACAH,EAAO,EAAEC,CAAQ,EAAIC,CACvB,SAAW3C,EAASW,CAAK,GAAK,CAAC6B,EAAQ7B,CAAK,EAAG,CAC7C,IAAIiC,EAAY,CACd,EAAGjC,EACH,EAAG,KAAK,KAAK,IAAIA,CAAK,CACxB,EAEA8B,EAAO,EAAEC,CAAQ,EAAIE,CACvB,EACF,CAAC,EAED,KAAK,QAAQ,KAAKH,CAAM,CAC1B,CACA,QAAS,CACP,MAAO,CACL,KAAM,KAAK,KACX,QAAS,KAAK,OAChB,CACF,CACF,EAEA,SAASI,GACPvD,EACA2C,EACA,CAAE,MAAAlC,EAAQwB,EAAO,MAAO,gBAAAS,EAAkBT,EAAO,eAAgB,EAAI,CAAC,EACtE,CACA,IAAMuB,EAAU,IAAIf,EAAU,CAAE,MAAAhC,EAAO,gBAAAiC,CAAgB,CAAC,EACxD,OAAAc,EAAQ,QAAQxD,EAAK,IAAIG,EAAS,CAAC,EACnCqD,EAAQ,WAAWb,CAAI,EACvBa,EAAQ,OAAO,EACRA,CACT,CAEA,SAASC,GACPC,EACA,CAAE,MAAAjD,EAAQwB,EAAO,MAAO,gBAAAS,EAAkBT,EAAO,eAAgB,EAAI,CAAC,EACtE,CACA,GAAM,CAAE,KAAAjC,EAAM,QAAA4C,CAAQ,EAAIc,EACpBF,EAAU,IAAIf,EAAU,CAAE,MAAAhC,EAAO,gBAAAiC,CAAgB,CAAC,EACxD,OAAAc,EAAQ,QAAQxD,CAAI,EACpBwD,EAAQ,gBAAgBZ,CAAO,EACxBY,CACT,CAEA,SAASG,GACPC,EAAY,CAAC,EACbC,EAAqB5B,EAAO,mBAC5B,CACA,IAAIe,EAAU,CAAC,EACXc,EAAQ,GACRC,EAAM,GACNtC,EAAI,EAER,QAASC,EAAMkC,EAAU,OAAQnC,EAAIC,EAAKD,GAAK,EAAG,CAChD,IAAIuC,EAAQJ,EAAUnC,CAAC,EACnBuC,GAASF,IAAU,GACrBA,EAAQrC,EACC,CAACuC,GAASF,IAAU,KAC7BC,EAAMtC,EAAI,EACNsC,EAAMD,EAAQ,GAAKD,GACrBb,EAAQ,KAAK,CAACc,EAAOC,CAAG,CAAC,EAE3BD,EAAQ,GAEZ,CAGA,OAAIF,EAAUnC,EAAI,CAAC,GAAKA,EAAIqC,GAASD,GACnCb,EAAQ,KAAK,CAACc,EAAOrC,EAAI,CAAC,CAAC,EAGtBuB,CACT,CAGA,IAAMiB,EAAW,GAEjB,SAASC,GACPC,EACAC,EACAC,EACA,CACE,SAAAC,EAAWrC,EAAO,SAClB,SAAAsC,EAAWtC,EAAO,SAClB,UAAAuC,EAAYvC,EAAO,UACnB,eAAAwC,EAAiBxC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,eAAAyC,EAAiBzC,EAAO,eACxB,eAAA0C,EAAiB1C,EAAO,cAC1B,EAAI,CAAC,EACL,CACA,GAAImC,EAAQ,OAASH,EACnB,MAAM,IAAI,MAAMxE,GAAyBwE,CAAQ,CAAC,EAGpD,IAAMW,EAAaR,EAAQ,OAErBS,EAAUV,EAAK,OAEfW,EAAmB,KAAK,IAAI,EAAG,KAAK,IAAIR,EAAUO,CAAO,CAAC,EAE5DE,EAAmBP,EAEnBQ,EAAeF,EAIbG,EAAY,CAACC,EAAQC,IAAoB,CAC7C,IAAMC,EAAWF,EAASN,EAC1B,GAAID,EAAgB,OAAOS,EAC3B,IAAMC,EAAY,KAAK,IAAIP,EAAmBK,CAAe,EAC7D,OAAKZ,EACEa,EAAWC,EAAYd,EADRc,EAAY,EAAMD,CAE1C,EAIME,EAAiBzB,EAAqB,GAAKa,EAE3Ca,EAAYD,EAAiB,MAAMT,CAAO,EAAI,CAAC,EAEjD3D,EAGJ,MAAQA,EAAQiD,EAAK,QAAQC,EAASY,CAAY,GAAK,IAAI,CACzD,IAAIQ,EAAQP,EAAU,EAAG/D,CAAK,EAK9B,GAHA6D,EAAmB,KAAK,IAAIS,EAAOT,CAAgB,EACnDC,EAAe9D,EAAQ0D,EAEnBU,EAAgB,CAClB,IAAI7D,EAAI,EACR,KAAOA,EAAImD,GACTW,EAAUrE,EAAQO,CAAC,EAAI,EACvBA,GAAK,CAET,CACF,CAGAuD,EAAe,GAEf,IAAIS,EAAa,CAAC,EACdC,EAAa,EACbC,EAASf,EAAaC,EAEpBe,EAAO,GAAMhB,EAAa,EAEhC,QAASnD,EAAI,EAAGA,EAAImD,EAAYnD,GAAK,EAAG,CAItC,IAAIoE,EAAS,EACTC,EAASH,EAEb,KAAOE,EAASC,GACAb,EAAUxD,EAAGqD,EAAmBgB,CAAM,GAEvCf,EACXc,EAASC,EAETH,EAASG,EAGXA,EAAS,KAAK,OAAOH,EAASE,GAAU,EAAIA,CAAM,EAIpDF,EAASG,EAET,IAAIhC,EAAQ,KAAK,IAAI,EAAGgB,EAAmBgB,EAAS,CAAC,EACjDC,EAAStB,EACTI,EACA,KAAK,IAAIC,EAAmBgB,EAAQjB,CAAO,EAAID,EAG/CoB,EAAS,MAAMD,EAAS,CAAC,EAE7BC,EAAOD,EAAS,CAAC,GAAK,GAAKtE,GAAK,EAEhC,QAASwE,EAAIF,EAAQE,GAAKnC,EAAOmC,GAAK,EAAG,CACvC,IAAId,EAAkBc,EAAI,EACtBC,EAAY7B,EAAgBF,EAAKgB,CAAe,CAAC,EAgBrD,GAdIG,IAEFC,EAAUJ,CAAe,EAAI,CAAC,CAAC,CAACe,GAIlCF,EAAOC,CAAC,GAAMD,EAAOC,EAAI,CAAC,GAAK,EAAK,GAAKC,EAGrCzE,IACFuE,EAAOC,CAAC,IACJR,EAAWQ,EAAI,CAAC,EAAIR,EAAWQ,CAAC,IAAM,EAAK,EAAIR,EAAWQ,EAAI,CAAC,GAGjED,EAAOC,CAAC,EAAIL,IACdF,EAAaT,EAAUxD,EAAG0D,CAAe,EAIrCO,GAAcX,GAAkB,CAMlC,GAJAA,EAAmBW,EACnBV,EAAeG,EAGXH,GAAgBF,EAClB,MAIFhB,EAAQ,KAAK,IAAI,EAAG,EAAIgB,EAAmBE,CAAY,CACzD,CAEJ,CAKA,GAFcC,EAAUxD,EAAI,EAAGqD,CAAgB,EAEnCC,EACV,MAGFU,EAAaO,CACf,CAEA,IAAMG,EAAS,CACb,QAASnB,GAAgB,EAEzB,MAAO,KAAK,IAAI,KAAOU,CAAU,CACnC,EAEA,GAAIJ,EAAgB,CAClB,IAAMtC,EAAUW,GAAqB4B,EAAW1B,CAAkB,EAC7Db,EAAQ,OAEF0B,IACTyB,EAAO,QAAUnD,GAFjBmD,EAAO,QAAU,EAIrB,CAEA,OAAOA,CACT,CAEA,SAASC,GAAsBhC,EAAS,CACtC,IAAIwB,EAAO,CAAC,EAEZ,QAASnE,EAAI,EAAGC,EAAM0C,EAAQ,OAAQ3C,EAAIC,EAAKD,GAAK,EAAG,CACrD,IAAM4E,EAAOjC,EAAQ,OAAO3C,CAAC,EAC7BmE,EAAKS,CAAI,GAAKT,EAAKS,CAAI,GAAK,GAAM,GAAM3E,EAAMD,EAAI,CACpD,CAEA,OAAOmE,CACT,CAEA,IAAMU,EAAkB,OAAO,UAAU,WACjCC,GAAQA,EAAI,UAAU,KAAK,EAAE,QAAQ,ykEAA0kE,EAAE,IACjnEA,GAAQA,GAEhB,SAASC,GAAaxD,EAAS,CAC7B,GAAIA,EAAQ,QAAU,EAAG,OAAOA,EAEhCA,EAAQ,KAAK,CAACnB,EAAGC,IAAMD,EAAE,CAAC,EAAIC,EAAE,CAAC,GAAKD,EAAE,CAAC,EAAIC,EAAE,CAAC,CAAC,EAEjD,IAAM2E,EAAS,CAACzD,EAAQ,CAAC,CAAC,EAE1B,QAASvB,EAAI,EAAGC,EAAMsB,EAAQ,OAAQvB,EAAIC,EAAKD,GAAK,EAAG,CACrD,IAAMiF,EAAOD,EAAOA,EAAO,OAAS,CAAC,EAC/BE,EAAO3D,EAAQvB,CAAC,EAClBkF,EAAK,CAAC,GAAKD,EAAK,CAAC,EAAI,EACvBA,EAAK,CAAC,EAAI,KAAK,IAAIA,EAAK,CAAC,EAAGC,EAAK,CAAC,CAAC,EAEnCF,EAAO,KAAKE,CAAI,CAEpB,CAEA,OAAOF,CACT,CAEA,IAAMG,EAAN,KAAkB,CAChB,YACExC,EACA,CACE,SAAAE,EAAWrC,EAAO,SAClB,UAAAuC,EAAYvC,EAAO,UACnB,SAAAsC,EAAWtC,EAAO,SAClB,eAAAyC,EAAiBzC,EAAO,eACxB,eAAAwC,EAAiBxC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,gBAAA4E,EAAkB5E,EAAO,gBACzB,iBAAA6E,EAAmB7E,EAAO,iBAC1B,eAAA0C,EAAiB1C,EAAO,cAC1B,EAAI,CAAC,EACL,CAmBA,GAlBA,KAAK,QAAU,CACb,SAAAqC,EACA,UAAAE,EACA,SAAAD,EACA,eAAAG,EACA,eAAAD,EACA,mBAAAZ,EACA,gBAAAgD,EACA,iBAAAC,EACA,eAAAnC,CACF,EAEAP,EAAUyC,EAAkBzC,EAAUA,EAAQ,YAAY,EAC1DA,EAAU0C,EAAmBR,EAAgBlC,CAAO,EAAIA,EACxD,KAAK,QAAUA,EAEf,KAAK,OAAS,CAAC,EAEX,CAAC,KAAK,QAAQ,OAChB,OAGF,IAAM2C,EAAW,CAAC3C,EAAS4C,IAAe,CACxC,KAAK,OAAO,KAAK,CACf,QAAA5C,EACA,SAAUgC,GAAsBhC,CAAO,EACvC,WAAA4C,CACF,CAAC,CACH,EAEMtF,EAAM,KAAK,QAAQ,OAEzB,GAAIA,EAAMuC,EAAU,CAClB,IAAIxC,EAAI,EACFwF,EAAYvF,EAAMuC,EAClBF,EAAMrC,EAAMuF,EAElB,KAAOxF,EAAIsC,GACTgD,EAAS,KAAK,QAAQ,OAAOtF,EAAGwC,CAAQ,EAAGxC,CAAC,EAC5CA,GAAKwC,EAGP,GAAIgD,EAAW,CACb,IAAMD,EAAatF,EAAMuC,EACzB8C,EAAS,KAAK,QAAQ,OAAOC,CAAU,EAAGA,CAAU,CACtD,CACF,MACED,EAAS,KAAK,QAAS,CAAC,CAE5B,CAEA,SAAS5C,EAAM,CACb,GAAM,CAAE,gBAAA0C,EAAiB,iBAAAC,EAAkB,eAAApC,CAAe,EAAI,KAAK,QAMnE,GAJAP,EAAO0C,EAAkB1C,EAAOA,EAAK,YAAY,EACjDA,EAAO2C,EAAmBR,EAAgBnC,CAAI,EAAIA,EAG9C,KAAK,UAAYA,EAAM,CACzB,IAAIgC,EAAS,CACX,QAAS,GACT,MAAO,CACT,EAEA,OAAIzB,IACFyB,EAAO,QAAU,CAAC,CAAC,EAAGhC,EAAK,OAAS,CAAC,CAAC,GAGjCgC,CACT,CAGA,GAAM,CACJ,SAAA7B,EACA,SAAAC,EACA,UAAAC,EACA,eAAAC,EACA,mBAAAZ,EACA,eAAAc,CACF,EAAI,KAAK,QAELuC,EAAa,CAAC,EACdC,EAAa,EACbC,EAAa,GAEjB,KAAK,OAAO,QAAQ,CAAC,CAAE,QAAAhD,EAAS,SAAAiD,EAAU,WAAAL,CAAW,IAAM,CACzD,GAAM,CAAE,QAAAM,EAAS,MAAA9B,EAAO,QAAAxC,CAAQ,EAAIkB,GAAOC,EAAMC,EAASiD,EAAU,CAClE,SAAU/C,EAAW0C,EACrB,SAAAzC,EACA,UAAAC,EACA,eAAAC,EACA,mBAAAZ,EACA,eAAAa,EACA,eAAAC,CACF,CAAC,EAEG2C,IACFF,EAAa,IAGfD,GAAc3B,EAEV8B,GAAWtE,GACbkE,EAAW,KAAK,GAAGlE,CAAO,CAE9B,CAAC,EAED,IAAImD,EAAS,CACX,QAASiB,EACT,MAAOA,EAAaD,EAAa,KAAK,OAAO,OAAS,CACxD,EAEA,OAAIC,GAAc1C,IAChByB,EAAO,QAAUK,GAAaU,CAAU,GAGnCf,CACT,CACF,EAEMoB,EAAN,KAAgB,CACd,YAAYnD,EAAS,CACnB,KAAK,QAAUA,CACjB,CACA,OAAO,aAAaA,EAAS,CAC3B,OAAOoD,GAASpD,EAAS,KAAK,UAAU,CAC1C,CACA,OAAO,cAAcA,EAAS,CAC5B,OAAOoD,GAASpD,EAAS,KAAK,WAAW,CAC3C,CACA,QAAiB,CAAC,CACpB,EAEA,SAASoD,GAASpD,EAASqD,EAAK,CAC9B,IAAMC,EAAUtD,EAAQ,MAAMqD,CAAG,EACjC,OAAOC,EAAUA,EAAQ,CAAC,EAAI,IAChC,CAIA,IAAMC,GAAN,cAAyBJ,CAAU,CACjC,YAAYnD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,OACT,CACA,WAAW,YAAa,CACtB,MAAO,WACT,CACA,WAAW,aAAc,CACvB,MAAO,SACT,CACA,OAAOD,EAAM,CACX,IAAMmD,EAAUnD,IAAS,KAAK,QAE9B,MAAO,CACL,QAAAmD,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAG,KAAK,QAAQ,OAAS,CAAC,CACtC,CACF,CACF,EAIMM,GAAN,cAAgCL,CAAU,CACxC,YAAYnD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,eACT,CACA,WAAW,YAAa,CACtB,MAAO,WACT,CACA,WAAW,aAAc,CACvB,MAAO,SACT,CACA,OAAOD,EAAM,CAEX,IAAMmD,EADQnD,EAAK,QAAQ,KAAK,OAAO,IACb,GAE1B,MAAO,CACL,QAAAmD,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAGnD,EAAK,OAAS,CAAC,CAC9B,CACF,CACF,EAIM0D,GAAN,cAA+BN,CAAU,CACvC,YAAYnD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,cACT,CACA,WAAW,YAAa,CACtB,MAAO,YACT,CACA,WAAW,aAAc,CACvB,MAAO,UACT,CACA,OAAOD,EAAM,CACX,IAAMmD,EAAUnD,EAAK,WAAW,KAAK,OAAO,EAE5C,MAAO,CACL,QAAAmD,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAG,KAAK,QAAQ,OAAS,CAAC,CACtC,CACF,CACF,EAIMQ,GAAN,cAAsCP,CAAU,CAC9C,YAAYnD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,sBACT,CACA,WAAW,YAAa,CACtB,MAAO,aACT,CACA,WAAW,aAAc,CACvB,MAAO,WACT,CACA,OAAOD,EAAM,CACX,IAAMmD,EAAU,CAACnD,EAAK,WAAW,KAAK,OAAO,EAE7C,MAAO,CACL,QAAAmD,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAGnD,EAAK,OAAS,CAAC,CAC9B,CACF,CACF,EAIM4D,GAAN,cAA+BR,CAAU,CACvC,YAAYnD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,cACT,CACA,WAAW,YAAa,CACtB,MAAO,YACT,CACA,WAAW,aAAc,CACvB,MAAO,UACT,CACA,OAAOD,EAAM,CACX,IAAMmD,EAAUnD,EAAK,SAAS,KAAK,OAAO,EAE1C,MAAO,CACL,QAAAmD,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAACnD,EAAK,OAAS,KAAK,QAAQ,OAAQA,EAAK,OAAS,CAAC,CAC9D,CACF,CACF,EAIM6D,GAAN,cAAsCT,CAAU,CAC9C,YAAYnD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,sBACT,CACA,WAAW,YAAa,CACtB,MAAO,aACT,CACA,WAAW,aAAc,CACvB,MAAO,WACT,CACA,OAAOD,EAAM,CACX,IAAMmD,EAAU,CAACnD,EAAK,SAAS,KAAK,OAAO,EAC3C,MAAO,CACL,QAAAmD,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAGnD,EAAK,OAAS,CAAC,CAC9B,CACF,CACF,EAEM8D,EAAN,cAAyBV,CAAU,CACjC,YACEnD,EACA,CACE,SAAAE,EAAWrC,EAAO,SAClB,UAAAuC,EAAYvC,EAAO,UACnB,SAAAsC,EAAWtC,EAAO,SAClB,eAAAyC,EAAiBzC,EAAO,eACxB,eAAAwC,EAAiBxC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,gBAAA4E,EAAkB5E,EAAO,gBACzB,iBAAA6E,EAAmB7E,EAAO,iBAC1B,eAAA0C,EAAiB1C,EAAO,cAC1B,EAAI,CAAC,EACL,CACA,MAAMmC,CAAO,EACb,KAAK,aAAe,IAAIwC,EAAYxC,EAAS,CAC3C,SAAAE,EACA,UAAAE,EACA,SAAAD,EACA,eAAAG,EACA,eAAAD,EACA,mBAAAZ,EACA,gBAAAgD,EACA,iBAAAC,EACA,eAAAnC,CACF,CAAC,CACH,CACA,WAAW,MAAO,CAChB,MAAO,OACT,CACA,WAAW,YAAa,CACtB,MAAO,UACT,CACA,WAAW,aAAc,CACvB,MAAO,QACT,CACA,OAAOR,EAAM,CACX,OAAO,KAAK,aAAa,SAASA,CAAI,CACxC,CACF,EAIM+D,EAAN,cAA2BX,CAAU,CACnC,YAAYnD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,SACT,CACA,WAAW,YAAa,CACtB,MAAO,WACT,CACA,WAAW,aAAc,CACvB,MAAO,SACT,CACA,OAAOD,EAAM,CACX,IAAIG,EAAW,EACXpD,EAEE8B,EAAU,CAAC,EACX4B,EAAa,KAAK,QAAQ,OAGhC,MAAQ1D,EAAQiD,EAAK,QAAQ,KAAK,QAASG,CAAQ,GAAK,IACtDA,EAAWpD,EAAQ0D,EACnB5B,EAAQ,KAAK,CAAC9B,EAAOoD,EAAW,CAAC,CAAC,EAGpC,IAAMgD,EAAU,CAAC,CAACtE,EAAQ,OAE1B,MAAO,CACL,QAAAsE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAAtE,CACF,CACF,CACF,EAGMmF,GAAY,CAChBR,GACAO,EACAL,GACAC,GACAE,GACAD,GACAH,GACAK,CACF,EAEMG,GAAeD,GAAU,OAGzBE,GAAW,qCACXC,GAAW,IAKjB,SAASC,GAAWnE,EAASoE,EAAU,CAAC,EAAG,CACzC,OAAOpE,EAAQ,MAAMkE,EAAQ,EAAE,IAAKrF,GAAS,CAC3C,IAAIwF,EAAQxF,EACT,KAAK,EACL,MAAMoF,EAAQ,EACd,OAAQpF,GAASA,GAAQ,CAAC,CAACA,EAAK,KAAK,CAAC,EAErCyF,EAAU,CAAC,EACf,QAASjH,EAAI,EAAGC,EAAM+G,EAAM,OAAQhH,EAAIC,EAAKD,GAAK,EAAG,CACnD,IAAMkH,EAAYF,EAAMhH,CAAC,EAGrBmH,EAAQ,GACR/F,EAAM,GACV,KAAO,CAAC+F,GAAS,EAAE/F,EAAMuF,IAAc,CACrC,IAAMS,EAAWV,GAAUtF,CAAG,EAC1BiG,EAAQD,EAAS,aAAaF,CAAS,EACvCG,IACFJ,EAAQ,KAAK,IAAIG,EAASC,EAAON,CAAO,CAAC,EACzCI,EAAQ,GAEZ,CAEA,GAAI,CAAAA,EAMJ,IADA/F,EAAM,GACC,EAAEA,EAAMuF,IAAc,CAC3B,IAAMS,EAAWV,GAAUtF,CAAG,EAC1BiG,EAAQD,EAAS,cAAcF,CAAS,EAC5C,GAAIG,EAAO,CACTJ,EAAQ,KAAK,IAAIG,EAASC,EAAON,CAAO,CAAC,EACzC,KACF,CACF,CACF,CAEA,OAAOE,CACT,CAAC,CACH,CAIA,IAAMK,GAAgB,IAAI,IAAI,CAACd,EAAW,KAAMC,EAAa,IAAI,CAAC,EA8B5Dc,GAAN,KAAqB,CACnB,YACE5E,EACA,CACE,gBAAAyC,EAAkB5E,EAAO,gBACzB,iBAAA6E,EAAmB7E,EAAO,iBAC1B,eAAAyC,EAAiBzC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,eAAA0C,EAAiB1C,EAAO,eACxB,eAAAwC,EAAiBxC,EAAO,eACxB,SAAAqC,EAAWrC,EAAO,SAClB,UAAAuC,EAAYvC,EAAO,UACnB,SAAAsC,EAAWtC,EAAO,QACpB,EAAI,CAAC,EACL,CACA,KAAK,MAAQ,KACb,KAAK,QAAU,CACb,gBAAA4E,EACA,iBAAAC,EACA,eAAApC,EACA,mBAAAb,EACA,eAAAY,EACA,eAAAE,EACA,SAAAL,EACA,UAAAE,EACA,SAAAD,CACF,EAEAH,EAAUyC,EAAkBzC,EAAUA,EAAQ,YAAY,EAC1DA,EAAU0C,EAAmBR,EAAgBlC,CAAO,EAAIA,EACxD,KAAK,QAAUA,EACf,KAAK,MAAQmE,GAAW,KAAK,QAAS,KAAK,OAAO,CACpD,CAEA,OAAO,UAAUU,EAAGT,EAAS,CAC3B,OAAOA,EAAQ,iBACjB,CAEA,SAASrE,EAAM,CACb,IAAMsE,EAAQ,KAAK,MAEnB,GAAI,CAACA,EACH,MAAO,CACL,QAAS,GACT,MAAO,CACT,EAGF,GAAM,CAAE,eAAA/D,EAAgB,gBAAAmC,EAAiB,iBAAAC,CAAiB,EAAI,KAAK,QAEnE3C,EAAO0C,EAAkB1C,EAAOA,EAAK,YAAY,EACjDA,EAAO2C,EAAmBR,EAAgBnC,CAAI,EAAIA,EAElD,IAAI+E,EAAa,EACbhC,EAAa,CAAC,EACdC,EAAa,EAGjB,QAAS1F,EAAI,EAAG0H,EAAOV,EAAM,OAAQhH,EAAI0H,EAAM1H,GAAK,EAAG,CACrD,IAAM0G,EAAYM,EAAMhH,CAAC,EAGzByF,EAAW,OAAS,EACpBgC,EAAa,EAGb,QAASjD,EAAI,EAAGmD,EAAOjB,EAAU,OAAQlC,EAAImD,EAAMnD,GAAK,EAAG,CACzD,IAAM4C,EAAWV,EAAUlC,CAAC,EACtB,CAAE,QAAAqB,EAAS,QAAAtE,EAAS,MAAAwC,CAAM,EAAIqD,EAAS,OAAO1E,CAAI,EAExD,GAAImD,GAGF,GAFA4B,GAAc,EACd/B,GAAc3B,EACVd,EAAgB,CAClB,IAAM2E,EAAOR,EAAS,YAAY,KAC9BE,GAAc,IAAIM,CAAI,EACxBnC,EAAW,KAAK,GAAGlE,CAAO,EAE1BkE,EAAW,KAAKlE,CAAO,CAE3B,MACK,CACLmE,EAAa,EACb+B,EAAa,EACbhC,EAAW,OAAS,EACpB,KACF,CACF,CAGA,GAAIgC,EAAY,CACd,IAAI/C,EAAS,CACX,QAAS,GACT,MAAOgB,EAAa+B,CACtB,EAEA,OAAIxE,IACFyB,EAAO,QAAUe,GAGZf,CACT,CACF,CAGA,MAAO,CACL,QAAS,GACT,MAAO,CACT,CACF,CACF,EAEMmD,GAAsB,CAAC,EAE7B,SAASC,MAAYC,EAAM,CACzBF,GAAoB,KAAK,GAAGE,CAAI,CAClC,CAEA,SAASC,GAAerF,EAASoE,EAAS,CACxC,QAAS/G,EAAI,EAAGC,EAAM4H,GAAoB,OAAQ7H,EAAIC,EAAKD,GAAK,EAAG,CACjE,IAAIiI,EAAgBJ,GAAoB7H,CAAC,EACzC,GAAIiI,EAAc,UAAUtF,EAASoE,CAAO,EAC1C,OAAO,IAAIkB,EAActF,EAASoE,CAAO,CAE7C,CAEA,OAAO,IAAI5B,EAAYxC,EAASoE,CAAO,CACzC,CAEA,IAAMmB,EAAkB,CACtB,IAAK,OACL,GAAI,KACN,EAEMC,GAAU,CACd,KAAM,QACN,QAAS,MACX,EAEMC,GAAgBpB,GACpB,CAAC,EAAEA,EAAMkB,EAAgB,GAAG,GAAKlB,EAAMkB,EAAgB,EAAE,GAErDG,GAAUrB,GAAU,CAAC,CAACA,EAAMmB,GAAQ,IAAI,EAExCG,GAAUtB,GACd,CAAC9H,EAAQ8H,CAAK,GAAKuB,GAASvB,CAAK,GAAK,CAACoB,GAAapB,CAAK,EAErDwB,GAAqBxB,IAAW,CACpC,CAACkB,EAAgB,GAAG,EAAG,OAAO,KAAKlB,CAAK,EAAE,IAAKjJ,IAAS,CACtD,CAACA,CAAG,EAAGiJ,EAAMjJ,CAAG,CAClB,EAAE,CACJ,GAIA,SAAS0K,GAAMzB,EAAOD,EAAS,CAAE,KAAA2B,EAAO,EAAK,EAAI,CAAC,EAAG,CACnD,IAAMC,EAAQ3B,GAAU,CACtB,IAAIzI,EAAO,OAAO,KAAKyI,CAAK,EAEtB4B,EAAcP,GAAOrB,CAAK,EAEhC,GAAI,CAAC4B,GAAerK,EAAK,OAAS,GAAK,CAAC6J,GAAapB,CAAK,EACxD,OAAO2B,EAAKH,GAAkBxB,CAAK,CAAC,EAGtC,GAAIsB,GAAOtB,CAAK,EAAG,CACjB,IAAMjJ,EAAM6K,EAAc5B,EAAMmB,GAAQ,IAAI,EAAI5J,EAAK,CAAC,EAEhDoE,EAAUiG,EAAc5B,EAAMmB,GAAQ,OAAO,EAAInB,EAAMjJ,CAAG,EAEhE,GAAI,CAACkB,EAAS0D,CAAO,EACnB,MAAM,IAAI,MAAM7E,GAAqCC,CAAG,CAAC,EAG3D,IAAMU,EAAM,CACV,MAAOW,GAAYrB,CAAG,EACtB,QAAA4E,CACF,EAEA,OAAI+F,IACFjK,EAAI,SAAWuJ,GAAerF,EAASoE,CAAO,GAGzCtI,CACT,CAEA,IAAIoK,EAAO,CACT,SAAU,CAAC,EACX,SAAUtK,EAAK,CAAC,CAClB,EAEA,OAAAA,EAAK,QAASR,GAAQ,CACpB,IAAM6B,EAAQoH,EAAMjJ,CAAG,EAEnBmB,EAAQU,CAAK,GACfA,EAAM,QAAS4B,GAAS,CACtBqH,EAAK,SAAS,KAAKF,EAAKnH,CAAI,CAAC,CAC/B,CAAC,CAEL,CAAC,EAEMqH,CACT,EAEA,OAAKT,GAAapB,CAAK,IACrBA,EAAQwB,GAAkBxB,CAAK,GAG1B2B,EAAK3B,CAAK,CACnB,CAEA,SAAS8B,GACPpE,EACA,CAAE,gBAAAqE,EAAkBvI,EAAO,eAAgB,EAC3C,CACA,IAAIkF,EAAa,EAEjBhB,EAAO,QAAQ,QAAQ,CAAC,CAAE,IAAA3G,EAAK,KAAA2C,EAAM,MAAAqD,CAAM,IAAM,CAC/C,IAAMhF,EAAShB,EAAMA,EAAI,OAAS,KAElC2H,GAAc,KAAK,IACjB3B,IAAU,GAAKhF,EAAS,OAAO,QAAUgF,GACxChF,GAAU,IAAMgK,EAAkB,EAAIrI,EACzC,CACF,CAAC,EAEDgE,EAAO,MAAQgB,CACjB,CAGA,SAASsD,GACP/B,EACA,CAAE,gBAAA8B,EAAkBvI,EAAO,eAAgB,EAC3C,CACAyG,EAAQ,QAASvC,GAAW,CAC1BoE,GAAmBpE,EAAQ,CAAE,gBAAAqE,CAAgB,CAAC,CAChD,CAAC,CACH,CAIA,IAAME,GAAN,KAAc,CACZ,YAAYC,EAAO,CACjB,KAAK,MAAQA,EACb,KAAK,KAAO,CAAC,CACf,CACA,IAAI,MAAO,CACT,OAAO,KAAK,KAAK,MACnB,CACA,aAAanF,EAAO,CAClB,OAAO,KAAK,KAAO,KAAK,OAASA,EAAQ,KAAK,KAAK,CAAC,EAAE,KACxD,CACA,OAAOvC,EAAM,CACP,KAAK,KAAO,KAAK,OACnB,KAAK,KAAK,KAAKA,CAAI,EACnB,KAAK,UAAU,KAAK,KAAO,CAAC,GACnBA,EAAK,MAAQ,KAAK,KAAK,CAAC,EAAE,QACnC,KAAK,KAAK,CAAC,EAAIA,EACf,KAAK,UAAU,CAAC,EAEpB,CACA,cAAc2H,EAAQ,CACpB,OAAO,KAAK,KAAK,KAAKA,CAAM,CAC9B,CACA,UAAUnJ,EAAG,CACX,IAAMoJ,EAAO,KAAK,KAClB,KAAOpJ,EAAI,GAAG,CACZ,IAAMqJ,EAAUrJ,EAAI,GAAM,EAC1B,GAAIoJ,EAAKpJ,CAAC,EAAE,OAASoJ,EAAKC,CAAM,EAAE,MAAO,MACzC,IAAMC,EAAMF,EAAKpJ,CAAC,EAClBoJ,EAAKpJ,CAAC,EAAIoJ,EAAKC,CAAM,EACrBD,EAAKC,CAAM,EAAIC,EACftJ,EAAIqJ,CACN,CACF,CACA,UAAUrJ,EAAG,CACX,IAAMoJ,EAAO,KAAK,KACZnJ,EAAMmJ,EAAK,OACbG,EAAUvJ,EACd,EAAG,CACDA,EAAIuJ,EACJ,IAAMC,EAAO,EAAIxJ,EAAI,EACfyJ,EAAQ,EAAIzJ,EAAI,EAOtB,GANIwJ,EAAOvJ,GAAOmJ,EAAKI,CAAI,EAAE,MAAQJ,EAAKG,CAAO,EAAE,QACjDA,EAAUC,GAERC,EAAQxJ,GAAOmJ,EAAKK,CAAK,EAAE,MAAQL,EAAKG,CAAO,EAAE,QACnDA,EAAUE,GAERF,IAAYvJ,EAAG,CACjB,IAAMsJ,EAAMF,EAAKpJ,CAAC,EAClBoJ,EAAKpJ,CAAC,EAAIoJ,EAAKG,CAAO,EACtBH,EAAKG,CAAO,EAAID,CAClB,CACF,OAASC,IAAYvJ,EACvB,CACF,EAEA,SAAS0J,GAAiBhF,EAAQzC,EAAM,CACtC,IAAMgE,EAAUvB,EAAO,QACvBzC,EAAK,QAAU,CAAC,EAEXtC,EAAUsG,CAAO,GAItBA,EAAQ,QAAS1D,GAAU,CACzB,GAAI,CAAC5C,EAAU4C,EAAM,OAAO,GAAK,CAACA,EAAM,QAAQ,OAC9C,OAGF,GAAM,CAAE,QAAAhB,EAAS,MAAA3B,CAAM,EAAI2C,EAEvB9D,EAAM,CACR,QAAA8C,EACA,MAAA3B,CACF,EAEI2C,EAAM,MACR9D,EAAI,IAAM8D,EAAM,IAAI,KAGlBA,EAAM,IAAM,KACd9D,EAAI,SAAW8D,EAAM,KAGvBN,EAAK,QAAQ,KAAKxD,CAAG,CACvB,CAAC,CACH,CAEA,SAASkL,GAAejF,EAAQzC,EAAM,CACpCA,EAAK,MAAQyC,EAAO,KACtB,CAEA,SAASkF,GACP3C,EACA/F,EACA,CACE,eAAA+B,EAAiBzC,EAAO,eACxB,aAAAqJ,EAAerJ,EAAO,YACxB,EAAI,CAAC,EACL,CACA,IAAMsJ,EAAe,CAAC,EAEtB,OAAI7G,GAAgB6G,EAAa,KAAKJ,EAAgB,EAClDG,GAAcC,EAAa,KAAKH,EAAc,EAE3C1C,EAAQ,IAAKvC,GAAW,CAC7B,GAAM,CAAE,IAAAtD,CAAI,EAAIsD,EAEVzC,EAAO,CACX,KAAMf,EAAKE,CAAG,EACd,SAAUA,CACZ,EAEA,OAAI0I,EAAa,QACfA,EAAa,QAASC,GAAgB,CACpCA,EAAYrF,EAAQzC,CAAI,CAC1B,CAAC,EAGIA,CACT,CAAC,CACH,CAEA,IAAM+H,EAAN,KAAW,CACT,YAAY9I,EAAM6F,EAAU,CAAC,EAAGtH,EAAO,CACrC,KAAK,QAAU,CAAE,GAAGe,EAAQ,GAAGuG,CAAQ,EAGrC,KAAK,QAAQ,kBAMf,KAAK,UAAY,IAAIzI,GAAS,KAAK,QAAQ,IAAI,EAE/C,KAAK,cAAc4C,EAAMzB,CAAK,EAE9B,KAAK,WAAa,KAClB,KAAK,cAAgB,IACvB,CAEA,aAAauH,EAAO,CAClB,GAAI,KAAK,aAAeA,EACtB,OAAO,KAAK,cAEd,IAAMI,EAAWY,GAAehB,EAAO,KAAK,OAAO,EACnD,YAAK,WAAaA,EAClB,KAAK,cAAgBI,EACdA,CACT,CAEA,cAAclG,EAAMzB,EAAO,CAGzB,GAFA,KAAK,MAAQyB,EAETzB,GAAS,EAAEA,aAAiBuB,GAC9B,MAAM,IAAI,MAAMnD,EAAoB,EAGtC,KAAK,SACH4B,GACAqC,GAAY,KAAK,QAAQ,KAAM,KAAK,MAAO,CACzC,MAAO,KAAK,QAAQ,MACpB,gBAAiB,KAAK,QAAQ,eAChC,CAAC,CACL,CAEA,IAAIT,EAAK,CACF1B,EAAU0B,CAAG,IAIlB,KAAK,MAAM,KAAKA,CAAG,EACnB,KAAK,SAAS,IAAIA,CAAG,EACvB,CAEA,OAAO4I,EAAY,IAAoB,GAAO,CAC5C,IAAMhD,EAAU,CAAC,EACXiD,EAAkB,CAAC,EAEzB,QAASlK,EAAI,EAAGC,EAAM,KAAK,MAAM,OAAQD,EAAIC,EAAKD,GAAK,EACjDiK,EAAU,KAAK,MAAMjK,CAAC,EAAGA,CAAC,IAC5BiH,EAAQ,KAAK,KAAK,MAAMjH,CAAC,CAAC,EAC1BkK,EAAgB,KAAKlK,CAAC,GAI1B,GAAIkK,EAAgB,OAAQ,CAE1B,QAASlK,EAAIkK,EAAgB,OAAS,EAAGlK,GAAK,EAAGA,GAAK,EACpD,KAAK,MAAM,OAAOkK,EAAgBlK,CAAC,EAAG,CAAC,EAEzC,KAAK,SAAS,UAAUkK,CAAe,CACzC,CAEA,OAAOjD,CACT,CAEA,SAAS7F,EAAK,CACZ,KAAK,MAAM,OAAOA,EAAK,CAAC,EACxB,KAAK,SAAS,SAASA,CAAG,CAC5B,CAEA,UAAW,CACT,OAAO,KAAK,QACd,CAEA,OAAO4F,EAAO,CAAE,MAAAkC,EAAQ,EAAG,EAAI,CAAC,EAAG,CACjC,GAAM,CACJ,eAAAjG,EACA,aAAA4G,EACA,WAAAM,EACA,OAAAhB,EACA,gBAAAJ,CACF,EAAI,KAAK,QAEHqB,EAAUvK,EAASqJ,CAAK,GAAKA,EAAQ,GAAKjK,EAAS+H,CAAK,EAE1DC,EAEJ,GAAImD,EAAS,CACX,IAAMhB,EAAO,IAAIH,GAAQC,CAAK,EAC1BjK,EAAS,KAAK,MAAM,CAAC,CAAC,EACxB,KAAK,kBAAkB+H,EAAO,CAAE,KAAAoC,EAAM,gBAAAL,CAAgB,CAAC,EAEvD,KAAK,kBAAkB/B,EAAO,CAAE,KAAAoC,EAAM,gBAAAL,CAAgB,CAAC,EAEzD9B,EAAUmC,EAAK,cAAcD,CAAM,CACrC,MACElC,EAAUhI,EAAS+H,CAAK,EACpB/H,EAAS,KAAK,MAAM,CAAC,CAAC,EACpB,KAAK,kBAAkB+H,CAAK,EAC5B,KAAK,kBAAkBA,CAAK,EAC9B,KAAK,eAAeA,CAAK,EAE7BgC,GAAa/B,EAAS,CAAE,gBAAA8B,CAAgB,CAAC,EAErCoB,GACFlD,EAAQ,KAAKkC,CAAM,EAGjBtJ,EAASqJ,CAAK,GAAKA,EAAQ,KAC7BjC,EAAUA,EAAQ,MAAM,EAAGiC,CAAK,GAIpC,OAAOU,GAAO3C,EAAS,KAAK,MAAO,CACjC,eAAAhE,EACA,aAAA4G,CACF,CAAC,CACH,CAEA,kBAAkB7C,EAAO,CAAE,KAAAoC,EAAM,gBAAAL,CAAgB,EAAI,CAAC,EAAG,CACvD,IAAM3B,EAAW,KAAK,aAAaJ,CAAK,EAClC,CAAE,QAAA7F,CAAQ,EAAI,KAAK,SACnB8F,EAAUmC,EAAO,KAAO,CAAC,EAG/B,OAAAjI,EAAQ,QAAQ,CAAC,CAAE,EAAGuB,EAAM,EAAGtB,EAAK,EAAGV,CAAK,IAAM,CAChD,GAAI,CAACf,EAAU+C,CAAI,EACjB,OAGF,GAAM,CAAE,QAAAmD,EAAS,MAAA9B,EAAO,QAAAxC,CAAQ,EAAI6F,EAAS,SAAS1E,CAAI,EAE1D,GAAImD,EAAS,CACX,IAAMnB,EAAS,CACb,KAAMhC,EACN,IAAAtB,EACA,QAAS,CAAC,CAAE,MAAA2C,EAAO,MAAOrB,EAAM,KAAAhC,EAAM,QAAAa,CAAQ,CAAC,CACjD,EAEI6H,GACFN,GAAmBpE,EAAQ,CAAE,gBAAAqE,CAAgB,CAAC,EAC1CK,EAAK,aAAa1E,EAAO,KAAK,GAChC0E,EAAK,OAAO1E,CAAM,GAGpBuC,EAAQ,KAAKvC,CAAM,CAEvB,CACF,CAAC,EAEMuC,CACT,CAEA,eAAeD,EAAO,CAEpB,IAAMqD,EAAa5B,GAAMzB,EAAO,KAAK,OAAO,EAEtCsD,EAAW,CAACzB,EAAMrH,EAAMJ,IAAQ,CACpC,GAAI,CAACyH,EAAK,SAAU,CAClB,GAAM,CAAE,MAAAlK,EAAO,SAAAyI,CAAS,EAAIyB,EAEtB5C,EAAU,KAAK,aAAa,CAChC,IAAK,KAAK,UAAU,IAAItH,CAAK,EAC7B,MAAO,KAAK,SAAS,uBAAuB6C,EAAM7C,CAAK,EACvD,SAAAyI,CACF,CAAC,EAED,OAAInB,GAAWA,EAAQ,OACd,CACL,CACE,IAAA7E,EACA,KAAAI,EACA,QAAAyE,CACF,CACF,EAGK,CAAC,CACV,CAEA,IAAMsE,EAAM,CAAC,EACb,QAASvK,EAAI,EAAGC,EAAM4I,EAAK,SAAS,OAAQ7I,EAAIC,EAAKD,GAAK,EAAG,CAC3D,IAAMwK,EAAQ3B,EAAK,SAAS7I,CAAC,EACvB0E,EAAS4F,EAASE,EAAOhJ,EAAMJ,CAAG,EACxC,GAAIsD,EAAO,OACT6F,EAAI,KAAK,GAAG7F,CAAM,UACTmE,EAAK,WAAaX,EAAgB,IAC3C,MAAO,CAAC,CAEZ,CACA,OAAOqC,CACT,EAEMpJ,EAAU,KAAK,SAAS,QACxBsJ,EAAY,IAAI,IAChBxD,EAAU,CAAC,EAEjB,OAAA9F,EAAQ,QAAQ,CAAC,CAAE,EAAGK,EAAM,EAAGJ,CAAI,IAAM,CACvC,GAAIzB,EAAU6B,CAAI,EAAG,CACnB,IAAIkJ,EAAaJ,EAASD,EAAY7I,EAAMJ,CAAG,EAE3CsJ,EAAW,SAERD,EAAU,IAAIrJ,CAAG,IACpBqJ,EAAU,IAAIrJ,EAAK,CAAE,IAAAA,EAAK,KAAAI,EAAM,QAAS,CAAC,CAAE,CAAC,EAC7CyF,EAAQ,KAAKwD,EAAU,IAAIrJ,CAAG,CAAC,GAEjCsJ,EAAW,QAAQ,CAAC,CAAE,QAAAzE,CAAQ,IAAM,CAClCwE,EAAU,IAAIrJ,CAAG,EAAE,QAAQ,KAAK,GAAG6E,CAAO,CAC5C,CAAC,EAEL,CACF,CAAC,EAEMgB,CACT,CAEA,kBAAkBD,EAAO,CAAE,KAAAoC,EAAM,gBAAAL,CAAgB,EAAI,CAAC,EAAG,CACvD,IAAM3B,EAAW,KAAK,aAAaJ,CAAK,EAClC,CAAE,KAAAzI,EAAM,QAAA4C,CAAQ,EAAI,KAAK,SACzB8F,EAAUmC,EAAO,KAAO,CAAC,EAG/B,OAAAjI,EAAQ,QAAQ,CAAC,CAAE,EAAGK,EAAM,EAAGJ,CAAI,IAAM,CACvC,GAAI,CAACzB,EAAU6B,CAAI,EACjB,OAGF,IAAIyE,EAAU,CAAC,EAaf,GAVA1H,EAAK,QAAQ,CAACR,EAAK4D,IAAa,CAC9BsE,EAAQ,KACN,GAAG,KAAK,aAAa,CACnB,IAAAlI,EACA,MAAOyD,EAAKG,CAAQ,EACpB,SAAAyF,CACF,CAAC,CACH,CACF,CAAC,EAEGnB,EAAQ,OAAQ,CAClB,IAAMvB,EAAS,CAAE,IAAAtD,EAAK,KAAAI,EAAM,QAAAyE,CAAQ,EAEhCmD,GACFN,GAAmBpE,EAAQ,CAAE,gBAAAqE,CAAgB,CAAC,EAC1CK,EAAK,aAAa1E,EAAO,KAAK,GAChC0E,EAAK,OAAO1E,CAAM,GAGpBuC,EAAQ,KAAKvC,CAAM,CAEvB,CACF,CAAC,EAEMuC,CACT,CACA,aAAa,CAAE,IAAAlJ,EAAK,MAAA6B,EAAO,SAAAwH,CAAS,EAAG,CACrC,GAAI,CAACzH,EAAUC,CAAK,EAClB,MAAO,CAAC,EAGV,IAAIqG,EAAU,CAAC,EAEf,GAAI/G,EAAQU,CAAK,EACfA,EAAM,QAAQ,CAAC,CAAE,EAAG8C,EAAM,EAAGtB,EAAK,EAAGV,CAAK,IAAM,CAC9C,GAAI,CAACf,EAAU+C,CAAI,EACjB,OAGF,GAAM,CAAE,QAAAmD,EAAS,MAAA9B,EAAO,QAAAxC,CAAQ,EAAI6F,EAAS,SAAS1E,CAAI,EAEtDmD,GACFI,EAAQ,KAAK,CACX,MAAAlC,EACA,IAAAhG,EACA,MAAO2E,EACP,IAAAtB,EACA,KAAAV,EACA,QAAAa,CACF,CAAC,CAEL,CAAC,MACI,CACL,GAAM,CAAE,EAAGmB,EAAM,EAAGhC,CAAK,EAAId,EAEvB,CAAE,QAAAiG,EAAS,MAAA9B,EAAO,QAAAxC,CAAQ,EAAI6F,EAAS,SAAS1E,CAAI,EAEtDmD,GACFI,EAAQ,KAAK,CAAE,MAAAlC,EAAO,IAAAhG,EAAK,MAAO2E,EAAM,KAAAhC,EAAM,QAAAa,CAAQ,CAAC,CAE3D,CAEA,OAAO0E,CACT,CACF,EAEA+D,EAAK,QAAU,QACfA,EAAK,YAAclI,GACnBkI,EAAK,WAAahI,GAClBgI,EAAK,OAASxJ,EAGZwJ,EAAK,WAAavB,GAIlBX,GAASP,EAAc,EAGzByC,EAAK,IAAM,YAAaW,EAAS,CAC/BA,EAAQ,QAASC,GAAW9C,GAAS8C,CAAM,CAAC,CAC9C,ED9jDI,IAAAC,EAAA,6BArQG,SAASC,EAAkBC,EAA0C,CAC1E,OAAKA,EAAO,KAEV,EACE,MAAM,QAAQA,EAAO,IAAO,GAAMA,EAAO,KAAsB,OAAS,IAE1E,CAACA,EAAO,UACR,EACEA,EAAO,YACP,OAAO,KAAKA,EAAO,UAAuB,EAAE,OAAS,IAEvD,EACEA,EAAO,oBACP,OAAO,KAAKA,EAAO,kBAA+B,EAAE,OAAS,IAE/D,CAACA,EAAO,QACR,CAACA,EAAO,eACR,CAACA,EAAO,IAhBkB,EAkB9B,CAEO,SAASC,GAAcD,EAA0C,CACtE,MACE,CAACA,EAAO,MACR,CAACA,EAAO,MACR,CAACA,EAAO,UACR,CAACA,EAAO,YACR,CAACA,EAAO,oBACR,CAACA,EAAO,QACR,CAACA,EAAO,eACR,CAACA,EAAO,GAEZ,CAEO,SAASE,GAAcF,EAA0C,CACtE,OAAOA,EAAO,WAAgB,MAChC,CAEO,SAASG,GAAqBH,EAAyC,CAC5E,OAAID,EAAkBC,CAAM,EAAUA,EAAO,KACzCA,EAAO,KACF,SAAUA,EAAO,KAAsB,MAAM,WAClDA,EAAO,SAAoB,QAC3BA,EAAO,YAAiBA,EAAO,mBAQ1B,YANJA,EAAO,WACJ,OAAO,KAAKA,EAAO,UAAuB,EAAE,OAC5C,IACHA,EAAO,mBACJ,OAAO,KAAKA,EAAO,kBAA+B,EAAE,OACpD,EACqB,eAEzBA,EAAO,OAAkB,MACzBA,EAAO,cAAyB,sBAChCA,EAAO,IAAe,QAAQA,EAAO,GAAM,GAC3CC,GAAcD,CAAM,EAAU,eAC3B,gBACT,CAEO,SAASI,GAAeC,EAAkC,CAC/D,OAAIA,EAAO,SAAiBA,EAAO,SAC/BA,EAAO,UACFF,GAAqBE,EAAO,SAAoC,EAElE,SACT,CAMO,IAAMC,GAAN,KAAmB,CAChB,KACA,KAER,YAAYC,EAAyB,CACnC,KAAK,KAAO,IAAIC,EAAKD,EAAM,CACzB,aAAc,GACd,UAAW,GACX,eAAgB,GAChB,kBAAmB,GACnB,KAAM,CACJ,CAAE,KAAM,OAAQ,OAAQ,CAAE,EAC1B,CAAE,KAAM,YAAa,OAAQ,CAAE,EAC/B,CAAE,KAAM,kBAAmB,OAAQ,CAAE,EACrC,CAAE,KAAM,cAAe,OAAQ,CAAE,EACjC,CAAE,KAAM,yBAA0B,OAAQ,CAAE,EAC5C,CAAE,KAAM,cAAe,OAAQ,CAAE,EACjC,CAAE,KAAM,eAAgB,OAAQ,CAAE,EAClC,CAAE,KAAM,qBAAsB,OAAQ,CAAE,CAC1C,CACF,CAAC,EACD,KAAK,KAAOA,CACd,CAEA,OAAOE,EAAkC,CACvC,GAAI,CAACA,GAASA,EAAM,KAAK,EAAE,SAAW,EACpC,OAAO,KAAK,KAAK,OAAO,EAAE,EAAE,IAAKC,GAAWA,EAAO,IAAI,EAGzD,GAAI,CAACD,EAAM,SAAS,GAAG,EACrB,OAAO,KAAK,KAAK,OAAOA,CAAK,EAAE,IAAKC,GAAWA,EAAO,IAAI,EAG5D,IAAMC,EAAQF,EAAM,MAAM,GAAG,EACzBG,EAAmB,GAEvB,OAAID,EAAM,CAAC,IAAM,YAAcA,EAAM,SAAW,EACzCA,EAAM,CAAC,EAGVC,EAAc,CACZ,KAAM,CACJ,CAAE,KAAM,WAAY,EACpB,CACE,IAAK,CACH,CAAE,cAAeD,EAAM,CAAC,CAAE,EAC1B,CAAE,eAAgBA,EAAM,CAAC,CAAE,EAC3B,CAAE,qBAAsBA,EAAM,CAAC,CAAE,CACnC,CACF,CACF,CACF,EAbAC,EAAc,CAAE,KAAM,WAAY,EAe3BD,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,IAAMA,EAAM,CAAC,EACzDC,EAAc,CACZ,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACSA,EAAM,SAAW,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,EAClDC,EAAc,CACZ,KAAM,CACJ,CACE,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACA,CACE,IAAK,CACH,CAAE,YAAaA,EAAM,CAAC,CAAE,EACxB,CAAE,uBAAwBA,EAAM,CAAC,CAAE,CACrC,CACF,CACF,CACF,EACSA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,IAAMA,EAAM,CAAC,GAAKA,EAAM,CAAC,EACrEC,EAAc,CACZ,KAAM,CACJ,CACE,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACA,CACE,IAAK,CACH,CAAE,YAAaA,EAAM,CAAC,CAAE,EACxB,CAAE,uBAAwBA,EAAM,CAAC,CAAE,CACrC,CACF,CACF,CACF,EACSA,EAAM,QAAU,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,IAC7DC,EAAc,CACZ,KAAM,CACJ,CACE,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACA,CACE,IAAK,CACH,CAAE,YAAaA,EAAM,CAAC,CAAE,EACxB,CAAE,uBAAwBA,EAAM,CAAC,CAAE,CACrC,CACF,EACA,CACE,IAAK,CACH,CAAE,cAAeA,EAAM,CAAC,CAAE,EAC1B,CAAE,eAAgBA,EAAM,CAAC,CAAE,EAC3B,CAAE,qBAAsBA,EAAM,CAAC,CAAE,CACnC,CACF,CACF,CACF,GAEK,KAAK,KAAK,OAAOC,CAAW,EAAE,IAAKF,GAAWA,EAAO,IAAI,CAClE,CAEA,YAA0C,CACxC,OAAO,KAAK,IACd,CACF,EAEO,SAASG,GACdC,EACuE,CACvE,MAAO,CAACC,EAASC,IACX,CAACA,GAAcA,EAAW,OAAS,EAAUD,EACjCD,EAAO,OAAOE,CAAU,EACzB,KAAK,CAACC,EAAGC,IAAM,CAC5B,IAAMC,EAAO,GAAGF,EAAE,IAAI,IAAIA,EAAE,WAAW,GACjCG,EAAO,GAAGF,EAAE,IAAI,IAAIA,EAAE,WAAW,GACvC,OAAOC,EAAK,cAAcC,CAAI,CAChC,CAAC,CAEL,CAEO,SAASC,GACdd,EACmB,CACnB,IAAMe,EAA0B,CAAC,EACjC,QAAWC,KAAUhB,EAAK,UAAY,CAAC,EACrC,QAAWiB,KAAMD,EAAO,cAAgB,CAAC,EACvC,QAAWE,KAAOD,EAAG,SAAW,CAAC,EAC/BF,EAAK,KAAK,CACR,KAAMC,EAAO,IAAM,GACnB,UAAWA,EAAO,OAASA,EAAO,IAAM,GACxC,gBAAiBA,EAAO,YACxB,WAAYA,EAAO,OACnB,YAAaC,EAAG,MAAQ,GACxB,uBAAwBA,EAAG,YAC3B,gBAAiBA,EAAG,KACpB,OAAQC,CACV,CAAC,EAIP,QAAWA,KAAOlB,EAAK,WAAa,CAAC,EACnCe,EAAK,KAAK,CACR,KAAM,WACN,UAAW,YACX,YAAa,GACb,OAAQG,CACV,CAAC,EAEH,OAAOH,CACT,CAEO,SAASI,EAAmBC,EAA8B,CAC/D,OAAIA,EAAI,OAAS,WACR,YAAYA,EAAI,OAAO,IAAI,GAE7B,GAAGA,EAAI,IAAI,IAAIA,EAAI,WAAW,IAAIA,EAAI,OAAO,IAAI,EAC1D,CAMA,SAASC,IAAe,CACtB,SACE,QAAC,OACC,MAAM,KACN,OAAO,KACP,QAAQ,YACR,MAAM,6BACN,KAAK,eAEL,oBAAC,QAAK,EAAE,qMAAqM,KAC7M,OAAC,QAAK,EAAE,4MAA4M,GACtN,CAEJ,CAMO,SAASC,GAAkBC,EAI/B,CAGD,GAFwBA,EAAM,QAAU,WAGtC,SACE,QAAC,OACC,UAAW,iEAAiEA,EAAM,WAAa,EAAE,GAAG,KAAK,EAEzG,oBAAC,QAAK,UAAU,4DACd,mBAACF,GAAA,EAAa,EAChB,KACA,OAAC,QAAK,UAAU,wEAAwE,qBAExF,GACF,EAIJ,GAAM,CAACG,EAAQC,CAAW,EAAIF,EAAM,MAAM,MAAM,GAAG,EAC7CG,EAAcH,EAAM,WAAW,KAClCH,GAAQ,GAAGA,EAAI,IAAI,IAAIA,EAAI,WAAW,KAAOG,EAAM,KACtD,EAEA,GAAI,CAACG,EAAa,OAAO,KAEzB,IAAMC,EAAOD,EAAY,gBACnBE,EACJD,IAAS,eACL,0CACAA,IAAS,cACP,yCACA,2CAER,SACE,QAAC,OACC,UAAW,6BAA6BJ,EAAM,WAAa,EAAE,GAAG,KAAK,EAEpE,UAAAG,EAAY,aACX,OAAC,QAAK,UAAU,0BAA2B,SAAAA,EAAY,SAAS,KAElE,OAAC,QAAK,UAAU,gCACb,SAAAA,EAAY,WAAaF,EAC5B,KACA,QAAC,QAAK,UAAU,6BAA6B,cAAEA,EAAO,KAAC,KACvD,OAAC,QAAK,UAAU,+BAA+B,KAC/C,OAAC,QAAK,UAAW,kCAAkCI,CAAS,GACzD,SAAAH,EACH,GACF,CAEJ,CAEO,SAASI,GAAaN,EAG1B,CACD,GAAM,CAAE,UAAAO,CAAU,EAAIP,EACtB,SACE,QAAC,OAAI,UAAW,uBAAuBA,EAAM,WAAa,EAAE,GAAG,KAAK,EAClE,qBAAC,OAAI,UAAU,4BACb,oBAAC,QAAK,UAAU,2BACb,SAAAO,EAAU,OAAO,OAASA,EAAU,OAAO,KAC9C,EACCA,EAAU,OAAO,UAChB,QAAC,QAAK,UAAU,2BAA2B,cACvCA,EAAU,OAAO,KAAK,KAC1B,EAEDA,EAAU,OAAO,aAChB,OAAC,QAAK,UAAU,+BAA+B,oBAAQ,GAE3D,EACCA,EAAU,OAAO,YAChB,OAACC,GAAA,CAAa,QAASD,EAAU,OAAO,QAAS,GAErD,CAEJ,CAEO,SAASE,GAAWT,EAMxB,CACD,GAAM,CAAE,OAAAzB,EAAQ,KAAAmC,EAAO,QAAS,SAAAC,EAAU,QAAAC,CAAQ,EAAIZ,EAChDa,EAAQvC,GAAeC,CAAM,EAE/BuC,EAA4C,YAC5CvC,EAAO,SACTuC,EAAU,OAEVvC,EAAO,WACP,CAACN,EAAkBM,EAAO,SAAoC,IAE9DuC,EAAU,WAGZ,IAAMC,EAAcD,IAAY,QAAUA,IAAY,UAGtD,SACE,QAAC,QACC,UAAW,sDAAsDA,CAAO,IAJ1DJ,IAAS,SAAW,mCAAqC,EAIc,IAAIV,EAAM,WAAa,EAAE,GAAG,KAAK,EACtH,QACEY,GAAWG,EACNC,GAAwB,CACvBA,EAAE,gBAAgB,EAClBJ,EAAQ,CACV,EACA,OAGL,UAAAC,EACAF,MACC,OAAC,QACC,UAAU,kCACV,QAAUK,GAAwB,CAChCA,EAAE,gBAAgB,EAClBL,EAAS,CACX,EACD,gBAED,GAEJ,CAEJ,CAEO,SAASH,GAAaR,EAM1B,CACD,GAAM,CAAE,QAAAiB,EAAS,WAAAC,EAAa,EAAG,aAAAC,CAAa,EAAInB,EAElD,GAAIiB,EAAQ,SAAW,EACrB,SACE,OAAC,QACC,UAAW,8BAA8BjB,EAAM,WAAa,EAAE,GAAG,KAAK,EACvE,8BAED,EAIJ,IAAMoB,EAA8B,CAAC,EACjCC,EAAa,EAEjB,QAASC,EAAI,EAAGA,EAAIL,EAAQ,OAAQK,IAAK,CACvC,IAAM/C,EAAS0C,EAAQK,CAAC,EACnB/C,IACD,CAACA,EAAO,UAAY,CAACA,EAAO,YAEhC8C,IACID,EAAM,OAASF,GACjBE,EAAM,QACJ,OAACX,GAAA,CAEC,OAAQlC,EACR,QACE4C,GACA5C,EAAO,WACP,CAACN,EAAkBM,EAAO,SAAoC,EAC1D,IAAM4C,EAAa5C,EAAO,SAAoC,EAC9D,QAPD,OAAO+C,CAAC,EASf,CACF,GAEJ,CAEA,IAAMC,EAAYF,EAAaD,EAAM,OAErC,SACE,QAAC,OACC,UAAW,8BAA8BpB,EAAM,WAAa,EAAE,GAAG,KAAK,EAErE,UAAAoB,EACAG,EAAY,MACX,QAAC,QAAK,UAAU,+BAA+B,cAAEA,GAAU,GAE/D,CAEJ,CAoBO,SAASC,GAAe,CAC7B,iBAAAC,EACA,WAAAvC,EACA,oBAAAwC,EACA,cAAAC,EACA,SAAAC,EACA,SAAAC,EACA,aAAAC,EACA,YAAAC,EAAc,oBACd,UAAAC,EACA,MAAAC,EAAQ,OACR,cAAAC,EACA,kBAAAC,CACF,EAAwB,CACtB,GAAM,CAACC,EAAQC,CAAS,KAAI,YAAS,EAAK,EACpC,CAACC,EAAkBC,CAAmB,KAAI,YAAS,EAAE,EACrDC,KAAe,UAAuB,IAAI,EAC1CC,KAAW,UAAyB,IAAI,EACxCC,KAAU,UAAuB,IAAI,EAErCC,KAAc,eAAY,IAAM,CACpCR,EAAkB,IAAI,EACtBD,EAAc,EAAE,EAChBG,EAAU,EAAI,EACdE,EAAoB,CAAC,EACrB,WAAW,IAAME,EAAS,SAAS,MAAM,EAAG,CAAC,CAC/C,EAAG,CAACN,EAAmBD,CAAa,CAAC,EAE/BU,KAAW,WAAQ,IAAM,CAC7B,IAAMpD,EAAO,CAAC,GAAGkC,CAAmB,EACpC,OAAOC,EAAcnC,EAAMN,CAAU,CACvC,EAAG,CAACwC,EAAqBxC,EAAYyC,CAAa,CAAC,EAE7CkB,KAAS,WAAQ,IAAM,CAC3B,IAAMC,EAAM,IAAI,IAChB,QAAWjD,KAAO+C,EAAU,CAC1B,IAAMG,EACJlD,EAAI,OAAS,WAAa,WAAa,GAAGA,EAAI,IAAI,IAAIA,EAAI,WAAW,GACjEmD,EAAMF,EAAI,IAAIC,CAAG,EACnBC,EAAKA,EAAI,KAAKnD,CAAG,EAChBiD,EAAI,IAAIC,EAAK,CAAClD,CAAG,CAAC,CACzB,CACA,OAAOiD,CACT,EAAG,CAACF,CAAQ,CAAC,EAEPK,KAAY,WAAQ,IAAM,CAC9B,IAAMC,EAA2B,CAAC,EAClC,QAAW1D,KAAQqD,EAAO,OAAO,EAC/BK,EAAM,KAAK,GAAG1D,CAAI,EAEpB,OAAO0D,CACT,EAAG,CAACL,CAAM,CAAC,KAEX,aAAU,IAAM,CACd,SAASM,EAAmBnC,EAAe,CAEvCwB,EAAa,SACb,CAACA,EAAa,QAAQ,SAASxB,EAAE,MAAc,GAE/CqB,EAAU,EAAK,CAEnB,CACA,gBAAS,iBAAiB,YAAac,CAAkB,EAClD,IAAM,SAAS,oBAAoB,YAAaA,CAAkB,CAC3E,EAAG,CAAC,CAAC,EAEL,IAAMC,KAAe,eAClBvD,GAAyB,CACxBsC,EAAkBvC,EAAmBC,CAAG,CAAC,EACzCqC,EAActC,EAAmBC,CAAG,CAAC,EACrCwC,EAAU,EAAK,CACjB,EACA,CAACF,EAAmBD,CAAa,CACnC,EAEMmB,KAAgB,eACnBrC,GAA2B,CAC1B,GAAIS,EAAkB,CACpB,GAAIT,EAAE,MAAQ,aAAeA,EAAE,MAAQ,SAAU,CAC/CA,EAAE,eAAe,EACjB2B,EAAY,EACZ,MACF,CACA,GAAI3B,EAAE,MAAQ,aAAeA,EAAE,MAAQ,WAAaA,EAAE,MAAQ,QAAS,CACrEA,EAAE,eAAe,EACjBmB,EAAkB,IAAI,EACtBD,EAAc,EAAE,EAChBG,EAAU,EAAI,EACdE,EAAoB,CAAC,EACrB,WAAW,IAAME,EAAS,SAAS,MAAM,EAAG,CAAC,EAC7C,MACF,CACA,GAAIzB,EAAE,IAAI,SAAW,GAAK,CAACA,EAAE,SAAW,CAACA,EAAE,QAAS,CAClDA,EAAE,eAAe,EACjBmB,EAAkB,IAAI,EACtBD,EAAclB,EAAE,GAAG,EACnBqB,EAAU,EAAI,EACdE,EAAoB,CAAC,EACrB,WAAW,IAAME,EAAS,SAAS,MAAM,EAAG,CAAC,EAC7C,MACF,CACA,MACF,CACIzB,EAAE,MAAQ,aACZA,EAAE,eAAe,EACZoB,EAIHG,EAAqBe,GACnB,KAAK,IAAIA,EAAO,EAAGL,EAAU,OAAS,CAAC,CACzC,GALAZ,EAAU,EAAI,EACdE,EAAoB,CAAC,IAMdvB,EAAE,MAAQ,WACnBA,EAAE,eAAe,EACjBuB,EAAqBe,GAAS,KAAK,IAAIA,EAAO,EAAG,CAAC,CAAC,GAC1CtC,EAAE,MAAQ,SACnBA,EAAE,eAAe,EACboB,GAAUE,GAAoB,GAAKW,EAAUX,CAAgB,GAC/Dc,EAAaH,EAAUX,CAAgB,CAAE,GAElCtB,EAAE,MAAQ,UACnBqB,EAAU,EAAK,CAGnB,EACA,CACEZ,EACAkB,EACAR,EACAD,EACAE,EACAE,EACAW,EACAG,CACF,CACF,KAEA,aAAU,IAAM,CACVV,EAAQ,SAAWJ,GAAoB,GAC3BI,EAAQ,QAAQ,iBAAiB,sBAAsB,EAC/DJ,CAAgB,GAAG,eAAe,CAAE,MAAO,SAAU,CAAC,CAEhE,EAAG,CAACA,CAAgB,CAAC,EAErB,IAAMiB,EAAyC,CAAC,EAC5CC,EAAc,EAElB,OAAW,CAACC,EAAUC,CAAS,IAAKb,EAAQ,CAC1CU,EAAiB,QACf,OAACxD,GAAA,CAEC,MAAO0D,EACP,WAAYb,GAFP,SAASa,CAAQ,EAGxB,CACF,EACA,QAAW5D,KAAO6D,EAAW,CAC3B,IAAMC,EAAMH,IACNI,GAAgBD,IAAQrB,EAC9BiB,EAAiB,QACf,OAAC,OAEC,qBAAkB,GAClB,UAAW,gCAAgCK,GAAgB,4CAA8C,EAAE,GAC3G,YAAc5C,IAAM,CAClBA,GAAE,eAAe,EACjBoC,EAAavD,CAAG,CAClB,EACA,aAAc,IAAM0C,EAAoBoB,CAAG,EAE3C,mBAACrD,GAAA,CAAa,UAAWT,EAAK,GATzBD,EAAmBC,CAAG,CAU7B,CACF,CACF,CACF,CAEA,IAAMgE,EAAc,CAClB,wBACAhC,GAAY,+BACZG,CACF,EACG,OAAO,OAAO,EACd,KAAK,GAAG,EAEL8B,EAAqBrC,GAAkB,OAAS,WAChDpB,EAAYoB,EACdqC,EACE,+CACArC,EAAiB,kBAAoB,eACnC,8CACAA,EAAiB,kBAAoB,cACnC,6CACA,+CACN,GAEJ,SACE,QAAC,OACC,IAAKe,EACL,UAAWqB,EACX,mBAAkB5B,IAAU,OAAS,OAAYA,EAEhD,UAAAR,GAAoB,CAACG,MACpB,QAAC,OAAI,UAAU,iCAAiC,QAASe,EACtD,UAAAmB,KACC,OAAC,QAAK,UAAU,oFACd,mBAAChE,GAAA,EAAa,EAChB,KAEA,oBACE,oBAAC,QAAK,UAAW,sCAAsCO,CAAS,GAAI,EACnEoB,EAAiB,aAChB,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,SACpB,GAEJ,KAEF,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,WAAaA,EAAiB,KAClD,KACA,OAAC,QAAK,UAAU,qCAAqC,kBAAC,KACtD,OAAC,QAAK,UAAU,wCACb,SAAAA,EAAiB,OAAO,OAASA,EAAiB,OAAO,KAC5D,KACA,OAAC,QACC,UAAU,uCACV,QAAUT,GAAM,CACdA,EAAE,gBAAgB,EAClB2B,EAAY,CACd,EACD,gBAED,GACF,EAEDlB,GAAoBG,MACnB,QAAC,OAAI,UAAU,0EACZ,UAAAkC,KACC,OAAC,QAAK,UAAU,oFACd,mBAAChE,GAAA,EAAa,EAChB,KAEA,oBACE,oBAAC,QAAK,UAAW,sCAAsCO,CAAS,GAAI,EACnEoB,EAAiB,aAChB,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,SACpB,GAEJ,KAEF,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,WAAaA,EAAiB,KAClD,KACA,OAAC,QAAK,UAAU,qCAAqC,kBAAC,KACtD,OAAC,QAAK,UAAU,wCACb,SAAAA,EAAiB,OAAO,OAASA,EAAiB,OAAO,KAC5D,GACF,KAEF,OAAC,SACC,IAAKgB,EACL,KAAK,OACL,UAAW,8BAA8BhB,EAAmB,uCAAyC,EAAE,GACvG,MAAOvC,EACP,YAAa6C,EACb,SAAUH,EACV,SAAWZ,GAAM,CACfkB,EAAclB,EAAE,OAAO,KAAK,EAC5BqB,EAAU,EAAI,EACdE,EAAoB,CAAC,EAChBvB,EAAE,OAAO,OAAOmB,EAAkB,IAAI,CAC7C,EACA,QAAS,IAAM,CACRV,GAAkBY,EAAU,EAAI,CACvC,EACA,UAAWgB,EACb,EACCvB,MACC,OAAC,QAAK,UAAU,8BAA+B,SAAAA,EAAa,EAE7DM,GAAU,CAACR,MACV,OAAC,OAAI,IAAKc,EAAS,UAAU,iCAC1B,SAAAO,EAAU,OAAS,EAClBM,KAEA,OAAC,OAAI,UAAU,mCAAmC,4BAElD,EAEJ,GAEJ,CAEJ",
-  "names": ["react_exports", "__export", "FormatChip", "FormatViewer", "SignalGroupHeader", "SignalOption", "SignalSearch", "SignalSelector", "createSignalFilter", "flattenSignals", "getFormatLabel", "getSchemaDescription", "isArraySchema", "isEmptySchema", "isPrimitiveSchema", "signalReferenceKey", "__toCommonJS", "import_react", "isArray", "value", "getTag", "INFINITY", "baseToString", "result", "toString", "isString", "isNumber", "isBoolean", "isObjectLike", "isObject", "isDefined", "isBlank", "INCORRECT_INDEX_TYPE", "LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY", "key", "PATTERN_LENGTH_TOO_LARGE", "max", "MISSING_KEY_PROPERTY", "name", "INVALID_KEY_WEIGHT_VALUE", "hasOwn", "KeyStore", "keys", "totalWeight", "obj", "createKey", "keyId", "path", "id", "src", "weight", "getFn", "isString", "isArray", "createKeyPath", "createKeyId", "get", "list", "arr", "deepGet", "index", "arrayIndex", "isDefined", "value", "isNumber", "isBoolean", "toString", "i", "len", "MatchOptions", "BasicOptions", "a", "b", "FuzzyOptions", "AdvancedOptions", "Config", "SPACE", "norm", "mantissa", "cache", "m", "numTokens", "n", "FuseIndex", "fieldNormWeight", "docs", "records", "idx", "doc", "docIndex", "indices", "item", "isBlank", "record", "keyIndex", "subRecords", "subRecord", "createIndex", "myIndex", "parseIndex", "data", "convertMaskToIndices", "matchmask", "minMatchCharLength", "start", "end", "match", "MAX_BITS", "search", "text", "pattern", "patternAlphabet", "location", "distance", "threshold", "findAllMatches", "includeMatches", "ignoreLocation", "patternLen", "textLen", "expectedLocation", "currentThreshold", "bestLocation", "calcScore", "errors", "currentLocation", "accuracy", "proximity", "computeMatches", "matchMask", "score", "lastBitArr", "finalScore", "binMax", "mask", "binMin", "binMid", "finish", "bitArr", "j", "charMatch", "result", "createPatternAlphabet", "char", "stripDiacritics", "str", "mergeIndices", "merged", "last", "curr", "BitapSearch", "isCaseSensitive", "ignoreDiacritics", "addChunk", "startIndex", "remainder", "allIndices", "totalScore", "hasMatches", "alphabet", "isMatch", "BaseMatch", "getMatch", "exp", "matches", "ExactMatch", "InverseExactMatch", "PrefixExactMatch", "InversePrefixExactMatch", "SuffixExactMatch", "InverseSuffixExactMatch", "FuzzyMatch", "IncludeMatch", "searchers", "searchersLen", "SPACE_RE", "OR_TOKEN", "parseQuery", "options", "query", "results", "queryItem", "found", "searcher", "token", "MultiMatchSet", "ExtendedSearch", "_", "numMatches", "qLen", "pLen", "type", "registeredSearchers", "register", "args", "createSearcher", "searcherClass", "LogicalOperator", "KeyType", "isExpression", "isPath", "isLeaf", "isObject", "convertToExplicit", "parse", "auto", "next", "isQueryPath", "node", "computeScoreSingle", "ignoreFieldNorm", "computeScore", "MaxHeap", "limit", "sortFn", "heap", "parent", "tmp", "largest", "left", "right", "transformMatches", "transformScore", "format", "includeScore", "transformers", "transformer", "Fuse", "predicate", "indicesToRemove", "shouldSort", "useHeap", "expression", "evaluate", "res", "child", "resultMap", "expResults", "plugins", "plugin", "import_jsx_runtime", "isPrimitiveSchema", "schema", "isEmptySchema", "isArraySchema", "getSchemaDescription", "getFormatLabel", "format", "SignalSearch", "data", "Fuse", "query", "result", "parts", "searchQuery", "createSignalFilter", "search", "options", "inputValue", "a", "b", "keyA", "keyB", "flattenSignals", "refs", "vertex", "tx", "sig", "signalReferenceKey", "ref", "ConstantIcon", "SignalGroupHeader", "props", "nodeId", "transmitter", "firstOption", "mode", "modeClass", "SignalOption", "reference", "FormatViewer", "FormatChip", "size", "onDelete", "onClick", "label", "variant", "isClickable", "e", "formats", "maxVisible", "onViewSchema", "chips", "totalChips", "i", "remaining", "SignalSelector", "currentReference", "availableReferences", "filterOptions", "disabled", "hasError", "errorMessage", "placeholder", "className", "theme", "onInputChange", "onReferenceChange", "isOpen", "setIsOpen", "highlightedIndex", "setHighlightedIndex", "containerRef", "inputRef", "listRef", "handleClear", "filtered", "groups", "map", "key", "arr", "flatItems", "items", "handleClickOutside", "handleSelect", "handleKeyDown", "prev", "dropdownElements", "optionIndex", "groupKey", "groupRefs", "idx", "isHighlighted", "rootClasses", "isConstantSelected"]
+  "sourcesContent": ["import React, {\n  useState,\n  useRef,\n  useEffect,\n  useCallback,\n  useMemo\n} from 'react';\nimport Fuse from 'fuse.js';\nimport type {\n  SignalDescriptorJson,\n  SignalFormatJson,\n  ListIncomingSignalsResponseJson,\n  Transmitter_ModeJson\n} from '../api';\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// TYPES\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport interface SignalReference {\n  node: string;\n  nodeLabel: string;\n  nodeDescription?: string;\n  nodeLogoId?: string;\n  nodeIcon?: React.ReactNode;\n  transmitter: string;\n  transmitterDescription?: string;\n  transmitterMode?: Transmitter_ModeJson;\n  signal: SignalDescriptorJson;\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// FORMAT UTILITIES\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport type PrimitiveType =\n  | 'boolean'\n  | 'string'\n  | 'timestamp'\n  | 'float32'\n  | 'float64'\n  | 'int8'\n  | 'uint8'\n  | 'int16'\n  | 'uint16'\n  | 'int32'\n  | 'uint32';\n\nexport function isPrimitiveSchema(schema: Record<string, unknown>): boolean {\n  if (!schema['type']) return false;\n  return (\n    !(\n      Array.isArray(schema['enum']) && (schema['enum'] as unknown[]).length > 0\n    ) &&\n    !schema['elements'] &&\n    !(\n      schema['properties'] &&\n      Object.keys(schema['properties'] as object).length > 0\n    ) &&\n    !(\n      schema['optionalProperties'] &&\n      Object.keys(schema['optionalProperties'] as object).length > 0\n    ) &&\n    !schema['values'] &&\n    !schema['discriminator'] &&\n    !schema['ref']\n  );\n}\n\nexport function isEmptySchema(schema: Record<string, unknown>): boolean {\n  return (\n    !schema['type'] &&\n    !schema['enum'] &&\n    !schema['elements'] &&\n    !schema['properties'] &&\n    !schema['optionalProperties'] &&\n    !schema['values'] &&\n    !schema['discriminator'] &&\n    !schema['ref']\n  );\n}\n\nexport function isArraySchema(schema: Record<string, unknown>): boolean {\n  return schema['elements'] !== undefined;\n}\n\nexport function getSchemaDescription(schema: Record<string, unknown>): string {\n  if (isPrimitiveSchema(schema)) return schema['type'] as string;\n  if (schema['enum'])\n    return `enum (${(schema['enum'] as unknown[]).length} values)`;\n  if (schema['elements']) return 'array';\n  if (schema['properties'] || schema['optionalProperties']) {\n    const propCount =\n      (schema['properties']\n        ? Object.keys(schema['properties'] as object).length\n        : 0) +\n      (schema['optionalProperties']\n        ? Object.keys(schema['optionalProperties'] as object).length\n        : 0);\n    return `object (${propCount} properties)`;\n  }\n  if (schema['values']) return 'map';\n  if (schema['discriminator']) return 'discriminated union';\n  if (schema['ref']) return `ref: ${schema['ref']}`;\n  if (isEmptySchema(schema)) return 'empty schema';\n  return 'complex schema';\n}\n\nexport function getFormatLabel(format: SignalFormatJson): string {\n  if (format.mimeType) return format.mimeType;\n  if (format.jtdSchema) {\n    return getSchemaDescription(format.jtdSchema as Record<string, unknown>);\n  }\n  return 'unknown';\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// SIGNAL SEARCH (Fuse.js)\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport class SignalSearch {\n  private fuse: Fuse<SignalReference>;\n  private data: Readonly<SignalReference[]>;\n\n  constructor(data: SignalReference[]) {\n    this.fuse = new Fuse(data, {\n      includeScore: false,\n      threshold: 0.3,\n      ignoreLocation: true,\n      useExtendedSearch: true,\n      keys: [\n        { name: 'node', weight: 5 },\n        { name: 'nodeLabel', weight: 5 },\n        { name: 'nodeDescription', weight: 2 },\n        { name: 'transmitter', weight: 5 },\n        { name: 'transmitterDescription', weight: 2 },\n        { name: 'signal.name', weight: 5 },\n        { name: 'signal.label', weight: 5 },\n        { name: 'signal.description', weight: 2 }\n      ]\n    });\n    this.data = data;\n  }\n\n  search(query: string): SignalReference[] {\n    if (!query || query.trim().length === 0) {\n      return this.fuse.search('').map((result) => result.item);\n    }\n\n    if (!query.includes('/')) {\n      return this.fuse.search(query).map((result) => result.item);\n    }\n\n    const parts = query.split('/');\n    let searchQuery: any = '';\n\n    if (parts[0] === 'constant' && parts.length === 2) {\n      if (!parts[1]) {\n        searchQuery = { node: '=constant' };\n      } else {\n        searchQuery = {\n          $and: [\n            { node: '=constant' },\n            {\n              $or: [\n                { 'signal.name': parts[1] },\n                { 'signal.label': parts[1] },\n                { 'signal.description': parts[1] }\n              ]\n            }\n          ]\n        };\n      }\n    } else if (parts.length === 2 && parts[1] === '' && parts[0]) {\n      searchQuery = {\n        $or: [\n          { node: parts[0] },\n          { nodeLabel: parts[0] },\n          { nodeDescription: parts[0] }\n        ]\n      };\n    } else if (parts.length === 2 && parts[0] && parts[1]) {\n      searchQuery = {\n        $and: [\n          {\n            $or: [\n              { node: parts[0] },\n              { nodeLabel: parts[0] },\n              { nodeDescription: parts[0] }\n            ]\n          },\n          {\n            $or: [\n              { transmitter: parts[1] },\n              { transmitterDescription: parts[1] }\n            ]\n          }\n        ]\n      };\n    } else if (parts.length === 3 && parts[2] === '' && parts[0] && parts[1]) {\n      searchQuery = {\n        $and: [\n          {\n            $or: [\n              { node: parts[0] },\n              { nodeLabel: parts[0] },\n              { nodeDescription: parts[0] }\n            ]\n          },\n          {\n            $or: [\n              { transmitter: parts[1] },\n              { transmitterDescription: parts[1] }\n            ]\n          }\n        ]\n      };\n    } else if (parts.length >= 3 && parts[0] && parts[1] && parts[2]) {\n      searchQuery = {\n        $and: [\n          {\n            $or: [\n              { node: parts[0] },\n              { nodeLabel: parts[0] },\n              { nodeDescription: parts[0] }\n            ]\n          },\n          {\n            $or: [\n              { transmitter: parts[1] },\n              { transmitterDescription: parts[1] }\n            ]\n          },\n          {\n            $or: [\n              { 'signal.name': parts[2] },\n              { 'signal.label': parts[2] },\n              { 'signal.description': parts[2] }\n            ]\n          }\n        ]\n      };\n    }\n    return this.fuse.search(searchQuery).map((result) => result.item);\n  }\n\n  allSignals(): Readonly<SignalReference[]> {\n    return this.data;\n  }\n}\n\nexport function createSignalFilter(\n  search: SignalSearch\n): (options: SignalReference[], inputValue: string) => SignalReference[] {\n  return (options, inputValue) => {\n    if (!inputValue || inputValue.length < 2) return options;\n    const results = search.search(inputValue);\n    return results.sort((a, b) => {\n      const keyA = `${a.node}/${a.transmitter}`;\n      const keyB = `${b.node}/${b.transmitter}`;\n      return keyA.localeCompare(keyB);\n    });\n  };\n}\n\nexport function flattenSignals(\n  data: ListIncomingSignalsResponseJson\n): SignalReference[] {\n  const refs: SignalReference[] = [];\n  for (const vertex of data.vertices ?? []) {\n    for (const tx of vertex.transmitters ?? []) {\n      for (const sig of tx.signals ?? []) {\n        refs.push({\n          node: vertex.id ?? '',\n          nodeLabel: vertex.label ?? vertex.id ?? '',\n          nodeDescription: vertex.description,\n          nodeLogoId: vertex.logoId,\n          transmitter: tx.name ?? '',\n          transmitterDescription: tx.description,\n          transmitterMode: tx.mode,\n          signal: sig\n        });\n      }\n    }\n  }\n  for (const sig of data.constants ?? []) {\n    refs.push({\n      node: 'constant',\n      nodeLabel: 'Constants',\n      transmitter: '',\n      signal: sig\n    });\n  }\n  return refs;\n}\n\nexport function signalReferenceKey(ref: SignalReference): string {\n  if (ref.node === 'constant') {\n    return `constant/${ref.signal.name}`;\n  }\n  return `${ref.node}/${ref.transmitter}/${ref.signal.name}`;\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// ICONS\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nfunction ConstantIcon() {\n  return (\n    <svg\n      width=\"20\"\n      height=\"20\"\n      viewBox=\"0 0 24 24\"\n      xmlns=\"http://www.w3.org/2000/svg\"\n      fill=\"currentColor\"\n    >\n      <path d=\"M4,7v2c0,0.55-0.45,1-1,1H2v4h1c0.55,0,1,0.45,1,1v2c0,1.65,1.35,3,3,3h3v-2H7c-0.55,0-1-0.45-1-1v-2 c0-1.3-0.84-2.42-2-2.83v-0.34C5.16,11.42,6,10.3,6,9V7c0-0.55,0.45-1,1-1h3V4H7C5.35,4,4,5.35,4,7z\" />\n      <path d=\"M21,10c-0.55,0-1-0.45-1-1V7c0-1.65-1.35-3-3-3h-3v2h3c0.55,0,1,0.45,1,1v2c0,1.3,0.84,2.42,2,2.83v0.34 c-1.16,0.41-2,1.52-2,2.83v2c0,0.55-0.45,1-1,1h-3v2h3c1.65,0,3-1.35,3-3v-2c0-0.55,0.45-1,1-1h1v-4H21z\" />\n    </svg>\n  );\n}\n\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n// REACT COMPONENTS (pure React, no MUI)\n// \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\nexport function SignalGroupHeader(props: {\n  group: string;\n  references: Readonly<SignalReference[]>;\n  className?: string;\n}) {\n  const isConstantGroup = props.group === 'constant';\n\n  if (isConstantGroup) {\n    return (\n      <div\n        className={`adapt-signal-group-header adapt-signal-group-header--constant ${props.className ?? ''}`.trim()}\n      >\n        <span className=\"adapt-signal-group-icon adapt-signal-group-icon--constant\">\n          <ConstantIcon />\n        </span>\n        <span className=\"adapt-signal-group-node-label adapt-signal-group-node-label--constant\">\n          Constants\n        </span>\n      </div>\n    );\n  }\n\n  const [nodeId, transmitter] = props.group.split('/');\n  const firstOption = props.references.find(\n    (ref) => `${ref.node}/${ref.transmitter}` === props.group\n  );\n\n  if (!firstOption) return null;\n\n  const mode = firstOption.transmitterMode;\n  const modeClass =\n    mode === 'MODE_FAILURE'\n      ? 'adapt-signal-group-transmitter--failure'\n      : mode === 'MODE_STREAM'\n        ? 'adapt-signal-group-transmitter--stream'\n        : 'adapt-signal-group-transmitter--standard';\n\n  return (\n    <div\n      className={`adapt-signal-group-header ${props.className ?? ''}`.trim()}\n    >\n      {firstOption.nodeIcon && (\n        <span className=\"adapt-signal-group-icon\">{firstOption.nodeIcon}</span>\n      )}\n      <span className=\"adapt-signal-group-node-label\">\n        {firstOption.nodeLabel || nodeId}\n      </span>\n      <span className=\"adapt-signal-group-node-id\">({nodeId})</span>\n      <span className=\"adapt-signal-group-separator\" />\n      <span className={`adapt-signal-group-transmitter ${modeClass}`}>\n        {transmitter}\n      </span>\n    </div>\n  );\n}\n\nexport function SignalOption(props: {\n  reference: SignalReference;\n  className?: string;\n}) {\n  const { reference } = props;\n  return (\n    <div className={`adapt-signal-option ${props.className ?? ''}`.trim()}>\n      <div className=\"adapt-signal-option-label\">\n        <span className=\"adapt-signal-option-name\">\n          {reference.signal.label || reference.signal.name}\n        </span>\n        {reference.signal.label && (\n          <span className=\"adapt-signal-option-code\">\n            ({reference.signal.name})\n          </span>\n        )}\n        {reference.signal.optional && (\n          <span className=\"adapt-signal-option-optional\">Optional</span>\n        )}\n      </div>\n      {reference.signal.formats && (\n        <FormatViewer formats={reference.signal.formats} />\n      )}\n    </div>\n  );\n}\n\nexport function FormatChip(props: {\n  format: SignalFormatJson;\n  size?: 'small' | 'medium';\n  onDelete?: () => void;\n  onClick?: () => void;\n  className?: string;\n}) {\n  const { format, size = 'small', onDelete, onClick } = props;\n  const label = getFormatLabel(format);\n\n  let variant: 'mime' | 'primitive' | 'complex' = 'primitive';\n  if (format.mimeType) {\n    variant = 'mime';\n  } else if (\n    format.jtdSchema &&\n    !isPrimitiveSchema(format.jtdSchema as Record<string, unknown>)\n  ) {\n    variant = 'complex';\n  }\n\n  const isClickable = variant === 'mime' || variant === 'complex';\n  const sizeClass = size === 'medium' ? 'adapt-signal-format-chip--medium' : '';\n\n  return (\n    <span\n      className={`adapt-signal-format-chip adapt-signal-format-chip--${variant} ${sizeClass} ${props.className ?? ''}`.trim()}\n      onClick={\n        onClick && isClickable\n          ? (e: React.MouseEvent) => {\n              e.stopPropagation();\n              onClick();\n            }\n          : undefined\n      }\n    >\n      {label}\n      {onDelete && (\n        <span\n          className=\"adapt-signal-format-chip-delete\"\n          onClick={(e: React.MouseEvent) => {\n            e.stopPropagation();\n            onDelete();\n          }}\n        >\n          \u00D7\n        </span>\n      )}\n    </span>\n  );\n}\n\nexport function FormatViewer(props: {\n  formats: SignalFormatJson[];\n  maxVisible?: number;\n  size?: 'small' | 'medium';\n  onViewSchema?: (schema: Record<string, unknown>) => void;\n  className?: string;\n}) {\n  const { formats, maxVisible = 3, onViewSchema } = props;\n\n  if (formats.length === 0) {\n    return (\n      <span\n        className={`adapt-signal-format-viewer ${props.className ?? ''}`.trim()}\n      >\n        No formats defined\n      </span>\n    );\n  }\n\n  const chips: React.ReactElement[] = [];\n  let totalChips = 0;\n\n  for (let i = 0; i < formats.length; i++) {\n    const format = formats[i];\n    if (!format) continue;\n    if (!format.mimeType && !format.jtdSchema) continue;\n\n    totalChips++;\n    if (chips.length < maxVisible) {\n      chips.push(\n        <FormatChip\n          key={`fmt-${i}`}\n          format={format}\n          onClick={\n            onViewSchema &&\n            format.jtdSchema &&\n            !isPrimitiveSchema(format.jtdSchema as Record<string, unknown>)\n              ? () => onViewSchema(format.jtdSchema as Record<string, unknown>)\n              : undefined\n          }\n        />\n      );\n    }\n  }\n\n  const remaining = totalChips - chips.length;\n\n  return (\n    <div\n      className={`adapt-signal-format-viewer ${props.className ?? ''}`.trim()}\n    >\n      {chips}\n      {remaining > 0 && (\n        <span className=\"adapt-signal-format-overflow\">+{remaining}</span>\n      )}\n    </div>\n  );\n}\n\nexport interface SignalSelectorProps {\n  currentReference: SignalReference | undefined;\n  inputValue: string;\n  availableReferences: Readonly<SignalReference[]>;\n  filterOptions: (\n    options: SignalReference[],\n    inputValue: string\n  ) => SignalReference[];\n  disabled?: boolean;\n  hasError: boolean;\n  errorMessage?: string;\n  placeholder?: string;\n  className?: string;\n  theme?: 'light' | 'dark' | 'auto';\n  onInputChange: (value: string) => void;\n  onReferenceChange: (value: string | null) => void;\n}\n\nexport function SignalSelector({\n  currentReference,\n  inputValue,\n  availableReferences,\n  filterOptions,\n  disabled,\n  hasError,\n  errorMessage,\n  placeholder = 'Search signals...',\n  className,\n  theme = 'auto',\n  onInputChange,\n  onReferenceChange\n}: SignalSelectorProps) {\n  const [isOpen, setIsOpen] = useState(false);\n  const [highlightedIndex, setHighlightedIndex] = useState(-1);\n  const containerRef = useRef<HTMLDivElement>(null);\n  const inputRef = useRef<HTMLInputElement>(null);\n  const listRef = useRef<HTMLDivElement>(null);\n\n  const handleClear = useCallback(() => {\n    onReferenceChange(null);\n    onInputChange('');\n    setIsOpen(true);\n    setHighlightedIndex(0);\n    setTimeout(() => inputRef.current?.focus(), 0);\n  }, [onReferenceChange, onInputChange]);\n\n  const filtered = useMemo(() => {\n    const refs = [...availableReferences];\n    return filterOptions(refs, inputValue);\n  }, [availableReferences, inputValue, filterOptions]);\n\n  const groups = useMemo(() => {\n    const map = new Map<string, SignalReference[]>();\n    for (const ref of filtered) {\n      const key =\n        ref.node === 'constant' ? 'constant' : `${ref.node}/${ref.transmitter}`;\n      const arr = map.get(key);\n      if (arr) arr.push(ref);\n      else map.set(key, [ref]);\n    }\n    return map;\n  }, [filtered]);\n\n  const flatItems = useMemo(() => {\n    const items: SignalReference[] = [];\n    for (const refs of groups.values()) {\n      items.push(...refs);\n    }\n    return items;\n  }, [groups]);\n\n  useEffect(() => {\n    function handleClickOutside(e: MouseEvent) {\n      if (\n        containerRef.current &&\n        !containerRef.current.contains(e.target as Node)\n      ) {\n        setIsOpen(false);\n      }\n    }\n    document.addEventListener('mousedown', handleClickOutside);\n    return () => document.removeEventListener('mousedown', handleClickOutside);\n  }, []);\n\n  const handleSelect = useCallback(\n    (ref: SignalReference) => {\n      onReferenceChange(signalReferenceKey(ref));\n      onInputChange(signalReferenceKey(ref));\n      setIsOpen(false);\n    },\n    [onReferenceChange, onInputChange]\n  );\n\n  const handleKeyDown = useCallback(\n    (e: React.KeyboardEvent) => {\n      if (currentReference) {\n        if (e.key === 'Backspace' || e.key === 'Delete') {\n          e.preventDefault();\n          handleClear();\n          return;\n        }\n        if (e.key === 'ArrowDown' || e.key === 'ArrowUp' || e.key === 'Enter') {\n          e.preventDefault();\n          onReferenceChange(null);\n          onInputChange('');\n          setIsOpen(true);\n          setHighlightedIndex(0);\n          setTimeout(() => inputRef.current?.focus(), 0);\n          return;\n        }\n        if (e.key.length === 1 && !e.ctrlKey && !e.metaKey) {\n          e.preventDefault();\n          onReferenceChange(null);\n          onInputChange(e.key);\n          setIsOpen(true);\n          setHighlightedIndex(0);\n          setTimeout(() => inputRef.current?.focus(), 0);\n          return;\n        }\n        return;\n      }\n      if (e.key === 'ArrowDown') {\n        e.preventDefault();\n        if (!isOpen) {\n          setIsOpen(true);\n          setHighlightedIndex(0);\n        } else {\n          setHighlightedIndex((prev) =>\n            Math.min(prev + 1, flatItems.length - 1)\n          );\n        }\n      } else if (e.key === 'ArrowUp') {\n        e.preventDefault();\n        setHighlightedIndex((prev) => Math.max(prev - 1, 0));\n      } else if (e.key === 'Enter') {\n        e.preventDefault();\n        if (isOpen && highlightedIndex >= 0 && flatItems[highlightedIndex]) {\n          handleSelect(flatItems[highlightedIndex]!);\n        }\n      } else if (e.key === 'Escape') {\n        setIsOpen(false);\n        ('');\n      }\n    },\n    [\n      currentReference,\n      handleClear,\n      onReferenceChange,\n      onInputChange,\n      isOpen,\n      highlightedIndex,\n      flatItems,\n      handleSelect\n    ]\n  );\n\n  useEffect(() => {\n    if (listRef.current && highlightedIndex >= 0) {\n      const items = listRef.current.querySelectorAll('[data-signal-option]');\n      items[highlightedIndex]?.scrollIntoView({ block: 'nearest' });\n    }\n  }, [highlightedIndex]);\n\n  const dropdownElements: React.ReactElement[] = [];\n  let optionIndex = 0;\n\n  for (const [groupKey, groupRefs] of groups) {\n    dropdownElements.push(\n      <SignalGroupHeader\n        key={`group-${groupKey}`}\n        group={groupKey}\n        references={filtered}\n      />\n    );\n    for (const ref of groupRefs) {\n      const idx = optionIndex++;\n      const isHighlighted = idx === highlightedIndex;\n      dropdownElements.push(\n        <div\n          key={signalReferenceKey(ref)}\n          data-signal-option\n          className={`adapt-signal-selector-option ${isHighlighted ? 'adapt-signal-selector-option--highlighted' : ''}`}\n          onMouseDown={(e) => {\n            e.preventDefault();\n            handleSelect(ref);\n          }}\n          onMouseEnter={() => setHighlightedIndex(idx)}\n        >\n          <SignalOption reference={ref} />\n        </div>\n      );\n    }\n  }\n\n  const rootClasses = [\n    'adapt-signal-selector',\n    hasError && 'adapt-signal-selector--error',\n    className\n  ]\n    .filter(Boolean)\n    .join(' ');\n\n  const isConstantSelected = currentReference?.node === 'constant';\n  const modeClass = currentReference\n    ? isConstantSelected\n      ? 'adapt-signal-selector-selected-dot--constant'\n      : currentReference.transmitterMode === 'MODE_FAILURE'\n        ? 'adapt-signal-selector-selected-dot--failure'\n        : currentReference.transmitterMode === 'MODE_STREAM'\n          ? 'adapt-signal-selector-selected-dot--stream'\n          : 'adapt-signal-selector-selected-dot--standard'\n    : '';\n\n  return (\n    <div\n      ref={containerRef}\n      className={rootClasses}\n      data-adapt-theme={theme === 'auto' ? undefined : theme}\n    >\n      {currentReference && !disabled && (\n        <div className=\"adapt-signal-selector-selected\" onClick={handleClear}>\n          {isConstantSelected ? (\n            <span className=\"adapt-signal-selector-selected-icon adapt-signal-selector-selected-icon--constant\">\n              <ConstantIcon />\n            </span>\n          ) : (\n            <>\n              <span className={`adapt-signal-selector-selected-dot ${modeClass}`} />\n              {currentReference.nodeIcon && (\n                <span className=\"adapt-signal-selector-selected-icon\">\n                  {currentReference.nodeIcon}\n                </span>\n              )}\n            </>\n          )}\n          <span className=\"adapt-signal-selector-selected-node\">\n            {currentReference.nodeLabel || currentReference.node}\n          </span>\n          <span className=\"adapt-signal-selector-selected-sep\">\u203A</span>\n          <span className=\"adapt-signal-selector-selected-signal\">\n            {currentReference.signal.label || currentReference.signal.name}\n          </span>\n          <span\n            className=\"adapt-signal-selector-selected-clear\"\n            onClick={(e) => {\n              e.stopPropagation();\n              handleClear();\n            }}\n          >\n            \u00D7\n          </span>\n        </div>\n      )}\n      {currentReference && disabled && (\n        <div className=\"adapt-signal-selector-selected adapt-signal-selector-selected--disabled\">\n          {isConstantSelected ? (\n            <span className=\"adapt-signal-selector-selected-icon adapt-signal-selector-selected-icon--constant\">\n              <ConstantIcon />\n            </span>\n          ) : (\n            <>\n              <span className={`adapt-signal-selector-selected-dot ${modeClass}`} />\n              {currentReference.nodeIcon && (\n                <span className=\"adapt-signal-selector-selected-icon\">\n                  {currentReference.nodeIcon}\n                </span>\n              )}\n            </>\n          )}\n          <span className=\"adapt-signal-selector-selected-node\">\n            {currentReference.nodeLabel || currentReference.node}\n          </span>\n          <span className=\"adapt-signal-selector-selected-sep\">\u203A</span>\n          <span className=\"adapt-signal-selector-selected-signal\">\n            {currentReference.signal.label || currentReference.signal.name}\n          </span>\n        </div>\n      )}\n      <input\n        ref={inputRef}\n        type=\"text\"\n        className={`adapt-signal-selector-input${currentReference ? ' adapt-signal-selector-input--hidden' : ''}`}\n        value={inputValue}\n        placeholder={placeholder}\n        disabled={disabled}\n        onChange={(e) => {\n          onInputChange(e.target.value);\n          setIsOpen(true);\n          setHighlightedIndex(0);\n          if (!e.target.value) onReferenceChange(null);\n        }}\n        onFocus={() => {\n          if (!currentReference) setIsOpen(true);\n        }}\n        onKeyDown={handleKeyDown}\n      />\n      {errorMessage && (\n        <span className=\"adapt-signal-selector-error\">{errorMessage}</span>\n      )}\n      {isOpen && !disabled && (\n        <div ref={listRef} className=\"adapt-signal-selector-dropdown\">\n          {flatItems.length > 0 ? (\n            dropdownElements\n          ) : (\n            <div className=\"adapt-signal-selector-no-results\">\n              No signals found\n            </div>\n          )}\n        </div>\n      )}\n    </div>\n  );\n}\n", "/**\n * Fuse.js v7.3.0 - Lightweight fuzzy-search (http://fusejs.io)\n *\n * Copyright (c) 2026 Kiro Risk (http://kiro.me)\n * All Rights Reserved. Apache Software License 2.0\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n */\n\nfunction isArray(value) {\n  return !Array.isArray ? getTag(value) === '[object Array]' : Array.isArray(value);\n}\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (typeof value === 'bigint') {\n    return value.toString();\n  }\n  const result = value + '';\n  return result == '0' && 1 / value == -Infinity ? '-0' : result;\n}\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\nfunction isString(value) {\n  return typeof value === 'string';\n}\nfunction isNumber(value) {\n  return typeof value === 'number';\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js\nfunction isBoolean(value) {\n  return value === true || value === false || isObjectLike(value) && getTag(value) == '[object Boolean]';\n}\nfunction isObject(value) {\n  return typeof value === 'object';\n}\n\n// Checks if `value` is object-like.\nfunction isObjectLike(value) {\n  return isObject(value) && value !== null;\n}\nfunction isDefined(value) {\n  return value !== undefined && value !== null;\n}\nfunction isBlank(value) {\n  return !value.trim().length;\n}\n\n// Gets the `toStringTag` of `value`.\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js\nfunction getTag(value) {\n  return value == null ? value === undefined ? '[object Undefined]' : '[object Null]' : Object.prototype.toString.call(value);\n}\n\nconst INCORRECT_INDEX_TYPE = \"Incorrect 'index' type\";\nconst LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = key => `Invalid value for key ${key}`;\nconst PATTERN_LENGTH_TOO_LARGE = max => `Pattern length exceeds max of ${max}.`;\nconst MISSING_KEY_PROPERTY = name => `Missing ${name} property in key`;\nconst INVALID_KEY_WEIGHT_VALUE = key => `Property 'weight' in key '${key}' must be a positive integer`;\n\nconst hasOwn = Object.prototype.hasOwnProperty;\nclass KeyStore {\n  constructor(keys) {\n    this._keys = [];\n    this._keyMap = {};\n    let totalWeight = 0;\n    keys.forEach(key => {\n      const obj = createKey(key);\n      this._keys.push(obj);\n      this._keyMap[obj.id] = obj;\n      totalWeight += obj.weight;\n    });\n\n    // Normalize weights so that their sum is equal to 1\n    this._keys.forEach(key => {\n      key.weight /= totalWeight;\n    });\n  }\n  get(keyId) {\n    return this._keyMap[keyId];\n  }\n  keys() {\n    return this._keys;\n  }\n  toJSON() {\n    return JSON.stringify(this._keys);\n  }\n}\nfunction createKey(key) {\n  let path = null;\n  let id = null;\n  let src = null;\n  let weight = 1;\n  let getFn = null;\n  if (isString(key) || isArray(key)) {\n    src = key;\n    path = createKeyPath(key);\n    id = createKeyId(key);\n  } else {\n    if (!hasOwn.call(key, 'name')) {\n      throw new Error(MISSING_KEY_PROPERTY('name'));\n    }\n    const name = key.name;\n    src = name;\n    if (hasOwn.call(key, 'weight')) {\n      weight = key.weight;\n      if (weight <= 0) {\n        throw new Error(INVALID_KEY_WEIGHT_VALUE(name));\n      }\n    }\n    path = createKeyPath(name);\n    id = createKeyId(name);\n    getFn = key.getFn;\n  }\n  return {\n    path: path,\n    id: id,\n    weight,\n    src: src,\n    getFn\n  };\n}\nfunction createKeyPath(key) {\n  return isArray(key) ? key : key.split('.');\n}\nfunction createKeyId(key) {\n  return isArray(key) ? key.join('.') : key;\n}\n\nfunction get(obj, path) {\n  const list = [];\n  let arr = false;\n  const deepGet = (obj, path, index, arrayIndex) => {\n    if (!isDefined(obj)) {\n      return;\n    }\n    if (!path[index]) {\n      // If there's no path left, we've arrived at the object we care about.\n      list.push(arrayIndex !== undefined ? {\n        v: obj,\n        i: arrayIndex\n      } : obj);\n    } else {\n      const key = path[index];\n      const value = obj[key];\n      if (!isDefined(value)) {\n        return;\n      }\n\n      // If we're at the last value in the path, and if it's a string/number/bool,\n      // add it to the list\n      if (index === path.length - 1 && (isString(value) || isNumber(value) || isBoolean(value) || typeof value === 'bigint')) {\n        list.push(arrayIndex !== undefined ? {\n          v: toString(value),\n          i: arrayIndex\n        } : toString(value));\n      } else if (isArray(value)) {\n        arr = true;\n        // Search each item in the array.\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          deepGet(value[i], path, index + 1, i);\n        }\n      } else if (path.length) {\n        // An object. Recurse further.\n        deepGet(value, path, index + 1, arrayIndex);\n      }\n    }\n  };\n\n  // Backwards compatibility (since path used to be a string)\n  deepGet(obj, isString(path) ? path.split('.') : path, 0);\n  return arr ? list : list[0];\n}\n\nconst MatchOptions = {\n  includeMatches: false,\n  findAllMatches: false,\n  minMatchCharLength: 1\n};\nconst BasicOptions = {\n  isCaseSensitive: false,\n  ignoreDiacritics: false,\n  includeScore: false,\n  keys: [],\n  shouldSort: true,\n  sortFn: (a, b) => a.score === b.score ? a.idx < b.idx ? -1 : 1 : a.score < b.score ? -1 : 1\n};\nconst FuzzyOptions = {\n  location: 0,\n  threshold: 0.6,\n  distance: 100\n};\nconst AdvancedOptions = {\n  useExtendedSearch: false,\n  useTokenSearch: false,\n  getFn: get,\n  ignoreLocation: false,\n  ignoreFieldNorm: false,\n  fieldNormWeight: 1\n};\nconst Config = Object.freeze({\n  ...BasicOptions,\n  ...MatchOptions,\n  ...FuzzyOptions,\n  ...AdvancedOptions\n});\n\nconst SPACE = /[^ ]+/g;\n\n// Field-length norm: the shorter the field, the higher the weight.\n// Set to 3 decimals to reduce index size.\nfunction norm(weight = 1, mantissa = 3) {\n  const cache = new Map();\n  const m = Math.pow(10, mantissa);\n  return {\n    get(value) {\n      const numTokens = value.match(SPACE).length;\n      if (cache.has(numTokens)) {\n        return cache.get(numTokens);\n      }\n\n      // Default function is 1/sqrt(x), weight makes that variable\n      const norm = 1 / Math.pow(numTokens, 0.5 * weight);\n\n      // In place of `toFixed(mantissa)`, for faster computation\n      const n = parseFloat(Math.round(norm * m) / m);\n      cache.set(numTokens, n);\n      return n;\n    },\n    clear() {\n      cache.clear();\n    }\n  };\n}\n\nclass FuseIndex {\n  constructor({\n    getFn = Config.getFn,\n    fieldNormWeight = Config.fieldNormWeight\n  } = {}) {\n    this.norm = norm(fieldNormWeight, 3);\n    this.getFn = getFn;\n    this.isCreated = false;\n    this.docs = [];\n    this.keys = [];\n    this._keysMap = {};\n    this.setIndexRecords();\n  }\n  setSources(docs = []) {\n    this.docs = docs;\n  }\n  setIndexRecords(records = []) {\n    this.records = records;\n  }\n  setKeys(keys = []) {\n    this.keys = keys;\n    this._keysMap = {};\n    keys.forEach((key, idx) => {\n      this._keysMap[key.id] = idx;\n    });\n  }\n  create() {\n    if (this.isCreated || !this.docs.length) {\n      return;\n    }\n    this.isCreated = true;\n\n    // List is Array<String>\n    if (isString(this.docs[0])) {\n      this.docs.forEach((doc, docIndex) => {\n        this._addString(doc, docIndex);\n      });\n    } else {\n      // List is Array<Object>\n      this.docs.forEach((doc, docIndex) => {\n        this._addObject(doc, docIndex);\n      });\n    }\n    this.norm.clear();\n  }\n  // Adds a doc to the end of the index\n  add(doc) {\n    const idx = this.size();\n    if (isString(doc)) {\n      this._addString(doc, idx);\n    } else {\n      this._addObject(doc, idx);\n    }\n  }\n  // Removes the doc at the specified index of the index\n  removeAt(idx) {\n    this.records.splice(idx, 1);\n\n    // Change ref index of every subsquent doc\n    for (let i = idx, len = this.size(); i < len; i += 1) {\n      this.records[i].i -= 1;\n    }\n  }\n  // Removes docs at the specified indices (must be sorted ascending)\n  removeAll(indices) {\n    // Remove in reverse order to avoid index shifting during splice\n    for (let i = indices.length - 1; i >= 0; i -= 1) {\n      this.records.splice(indices[i], 1);\n    }\n    // Single re-index pass\n    for (let i = 0, len = this.records.length; i < len; i += 1) {\n      this.records[i].i = i;\n    }\n  }\n  getValueForItemAtKeyId(item, keyId) {\n    return item[this._keysMap[keyId]];\n  }\n  size() {\n    return this.records.length;\n  }\n  _addString(doc, docIndex) {\n    if (!isDefined(doc) || isBlank(doc)) {\n      return;\n    }\n    const record = {\n      v: doc,\n      i: docIndex,\n      n: this.norm.get(doc)\n    };\n    this.records.push(record);\n  }\n  _addObject(doc, docIndex) {\n    const record = {\n      i: docIndex,\n      $: {}\n    };\n\n    // Iterate over every key (i.e, path), and fetch the value at that key\n    this.keys.forEach((key, keyIndex) => {\n      const value = key.getFn ? key.getFn(doc) : this.getFn(doc, key.path);\n      if (!isDefined(value)) {\n        return;\n      }\n      if (isArray(value)) {\n        const subRecords = [];\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          const item = value[i];\n          if (!isDefined(item)) {\n            continue;\n          }\n          if (isString(item)) {\n            // Custom getFn returning plain string array (backward compat)\n            if (!isBlank(item)) {\n              const subRecord = {\n                v: item,\n                i: i,\n                n: this.norm.get(item)\n              };\n              subRecords.push(subRecord);\n            }\n          } else if (isDefined(item.v)) {\n            // Default get() returns {v, i} objects with original array indices\n            const text = isString(item.v) ? item.v : toString(item.v);\n            if (!isBlank(text)) {\n              const subRecord = {\n                v: text,\n                i: item.i,\n                n: this.norm.get(text)\n              };\n              subRecords.push(subRecord);\n            }\n          }\n        }\n        record.$[keyIndex] = subRecords;\n      } else if (isString(value) && !isBlank(value)) {\n        const subRecord = {\n          v: value,\n          n: this.norm.get(value)\n        };\n        record.$[keyIndex] = subRecord;\n      }\n    });\n    this.records.push(record);\n  }\n  toJSON() {\n    return {\n      // eslint-disable-next-line @typescript-eslint/no-unused-vars\n      keys: this.keys.map(({\n        getFn,\n        ...key\n      }) => key),\n      records: this.records\n    };\n  }\n}\nfunction createIndex(keys, docs, {\n  getFn = Config.getFn,\n  fieldNormWeight = Config.fieldNormWeight\n} = {}) {\n  const myIndex = new FuseIndex({\n    getFn,\n    fieldNormWeight\n  });\n  myIndex.setKeys(keys.map(createKey));\n  myIndex.setSources(docs);\n  myIndex.create();\n  return myIndex;\n}\nfunction parseIndex(data, {\n  getFn = Config.getFn,\n  fieldNormWeight = Config.fieldNormWeight\n} = {}) {\n  const {\n    keys,\n    records\n  } = data;\n  const myIndex = new FuseIndex({\n    getFn,\n    fieldNormWeight\n  });\n  myIndex.setKeys(keys);\n  myIndex.setIndexRecords(records);\n  return myIndex;\n}\n\nfunction convertMaskToIndices(matchmask = [], minMatchCharLength = Config.minMatchCharLength) {\n  const indices = [];\n  let start = -1;\n  let end = -1;\n  let i = 0;\n  for (let len = matchmask.length; i < len; i += 1) {\n    const match = matchmask[i];\n    if (match && start === -1) {\n      start = i;\n    } else if (!match && start !== -1) {\n      end = i - 1;\n      if (end - start + 1 >= minMatchCharLength) {\n        indices.push([start, end]);\n      }\n      start = -1;\n    }\n  }\n\n  // (i-1 - start) + 1 => i - start\n  if (matchmask[i - 1] && i - start >= minMatchCharLength) {\n    indices.push([start, i - 1]);\n  }\n  return indices;\n}\n\n// Machine word size\nconst MAX_BITS = 32;\n\nfunction search(text, pattern, patternAlphabet, {\n  location = Config.location,\n  distance = Config.distance,\n  threshold = Config.threshold,\n  findAllMatches = Config.findAllMatches,\n  minMatchCharLength = Config.minMatchCharLength,\n  includeMatches = Config.includeMatches,\n  ignoreLocation = Config.ignoreLocation\n} = {}) {\n  if (pattern.length > MAX_BITS) {\n    throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS));\n  }\n  const patternLen = pattern.length;\n  // Set starting location at beginning text and initialize the alphabet.\n  const textLen = text.length;\n  // Handle the case when location > text.length\n  const expectedLocation = Math.max(0, Math.min(location, textLen));\n  // Highest score beyond which we give up.\n  let currentThreshold = threshold;\n  // Is there a nearby exact match? (speedup)\n  let bestLocation = expectedLocation;\n\n  // Inlined score computation \u2014 avoids object allocation per call in hot loops.\n  // See ./computeScore.ts for the documented version of this formula.\n  const calcScore = (errors, currentLocation) => {\n    const accuracy = errors / patternLen;\n    if (ignoreLocation) return accuracy;\n    const proximity = Math.abs(expectedLocation - currentLocation);\n    if (!distance) return proximity ? 1.0 : accuracy;\n    return accuracy + proximity / distance;\n  };\n\n  // Performance: only computer matches when the minMatchCharLength > 1\n  // OR if `includeMatches` is true.\n  const computeMatches = minMatchCharLength > 1 || includeMatches;\n  // A mask of the matches, used for building the indices\n  const matchMask = computeMatches ? Array(textLen) : [];\n  let index;\n\n  // Get all exact matches, here for speed up\n  while ((index = text.indexOf(pattern, bestLocation)) > -1) {\n    const score = calcScore(0, index);\n    currentThreshold = Math.min(score, currentThreshold);\n    bestLocation = index + patternLen;\n    if (computeMatches) {\n      let i = 0;\n      while (i < patternLen) {\n        matchMask[index + i] = 1;\n        i += 1;\n      }\n    }\n  }\n\n  // Reset the best location\n  bestLocation = -1;\n  let lastBitArr = [];\n  let finalScore = 1;\n  let binMax = patternLen + textLen;\n  const mask = 1 << patternLen - 1;\n  for (let i = 0; i < patternLen; i += 1) {\n    // Scan for the best match; each iteration allows for one more error.\n    // Run a binary search to determine how far from the match location we can stray\n    // at this error level.\n    let binMin = 0;\n    let binMid = binMax;\n    while (binMin < binMid) {\n      const score = calcScore(i, expectedLocation + binMid);\n      if (score <= currentThreshold) {\n        binMin = binMid;\n      } else {\n        binMax = binMid;\n      }\n      binMid = Math.floor((binMax - binMin) / 2 + binMin);\n    }\n\n    // Use the result from this iteration as the maximum for the next.\n    binMax = binMid;\n    let start = Math.max(1, expectedLocation - binMid + 1);\n    const finish = findAllMatches ? textLen : Math.min(expectedLocation + binMid, textLen) + patternLen;\n\n    // Initialize the bit array\n    const bitArr = Array(finish + 2);\n    bitArr[finish + 1] = (1 << i) - 1;\n    for (let j = finish; j >= start; j -= 1) {\n      const currentLocation = j - 1;\n      const charMatch = patternAlphabet[text[currentLocation]];\n      if (computeMatches) {\n        // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`)\n        matchMask[currentLocation] = +!!charMatch;\n      }\n\n      // First pass: exact match\n      bitArr[j] = (bitArr[j + 1] << 1 | 1) & charMatch;\n\n      // Subsequent passes: fuzzy match\n      if (i) {\n        bitArr[j] |= (lastBitArr[j + 1] | lastBitArr[j]) << 1 | 1 | lastBitArr[j + 1];\n      }\n      if (bitArr[j] & mask) {\n        finalScore = calcScore(i, currentLocation);\n\n        // This match will almost certainly be better than any existing match.\n        // But check anyway.\n        if (finalScore <= currentThreshold) {\n          // Indeed it is\n          currentThreshold = finalScore;\n          bestLocation = currentLocation;\n\n          // Already passed `loc`, downhill from here on in.\n          if (bestLocation <= expectedLocation) {\n            break;\n          }\n\n          // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.\n          start = Math.max(1, 2 * expectedLocation - bestLocation);\n        }\n      }\n    }\n\n    // No hope for a (better) match at greater error levels.\n    const score = calcScore(i + 1, expectedLocation);\n    if (score > currentThreshold) {\n      break;\n    }\n    lastBitArr = bitArr;\n  }\n  const result = {\n    isMatch: bestLocation >= 0,\n    // Count exact matches (those with a score of 0) to be \"almost\" exact\n    score: Math.max(0.001, finalScore)\n  };\n  if (computeMatches) {\n    const indices = convertMaskToIndices(matchMask, minMatchCharLength);\n    if (!indices.length) {\n      result.isMatch = false;\n    } else if (includeMatches) {\n      result.indices = indices;\n    }\n  }\n  return result;\n}\n\nfunction createPatternAlphabet(pattern) {\n  const mask = {};\n  for (let i = 0, len = pattern.length; i < len; i += 1) {\n    const char = pattern.charAt(i);\n    mask[char] = (mask[char] || 0) | 1 << len - i - 1;\n  }\n  return mask;\n}\n\nfunction mergeIndices(indices) {\n  if (indices.length <= 1) return indices;\n  indices.sort((a, b) => a[0] - b[0] || a[1] - b[1]);\n  const merged = [indices[0]];\n  for (let i = 1, len = indices.length; i < len; i += 1) {\n    const last = merged[merged.length - 1];\n    const curr = indices[i];\n    if (curr[0] <= last[1] + 1) {\n      last[1] = Math.max(last[1], curr[1]);\n    } else {\n      merged.push(curr);\n    }\n  }\n  return merged;\n}\n\n// Characters that survive NFD normalization unchanged and need explicit mapping\nconst NON_DECOMPOSABLE_MAP = {\n  '\\u0142': 'l',\n  // \u0142\n  '\\u0141': 'L',\n  // \u0141\n  '\\u0111': 'd',\n  // \u0111\n  '\\u0110': 'D',\n  // \u0110\n  '\\u00F8': 'o',\n  // \u00F8\n  '\\u00D8': 'O',\n  // \u00D8\n  '\\u0127': 'h',\n  // \u0127\n  '\\u0126': 'H',\n  // \u0126\n  '\\u0167': 't',\n  // \u0167\n  '\\u0166': 'T',\n  // \u0166\n  '\\u0131': 'i',\n  // \u0131\n  '\\u00DF': 'ss' // \u00DF\n};\nconst NON_DECOMPOSABLE_RE = new RegExp('[' + Object.keys(NON_DECOMPOSABLE_MAP).join('') + ']', 'g');\nconst stripDiacritics = String.prototype.normalize ? str => str.normalize('NFD').replace(/[\\u0300-\\u036F\\u0483-\\u0489\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065F\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u07FD\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0859-\\u085B\\u08D3-\\u08E1\\u08E3-\\u0903\\u093A-\\u093C\\u093E-\\u094F\\u0951-\\u0957\\u0962\\u0963\\u0981-\\u0983\\u09BC\\u09BE-\\u09C4\\u09C7\\u09C8\\u09CB-\\u09CD\\u09D7\\u09E2\\u09E3\\u09FE\\u0A01-\\u0A03\\u0A3C\\u0A3E-\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81-\\u0A83\\u0ABC\\u0ABE-\\u0AC5\\u0AC7-\\u0AC9\\u0ACB-\\u0ACD\\u0AE2\\u0AE3\\u0AFA-\\u0AFF\\u0B01-\\u0B03\\u0B3C\\u0B3E-\\u0B44\\u0B47\\u0B48\\u0B4B-\\u0B4D\\u0B56\\u0B57\\u0B62\\u0B63\\u0B82\\u0BBE-\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCD\\u0BD7\\u0C00-\\u0C04\\u0C3E-\\u0C44\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0C81-\\u0C83\\u0CBC\\u0CBE-\\u0CC4\\u0CC6-\\u0CC8\\u0CCA-\\u0CCD\\u0CD5\\u0CD6\\u0CE2\\u0CE3\\u0D00-\\u0D03\\u0D3B\\u0D3C\\u0D3E-\\u0D44\\u0D46-\\u0D48\\u0D4A-\\u0D4D\\u0D57\\u0D62\\u0D63\\u0D82\\u0D83\\u0DCA\\u0DCF-\\u0DD4\\u0DD6\\u0DD8-\\u0DDF\\u0DF2\\u0DF3\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EB9\\u0EBB\\u0EBC\\u0EC8-\\u0ECD\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F3E\\u0F3F\\u0F71-\\u0F84\\u0F86\\u0F87\\u0F8D-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102B-\\u103E\\u1056-\\u1059\\u105E-\\u1060\\u1062-\\u1064\\u1067-\\u106D\\u1071-\\u1074\\u1082-\\u108D\\u108F\\u109A-\\u109D\\u135D-\\u135F\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17B4-\\u17D3\\u17DD\\u180B-\\u180D\\u1885\\u1886\\u18A9\\u1920-\\u192B\\u1930-\\u193B\\u1A17-\\u1A1B\\u1A55-\\u1A5E\\u1A60-\\u1A7C\\u1A7F\\u1AB0-\\u1ABE\\u1B00-\\u1B04\\u1B34-\\u1B44\\u1B6B-\\u1B73\\u1B80-\\u1B82\\u1BA1-\\u1BAD\\u1BE6-\\u1BF3\\u1C24-\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE8\\u1CED\\u1CF2-\\u1CF4\\u1CF7-\\u1CF9\\u1DC0-\\u1DF9\\u1DFB-\\u1DFF\\u20D0-\\u20F0\\u2CEF-\\u2CF1\\u2D7F\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F-\\uA672\\uA674-\\uA67D\\uA69E\\uA69F\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA823-\\uA827\\uA880\\uA881\\uA8B4-\\uA8C5\\uA8E0-\\uA8F1\\uA8FF\\uA926-\\uA92D\\uA947-\\uA953\\uA980-\\uA983\\uA9B3-\\uA9C0\\uA9E5\\uAA29-\\uAA36\\uAA43\\uAA4C\\uAA4D\\uAA7B-\\uAA7D\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uAAEB-\\uAAEF\\uAAF5\\uAAF6\\uABE3-\\uABEA\\uABEC\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE2F]/g, '').replace(NON_DECOMPOSABLE_RE, ch => NON_DECOMPOSABLE_MAP[ch]) : str => str;\n\nclass BitapSearch {\n  constructor(pattern, {\n    location = Config.location,\n    threshold = Config.threshold,\n    distance = Config.distance,\n    includeMatches = Config.includeMatches,\n    findAllMatches = Config.findAllMatches,\n    minMatchCharLength = Config.minMatchCharLength,\n    isCaseSensitive = Config.isCaseSensitive,\n    ignoreDiacritics = Config.ignoreDiacritics,\n    ignoreLocation = Config.ignoreLocation\n  } = {}) {\n    this.options = {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    };\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n    this.chunks = [];\n    if (!this.pattern.length) {\n      return;\n    }\n    const addChunk = (pattern, startIndex) => {\n      this.chunks.push({\n        pattern,\n        alphabet: createPatternAlphabet(pattern),\n        startIndex\n      });\n    };\n    const len = this.pattern.length;\n    if (len > MAX_BITS) {\n      let i = 0;\n      const remainder = len % MAX_BITS;\n      const end = len - remainder;\n      while (i < end) {\n        addChunk(this.pattern.substr(i, MAX_BITS), i);\n        i += MAX_BITS;\n      }\n      if (remainder) {\n        const startIndex = len - MAX_BITS;\n        addChunk(this.pattern.substr(startIndex), startIndex);\n      }\n    } else {\n      addChunk(this.pattern, 0);\n    }\n  }\n  searchIn(text) {\n    const {\n      isCaseSensitive,\n      ignoreDiacritics,\n      includeMatches\n    } = this.options;\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n    // Exact match\n    if (this.pattern === text) {\n      const result = {\n        isMatch: true,\n        score: 0\n      };\n      if (includeMatches) {\n        result.indices = [[0, text.length - 1]];\n      }\n      return result;\n    }\n\n    // Otherwise, use Bitap algorithm\n    const {\n      location,\n      distance,\n      threshold,\n      findAllMatches,\n      minMatchCharLength,\n      ignoreLocation\n    } = this.options;\n    const allIndices = [];\n    let totalScore = 0;\n    let hasMatches = false;\n    this.chunks.forEach(({\n      pattern,\n      alphabet,\n      startIndex\n    }) => {\n      const {\n        isMatch,\n        score,\n        indices\n      } = search(text, pattern, alphabet, {\n        location: location + startIndex,\n        distance,\n        threshold,\n        findAllMatches,\n        minMatchCharLength,\n        includeMatches,\n        ignoreLocation\n      });\n      if (isMatch) {\n        hasMatches = true;\n      }\n      totalScore += score;\n      if (isMatch && indices) {\n        allIndices.push(...indices);\n      }\n    });\n    const result = {\n      isMatch: hasMatches,\n      score: hasMatches ? totalScore / this.chunks.length : 1\n    };\n    if (hasMatches && includeMatches) {\n      result.indices = mergeIndices(allIndices);\n    }\n    return result;\n  }\n}\n\nclass BaseMatch {\n  constructor(pattern) {\n    this.pattern = pattern;\n  }\n  static isMultiMatch(pattern) {\n    return getMatch(pattern, this.multiRegex);\n  }\n  static isSingleMatch(pattern) {\n    return getMatch(pattern, this.singleRegex);\n  }\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars\n  search(_text) {\n    return {\n      isMatch: false,\n      score: 1\n    };\n  }\n}\nfunction getMatch(pattern, exp) {\n  const matches = pattern.match(exp);\n  return matches ? matches[1] : null;\n}\n\n// Token: 'file\n// Match type: exact-match\n// Description: Items that are `file`\n\nclass ExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'exact';\n  }\n  static get multiRegex() {\n    return /^=\"(.*)\"$/;\n  }\n  static get singleRegex() {\n    return /^=(.*)$/;\n  }\n  search(text) {\n    const isMatch = text === this.pattern;\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    };\n  }\n}\n\n// Token: !fire\n// Match type: inverse-exact-match\n// Description: Items that do not include `fire`\n\nclass InverseExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-exact';\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"$/;\n  }\n  static get singleRegex() {\n    return /^!(.*)$/;\n  }\n  search(text) {\n    const index = text.indexOf(this.pattern);\n    const isMatch = index === -1;\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    };\n  }\n}\n\n// Token: ^file\n// Match type: prefix-exact-match\n// Description: Items that start with `file`\nclass PrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'prefix-exact';\n  }\n  static get multiRegex() {\n    return /^\\^\"(.*)\"$/;\n  }\n  static get singleRegex() {\n    return /^\\^(.*)$/;\n  }\n  search(text) {\n    const isMatch = text.startsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    };\n  }\n}\n\n// Token: !^fire\n// Match type: inverse-prefix-exact-match\n// Description: Items that do not start with `fire`\n\nclass InversePrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-prefix-exact';\n  }\n  static get multiRegex() {\n    return /^!\\^\"(.*)\"$/;\n  }\n  static get singleRegex() {\n    return /^!\\^(.*)$/;\n  }\n  search(text) {\n    const isMatch = !text.startsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    };\n  }\n}\n\n// Token: .file$\n// Match type: suffix-exact-match\n// Description: Items that end with `.file`\nclass SuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'suffix-exact';\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"\\$$/;\n  }\n  static get singleRegex() {\n    return /^(.*)\\$$/;\n  }\n  search(text) {\n    const isMatch = text.endsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [text.length - this.pattern.length, text.length - 1]\n    };\n  }\n}\n\n// Token: !.file$\n// Match type: inverse-suffix-exact-match\n// Description: Items that do not end with `.file`\nclass InverseSuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-suffix-exact';\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"\\$$/;\n  }\n  static get singleRegex() {\n    return /^!(.*)\\$$/;\n  }\n  search(text) {\n    const isMatch = !text.endsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    };\n  }\n}\n\nclass FuzzyMatch extends BaseMatch {\n  constructor(pattern, {\n    location = Config.location,\n    threshold = Config.threshold,\n    distance = Config.distance,\n    includeMatches = Config.includeMatches,\n    findAllMatches = Config.findAllMatches,\n    minMatchCharLength = Config.minMatchCharLength,\n    isCaseSensitive = Config.isCaseSensitive,\n    ignoreDiacritics = Config.ignoreDiacritics,\n    ignoreLocation = Config.ignoreLocation\n  } = {}) {\n    super(pattern);\n    this._bitapSearch = new BitapSearch(pattern, {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    });\n  }\n  static get type() {\n    return 'fuzzy';\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"$/;\n  }\n  static get singleRegex() {\n    return /^(.*)$/;\n  }\n  search(text) {\n    return this._bitapSearch.searchIn(text);\n  }\n}\n\n// Token: 'file\n// Match type: include-match\n// Description: Items that include `file`\n\nclass IncludeMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'include';\n  }\n  static get multiRegex() {\n    return /^'\"(.*)\"$/;\n  }\n  static get singleRegex() {\n    return /^'(.*)$/;\n  }\n  search(text) {\n    let location = 0;\n    let index;\n    const indices = [];\n    const patternLen = this.pattern.length;\n\n    // Get all exact matches\n    while ((index = text.indexOf(this.pattern, location)) > -1) {\n      location = index + patternLen;\n      indices.push([index, location - 1]);\n    }\n    const isMatch = !!indices.length;\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices\n    };\n  }\n}\n\n// \u2757Order is important. DO NOT CHANGE.\nconst searchers = [ExactMatch, IncludeMatch, PrefixExactMatch, InversePrefixExactMatch, InverseSuffixExactMatch, SuffixExactMatch, InverseExactMatch, FuzzyMatch];\nconst searchersLen = searchers.length;\nconst ESCAPED_PIPE = '\\u0000'; // placeholder for escaped \\|\nconst OR_TOKEN = '|';\n\n// Tokenize a query string into individual search terms.\n// Respects multi-match quoted tokens like =\"said \"test\"\" or ^\"hello world\"$\n// where inner spaces and quotes are part of the token.\nfunction tokenize(pattern) {\n  const tokens = [];\n  const len = pattern.length;\n  let i = 0;\n  while (i < len) {\n    // Skip spaces\n    while (i < len && pattern[i] === ' ') i++;\n    if (i >= len) break;\n\n    // Scan past prefix characters (=, !, ^, ') to see if a quote follows\n    let j = i;\n    while (j < len && pattern[j] !== ' ' && pattern[j] !== '\"') j++;\n    if (j < len && pattern[j] === '\"') {\n      // Multi-match token: prefix + \"content\" (possibly with inner quotes)\n      // Find the closing \" that ends this token:\n      // it must be followed by optional $, then space or end-of-string\n      j++; // skip opening quote\n      while (j < len) {\n        if (pattern[j] === '\"') {\n          // Check if this is the closing quote\n          const next = j + 1;\n          if (next >= len || pattern[next] === ' ') {\n            j++; // include closing quote\n            break;\n          }\n          if (pattern[next] === '$' && (next + 1 >= len || pattern[next + 1] === ' ')) {\n            j += 2; // include \"$\n            break;\n          }\n        }\n        j++;\n      }\n      tokens.push(pattern.substring(i, j));\n      i = j;\n    } else {\n      // Regular (unquoted) token: read until space or end\n      while (j < len && pattern[j] !== ' ') j++;\n      tokens.push(pattern.substring(i, j));\n      i = j;\n    }\n  }\n  return tokens;\n}\n\n// Return a 2D array representation of the query, for simpler parsing.\n// Example:\n// \"^core go$ | rb$ | py$ xy$\" => [[\"^core\", \"go$\"], [\"rb$\"], [\"py$\", \"xy$\"]]\nfunction parseQuery(pattern, options = {}) {\n  // Replace escaped \\| with placeholder before splitting on |\n  const escaped = pattern.replace(/\\\\\\|/g, ESCAPED_PIPE);\n  return escaped.split(OR_TOKEN).map(item => {\n    // Restore escaped pipes in each OR group\n    const restored = item.replace(/\\u0000/g, '|');\n    const query = tokenize(restored.trim()).filter(item => item && !!item.trim());\n    const results = [];\n    for (let i = 0, len = query.length; i < len; i += 1) {\n      const queryItem = query[i];\n\n      // 1. Handle multiple query match (i.e, once that are quoted, like `\"hello world\"`)\n      let found = false;\n      let idx = -1;\n      while (!found && ++idx < searchersLen) {\n        const searcher = searchers[idx];\n        const token = searcher.isMultiMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          found = true;\n        }\n      }\n      if (found) {\n        continue;\n      }\n\n      // 2. Handle single query matches (i.e, once that are *not* quoted)\n      idx = -1;\n      while (++idx < searchersLen) {\n        const searcher = searchers[idx];\n        const token = searcher.isSingleMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          break;\n        }\n      }\n    }\n    return results;\n  });\n}\n\n// These extended matchers can return an array of matches, as opposed\n// to a singl match\nconst MultiMatchSet = new Set([FuzzyMatch.type, IncludeMatch.type]);\nclass ExtendedSearch {\n  constructor(pattern, {\n    isCaseSensitive = Config.isCaseSensitive,\n    ignoreDiacritics = Config.ignoreDiacritics,\n    includeMatches = Config.includeMatches,\n    minMatchCharLength = Config.minMatchCharLength,\n    ignoreLocation = Config.ignoreLocation,\n    findAllMatches = Config.findAllMatches,\n    location = Config.location,\n    threshold = Config.threshold,\n    distance = Config.distance\n  } = {}) {\n    this.query = null;\n    this.options = {\n      isCaseSensitive,\n      ignoreDiacritics,\n      includeMatches,\n      minMatchCharLength,\n      findAllMatches,\n      ignoreLocation,\n      location,\n      threshold,\n      distance\n    };\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n    this.query = parseQuery(this.pattern, this.options);\n  }\n  static condition(_, options) {\n    return options.useExtendedSearch;\n  }\n\n  // Note: searchIn operates on a single text value and sets hasInverse on the\n  // result when inverse patterns are involved. _searchObjectList uses this to\n  // switch from \"ANY key\" to \"ALL keys\" aggregation. See #712.\n  searchIn(text) {\n    const query = this.query;\n    if (!query) {\n      return {\n        isMatch: false,\n        score: 1\n      };\n    }\n    const {\n      includeMatches,\n      isCaseSensitive,\n      ignoreDiacritics\n    } = this.options;\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n    let numMatches = 0;\n    const allIndices = [];\n    let totalScore = 0;\n    let hasInverse = false;\n\n    // ORs\n    for (let i = 0, qLen = query.length; i < qLen; i += 1) {\n      const searchers = query[i];\n\n      // Reset indices\n      allIndices.length = 0;\n      numMatches = 0;\n      hasInverse = false;\n\n      // ANDs\n      for (let j = 0, pLen = searchers.length; j < pLen; j += 1) {\n        const searcher = searchers[j];\n        const {\n          isMatch,\n          indices,\n          score\n        } = searcher.search(text);\n        if (isMatch) {\n          numMatches += 1;\n          totalScore += score;\n          const type = searcher.constructor.type;\n          if (type.startsWith('inverse')) {\n            hasInverse = true;\n          }\n          if (includeMatches) {\n            if (MultiMatchSet.has(type)) {\n              allIndices.push(...indices);\n            } else {\n              allIndices.push(indices);\n            }\n          }\n        } else {\n          totalScore = 0;\n          numMatches = 0;\n          allIndices.length = 0;\n          hasInverse = false;\n          break;\n        }\n      }\n\n      // OR condition, so if TRUE, return\n      if (numMatches) {\n        const result = {\n          isMatch: true,\n          score: totalScore / numMatches\n        };\n        if (hasInverse) {\n          result.hasInverse = true;\n        }\n        if (includeMatches) {\n          result.indices = mergeIndices(allIndices);\n        }\n        return result;\n      }\n    }\n\n    // Nothing was matched\n    return {\n      isMatch: false,\n      score: 1\n    };\n  }\n}\n\nconst registeredSearchers = [];\nfunction register(...args) {\n  registeredSearchers.push(...args);\n}\nfunction createSearcher(pattern, options) {\n  for (let i = 0, len = registeredSearchers.length; i < len; i += 1) {\n    const searcherClass = registeredSearchers[i];\n    if (searcherClass.condition(pattern, options)) {\n      return new searcherClass(pattern, options);\n    }\n  }\n  return new BitapSearch(pattern, options);\n}\n\nconst LogicalOperator = {\n  AND: '$and',\n  OR: '$or'\n};\nconst KeyType = {\n  PATH: '$path',\n  PATTERN: '$val'\n};\nconst isExpression = query => !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]);\nconst isPath = query => !!query[KeyType.PATH];\nconst isLeaf = query => !isArray(query) && isObject(query) && !isExpression(query);\nconst convertToExplicit = query => ({\n  [LogicalOperator.AND]: Object.keys(query).map(key => ({\n    [key]: query[key]\n  }))\n});\n\n// When `auto` is `true`, the parse function will infer and initialize and add\n// the appropriate `Searcher` instance\nfunction parse(query, options, {\n  auto = true\n} = {}) {\n  const next = query => {\n    // Keyless string entry: search across all keys\n    if (isString(query)) {\n      const obj = {\n        keyId: null,\n        pattern: query\n      };\n      if (auto) {\n        obj.searcher = createSearcher(query, options);\n      }\n      return obj;\n    }\n    const keys = Object.keys(query);\n    const isQueryPath = isPath(query);\n    if (!isQueryPath && keys.length > 1 && !isExpression(query)) {\n      return next(convertToExplicit(query));\n    }\n    if (isLeaf(query)) {\n      const key = isQueryPath ? query[KeyType.PATH] : keys[0];\n      const pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];\n      if (!isString(pattern)) {\n        throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key));\n      }\n      const obj = {\n        keyId: createKeyId(key),\n        pattern\n      };\n      if (auto) {\n        obj.searcher = createSearcher(pattern, options);\n      }\n      return obj;\n    }\n    const node = {\n      children: [],\n      operator: keys[0]\n    };\n    keys.forEach(key => {\n      const value = query[key];\n      if (isArray(value)) {\n        value.forEach(item => {\n          node.children.push(next(item));\n        });\n      }\n    });\n    return node;\n  };\n  if (!isExpression(query)) {\n    query = convertToExplicit(query);\n  }\n  return next(query);\n}\n\nfunction computeScoreSingle(matches, {\n  ignoreFieldNorm = Config.ignoreFieldNorm\n}) {\n  let totalScore = 1;\n  matches.forEach(({\n    key,\n    norm,\n    score\n  }) => {\n    const weight = key ? key.weight : null;\n    totalScore *= Math.pow(score === 0 && weight ? Number.EPSILON : score, (weight || 1) * (ignoreFieldNorm ? 1 : norm));\n  });\n  return totalScore;\n}\nfunction computeScore(results, {\n  ignoreFieldNorm = Config.ignoreFieldNorm\n}) {\n  results.forEach(result => {\n    result.score = computeScoreSingle(result.matches, {\n      ignoreFieldNorm\n    });\n  });\n}\n\n// Max-heap by score: keeps the worst (highest) score at the top\n// so we can efficiently evict it when a better result arrives.\nclass MaxHeap {\n  constructor(limit) {\n    this.limit = limit;\n    this.heap = [];\n  }\n  get size() {\n    return this.heap.length;\n  }\n  shouldInsert(score) {\n    return this.size < this.limit || score < this.heap[0].score;\n  }\n  insert(item) {\n    if (this.size < this.limit) {\n      this.heap.push(item);\n      this._bubbleUp(this.size - 1);\n    } else if (item.score < this.heap[0].score) {\n      this.heap[0] = item;\n      this._sinkDown(0);\n    }\n  }\n  extractSorted(sortFn) {\n    return this.heap.sort(sortFn);\n  }\n  _bubbleUp(i) {\n    const heap = this.heap;\n    while (i > 0) {\n      const parent = i - 1 >> 1;\n      if (heap[i].score <= heap[parent].score) break;\n      const tmp = heap[i];\n      heap[i] = heap[parent];\n      heap[parent] = tmp;\n      i = parent;\n    }\n  }\n  _sinkDown(i) {\n    const heap = this.heap;\n    const len = heap.length;\n    let largest = i;\n    do {\n      i = largest;\n      const left = 2 * i + 1;\n      const right = 2 * i + 2;\n      if (left < len && heap[left].score > heap[largest].score) {\n        largest = left;\n      }\n      if (right < len && heap[right].score > heap[largest].score) {\n        largest = right;\n      }\n      if (largest !== i) {\n        const tmp = heap[i];\n        heap[i] = heap[largest];\n        heap[largest] = tmp;\n      }\n    } while (largest !== i);\n  }\n}\n\nfunction transformMatches(result, data) {\n  const matches = result.matches;\n  data.matches = [];\n  if (!isDefined(matches)) {\n    return;\n  }\n  matches.forEach(match => {\n    if (!isDefined(match.indices) || !match.indices.length) {\n      return;\n    }\n    const {\n      indices,\n      value\n    } = match;\n    const obj = {\n      indices,\n      value\n    };\n    if (match.key) {\n      obj.key = match.key.src;\n    }\n    if (match.idx > -1) {\n      obj.refIndex = match.idx;\n    }\n    data.matches.push(obj);\n  });\n}\n\nfunction transformScore(result, data) {\n  data.score = result.score;\n}\n\nfunction format(results, docs, {\n  includeMatches = Config.includeMatches,\n  includeScore = Config.includeScore\n} = {}) {\n  const transformers = [];\n  if (includeMatches) transformers.push(transformMatches);\n  if (includeScore) transformers.push(transformScore);\n  return results.map(result => {\n    const {\n      idx\n    } = result;\n    const data = {\n      item: docs[idx],\n      refIndex: idx\n    };\n    if (transformers.length) {\n      transformers.forEach(transformer => {\n        transformer(result, data);\n      });\n    }\n    return data;\n  });\n}\n\nconst WORD = /\\b\\w+\\b/g;\nfunction createAnalyzer({\n  isCaseSensitive = false,\n  ignoreDiacritics = false\n} = {}) {\n  return {\n    tokenize(text) {\n      if (!isCaseSensitive) {\n        text = text.toLowerCase();\n      }\n      if (ignoreDiacritics) {\n        text = stripDiacritics(text);\n      }\n      return text.match(WORD) || [];\n    }\n  };\n}\n\nfunction buildInvertedIndex(records, keyCount, analyzer) {\n  const terms = new Map();\n  const df = new Map();\n  let fieldCount = 0;\n  function addField(text, docIdx, keyIdx, subIdx) {\n    const tokens = analyzer.tokenize(text);\n    if (!tokens.length) return;\n    fieldCount++;\n\n    // Count term frequencies in this field\n    const termFreqs = new Map();\n    for (const token of tokens) {\n      termFreqs.set(token, (termFreqs.get(token) || 0) + 1);\n    }\n\n    // Track which terms we've already counted for df in this field\n    for (const [term, tf] of termFreqs) {\n      const posting = {\n        docIdx,\n        keyIdx,\n        subIdx,\n        tf\n      };\n      let postings = terms.get(term);\n      if (!postings) {\n        postings = [];\n        terms.set(term, postings);\n      }\n      postings.push(posting);\n      df.set(term, (df.get(term) || 0) + 1);\n    }\n  }\n  for (const record of records) {\n    const {\n      i: docIdx,\n      v,\n      $: fields\n    } = record;\n\n    // String list\n    if (v !== undefined) {\n      addField(v, docIdx, -1, -1);\n      continue;\n    }\n\n    // Object list\n    if (fields) {\n      for (let keyIdx = 0; keyIdx < keyCount; keyIdx++) {\n        const value = fields[keyIdx];\n        if (!value) continue;\n        if (Array.isArray(value)) {\n          for (const sub of value) {\n            addField(sub.v, docIdx, keyIdx, sub.i ?? -1);\n          }\n        } else {\n          addField(value.v, docIdx, keyIdx, -1);\n        }\n      }\n    }\n  }\n  return {\n    terms,\n    fieldCount,\n    df\n  };\n}\nfunction addToInvertedIndex(index, record, keyCount, analyzer) {\n  const {\n    i: docIdx,\n    v,\n    $: fields\n  } = record;\n  function addField(text, keyIdx, subIdx) {\n    const tokens = analyzer.tokenize(text);\n    if (!tokens.length) return;\n    index.fieldCount++;\n    const termFreqs = new Map();\n    for (const token of tokens) {\n      termFreqs.set(token, (termFreqs.get(token) || 0) + 1);\n    }\n    for (const [term, tf] of termFreqs) {\n      const posting = {\n        docIdx,\n        keyIdx,\n        subIdx,\n        tf\n      };\n      let postings = index.terms.get(term);\n      if (!postings) {\n        postings = [];\n        index.terms.set(term, postings);\n      }\n      postings.push(posting);\n      index.df.set(term, (index.df.get(term) || 0) + 1);\n    }\n  }\n  if (v !== undefined) {\n    addField(v, -1, -1);\n    return;\n  }\n  if (fields) {\n    for (let keyIdx = 0; keyIdx < keyCount; keyIdx++) {\n      const value = fields[keyIdx];\n      if (!value) continue;\n      if (Array.isArray(value)) {\n        for (const sub of value) {\n          addField(sub.v, keyIdx, sub.i ?? -1);\n        }\n      } else {\n        addField(value.v, keyIdx, -1);\n      }\n    }\n  }\n}\nfunction removeFromInvertedIndex(index, docIdx) {\n  for (const [term, postings] of index.terms) {\n    const filtered = postings.filter(p => p.docIdx !== docIdx);\n    const removed = postings.length - filtered.length;\n    if (removed > 0) {\n      index.fieldCount -= removed;\n      index.df.set(term, (index.df.get(term) || 0) - removed);\n      if (filtered.length === 0) {\n        index.terms.delete(term);\n        index.df.delete(term);\n      } else {\n        index.terms.set(term, filtered);\n      }\n    }\n  }\n}\n\nclass Fuse {\n  // Statics are assigned in entry.ts\n\n  constructor(docs, options, index) {\n    this.options = {\n      ...Config,\n      ...options\n    };\n    if (this.options.useExtendedSearch && false) ;\n    if (this.options.useTokenSearch && false) ;\n    this._keyStore = new KeyStore(this.options.keys);\n    this._docs = docs;\n    this._myIndex = null;\n    this._invertedIndex = null;\n    this.setCollection(docs, index);\n    this._lastQuery = null;\n    this._lastSearcher = null;\n  }\n  _getSearcher(query) {\n    if (this._lastQuery === query) {\n      return this._lastSearcher;\n    }\n    const opts = this._invertedIndex ? {\n      ...this.options,\n      _invertedIndex: this._invertedIndex\n    } : this.options;\n    const searcher = createSearcher(query, opts);\n    this._lastQuery = query;\n    this._lastSearcher = searcher;\n    return searcher;\n  }\n  setCollection(docs, index) {\n    this._docs = docs;\n    if (index && !(index instanceof FuseIndex)) {\n      throw new Error(INCORRECT_INDEX_TYPE);\n    }\n    this._myIndex = index || createIndex(this.options.keys, this._docs, {\n      getFn: this.options.getFn,\n      fieldNormWeight: this.options.fieldNormWeight\n    });\n    if (this.options.useTokenSearch) {\n      const analyzer = createAnalyzer({\n        isCaseSensitive: this.options.isCaseSensitive,\n        ignoreDiacritics: this.options.ignoreDiacritics\n      });\n      this._invertedIndex = buildInvertedIndex(this._myIndex.records, this._myIndex.keys.length, analyzer);\n    }\n  }\n  add(doc) {\n    if (!isDefined(doc)) {\n      return;\n    }\n    this._docs.push(doc);\n    this._myIndex.add(doc);\n    if (this._invertedIndex) {\n      const record = this._myIndex.records[this._myIndex.records.length - 1];\n      const analyzer = createAnalyzer({\n        isCaseSensitive: this.options.isCaseSensitive,\n        ignoreDiacritics: this.options.ignoreDiacritics\n      });\n      addToInvertedIndex(this._invertedIndex, record, this._myIndex.keys.length, analyzer);\n    }\n  }\n  remove(predicate = () => false) {\n    const results = [];\n    const indicesToRemove = [];\n    for (let i = 0, len = this._docs.length; i < len; i += 1) {\n      if (predicate(this._docs[i], i)) {\n        results.push(this._docs[i]);\n        indicesToRemove.push(i);\n      }\n    }\n    if (indicesToRemove.length) {\n      if (this._invertedIndex) {\n        for (const idx of indicesToRemove) {\n          removeFromInvertedIndex(this._invertedIndex, idx);\n        }\n      }\n\n      // Remove from docs in reverse to preserve indices\n      for (let i = indicesToRemove.length - 1; i >= 0; i -= 1) {\n        this._docs.splice(indicesToRemove[i], 1);\n      }\n      this._myIndex.removeAll(indicesToRemove);\n    }\n    return results;\n  }\n  removeAt(idx) {\n    if (this._invertedIndex) {\n      removeFromInvertedIndex(this._invertedIndex, idx);\n    }\n    const doc = this._docs.splice(idx, 1)[0];\n    this._myIndex.removeAt(idx);\n    return doc;\n  }\n  getIndex() {\n    return this._myIndex;\n  }\n  search(query, options) {\n    const {\n      limit = -1\n    } = options || {};\n    const {\n      includeMatches,\n      includeScore,\n      shouldSort,\n      sortFn,\n      ignoreFieldNorm\n    } = this.options;\n\n    // Empty string query returns all docs (useful for search UIs)\n    if (isString(query) && !query.trim()) {\n      let docs = this._docs.map((item, idx) => ({\n        item,\n        refIndex: idx\n      }));\n      if (isNumber(limit) && limit > -1) {\n        docs = docs.slice(0, limit);\n      }\n      return docs;\n    }\n    const useHeap = isNumber(limit) && limit > 0 && isString(query);\n    let results;\n    if (useHeap) {\n      const heap = new MaxHeap(limit);\n      if (isString(this._docs[0])) {\n        this._searchStringList(query, {\n          heap,\n          ignoreFieldNorm\n        });\n      } else {\n        this._searchObjectList(query, {\n          heap,\n          ignoreFieldNorm\n        });\n      }\n      results = heap.extractSorted(sortFn);\n    } else {\n      results = isString(query) ? isString(this._docs[0]) ? this._searchStringList(query) : this._searchObjectList(query) : this._searchLogical(query);\n      computeScore(results, {\n        ignoreFieldNorm\n      });\n      if (shouldSort) {\n        results.sort(sortFn);\n      }\n      if (isNumber(limit) && limit > -1) {\n        results = results.slice(0, limit);\n      }\n    }\n    return format(results, this._docs, {\n      includeMatches,\n      includeScore\n    });\n  }\n  _searchStringList(query, {\n    heap,\n    ignoreFieldNorm\n  } = {}) {\n    const searcher = this._getSearcher(query);\n    const {\n      records\n    } = this._myIndex;\n    const results = heap ? null : [];\n\n    // Iterate over every string in the index\n    records.forEach(({\n      v: text,\n      i: idx,\n      n: norm\n    }) => {\n      if (!isDefined(text)) {\n        return;\n      }\n      const {\n        isMatch,\n        score,\n        indices\n      } = searcher.searchIn(text);\n      if (isMatch) {\n        const result = {\n          item: text,\n          idx,\n          matches: [{\n            score,\n            value: text,\n            norm: norm,\n            indices\n          }]\n        };\n        if (heap) {\n          result.score = computeScoreSingle(result.matches, {\n            ignoreFieldNorm\n          });\n          if (heap.shouldInsert(result.score)) {\n            heap.insert(result);\n          }\n        } else {\n          results.push(result);\n        }\n      }\n    });\n    return results;\n  }\n  _searchLogical(query) {\n    const expression = parse(query, this.options);\n    const evaluate = (node, item, idx) => {\n      if (!('children' in node)) {\n        const {\n          keyId,\n          searcher\n        } = node;\n        let matches;\n        if (keyId === null) {\n          // Keyless entry: search across all keys\n          matches = [];\n          this._myIndex.keys.forEach((key, keyIndex) => {\n            matches.push(...this._findMatches({\n              key,\n              value: item[keyIndex],\n              searcher: searcher\n            }));\n          });\n        } else {\n          matches = this._findMatches({\n            key: this._keyStore.get(keyId),\n            value: this._myIndex.getValueForItemAtKeyId(item, keyId),\n            searcher: searcher\n          });\n        }\n        if (matches && matches.length) {\n          return [{\n            idx,\n            item,\n            matches\n          }];\n        }\n        return [];\n      }\n      const {\n        children,\n        operator\n      } = node;\n      const res = [];\n      for (let i = 0, len = children.length; i < len; i += 1) {\n        const child = children[i];\n        const result = evaluate(child, item, idx);\n        if (result.length) {\n          res.push(...result);\n        } else if (operator === LogicalOperator.AND) {\n          return [];\n        }\n      }\n      return res;\n    };\n    const records = this._myIndex.records;\n    const resultMap = new Map();\n    const results = [];\n    records.forEach(({\n      $: item,\n      i: idx\n    }) => {\n      if (isDefined(item)) {\n        const expResults = evaluate(expression, item, idx);\n        if (expResults.length) {\n          // Dedupe when adding\n          if (!resultMap.has(idx)) {\n            resultMap.set(idx, {\n              idx,\n              item,\n              matches: []\n            });\n            results.push(resultMap.get(idx));\n          }\n          expResults.forEach(({\n            matches\n          }) => {\n            resultMap.get(idx).matches.push(...matches);\n          });\n        }\n      }\n    });\n    return results;\n  }\n\n  // When a search involves inverse patterns (e.g. !Syrup), the aggregation\n  // across keys switches from \"ANY key matches\" to \"ALL keys must match.\"\n  // This is signaled by hasInverse on the SearchResult from ExtendedSearch.\n  //\n  // For mixed patterns like \"^hello !Syrup\", a key failure is ambiguous \u2014\n  // it could be the positive or inverse term that failed. In that case we\n  // conservatively exclude the item, which is strictly better than the old\n  // behavior of including it. See: https://github.com/krisk/Fuse/issues/712\n  _searchObjectList(query, {\n    heap,\n    ignoreFieldNorm\n  } = {}) {\n    const searcher = this._getSearcher(query);\n    const {\n      keys,\n      records\n    } = this._myIndex;\n    const results = heap ? null : [];\n\n    // List is Array<Object>\n    records.forEach(({\n      $: item,\n      i: idx\n    }) => {\n      if (!isDefined(item)) {\n        return;\n      }\n      const matches = [];\n      let anyKeyFailed = false;\n      let hasInverse = false;\n\n      // Iterate over every key (i.e, path), and fetch the value at that key\n      keys.forEach((key, keyIndex) => {\n        const keyMatches = this._findMatches({\n          key,\n          value: item[keyIndex],\n          searcher\n        });\n        if (keyMatches.length) {\n          matches.push(...keyMatches);\n          if (keyMatches[0].hasInverse) {\n            hasInverse = true;\n          }\n        } else {\n          anyKeyFailed = true;\n        }\n      });\n\n      // If the search involves inverse patterns, ALL keys must match\n      if (hasInverse && anyKeyFailed) {\n        return;\n      }\n      if (matches.length) {\n        const result = {\n          idx,\n          item,\n          matches\n        };\n        if (heap) {\n          result.score = computeScoreSingle(result.matches, {\n            ignoreFieldNorm\n          });\n          if (heap.shouldInsert(result.score)) {\n            heap.insert(result);\n          }\n        } else {\n          results.push(result);\n        }\n      }\n    });\n    return results;\n  }\n  _findMatches({\n    key,\n    value,\n    searcher\n  }) {\n    if (!isDefined(value)) {\n      return [];\n    }\n    const matches = [];\n    if (isArray(value)) {\n      value.forEach(({\n        v: text,\n        i: idx,\n        n: norm\n      }) => {\n        if (!isDefined(text)) {\n          return;\n        }\n        const {\n          isMatch,\n          score,\n          indices,\n          hasInverse\n        } = searcher.searchIn(text);\n        if (isMatch) {\n          matches.push({\n            score,\n            key,\n            value: text,\n            idx,\n            norm,\n            indices,\n            hasInverse\n          });\n        }\n      });\n    } else {\n      const {\n        v: text,\n        n: norm\n      } = value;\n      const {\n        isMatch,\n        score,\n        indices,\n        hasInverse\n      } = searcher.searchIn(text);\n      if (isMatch) {\n        matches.push({\n          score,\n          key,\n          value: text,\n          norm,\n          indices,\n          hasInverse\n        });\n      }\n    }\n    return matches;\n  }\n}\n\nclass TokenSearch {\n  static condition(_, options) {\n    return options.useTokenSearch;\n  }\n  constructor(pattern, options) {\n    this.options = options;\n    this.analyzer = createAnalyzer({\n      isCaseSensitive: options.isCaseSensitive,\n      ignoreDiacritics: options.ignoreDiacritics\n    });\n    const queryTerms = this.analyzer.tokenize(pattern);\n    const invertedIndex = options._invertedIndex;\n    const {\n      df,\n      fieldCount\n    } = invertedIndex;\n    this.termSearchers = [];\n    this.idfWeights = [];\n    for (const term of queryTerms) {\n      this.termSearchers.push(new BitapSearch(term, {\n        location: options.location,\n        threshold: options.threshold,\n        distance: options.distance,\n        includeMatches: options.includeMatches,\n        findAllMatches: options.findAllMatches,\n        minMatchCharLength: options.minMatchCharLength,\n        isCaseSensitive: options.isCaseSensitive,\n        ignoreDiacritics: options.ignoreDiacritics,\n        ignoreLocation: true\n      }));\n      const docFreq = df.get(term) || 0;\n      const idf = Math.log(1 + (fieldCount - docFreq + 0.5) / (docFreq + 0.5));\n      this.idfWeights.push(idf);\n    }\n  }\n  searchIn(text) {\n    if (!this.termSearchers.length) {\n      return {\n        isMatch: false,\n        score: 1\n      };\n    }\n    const allIndices = [];\n    let weightedScore = 0;\n    let maxPossibleScore = 0;\n    let matchedCount = 0;\n    for (let i = 0; i < this.termSearchers.length; i++) {\n      const result = this.termSearchers[i].searchIn(text);\n      const idf = this.idfWeights[i];\n      maxPossibleScore += idf;\n      if (result.isMatch) {\n        matchedCount++;\n        weightedScore += idf * (1 - result.score);\n        if (result.indices) {\n          allIndices.push(...result.indices);\n        }\n      }\n    }\n    if (matchedCount === 0) {\n      return {\n        isMatch: false,\n        score: 1\n      };\n    }\n    const normalized = maxPossibleScore > 0 ? 1 - weightedScore / maxPossibleScore : 0;\n    const searchResult = {\n      isMatch: true,\n      score: Math.max(0.001, normalized)\n    };\n    if (this.options.includeMatches && allIndices.length) {\n      searchResult.indices = mergeIndices(allIndices);\n    }\n    return searchResult;\n  }\n}\n\nFuse.version = '7.3.0';\nFuse.createIndex = createIndex;\nFuse.parseIndex = parseIndex;\nFuse.config = Config;\nFuse.match = function (pattern, text, options) {\n  const searcher = createSearcher(pattern, {\n    ...Config,\n    ...options\n  });\n  return searcher.searchIn(text);\n};\n{\n  Fuse.parseQuery = parse;\n}\n{\n  register(ExtendedSearch);\n}\n{\n  register(TokenSearch);\n}\nFuse.use = function (...plugins) {\n  plugins.forEach(plugin => register(plugin));\n};\n\n// Re-export public types\n\nexport { Fuse as default };\n"],
+  "mappings": "ubAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,gBAAAE,GAAA,iBAAAC,GAAA,sBAAAC,GAAA,iBAAAC,GAAA,iBAAAC,GAAA,mBAAAC,GAAA,uBAAAC,GAAA,mBAAAC,GAAA,mBAAAC,GAAA,yBAAAC,GAAA,kBAAAC,GAAA,kBAAAC,GAAA,sBAAAC,EAAA,uBAAAC,IAAA,eAAAC,GAAAhB,IAAA,IAAAiB,EAMO,iBCGP,SAASC,EAAQC,EAAO,CACtB,OAAQ,MAAM,QAA+C,MAAM,QAAQA,CAAK,EAAxDC,GAAOD,CAAK,IAAM,gBAC5C,CACA,SAASE,GAAaF,EAAO,CAE3B,GAAI,OAAOA,GAAS,SAClB,OAAOA,EAET,GAAI,OAAOA,GAAU,SACnB,OAAOA,EAAM,SAAS,EAExB,IAAMG,EAASH,EAAQ,GACvB,OAAOG,GAAU,KAAO,EAAIH,GAAS,KAAY,KAAOG,CAC1D,CACA,SAASC,GAASJ,EAAO,CACvB,OAAOA,GAAS,KAAO,GAAKE,GAAaF,CAAK,CAChD,CACA,SAASK,EAASL,EAAO,CACvB,OAAO,OAAOA,GAAU,QAC1B,CACA,SAASM,EAASN,EAAO,CACvB,OAAO,OAAOA,GAAU,QAC1B,CAGA,SAASO,GAAUP,EAAO,CACxB,OAAOA,IAAU,IAAQA,IAAU,IAASQ,GAAaR,CAAK,GAAKC,GAAOD,CAAK,GAAK,kBACtF,CACA,SAASS,GAAST,EAAO,CACvB,OAAO,OAAOA,GAAU,QAC1B,CAGA,SAASQ,GAAaR,EAAO,CAC3B,OAAOS,GAAST,CAAK,GAAKA,IAAU,IACtC,CACA,SAASU,EAAUV,EAAO,CACxB,OAA8BA,GAAU,IAC1C,CACA,SAASW,EAAQX,EAAO,CACtB,MAAO,CAACA,EAAM,KAAK,EAAE,MACvB,CAIA,SAASC,GAAOD,EAAO,CACrB,OAAOA,GAAS,KAAOA,IAAU,OAAY,qBAAuB,gBAAkB,OAAO,UAAU,SAAS,KAAKA,CAAK,CAC5H,CAEA,IAAMY,GAAuB,yBACvBC,GAAuCC,GAAO,yBAAyBA,CAAG,GAC1EC,GAA2BC,GAAO,iCAAiCA,CAAG,IACtEC,GAAuBC,GAAQ,WAAWA,CAAI,mBAC9CC,GAA2BL,GAAO,6BAA6BA,CAAG,+BAElEM,GAAS,OAAO,UAAU,eAC1BC,GAAN,KAAe,CACb,YAAYC,EAAM,CAChB,KAAK,MAAQ,CAAC,EACd,KAAK,QAAU,CAAC,EAChB,IAAIC,EAAc,EAClBD,EAAK,QAAQR,GAAO,CAClB,IAAMU,EAAMC,GAAUX,CAAG,EACzB,KAAK,MAAM,KAAKU,CAAG,EACnB,KAAK,QAAQA,EAAI,EAAE,EAAIA,EACvBD,GAAeC,EAAI,MACrB,CAAC,EAGD,KAAK,MAAM,QAAQV,GAAO,CACxBA,EAAI,QAAUS,CAChB,CAAC,CACH,CACA,IAAIG,EAAO,CACT,OAAO,KAAK,QAAQA,CAAK,CAC3B,CACA,MAAO,CACL,OAAO,KAAK,KACd,CACA,QAAS,CACP,OAAO,KAAK,UAAU,KAAK,KAAK,CAClC,CACF,EACA,SAASD,GAAUX,EAAK,CACtB,IAAIa,EAAO,KACPC,EAAK,KACLC,EAAM,KACNC,EAAS,EACTC,EAAQ,KACZ,GAAI1B,EAASS,CAAG,GAAKf,EAAQe,CAAG,EAC9Be,EAAMf,EACNa,EAAOK,GAAclB,CAAG,EACxBc,EAAKK,GAAYnB,CAAG,MACf,CACL,GAAI,CAACM,GAAO,KAAKN,EAAK,MAAM,EAC1B,MAAM,IAAI,MAAMG,GAAqB,MAAM,CAAC,EAE9C,IAAMC,EAAOJ,EAAI,KAEjB,GADAe,EAAMX,EACFE,GAAO,KAAKN,EAAK,QAAQ,IAC3BgB,EAAShB,EAAI,OACTgB,GAAU,GACZ,MAAM,IAAI,MAAMX,GAAyBD,CAAI,CAAC,EAGlDS,EAAOK,GAAcd,CAAI,EACzBU,EAAKK,GAAYf,CAAI,EACrBa,EAAQjB,EAAI,KACd,CACA,MAAO,CACL,KAAMa,EACN,GAAIC,EACJ,OAAAE,EACA,IAAKD,EACL,MAAAE,CACF,CACF,CACA,SAASC,GAAclB,EAAK,CAC1B,OAAOf,EAAQe,CAAG,EAAIA,EAAMA,EAAI,MAAM,GAAG,CAC3C,CACA,SAASmB,GAAYnB,EAAK,CACxB,OAAOf,EAAQe,CAAG,EAAIA,EAAI,KAAK,GAAG,EAAIA,CACxC,CAEA,SAASoB,GAAIV,EAAKG,EAAM,CACtB,IAAMQ,EAAO,CAAC,EACVC,EAAM,GACJC,EAAU,CAACb,EAAKG,EAAMW,EAAOC,IAAe,CAChD,GAAK7B,EAAUc,CAAG,EAGlB,GAAI,CAACG,EAAKW,CAAK,EAEbH,EAAK,KAAKI,IAAe,OAAY,CACnC,EAAGf,EACH,EAAGe,CACL,EAAIf,CAAG,MACF,CACL,IAAMV,EAAMa,EAAKW,CAAK,EAChBtC,EAAQwB,EAAIV,CAAG,EACrB,GAAI,CAACJ,EAAUV,CAAK,EAClB,OAKF,GAAIsC,IAAUX,EAAK,OAAS,IAAMtB,EAASL,CAAK,GAAKM,EAASN,CAAK,GAAKO,GAAUP,CAAK,GAAK,OAAOA,GAAU,UAC3GmC,EAAK,KAAKI,IAAe,OAAY,CACnC,EAAGnC,GAASJ,CAAK,EACjB,EAAGuC,CACL,EAAInC,GAASJ,CAAK,CAAC,UACVD,EAAQC,CAAK,EAAG,CACzBoC,EAAM,GAEN,QAASI,EAAI,EAAGC,EAAMzC,EAAM,OAAQwC,EAAIC,EAAKD,GAAK,EAChDH,EAAQrC,EAAMwC,CAAC,EAAGb,EAAMW,EAAQ,EAAGE,CAAC,CAExC,MAAWb,EAAK,QAEdU,EAAQrC,EAAO2B,EAAMW,EAAQ,EAAGC,CAAU,CAE9C,CACF,EAGA,OAAAF,EAAQb,EAAKnB,EAASsB,CAAI,EAAIA,EAAK,MAAM,GAAG,EAAIA,EAAM,CAAC,EAChDS,EAAMD,EAAOA,EAAK,CAAC,CAC5B,CAEA,IAAMO,GAAe,CACnB,eAAgB,GAChB,eAAgB,GAChB,mBAAoB,CACtB,EACMC,GAAe,CACnB,gBAAiB,GACjB,iBAAkB,GAClB,aAAc,GACd,KAAM,CAAC,EACP,WAAY,GACZ,OAAQ,CAACC,EAAGC,IAAMD,EAAE,QAAUC,EAAE,MAAQD,EAAE,IAAMC,EAAE,IAAM,GAAK,EAAID,EAAE,MAAQC,EAAE,MAAQ,GAAK,CAC5F,EACMC,GAAe,CACnB,SAAU,EACV,UAAW,GACX,SAAU,GACZ,EACMC,GAAkB,CACtB,kBAAmB,GACnB,eAAgB,GAChB,MAAOb,GACP,eAAgB,GAChB,gBAAiB,GACjB,gBAAiB,CACnB,EACMc,EAAS,OAAO,OAAO,CAC3B,GAAGL,GACH,GAAGD,GACH,GAAGI,GACH,GAAGC,EACL,CAAC,EAEKE,GAAQ,SAId,SAASC,GAAKpB,EAAS,EAAGqB,EAAW,EAAG,CACtC,IAAMC,EAAQ,IAAI,IACZC,EAAI,KAAK,IAAI,GAAIF,CAAQ,EAC/B,MAAO,CACL,IAAInD,EAAO,CACT,IAAMsD,EAAYtD,EAAM,MAAMiD,EAAK,EAAE,OACrC,GAAIG,EAAM,IAAIE,CAAS,EACrB,OAAOF,EAAM,IAAIE,CAAS,EAI5B,IAAMJ,EAAO,EAAI,KAAK,IAAII,EAAW,GAAMxB,CAAM,EAG3CyB,EAAI,WAAW,KAAK,MAAML,EAAOG,CAAC,EAAIA,CAAC,EAC7C,OAAAD,EAAM,IAAIE,EAAWC,CAAC,EACfA,CACT,EACA,OAAQ,CACNH,EAAM,MAAM,CACd,CACF,CACF,CAEA,IAAMI,EAAN,KAAgB,CACd,YAAY,CACV,MAAAzB,EAAQiB,EAAO,MACf,gBAAAS,EAAkBT,EAAO,eAC3B,EAAI,CAAC,EAAG,CACN,KAAK,KAAOE,GAAKO,EAAiB,CAAC,EACnC,KAAK,MAAQ1B,EACb,KAAK,UAAY,GACjB,KAAK,KAAO,CAAC,EACb,KAAK,KAAO,CAAC,EACb,KAAK,SAAW,CAAC,EACjB,KAAK,gBAAgB,CACvB,CACA,WAAW2B,EAAO,CAAC,EAAG,CACpB,KAAK,KAAOA,CACd,CACA,gBAAgBC,EAAU,CAAC,EAAG,CAC5B,KAAK,QAAUA,CACjB,CACA,QAAQrC,EAAO,CAAC,EAAG,CACjB,KAAK,KAAOA,EACZ,KAAK,SAAW,CAAC,EACjBA,EAAK,QAAQ,CAACR,EAAK8C,IAAQ,CACzB,KAAK,SAAS9C,EAAI,EAAE,EAAI8C,CAC1B,CAAC,CACH,CACA,QAAS,CACH,KAAK,WAAa,CAAC,KAAK,KAAK,SAGjC,KAAK,UAAY,GAGbvD,EAAS,KAAK,KAAK,CAAC,CAAC,EACvB,KAAK,KAAK,QAAQ,CAACwD,EAAKC,IAAa,CACnC,KAAK,WAAWD,EAAKC,CAAQ,CAC/B,CAAC,EAGD,KAAK,KAAK,QAAQ,CAACD,EAAKC,IAAa,CACnC,KAAK,WAAWD,EAAKC,CAAQ,CAC/B,CAAC,EAEH,KAAK,KAAK,MAAM,EAClB,CAEA,IAAID,EAAK,CACP,IAAMD,EAAM,KAAK,KAAK,EAClBvD,EAASwD,CAAG,EACd,KAAK,WAAWA,EAAKD,CAAG,EAExB,KAAK,WAAWC,EAAKD,CAAG,CAE5B,CAEA,SAASA,EAAK,CACZ,KAAK,QAAQ,OAAOA,EAAK,CAAC,EAG1B,QAASpB,EAAIoB,EAAKnB,EAAM,KAAK,KAAK,EAAGD,EAAIC,EAAKD,GAAK,EACjD,KAAK,QAAQA,CAAC,EAAE,GAAK,CAEzB,CAEA,UAAUuB,EAAS,CAEjB,QAASvB,EAAIuB,EAAQ,OAAS,EAAGvB,GAAK,EAAGA,GAAK,EAC5C,KAAK,QAAQ,OAAOuB,EAAQvB,CAAC,EAAG,CAAC,EAGnC,QAASA,EAAI,EAAGC,EAAM,KAAK,QAAQ,OAAQD,EAAIC,EAAKD,GAAK,EACvD,KAAK,QAAQA,CAAC,EAAE,EAAIA,CAExB,CACA,uBAAuBwB,EAAMtC,EAAO,CAClC,OAAOsC,EAAK,KAAK,SAAStC,CAAK,CAAC,CAClC,CACA,MAAO,CACL,OAAO,KAAK,QAAQ,MACtB,CACA,WAAWmC,EAAKC,EAAU,CACxB,GAAI,CAACpD,EAAUmD,CAAG,GAAKlD,EAAQkD,CAAG,EAChC,OAEF,IAAMI,EAAS,CACb,EAAGJ,EACH,EAAGC,EACH,EAAG,KAAK,KAAK,IAAID,CAAG,CACtB,EACA,KAAK,QAAQ,KAAKI,CAAM,CAC1B,CACA,WAAWJ,EAAKC,EAAU,CACxB,IAAMG,EAAS,CACb,EAAGH,EACH,EAAG,CAAC,CACN,EAGA,KAAK,KAAK,QAAQ,CAAChD,EAAKoD,IAAa,CACnC,IAAMlE,EAAQc,EAAI,MAAQA,EAAI,MAAM+C,CAAG,EAAI,KAAK,MAAMA,EAAK/C,EAAI,IAAI,EACnE,GAAKJ,EAAUV,CAAK,GAGpB,GAAID,EAAQC,CAAK,EAAG,CAClB,IAAMmE,EAAa,CAAC,EACpB,QAAS3B,EAAI,EAAGC,EAAMzC,EAAM,OAAQwC,EAAIC,EAAKD,GAAK,EAAG,CACnD,IAAMwB,EAAOhE,EAAMwC,CAAC,EACpB,GAAK9B,EAAUsD,CAAI,GAGnB,GAAI3D,EAAS2D,CAAI,GAEf,GAAI,CAACrD,EAAQqD,CAAI,EAAG,CAClB,IAAMI,EAAY,CAChB,EAAGJ,EACH,EAAGxB,EACH,EAAG,KAAK,KAAK,IAAIwB,CAAI,CACvB,EACAG,EAAW,KAAKC,CAAS,CAC3B,UACS1D,EAAUsD,EAAK,CAAC,EAAG,CAE5B,IAAMK,EAAOhE,EAAS2D,EAAK,CAAC,EAAIA,EAAK,EAAI5D,GAAS4D,EAAK,CAAC,EACxD,GAAI,CAACrD,EAAQ0D,CAAI,EAAG,CAClB,IAAMD,EAAY,CAChB,EAAGC,EACH,EAAGL,EAAK,EACR,EAAG,KAAK,KAAK,IAAIK,CAAI,CACvB,EACAF,EAAW,KAAKC,CAAS,CAC3B,CACF,EACF,CACAH,EAAO,EAAEC,CAAQ,EAAIC,CACvB,SAAW9D,EAASL,CAAK,GAAK,CAACW,EAAQX,CAAK,EAAG,CAC7C,IAAMoE,EAAY,CAChB,EAAGpE,EACH,EAAG,KAAK,KAAK,IAAIA,CAAK,CACxB,EACAiE,EAAO,EAAEC,CAAQ,EAAIE,CACvB,EACF,CAAC,EACD,KAAK,QAAQ,KAAKH,CAAM,CAC1B,CACA,QAAS,CACP,MAAO,CAEL,KAAM,KAAK,KAAK,IAAI,CAAC,CACnB,MAAAlC,EACA,GAAGjB,CACL,IAAMA,CAAG,EACT,QAAS,KAAK,OAChB,CACF,CACF,EACA,SAASwD,GAAYhD,EAAMoC,EAAM,CAC/B,MAAA3B,EAAQiB,EAAO,MACf,gBAAAS,EAAkBT,EAAO,eAC3B,EAAI,CAAC,EAAG,CACN,IAAMuB,EAAU,IAAIf,EAAU,CAC5B,MAAAzB,EACA,gBAAA0B,CACF,CAAC,EACD,OAAAc,EAAQ,QAAQjD,EAAK,IAAIG,EAAS,CAAC,EACnC8C,EAAQ,WAAWb,CAAI,EACvBa,EAAQ,OAAO,EACRA,CACT,CACA,SAASC,GAAWC,EAAM,CACxB,MAAA1C,EAAQiB,EAAO,MACf,gBAAAS,EAAkBT,EAAO,eAC3B,EAAI,CAAC,EAAG,CACN,GAAM,CACJ,KAAA1B,EACA,QAAAqC,CACF,EAAIc,EACEF,EAAU,IAAIf,EAAU,CAC5B,MAAAzB,EACA,gBAAA0B,CACF,CAAC,EACD,OAAAc,EAAQ,QAAQjD,CAAI,EACpBiD,EAAQ,gBAAgBZ,CAAO,EACxBY,CACT,CAEA,SAASG,GAAqBC,EAAY,CAAC,EAAGC,EAAqB5B,EAAO,mBAAoB,CAC5F,IAAMe,EAAU,CAAC,EACbc,EAAQ,GACRC,EAAM,GACNtC,EAAI,EACR,QAASC,EAAMkC,EAAU,OAAQnC,EAAIC,EAAKD,GAAK,EAAG,CAChD,IAAMuC,EAAQJ,EAAUnC,CAAC,EACrBuC,GAASF,IAAU,GACrBA,EAAQrC,EACC,CAACuC,GAASF,IAAU,KAC7BC,EAAMtC,EAAI,EACNsC,EAAMD,EAAQ,GAAKD,GACrBb,EAAQ,KAAK,CAACc,EAAOC,CAAG,CAAC,EAE3BD,EAAQ,GAEZ,CAGA,OAAIF,EAAUnC,EAAI,CAAC,GAAKA,EAAIqC,GAASD,GACnCb,EAAQ,KAAK,CAACc,EAAOrC,EAAI,CAAC,CAAC,EAEtBuB,CACT,CAGA,IAAMiB,EAAW,GAEjB,SAASC,GAAOZ,EAAMa,EAASC,EAAiB,CAC9C,SAAAC,EAAWpC,EAAO,SAClB,SAAAqC,EAAWrC,EAAO,SAClB,UAAAsC,EAAYtC,EAAO,UACnB,eAAAuC,EAAiBvC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,eAAAwC,EAAiBxC,EAAO,eACxB,eAAAyC,EAAiBzC,EAAO,cAC1B,EAAI,CAAC,EAAG,CACN,GAAIkC,EAAQ,OAASF,EACnB,MAAM,IAAI,MAAMjE,GAAyBiE,CAAQ,CAAC,EAEpD,IAAMU,EAAaR,EAAQ,OAErBS,EAAUtB,EAAK,OAEfuB,EAAmB,KAAK,IAAI,EAAG,KAAK,IAAIR,EAAUO,CAAO,CAAC,EAE5DE,EAAmBP,EAEnBQ,EAAeF,EAIbG,EAAY,CAACC,EAAQC,IAAoB,CAC7C,IAAMC,EAAWF,EAASN,EAC1B,GAAID,EAAgB,OAAOS,EAC3B,IAAMC,EAAY,KAAK,IAAIP,EAAmBK,CAAe,EAC7D,OAAKZ,EACEa,EAAWC,EAAYd,EADRc,EAAY,EAAMD,CAE1C,EAIME,EAAiBxB,EAAqB,GAAKY,EAE3Ca,EAAYD,EAAiB,MAAMT,CAAO,EAAI,CAAC,EACjDrD,EAGJ,MAAQA,EAAQ+B,EAAK,QAAQa,EAASY,CAAY,GAAK,IAAI,CACzD,IAAMQ,EAAQP,EAAU,EAAGzD,CAAK,EAGhC,GAFAuD,EAAmB,KAAK,IAAIS,EAAOT,CAAgB,EACnDC,EAAexD,EAAQoD,EACnBU,EAAgB,CAClB,IAAI5D,EAAI,EACR,KAAOA,EAAIkD,GACTW,EAAU/D,EAAQE,CAAC,EAAI,EACvBA,GAAK,CAET,CACF,CAGAsD,EAAe,GACf,IAAIS,EAAa,CAAC,EACdC,EAAa,EACbC,EAASf,EAAaC,EACpBe,EAAO,GAAKhB,EAAa,EAC/B,QAASlD,EAAI,EAAGA,EAAIkD,EAAYlD,GAAK,EAAG,CAItC,IAAImE,EAAS,EACTC,EAASH,EACb,KAAOE,EAASC,GACAb,EAAUvD,EAAGoD,EAAmBgB,CAAM,GACvCf,EACXc,EAASC,EAETH,EAASG,EAEXA,EAAS,KAAK,OAAOH,EAASE,GAAU,EAAIA,CAAM,EAIpDF,EAASG,EACT,IAAI/B,EAAQ,KAAK,IAAI,EAAGe,EAAmBgB,EAAS,CAAC,EAC/CC,EAAStB,EAAiBI,EAAU,KAAK,IAAIC,EAAmBgB,EAAQjB,CAAO,EAAID,EAGnFoB,EAAS,MAAMD,EAAS,CAAC,EAC/BC,EAAOD,EAAS,CAAC,GAAK,GAAKrE,GAAK,EAChC,QAASuE,EAAIF,EAAQE,GAAKlC,EAAOkC,GAAK,EAAG,CACvC,IAAMd,EAAkBc,EAAI,EACtBC,EAAY7B,EAAgBd,EAAK4B,CAAe,CAAC,EAavD,GAZIG,IAEFC,EAAUJ,CAAe,EAAI,CAAC,CAAC,CAACe,GAIlCF,EAAOC,CAAC,GAAKD,EAAOC,EAAI,CAAC,GAAK,EAAI,GAAKC,EAGnCxE,IACFsE,EAAOC,CAAC,IAAMR,EAAWQ,EAAI,CAAC,EAAIR,EAAWQ,CAAC,IAAM,EAAI,EAAIR,EAAWQ,EAAI,CAAC,GAE1ED,EAAOC,CAAC,EAAIL,IACdF,EAAaT,EAAUvD,EAAGyD,CAAe,EAIrCO,GAAcX,GAAkB,CAMlC,GAJAA,EAAmBW,EACnBV,EAAeG,EAGXH,GAAgBF,EAClB,MAIFf,EAAQ,KAAK,IAAI,EAAG,EAAIe,EAAmBE,CAAY,CACzD,CAEJ,CAIA,GADcC,EAAUvD,EAAI,EAAGoD,CAAgB,EACnCC,EACV,MAEFU,EAAaO,CACf,CACA,IAAM3G,EAAS,CACb,QAAS2F,GAAgB,EAEzB,MAAO,KAAK,IAAI,KAAOU,CAAU,CACnC,EACA,GAAIJ,EAAgB,CAClB,IAAMrC,EAAUW,GAAqB2B,EAAWzB,CAAkB,EAC7Db,EAAQ,OAEFyB,IACTrF,EAAO,QAAU4D,GAFjB5D,EAAO,QAAU,EAIrB,CACA,OAAOA,CACT,CAEA,SAAS8G,GAAsB/B,EAAS,CACtC,IAAMwB,EAAO,CAAC,EACd,QAASlE,EAAI,EAAGC,EAAMyC,EAAQ,OAAQ1C,EAAIC,EAAKD,GAAK,EAAG,CACrD,IAAM0E,EAAOhC,EAAQ,OAAO1C,CAAC,EAC7BkE,EAAKQ,CAAI,GAAKR,EAAKQ,CAAI,GAAK,GAAK,GAAKzE,EAAMD,EAAI,CAClD,CACA,OAAOkE,CACT,CAEA,SAASS,GAAapD,EAAS,CAC7B,GAAIA,EAAQ,QAAU,EAAG,OAAOA,EAChCA,EAAQ,KAAK,CAACnB,EAAGC,IAAMD,EAAE,CAAC,EAAIC,EAAE,CAAC,GAAKD,EAAE,CAAC,EAAIC,EAAE,CAAC,CAAC,EACjD,IAAMuE,EAAS,CAACrD,EAAQ,CAAC,CAAC,EAC1B,QAASvB,EAAI,EAAGC,EAAMsB,EAAQ,OAAQvB,EAAIC,EAAKD,GAAK,EAAG,CACrD,IAAM6E,EAAOD,EAAOA,EAAO,OAAS,CAAC,EAC/BE,EAAOvD,EAAQvB,CAAC,EAClB8E,EAAK,CAAC,GAAKD,EAAK,CAAC,EAAI,EACvBA,EAAK,CAAC,EAAI,KAAK,IAAIA,EAAK,CAAC,EAAGC,EAAK,CAAC,CAAC,EAEnCF,EAAO,KAAKE,CAAI,CAEpB,CACA,OAAOF,CACT,CAGA,IAAMG,GAAuB,CAC3B,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IAEV,OAAU,IACZ,EACMC,GAAsB,IAAI,OAAO,IAAM,OAAO,KAAKD,EAAoB,EAAE,KAAK,EAAE,EAAI,IAAK,GAAG,EAC5FE,EAAkB,OAAO,UAAU,UAAYC,GAAOA,EAAI,UAAU,KAAK,EAAE,QAAQ,ykEAA0kE,EAAE,EAAE,QAAQF,GAAqBG,GAAMJ,GAAqBI,CAAE,CAAC,EAAID,GAAOA,EAEvuEE,EAAN,KAAkB,CAChB,YAAY1C,EAAS,CACnB,SAAAE,EAAWpC,EAAO,SAClB,UAAAsC,EAAYtC,EAAO,UACnB,SAAAqC,EAAWrC,EAAO,SAClB,eAAAwC,EAAiBxC,EAAO,eACxB,eAAAuC,EAAiBvC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,gBAAA6E,EAAkB7E,EAAO,gBACzB,iBAAA8E,EAAmB9E,EAAO,iBAC1B,eAAAyC,EAAiBzC,EAAO,cAC1B,EAAI,CAAC,EAAG,CAgBN,GAfA,KAAK,QAAU,CACb,SAAAoC,EACA,UAAAE,EACA,SAAAD,EACA,eAAAG,EACA,eAAAD,EACA,mBAAAX,EACA,gBAAAiD,EACA,iBAAAC,EACA,eAAArC,CACF,EACAP,EAAU2C,EAAkB3C,EAAUA,EAAQ,YAAY,EAC1DA,EAAU4C,EAAmBL,EAAgBvC,CAAO,EAAIA,EACxD,KAAK,QAAUA,EACf,KAAK,OAAS,CAAC,EACX,CAAC,KAAK,QAAQ,OAChB,OAEF,IAAM6C,EAAW,CAAC7C,EAAS8C,IAAe,CACxC,KAAK,OAAO,KAAK,CACf,QAAA9C,EACA,SAAU+B,GAAsB/B,CAAO,EACvC,WAAA8C,CACF,CAAC,CACH,EACMvF,EAAM,KAAK,QAAQ,OACzB,GAAIA,EAAMuC,EAAU,CAClB,IAAIxC,EAAI,EACFyF,EAAYxF,EAAMuC,EAClBF,EAAMrC,EAAMwF,EAClB,KAAOzF,EAAIsC,GACTiD,EAAS,KAAK,QAAQ,OAAOvF,EAAGwC,CAAQ,EAAGxC,CAAC,EAC5CA,GAAKwC,EAEP,GAAIiD,EAAW,CACb,IAAMD,EAAavF,EAAMuC,EACzB+C,EAAS,KAAK,QAAQ,OAAOC,CAAU,EAAGA,CAAU,CACtD,CACF,MACED,EAAS,KAAK,QAAS,CAAC,CAE5B,CACA,SAAS1D,EAAM,CACb,GAAM,CACJ,gBAAAwD,EACA,iBAAAC,EACA,eAAAtC,CACF,EAAI,KAAK,QAKT,GAJAnB,EAAOwD,EAAkBxD,EAAOA,EAAK,YAAY,EACjDA,EAAOyD,EAAmBL,EAAgBpD,CAAI,EAAIA,EAG9C,KAAK,UAAYA,EAAM,CACzB,IAAMlE,EAAS,CACb,QAAS,GACT,MAAO,CACT,EACA,OAAIqF,IACFrF,EAAO,QAAU,CAAC,CAAC,EAAGkE,EAAK,OAAS,CAAC,CAAC,GAEjClE,CACT,CAGA,GAAM,CACJ,SAAAiF,EACA,SAAAC,EACA,UAAAC,EACA,eAAAC,EACA,mBAAAX,EACA,eAAAa,CACF,EAAI,KAAK,QACHyC,EAAa,CAAC,EAChBC,EAAa,EACbC,EAAa,GACjB,KAAK,OAAO,QAAQ,CAAC,CACnB,QAAAlD,EACA,SAAAmD,EACA,WAAAL,CACF,IAAM,CACJ,GAAM,CACJ,QAAAM,EACA,MAAAhC,EACA,QAAAvC,CACF,EAAIkB,GAAOZ,EAAMa,EAASmD,EAAU,CAClC,SAAUjD,EAAW4C,EACrB,SAAA3C,EACA,UAAAC,EACA,eAAAC,EACA,mBAAAX,EACA,eAAAY,EACA,eAAAC,CACF,CAAC,EACG6C,IACFF,EAAa,IAEfD,GAAc7B,EACVgC,GAAWvE,GACbmE,EAAW,KAAK,GAAGnE,CAAO,CAE9B,CAAC,EACD,IAAM5D,EAAS,CACb,QAASiI,EACT,MAAOA,EAAaD,EAAa,KAAK,OAAO,OAAS,CACxD,EACA,OAAIC,GAAc5C,IAChBrF,EAAO,QAAUgH,GAAae,CAAU,GAEnC/H,CACT,CACF,EAEMoI,EAAN,KAAgB,CACd,YAAYrD,EAAS,CACnB,KAAK,QAAUA,CACjB,CACA,OAAO,aAAaA,EAAS,CAC3B,OAAOsD,GAAStD,EAAS,KAAK,UAAU,CAC1C,CACA,OAAO,cAAcA,EAAS,CAC5B,OAAOsD,GAAStD,EAAS,KAAK,WAAW,CAC3C,CAEA,OAAOuD,EAAO,CACZ,MAAO,CACL,QAAS,GACT,MAAO,CACT,CACF,CACF,EACA,SAASD,GAAStD,EAASwD,EAAK,CAC9B,IAAMC,EAAUzD,EAAQ,MAAMwD,CAAG,EACjC,OAAOC,EAAUA,EAAQ,CAAC,EAAI,IAChC,CAMA,IAAMC,GAAN,cAAyBL,CAAU,CACjC,YAAYrD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,OACT,CACA,WAAW,YAAa,CACtB,MAAO,WACT,CACA,WAAW,aAAc,CACvB,MAAO,SACT,CACA,OAAOb,EAAM,CACX,IAAMiE,EAAUjE,IAAS,KAAK,QAC9B,MAAO,CACL,QAAAiE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAG,KAAK,QAAQ,OAAS,CAAC,CACtC,CACF,CACF,EAMMO,GAAN,cAAgCN,CAAU,CACxC,YAAYrD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,eACT,CACA,WAAW,YAAa,CACtB,MAAO,WACT,CACA,WAAW,aAAc,CACvB,MAAO,SACT,CACA,OAAOb,EAAM,CAEX,IAAMiE,EADQjE,EAAK,QAAQ,KAAK,OAAO,IACb,GAC1B,MAAO,CACL,QAAAiE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAGjE,EAAK,OAAS,CAAC,CAC9B,CACF,CACF,EAKMyE,GAAN,cAA+BP,CAAU,CACvC,YAAYrD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,cACT,CACA,WAAW,YAAa,CACtB,MAAO,YACT,CACA,WAAW,aAAc,CACvB,MAAO,UACT,CACA,OAAOb,EAAM,CACX,IAAMiE,EAAUjE,EAAK,WAAW,KAAK,OAAO,EAC5C,MAAO,CACL,QAAAiE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAG,KAAK,QAAQ,OAAS,CAAC,CACtC,CACF,CACF,EAMMS,GAAN,cAAsCR,CAAU,CAC9C,YAAYrD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,sBACT,CACA,WAAW,YAAa,CACtB,MAAO,aACT,CACA,WAAW,aAAc,CACvB,MAAO,WACT,CACA,OAAOb,EAAM,CACX,IAAMiE,EAAU,CAACjE,EAAK,WAAW,KAAK,OAAO,EAC7C,MAAO,CACL,QAAAiE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAGjE,EAAK,OAAS,CAAC,CAC9B,CACF,CACF,EAKM2E,GAAN,cAA+BT,CAAU,CACvC,YAAYrD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,cACT,CACA,WAAW,YAAa,CACtB,MAAO,YACT,CACA,WAAW,aAAc,CACvB,MAAO,UACT,CACA,OAAOb,EAAM,CACX,IAAMiE,EAAUjE,EAAK,SAAS,KAAK,OAAO,EAC1C,MAAO,CACL,QAAAiE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAACjE,EAAK,OAAS,KAAK,QAAQ,OAAQA,EAAK,OAAS,CAAC,CAC9D,CACF,CACF,EAKM4E,GAAN,cAAsCV,CAAU,CAC9C,YAAYrD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,sBACT,CACA,WAAW,YAAa,CACtB,MAAO,aACT,CACA,WAAW,aAAc,CACvB,MAAO,WACT,CACA,OAAOb,EAAM,CACX,IAAMiE,EAAU,CAACjE,EAAK,SAAS,KAAK,OAAO,EAC3C,MAAO,CACL,QAAAiE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAS,CAAC,EAAGjE,EAAK,OAAS,CAAC,CAC9B,CACF,CACF,EAEM6E,EAAN,cAAyBX,CAAU,CACjC,YAAYrD,EAAS,CACnB,SAAAE,EAAWpC,EAAO,SAClB,UAAAsC,EAAYtC,EAAO,UACnB,SAAAqC,EAAWrC,EAAO,SAClB,eAAAwC,EAAiBxC,EAAO,eACxB,eAAAuC,EAAiBvC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,gBAAA6E,EAAkB7E,EAAO,gBACzB,iBAAA8E,EAAmB9E,EAAO,iBAC1B,eAAAyC,EAAiBzC,EAAO,cAC1B,EAAI,CAAC,EAAG,CACN,MAAMkC,CAAO,EACb,KAAK,aAAe,IAAI0C,EAAY1C,EAAS,CAC3C,SAAAE,EACA,UAAAE,EACA,SAAAD,EACA,eAAAG,EACA,eAAAD,EACA,mBAAAX,EACA,gBAAAiD,EACA,iBAAAC,EACA,eAAArC,CACF,CAAC,CACH,CACA,WAAW,MAAO,CAChB,MAAO,OACT,CACA,WAAW,YAAa,CACtB,MAAO,UACT,CACA,WAAW,aAAc,CACvB,MAAO,QACT,CACA,OAAOpB,EAAM,CACX,OAAO,KAAK,aAAa,SAASA,CAAI,CACxC,CACF,EAMM8E,EAAN,cAA2BZ,CAAU,CACnC,YAAYrD,EAAS,CACnB,MAAMA,CAAO,CACf,CACA,WAAW,MAAO,CAChB,MAAO,SACT,CACA,WAAW,YAAa,CACtB,MAAO,WACT,CACA,WAAW,aAAc,CACvB,MAAO,SACT,CACA,OAAOb,EAAM,CACX,IAAIe,EAAW,EACX9C,EACEyB,EAAU,CAAC,EACX2B,EAAa,KAAK,QAAQ,OAGhC,MAAQpD,EAAQ+B,EAAK,QAAQ,KAAK,QAASe,CAAQ,GAAK,IACtDA,EAAW9C,EAAQoD,EACnB3B,EAAQ,KAAK,CAACzB,EAAO8C,EAAW,CAAC,CAAC,EAEpC,IAAMkD,EAAU,CAAC,CAACvE,EAAQ,OAC1B,MAAO,CACL,QAAAuE,EACA,MAAOA,EAAU,EAAI,EACrB,QAAAvE,CACF,CACF,CACF,EAGMqF,GAAY,CAACR,GAAYO,EAAcL,GAAkBC,GAAyBE,GAAyBD,GAAkBH,GAAmBK,CAAU,EAC1JG,GAAeD,GAAU,OACzBE,GAAe,KACfC,GAAW,IAKjB,SAASC,GAAStE,EAAS,CACzB,IAAMuE,EAAS,CAAC,EACVhH,EAAMyC,EAAQ,OAChB,EAAI,EACR,KAAO,EAAIzC,GAAK,CAEd,KAAO,EAAIA,GAAOyC,EAAQ,CAAC,IAAM,KAAK,IACtC,GAAI,GAAKzC,EAAK,MAGd,IAAIsE,EAAI,EACR,KAAOA,EAAItE,GAAOyC,EAAQ6B,CAAC,IAAM,KAAO7B,EAAQ6B,CAAC,IAAM,KAAKA,IAC5D,GAAIA,EAAItE,GAAOyC,EAAQ6B,CAAC,IAAM,IAAK,CAKjC,IADAA,IACOA,EAAItE,GAAK,CACd,GAAIyC,EAAQ6B,CAAC,IAAM,IAAK,CAEtB,IAAM2C,EAAO3C,EAAI,EACjB,GAAI2C,GAAQjH,GAAOyC,EAAQwE,CAAI,IAAM,IAAK,CACxC3C,IACA,KACF,CACA,GAAI7B,EAAQwE,CAAI,IAAM,MAAQA,EAAO,GAAKjH,GAAOyC,EAAQwE,EAAO,CAAC,IAAM,KAAM,CAC3E3C,GAAK,EACL,KACF,CACF,CACAA,GACF,CACA0C,EAAO,KAAKvE,EAAQ,UAAU,EAAG6B,CAAC,CAAC,EACnC,EAAIA,CACN,KAAO,CAEL,KAAOA,EAAItE,GAAOyC,EAAQ6B,CAAC,IAAM,KAAKA,IACtC0C,EAAO,KAAKvE,EAAQ,UAAU,EAAG6B,CAAC,CAAC,EACnC,EAAIA,CACN,CACF,CACA,OAAO0C,CACT,CAKA,SAASE,GAAWzE,EAAS0E,EAAU,CAAC,EAAG,CAGzC,OADgB1E,EAAQ,QAAQ,QAASoE,EAAY,EACtC,MAAMC,EAAQ,EAAE,IAAIvF,GAAQ,CAEzC,IAAM6F,EAAW7F,EAAK,QAAQ,UAAW,GAAG,EACtC8F,EAAQN,GAASK,EAAS,KAAK,CAAC,EAAE,OAAO7F,GAAQA,GAAQ,CAAC,CAACA,EAAK,KAAK,CAAC,EACtE+F,EAAU,CAAC,EACjB,QAASvH,EAAI,EAAGC,EAAMqH,EAAM,OAAQtH,EAAIC,EAAKD,GAAK,EAAG,CACnD,IAAMwH,EAAYF,EAAMtH,CAAC,EAGrByH,EAAQ,GACRrG,EAAM,GACV,KAAO,CAACqG,GAAS,EAAErG,EAAMyF,IAAc,CACrC,IAAMa,EAAWd,GAAUxF,CAAG,EACxBuG,EAAQD,EAAS,aAAaF,CAAS,EACzCG,IACFJ,EAAQ,KAAK,IAAIG,EAASC,EAAOP,CAAO,CAAC,EACzCK,EAAQ,GAEZ,CACA,GAAI,CAAAA,EAMJ,IADArG,EAAM,GACC,EAAEA,EAAMyF,IAAc,CAC3B,IAAMa,EAAWd,GAAUxF,CAAG,EACxBuG,EAAQD,EAAS,cAAcF,CAAS,EAC9C,GAAIG,EAAO,CACTJ,EAAQ,KAAK,IAAIG,EAASC,EAAOP,CAAO,CAAC,EACzC,KACF,CACF,CACF,CACA,OAAOG,CACT,CAAC,CACH,CAIA,IAAMK,GAAgB,IAAI,IAAI,CAAClB,EAAW,KAAMC,EAAa,IAAI,CAAC,EAC5DkB,GAAN,KAAqB,CACnB,YAAYnF,EAAS,CACnB,gBAAA2C,EAAkB7E,EAAO,gBACzB,iBAAA8E,EAAmB9E,EAAO,iBAC1B,eAAAwC,EAAiBxC,EAAO,eACxB,mBAAA4B,EAAqB5B,EAAO,mBAC5B,eAAAyC,EAAiBzC,EAAO,eACxB,eAAAuC,EAAiBvC,EAAO,eACxB,SAAAoC,EAAWpC,EAAO,SAClB,UAAAsC,EAAYtC,EAAO,UACnB,SAAAqC,EAAWrC,EAAO,QACpB,EAAI,CAAC,EAAG,CACN,KAAK,MAAQ,KACb,KAAK,QAAU,CACb,gBAAA6E,EACA,iBAAAC,EACA,eAAAtC,EACA,mBAAAZ,EACA,eAAAW,EACA,eAAAE,EACA,SAAAL,EACA,UAAAE,EACA,SAAAD,CACF,EACAH,EAAU2C,EAAkB3C,EAAUA,EAAQ,YAAY,EAC1DA,EAAU4C,EAAmBL,EAAgBvC,CAAO,EAAIA,EACxD,KAAK,QAAUA,EACf,KAAK,MAAQyE,GAAW,KAAK,QAAS,KAAK,OAAO,CACpD,CACA,OAAO,UAAUW,EAAGV,EAAS,CAC3B,OAAOA,EAAQ,iBACjB,CAKA,SAASvF,EAAM,CACb,IAAMyF,EAAQ,KAAK,MACnB,GAAI,CAACA,EACH,MAAO,CACL,QAAS,GACT,MAAO,CACT,EAEF,GAAM,CACJ,eAAAtE,EACA,gBAAAqC,EACA,iBAAAC,CACF,EAAI,KAAK,QACTzD,EAAOwD,EAAkBxD,EAAOA,EAAK,YAAY,EACjDA,EAAOyD,EAAmBL,EAAgBpD,CAAI,EAAIA,EAClD,IAAIkG,EAAa,EACXrC,EAAa,CAAC,EAChBC,EAAa,EACbqC,EAAa,GAGjB,QAAShI,EAAI,EAAGiI,EAAOX,EAAM,OAAQtH,EAAIiI,EAAMjI,GAAK,EAAG,CACrD,IAAM4G,EAAYU,EAAMtH,CAAC,EAGzB0F,EAAW,OAAS,EACpBqC,EAAa,EACbC,EAAa,GAGb,QAASzD,EAAI,EAAG2D,EAAOtB,EAAU,OAAQrC,EAAI2D,EAAM3D,GAAK,EAAG,CACzD,IAAMmD,EAAWd,EAAUrC,CAAC,EACtB,CACJ,QAAAuB,EACA,QAAAvE,EACA,MAAAuC,CACF,EAAI4D,EAAS,OAAO7F,CAAI,EACxB,GAAIiE,EAAS,CACXiC,GAAc,EACdpC,GAAc7B,EACd,IAAMqE,EAAOT,EAAS,YAAY,KAC9BS,EAAK,WAAW,SAAS,IAC3BH,EAAa,IAEXhF,IACE4E,GAAc,IAAIO,CAAI,EACxBzC,EAAW,KAAK,GAAGnE,CAAO,EAE1BmE,EAAW,KAAKnE,CAAO,EAG7B,KAAO,CACLoE,EAAa,EACboC,EAAa,EACbrC,EAAW,OAAS,EACpBsC,EAAa,GACb,KACF,CACF,CAGA,GAAID,EAAY,CACd,IAAMpK,EAAS,CACb,QAAS,GACT,MAAOgI,EAAaoC,CACtB,EACA,OAAIC,IACFrK,EAAO,WAAa,IAElBqF,IACFrF,EAAO,QAAUgH,GAAae,CAAU,GAEnC/H,CACT,CACF,CAGA,MAAO,CACL,QAAS,GACT,MAAO,CACT,CACF,CACF,EAEMyK,GAAsB,CAAC,EAC7B,SAASC,MAAYC,EAAM,CACzBF,GAAoB,KAAK,GAAGE,CAAI,CAClC,CACA,SAASC,EAAe7F,EAAS0E,EAAS,CACxC,QAASpH,EAAI,EAAGC,EAAMmI,GAAoB,OAAQpI,EAAIC,EAAKD,GAAK,EAAG,CACjE,IAAMwI,EAAgBJ,GAAoBpI,CAAC,EAC3C,GAAIwI,EAAc,UAAU9F,EAAS0E,CAAO,EAC1C,OAAO,IAAIoB,EAAc9F,EAAS0E,CAAO,CAE7C,CACA,OAAO,IAAIhC,EAAY1C,EAAS0E,CAAO,CACzC,CAEA,IAAMqB,EAAkB,CACtB,IAAK,OACL,GAAI,KACN,EACMC,GAAU,CACd,KAAM,QACN,QAAS,MACX,EACMC,GAAerB,GAAS,CAAC,EAAEA,EAAMmB,EAAgB,GAAG,GAAKnB,EAAMmB,EAAgB,EAAE,GACjFG,GAAStB,GAAS,CAAC,CAACA,EAAMoB,GAAQ,IAAI,EACtCG,GAASvB,GAAS,CAAC/J,EAAQ+J,CAAK,GAAKrJ,GAASqJ,CAAK,GAAK,CAACqB,GAAarB,CAAK,EAC3EwB,GAAoBxB,IAAU,CAClC,CAACmB,EAAgB,GAAG,EAAG,OAAO,KAAKnB,CAAK,EAAE,IAAIhJ,IAAQ,CACpD,CAACA,CAAG,EAAGgJ,EAAMhJ,CAAG,CAClB,EAAE,CACJ,GAIA,SAASyK,GAAMzB,EAAOF,EAAS,CAC7B,KAAA4B,EAAO,EACT,EAAI,CAAC,EAAG,CACN,IAAM9B,EAAOI,GAAS,CAEpB,GAAIzJ,EAASyJ,CAAK,EAAG,CACnB,IAAMtI,EAAM,CACV,MAAO,KACP,QAASsI,CACX,EACA,OAAI0B,IACFhK,EAAI,SAAWuJ,EAAejB,EAAOF,CAAO,GAEvCpI,CACT,CACA,IAAMF,EAAO,OAAO,KAAKwI,CAAK,EACxB2B,EAAcL,GAAOtB,CAAK,EAChC,GAAI,CAAC2B,GAAenK,EAAK,OAAS,GAAK,CAAC6J,GAAarB,CAAK,EACxD,OAAOJ,EAAK4B,GAAkBxB,CAAK,CAAC,EAEtC,GAAIuB,GAAOvB,CAAK,EAAG,CACjB,IAAMhJ,EAAM2K,EAAc3B,EAAMoB,GAAQ,IAAI,EAAI5J,EAAK,CAAC,EAChD4D,EAAUuG,EAAc3B,EAAMoB,GAAQ,OAAO,EAAIpB,EAAMhJ,CAAG,EAChE,GAAI,CAACT,EAAS6E,CAAO,EACnB,MAAM,IAAI,MAAMrE,GAAqCC,CAAG,CAAC,EAE3D,IAAMU,EAAM,CACV,MAAOS,GAAYnB,CAAG,EACtB,QAAAoE,CACF,EACA,OAAIsG,IACFhK,EAAI,SAAWuJ,EAAe7F,EAAS0E,CAAO,GAEzCpI,CACT,CACA,IAAMkK,EAAO,CACX,SAAU,CAAC,EACX,SAAUpK,EAAK,CAAC,CAClB,EACA,OAAAA,EAAK,QAAQR,GAAO,CAClB,IAAMd,EAAQ8J,EAAMhJ,CAAG,EACnBf,EAAQC,CAAK,GACfA,EAAM,QAAQgE,GAAQ,CACpB0H,EAAK,SAAS,KAAKhC,EAAK1F,CAAI,CAAC,CAC/B,CAAC,CAEL,CAAC,EACM0H,CACT,EACA,OAAKP,GAAarB,CAAK,IACrBA,EAAQwB,GAAkBxB,CAAK,GAE1BJ,EAAKI,CAAK,CACnB,CAEA,SAAS6B,GAAmBhD,EAAS,CACnC,gBAAAiD,EAAkB5I,EAAO,eAC3B,EAAG,CACD,IAAImF,EAAa,EACjB,OAAAQ,EAAQ,QAAQ,CAAC,CACf,IAAA7H,EACA,KAAAoC,EACA,MAAAoD,CACF,IAAM,CACJ,IAAMxE,EAAShB,EAAMA,EAAI,OAAS,KAClCqH,GAAc,KAAK,IAAI7B,IAAU,GAAKxE,EAAS,OAAO,QAAUwE,GAAQxE,GAAU,IAAM8J,EAAkB,EAAI1I,EAAK,CACrH,CAAC,EACMiF,CACT,CACA,SAAS0D,GAAa9B,EAAS,CAC7B,gBAAA6B,EAAkB5I,EAAO,eAC3B,EAAG,CACD+G,EAAQ,QAAQ5J,GAAU,CACxBA,EAAO,MAAQwL,GAAmBxL,EAAO,QAAS,CAChD,gBAAAyL,CACF,CAAC,CACH,CAAC,CACH,CAIA,IAAME,GAAN,KAAc,CACZ,YAAYC,EAAO,CACjB,KAAK,MAAQA,EACb,KAAK,KAAO,CAAC,CACf,CACA,IAAI,MAAO,CACT,OAAO,KAAK,KAAK,MACnB,CACA,aAAazF,EAAO,CAClB,OAAO,KAAK,KAAO,KAAK,OAASA,EAAQ,KAAK,KAAK,CAAC,EAAE,KACxD,CACA,OAAOtC,EAAM,CACP,KAAK,KAAO,KAAK,OACnB,KAAK,KAAK,KAAKA,CAAI,EACnB,KAAK,UAAU,KAAK,KAAO,CAAC,GACnBA,EAAK,MAAQ,KAAK,KAAK,CAAC,EAAE,QACnC,KAAK,KAAK,CAAC,EAAIA,EACf,KAAK,UAAU,CAAC,EAEpB,CACA,cAAcgI,EAAQ,CACpB,OAAO,KAAK,KAAK,KAAKA,CAAM,CAC9B,CACA,UAAUxJ,EAAG,CACX,IAAMyJ,EAAO,KAAK,KAClB,KAAOzJ,EAAI,GAAG,CACZ,IAAM0J,EAAS1J,EAAI,GAAK,EACxB,GAAIyJ,EAAKzJ,CAAC,EAAE,OAASyJ,EAAKC,CAAM,EAAE,MAAO,MACzC,IAAMC,EAAMF,EAAKzJ,CAAC,EAClByJ,EAAKzJ,CAAC,EAAIyJ,EAAKC,CAAM,EACrBD,EAAKC,CAAM,EAAIC,EACf3J,EAAI0J,CACN,CACF,CACA,UAAU1J,EAAG,CACX,IAAMyJ,EAAO,KAAK,KACZxJ,EAAMwJ,EAAK,OACbG,EAAU5J,EACd,EAAG,CACDA,EAAI4J,EACJ,IAAMC,EAAO,EAAI7J,EAAI,EACf8J,EAAQ,EAAI9J,EAAI,EAOtB,GANI6J,EAAO5J,GAAOwJ,EAAKI,CAAI,EAAE,MAAQJ,EAAKG,CAAO,EAAE,QACjDA,EAAUC,GAERC,EAAQ7J,GAAOwJ,EAAKK,CAAK,EAAE,MAAQL,EAAKG,CAAO,EAAE,QACnDA,EAAUE,GAERF,IAAY5J,EAAG,CACjB,IAAM2J,EAAMF,EAAKzJ,CAAC,EAClByJ,EAAKzJ,CAAC,EAAIyJ,EAAKG,CAAO,EACtBH,EAAKG,CAAO,EAAID,CAClB,CACF,OAASC,IAAY5J,EACvB,CACF,EAEA,SAAS+J,GAAiBpM,EAAQsE,EAAM,CACtC,IAAMkE,EAAUxI,EAAO,QACvBsE,EAAK,QAAU,CAAC,EACX/D,EAAUiI,CAAO,GAGtBA,EAAQ,QAAQ5D,GAAS,CACvB,GAAI,CAACrE,EAAUqE,EAAM,OAAO,GAAK,CAACA,EAAM,QAAQ,OAC9C,OAEF,GAAM,CACJ,QAAAhB,EACA,MAAA/D,CACF,EAAI+E,EACEvD,EAAM,CACV,QAAAuC,EACA,MAAA/D,CACF,EACI+E,EAAM,MACRvD,EAAI,IAAMuD,EAAM,IAAI,KAElBA,EAAM,IAAM,KACdvD,EAAI,SAAWuD,EAAM,KAEvBN,EAAK,QAAQ,KAAKjD,CAAG,CACvB,CAAC,CACH,CAEA,SAASgL,GAAerM,EAAQsE,EAAM,CACpCA,EAAK,MAAQtE,EAAO,KACtB,CAEA,SAASsM,GAAO1C,EAASrG,EAAM,CAC7B,eAAA8B,EAAiBxC,EAAO,eACxB,aAAA0J,EAAe1J,EAAO,YACxB,EAAI,CAAC,EAAG,CACN,IAAM2J,EAAe,CAAC,EACtB,OAAInH,GAAgBmH,EAAa,KAAKJ,EAAgB,EAClDG,GAAcC,EAAa,KAAKH,EAAc,EAC3CzC,EAAQ,IAAI5J,GAAU,CAC3B,GAAM,CACJ,IAAAyD,CACF,EAAIzD,EACEsE,EAAO,CACX,KAAMf,EAAKE,CAAG,EACd,SAAUA,CACZ,EACA,OAAI+I,EAAa,QACfA,EAAa,QAAQC,GAAe,CAClCA,EAAYzM,EAAQsE,CAAI,CAC1B,CAAC,EAEIA,CACT,CAAC,CACH,CAEA,IAAMoI,GAAO,WACb,SAASC,GAAe,CACtB,gBAAAjF,EAAkB,GAClB,iBAAAC,EAAmB,EACrB,EAAI,CAAC,EAAG,CACN,MAAO,CACL,SAASzD,EAAM,CACb,OAAKwD,IACHxD,EAAOA,EAAK,YAAY,GAEtByD,IACFzD,EAAOoD,EAAgBpD,CAAI,GAEtBA,EAAK,MAAMwI,EAAI,GAAK,CAAC,CAC9B,CACF,CACF,CAEA,SAASE,GAAmBpJ,EAASqJ,EAAUC,EAAU,CACvD,IAAMC,EAAQ,IAAI,IACZC,EAAK,IAAI,IACXC,EAAa,EACjB,SAASC,EAAShJ,EAAMiJ,EAAQC,EAAQC,EAAQ,CAC9C,IAAM/D,EAASwD,EAAS,SAAS5I,CAAI,EACrC,GAAI,CAACoF,EAAO,OAAQ,OACpB2D,IAGA,IAAMK,EAAY,IAAI,IACtB,QAAWtD,KAASV,EAClBgE,EAAU,IAAItD,GAAQsD,EAAU,IAAItD,CAAK,GAAK,GAAK,CAAC,EAItD,OAAW,CAACuD,EAAMC,CAAE,IAAKF,EAAW,CAClC,IAAMG,EAAU,CACd,OAAAN,EACA,OAAAC,EACA,OAAAC,EACA,GAAAG,CACF,EACIE,EAAWX,EAAM,IAAIQ,CAAI,EACxBG,IACHA,EAAW,CAAC,EACZX,EAAM,IAAIQ,EAAMG,CAAQ,GAE1BA,EAAS,KAAKD,CAAO,EACrBT,EAAG,IAAIO,GAAOP,EAAG,IAAIO,CAAI,GAAK,GAAK,CAAC,CACtC,CACF,CACA,QAAWzJ,KAAUN,EAAS,CAC5B,GAAM,CACJ,EAAG2J,EACH,EAAAQ,EACA,EAAGC,CACL,EAAI9J,EAGJ,GAAI6J,IAAM,OAAW,CACnBT,EAASS,EAAGR,EAAQ,GAAI,EAAE,EAC1B,QACF,CAGA,GAAIS,EACF,QAASR,EAAS,EAAGA,EAASP,EAAUO,IAAU,CAChD,IAAMvN,EAAQ+N,EAAOR,CAAM,EAC3B,GAAKvN,EACL,GAAI,MAAM,QAAQA,CAAK,EACrB,QAAWgO,KAAOhO,EAChBqN,EAASW,EAAI,EAAGV,EAAQC,EAAQS,EAAI,GAAK,EAAE,OAG7CX,EAASrN,EAAM,EAAGsN,EAAQC,EAAQ,EAAE,CAExC,CAEJ,CACA,MAAO,CACL,MAAAL,EACA,WAAAE,EACA,GAAAD,CACF,CACF,CACA,SAASc,GAAmB3L,EAAO2B,EAAQ+I,EAAUC,EAAU,CAC7D,GAAM,CACJ,EAAGK,EACH,EAAAQ,EACA,EAAGC,CACL,EAAI9J,EACJ,SAASoJ,EAAShJ,EAAMkJ,EAAQC,EAAQ,CACtC,IAAM/D,EAASwD,EAAS,SAAS5I,CAAI,EACrC,GAAI,CAACoF,EAAO,OAAQ,OACpBnH,EAAM,aACN,IAAMmL,EAAY,IAAI,IACtB,QAAWtD,KAASV,EAClBgE,EAAU,IAAItD,GAAQsD,EAAU,IAAItD,CAAK,GAAK,GAAK,CAAC,EAEtD,OAAW,CAACuD,EAAMC,CAAE,IAAKF,EAAW,CAClC,IAAMG,EAAU,CACd,OAAAN,EACA,OAAAC,EACA,OAAAC,EACA,GAAAG,CACF,EACIE,EAAWvL,EAAM,MAAM,IAAIoL,CAAI,EAC9BG,IACHA,EAAW,CAAC,EACZvL,EAAM,MAAM,IAAIoL,EAAMG,CAAQ,GAEhCA,EAAS,KAAKD,CAAO,EACrBtL,EAAM,GAAG,IAAIoL,GAAOpL,EAAM,GAAG,IAAIoL,CAAI,GAAK,GAAK,CAAC,CAClD,CACF,CACA,GAAII,IAAM,OAAW,CACnBT,EAASS,EAAG,GAAI,EAAE,EAClB,MACF,CACA,GAAIC,EACF,QAASR,EAAS,EAAGA,EAASP,EAAUO,IAAU,CAChD,IAAMvN,EAAQ+N,EAAOR,CAAM,EAC3B,GAAKvN,EACL,GAAI,MAAM,QAAQA,CAAK,EACrB,QAAWgO,KAAOhO,EAChBqN,EAASW,EAAI,EAAGT,EAAQS,EAAI,GAAK,EAAE,OAGrCX,EAASrN,EAAM,EAAGuN,EAAQ,EAAE,CAEhC,CAEJ,CACA,SAASW,GAAwB5L,EAAOgL,EAAQ,CAC9C,OAAW,CAACI,EAAMG,CAAQ,IAAKvL,EAAM,MAAO,CAC1C,IAAM6L,EAAWN,EAAS,OAAOO,GAAKA,EAAE,SAAWd,CAAM,EACnDe,EAAUR,EAAS,OAASM,EAAS,OACvCE,EAAU,IACZ/L,EAAM,YAAc+L,EACpB/L,EAAM,GAAG,IAAIoL,GAAOpL,EAAM,GAAG,IAAIoL,CAAI,GAAK,GAAKW,CAAO,EAClDF,EAAS,SAAW,GACtB7L,EAAM,MAAM,OAAOoL,CAAI,EACvBpL,EAAM,GAAG,OAAOoL,CAAI,GAEpBpL,EAAM,MAAM,IAAIoL,EAAMS,CAAQ,EAGpC,CACF,CAEA,IAAMG,EAAN,KAAW,CAGT,YAAY5K,EAAMkG,EAAStH,EAAO,CAChC,KAAK,QAAU,CACb,GAAGU,EACH,GAAG4G,CACL,EACI,KAAK,QAAQ,kBACb,KAAK,QAAQ,eACjB,KAAK,UAAY,IAAIvI,GAAS,KAAK,QAAQ,IAAI,EAC/C,KAAK,MAAQqC,EACb,KAAK,SAAW,KAChB,KAAK,eAAiB,KACtB,KAAK,cAAcA,EAAMpB,CAAK,EAC9B,KAAK,WAAa,KAClB,KAAK,cAAgB,IACvB,CACA,aAAawH,EAAO,CAClB,GAAI,KAAK,aAAeA,EACtB,OAAO,KAAK,cAEd,IAAMyE,EAAO,KAAK,eAAiB,CACjC,GAAG,KAAK,QACR,eAAgB,KAAK,cACvB,EAAI,KAAK,QACHrE,EAAWa,EAAejB,EAAOyE,CAAI,EAC3C,YAAK,WAAazE,EAClB,KAAK,cAAgBI,EACdA,CACT,CACA,cAAcxG,EAAMpB,EAAO,CAEzB,GADA,KAAK,MAAQoB,EACTpB,GAAS,EAAEA,aAAiBkB,GAC9B,MAAM,IAAI,MAAM5C,EAAoB,EAMtC,GAJA,KAAK,SAAW0B,GAASgC,GAAY,KAAK,QAAQ,KAAM,KAAK,MAAO,CAClE,MAAO,KAAK,QAAQ,MACpB,gBAAiB,KAAK,QAAQ,eAChC,CAAC,EACG,KAAK,QAAQ,eAAgB,CAC/B,IAAM2I,EAAWH,GAAe,CAC9B,gBAAiB,KAAK,QAAQ,gBAC9B,iBAAkB,KAAK,QAAQ,gBACjC,CAAC,EACD,KAAK,eAAiBC,GAAmB,KAAK,SAAS,QAAS,KAAK,SAAS,KAAK,OAAQE,CAAQ,CACrG,CACF,CACA,IAAIpJ,EAAK,CACP,GAAKnD,EAAUmD,CAAG,IAGlB,KAAK,MAAM,KAAKA,CAAG,EACnB,KAAK,SAAS,IAAIA,CAAG,EACjB,KAAK,gBAAgB,CACvB,IAAMI,EAAS,KAAK,SAAS,QAAQ,KAAK,SAAS,QAAQ,OAAS,CAAC,EAC/DgJ,EAAWH,GAAe,CAC9B,gBAAiB,KAAK,QAAQ,gBAC9B,iBAAkB,KAAK,QAAQ,gBACjC,CAAC,EACDmB,GAAmB,KAAK,eAAgBhK,EAAQ,KAAK,SAAS,KAAK,OAAQgJ,CAAQ,CACrF,CACF,CACA,OAAOuB,EAAY,IAAM,GAAO,CAC9B,IAAMzE,EAAU,CAAC,EACX0E,EAAkB,CAAC,EACzB,QAASjM,EAAI,EAAGC,EAAM,KAAK,MAAM,OAAQD,EAAIC,EAAKD,GAAK,EACjDgM,EAAU,KAAK,MAAMhM,CAAC,EAAGA,CAAC,IAC5BuH,EAAQ,KAAK,KAAK,MAAMvH,CAAC,CAAC,EAC1BiM,EAAgB,KAAKjM,CAAC,GAG1B,GAAIiM,EAAgB,OAAQ,CAC1B,GAAI,KAAK,eACP,QAAW7K,KAAO6K,EAChBP,GAAwB,KAAK,eAAgBtK,CAAG,EAKpD,QAASpB,EAAIiM,EAAgB,OAAS,EAAGjM,GAAK,EAAGA,GAAK,EACpD,KAAK,MAAM,OAAOiM,EAAgBjM,CAAC,EAAG,CAAC,EAEzC,KAAK,SAAS,UAAUiM,CAAe,CACzC,CACA,OAAO1E,CACT,CACA,SAASnG,EAAK,CACR,KAAK,gBACPsK,GAAwB,KAAK,eAAgBtK,CAAG,EAElD,IAAMC,EAAM,KAAK,MAAM,OAAOD,EAAK,CAAC,EAAE,CAAC,EACvC,YAAK,SAAS,SAASA,CAAG,EACnBC,CACT,CACA,UAAW,CACT,OAAO,KAAK,QACd,CACA,OAAOiG,EAAOF,EAAS,CACrB,GAAM,CACJ,MAAAmC,EAAQ,EACV,EAAInC,GAAW,CAAC,EACV,CACJ,eAAApE,EACA,aAAAkH,EACA,WAAAgC,EACA,OAAA1C,EACA,gBAAAJ,CACF,EAAI,KAAK,QAGT,GAAIvL,EAASyJ,CAAK,GAAK,CAACA,EAAM,KAAK,EAAG,CACpC,IAAIpG,EAAO,KAAK,MAAM,IAAI,CAACM,EAAMJ,KAAS,CACxC,KAAAI,EACA,SAAUJ,CACZ,EAAE,EACF,OAAItD,EAASyL,CAAK,GAAKA,EAAQ,KAC7BrI,EAAOA,EAAK,MAAM,EAAGqI,CAAK,GAErBrI,CACT,CACA,IAAMiL,EAAUrO,EAASyL,CAAK,GAAKA,EAAQ,GAAK1L,EAASyJ,CAAK,EAC1DC,EACJ,GAAI4E,EAAS,CACX,IAAM1C,EAAO,IAAIH,GAAQC,CAAK,EAC1B1L,EAAS,KAAK,MAAM,CAAC,CAAC,EACxB,KAAK,kBAAkByJ,EAAO,CAC5B,KAAAmC,EACA,gBAAAL,CACF,CAAC,EAED,KAAK,kBAAkB9B,EAAO,CAC5B,KAAAmC,EACA,gBAAAL,CACF,CAAC,EAEH7B,EAAUkC,EAAK,cAAcD,CAAM,CACrC,MACEjC,EAAU1J,EAASyJ,CAAK,EAAIzJ,EAAS,KAAK,MAAM,CAAC,CAAC,EAAI,KAAK,kBAAkByJ,CAAK,EAAI,KAAK,kBAAkBA,CAAK,EAAI,KAAK,eAAeA,CAAK,EAC/I+B,GAAa9B,EAAS,CACpB,gBAAA6B,CACF,CAAC,EACG8C,GACF3E,EAAQ,KAAKiC,CAAM,EAEjB1L,EAASyL,CAAK,GAAKA,EAAQ,KAC7BhC,EAAUA,EAAQ,MAAM,EAAGgC,CAAK,GAGpC,OAAOU,GAAO1C,EAAS,KAAK,MAAO,CACjC,eAAAvE,EACA,aAAAkH,CACF,CAAC,CACH,CACA,kBAAkB5C,EAAO,CACvB,KAAAmC,EACA,gBAAAL,CACF,EAAI,CAAC,EAAG,CACN,IAAM1B,EAAW,KAAK,aAAaJ,CAAK,EAClC,CACJ,QAAAnG,CACF,EAAI,KAAK,SACHoG,EAAUkC,EAAO,KAAO,CAAC,EAG/B,OAAAtI,EAAQ,QAAQ,CAAC,CACf,EAAGU,EACH,EAAGT,EACH,EAAGV,CACL,IAAM,CACJ,GAAI,CAACxC,EAAU2D,CAAI,EACjB,OAEF,GAAM,CACJ,QAAAiE,EACA,MAAAhC,EACA,QAAAvC,CACF,EAAImG,EAAS,SAAS7F,CAAI,EAC1B,GAAIiE,EAAS,CACX,IAAMnI,EAAS,CACb,KAAMkE,EACN,IAAAT,EACA,QAAS,CAAC,CACR,MAAA0C,EACA,MAAOjC,EACP,KAAMnB,EACN,QAAAa,CACF,CAAC,CACH,EACIkI,GACF9L,EAAO,MAAQwL,GAAmBxL,EAAO,QAAS,CAChD,gBAAAyL,CACF,CAAC,EACGK,EAAK,aAAa9L,EAAO,KAAK,GAChC8L,EAAK,OAAO9L,CAAM,GAGpB4J,EAAQ,KAAK5J,CAAM,CAEvB,CACF,CAAC,EACM4J,CACT,CACA,eAAeD,EAAO,CACpB,IAAM8E,EAAarD,GAAMzB,EAAO,KAAK,OAAO,EACtC+E,EAAW,CAACnD,EAAM1H,EAAMJ,IAAQ,CACpC,GAAI,EAAE,aAAc8H,GAAO,CACzB,GAAM,CACJ,MAAAhK,EACA,SAAAwI,CACF,EAAIwB,EACA/C,EAkBJ,OAjBIjH,IAAU,MAEZiH,EAAU,CAAC,EACX,KAAK,SAAS,KAAK,QAAQ,CAAC7H,EAAKoD,IAAa,CAC5CyE,EAAQ,KAAK,GAAG,KAAK,aAAa,CAChC,IAAA7H,EACA,MAAOkD,EAAKE,CAAQ,EACpB,SAAUgG,CACZ,CAAC,CAAC,CACJ,CAAC,GAEDvB,EAAU,KAAK,aAAa,CAC1B,IAAK,KAAK,UAAU,IAAIjH,CAAK,EAC7B,MAAO,KAAK,SAAS,uBAAuBsC,EAAMtC,CAAK,EACvD,SAAUwI,CACZ,CAAC,EAECvB,GAAWA,EAAQ,OACd,CAAC,CACN,IAAA/E,EACA,KAAAI,EACA,QAAA2E,CACF,CAAC,EAEI,CAAC,CACV,CACA,GAAM,CACJ,SAAAmG,EACA,SAAAC,CACF,EAAIrD,EACEsD,EAAM,CAAC,EACb,QAASxM,EAAI,EAAGC,EAAMqM,EAAS,OAAQtM,EAAIC,EAAKD,GAAK,EAAG,CACtD,IAAMyM,EAAQH,EAAStM,CAAC,EAClBrC,EAAS0O,EAASI,EAAOjL,EAAMJ,CAAG,EACxC,GAAIzD,EAAO,OACT6O,EAAI,KAAK,GAAG7O,CAAM,UACT4O,IAAa9D,EAAgB,IACtC,MAAO,CAAC,CAEZ,CACA,OAAO+D,CACT,EACMrL,EAAU,KAAK,SAAS,QACxBuL,EAAY,IAAI,IAChBnF,EAAU,CAAC,EACjB,OAAApG,EAAQ,QAAQ,CAAC,CACf,EAAGK,EACH,EAAGJ,CACL,IAAM,CACJ,GAAIlD,EAAUsD,CAAI,EAAG,CACnB,IAAMmL,EAAaN,EAASD,EAAY5K,EAAMJ,CAAG,EAC7CuL,EAAW,SAERD,EAAU,IAAItL,CAAG,IACpBsL,EAAU,IAAItL,EAAK,CACjB,IAAAA,EACA,KAAAI,EACA,QAAS,CAAC,CACZ,CAAC,EACD+F,EAAQ,KAAKmF,EAAU,IAAItL,CAAG,CAAC,GAEjCuL,EAAW,QAAQ,CAAC,CAClB,QAAAxG,CACF,IAAM,CACJuG,EAAU,IAAItL,CAAG,EAAE,QAAQ,KAAK,GAAG+E,CAAO,CAC5C,CAAC,EAEL,CACF,CAAC,EACMoB,CACT,CAUA,kBAAkBD,EAAO,CACvB,KAAAmC,EACA,gBAAAL,CACF,EAAI,CAAC,EAAG,CACN,IAAM1B,EAAW,KAAK,aAAaJ,CAAK,EAClC,CACJ,KAAAxI,EACA,QAAAqC,CACF,EAAI,KAAK,SACHoG,EAAUkC,EAAO,KAAO,CAAC,EAG/B,OAAAtI,EAAQ,QAAQ,CAAC,CACf,EAAGK,EACH,EAAGJ,CACL,IAAM,CACJ,GAAI,CAAClD,EAAUsD,CAAI,EACjB,OAEF,IAAM2E,EAAU,CAAC,EACbyG,EAAe,GACf5E,EAAa,GAoBjB,GAjBAlJ,EAAK,QAAQ,CAACR,EAAKoD,IAAa,CAC9B,IAAMmL,EAAa,KAAK,aAAa,CACnC,IAAAvO,EACA,MAAOkD,EAAKE,CAAQ,EACpB,SAAAgG,CACF,CAAC,EACGmF,EAAW,QACb1G,EAAQ,KAAK,GAAG0G,CAAU,EACtBA,EAAW,CAAC,EAAE,aAChB7E,EAAa,KAGf4E,EAAe,EAEnB,CAAC,EAGG,EAAA5E,GAAc4E,IAGdzG,EAAQ,OAAQ,CAClB,IAAMxI,EAAS,CACb,IAAAyD,EACA,KAAAI,EACA,QAAA2E,CACF,EACIsD,GACF9L,EAAO,MAAQwL,GAAmBxL,EAAO,QAAS,CAChD,gBAAAyL,CACF,CAAC,EACGK,EAAK,aAAa9L,EAAO,KAAK,GAChC8L,EAAK,OAAO9L,CAAM,GAGpB4J,EAAQ,KAAK5J,CAAM,CAEvB,CACF,CAAC,EACM4J,CACT,CACA,aAAa,CACX,IAAAjJ,EACA,MAAAd,EACA,SAAAkK,CACF,EAAG,CACD,GAAI,CAACxJ,EAAUV,CAAK,EAClB,MAAO,CAAC,EAEV,IAAM2I,EAAU,CAAC,EACjB,GAAI5I,EAAQC,CAAK,EACfA,EAAM,QAAQ,CAAC,CACb,EAAGqE,EACH,EAAGT,EACH,EAAGV,CACL,IAAM,CACJ,GAAI,CAACxC,EAAU2D,CAAI,EACjB,OAEF,GAAM,CACJ,QAAAiE,EACA,MAAAhC,EACA,QAAAvC,EACA,WAAAyG,CACF,EAAIN,EAAS,SAAS7F,CAAI,EACtBiE,GACFK,EAAQ,KAAK,CACX,MAAArC,EACA,IAAAxF,EACA,MAAOuD,EACP,IAAAT,EACA,KAAAV,EACA,QAAAa,EACA,WAAAyG,CACF,CAAC,CAEL,CAAC,MACI,CACL,GAAM,CACJ,EAAGnG,EACH,EAAGnB,CACL,EAAIlD,EACE,CACJ,QAAAsI,EACA,MAAAhC,EACA,QAAAvC,EACA,WAAAyG,CACF,EAAIN,EAAS,SAAS7F,CAAI,EACtBiE,GACFK,EAAQ,KAAK,CACX,MAAArC,EACA,IAAAxF,EACA,MAAOuD,EACP,KAAAnB,EACA,QAAAa,EACA,WAAAyG,CACF,CAAC,CAEL,CACA,OAAO7B,CACT,CACF,EAEM2G,GAAN,KAAkB,CAChB,OAAO,UAAUhF,EAAGV,EAAS,CAC3B,OAAOA,EAAQ,cACjB,CACA,YAAY1E,EAAS0E,EAAS,CAC5B,KAAK,QAAUA,EACf,KAAK,SAAWkD,GAAe,CAC7B,gBAAiBlD,EAAQ,gBACzB,iBAAkBA,EAAQ,gBAC5B,CAAC,EACD,IAAM2F,EAAa,KAAK,SAAS,SAASrK,CAAO,EAC3CsK,EAAgB5F,EAAQ,eACxB,CACJ,GAAAuD,EACA,WAAAC,CACF,EAAIoC,EACJ,KAAK,cAAgB,CAAC,EACtB,KAAK,WAAa,CAAC,EACnB,QAAW9B,KAAQ6B,EAAY,CAC7B,KAAK,cAAc,KAAK,IAAI3H,EAAY8F,EAAM,CAC5C,SAAU9D,EAAQ,SAClB,UAAWA,EAAQ,UACnB,SAAUA,EAAQ,SAClB,eAAgBA,EAAQ,eACxB,eAAgBA,EAAQ,eACxB,mBAAoBA,EAAQ,mBAC5B,gBAAiBA,EAAQ,gBACzB,iBAAkBA,EAAQ,iBAC1B,eAAgB,EAClB,CAAC,CAAC,EACF,IAAM6F,EAAUtC,EAAG,IAAIO,CAAI,GAAK,EAC1BgC,EAAM,KAAK,IAAI,GAAKtC,EAAaqC,EAAU,KAAQA,EAAU,GAAI,EACvE,KAAK,WAAW,KAAKC,CAAG,CAC1B,CACF,CACA,SAASrL,EAAM,CACb,GAAI,CAAC,KAAK,cAAc,OACtB,MAAO,CACL,QAAS,GACT,MAAO,CACT,EAEF,IAAM6D,EAAa,CAAC,EAChByH,EAAgB,EAChBC,EAAmB,EACnBC,EAAe,EACnB,QAASrN,EAAI,EAAGA,EAAI,KAAK,cAAc,OAAQA,IAAK,CAClD,IAAMrC,EAAS,KAAK,cAAcqC,CAAC,EAAE,SAAS6B,CAAI,EAC5CqL,EAAM,KAAK,WAAWlN,CAAC,EAC7BoN,GAAoBF,EAChBvP,EAAO,UACT0P,IACAF,GAAiBD,GAAO,EAAIvP,EAAO,OAC/BA,EAAO,SACT+H,EAAW,KAAK,GAAG/H,EAAO,OAAO,EAGvC,CACA,GAAI0P,IAAiB,EACnB,MAAO,CACL,QAAS,GACT,MAAO,CACT,EAEF,IAAMC,EAAaF,EAAmB,EAAI,EAAID,EAAgBC,EAAmB,EAC3EG,EAAe,CACnB,QAAS,GACT,MAAO,KAAK,IAAI,KAAOD,CAAU,CACnC,EACA,OAAI,KAAK,QAAQ,gBAAkB5H,EAAW,SAC5C6H,EAAa,QAAU5I,GAAae,CAAU,GAEzC6H,CACT,CACF,EAEAzB,EAAK,QAAU,QACfA,EAAK,YAAchK,GACnBgK,EAAK,WAAa9J,GAClB8J,EAAK,OAAStL,EACdsL,EAAK,MAAQ,SAAUpJ,EAASb,EAAMuF,EAAS,CAK7C,OAJiBmB,EAAe7F,EAAS,CACvC,GAAGlC,EACH,GAAG4G,CACL,CAAC,EACe,SAASvF,CAAI,CAC/B,EAEEiK,EAAK,WAAa/C,GAGlBV,GAASR,EAAc,EAGvBQ,GAASyE,EAAW,EAEtBhB,EAAK,IAAM,YAAa0B,EAAS,CAC/BA,EAAQ,QAAQC,GAAUpF,GAASoF,CAAM,CAAC,CAC5C,ED1yDI,IAAAC,EAAA,6BArQG,SAASC,EAAkBC,EAA0C,CAC1E,OAAKA,EAAO,KAEV,EACE,MAAM,QAAQA,EAAO,IAAO,GAAMA,EAAO,KAAsB,OAAS,IAE1E,CAACA,EAAO,UACR,EACEA,EAAO,YACP,OAAO,KAAKA,EAAO,UAAuB,EAAE,OAAS,IAEvD,EACEA,EAAO,oBACP,OAAO,KAAKA,EAAO,kBAA+B,EAAE,OAAS,IAE/D,CAACA,EAAO,QACR,CAACA,EAAO,eACR,CAACA,EAAO,IAhBkB,EAkB9B,CAEO,SAASC,GAAcD,EAA0C,CACtE,MACE,CAACA,EAAO,MACR,CAACA,EAAO,MACR,CAACA,EAAO,UACR,CAACA,EAAO,YACR,CAACA,EAAO,oBACR,CAACA,EAAO,QACR,CAACA,EAAO,eACR,CAACA,EAAO,GAEZ,CAEO,SAASE,GAAcF,EAA0C,CACtE,OAAOA,EAAO,WAAgB,MAChC,CAEO,SAASG,GAAqBH,EAAyC,CAC5E,OAAID,EAAkBC,CAAM,EAAUA,EAAO,KACzCA,EAAO,KACF,SAAUA,EAAO,KAAsB,MAAM,WAClDA,EAAO,SAAoB,QAC3BA,EAAO,YAAiBA,EAAO,mBAQ1B,YANJA,EAAO,WACJ,OAAO,KAAKA,EAAO,UAAuB,EAAE,OAC5C,IACHA,EAAO,mBACJ,OAAO,KAAKA,EAAO,kBAA+B,EAAE,OACpD,EACqB,eAEzBA,EAAO,OAAkB,MACzBA,EAAO,cAAyB,sBAChCA,EAAO,IAAe,QAAQA,EAAO,GAAM,GAC3CC,GAAcD,CAAM,EAAU,eAC3B,gBACT,CAEO,SAASI,GAAeC,EAAkC,CAC/D,OAAIA,EAAO,SAAiBA,EAAO,SAC/BA,EAAO,UACFF,GAAqBE,EAAO,SAAoC,EAElE,SACT,CAMO,IAAMC,GAAN,KAAmB,CAChB,KACA,KAER,YAAYC,EAAyB,CACnC,KAAK,KAAO,IAAIC,EAAKD,EAAM,CACzB,aAAc,GACd,UAAW,GACX,eAAgB,GAChB,kBAAmB,GACnB,KAAM,CACJ,CAAE,KAAM,OAAQ,OAAQ,CAAE,EAC1B,CAAE,KAAM,YAAa,OAAQ,CAAE,EAC/B,CAAE,KAAM,kBAAmB,OAAQ,CAAE,EACrC,CAAE,KAAM,cAAe,OAAQ,CAAE,EACjC,CAAE,KAAM,yBAA0B,OAAQ,CAAE,EAC5C,CAAE,KAAM,cAAe,OAAQ,CAAE,EACjC,CAAE,KAAM,eAAgB,OAAQ,CAAE,EAClC,CAAE,KAAM,qBAAsB,OAAQ,CAAE,CAC1C,CACF,CAAC,EACD,KAAK,KAAOA,CACd,CAEA,OAAOE,EAAkC,CACvC,GAAI,CAACA,GAASA,EAAM,KAAK,EAAE,SAAW,EACpC,OAAO,KAAK,KAAK,OAAO,EAAE,EAAE,IAAKC,GAAWA,EAAO,IAAI,EAGzD,GAAI,CAACD,EAAM,SAAS,GAAG,EACrB,OAAO,KAAK,KAAK,OAAOA,CAAK,EAAE,IAAKC,GAAWA,EAAO,IAAI,EAG5D,IAAMC,EAAQF,EAAM,MAAM,GAAG,EACzBG,EAAmB,GAEvB,OAAID,EAAM,CAAC,IAAM,YAAcA,EAAM,SAAW,EACzCA,EAAM,CAAC,EAGVC,EAAc,CACZ,KAAM,CACJ,CAAE,KAAM,WAAY,EACpB,CACE,IAAK,CACH,CAAE,cAAeD,EAAM,CAAC,CAAE,EAC1B,CAAE,eAAgBA,EAAM,CAAC,CAAE,EAC3B,CAAE,qBAAsBA,EAAM,CAAC,CAAE,CACnC,CACF,CACF,CACF,EAbAC,EAAc,CAAE,KAAM,WAAY,EAe3BD,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,IAAMA,EAAM,CAAC,EACzDC,EAAc,CACZ,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACSA,EAAM,SAAW,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,EAClDC,EAAc,CACZ,KAAM,CACJ,CACE,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACA,CACE,IAAK,CACH,CAAE,YAAaA,EAAM,CAAC,CAAE,EACxB,CAAE,uBAAwBA,EAAM,CAAC,CAAE,CACrC,CACF,CACF,CACF,EACSA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,IAAMA,EAAM,CAAC,GAAKA,EAAM,CAAC,EACrEC,EAAc,CACZ,KAAM,CACJ,CACE,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACA,CACE,IAAK,CACH,CAAE,YAAaA,EAAM,CAAC,CAAE,EACxB,CAAE,uBAAwBA,EAAM,CAAC,CAAE,CACrC,CACF,CACF,CACF,EACSA,EAAM,QAAU,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAKA,EAAM,CAAC,IAC7DC,EAAc,CACZ,KAAM,CACJ,CACE,IAAK,CACH,CAAE,KAAMD,EAAM,CAAC,CAAE,EACjB,CAAE,UAAWA,EAAM,CAAC,CAAE,EACtB,CAAE,gBAAiBA,EAAM,CAAC,CAAE,CAC9B,CACF,EACA,CACE,IAAK,CACH,CAAE,YAAaA,EAAM,CAAC,CAAE,EACxB,CAAE,uBAAwBA,EAAM,CAAC,CAAE,CACrC,CACF,EACA,CACE,IAAK,CACH,CAAE,cAAeA,EAAM,CAAC,CAAE,EAC1B,CAAE,eAAgBA,EAAM,CAAC,CAAE,EAC3B,CAAE,qBAAsBA,EAAM,CAAC,CAAE,CACnC,CACF,CACF,CACF,GAEK,KAAK,KAAK,OAAOC,CAAW,EAAE,IAAKF,GAAWA,EAAO,IAAI,CAClE,CAEA,YAA0C,CACxC,OAAO,KAAK,IACd,CACF,EAEO,SAASG,GACdC,EACuE,CACvE,MAAO,CAACC,EAASC,IACX,CAACA,GAAcA,EAAW,OAAS,EAAUD,EACjCD,EAAO,OAAOE,CAAU,EACzB,KAAK,CAACC,EAAGC,IAAM,CAC5B,IAAMC,EAAO,GAAGF,EAAE,IAAI,IAAIA,EAAE,WAAW,GACjCG,EAAO,GAAGF,EAAE,IAAI,IAAIA,EAAE,WAAW,GACvC,OAAOC,EAAK,cAAcC,CAAI,CAChC,CAAC,CAEL,CAEO,SAASC,GACdd,EACmB,CACnB,IAAMe,EAA0B,CAAC,EACjC,QAAWC,KAAUhB,EAAK,UAAY,CAAC,EACrC,QAAWiB,KAAMD,EAAO,cAAgB,CAAC,EACvC,QAAWE,KAAOD,EAAG,SAAW,CAAC,EAC/BF,EAAK,KAAK,CACR,KAAMC,EAAO,IAAM,GACnB,UAAWA,EAAO,OAASA,EAAO,IAAM,GACxC,gBAAiBA,EAAO,YACxB,WAAYA,EAAO,OACnB,YAAaC,EAAG,MAAQ,GACxB,uBAAwBA,EAAG,YAC3B,gBAAiBA,EAAG,KACpB,OAAQC,CACV,CAAC,EAIP,QAAWA,KAAOlB,EAAK,WAAa,CAAC,EACnCe,EAAK,KAAK,CACR,KAAM,WACN,UAAW,YACX,YAAa,GACb,OAAQG,CACV,CAAC,EAEH,OAAOH,CACT,CAEO,SAASI,EAAmBC,EAA8B,CAC/D,OAAIA,EAAI,OAAS,WACR,YAAYA,EAAI,OAAO,IAAI,GAE7B,GAAGA,EAAI,IAAI,IAAIA,EAAI,WAAW,IAAIA,EAAI,OAAO,IAAI,EAC1D,CAMA,SAASC,IAAe,CACtB,SACE,QAAC,OACC,MAAM,KACN,OAAO,KACP,QAAQ,YACR,MAAM,6BACN,KAAK,eAEL,oBAAC,QAAK,EAAE,qMAAqM,KAC7M,OAAC,QAAK,EAAE,4MAA4M,GACtN,CAEJ,CAMO,SAASC,GAAkBC,EAI/B,CAGD,GAFwBA,EAAM,QAAU,WAGtC,SACE,QAAC,OACC,UAAW,iEAAiEA,EAAM,WAAa,EAAE,GAAG,KAAK,EAEzG,oBAAC,QAAK,UAAU,4DACd,mBAACF,GAAA,EAAa,EAChB,KACA,OAAC,QAAK,UAAU,wEAAwE,qBAExF,GACF,EAIJ,GAAM,CAACG,EAAQC,CAAW,EAAIF,EAAM,MAAM,MAAM,GAAG,EAC7CG,EAAcH,EAAM,WAAW,KAClCH,GAAQ,GAAGA,EAAI,IAAI,IAAIA,EAAI,WAAW,KAAOG,EAAM,KACtD,EAEA,GAAI,CAACG,EAAa,OAAO,KAEzB,IAAMC,EAAOD,EAAY,gBACnBE,EACJD,IAAS,eACL,0CACAA,IAAS,cACP,yCACA,2CAER,SACE,QAAC,OACC,UAAW,6BAA6BJ,EAAM,WAAa,EAAE,GAAG,KAAK,EAEpE,UAAAG,EAAY,aACX,OAAC,QAAK,UAAU,0BAA2B,SAAAA,EAAY,SAAS,KAElE,OAAC,QAAK,UAAU,gCACb,SAAAA,EAAY,WAAaF,EAC5B,KACA,QAAC,QAAK,UAAU,6BAA6B,cAAEA,EAAO,KAAC,KACvD,OAAC,QAAK,UAAU,+BAA+B,KAC/C,OAAC,QAAK,UAAW,kCAAkCI,CAAS,GACzD,SAAAH,EACH,GACF,CAEJ,CAEO,SAASI,GAAaN,EAG1B,CACD,GAAM,CAAE,UAAAO,CAAU,EAAIP,EACtB,SACE,QAAC,OAAI,UAAW,uBAAuBA,EAAM,WAAa,EAAE,GAAG,KAAK,EAClE,qBAAC,OAAI,UAAU,4BACb,oBAAC,QAAK,UAAU,2BACb,SAAAO,EAAU,OAAO,OAASA,EAAU,OAAO,KAC9C,EACCA,EAAU,OAAO,UAChB,QAAC,QAAK,UAAU,2BAA2B,cACvCA,EAAU,OAAO,KAAK,KAC1B,EAEDA,EAAU,OAAO,aAChB,OAAC,QAAK,UAAU,+BAA+B,oBAAQ,GAE3D,EACCA,EAAU,OAAO,YAChB,OAACC,GAAA,CAAa,QAASD,EAAU,OAAO,QAAS,GAErD,CAEJ,CAEO,SAASE,GAAWT,EAMxB,CACD,GAAM,CAAE,OAAAzB,EAAQ,KAAAmC,EAAO,QAAS,SAAAC,EAAU,QAAAC,CAAQ,EAAIZ,EAChDa,EAAQvC,GAAeC,CAAM,EAE/BuC,EAA4C,YAC5CvC,EAAO,SACTuC,EAAU,OAEVvC,EAAO,WACP,CAACN,EAAkBM,EAAO,SAAoC,IAE9DuC,EAAU,WAGZ,IAAMC,EAAcD,IAAY,QAAUA,IAAY,UAGtD,SACE,QAAC,QACC,UAAW,sDAAsDA,CAAO,IAJ1DJ,IAAS,SAAW,mCAAqC,EAIc,IAAIV,EAAM,WAAa,EAAE,GAAG,KAAK,EACtH,QACEY,GAAWG,EACNC,GAAwB,CACvBA,EAAE,gBAAgB,EAClBJ,EAAQ,CACV,EACA,OAGL,UAAAC,EACAF,MACC,OAAC,QACC,UAAU,kCACV,QAAUK,GAAwB,CAChCA,EAAE,gBAAgB,EAClBL,EAAS,CACX,EACD,gBAED,GAEJ,CAEJ,CAEO,SAASH,GAAaR,EAM1B,CACD,GAAM,CAAE,QAAAiB,EAAS,WAAAC,EAAa,EAAG,aAAAC,CAAa,EAAInB,EAElD,GAAIiB,EAAQ,SAAW,EACrB,SACE,OAAC,QACC,UAAW,8BAA8BjB,EAAM,WAAa,EAAE,GAAG,KAAK,EACvE,8BAED,EAIJ,IAAMoB,EAA8B,CAAC,EACjCC,EAAa,EAEjB,QAASC,EAAI,EAAGA,EAAIL,EAAQ,OAAQK,IAAK,CACvC,IAAM/C,EAAS0C,EAAQK,CAAC,EACnB/C,IACD,CAACA,EAAO,UAAY,CAACA,EAAO,YAEhC8C,IACID,EAAM,OAASF,GACjBE,EAAM,QACJ,OAACX,GAAA,CAEC,OAAQlC,EACR,QACE4C,GACA5C,EAAO,WACP,CAACN,EAAkBM,EAAO,SAAoC,EAC1D,IAAM4C,EAAa5C,EAAO,SAAoC,EAC9D,QAPD,OAAO+C,CAAC,EASf,CACF,GAEJ,CAEA,IAAMC,EAAYF,EAAaD,EAAM,OAErC,SACE,QAAC,OACC,UAAW,8BAA8BpB,EAAM,WAAa,EAAE,GAAG,KAAK,EAErE,UAAAoB,EACAG,EAAY,MACX,QAAC,QAAK,UAAU,+BAA+B,cAAEA,GAAU,GAE/D,CAEJ,CAoBO,SAASC,GAAe,CAC7B,iBAAAC,EACA,WAAAvC,EACA,oBAAAwC,EACA,cAAAC,EACA,SAAAC,EACA,SAAAC,EACA,aAAAC,EACA,YAAAC,EAAc,oBACd,UAAAC,EACA,MAAAC,EAAQ,OACR,cAAAC,EACA,kBAAAC,CACF,EAAwB,CACtB,GAAM,CAACC,EAAQC,CAAS,KAAI,YAAS,EAAK,EACpC,CAACC,EAAkBC,CAAmB,KAAI,YAAS,EAAE,EACrDC,KAAe,UAAuB,IAAI,EAC1CC,KAAW,UAAyB,IAAI,EACxCC,KAAU,UAAuB,IAAI,EAErCC,KAAc,eAAY,IAAM,CACpCR,EAAkB,IAAI,EACtBD,EAAc,EAAE,EAChBG,EAAU,EAAI,EACdE,EAAoB,CAAC,EACrB,WAAW,IAAME,EAAS,SAAS,MAAM,EAAG,CAAC,CAC/C,EAAG,CAACN,EAAmBD,CAAa,CAAC,EAE/BU,KAAW,WAAQ,IAAM,CAC7B,IAAMpD,EAAO,CAAC,GAAGkC,CAAmB,EACpC,OAAOC,EAAcnC,EAAMN,CAAU,CACvC,EAAG,CAACwC,EAAqBxC,EAAYyC,CAAa,CAAC,EAE7CkB,KAAS,WAAQ,IAAM,CAC3B,IAAMC,EAAM,IAAI,IAChB,QAAWjD,KAAO+C,EAAU,CAC1B,IAAMG,EACJlD,EAAI,OAAS,WAAa,WAAa,GAAGA,EAAI,IAAI,IAAIA,EAAI,WAAW,GACjEmD,EAAMF,EAAI,IAAIC,CAAG,EACnBC,EAAKA,EAAI,KAAKnD,CAAG,EAChBiD,EAAI,IAAIC,EAAK,CAAClD,CAAG,CAAC,CACzB,CACA,OAAOiD,CACT,EAAG,CAACF,CAAQ,CAAC,EAEPK,KAAY,WAAQ,IAAM,CAC9B,IAAMC,EAA2B,CAAC,EAClC,QAAW1D,KAAQqD,EAAO,OAAO,EAC/BK,EAAM,KAAK,GAAG1D,CAAI,EAEpB,OAAO0D,CACT,EAAG,CAACL,CAAM,CAAC,KAEX,aAAU,IAAM,CACd,SAASM,EAAmBnC,EAAe,CAEvCwB,EAAa,SACb,CAACA,EAAa,QAAQ,SAASxB,EAAE,MAAc,GAE/CqB,EAAU,EAAK,CAEnB,CACA,gBAAS,iBAAiB,YAAac,CAAkB,EAClD,IAAM,SAAS,oBAAoB,YAAaA,CAAkB,CAC3E,EAAG,CAAC,CAAC,EAEL,IAAMC,KAAe,eAClBvD,GAAyB,CACxBsC,EAAkBvC,EAAmBC,CAAG,CAAC,EACzCqC,EAActC,EAAmBC,CAAG,CAAC,EACrCwC,EAAU,EAAK,CACjB,EACA,CAACF,EAAmBD,CAAa,CACnC,EAEMmB,KAAgB,eACnBrC,GAA2B,CAC1B,GAAIS,EAAkB,CACpB,GAAIT,EAAE,MAAQ,aAAeA,EAAE,MAAQ,SAAU,CAC/CA,EAAE,eAAe,EACjB2B,EAAY,EACZ,MACF,CACA,GAAI3B,EAAE,MAAQ,aAAeA,EAAE,MAAQ,WAAaA,EAAE,MAAQ,QAAS,CACrEA,EAAE,eAAe,EACjBmB,EAAkB,IAAI,EACtBD,EAAc,EAAE,EAChBG,EAAU,EAAI,EACdE,EAAoB,CAAC,EACrB,WAAW,IAAME,EAAS,SAAS,MAAM,EAAG,CAAC,EAC7C,MACF,CACA,GAAIzB,EAAE,IAAI,SAAW,GAAK,CAACA,EAAE,SAAW,CAACA,EAAE,QAAS,CAClDA,EAAE,eAAe,EACjBmB,EAAkB,IAAI,EACtBD,EAAclB,EAAE,GAAG,EACnBqB,EAAU,EAAI,EACdE,EAAoB,CAAC,EACrB,WAAW,IAAME,EAAS,SAAS,MAAM,EAAG,CAAC,EAC7C,MACF,CACA,MACF,CACIzB,EAAE,MAAQ,aACZA,EAAE,eAAe,EACZoB,EAIHG,EAAqBe,GACnB,KAAK,IAAIA,EAAO,EAAGL,EAAU,OAAS,CAAC,CACzC,GALAZ,EAAU,EAAI,EACdE,EAAoB,CAAC,IAMdvB,EAAE,MAAQ,WACnBA,EAAE,eAAe,EACjBuB,EAAqBe,GAAS,KAAK,IAAIA,EAAO,EAAG,CAAC,CAAC,GAC1CtC,EAAE,MAAQ,SACnBA,EAAE,eAAe,EACboB,GAAUE,GAAoB,GAAKW,EAAUX,CAAgB,GAC/Dc,EAAaH,EAAUX,CAAgB,CAAE,GAElCtB,EAAE,MAAQ,UACnBqB,EAAU,EAAK,CAGnB,EACA,CACEZ,EACAkB,EACAR,EACAD,EACAE,EACAE,EACAW,EACAG,CACF,CACF,KAEA,aAAU,IAAM,CACVV,EAAQ,SAAWJ,GAAoB,GAC3BI,EAAQ,QAAQ,iBAAiB,sBAAsB,EAC/DJ,CAAgB,GAAG,eAAe,CAAE,MAAO,SAAU,CAAC,CAEhE,EAAG,CAACA,CAAgB,CAAC,EAErB,IAAMiB,EAAyC,CAAC,EAC5CC,EAAc,EAElB,OAAW,CAACC,EAAUC,CAAS,IAAKb,EAAQ,CAC1CU,EAAiB,QACf,OAACxD,GAAA,CAEC,MAAO0D,EACP,WAAYb,GAFP,SAASa,CAAQ,EAGxB,CACF,EACA,QAAW5D,KAAO6D,EAAW,CAC3B,IAAMC,EAAMH,IACNI,GAAgBD,IAAQrB,EAC9BiB,EAAiB,QACf,OAAC,OAEC,qBAAkB,GAClB,UAAW,gCAAgCK,GAAgB,4CAA8C,EAAE,GAC3G,YAAc5C,IAAM,CAClBA,GAAE,eAAe,EACjBoC,EAAavD,CAAG,CAClB,EACA,aAAc,IAAM0C,EAAoBoB,CAAG,EAE3C,mBAACrD,GAAA,CAAa,UAAWT,EAAK,GATzBD,EAAmBC,CAAG,CAU7B,CACF,CACF,CACF,CAEA,IAAMgE,EAAc,CAClB,wBACAhC,GAAY,+BACZG,CACF,EACG,OAAO,OAAO,EACd,KAAK,GAAG,EAEL8B,EAAqBrC,GAAkB,OAAS,WAChDpB,EAAYoB,EACdqC,EACE,+CACArC,EAAiB,kBAAoB,eACnC,8CACAA,EAAiB,kBAAoB,cACnC,6CACA,+CACN,GAEJ,SACE,QAAC,OACC,IAAKe,EACL,UAAWqB,EACX,mBAAkB5B,IAAU,OAAS,OAAYA,EAEhD,UAAAR,GAAoB,CAACG,MACpB,QAAC,OAAI,UAAU,iCAAiC,QAASe,EACtD,UAAAmB,KACC,OAAC,QAAK,UAAU,oFACd,mBAAChE,GAAA,EAAa,EAChB,KAEA,oBACE,oBAAC,QAAK,UAAW,sCAAsCO,CAAS,GAAI,EACnEoB,EAAiB,aAChB,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,SACpB,GAEJ,KAEF,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,WAAaA,EAAiB,KAClD,KACA,OAAC,QAAK,UAAU,qCAAqC,kBAAC,KACtD,OAAC,QAAK,UAAU,wCACb,SAAAA,EAAiB,OAAO,OAASA,EAAiB,OAAO,KAC5D,KACA,OAAC,QACC,UAAU,uCACV,QAAUT,GAAM,CACdA,EAAE,gBAAgB,EAClB2B,EAAY,CACd,EACD,gBAED,GACF,EAEDlB,GAAoBG,MACnB,QAAC,OAAI,UAAU,0EACZ,UAAAkC,KACC,OAAC,QAAK,UAAU,oFACd,mBAAChE,GAAA,EAAa,EAChB,KAEA,oBACE,oBAAC,QAAK,UAAW,sCAAsCO,CAAS,GAAI,EACnEoB,EAAiB,aAChB,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,SACpB,GAEJ,KAEF,OAAC,QAAK,UAAU,sCACb,SAAAA,EAAiB,WAAaA,EAAiB,KAClD,KACA,OAAC,QAAK,UAAU,qCAAqC,kBAAC,KACtD,OAAC,QAAK,UAAU,wCACb,SAAAA,EAAiB,OAAO,OAASA,EAAiB,OAAO,KAC5D,GACF,KAEF,OAAC,SACC,IAAKgB,EACL,KAAK,OACL,UAAW,8BAA8BhB,EAAmB,uCAAyC,EAAE,GACvG,MAAOvC,EACP,YAAa6C,EACb,SAAUH,EACV,SAAWZ,GAAM,CACfkB,EAAclB,EAAE,OAAO,KAAK,EAC5BqB,EAAU,EAAI,EACdE,EAAoB,CAAC,EAChBvB,EAAE,OAAO,OAAOmB,EAAkB,IAAI,CAC7C,EACA,QAAS,IAAM,CACRV,GAAkBY,EAAU,EAAI,CACvC,EACA,UAAWgB,EACb,EACCvB,MACC,OAAC,QAAK,UAAU,8BAA+B,SAAAA,EAAa,EAE7DM,GAAU,CAACR,MACV,OAAC,OAAI,IAAKc,EAAS,UAAU,iCAC1B,SAAAO,EAAU,OAAS,EAClBM,KAEA,OAAC,OAAI,UAAU,mCAAmC,4BAElD,EAEJ,GAEJ,CAEJ",
+  "names": ["react_exports", "__export", "FormatChip", "FormatViewer", "SignalGroupHeader", "SignalOption", "SignalSearch", "SignalSelector", "createSignalFilter", "flattenSignals", "getFormatLabel", "getSchemaDescription", "isArraySchema", "isEmptySchema", "isPrimitiveSchema", "signalReferenceKey", "__toCommonJS", "import_react", "isArray", "value", "getTag", "baseToString", "result", "toString", "isString", "isNumber", "isBoolean", "isObjectLike", "isObject", "isDefined", "isBlank", "INCORRECT_INDEX_TYPE", "LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY", "key", "PATTERN_LENGTH_TOO_LARGE", "max", "MISSING_KEY_PROPERTY", "name", "INVALID_KEY_WEIGHT_VALUE", "hasOwn", "KeyStore", "keys", "totalWeight", "obj", "createKey", "keyId", "path", "id", "src", "weight", "getFn", "createKeyPath", "createKeyId", "get", "list", "arr", "deepGet", "index", "arrayIndex", "i", "len", "MatchOptions", "BasicOptions", "a", "b", "FuzzyOptions", "AdvancedOptions", "Config", "SPACE", "norm", "mantissa", "cache", "m", "numTokens", "n", "FuseIndex", "fieldNormWeight", "docs", "records", "idx", "doc", "docIndex", "indices", "item", "record", "keyIndex", "subRecords", "subRecord", "text", "createIndex", "myIndex", "parseIndex", "data", "convertMaskToIndices", "matchmask", "minMatchCharLength", "start", "end", "match", "MAX_BITS", "search", "pattern", "patternAlphabet", "location", "distance", "threshold", "findAllMatches", "includeMatches", "ignoreLocation", "patternLen", "textLen", "expectedLocation", "currentThreshold", "bestLocation", "calcScore", "errors", "currentLocation", "accuracy", "proximity", "computeMatches", "matchMask", "score", "lastBitArr", "finalScore", "binMax", "mask", "binMin", "binMid", "finish", "bitArr", "j", "charMatch", "createPatternAlphabet", "char", "mergeIndices", "merged", "last", "curr", "NON_DECOMPOSABLE_MAP", "NON_DECOMPOSABLE_RE", "stripDiacritics", "str", "ch", "BitapSearch", "isCaseSensitive", "ignoreDiacritics", "addChunk", "startIndex", "remainder", "allIndices", "totalScore", "hasMatches", "alphabet", "isMatch", "BaseMatch", "getMatch", "_text", "exp", "matches", "ExactMatch", "InverseExactMatch", "PrefixExactMatch", "InversePrefixExactMatch", "SuffixExactMatch", "InverseSuffixExactMatch", "FuzzyMatch", "IncludeMatch", "searchers", "searchersLen", "ESCAPED_PIPE", "OR_TOKEN", "tokenize", "tokens", "next", "parseQuery", "options", "restored", "query", "results", "queryItem", "found", "searcher", "token", "MultiMatchSet", "ExtendedSearch", "_", "numMatches", "hasInverse", "qLen", "pLen", "type", "registeredSearchers", "register", "args", "createSearcher", "searcherClass", "LogicalOperator", "KeyType", "isExpression", "isPath", "isLeaf", "convertToExplicit", "parse", "auto", "isQueryPath", "node", "computeScoreSingle", "ignoreFieldNorm", "computeScore", "MaxHeap", "limit", "sortFn", "heap", "parent", "tmp", "largest", "left", "right", "transformMatches", "transformScore", "format", "includeScore", "transformers", "transformer", "WORD", "createAnalyzer", "buildInvertedIndex", "keyCount", "analyzer", "terms", "df", "fieldCount", "addField", "docIdx", "keyIdx", "subIdx", "termFreqs", "term", "tf", "posting", "postings", "v", "fields", "sub", "addToInvertedIndex", "removeFromInvertedIndex", "filtered", "p", "removed", "Fuse", "opts", "predicate", "indicesToRemove", "shouldSort", "useHeap", "expression", "evaluate", "children", "operator", "res", "child", "resultMap", "expResults", "anyKeyFailed", "keyMatches", "TokenSearch", "queryTerms", "invertedIndex", "docFreq", "idf", "weightedScore", "maxPossibleScore", "matchedCount", "normalized", "searchResult", "plugins", "plugin", "import_jsx_runtime", "isPrimitiveSchema", "schema", "isEmptySchema", "isArraySchema", "getSchemaDescription", "getFormatLabel", "format", "SignalSearch", "data", "Fuse", "query", "result", "parts", "searchQuery", "createSignalFilter", "search", "options", "inputValue", "a", "b", "keyA", "keyB", "flattenSignals", "refs", "vertex", "tx", "sig", "signalReferenceKey", "ref", "ConstantIcon", "SignalGroupHeader", "props", "nodeId", "transmitter", "firstOption", "mode", "modeClass", "SignalOption", "reference", "FormatViewer", "FormatChip", "size", "onDelete", "onClick", "label", "variant", "isClickable", "e", "formats", "maxVisible", "onViewSchema", "chips", "totalChips", "i", "remaining", "SignalSelector", "currentReference", "availableReferences", "filterOptions", "disabled", "hasError", "errorMessage", "placeholder", "className", "theme", "onInputChange", "onReferenceChange", "isOpen", "setIsOpen", "highlightedIndex", "setHighlightedIndex", "containerRef", "inputRef", "listRef", "handleClear", "filtered", "groups", "map", "key", "arr", "flatItems", "items", "handleClickOutside", "handleSelect", "handleKeyDown", "prev", "dropdownElements", "optionIndex", "groupKey", "groupRefs", "idx", "isHighlighted", "rootClasses", "isConstantSelected"]
 }