@nova-design-system/nova-webcomponents 3.24.0 → 3.26.0

package/dist/esm/i18n.utils-IlwlcG9l.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"i18n.utils-IlwlcG9l.js","sources":["src/utils/search-engine/normalize.ts","src/utils/search-engine/guards.ts","src/utils/search-engine/indexer.ts","src/utils/search-engine/strategies/strict.ts","src/utils/search-engine/strategies/smart.ts","../../node_modules/fuse.js/dist/fuse.mjs","src/utils/search-engine/strategies/fuzzy.ts","src/utils/search-engine/engine.ts","src/utils/search-engine/worker/worker-client.ts","src/utils/i18n.utils.ts"],"sourcesContent":["/**\n * @fileoverview Text normalization utilities for the search engine.\n * Provides functions for normalizing and tokenizing text for search operations.\n */\n\n/**\n * Normalizes text for search comparison.\n * - Converts to lowercase\n * - Removes accents/diacritics\n * - Replaces punctuation with spaces\n * - Trims whitespace\n * - Collapses multiple spaces into single space\n *\n * @param {string} text - The text to normalize\n * @returns {string} The normalized text\n *\n * @example\n * normalize('Système Grid') // 'systeme grid'\n * normalize('Hello, World!') // 'hello world'\n * normalize('  Multiple   Spaces  ') // 'multiple spaces'\n */\nexport function normalize(text: string): string {\n  if (!text) return '';\n\n  return (\n    text\n      // Convert to lowercase\n      .toLowerCase()\n      // Remove accents/diacritics using Unicode normalization\n      .normalize('NFD')\n      .replace(/[\\u0300-\\u036f]/g, '')\n      // Replace punctuation and special characters with spaces\n      .replace(/[^\\w\\s]/g, ' ')\n      // Collapse multiple spaces into single space\n      .replace(/\\s+/g, ' ')\n      // Trim leading/trailing whitespace\n      .trim()\n  );\n}\n\n/**\n * Tokenizes text into an array of normalized tokens.\n * Splits by whitespace and normalizes each token.\n *\n * @param {string} text - The text to tokenize\n * @returns {string[]} Array of normalized tokens\n *\n * @example\n * tokenize('System Grid Control') // ['system', 'grid', 'control']\n * tokenize('Hello, World!') // ['hello', 'world']\n */\nexport function tokenize(text: string): string[] {\n  const normalized = normalize(text);\n  if (!normalized) return [];\n\n  return normalized.split(' ').filter(token => token.length > 0);\n}\n","/**\n * @fileoverview Guard functions for validating and clamping search parameters.\n * Ensures safe limits for search operations to protect UI performance.\n */\n\n/** Default maximum results to return */\nexport const DEFAULT_MAX_RESULTS = 25;\n\n/** Minimum allowed max results */\nexport const MIN_MAX_RESULTS = 10;\n\n/** Hard cap for max results - protects DOM from rendering too many items */\nexport const HARD_CAP_MAX_RESULTS = 500;\n\n/** Default threshold for offloading to Web Worker */\nexport const DEFAULT_WORKER_THRESHOLD = 2000;\n\n/** Minimum worker threshold (0 = always use worker) */\nexport const MIN_WORKER_THRESHOLD = 0;\n\n/** Maximum worker threshold */\nexport const MAX_WORKER_THRESHOLD = 50000;\n\n/** Default fuzzy threshold (0-1, lower = stricter) */\nexport const DEFAULT_FUZZY_THRESHOLD = 0.3;\n\n/** Default debounce delay for strict/smart modes (ms) */\nexport const DEFAULT_DEBOUNCE_DELAY = 150;\n\n/** Debounce delay for fuzzy mode (ms) */\nexport const FUZZY_DEBOUNCE_DELAY = 300;\n\n/**\n * Clamps the maxResults value to safe limits.\n * - Minimum: 10\n * - Default: 200\n * - Hard cap: 500\n *\n * @param {number} [value] - The maxResults value to clamp (undefined uses default)\n * @returns {number} The clamped maxResults value\n *\n * @example\n * clampMaxResults(undefined) // 200 (default)\n * clampMaxResults(5) // 10 (minimum)\n * clampMaxResults(1000) // 500 (hard cap)\n * clampMaxResults(100) // 100 (valid)\n */\nexport function clampMaxResults(value?: number): number {\n  if (value === undefined || value === null) {\n    return DEFAULT_MAX_RESULTS;\n  }\n\n  if (value < MIN_MAX_RESULTS) {\n    return MIN_MAX_RESULTS;\n  }\n\n  if (value > HARD_CAP_MAX_RESULTS) {\n    return HARD_CAP_MAX_RESULTS;\n  }\n\n  return Math.floor(value);\n}\n\n/**\n * Clamps the workerThreshold value to safe limits.\n * - Minimum: 0 (always use worker)\n * - Default: 2000\n * - Maximum: 50000\n *\n * @param {number} [value] - The workerThreshold value to clamp (undefined uses default)\n * @returns {number} The clamped workerThreshold value\n *\n * @example\n * clampWorkerThreshold(undefined) // 2000 (default)\n * clampWorkerThreshold(-100) // 0 (minimum)\n * clampWorkerThreshold(100000) // 50000 (maximum)\n * clampWorkerThreshold(5000) // 5000 (valid)\n */\nexport function clampWorkerThreshold(value?: number): number {\n  if (value === undefined || value === null) {\n    return DEFAULT_WORKER_THRESHOLD;\n  }\n\n  if (value < MIN_WORKER_THRESHOLD) {\n    return MIN_WORKER_THRESHOLD;\n  }\n\n  if (value > MAX_WORKER_THRESHOLD) {\n    return MAX_WORKER_THRESHOLD;\n  }\n\n  return Math.floor(value);\n}\n\n/**\n * Clamps the fuzzyThreshold value to valid range.\n * - Minimum: 0 (strictest)\n * - Default: 0.3\n * - Maximum: 1 (most permissive)\n *\n * @param {number} [value] - The fuzzyThreshold value to clamp (undefined uses default)\n * @returns {number} The clamped fuzzyThreshold value\n *\n * @example\n * clampFuzzyThreshold(undefined) // 0.3 (default)\n * clampFuzzyThreshold(-0.5) // 0 (minimum)\n * clampFuzzyThreshold(1.5) // 1 (maximum)\n * clampFuzzyThreshold(0.5) // 0.5 (valid)\n */\nexport function clampFuzzyThreshold(value?: number): number {\n  if (value === undefined || value === null) {\n    return DEFAULT_FUZZY_THRESHOLD;\n  }\n\n  if (value < 0) {\n    return 0;\n  }\n\n  if (value > 1) {\n    return 1;\n  }\n\n  return value;\n}\n","/**\n * @fileoverview Indexing utilities for the search engine.\n * Pre-computes normalized text and tokens for efficient searching.\n */\n\nimport type { IndexedItem, RawItem } from './types';\nimport { normalize, tokenize } from './normalize';\n\n/**\n * Builds a search index from raw items.\n * Pre-computes normalized text and tokens for each item for efficient searching.\n *\n * @param {RawItem[]} items - Array of raw items with id and label\n * @returns {IndexedItem[]} Array of indexed items with pre-computed norm and tokens\n *\n * @example\n * const items = [\n *   { id: '1', label: 'System Grid Control' },\n *   { id: '2', label: 'Network Manager' }\n * ];\n * const indexed = buildIndex(items);\n * // [\n * //   { id: '1', label: 'System Grid Control', norm: 'system grid control', tokens: ['system', 'grid', 'control'] },\n * //   { id: '2', label: 'Network Manager', norm: 'network manager', tokens: ['network', 'manager'] }\n * // ]\n */\nexport function buildIndex(items: RawItem[]): IndexedItem[] {\n  if (!items || !Array.isArray(items)) {\n    return [];\n  }\n\n  return items.map(item => {\n    const norm = normalize(item.label);\n    return {\n      id: item.id,\n      label: item.label,\n      norm,\n      tokens: tokenize(item.label),\n    };\n  });\n}\n\n/**\n * Updates the index when items change.\n * This is an alias for buildIndex for semantic clarity.\n *\n * @param {RawItem[]} items - Array of raw items with id and label\n * @returns {IndexedItem[]} Array of indexed items with pre-computed norm and tokens\n */\nexport function rebuildIndex(items: RawItem[]): IndexedItem[] {\n  return buildIndex(items);\n}\n","/**\n * @fileoverview Strict search strategy using normalized substring matching.\n * Fast and deterministic - best for IDs, codes, and references.\n */\n\nimport type { IndexedItem } from '../types';\nimport { normalize } from '../normalize';\n\n/**\n * Searches items using strict substring matching.\n * The normalized query must be a substring of the normalized label.\n *\n * This is the fastest search mode but requires exact substring matches.\n * Word order matters: \"Grid System\" won't match \"System Grid\".\n *\n * @param {IndexedItem[]} indexedItems - Array of pre-indexed items\n * @param {string} query - The search query\n * @returns {string[]} Array of matching item IDs\n *\n * @example\n * // Given items: [{ id: '1', label: 'System Grid Control', norm: 'system grid control', tokens: [...] }]\n * searchStrict(items, 'System Grid') // ['1'] - matches\n * searchStrict(items, 'Grid Sys') // ['1'] - matches (substring)\n * searchStrict(items, 'Grid System') // [] - no match (wrong order)\n */\nexport function searchStrict(\n  indexedItems: IndexedItem[],\n  query: string,\n): string[] {\n  if (!query || !indexedItems?.length) {\n    return indexedItems?.map(item => item.id) || [];\n  }\n\n  const normalizedQuery = normalize(query);\n\n  if (!normalizedQuery) {\n    return indexedItems.map(item => item.id);\n  }\n\n  return indexedItems\n    .filter(item => item.norm.includes(normalizedQuery))\n    .map(item => item.id);\n}\n","/**\n * @fileoverview Smart search strategy using token-based matching.\n * All query tokens must exist in the target label (order ignored).\n */\n\nimport type { IndexedItem } from '../types';\nimport { tokenize } from '../normalize';\n\n/**\n * Searches items using token-based matching.\n * All query tokens must exist in the item's normalized text (order ignored).\n *\n * This provides a \"smart\" feel without fuzzy matching overhead.\n * Word order doesn't matter: \"Grid System\" will match \"System Grid\".\n *\n * @param {IndexedItem[]} indexedItems - Array of pre-indexed items\n * @param {string} query - The search query\n * @returns {string[]} Array of matching item IDs\n *\n * @example\n * // Given items: [{ id: '1', label: 'System Grid Control', norm: 'system grid control', tokens: [...] }]\n * searchSmart(items, 'System Grid') // ['1'] - matches (all tokens present)\n * searchSmart(items, 'Grid System') // ['1'] - matches (order ignored)\n * searchSmart(items, 'Grid Sys') // ['1'] - matches (partial tokens allowed as substrings)\n * searchSmart(items, 'System Unknown') // [] - no match ('unknown' not present)\n */\nexport function searchSmart(\n  indexedItems: IndexedItem[],\n  query: string,\n): string[] {\n  if (!query || !indexedItems?.length) {\n    return indexedItems?.map(item => item.id) || [];\n  }\n\n  const queryTokens = tokenize(query);\n\n  if (!queryTokens.length) {\n    return indexedItems.map(item => item.id);\n  }\n\n  return indexedItems\n    .filter(item => {\n      // All query tokens must be found as substrings in the normalized text\n      return queryTokens.every(queryToken => item.norm.includes(queryToken));\n    })\n    .map(item => item.id);\n}\n","/**\n * Fuse.js v7.0.0 - Lightweight fuzzy-search (http://fusejs.io)\n *\n * Copyright (c) 2023 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) => {\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(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(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);\n        }\n      } else if (path.length) {\n        // An object. Recurse further.\n        deepGet(value, path, index + 1);\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 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  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        const stack = [{ nestedArrIndex: -1, value }];\n\n        while (stack.length) {\n          const { nestedArrIndex, value } = stack.pop();\n\n          if (!isDefined(value)) {\n            continue\n          }\n\n          if (isString(value) && !isBlank(value)) {\n            let subRecord = {\n              v: value,\n              i: nestedArrIndex,\n              n: this.norm.get(value)\n            };\n\n            subRecords.push(subRecord);\n          } else if (isArray(value)) {\n            value.forEach((item, k) => {\n              stack.push({\n                nestedArrIndex: k,\n                value: item\n              });\n            });\n          } else ;\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 computeScore$1(\n  pattern,\n  {\n    errors = 0,\n    currentLocation = 0,\n    expectedLocation = 0,\n    distance = Config.distance,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  const accuracy = errors / pattern.length;\n\n  if (ignoreLocation) {\n    return accuracy\n  }\n\n  const proximity = Math.abs(expectedLocation - currentLocation);\n\n  if (!distance) {\n    // Dodge divide by zero error.\n    return proximity ? 1.0 : accuracy\n  }\n\n  return accuracy + proximity / distance\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  // 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 = computeScore$1(pattern, {\n      currentLocation: index,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\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 = computeScore$1(pattern, {\n        errors: i,\n        currentLocation: expectedLocation + binMid,\n        expectedLocation,\n        distance,\n        ignoreLocation\n      });\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.charAt(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 = computeScore$1(pattern, {\n          errors: i,\n          currentLocation,\n          expectedLocation,\n          distance,\n          ignoreLocation\n        });\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 = computeScore$1(pattern, {\n      errors: i + 1,\n      currentLocation: expectedLocation,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\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\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      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    this.options = {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreLocation\n    };\n\n    this.pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\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, includeMatches } = this.options;\n\n    if (!isCaseSensitive) {\n      text = text.toLowerCase();\n    }\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 = [...allIndices, ...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 = 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      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      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// ❗Order 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      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      includeMatches,\n      minMatchCharLength,\n      findAllMatches,\n      ignoreLocation,\n      location,\n      threshold,\n      distance\n    };\n\n    this.pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\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 } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\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 = [...allIndices, ...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\n// Practical scoring function\nfunction computeScore(\n  results,\n  { ignoreFieldNorm = Config.ignoreFieldNorm }\n) {\n  results.forEach((result) => {\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\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\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\n    for (let i = 0, len = this._docs.length; i < len; i += 1) {\n      const doc = this._docs[i];\n      if (predicate(doc, i)) {\n        this.removeAt(i);\n        i -= 1;\n        len -= 1;\n\n        results.push(doc);\n      }\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    let 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    return format(results, this._docs, {\n      includeMatches,\n      includeScore\n    })\n  }\n\n  _searchStringList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { records } = this._myIndex;\n    const results = [];\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        results.push({\n          item: text,\n          idx,\n          matches: [{ score, value: text, norm, indices }]\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 = {};\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[idx]) {\n            resultMap[idx] = { idx, item, matches: [] };\n            results.push(resultMap[idx]);\n          }\n          expResults.forEach(({ matches }) => {\n            resultMap[idx].matches.push(...matches);\n          });\n        }\n      }\n    });\n\n    return results\n  }\n\n  _searchObjectList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { keys, records } = this._myIndex;\n    const results = [];\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        results.push({\n          idx,\n          item,\n          matches\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.0.0';\nFuse.createIndex = createIndex;\nFuse.parseIndex = parseIndex;\nFuse.config = Config;\n\n{\n  Fuse.parseQuery = parse;\n}\n\n{\n  register(ExtendedSearch);\n}\n\nexport { Fuse as default };\n","/**\n * @fileoverview Fuzzy search strategy using Fuse.js.\n * Typo-tolerant matching for user-friendly search experience.\n */\n\nimport Fuse from 'fuse.js';\nimport type { IndexedItem } from '../types';\n\n/** Cache for Fuse instances to avoid recreation on every search */\nlet fuseCache: {\n  /** Array of pre-indexed items */\n  items: IndexedItem[];\n  /** Fuzzy threshold */\n  threshold: number;\n  /** Fuse.js instance */\n  fuse: Fuse<IndexedItem>;\n} | null = null;\n\n/**\n * Gets or creates a Fuse.js instance for the given items.\n * Caches the instance to improve performance for repeated searches.\n * Recreates if items or threshold change.\n * @param {IndexedItem[]} items - Array of pre-indexed items\n * @param {number} threshold - Fuzzy threshold (0-1, lower = stricter, default 0.3)\n * @returns {Fuse<IndexedItem>} Fuse.js instance\n */\nfunction getFuseInstance(\n  items: IndexedItem[],\n  threshold: number,\n): Fuse<IndexedItem> {\n  // Check if we can reuse cached instance (same items AND same threshold)\n  if (\n    fuseCache &&\n    fuseCache.items === items &&\n    fuseCache.threshold === threshold\n  ) {\n    return fuseCache.fuse;\n  }\n\n  // Create new Fuse instance\n  const fuse = new Fuse(items, {\n    keys: ['label', 'norm'],\n    threshold: threshold,\n    includeScore: true,\n    ignoreLocation: true,\n    findAllMatches: true,\n  });\n\n  // Cache for reuse\n  fuseCache = { items, threshold, fuse };\n\n  return fuse;\n}\n\n/**\n * Searches items using fuzzy matching with Fuse.js.\n * Tolerates typos and finds approximate matches.\n *\n * @param {IndexedItem[]} indexedItems - Array of pre-indexed items\n * @param {string} query - The search query\n * @param {number} threshold - Fuzzy threshold (0-1, lower = stricter, default 0.3)\n * @returns {string[]} Array of matching item IDs sorted by relevance\n * @example\n * // Given items: [{ id: '1', label: 'System Grid Control', ... }]\n * searchFuzzy(items, 'Sytem') // ['1'] - matches despite typo\n * searchFuzzy(items, 'Systm Grid') // ['1'] - matches despite typo\n */\nexport function searchFuzzy(\n  indexedItems: IndexedItem[],\n  query: string,\n  threshold: number = 0.3,\n): string[] {\n  if (!query || !indexedItems?.length) {\n    return indexedItems?.map(item => item.id) || [];\n  }\n\n  const fuse = getFuseInstance(indexedItems, threshold);\n  const results = fuse.search(query);\n\n  // Return IDs sorted by relevance (best matches first)\n  return results.map(result => result.item.id);\n}\n\n/**\n * Clears the Fuse.js cache.\n * Call this when the items change to ensure fresh indexing.\n */\nexport function clearFuzzyCache(): void {\n  fuseCache = null;\n}\n","/**\n * @fileoverview Main search engine that orchestrates search operations.\n * Provides a unified interface for all filter modes.\n */\n\nimport type {\n  IndexedItem,\n  SearchResult,\n  SearchOptions,\n  FilterMode,\n} from './types';\nimport { clampMaxResults, clampFuzzyThreshold } from './guards';\nimport { searchStrict } from './strategies/strict';\nimport { searchSmart } from './strategies/smart';\nimport { searchFuzzy } from './strategies/fuzzy';\n\n/**\n * Default search options.\n */\nconst DEFAULT_OPTIONS: Partial<SearchOptions> = {\n  filterMode: 'strict',\n  maxResults: 200,\n  startFilterAt: 0,\n};\n\n/**\n * Main search function that applies the appropriate strategy based on filter mode.\n *\n * @param {IndexedItem[]} indexedItems - Array of pre-indexed items\n * @param {SearchOptions} options - Search options including query, filterMode, maxResults\n * @returns {SearchResult} Search result with matching IDs, total count, and truncation flag\n *\n * @example\n * const result = search(indexedItems, {\n *   query: 'System Grid',\n *   filterMode: 'smart',\n *   maxResults: 100\n * });\n * // { ids: ['1', '2', '3'], total: 3, truncated: false }\n */\nexport function search(\n  indexedItems: IndexedItem[],\n  options: SearchOptions,\n): SearchResult {\n  const {\n    query,\n    filterMode = DEFAULT_OPTIONS.filterMode as FilterMode,\n    maxResults: rawMaxResults,\n    startFilterAt = DEFAULT_OPTIONS.startFilterAt as number,\n    fuzzyThreshold: rawFuzzyThreshold,\n  } = options;\n\n  // Apply guards\n  const maxResults = clampMaxResults(rawMaxResults);\n  const fuzzyThreshold = clampFuzzyThreshold(rawFuzzyThreshold);\n\n  // If query is too short, return all items (up to maxResults)\n  if (!query || query.length < startFilterAt) {\n    const allIds = indexedItems.map(item => item.id);\n    const truncated = allIds.length > maxResults;\n    return {\n      ids: allIds.slice(0, maxResults),\n      total: allIds.length,\n      truncated,\n    };\n  }\n\n  // Apply the appropriate search strategy\n  let matchingIds: string[];\n\n  switch (filterMode) {\n    case 'strict':\n      matchingIds = searchStrict(indexedItems, query);\n      break;\n    case 'smart':\n      matchingIds = searchSmart(indexedItems, query);\n      break;\n    case 'fuzzy':\n      // Fuzzy search using Fuse.js on main thread\n      matchingIds = searchFuzzy(indexedItems, query, fuzzyThreshold);\n      break;\n    default:\n      matchingIds = searchStrict(indexedItems, query);\n  }\n\n  // Apply maxResults limit\n  const total = matchingIds.length;\n  const truncated = total > maxResults;\n  const limitedIds = truncated ? matchingIds.slice(0, maxResults) : matchingIds;\n\n  return {\n    ids: limitedIds,\n    total,\n    truncated,\n  };\n}\n\n/**\n * Determines if filtering should be offloaded to a Web Worker.\n *\n * @param {number} itemCount - Number of items to search\n * @param {FilterMode} filterMode - Current filter mode\n * @param {number} workerThreshold - Threshold for offloading to worker\n * @returns {boolean} True if filtering should use Web Worker\n */\nexport function shouldUseWorker(\n  itemCount: number,\n  filterMode: FilterMode,\n  workerThreshold: number,\n): boolean {\n  // Fuzzy mode always requires worker (Fuse.js runs there)\n  if (filterMode === 'fuzzy') {\n    return true;\n  }\n\n  // Large datasets should use worker to keep main thread responsive\n  return itemCount > workerThreshold;\n}\n\n/**\n * Checks if Web Workers are supported in the current environment.\n *\n * @returns {boolean} True if Web Workers are supported\n */\nexport function isWorkerSupported(): boolean {\n  return typeof Worker !== 'undefined';\n}\n\n/**\n * Gets the effective filter mode, falling back if necessary.\n * If fuzzy mode is requested but Workers aren't supported, falls back to smart.\n *\n * @param {FilterMode} requestedMode - The requested filter mode\n * @returns {FilterMode} The effective filter mode to use\n */\nexport function getEffectiveFilterMode(requestedMode: FilterMode): FilterMode {\n  if (requestedMode === 'fuzzy' && !isWorkerSupported()) {\n    console.warn(\n      'Web Workers not supported. Falling back from fuzzy to smart mode.',\n    );\n    return 'smart';\n  }\n  return requestedMode;\n}\n","/**\n * @fileoverview Client for communicating with the search Web Worker.\n * Provides a clean async API for search operations.\n */\n\nimport type {\n  RawItem,\n  FilterMode,\n  SearchResult,\n  WorkerRequest,\n  WorkerResponse,\n} from '../types';\nimport {\n  clampMaxResults,\n  clampFuzzyThreshold,\n  DEFAULT_MAX_RESULTS,\n  DEFAULT_FUZZY_THRESHOLD,\n} from '../guards';\n\n/** Callback type for pending requests */\ntype PendingCallback = {\n  /**\n   * Callback invoked when a worker search request completes successfully.\n   * @param {SearchResult} result - The search results returned by the worker.\n   */\n  resolve: (result: SearchResult) => void;\n  /**\n   * Callback invoked when a worker search request fails.\n   * @param {Error} error - The error describing why the request was rejected.\n   */\n  reject: (error: Error) => void;\n};\n\n/**\n * Client for managing search operations via Web Worker.\n * Handles worker lifecycle, request tracking, and fallback behavior.\n */\nexport class SearchWorkerClient {\n  private worker: Worker | null = null;\n  private pendingRequests: Map<string, PendingCallback> = new Map();\n  private requestCounter: number = 0;\n  private isInitialized: boolean = false;\n  private initPromise: Promise<void> | null = null;\n\n  /** Flag indicating if fallback mode is active (no worker available) */\n  private isFallbackMode: boolean = false;\n\n  /** Callback for when worker support is not available */\n  public onFallback?: () => void;\n\n  /**\n   * Creates a new SearchWorkerClient.\n   * @param {string} [workerUrl] - URL to the worker script (optional, uses inline worker if not provided)\n   */\n  constructor(private workerUrl?: string) {}\n\n  /**\n   * Checks if Web Workers are supported in the current environment.\n   * @returns {boolean} True if Web Workers are supported\n   */\n  public static isSupported(): boolean {\n    return typeof Worker !== 'undefined';\n  }\n\n  /**\n   * Generates a unique request ID.\n   * @returns {string} A unique request ID\n   */\n  private generateRequestId(): string {\n    return `req-${++this.requestCounter}-${Date.now()}`;\n  }\n\n  /**\n   * Creates and initializes the worker.\n   * Note: Workers require a workerUrl to be provided. Inline workers are not\n   * supported due to ES module limitations with importScripts.\n   * @returns {Worker | null} The created Worker instance or null if creation failed\n   */\n  private createWorker(): Worker | null {\n    if (!SearchWorkerClient.isSupported()) {\n      console.warn('Web Workers are not supported in this environment.');\n      this.onFallback?.();\n      return null;\n    }\n\n    try {\n      if (this.workerUrl) {\n        return new Worker(this.workerUrl, { type: 'module' });\n      }\n\n      // No workerUrl provided - fallback to main thread processing\n      // Inline workers with ES modules are not supported\n      console.warn(\n        'No workerUrl provided. Falling back to main thread processing.',\n      );\n      this.onFallback?.();\n      return null;\n    } catch (error) {\n      console.error('Failed to create Web Worker:', error);\n      this.onFallback?.();\n      return null;\n    }\n  }\n\n  /**\n   * Sets up message handlers for the worker.\n   */\n  private setupMessageHandler(): void {\n    if (!this.worker) return;\n\n    this.worker.onmessage = (event: MessageEvent<WorkerResponse>) => {\n      const { requestId, type, payload } = event.data;\n\n      const pending = this.pendingRequests.get(requestId);\n      if (!pending) {\n        console.warn(`Received response for unknown request: ${requestId}`);\n        return;\n      }\n\n      this.pendingRequests.delete(requestId);\n\n      if (type === 'ERROR') {\n        pending.reject(\n          new Error(\n            (\n              payload as {\n                /**\n                 * Error message describing what went wrong.\n                 */\n                error: string;\n              }\n            ).error,\n          ),\n        );\n      } else {\n        pending.resolve(payload as SearchResult);\n      }\n    };\n\n    this.worker.onerror = (error: ErrorEvent) => {\n      console.error('Worker error:', error);\n      // Reject all pending requests\n      this.pendingRequests.forEach(pending => {\n        pending.reject(new Error('Worker error'));\n      });\n      this.pendingRequests.clear();\n    };\n  }\n\n  /**\n   * Sends a request to the worker and returns a promise for the result.\n   * @param {WorkerRequest} request - The request object to send to the worker\n   * @returns {Promise<SearchResult>} Promise that resolves to the search result\n   */\n  private sendRequest(request: WorkerRequest): Promise<SearchResult> {\n    return new Promise((resolve, reject) => {\n      if (!this.worker) {\n        reject(new Error('Worker not initialized'));\n        return;\n      }\n\n      this.pendingRequests.set(request.requestId, { resolve, reject });\n      this.worker.postMessage(request);\n    });\n  }\n\n  /**\n   * Initializes the worker with items to search.\n   * @param {RawItem[]} items - Array of items to index\n   * @returns {Promise<void>} Promise that resolves when initialization is complete\n   */\n  public async init(items: RawItem[]): Promise<void> {\n    // If already initializing, wait for it\n    if (this.initPromise) {\n      await this.initPromise;\n      // Re-init with new items\n    }\n\n    this.initPromise = this.doInit(items);\n    await this.initPromise;\n  }\n\n  private async doInit(items: RawItem[]): Promise<void> {\n    // If already in fallback mode, don't try to create worker again\n    if (this.isFallbackMode) {\n      return;\n    }\n\n    // Create worker if not exists\n    if (!this.worker) {\n      this.worker = this.createWorker();\n      if (!this.worker) {\n        // Worker creation failed - enter fallback mode silently\n        this.isFallbackMode = true;\n        this.onFallback?.();\n        return;\n      }\n      this.setupMessageHandler();\n    }\n\n    const requestId = this.generateRequestId();\n\n    try {\n      await this.sendRequest({\n        type: 'INIT',\n        requestId,\n        payload: { items },\n      });\n      this.isInitialized = true;\n    } catch {\n      // Worker init failed - enter fallback mode\n      this.isFallbackMode = true;\n      this.onFallback?.();\n      this.terminate();\n    }\n  }\n\n  /**\n   * Performs a search operation.\n   * @param {string} query - Search query string\n   * @param {FilterMode} filterMode - Filter mode (strict/smart/fuzzy)\n   * @param {number} maxResults - Maximum results to return\n   * @param {number} fuzzyThreshold - Threshold for fuzzy matching\n   * @returns {Promise<SearchResult>} Promise resolving to search results\n   */\n  public async search(\n    query: string,\n    filterMode: FilterMode = 'strict',\n    maxResults: number = DEFAULT_MAX_RESULTS,\n    fuzzyThreshold: number = DEFAULT_FUZZY_THRESHOLD,\n  ): Promise<SearchResult> {\n    if (!this.isInitialized || !this.worker) {\n      throw new Error('Worker not initialized. Call init() first.');\n    }\n\n    const requestId = this.generateRequestId();\n\n    return this.sendRequest({\n      type: 'SEARCH',\n      requestId,\n      payload: {\n        query,\n        filterMode,\n        maxResults: clampMaxResults(maxResults),\n        fuzzyThreshold: clampFuzzyThreshold(fuzzyThreshold),\n      },\n    });\n  }\n\n  /**\n   * Cancels all pending requests.\n   */\n  public cancelPending(): void {\n    this.pendingRequests.forEach(pending => {\n      pending.reject(new Error('Request cancelled'));\n    });\n    this.pendingRequests.clear();\n  }\n\n  /**\n   * Terminates the worker and cleans up resources.\n   */\n  public terminate(): void {\n    this.cancelPending();\n    this.worker?.terminate();\n    this.worker = null;\n    this.isInitialized = false;\n    this.initPromise = null;\n    // Note: we don't reset isFallbackMode here to avoid retrying worker creation\n  }\n\n  /**\n   * Returns whether the worker is ready to perform searches.\n   * @returns {boolean} True if the worker is initialized and ready\n   */\n  public get isReady(): boolean {\n    return this.isInitialized && this.worker !== null;\n  }\n\n  /**\n   * Returns whether the client is in fallback mode (no worker available).\n   * @returns {boolean} True if the client is operating in fallback mode\n   */\n  public get inFallbackMode(): boolean {\n    return this.isFallbackMode;\n  }\n}\n","/**\n * @fileoverview Internationalization utilities for Nova components.\n * Provides automatic locale detection and default translations.\n */\n\n/**\n * Default translations for truncated results text.\n * Supports placeholders: {shown} and {total}\n */\nconst TRUNCATED_RESULTS_TRANSLATIONS: Record<string, string> = {\n  en: '{shown} results shown out of {total} — refine your search',\n  fr: '{shown} résultats affichés sur {total} — affinez votre recherche',\n  de: '{shown} von {total} Ergebnissen angezeigt — verfeinern Sie Ihre Suche',\n  es: '{shown} resultados mostrados de {total} — refine su búsqueda',\n  it: '{shown} risultati mostrati su {total} — perfeziona la tua ricerca',\n  nl: '{shown} resultaten getoond van {total} — verfijn uw zoekopdracht',\n  pt: '{shown} resultados exibidos de {total} — refine sua pesquisa',\n  ru: '{shown} результатов показано из {total} — уточните поиск',\n  ja: '{shown}件の結果が{total}件中表示されています — 検索を絞り込んでください',\n  zh: '{shown}个结果，共{total}个 — 请细化您的搜索',\n  ko: '{shown}개 결과가 {total}개 중 표시됨 — 검색을 구체화하세요',\n};\n\n/**\n * Gets the browser's locale (language code).\n * Falls back to 'en' if detection fails.\n *\n * @returns {string} The locale code (e.g., 'en', 'fr', 'de')\n */\nexport function getBrowserLocale(): string {\n  if (typeof navigator === 'undefined') {\n    return 'en';\n  }\n\n  // Try navigator.language first (e.g., 'en-US', 'fr-FR')\n  const language = navigator.language || navigator.languages?.[0] || 'en';\n\n  // Extract the base language code (e.g., 'en' from 'en-US')\n  return language.split('-')[0].toLowerCase();\n}\n\n/**\n * Gets the localized truncated results text.\n * Automatically detects browser locale and provides appropriate translation.\n * Falls back to English if translation is not available.\n *\n * @param {string} [locale] - Optional locale override. If not provided, uses browser locale.\n * @returns {string} The localized text with placeholders {shown} and {total}\n *\n * @example\n * getTruncatedResultsText() // Uses browser locale\n * getTruncatedResultsText('fr') // Returns French translation\n * getTruncatedResultsText('de') // Returns German translation\n */\nexport function getTruncatedResultsText(locale?: string): string {\n  const targetLocale = locale\n    ? locale.split('-')[0].toLowerCase()\n    : getBrowserLocale();\n  return (\n    TRUNCATED_RESULTS_TRANSLATIONS[targetLocale] ||\n    TRUNCATED_RESULTS_TRANSLATIONS.en\n  );\n}\n\n/**\n * Formats the truncated results text by replacing placeholders with actual values.\n *\n * @param {string} template - The text template with {shown} and {total} placeholders\n * @param {number} shown - The number of items shown\n * @param {number} total - The total number of items\n * @returns {string} The formatted text with replaced placeholders\n *\n * @example\n * formatTruncatedResults('{shown} of {total}', 10, 100) // '10 of 100'\n */\nexport function formatTruncatedResults(\n  template: string,\n  shown: number,\n  total: number,\n): string {\n  return template\n    .replace(/{shown}/g, String(shown))\n    .replace(/{total}/g, String(total));\n}\n"],"names":["search"],"mappings":"AAAA;;;AAGG;AAEH;;;;;;;;;;;;;;;AAeG;AACG,SAAU,SAAS,CAAC,IAAY,EAAA;AACpC,IAAA,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,EAAE;AAEpB,IAAA,QACE;;AAEG,SAAA,WAAW;;SAEX,SAAS,CAAC,KAAK;AACf,SAAA,OAAO,CAAC,kBAAkB,EAAE,EAAE;;AAE9B,SAAA,OAAO,CAAC,UAAU,EAAE,GAAG;;AAEvB,SAAA,OAAO,CAAC,MAAM,EAAE,GAAG;;SAEnB,IAAI,EAAE;AAEb;AAEA;;;;;;;;;;AAUG;AACG,SAAU,QAAQ,CAAC,IAAY,EAAA;AACnC,IAAA,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC;AAClC,IAAA,IAAI,CAAC,UAAU;AAAE,QAAA,OAAO,EAAE;AAE1B,IAAA,OAAO,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AAChE;;ACxDA;;;AAGG;AAEH;AACO,MAAM,mBAAmB,GAAG,EAAE;AAErC;AACO,MAAM,eAAe,GAAG,EAAE;AAEjC;AACO,MAAM,oBAAoB,GAAG,GAAG;AAEvC;AACO,MAAM,wBAAwB,GAAG,IAAI;AAE5C;AACO,MAAM,oBAAoB,GAAG,CAAC;AAErC;AACO,MAAM,oBAAoB,GAAG,KAAK;AAEzC;AACO,MAAM,uBAAuB,GAAG,GAAG;AAK1C;AACO,MAAM,oBAAoB,GAAG;AAEpC;;;;;;;;;;;;;;AAcG;AACG,SAAU,eAAe,CAAC,KAAc,EAAA;IAC5C,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;AACzC,QAAA,OAAO,mBAAmB;;AAG5B,IAAA,IAAI,KAAK,GAAG,eAAe,EAAE;AAC3B,QAAA,OAAO,eAAe;;AAGxB,IAAA,IAAI,KAAK,GAAG,oBAAoB,EAAE;AAChC,QAAA,OAAO,oBAAoB;;AAG7B,IAAA,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;AAC1B;AAEA;;;;;;;;;;;;;;AAcG;AACG,SAAU,oBAAoB,CAAC,KAAc,EAAA;IACjD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;AACzC,QAAA,OAAO,wBAAwB;;AAGjC,IAAA,IAAI,KAAK,GAAG,oBAAoB,EAAE;AAChC,QAAA,OAAO,oBAAoB;;AAG7B,IAAA,IAAI,KAAK,GAAG,oBAAoB,EAAE;AAChC,QAAA,OAAO,oBAAoB;;AAG7B,IAAA,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;AAC1B;AAEA;;;;;;;;;;;;;;AAcG;AACG,SAAU,mBAAmB,CAAC,KAAc,EAAA;IAChD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE;AACzC,QAAA,OAAO,uBAAuB;;AAGhC,IAAA,IAAI,KAAK,GAAG,CAAC,EAAE;AACb,QAAA,OAAO,CAAC;;AAGV,IAAA,IAAI,KAAK,GAAG,CAAC,EAAE;AACb,QAAA,OAAO,CAAC;;AAGV,IAAA,OAAO,KAAK;AACd;;AC3HA;;;AAGG;AAKH;;;;;;;;;;;;;;;;;AAiBG;AACG,SAAU,UAAU,CAAC,KAAgB,EAAA;IACzC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AACnC,QAAA,OAAO,EAAE;;AAGX,IAAA,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,IAAG;QACtB,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;QAClC,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,IAAI;AACJ,YAAA,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;SAC7B;AACH,KAAC,CAAC;AACJ;;ACxCA;;;AAGG;AAKH;;;;;;;;;;;;;;;;AAgBG;AACa,SAAA,YAAY,CAC1B,YAA2B,EAC3B,KAAa,EAAA;IAEb,IAAI,CAAC,KAAK,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE;AACnC,QAAA,OAAO,YAAY,EAAE,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;;AAGjD,IAAA,MAAM,eAAe,GAAG,SAAS,CAAC,KAAK,CAAC;IAExC,IAAI,CAAC,eAAe,EAAE;AACpB,QAAA,OAAO,YAAY,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;;AAG1C,IAAA,OAAO;AACJ,SAAA,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC;SAClD,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AACzB;;AC1CA;;;AAGG;AAKH;;;;;;;;;;;;;;;;;AAiBG;AACa,SAAA,WAAW,CACzB,YAA2B,EAC3B,KAAa,EAAA;IAEb,IAAI,CAAC,KAAK,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE;AACnC,QAAA,OAAO,YAAY,EAAE,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;;AAGjD,IAAA,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC;AAEnC,IAAA,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;AACvB,QAAA,OAAO,YAAY,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;;AAG1C,IAAA,OAAO;SACJ,MAAM,CAAC,IAAI,IAAG;;AAEb,QAAA,OAAO,WAAW,CAAC,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;AACxE,KAAC;SACA,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AACzB;;AC9CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,OAAO,CAAC,KAAK,EAAE;AACxB,EAAE,OAAO,CAAC,KAAK,CAAC;AAChB,MAAM,MAAM,CAAC,KAAK,CAAC,KAAK;AACxB,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK;AACzB;AAIA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B;AACA,EAAE,IAAI,OAAO,KAAK,IAAI,QAAQ,EAAE;AAChC,IAAI,OAAO;AACX;AACA,EAAE,IAAI,MAAM,GAAG,KAAK,GAAG,EAAE;AACzB,EAAE,OAAO,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,KAAK,IAAI,SAAS,GAAG,IAAI,GAAG;AAC1D;;AAEA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,KAAK,IAAI,IAAI,GAAG,EAAE,GAAG,YAAY,CAAC,KAAK;AAChD;;AAEA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,OAAO,KAAK,KAAK;AAC1B;;AAEA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,OAAO,KAAK,KAAK;AAC1B;;AAEA;AACA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,EAAE;AACF,IAAI,KAAK,KAAK,IAAI;AAClB,IAAI,KAAK,KAAK,KAAK;AACnB,KAAK,YAAY,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,kBAAkB;AAC/D;AACA;;AAEA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,EAAE,OAAO,OAAO,KAAK,KAAK;AAC1B;;AAEA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,EAAE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK;AACtC;;AAEA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,EAAE,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK;AAC1C;;AAEA,SAAS,OAAO,CAAC,KAAK,EAAE;AACxB,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;AACvB;;AAEA;AACA;AACA,SAAS,MAAM,CAAC,KAAK,EAAE;AACvB,EAAE,OAAO,KAAK,IAAI;AAClB,MAAM,KAAK,KAAK;AAChB,QAAQ;AACR,QAAQ;AACR,MAAM,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK;AAC1C;;AAIA,MAAM,oBAAoB,GAAG,wBAAwB;;AAErD,MAAM,oCAAoC,GAAG,CAAC,GAAG;AACjD,EAAE,CAAC,sBAAsB,EAAE,GAAG,CAAC,CAAC;;AAEhC,MAAM,wBAAwB,GAAG,CAAC,GAAG;AACrC,EAAE,CAAC,8BAA8B,EAAE,GAAG,CAAC,CAAC,CAAC;;AAEzC,MAAM,oBAAoB,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC;;AAExE,MAAM,wBAAwB,GAAG,CAAC,GAAG;AACrC,EAAE,CAAC,0BAA0B,EAAE,GAAG,CAAC,4BAA4B,CAAC;;AAEhE,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc;;AAE9C,MAAM,QAAQ,CAAC;AACf,EAAE,WAAW,CAAC,IAAI,EAAE;AACpB,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE;AACnB,IAAI,IAAI,CAAC,OAAO,GAAG,EAAE;;AAErB,IAAI,IAAI,WAAW,GAAG,CAAC;;AAEvB,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK;AAC1B,MAAM,IAAI,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC;;AAE9B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;AAC1B,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG;;AAEhC,MAAM,WAAW,IAAI,GAAG,CAAC,MAAM;AAC/B,KAAK,CAAC;;AAEN;AACA,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK;AAChC,MAAM,GAAG,CAAC,MAAM,IAAI,WAAW;AAC/B,KAAK,CAAC;AACN;AACA,EAAE,GAAG,CAAC,KAAK,EAAE;AACb,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK;AAC7B;AACA,EAAE,IAAI,GAAG;AACT,IAAI,OAAO,IAAI,CAAC;AAChB;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK;AACpC;AACA;;AAEA,SAAS,SAAS,CAAC,GAAG,EAAE;AACxB,EAAE,IAAI,IAAI,GAAG,IAAI;AACjB,EAAE,IAAI,EAAE,GAAG,IAAI;AACf,EAAE,IAAI,GAAG,GAAG,IAAI;AAChB,EAAE,IAAI,MAAM,GAAG,CAAC;AAChB,EAAE,IAAI,KAAK,GAAG,IAAI;;AAElB,EAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE;AACrC,IAAI,GAAG,GAAG,GAAG;AACb,IAAI,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC;AAC7B,IAAI,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC;AACzB,GAAG,MAAM;AACT,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE;AACnC,MAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,MAAM,CAAC;AAClD;;AAEA,IAAI,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI;AACzB,IAAI,GAAG,GAAG,IAAI;;AAEd,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE;AACpC,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM;;AAEzB,MAAM,IAAI,MAAM,IAAI,CAAC,EAAE;AACvB,QAAQ,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,IAAI,CAAC;AACtD;AACA;;AAEA,IAAI,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC;AAC9B,IAAI,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC;AAC1B,IAAI,KAAK,GAAG,GAAG,CAAC,KAAK;AACrB;;AAEA,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK;AACvC;;AAEA,SAAS,aAAa,CAAC,GAAG,EAAE;AAC5B,EAAE,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG;AAC3C;;AAEA,SAAS,WAAW,CAAC,GAAG,EAAE;AAC1B,EAAE,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG;AACxC;;AAEA,SAAS,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE;AACxB,EAAE,IAAI,IAAI,GAAG,EAAE;AACf,EAAE,IAAI,GAAG,GAAG,KAAK;;AAEjB,EAAE,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,KAAK;AACxC,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;AACzB,MAAM;AACN;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;AACtB;AACA,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AACpB,KAAK,MAAM;AACX,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;;AAE3B,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC;;AAE5B,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;AAC7B,QAAQ;AACR;;AAEA;AACA;AACA,MAAM;AACN,QAAQ,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC;AACjC,SAAS,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC;AAC/D,QAAQ;AACR,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAClC,OAAO,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACjC,QAAQ,GAAG,GAAG,IAAI;AAClB;AACA,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AAC7D,UAAU,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC;AAC5C;AACA,OAAO,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE;AAC9B;AACA,QAAQ,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC;AACvC;AACA;AACA,GAAG;;AAEH;AACA,EAAE,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;;AAE1D,EAAE,OAAO,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AAC5B;;AAEA,MAAM,YAAY,GAAG;AACrB;AACA;AACA;AACA,EAAE,cAAc,EAAE,KAAK;AACvB;AACA;AACA,EAAE,cAAc,EAAE,KAAK;AACvB;AACA,EAAE,kBAAkB,EAAE;AACtB,CAAC;;AAED,MAAM,YAAY,GAAG;AACrB;AACA;AACA,EAAE,eAAe,EAAE,KAAK;AACxB;AACA,EAAE,YAAY,EAAE,KAAK;AACrB;AACA,EAAE,IAAI,EAAE,EAAE;AACV;AACA,EAAE,UAAU,EAAE,IAAI;AAClB;AACA,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;AACf,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,GAAG;AAC9E,CAAC;;AAED,MAAM,YAAY,GAAG;AACrB;AACA,EAAE,QAAQ,EAAE,CAAC;AACb;AACA;AACA,EAAE,SAAS,EAAE,GAAG;AAChB;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,EAAE;AACZ,CAAC;;AAED,MAAM,eAAe,GAAG;AACxB;AACA,EAAE,iBAAiB,EAAE,KAAK;AAC1B;AACA;AACA,EAAE,KAAK,EAAE,GAAG;AACZ;AACA;AACA;AACA,EAAE,cAAc,EAAE,KAAK;AACvB;AACA;AACA;AACA,EAAE,eAAe,EAAE,KAAK;AACxB;AACA,EAAE,eAAe,EAAE;AACnB,CAAC;;AAED,IAAI,MAAM,GAAG;AACb,EAAE,GAAG,YAAY;AACjB,EAAE,GAAG,YAAY;AACjB,EAAE,GAAG,YAAY;AACjB,EAAE,GAAG;AACL,CAAC;;AAED,MAAM,KAAK,GAAG,QAAQ;;AAEtB;AACA;AACA,SAAS,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE;AACxC,EAAE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAE;AACzB,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC;;AAElC,EAAE,OAAO;AACT,IAAI,GAAG,CAAC,KAAK,EAAE;AACf,MAAM,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM;;AAEjD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;AAChC,QAAQ,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS;AAClC;;AAEA;AACA,MAAM,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,GAAG,MAAM,CAAC;;AAExD;AACA,MAAM,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;;AAEpD,MAAM,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;;AAE7B,MAAM,OAAO;AACb,KAAK;AACL,IAAI,KAAK,GAAG;AACZ,MAAM,KAAK,CAAC,KAAK,EAAE;AACnB;AACA;AACA;;AAEA,MAAM,SAAS,CAAC;AAChB,EAAE,WAAW,CAAC;AACd,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK;AACxB,IAAI,eAAe,GAAG,MAAM,CAAC;AAC7B,GAAG,GAAG,EAAE,EAAE;AACV,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;AACxC,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK;AACtB,IAAI,IAAI,CAAC,SAAS,GAAG,KAAK;;AAE1B,IAAI,IAAI,CAAC,eAAe,EAAE;AAC1B;AACA,EAAE,UAAU,CAAC,IAAI,GAAG,EAAE,EAAE;AACxB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB;AACA,EAAE,eAAe,CAAC,OAAO,GAAG,EAAE,EAAE;AAChC,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO;AAC1B;AACA,EAAE,OAAO,CAAC,IAAI,GAAG,EAAE,EAAE;AACrB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,IAAI,IAAI,CAAC,QAAQ,GAAG,EAAE;AACtB,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK;AAC/B,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG;AACjC,KAAK,CAAC;AACN;AACA,EAAE,MAAM,GAAG;AACX,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAC7C,MAAM;AACN;;AAEA,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI;;AAEzB;AACA,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;AAChC,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,QAAQ,KAAK;AAC3C,QAAQ,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC;AACtC,OAAO,CAAC;AACR,KAAK,MAAM;AACX;AACA,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,QAAQ,KAAK;AAC3C,QAAQ,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC;AACtC,OAAO,CAAC;AACR;;AAEA,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;AACrB;AACA;AACA,EAAE,GAAG,CAAC,GAAG,EAAE;AACX,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE;;AAE3B,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE;AACvB,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC;AAC/B,KAAK,MAAM;AACX,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC;AAC/B;AACA;AACA;AACA,EAAE,QAAQ,CAAC,GAAG,EAAE;AAChB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC;;AAE/B;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AAC1D,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5B;AACA;AACA,EAAE,sBAAsB,CAAC,IAAI,EAAE,KAAK,EAAE;AACtC,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;AACpC;AACA,EAAE,IAAI,GAAG;AACT,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC;AACxB;AACA,EAAE,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE;AAC5B,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE;AACzC,MAAM;AACN;;AAEA,IAAI,IAAI,MAAM,GAAG;AACjB,MAAM,CAAC,EAAE,GAAG;AACZ,MAAM,CAAC,EAAE,QAAQ;AACjB,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG;AAC1B,KAAK;;AAEL,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;AAC7B;AACA,EAAE,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE;AAC5B,IAAI,IAAI,MAAM,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE;;AAEvC;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,QAAQ,KAAK;AACzC,MAAM,IAAI,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC;;AAExE,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;AAC7B,QAAQ;AACR;;AAEA,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AAC1B,QAAQ,IAAI,UAAU,GAAG,EAAE;AAC3B,QAAQ,MAAM,KAAK,GAAG,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;;AAErD,QAAQ,OAAO,KAAK,CAAC,MAAM,EAAE;AAC7B,UAAU,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;;AAEvD,UAAU,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;AACjC,YAAY;AACZ;;AAEA,UAAU,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAClD,YAAY,IAAI,SAAS,GAAG;AAC5B,cAAc,CAAC,EAAE,KAAK;AACtB,cAAc,CAAC,EAAE,cAAc;AAC/B,cAAc,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK;AACpC,aAAa;;AAEb,YAAY,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;AACtC,WAAW,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACrC,YAAY,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK;AACvC,cAAc,KAAK,CAAC,IAAI,CAAC;AACzB,gBAAgB,cAAc,EAAE,CAAC;AACjC,gBAAgB,KAAK,EAAE;AACvB,eAAe,CAAC;AAChB,aAAa,CAAC;AACd,WAAW,MAAM;AACjB;AACA,QAAQ,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,UAAU;AACvC,OAAO,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AACrD,QAAQ,IAAI,SAAS,GAAG;AACxB,UAAU,CAAC,EAAE,KAAK;AAClB,UAAU,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK;AAChC,SAAS;;AAET,QAAQ,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,SAAS;AACtC;AACA,KAAK,CAAC;;AAEN,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;AAC7B;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO;AACX,MAAM,IAAI,EAAE,IAAI,CAAC,IAAI;AACrB,MAAM,OAAO,EAAE,IAAI,CAAC;AACpB;AACA;AACA;;AAEA,SAAS,WAAW;AACpB,EAAE,IAAI;AACN,EAAE,IAAI;AACN,EAAE,EAAE,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,CAAC,eAAe,EAAE,GAAG;AACvE,EAAE;AACF,EAAE,MAAM,OAAO,GAAG,IAAI,SAAS,CAAC,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC;AAC3D,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACtC,EAAE,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC;AAC1B,EAAE,OAAO,CAAC,MAAM,EAAE;AAClB,EAAE,OAAO;AACT;;AAEA,SAAS,UAAU;AACnB,EAAE,IAAI;AACN,EAAE,EAAE,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,CAAC,eAAe,EAAE,GAAG;AACvE,EAAE;AACF,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI;AAChC,EAAE,MAAM,OAAO,GAAG,IAAI,SAAS,CAAC,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC;AAC3D,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC;AACvB,EAAE,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC;AAClC,EAAE,OAAO;AACT;;AAEA,SAAS,cAAc;AACvB,EAAE,OAAO;AACT,EAAE;AACF,IAAI,MAAM,GAAG,CAAC;AACd,IAAI,eAAe,GAAG,CAAC;AACvB,IAAI,gBAAgB,GAAG,CAAC;AACxB,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAC9B,IAAI,cAAc,GAAG,MAAM,CAAC;AAC5B,GAAG,GAAG;AACN,EAAE;AACF,EAAE,MAAM,QAAQ,GAAG,MAAM,GAAG,OAAO,CAAC,MAAM;;AAE1C,EAAE,IAAI,cAAc,EAAE;AACtB,IAAI,OAAO;AACX;;AAEA,EAAE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,GAAG,eAAe,CAAC;;AAEhE,EAAE,IAAI,CAAC,QAAQ,EAAE;AACjB;AACA,IAAI,OAAO,SAAS,GAAG,GAAG,GAAG;AAC7B;;AAEA,EAAE,OAAO,QAAQ,GAAG,SAAS,GAAG;AAChC;;AAEA,SAAS,oBAAoB;AAC7B,EAAE,SAAS,GAAG,EAAE;AAChB,EAAE,kBAAkB,GAAG,MAAM,CAAC;AAC9B,EAAE;AACF,EAAE,IAAI,OAAO,GAAG,EAAE;AAClB,EAAE,IAAI,KAAK,GAAG,EAAE;AAChB,EAAE,IAAI,GAAG,GAAG,EAAE;AACd,EAAE,IAAI,CAAC,GAAG,CAAC;;AAEX,EAAE,KAAK,IAAI,GAAG,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AACpD,IAAI,IAAI,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;AAC5B,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,EAAE,EAAE;AAC/B,MAAM,KAAK,GAAG,CAAC;AACf,KAAK,MAAM,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,EAAE,EAAE;AACvC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AACjB,MAAM,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,kBAAkB,EAAE;AACjD,QAAQ,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAClC;AACA,MAAM,KAAK,GAAG,EAAE;AAChB;AACA;;AAEA;AACA,EAAE,IAAI,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,kBAAkB,EAAE;AAC3D,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAChC;;AAEA,EAAE,OAAO;AACT;;AAEA;AACA,MAAM,QAAQ,GAAG,EAAE;;AAEnB,SAASA,QAAM;AACf,EAAE,IAAI;AACN,EAAE,OAAO;AACT,EAAE,eAAe;AACjB,EAAE;AACF,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAC9B,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAC9B,IAAI,SAAS,GAAG,MAAM,CAAC,SAAS;AAChC,IAAI,cAAc,GAAG,MAAM,CAAC,cAAc;AAC1C,IAAI,kBAAkB,GAAG,MAAM,CAAC,kBAAkB;AAClD,IAAI,cAAc,GAAG,MAAM,CAAC,cAAc;AAC1C,IAAI,cAAc,GAAG,MAAM,CAAC;AAC5B,GAAG,GAAG;AACN,EAAE;AACF,EAAE,IAAI,OAAO,CAAC,MAAM,GAAG,QAAQ,EAAE;AACjC,IAAI,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,QAAQ,CAAC;AACtD;;AAEA,EAAE,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM;AACnC;AACA,EAAE,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM;AAC7B;AACA,EAAE,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;AACnE;AACA,EAAE,IAAI,gBAAgB,GAAG,SAAS;AAClC;AACA,EAAE,IAAI,YAAY,GAAG,gBAAgB;;AAErC;AACA;AACA,EAAE,MAAM,cAAc,GAAG,kBAAkB,GAAG,CAAC,IAAI,cAAc;AACjE;AACA,EAAE,MAAM,SAAS,GAAG,cAAc,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE;;AAExD,EAAE,IAAI,KAAK;;AAEX;AACA,EAAE,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,EAAE,EAAE;AAC7D,IAAI,IAAI,KAAK,GAAG,cAAc,CAAC,OAAO,EAAE;AACxC,MAAM,eAAe,EAAE,KAAK;AAC5B,MAAM,gBAAgB;AACtB,MAAM,QAAQ;AACd,MAAM;AACN,KAAK,CAAC;;AAEN,IAAI,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,gBAAgB,CAAC;AACxD,IAAI,YAAY,GAAG,KAAK,GAAG,UAAU;;AAErC,IAAI,IAAI,cAAc,EAAE;AACxB,MAAM,IAAI,CAAC,GAAG,CAAC;AACf,MAAM,OAAO,CAAC,GAAG,UAAU,EAAE;AAC7B,QAAQ,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;AAChC,QAAQ,CAAC,IAAI,CAAC;AACd;AACA;AACA;;AAEA;AACA,EAAE,YAAY,GAAG,EAAE;;AAEnB,EAAE,IAAI,UAAU,GAAG,EAAE;AACrB,EAAE,IAAI,UAAU,GAAG,CAAC;AACpB,EAAE,IAAI,MAAM,GAAG,UAAU,GAAG,OAAO;;AAEnC,EAAE,MAAM,IAAI,GAAG,CAAC,KAAK,UAAU,GAAG,CAAC,CAAC;;AAEpC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,IAAI,CAAC,EAAE;AAC1C;AACA;AACA;AACA,IAAI,IAAI,MAAM,GAAG,CAAC;AAClB,IAAI,IAAI,MAAM,GAAG,MAAM;;AAEvB,IAAI,OAAO,MAAM,GAAG,MAAM,EAAE;AAC5B,MAAM,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,EAAE;AAC5C,QAAQ,MAAM,EAAE,CAAC;AACjB,QAAQ,eAAe,EAAE,gBAAgB,GAAG,MAAM;AAClD,QAAQ,gBAAgB;AACxB,QAAQ,QAAQ;AAChB,QAAQ;AACR,OAAO,CAAC;;AAER,MAAM,IAAI,KAAK,IAAI,gBAAgB,EAAE;AACrC,QAAQ,MAAM,GAAG,MAAM;AACvB,OAAO,MAAM;AACb,QAAQ,MAAM,GAAG,MAAM;AACvB;;AAEA,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC;AACzD;;AAEA;AACA,IAAI,MAAM,GAAG,MAAM;;AAEnB,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,GAAG,MAAM,GAAG,CAAC,CAAC;AAC1D,IAAI,IAAI,MAAM,GAAG;AACjB,QAAQ;AACR,QAAQ,IAAI,CAAC,GAAG,CAAC,gBAAgB,GAAG,MAAM,EAAE,OAAO,CAAC,GAAG,UAAU;;AAEjE;AACA,IAAI,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;;AAElC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;;AAErC,IAAI,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;AAC7C,MAAM,IAAI,eAAe,GAAG,CAAC,GAAG,CAAC;AACjC,MAAM,IAAI,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;;AAEnE,MAAM,IAAI,cAAc,EAAE;AAC1B;AACA,QAAQ,SAAS,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;AACjD;;AAEA;AACA,MAAM,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,SAAS;;AAExD;AACA,MAAM,IAAI,CAAC,EAAE;AACb,QAAQ,MAAM,CAAC,CAAC,CAAC;AACjB,UAAU,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC;AAC5E;;AAEA,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE;AAC5B,QAAQ,UAAU,GAAG,cAAc,CAAC,OAAO,EAAE;AAC7C,UAAU,MAAM,EAAE,CAAC;AACnB,UAAU,eAAe;AACzB,UAAU,gBAAgB;AAC1B,UAAU,QAAQ;AAClB,UAAU;AACV,SAAS,CAAC;;AAEV;AACA;AACA,QAAQ,IAAI,UAAU,IAAI,gBAAgB,EAAE;AAC5C;AACA,UAAU,gBAAgB,GAAG,UAAU;AACvC,UAAU,YAAY,GAAG,eAAe;;AAExC;AACA,UAAU,IAAI,YAAY,IAAI,gBAAgB,EAAE;AAChD,YAAY;AACZ;;AAEA;AACA,UAAU,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,gBAAgB,GAAG,YAAY,CAAC;AAClE;AACA;AACA;;AAEA;AACA,IAAI,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,EAAE;AAC1C,MAAM,MAAM,EAAE,CAAC,GAAG,CAAC;AACnB,MAAM,eAAe,EAAE,gBAAgB;AACvC,MAAM,gBAAgB;AACtB,MAAM,QAAQ;AACd,MAAM;AACN,KAAK,CAAC;;AAEN,IAAI,IAAI,KAAK,GAAG,gBAAgB,EAAE;AAClC,MAAM;AACN;;AAEA,IAAI,UAAU,GAAG,MAAM;AACvB;;AAEA,EAAE,MAAM,MAAM,GAAG;AACjB,IAAI,OAAO,EAAE,YAAY,IAAI,CAAC;AAC9B;AACA,IAAI,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU;AACrC,GAAG;;AAEH,EAAE,IAAI,cAAc,EAAE;AACtB,IAAI,MAAM,OAAO,GAAG,oBAAoB,CAAC,SAAS,EAAE,kBAAkB,CAAC;AACvE,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;AACzB,MAAM,MAAM,CAAC,OAAO,GAAG,KAAK;AAC5B,KAAK,MAAM,IAAI,cAAc,EAAE;AAC/B,MAAM,MAAM,CAAC,OAAO,GAAG,OAAO;AAC9B;AACA;;AAEA,EAAE,OAAO;AACT;;AAEA,SAAS,qBAAqB,CAAC,OAAO,EAAE;AACxC,EAAE,IAAI,IAAI,GAAG,EAAE;;AAEf,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AACzD,IAAI,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAClC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACzD;;AAEA,EAAE,OAAO;AACT;;AAEA,MAAM,WAAW,CAAC;AAClB,EAAE,WAAW;AACb,IAAI,OAAO;AACX,IAAI;AACJ,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAChC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS;AAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAChC,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;AAC5C,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;AAC5C,MAAM,kBAAkB,GAAG,MAAM,CAAC,kBAAkB;AACpD,MAAM,eAAe,GAAG,MAAM,CAAC,eAAe;AAC9C,MAAM,cAAc,GAAG,MAAM,CAAC;AAC9B,KAAK,GAAG;AACR,IAAI;AACJ,IAAI,IAAI,CAAC,OAAO,GAAG;AACnB,MAAM,QAAQ;AACd,MAAM,SAAS;AACf,MAAM,QAAQ;AACd,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB,MAAM,kBAAkB;AACxB,MAAM,eAAe;AACrB,MAAM;AACN,KAAK;;AAEL,IAAI,IAAI,CAAC,OAAO,GAAG,eAAe,GAAG,OAAO,GAAG,OAAO,CAAC,WAAW,EAAE;;AAEpE,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;;AAEpB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;AAC9B,MAAM;AACN;;AAEA,IAAI,MAAM,QAAQ,GAAG,CAAC,OAAO,EAAE,UAAU,KAAK;AAC9C,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;AACvB,QAAQ,OAAO;AACf,QAAQ,QAAQ,EAAE,qBAAqB,CAAC,OAAO,CAAC;AAChD,QAAQ;AACR,OAAO,CAAC;AACR,KAAK;;AAEL,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;;AAEnC,IAAI,IAAI,GAAG,GAAG,QAAQ,EAAE;AACxB,MAAM,IAAI,CAAC,GAAG,CAAC;AACf,MAAM,MAAM,SAAS,GAAG,GAAG,GAAG,QAAQ;AACtC,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,SAAS;;AAEjC,MAAM,OAAO,CAAC,GAAG,GAAG,EAAE;AACtB,QAAQ,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;AACrD,QAAQ,CAAC,IAAI,QAAQ;AACrB;;AAEA,MAAM,IAAI,SAAS,EAAE;AACrB,QAAQ,MAAM,UAAU,GAAG,GAAG,GAAG,QAAQ;AACzC,QAAQ,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,UAAU,CAAC;AAC7D;AACA,KAAK,MAAM;AACX,MAAM,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;AAC/B;AACA;;AAEA,EAAE,QAAQ,CAAC,IAAI,EAAE;AACjB,IAAI,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC,OAAO;;AAE5D,IAAI,IAAI,CAAC,eAAe,EAAE;AAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE;AAC/B;;AAEA;AACA,IAAI,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE;AAC/B,MAAM,IAAI,MAAM,GAAG;AACnB,QAAQ,OAAO,EAAE,IAAI;AACrB,QAAQ,KAAK,EAAE;AACf,OAAO;;AAEP,MAAM,IAAI,cAAc,EAAE;AAC1B,QAAQ,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC/C;;AAEA,MAAM,OAAO;AACb;;AAEA;AACA,IAAI,MAAM;AACV,MAAM,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,SAAS;AACf,MAAM,cAAc;AACpB,MAAM,kBAAkB;AACxB,MAAM;AACN,KAAK,GAAG,IAAI,CAAC,OAAO;;AAEpB,IAAI,IAAI,UAAU,GAAG,EAAE;AACvB,IAAI,IAAI,UAAU,GAAG,CAAC;AACtB,IAAI,IAAI,UAAU,GAAG,KAAK;;AAE1B,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK;AAC/D,MAAM,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAGA,QAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE;AAC1E,QAAQ,QAAQ,EAAE,QAAQ,GAAG,UAAU;AACvC,QAAQ,QAAQ;AAChB,QAAQ,SAAS;AACjB,QAAQ,cAAc;AACtB,QAAQ,kBAAkB;AAC1B,QAAQ,cAAc;AACtB,QAAQ;AACR,OAAO,CAAC;;AAER,MAAM,IAAI,OAAO,EAAE;AACnB,QAAQ,UAAU,GAAG,IAAI;AACzB;;AAEA,MAAM,UAAU,IAAI,KAAK;;AAEzB,MAAM,IAAI,OAAO,IAAI,OAAO,EAAE;AAC9B,QAAQ,UAAU,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,OAAO,CAAC;AAChD;AACA,KAAK,CAAC;;AAEN,IAAI,IAAI,MAAM,GAAG;AACjB,MAAM,OAAO,EAAE,UAAU;AACzB,MAAM,KAAK,EAAE,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG;AAC5D,KAAK;;AAEL,IAAI,IAAI,UAAU,IAAI,cAAc,EAAE;AACtC,MAAM,MAAM,CAAC,OAAO,GAAG,UAAU;AACjC;;AAEA,IAAI,OAAO;AACX;AACA;;AAEA,MAAM,SAAS,CAAC;AAChB,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO;AAC1B;AACA,EAAE,OAAO,YAAY,CAAC,OAAO,EAAE;AAC/B,IAAI,OAAO,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU;AAC5C;AACA,EAAE,OAAO,aAAa,CAAC,OAAO,EAAE;AAChC,IAAI,OAAO,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW;AAC7C;AACA,EAAE,MAAM,WAAW;AACnB;;AAEA,SAAS,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;AAChC,EAAE,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,EAAE,OAAO,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG;AAChC;;AAEA;;AAEA,MAAM,UAAU,SAAS,SAAS,CAAC;AACnC,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,MAAM,OAAO,GAAG,IAAI,KAAK,IAAI,CAAC,OAAO;;AAEzC,IAAI,OAAO;AACX,MAAM,OAAO;AACb,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;AAC5B,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;AAC1C;AACA;AACA;;AAEA;;AAEA,MAAM,iBAAiB,SAAS,SAAS,CAAC;AAC1C,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;AAC5C,IAAI,MAAM,OAAO,GAAG,KAAK,KAAK,EAAE;;AAEhC,IAAI,OAAO;AACX,MAAM,OAAO;AACb,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;AAC5B,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;AAClC;AACA;AACA;;AAEA;;AAEA,MAAM,gBAAgB,SAAS,SAAS,CAAC;AACzC,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;;AAEjD,IAAI,OAAO;AACX,MAAM,OAAO;AACb,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;AAC5B,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;AAC1C;AACA;AACA;;AAEA;;AAEA,MAAM,uBAAuB,SAAS,SAAS,CAAC;AAChD,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;;AAElD,IAAI,OAAO;AACX,MAAM,OAAO;AACb,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;AAC5B,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;AAClC;AACA;AACA;;AAEA;;AAEA,MAAM,gBAAgB,SAAS,SAAS,CAAC;AACzC,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;;AAE/C,IAAI,OAAO;AACX,MAAM,OAAO;AACb,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;AAC5B,MAAM,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;AAClE;AACA;AACA;;AAEA;;AAEA,MAAM,uBAAuB,SAAS,SAAS,CAAC;AAChD,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;AAChD,IAAI,OAAO;AACX,MAAM,OAAO;AACb,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;AAC5B,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;AAClC;AACA;AACA;;AAEA,MAAM,UAAU,SAAS,SAAS,CAAC;AACnC,EAAE,WAAW;AACb,IAAI,OAAO;AACX,IAAI;AACJ,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAChC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS;AAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAChC,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;AAC5C,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;AAC5C,MAAM,kBAAkB,GAAG,MAAM,CAAC,kBAAkB;AACpD,MAAM,eAAe,GAAG,MAAM,CAAC,eAAe;AAC9C,MAAM,cAAc,GAAG,MAAM,CAAC;AAC9B,KAAK,GAAG;AACR,IAAI;AACJ,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB,IAAI,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,CAAC,OAAO,EAAE;AACjD,MAAM,QAAQ;AACd,MAAM,SAAS;AACf,MAAM,QAAQ;AACd,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB,MAAM,kBAAkB;AACxB,MAAM,eAAe;AACrB,MAAM;AACN,KAAK,CAAC;AACN;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI;AAC1C;AACA;;AAEA;;AAEA,MAAM,YAAY,SAAS,SAAS,CAAC;AACrC,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB;AACA,EAAE,WAAW,IAAI,GAAG;AACpB,IAAI,OAAO;AACX;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAO;AACX;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO;AACX;AACA,EAAE,MAAM,CAAC,IAAI,EAAE;AACf,IAAI,IAAI,QAAQ,GAAG,CAAC;AACpB,IAAI,IAAI,KAAK;;AAEb,IAAI,MAAM,OAAO,GAAG,EAAE;AACtB,IAAI,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;;AAE1C;AACA,IAAI,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE;AAChE,MAAM,QAAQ,GAAG,KAAK,GAAG,UAAU;AACnC,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;AACzC;;AAEA,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM;;AAEpC,IAAI,OAAO;AACX,MAAM,OAAO;AACb,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;AAC5B,MAAM;AACN;AACA;AACA;;AAEA;AACA,MAAM,SAAS,GAAG;AAClB,EAAE,UAAU;AACZ,EAAE,YAAY;AACd,EAAE,gBAAgB;AAClB,EAAE,uBAAuB;AACzB,EAAE,uBAAuB;AACzB,EAAE,gBAAgB;AAClB,EAAE,iBAAiB;AACnB,EAAE;AACF,CAAC;;AAED,MAAM,YAAY,GAAG,SAAS,CAAC,MAAM;;AAErC;AACA,MAAM,QAAQ,GAAG,oCAAoC;AACrD,MAAM,QAAQ,GAAG,GAAG;;AAEpB;AACA;AACA;AACA,SAAS,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,EAAE,EAAE;AAC3C,EAAE,OAAO,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK;AAC/C,IAAI,IAAI,KAAK,GAAG;AAChB,OAAO,IAAI;AACX,OAAO,KAAK,CAAC,QAAQ;AACrB,OAAO,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;;AAE9C,IAAI,IAAI,OAAO,GAAG,EAAE;AACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AACzD,MAAM,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC;;AAEhC;AACA,MAAM,IAAI,KAAK,GAAG,KAAK;AACvB,MAAM,IAAI,GAAG,GAAG,EAAE;AAClB,MAAM,OAAO,CAAC,KAAK,IAAI,EAAE,GAAG,GAAG,YAAY,EAAE;AAC7C,QAAQ,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC;AACvC,QAAQ,IAAI,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,SAAS,CAAC;AACpD,QAAQ,IAAI,KAAK,EAAE;AACnB,UAAU,OAAO,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACpD,UAAU,KAAK,GAAG,IAAI;AACtB;AACA;;AAEA,MAAM,IAAI,KAAK,EAAE;AACjB,QAAQ;AACR;;AAEA;AACA,MAAM,GAAG,GAAG,EAAE;AACd,MAAM,OAAO,EAAE,GAAG,GAAG,YAAY,EAAE;AACnC,QAAQ,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC;AACvC,QAAQ,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC,SAAS,CAAC;AACrD,QAAQ,IAAI,KAAK,EAAE;AACnB,UAAU,OAAO,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACpD,UAAU;AACV;AACA;AACA;;AAEA,IAAI,OAAO;AACX,GAAG;AACH;;AAEA;AACA;AACA,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;;AAEnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,cAAc,CAAC;AACrB,EAAE,WAAW;AACb,IAAI,OAAO;AACX,IAAI;AACJ,MAAM,eAAe,GAAG,MAAM,CAAC,eAAe;AAC9C,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;AAC5C,MAAM,kBAAkB,GAAG,MAAM,CAAC,kBAAkB;AACpD,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;AAC5C,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;AAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ;AAChC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS;AAClC,MAAM,QAAQ,GAAG,MAAM,CAAC;AACxB,KAAK,GAAG;AACR,IAAI;AACJ,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI;AACrB,IAAI,IAAI,CAAC,OAAO,GAAG;AACnB,MAAM,eAAe;AACrB,MAAM,cAAc;AACpB,MAAM,kBAAkB;AACxB,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB,MAAM,QAAQ;AACd,MAAM,SAAS;AACf,MAAM;AACN,KAAK;;AAEL,IAAI,IAAI,CAAC,OAAO,GAAG,eAAe,GAAG,OAAO,GAAG,OAAO,CAAC,WAAW,EAAE;AACpE,IAAI,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC;AACvD;;AAEA,EAAE,OAAO,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE;AAC/B,IAAI,OAAO,OAAO,CAAC;AACnB;;AAEA,EAAE,QAAQ,CAAC,IAAI,EAAE;AACjB,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK;;AAE5B,IAAI,IAAI,CAAC,KAAK,EAAE;AAChB,MAAM,OAAO;AACb,QAAQ,OAAO,EAAE,KAAK;AACtB,QAAQ,KAAK,EAAE;AACf;AACA;;AAEA,IAAI,MAAM,EAAE,cAAc,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC,OAAO;;AAE5D,IAAI,IAAI,GAAG,eAAe,GAAG,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE;;AAEtD,IAAI,IAAI,UAAU,GAAG,CAAC;AACtB,IAAI,IAAI,UAAU,GAAG,EAAE;AACvB,IAAI,IAAI,UAAU,GAAG,CAAC;;AAEtB;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE;AAC3D,MAAM,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC;;AAEhC;AACA,MAAM,UAAU,CAAC,MAAM,GAAG,CAAC;AAC3B,MAAM,UAAU,GAAG,CAAC;;AAEpB;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE;AACjE,QAAQ,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC;AACrC,QAAQ,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;;AAEjE,QAAQ,IAAI,OAAO,EAAE;AACrB,UAAU,UAAU,IAAI,CAAC;AACzB,UAAU,UAAU,IAAI,KAAK;AAC7B,UAAU,IAAI,cAAc,EAAE;AAC9B,YAAY,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI;AAClD,YAAY,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACzC,cAAc,UAAU,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,OAAO,CAAC;AACtD,aAAa,MAAM;AACnB,cAAc,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;AACtC;AACA;AACA,SAAS,MAAM;AACf,UAAU,UAAU,GAAG,CAAC;AACxB,UAAU,UAAU,GAAG,CAAC;AACxB,UAAU,UAAU,CAAC,MAAM,GAAG,CAAC;AAC/B,UAAU;AACV;AACA;;AAEA;AACA,MAAM,IAAI,UAAU,EAAE;AACtB,QAAQ,IAAI,MAAM,GAAG;AACrB,UAAU,OAAO,EAAE,IAAI;AACvB,UAAU,KAAK,EAAE,UAAU,GAAG;AAC9B,SAAS;;AAET,QAAQ,IAAI,cAAc,EAAE;AAC5B,UAAU,MAAM,CAAC,OAAO,GAAG,UAAU;AACrC;;AAEA,QAAQ,OAAO;AACf;AACA;;AAEA;AACA,IAAI,OAAO;AACX,MAAM,OAAO,EAAE,KAAK;AACpB,MAAM,KAAK,EAAE;AACb;AACA;AACA;;AAEA,MAAM,mBAAmB,GAAG,EAAE;;AAE9B,SAAS,QAAQ,CAAC,GAAG,IAAI,EAAE;AAC3B,EAAE,mBAAmB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AACnC;;AAEA,SAAS,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE;AAC1C,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AACrE,IAAI,IAAI,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC;AAC9C,IAAI,IAAI,aAAa,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE;AACnD,MAAM,OAAO,IAAI,aAAa,CAAC,OAAO,EAAE,OAAO;AAC/C;AACA;;AAEA,EAAE,OAAO,IAAI,WAAW,CAAC,OAAO,EAAE,OAAO;AACzC;;AAEA,MAAM,eAAe,GAAG;AACxB,EAAE,GAAG,EAAE,MAAM;AACb,EAAE,EAAE,EAAE;AACN,CAAC;;AAED,MAAM,OAAO,GAAG;AAChB,EAAE,IAAI,EAAE,OAAO;AACf,EAAE,OAAO,EAAE;AACX,CAAC;;AAED,MAAM,YAAY,GAAG,CAAC,KAAK;AAC3B,EAAE,CAAC,EAAE,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;;AAE7D,MAAM,MAAM,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;;AAE/C,MAAM,MAAM,GAAG,CAAC,KAAK;AACrB,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;AAE5D,MAAM,iBAAiB,GAAG,CAAC,KAAK,MAAM;AACtC,EAAE,CAAC,eAAe,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM;AAC1D,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG;AACpB,GAAG,CAAC;AACJ,CAAC,CAAC;;AAEF;AACA;AACA,SAAS,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AACrD,EAAE,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK;AAC1B,IAAI,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;;AAEjC,IAAI,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC;;AAErC,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;AACjE,MAAM,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC;AAC1C;;AAEA,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE;AACvB,MAAM,MAAM,GAAG,GAAG,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;;AAE7D,MAAM,MAAM,OAAO,GAAG,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC;;AAEvE,MAAM,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE;AAC9B,QAAQ,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,GAAG,CAAC;AACjE;;AAEA,MAAM,MAAM,GAAG,GAAG;AAClB,QAAQ,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC;AAC/B,QAAQ;AACR,OAAO;;AAEP,MAAM,IAAI,IAAI,EAAE;AAChB,QAAQ,GAAG,CAAC,QAAQ,GAAG,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC;AACvD;;AAEA,MAAM,OAAO;AACb;;AAEA,IAAI,IAAI,IAAI,GAAG;AACf,MAAM,QAAQ,EAAE,EAAE;AAClB,MAAM,QAAQ,EAAE,IAAI,CAAC,CAAC;AACtB,KAAK;;AAEL,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK;AAC1B,MAAM,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC;;AAE9B,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AAC1B,QAAQ,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AAChC,UAAU,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxC,SAAS,CAAC;AACV;AACA,KAAK,CAAC;;AAEN,IAAI,OAAO;AACX,GAAG;;AAEH,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;AAC5B,IAAI,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC;AACpC;;AAEA,EAAE,OAAO,IAAI,CAAC,KAAK;AACnB;;AAEA;AACA,SAAS,YAAY;AACrB,EAAE,OAAO;AACT,EAAE,EAAE,eAAe,GAAG,MAAM,CAAC,eAAe;AAC5C,EAAE;AACF,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK;AAC9B,IAAI,IAAI,UAAU,GAAG,CAAC;;AAEtB,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;AACrD,MAAM,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,IAAI;;AAE5C,MAAM,UAAU,IAAI,IAAI,CAAC,GAAG;AAC5B,QAAQ,KAAK,KAAK,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,OAAO,GAAG,KAAK;AACtD,QAAQ,CAAC,MAAM,IAAI,CAAC,KAAK,eAAe,GAAG,CAAC,GAAG,IAAI;AACnD,OAAO;AACP,KAAK,CAAC;;AAEN,IAAI,MAAM,CAAC,KAAK,GAAG,UAAU;AAC7B,GAAG,CAAC;AACJ;;AAEA,SAAS,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAE;AACxC,EAAE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO;AAChC,EAAE,IAAI,CAAC,OAAO,GAAG,EAAE;;AAEnB,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;AAC3B,IAAI;AACJ;;AAEA,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK;AAC7B,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE;AAC5D,MAAM;AACN;;AAEA,IAAI,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK;;AAEpC,IAAI,IAAI,GAAG,GAAG;AACd,MAAM,OAAO;AACb,MAAM;AACN,KAAK;;AAEL,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE;AACnB,MAAM,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG;AAC7B;;AAEA,IAAI,IAAI,KAAK,CAAC,GAAG,GAAG,EAAE,EAAE;AACxB,MAAM,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG;AAC9B;;AAEA,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;AAC1B,GAAG,CAAC;AACJ;;AAEA,SAAS,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE;AACtC,EAAE,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK;AAC3B;;AAEA,SAAS,MAAM;AACf,EAAE,OAAO;AACT,EAAE,IAAI;AACN,EAAE;AACF,IAAI,cAAc,GAAG,MAAM,CAAC,cAAc;AAC1C,IAAI,YAAY,GAAG,MAAM,CAAC;AAC1B,GAAG,GAAG;AACN,EAAE;AACF,EAAE,MAAM,YAAY,GAAG,EAAE;;AAEzB,EAAE,IAAI,cAAc,EAAE,YAAY,CAAC,IAAI,CAAC,gBAAgB,CAAC;AACzD,EAAE,IAAI,YAAY,EAAE,YAAY,CAAC,IAAI,CAAC,cAAc,CAAC;;AAErD,EAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK;AACjC,IAAI,MAAM,EAAE,GAAG,EAAE,GAAG,MAAM;;AAE1B,IAAI,MAAM,IAAI,GAAG;AACjB,MAAM,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;AACrB,MAAM,QAAQ,EAAE;AAChB,KAAK;;AAEL,IAAI,IAAI,YAAY,CAAC,MAAM,EAAE;AAC7B,MAAM,YAAY,CAAC,OAAO,CAAC,CAAC,WAAW,KAAK;AAC5C,QAAQ,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC;AACjC,OAAO,CAAC;AACR;;AAEA,IAAI,OAAO;AACX,GAAG;AACH;;AAEA,MAAM,IAAI,CAAC;AACX,EAAE,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,EAAE,EAAE,KAAK,EAAE;AACzC,IAAI,IAAI,CAAC,OAAO,GAAG,EAAE,GAAG,MAAM,EAAE,GAAG,OAAO,EAAE;;AAS5C,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;;AAEpD,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC;AACnC;;AAEA,EAAE,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE;AAC7B,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI;;AAErB,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,YAAY,SAAS,CAAC,EAAE;AAChD,MAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB;AAC1C;;AAEA,IAAI,IAAI,CAAC,QAAQ;AACjB,MAAM,KAAK;AACX,MAAM,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;AACjD,QAAQ,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK;AACjC,QAAQ,eAAe,EAAE,IAAI,CAAC,OAAO,CAAC;AACtC,OAAO,CAAC;AACR;;AAEA,EAAE,GAAG,CAAC,GAAG,EAAE;AACX,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;AACzB,MAAM;AACN;;AAEA,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;AACxB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;AAC1B;;AAEA,EAAE,MAAM,CAAC,SAAS,GAAG,oBAAoB,KAAK,EAAE;AAChD,IAAI,MAAM,OAAO,GAAG,EAAE;;AAEtB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AAC9D,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/B,MAAM,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE;AAC7B,QAAQ,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AACxB,QAAQ,CAAC,IAAI,CAAC;AACd,QAAQ,GAAG,IAAI,CAAC;;AAEhB,QAAQ,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;AACzB;AACA;;AAEA,IAAI,OAAO;AACX;;AAEA,EAAE,QAAQ,CAAC,GAAG,EAAE;AAChB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC;AAC7B,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC;AAC/B;;AAEA,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC;AAChB;;AAEA,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE;AACrC,IAAI,MAAM;AACV,MAAM,cAAc;AACpB,MAAM,YAAY;AAClB,MAAM,UAAU;AAChB,MAAM,MAAM;AACZ,MAAM;AACN,KAAK,GAAG,IAAI,CAAC,OAAO;;AAEpB,IAAI,IAAI,OAAO,GAAG,QAAQ,CAAC,KAAK;AAChC,QAAQ,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC9B,UAAU,IAAI,CAAC,iBAAiB,CAAC,KAAK;AACtC,UAAU,IAAI,CAAC,iBAAiB,CAAC,KAAK;AACtC,QAAQ,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;;AAElC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,eAAe,EAAE,CAAC;;AAE9C,IAAI,IAAI,UAAU,EAAE;AACpB,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;AAC1B;;AAEA,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,EAAE,EAAE;AACvC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;AACvC;;AAEA,IAAI,OAAO,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE;AACvC,MAAM,cAAc;AACpB,MAAM;AACN,KAAK;AACL;;AAEA,EAAE,iBAAiB,CAAC,KAAK,EAAE;AAC3B,IAAI,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC;AACxD,IAAI,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,QAAQ;AACrC,IAAI,MAAM,OAAO,GAAG,EAAE;;AAEtB;AACA,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK;AACtD,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;AAC5B,QAAQ;AACR;;AAEA,MAAM,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC;;AAEjE,MAAM,IAAI,OAAO,EAAE;AACnB,QAAQ,OAAO,CAAC,IAAI,CAAC;AACrB,UAAU,IAAI,EAAE,IAAI;AACpB,UAAU,GAAG;AACb,UAAU,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE;AACzD,SAAS,CAAC;AACV;AACA,KAAK,CAAC;;AAEN,IAAI,OAAO;AACX;;AAEA,EAAE,cAAc,CAAC,KAAK,EAAE;;AAExB,IAAI,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC;;AAEjD,IAAI,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK;AAC1C,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;AAC1B,QAAQ,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI;;AAExC,QAAQ,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC;AAC1C,UAAU,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC;AACxC,UAAU,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,IAAI,EAAE,KAAK,CAAC;AAClE,UAAU;AACV,SAAS,CAAC;;AAEV,QAAQ,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,EAAE;AACvC,UAAU,OAAO;AACjB,YAAY;AACZ,cAAc,GAAG;AACjB,cAAc,IAAI;AAClB,cAAc;AACd;AACA;AACA;;AAEA,QAAQ,OAAO;AACf;;AAEA,MAAM,MAAM,GAAG,GAAG,EAAE;AACpB,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AACnE,QAAQ,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AACtC,QAAQ,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC;AACjD,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE;AAC3B,UAAU,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AAC7B,SAAS,MAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,eAAe,CAAC,GAAG,EAAE;AAC1D,UAAU,OAAO;AACjB;AACA;AACA,MAAM,OAAO;AACb,KAAK;;AAEL,IAAI,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO;AACzC,IAAI,MAAM,SAAS,GAAG,EAAE;AACxB,IAAI,MAAM,OAAO,GAAG,EAAE;;AAEtB,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK;AAC7C,MAAM,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;AAC3B,QAAQ,IAAI,UAAU,GAAG,QAAQ,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,CAAC;;AAExD,QAAQ,IAAI,UAAU,CAAC,MAAM,EAAE;AAC/B;AACA,UAAU,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;AAC/B,YAAY,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE;AACvD,YAAY,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;AACxC;AACA,UAAU,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK;AAC9C,YAAY,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;AACnD,WAAW,CAAC;AACZ;AACA;AACA,KAAK,CAAC;;AAEN,IAAI,OAAO;AACX;;AAEA,EAAE,iBAAiB,CAAC,KAAK,EAAE;AAC3B,IAAI,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC;AACxD,IAAI,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,QAAQ;AAC3C,IAAI,MAAM,OAAO,GAAG,EAAE;;AAEtB;AACA,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK;AAC7C,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;AAC5B,QAAQ;AACR;;AAEA,MAAM,IAAI,OAAO,GAAG,EAAE;;AAEtB;AACA,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,QAAQ,KAAK;AACtC,QAAQ,OAAO,CAAC,IAAI;AACpB,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC;AAC/B,YAAY,GAAG;AACf,YAAY,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC;AACjC,YAAY;AACZ,WAAW;AACX,SAAS;AACT,OAAO,CAAC;;AAER,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE;AAC1B,QAAQ,OAAO,CAAC,IAAI,CAAC;AACrB,UAAU,GAAG;AACb,UAAU,IAAI;AACd,UAAU;AACV,SAAS,CAAC;AACV;AACA,KAAK,CAAC;;AAEN,IAAI,OAAO;AACX;AACA,EAAE,YAAY,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE;AACzC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;AAC3B,MAAM,OAAO;AACb;;AAEA,IAAI,IAAI,OAAO,GAAG,EAAE;;AAEpB,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;AACxB,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK;AACtD,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;AAC9B,UAAU;AACV;;AAEA,QAAQ,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC;;AAEnE,QAAQ,IAAI,OAAO,EAAE;AACrB,UAAU,OAAO,CAAC,IAAI,CAAC;AACvB,YAAY,KAAK;AACjB,YAAY,GAAG;AACf,YAAY,KAAK,EAAE,IAAI;AACvB,YAAY,GAAG;AACf,YAAY,IAAI;AAChB,YAAY;AACZ,WAAW,CAAC;AACZ;AACA,OAAO,CAAC;AACR,KAAK,MAAM;AACX,MAAM,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,KAAK;;AAExC,MAAM,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC;;AAEjE,MAAM,IAAI,OAAO,EAAE;AACnB,QAAQ,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAChE;AACA;;AAEA,IAAI,OAAO;AACX;AACA;;AAEA,IAAI,CAAC,OAAO,GAAG,OAAO;AACtB,IAAI,CAAC,WAAW,GAAG,WAAW;AAC9B,IAAI,CAAC,UAAU,GAAG,UAAU;AAC5B,IAAI,CAAC,MAAM,GAAG,MAAM;;AAEpB;AACA,EAAE,IAAI,CAAC,UAAU,GAAG,KAAK;AACzB;;AAEA;AACA,EAAE,QAAQ,CAAC,cAAc,CAAC;AAC1B;;AC/uDA;;;AAGG;AAKH;AACA,IAAI,SAAS,GAOF,IAAI;AAEf;;;;;;;AAOG;AACH,SAAS,eAAe,CACtB,KAAoB,EACpB,SAAiB,EAAA;;AAGjB,IAAA,IACE,SAAS;QACT,SAAS,CAAC,KAAK,KAAK,KAAK;AACzB,QAAA,SAAS,CAAC,SAAS,KAAK,SAAS,EACjC;QACA,OAAO,SAAS,CAAC,IAAI;;;AAIvB,IAAA,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE;AAC3B,QAAA,IAAI,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC;AACvB,QAAA,SAAS,EAAE,SAAS;AACpB,QAAA,YAAY,EAAE,IAAI;AAClB,QAAA,cAAc,EAAE,IAAI;AACpB,QAAA,cAAc,EAAE,IAAI;AACrB,KAAA,CAAC;;IAGF,SAAS,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE;AAEtC,IAAA,OAAO,IAAI;AACb;AAEA;;;;;;;;;;;;AAYG;AACG,SAAU,WAAW,CACzB,YAA2B,EAC3B,KAAa,EACb,YAAoB,GAAG,EAAA;IAEvB,IAAI,CAAC,KAAK,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE;AACnC,QAAA,OAAO,YAAY,EAAE,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;;IAGjD,MAAM,IAAI,GAAG,eAAe,CAAC,YAAY,EAAE,SAAS,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;;AAGlC,IAAA,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AAC9C;;ACjFA;;;AAGG;AAaH;;AAEG;AACH,MAAM,eAAe,GAA2B;AAC9C,IAAA,UAAU,EAAE,QAAQ;AACpB,IACA,aAAa,EAAE,CAAC;CACjB;AAED;;;;;;;;;;;;;;AAcG;AACa,SAAA,MAAM,CACpB,YAA2B,EAC3B,OAAsB,EAAA;IAEtB,MAAM,EACJ,KAAK,EACL,UAAU,GAAG,eAAe,CAAC,UAAwB,EACrD,UAAU,EAAE,aAAa,EACzB,aAAa,GAAG,eAAe,CAAC,aAAuB,EACvD,cAAc,EAAE,iBAAiB,GAClC,GAAG,OAAO;;AAGX,IAAA,MAAM,UAAU,GAAG,eAAe,CAAC,aAAa,CAAC;AACjD,IAAA,MAAM,cAAc,GAAG,mBAAmB,CAAC,iBAAiB,CAAC;;IAG7D,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,aAAa,EAAE;AAC1C,QAAA,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAChD,QAAA,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,UAAU;QAC5C,OAAO;YACL,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC;YAChC,KAAK,EAAE,MAAM,CAAC,MAAM;YACpB,SAAS;SACV;;;AAIH,IAAA,IAAI,WAAqB;IAEzB,QAAQ,UAAU;AAChB,QAAA,KAAK,QAAQ;AACX,YAAA,WAAW,GAAG,YAAY,CAAC,YAAY,EAAE,KAAK,CAAC;YAC/C;AACF,QAAA,KAAK,OAAO;AACV,YAAA,WAAW,GAAG,WAAW,CAAC,YAAY,EAAE,KAAK,CAAC;YAC9C;AACF,QAAA,KAAK,OAAO;;YAEV,WAAW,GAAG,WAAW,CAAC,YAAY,EAAE,KAAK,EAAE,cAAc,CAAC;YAC9D;AACF,QAAA;AACE,YAAA,WAAW,GAAG,YAAY,CAAC,YAAY,EAAE,KAAK,CAAC;;;AAInD,IAAA,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM;AAChC,IAAA,MAAM,SAAS,GAAG,KAAK,GAAG,UAAU;AACpC,IAAA,MAAM,UAAU,GAAG,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,WAAW;IAE7E,OAAO;AACL,QAAA,GAAG,EAAE,UAAU;QACf,KAAK;QACL,SAAS;KACV;AACH;AAEA;;;;;;;AAOG;SACa,eAAe,CAC7B,SAAiB,EACjB,UAAsB,EACtB,eAAuB,EAAA;;AAGvB,IAAA,IAAI,UAAU,KAAK,OAAO,EAAE;AAC1B,QAAA,OAAO,IAAI;;;IAIb,OAAO,SAAS,GAAG,eAAe;AACpC;AAEA;;;;AAIG;SACa,iBAAiB,GAAA;AAC/B,IAAA,OAAO,OAAO,MAAM,KAAK,WAAW;AACtC;AAEA;;;;;;AAMG;AACG,SAAU,sBAAsB,CAAC,aAAyB,EAAA;IAC9D,IAAI,aAAa,KAAK,OAAO,IAAI,CAAC,iBAAiB,EAAE,EAAE;AACrD,QAAA,OAAO,CAAC,IAAI,CACV,mEAAmE,CACpE;AACD,QAAA,OAAO,OAAO;;AAEhB,IAAA,OAAO,aAAa;AACtB;;AC/IA;;;AAGG;AA8BH;;;AAGG;MACU,kBAAkB,CAAA;AAa7B;;;AAGG;AACH,IAAA,WAAA,CAAoB,SAAkB,EAAA;AAAlB,QAAA,IAAS,CAAA,SAAA,GAAT,SAAS;AAhBrB,QAAA,IAAM,CAAA,MAAA,GAAkB,IAAI;AAC5B,QAAA,IAAA,CAAA,eAAe,GAAiC,IAAI,GAAG,EAAE;AACzD,QAAA,IAAc,CAAA,cAAA,GAAW,CAAC;AAC1B,QAAA,IAAa,CAAA,aAAA,GAAY,KAAK;AAC9B,QAAA,IAAW,CAAA,WAAA,GAAyB,IAAI;;AAGxC,QAAA,IAAc,CAAA,cAAA,GAAY,KAAK;;AAWvC;;;AAGG;AACI,IAAA,OAAO,WAAW,GAAA;AACvB,QAAA,OAAO,OAAO,MAAM,KAAK,WAAW;;AAGtC;;;AAGG;IACK,iBAAiB,GAAA;QACvB,OAAO,CAAA,IAAA,EAAO,EAAE,IAAI,CAAC,cAAc,CAAI,CAAA,EAAA,IAAI,CAAC,GAAG,EAAE,CAAA,CAAE;;AAGrD;;;;;AAKG;IACK,YAAY,GAAA;AAClB,QAAA,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,EAAE;AACrC,YAAA,OAAO,CAAC,IAAI,CAAC,oDAAoD,CAAC;AAClE,YAAA,IAAI,CAAC,UAAU,IAAI;AACnB,YAAA,OAAO,IAAI;;AAGb,QAAA,IAAI;AACF,YAAA,IAAI,IAAI,CAAC,SAAS,EAAE;AAClB,gBAAA,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;;;;AAKvD,YAAA,OAAO,CAAC,IAAI,CACV,gEAAgE,CACjE;AACD,YAAA,IAAI,CAAC,UAAU,IAAI;AACnB,YAAA,OAAO,IAAI;;QACX,OAAO,KAAK,EAAE;AACd,YAAA,OAAO,CAAC,KAAK,CAAC,8BAA8B,EAAE,KAAK,CAAC;AACpD,YAAA,IAAI,CAAC,UAAU,IAAI;AACnB,YAAA,OAAO,IAAI;;;AAIf;;AAEG;IACK,mBAAmB,GAAA;QACzB,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE;QAElB,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,KAAmC,KAAI;YAC9D,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,IAAI;YAE/C,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC;YACnD,IAAI,CAAC,OAAO,EAAE;AACZ,gBAAA,OAAO,CAAC,IAAI,CAAC,0CAA0C,SAAS,CAAA,CAAE,CAAC;gBACnE;;AAGF,YAAA,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC;AAEtC,YAAA,IAAI,IAAI,KAAK,OAAO,EAAE;gBACpB,OAAO,CAAC,MAAM,CACZ,IAAI,KAAK,CAEL,OAMD,CAAC,KAAK,CACR,CACF;;iBACI;AACL,gBAAA,OAAO,CAAC,OAAO,CAAC,OAAuB,CAAC;;AAE5C,SAAC;QAED,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,KAAiB,KAAI;AAC1C,YAAA,OAAO,CAAC,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC;;AAErC,YAAA,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,IAAG;gBACrC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;AAC3C,aAAC,CAAC;AACF,YAAA,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE;AAC9B,SAAC;;AAGH;;;;AAIG;AACK,IAAA,WAAW,CAAC,OAAsB,EAAA;QACxC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,KAAI;AACrC,YAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,gBAAA,MAAM,CAAC,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;gBAC3C;;AAGF,YAAA,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAChE,YAAA,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC;AAClC,SAAC,CAAC;;AAGJ;;;;AAIG;IACI,MAAM,IAAI,CAAC,KAAgB,EAAA;;AAEhC,QAAA,IAAI,IAAI,CAAC,WAAW,EAAE;YACpB,MAAM,IAAI,CAAC,WAAW;;;QAIxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACrC,MAAM,IAAI,CAAC,WAAW;;IAGhB,MAAM,MAAM,CAAC,KAAgB,EAAA;;AAEnC,QAAA,IAAI,IAAI,CAAC,cAAc,EAAE;YACvB;;;AAIF,QAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,YAAA,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE;AACjC,YAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;;AAEhB,gBAAA,IAAI,CAAC,cAAc,GAAG,IAAI;AAC1B,gBAAA,IAAI,CAAC,UAAU,IAAI;gBACnB;;YAEF,IAAI,CAAC,mBAAmB,EAAE;;AAG5B,QAAA,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,EAAE;AAE1C,QAAA,IAAI;YACF,MAAM,IAAI,CAAC,WAAW,CAAC;AACrB,gBAAA,IAAI,EAAE,MAAM;gBACZ,SAAS;gBACT,OAAO,EAAE,EAAE,KAAK,EAAE;AACnB,aAAA,CAAC;AACF,YAAA,IAAI,CAAC,aAAa,GAAG,IAAI;;AACzB,QAAA,MAAM;;AAEN,YAAA,IAAI,CAAC,cAAc,GAAG,IAAI;AAC1B,YAAA,IAAI,CAAC,UAAU,IAAI;YACnB,IAAI,CAAC,SAAS,EAAE;;;AAIpB;;;;;;;AAOG;AACI,IAAA,MAAM,MAAM,CACjB,KAAa,EACb,UAAA,GAAyB,QAAQ,EACjC,UAAqB,GAAA,mBAAmB,EACxC,cAAA,GAAyB,uBAAuB,EAAA;QAEhD,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AACvC,YAAA,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC;;AAG/D,QAAA,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,EAAE;QAE1C,OAAO,IAAI,CAAC,WAAW,CAAC;AACtB,YAAA,IAAI,EAAE,QAAQ;YACd,SAAS;AACT,YAAA,OAAO,EAAE;gBACP,KAAK;gBACL,UAAU;AACV,gBAAA,UAAU,EAAE,eAAe,CAAC,UAAU,CAAC;AACvC,gBAAA,cAAc,EAAE,mBAAmB,CAAC,cAAc,CAAC;AACpD,aAAA;AACF,SAAA,CAAC;;AAGJ;;AAEG;IACI,aAAa,GAAA;AAClB,QAAA,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,IAAG;YACrC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;AAChD,SAAC,CAAC;AACF,QAAA,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE;;AAG9B;;AAEG;IACI,SAAS,GAAA;QACd,IAAI,CAAC,aAAa,EAAE;AACpB,QAAA,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE;AACxB,QAAA,IAAI,CAAC,MAAM,GAAG,IAAI;AAClB,QAAA,IAAI,CAAC,aAAa,GAAG,KAAK;AAC1B,QAAA,IAAI,CAAC,WAAW,GAAG,IAAI;;;AAIzB;;;AAGG;AACH,IAAA,IAAW,OAAO,GAAA;QAChB,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;;AAGnD;;;AAGG;AACH,IAAA,IAAW,cAAc,GAAA;QACvB,OAAO,IAAI,CAAC,cAAc;;AAE7B;;AC9RD;;;AAGG;AAEH;;;AAGG;AACH,MAAM,8BAA8B,GAA2B;AAC7D,IAAA,EAAE,EAAE,2DAA2D;AAC/D,IAAA,EAAE,EAAE,kEAAkE;AACtE,IAAA,EAAE,EAAE,uEAAuE;AAC3E,IAAA,EAAE,EAAE,8DAA8D;AAClE,IAAA,EAAE,EAAE,mEAAmE;AACvE,IAAA,EAAE,EAAE,kEAAkE;AACtE,IAAA,EAAE,EAAE,8DAA8D;AAClE,IAAA,EAAE,EAAE,0DAA0D;AAC9D,IAAA,EAAE,EAAE,8CAA8C;AAClD,IAAA,EAAE,EAAE,gCAAgC;AACpC,IAAA,EAAE,EAAE,0CAA0C;CAC/C;AAED;;;;;AAKG;SACa,gBAAgB,GAAA;AAC9B,IAAA,IAAI,OAAO,SAAS,KAAK,WAAW,EAAE;AACpC,QAAA,OAAO,IAAI;;;AAIb,IAAA,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,IAAI,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,IAAI;;AAGvE,IAAA,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE;AAC7C;AAEA;;;;;;;;;;;;AAYG;AACG,SAAU,uBAAuB,CAAC,MAAe,EAAA;IACrD,MAAM,YAAY,GAAG;AACnB,UAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW;UAChC,gBAAgB,EAAE;AACtB,IAAA,QACE,8BAA8B,CAAC,YAAY,CAAC;QAC5C,8BAA8B,CAAC,EAAE;AAErC;AAEA;;;;;;;;;;AAUG;SACa,sBAAsB,CACpC,QAAgB,EAChB,KAAa,EACb,KAAa,EAAA;AAEb,IAAA,OAAO;AACJ,SAAA,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC;SACjC,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;AACvC;;;;","x_google_ignoreList":[5]}